Carcassoni, M and Hancock, E R (2003) Correspondence matching with modal clusters. IEEE Transactions on Pattern Analysis and Machine Intelligence. pp. 1609-1615. ISSN 0162-8828Full text available as:
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.
|Copyright, Publisher and Additional Information:||Copyright © 2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Keywords:||point-pattern matching, spectral graph theory, robust statistics, hierarchy, EM ALGORITHM, CORNER DETECTION, SHAPE|
|Academic Units:||The University of York > Computer Science (York)|
|Depositing User:||Repository Officer|
|Date Deposited:||21 Feb 2007|
|Last Modified:||17 Oct 2013 14:28|