By Topic

A Fast ICP Algorithm for 3-D Human Body Motion Tracking

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Daehwan Kim ; Department of Computer Science and Engineering, Pohang University of Science and Technology, Pohang, Korea ; Daijin Kim

Iterative closest point (ICP) algorithm has been widely used for registering the geometry, shape and color of the 3-D meshes. However, ICP requires a long computation time to find the corresponding closest points between the model points and the data points. To overcome this problem, we propose a fast ICP algorithm that consists of two acceleration techniques: hierarchical model point selection (HMPS) and logarithmic data point search (LDPS). HMPS accelerates the search by reducing the search region of the data points corresponding to a model point effectively: it selects the model points in a coarse-to-fine manner and employs the four neighboring closest data points in the upper layer to make the search region for finding the closest data point corresponding to a model point in the lower layer. LDPS accelerates the search by visiting the data points within the search region using 2-D logarithm search. The HMPS method and the LDPS method can be operating separately or together. To evaluate the speed of the proposed ICP, we apply it to the 3-D human body motion tracking. The proposed fast ICP is about 3.17 times faster than the existing ICP such as the K-D tree.

Published in:

IEEE Signal Processing Letters  (Volume:17 ,  Issue: 4 )