This paper presents a method for locating the points where most likely joints between successive characters within a word occur. The proposed method, whose basic assumptions follow from handwriting generation studies, relies upon a set of morphological criteria applied to both the ligatures and the terminal regions of successive characters in order to decide the most appropriate position for the segmentation points. It does not exploit any temporal information, but rather it manipulates shape information, thus is suitable for both online and off-line handwriting processing. An experimental procedure, adopted to quantitatively evaluate the performance of the proposed algorithm without using any classification method, is also introduced.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    From ligatures to characters: a shape-based algorithm for handwriting segmentation


    Contributors:


    Publication date :

    2002-01-01


    Size :

    282142 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    From Ligatures to Characters: A Shape-Based Algorithm for Handwriting Segmentation

    De Stefano, C. / Marcelli, A. | British Library Conference Proceedings | 2002


    Numerical Characters and Capital Letters Segmentation Recognition in Mixed Handwriting Context

    Wehbi, H. / Oulhadj, H. / Lemoine, J. et al. | British Library Conference Proceedings | 1995



    On recognition of handwriting Chinese characters

    Li, C. C. / Sze, T. W. / Teng, T. L. et al. | NTRS | 1967


    Off-line cursive handwriting segmentation

    Ke Han / Sethi, I.K. | IEEE | 1995