One significant challenge in the recognition of off-line handwriting is in the interpretation of loop structures. Although this information is readily available in online representation, close proximity of strokes often merges their centers making them difficult to identify. In this paper a novel approach to the recovery of hidden loops in off-line scanned document images is presented. The proposed algorithm seeks blobs that resemble truncated ellipses. We use a sophisticated form analysis method based on mutual distance measurements between the two sides of a symmetric shape. The experimental results are compared with the ground truth of the online representations of each off-line word image. More than 86% percent of the meaningful loops are handled correctly.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Hidden loop recovery for handwriting recognition


    Contributors:
    Doermann, D. (author) / Intrator, N. (author) / Rivin, E. (author) / Steinherz, T. (author)


    Publication date :

    2002-01-01


    Size :

    450233 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Hidden Loop Recovery for Handwriting Recognition

    Doermann, D. / Intrator, N. / Rivlin, E. et al. | British Library Conference Proceedings | 2002


    On-line handwriting recognition using hidden Markov models

    Shu, Han | DSpace@MIT | 1997

    Free access

    Hidden Markov Model Length Optimization for Handwriting Recognition Systems

    Zimmermann, M. / Bunke, H. | British Library Conference Proceedings | 2002



    Handwriting analysis and recognition

    IEE; Electronics Division; Professional Group E4 (Image processing) | British Library Conference Proceedings | 1998