Page 321 -

Section 9.6 Notes 289

PROBLEMS
9.1. The mean shift procedure for finding a mode of a function
n
x − x i 2
f(x)= C k || ||
h
i=1
(j)
involves producing a series of estimates y where
(j) 2
x i −y
(j+1) i x i g(|| h || )
= .
y
(j) 2
g(|| x i −y || )
i h
Now assume we have a function
n - (−d s/2) s s .- (−d r /2) r r .
(2π) i (2π) i
f(x)= C k x − x k x − x .
d s hs d r hr
h s h r
i=1
What is the form of the mean shift estimate for this function?
PROGRAMMING EXERCISES
9.2. Implement a mean shift segmenter.
9.3. Implement a graph-based segmenter, after Section 9.4.2.
9.4. Implement a graph-based segmenter, after Section 9.4.3; for this, you should
use one of the fast graph cut packages available on the Web.
9.5. Use your graph-based segmenter to build an interactive segmentation system.