Paper
20 August 2010 An efficient run-based connected-component labeling algorithm for three-dimensional binary images
Lifeng He, Yuyan Chao, Kenji Suzuki, Wei Tang, Zhenghao Shi, Tsuyoshi Nakamura
Author Affiliations +
Proceedings Volume 7820, International Conference on Image Processing and Pattern Recognition in Industrial Engineering; 782029 (2010) https://doi.org/10.1117/12.866934
Event: International Conference on Image Processing and Pattern Recognition in Industrial Engineering, 2010, Xi'an, China
Abstract
This paper presents an run-based efficient label-equivalence-based connected-component labeling algorithms for threedimensional binary images. Our algorithm is run-based. Instead of assigning each foreground voxel, we assign each run a provisional label. Moreover, we also use run data to label foreground voxels without scanning any background voxel in the second scan. Experimental results have demonstrated that our algorithm is much more efficient than conventional three-dimensional labeling algorithms.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Lifeng He, Yuyan Chao, Kenji Suzuki, Wei Tang, Zhenghao Shi, and Tsuyoshi Nakamura "An efficient run-based connected-component labeling algorithm for three-dimensional binary images", Proc. SPIE 7820, International Conference on Image Processing and Pattern Recognition in Industrial Engineering, 782029 (20 August 2010); https://doi.org/10.1117/12.866934
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

3D image processing

Detection and tracking algorithms

Image processing

Raster graphics

3D acquisition

Magnetic resonance imaging

RELATED CONTENT

A semi automatic 2D to stereoscopic 3D image and video...
Proceedings of SPIE (March 12 2013)
Color image processing using symbolic data analysis
Proceedings of SPIE (November 14 1996)
Comparison of connected-component algorithms
Proceedings of SPIE (August 27 1999)

Back to Top