Model-based image matching using location
Model-based image matching using location
Principal Warps: Thin-Plate Splines and the Decomposition of Deformations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Automatic Construction of 2D Shape Models
IEEE Transactions on Pattern Analysis and Machine Intelligence
Landmark-Based Image Analysis: Using Geometric and Intensity Models
Landmark-Based Image Analysis: Using Geometric and Intensity Models
Active Contours: The Application of Techniques from Graphics,Vision,Control Theory and Statistics to Visual Tracking of Shapes in Motion
Shape Matching and Object Recognition Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence
MMBIA '00 Proceedings of the IEEE Workshop on Mathematical Methods in Biomedical Image Analysis
Bee Brains, B-Splines and Computational Democracy: Generating an Average Shape Atlas
MMBIA '01 Proceedings of the IEEE Workshop on Mathematical Methods in Biomedical Image Analysis (MMBIA'01)
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
A Robust Algorithm for Point Set Registration Using Mixture of Gaussians
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
Groupwise point pattern registration using a novel CDF-based Jensen-Shannon Divergence
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Simultaneous Nonrigid Registration of Multiple Point Sets and Atlas Construction
IEEE Transactions on Pattern Analysis and Machine Intelligence
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
3-D diffeomorphic shape registration on hippocampal data sets
MICCAI'05 Proceedings of the 8th international conference on Medical image computing and computer-assisted intervention - Volume Part II
Information-theoretic matching of two point sets
IEEE Transactions on Image Processing
Construction of neuroanatomical shape complex atlas from 3D brain MRI
MICCAI'10 Proceedings of the 13th international conference on Medical image computing and computer-assisted intervention: Part III
From points to nodes: inverse graph embedding through a lagrangian formulation
CAIP'11 Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part I
Automatic alignment of brain MR scout scans using data-adaptive multi-structural model
MICCAI'11 Proceedings of the 14th international conference on Medical image computing and computer-assisted intervention - Volume Part II
Statistical shape analysis for population studies via level-set based shape morphing
ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume Part I
Information-Theoretic dissimilarities for graphs
SIMBAD'13 Proceedings of the Second international conference on Similarity-Based Pattern Recognition
Hi-index | 0.00 |
This paper presents a novel and robust technique for group-wise registration of point sets with unknown correspondence. We begin by defining a Havrda-Charvát (HC) entropy valid for cumulative distribution functions (CDFs) which we dub the HC Cumulative Residual Entropy (HC-CRE). Based on this definition, we propose a new measure called the CDF-HC divergence which is used to quantify the dis-similarity between CDFs estimated from each point-set in the given population of point sets. This CDF-HC divergence generalizes the CDF Jensen-Shannon (CDF-JS) divergence introduced earlier in the literature, but is much simpler in implementation and computationally more efficient.A closed-form formula for the analytic gradient of the cost function with respect to the non-rigid registration parameters has been derived, which is conducive for efficient quasi-Newton optimization. Our CDF-HC algorithm is especially useful for unbiased point-set atlas construction and can do so without the need to establish correspondences. Mathematical analysis and experimental results indicate that this CDF-HC registration algorithm outperforms the previous group-wise point-set registration algorithms in terms of efficiency, accuracy and robustness.