MAXIMAL MATCHING OF TWO THREE-DIMENSIONAL POINT SETS.

Homer H. Chen, Thomas S Huang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

An efficient algorithm for matching two three-dimensional point sets extracted from rigid objects is described. The algorithm begins by pairing a triplet of noncollinear points in one point set (the sensed point set) with a triplet of points in the other set (the reference point set). Then it determines the pairing for each subsequent sensed point by searching for a reference point such that the tetrahedron formed by the sensed point and the initial triplet of sensed points is congruent to that formed by the corresponding reference points. The matched points are guaranteed to be globally consistent. Thus the model test, which is computationally expensive, is not required in this algorithm. Experimental results based on simulated data are shown.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Pattern Recognition
PublisherIEEE
Pages1048-1050
Number of pages3
ISBN (Print)0818607424
StatePublished - Dec 1 1986

Publication series

NameProceedings - International Conference on Pattern Recognition

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition

Fingerprint

Dive into the research topics of 'MAXIMAL MATCHING OF TWO THREE-DIMENSIONAL POINT SETS.'. Together they form a unique fingerprint.

Cite this