By Topic

Text-indicated writer verification using hidden Markov models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Y. Yamazaki ; Dept. of Inf. & Media Sci., Kitakyushu Univ., Japan ; T. Nagao ; N. Komatsu

We propose an HMM-based text-indicated writer verification method, which is based on a challenge and response type of authentication process. In this method, a different text including ordinary characters is used on every occasion of verification. This text can be selected automatically by the verification system so as to reflect a specific writer's personal features. The specific writer is accepted only when the same text as indicated by the verification system is inputted, and the system can verify the writer's personal features from the inputted text. Moreover, the characters used in the verification process can be different from those in the enrollment process. This method makes it more difficult to get away with forged handwriting than the previous methods using only signatures. In the proposed method, the characteristics of the indicated text and each writer's personal features are both represented by using hidden Markov models.

Published in:

Document Analysis and Recognition, 2003. Proceedings. Seventh International Conference on

Date of Conference:

3-6 Aug. 2003