Memory Constrained Face Recognition

Abstract

Real-time recognition may be limited by scarce memory and computing resources for performing classification. Although, prior research has addressed the problem of training classifiers with limited data and computation, few efforts have tackled the problem of memory constraints on recognition. We explore methods that can guide the allocation of limited storage resources for classifying streaming data so as to maximize discriminatory power. We focus on computation of the expected value of information with nearest neighbor classifiers for online face recognition. Experiments on real-world datasets show the effectiveness and power of the approach. The methods provide a principled approach to vision under bounded resources, and have immediate application to enhancing recognition capabilities in consumer devices with limited memory.

Cite

Text

Kapoor et al. "Memory Constrained Face Recognition." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2012. doi:10.1109/CVPR.2012.6247971

Markdown

[Kapoor et al. "Memory Constrained Face Recognition." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2012.](https://mlanthology.org/cvpr/2012/kapoor2012cvpr-memory/) doi:10.1109/CVPR.2012.6247971

BibTeX

@inproceedings{kapoor2012cvpr-memory,
  title     = {{Memory Constrained Face Recognition}},
  author    = {Kapoor, Ashish and Baker, Simon and Basu, Sumit and Horvitz, Eric},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2012},
  pages     = {2539-2546},
  doi       = {10.1109/CVPR.2012.6247971},
  url       = {https://mlanthology.org/cvpr/2012/kapoor2012cvpr-memory/}
}