Algorithms for Pattern Rejection

August 1996

Algorithms for Pattern Rejection

Authors:

Simon Baker and S. K. Nayar

Abstract:

The efficiency of pattern recognition is particularly crucial in two situations; whenever there are a large number of classes to discriminate, and, whenever recognition must be performed a large number of times. We develop a number of algorithms to cope with the demands of these difficult conditions. The algorithms achieve high efficiency by using pattern rejectors. A pattern rejector is a generalization of a classifier that quickly eliminates a large fraction of the candidate classes or inputs. After applying a rejector the recognition algorithms can concentrate their computational efforts on verifying the small number of remaining possibilities. The generality of our algorithms is established through a close relationship with the Karhunen-Loeve expansion. We experimented on two representative applications, namely, object recognition and feature detection. The results demonstrate substantial efficiency improvements over existing approaches, most notably Fisher's discriminant analysis (1939).
@conference{Baker-1996-14197,
author = {Simon Baker And S. K. Nayar},
title = {Algorithms for Pattern Rejection},
booktitle = {Proceedings of 13th International Conference on Pattern Recognition (ICPR '96)},
year = {1996},
month = {August},
pages = {869 - 874},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.