By the same authors

From the same journal

From the same journal

Correspondence matching with modal clusters

Research output: Contribution to journalArticle

Full text download(s)

Links

Published copy (DOI)

Author(s)

Department/unit(s)

Publication details

JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
DatePublished - Dec 2003
Issue number12
Volume25
Number of pages7
Pages (from-to)1609-1615
Original languageEnglish

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.

Bibliographical note

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.

    Research areas

  • point-pattern matching, spectral graph theory, robust statistics, hierarchy, EM ALGORITHM, CORNER DETECTION, SHAPE

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations