This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Estimating the Pen Trajectories of Static Signatures Using Hidden Markov Models
November 2005 (vol. 27 no. 11)
pp. 1733-1746
Static signatures originate as handwritten images on documents and by definition do not contain any dynamic information. This lack of information makes static signature verification systems significantly less reliable than their dynamic counterparts. This study involves extracting dynamic information from static images, specifically the pen trajectory while the signature was created. We assume that a dynamic version of the static image is available (typically obtained during an earlier registration process). We then derive a hidden Markov model from the static image and match it to the dynamic version of the image. This match results in the estimated pen trajectory of the static image.

[1] R. Plamondon and S.N. Srihari, “Online and Offline Handwriting Recognition: A Comprehensive Survey,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 1, pp. 63-84, Jan. 2000.
[2] T. Huang and M. Yasuhara, “A Total Stroke SLALOM Method for Searching for the Optimal Drawing Order of Off-Line Handwriting,” Proc. IEEE Systems, Man, and Cybernetics, vol. 3, pp. 2789-2794, Oct. 1995.
[3] Y. Kato and M. Yasuhara, “Recovery of Drawing Order from Single-Stroke Handwriting Images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 9, pp. 938-949, Sept. 2000.
[4] K.K. Lau, P.C. Yuen, and Y.Y. Tang, “Stroke Extraction and Stroke Sequence Estimation on Signatures,” Proc. Int'l Conf. Pattern Recognition, pp. 119-122, 2002.
[5] S. Lee and J.C. Pan, “Offline Tracing and Representation of Signatures,” IEEE Trans. Systems, Man, and Cybernetics, vol. 22, no. 4, pp. 755-771, July 1992.
[6] G. Boccignone, A. Chianese, L.P. Cordella, and A. Marcelli, “Recovering Dynamic Information from Static Handwriting,” Pattern Recognition, vol. 26, no. 3, pp. 409-418, 1993.
[7] P.M. Lallican and C. Viard-Gaudin, “A Kalman Approach for Stroke Order Recovering from Off-Line Handwriting,” Proc. Int'l Conf. Document Analysis and Recognition, pp. 519-523, 1997.
[8] H. Chang and H. Yan, “Analysis of Stroke Structures of Handwritten Chinese Characters,” IEEE Trans. Systems, Man, and Cybernetics B, vol. 29, no. 1, pp. 47-61, Feb. 1999.
[9] W. Huang, G. Rong, and Z. Bian, “Strokes Recovering from Static Handwriting,” Proc. Int'l Conf. Document Analysis and Recognition, pp. 861-864, 1995.
[10] V. Govindaraju and R.K. Krishnamurthy, “Holistic Handwritten Word Recognition Using Temporal Features Derived from Off-Line Images,” Pattern Recognition Letters, vol. 17, no. 5, pp. 537-540, 1996.
[11] I.S.I. Abuhaiba, M.J.J. Holt, and S. Datta, “Processing of Binary Images of Handwritten Text Documents,” Pattern Recognition, vol. 29, no. 7, pp. 1161-1177, 1996.
[12] S. Jäger, “Recovering Dynamic Information from Static, Handwritten Word Images,” PhD dissertation, Univ. of Freiburg, 1998.
[13] S. Jäger, “A Psychomotor Method for Tracking Handwriting,” Proc. Int'l Conf. Document Analysis and Recognition, pp. 528-531, 1997.
[14] P.M. Lallican, C. Viard-Gaudin, and S. Knerr, “From Off-Line to On-Line Handwriting Recognition,” Proc. Seventh Int'l Workshop Frontiers in Handwriting Recognition, pp. 303-312, 2000.
[15] Y. Kato and M. Yasuhara, “Recovery of Drawing Order from Scanned Images of Multi-Stroke Handwriting,” Proc. Int'l Conf. Document Analysis and Recognition, pp. 261-264, 1999.
[16] Y. Al-Ohali, M. Cheriet, and C.Y. Suen, “Efficient Estimation of Pen Trajectory from Off-Line Handwritten Words,” Proc. Int'l Conf. Pattern Recognition, pp. 323-326, 2002.
[17] Y. Al-Ohali, M. Cheriet, and C.Y. Suen, “Dynamic Observations and Dynamic State Termination for Off-Line Handwritten Word Recognition Using HMM,” Proc. Eighth Int'l Workshop Frontiers in Handwriting Recognition, 2002.
[18] J.K. Guo, D. Doerman, and A. Rosenfeld, “Forgery Detection by Local Correspondence,” Int'l J. Pattern Recognition and Artificial Intelligence, vol. 15, no. 4, pp. 579-641, 2001.
[19] K.K. Lau, P.C. Yuen, and Y.Y. Tang, “Recovery of Writing Sequence of Static Images of Handwriting Using UWM,” Proc. Int'l Conf. Document Analysis and Recognition, pp. 1123-1128, 2003.
[20] L.R. Rabiner and B.H. Juang, “An Introduction to Hidden Markov Models,” IEEE ASSP Magazine, pp. 4-16, Jan. 1986.
[21] L. Lam, S. Lee, and C.Y. Suen, “Thinning Methodologies— A Comprehensive Survey,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, no. 9, pp. 869-885, Sept. 1992.
[22] R.C. Gonzalez and R.E. Woods, Digital Image Processing. Addison-Wesley, 1992.
[23] M. Seul, L. O'Gorman, and M.S. Sammon, Practical Algorithms for Image Analysis: Description, Examples, and Code. Cambridge Univ. Press, 2000.
[24] R.C. Gonzalez, R.E. Woods, and S.L. Eddins, Digital Image Processing Using Matlab. Pearson Prentice Hall, 2004.
[25] J.J. Zou and H. Yan, “Skeletonization of Ribbon-Like Shapes Based on Regularity and Singularity Analysis,” IEEE Trans. Systems, Man, and Cybernetics B, vol. 31, no. 3, pp. 401-407, June 2001.
[26] J. Rocha, “Perceptually Stable Regions for Arbitrary Polygons,” IEEE Trans. Systems, Man, and Cybernetics B, vol. 33, no. 1, pp. 165-171, Feb. 2003.
[27] M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry Algorithms and Applications, second ed. Springer, 1997.
[28] M.E. Munich and P. Perona, “Visual Identification by Signature Tracking,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 2, pp. 200-217, Feb. 2003.
[29] P. Fränti, A. Mednonogov, and H. Kälviäinen, “Hough Transform for Rotation Invariant Matching of Line-Drawing Images,” Proc. Int'l Conf. Pattern Recognition, pp. 389-392, 2000.
[30] O.R. Terrades and E. Valveny, “Radon Transform for Lineal Symbol Representation,” Proc. Int'l Conf. Document Analysis and Recognition, pp. 195-199, 2003.
[31] A.K. Jain, Fundamentals of Digital Image Processing. Prentice-Hall, 1989.
[32] A.S. Rosenthal, J. Hu, and M.K. Brown, “Size and Orientation Normalization of On-Line Handwriting Using Hough Transform,” Proc. Int'l Conf. Acoustics, Speech, and Signal Processing, p. 3077, 1997.
[33] R. Kapoor, D. Bagai, and T.S. Kamal, “A New Algorithm for Skew Detection and Correction,” Pattern Recognition Letters, vol. 25, pp. 1215-1229, Aug. 2004.
[34] J.A. du Preez, “Efficient Training of High-Order Hidden Markov Models Using First-Order Representations,” Computer Speech and Language, vol. 12, no. 1, pp. 23-39, Jan. 1998.
[35] Y. Bengio and P. Frasconi, “Diffusion of Context and Credit Information in Markovian Models,” J. Artificial Intelligence Research, vol. 3, pp. 249-270, 1995.
[36] K.T. Abou-Moustafa, M. Cheriet, and C.Y. Suen, “On the Structure of Hidden Markov Models,” Pattern Recognition Letters, vol. 25, no. 8, pp. 923-931, June 2004.
[37] J.A. du Preez and D.M. Weber, “The Integration and Training of Arbitrary-Order HMMs,” Australian J. Intelligent Information Processing Systems, vol. 5, no. 4, pp. 261-268, 1998.
[38] J.A. du Preez, “Efficient High-Order Hidden Markov Modelling,” PhD dissertation, Stellenbosch Univ. Press, 1997.
[39] P.Z. Peebles, Probability, Random Variables, and Random Signal Principles, third ed., McGraw-Hill, 1993.
[40] J.R. Deller, J.H.L. Hansen, and J.G. Proakis, Discrete-Time Processing of Speech Signals. IEEE Press, 2000.
[41] J.G.A. Dolfing, “Handwriting Recognition and Verification: A Hidden Markov Approach,” PhD dissertation, Eindhoven, Netherlands, 1995.
[42] Y. Bengio, “Markovian Models for Sequential Data,” Neural Computing Surveys, vol. 2, pp. 129-162, 1999.

Index Terms:
Index Terms- Pattern recognition, document and text processing, document analysis, handwriting analysis.
Citation:
Emli-Mari Nel, Johan A. du Preez, B.M. Herbst, "Estimating the Pen Trajectories of Static Signatures Using Hidden Markov Models," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 11, pp. 1733-1746, Nov. 2005, doi:10.1109/TPAMI.2005.221
Usage of this product signifies your acceptance of the Terms of Use.