Visual object recognition using probabilistic kernel subspace similarity

  • Authors:
  • Jianguo Lee;Jingdong Wang;Changshui Zhang;Zhaoqi Bian

  • Affiliations:
  • Department of Automation, Tsinghua University, Beijing 100084, P.R. China;Department of Computer Science, Hongkong University of Science and Technology, Hongkong, P.R. China;Department of Automation, Tsinghua University, Beijing 100084, P.R. China;Department of Automation, Tsinghua University, Beijing 100084, P.R. China

  • Venue:
  • Pattern Recognition
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

Probabilistic subspace similarity-based face matching is an efficient face recognition algorithm proposed by Moghaddam et al. It makes one basic assumption: the intra-class face image set spans a linear space. However, there are yet no rational geometric interpretations of the similarity under that assumption. This paper investigates two subjects. First, we present one interpretation of the intra-class linear subspace assumption from the perspective of manifold analysis, and thus discover the geometric nature of the similarity. Second, we also note that the linear subspace assumption does not hold in some cases, and generalize it to nonlinear cases by introducing kernel tricks. The proposed model is named probabilistic kernel subspace similarity (PKSS). Experiments on synthetic data and real visual object recognition tasks show that PKSS can achieve promising performance, and outperform many other current popular object recognition algorithms.