• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.526-528
• /
• 2003

지문 영상의 품질은 지문 인식의 성능에 큰 영향을 미친다. 그러므로 지문 영상의 품질을 명가하고 정의하는 과정이 선행되면 안정된 지문 인식 성능을 보장 받을 수 있다. 본 연구의 목적은 지문 영상 품질을 측정하는 알고리즘을 이용하여 정합 후 인증성공률을 높이는 것이다. 본 연구는 지문 영상의 품질을 측정하는 세가지 알고리즘을 구현하고 정량적으로 표현한 후 품질 정도에 따라 분류한 영상들을 이용하여 본인 대 본인 정합을 수행하였다. 그리고 알고리즘간의 특성을 비교하였으며 품질에 따른 정합 성능을 평가하였다. 실험 결과, 품질 평가 후의 정합 성능이 그렇지 않았을 때의 성능에 비해 5% 이상의 성능 향상을 보였다. 또한 좀 더 나은 성능 향상을 위해서는 융선의 지속성과 일관성을 판단할 수 있는 알고리즘 및 여러 품질 측정값들의 효율적인 조합의 연구가 필요하다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.119-122
• /
• 2011

The Stereo vision using belief propagation algorithm that has been studied recently yields good performance in disparity extraction. In this paper, BP algorithm is proved theoretically to high precision for a stereo matching algorithm. We derive disparity map from stereo image by using Belief Propagation (BP) algorithm and area-based matching algorithm. Two algorithms are compared using stereo images provided by Middlebury web site. Disparity map error rate decreased from 52.3% to 2.3%.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.37 no.8
• /
• pp.759-766
• /
• 2009

The purpose of this paper is an image processing algorithm development as a base research achieving performance enhancement of integrated navigation system. We used the SIFT (Scale Invariant Feature Transform) algorithm for image processing, and developed feature point matching filter for rejecting mismatched points. By applying the proposed algorithm, it is obtained better result than other methods of parameter tuning and KLT based feature point tracking. For further study, integration with INS and algorithm optimization for the real-time implementation are under investigation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.1
• /
• pp.94-99
• /
• 2007

In this paper, a 2-dimensional edge-based matching algorithm is proposed that combines the generalized Hough transform (GHT) and the Chamfer matching to complement weakness of either method. First, the GHT is used to find approximate object positions and orientations, and then these positions and orientations are used as starling parameter values to find more accurate position and orientation using the Chamfer matching. Finally, matching accuracy is further refined by using a subpixel algorithm. The algorithm was implemented and successfully tested on a number of images containing various electronic components.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.4
• /
• pp.67-73
• /
• 2008

In the Markov network which models disparity map with the Markov Random Field(MRF), the belief propagation algorithm is operated by message passing between nodes corresponding to each pixels. Belief propagation algorithm required much iteration for accurate result. In this paper, we propose the stereo matching algorithm using belief propagation in multi-resolution domain. Multi-resolution method based on wavelet or lifting can reduce the search area, therefore this algorithm can generate disparity map with fast speed.

• Journal of KIISE:Software and Applications
• /
• v.37 no.11
• /
• pp.859-865
• /
• 2010

In this paper, a new method for finger vein recognition is proposed. Researchers are recently interested in the finger vein recognition since it is a good way to avoid the forgery in finger prints recognition and the inconveniences in obtaining images of the iris for iris recognition. The vein images are processed to obtain the line shaped vein images through the local histogram equalization and a thinning process. This thinned vein images are processed for matching, using a new matching algorithm, named HS(HeeSung) matching algorithm. This algorithm yields an excellent recognition rate when it is applied to the curve-linear images processed through a thinning or an edge detection. In our experiment with the finger vein images, the recognition rate has reached up to 99.20% using this algorithm applied to 650finger vein images(130person ${\times}$ 5images each). It takes only about 60 milliseconds to match one pair of images.

• Journal of the Korea Computer Graphics Society
• /
• v.24 no.5
• /
• pp.11-19
• /
• 2018

In this paper, we propose an algorithm for improving the accuracy and rate of convergence when two point clouds with noise and a low overlapping area are registered to each other. We make the most use of the geometric information of the underlying geometry of the point clouds with noise for better accuracy. We select a reasonable region from the noisy point cloud for registration and combine a modified acceleration algorithm to improve its speed. The conventional accuracy improvement method was not possible in a lot of noise, this paper resolves the problem by selecting the reasonable region for the registration. And this paper applies acceleration algorithm for a clone to low overlap point cloud pair. A simple algorithm is added to the conventional method, which leads to 3 or 4 times faster speed. In conclusion, this algorithm was developed to improve both the speed and accuracy of point cloud registration in noisy and low overlap case.

• Proceedings of the Korean Society Of Semiconductor Equipment Technology
• /
• 2004.05a
• /
• pp.132-137
• /
• 2004

반도체 소자의 마킹 / 표면 검사에 대한 적응적 reference 데이터 자동 획득 알고리즘과 검사에서의 실시간 정합 알고리즘을 개발하여, 모든 반도체 소자의 마킹 / 표면 검사에 대한 오류를 검출할 수 있는 마킹 / 표면 검사 시스템을 개발한다.

• 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 the Institute of Convergence Signal Processing
• /
• v.5 no.4
• /
• pp.294-300
• /
• 2004

According to the development of digital media technologies various algorithms for video clip matching have been proposed to match the video sequences efficiently. A large number of video search methods have focused on frame-wise query, whereas a relatively few algorithms have been presented for video clip matching or video shot matching. In this paper, we propose an efficient algorithm to index the video sequences and to retrieve the sequences for video clip query. To improve the accuracy and performance of video sequence matching, we employ the Cauchy function as a similarity measure between histograms of consecutive frames, which yields a high performance compared with conventional measures. The key frames extracted from segmented video shots can be used not only for video shot clustering but also for video sequence matching or browsing, where the key frame is defined by the frame that is significantly different from the previous frames. Experimental results with color video sequences show that the proposed method yields the high matching performance and accuracy with a low computational load compared with conventional algorithms.