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.
KeywordsCompressed sensing Face recognition Feature extraction Sparse representation classification Image reconstruction
- 2.Fowler, J.E., Mun, S., Tramel, E.W.: Multiscale block compressed sensing with smoothed projected landweber reconstruction. In: Signal Processing Conference, Barcelona, pp. 564–568 (2011)Google Scholar
- 3.Liu, Y., Zhang, C., Kim, J.: Disparity-compensated total-variation minimization for compressed-sensed multiview image reconstruction. In: IEEE International Conference on Acoustics, Speech and Signal Processing, South Brisbane, pp. 1458–1462 (2015)Google Scholar
- 4.Mun, S., Fowler, J.E.: Block compressed sensing of images using directional transforms. In: IEEE International Conference on Image Processing, p. 547. IEEE (2010)Google Scholar
- 5.Tramel, E.W., Fowler, J.E.: Video compressed sensing with multihypothesis. In: Snowbird: Data Compression Conference, pp. 193–202. IEEE Computer Society (2011)Google Scholar