Information Theoretic Shape Matching

Area of Science:

• Computer Vision and Image Processing
• Computational Geometry
• Machine Learning

Background:

• Point set registration is crucial for aligning 3D data in various fields.
• Existing methods often struggle with noise, outliers, and varying distortions.
• Developing robust and accurate registration algorithms remains an active research area.

Purpose of the Study:

• To introduce two novel algorithms for both rigid and non-rigid point set registration.
• To offer solutions with varying computational complexity and accuracy trade-offs.
• To enhance robustness against noise, outliers, and geometric distortions.

Main Methods:

• Algorithm 1: Employs correntropy, a nonlinear similarity measure combining higher-order statistics, assuming known point correspondences determined by the surprise metric.
• Algorithm 2: Represents point sets as probability density functions (PDFs) and uses Cauchy-Schwarz divergence for distribution alignment, mitigating the need for explicit correspondence.
• Both algorithms leverage information-theoretic descriptors operating at different levels (realizations vs. PDF).

Main Results:

• Correntropy-based algorithm offers high accuracy and efficiency, particularly in noisy conditions.
• Cauchy-Schwarz divergence-based algorithm effectively handles registration by aligning data distributions.
• Both methods demonstrate superior performance compared to several state-of-the-art registration techniques, showing robustness to noise and distortion.

Conclusions:

• The proposed algorithms provide effective solutions for rigid and non-rigid point set registration.
• Correntropy and Cauchy-Schwarz divergence offer powerful tools for information-theoretic registration.
• These methods present significant improvements in robustness and accuracy for real-world 3D data alignment tasks.