Skip navigation
Skip navigation

Approximating the problem, not the solution: An alternative view of point set matching

Caetano, Tiberio; Caelli, Terry


This work discusses the issue of approximation in point set matching. In general, one may have two classes of approximations when tackling a matching problem: (1) an algorithmic approximation which consists in using suboptimal procedures to infer the assignment, and (2), a representational approximation which involves a simplified and suboptimal model for the original data. Matching techniques have typically relied on the first approach by retaining the complete model and using suboptimal...[Show more]

CollectionsANU Research Publications
Date published: 2006
Type: Journal article
Source: Pattern Recognition
DOI: 10.1016/j.patcog.2005.10.005


File Description SizeFormat Image
01_Caetano_Approximating_the_problem,_not_2006.pdf305.77 kBAdobe PDF    Request a copy

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

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator