• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.1903-1904
• /
• 2008

이 논문에서는 영상 프레임사이의 움직임 벡터 연구에 기반을 둔 빠른 블록 정합 움직임 추정을 위해 보완된 다이아몬드 탐색 알고리즘을 제안한다. 실험 결과는 제안된 알고리즘이 기존의 다이아몬드 탐색 알고리즘 보다 더 적은 탐색으로 좀 더 빠르게 동작하는 것이 가능하다. 본 알고리즘의 특징은 움직임이 적은 블록에 대해서는 CDS(conjugate direction search) 알고리즘을 적용하여 탐색함으로써 탐색 점의 수를 줄일 수 있어 좀 더 빠르게 움직임 추정을 할 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.469-471
• /
• 2002

본 논문에서는 얼굴 영상의 변화를 보상할 수 있는 전처리 과정으로서 기하학적 특징에 기반한 순수 얼굴 영역 검출 기법을 도입하고 후처리 과정으로 간단한 정합 기법을 사용한 얼굴 인식 기법을 제안한다. 실험결과를 보면 제안한 기법은 PCA와 LDA 기법에 비해 영상의 변화에 민감하지 않고 높은 인식률을 가진다.

• Journal of Korean Society for Geospatial Information Science
• /
• v.5 no.2 s.10
• /
• pp.99-110
• /
• 1997

Image matching to determine the conjugate points in stereo photos is the one of the most important subject in digital photogrammetry and many researches In digital photogrammetric field are on going to automate the image matching process. In this study, we analyzes the effect of allowable correlation coefficient, which controls the accuracy in areal based image matching, on the accuracy of digital photogrammetry. So, some areal based matching methods such as image correlation coefficient matching, image Pyramid matching and interest point matching, are implemented, and the effect of allowable correlation coefficient on accuracy of digital photogrammetry in each method is analyzed. As a result of this study, a method to determine the optimal correlation coefficient is presented.

• Journal of KIISE:Software and Applications
• /
• v.31 no.1
• /
• pp.71-81
• /
• 2004

Minutiae-based fingerprint identification systems use minutiae points, which cannot completely characterize local ridge structures. Further, this method requires many methods for matching two fingerprint images containing different number of minutiae points. Therefore, to represent the fired length information for one fingerprint image, the filterbank-based method was proposed as an alternative to minutiae-based fingerprint representation. However, it has two shortcomings. One shortcoming is that similar feature vectors are extracted from the different fingerprints which have the same fingerprint type. Another shortcoming is that this method has overload to reduce the rotation error in the fingerprint image acquisition. In this paper, we propose the minutia-weighted feature vector extraction method that gives more weight in extracting feature value, if the region has minutiae points. Also, we Propose new fingerprint alignment method that uses the average local orientations around the reference point. These methods improve the fingerprint system's Performance and speed, respectively. Experimental results indicate that the proposed methods can reduce the FRR of the filterbank-based fingerprint matcher by approximately 0.524% at a FAR of 0.967%, and improve the matching performance by 5% in ERR. The system speed is over 1.28 times faster.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.5
• /
• pp.1217-1230
• /
• 2010

The dynamic programming based methods, a kind of globally optimizing stereo matching methods, has the inherent advantage that the occlusion regions can be found during the process. But it also has a serious drawback of streaking phenomena. This paper focuses on reducing the streaking phenomena by adjusting the penalties in calculating the cost matrix and re-establishing the optimal path in the back-tracing process using the boundary information of the image. Especially we use a pixel expansion method in re-establishing the path, which is the results from expanding the pixel information of the ones just left the boundaries. Experiments with the four image pairs provided by the Middlebury site showed the results that the proposed method has the disparity error ratio of 6.33% and the rank is 29, which is competitive to the best method among the previously published dynamic programming based methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.117-128
• /
• 2001

In order to achieve optimal retrieval, i.e., to find the best match to a query according to a certain similarity measure, the exhaustive search should be performed literally for all the images in a database. However, the straightforward exhaustive search algorithm is computationally expensive in large image databases. To reduce its heavy computational cost, this paper presents a fast exhaustive multi-resolution search algorithm based on image database clustering. Firstly, the proposed algorithm partitions the whole image data set into a pre-defined number of clusters having similar feature contents. Next, for a given query, it checks the lower bound of distances in each cluster, eliminating disqualified clusters. Then, it only examines the candidates in the remaining clusters. To alleviate unnecessary feature matching operations in the search procedure, the distance inequality property is employed based on a multi-resolution data structure. The proposed algorithm realizes a fast exhaustive multi-resolution search for either the best match or multiple best matches to the query. Using luminance histograms as a feature, we prove that the proposed algorithm guarantees optimal retrieval with high searching speed.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.243-244
• /
• 2007

다양한 디지털 컨텐츠를 검색하기 위해 다양한 디스크립터(Descriptor)가 제안되어 왔다. 그 중 특징점을 기반으로 하는 디스크립터를 이용하여 원본 영상과 기하학적 변형을 포함하는 다양한 변형 영상을 서로 정확하게 정합시키기 위해서는 각 영상에서 동일한 위치에 동일한 개수의 특징점이 추출되는 것이 유리하다. 본 논문에서는 널리 사용되고 있는 해리스(Harris) 특징점 추출 방법을 기반으로 국부 최대값과 정렬을 이용하여 원하는 개수의 특징점을 선택하는 방법을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.7
• /
• pp.767-778
• /
• 1992

Is discussed. A method to extract feature points and to synthesize human facial images In 3-Dmodel-based ceding system, faciai feature points are extracted automatically using some image processing techniques and the known knowledge for human face. A wire frame model matched to human face Is transformed according to the motion of point using the extracted feature points. The synthesized Image Is produced by mapping the texture of initial front view Image onto the trarnsformed wire frame. Experinent results show that the synthesitzed image appears with little unnaturalness.

• Korean Journal of Remote Sensing
• /
• v.38 no.6_1
• /
• pp.1505-1514
• /
• 2022

Image matching is a crucial preprocessing step for effective utilization of multi-temporal and multi-sensor very high resolution (VHR) satellite images. Deep learning (DL) method which is attracting widespread interest has proven to be an efficient approach to measure the similarity between image pairs in quick and accurate manner by extracting complex and detailed features from satellite images. However, Image matching of VHR satellite images remains challenging due to limitations of DL models in which the results are depending on the quantity and quality of training dataset, as well as the difficulty of creating training dataset with VHR satellite images. Therefore, this study examines the feasibility of DL-based method in matching pair extraction which is the most time-consuming process during image registration. This paper also aims to analyze factors that affect the accuracy based on the configuration of training dataset, when developing training dataset from existing multi-sensor VHR image database with bias for DL-based image matching. For this purpose, the generated training dataset were composed of correct matching pairs and incorrect matching pairs by assigning true and false labels to image pairs extracted using a grid-based Scale Invariant Feature Transform (SIFT) algorithm for a total of 12 multi-temporal and multi-sensor VHR images. The Siamese convolutional neural network (SCNN), proposed for matching pair extraction on constructed training dataset, proceeds with model learning and measures similarities by passing two images in parallel to the two identical convolutional neural network structures. The results from this study confirm that data acquired from VHR satellite image database can be used as DL training dataset and indicate the potential to improve efficiency of the matching process by appropriate configuration of multi-sensor images. DL-based image matching techniques using multi-sensor VHR satellite images are expected to replace existing manual-based feature extraction methods based on its stable performance, thus further develop into an integrated DL-based image registration framework.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.6
• /
• pp.1-12
• /
• 2008

This paper presents automatic moving object detection method using the rotating camera covering larger area with a single camera. The proposed method is based on the edge segment matching which robust to the dynamic environment with illumination change and background movement. The proposed algorithm presents an edge segment based background panorama image generation method minimizing the distortion due to image stitching, the background image generation method using Generalized Hough Transformation which can reliably register the current image to the panorama image overcoming the stitching distortions, the moving edge segment extraction method that overcome viewpoint difference and distortion. The experimental results show that the proposed method can detect correctly moving object under illumination change and camera vibration.