Principal Warps: Thin-Plate Splines and the Decomposition of Deformations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Active shape models—their training and application
Computer Vision and Image Understanding
A Framework for Automatic Landmark Identification Using a New Method of Nonrigid Correspondence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape Matching and Object Recognition Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence
A new point matching algorithm for non-rigid registration
Computer Vision and Image Understanding - Special issue on nonrigid image registration
Unsupervised Learning of an Atlas from Unlabeled Point-Sets
IEEE Transactions on Pattern Analysis and Machine Intelligence
Analysis of Planar Shapes Using Geodesic Paths on Shape Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
A generalized divergence measure for robust image registration
IEEE Transactions on Signal Processing
A new metric for probability distributions
IEEE Transactions on Information Theory
Non-Rigid Multi-Modal Image Registration Using Cross-Cumulative Residual Entropy
International Journal of Computer Vision
The mixtures of Student's t-distributions as a robust framework for rigid registration
Image and Vision Computing
EMMCVPR '09 Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Deformable density matching for 3D non-rigid registration of shapes
MICCAI'07 Proceedings of the 10th international conference on Medical image computing and computer-assisted intervention - Volume Part I
Model-Based Multiple Rigid Object Detection and Registration in Unstructured Range Data
International Journal of Computer Vision
Hi-index | 0.00 |
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).