By Topic

An improved ASIFT algorithm for matching repeated patterns

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
$33 $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

3 Author(s)
Christopher Le Brese ; School of Engineering, University of Western Sydney, Locked Bag 1797, Penrith South DC, NSW 1797, Australia ; Ju Jia Zou ; Brian Uy

Image matching is a well researched topic of computer vision. Several new algorithms have been developed in recent times to deal with repetitive pattern matching and affine invariant matching. This paper presents two improvements over the state-of-the-art Affine-Scale Invariant Feature Transform (ASIFT) algorithm. The first improvement enables ASIFT to match repetitive patterns through the use of Graph Transformation Matching. The second increases the accuracy of matching by estimating the transformation between views more precisely. Results show that the proposed method is able to successfully match repetitive patterns such as the checkerboard. An increase in the number of matches can also be seen for matching views under severe affine transformations or projections.

Published in:

2010 IEEE International Conference on Image Processing

Date of Conference:

26-29 Sept. 2010