Heteroscedastic Sparse Representation Based Classification for Face Recognition

Authors:
Hao Zheng;Jianchun Xie;Zhong Jin
Affiliations:
School of Computer Science and Technology, Nanjing University of Science and Technology, Nanjing, People's Republic of China 210094 and School of Mathematics and Information Technology, Nanjing Xi ...;School of Computer Science and Technology, Nanjing University of Science and Technology, Nanjing, People's Republic of China 210094;School of Computer Science and Technology, Nanjing University of Science and Technology, Nanjing, People's Republic of China 210094
Venue:
Neural Processing Letters
Year:
2012

Citing 19
Cited 0

Atomic Decomposition by Basis Pursuit

SIAM Journal on Scientific Computing
From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Framework of 2D Fisher Discriminant Analysis: Application to Face Recognition with Small Number of Training Samples

CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Visual Recognition and Inference Using Dynamic Overcomplete Sparse Learning

Neural Computation
Robust Face Recognition via Sparse Representation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Gabor feature based sparse representation for face recognition with gabor occlusion dictionary

ECCV'10 Proceedings of the 11th European conference on Computer vision: Part VI
Is face recognition really a Compressive Sensing problem?

CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
Are sparse representations really relevant for image classification?

CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
Matching pursuits with time-frequency dictionaries

IEEE Transactions on Signal Processing
Choosing Parameters of Kernel Subspace LDA for Recognition of Face Images Under Pose and Illumination Variations

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Greed is good: algorithmic results for sparse approximation

IEEE Transactions on Information Theory
On the exponential convergence of matching pursuits in quasi-incoherent dictionaries

IEEE Transactions on Information Theory
Compressed sensing

IEEE Transactions on Information Theory
Matching pursuit filters applied to face identification

IEEE Transactions on Image Processing
On the modeling of small sample distributions with generalized Gaussian density in a maximum likelihood framework

IEEE Transactions on Image Processing
Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries

IEEE Transactions on Image Processing
Sparse Representation for Color Image Restoration

IEEE Transactions on Image Processing
Estimation of shape parameter for generalized Gaussian distributions in subband decompositions of video

IEEE Transactions on Circuits and Systems for Video Technology
Sparse representation or collaborative representation: Which helps face recognition?

ICCV '11 Proceedings of the 2011 International Conference on Computer Vision

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sparse representation based classification (SRC) have received a great deal of attention in recent years. The main idea of SRC is to represent a given test sample as a sparse linear combina-tion of all training samples, then classifies the test sample by evaluating which class leads to the minimum residual. Although SRC has achieved good performance, especially in dealing with face occlusion and corruption, it must need a big occlusion dictionary which makes computation very expensive. In this paper, a novel method, called heteroscedastic sparse representation based classification (HSRC), is proposed to address this problem. In the presence of noises, the SRC model exists heteroscedasticity, which makes residual estimation inefficient. Therefore, heteroscedastic correction must be carried out for homoscedasticity by weighting various residuals with heteroscedastic estimation. As for heteroscedasticity, this paper establishes generalized Gaussian model through which to estimate. The proposed HSRC method is applied to face recognition (on the AR and Extended Yale B face databases). The experimental results show that HSRC has significantly less complexity than SRC, while it is more robust.