A general approach to connected-component labeling for arbitrary image representations

DOI10.1145/128749.128750zbMath0825.68657OpenAlexW2041995828WikidataQ56518867 ScholiaQ56518867MaRDI QIDQ4302798

Michael B. Dillencourt, Markku Tamminen, H. Samet

Publication date: 29 September 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/128749.128750

zbMATH Keywords

image representationsconnected component labeling

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (4)

Memory management for Union-Find algorithms ⋮ Two linear time Union--Find strategies for image processing ⋮ An automatic cognitive graph-based segmentation for detection of blood vessels in retinal images ⋮ Efficient Union-Find for planar graphs and other sparse graph classes

This page was built for publication: A general approach to connected-component labeling for arbitrary image representations