Sparse representation scheme with enhanced medium pixel intensity for face recognition

• Published in: CAAI Transactions on Intelligence Technology Vol. 9; no. 1; pp. 116 - 127
• Main Authors: Zhang, Xuexue, Zhang, Yongjun, Wang, Zewei, Long, Wei, Gao, Weihao, Zhang, Bob
• Format: Journal Article
• Language: English
• Published: Beijing John Wiley & Sons, Inc 01.02.2024; Wiley
• Subjects: Accuracy; Algorithms; Classification; computer vision; Dictionaries; Face recognition; Feature extraction; Formability; Image classification; image representation; Occlusion; Pixels; Representations; Sparsity; Teaching methods
• ISSN: 2468-2322; 2468-6557; 2468-2322
• DOI: 10.1049/cit2.12247

Sparse representation is an effective data classification algorithm that depends on the known training samples to categorise the test sample. It has been widely used in various image classification tasks. Sparseness in sparse representation means that only a few of instances selected from all training samples can effectively convey the essential class‐specific information of the test sample, which is very important for classification. For deformable images such as human faces, pixels at the same location of different images of the same subject usually have different intensities. Therefore, extracting features and correctly classifying such deformable objects is very hard. Moreover, the lighting, attitude and occlusion cause more difficulty. Considering the problems and challenges listed above, a novel image representation and classification algorithm is proposed. First, the authors’ algorithm generates virtual samples by a non‐linear variation method. This method can effectively extract the low‐frequency information of space‐domain features of the original image, which is very useful for representing deformable objects. The combination of the original and virtual samples is more beneficial to improve the classification performance and robustness of the algorithm. Thereby, the authors’ algorithm calculates the expression coefficients of the original and virtual samples separately using the sparse representation principle and obtains the final score by a designed efficient score fusion scheme. The weighting coefficients in the score fusion scheme are set entirely automatically. Finally, the algorithm classifies the samples based on the final scores. The experimental results show that our method performs better classification than conventional sparse representation algorithms.