THE SPARSE REPRESENTATION AND SMOOTHED L0 ALGORITHM FOR FACE RECOGNITION

The sparse representation based classification (SRC) can effectively improve the face recognition rate. Smoothed l(0) algorithm has much faster calculation speed and requires fewer measured values than the other sparse representation method. In this paper, the sparse representation and smoothed l(0) algorithm for face recognition are presented to improve the face recognition under various conditions such as face disguise, illumination and pose changes, etc. The experiments on the AR, Extended Yale B and FERET face database verify the effectiveness of the presented method. The experimental results show that the face recognition algorithm increases to a certain extent in terms of recognition robustness and time than the original SRC.