A Robust Group-Sparse Representation Variational Method with applications to Face Recognition.

Area of Science:

• Computer Vision
• Machine Learning
• Pattern Recognition

Background:

• Face recognition systems often struggle with noise, occlusions, and disguises.
• Existing sparse representation methods can be sensitive to these challenges.
• Developing robust and efficient face recognition algorithms is crucial.

Purpose of the Study:

• To propose a novel Group-Sparse Representation based method for Face Recognition (GSR-FR).
• To enhance robustness against noise, occlusions, and disguises using non-convex optimization.
• To develop an efficient algorithm for solving the non-convex optimization problem.

Main Methods:

• Utilizing a non-convex sparsity-inducing penalty approximating the ℓ0-quasinorm to encourage group sparsity.
• Employing a robust non-convex loss function to handle noisy data and occlusions.
• Applying a majorization-minimization strategy with forward-backward splitting for efficient optimization.

Main Results:

• The proposed GSR-FR model demonstrates effectiveness in face recognition tasks.
• The algorithm shows robustness to various image degradations like noise and occlusions.
• Extensive experiments confirm the model's competitiveness with existing state-of-the-art methods, particularly in low-dimensional feature spaces.

Conclusions:

• The developed Group-Sparse Representation method offers a robust and efficient approach to face recognition.
• The combination of non-convex penalties and loss functions effectively addresses challenges in real-world face data.
• GSR-FR shows significant potential, especially for applications with limited feature dimensionality.