Referenced Items are not available for this document.
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
Published in:
Image Analysis and Processing, 1999. Proceedings. International Conference on
Date of Conference: 1999
- Page(s):
- 38 - 43
- Meeting Date :
- 27 Sep 1999-29 Sep 1999
- Print ISBN:
- 0-7695-0040-4
- INSPEC Accession Number:
- 6482344
- Conference Location :
- Venice
- Digital Object Identifier :
- 10.1109/ICIAP.1999.797568
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
