Connected Component Labeling Using Quadtrees
Hanan Samet · Journal of the ACM · 1981
An algorithm is presented for labehng the connected components of an image represented by a quadtree.The algorithm proceeds by exploring all possible adjacenoes for each node once and only once.As soon as this ~s done, any equivalences generated by the adjacency labeling phase are propagated Analysis of the algorithm reveals that its average executmn tune ~s of the order (W + B.log B) where B and W correspond to the number of blocks comprising the foreground and background, respecuvely, of the image
Cited by 197 works. doi:10.1145/322261.322267 Open-access PDF
Authors
References
- The Art of Computer Programming
- Report on the algorithmic language ALGOL 60
- Perceptrons: An Introduction to Computational Geometry
- The Art of Computer Programming. Volume 1: Fundamental Algorithms.
- Revised report on the algorithmic language ALGOL 60
- Connectivity in Digital Pictures
- A hierarchical data structure for picture processing
- Operations on Images Using Quad Trees
- Picture Segmentation by a Tree Traversal Algorithm
- Region representation