Least-Squares Fitting of Two 3-D Point Sets
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Method for Registration of 3-D Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
Every Niching Method has its Niche: Fitness Sharing and Implicit Sharing Compared
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Special issue on registration and fusion of range images
Computer Vision and Image Understanding - Registration and fusion of range images
Integrated image and graphics technologies
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pre-registration of arbitrarily oriented 3D surfaces using a genetic algorithm
Pattern Recognition Letters - Special issue: Evolutionary computer vision and image understanding
Registration of 3d range images using particle swarm optimization
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Surface registration using extended polar maps
ACCV'06 Proceedings of the 7th Asian conference on Computer Vision - Volume Part I
Robust three-dimensional registration of range images using a new genetic algorithm
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Robust and accurate genetic scan matching algorithm for robotic navigation
ICIRA'11 Proceedings of the 4th international conference on Intelligent Robotics and Applications - Volume Part I
Image-based registration of 3D-range data using feature surface elements
VAST'04 Proceedings of the 5th International conference on Virtual Reality, Archaeology and Intelligent Cultural Heritage
Hi-index | 0.00 |
Most range data registration techniques are variants on the iterative closest point (ICP) algorithm, proposed by Y. Chen and G. Medioni (1991, Proceedings of the IEEE Conference on Robotics and Automation) and P. J. Besl and N. D. McKay ( 1992, IEEE Trans. Pattern Anal. Mach. Intell. 14, 239-256). That algorithm, though, is only one approach to optimizing a least-squares point correspondence sum proposed by K. S. Arun. T. Huang, and S. D. Blostein (1987, IEEE Trans. Pattern Anal. Mach. Intell, 9, 698-700). In its basic form ICP has many problems, for example, its reliance on preregistration by hand close to the global minimum and its tendency to converge to suboptimal or incorrect solutions. This paper reports on an evolutionary registration algorithm which does not require initial prealignment and has a very broad basin of convergence. It searches many areas of a registration parameter space in parallel and has available to it a selection of evolutionary techniques to avoid local minima which plague both ICP and its variants.