loading...
Automatic T-Mixture Model Selection via Rival Penalized EM
Auckland, New Zealand December 13-December 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HIS.2006.14Sixth International Conference on Hyb ...
 This Article 
 
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Chunyan Zhang, Anhui University, China
Jin Tang, Anhui University, China
Bin Luo, Anhui University, China
Modelling mixtures of multivariate t-distributions are usually used instead of Gaussian mixture models(GMM) as a robust approach, when one fits a set of continuous multivariate data which have wider tail than Gaussian?s or atypical observations, but it is unable to perform model selection automatically through the traditional EM (Expectation Maximization) algorithm. To solve this problem, a new algorithm, which is called Rival Penalized Expectation-Maximization (RPEM) algorithm, is proposed to t-mixture model (TMM). It can automatically select an appropriate number of densities in t-density mixture model. Experimental results on unsupervised color image segmentation demonstrate the affectivity of the proposed algorithm.
Citation:
Chunyan Zhang, Jin Tang, Bin Luo, "Automatic T-Mixture Model Selection via Rival Penalized EM," his, pp.21, Sixth International Conference on Hybrid Intelligent Systems (HIS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.