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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Permanence-based shape decomposition in binary pyramids


    Beteiligte:
    Borgefors, G. (Autor:in) / Ramella, G. (Autor:in) / Sanniti di Baja, G. (Autor:in)


    Erscheinungsdatum :

    01.01.1999


    Format / Umfang :

    78331 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    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


    Generalizations of binary morphological shape decomposition

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


    Higher Order Image Pyramids

    Gluckman, J. | British Library Conference Proceedings | 2006


    Pyramids combine OLED colors

    British Library Online Contents | 2000