A Voronoi Distance Based Searching Technique for Fast Image Registration


The KIPS Transactions:PartB , Vol. 12, No. 3, pp. 265-272, Jun. 2005
10.3745/KIPSTB.2005.12.3.265,   PDF Download:

Abstract

In this paper, we propose a technique which is speedily searching for correspondent points of two images using Voronoi-Distance, as an image registration method for feature based image mosaics. It extracts feature points in two images by the SUSAN corner detector, and then create not only the Voronoi Surface which has distance information among the feature points in the base image using a priority based Voronoi distance algorithm, but also select the model area which has the maximum variance value of coordinates of the feature points in the model image. We propose a method for searching for the correspondent points in the Voronoi surface of the base image overlapped with the model area by use of the partitive search algorithm using queues. The feature of the method is that we can rapidly search for the correspondent points between adjacent images using the new Voronoi distance algorithm which has O(width x height x logN) time complexity and the the partitive search algorithm using queues which reduces the search range by a fourth at a time.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. T. Bae, M. Y. Chong, C. W. Lee, "A Voronoi Distance Based Searching Technique for Fast Image Registration," The KIPS Transactions:PartB , vol. 12, no. 3, pp. 265-272, 2005. DOI: 10.3745/KIPSTB.2005.12.3.265.

[ACM Style]
Ki Tae Bae, Min Yeong Chong, and Chil Woo Lee. 2005. A Voronoi Distance Based Searching Technique for Fast Image Registration. The KIPS Transactions:PartB , 12, 3, (2005), 265-272. DOI: 10.3745/KIPSTB.2005.12.3.265.