Fast Object Recognition in Noisy Images Using Simulated Annealing
Abstract
A fast simulated annealing algorithm is developed for automatic object recognition. The object recognition problem is addressed as the problem of best describing a match between a hypothesized object and an image. The normalized correlation coefficient is used as a measure of the match. Templates are generated on-line during the search by transforming model images. Simulated annealing reduces the search time by orders of magnitude with respect to an exhaustive search. The algorithm is applied to the problem of how landmarks, e.g., traffic signs, can be recognized by a navigating robot. We illustrate the performance of our algorithm with real-world images of complicated scenes with traffic signs. False positive matches occur only for templates with very small information content. To avoid false positive matches, we propose a method to select model images for robust object recognition by measuring the information content of the model images. The algorithm works well in noisy images for model images with high information content.<<ETX>>
Cite
Text
Betke and Makris. "Fast Object Recognition in Noisy Images Using Simulated Annealing." IEEE/CVF International Conference on Computer Vision, 1995. doi:10.1109/ICCV.1995.466895Markdown
[Betke and Makris. "Fast Object Recognition in Noisy Images Using Simulated Annealing." IEEE/CVF International Conference on Computer Vision, 1995.](https://mlanthology.org/iccv/1995/betke1995iccv-fast/) doi:10.1109/ICCV.1995.466895BibTeX
@inproceedings{betke1995iccv-fast,
title = {{Fast Object Recognition in Noisy Images Using Simulated Annealing}},
author = {Betke, Margrit and Makris, Nicholas C.},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {1995},
pages = {523-530},
doi = {10.1109/ICCV.1995.466895},
url = {https://mlanthology.org/iccv/1995/betke1995iccv-fast/}
}