Share Email Print

Proceedings Paper

Model-based matching using simulated annealing and a minimum-representation-size criterion
Author(s): Ravi B. Ravichandran; Arthur C. Sanderson
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

We define the model based matching problem in terms of the correspondence and transformation that relate the model and scene and the search and evaluation measures needed to find the best correspondence and transformation. Simulated annealing is proposed as a method for search and optimization, and the minimum representation size criterion is used as the evaluation measure in an algorithm that finds the best correspondence. An algorithm based on simulated annealing is presented and evaluated. This algorithm is viewed as a part of an adaptive, hierarchical approach which provides robust results for a variety of model based matching problems.

Paper Details

Date Published: 1 March 1992
PDF: 11 pages
Proc. SPIE 1612, Cooperative Intelligent Robotics in Space II, (1 March 1992); doi: 10.1117/12.56754
Show Author Affiliations
Ravi B. Ravichandran, Rensselaer Polytechnic Institute (United States)
Arthur C. Sanderson, Rensselaer Polytechnic Institute (United States)

Published in SPIE Proceedings Vol. 1612:
Cooperative Intelligent Robotics in Space II
William E. Stoney, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?