loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'99) - Volume 2
Recognition of Strings Using Nonstationary Markovian Models: An Application in ZIP Code Recognition
Fort Collins, Colorado
June 23-June 25
ISBN: 0-7695-0149-4
Djamel Bouchaffra, State University of New York at Buffalo
Venu Govindaraju, State University of New York at Buffalo
Sargur N. Srihari, State University of New York at Buffalo
This paper presents Nonstationary Markovian Models and their application to recognition of strings of tokens, such as ZIP Codes in the US mailstream. Unlike traditional approaches where digits are simply recognized in isolation, the novelty of our approach lies in the manner in which recognitions scores along with domain specific knowledge about the frequency distribution of various combination of digits are all integrated into one unified model. The domain knowledge is derived from postal directory files. This data feeds into the models as n-grams statistics that are seamlessly integrated with recognition scores of digit images. We present the recognition accuracy (90%) achieved on a set of 20,000 ZIP Codes.
Citation:
Djamel Bouchaffra, Venu Govindaraju, Sargur N. Srihari, "Recognition of Strings Using Nonstationary Markovian Models: An Application in ZIP Code Recognition," cvpr, vol. 2, pp.2174, 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'99) - Volume 2, 1999
Usage of this product signifies your acceptance of the Terms of Use.