A Robust Group-Sparse Representation Variational Method With Applications to Face Recognition

You are here

Top Reasons to Join SPS Today!

1. IEEE Signal Processing Magazine
2. Signal Processing Digital Library*
3. Inside Signal Processing Newsletter
4. SPS Resource Center
5. Career advancement & recognition
6. Discounts on conferences and publications
7. Professional networking
8. Communities for students, young professionals, and women
9. Volunteer opportunities
10. Coming soon! PDH/CEU credits
Click here to learn more.

A Robust Group-Sparse Representation Variational Method With Applications to Face Recognition

By: 
Fritz Keinert; Damiana Lazzaro; Serena Morigi

In this paper, we propose a Group-Sparse Representation-based method with applications to Face Recognition (GSR-FR). The novel sparse representation variational model includes a non-convex sparsity-inducing penalty and a robust non-convex loss function. The penalty encourages group sparsity by using an approximation of the 0 -quasinorm, and the loss function is chosen to make the algorithm robust to noise, occlusions, and disguises. The solution of the non-trivial non-convex optimization problem is efficiently obtained by a majorization-minimization strategy combined with forward-backward splitting, which, in particular, reduces the solution to a sequence of easier convex optimization sub-problems. Extensive experiments on widely used face databases show the potentiality of the proposed model and demonstrate that the GSR-FR algorithm is competitive with the state-of-the-art methods based on sparse representation, especially for very low dimensional feature spaces.

SPS on Twitter

SPS Videos


Signal Processing in Home Assistants

 


Multimedia Forensics


Careers in Signal Processing             

 


Under the Radar