By Topic

Overlap elimination for registered range images

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)
Xiaokun Li ; Signal/Image Processing Systems, DCM Research Resources LLC, Germantown, MD 20874, USA ; William G. Wee

Three-dimensional (3D) data processing and modeling from range images plays an important role in many applications. Since overlap elimination of registered range images is a necessary step in 3D object modeling, many research efforts have been made. In this paper, a novel approach for eliminating overlaps of a registered data set is proposed. Firstly, the input data (registered range images) which contain overlaps is represented by a bd-tree data structure. Then, moving least squares (MLS) and spin map (SM) together with the nearest neighbor searching are used to identify and eliminate the overlaps. The method manipulates the registered images directly without meshing them first, therefore, provides a straightforward way to remove redundant data, which makes it different from the conventional methods. The experimental results demonstrate the efficiency of the proposed algorithm.

Published in:

2009 16th IEEE International Conference on Image Processing (ICIP)

Date of Conference:

7-10 Nov. 2009