A Computational Approach to Edge Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Modern database systems
How Easy is Matching 2D Line Models Using Local Search?
IEEE Transactions on Pattern Analysis and Machine Intelligence
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Geometric Hashing: An Overview
IEEE Computational Science & Engineering
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Implementation techniques for geometric branch-and-bound matching methods
Computer Vision and Image Understanding
2-D and 3-D Image Registration: for Medical, Remote Sensing, and Industrial Applications
2-D and 3-D Image Registration: for Medical, Remote Sensing, and Industrial Applications
Towards real-time object recognition using pairs of lines
Real-Time Imaging
Image and Vision Computing
Multibody structure-and-motion segmentation by branch-and-bound model selection
IEEE Transactions on Image Processing
| Hi-index | 0.01 |
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.