关键词: 人脸识别, 组稀疏表示, 块正交匹配追踪

Abstract: When the group sparse representation is used to face recognition, the same samples take part in representation of the test sample at the same time. The original method ignores the correlation between the samples. To solve this problem, an improved block orthogonal matching pursuit algorithm is presented. The presented algorithm uses the coherent coefficient of the samples as a parameter, setting the proper threshold value to select sample discrimination. Therefore, the reconstruction of the algorithm is optimized. Experiments on the Yale B database and the ORL database show that the recognition rate of improved algorithm is higher than the original one. The experiment results verify the validity of the proposed algorithm.

Key words: face recognition, group sparse representation, block orthogonal matching pursuit