Abstract

Image segmentation plays a dominant role in image analysis and image retrievals. Much work has been reported in literature regarding image segmentation based on Gaussian mixture model (GMM). The main drawback of GMM is regarding the assumption that each image region is characterized by Gaussian component, in which the feature vector is mesokurtic and having infinite range. But in colour images the feature vector is represented by Hue and Saturation which are non- negative and may not be symmetrically distributed. Hence the image segmentation can not be accurate unless the non-negative nature of the feature vector is included. In this paper an image segmentation method is developed and analyzed with the assumption that the bivariate feature vector consisting of Hue and Saturation of each pixel follows a left truncated bivariate Gaussian mixture model. In this method the number of components (Image regions) are determined by Hierarchical clustering. The segmentation algorithm is proposed under Bayesian frame with maximum likelihood. The experimentation with six images taken from Berkeley dataset reveals that the proposed image segmentation method outperforms the existing image segmentation method with GMM and finite left truncated bivariate Gaussian mixture model with K-means.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call