Skip navigation
Skip navigation

A unified formulation of invariant point pattern matching

Caetano, Tiberio; Caelli, Terry


We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model. By using a specific kind of graph topology, different types of invariant matching models can be implemented via tree-width selection. Models with tree-widths 1, 2, 3 and 4 implement translation, similarity, affine and protective invariant point matching, respectively. The optimal match is then found by exploiting the...[Show more]

CollectionsANU Research Publications
Date published: 2006
Type: Conference paper
Source: Proceedings of the 18th International Conference on Pattern Recognition
DOI: 10.1109/ICPR.2006.192


File Description SizeFormat Image
01_Caetano_A_unified_formulation_of_2006.pdf759.1 kBAdobe PDF    Request a copy
02_Caetano_A_unified_formulation_of_2006.pdf97.58 kBAdobe PDF    Request a copy
03_Caetano_A_unified_formulation_of_2006.pdf290.21 kBAdobe PDF    Request a copy

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

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator