Abstract

A signature to be verified is written on an area which carries horizontal and vertical lines using a pen. As the lines are crossed signals representative of the vertical and horizontal components of the pen tip velocity and whether the tip is in contact with the area are passed to a computer. A hidden Markov model derived from vertical and horizontal velocities and a "contact" signal occurring as a number of authentic signatures are written is stored by the computer. A forward pass of the Baum-Welch algorithm is used to calculate the probability that the vertical and horizontal components of the pen tip and the contacts between pen tip and the writing area could have been produced from the hidden Markov model. This probability is used to decide whether the signature is authentic. The hidden Markov model stored by the computer is derived from an initial model based on pen tip velocities and contacts occurring in an authentic signature, and re-estimation carried out using forward and backward passes of the Baum-Welch algorithm and velocities and contacts from further authentic signatures.

Other References

• M. Hanan et al, Finite State Machine Decision Procedure Model for Signature Verification, IBM Technical Disclosure Bulletin, Jan. 1978, pp. 3355-3360
• R. T. Gallagher, Signature Verifier Exploits Writing Speed, Electronics International, Jul. 1983, pp. 86, 90
• R. Nag et al, Script Recognition Using Hidden Markov Models, Proceedings of the IEEE-IECEJ-ASJ International Conference on Acoustics, Spech, and Signal Processing, Apr. 1986, pp. 2071-2074
• D. Ibrahim et al, Improved Security Through On-Line Signature Recognition, EURO IFIP 79, Proceedings of European Conference on Applied Information Technology . . . 25-28 Sep. 1979, pp. 491-498
• T. Sakai et al, Multi-Feature Display of On-Line Signature by Color TV Display, Proceedings of the 2nd Int'l Joint Conference on Pattern . . . , 13-15 Aug. 1974, pp. 303-30