Recognizing imprecisely localized, partially occluded, and expression variant faces from a single sample per class

Purdue University West Lafayette

Indexed incrossref

Abstract

The classical way of attempting to solve the face (or object) recognition problem is by using large and representative data sets. In many applications, though, only one sample per class is available to the system. In this contribution, we describe a probabilistic approach that is able to compensate for imprecisely localized, partially occluded, and expression-variant faces even when only one single training sample per class is available to the system. To solve the localization problem, we find the subspace (within the feature space, e.g., eigenspace) that represents this error for each of the training images. To resolve the occlusion problem, each face is divided into k local regions which are analyzed in…

Citation impact

822
total citations
FWCI
18.39
Percentile
100%
References
92
Citations per year

Authors

1

Topics & keywords

Keywords
  • Pattern recognition (psychology)
  • Artificial intelligence
  • Subspace topology
  • Probabilistic logic
  • Expression (computer science)
  • Computer science
  • Facial recognition system
  • Face (sociological concept)
No related works found for this paper.

Funding