• Proceedings of the Korea Electromagnetic Engineering Society Conference
• /
• 2000.11a
• /
• pp.328-332
• /
• 2000

본 논문에서는 기생 패치 구조와 적층 구조의 광대역 마이크로스트립 안테나에 평행 결합 선로 형태의 광대역 임피던스 정합 회로를 결합하여 쉽게 추가적인 임피던스 대역폭 개선을 얻을 수 있음을 제안하였다. 평행 결합 선로 형태의 광대역 임피던스 정합 회로 설계를 위하여 분포 회로 방식의 반복적인 방법을 제시하였고. 설계\ulcorner제작 결과 기생 패치 구조와 적층 구조에서 각각 56.23%와 16.45%의 추가적인 임피던스 대역폭 개선을 이룰 수 있었다. 그리고 방사 패턴과 측정된 이득을 보면 평행 결합 선로의 결합으로 인한 방사 패턴에서의 큰 변화는 보이지 않았고, 이득에서는 평행 결합 선로 부분의 커플링 손실로 인해 최대 이득이 약 1 dB 정도 감소하는 것을 확인할 수 있었다.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2231-2233
• /
• 1998

본 논문은 손등의 정맥패턴을 이용한 개인식별을 위해 개발된 3가지의 알고리즘에 관해 각각의 성능을 비교한 결과를 제시한다. 세가지 방법은 각각 Unsharp Masking을 이용한 이치화 후 정맥과 손등 배경의 면적을 이용한 가중치를 적용한 원형정합 알고리즘[1]과 Kolmogorov Smirnov(KS) statistic[2]을 이용한 매칭 알고리즘을 개선한 방식, 그리고 정맥의 세선화 처리 후 분기점의 좌표, 정맥의 길이, 정맥 가지 사이의 분기각도 등의 특징벡터를 이용한 방법 등이다. 본 연구에서는 전처리 과정에 있어서, 원시영상의 혈관부위와 배경부위의 gray scale 분포가 겹친 상태에서 Unsharp Masking 필터링을 적용한 결과가 기타 다른 전처리 방식보다 우수하게 영상을 강화시킬 수 있음을 확인하였고, 가중치를 이용한 매칭방식이 다른 매칭방식보다 우수함을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.886-888
• /
• 2004

본 논문에서는 현재 프레임 블록의 인접 블록으로부터 예측된 움직임 정보를 구하여, 이를 탐색 원점으로 하여 한 방향으로 진행하는 수정된 다이아몬드 지역 레이더 패턴으로 블록정합을 수행하는 수정된 다이아몬드 지역탐색 알고리즘을 제안한다. 실험 결과 제안된 방식은 기존의 방식들에 비해 PSNR 간에 있어서 평균적으로 0.02~0.37(㏈) 개선되고 속도면에서 우수한 결과를 나타내었다. 또한 기존의 다이아몬드 지역탐색 알고리즘보다 탐색 속도면에서 14~24%의 성능향상을 보이면서 화질면에서는 거의 근접하게 나타났다. 제안된 방식은 정량적인 결과뿐만 아니라 부호화후 복호화한 영상의 화질에 있어서도 다른 고속 탐색 알고리즘보다 월등히 우수한 화질을 제공한다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.4
• /
• pp.16-22
• /
• 2012

In this paper, we present spiral pattern which suits for optical simulator to calibrate fisheye lens and compensate geometric distortion. Using spiral pattern, we present calibration without mathematical modeling in advance. Proposed spiral pattern used to input image of optical simulator. Using fisheye lens image, we calibrate a fisheye lens by matching geometrically moved dots to corresponding original dots which leads not to need mathematical modeling. Proposed algorithm calibrates using dot matching which matches spiral pattern image dot to distorted image dot. And this algorithm does not need modeling in advance so it is effective. Proposed algorithm is enabled at processing of pattern recognition which has to get the exact information using fisheye lens for digital zooming. And this makes possible at compensation of geometric distortion and calibration of fisheye lens image applying in various image processing.

• Journal of Korea Multimedia Society
• /
• v.3 no.4
• /
• pp.372-379
• /
• 2000

In this paper, we propose a fast variable-size block matching algorithm for motion estimation based on bit-pattern. Motion estimation in the proposed algorithm is performed after the representation of image sequence is transformed 8bit pixel values into 1bit ones depending on the mean value of search block, which brings a short searching time by reducing the computational complexity. Moreover, adaptive searching methods according to the motion information of the block make the procedure of motion estimation efficient by eliminating an unnecessary searching of low motion block and deepening a searching procedure in high motion block. Experimental results show that the proposed algorithm provides better performance-0.5dB PSNR improvement-than full search block matching algorithm with a fixed block size.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.11
• /
• pp.28-33
• /
• 2002

In this paper, the impedance-tuned monopole microstrip antenna designed for PCS is analyzed using finite difference time domain(FDTD) method. The perfectly matched layer(PML) absorbing material condition proposed by Berenger is used for the truncation of finite difference time domain lattice. A Gaussian pulse is selected as an excitation signal and a resistive voltage source model is used to reduce the error caused by the reflection waves. The FDTD method is inherently a near field technique. Therefore, the near field to far field transformation is need to compute far field antenna parameters such as radiation patterns and gain. The near field to far field transformation can be done both in the time domain and the frequency domain. We use the frequency domain transformation to compute the far field radiation patterns at single frequency. All the numerical results obtained by the FDTD method are compared with simulation results using the HFSS software. Good agreements are obtained in all cases.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.5
• /
• pp.892-898
• /
• 2012

Rough classification methods are used to improving the recognition speed in many character recognition problems. In this case, some irreversible result can occur by an error in rough classification. Methods for duplicating each model in several classes are used in order to reduce this risk. But the errors by rough classfication can not be completely ruled out by these methods. In this paper, an recognition method is proposed to increase speed that matches models selectively without any increase in error. This method constructs a model graph using similarity between models. Then a search process begins from a particular point in the model graph. In this process, matching of unnecessary models are reduced that are not similar to the input pattern. In this paper, the proposed method is applied to the recognition problem of handwriting numbers and upper/lower cases of English alphabets. In the experiments, the proposed method was compared with the basic method that matches all models with input pattern. As a result, the same recognition rate, which has shown as the basic method, was obtained by controlling the out-degree of the model graph and the number of maintaining candidates during the search process thereby being increased the recognition speed to 2.45 times.

• The Journal of the Korea Contents Association
• /
• v.3 no.2
• /
• pp.11-18
• /
• 2003

In this paper, we propose a fast variable block matching algorithm for motion estimation based on bit-patterns. Motion estimation in the proposed algorithm is peformed after the representation of image sequence is transformed 8-bit pixel values into 1-bit ones by the mean pixel value of search block, which brings a short searching time by reducing the computational complexity. Moreover, adaptive searching methods according to the motion information of the block make the procedure of motion estimation efficient by eliminating unnecessary searching processes of low motion block and deepening a searching procedure in high motion block. Experimental results show that the proposed algorithm provides bettor performance - average 0.5dB PSNR improvement and about 99% savings in the number of operations - than full search Hock matching algorithm with a fixed block size.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.11
• /
• pp.1686-1696
• /
• 2022

The impedance matching circuit design technique based on the phasor plot introduced in this paper is based on the impedance triangle of electric circuit. It is a technique that designs through the construction of a phasor figure using the values given to the matching circuit design. The design pattern is based on L-type, inverted L-type, T-type, and 𝜋-type, and unknown reactance elements are determined through phasor shapes. In this paper, using a design by phasor plot, we design several cases, such as the case where the input and output ports are pure resistance and have reactance. It was confirmed that the design value was verified by serial-parallel equivalent conversion to achieve matching. This design technique can immediately grasp the phase or size of input/output power, so it is expected to be applied mainly in a low frequency band due to rapid design change and application.

• Journal of Korea Multimedia Society
• /
• v.16 no.8
• /
• pp.927-933
• /
• 2013

Face detection algorithm of OpenCV recognizes the faces by Haar matching between input image and Haar features which are learned through a set of training images consisting of many front faces. Therefore the face detection method by Haar matching yields a high face detection rate for the front faces but not in the case of the pan and deformed faces. On the assumption that distributional characteristics of color histogram is similar even if deformed or side faces, a face detection method using the histogram pattern matching is proposed in this paper. In the case of the missed detection and false detection caused by Haar matching, the proposed face detection algorithm applies the histogram pattern matching with the correct detected face area of the previous frame so that the face region with the most similar histogram distribution is determined. The experiment for evaluating the face detection performance reveals that the face detection rate was enhanced about 8% than the conventional method.