By Topic

Sampling of images for efficient model-based vision

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

3 Author(s)
Akra, M. ; Dept. of Electr. Eng. & Comput. Sci., MIT, Cambridge, MA, USA ; Bazzi, L. ; Mitter, S.

The problem of matching two planar sets of points in the presence of geometric uncertainty has important applications in pattern recognition, image understanding, and robotics. The first set of points corresponds to the “template.” The other set corresponds to the “image” that-possibly-contains one or more deformed versions of the “template” embedded in a cluttered image. Significant progress has been made on this problem and various polynomial-time algorithms have been proposed. We show how to sample the “image” in linear time, reducing the number of foreground points n by a factor of two-six (for commonly occurring images) without degrading the quality of the matching results. The direct consequence is a time-saving by a factor of 2p-6p for an O(np) matching algorithm. Our result applies to a fairly large class of available matching algorithms

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:21 ,  Issue: 1 )