Affine invariant object recognition by voting match techniques
Therrien, Charles W.
MetadataShow full item record
This thesis begins with a general survey of different model based systems for object recognition. The advantage and disadvantage of those systems are discussed. A system is then selected for study because of its effective Affine invariant matching [Ref. 1] characteristic. This system involves two separate phases, the modeling and the recognition. One is done off-line and the other is done on-line. A Hashing technique is implemented to achieve fast accessing and voting. Different test data sets are used in experiments to illustrate the recognition capabilities of this system. This demonstrates the capabilities of partial match, recognizing objects under similarity transformation applied to the models, and the results of noise perturbation. The testing results are discussed, and related experiences and recommendations are presented.
RightsCopyright is reserved by the copyright owner
Showing items related by title, author, creator and subject.
Dolk, Daniel R.; Konsynski, Benn R. (1985);The premise that the personal computer/spreadsheet explosion will result in the evolution of model management within organizations is explored. The authors use Nolan's stage model of organizational data processing activity ...
Kao, Chang-Lung (Monterey, California. Naval Postgraduate School, 1989-12);In computer vision many techniques have been developed for object recognition. The affine invariant matching algorithm proposed by Hummel and Wolfson (1988) is a new and interesting method. Under affine invariant ...
Drake, Robert Gervase (1990-09);The goal of this study is to provide a single source of data that enables the selection of an appropriate voice recognition (VR) application for a decision support system (DSS) as well as for other computer applications. ...