Graphical Models and Point Pattern Matching

Date

Authors

Caetano, Tiberio

Caelli, Terry

Schuurmans, Dale

Barone, Dante

Publisher

Institute of Electrical and Electronics Engineers (IEEE Inc)

Abstract

This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We present a noniterative, polynomial time algorithm that is guaranteed to find an

Keywords

Keywords: algorithm; article; artificial intelligence; automated pattern recognition; computer assisted diagnosis; computer graphics; computer simulation; image enhancement; image subtraction; information retrieval; mathematical computing; methodology; signal proce Graph matching; Graphical models; Junction tree algorithm; Markov random fields; Point pattern matching

URI

http://hdl.handle.net/1885/33504

Collections

ANU Research Publications

Source

IEEE Transactions on Pattern Analysis and Machine Intelligence

Type

Journal article

DOI

10.1109/TPAMI.2006.207

Restricted until

2037-12-31

Downloads

File

Description

01_Caetano_Graphical_Models_and_Point_2006.pdf (2.45 MB)

02_Caetano_Graphical_Models_and_Point_2006.pdf (2.34 MB)