Finding connected components in digital images by aggressive reuse of labels

被引:13
作者
Khanna, V
Gupta, P [1 ]
Hwang, CJ
机构
[1] Indian Inst Technol, Dept Comp Sci & Engn, Kanpur 208016, Uttar Pradesh, India
[2] SW Texas State Univ, Dept Comp Sci, San Marcos, TX 78666 USA
关键词
image processing; Set Union-Find; connected components labeling; amortized analysis; raster representation; remote sensing applications;
D O I
10.1016/S0262-8856(02)00044-6
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
An efficient algorithm is presented to label the connected components in array representation of very huge 2-D images that one works with in remote sensing applications. A new data structure is suggested to maintain the equivalence table that makes use of a modified version of Union-Find algorithms. The operations supported by the equivalence table enable aggressive reuse of labels and bound the size of the table by [N / 2] + 1, for a N X N image. It is also shown that the maintenance of the table has an overall linear amortized cost. (C) 2002 Elsevier Science B,V. All rights reserved.
引用
收藏
页码:557 / 568
页数:12
相关论文
共 15 条
[1]   A GENERAL-APPROACH TO CONNECTED-COMPONENT LABELING FOR ARBITRARY IMAGE REPRESENTATIONS [J].
DILLENCOURT, MB ;
SAMET, H ;
TAMMINEN, M .
JOURNAL OF THE ACM, 1992, 39 (02) :253-280
[2]  
GONZALES RC, 1998, DIGITAL IMAGE PROCES
[3]  
GUERRA C, 1999, VISION IMAGE PROCESS
[4]  
GUSTEDT J, 1996, THEORETICAL COMPUTER, V154, P165
[5]  
GUSTEDT J, 1996, VOLUME SEGMENTATION
[6]  
LEEUWEN JV, 1984, J ACM, V31, P245
[7]   A NEW 3-DIMENSIONAL CONNECTED COMPONENTS ALGORITHM [J].
LUMIA, R .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1983, 23 (02) :207-217
[8]  
PFALTZ JL, 1966, J ACM, V12, P471
[9]  
RIVEST RL, 1998, INTRO ALGORITHMS
[10]  
RONSE C, 1984, CONNECTED COMPONENT