Model-based matching using simulated annealing and a minimum-representation-size criterion

Ravi B. Ravichandran; Arthur C. Sanderson

doi:10.1117/12.56754

1 March 1992 Model-based matching using simulated annealing and a minimum-representation-size criterion

Ravi B. Ravichandran, Arthur C. Sanderson

Proceedings Volume 1612, Cooperative Intelligent Robotics in Space II; (1992) https://doi.org/10.1117/12.56754
Event: Robotics '91, 1991, Boston, MA, United States

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.

Citation Download Citation

Ravi B. Ravichandran and Arthur C. Sanderson "Model-based matching using simulated annealing and a minimum-representation-size criterion", Proc. SPIE 1612, Cooperative Intelligent Robotics in Space II, (1 March 1992); https://doi.org/10.1117/12.56754

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available