Self-Normalized Linear Tests

Abstract

Making decisions based on a linear combination L of features is of course very common in pattern recognition. For distinguishing between two hypotheses or classes, the test is of the form sign (L - /spl tau/) for some threshold /spl tau/. Due mainly to fixing /spl tau/, such tests are sensitive to changes in illumination and other variations in imaging conditions. We propose a special case, a "self-normalized linear test" (SNLT), hard-wired to be of the form sign (L/sub 1/ - L/sub 2/) with unit weights. The basic idea is to "normalize" L/sub 1/, which involves the usual discriminating features, by L/sub 2/, which is composed of non-discriminating features. For a rich variety of features (e.g., based directly on intensity differences), SNLTs are largely invariant to illumination and robust to unexpected background variations. Experiments in face detection are promising: they confirm the expected invariances and out-perform some previous results in a hierarchical framework.

Cite

Text

Gangaputra and Geman. "Self-Normalized Linear Tests." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2004. doi:10.1109/CVPR.2004.225

Markdown

[Gangaputra and Geman. "Self-Normalized Linear Tests." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2004.](https://mlanthology.org/cvpr/2004/gangaputra2004cvpr-self/) doi:10.1109/CVPR.2004.225

BibTeX

@inproceedings{gangaputra2004cvpr-self,
  title     = {{Self-Normalized Linear Tests}},
  author    = {Gangaputra, Sachin and Geman, Donald},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2004},
  pages     = {616-622},
  doi       = {10.1109/CVPR.2004.225},
  url       = {https://mlanthology.org/cvpr/2004/gangaputra2004cvpr-self/}
}