Permanence-based shape decomposition in binary pyramids

Author

Borgefors, Gunilla ; Ramella, Giuliana ; Di Baja, Gabriella Sanniti

Author_Institution

SLU, Center for Image Analysis, Uppsala, Sweden

fYear

1999

fDate

1999

Firstpage

38

Lastpage

43

Abstract

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

Keywords

computational geometry; computer vision; constraint theory; image reconstruction; image representation; image resolution; image thinning; transforms; binary pyramids; constrained reverse distance transformation; decomposition stability; hierarchically bidimensional patterns; merging; multi-resolution skeleton; multi-scale data set; permanence-based shape decomposition; region reconstruction; single-scale input pattern; Computer vision; Image analysis; Image reconstruction; Merging; Pattern matching; Pattern recognition; Shape; Skeleton; Sorting; Stability;

fLanguage

English

Publisher

ieee

Conference_Titel

Image Analysis and Processing, 1999. Proceedings. International Conference on

Conference_Location

Venice

Print_ISBN

0-7695-0040-4

Type

conf

DOI

10.1109/ICIAP.1999.797568

Filename

797568