Skip to main content
Article thumbnail
Location of Repository

Correspondence matching with modal clusters

By M Carcassoni and E R Hancock

Abstract

The modal correspondence method of Shapiro and Brady aims to match point-sets by comparing the eigenvectors of a pairwise point proximity matrix. Although elegant by means of its matrix representation, the method is notoriously susceptible to differences in the relational structure of the point-sets under consideration. In this paper, we demonstrate how the method can be rendered robust to structural differences by adopting a hierarchical approach. To do this, we place the modal matching problem in a probabilistic setting in which the correspondences between pairwise clusters can be used to constrain the individual point correspondences. We demonstrate the utility of the method on a number of synthetic and real-world point-pattern matching problems

Year: 2003
DOI identifier: 10.1109/TPAMI.2003.1251153
OAI identifier: oai:eprints.whiterose.ac.uk:1992

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.