Elastic Template Matching as a Basis for Visual Landmark Recognition and Spatial Navigation
نویسندگان
چکیده
We describe an efficient algorithm for visual landmark recognition based on elastic template matching. Each landmark is represented by a set of features and their spatial relations. The matching procedure allows for visual transformations such as translation and expansion, or even partial occlusion.
منابع مشابه
Evaluation of Similarity Measures for Template Matching
Image matching is a critical process in various photogrammetry, computer vision and remote sensing applications such as image registration, 3D model reconstruction, change detection, image fusion, pattern recognition, autonomous navigation, and digital elevation model (DEM) generation and orientation. The primary goal of the image matching process is to establish the correspondence between two ...
متن کاملVisual Tracking and Target Selection for Mobile Robots
This paper describes how tracking and target selection are used in two behavior systems of the XT-1 vision architecture for mobile robots. The first system is concerned with active tracking of moving targets and the second is used for visually controlled spatial navigation. We overview the XT-1 architecture and describe the role of expectation-based template matching for both target tracking an...
متن کاملWe Hereby Recommend That the Thesis Prepared under Our Supervision by David S. Bolme Entitled Elastic Bunch Graph Matching Be Accepted as Fulfill- Ing in Part Requirements for the Degree of Master of Science
OF THESIS ELASTIC BUNCH GRAPH MATCHING Elastic Bunch Graph Matching is a face recognition algorithm that is distributed with CSU’s Evaluation of Face Recognition Algorithms System. The algorithm is modeled after the Bochum/USC face recognition algorithm used in the FERET evaluation. The algorithm recognizes novel faces by first localizing a set of landmark features and then measuring similarity...
متن کاملTemplate-based Writer-independent Online Character Recognition System using Elastic Matching
A writer independent handwriting recognition system must be able to recognize a wide variety of handwriting styles, while attempting to obtain a high degree of recognition accuracy. As the number of writing styles increases, so does the variability of data distribution. We describe here a template-based system using a string matching distance measure of linear time complexity for the recognitio...
متن کاملOptimal Weighting of Landmarks for Face Recognition
A new method named Landmark Model Matching was recently proposed for fully automatic face recognition. It was inspired by Elastic Bunch Graph Matching and Active Shape Model. Landmark Model Matching consists of four phases: creation of the landmark distribution model, face finding, landmark finding, and recognition. A drawback in Landmark Model Matching is that, in the recognition phase, the we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997