EM Based Approximation of Empirical Distributions with Linear Combinations of Discrete Gaussians

We propose novel expectation maximization (EM) based algorithms for accurate approximation of an empirical probability distribution of discrete scalar data. The algorithms refine our previous ones in that they approximate the empirical distribution with a linear combination of discrete Gaussians (LCDG). The use of the DGs results in closer approximation and considerably better convergence to a local likelihood maximum compared to previously involved conventional continuous Gaussian densities. Experiments in segmenting multimodal medical images show the proposed algorithms produce more adequate region borders.

[1]  A. Ardeshir Goshtasby,et al.  Curve Fitting by a Sum of Gaussians , 1994, CVGIP Graph. Model. Image Process..

[2]  G. McLachlan,et al.  The EM algorithm and extensions , 1996 .

[3]  David G. Stork,et al.  Pattern Classification , 1973 .

[4]  Aly A. Farag,et al.  Expectation-maximization for a linear combination of Gaussians , 2004, Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004..

[5]  Václav Hlavác,et al.  Ten Lectures on Statistical and Structural Pattern Recognition , 2002, Computational Imaging and Vision.

[6]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[7]  Sankar K. Pal,et al.  A review on image segmentation techniques , 1993, Pattern Recognit..

[8]  Slng-Tze Bow Supervised and Unsupervised Learning in Pattern Recognition , 2002 .

[9]  F. Girosi,et al.  Networks for approximation and learning , 1990, Proc. IEEE.