Share Email Print
cover

Proceedings Paper

An efficient run-based connected-component labeling algorithm for three-dimensional binary images
Author(s): Lifeng He; Yuyan Chao; Kenji Suzuki; Wei Tang; Zhenghao Shi; Tsuyoshi Nakamura
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 20 August 2010
PDF: 8 pages
Proc. SPIE 7820, International Conference on Image Processing and Pattern Recognition in Industrial Engineering, 782029 (20 August 2010); doi: 10.1117/12.866934
Show Author Affiliations
Lifeng He, Shaanxi Univ. of Science and Technology (China)
Aichi Prefectural Univ. (Japan)
Yuyan Chao, Nagoya Sangyo Univ. (Japan)
Kenji Suzuki, The Univ. of Chicago (United States)
Wei Tang, Shaanxi Univ. of Science and Technology (China)
Zhenghao Shi, Xi'an Univ. of Technology (China)
Tsuyoshi Nakamura, Nagoya Institute of Technology (Japan)


Published in SPIE Proceedings Vol. 7820:
International Conference on Image Processing and Pattern Recognition in Industrial Engineering
Shaofei Wu; Zhengyu Du; Shaofei Wu; Zhengyu Du; Shaofei Wu; Zhengyu Du, Editor(s)

© SPIE. Terms of Use
Back to Top