DocumentCode :
1354341
Title :
Stripe-based connected components labelling
Author :
Zhao, H.L. ; Fan, Y.B. ; Zhang, T.X. ; Sang, H.S.
Author_Institution :
Nat. Key Lab. of Sci. & Technol. on Multi-spectral Inf. Process., Inst. for Pattern Recognition & Artificial Intell., Huazhong Univ. of Sci. & Technol., Wuhan, China
Volume :
46
Issue :
21
fYear :
2010
fDate :
10/1/2010 12:00:00 AM
Firstpage :
1434
Lastpage :
1436
Abstract :
A fast stripe-based connected component labelling algorithm is proposed for binary image labelling. Stripe extraction strategy is used to transform the pixel-connected issues, which most of the previously proposed algorithms focused on, into stripe-connected issues. The stripe-union strategy treats the combination of the neighbouring stripes as the mergence of rooted trees. Finally, comparisons are performed with other famous fast labelling algorithms. The proposed algorithm has shown better performance than the state-of-the-art algorithm in real images test, while the auxiliary memory is not required at all compared with all competitors.
Keywords :
image processing; trees (mathematics); auxiliary memory; binary image labelling; fast labelling algorithms; pixel-connected issues; real images test; rooted trees; stripe extraction strategy; stripe-based connected components labelling; stripe-union strategy;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el.2010.2016
Filename :
5604794
Link To Document :
بازگشت