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