The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (2003 vol.25)
pp: 1609-1615
ABSTRACT
<p><b>Abstract</b>—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.</p>
INDEX TERMS
Point-pattern matching, spectral graph theory, robust statistics, hierarchy.
CITATION
Marco Carcassoni, Edwin R. Hancock, "Correspondence Matching with Modal Clusters", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.25, no. 12, pp. 1609-1615, December 2003, doi:10.1109/TPAMI.2003.1251153
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool