Abstract

In order to avoid the risk of the biological database being attacked and tampered by hackers, an Autoassociative Memory (AAM) model is proposed in this paper. The model is based on the recurrent neural networks (RNNs) for face recognition, under the condition that the face database is replaced by its model parameters. The stability of the model is proved and analyzed to slack the constraints of AAM model parameters. Besides, a design procedure about solving AAM model parameters is given, and the face recognition method by AAM model is established, which includes image preprocessing, AAM model training, and image recognition. Finally, simulation results on two experiments show the feasibility and performance of the proposed face recognition method.

1. Introduction

With the development of information and Internet, biometric technology has been rapidly developed for security, confidentiality, and convenience in Internet applications. Nowadays, many biometric technologies have been developed, such as fingerprint recognition, face recognition, and iris recognition [1, 2]. Among them, face recognition is one of the most widely used biometric technologies [3]. However, these technologies may be still vulnerable to sophisticated hacker attacks. N. Ratha et al. [4, 5] summed up eight basic threats that plague biometric-based authentication systems. One of vulnerabilities (Threat 6) is that it is possible to modify templates in the biological database or insert templates from unauthorized users into the biological database [6]. Biometric templates are a set of stored biometric features comparable directly to probe biometric features [7].

In recent years, substantial research has been conducted to improve operation security in view of the above threats, especially the protection of biometric template database for Threat 6. Biometric template protection schemes have been divided into Cancelable Biometrics (CBs), Biometrics Cryptosystems (BCs) and Biometrics in the Encrypted Domain (BED) [8]. CBs are to use noninvertible transformation to convert the original biometric data into intentionally distorted information [9]. In [10], it proposed a new method for the design of alignment free cancelable fingerprint templates using local minutia structures formed by zoned minutia pairs. A novel cancelable biometric template generation algorithm using Gaussian random vectors and one way modulus hashing was proposed in [11]. In BCs, a key is either bound (key binding schemes) or extracted (key generation schemes) from biometric data [8]. The key binding schemes can be classified as fuzzy vault schemes [12] and the fuzzy commitment schemes [13]. Regarding key generation schemes, a number of discretized fingerprint descriptors and appropriate error correcting codes were used to propose an effective biometric cryptosystem construction for biometric template protection in [14]. However, as in the case of CBs, CBs usually present a performance degradation with respect to the systems relying on unprotected data [8]. From this secure multiparty computation and homomorphic cryptosystems were used to carry out BED [15]. At present, current approaches to BED are based on garbled circuits [16] and homomorphic encryption [15], but these schemes are much more complex than the representations used in the aforementioned articles [17].

Although these schemes achieved some success, they do not completely eliminating the risk of hacker attacking and tampering the templates. There is no doubt that the existence of the template database is a hidden danger to public security [8]. In order to tackle this problem, a new face recognition method by associative memory (AM) is proposed in this paper. Although we focus on face recognition throughout this paper, our study can be extended to other biometric authentication methods.

Associative memories (AMs) are brain-style devices designed to store a set of patterns as stable equilibria such that the stored patterns can be reliably retrieved with the initial probes containing sufficient information about the patterns [18]. AMs can be divided into Autoassociative Memory (AAM) and Hetero-Associative Memory (HAM) [18]. When the input and the output are identical, is said to be memorized with in the AAM, whereas is said to be memorized with in the HAM. In recent years, AMs, especially the AMs based recurrent neural networks (RNNs), have been widely studied. For example, in [19], a synthesis procedure for designing associative memories based on discrete-time recurrent neural networks (DTRNNs) was presented and the global convergence of the DTRNNs was guaranteed via the stability analysis. In order to get some broad conditions for design cloning templates of RNNs, some new methods about associative memories based on RNNs with time delay are given in [20]. Meanwhile, in the research process of AM based on RNNs, the stability of RNNs plays a decisive role in the realization of associative memory. In [2123], the stability of RNNs is studied systematically. Besides, the RNNs were also widely used in many fields [24, 25]. However, if we want to better realize associative memory among facial features, the constraints of the current AM based RNNs are still relatively conservative. Therefore, it is necessary to use stability analysis to slack the constraints and apply them to face recognition.

Based on the aforementioned discussion, the main contributions of this paper are listed as follows:

(1) To protect the face features database fundamentally, a new face recognition method by AAM based on RNNs is proposed without establishing face feature database, in which the face features are transformed into the parameters of the AAM model.

(2) An AAM model based on RNNs with a tunable slope activation function is proposed, which is different from the work of [20, 21] that only discusses on Autoassociative Memory at the fixed slope activation function.

(3) The constraints of AAM model parameters are relaxed by our theories. It provides a theoretical basis for ensuring the effectiveness of face recognition.

The rest of this paper is organized as follows. The overview of the proposed method is elaborated in Section 2. In Section 3, we propose an AAM model based on RNNs, then the stability of the model is analyzed in detail, and its design procedure is given. In Section 4, a face AAM recognition method is established. Two experiments are presented in Section 5. Finally, conclusions are drawn in Section 6.

2. Overview of the Method

In order to solve a problem of hacker attacking and tampering the templates, a face recognition method by AAM based on RNNs is proposed in absence of the biometric database, as shown in Figure 1.

The common method of face recognition is usually to compare the facial features collected on site with those in the face database one by one, and then to determine whether if it has access right based on their similarity. In contrast, the method proposed in this paper is not to establish a face database, but to set up some special kind of relationship between facial features of authorized users. This relationship is stored in the model parameters after AAM training. Therefore, the relationship is unique because model parameters will vary with the authorized users.

For example, there are four users, respectively are A, B, C, and D. If the users A, B, and C have access right, and the user D has no access right, the model parameters can be obtained by AAM training of the facial features of users A, B, and C, where the user C can achieve AAM, while the user D cannot. Similarly, if the users A, B, and D have access right, and the user C has no access right, the model parameters can be obtained by associative memory training of the facial features of users A, B, and D, where the user D can achieve AAM, while the user C cannot. Obviously, the model parameters and are completely different due to due to the uniqueness of each user’s facial features. Therefore, it could realize face recognition without establishing the face database, where facial features of authorized users are converted to model parameters. The specific face recognition method is as follows.

At the registration stage, under the condition that the face features of the authorized users are extracted, AAM model parameters are obtained by AAM training where its input and output are coming from facial features from the extracted authorized users. Therefore, the special relationship between authorized users’ facial features has been stored in the AAM model parameters due to the uniqueness of each user’s facial features.

At the recognition stage, when a user accesses the face recognition system, the user’s facial features are first obtained through a feature extractor and then are entered into the trained AAM model to get its output features. Whether the visitor can access is determined by its similarity between the input features and the output features.

In the face identification, authorized users can successfully pass identification detection because of the special relationship (AAM model parameters), whereas unauthorized users cannot.

3. Technical Solutions

The face recognition method proposed in this paper is implement through AAM based on RNNs. Therefore, this section first proposes an AAM model based on RNNs for face recognition system, where a tunable slope activation function is given. Meanwhile, in order to slack the constraint conditions of the model, its stability is proved and analyzed by 2 Theorems and 2 corollaries. Finally, in order to guarantee the implementation of the associative memory function of face recognition method, the associative memory process of AAM model based on RNNs is discussed and its design procedure is given.

3.1. An AAM Model

In this subsection, an AAM model based on RNNs is proposed as follows:where denotes a neuron state vector, is a constant diagonal matrix forming the self-regulating parameter of the neuron, and are the connection weight matrixes, is an offset vector, stands for an input pattern and denotes a tunable slope activation function, in which is a parameter associated with memory patterns, and is a tunable parameter for better memory performances and making convergence fast. It is obvious that once fall into or , the tunable slope activation function’s value will no longer change, and this means that the output of the neural network becomes stable.

Remark 1. The definitions of the connection weight matrixes B and C are given in Appendix A.
LetAccording to the lemma of [26], for all in (1), we have , when tunable slope activation function converges to a stable state. For all , (1) can be rewritten asEquation (4) can be transformed aswhereMoreover, we define , , and is the slope factor.

3.2. Stability Analysis

On the basis of the new tunable slope activation function mentioned above, it is necessary for the AAM model to attain stability under different slope factors. The stability constraints that the model needs to satisfy are given through the following theorems and corollaries.

Theorem 2. In (5), choose .
(I) When , (5) converges to a stable state, and its value is bigger than .
(II) When , (5) converges to a stable state, and its value is smaller than .

Remark 3. The proof of Theorem 2 is in Appendix B.

Theorem 4. In (5), let or .
(I) When , (5) converges to a stable state, and its value is bigger than .
(II) When , (5) converges to a stable state, and its value is smaller than .

Remark 5. The proof of Theorem 4 is similar to that of Theorem 2.

On the basis of the above theorems, if we choose , we can draw the following corollaries.

Corollary 6. From Theorem 2, let .
(I) When , (5) converges to a stable state, and its value is bigger than .
(II) When , (5) converges to a stable state, and its value is smaller than .

Corollary 7. From Theorem 4, let or .
(I) When , (5) converges to a stable state, and its value is bigger than .
(II) When , (5) converges to a stable state, and its value is smaller than .

Remark 8. From the above two corollaries, one can draw a conclusion that the constraints, parameters of the model in [19, 20] needing to meet, are conservative compared with the constraints proposed in this paper. In other words, the constraints of the model parameters proposed in this paper are relatively slack.

3.3. Associative Memory

Next, we will discuss associative memory process of AAM model based on RNNs by use of the above theories.

In the subsection, the explanation of new notation can be found in Appendix C. Under different conditions, the associative memory parameters’ acquisition process of AAM model is as follows:

(I) According to Corollary 6 and (5), when ,  , we can conclude thatwhere

Equation (7) can be transformed as

Theorem 9. In (9), is a least square solution of (9).

Remark 10. The proof of Theorem 9 is in Appendix D.

Obviously, when , , the corresponding parameters of the AAM model can be obtained by Theorem 9.

(II) According to Corollary 7 and (5), when or , , we can conclude thatwhere

Equation (10) can be transformed as

Theorem 11. In (12), , and is a least square solution of (12).

Remark 12. The proof of Theorem 11 is similar to that of Theorem 9.

Obviously, when or , , the corresponding parameters of the AAM model can be obtained by Theorem 11.

The parameters of the AAM model can be obtained by the aforementioned associative memory parameters’ acquisition process. Therefore, under the known associative memory parameters, the associative memory process is described as follows.

According to [19], denote as the product of the set of n1-dimensional and n2-dimensional bipolar vectors, where , , , and . Given pairwise vectors (memory patterns and input patterns), , design an AAM based on a RNN such that if is fed to the AM from its input, then the output vector of RNNs converges to corresponding pattern , , where .

Next, we give the design procedure of AAM based on RNNs by use of above the associative memory parameters’ acquisition process and associative memory process. See Procedure 1.

1: for i=1 to m,
2:  =input pattern (which can be a picture); % is a vector with n rows
3:  =output pattern (which can be a picture); % is a vector with n rows
4: end for
5: for l=1 to n
6:    =constant; =constant;
7: end for
8: Get coefficient matrix A from ;
9:h=constant; =constant;
10:  Get matrix and from memory patterns; get matrix from input patterns;
11: Get matrices and vector from , and ;
12: for l=1 to n
13:  ;
14:  end for
15:e=1;
16:  for l=1 to n
17:  If
18:     let constant and ;
19:  else
20:     let constant and ;
21:   end if
22:   Get from ;
23:  end for
24:  Get coefficient matrix B, C, and bias vector D by use of from ;

Synthesize the AAM model with the connection weight matrixes A, B, and C and bias vector D. From the above procedure, an AAM model can be obtained.

4. The Face Recognition Method

In this section, according to the stability analysis and the procedure of AAM model based on RNNs in Section 3, the face recognition method by AAM model is established. As shown in Figure 2, the method can be divided into three parts, namely, image preprocessing, model training, and face image recognition.

Step 1 (image preprocessing). Firstly, in the ORL database, selecting face images deriving from different people where face images are chosen for every authorized user. All the face images obtained in the ORL database are converted to the grayscale matrixes which have elements. Then, by setting the gray threshold , the grayscale matrixes are further transformed into binary input matrixes and binary output matrixes , respectively, where , .

Remark 13. The element values in binary input/output matrixes are or .

Step 2 (AAM model training). are regarded as pairwise matrixes. Obviously, represents an input-output mode group. The input matrixes are input into the AAM model based on RNNs, then the AM model is trained by the AAM procedure designed in Section 3.3. Finally, the AAM model parameters , are derived from AAM training. Thus, the AAM model based on RNNs is established.

Step 3 (image recognition). During the recognition process, if someone wants to access a face recognition system, the person’s face image will be obtained. By image preprocessing method in Step 1, the corresponding binary input matrix can be obtained. If binary input matrix is input into the established AAM model, the corresponding binary output matrix will be gotten by AAM. Subtract output from input and you have the matrix . The number of zero elements in the matrix can be calculated, and then a ratio is obtained. Under the circumstance that the matching threshold , is set, the ratio , is compared with the set match threshold . If the ratio , it shows that this identification is successful; otherwise, it shows that this identification is a failure.

Remark 14. In the Step 1, the number of neurons of RNNs grows as more selected face images are added. The relationship between the number of neurons and the number of selected face images should satisfy the inequality: , where is the number of neurons of RNNs and is the number of selected face images.

5. Experiments and Summary of Findings

In this section, recognition performance indicators are listed first. On that basis, Experiment 1 is simulated to test the feasibility of the proposed face recognition method, and Experiment 2 is simulated to evaluate the performance of the proposed face recognition method. Finally, according to the results of two experiments, some findings can be summarized

5.1. Recognition Performance Indicator

In this section, the false acceptance rate (FAR) is used to evaluate the performance of the proposed face recognition method. The specific formula of FAR is as follows:where NFA and TNT stand for the number of false acceptance and the total number of tests, respectively.

From (13), we can get that lower number of FAR equate to better performance of the proposed face recognition method.

5.2. Experiment 1

Firstly, in the ORL database, selecting face images deriving from different people where face images are chosen for every authorized user.

According to the proposed face recognition method in Section 4, selecting face images deriving from different authorized users where face images are chosen for every authorized user. The original pixel size of the image in the ORL database is pixels. As shown in the Figure 3, through the size adjustment function of the Microsoft office 2010 software, the face images’ size is adjusted to pixels pixels. Then, the adjusted images are converted to grayscale matrixes named , , and , respectively. By setting the binary brightness threshold , the grayscale matrixes are further transformed into binary matrixes .

The initial conditions of the established AAM model are , respectively. Binary matrixes as the input and output of the model appear as , respectively. According to the AAM model training method of the Step 2 in Section 4, model template parameters can be obtained , .

A binary matrixtransformed by a face image that has been trained before by AAM, is used as input to the established AAM model, then the corresponding binary output matrix can be obtained by AAM: Subtract output from input and you have the matrix . The number of zero elements in the matrix is by calculation, and then the consistent percentage can be obtained. If the threshold is defined as , we can see that . Therefore, the visitor is considered to have access.

The result of experiment shows that the proposed face recognition method by AAM based on RNNs can realize biological recognition, and its feasibility is verified.

5.3. Experiment 2

According to the proposed face recognition method in Section 4, as shown in Figure 4(a), selecting face images named s1_1.bmp, s1_2.bmp, s1_3.bmp, s1_4.bmp, s1_5.bmp, s2_1.bmp, s2_2.bmp, s2_3.bmp, s2_4.bmp, and s2_5.bmp in the ORL database, respectively. Through the size adjustment function of the Microsoft office 2010 software, the face images’ size is adjusted to , and then the adjusted images are converted to grayscale matrixes named , , , respectively. By setting the gray threshold , the grayscale matrixes are further transformed into binary matrixes named , respectively.

The initial conditions of the established AAM model are , , , respectively. Binary matrixes as the input and output of the model appear as , respectively. According to the AAM model training method of the Step 2 in Section 4, the model parameters can be obtained , .

Randomly selecting a face image which is from unregistered people, such as shown in the Figure 4(b), a face image named s5_3.bmp in the ORL database. Then, the image s5_3.bmp is transformed into a binary matrix through the transformation of image dimension and image binarization like the processing steps in the registration phase. The binary matrix is used as input to the established AAM model, and then the corresponding binary output matrix can be obtained. The matrix is obtained by matrix minus matrix , and then the number of zero elements in the matrix . The consistent percentage can be obtained. If the threshold is defined as , we can see that . Therefore, the visitor is considered to have no access.

According to the above acquired AAM model and mentioned face recognition steps, 240 face images of 24 unregistered people randomly selected from the ORL database are used as input to the established AAM model, respectively. By calculation, the false accept number is 2. Therefore, and . Finally, according to (13), we can get that the FAR of the established facial recognition method is

The results of experiment show that if the image of an unauthorized user who is not registered before is used as input to AAM, the corresponding AAM effect is not good enough. It can be concluded that the proposed face recognition method can achieve certain face recognition effects with good performance.

5.4. Summary of Findings

In general, our findings can be summarized as follows:(1)In the absence of a face database, the method of AAM based on RNNs can realize face recognition. That is, the AAM model based on can replace the face database to achieve the face recognition effect. Thus, the intrusion and tampering of face database are indirectly avoided.(2)The experimental results verify the feasibility of the proposed face recognition method by AAM based on RNNs. It can guarantee that the authorized user has access; otherwise it has no access.(3)The proposed recognition method by AAM based on RNNs not only applies to face recognition, but also applies to fingerprint identification, palm print recognition, venous recognition, etc.

6. Conclusion

In the paper, an AAM model based on RNNs is proposed to implement faces recognition in the absence of a face database. The stability of the model is studied in detail, and a design procedure of AAM is given. Based on the proposed AAM model and the procedure of AAM, a face AAM recognition method is established. Two experiments are given to verify the proposed face recognition method. From the examples in Section 5, we know that the proposed face recognition method by AAM based on RNNs is feasible.

Appendix

A.

Denote as a matrix. The matrix defined by (1), composed of template has the formwherewhere denote weight from cell j to cell i. The definition of matrix is similar to .

B. The Proof of Theorem 2

Suppose that is an equilibrium point of (7). Choose . Then we have

(I) If . Thus, we have Then, we have Therefore, from and , we have .

Define . From Figure 5, it is obvious that when , , is a positive equilibrium point of (7).

(II) If . Thus, we have Then, we haveTherefore, from and , we have .

From Figure 6, it is obvious that when and , is a negative equilibrium point of (7).

C.

Choose , , , ,

D.

Proof. Let and ,
From (12), we have whereThenTherefore,It is obvious that is least square solution of (12).

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Authors’ Contributions

Qi Han, Zhengyang Wu, Shiqin Deng, and Jin Liu made the same contribution to the work and should be considered co-first authors.

Acknowledgments

This work was supported in part by the National Natural Science Foundation of China (61503050, 51374268, and 51275547), in part by the Key Technology Project for Heavy Accident Prevention and Control of Safe Production in 2018 (Chongqing-0004-2018AQ), in part by the Program of Chongqing Fundamental and Frontier Research Plan (cstc2017jcyjAX0115 and cstc2018jcyjAX0583), in part by the Foundation of Chongqing University of Education (KY201702A), in part by the graduate science and technology innovation program of Chongqing University of Science & Technology (YKJCX1720407), and in part by the Chongqing Outstanding Youth Fund Project (cstc2014jcyjjq90002). Thanks are due to Doctor Yaping He of the School of Computing, Engineering and Mathematics, Western Sydney University, for the review and revision.