Fast matching of large point sets under occlusions

Julian J. McAuley*, Tibério S. Caetano

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    19 Citations (Scopus)

    Abstract

    The problem of isometric point-pattern matching can be modeled as inference in small tree-width graphical models whose embeddings in the plane are said to be 'globally rigid'. Although such graphical models lead to efficient and exact solutions, they cannot generally handle occlusions, as even a single missing point may 'break' the rigidity of the graph in question. In addition, such models can efficiently handle point sets of only moderate size. In this paper, we propose a new graphical model that is not only adapted to handle occlusions but is much faster than previous approaches for solving the isometric point-pattern matching problem. We can match point-patterns with thousands of points in a few seconds.

    Original languageEnglish
    Pages (from-to)563-569
    Number of pages7
    JournalPattern Recognition
    Volume45
    Issue number1
    DOIs
    Publication statusPublished - Jan 2012

    Fingerprint

    Dive into the research topics of 'Fast matching of large point sets under occlusions'. Together they form a unique fingerprint.

    Cite this