期刊名称：International Journal of Multimedia and Ubiquitous Engineering
印刷版ISSN：1975-0080
出版年度：2013
卷号：8
期号：6
页码：127-140
出版社：SERSC
摘要：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 ).**( nhwO(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 )log**(nhwO. 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
