会议专题

Face Recognition Based on Maximum Sparse Coefficients of Object Region

  Face recognition is an active topic in recognition systems,while face occlusion is one of the most challenging problems for recognition.Recently,robust sparse coding achieved the state-of-the-art performance,especially when dealing with occluded images.However,robust sparse coding is known that only guarantees the coefficient is global sparse when solving sparse coefficients.In this paper,we enable the elements in the object region to approximate global maximum by fitting the distribution of elements in the object region with successful recognition.The efficacy of the proposed approach is verified on publicly available databases.Furthermore,our method can achieve much better performance when the training samples are limited.

Face recognition Maximum sparse coefficient Occlusion

Zineng Xu Hongjun Li Xiangyu Jin Ching Y. Suen

School of Electronic Information Engineering,Nantong University,Nantong 226019,China School of Electronic Information Engineering,Nantong University,Nantong 226019,China;Centre for Patt Centre for Pattern Recognition and Machine Intelligence,Concordia University,Montreal,QC H3G 1M8,Can

国际会议

The 2015 Chinese Intelligent Automation Conference(2015中国智能自动化会议)

福州

英文

43-51

2015-05-08(万方平台首次上网日期,不代表论文的发表时间)