Skip navigation
Skip navigation

Fast matching of large point sets under occlusions

McAuley, Julian; Caetano, Tiberio

Description

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...[Show more]

CollectionsANU Research Publications
Date published: 2011
Type: Journal article
URI: http://hdl.handle.net/1885/68099
Source: Pattern Recognition
DOI: 10.1016/j.patcog.2011.05.008

Download

File Description SizeFormat Image
01_McAuley_Fast_matching_of_large_point_2011.pdf394.21 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator