The Realization of Face Recognition Algorithm Based on Compressed Sensing (Short Paper)

Once the sparse representation-based classifier (SRC) was raised, it achieved a more outstanding performance than typical classification algorithm. Normally, SRC algorithm adopts \(l_1\)-norm minimization method to solve the sparse vector, and its computation complexity increases correspondingly. In this paper, we put forward a compressed sensing reconstruction algorithm based on residuals. This algorithm utilizes the local sparsity within figures as well as the non-local similarity among figure blocks to boost the performance of the reconstruction algorithm while remaining a median computation complexity. It achieves a superior recognition rate in the experiments of Yale facial database.