6 September 2017 Rapid 3D registration using local subtree caching in iterative closest point (ICP) algorithm
Author Affiliations +
Abstract
This paper describes a method for continuous 3D registration of an object using a 3D sensor and model of the object, significantly speeding up an iterative alignment method by using a 2D array cache. The cache stores local subtrees in a kd-tree search to initialize the processing of subsequent data. The cache is spatially structured to match the projection of the 3D space into the sensor’s field of view, and automatically adapts when points cross discontinuities or occlusion boundaries. Experiments in a simulated 3D tracking and relative maneuvering scenario demonstrate the computational speedup benefits of local subtree caching.
© (2017) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ryan Uhlenbrock, Kyungnam Kim, Heiko Hoffmann, Jean Dolne, "Rapid 3D registration using local subtree caching in iterative closest point (ICP) algorithm", Proc. SPIE 10410, Unconventional and Indirect Imaging, Image Reconstruction, and Wavefront Sensing 2017, 104100J (6 September 2017); doi: 10.1117/12.2276428; https://doi.org/10.1117/12.2276428
PROCEEDINGS
5 PAGES


SHARE
KEYWORDS
RELATED CONTENT

Quantitative Analysis Of Thin Film Morphology Evolution
Proceedings of SPIE (December 23 1986)
AROTAL: results from two arctic campaigns
Proceedings of SPIE (January 12 2005)
Spectra of irradiated giant planets
Proceedings of SPIE (December 16 2002)
Anticipatory model of cavitation
Proceedings of SPIE (March 22 1999)

Back to Top