Faster graphical models for point-pattern matching

Authors: Caetano, Tibério S.¹; McAuley, Julian J.²

Source: Spatial Vision, Volume 22, Number 5, 2009 , pp. 443-453(11)

Buy & download fulltext article:

Price: $35.00 plus tax (Refund Policy)

Abstract:

It has been shown that isometric matching problems can be solved exactly in polynomial time, by means of a Junction Tree with small maximal clique size. Recently, an iterative algorithm was presented which converges to the same solution an order of magnitude faster. Here, we build on both of these ideas to produce an algorithm with the same asymptotic running time as the iterative solution, but which requires only a single iteration of belief propagation. Thus our algorithm is much faster in practice, while maintaining similar error rates.

Keywords: POINT-PATTERN MATCHING; GRAPHICAL MODELS; ISOMETRIC MATCHING

Document Type: Research article

DOI: http://dx.doi.org/10.1163/156856809789476083

Affiliations: 1: Statistical Machine Learning Program, NICTA, and the Research School of Information Sciences and Engineering, ANU, Canberra, Australia 2: Statistical Machine Learning Program, NICTA, and the Research School of Information Sciences and Engineering, ANU, Canberra, Australia. Email: julian.mcauley@nicta.com.au

Publication date: 2009-09-01

More about this publication?