Expectation-Maximization Algorithm with Local Adaptivity


We develop an expectation-maximization algorithm with local adaptivity for image segmentation and classification. The key idea of our approach is to combine global statistics extracted from the Gaussian mixture model or other proper statistical models with local statistics and geometrical information, such as local probability distribution, orientation, and anisotropy. The combined information is used to design an adaptive local classification strategy that improves the robustness of the algorithm and also keeps fine features in the image. The proposed methodology is flexible and can be easily generalized to deal with other inferred information/quantities and statistical methods/models.

DOI: 10.1137/080731530

Extracted Key Phrases

19 Figures and Tables

Cite this paper

@article{Leung2009ExpectationMaximizationAW, title={Expectation-Maximization Algorithm with Local Adaptivity}, author={Shingyu Leung and Gang Liang and Knut S\olna and Hongkai Zhao}, journal={SIAM J. Imaging Sciences}, year={2009}, volume={2}, pages={834-857} }