• The Journal of the Acoustical Society of Korea
• /
• v.24 no.7
• /
• pp.402-409
• /
• 2005

In this paper. we propose a coding method using a matching pursuit algorithm in a strongly periodic highband signal. Also. we propose an efficient quantizer for the estimated parameters : spectral magnitude and phase. Based on the error concealment principle and sinusoidal model. the MP algorithm requires the high-precision pitch period estimation. To estimate more accurate pitch period. the refined pitch obtained from lowband speech is used. which increases the efficiency of bit allocation. The spectral magnitude parameters are quantized by the method which is combined with MDCT (Modified Discrete Cosine Transform) and multi-stage structure. The spectral phase quantizer uses the $2{\pi}$ modular characteristic of phases and the weighted function by spectral magnitudes. To evaluate the efficiency of the proposed method. we applied it to analysis-by-synthesis system. Furthermore we suggest the possibillity of scalable wideband speech codecs based on band-split structure.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.1
• /
• pp.100-107
• /
• 2012

Recently the need for advanced security technologies are increasing as the occurrence of intelligent crime is growing fastly. Previous methods for face disguise detection are required for the improvement of accuracy in order to be put to practical use. In this paper, we propose a new disguise detection method using the template matching and Adaboost algorithm. The proposed system detects eyes based on multi-scale Gabor feature vector in the first stage, and uses template matching technique in oreder to increase the detection accuracy in the second stage. The template matching plays a role in determining whether or not the person of the captured image has sunglasses on. Adaboost algorithm is used to determine whether or not the person of the captured image wears a mask. Experimental results indicate that the proposed method is superior to the previous methods in the detection accuracy of disguise faces.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.203-211
• /
• 2005

In this paper, we propose a new automatic fingerprint identification system that identifies individuals in large databases. The algorithm consists of three steps; preprocessing, classification, and matching, in the classification. we present a new classification technique based on the statistical approach for directional image distribution. In matching, we also describe improved minutiae candidate pair extraction algorithm that is faster and more accurate than existing algorithm. In matching stage, we extract fingerprint minutiaes from its thinned image for accuracy, and introduce matching process using minutiae linking information. Introduction of linking information into the minutiae matching process is a simple but accurate way, which solves the problem of reference minutiae pair selection in comparison stage of two fingerprints quickly. This algorithm is invariant to translation and rotation of fingerprint. The proposed system was tested on 1000 fingerprint images from the semiconductor chip style scanner. Experimental results reveal false acceptance rate is decreased and genuine acceptance rate is increased than existing method.

• KSCI Review
• /
• v.14 no.1
• /
• pp.265-271
• /
• 2006

In this paper, we propose a new automatic fingerprint identification system that identifies individuals in large databases. The algorithm consists of three steps: preprocessing, classification, and matching, in the classification, we present a new classification technique based on the statistical approach for directional image distribution. In matching, we also describe improved minutiae candidate pair extraction algorithm that is faster and more accurate than existing algorithm. In matching stage, we extract fingerprint minutiaes from its thinned image for accuracy, and introduce matching process using minutiae linking information. Introduction of linking information into the minutiae matching process is a simple but accurate way, which solves the problem of reference minutiae pair selection in comparison stage of two fingerprints quickly. This algorithm is invariant to translation and rotation of fingerprint. The proposed system was tested on 1000 fingerprint images from the semiconductor chip style scanner. Experimental results reveal false acceptance rate is decreased and genuine acceptance rate is increased than existing method.

• Journal of the Korean Institute of Telematics and Electronics D
• /
• v.34D no.3
• /
• pp.9-16
• /
• 1997

A 23GHz 1-stage LNA was designed by using new topology of coupled line type with EEsof softwares and modified by using MPIE numerical analysis. The parallel coupled filter-type matching sections give impedance matching and DC blocking simultaneously, and have small discontinuities. This matching scheme has simple structure in the design process and give small error. The EFT chip was directly attached to the ground metal. The designed LAN gives 6.2dB gain and 2.5dB noise figure without considering the loss of connectors. Through these results, it was verified that our design process, matching schemes and fabrication technologies was valied for developing 20GHz-band LNA.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.1
• /
• pp.76-84
• /
• 1992

The vision system is essential for SMT(Surface Mounting Technology) automation. The system plays the role of matching the positions betweem SMD and PCB, and inspecting SMD in the final stage of mounting. Real-time processing and high-precision are indispensable for practical purpose. In this paper, a new algorithm for position matching and inspection of SMD is proposed, and which is implemented on the DSP board using DSP board using DSP5600. Experimental results show mean matching error within 0.1 mm in the direction of x,y and execution time within 300msec. Therefore, we could attain high-speed and high-precision of the vision system for SMT automation.

• Journal of Korea Multimedia Society
• /
• v.22 no.12
• /
• pp.1404-1414
• /
• 2019

Educational books commonly use some copyrighted images with various kinds of deformation for helping students understanding. When using several copyrighted images made by merging or editing distortion in legal, we need to pay a charge to original copyright holders for each image. In this paper, we propose an efficient matching algorithm by separating each copyrighted image with the merged and edited type including rotation, illumination change, and change of size. We use the Oriented FAST and Rotated BRIEF (ORB) method as a basic feature matching scheme. To improve the matching accuracy, we design a new MIN-MAX similarity in matching stage. With the distorted dataset, the proposed method shows up-to 97% of precision in experiments. Also, we demonstrate that the proposed similarity measure also outperforms compared to other measure which is commonly used.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.1
• /
• pp.45-55
• /
• 1993

In this paper, a two-stage block matching algorithm (BMA), which can reduce greatly the computational complexity of the conventional BMAs, is proposed, in which the onedimensional distortion measure based on the integral projection is introduced to determine the candidate motion vectors and then among them a final motion vector is detected based on the conventional two-dimensional distortion measure. Due to the one-dimensional calculation of a distortion measure, the proposed algorithm can reduce the computational complexity of the conventional BMA (full search method with a 16$\times$16 block) by a factor of 4, with its performance comparable to those of the conventional ones. Simulation results based on the original and noisy image sequences are shown. Also the simulation of the proposed method combined with the MPEG (Moving Picture Experts Group) SM3 (Simulation Model Three) is presented. Computer simulation shows that the proposed algorithm is fast with its performance comparable to those of the conventional ones.

• Proceedings of the IEEK Conference
• /
• 2003.07c
• /
• pp.2911-2914
• /
• 2003

Conventionally, biological manipulations have been performed manually with long training and pretty low success rates. To overcome this problem, a novel biological manipulation system has been developed to manipulate biological cells without any interference of a human operator, In this paper, we demonstrate a development of tole-autonomous Cell Manipulation System (CMS) using an image processing at a remote site. The CMS consists of two manipulators, a plane stage, and an optical microscope. We developed deformable template-model-matching algorithm for micro objects and pattern matching algorithm of end effect for these manipulators in order to control manipulators and the stage. Through manipulation of biological cells using these algorithms, the performance of the CMS is verified experimentally.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.9
• /
• pp.109-117
• /
• 1997

A new relaxation algorithm based on distribution of matched errors and possibility is proposed to solve efficiently correspondence problem. This algorithm can be applied to various method, such as BMA, feature-, and region-based matching methods, by modifying its smoothness function. It consists of two stages which are transformation and iteration process. In transformation stage, the errors obtained by any matching algorithm are transformed to possibility values according to these statistical distribution. Each grade of possility is updated by some constraints which are defined as smoothness, uniqueness, and discontinuity factor in iteration stage. The discontinuity factor is used to reserve discontinuity of disparity. In conventional methods, it is difficult to find proper weights and stop condition, because only two factors, smoothness and uniqueness, have been used. However, in the proposed mthod, the more smoothing is not ocurred because of discontinuity factor. And it is efective to the various image, even if the image has a severe noise and repeating patterns. In addition, it is shown that the convergence rate and the quality of output are improved.