Open AccessA probabilistic collaborative dictionary learning‐based approach for face recognition
Author(s) -
Lv Shilin,
Liang Jiuzhen,
Di Lan,
Yunfei Xia,
Hou ZhenJie
Publication year - 2021
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/ipr2.12068
Subject(s) - computer science , subspace topology , artificial intelligence , probabilistic logic , pattern recognition (psychology) , classifier (uml) , facial recognition system , convexity , sparse approximation , biometrics , machine learning , financial economics , economics
Abstract Although Sparse Representation based Classifier (SRC), a non‐parametric model, can obtain an interesting result for pattern recognition , a reasonable interpretation has been lacked for its classification mechanism. What is more, the training samples are used as off‐the‐shelf dictionary directly in SRC, which can make the feature hidden in the training samples hard be extracted. At the same time, the complexity of the algorithm is increased because of too many atoms of the dictionary. The authors first explains in detail the classification mechanism of SRC from the view of probabilistic collaborative subspace and offer the process to improve the stability of the algorithm using the joint probability in the case of the multi‐subspace. Then, the authors introduce the dictionary learning (DL) and Fisher criterion into the model to further enhance the discrimination of the coding coefficient. In order to ensure the convexity of the discrimination term and further enhance the discrimination, the authors add the L 21 ‐norm term into the Fisher discrimination term and offer the proof for its convexity. Finally, the experimental result on a series of benchmark databases, such as AR, Extended Yale B, LFW3D‐hassner, LFW3D‐sdm and LFW3D‐Dlib, show that PCDDL outperforms existing classical classification models.