DocumentCode
2951028
Title
Expectation-Maximization with Distance Measure for Color Image Segmentation
Author
Nair, Madhu S. ; Rajasree, R. ; John, Jisha ; Wilscy, M.
Author_Institution
Rajagiri Sch. of Comput. Sci., Rajagiri Coll. of Social Sci., Kochi
fYear
2008
fDate
8-10 Dec. 2008
Firstpage
1
Lastpage
5
Abstract
In this paper we propose an expectation-maximization (EM) algorithm with distance measure for color image segmentation. The probability distribution model used is the Gaussian mixture model. The concept of color distance measure is used in this algorithm to determine the region to which a particular pixel belongs. L *a* b color space is used to replace the more straightforward spaces such as the RGB color space and YUV color space. This algorithm is capable of automatically selecting the number of components of the model using minimum description length (MDL) criterion. The proposed method yields good segmentation with better PSNR and SSIM values compared to classical EM algorithm; that is, the segmented image will be structurally more similar to the original image.
Keywords
Gaussian distribution; distance measurement; expectation-maximisation algorithm; image colour analysis; image segmentation; Gaussian mixture model; RGB color space; YUV color space; color image segmentation; distance measurement; expectation-maximization algorithm; minimum description length criterion; probability distribution model; Color; Computer science; Educational institutions; Image reconstruction; Image segmentation; Maximum likelihood estimation; Particle measurements; Probability distribution; Region 10; Sections; Distance Measure; Expectation-Maximization; MDL; Maximum Likelihood; Segmentation;
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial and Information Systems, 2008. ICIIS 2008. IEEE Region 10 and the Third international Conference on
Conference_Location
Kharagpur
Print_ISBN
978-1-4244-2806-9
Electronic_ISBN
978-1-4244-2806-9
Type
conf
DOI
10.1109/ICIINFS.2008.4798338
Filename
4798338
Link To Document