Faster graphical models for point-pattern matching

Authors: Caetano, Tibério S.1; McAuley, Julian J.2

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

Publisher: VSP, an imprint of Brill

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

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: 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

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$25.00 plus tax      Refund Policy

 

OR

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A