12-图像分割-分水岭+MS详解.pptVIP

Kernel Density Estimation Gradient Give up estimating the PDF ! Estimate ONLY the gradient Using the Kernel form: We get : Size of window * * outline Mean Shift Theory What is Mean Shift ? Density Estimation Methods Nonparametric Kernel Density Estimation Computing the Mean Shift Mean shift properties Applications Clustering Discontinuity Preserving Smoothing Segmentation Object Contour Detection Object Tracking Kernel Density Estimation Gradient Computing The Mean Shift Computing The Mean Shift Yet another Kernel density estimation ! Simple Mean Shift procedure: Compute mean shift vector Translate the Kernel window by m(x) Real Modality Analysis Attraction basin Attraction basin: the region for which all trajectories lead to the same mode Cluster: all data points in the attraction basin of a mode outline Mean Shift Theory What is Mean Shift ? Density Estimation Methods Nonparametric Kernel Density Estimation Computing the Mean Shift Mean shift properties Applications Clustering Discontinuity Preserving Smoothing Segmentation Object Contour Detection Object Tracking Adaptive Gradient Ascent Mean Shift Properties 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) For Uniform Kernel ( ), convergence is achieved in a finite number of steps Normal Kernel ( ) exhibits a smooth trajectory, but  is slower than Uniform Kernel ( ). Mean Shift Strengths Weaknesses Strengths : Application independent tool Suitable for real data analysis Does not assume any prior shape (e.g. elliptical) on data clusters Can handle arbitrary feature spaces Only ONE parameter to choose h (window size) has a physical meaning, unlike K-Means Weaknesses : The window size (bandwidth  selection) is not tri