An algorithm to decompose hierarchically bidimensional patterns is introduced. The single-scale input pattern is first transformed into a multi-scale data set. The multi-resolution skeleton is then computed and its hierarchical decomposition is obtained by using the notion of permanence. A constrained reverse distance transformation is applied to the skeleton components to reconstruct the regions into which the pattern is decomposed. A merging process then reduces the number of components to the most significant ones and improves decomposition stability.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Permanence-based shape decomposition in binary pyramids


    Contributors:


    Publication date :

    1999-01-01


    Size :

    78331 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Permanence-based Shape Decomposition in Binary Pyramids

    Borgefors, G. / Ramella, G. / di Baja, G. S. et al. | British Library Conference Proceedings | 1999


    Fleeting Permanence

    Garvey, W. | British Library Online Contents | 2011


    Higher Order Image Pyramids

    Gluckman, J. | British Library Conference Proceedings | 2006


    Generalizations of binary morphological shape decomposition

    Vizireanu, D. N. | British Library Online Contents | 2007


    Pyramids combine OLED colors

    British Library Online Contents | 2000