loading...
Permanence-Based Shape Decomposition in Binary Pyramids
Venice, Italy September 27-September 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICIAP.1999.79756810th International Conference on Imag ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Gunilla Borgefors, Centre for Image Analysis
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.
Citation:
Gunilla Borgefors, Giuliana Ramella, Gabriella Sanniti di Baja, "Permanence-Based Shape Decomposition in Binary Pyramids," iciap, pp.38, 10th International Conference on Image Analysis and Processing (ICIAP'99), 1999
Usage of this product signifies your acceptance of the Terms of Use.