Referenced Items are not available for this document.
A kind of tree structure called extended binary tree (EBT) is presented to represent the line adjacency graph (LAG) in order to reduce the computational complexities of LAG-based algorithms in binary image processing. The traversal and the storage of the EBT are discussed. Applications of the structure in engineering drawing entry are shown
Published in:
Pattern Recognition, 1990. Proceedings., 10th International Conference on
(Volume:ii
)
Date of Conference: 16-21 Jun 1990
- Page(s):
- 109 - 114 vol.2
- Meeting Date :
- 16 Jun 1990-21 Jun 1990
- Print ISBN:
- 0-8186-2062-5
- INSPEC Accession Number:
- 3944513
- Conference Location :
- Atlantic City, NJ
- Digital Object Identifier :
- 10.1109/ICPR.1990.119339
- 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.
