• ETRI Journal
• /
• v.33 no.3
• /
• pp.401-406
• /
• 2011

This paper presents a fast block-matching algorithm based on the normalized cross-correlation, where the elimination order is determined based on the gradient magnitudes of subblocks in the current macroblock. Multilevel Cauchy-Schwartz inequality is derived to skip unnecessary block-matching calculations in the proposed algorithm. Also, additional complexity reduction is achieved re-using the normalized cross correlation values for the spatially neighboring macroblock because the search areas of adjacent macroblocks are overlapped. Simulation results show that the proposed algorithm can improve the speed-up ratio up to about 3 times in comparison with the existing algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.92.3-92
• /
• 2002

A lot of localization algorithms have been developed in order to achieve autonomous navigation. However, most of localization algorithms are restricted to certain conditions. In this paper, Monte Carlo localization scheme with a map-matching algorithm is suggested as a robust localization method for the Public Service Robot to accomplish its tasks autonomously. Monte Carlo localization can be applied to local, global and kidnapping localization problems. A range image based measure function and a geometric pattern matching measure function are applied for map matching algorithm. This map matching method can be applied to both polygonal environments and un-polygonal environments and achieves...

• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1577-1584
• /
• 2007

Fingerprint verification is being adopted widely to provide positive identification with a high degree of confidence in all practical areas. This popular usage requires reliable methods for matching of these patterns. To meet the latest expectations, the paper presents a pair wise distance histogram method for fingerprint matching. Here, we introduced a randomized algorithm which exploits pair wise distances between the pairs of minutiae, as a basic feature for match. The method undergoes two steps for completion i.e. first it performs the matching locally then global matching parameters are calculated in second step. The proposed method is robust to common problems that fingerprint matching faces, such as scaling, rotation, translational changes and missing points etc. The paper includes the test of algorithm on various randomly generated minutiae and real fingerprints as well. The results of the tests resemble qualities and utility of method in related field.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.418-422
• /
• 2009

Generally, algorithms for generating disparity maps can be clssified into two categories: region-based method and feature-based method. The main focus of this research is to generate a disparity map with an accuracy depth information for 3-dimensional reconstructing. Basically, the region-based method and the feature-based method are simultaneously included in the proposed algorithm, so that the existing problems including false matching and occlusion can be effectively solved. As a region-based method, regions of false matching are extracted by the proposed MMAD(Modified Mean of Absolute Differences) algorithm which is a modification of the existing MAD(Mean of Absolute Differences) algorithm. As a feature-based method, the proposed method eliminates false matching errors by calculating the vector with SIFT and compensates the occluded regions by using a pair of adjacent SIFT matching points, so that the errors are reduced and the disparity map becomes more accurate.

• Journal of the Semiconductor & Display Technology
• /
• v.21 no.2
• /
• pp.32-37
• /
• 2022

As semiconductors become finer, equipment must perform precise and accurate processes to achieve the desired wafer fabrication requirement. Radio frequency power delivery system in plasma system plays a critical role to generate the plasma, and the role of impedance matching unit is critical to terminate the reflected radio frequency power by modifying the impedance of the matching network in the plasma equipment. Impedance matching unit contains one fixed inductor and two variable vacuum capacitors whose positions are controlled two step motors. Controlling the amount of vacuum variable capacitor should be made as soon as possible when the mismatched impedance is detected. In this paper, we present the impedance matching algorithm using the phase sensor.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.2
• /
• pp.455-461
• /
• 2011

In object tracking using the block mating algorithm, it is not proper to use a fixed matching block to track an object of which size may be various and can be changed at any time. This paper defines an adaptive matching block for the dynamic environment and proposes a block matching algorithm for it. The matching block is composed of a main-block of $10{\times}10$ pixels and 8 sub-blocks of $6{\times}6$ pixels in a wide area of $42{\times}42$ pixels, the main-block located its center is used as an object block, and the sub-blocks located its boundary are used as candidates for the object block. The proposed algorithm extracts the object blocks from the sub-blocks by using their motion vectors for 10 previous frames and performs the block matching with the main block and them. The experiments for perform estimation show that the proposed algorithm extracts just valid object blocks from the matching block and keeps an object having free movement in image center area.

• Journal of Advanced Marine Engineering and Technology
• /
• v.31 no.3
• /
• pp.293-300
• /
• 2007

The aim of this paper is to design a speed controller of a DC motor by selection of a PID parameters using genetic algorithm. The model of a DC motor is considered as a typical non-oscillatory, second-order system, And this paper compares three kinds of tuning methods of parameter for PID controller. One is the controller design by the genetic algorithm. second is the controller design by the model matching method third is the controller design by Ziegler and Nichols method. It was found that the proposed PID parameters adjustment by the genetic algorithm is better than the Ziegler & Nickels' method. And also found that the results of the method by the genetic algorithm is nearly same as the model matching method which is analytical method. The proposed method could be applied to the higher order system which is not easy to use the model matching method.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.1
• /
• pp.151-163
• /
• 1990

In this paper, rule-based stereo algorithm is explored to obtain three dimensional information of an object. In the preprocessing of the stereo matching, feature points of stereo images must be less sensitive to noise and well linked. For this purpose, a new feature points detection algorithm is developed. For performing the stereo matching which is most important process of the stereo algorithm, the feature representation of feature points is first described. The feature representation is then used for a rule-based stereo algorithm to determine the correspondence between the input stereo images. Finally, the three dimensional information of the object is determined from the correspondence of the feature points of right and left images.

• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.633-644
• /
• 2004

In this paper, we notice that the original NTSS algorithm can be proposed as the NTSS-3 Level algorithm by the multi-resolution technique. The fast block matching algorithm affects the speed by the patten combination and this paper proposes the block matching algorithm in different levels by multi-resolution technique, quite different from the original NTSS Patten. The block matching algorithm requires the multi-candidate to reduce the occurrence of low-image quality by the local minima problem. The simulation result compared to FS shows search speed 16 times quicker, and the PSNR 0.11-0.12［dB］ gets improved Image quality compared to the original fast block matching algorithm NTSS, and the speed is improved up to 0.1 times for improved image by the search point portion.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.217-220
• /
• 1996

This paper describes a new hierarchial block matching algorithm especially appropriate for a large search area. The proposed algorithm consists of higher level search for an initial motion vector estimate by using a new matching criterion over the evenly subsampled search points, and lower level search for the final motion vector refinement. In the higher level matching criterion, mean absolute differences at the search points (or motion vector candidates) similar to motion vectors of causally neighboring blocks, are weighted properly so that these points can have a higher chance to being selected. The proposed algorithm outperforms existing hierarchical block matching algorithms, and its computational regularity makes hardware implementation simple.