Optimizing connected component labeling algorithms
This paper presents two new strategies that can be used to greatly improve the speed of connected component labeling algorithms. To assign a label to a new object, most connected component labeling algorithms use a scanning step that examines some of its neighbors. The first strategy exploits the dependencies among them to reduce the number of neighbors examined. When considering 8-connected components in a 2D image, this can reduce the number of neighbors examined from four to one in many cases. The second strategy uses an array to store the equivalence information among the labels. This replaces the pointer based rooted trees used to store the same equivalence information. It reduces the memory required and also produces consecutive final labels. Using an array instead of the pointer based rooted trees speeds up the connected component labeling algorithms by a factor of 5 {approx} 100 in our tests on random binary images.
- Research Organization:
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE Director. Office of Science. Office of AdvancedScientific Computing Research
- DOE Contract Number:
- DE-AC02-05CH11231
- OSTI ID:
- 887435
- Report Number(s):
- LBNL-56864; R&D Project: 429201; BnR: KJ0101030; TRN: US200618%%107
- Resource Relation:
- Conference: SPIE Medical Imaging 2005, San Diego, California,USA, 12 17 February 2005
- Country of Publication:
- United States
- Language:
- English
Similar Records
Connected component labeling of binary images on a mesh connected massively parallel processor
Practical algorithms for image-component labeling on SIMD mesh connected computers