Information-theoretic matching of two point sets

Authors:
Yue Wang;K. Woods;M. McClain
Affiliations:
Dept. of Electr. Eng. & Comput. Sci., Catholic Univ. of America, Washington, DC;-;-
Venue:
IEEE Transactions on Image Processing
Year:
2002

Citing 0
Cited 5

Non-Rigid Image Registration by Neural Computation

Journal of VLSI Signal Processing Systems
Generalized L2-Divergence and Its Application to Shape Alignment

IPMI '09 Proceedings of the 21st International Conference on Information Processing in Medical Imaging
Group-Wise Point-Set Registration Using a Novel CDF-Based Havrda-Charvát Divergence

International Journal of Computer Vision
Closed-Form Jensen-Renyi Divergence for Mixture of Gaussians and Applications to Group-Wise Shape Registration

MICCAI '09 Proceedings of the 12th International Conference on Medical Image Computing and Computer-Assisted Intervention: Part I
Robust similarity registration technique for volumetric shapes represented by characteristic functions

Pattern Recognition

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper describes the theoretic roadmap of least relative entropy matching of two point sets. The novel feature is to align two point sets without needing to establish explicit point correspondences. The recovery of transformational geometry is achieved using a mixture of principal axes registrations, whose parameters are estimated by minimizing the relative entropy between the two point distributions and using the expectation-maximization algorithm. We give evidence of the optimality of the method and we then evaluate the algorithm's performance in both rigid and nonrigid image registration cases.