Download as pdf or txt
Download as pdf or txt
You are on page 1of 20

Digital Image Processing

Chapter 6. Image Segmentation

Hanoi University of Science and Technology

1/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology

2/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology

3/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology

4/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology

5/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology

6/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology

7/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology

8/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology

9/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 10/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 11/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 12/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 13/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 14/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 15/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 16/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 17/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 18/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 19/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 20/34

School of Electronics and Telecommunications

10

Hanoi University of Science and Technology 21/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 22/34

School of Electronics and Telecommunications

11

Hanoi University of Science and Technology 23/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 24/34

School of Electronics and Telecommunications

12

Hanoi University of Science and Technology 25/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 26/34

School of Electronics and Telecommunications

13

Hanoi University of Science and Technology 27/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 28/34

School of Electronics and Telecommunications

14

Hanoi University of Science and Technology 29/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 30/34

School of Electronics and Telecommunications

15

Hanoi University of Science and Technology 31/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 32/34

School of Electronics and Telecommunications

16

Hanoi University of Science and Technology 33/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 34/34

School of Electronics and Telecommunications

17

6.6. Split and Merge (Horowitz and Pavlidis)

- Guad tree
Root node Image Level 0

Level 1

Level 2

Hanoi University of Science and Technology 35/34

School of Electronics and Telecommunications

1. Construction of a tree
Z[k] (x[k], y[k]) Z[k]

Node k

k: node index (x[k], y[k]): Position of a node k (position of the upper left corner pixel) Z[k]: size of the node k Max[k]: Maximum intensity inside the node k Min[k]: Minimum intensity inside the node k
Hanoi University of Science and Technology 36/34 School of Electronics and Telecommunications

18

2. Splitting and merging of the node k


(x[k1], y[k1])
Max(k1) Min (k1) Max(k3) Min (k3) Max(k2) Min (k2) Max(k4) Min (k4)

Z[k0] (x[k0], y[k0]) Merge Z[k0] Node k0 Max(k0), Min (k0) Split

Node k1 Node k2

Node k3 Node k4

Z[k1]=Z[k2]=Z[k3]=Z[k4] Level l Level (l+1)

3. Grouping

Hanoi University of Science and Technology 37/34

School of Electronics and Telecommunications

Example:

Hanoi University of Science and Technology 38/34

School of Electronics and Telecommunications

19

Hanoi University of Science and Technology 39/34

School of Electronics and Telecommunications

Hanoi University of Science and Technology 40/34

School of Electronics and Telecommunications

20

You might also like