scispace - formally typeset
Open AccessJournal ArticleDOI

Image Segmentation and Retrievals based on Finite Doubly Truncated Bivariate Gaussian Mixture Model and KMeans

TLDR
A new Image Segmentation method based on Finite Doubly Truncated Bivariate Gaussian Mixture Model that outperforms the existing model based image segmentation methods.
Abstract
A new Image Segmentation method based on Finite Doubly Truncated Bivariate Gaussian Mixture Model is proposed in this paper. The Truncated Bivariate Gaussian Distribution includes several of the skewed and asymmetric distributions as particular cases with finite range. This distribution also includes the Gaussian distribution as a limiting case. We use Expectation maximization (EM) algorithm to estimate the model parameters of the image data and the number of mixture components is estimated by using K-means Clustering algorithm. The K-means clustering algorithm is also utilized for developing the initial estimates of the EM algorithm. The segmentation is carried out by clustering of feature vector into appropriate component according to the Maximum Likelihood Estimation criteria. The advantage of our method lies its efficiency on initialization of the model parameters and segmenting the images in a totally unsupervised manner. The performance of the proposed algorithm is studied by computing the segmentation performance measures like, PRI, GCE and VOI. The ability of this method for image retrieval is demonstrated by computing the image quality metrics for six images namely OSTRICH, POT, TOWER, BEARS, DEER and BIRD. The experimental results show that this method outperforms the existing model based image segmentation methods.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Studies on Texture Segmentation Using D- Dimensional Generalized Gaussian Distribution integrated with Hierarchical Clustering

TL;DR: The application of multivariate generalized Gaussian mixture probability model for segmenting the texture of an image integrating with hierarchical clustering, developed using component maximum likelihood under Bayesian frame is addressed.

A Robust Skin Colour Segmentation Using Bivariate Pearson Type II

TL;DR: In this paper, a novel and new skin color segmentation algorithm is proposed based on bivariate Pearson type II a for human computer interaction, which is one of the most important segmentation algorithms.

Data Mining Based Skin Pixel Detection Applied On Human Images: A Study Paper

TL;DR: The survey of the skin pixel segmentation using the learning algorithms is presented and it is shown that skin classifier identifies the boundary of theskin image in a skin color model based on the training dataset.
Journal Article

Skin Colour Segmentation using Fintte Bivariate Pearsonian Type-IV a Mixture Model

TL;DR: The skin colour is modeled by a finite bivariate Pearsonian type-IVa mixture distribution under HSI colour space of the image and the proposed segmentation algorithm performs better with respect to the segmentation quality metrics like PRI, GCE and VOI.
References
More filters
Journal ArticleDOI

Moments of the censored and truncated bivariate normal distribution

TL;DR: In this paper, the moments for truncation and censoring that can take place both from above and below in both variables are given in a general form from which special cases are easily obtained.
Proceedings ArticleDOI

Image Segmentation A State-Of-Art Survey for Prediction

TL;DR: This survey addressed various segmentation techniques, discussed fundamental methodologies, and issues related with specific techniques, and introduced Concept of Ontology as technical bridge in between segmentation and image prediction.
Proceedings ArticleDOI

A diffusion approach to seeded image segmentation

TL;DR: This paper proposes to conduct the seeded image segmentation according to the result of a heat diffusion process in which the seeded pixels are considered to be the heat sources and the heat diffuses on the image starting from the sources.
Journal ArticleDOI

On the Equivalence Between Hierarchical Segmentations and Ultrametric Watersheds

TL;DR: This paper shows how to use the proposed framework in practice on the example of constrained connectivity, which allows to compute such a hierarchy following a classical watershed-based morphological scheme, which provides an efficient algorithm to compute the whole hierarchy.
Proceedings ArticleDOI

A Markov random field model-based approach to image interpretation

TL;DR: A Markov random field (MRF) model-based approach to automated image interpretation is described and demonstrated as a region-based scheme and provides a systematic method for organizing and representing domain knowledge through the clique functions of the probability density function underlying MRF.
Related Papers (5)
Trending Questions (1)
How to Train an image segmentation model?

The experimental results show that this method outperforms the existing model based image segmentation methods.