A method for recognizing unconstrained handwritten words belonging to a small static lexicon is proposed. Our computational theory is based on a psychological model of the reading process of a fast reader. The method we propose is global in its nature and avoid the difficult segmentation stage of common word recognition techniques. Our computational theory has been applied to the processing of handwritten bank cheques, whose problem domain is that of unconstrained handwriting, unlimited writers in a small static lexicon. Current results seem comparable to those published in the literature and support our computational theory.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Cursive script recognition applied to the processing of bank cheques


    Contributors:
    Guillevic, D. (author) / Suen, C.Y. (author)


    Publication date :

    1995-01-01


    Size :

    474722 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Cursive Script Recognition Applied to the Processing of Bank Cheques

    Guillevic, D. / Suen, C. Y. | British Library Conference Proceedings | 1995



    Symbolic/Neural Recognition of Cursive Amounts on Bank Cheques

    Dodel, J.-P. / Shinghal, R. | British Library Conference Proceedings | 1995


    Persian cursive script recognition

    Hashemi, M.R. / Fatemi, O. / Safavi, R. | IEEE | 1995


    Persian Cursive Script Recognition

    Hashemi, M. R. / Fatemi, O. / Safavi, R. | British Library Conference Proceedings | 1995