A unified formulation of invariant point pattern matching
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]
|Collections||ANU Research Publications|
|Source:||Proceedings of the 18th International Conference on Pattern Recognition|
|01_Caetano_A_unified_formulation_of_2006.pdf||759.1 kB||Adobe PDF||Request a copy|
|02_Caetano_A_unified_formulation_of_2006.pdf||97.58 kB||Adobe PDF||Request a copy|
|03_Caetano_A_unified_formulation_of_2006.pdf||290.21 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.