Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (20): 14-17.

• 博士论坛 • Previous Articles     Next Articles

Subspace sample selection for SVM on face recognition

JIANG Wen-han,ZHOU Xiao-fei,YANG Jing-yu   

  1. Department of Computer Science and Technology,Nanjing University of Science and Technology,Nanjing,210094,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-07-11 Published:2007-07-11
  • Contact: JIANG Wen-han



  1. 南京理工大学 计算机科学与技术学院 南京 210094
  • 通讯作者: 姜文瀚

Abstract: Sample selection is an important topic for SVM.To attack it,a novel intra-class method based on subspace approximation of training class dataset is proposed in this paper.In one class,the subspace of the chosen set is used to approximate that of the original set.An iterative algorithm is employed to realize this process.The furthest sample to the subspace of the chosen set is selected at each step.The comparative experiments on the training-synthetic set of the MIT-CBCL face recognition database show that much lower selection ratio,much less sampling time and much faster test speed has been obtained by this approach combined with linear SVM without a loss of accuracy.

Key words: sample selection, subspace, Support Vector Machine(SVM), face recognition, pattern classification

摘要: 训练样本选择是支持向量机应用研究领域的重要课题之一。为此提出了一种类内模式选择新方法。该方法从选择集子空间逼近原类别样本子空间的思想出发,通过迭代,逐一选择那些到已选样本集所在子空间距离最远的样本。在MIT-CBCL人脸识别数据库training-synthetic子库上的同其他方法的比较识别实验中,表明该文方法在选样比率、选样时间以及SVM测试时间等方面均取得了较为明显的优势。

关键词: 样本选择, 子空间, 支持向量机, 人脸识别, 模式分类