By Topic

Using k-d trees for robust 3D point pattern matching

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

Formats Non-Member Member
$31 $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)
Li, B. ; Comput. Sci. Dept., Univ. of Wales, Aberystwyth, UK ; Holstein, H.

We propose a new method for matching two 3D point sets of identical cardinality with global similarity but locally nonrigid distribution. This problem arises from marker-based optical motion capture systems. The point-sets are extracted from similar design poses of two subjects with underlying nonrigidity and possible distribution discrepancies, one being a model set (manually identified) and the other representing observation of another subject, to be matched to the model set. There exists neither a single global scale, nor an affine transformation between the point-sets. To establish the goal of a one-to-one for identification, we introduce a k-dimensional tree based method, which is well adapted and robust to such data, typically with distribution errors due to underlying subject nonrigidity. First, we construct a k-d tree for the model set. Then a similarity k-d tree of the data set is constructed following the structure information embedded in the model tree. Matching sequences of the two point sets are generated by traversing the identically structured trees. Experimental results confirm that this method is applicable for robust spatial matching of sparse point sets under nonrigid distortion.

Published in:

3-D Digital Imaging and Modeling, 2003. 3DIM 2003. Proceedings. Fourth International Conference on

Date of Conference:

6-10 Oct. 2003