• 제목/요약/키워드: Matching Condition

검색결과 447건 처리시간 0.03초

영상휘도 함수의 온 라인 스테레오 매칭을 이용한 고속 3차원 거리 추정 알고리즘 (A Fast 3D Depth Estimation Algorithm Using On-line Stereo Matching of Intensity Functionals)

  • 권호열;변증남;서일홍
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1989년도 추계학술대회 논문집 학회본부
    • /
    • pp.484-487
    • /
    • 1989
  • A fast stereo algorithm for 3D depth estimation is presented. We propose an on-line stereo matching technique, by which the flows of stereo image signals are dynamically controlled to satisfy the matching condition of intensity functionals. The disparity is rapidly estimated from the control of. the signal flows and 3D depth is determined from the disparity.

  • PDF

Design Guidelines for a Capacitive Wireless Power Transfer System with Input/Output Matching Transformers

  • Choi, Sung-Jin
    • Journal of Electrical Engineering and Technology
    • /
    • 제11권6호
    • /
    • pp.1656-1663
    • /
    • 2016
  • A capacitive wireless power transfer (C-WPT) system uses an electric field to transmit power through a physical isolation barrier which forms a pair of ac link capacitors between the metal plates. However, the physical dimension and low dielectric constant of the interface medium severely limit the effective link capacitance to a level comparable to the main switch output capacitance of the transmitting circuit, which thus narrows the soft-switching range in the light load condition. Moreover, by fundamental limit analysis, it can be proved that such a low link capacitance increases operating frequency and capacitor voltage stress in the full load condition. In order to handle these problems, this paper investigates optimal design of double matching transformer networks for C-WPT. Using mathematical analysis with fundamental harmonic approximation, a design guideline is presented to avoid unnecessarily high frequency operation, to suppress the voltage stress on the link capacitors, and to achieve wide ZVS range even with low link capacitance. Simulation and hardware implementation are performed on a 5-W prototype system equipped with a 256-pF link capacitance and a 200-pF switch output capacitance. Results show that the proposed scheme ensures zero-voltage-switching from full load to 10% load, and the switching frequency and the link capacitor voltage stress are kept below 250 kHz and 452 V, respectively, in the full load condition.

백색 보조 띠 기반의 정밀 스테레오 정합 기법 (Precise Stereo Matching Technique Based on White Auxiliary Stripe)

  • 강한솔;고윤호
    • 한국멀티미디어학회논문지
    • /
    • 제22권12호
    • /
    • pp.1356-1367
    • /
    • 2019
  • This paper proposes a novel active stereo matching technique using white auxiliary stripe pattern. The conventional active stereo matching techniques that uses two cameras and an active source such as projector can accurately estimate disparity information even in the areas with low texture compared to the passive ones. However, it is difficult that the conventional active stereo matching techniques using color code patterns acquire these patterns robustly if the object is composed of various colors or is exposed to complex lighting condition. To overcome this problem, the proposed method uses an additional white auxiliary stripe pattern to get and localize the color code patterns robustly. This paper proposes a process based on adaptive thresholding and thinning to obtain the auxiliary pattern accurately. Experimental results show that the proposed method more precisely measures the stepped sample whose depth is known in advance than the conventional method.

입력 외란이 존재하는 비동기 순차 머신의 모델 매칭 (Model Matching of Asynchronous Sequential Machines with Input Disturbance)

  • 양정민
    • 전기학회논문지
    • /
    • 제57권1호
    • /
    • pp.109-116
    • /
    • 2008
  • Model matching problem of asynchronous sequential machines is addressed in this paper. The main topic is to design a corrective controller such that the closed-loop behavior of the asynchronous sequential machine can follow a given model, i.e., their models can be "matched" in stable states. In particular, we assume that the considered asynchronous machine suffers from the presence of an input disturbance that can cause undesirable state transitions. The proposed controller can realize both model matching and elimination of the adverse effect of the input disturbance. Necessary and sufficient condition for the existence of a corrective controller that solves model matching problem is presented. Whenever controller exists, algorithms for their design are outlined and demonstrated in a case study.

니켈-아연 페라이트 소결체와 복합체의 전파흡수특성 (The Characteristics of Electromagnetic Wave Absorption in Sintered and Composite Ni-Zn Ferrites)

  • 조성백;오재희
    • 한국세라믹학회지
    • /
    • 제32권1호
    • /
    • pp.25-30
    • /
    • 1995
  • The frequenc dependence of magnetic permeability($\mu$r) and dielectric constant($\varepsilon$r) in MHz-GHz frequency range and their relationships with microwave absorbing properties were investigated in sintered and composite Ni-Zn ferrites, respectively. It was confirmed that zero reflection condition was required the real parts of permeability and permittivity in sintered specimen, and the complex permeability, permittivity and dielectric loss tangent in composite specimen. The real part of permittivity varied with the replacement of nickel by manganese in sintered Ni-Zn ferrite. Therefore, we could control the matching frequency and matching thickness.

  • PDF

Stabilizing Unstable Matching because of a Varied Preference List in Distributed Stable Marriage Problem

  • Kinjo, Hideki;Nakamura, Morikazu;Onaga, Kenji
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 ITC-CSCC -2
    • /
    • pp.1033-1036
    • /
    • 2000
  • A distributed stable marriage problem in extended in this paper. The traditional approach related to the stable matching problem assume that preference lists are fixed. However, in decentralized version this assumption is not reasonable because of the autonomy of members. In this paper, we consider the situation that a preference list can be varied at some stable matching and show the condition to be broken the stability of the original matching. Moreover, we propose a stabilization algorithm to obtain a stable matching by execution with a minimal set of members.

  • PDF

네트워크 보안을 위한 강력한 문자열 매칭 알고리즘 (Robust Quick String Matching Algorithm for Network Security)

  • 이종욱;박찬길
    • 디지털산업정보학회논문지
    • /
    • 제9권4호
    • /
    • pp.135-141
    • /
    • 2013
  • String matching is one of the key algorithms in network security and many areas could be benefit from a faster string matching algorithm. Based on the most efficient string matching algorithm in sual applications, the Boyer-Moore (BM) algorithm, a novel algorithm called RQS is proposed. RQS utilizes an improved bad character heuristic to achieve bigger shift value area and an enhanced good suffix heuristic to dramatically improve the worst case performance. The two heuristics combined with a novel determinant condition to switch between them enable RQS achieve a higher performance than BM both under normal and worst case situation. The experimental results reveal that RQS appears efficient than BM many times in worst case, and the longer the pattern, the bigger the performance improvement. The performance of RQS is 7.57~36.34% higher than BM in English text searching, 16.26~26.18% higher than BM in uniformly random text searching, and 9.77% higher than BM in the real world Snort pattern set searching.

A Frame-Based Video Signature Method for Very Quick Video Identification and Location

  • Na, Sang-Il;Oh, Weon-Geun;Jeong, Dong-Seok
    • ETRI Journal
    • /
    • 제35권2호
    • /
    • pp.281-291
    • /
    • 2013
  • A video signature is a set of feature vectors that compactly represents and uniquely characterizes one video clip from another for fast matching. To find a short duplicated region, the video signature must be robust against common video modifications and have a high discriminability. The matching method must be fast and be successful at finding locations. In this paper, a frame-based video signature that uses the spatial information and a two-stage matching method is presented. The proposed method is pair-wise independent and is robust against common video modifications. The proposed two-stage matching method is fast and works very well in finding locations. In addition, the proposed matching structure and strategy can distinguish a case in which a part of the query video matches a part of the target video. The proposed method is verified using video modified by the VCE7 experimental conditions found in MPEG-7. The proposed video signature method achieves a robustness of 88.7% under an independence condition of 5 parts per million with over 1,000 clips being matched per second.

TMA의 운용과 주요 BPO 비즈니스 시나리오에 관한 연구 (A Study on the Transaction Matching Application and Major BPO Business Scenarios)

  • 채진익
    • 무역상무연구
    • /
    • 제65권
    • /
    • pp.117-139
    • /
    • 2015
  • The BPO is an irrevocable undertaking given by an obligor bank to a recipient bank to pay a specified amount under the condition of a successful electronic matching of data or acceptance of mismatches. The BPO enables the participating banks to provide sellers and buyers with enhanced financing services. Therefore, BPO gives banks the tools to provide them with guarantees and other multi-banking services. All the participating banks must use the same Transaction Matching Application(TMA) for BPO business. In order to exchange BPO-related data, banks must be subscribed to the same TMA scheme. Participation in the TMA scheme is limited to banks only. The TMA is matching and workflow application as instrument to determine whether to pay the BPO or not. Therefore, TMA will have an important role to play in the business of the BPO. So, This paper is to review the mechanism of a TMA and the major business scenarios in Banking Payment Obligation Transactions. In Particular, it has been included the exchange and matching of data messages, the disposal of discrepancies, document payment and others based on URBPO. This study will be based on documentary research including swift com and icc.org and so on.

  • PDF

다중 후보 매칭 퍼슛 (Multiple Candidate Matching Pursuit)

  • 권석법;심병효
    • 방송공학회논문지
    • /
    • 제17권6호
    • /
    • pp.954-963
    • /
    • 2012
  • Orthogonal matching pursuit (OMP) 알고리듬은 underdetermined 시스템에서 희소 신호를 복구하는 대표적인 greedy 알고리듬으로 많은 관심을 받고 있다. 본 논문에서는 OMP 알고리듬의 반복과정에서 후보 support 집합들을 구성하여 마지막 반복과정에서 최소 잔차를 이용하는 multiple candidate matching pursuit (MuCaMP) 기법을 제안한다. MuCaMP 가 완벽한 신호 복원을 보장하기 위한 restricted isometry property (RIP)를 이용한 충분조건, ${\delta}_{N+K}<\frac{\sqrt{N}}{\sqrt{K}+3\sqrt{N}}$을 제시한다. 실험을 통해 후보 support 집합들의 크기에 따른 성능과 MuCaMP의 복원 성능이 기존의 기법들에 비해 우수함을 확인하였다.