Model-based matching using simulated annealing and a minimum-representation-size criterion
暂无分享,去创建一个
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.
[1] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.
[2] R. Bolles,et al. Recognizing and Locating Partially Visible Objects: The Local-Feature-Focus Method , 1982 .
[3] H. Baird. Model-Based Image Matching Using Location , 1985 .
[4] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.