首页 | 本学科首页   官方微博 | 高级检索  
     

基于块对角投影表示的人脸识别
引用本文:刘保龙,王勇,李丹萍,王磊. 基于块对角投影表示的人脸识别[J]. 北京航空航天大学学报, 2021, 47(3): 623-631. DOI: 10.13700/j.bh.1001-5965.2020.0460
作者姓名:刘保龙  王勇  李丹萍  王磊
作者单位:1.西安电子科技大学青岛计算技术研究院, 青岛 266000
基金项目:国家重点研发计划;陕西省自然科学基础研究计划;国家自然科学基金
摘    要:针对大多数特征表示算法在挖掘高维数据内在结构时容易受到噪声的影响,以及特征学习与分类器设计割裂导致分类性能降低的问题,提出了一种新的基于特征表示的人脸识别方法,称为块对角投影表示(BDPR)学习。首先,利用样本信息对每类样本的编码系数施加一个加权矩阵,通过局部约束来加强表示系数之间的相似性,从而降低噪声对系数学习的影响,使所提方法能够更好地保持数据的局部结构。其次,为了实现数据与编码系数相关联,降低表示系数的学习难度,构造了块对角化判别约束项来学习一个判别投影,通过投影从低维数据中提取样本表示系数,使系数包含更多的样本间全局结构信息且具有更低的计算复杂度。最后,将系数学习和分类器学习整合到同一框架下,同时增大不同类别样本间的“标签距离”,采用迭代求解的方式交替更新判别投影和分类器,最终得到最适合当前表示特征的分类器,使得所提方法能自动完成分类。多个公开的人脸数据集上的实验结果表明:较之传统的协作表示分类和多个主流的子空间学习方法,所提方法均取得了更优的识别效果。 

关 键 词:图像分类   特征表示   局部约束   判别投影   块对角化结构
收稿时间:2020-08-25

Block-diagonal projective representation for face recognition
LIU Baolong,WANG Yong,LI Danping,WANG Lei. Block-diagonal projective representation for face recognition[J]. Journal of Beijing University of Aeronautics and Astronautics, 2021, 47(3): 623-631. DOI: 10.13700/j.bh.1001-5965.2020.0460
Authors:LIU Baolong  WANG Yong  LI Danping  WANG Lei
Affiliation:1.Xidian University Qingdao Institute of Computing Technology, Qingdao 266000, China2.Key Laboratory of Marine Intelligent Equipment and System of Ministry of Education, Shanghai Jiao Tong University, Shanghai 200240, China3.School of Electronic Engineering, Xidian University, Xi'an 710071, China4.The 27 th Research Institute of China Electronics Technology Group Corporation, Zhengzhou 450047, China5.School of Telecommunications Engineering, Xidian University, Xi'an 710071, China
Abstract:Most feature representation algorithms are susceptible to noise when mining the internal structure of the high-dimensional data. Meanwhile, their feature learning and classifier design are separated, resulting in the limited classification performance in practice. Aimed at this issue, a new feature representation method, Block-Diagonal Projective Representation (BDPR), is proposed in this paper. First, a weighted matrix is imposed on the coding coefficients of samples over each class. By using such local constraints to enhance the similarity between the coefficients and reduce the impact of noise on coefficient learning, the proposed BDPR can well maintain the internal data structure. Second, to closely correlate the data with their coding coefficients and reduce the difficulty of learning the representation coefficients, we construct a block-diagonal constraint to learn a discriminative projection. In this way, the sample representation coefficients can be obtained in the low-dimensional projected subspace, which contains more global structure information between samples and enjoys lower computational complexity. Finally, the representation learning and classifier learning are integrated into the same framework. By increasing the "label distance" between samples of different classes, BDPR updates the discriminative projection and classifier in an iterative manner. In this way, the most suitable classifier can be found for the current optimal feature representation, making the proposed algorithm automatically realize the classification task. The results of experiments on multiple benchmark face datasets show that BDPR has achieved better recognition performance, compared to traditional collaborative representation based classification and several mainstream subspace learning algorithms. 
Keywords:
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《北京航空航天大学学报》浏览原始摘要信息
点击此处可从《北京航空航天大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号