EXPERIENCES WITH NEW IMAGE COMPONENT ALGORITHMS
View/
Date
1984Pay-Per-View via TIB Hannover:
Try if this item/paper is available.
Metadata
Show full item recordAbstract
We present experiences and comparisons evaluating a fast algorithm for connected component labeling of quad- and octrees. The algorithm works without loss of efficiency on linear tree representations that may reside in external storage.
BibTeX
@inproceedings {eg.19841018,
booktitle = {Eurographics Conference Proceedings},
editor = {K. BO and H.A. TUCKER},
title = {{EXPERIENCES WITH NEW IMAGE COMPONENT ALGORITHMS}},
author = {Samet, Hanan and Tamminen, Markku},
year = {1984},
publisher = {The Eurographics Association},
ISSN = {1017-4656},
DOI = {10.2312/eg.19841018}
}
booktitle = {Eurographics Conference Proceedings},
editor = {K. BO and H.A. TUCKER},
title = {{EXPERIENCES WITH NEW IMAGE COMPONENT ALGORITHMS}},
author = {Samet, Hanan and Tamminen, Markku},
year = {1984},
publisher = {The Eurographics Association},
ISSN = {1017-4656},
DOI = {10.2312/eg.19841018}
}