Abstract
We present a new robust point matching algorithm (RPM) that can jointly estimate the correspondence and non-rigid transformations between two point-sets that may be of different sizes. The algorithm utilizes the soft assign for the correspondence and the thin-plate spline for the non-rigid mapping. Embedded within a deterministic annealing framework, the algorithm can automatically reject a fraction of the points as outliers. Experiments on both 2D synthetic point-sets with varying degrees of deformation, noise and outliers, and on real 3D sulcal point-sets (extracted from brain MRI) demonstrate the robustness of the algorithm.
Keywords
Point set registrationOutlierAlgorithmRobustness (evolution)Computer scienceSimulated annealingPoint (geometry)Matching (statistics)Spline (mechanical)Blossom algorithmArtificial intelligenceMathematicsGeometryEngineering
Affiliated Institutions
Related Publications
New algorithms for 2D and 3D point matching
A fundamental open problem in computer vision—determining pose and correspondence between two sets of points in space—is solved with a novel, fast, robust and easily implementab...
Shape Matching and Object Recognition Using Low Distortion Correspondences
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up corr...
Go-ICP: Solving 3D Registration Efficiently and Globally Optimally
Registration is a fundamental task in computer vision. The Iterative Closest Point (ICP) algorithm is one of the widely-used methods for solving the registration problem. Based ...
A method for registration of 3-D shapes
The authors describe a general-purpose, representation-independent method for the accurate and computationally efficient registration of 3-D shapes including free-form curves an...
Fast Point Feature Histograms (FPFH) for 3D registration
In our recent work [1], [2], we proposed Point Feature Histograms (PFH) as robust multi-dimensional features which describe the local geometry around a point p for 3D point clou...
Publication Info
- Year
- 2002
- Type
- article
- Volume
- 2
- Pages
- 44-51
- Citations
- 439
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
439
OpenAlex
Cite This
Haili Chui,
Anand Rangarajan
(2002).
A new algorithm for non-rigid point matching.
, 2
, 44-51.
https://doi.org/10.1109/cvpr.2000.854733
Identifiers
- DOI
- 10.1109/cvpr.2000.854733