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

人脸识别中的零范数稀疏编码
引用本文:郎利影,夏飞佳.人脸识别中的零范数稀疏编码[J].应用科学学报,2012,30(3):281-286.
作者姓名:郎利影  夏飞佳
作者单位:河北工程大学信息与电气工程学院,河北邯郸056038
基金项目:国家自然科学基金(No.60874116)资助
摘    要:为解决人脸识别中运算速度和识别效果之间的矛盾,提出了零范数稀疏编码算法. 该算法用零范数描述稀疏编码模型的稀疏度,通过对模型的间断点连续开拓,有效地提高了算法收敛速度. 运用ORL人脸数据库对该算法进行识别率和效率测试,并与非负稀疏编码算法和非负矩阵稀疏分解算法进行对比,表明文中提出的算法调节稀疏度的能力更强,可有效缩短运算时间,并在较短时间内获得较高的识别率.

关 键 词:人脸识别  稀疏编码  稀疏度  0  范数  
收稿时间:2010-09-12
修稿时间:2011-05-17

Zero-Norm Sparse Coding in Face Recognition
LANG Li-ying , XIA Fei-jia.Zero-Norm Sparse Coding in Face Recognition[J].Journal of Applied Sciences,2012,30(3):281-286.
Authors:LANG Li-ying  XIA Fei-jia
Institution:College of Information and Electrical Engineering, Hebei University of Engineering,; Handan 056038, Hebei Province, China  
Abstract:To avoid conflict between algorithmic efficiency and recognition effectiveness in face recognition, this paper proposes a zero-norm sparse coding algorithm.The algorithm uses zero-norm to describe sparsity of a sparse coding model and applies a strategy of continuous extension of discontinuity points to speed convergence.A test based on the ORL database show that the algorithm is more efficient in adjusting sparsity so that the computation time is reduced,and gives higher recognition rate as compared with the methods of nonnegative sparse coding and non-negative matrix factorization with sparseness constraints.
Keywords:face recognition  sparse coding  sparsity  zero-norm
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《应用科学学报》浏览原始摘要信息
点击此处可从《应用科学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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