Shark, Lik, Kurekin, Andriy and Matuszewski, Bogdan J
Development and evaluation of fast branch-and-bound algorithm for feature matching based on line segments.
Pattern Recognition, 40
Official URL: http://dx.doi.org/10.1016/j.patcog.2006.10.022
By extending the previously proposed geometric branch-and-bound algorithm with bounded alignment for point pattern matching, the paper presents the development and evaluation of a new and fast algorithm for image registration based on line segments. Using synthetically generated data sets with randomly distributed line segments and hard test cases with highly symmetric line patterns, as well as real remote sensing images, the developed algorithm is shown to be computationally fast, highly robust, capable of handling severely corrupted data sets with considerable line segment position errors as well as significant fragmented and spurious line segments in the images to be matched.
Repository Staff Only: item control page