Post on 16-Oct-2020
transcript
Mean Shift Segmentation
Raul Queiroz Feitosa
What is Mean shift ?
A tool for:
Finding modes in a set of data samples, manifesting an underlying probability density function (PDF) in RN .
PDF in feature space
Color space
Scale space
Actually any feature space you can conceive
211/28/2019 Mean Shift Segmentation
Basic IdeaObjective: Find the densest region
3
Neighborhood
Mean shift vectorCenter of mass
11/28/2019 Mean Shift Segmentation
Computing the Mean shift Vector
4
11/28/2019 Mean Shift Segmentation
Computing the Mean shift Vector
5
11/28/2019 Mean Shift Segmentation
Kernel Functions
6
Examples of kernel functions :
• Epanechnikov Kernel
• Uniform Kernel
• Normal Kernel
21 1
( ) 0 otherwise
E
cK
x xx
1( )
0 otherwiseU
cK
xx
21( ) exp
2NK c
x x
11/28/2019 Mean Shift Segmentation
7
Adaptive
Gradient
Ascent
• Automatic convergence speed – the mean shift
vector size depends on the gradient itself.
• Near maxima, the steps are small and refined
• Convergence is guaranteed for infinitesimal
steps only infinitely convergent,
(therefore set a lower bound)
Mean shift properties
11/28/2019 Mean Shift Segmentation
Modality analysis
8
Tessellate the space with windows Run the procedure in parallel11/28/2019 Mean Shift Segmentation
Modality analysis
9
Merge windows that end up near the same “peak” or mode
11/28/2019 Mean Shift Segmentation
• Cluster: all data points in the attraction basin of a mode.
• Attraction basin: the region for which all trajectories lead to
the same mode.
Mean shift clustering
Slide by Y. Ukrainitz & B. Sarel
1011/28/2019 Mean Shift Segmentation
Mean shift clustering
1111/28/2019 Mean Shift Segmentation
12
window size in
range domain
window size in
space domain
Mean shift segmentation
11/28/2019 Mean Shift Segmentation
Mean shift segmentation results
13
From Comaniciu & Meer, 2002
11/28/2019 Mean Shift Segmentation
Mean shift segmentation results
1411/28/2019 Mean Shift Segmentation
From Comaniciu & Meer, 2002
Mean shift segmentation results
15
From Comaniciu & Meer, 2002
11/28/2019 Mean Shift Segmentation
Mean shift segmentation results
16
From Comaniciu & Meer, 2002
11/28/2019 Mean Shift Segmentation
Pros & Cons
Pros
Does not assume spherical clusters
Window size has a physical meaning
Robust to outliers
Cons
Output depends on window size
Computationally expensive
1711/28/2019 Mean Shift Segmentation
Exercise
Download the Color Clustering Methods using
Mean-Shift, Normalized-Cuts and KNN from here,
and experiment with with it.
1811/28/2019 Mean Shift Segmentation
References
Ukrainitz, Y. & Bernard Sarel, B., slides avaiable in
http://www.wisdom.weizmann.ac.il/~vision/courses/2004_2/files/mean_shi
ft/mean_shift.ppt
Comaniciu, D. and Meer, P. (2002). Mean Shift: A Robust Approach
Toward Feature Space Analysis. IEEE Transactions on Pattern Analysis
and Machine Intelligence, 24(5), pp. 603–619.
Kaftan, J.N., Bell, A.A., Aach, T. (2008). Mean Shift Segmentation
Evaluation of optimization Techniques, Proceedings of the Third
International Conference on Computer Vision Theory and Applications,
VISAPP 2008, pp. 365-374.
1911/28/2019 Mean Shift Segmentation
20
Next Topic
Graph Based
Segmentation
11/28/2019 Mean Shift Segmentation