Presents a morphological shape segmentation algorithm that decomposes a 2D binary shape into a collection of restricted convex polygons. The algorithm is simple and the decomposition is always unique. The components produced have well-defined mathematical characterizations and they seem to be in good agreement with the nature structures of the given shape.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Morphological decomposition of 2-D binary shapes into conditionally maximal convex polygons


    Contributors:
    Jianning Xu (author)


    Publication date :

    1994-01-01


    Size :

    467041 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Morphological Decomposition of 2-D Binary Shapes into Conditionally Maximal Convex Polygons

    Xu, J. / IEEE; Signal Processing Society | British Library Conference Proceedings | 1994




    Convex Digital Polygons, Maximal Digital Straight Segments and Convergence of Discrete Geometric Estimators

    De Vieilleville, F. o. / Lachaud, J. O. / Feschet, F. | British Library Online Contents | 2007