# Face Recognition Method under Adaptive Image Matching and Dictionary Learning Algorithm

Authors: Xue Lv; Mingxia Su; Zekun Wang
Journal: Computational Intelligence and Neuroscience
 (2023)

---

## Abstract

In this research, a robust face recognition method based on adaptive image matching and a dictionary learning algorithm was proposed. A Fisher discriminant constraint was introduced into the dictionary learning algorithm program so that the dictionary had certain category discrimination ability. The purpose was to use this technology to reduce the influence of pollution, absence, and other factors on face recognition and improve the recognition rate. The optimization method was used to solve the loop iteration to obtain the expected specific dictionary, and the selected specific dictionary was used as the representation dictionary in adaptive sparse representation. In addition, if a specific dictionary was placed in a seed space of the original training data, the mapping matrix can be used to represent the mapping relationship between the specific dictionary and the original training sample, and the test sample could be corrected according to the mapping matrix to remove the contamination in the test sample. Moreover, the feature face method and dimension reduction method were used to process the specific dictionary and the corrected test sample, and the dimensions were reduced to 25, 50, 75, 100, 125, and 150, respectively. In this research, the recognition rate of the algorithm in 50 dimensions was lower than that of the discriminatory low-rank representation method (DLRR), and the recognition rate in other dimensions was the highest. The adaptive image matching classifier was used for classification and recognition. The experimental results showed that the proposed algorithm had a good recognition rate and good robustness against noise, pollution, and occlusion. Health condition prediction based on face recognition technology has the advantages of being noninvasive and convenient operation.


---

## Body

## 1. Introduction

With the continuous development of social informatization, information security has gradually been widely considered by national security, public security, banking systems, e-commerce, and other fields with a high demand for information security. In recent years, the field of identity recognition technology has gradually become a popular subject at home and abroad [1, 2]. Traditional identification technology is mainly based on personal documents or passwords, which cause many inconveniences to the public because it is inconvenient to carry or forget them easily. Therefore, it is urgent to explore a fast, safe, and effective identification technology [3–5].The face recognition method has very important academic research value and wide application prospects. In recent years, the International Conference on Computer Vision and Pattern Recognition and other top conferences in the field of computer vision will contain many excellent papers related to face recognition methods. Many research institutions promote the development of face recognition methods through research and communication [6–8]. To date, research on face recognition technology has gained rich experience, but it is still limited in practical applications. For example, the face acquisition process may be affected by light intensity and the posture and expression of the recognized person, and the recognition is not robust. In addition, due to the occlusion of glasses, scarves, and other objects, the recognition image is incomplete, and the recognition accuracy is reduced [7–10]. Therefore, it is urgent to seek a more accurate, faster, and more robust face recognition technology.Phillips et al. [11] took the lead in applying it to face recognition research, and put forward sparse representation-based classification (SRC), which constructs a dictionary matrix from registered sample sets and calculates the sparse representation coefficient of the sample to be detected relative to the dictionary matrix by minimizing L1 norm. Finally, the reconstruction errors are calculated according to the sparse coefficients corresponding to each class, and the classification results are obtained. On this basis, Han et al. [12] proposed a face recognition algorithm based on kernel sparse representation to map the nonlinear separable samples into the high-dimensional feature space so that the test samples can be better represented linearly by the training sample set.This study was developed to explore the face recognition technology model based on adaptive sparse representation based on the extraction form of biometric features for face recognition. An adaptive innovative image matching and dictionary learning algorithm for robust face recognition methods is proposed, and the Fisher discriminant constraint dictionary learning algorithm program is introduced so that the dictionary can have a certain class identification capability. It aims to use the technology to reduce the influence of factors such as pollution and missing faces on face recognition and improve the recognition rate.


## 2. Methods

### 2.1. Face Recognition Based on Adaptive Sparse Representation

The face recognition technology of adaptive sparse representation is constructed on the basis of compressed sensing theory. All the collected face images of each person can be constructed into independent subspaces in the image space. It is assumed that the training samples of the same class are distributed in the same subspace; then, the samples of the same class can be represented by dictionary atoms of the same class. If massive training samples are collected to form a complete dictionary, a linear combination of training samples can be used to represent any one of the face images.The self-sparse representation coefficient of the test sample is obtained from a given dictionary. It is assumed that there ared faces; then, dictionary B is expressed as follows:(1)B=B1,B2,B3,⋯,Bd.B is a dictionary matrix composed of training samples, and Bi represents a subset of i.The test imageY is based on the dictionary B, and the sparse coding coefficient is obtained as follows:(2)k^=argminβY−Bk22+δkp,p=1.Reconstruction errors are calculated by sparse coefficients and classified as follows:(3)identityY=argminici.The above equation satisfiesci=Y−Biβ^i2,β^=β^1,β^2,β^3,⋯β^d, and β^i represents the coding coefficient of category i.


### 2.2. Dictionary Learning Algorithm Based on the Fisher Discriminant Constraint

Although face recognition technology can still obtain a satisfactory recognition effect under the condition of a small amount of noise pollution in the test image, it will still affect the performance of the face recognition method when the number of training samples is very small. Face recognition technology can directly construct a dictionary learning matrix after subsampling of training samples [13]. Due to the influence of interference information, the dictionary may lose considerable classification information hidden in the training samples and cannot represent the test samples completely and effectively. Therefore, a dictionary learning algorithm based on the Fisher criterion was adopted in this study to obtain the best dictionary matrix of classification ability and representation ability through training samples. In this study, the collected face images are preprocessed, and then the pixel values are rearranged. Principal component analysis (PCA) dimension reduction is adopted as the feature vector of the face, and the dictionary learning algorithm with the Fisher discriminant constraint is used to train the sample set to obtain the dictionary.The training sets are expressed as follows:(4)B=B1,B2,B3,⋯,BdM=Mi,M2,M3,⋯,Md.The sparse coefficient of the training sample is expressed as follows:(5)N=Ni,N2,N3,⋯,Nd.In the above equation,Bi represents the subset whose category is i, Mi represents the corresponding dictionary matrix of class i, and Ni represents the sparse coefficient of Bi. The dictionary learning is transformed into an objective function.(6)TM,N=argminM,NrB,M,N+δ1N1+δ2fN.In the above equation,rB,M,N represents the fidelity term of dictionary expression ability, N1 represents sparse constraint, fN represents the fidelity term of dictionary resolution, and δ1 and δ2 are fix quantifications.It is assumed that the coding coefficient of training sampleBi relative to dictionary M is as follows:(7)Mi=Ni1,Ni2,Ni3,⋯,Nid.In the above equation,Nij represents the corresponding coding coefficient of the j class. The training sample can be well expressed linearly by the dictionary, that is, Bi≈MNi. At the same time, the sample Bi can be expressed by Mi but cannot be expressed by Mj. As a result, there is the following equation.(8)rB,M,N=∑i=1drBi,M,Ni=∑i=1dBi−MNiF2+Bi−MNijF2+MjNijF2.To ensure the classification ability of dictionaryM on training samples in A, the Fisher discriminant constraint can be used to minimize the in-class error SIN and maximize the cumulative error SbN of decoding coefficient N of sample set B.(9)SIN=∑i=1dnipi−ppi−pT,SbN=∑i=1d∑Xixk−pixk−piT,In the above equation,pi and p represent the mean values of the encoding coefficient matrices Ni and N, respectively. Intuitively, fN is defined as follows:(10)fN=trSINi−trSbN.However, this function is unstable, so an additional elastic term is needed, optimized as follows:(11)fN=trSINi−trSbN+λNF2.In the above equation,rB,M,N can ensure that the training set is represented by a linear combination of the dictionary basis vectors of the class so that dictionary M can show the best ability for any sample in the training sample set, fN can ensure the minimum intraclass error value and the maximum interclass error value in the training sample coding coefficient so that dictionary M can obtain the optimal classification ability.


### 2.3. Low-Rank Matrix Recovery

In face recognition sample collection, training samples may be contaminated and missing, which directly affects the final effect of face recognition technology. Partial matrix restoration is applied to the algorithm to obtain a better recognition effect, and a low-rank matrix is widely used. The low-rank matrix considers that if only a small part of dictionaryM is polluted, it can be decomposed into the sum of the low-rank matrix and sparse error matrix to realize the recovery of dictionary M.(12)M=L+E.In the above equation,L is a low-rank matrix, and E is a coefficient error matrix. The robust principal component analysis (RPCA) method is used to recover the low-rank matrix L even if dictionary M is highly polluted, where the sparse error matrix E is considered to be arbitrarily sparse. The RPCA model is as follows:(13)minL,ErankL+ξE0,s.t.M=L+E.In the above equation,ξ represents the regularization parameter. On the basis of the RPCA model, the following model is proposed.(14)minZ,EE∗+ξEλ,s.t.M=AZ+E.In the above equation,·λ represents different regularization strategies for different degrees of pollution, and A represents a given dictionary.


### 2.4. Classification Method Based on Gaussian Mixture Sparse Representation

According to the face recognition algorithm of self-sparse representation, the similarity between each test input image and the training image can be represented by the reconstruction error of the corresponding category of face. It is assumed that the coding coefficient matrix of the classi training sample is Gi=Gi1,Gi2,Gi3,⋯,Gid. After calculation, the following equation is obtained as follows:(15)hi=γθ^−zi22+Y−Miθ^i22θ^i22,The above equation satisfieszi=1/p∑jGij, which is the mean value of the coding coefficient of the class i sample. identityY=argminihi is used to calculate the category of test samples. The face recognition process in this study is shown in Figure 1.Figure 1
Flow chart of face recognition.


### 2.5. The Realization Process of Health Condition Prediction Technology Based on Face Recognition

There are two most commonly used methods to collect face images for health prediction. One is the traditional method based on geometric extraction, and the other is the widely used method based on a dictionary learning algorithm. The process of health prediction based on the dictionary learning algorithm is shown in Figure2.Figure 2
Health condition based on the dictionary learning algorithm.


### 2.6. Experimental Database and Experimental Environment

To verify the effectiveness and robustness of the proposed algorithm, many experiments were carried out in the Active Record (AR) face database [14] and the Extended Yale B face database [15], and relevant experimental data were obtained. The Extended Yale B face database included full-face images of 36 people with different expressions and occluders under 52 different lighting conditions, some of which are damaged. A total of 2,356 intact face images were selected as test samples. The AR face database included more than 4,000 images of 74 men and 58 women with different expressions, lighting, and shading. The unoccluded subset of 100 classes is selected as test samples. Some classical algorithms are selected for comparison, including sparse representation-based classification (SRC) [16], cyclic redundancy check (CRC) [17], regularized robust coding for face recognition (RRC) [18], low-rank matrix recovery with structural incoherence (LR) [19], extended sparse representation-based classification (ESRC) [20], and discriminative low-rank representation method (DLRR) [21]. All experiments are carried out on a computer with an Intel(R), Xeon(R), CPU E5-2630 processor, 64G memory, and MATLAB version R2014b [22].


## 2.1. Face Recognition Based on Adaptive Sparse Representation

The face recognition technology of adaptive sparse representation is constructed on the basis of compressed sensing theory. All the collected face images of each person can be constructed into independent subspaces in the image space. It is assumed that the training samples of the same class are distributed in the same subspace; then, the samples of the same class can be represented by dictionary atoms of the same class. If massive training samples are collected to form a complete dictionary, a linear combination of training samples can be used to represent any one of the face images.The self-sparse representation coefficient of the test sample is obtained from a given dictionary. It is assumed that there ared faces; then, dictionary B is expressed as follows:(1)B=B1,B2,B3,⋯,Bd.B is a dictionary matrix composed of training samples, and Bi represents a subset of i.The test imageY is based on the dictionary B, and the sparse coding coefficient is obtained as follows:(2)k^=argminβY−Bk22+δkp,p=1.Reconstruction errors are calculated by sparse coefficients and classified as follows:(3)identityY=argminici.The above equation satisfiesci=Y−Biβ^i2,β^=β^1,β^2,β^3,⋯β^d, and β^i represents the coding coefficient of category i.


## 2.2. Dictionary Learning Algorithm Based on the Fisher Discriminant Constraint

Although face recognition technology can still obtain a satisfactory recognition effect under the condition of a small amount of noise pollution in the test image, it will still affect the performance of the face recognition method when the number of training samples is very small. Face recognition technology can directly construct a dictionary learning matrix after subsampling of training samples [13]. Due to the influence of interference information, the dictionary may lose considerable classification information hidden in the training samples and cannot represent the test samples completely and effectively. Therefore, a dictionary learning algorithm based on the Fisher criterion was adopted in this study to obtain the best dictionary matrix of classification ability and representation ability through training samples. In this study, the collected face images are preprocessed, and then the pixel values are rearranged. Principal component analysis (PCA) dimension reduction is adopted as the feature vector of the face, and the dictionary learning algorithm with the Fisher discriminant constraint is used to train the sample set to obtain the dictionary.The training sets are expressed as follows:(4)B=B1,B2,B3,⋯,BdM=Mi,M2,M3,⋯,Md.The sparse coefficient of the training sample is expressed as follows:(5)N=Ni,N2,N3,⋯,Nd.In the above equation,Bi represents the subset whose category is i, Mi represents the corresponding dictionary matrix of class i, and Ni represents the sparse coefficient of Bi. The dictionary learning is transformed into an objective function.(6)TM,N=argminM,NrB,M,N+δ1N1+δ2fN.In the above equation,rB,M,N represents the fidelity term of dictionary expression ability, N1 represents sparse constraint, fN represents the fidelity term of dictionary resolution, and δ1 and δ2 are fix quantifications.It is assumed that the coding coefficient of training sampleBi relative to dictionary M is as follows:(7)Mi=Ni1,Ni2,Ni3,⋯,Nid.In the above equation,Nij represents the corresponding coding coefficient of the j class. The training sample can be well expressed linearly by the dictionary, that is, Bi≈MNi. At the same time, the sample Bi can be expressed by Mi but cannot be expressed by Mj. As a result, there is the following equation.(8)rB,M,N=∑i=1drBi,M,Ni=∑i=1dBi−MNiF2+Bi−MNijF2+MjNijF2.To ensure the classification ability of dictionaryM on training samples in A, the Fisher discriminant constraint can be used to minimize the in-class error SIN and maximize the cumulative error SbN of decoding coefficient N of sample set B.(9)SIN=∑i=1dnipi−ppi−pT,SbN=∑i=1d∑Xixk−pixk−piT,In the above equation,pi and p represent the mean values of the encoding coefficient matrices Ni and N, respectively. Intuitively, fN is defined as follows:(10)fN=trSINi−trSbN.However, this function is unstable, so an additional elastic term is needed, optimized as follows:(11)fN=trSINi−trSbN+λNF2.In the above equation,rB,M,N can ensure that the training set is represented by a linear combination of the dictionary basis vectors of the class so that dictionary M can show the best ability for any sample in the training sample set, fN can ensure the minimum intraclass error value and the maximum interclass error value in the training sample coding coefficient so that dictionary M can obtain the optimal classification ability.


## 2.3. Low-Rank Matrix Recovery

In face recognition sample collection, training samples may be contaminated and missing, which directly affects the final effect of face recognition technology. Partial matrix restoration is applied to the algorithm to obtain a better recognition effect, and a low-rank matrix is widely used. The low-rank matrix considers that if only a small part of dictionaryM is polluted, it can be decomposed into the sum of the low-rank matrix and sparse error matrix to realize the recovery of dictionary M.(12)M=L+E.In the above equation,L is a low-rank matrix, and E is a coefficient error matrix. The robust principal component analysis (RPCA) method is used to recover the low-rank matrix L even if dictionary M is highly polluted, where the sparse error matrix E is considered to be arbitrarily sparse. The RPCA model is as follows:(13)minL,ErankL+ξE0,s.t.M=L+E.In the above equation,ξ represents the regularization parameter. On the basis of the RPCA model, the following model is proposed.(14)minZ,EE∗+ξEλ,s.t.M=AZ+E.In the above equation,·λ represents different regularization strategies for different degrees of pollution, and A represents a given dictionary.


## 2.4. Classification Method Based on Gaussian Mixture Sparse Representation

According to the face recognition algorithm of self-sparse representation, the similarity between each test input image and the training image can be represented by the reconstruction error of the corresponding category of face. It is assumed that the coding coefficient matrix of the classi training sample is Gi=Gi1,Gi2,Gi3,⋯,Gid. After calculation, the following equation is obtained as follows:(15)hi=γθ^−zi22+Y−Miθ^i22θ^i22,The above equation satisfieszi=1/p∑jGij, which is the mean value of the coding coefficient of the class i sample. identityY=argminihi is used to calculate the category of test samples. The face recognition process in this study is shown in Figure 1.Figure 1
Flow chart of face recognition.


## 2.5. The Realization Process of Health Condition Prediction Technology Based on Face Recognition

There are two most commonly used methods to collect face images for health prediction. One is the traditional method based on geometric extraction, and the other is the widely used method based on a dictionary learning algorithm. The process of health prediction based on the dictionary learning algorithm is shown in Figure2.Figure 2
Health condition based on the dictionary learning algorithm.


## 2.6. Experimental Database and Experimental Environment

To verify the effectiveness and robustness of the proposed algorithm, many experiments were carried out in the Active Record (AR) face database [14] and the Extended Yale B face database [15], and relevant experimental data were obtained. The Extended Yale B face database included full-face images of 36 people with different expressions and occluders under 52 different lighting conditions, some of which are damaged. A total of 2,356 intact face images were selected as test samples. The AR face database included more than 4,000 images of 74 men and 58 women with different expressions, lighting, and shading. The unoccluded subset of 100 classes is selected as test samples. Some classical algorithms are selected for comparison, including sparse representation-based classification (SRC) [16], cyclic redundancy check (CRC) [17], regularized robust coding for face recognition (RRC) [18], low-rank matrix recovery with structural incoherence (LR) [19], extended sparse representation-based classification (ESRC) [20], and discriminative low-rank representation method (DLRR) [21]. All experiments are carried out on a computer with an Intel(R), Xeon(R), CPU E5-2630 processor, 64G memory, and MATLAB version R2014b [22].


## 3. Results

### 3.1. Test Results on the AR Database

The AR face database is composed of 128 people with more than 3,500 frontal face images. This experiment used one of the subdatabases, including 74 males and 58 females under different illumination, expression, and more than 4,000 pictures. Everyone contains 13 images, including seven sharp images without sunscreen, three images of the sunglasses, and three images of the scarves. Of these, 100 class subsets without sunscreen are selected as test samples.In this experiment, 4 images without occlusion in the first subset of each person are selected as training samples, and 4 images without occlusion in the second subset of each person are selected as test samples. In the PCA dimension reduction process, the dimensions are reduced to 25, 50, 75, 100, 125, and 150. The parameters in dictionary decomposition areτ=0.01,λ=1.4,δ=0.8v,η=1.2v. The experimental results are shown in Figure 3. According to Figure 3, the algorithm proposed in this study has the highest recognition rate in all dimensions except in dimension 50,which is lower than that of DLRR. Because the face images of both training samples and test samples are nonoccluded, the superiority of the proposed algorithm cannot be fully reflected. However, according to the data results, it is found that the proposed algorithm has a high recognition rate.Figure 3
Recognition rates of unoccluded training samples in the AR face database.


### 3.2. Test Results on the Extended Yale B Database

Some images in the Extended Yale B face database are corrupted. Among them, 2,356 complete face images were selected as test samples. Figure4 shows some samples using the Extended Yale B face database. Using the feature face method, the dimensions are reduced to 25, 50, 75, 100, 125, and 150. The parameters in dictionary decomposition are τ=0.01,λ=1.2,δ=0.8v,η=1.2v. In this research, some classical algorithms, SRC, CRC, RRC, LR, ESRC, DLRR, and DLRR are selected for comparison. The average recognition rate calculated after 10 runs is shown in Figure 4. In the Extended Yale B face database, the recognition rate of the algorithm presented in this study is close to that of RRC and DLRR and higher than that of other types of algorithms in other dimensions except the 150-dimension.Figure 4
Recognition rate of Extended Yale B face database.


### 3.3. Dirty Face Recognition Experiments

In this experiment, two kinds of artificial pollution methods are used: pixel pollution and pixel block pollution. Some training samples without occlusion in the AR face database are selected and applied to the experiment of artificially adding pixel pollution. Four images without occlusion in the first subset of each person are used as training samples, and four images without occlusion in the second subset are used as test samples. In this experiment, some samples with 10% or 20% artificial pixel pollution are considered. In the acute dimension reduction treatment with the feature face method, the dimensions are reduced to 25, 50, 75, 100, 125, and 150. The parameters during dictionary decomposition are set toτ=0.01,λ=1.1,δ=0.8v,η=1.2v. After the experiment is run 15 times, the average value is calculated and are shown in Figures 5(a) and 5(b).Figure 5
Recognition rate of the AR face database with pixel contamination. (a) Recognition rate of 10% added pixel pollution; (b) recognition rate of 20% added pixel pollution.
(a)(b)


### 3.4. Experiments with Real Shielding

To verify the effectiveness and robustness of the proposed algorithm, the AR face database is selected for the experiment when the sample contains real occlusion. According to the characteristics of AR face database images, three experiments are set up, and the dimensions are reduced to 25, 50, 75, 100, 125, and 150 in the dimension reduction process using the feature face method. When the sample images are blocked by sunglasses, 4 unblocked images in the first subset of each person and 1 random image with blocked sunglasses are selected for the training sample, and 4 unblocked images in the second subset and the remaining images blocked by sunglasses are selected for the test sample. The parameters during dictionary decomposition are set toτ=0.01,λ=1.6,δ=0.8v,η=1.2v. The sample images are covered by scarves. The training sample selects 4 images without occlusion and 1 random image with scarf occlusion in the first subset of each person. The test sample selects 4 images without occlusion in the second subset, and the remaining images are covered by scarves. The parameters during dictionary decomposition are set to τ=0.01,λ=1.2,δ=0.8v,η=1.2v. The sample image contained sunglasses and scarf occlusion. The training sample selects 4 images without occlusion from the first subset of each person and randomly selects one image with sunglasses occlusion and one image with scarf occlusion. The test sample selects all the remaining images. The parameters during dictionary decomposition are set to τ=0.01,λ=1.7,δ=0.8v,η=1.2v. From Figure 6, compared with other algorithms, the proposed algorithm has a better recognition effect, which reflects the effectiveness and robustness of the proposed algorithm for the existence of real occlusions in the samples.Figure 6
Recognition rate of the AR face database containing real occlusion. (a) Recognition rate with sunglasses occlusion; (b) recognition rate with scarf occlusion; (c) recognition rate with sunglasses and scarf occlusion.
(a)(b)(c)


## 3.1. Test Results on the AR Database

The AR face database is composed of 128 people with more than 3,500 frontal face images. This experiment used one of the subdatabases, including 74 males and 58 females under different illumination, expression, and more than 4,000 pictures. Everyone contains 13 images, including seven sharp images without sunscreen, three images of the sunglasses, and three images of the scarves. Of these, 100 class subsets without sunscreen are selected as test samples.In this experiment, 4 images without occlusion in the first subset of each person are selected as training samples, and 4 images without occlusion in the second subset of each person are selected as test samples. In the PCA dimension reduction process, the dimensions are reduced to 25, 50, 75, 100, 125, and 150. The parameters in dictionary decomposition areτ=0.01,λ=1.4,δ=0.8v,η=1.2v. The experimental results are shown in Figure 3. According to Figure 3, the algorithm proposed in this study has the highest recognition rate in all dimensions except in dimension 50,which is lower than that of DLRR. Because the face images of both training samples and test samples are nonoccluded, the superiority of the proposed algorithm cannot be fully reflected. However, according to the data results, it is found that the proposed algorithm has a high recognition rate.Figure 3
Recognition rates of unoccluded training samples in the AR face database.


## 3.2. Test Results on the Extended Yale B Database

Some images in the Extended Yale B face database are corrupted. Among them, 2,356 complete face images were selected as test samples. Figure4 shows some samples using the Extended Yale B face database. Using the feature face method, the dimensions are reduced to 25, 50, 75, 100, 125, and 150. The parameters in dictionary decomposition are τ=0.01,λ=1.2,δ=0.8v,η=1.2v. In this research, some classical algorithms, SRC, CRC, RRC, LR, ESRC, DLRR, and DLRR are selected for comparison. The average recognition rate calculated after 10 runs is shown in Figure 4. In the Extended Yale B face database, the recognition rate of the algorithm presented in this study is close to that of RRC and DLRR and higher than that of other types of algorithms in other dimensions except the 150-dimension.Figure 4
Recognition rate of Extended Yale B face database.


## 3.3. Dirty Face Recognition Experiments

In this experiment, two kinds of artificial pollution methods are used: pixel pollution and pixel block pollution. Some training samples without occlusion in the AR face database are selected and applied to the experiment of artificially adding pixel pollution. Four images without occlusion in the first subset of each person are used as training samples, and four images without occlusion in the second subset are used as test samples. In this experiment, some samples with 10% or 20% artificial pixel pollution are considered. In the acute dimension reduction treatment with the feature face method, the dimensions are reduced to 25, 50, 75, 100, 125, and 150. The parameters during dictionary decomposition are set toτ=0.01,λ=1.1,δ=0.8v,η=1.2v. After the experiment is run 15 times, the average value is calculated and are shown in Figures 5(a) and 5(b).Figure 5
Recognition rate of the AR face database with pixel contamination. (a) Recognition rate of 10% added pixel pollution; (b) recognition rate of 20% added pixel pollution.
(a)(b)


## 3.4. Experiments with Real Shielding

To verify the effectiveness and robustness of the proposed algorithm, the AR face database is selected for the experiment when the sample contains real occlusion. According to the characteristics of AR face database images, three experiments are set up, and the dimensions are reduced to 25, 50, 75, 100, 125, and 150 in the dimension reduction process using the feature face method. When the sample images are blocked by sunglasses, 4 unblocked images in the first subset of each person and 1 random image with blocked sunglasses are selected for the training sample, and 4 unblocked images in the second subset and the remaining images blocked by sunglasses are selected for the test sample. The parameters during dictionary decomposition are set toτ=0.01,λ=1.6,δ=0.8v,η=1.2v. The sample images are covered by scarves. The training sample selects 4 images without occlusion and 1 random image with scarf occlusion in the first subset of each person. The test sample selects 4 images without occlusion in the second subset, and the remaining images are covered by scarves. The parameters during dictionary decomposition are set to τ=0.01,λ=1.2,δ=0.8v,η=1.2v. The sample image contained sunglasses and scarf occlusion. The training sample selects 4 images without occlusion from the first subset of each person and randomly selects one image with sunglasses occlusion and one image with scarf occlusion. The test sample selects all the remaining images. The parameters during dictionary decomposition are set to τ=0.01,λ=1.7,δ=0.8v,η=1.2v. From Figure 6, compared with other algorithms, the proposed algorithm has a better recognition effect, which reflects the effectiveness and robustness of the proposed algorithm for the existence of real occlusions in the samples.Figure 6
Recognition rate of the AR face database containing real occlusion. (a) Recognition rate with sunglasses occlusion; (b) recognition rate with scarf occlusion; (c) recognition rate with sunglasses and scarf occlusion.
(a)(b)(c)


## 4. Conclusions

To solve the problems of noise, pollution, occlusion, and poor performance of the self-sparse representation classifier in training samples, this experiment is developed to study a face recognition algorithm based on adaptive sparse representation combined with dictionary learning. It is designed to improve the recognition rate of face recognition technology and the robustness to noise, pollution, and occlusion, which has achieved good results. A dictionary decomposition model is constructed based on dictionary learning theory, and the biometric features of original face images are extracted for classification to avoid the influence of pollution. The desired class-specific dictionary is obtained by iterative optimization, and the dictionary is used as the dictionary in the adaptive sparse representation classifier. Finally, using the feature face method, dimension reduction is performed on the training samples and test samples of face images without occlusion and with contamination. An adaptive sparse representation classifier is used for recognition and classification, and experiments are designed on two public face databases. The good recognition rate of the proposed algorithm is verified, which means that the proposed algorithm has good robustness to noise, pollution, and occlusion. Health condition prediction based on face recognition technology has the advantages of being noninvasive and convenient operation.In this experiment, learning dictionary decomposition is used to extract the feature information from the original face image, and this feature information is classified to avoid the interference of other adverse factors. The mapping matrix is used to represent the correlation between the original information and feature information. The training samples are corrected by the mapping matrix, and good experimental results are achieved.Due to the limitations of researchers’ own research and understanding, there is still much work to be done in the future. The difficulty of face image recognition with occlusion and pollution is still relatively large, and the recognition rate needs to be improved. Research on face recognition technology is becoming increasingly mature, but in practical applications, especially in the field of high demand for identity security, face recognition technology as a special authentication method still needs to be further strengthened.



---

*Source: 8225630-2023-02-21.xml*