Prior affinity measures on matches for ICP-like nonlinear registration of free-form surfaces

Authors:
Benoît Combès;Sylvain Prima
Affiliations:
INSERM, Rennes, France and INRIA, Rennes, France and University of Rennes I, CNRS, UMR, IRISA, Rennes, France;INSERM, Rennes, France and INRIA, Rennes, France and University of Rennes I, CNRS, UMR, IRISA, Rennes, France
Venue:
ISBI'09 Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro
Year:
2009

Citing 6
Cited 1

A Method for Registration of 3-D Shapes

IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
Surface shape and curvature scales

Image and Vision Computing
Rigid, affine and locally affine registration of free-form surfaces

International Journal of Computer Vision
Using Spin Images for Efficient Object Recognition in Cluttered 3D Scenes

IEEE Transactions on Pattern Analysis and Machine Intelligence
Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography

Communications of the ACM
A new point matching algorithm for non-rigid registration

Computer Vision and Image Understanding - Special issue on nonrigid image registration

Setting Priors and Enforcing Constraints on Matches for Nonlinear Registration of Meshes

MICCAI '09 Proceedings of the 12th International Conference on Medical Image Computing and Computer-Assisted Intervention: Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we show that several well-known nonlinear surface registration algorithms can be put in an ICP-like framework, and thus boil down to the successive estimation of point-to-point correspondences and of a transformation between the two surfaces. We propose to enrich the ICP-like criterion with additional constraints and show that it is possible to minimise it in the same way as the original formulation, with only minor modifications in the update formulas and the same convergence properties. These constraints help the algorithm to converge to a more realistic solution and can be encoded in an affinity term between the points of the surfaces to register. This term is able to encode both a priori knowledge and higher order geometrical information in a unified manner. We illustrate the high added value of this new term on synthetic and real data.