3

Connected Components Labeling in 3-Dimension

(Connected components)
(Digital
Image Processing) Scan mask
3 14
8

2.1 2
2 8-connectivity
N 8 ( p) 1 1
N 8 ( p) = { p( x+1, y ) , p( x1, y ) , p( x , y +1) , p( x , y 1)
p( x+1, y +1) , p( x+1, y 1) , p( x1, y +1) , p( x1, y 1) }

(1)

: ,

Abstract
The connected component labeling is the underlying technique
that typically used in todays digital image processing. In the digital
world today, processing speed is crucial in particular, working with
large images. This research proposes a new scan mask for connected
component labeling operation in 3-dimension image that the number of
pixels to be inspected is reduced from 14 to 8 positions.
Keywords: connected component, scan mask

1.
(Connected components)
(Digital
Image Processing) 2
(Optical character recognition OCR)
(Image Retrieval) 3
MRI

2.
(Binary image)
2 (Foreground)
(Background)

1. 8-connectivity
2
Rosenfeld Pfaltz. 1966 [1]
Raster scan 2 Two-scans labeling
Two-scans labeling 3
1. First image scan: scan mask 2
Foreground
Label (Provisional label)
Provisional
Label Equivalences Table
2. Equivalences Resolution: Provisional Label
Equivalences Table

3. Second image scan:
Equivalences Table
Label
2005 Wu et al. [2]
First image scan
Two-scans labeling
8-connectivity
x Foreground

34 (EECON-34) 30 - 2 2554
993

DS010

1 2

38 . 10160 : 0-2868-6656
E-mail: mr.phaisarn@gmail.com1, wichian@siam.edu 2

 q+s) Merge only action

Merge Label
x P-Mask
24=16 2
1. OR-decision table Scan mask 2

x=r+s

x=p+r

x=s

x=r

x=q

x=p

s
0
0
0
0
1
0
0
1
0
1
1
0
1
1
1
1

new label

r
0
0
0
1
0
0
1
0
1
0
1
1
0
1
1
1

Merge

1
1
1
1
1
1
1

1
1

1
1
1

1
1

1
1

1
1

1
1

1
1
1
1

()

1
1

()

4. Pixel-based scan mask (P-Mask) 8-connectivity

() ()

x
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

p
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

q
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

Action
Assign

s
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

Merge

Merge Only

q+s

2. OR-decision table Scan mask 4

Condition

x=q+s

3 4
1. No action: x Background
x
2. New label: x Foreground
Background Provisional Label
x
3. Assign action: x Foreground
Foreground Provisional Label

4. Merge action: x Foreground

1 Foreground Provisional
Label
2010, Grana et al. [3]
Scan mask 2 ORdecision table 1
2011, Sutheebanjard Premchaiswadi [4] PMask 8-connectivity 4
5 4
r
8-connectivity
Merge only action ( Merge q s

q
0
0
1
0
0
1
0
0
1
1
0
1
1
0
1
1

x=q

3. 8-connectivity

p
0
1
0
0
0
1
1
1
0
0
0
1
1
1
0
1

x=p

2. Scan mask 8-connectivity

() ()

x
0
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1

new label

()

no action

()

Action
Assign
no action

Condition

x=s

8-connectivity
x 4 2 4
Wu et al. [2]
(Decision Tree)
3

1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1

1
1
1

34 (EECON-34) 30 - 2 2554
994

 P-Mask t 1 t 2 5
t 1 P-Mask r
t 2 q q t 2
r t 1 Merge only action (q+s) t+1
r t
r
Scan mask

13
He et al. [7]



13

3.
() t 1

() t 2

5. P-Mask t 1 t 2
2.2 3
3 26-connectivity
N 26 ( p) 26-connectivity 8-connectivity 3
3
Lumia et al. 1983 [5] Shirai 1987 [6]
Raster scan 2 Two-scans labeling
Scan mask 14 6
a:P (x-1,y-1,z-1)
d:P (x-1,y,z-1)
g:P (x-1,y+1,z-1)

b:P (x,y-1,z-1)
e:P (x,y,z-1)
h:P (x,y+1,z-1)

c:P (x+1,y-1,z-1)
f:P (x+1,y,z-1)
i:P (x+1,y+1,z-1)

p:P (x-1,y-1,z)
s:P (x-1,y,z)

q:P (x,y-1,z)
x:P (x,y,z)
()

r:P (x+1,y-1,z)

()

6. 3-D scan mask 26-connectivity

() ()
2010, He et al. [7]
First image scan
Two-scans labeling
26-connectivity
x
Foreground 26connectivity x 13 6

Scan mask First image scan

3 26-connectivity
14 8
7
a:P (x-1,y-1,z-1)
d:P (x-1,y,z-1)
p:P (x-1,y-1,z)
s:P (x-1,y,z)

b:P (x,y-1,z-1)
e:P (x,y,z-1)
q:P (x,y-1,z)
x:P (x,y,z)
()

()

7. 3-D scan mask 26-connectivity

() ()
3-D scan mask r, c, f,
g, h, i t
t+1 3
3. r, c, f, g, h, i
Merge Merge only actions

1
2
3
4
5
6
7

x
r
c
f
g
h
i
r, f, h

Merge
1
x=q+s
x=s+b
x=s+e
x=q+d
x=q+e
x=p+e
x=q+s+e

Merge only
0
q+s
s+b
s+e
q+d
q+e
p+e
q+s+e

3-D scan mask

OR-decision table 28=256 OR-decision
table 2 OR-decision table
Decision tree Sutheebanjard Premchaiswadi

34 (EECON-34) 30 - 2 2554
995

[8] Decision tree 8 36

3

Decision tree Decision tree 14

8

4.

Decision Tree
3 C++ OpenCV
gcc 4.4.3 Ubuntu 10.04
2 32x32
40 [9] (Density)
Foreground 0.1 0.2 0.3 0.4 4.
2 3
Connected components (Depth)
( Z) Connected components
4 Density 0.2
5 Connected components 19 10
Connected components 22

[1] A. Rosenfeld and J. L. Pfaltz, Sequential operations in digital

picture processing, J. ACM, vol. 13, no. 4, pp. 471494, 1966.
[2] K. Wu, E. Otoo and A. Shoshani, Optimizing Connected
Component Labeling Algorithms, Proceedings of the SPIE,
Volume 5747, pp. 1965-1976, 2005.
[3] C. Grana, D. Borghesani and R. Cucchiara, Optimized block-based
connected components labeling with decision trees, IEEE
Transactions on Image Processing, vol 19, issue 6, pp. 1596-1609,
June 2010.
[4] P. Sutheebanjard and W. Premchaiswadi, Efficient Scan Mask
Techniques for Connected Components Labeling Algorithm,
EURASIP Journal on Image and Video Processing, (In press),
2011.
[5] R. Lumia, L. Shapiro, and O. Zungia, A new connected
components algorithm for virtual memory computers, Computer
Vision, Graphics, and Image Processing, 22(2):287300, 1983.
[6] Y. Shirai. Labeling connected regions. In Three-Dimensional,
Computer Vision, pp. 8689. Springer-Verlag, 1987.
[7] L. He, Y. Chao, and K. Suzuki, Two Efficient Label-EquivalenceBased Connected-Component Labeling Algorithms for ThreeDimensional Binary Images, IEEE Transection on Image
Processing, vol. 20 issue 8, pp. 2122-2134, 2010.
[8] P. Sutheebanjard and W. Premchaiswadi, Fast Convert ORDecision Table to Decision Tree, IEEE ICT&KE 8th, pp. 37-40,
Nov. 2010.
[9] University of Modena and Reggio Emilia, Modena, Italy, Labeling
Image Lab: an impressively fast labeling routine for Open, 2010.
Available: http://imagelab.ing.unimore.it/imagelab/labeling.asp

4. 32x32
Connected components 1 - 10
Density
Depth

0.1

0.2

0.3

0.4

cc

cc

cc

cc

63

74

62

26

79

30

10

91

15

113

20

135

19

155

23

156

22

169

24

178

20

10

196

22

5.

3 Scan mask
14 8

Image Processing, Natural Language Processing, Stock
Forecasting, Evolution Algorithm
..

Database Management System, Knowledge
Management, Image Processing, Parallel Computing

34 (EECON-34) 30 - 2 2554
996