By Topic

Faster affine invariant point pattern matching using graphical models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Feiyue He ; Sch. of Sci., Northwestern Polytech. Univ., Xi''an, China ; Zheng Tian ; Xingshi He ; Lijuan Yang
more authors

This paper proposed a fast junction tree algorithm for performing affine invariant point pattern matching using probabilistic Graphical models. First we utilize the convex hull of point-sets and least square method to obtain three non-collinear reference points, which are then used to compute affine-invariant features. Then we propose a dynamic programming algorithm on junction tree for point pattern matching problem which is efficient and guaranteed to find a maximum probability configuration. Experiments were carried out on both synthetic data and real-world data. The results show our algorithm is significantly faster and have higher accuracy compare to existing algorithm.

Published in:

Computer Science and Automation Engineering (CSAE), 2011 IEEE International Conference on  (Volume:4 )

Date of Conference:

10-12 June 2011