# Offline Signature Authentication Algorithm Based on the Fuzzy Set

Authors: Shi Qiu; Fengchang Fei; Ying Cui
Journal: Mathematical Problems in Engineering
 (2021)

---

## Abstract

There exists a problem that it is difficult to identify the authenticity of offline signatures. Firstly, a segmentation model is established based on the theory of fuzzy sets to extract signatures completely. Secondly, statistical shape model (SSM) and variance distance discretization of intraclass signatures are introduced for stability analysis and quantification. Finally, multilayer classifiers are constructed to realize signature authentication. The algorithm has low false detection rate and short authentication time.


---

## Body

## 1. Introduction

Handwritten signature authentication plays an important role in many fields [1]. Handwritten signature is a behavioral feature acquired for a period of time, and it belongs to the individual behavioral biological feature. With the rapid development of the information industry and service industry, signature authentication has attracted wide attention and has been widely used in many fields, such as financial security and identity authentication.Signature authentication can be classified into offline and online. Offline authentication relies on static image information such as shape and texture [2]. Online authentication contains more information than offline authentication. It can be judged by dynamic information in the signature process, such as writing order, pen pressure, and writing speed [3]. Research studies on online authentication have been carried out for a long time, and good results have been achieved. Owing to the lack of dynamic signature information and available information in most cases, offline signature authentication is more difficult, but the demand for offline authentication is huge in practical applications. Offline signature authentication based on the image usually includes preprocessing, feature extraction, and signature authentication. Preprocessing mainly includes gray histogram enhancement [4], signature extraction [5], edge information enhancement [6], and image size normalization [7]. Feature extraction includes gradient [8], SIFT [9], poset-oriented grid features [10], entropy [11], biological features [12], HOG features [13], histogram [14], LBP [15], and wavelet [16]. Signature authentication mainly includes SVM [17], KNN [18], neural network [19], deep learning [20], hidden Markov model [21], and artificial immune system [22].Research studies on offline signature authentication are mainly focused on the following: (1) how can the mechanism of separating the signature from the background be constructed to extract signature information completely? (2) How can effective signature image features be extracted? (3) How can a perfect authentication mechanism be established? In order to solve these problems, we are going to construct a robust offline signature authentication model: (1) a signature extraction framework based on the fuzzy set is proposed. (2) A signature stability authentication mechanism is constructed to select stable features. (3) According to the stability of the signature, a multilevel authentication system is established to realize the signature authentication accurately.


## 2. Algorithm

Signatures can be affected by emotions, posture, fatigue, and other factors from psychological analysis, which can lead to fluctuations in my signature to a certain extent [23]. These differences can challenge signature authentication. Figure 1 shows the overlapping images of five signatures from two signers with different stabilities. It appears that the stability of Figure 1(a) is stronger than that of Figure 1(b). The stability of signature authentication classifiers can affect the performance of signature authentication classifiers.Figure 1
Signature sample groups. (a) Data 1. (b) Data 2.
(a)(b)Thus, we construct a multilevel signature authentication system. The flowchart is shown in Figure2. (1) Signature images can be extracted to preprocess based on the theory of fuzzy sets. (2) SSM model and variance distance algorithm can be constructed to analyze the stability of quantized signatures. All signature samples can be divided into stability and instability. (3) For stable samples, we combine with the advantages of the hybrid extreme learning machine and sparse representation to construct a HCSV classifier for authentication. For unstable samples, template matching is used to authenticate them.Figure 2
Algorithm flowchart.


### 2.1. Signature Extraction Algorithm Based on the Fuzzy Set

Complete signature extraction is the precondition of subsequent operations. Different intensities in the process of signature result in different gray values on the image. So, it is difficult to extract it completely. Therefore, we introduce the theory of fuzzy sets to analyze it. Interval type-2 fuzzy set (IT2FS) can effectively deal with data uncertainty. It has attracted wide attention of scholars owing to the superiority of the processing effect. Gonzalez et al. [24] used IT2FS to extract the image boundary. Shi et al. [25] established a model based on the IT2FS to achieve specific shape segmentation. Dhar and Kundu [26] fused IT2FS and Bat to realize segmentation threshold calculation. How we measure the uncertain information represented by the IT2FS is the focus of current research.We propose a new method for calculating interval two-dimensional fuzzy entropy. On the basis of satisfying the definition of the fuzzy set and considering the influence of membership degree’s fuzziness and mean value on entropy, the uncertainty information represented by the IT2FS is measured comprehensively and objectively.Four axioms should be satisfied for the classical interval two-type fuzzy entropyEA:R1: ifA is a nonfuzzy set, then EA = 0R2:EA≤EAc,∀A∈IT2FS, Ac is the complement of AR3:EA≤EB if fuzzy B is more than A: when B¯xi+B¯xi≤1, A¯xi≤B¯xi;A¯xi≤B¯xi; when B¯xi+B¯xi>1, A¯xi>B¯xi;A¯xi>B¯xiR4: whenA¯xi+A¯xi=1, EA = 1A¯xi and A¯xi are the upper approximation set and the lower approximation set of A.Burillo and Bustince [27] established interval type-2 fuzzy entropy as(1)EA=1N∑i=1NA¯xi−A¯xi.Fully considering the fuzziness of membership degree, the difference between upper and lower bounds of membership degree is proportional to the value of entropy, but the influence of the mean value of membership degree is not considered, and R3 and R4 are not satisfied.Zeng and Li [28] established interval type-2 fuzzy entropy as(2)EA=1−1N∑i=1NA¯xi+A¯xi−1.Four axioms are satisfied, and the influence of membership degree mean is fully considered, but the influence of the fuzziness of membership degree itself about interval type-2 fuzzy entropy is not considered.We revise the above two interval type-2 fuzzy entropies:(3)EA=N−∑i=1NA¯xi+A¯xi−11−A¯xi+A¯xiN+∑i=1NA¯xi+A¯xi−11−A¯xi+A¯xi.The influence of membership degree’s fuzziness on interval type-2 fuzzy entropy is considered while satisfying the interval type-2 fuzzy entropy theorem, and IT2FS is used to measure the uncertainty information comprehensively. The corresponding gray value at the minimum of this function is used to realize the accurate image segmentation.In order to ensure the unity of the objective function, we normalize the real handwritten signature sampleXi=1,…N. The signature center line is made as the center, and the resolution of the signature image is unified to 256 × 128 by the nearest neighbor interpolation algorithm. On this basis, the signature center line is extracted. According to the characteristics of the signature, it should satisfy the following: (1) the center line must be continuous, and the handwriting cannot break as far as possible. (2) Center line preserves the signature framework. (3) The cross section of handwriting should be as little distorted as possible. In this paper, the algorithm proposed in [29] is used to extract the center line.


### 2.2. The Stability Model

The analysis of stability is the premise of signature authentication, which can be divided into signature stability and feature stability. Different algorithms are used to authenticate it by quantization stability. For signature stability and feature stability, we use the following methods to authenticate the signature stability.Calculate the average model ofN true signature features:(4)F=1N∑i=1NFi,Fi=dij|i=1,…,N;j=1,…,D.Calculate the deviation between each real sample and the average sample:(5)dFi=Fi−F¯.Calculate the covariance matrix:(6)S=1N∑i=1NdFidFiT.Calculate the covariance matrix of eigenvalueλk and eigenvector Φk:(7)SΦk=λkΦk,λk≥λk+1,ΦkTΦk=1,k=1,…,2n,where Φk represents the main changes of the real signature shape model. The larger the value of λk is, the more obvious the change of the shape model of the real signature is. We choose λ1,…λt,Φ1,…Φt to approximate the change of signature samples and reduce the number of signatures.LetλT=∑k=12Dλk; λk/λT is the contribution rate of the k-th feature. The selection of t should satisfy the following constraints:(8)∑k=1tλkλT>α,0≤α≤1.Calculate the weight coefficient of the main deformation parametersbk:(9)F≈F¯+∑k=1tbkΦk,−mλk≤bk≤mλk,m=2,3.When SSM [30] is used to analyze the signature and feature stability, it is necessary to quantify its stability. We quantify the stability of signatures by using the square difference dispersion of the deformation parameter bkΦk. Given Xi|i=1,…N is the true set of signature images, the mean value of class Mp and intraclass variance Sp can be calculated:(10)Mp=∑i=1NbkΦkN,(11)Sp=∑k=1NbkΦk−Mp2.The intraclass variance distance dispersion SDk of each signer can be obtained for stability analysis:(12)SDk=Sk2−Ms,k=1,…,N,Ms=∑k=1NSk2N.


### 2.3. Signature Authentication

According to different signature stabilities, different authentication algorithms are constructed. For stable signatures, handwritten signature needs to be classified by efficient algorithms because it has few sample data. The ELM (extreme learning machine) algorithm [31] has the advantages of less training parameters and faster classification speed and is suitable for small sample datasets. The SRC (sparse representation classifier) [32] can sparsely represent features, reduce the storage of signature data, omit the pretraining stage of signature authentication, and reduce the complexity of the algorithm.In order to fully consider the effectiveness for a given period of time, we combine the advantages of the ELM and SRC to design a hierarchical offline handwritten Chinese signature authentication scheme, as shown in Figure3. Firstly, the ELM based on the deterministic threshold of signature authentication is used to realize the first-level rough classification of the signature samples, which are ready to be tested. Then, a sparse representation dictionary for the false signature and real signature is designed and implemented. The signature authentication that cannot be identified in the first step is identified by solving the sparse coefficients.Figure 3
The flowchart of signature authentication.First-level classification: in order to solve the classification problem of authentic and false data with less similarity between signature data, we design an ELM structure as follows: the input layer and the hidden layer of the signature sample data and the output layer of the authentication certainty of the signature sample data are used to obtain the authenticity of the signatures, which are ready to be tested.There is a single hidden layer neural network for the signature image withN hidden layer nodes:(13)V=∑i=1NβigWi·Xj+bij=1,…N,where V is the determination of the authentication signatures; βi is the output weight; Wi is the input weight; • is the inner product; bi is the offset of the i-th hidden layer unit; and the threshold VT is set to determine the accuracy of the results. When V>VT, it shows that the classification of the algorithm is reliable and can output the results directly. On the contrary, it shows that the classification reliability of the algorithm is low, and the samples need to be sent to the next level classifier for further discrimination.Second-level classification: in order to solve the problem that the first-level classifier cannot effectively identify the authentication of samples with high similarity, a supercomplete signature dictionary is designed. All signatures of the same writer are collected as samples and classified into two categories:C∈0,1. 0 denotes the fake signature samples, and 1 denotes the real signature samples. Then, all samples can be expressed as D=A0,A1. Ai represents the matrix composed of ni samples arranged in the i-th class. The test sample of the signature can be sparsely represented as(14)y=DXoXo=0,…0,a11,a12…,a1ni,where the nonzero term corresponding to Xo belongs to the real signature. The problem of solving the sparse coefficients of the linear combination of models is the classification of signature authentication.The solution of sparse coefficients of the signature classification is a process of reconstructing test signature samples by linear combination of all atoms in the constructed supercomplete signature dictionary. The problem of solving X by the model can be transformed into(15)x=argminx0x,where · represents the L0-norm operation. Equation (15) is transformed into an NP-hard problem because the constructed D is a supercomplete dictionary of true and false signatures.At this time,L1 is easier to solve than the L0-norm, and L1 is more sparse than the L2-norm. Therefore, we use the L1-norm to solve the classification problem of authentic and false signatures and then use the minimum residual method in the sparse classification to authenticate signatures.For the unstable signature model, we use classicalK-means clustering to cluster discrete unstable signature samples into templates and then use clustering centers as template matching.InputM sample datasets for X=Xi|i=1,…,M, and input K-clustering categories C=Cj|j=1,…,k, where Cj=1/nj∑x∈Cx.Energy functionE=∑i=1K∑J=1ndxj,ci is constant by iteration calculation, where dxj,ci=xj−ciTxj−ci.


## 2.1. Signature Extraction Algorithm Based on the Fuzzy Set

Complete signature extraction is the precondition of subsequent operations. Different intensities in the process of signature result in different gray values on the image. So, it is difficult to extract it completely. Therefore, we introduce the theory of fuzzy sets to analyze it. Interval type-2 fuzzy set (IT2FS) can effectively deal with data uncertainty. It has attracted wide attention of scholars owing to the superiority of the processing effect. Gonzalez et al. [24] used IT2FS to extract the image boundary. Shi et al. [25] established a model based on the IT2FS to achieve specific shape segmentation. Dhar and Kundu [26] fused IT2FS and Bat to realize segmentation threshold calculation. How we measure the uncertain information represented by the IT2FS is the focus of current research.We propose a new method for calculating interval two-dimensional fuzzy entropy. On the basis of satisfying the definition of the fuzzy set and considering the influence of membership degree’s fuzziness and mean value on entropy, the uncertainty information represented by the IT2FS is measured comprehensively and objectively.Four axioms should be satisfied for the classical interval two-type fuzzy entropyEA:R1: ifA is a nonfuzzy set, then EA = 0R2:EA≤EAc,∀A∈IT2FS, Ac is the complement of AR3:EA≤EB if fuzzy B is more than A: when B¯xi+B¯xi≤1, A¯xi≤B¯xi;A¯xi≤B¯xi; when B¯xi+B¯xi>1, A¯xi>B¯xi;A¯xi>B¯xiR4: whenA¯xi+A¯xi=1, EA = 1A¯xi and A¯xi are the upper approximation set and the lower approximation set of A.Burillo and Bustince [27] established interval type-2 fuzzy entropy as(1)EA=1N∑i=1NA¯xi−A¯xi.Fully considering the fuzziness of membership degree, the difference between upper and lower bounds of membership degree is proportional to the value of entropy, but the influence of the mean value of membership degree is not considered, and R3 and R4 are not satisfied.Zeng and Li [28] established interval type-2 fuzzy entropy as(2)EA=1−1N∑i=1NA¯xi+A¯xi−1.Four axioms are satisfied, and the influence of membership degree mean is fully considered, but the influence of the fuzziness of membership degree itself about interval type-2 fuzzy entropy is not considered.We revise the above two interval type-2 fuzzy entropies:(3)EA=N−∑i=1NA¯xi+A¯xi−11−A¯xi+A¯xiN+∑i=1NA¯xi+A¯xi−11−A¯xi+A¯xi.The influence of membership degree’s fuzziness on interval type-2 fuzzy entropy is considered while satisfying the interval type-2 fuzzy entropy theorem, and IT2FS is used to measure the uncertainty information comprehensively. The corresponding gray value at the minimum of this function is used to realize the accurate image segmentation.In order to ensure the unity of the objective function, we normalize the real handwritten signature sampleXi=1,…N. The signature center line is made as the center, and the resolution of the signature image is unified to 256 × 128 by the nearest neighbor interpolation algorithm. On this basis, the signature center line is extracted. According to the characteristics of the signature, it should satisfy the following: (1) the center line must be continuous, and the handwriting cannot break as far as possible. (2) Center line preserves the signature framework. (3) The cross section of handwriting should be as little distorted as possible. In this paper, the algorithm proposed in [29] is used to extract the center line.


## 2.2. The Stability Model

The analysis of stability is the premise of signature authentication, which can be divided into signature stability and feature stability. Different algorithms are used to authenticate it by quantization stability. For signature stability and feature stability, we use the following methods to authenticate the signature stability.Calculate the average model ofN true signature features:(4)F=1N∑i=1NFi,Fi=dij|i=1,…,N;j=1,…,D.Calculate the deviation between each real sample and the average sample:(5)dFi=Fi−F¯.Calculate the covariance matrix:(6)S=1N∑i=1NdFidFiT.Calculate the covariance matrix of eigenvalueλk and eigenvector Φk:(7)SΦk=λkΦk,λk≥λk+1,ΦkTΦk=1,k=1,…,2n,where Φk represents the main changes of the real signature shape model. The larger the value of λk is, the more obvious the change of the shape model of the real signature is. We choose λ1,…λt,Φ1,…Φt to approximate the change of signature samples and reduce the number of signatures.LetλT=∑k=12Dλk; λk/λT is the contribution rate of the k-th feature. The selection of t should satisfy the following constraints:(8)∑k=1tλkλT>α,0≤α≤1.Calculate the weight coefficient of the main deformation parametersbk:(9)F≈F¯+∑k=1tbkΦk,−mλk≤bk≤mλk,m=2,3.When SSM [30] is used to analyze the signature and feature stability, it is necessary to quantify its stability. We quantify the stability of signatures by using the square difference dispersion of the deformation parameter bkΦk. Given Xi|i=1,…N is the true set of signature images, the mean value of class Mp and intraclass variance Sp can be calculated:(10)Mp=∑i=1NbkΦkN,(11)Sp=∑k=1NbkΦk−Mp2.The intraclass variance distance dispersion SDk of each signer can be obtained for stability analysis:(12)SDk=Sk2−Ms,k=1,…,N,Ms=∑k=1NSk2N.


## 2.3. Signature Authentication

According to different signature stabilities, different authentication algorithms are constructed. For stable signatures, handwritten signature needs to be classified by efficient algorithms because it has few sample data. The ELM (extreme learning machine) algorithm [31] has the advantages of less training parameters and faster classification speed and is suitable for small sample datasets. The SRC (sparse representation classifier) [32] can sparsely represent features, reduce the storage of signature data, omit the pretraining stage of signature authentication, and reduce the complexity of the algorithm.In order to fully consider the effectiveness for a given period of time, we combine the advantages of the ELM and SRC to design a hierarchical offline handwritten Chinese signature authentication scheme, as shown in Figure3. Firstly, the ELM based on the deterministic threshold of signature authentication is used to realize the first-level rough classification of the signature samples, which are ready to be tested. Then, a sparse representation dictionary for the false signature and real signature is designed and implemented. The signature authentication that cannot be identified in the first step is identified by solving the sparse coefficients.Figure 3
The flowchart of signature authentication.First-level classification: in order to solve the classification problem of authentic and false data with less similarity between signature data, we design an ELM structure as follows: the input layer and the hidden layer of the signature sample data and the output layer of the authentication certainty of the signature sample data are used to obtain the authenticity of the signatures, which are ready to be tested.There is a single hidden layer neural network for the signature image withN hidden layer nodes:(13)V=∑i=1NβigWi·Xj+bij=1,…N,where V is the determination of the authentication signatures; βi is the output weight; Wi is the input weight; • is the inner product; bi is the offset of the i-th hidden layer unit; and the threshold VT is set to determine the accuracy of the results. When V>VT, it shows that the classification of the algorithm is reliable and can output the results directly. On the contrary, it shows that the classification reliability of the algorithm is low, and the samples need to be sent to the next level classifier for further discrimination.Second-level classification: in order to solve the problem that the first-level classifier cannot effectively identify the authentication of samples with high similarity, a supercomplete signature dictionary is designed. All signatures of the same writer are collected as samples and classified into two categories:C∈0,1. 0 denotes the fake signature samples, and 1 denotes the real signature samples. Then, all samples can be expressed as D=A0,A1. Ai represents the matrix composed of ni samples arranged in the i-th class. The test sample of the signature can be sparsely represented as(14)y=DXoXo=0,…0,a11,a12…,a1ni,where the nonzero term corresponding to Xo belongs to the real signature. The problem of solving the sparse coefficients of the linear combination of models is the classification of signature authentication.The solution of sparse coefficients of the signature classification is a process of reconstructing test signature samples by linear combination of all atoms in the constructed supercomplete signature dictionary. The problem of solving X by the model can be transformed into(15)x=argminx0x,where · represents the L0-norm operation. Equation (15) is transformed into an NP-hard problem because the constructed D is a supercomplete dictionary of true and false signatures.At this time,L1 is easier to solve than the L0-norm, and L1 is more sparse than the L2-norm. Therefore, we use the L1-norm to solve the classification problem of authentic and false signatures and then use the minimum residual method in the sparse classification to authenticate signatures.For the unstable signature model, we use classicalK-means clustering to cluster discrete unstable signature samples into templates and then use clustering centers as template matching.InputM sample datasets for X=Xi|i=1,…,M, and input K-clustering categories C=Cj|j=1,…,k, where Cj=1/nj∑x∈Cx.Energy functionE=∑i=1K∑J=1ndxj,ci is constant by iteration calculation, where dxj,ci=xj−ciTxj−ci.


## 3. Experiment and Result Analysis

We construct English and Chinese databases, which are composed of the number of real signatures, the number of skilled fake signatures, and the number of unskilled fake signatures. Database 1 is from [33]. In order to verify the algorithm performance, we collect practical data to construct databases 2 and 3. The database is shown in Table 1. The proposed algorithm is written by VC++ software and WIN7 operation platform. The data ratio of the test set and training set is 1 : 1.Table 1
Database composition.
Database typePeople no.Actual signature no.Forged signature no.SkilledUnskilled1English244802402402English203001501503Chinese11440220220The proposed algorithm is related to the quantity and quality of the dataset. Currently, only Chinese and English signatures have been tested, and some results have been achieved. The proposed algorithm can be applied into other languages.


### 3.1. The Comparison of Signature Extraction Algorithms

In order to assess the algorithm performance, we introduce(16)MA,B=SA∩BSA∪B×100%,where M is the area overlap degree; A is the gold standard for signatures extracted manually through vision; B is the result of algorithm extraction; and S. is the number of pixels representing the corresponding region. The bigger the M value is, the better the segmentation effect is.According to Table2, the signature can be extracted by all the algorithms involved. Otsu algorithm [5] establishes segmentation threshold according to the distribution of the gray histogram, which can quickly realize signature extraction. Continuity algorithm [34] extracts signatures one by one according to the continuity of signatures. EIT2FS algorithm [26] establishes a model with full consideration of noise interference based on the IT2FS. Our algorithm improves the interval type-2 fuzzy entropy. It satisfies the interval type-2 fuzzy entropy theorem and considers the influence of the membership degree’s fuzziness on the interval type-2 fuzzy entropy so that IT2FS can represent the uncertainty information more comprehensively. Although the extraction time is longer than the algorithm in [5], the M value is the highest.Table 2
The effect of signature extraction algorithms.
AlgorithmMThe running time (S)Otsu860.03Continuity900.12EIT2FS940.15Ours960.10


### 3.2. The Stability Analysis

We use the SSM algorithm and variance distance dispersion to measure the signature stability according to the sample. As shown in Figure4, SDk of signer 1 is smaller than that of signer 2, and the fluctuation is small. It can be concluded that the stability of signer 1 is higher than that of signer 2.Figure 4
Signature stability distribution. (a) Chinese signature stability distribution map. (b) English signature stability distribution map.
(a)(b)In order to test the effectiveness of signature stability analysis, we introduce acceptance rate (FAR) and rejection rate (FRR) as evaluation criteria:(17)FAR=FWAN×100%,(18)FRR=FGRN×100%.We have compared the signature sets of five signers. FWA is the number of forged signatures wrongly accepted. FRR is the number of genuine signatures wrongly rejected.N is the total samples. We use KNN (method 1) separately and KNN (method 2) clustering based on stability analysis. The effect is shown in Table 3. It can be seen that the clustering effect of the algorithm can be improved by the data of stability analysis.Table 3
The algorithm extracts the signature effect.
MethodData (%)Average12345FRR18.27.16.57.66.97.26212.311.313.510.514.212.36FAR16.17.56.08.17.87.129.68.910.212.511.510.54


### 3.3. Signature Authentication

Because the signature samples are restricted by privacy and other factors, it is impossible to obtain a large number of samples. Thus, we compare our algorithm with the mainstream algorithms in all datasets on the premise of small sample size as shown in Table4. The SVM algorithm [17] requires a large number of data samples, and the authentication effect is not good under the condition of small samples. Compared with the SVM, KNN algorithm [18] has better data requirements, but its complexity is higher. SRC [32] extracts features sparsely and better. ELM algorithm [31] realizes fast classification for small samples. BP algorithm [19] can construct a neural network structure to realize signature authenticity identification. The proposed algorithm establishes a two-level classifier, which identifies the authentication one by one according to its stability, and achieves the best result.Table 4
Performance comparison of signature authentication algorithms.
AlgorithmAverage FRRAverage FRRAverage FRR + FRRSVM15.28.023.2KNN13.18.721.8SRC11.36.217.5ELM9.24.613.8BP7.75.212.9Ours6.34.811.1


## 3.1. The Comparison of Signature Extraction Algorithms

In order to assess the algorithm performance, we introduce(16)MA,B=SA∩BSA∪B×100%,where M is the area overlap degree; A is the gold standard for signatures extracted manually through vision; B is the result of algorithm extraction; and S. is the number of pixels representing the corresponding region. The bigger the M value is, the better the segmentation effect is.According to Table2, the signature can be extracted by all the algorithms involved. Otsu algorithm [5] establishes segmentation threshold according to the distribution of the gray histogram, which can quickly realize signature extraction. Continuity algorithm [34] extracts signatures one by one according to the continuity of signatures. EIT2FS algorithm [26] establishes a model with full consideration of noise interference based on the IT2FS. Our algorithm improves the interval type-2 fuzzy entropy. It satisfies the interval type-2 fuzzy entropy theorem and considers the influence of the membership degree’s fuzziness on the interval type-2 fuzzy entropy so that IT2FS can represent the uncertainty information more comprehensively. Although the extraction time is longer than the algorithm in [5], the M value is the highest.Table 2
The effect of signature extraction algorithms.
AlgorithmMThe running time (S)Otsu860.03Continuity900.12EIT2FS940.15Ours960.10


## 3.2. The Stability Analysis

We use the SSM algorithm and variance distance dispersion to measure the signature stability according to the sample. As shown in Figure4, SDk of signer 1 is smaller than that of signer 2, and the fluctuation is small. It can be concluded that the stability of signer 1 is higher than that of signer 2.Figure 4
Signature stability distribution. (a) Chinese signature stability distribution map. (b) English signature stability distribution map.
(a)(b)In order to test the effectiveness of signature stability analysis, we introduce acceptance rate (FAR) and rejection rate (FRR) as evaluation criteria:(17)FAR=FWAN×100%,(18)FRR=FGRN×100%.We have compared the signature sets of five signers. FWA is the number of forged signatures wrongly accepted. FRR is the number of genuine signatures wrongly rejected.N is the total samples. We use KNN (method 1) separately and KNN (method 2) clustering based on stability analysis. The effect is shown in Table 3. It can be seen that the clustering effect of the algorithm can be improved by the data of stability analysis.Table 3
The algorithm extracts the signature effect.
MethodData (%)Average12345FRR18.27.16.57.66.97.26212.311.313.510.514.212.36FAR16.17.56.08.17.87.129.68.910.212.511.510.54


## 3.3. Signature Authentication

Because the signature samples are restricted by privacy and other factors, it is impossible to obtain a large number of samples. Thus, we compare our algorithm with the mainstream algorithms in all datasets on the premise of small sample size as shown in Table4. The SVM algorithm [17] requires a large number of data samples, and the authentication effect is not good under the condition of small samples. Compared with the SVM, KNN algorithm [18] has better data requirements, but its complexity is higher. SRC [32] extracts features sparsely and better. ELM algorithm [31] realizes fast classification for small samples. BP algorithm [19] can construct a neural network structure to realize signature authenticity identification. The proposed algorithm establishes a two-level classifier, which identifies the authentication one by one according to its stability, and achieves the best result.Table 4
Performance comparison of signature authentication algorithms.
AlgorithmAverage FRRAverage FRRAverage FRR + FRRSVM15.28.023.2KNN13.18.721.8SRC11.36.217.5ELM9.24.613.8BP7.75.212.9Ours6.34.811.1


## 4. Conclusion

Owing to the problem that it is difficult to authenticate offline signatures, an offline signature authentication method is proposed, which is suitable for multilanguages. Firstly, a segmentation model is constructed based on the theory of fuzzy set to extract the signature completely. Then, stability analysis and quantification model are proposed to identify the stability of data and features. Finally, a two-level classifier structure is constructed to authenticate signatures one by one. In the future, we will build databases in different languages, analyze the characteristics of different languages, and realize fast signature recognition.



---

*Source: 5554341-2021-03-19.xml*