Share Email Print
cover

Proceedings Paper

Rapid 3D registration using local subtree caching in iterative closest point (ICP) algorithm
Author(s): Ryan Uhlenbrock; Kyungnam Kim; Heiko Hoffmann; Jean Dolne
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 6 September 2017
PDF: 5 pages
Proc. SPIE 10410, Unconventional and Indirect Imaging, Image Reconstruction, and Wavefront Sensing 2017, 104100J (6 September 2017); doi: 10.1117/12.2276428
Show Author Affiliations
Ryan Uhlenbrock, HRL Labs., LLC (United States)
Kyungnam Kim, HRL Labs., LLC (United States)
Heiko Hoffmann, HRL Labs., LLC (United States)
Jean Dolne, The Boeing Co. (United States)


Published in SPIE Proceedings Vol. 10410:
Unconventional and Indirect Imaging, Image Reconstruction, and Wavefront Sensing 2017
Jean J. Dolne; Rick P. Millane, Editor(s)

© SPIE. Terms of Use
Back to Top
PREMIUM CONTENT
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?
close_icon_gray