Geometrically stable sampling for the ICP algorithm
Natasha Gelfand, Leslie Ikemoto, Szymon M. Rusinkiewicz et al. · 2004
The iterative closest point (ICP) algorithm is a widely used method for aligning three-dimensional point sets. The quality of alignment obtained by this algorithm depends heavily on choosing good pairs of corresponding points in the two datasets. If too many points are chosen from featureless regions of the data, the algorithm converges slowly, finds the wrong pose, or even diverges, especially in the presence of noise or miscalibration in the input data. We describe a method for detecting uncertainty in pose, and we propose a point selection strategy for ICP that minimizes this uncertainty by choosing samples that constrain potentially unstable transformations.
Cited by 350 works. doi:10.1109/im.2003.1240258
Authors
References
- A method for registration of 3-D shapes
- A volumetric method for building complex models from range images
- Efficient variants of the ICP algorithm
- Zippered polygon meshes from range images
- Object modeling by registration of multiple range images
- The Digital Michelangelo Project
- Multiview registration for large data sets
- Automated precision measurement of surface profile in CAD-directed inspection
- Fast and accurate shape-based registration
- Registration of 3-D partial surface models using luminance and depth information