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
Object modelling by registration of multiple range images
Image and Vision Computing - Special issue: range image understanding
Iterative point matching for registration of free-form curves and surfaces
International Journal of Computer Vision
Computational principles of mobile robotics
Computational principles of mobile robotics
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
ICP Registration Using Invariant Features
IEEE Transactions on Pattern Analysis and Machine Intelligence
Robot Pose Estimation in Unknown Environments by Matching 2D Range Scans
Journal of Intelligent and Robotic Systems
Fast Laser Scan Matching using Polar Coordinates
International Journal of Robotics Research
Surface-normal estimation with neighborhood reorganization for 3D reconstruction
CIARP'07 Proceedings of the Congress on pattern recognition 12th Iberoamerican conference on Progress in pattern recognition, image analysis and applications
Multiview registration for large data sets
3DIM'99 Proceedings of the 2nd international conference on 3-D digital imaging and modeling
Metric-based iterative closest point scan matching for sensor displacement estimation
IEEE Transactions on Robotics
Hi-index | 0.00 |
The Iterative Closest Point (ICP) is widely used for 2D - 3D alignment when an initial estimate of the relative pose is known. Many ICP variants have been proposed, affecting all phases of the algorithm from the point selection and matching to the minimization strategy.This paper presents a method for 2D laser scan matching that modifies the matching phase. In the first stage of the matching phase our method follows the ordinary association strategy: for each point of the new-scan it finds the closest point in the reference-scan. In a second stage, the most probable normal vector difference is calculated and associations that do not fulfill the normal vector difference requirement are re-associated by finding a better association in the neighborhood. This matching strategy improves the ICP performance specially when the initial estimate is not close to the right one, as it is shown in the simulated and real tests.