Abstract Estimating a meaningful average or mean shape from a set of shapes represented by unlabeled point-sets is a challenging problem since, usually this involves solving for point correspondence under a non-rigid motion setting. In this paper, we propose a novel and robust algorithm that is capable of simultaneously computing the mean shape from multiple unlabeled point-sets (represented by finite mixtures) and registering them nonrigidly to this emerging mean shape. This algorithm avoids the correspondence problem by minimizing the Jensen-Shannon (JS) divergence between the point sets represented as finite mixtures. We derive the analytic gradient of the cost function namely, the JS-divergence, in order to efficiently achieve the optimal solution. The cost function is fully symmetric with no bias toward any of the given shapes to be registered and whose mean is being sought. Our algorithm can be especially useful for creating atlases of various shapes present in images as well as for simultaneously (rigidly or non-rigidly) registering 3D range data sets without having to establish any correspondence. We present experimental results on non-rigidly registering 2D as well as 3D real data (point sets).
Simultaneous Nonrigid Registration of Multiple Point Sets and Atlas Construction
Computer Vision – ECCV 2006 ; 8 ; 551-563
Lecture Notes in Computer Science ; 3953 , 8
2006-01-01
13 pages
Article/Chapter (Book)
Electronic Resource
English
Simultaneous Nonrigid Registration of Multiple Point Sets and Atlas Construction
British Library Conference Proceedings | 2006
|Simultaneous Registration of Multiple Corresponding Point Sets
British Library Online Contents | 2001
|Nonrigid image registration: guest editors' introduction
British Library Online Contents | 2003
|Multimodal Functional and Morphological Nonrigid Image Registration
British Library Conference Proceedings | 2005
|