work Region growing diffusion Example of application : Superpixels Limitations 2 Proposed method Principle Results & Comparisons Texture segmentation 2/32
diffusion Eikonal equation : wave propagation equation ⇢ k— U ( x )k = F ( x ) 8 x 2 I U ( x ) = 0 8 x 2 (1) with I : the image domain F : a positive potential function : the set of initial seeds U ( x ) : the geodesic distance of the pixel x to (arrival time of the front at pixel x ) Classical potential function : F ( x ) = k— I ( x )k 3/32
diffusion Limitations of the potential function based on the gradient Explanation : The front slows down on a contour, but evolves freely once the contour has been crossed. 16/32
diffusion Choice of F Fc ( x , Ri ) = k Cx Ci k2 2 (2) with • Ri the neighboring region of x • Ci the mean color of Ri • Cx the color at pixel x 2 Numerical resolution with the Fast Marching algorithm Update of Ci Ci Ci ⇥ Ni + Cx Ni +1 Ni Ni +1 [Eikonal-based Region Growing for Efficient Clustering, Image and Vision Computing, 2014] 17/32
application : Superpixels Seeds placed on a regular grid (here : 150 / 600) Optional extra-parameter to control the compacity of the superpixels [Eikonal-based Region Growing for Efficient Clustering, Image and Vision Computing, 2014] 19/32
work Region growing diffusion Example of application : Superpixels Limitations 2 Proposed method Principle Results & Comparisons Texture segmentation 22/32
region (class) is modeled with a Gaussian Mixture Model (GMM) ⇧ = K Â k =1 p k Gk (3) Gk (X) = 1 (2p) d 2 |⌃ k | 1 2 e ( 1 2 ( X µ k )T ⌃ 1 (X µ k )). (4) where µ k : the mean vector of the k th Gaussian ⌃ k : the covariance matrix of the k th Gaussian p k : mixture coefficient (with ÂK k =1 p k = 1) Initialization : Estimate of the GMMs parameters (for each class) with K = 10 Proposed potential function P ( p | R ) = 1 g( p | R ) (5) g( p | R ) = argmax k (p k Gk (X p )). (6) 23/32
resolution with the Fast Marching algorithm Online update of the Gaussians : Update of the mean : µ µ+ /( n +1) with X µ Update of the covariance matrix : ⌃ ⌃⇥( n 1) ⇤ X µ ⌃ i , i ⌃ i , i + i ⇥⇤ i ⌃ i , j ⌃ i , j +⇤ i ⇥⇤ j if i 6= j ⌃ ⌃/ n Update of the mixture coefficients : p k nk /ÂK t =1 nt Complexity : Simple implementation : O( Kn log( n )) Parallel/smart implementation : O( n ) with n the number of pixels, and K the number of Gaussians. 24/32
Extension of the model with other features Adding Texture informations Structure tensors S = Â c 2{ R , G , B } ! — Ic. ! — Ic T = l1.u.uT +l2.v.vT avec l1 > l2 with l {1,2} : the eigenvalues of S u, v : the eigenvectors associated to l1 et l2 We add to the color model : the biggest eigenvalue, its corresponding eigenvector (direction). 28/32