Earticle

초록

영어

The conventional search methods have computational complexity problem and imprecision problem in correspondence matching process. To resolve these problems, we propose how to effectively make feature space (distance map) and how to rapidly search the optimal point correspondence. The proposed distance map named Voronoi distance map is a 2-Dimensional surface that contains the distance information between each element(x-y coordinates) of image and the nearest feature point. The proposed distance map is efficiently created based on the priority-based calculation algorithm. The general distance calculation algorithm has a time complexity of O(w*h*n). (w = width, h = height, n = the number of feature points) whereas the priority-based distance calculation algorithm is a effective method with a computational cost of O(w*h*logn). Also, The partition search algorithm is a efficient method that can detect corresponding points very rapidly because this method can reduce the search range by a quarter at a time. Experimental results show that the proposed method outperforms conventional methods in reducing computation time and detecting the optimal correspondence.

목차

Abstract
 1. Introduction
 2. Overview of Algorithm
  2.1 Extracting feature point and Selecting Model patch area
  2.2 Extracting feature point and Selecting Model patch area
 3. Partition Search Algorithm
 4. Experimental Results
 5. Conclusion
 References

키워드

저자

• Kitae Bae [ Department of New Media, Korean German Institute of Technology ]
• Hyoungjin Kim [ Department of IT Applied System Engineering, Chonbuk National University ] Corresponding Author

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Multimedia and Ubiquitous Engineering

• 간기

  월간

• pISSN

  1975-0080

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605