Image Foresting Transform
description
Transcript of Image Foresting Transform
![Page 1: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/1.jpg)
1
Image Foresting Transformfor Image Segmentation
Presented by:Michael FangWeilong Yang
![Page 2: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/2.jpg)
2
A Few Things to RecallImage Segmentation
◦Finding homogeneous regionsGraph-based Methods
◦Treating images as graphsImage Foresting Transform
◦Unification◦Efficiency◦Simplicity
![Page 3: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/3.jpg)
Graph-Based Methods
G ={V, E}
V: graph nodesE: edges connection the nodes
PixelsPixel Similarity
Segmentation = Graph Partition
3
![Page 4: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/4.jpg)
4
Directed GraphsA directed graph is a pair (I, A), where I is a set of nodes and A is a set of ordered pairs of nodes.
![Page 5: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/5.jpg)
5
PathsA path is a sequence t1, t2, …, tk of
distinct nodes in the graph, such that (ti, ti+1) A for 1 i k – 1.
A path is trivial if k = 1;Path denotes the
concatenation of two paths, and , where ends at t and begins at t.
Path = s, t denotes theconcatenation of the longest prefix of and the last arc (s, t).
![Page 6: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/6.jpg)
6
Path CostsA path-cost function is a mapping
that assigns to each path a cost (), in some ordered set of cost values.
A function is said to be monotonic-incremental (MI) when
(t) = h(t),( s, t) = () (s, t),
where h(t) is a handicap cost value and satisfies: x’ x x’ (s, t) x’ (s, t) and x (s, t) x, for x, x’ and (s, t) A.
![Page 7: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/7.jpg)
7
Examples of MI Cost FunctionsAdditive cost function
sum(t) = h(t),sum( s, t) = sum() + w(s,
t),where w(s, t) is a fixed non-negative arc weight.
Max-arc cost function max(t) = h(t),
max( s, t) = max{max(), w(s, t)}, where w(s, t) is a fixed arc weight.
![Page 8: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/8.jpg)
8
Predecessor Map and Spanning ForestA predecessor map is a function P that
assigns to each node t I either some other node in I, or a distinctive marker nil I – in which case t is the root of the map.
A spanning forest is a predecessor map which takes every node to nil in a finite number of iterations (i.e., it contains no cycles).
![Page 9: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/9.jpg)
9
Paths of the Forest PFor any node t I, there is a
path P*(t) which is obtained in backward by following the predecessor nodes along the path.
P*(c) = a, b, c, where P(c) = b, P(b) = a, P(a) = nilP*(i) = i, where P(i) = nil
![Page 10: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/10.jpg)
10
Optimum-path ForestAn optimum-path forest is a spanning forest P, where (P*(t)) is minimum for all nodes t I. Consider cost function sum in the example below.
![Page 11: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/11.jpg)
11
An Image as a Directed GraphA grayscale image I is a pair (I, I),
where I is a finite set of pixels (points in Z2) and I assigns to each pixel t I a value I(t) in some arbitrary value space.
An adjacency relation A is a binary relation between pixels of I, which is usually translation-invariant.
Once A has been fixed, image I can be interpreted as a directed graph, whose nodes are the image pixels in I and whose arcs are defined by A.
![Page 12: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/12.jpg)
12
Seed PixelsIn some applications, we would like to use a predefined path-cost function but constrain the search to paths that start in a given set S I of seed pixels. This constraint can be modeled by defining
![Page 13: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/13.jpg)
13
IFT algorithm for Image Segmentation1. Path Cost
2. Four-Connected Adjacency
![Page 14: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/14.jpg)
14
IFT algorithm with FIFO policy(1)
Initialization
It
C(t)
![Page 15: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/15.jpg)
15
016
0
013
0
5 5 5 5
5 5 5 5
5 5 5 5
0 5 5 0
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
∝ ∝ ∝ ∝
∝ ∝ ∝ ∝
∝ ∝ ∝ ∝
0 ∝ ∝ 0
IFT algorithm with FIFO policy(2)
![Page 16: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/16.jpg)
16
Growing Process
IFT algorithm with FIFO policy(3)
![Page 17: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/17.jpg)
17
016
0
59
5
514
5
5 5 5 5
5 5 5 5
5 5 5 5
0 5 5 0
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
∝ ∝ ∝ ∝
∝ ∝ ∝ ∝
5 ∝ ∝ ∝
0 5 ∝ 0
IFT algorithm with FIFO policy(4)
![Page 18: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/18.jpg)
18
59
5
514
5
515
5
512
5
5 5 5 5
5 5 5 5
5 5 5 5
0 5 5 0
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
∝ ∝ ∝ ∝
∝ ∝ ∝ ∝
5 ∝ ∝ 5
0 5 5 0
IFT algorithm with FIFO policy(4)
![Page 19: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/19.jpg)
19
514
5
512
5
515
5
55
5
510
5
5 5 5 5
5 5 5 5
5 5 5 5
0 5 5 0
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
∝ ∝ ∝ ∝
5 ∝ ∝ ∝
5 5 ∝ 5
0 5 5 0
IFT algorithm with FIFO policy(4)
![Page 20: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/20.jpg)
20
515
5
512
5
55
5
510
5
5 5 5 5
5 5 5 5
5 5 5 5
0 5 5 0
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
∝ ∝ ∝ ∝
5 ∝ ∝ ∝
5 5 ∝ 5
0 5 5 0
IFT algorithm with FIFO policy(4)
![Page 21: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/21.jpg)
21
515
5
55
5
510
5
58
5
511
5
5 5 5 5
5 5 5 5
5 5 5 5
0 5 5 0
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
∝ ∝ ∝ ∝
5 ∝ ∝ 5
5 5 5 5
0 5 5 0
IFT algorithm with FIFO policy(4)
![Page 22: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/22.jpg)
22
5 5 5 5
5 5 5 5
5 5 5 5
0 5 5 0
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
5 5 5
5 5 5 5
0 5 5 0
5
5 5 5 5
IFT algorithm with FIFO policy(4)
![Page 23: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/23.jpg)
Another Example
23
![Page 24: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/24.jpg)
24
Input Image
Gradient Image
Seeds Labeling IFT
Framework of Image segmentation by IFT
![Page 25: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/25.jpg)
25
Experiment Results (1)
![Page 26: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/26.jpg)
26
Experiment Results (2)
![Page 27: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/27.jpg)
27
Experiment Results (3)
![Page 28: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/28.jpg)
28
Experiment Results (4)
![Page 29: Image Foresting Transform](https://reader036.fdocuments.in/reader036/viewer/2022062813/568164d9550346895dd72487/html5/thumbnails/29.jpg)
29
SummaryBasic concept of the Image
Foresting TransformIFT for image segmentationExperiment results