Offline handwritten signature authentication based on perceptual hash and DFT

• Main Authors: Chen, Musheng, Qian, Youxiao, Liu, Quanliang, Wu, Junhua
• Format: Conference Proceeding
• Language: English
• Published: SPIE 28.04.2023
• ISBN: 9781510663473; 1510663479
• ISSN: 0277-786X
• DOI: 10.1117/12.2672192

In order to solve the problem of sparse and missing example in the off-line handwritten signature authentication scenario, a handwritten signature authentication tree algorithm was proposed. The algorithm improves the perceptual hash algorithm based on the discrete Fourier transform, which is used to gather the subject information in the signature image, compress and generate the perceptual digest; then the cosine distance is used to calculate the distance between the perceptual digest vectors. According to the cosine distance matrix, an authentication tree composed by multiple nodes is constructed and the distance threshold is determined to authenticate the unknown data. The authentication result can be used for the self-renewal of the authentication tree. The experimental results show that the handwritten signature authentication tree algorithm has high accuracy and strong robustness. The false rejection rate and false acceptance rate on small datasets are significantly lower than the traditional machine learning algorithm, and its self-renewal mechanism can also cope with the style changes of signature handwriting very well.