1 / 19

R andom S wap EM algorithm for GMM and Image Segmentation

R andom S wap 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.

huela
Download Presentation

R andom S wap EM algorithm for GMM and Image Segmentation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 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

  2. Outline • Background & Status • RS-EM • Application

  3. Background: Mixture Model

  4. Background: EM algorithm EM algorithm -> {α, Θ} • E-step (Expectation): • M-step (Maximization): • Iterate E,M step until convergence α- mixing coefficient Θ- model parameters, eg. {μ,∑}

  5. Local Maxima Let’s describe it as mountain climbing……

  6. 2160m 3099m 600km

  7. Initialization Effect Initialization and Result(1) Initialization and Result(2)

  8. Sub-optimal Example The situation of local maxima trap

  9. Status • Standard EM for Mixture Models(1977) • Deterministic Annealing EM (DAEM) (1998) • Split-Merge EM (SMEM) (2000) • Greedy EM (2002) • RS-EM coming…

  10. Outline Background & Status RS-EM (Random Swap) Application

  11. 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

  12. Formulas SMEM Greedy EM RSEM

  13. Random Swap EM After EM After Swap After EM

  14. Comparisons(1)

  15. Comparisons(2)

  16. Outline Background & Status RS-EM Application

  17. Application • Image Segmentation • Color Quantization • Image Retrieval • ……

  18. Conclusion • Introduce Randomization into algorithm • Performs better • Without heavy time complexity • Wider applications • Thanks!☺

More Related