By Topic

Relaxation Matching Techniques-A Comparison

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

1 Author(s)
Price, Keith E. ; Intelligent Systems Group, University of Southern California, Los Angeles, CA 90089.

Many different relaxation schemes have been proposed for image analysis tasks. We have developed a general matching procedure for comparing semantic network descriptions of images, and we have implemented a variety of relaxation techniques. An automatic segmentation and description system is used to produce the image representations so that the matching procedures must cope with variations in feature values, missing objects, and possible multiple matches. This environment is used to test different relaxation matching schemes under a variety of conditions. The best performance (of those we compared), in terms of the number of iterations and the number of errors, is for the gradient-based optimization approach of Faugeras and Price. The related optimization approach of Hummel and Zucker performed almost as well, with differences primarily in difficult matches (i.e., where much of the evidence is against the match, for instance, poor segmentations). The product combination rule proposed by Peleg was extremely fast, indeed, too fast to work when global context is needed. The classical Rosenfeld, Hummel, and Zucker method is included for historical comparisons and performed only adequately, producing fewer correct matches and taking more iterations.

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:PAMI-7 ,  Issue: 5 )