• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.3
• /
• pp.279-284
• /
• 2004

Fingerprints have been widely used in the biometric authentication because of its performance, uniqueness and universality. Recently, the speed of identification becomes a very important point in the fingerprint-based security applications. Also, the reliability still remains the main issue in the fingerprint identification. In this paper, we propose the fast and reliable fingerprint matching algorithm based on the process of the 'self-nonself' discrimination in the biological immune system. The proposed algorithm is organized by two-matching stage. The 1st matching stage does the matching process by the use of the 'self-space' and MHC detector string set that are generated from the minutiae and the values of the directional field. Then the 2nd matching stage is made based on the local-structure of the minutiae. The proposed two matching stage reduces matching time while the reliability of the matching algorithm is maintained.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.12
• /
• pp.663-670
• /
• 2016

This paper proposes the 3D-modeling-based image template matching method. It is more convenient than contemporary 2D-template-based methods that use many 2D image templates for possible angles and sizes in matching process.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.689-692
• /
• 1998

Matching two images is an essential step for many computer vision applications. A new approach to the scale and rotation invariant scene matching is presented. A set of andidate parameters are hypthesized by mapping the angular difference and a new distance measure to the hough space and by detecting maximally consistent points. The proposed method is shown to be much faster than the conventinal one where the relaxation process is repeated until convergence, while providing robust matching performance, without a priori information on the geometrical transformation parameters.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.4
• /
• pp.327-332
• /
• 2002

The main problems of computational complexity in object tracking are definition of objects, segmentations and identifications in non-structured environments with erratic movements and collisions of objects. The object's information as a region that corresponds to objects without discriminating among objects are considered. This paper describes the algorithm that, automatically and efficiently, recognizes and keeps tracks of interest-regions selected by users in video or camera image sequences. The block-based feature matching method is used for the region tracking. This matching process considers only dominant feature points such as corners and curved-edges without requiring a pre-defined model of objects. Experimental results show that the proposed method provides above 96% precision for correct region matching and real-time process even when the objects undergo scaling and 3-dimen-sional movements In successive image sequences.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2012.05a
• /
• pp.43-45
• /
• 2012

This paper is based on embedding the biometrics techniques on GPU for better computational efficiency and fast matching process using the parallel nature of the GPU processors to compare thousands of images for fingerprint recognition in a fraction of a second. In this paper we worked on GPU (INVIDIA GeForce GTX 260 with compute capability 1.3 and dual core-2-dou processor) for fingerprint matching and found that the efficiency is better than the results with related work already done on CMOS, CPU, ARM9, MATLAB Neural Networks etc which shows the better performance of our system in terms of computational time. The features matching process proposed for fingerprint recognition and the verification procedure is done on 5,000 images which are available online in the databases FVC2000, 2002, 2004 [1].

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.179-182
• /
• 2003

This paper proposes a new stereo matching algorithm using both the divide-and-conquer method and the DSI(Disparity Space Image) technique. Firstly, we find salient feature points on the each scanline of the left image and find the corresponding feature point at the right image. Then the problem of a scanline is divided into several subproblems. By this way, matching of the subintervals is implemented by using the DSI technique. The DSI technique for stereo matching process is a very efficient solution to find matches and occlusions simultaneously and it is very speedy. In addition, we apply three occluding patterns to process occluded regions, as a result, we reduce mismatches at the disparity discontinuity.

• 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 Semiconductor & Display Technology
• /
• v.5 no.4 s.17
• /
• pp.17-22
• /
• 2006

In the manufacturing processes of semiconductor, test process is important for quality of products. In the manufacturing process of dynamic memory, memory test is more important. So, automatic test equipment(ATE) is used necessarily. But, according to increase of speed of dynamic memory operation, the rapid test equipment is needed. Impedance matching between ATE and dynamic memory is expected to be an important problem for making a rapid test equipment over 1Gbps. According to increase of speed, inner impedance of ATE also works on important parameter for test. This paper is about the method that is for impedance matching of inner impedance and coaxial cable occurring in manufacturing of ATE. We proved effects of inner impedance by electric theory and verified the method of impedance matching using computer simulation.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.11
• /
• pp.1027-1033
• /
• 2012

Semantic-based information retrieval techniques understand the meanings of the concepts that users specify in their queries, but the traditional semantic matching methods based on the ontology tree have three weaknesses which may lead to many false matches, causing the falling precision. In order to improve the matching precision and the recall of the information retrieval, this paper proposes a multi-agent improved semantic similarity matching algorithm based on the ontology tree, which can avoid the considerable computation redundancies and mismatching during the entire matching process. The results of the experiments performed on our algorithm show improvements in precision and recall compared with the information retrieval techniques based on the traditional semantic similarity matching methods.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.2
• /
• pp.279-287
• /
• 2007

Data fusion is the process of combining multiple data in order to produce information of tactical value to the user. Data fusion is generally defined as the use of techniques that combine data from multiple sources and gather that information in order to achieve inferences. Data fusion is also called data combination or data matching. Data fusion is divided in five branch types which are exact matching, judgemental matching, probability matching, statistical matching, and data linking. In this paper, we develop was macro program for statistical matching which is one of five branch types for data fusion. And then we apply data fusion and association rule techniques to environmental data.