• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.5
• /
• pp.78-87
• /
• 1999

3차원 물체 인식은 학습에 의해서 구성된 모델베이스를 이용하여 주어진 입력 영상에 존재하는 한 개 혹은 여러 개의 물체를 구별하는 과정이다. 본 논문에서는 입력 거리 정보를 받아들여 이 정보로부터 보이는 각 면에 대한 특징을 추출해낸 후 이 특징들을 입력 영상에 존재하는 물체를 묘사하는 특징으로 사용하여 이로부터 모델을 결정하는 방법을 제시한다. 영상 분할된 입력 물체는 그래프로 표현되는데, 물체 인식은 입력 물체의 그래프를 모델 베이스의 각 모델의 그래프와 정합하는 고정에서 얻어진다. 제한 조건은 만족시키는 정합을 수행하기 위하여 mean field annealing (MFA) 신경 회로망을 사용하였으며 가려진 물체 인식을 수행할 수 있는 정합을 위해 에너지 함수를 제안하였다. 제안한 알고리듬의 효용성을 입증하기 위하여 가려짐의 정도를 다르게 한 합성영상에 대해서 모의 실험을 하였다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.24 no.3
• /
• pp.286-291
• /
• 2013

In this paper, a compact rectenna system is designed using a circular sector antenna with harmonic-rejecting characteristics and a direct impedance matching method. The system is designed with bandpass filtering performed by the harmonic-rejection of the circular sector antenna and without impedance matching circuit for the diodes by the direct impedance matching technique. Therefore, while the rectifying circuit of the proposed system can be implemented without a bandpass filter and a impedance matching circuit, it is integrated on the back side of the antenna using precise fabrication techniques for coaxial feedings without degrading the system performances corresponding to the feeding points. From the experimental results, the optimized rectenna system has presented excellent performances of a conversion efficiency of more than 52 % and a conversion voltages of more than 1.5 V at 2.5 GHz.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.4
• /
• pp.602-607
• /
• 2006

In this paper, the distributed network synthesis, which is useful to the design of wireless power amplifiers, is proposed, and a RF power amplifier is designed using the technique. The transfer function of distributed matching circuits is derived by Chebyshev approximation, and network element values for a specified topology are given as a function of minimum insertion losses and ripples. As an example, after a power transistor is modeled by load-pull data, the synthesis for distributed matching networks is applied to a power amplifier design, which has the electrical performance of 17dB gain and less IM3 than -43dBc at the 20W output power between 800 to 900MHz frequency range. Experimental results from a fabricated amplifier are shown to approach the design performance in the operating frequency range. The design of impedance matching networks by the transfer function synthesis is a useful method for the design of RF power amplifiers.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.12
• /
• pp.41-45
• /
• 2015

In this paper, the single port dual-band resonator for magnetic resonance wireless power transfer is proposed. The proposed dual-band resonator is consists of 20 turns spiral coil, a single loop, matching circuit, lumped elements, and a single port. The two sides of the matching circuit are connected to via holes. The spiral coil is operated at MF-band and single loop is operated at HF-band, respectively. We use two of the same structure resonators and simulated and the power transfer efficiency was calculated. The efficiency of simulation and measurement is above 60% at the MF and HF bands, and the distance is 100 mm.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.3
• /
• pp.32-40
• /
• 1999

In this paper, we present a fast block matching motion estimation algorithm based on successive elimination algorithm (SEA). Based on the characteristic of center-biased motion vector distribution in the search area, the proposed method improves the performance of the SEA with a reduced the number of the search positions in the search area, In addition, to reduce the computational load, this method is combined with both the reduced bits mean absolute difference (RBMAD) matching criterion which can be reduced the computation complexity of pixel comparison in the block matching and pixel decimation technique which reduce the number of pixels used in block matching. Simulation results show that the proposed method provides better performance than existing fast algorithms and similar to full-search block motion estimation algorithm.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.12
• /
• pp.176-183
• /
• 2013

We propose a rolled fingerprint merging algorithm that effectively merges plain fingerprints in consecutive frame units that are fed through rolling and detects more fingerprint minutiae in order to increase the fingerprint recognition rate. The proposed rolled fingerprint merging algorithm uses a adaptive projection mask; it contains a detector that separates plain fingerprints from the background and a projection mask generator that sequentially projects the detect ed images. In addition, in the merging unit, the pyramid-shaped projection method is used to detect merged rolled fingerprints from the generated variable projective mask, starting from the main images. Simulations show that the extracted minutia e are 46.79% more than those from plain fingerprints, and the proposed algorithm exhibits excellent performance by detecting 52.0% more good fingerprint minutiae that are needed for matching.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.4
• /
• pp.389-394
• /
• 2002

In this paper, we propose a robust stereo matching algorithm using nonlinear extended Kalman filter. The proposed algorithm estimates disparity using nonlinear extended Kalman filter and compares left image to right image for obtained disparity. As this process is run iteratively, we get disparity only with a few search. And, we can get robust stereo matching results by comparing left image to right image using bilinear interpolation to consider influence of neighborhood pixel. We compared SSD algorithm which is widely used, in stereo matching method, to result of the proposed algorithm. As the result, the proposed algorithm has an outstanding matching performance.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.4
• /
• pp.54-64
• /
• 1999

This paper proposes an efficient handwritten English word recognition scheme which can be applied practical applications. To effectively use the lexicon which is available in most handwriting related applications, the lexicon entries are introduced in the early stage of the recognition. Dynamic programming is used for matching between over-segmented character segments and letters in the lexicon entries. Character segmentation statistics which can be obtained while the training is being performed are used to adjust the matching window size. Also, the matching results between the character segments and the letters in the lexicon entries are cached to avoid repeat of the same computation. In order to verify the effectiveness of the proposed methods, several experiments were performed using thousands of word images with various writing styles. The results show that the proposed methods significantly improve the matching speed as well as the accuracy.

• Journal of Broadcast Engineering
• /
• v.20 no.4
• /
• pp.641-644
• /
• 2015

In this paper, we propose a precise frame-level near-duplicate video matching algorithm. First, a binary frame descriptor for near-duplicate video matching is proposed. The binary frame descriptor divides a frame into patches and represent the relations between patches in bits. Seconds, we formulate a cost function for the matching, composed of matching costs and compensatory costs. Then, we roughly determine initial matchings and refine the matchings iteratively to minimize the cost function. Experimental results demonstrate that the proposed algorithm provides efficient performance for frame-level near duplicate video matching.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.2
• /
• pp.73-78
• /
• 2004

By modeling the block matching algorithm as a function of the correlation of image blocks, we derive search patterns for fast block matching motion estimation. The proposed approach provides an analytical support lot the diamond-shape search pattern, which is widely used in fast block matching algorithms. We also propose a new fast motion estimation algorithm using adaptive search patterns and statistical properties of the object displacement. In order to select an appropriate search pattern, we exploit the relationship between the motion vector and the block differences. By changing the search pattern adaptively, we improve motion prediction accuracy while reducing required computational complexity compared to other fast block matching algorithms.