Procrustes Alignment with the EM Algorithm

Authors:
Bin Luo;Edwin R. Hancock
Affiliations:
-;-
Venue:
CAIP '99 Proceedings of the 8th International Conference on Computer Analysis of Images and Patterns
Year:
1999

Citing 12
Cited 1

An Eigendecomposition Approach to Weighted Graph Matching Problems

IEEE Transactions on Pattern Analysis and Machine Intelligence
Extraction of early perceptual structure in dot patterns: integrating region, boundary, and component gestalt

Computer Vision, Graphics, and Image Processing
Representing stereo data with the Delaunay triangulation

Artificial Intelligence
Least-Squares Estimation of Transformation Parameters Between Two Point Patterns

IEEE Transactions on Pattern Analysis and Machine Intelligence
Relative sensitivity of a family of closet-point graphs in computer vision applications

Pattern Recognition
Feature-based correspondence: an eigenvector approach

Image and Vision Computing - Special issue: BMVC 1991
Parameterized Point Pattern Matching and Its Application to Recognition of Object Families

IEEE Transactions on Pattern Analysis and Machine Intelligence
Active shape models—their training and application

Computer Vision and Image Understanding
Graphical Templates for Model Registration

IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Matching by Discrete Relaxation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Distortion Invariant Object Recognition in the Dynamic Link Architecture

IEEE Transactions on Computers
Modal Matching for Correspondence and Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence

String Edit Distance, Random Walks and Graph Matching

Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper casts the problem of point-set alignment via Procrustes analysis into a maximum likelihood framework using the EM algorithm. The aim is to improve the robustness of the Procrustes alignment to noise and clutter. By constructing a Gaussian mixture model over the missing correspondences between individual points, we show how alignment can be realised by applying singular value decomposition to a weighted point correlation matrix. Moreover, by gauging the relational consistency of the assigned correspondence matches, we can edit the point sets to remove clutter. We illustrate the effectiveness of the method matching stereogram. We also provide a sensitivity analysis to demonstrate the operational advantages of the method.