probabilistic clustering by random swap algorithm - joensuu.pptVIP

Background: Mixture Model Initialization Effect Sub-optimal Example Random Swap EM Random Swap EM algorithm for GMM and Image Segmentation Qinpei Zhao, Ville Hautam?ki, Ismo K?rkk?inen, Pasi Fr?nti Speech Image Processing Unit Department of Computer Science, University of Joensuu Box 111, Fin-80101 Joensuu FINLAND zhao@cs.joensuu.fi Outline Background Status RS-EM Application Background: EM algorithm EM algorithm - {α, Θ} E-step (Expectation): M-step (Maximization): Iterate E,M step until convergence α- mixing coefficient Θ- model parameters, eg. {μ,∑} Local Maxima Let’s describe it as mountain climbing…… 600km 2160m 3099m Initialization and Result(1) Initialization and Result(2) The situation of local maxima trap Status Standard EM for Mixture Models(1977) Deterministic Annealing EM (DAEM) (1998) Split-Merge EM (SMEM) (2000) Greedy EM (2002) RS-EM coming… Outline Background Status RS-EM (Random Swap) Application RSEM: Motivations Random manner Prevent from staying near the unstable or hyperbolic fixed points of EM. Prevent from its stable fixed points corresponding to insignificant local maxima of the likelihood function Avoid the slow convergence of EM algorithm Less sensitive to its initialization Formulas SMEM Greedy EM RSEM After EM After Swap After EM Comparisons(1) Comparisons(2) S4 S1 Q2 Q1 Outline Background Status RS-EM Application Application Image Segmentation Color Quantization Image Retrieval …… Conclusion Introduce Randomization into algorithm Performs better Without heavy time complexity Wider applications Thanks!?