\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Studies on Colour Image Segmentation Method Based on Finite Left Truncated Bivariate Gaussian Mixture Model with K-Means},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2011-10 2011-09-30 (revised: 2011 October 30 September 2011)}
\def\TheID{\makeatother }
\def\TheDate{2011-10 2011-09-30}
\title{Studies on Colour Image Segmentation Method Based on Finite Left Truncated Bivariate Gaussian Mixture Model with K-Means}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{G.V.S.  RAJKUMAR}

             \author[2]{K.SRINIVASA  RAO}

             \author[3]{P.SRINIVASA  RAO}

\renewcommand\Authands{ and }

\date{\small \em Received: 27 August 2011 Accepted: 18 September 2011 Published: 30 September 2011}

\maketitle


\begin{abstract}
        


Colour Image segmentation is one of the prime requisites for computer vision and analysis.Much work has been reported in literature regarding colour image segmentation under HSI colour space and Gaussian mixture model (GMM). Since the Hue and Saturation values of the pixel in the image are non-negative. And may not be meso-kurtic, it is needed left truncate the Gaussian variate and is used to represent these two features of the colour image. The effect of truncation can not be ignored in developing the model based colour image segmentation. Hence in this paper a left truncated bivariate Gaussian mixture model is utilized to segment the colour image. The correlation between Hue and Saturation plays a predominant role in segmenting the colour images which is observed through experimental results. The expectation maximization (EM) algorithm is used for estimating model parameters. The number of image segments can be initialization of the model parameters are done with K-means algorithm. The performance of the proposed algorithm is studied by calculating the segmentation performance techniques like probabilistic rand index (PRI), global consistency error (GCE) and variation of information (VOI). The utility of the estimated joint probability density function of feature vector of the image is demonstrated through image retrievals. The image quality measures obtained for six images taken from Berkeley image dataset reveals that the proposed algorithm outperforms the existing algorithms in image segmentation and retrievals.

\end{abstract}


\keywords{Image Segmentation, Hue, Saturation, Finite Left Truncated Bivariate Gaussian distribution, K-means algorithm, Image Quality Metrics, EM- algorithm.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 \par
groups. It is an important technology for image processing and understanding. The structural characteristics of objects and surfaces in an image can be determined by segmenting the image using image domain properties. One of the major advantages of image segmentation is denoising. Denoising is the process of removing unwanted noise from the image. Segmentation specifically attempts to separate structure from noise on a local scale. It is one of the most important steps in computer vision and analysis.\par
For the last three decades lot of work has been reported in literature regarding image segmentation methods \hyperref[b12]{(Lucchese L. et al (2001)}, Srinivas Y. and Srinivas  {\ref Rao K. (2007)}, Majid Fakheri et al (2010), Siddhartha \hyperref[b25]{Bhattacharyya (2011)}). The image segmentation methods can be divided into two categories depending upon the type of image. The images can be broadly categorized into two types namely, gray level images and colour images. A gray level image is usually characterized by pixel intensity \hyperref[b3]{(Farag A..A.. et al (2004)}, Seshashayee M. et al (2011), Srinivas Yerramalle et al (2010)). But in colour images the colour is a perceptual phenomenon related to human response to different wavelengths in the visible electro-magnetic spectrum. In colour images the features that represent the image pixel are highly influenced by three feature descriptions namely, intensity, colour and texture. Among these features colour is the most important one in segmenting the colour images since intensity and texture features also be embedded in colour features. \hyperref[b5]{(Fesharaki and Hellestrand (1992)}, \hyperref[b10]{Kato Z. et al (2006)}, \hyperref[b9]{Kang Feng et al (2009)}, \hyperref[b7]{Kaikuo Xu et al (2011)}). A better colour space than the RGB space in representing the colours of human perception is the HSI space, in which the colour information is represented by Hue and Saturation values. Thus the human perception of image can be characterized through a bivariate random variable consisting of Hue and Saturation which can be measured using generic structure of a colour appearance model \hyperref[b22]{(Sangwine et al (1998)}). \hyperref[b4]{Ferri and Vidal (1992)}, \hyperref[b11]{Lee E. et al(2010)}, Dipti P. and Mridula J. (2011) and others have reviewed colour image segmentation techniques. Among these mage segmentation is a process of extracting useful information from the images through features and dividing the whole image into various homogeneous groups in which, the pixels within the group are more homogeneous and are heterogeneous between the I model based image segmentation methods are more efficient than the edge based or threshold or region based methods \hyperref[b12]{(Lucchese L. et al (2001)}). In model based image segmentation the whole image is divided into different image regions and each image region is characterized by a suitable probability distribution. For ascribing a probability model to the feature vector of the pixels in the image region, it is needed to study the statistical characteristics of the feature vector.\par
In image segmentation it is customary to consider that the whole image is characterized by a finite Gaussian mixture model. That is, the feature vector of each image region follows a Gaussian distribution \hyperref[b6]{(Haralick and Shapiro (1985)}   {\ref 2010})). The image segmentation methods based on Gaussian mixture model work well only when the feature vector of the pixels are having infinite range and the distribution of the feature vector is symmetric and meso-kurtic. But in many colour images the feature vector represented by Hue and Saturation are having finite values (say nonnegative) and may not be mesokurtic and symmetric. Hence, to have an accurate image segmentation of these sorts of colour images it is needed to develop and analyze image segmentation methods based on truncated bivariate mixture distributions.\par
Here, it is assumed that the feature vector in different image regions follows a left truncated bivariate Gaussian distribution and the feature vector of the whole image is characterized by a finite left truncated bivariate Gaussian mixture model. This assumption is made since the Hue and Saturation values of the pixel which represents the bivariate feature vector can take nonnegative values only. Hence, the range of the Hue and Saturation values are to be left truncated at zero. The effect of the truncated nature of Hue and Saturation cannot be ignored, since the leftover probability is significantly higher than zero in the left tail end of the distribution. This left truncated nature of the bivariate feature vector can approximate the pixels of the colour image more close to the reality.\par
In this method of segmentation, the number of image regions is obtained by Using the estimated joint probability density functions of the feature vector of pixels of each image, the images are retrieved. The efficiency of the developed algorithm in image retrieval is also studied by computing the image quality metrics like maximum distance, image fidelity, mean square error, signal to noise ratio and image quality index and the results are presented. A comparative study of these quality measures with those obtained from the Gaussian mixture model with K-means revealed that this algorithm performs better. 
\section[{II. FINITE LEFT TRUNCATED BIVARIATE GAUSSIAN MIXTURE MODEL}]{II. FINITE LEFT TRUNCATED BIVARIATE GAUSSIAN MIXTURE MODEL}\par
The effect of truncation in bivariate Gaussian distribution has been discussed by several researchers (Norman L.Johnson, Samuel Kotz and Balakrishnan (1994)). The probability density function of the left truncated Gaussian distribution (truncated at zero) is,0 0 ; ( , ) ( , ; ) , 0 0 ( , ) x y f x y g x y f x y dxdy ? ? ? < < < < ? ? = ? ? (1)\par
Where, zero is the truncation point for both the Hue and saturation, ( , ) f x y is the probability density function of the bivariate Normal distribution is2 2 1 1 2 2 2 2 1 1 2 2 1 2 1 1 2 1 ( , ) exp 2(1 ) 2 x x y y f x y µ µ µ µ ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? = ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? + ? ? 1 2 1 1 < < + ; < y < + , 0 ; 0 ; < < , x ? ? ? ? ? ? ? > > ? ? ? 1 2 < < + ; < < + µ µ ? ? ? ? ? ?\par
The value of0 0 1 ( , ) f x y dxdy ? ? ? ? ? ? ? ? ? ? ? is significant\par
based on the values of the parameters. This distribution includes the skewed, asymmetric bivariate distributions as particular cases for limiting and specific values of the parameters. The various shapes of the frequency curves of the left truncated bivariate Gaussian distribution are shown in Figure1.\par
Fig1 : Shapes of left truncated bivariate Gaussian frequency surfaces\par
Following the heuristic arguments given by Bengt \hyperref[b0]{Muthen (1990)}, the mean value of 'X'(hue) is obtained asE(X) = 1 µ + 1 ? A\textbf{(3)}\par
Where,1 1 1 2 1 2 A = 1 1 1 1 1 2 1 2 c c µ µ µ µ µ µ ? ? ?? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? + ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?\par
and c = ( )1/ 2 2 1 ? ? ?\par
, ? , ? are the ordinate and area of standard Normal distribution. Similarly the mean value 'Y'(saturation) isE(Y) = 2 µ + 2 ? B (4) Where, 2 2 2 1 2 1 2 2 1 2 1 B = 1 1 2 c c µ µ µ µ µ µ ? ? ?? ? ? ? ? ? ? ? ? ?? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? + ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?\par
and c is as given in equation ( \hyperref[formula_3]{3})\par
The Variance of X isV(X) = 2 1 ? R -2A 1 ? A +A 2 = 2 1 ? R -A 2 (2 1 ? -1)\textbf{(5)}\par
Where,2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 - - - - - - - - R ( ) ( ) 1 ( ) -( ) ( ) ( ) 1 ( ) -( ) c c µ µ µ µ µ µ µ µ ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? = + ? ? + ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? 1 1 1 1 1 1 1 - - - ( ) ( ) -( ) , c c µ µ µ ?? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?\par
and c and A is given in equation .\par
(3) The Variance of Y isV(Y) = 2 2 ? T -2B 2 ? B +B 2 = 2 2 ? T -B 2 (2 2 ? -1) (6) Where, 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 - - - - - - - - T ( ) ( ) 1 ( ) -( ) ( ) ( ) 1 ( ) -( ) c c µ µ µ µ µ µ µ µ ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? = + ? ? + ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? 1 2 2 2 2 2 2 - - - ( ) ( ) -( ) , c c µ µ µ ?? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?\par
c and B are as given in equations ( \hyperref[formula_3]{3}) and (  {\ref 4})\par
respectively. The Covariance of (X, Y) isCOV (X, Y) = 1 2 U ? ? -AB ( 1 ? + 2 ? -1)\textbf{(7)}\par
where,1 1 1 2 1 1 2 1 1 1 2 1 1 2 1 - - - - - - - U ( ) ( )1 ( ) -( ) ( ) ( ) -( ) c c c µ µ µ µ µ µ µ ?? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? = + ?? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? 2 2 1 2 2 2 1 2 - - - - ( ) ( ) 1 ( ) -( ) , c µ µ µ µ ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? + ?? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?\par
c, A and B are as given in equations ( \hyperref[formula_3]{3}) and (  {\ref 4}) respectively.\par
Since the entire image is a collection of regions, which are characterized by left truncated bivariate normal distribution, it can be characterized through a K-Component finite left truncated bivariate Gaussian distribution and its probability density function is of the form 1 ( , ) ( , ; )K i i i i i h x y g x y ? ? = = ?\textbf{(8)}\par
Where, K is the number of regions, i ? >0 are weights such that1 1 K i i ? = = ? and \{ \} 2 2 1 2 1 2\par
= , , , ,i i i i i\par
? µ µ ? ? ? is the set of parameters. ( , / )i i i i\par
g x y ? given in equation (1)   represent the probability density function of the i th image region. i ? is the probability of occurrence of the i th component of the finite left truncated bivariate Gaussian mixture model (FLTBGMM) i.e., the probability that the feature belongs to the i th image region.\par
The mean vector representing the entire image isT ( ) 1 (W ) ( ) 1 K E X i i i E K E Y i i i ? ? ? ? ? ? ? = ? ? = ? ? ? ? ? = ? ?\textbf{(9)}\par
Where, ( ) L (?) = 1 ( , ; ) N s s s h x y ? = ? = 1 1 ( ( , ; )) N K i i s s s i g x y ? ? = = ? ? (10) ( ) 2 2 1 1 2 2 2 1 1 2 2 1 1 2 1 2 0 0 1 2 exp 2 (1 ) 2 1 , ; N s i s i s i s i i i i i i i s i i i i i K x x y y i f x y dxdy µ µ µ µ ? ? ? ? ? ? ? ? ? ? ? ? ? ? = = ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? + ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? = ? ? ? ? ? ? ? ? ? ? ? ? ? This implies log L (? ) = 1 1 log( ( , ; )) s s N K g x y i i s i ? ? ? ? = =\textbf{(11)}\par
The updated equations of EM-algorithm for estimating the model parameters are\par
)  {\ref , ;} )N l l k k s s s t x y N ? ? + = ? ? = ? ? ? ( )\textbf{( ) ( ) ( ) 1 1 ( , ; ) 1 (}l l k k s s K l l s k i s s i N g x y N g x y ? ? ? ? = = ? ? ? ? = ? ? ? ? ? ? ? ?\textbf{(12) Where, ( ) ( , ;}\par
)l k s s\par
g x y ? is as given in equation (1).\par
For updating 1k µ we have,( ) ( ) ( 1) ( ) ( ) ( ) ( ) ( ) 2 1 1 ( ) 1 1 1 2 ( ) ( , ; ) ( , ; ) ( , ; ) A B 0 l l N N N l l l l l l k s k k k s s k s s s k s s k k l s s s k y t x y t x y x t x y ? ? ? µ µ ? ? ? + = = = ? ? ? ? ? ? + + ? = ? ? ? ? ? ? ? ? ? ? ? (13)\par
Similarly for updating 2k µ , we have ,( ) ( ) ( 1) ( ) ( ) ( ) ( ) ( ) 1 2 2 ( ) 1 1 1 1 ( ) ( , ; ) ( , ; ) ( , ; ) B A 0 l l N N N l l l l l l k s k k k s s k s s s k s s k k l s s s k x t x y t x y y t x y ? ? ? ? µ µ ? ? ? + = = = ? ? ? ? ? ? + + ? = ? ? ? ? ? ? ? ? ? ? ? (14)\par
Where,( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( )\textbf{1}\par
, ; , ; , ; , ; , ;l l l l k k s s k k s s l k s s K l l l s s i i s s i g x y g x y ? ? ? ? ? ? = = = ? , ( ) 2 2 1 1 2 2 2 1 1 2 2 ( ) 2 1 2 0 0 1 exp 2 2(1 ) ( , ; ) = 2 1 , ; s k s k s k s k k k k k k k l k s s k k k k x x y y g x y f x y dxdy ? ? µ µ µ µ ? ? ? ? ? ? ?? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? + ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?\par
A and B are as given in equations ( \hyperref[formula_3]{3}) and (  {\ref 4}) respectively. The updated equations for 2 1k ? at ( 1) l + th iteration is, ( ) 2 ( 1) ( ) 1 2 2 ( ) ( 1) 1 1 ( ) 1 ( ) ( ) ( )( ) ( , ; ) + 0 k k l k l l k k l s s s k s s l s k l k N l l k x x y t x y D E ? µ ? µ µ ? ? ? ? + + = ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?? ? = ? ? ? ? ? ? ? ? ? ? ? ? ?\textbf{(15)}\par
Where, ( )  {\ref ( , ;} )k s s l t x y ?\par
is given in equation (  {\ref 14}), ( )1 1 1 1 1 2 1 2 1 1 1 2 1 1 1 2 1 1 1 1 - - - ( ) -( ) - - - 1 (-) 1 ( ) -( ) , k k k k k k k k k k k k k k k k k k k k k k D c c c µ µ µ ?? ? ? ? ? ? ? ? ? ? ? µ µ µ ? ? µ ? ? ? ? ? ? = + + + ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?\par
And1 2 1 2 1 1 2 1 1 2 1 2 1 2 1 2 2 1 2 - - - ( ) - ) - - - (-) 1 ( ) -( ) k k k k k k k k k k k k k k k k k k k k k E c c k c µ µ µ ? ?? ? ? ? ? ? ? ? ? ? µ µ µ ? ? µ ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? = + ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? + ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ( ) 1 2 1 2 1 1 2 1 - - - + - 1 ( ) -( ) k k k k k k k k k k c µ µ µ ? ? µ ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?\par
The updated equations for 2 2k ? at ( 1)   l  {\ref ( , ;} )  {\ref ( , ;} )+ th iteration is 1 ( ) 2 ( ) ( 1) 1 2 2 ( )\textbf{( 1) 1 2 ( ) 1 ( ) ( ) ( )( )}+ 0 k k l k l l k k l s s s k s s l s k l k N l l k y x y t x y G E ? µ ? µ µ ? ? ? ? + + = ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? = ? ? ? ? ? ? ? ? ? ? ? ? ?\textbf{(16) ( )}k s s l t x y ?\par
and E are as given in equations (  {\ref 14}) and ( \hyperref[formula_26]{15}) respectively and Therefore the updated equation for estimating k? is ( ) ( ) ( ) ( ) 2 2 1 2 2 2 1 2 2 2 1 2 2 2 2 2 2\textbf{2 1 2 ( ) 1 1 1 (1 1 1 ( , ; ) = (}) ) 0 1 k s k s k k s s k k k k s k s k k k k k k k k N l x y t x y s x y D F E ? ? µ µ ? ? ? ? µ µ ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? + ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?? ? + ? ? + + ? + + = ? ? ?? ? ? ? ? ? ? ? ? ?? ? ? ? ?\textbf{(17) Where, ( ) ( , ;}\par
)k s s l t x y ?\par
, D, E and G are as given in equations (  {\ref 14}) ,( \hyperref[formula_26]{15}) and ( \hyperref[formula_31]{16}) respectively and .\par
where, ( )2 2 2 2 2 2 2 2 2 2 2 2 2 1 2\textbf{1 2 1 1 ( ) - ( ) 2 1 (- ) ( ) - ( ) , - - - -}- - 1 k k k k k k k k k k k k k k k k k k c c k k c k k G ?? ? ? ? ? ? ? ? ? ? ? ? µ µ µ ? ? ? µ µ µ µ ? ? ? ? ? ? = + ? ? ? ? ? + + ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? 2011 October ( ) 2 2 2 2 1 2 2 2 2 1 2 - - - ( ) 1 ( ) -( ) k k k k k k k k k k k c µ µ µ ? ? µ ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? + ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? + 1 2 2 2 2 2 2 - - - ( ) ( ) -( ) k k k k k k k k k c c µ µ µ ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?\par
Solving equations ( \hyperref[formula_20]{12}), (  {\ref 13}), (  {\ref 14}), ( \hyperref[formula_26]{15}), ( \hyperref[formula_31]{16}) and ( \hyperref[formula_34]{17}   {\ref 2000})). This method performs well, if the sample size is large, and the computation time is heavily increased. When the sample size is small, some small regions may not be sampled. To overcome this problem, we use K-means algorithm to divide the whole image into various homogeneous regions. In K-means algorithm the centroids of the clusters are recomputed as soon as pixel joins the cluster. The initial values of i ? can be taken asi ? = K 1\par
, where, K is the number of image regions obtained from the K-means algorithm (Rose H. Turi (2001)). K-means algorithm uses an iterative procedure that minimizes the sum of distances from each object to its cluster centroid, over all clusters. This procedure consists of the following steps.\par
1) Randomly choose K data points from the whole dataset as initial clusters. These data points represent initial cluster centroids. 2) Calculate Euclidean distance of each data point from each cluster centre and assign the data points to its nearest cluster centre. 3) Calculate new cluster centre so that squared error distance of each cluster should be minimum. 4) Repeat step 2 and 3 until clustering centers do not change. 5) Stop the process.\par
The efficiency of the EM-algorithm in estimating the parameters is heavily dependent on the number of regions in the image. The number of mixture components taken for K-means algorithm is obtained, 
\section[{IV. INITIALIZATION OF PARAMETERS BY K-}]{IV. INITIALIZATION OF PARAMETERS BY K-} 
\section[{MEANS}]{MEANS}\par
In the above algorithm, the cluster centers are only updated once all points have been allocated to their closed cluster centre. The advantage of K -means   are that it is a very simple method, and it is based on intuition about the nature of a cluster, which is that the within cluster error should be as small as possible. The disadvantage of this method is that the number of clusters must be supplied as a parameter, leading to the user having to decide what the best number of clusters for the image is  {\ref (} ? for each image region and with the method of moments given by Bengt \hyperref[b0]{Muthen (1990)} for Truncated Bivariate Normal Distribution with initial parameters as? i = 1/K for i=1,2,?,K 1k µ = 1k\par
x is the k th region sample mean of the Hue angle. Substituting these values as the initial estimates, we obtain the refined estimates of the parameters by using the EM-algorithm.\par
V. 
\section[{SEGMENTATION ALGORITHM}]{SEGMENTATION ALGORITHM}\par
After refining the parameters the prime step is image segmentation, by allocating the pixels to the segments. This operation is performed by segmentation algorithm. The image segmentation algorithm consists of four steps ( )2 2 2 1 2 1 2 2 2 2 - - - ( ) 1 ( ) -( ) k k k k k k k k k k k F c µ µ µ ?? ? ? µ ? ? ? ? ? ? ? ? ? ? ? ? ? ? = ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? . That is ( ) 2 2 1 1 2 2 2 1 1 2 2 2 1 2 0 0 1 exp 2 2(1 ) max 2 1 , , s k s k s k s k k k k k k k j j k k k k k x x y y L f x y dxdy µ µ µ µ ? ? ? ? ? ? ?? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? + ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? VI. 
\section[{EXPERIMENTAL RESULTS}]{EXPERIMENTAL RESULTS}\par
To demonstrate the utility of the image segmentation algorithm developed in this paper, an experiment is conducted with six images taken from Berkeley images dataset (http://www.eecs.  Step4) Assign each pixel into the corresponding j th region (segment) according to the maximum likelihood of the j th component L j .\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-3.png}
\caption{\label{fig_1}1}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1k}\includegraphics[]{image-5.png}
\caption{\label{fig_3}2k µ = 1k y}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{12212}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Step 1 ) 2 1k ? , 2 2k ? , k ? and k ? for i= 1 , 2 ,}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-7.png}
\caption{\label{fig_5}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{222}\includegraphics[]{image-8.png}
\caption{\label{fig_6}Figure 2 : 2 1i ? , 2 2i?}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-9.png}
\caption{\label{figure9}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.7740634005763688\textwidth}P{0.07593659942363112\textwidth}}
and k ? .\tabcellsep ? 1k µ , 2k µ , 2 1k ? , 2 ? 2k\\
by plotting the histogram of the pixel intensities of the\tabcellsep \\
whole image. The mixing parameter k ? and the region\tabcellsep \\
parameters 1k µ , 2k µ , 2 1k ? , 2 2k ? , k ? are unknown as\tabcellsep \\
prior. A commonly used method in initializing\tabcellsep \\
parameters is by drawing a random sample in the entire\tabcellsep \\
image data (Mclanchan G. and Peel D. (\tabcellsep \end{longtable} \par
 
\caption{\label{tab_2}}\end{figure}
 			\footnote{© 2011 Global Journals Inc. (US)} 			\footnote{© 2011 Global Journals Inc. (US) Global Journal of Computer Science and Technology Volume XI Issue XVIII Version I} 			\footnote{October © 2011 Global Journals Inc. (US)} 			\footnote{© 2011 Global Journals Inc. (US) Global Journal of Computer Science and Technology Volume XI Issue XVIII Version I 28} 		 		\backmatter  			 \par
Substituting the final estimates of the model parameters, the probability density function of the feature vector of each image are estimated. Using the estimated probability density functions and the image segmentation algorithm given in section V, the image segmentation is done for each of the six images under consideration. The original and segmented images are shown in Figure  {\ref 3}.  
\subsection[{PERFORMANCE EVALUATION}]{PERFORMANCE EVALUATION}\par
After conducting the experiment with the image segmentation algorithm developed in this paper, its performance is studied. The comparison is based on three performance measures namely, Probabilistic Rand Index (PRI) given by Unnikrishnan R. and et.al  {\ref (2007)}, the Variation of Information (VOI) given by Meila M. (2005), and Global Consistency error (GCE) given by \hyperref[b15]{Martin D. and et al (2001)}. The objective of the segmentation methods are based on regional similarity measures in relations to their local neighborhood.\par
The performance of developed algorithm using finite left truncated bivariate Gaussian mixture model (FLTBGMM) is studied by computing the segmentation performance measures namely, PRI, GCE and VOI for the six images under study. The computed values of the performance measures for the developed algorithm and the earlier existing finite Gaussian mixture model (GMM) with K-means algorithm are presented in Table  {\ref 3} for a comparative study.     {\ref 4}, it is observed that all the image quality metrics for the images are meeting the standard criteria. This implies that using the proposed algorithm the images are retrieved accurately. A comparative study of proposed algorithm with that of algorithm based on finite Gaussian mixture model (GMM) and Finite left truncated bivariate Gaussian mixture model with K-means reveals that the mean square error of the proposed model is less than that of the finite GMM and FLTBGMM. Based on all other quality metrics also it is observed that the performance of the proposed model in retrieving the images is better than the finite Gaussian mixture model. 
\subsection[{VIII.}]{VIII.} 
\subsection[{CONCLUSION}]{CONCLUSION}\par
In this paper we introduce a novel and new colour image segmentation method based on left truncated bivariate Gaussian mixture model. Here it is assumed that the colour image is characterized by HSI colour space, in which the Hue and Saturation values are non negative. they are characterized by left truncated Bivariate Gaussian mixture model. The left truncated bivariate Gaussian distribution includes the Bivariate Gaussian distribution is a limiting case when the truncation points tends to infinite. It also includes several platy, meso, lefty and skewed distributions as particular cases for different values of the parameters. The model parameters are estimated by using EMalgorithm. The initialization and the number of image segments are determined through K-means algorithm and moment method of estimation. The segmentation algorithm is developed with component maximum likelihood. The experimentation with six colour images reveals that this algorithm outperforms the existing algorithms in both image segmentation and image retrievals. The image quality metrics also supported the utility of the proposed algorithm. It is possible to develop image segmentation algorithm with finite mixture of doubly truncated multivariate Gaussian distribution with more image features which require further investigations.			 			  				\begin{bibitemlist}{1}
\bibitem[Bhattacharyya ()]{b25}\label{b25} 	 		‘A Brief Survey of Color Image Preprocessing and Segmentation Techniques’.  		 			Siddhartha Bhattacharyya 		.  	 	 		\textit{Journal of Pattern Recognition Research}  		2011. p. .  	 
\bibitem[Martin et al. ()]{b15}\label{b15} 	 		‘A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics’.  		 			D Martin 		,  		 			C Fowlkes 		,  		 			D Tal 		,  		 			MalikJ 		.  	 	 		\textit{proc. 8th Int. Conference Computer vision},  				 (8th Int. Conference Computer vision)  		2001. 2 p. .  	 
\bibitem[Kato and Ting-Chuen ()]{b10}\label{b10} 	 		‘A Markov random field image segmentation model for color textured images’.  		 			Z Kato 		,  		 			Pong Ting-Chuen 		.  	 	 		\textit{Image and Computing Vision}  		2006. 24  (10)  p. .  	 
\bibitem[Paulinas and Usinskas ()]{b14}\label{b14} 	 		‘A survey of genentic algorithms applications for image enhancement and segmentation’.  		 			Mantas Paulinas 		,  		 			Andrius Usinskas 		.  	 	 		\textit{Information Technology and control}  		2007. 36  (3)  p. .  	 
\bibitem[Xu et al. ()]{b7}\label{b7} 	 		‘An MDL Approach to Color Image Segmentation’.  		 			Kaikuo Xu 		,  		 			Hongwei Zhang 		,  		 			Tianyun Yan 		,  		 			Wei Wei 		,  		 			Shaomin 		,  		 			Wen Qiang 		.  	 	 		\textit{International Conference on Multimedia and Signal Processing},  				2011. 2 p. .  	 
\bibitem[Rose and Turi ()]{b21}\label{b21} 	 		\textit{Cluster Based Image Segmentation},  		 			H Rose 		,  		 			Turi 		.  		2001. Australia.  		 			Monash University 		 	 	 (phd Thesis) 
\bibitem[Sujaritha and Annadurai ()]{b28}\label{b28} 	 		‘Color image segmentation using Adaptive Spatial Gaussian Mixture Model’.  		 			M Sujaritha 		,  		 			S Annadurai 		.  	 	 		\textit{International journal of signal processing}  		2010. 6  (1)  p. .  	 
\bibitem[Lucchese and Mitra ()]{b12}\label{b12} 	 		‘Color image segmentation: A state-of art survey’.  		 			L Lucchese 		,  		 			S K Mitra 		.  	 	 		\textit{Proc. Indian National Science Academy (INSA-A)},  				 (Indian National Science Academy (INSA-A))  		2001. 67 p. .  	 
\bibitem[Lee et al. ()]{b11}\label{b11} 	 		‘Color shift model-based image enhancement for digital multifocusing based on a multiple color-filter aperture camera’.  		 			E Lee 		,  		 			W Kang 		,  		 			S Kim 		,  		 			J Paik 		.  	 	 		\textit{IEEE Trans. On Consumer Electronics}  		2010.  (2)  p. .  	 
\bibitem[Ferri and Vidal ()]{b4}\label{b4} 	 		‘Colour image segmentation and labelling through multieditcondensing’.  		 			F Ferri 		,  		 			E Vidal 		.  	 	 		\textit{pattern Recognition Letters}  		1992. 13  (8)  p. .  	 
\bibitem[Patra et al. ()]{b1}\label{b1} 	 		‘Combining GLCM Features and Markov Random Field Model for Colour Textured Image Segmentation’.  		 			Dipti Patra 		,  		 			J Mridula 		,  		 			K Kumar 		.  	 	 		\textit{Int. Conf. on Devices and Communications (ICDeCom)},  				2011. p. .  	 
\bibitem[Meila ()]{b18}\label{b18} 	 		‘Comparing Clustering -An axiomatic view’.  		 			M Meila 		.  	 	 		\textit{proc.22nd Int. Conf. Machine Learning},  				 (.22nd Int. Conf. Machine Learning)  		2005. p. .  	 
\bibitem[Johnson et al. ()]{b19}\label{b19} 	 		\textit{Continuous Univariate Distributions" Volume-I},  		 			Norman L Johnson 		,  		 			Samuel Kortz 		,  		 			Balakrishnan 		.  		1994. New York: John Wiley and Sons Publications.  	 
\bibitem[Majid Fakheri et al. ()]{b13}\label{b13} 	 		‘EM segmentation algorithm for colour image retrieval’.  		 			Majid Fakheri 		,  		 			T Sedghi 		,  		 			M C Amirani 		.  	 	 		\textit{6th Iranian Conference on Machine Vision and Image Processing},  				2010. p. .  	 
\bibitem[Feng et al. ()]{b9}\label{b9} 	 		‘Flame Color Image Segmentation Based on Neural Network’.  		 			Kang Feng 		,  		 			Wang Yaming 		,  		 			Zhao Yun 		.  	 	 		\textit{International Forum on Computer Science-Technology and Applications}  		2009. p. .  	 
\bibitem[Global Journal of Computer Science and Technology Volume XI Issue XVIII Version I 30]{b8}\label{b8} 	 		\textit{Global Journal of Computer Science and Technology Volume XI Issue XVIII Version I 30},  		 	 
\bibitem[Eskicioglu and Fisher ()]{b2}\label{b2} 	 		‘Image Quality Measures and their Performance’.  		 			A M Eskicioglu 		,  		 			P S Fisher 		.  	 	 		\textit{IEEE Transactions On comm}  		1995. 43  (12)  p. .  	 
\bibitem[Seshashayee et al. ()]{b23}\label{b23} 	 		‘Image segmentation based on a finite generalized new symmetric mixture model with K-means’.  		 			M Seshashayee 		,  		 			K Srinivasa Rao 		,  		 			Srinivasa Satyanarayana Ch 		,  		 			P Rao 		.  	 	 		\textit{Int. J. Computer Science Issues}  		2011. 3  (8)  p. .  	 
\bibitem[Farnoosh et al. ()]{b20}\label{b20} 	 		‘Image Segmentation using Gaussian Mixture Models’.  		 			Rahman Farnoosh 		,  		 			Gholamhossein Yari 		,  		 			Behnam Zarpak 		.  	 	 		\textit{IUST International Journal of Engineering Science}  		2008. No.1-2, 2008. 19 p. .  	 
\bibitem[Shital Raut Raghuvanshi et al. ()]{b24}\label{b24} 	 		‘Image Segmentation-A state-of-Art Survey for Prediction’.  		 			M Shital Raut Raghuvanshi 		,  		 			R Dharaskar 		,  		 			A Raut 		.  	 	 		\textit{Advanced Computer control, ICACC'09. International Conference},  				2009. p. .  	 
\bibitem[Mclanchlan and Krishnan ()]{b16}\label{b16} 	 		 			G Mclanchlan 		,  		 			T Krishnan 		.  		\textit{The EM Algorithm and Extensions},  				 (New York)  		1997. 1997. John Wiley and Sons.  	 
\bibitem[Mclanchlan and Peel ()]{b17}\label{b17} 	 		 			A Mclanchlan 		,  		 			G Peel 		,  		 			D 		.  		\textit{The EM Algorithm For Parameter Estimations},  				 (New York)  		2000. 2000. John Wileyand Sons.  	 
\bibitem[Muthen ()]{b0}\label{b0} 	 		‘Moments of the censored and truncated bivariatenormal distribution’.  		 			Bengt Muthen 		.  	 	 		\textit{British Journal of Mathematical and Statistical psychology}  		1990.  (43)  p. .  	 
\bibitem[Farag et al. ()]{b3}\label{b3} 	 		‘Precise Image Segmentation by Iterative EM-Based Approximation of Empirical Grey Level Distributions with Linear Combinations of Gaussians’.  		 			A A Farag 		,  		 			A El-Baz 		,  		 			G Gimelfarb 		.  	 	 		\textit{Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CVPRW'04)},  				 (the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CVPRW'04))  		2004.  	 
\bibitem[Fesharaki and Hellestrand ()]{b5}\label{b5} 	 		\textit{Realtime color image segmentation},  		 			M N Fesharaki 		,  		 			G R Hellestrand 		.  		 SCS\&E 9316.  		1992. Australia.  		 			Univ. of New South Wales 		 	 	 (Technical Report) 
\bibitem[Haralick ()]{b6}\label{b6} 	 		‘Survey: Image segmentation Techniques’.  		 			Shapiro Haralick 		.  	 	 		\textit{CVGIP}  		1985. 29 p. .  	 
\bibitem[Sangwine and Horne ()]{b22}\label{b22} 	 		\textit{The Colour Image Processing Hand Book},  		 			S J Sangwine 		,  		 			R E N Horne 		.  		1998.  	 
\bibitem[Unnikrishnan et al. ()]{b29}\label{b29} 	 		‘Toward objective evaluation of image segmentation algorithms’.  		 			R Unnikrishnan 		,  		 			C Pantofaru 		,  		 			M Hernbert 		.  	 	 		\textit{IEEE Trans. Pattern Annl.Mach.Intell}  		2007. 29  (6)  p. .  	 
\bibitem[Srinivas et al. ()]{b27}\label{b27} 	 		‘Unsupervised Image Segmentation Based on Finite Generalized Gaussian Mixture Model With Hierarchical Clustering’.  		 			Y Srinivas 		,  		 			K Srinivasa Rao 		,  		 			Prasad Reddy 		,  		 			PV G D 		.  	 	 		\textit{International journal for Computational vision and Biomechanics}  		2010. 3  (1)  p. .  	 
\bibitem[
			SrinivasY
		 ()]{b26}\label{b26} 	 		‘Unsupervised image segmentation using finite doubly truncated gaussian mixture model and Hierarchical clustering’.  		 			SrinivasY 		,  		 			Srinivas 		.  	 	 		\textit{Journal of Current Science}  		2007. 93  (4)  p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
