\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={from Background}, 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{2012-03-15 (revised: 15 March 2012)} \def\TheID{\makeatother } \def\TheDate{2012-03-15} \title{from Background} \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]{M.Joseph Prakash} \author[2]{M.Joseph Prakash} \affil[1]{ JNT University} \renewcommand\Authands{ and } \date{\small \em Received: 13 February 2012 Accepted: 3 March 2012 Published: 15 March 2012} \maketitle \begin{abstract} Extraction of object regions from complex background is a hard task and it is an essential part of image segmentation and recognition. Image segmentation denotes a process of dividing an image into different regions. Several segmentation approaches for images have been developed. Image segmentation plays a vital role in image analysis. According to several authors, segmentation terminates when the observer?s goal is satisfied. The very first problem of segmentation is that a unique general method still does not exist: depending on the application, algorithm performances vary. This paper studies the insect segmentation in complex background. The segmentation methodology on insect images consists of five steps. Firstly, the original image of RGB space is converted into Lab color space. In the second step ?a? component of Lab color space is extracted. Then segmentation by two-dimension OTSU of automatic threshold in ?a-channel? is performed. Based on the color segmentation result, and the texture differences between the background image and the required object, the object is extracted by the gray level co-occurrence matrix for texture segmentation. The algorithm was tested on dreamstime image database and the results prove to be satisfactory. \end{abstract} \keywords{texture, color, image segmentation, GLCM.} \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& \section[{Introduction}]{Introduction}\par olor segmentation is an essential, critical, and preliminary process in a lot of vision-based tasks such as object recognition, visual tracking, human-computer interaction (HCI), human-robot interaction (HRI), vision-based robotics, visual surveillance, and so forth, because color is an effective and robust visual cue for characterizing an object from the others. Recently, there has been growing interest in the insect segmentation, which aims at detecting insects in an image.\par However, color segmentation is not robust enough to deal with complex environments. Especially, changing illumination condition and complex background containing surfaces or objects with similar colors to a target are the major problems that limit its applications in practical real world. The former changes the characteristics of a color and the latter results in increasing false positive pixels. Generally, it is known that robustness in color segmentation is achieved if a Author ? : M.Joseph Prakash, Associate Professor, IT Dept., GIET, Rajahmundry, Having 16 years of experience. He is pursuing his Ph.D from JNT University, Kakinada in Computer Science under the guidance of Dr. V. Vijaya Kumar. E-mail : mjosephp7@gmail.com Author ? : Dr.V.Vijayakumar, Dean Computer Sciences, Head-Srinivasa Ramanujan Research Forum, GIET Rajahmundry, India. E-mail : vakulabaranam@hotmail.com color space efficiently separates chrominance and luminance in a color image and a plausible model of chrominance distribution is used \hyperref[b0]{[1]}. Such chrominance information may be utilized to locate possible regions of a color in a color space and additional features may be adopted in order to validate the hypothesis. Ruizdel-Solar and Verschae \hyperref[b1]{[2]} have compensated for their color segmentation methods with additional features to obtain more valuable results robust to brightness variations. However, this approach is not included in a pure research area of color segmentation. Dai and Nakano \hyperref[b2]{[3]} have enhanced skin regions by converting red-green-blue (RGB) color signals to YIQ representation and using the I component, which includes color components from orange to cyan. Fieguth and Terzopoulos \hyperref[b3]{[4]} have developed a tracking algorithm by heavily relying on a color cue composed of red (R), green (G), and blue (B) color components. Evaluating each component of several color spaces, Gomez \hyperref[b4]{[5]} has listed top components and made a hybrid color space from those. In above researches, a color is dependent on the intensity of a pixel {\ref [6]}. In real world cases, however, it is not always possible to control illumination condition. Therefore, many researches have been carried out for invariant detection of a color under illumination variations. Yang and Waibel \hyperref[b5]{[7]} proposed color histograms in normalized red-green (RG) chromatic color space [6]. McKenna et al. \hyperref[b6]{[8]} have proposed, however, Gaussian mixture models for the task, which outperform single Gaussian model. Also, color segmentation algorithms have been proposed in order to obtain the robustness toward changes in illumination and shadows by dropping the intensity. Sobottka and Pitas \hyperref[b8]{[10]} have used chromatic information in hue-saturation-intensity (HSI) color space together with a best-fit ellipse technique to improve robustness of color segmentation. Tomaz et al. \hyperref[b9]{[11]} have proposed an algorithm for color segmentation in TSL color space. Moreover, various color models have been proposed by using several color spaces such as YCbCr \hyperref[b10]{[12]}, YUV \hyperref[b11]{[13]}, and CIE Lab \hyperref[b12]{[14]}. Actually, Phung et al. \hyperref[b13]{[15]} have ascertained that most color space transformations do not bring the assumed benefits. Especially, Jayaram et al. \hyperref[b26]{[28]} have verified that the best performance of skin color segmentation was obtained in HSI color space, keeping an intensity component. That is, color segmentation is largely unaffected by the choice of a color space. However, segmentation performance degrades when only chrominance channels are used in classification. \hyperref[b26]{[28]} Cho et al. \hyperref[b27]{[29]} have proposed a method called an adaptive skin color filter that detects skin color regions in a color image by adaptively adjusting its threshold values. Soriano et al. \hyperref[b28]{[30]} have demonstrated a chromaticity-based constraint to select training pixels in a scene. In \hyperref[b29]{[31]}, histograms have been dynamically updated, based on feedback from the current color segmentation and prediction of a Markov model to get changing geometric parameters of color distribution and to track those. Adaptive or learning methods for color segmentation dynamically allocated a color through various illumination conditions while those models were adjusted for every image sequences and the adjustment needs heavier computational load to track targets than a static color model. Since there are a number of models for color segmentation as above, Martinkauppi et al. \hyperref[b30]{[32]} have selected four types of color segmentation and compared their performance each other under significantly changing illumination conditions. Phung et al. \hyperref[b13]{[15]} have investigated nine different color pixel classification algorithms. It was found for the Bayesian classifier to have higher classification rates than the other tested classifiers.\par Generally, color image segmentation approaches can be divided into the following categories: statistical approaches, edge detection approaches, region splitting and merging approaches, methods based on physical reflectance models, methods based on human color perception, and the approaches using fuzzy set theory \hyperref[b31]{[33]}, \hyperref[b32]{[34]}.Histogram thresholding is one of the widely used techniques for monochrome image segmentation \hyperref[b33]{[35]}. As for color images, the situation is different due to the multifeatures {\ref [36]}. Since the color information is represented by tristimulus R, G and B or some linear/nonlinear transformation of RGB, representing the histogram of a color image in a three-dimensional (3-D) array and selecting threshold in the histogram is not a trivial job \hyperref[b34]{[37]}. One way to solve this problem is to develop efficient methods for storing and processing the information of the image in the 3-D color space. \hyperref[b35]{[38]} used a binary tree to store the 3-D histogram of a color image, where each node of the tree includes RGB values as the key and the number of points whose RGB values are within a range centered by the key value. \hyperref[b36]{[39]} also utilized the same data structure and similar method to detect clusters in the 3-D normalized color space (X, Y, I). Another way is to project the 3-D space onto a lower dimensional space, such as two-dimensional (2-D) or even one-dimensional (1-D). \hyperref[b37]{[40]} used projections of 3-D normalized color space (X, Y, I) space onto the 2-D planes (X-Y, X-I, and Y-I) to interactively detect insect infestations in citrus orchards from aerial color infrared photographs. \hyperref[b38]{[41]} Provided segmentation approaches using 2-D projection of color space. \hyperref[b39]{[42]} Suggested a multidimensional histogram thresholding scheme using threshold values obtained from three different color spaces (RGB, YIQ, and HSI). This method used a mask for region splitting and the initial mask included all pixels in the image. For any mask, histograms of the nine redundant features (R, G, B, Y, I, Q,H,S, and I) of the masked image are computed, all peaks in these histograms are located, the histogram with the best peak is selected and a threshold is determined to split the masked image into two sub regions for which two new masks are generated for further splitting. This operation is repeated until no mask left unprocessed, which means none of the nine histograms of existing regions can be further thresholded and each region is homogeneous.\par This paper proposed a new color texture based image segmentation approach for insect extraction from complex background. In section II, GLCM was discussed. Automatic OTSU threshold was discussed was given in section III. Methodology of the proposed algorithm was presented in section IV. Results \& discussions were given in section V. Finally, conclusions were given in section VI. \section[{II.}]{II.} \section[{GLCM}]{GLCM}\par Your Gray level co-occurrence matrix (GLCM) has been proven to be a very powerful tool for texture image segmentation \hyperref[b14]{[16,}\hyperref[b15]{17]}. The only shortcoming of the GLCM is its computational cost. Such restriction causes impractical implementation for pixel-by-pixel image processing. In the previous works, GLCM computational burden was reduced by two methods, at the computation architecture level and hardware level. D. A. Clausi et. al. restructures the GLCM by introducing a GLCLL (gray level co-occurrence linked list), which discard the zero value in the GLCM \hyperref[b16]{[18]}.This technique gives a good improvement because mostly GLCM is a sparse matrix where most of its values are equal to zeroes. Thus the size of GLCLL is significantly smaller than GLCM. Then the structure of the GLCLL was improved in \hyperref[b17]{[19,}\hyperref[b18]{20]}. Another work is presented in \hyperref[b19]{[21]} where fast calculation of GLCM texture features relative to a window spanning an image in a raster manner was introduced. This technique was based on the fact that windows relative to adjacent pixels are mostly overlapping, thus the features related to the pixels inside the overlapping windows can be obtained by updating the early calculated values. In January 2007, S. Kiranyaz and M. Gabbouj proposed a novel indexing technique called Hierarchical Cellular Tree (HCT) to handle large data \hyperref[b20]{[22]}. In his work, it was proved that the proposed technique is able to reduce the GLCM texture features computation burden.\par GLCM is a matrix that describes the frequency of one gray level appearing in a specified spatial linear relationship with another gray level within the area of( D D D D ) F 2012\par Year investigation \hyperref[b21]{[23]}. Here, the co-occurrence matrix is computed based on two parameters, which are the relative distance between the pixel pair d measured in pixel number and their relative orientation ?. Normally, ? is quantized in four directions (00, 450,900 and 1350) \hyperref[b21]{[23]}. In practice, for each d, the resulting values for the four directions are averaged out. To show how the computation is done, for image I , let m represent the gray level of pixels (x, y) and n represent the gray level of pixels ( x±d?0, y±d?1 ) with L level of gray tones where 0 ? x ? M ?1, 0 ? y ? N ?1 and 0 ? m, n ? L ?1. From these representations, the gray level cooccurrence matrix Cm, n for distance d and direction ? can be defined as.?? ?? ,??,? = ? ? ??\{??(??, ??) = ??\& ??(?? ± ??? 0 , ?? â??" ??? 1 ) = ??\} ?? ?? (1)\par Where P\{.\} =1 if the argument is true and otherwise, P \{.\} =0. For each ? value, its ?0and ?1 values are referred as in the Table \hyperref[tab_0]{1}.\par In the classical paper \hyperref[b22]{[24]}, Haralick et. al introduced fourteen textural features from the GLCM and then in \hyperref[b23]{[25]} stated that only six of the textural features are considered to be the most relevant. Those textural features are Energy, Entropy, Contrast, Variance, Correlation and Inverse Difference Moment. Energy is also called Angular Second Moment (ASM) where it measures textural uniformity \hyperref[b21]{[23]}. If an image is completely homogeneous, its energy will be maximum. Entropy is a measure, which is inversely correlated to energy. It measures the disorder or randomness of an image \hyperref[b21]{[23]}. Next, contrast is a measure of local gray level variation of an image. This parameter takes low value for a smooth image and high value for a coarse image. On the other hand, inverse difference moment is a measure that takes a high value for a low contrast image. Thus, the parameter is more sensitive to the presence of the GLCM elements, which are nearer to the symmetry line C (m, m) \hyperref[b21]{[23]}. Variance as the fifth parameter is a measure that is similar to the first order statistical variables called standard deviation \hyperref[b24]{[26]}. The last parameter, correlation, measures the linear dependency among neighboring pixels. It gives a measure of abrupt pixel transitions in the image \hyperref[b25]{[27]}. \section[{III. OTSU THRESHOLDING}]{III. OTSU THRESHOLDING}\par This method, as proposed by \hyperref[b23]{[25]} is based on discriminate analysis. The threshold operation is regarded as the partitioning of the pixels of an image into two classes C0 and C1 (e.g., objects and background) at grey-level t, i.e., C0 = \{0, 1, 2, t\} and C1 = \{t + 1, t +2,?.L-1\}. Let ?2w, ?2B and ?2T be the within-class variance, between-class variance, and the Where ni is the number of pixels with grey-level and n is the total number of pixels in a given image defined as total variance, respectively. An optimal threshold can be determined by minimizing one of the following (equivalent) criterion functions with respect to: Moreover, Pi is the probability of occurrence of grey-level i. For a selected threshold 't' of a given image, the class probabilities w0 and w1 indicate the portions of the areas occupied by the classes C0 and C1. The class means µ0 and µ1 serve as estimates of the mean levels of the classes in the original grey-level image. Moreover, the maximum value of ? , denoted by ?*, can be used as a measure to evaluate the separability of classes C0 and C1 in the original image or the bimodality of the histogram. This is a very significant measure because it is invariant under affine transformations of the grey-level scale. It is uniquely determined within the range 0 ? ? ?1.The low er bound (zero) is obtained when and only when a given image has a single constant grey level, and the upper bound IV. \section[{METHODOLOGY}]{METHODOLOGY}\par In the first step RGB image is converted to 1976 CIE LUV color space. This color space is approximately perceptually uniform. The perceptual non-uniformity of this color space greatly improves over the CIE XYZ color space. In CIE LUV color space, L* specifies brightness of colors on a scale from 0 to 100, u* specifies color location approximately along the red-green axis with grey located at 0 and v* specifies color location approximately along the yellow-blue axis with grey located at 0.The color corresponding to u*=v*=L*=0 is black and u*=v*=0, L*=100 is white.\par Each color space has its own appear background and application region. When segmenting a color image, the selection of color space plays a decisive role on the segmentation results. The common color spaces used in color image processing include RGB color space, HSI color space, CIE color space, and so on. At present, the general color digital images are RGB format. RGB color space is based on the theory of three-basic color to build. RGB format is the most basic color space. Other color space models can be obtained through the RGB format conversion. But the RGB color space is not a homogeneous visual perception space, it is not conducive to image segmentation based on color feature. HSI color space uses color characteristics of a direct sense of the three quantities: the brightness or lightness (I), hue (H), saturation (S) to describe the color. This method is more in line with the human eye habits to the description of the color, but the expressed colors are incomplete visual perceived color.\par One problem with the CIEXYZ colour model is its lack of perceptual balance. Colours which are the same distance from one another are not necessarily perceptually equidistant. In 1976, the CIE proposed the CIE LUV colour model to address this problem. CIELUV is a perceptually uniform colour space. This means that distance and difference can be interchanged as required. If colours A and B are twice as far apart as colours C and D, then the perceived difference between A and B is roughly twice the perceived difference between C and D. The equations for computing CIE LUV assume you have (X, Y,Z) of the colour to convert, and (Xw,Yw, Zw) of a standard white. Given these values, the corresponding LUV colour is: L*=116(Y/Yw)1/3-16,(Y/Yw)>0.01 \hyperref[b8]{(10)} u*=13L*(u'-u'w) \hyperref[b9]{(11)} v*=13L*(v'-v'w) \hyperref[b10]{(12)} u'=(4X)/(X+15Y+3Z) \hyperref[b11]{(13)} v'=(9Y)/(X+15Y+3Z) \hyperref[b12]{(14)} u'w =0.2009, v'w=0.4610 \hyperref[b13]{(15)} L* encodes the luminance or intensity of a given colour, while u' and v' control its chromaticity.\par The 'v' component is extracted from the transformed LUV color space in the second step. In the third step the extracted v-component is subjected to OTSU thresholding. The two-dimensional OTSU algorithm automatically selects the optimal threshold for segmentation.\par Because two-dimensional OTSU algorithm not only takes into account the grayscale information of pixels, but also considers the spacerelated information of pixels and their neighborhoods. GLCM is obtained for the otsu thresholded image. For each image and with distance set to one, four GLCMs having directions 0°, 45°, 90° and 135° are generated. The co-occurrence matrix is often correlated with the directions. It is necessary to select more than one direction of gray level co-occurrence matrix for a comprehensive statistical processing. The synthetic gray level co-occurrence matrix of an image can be got by averaging the values of energy matrices in 0 degree, 45 degree, 90 degree and 135 degree.\par In the fifth step, image negative is applied for better enhancement of insect region. In the last step, morphological closing operation is performed in order to fill small holes. A hole is defined as an area of dark pixels surrounded by lighter pixels or may be defined as a background region surrounded by a connected border of foreground pixels. This process can be used to make objects in an image seem disappear as they are replaced with values that blend in with the background area. This function is useful for image editing, including removal of extraneous details or artifacts. \section[{RESULTS}]{RESULTS}\par The proposed algorithm is tested on dreamstime image database. In this paper step wise results of insect images are shown in Figs. {\ref 2-4} \section[{CONCLUSION}]{CONCLUSION}\par The information which the commonly used grayscale images contain is not enough for insect segmentation. The images consisting of insects when collected in nature, the is generally more complex and more close to the target color, so there are some limitations in these conditions if we only use gray level information. However, the color images are able to provide more information. There are colors and color depth information, in addition to its provision of brightness and color images can be expressed by a variety of color space. Therefore, segmentation based on color image can overcome some shortcomings of gray-scale image. In this algorithm both color and texture features are considered. In this method, segmentation speed is faster and without human participation, the segmentation result is also deal. The results show the efficiency of the above algorithm. \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}Fig. 1 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{234}\includegraphics[]{image-4.png} \caption{\label{fig_2}Fig. 2 :Fig. 3 :Fig. 4 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{1} \par \begin{longtable}{} \end{longtable} \par \caption{\label{tab_0}Table 1 :}\end{figure} \footnote{© 2012 Global Journals Inc. (US)} \backmatter \begin{bibitemlist}{1} \bibitem[Weszka et al. (1976)]{b14}\label{b14} ‘A Comparative Study of Texture Measures For Terrain Classification’. J Weszka , C Dyer , A Rosenfeld . \textit{IEEE Trans. SMC} April 1976. 6 (4) p. . \bibitem[Gong et al. ()]{b24}\label{b24} ‘A comparison of spatial feature extraction algorithms for land-use classification with SPOT HRV data’. P Gong , J D Marceau , P J Howarth . \textit{Proc.Remote Sensing Environ}, (.Remote Sensing Environ) 1992. 40 p. . \bibitem[Clausi and Jernigan ()]{b16}\label{b16} ‘A fast method to determine co-occurrence texture features’. D A Clausi , M E Jernigan . \textit{IEEE Trans on Geoscience \& Rem. Sens} 1998. 36 (1) . \bibitem[Pal ()]{b32}\label{b32} ‘A reviewon image segmentation techniques’. N Pal , S . \textit{Pattern Recognit} 1993. 26 (9) p. . \bibitem[Conners and Harlow]{b15}\label{b15} \textit{A Theoretical Comparison of Texture Algorithms}, R W Conners , C A Harlow . IEEE 1980. \bibitem[Otsu ()]{b23}\label{b23} ‘A Threshold Selection Method from Gray-Level Histogram’. N Otsu . \textit{IEEE Trans. on System Man Cybernetics} 1979. 9 p. . \bibitem[Ukovich et al. ()]{b25}\label{b25} ‘A tool based on the GLCM to measure the performance of dynamic range reduction algorithms’. A Ukovich , G Impoco , G Ramponi . \textit{IEEE Int. Workshop on Imaging Sys. \& Techniques}, 2005. \bibitem[Littmann et al. (1994)]{b33}\label{b33} ‘Adaptive color segmentation-A comparison of neural and statistical methods’. E Littmann , H A Ritter ; M , Arbib . \textit{IEEE Trans. Pattern Anal. Machine Intell} Jan. 1997. Dec.94. 8. (IEEE Trans. Neural Networks) \bibitem[Soriano et al. ()]{b28}\label{b28} ‘Adaptive skin color modeling using the skin locus for selecting training pixels’. M Soriano , B Martinkauppi , S Huovinen , M Laaksonen . \textit{Pattern Recognition} 2003. 36 p. . \bibitem[Cho et al. ()]{b27}\label{b27} ‘Adaptive skin-color filter’. K Cho , J Jang , K Hong . \textit{Pattern Recognition} 2001. 34 p. . \bibitem[Clausi and Zhao ()]{b17}\label{b17} ‘An advanced computational method to determine co-occurrence probability texture features’. D A Clausi , Yongping Zhao . \textit{IEEE Int. Geoscience and Rem. Sens. Sym} 2002. 4. \bibitem[Tenenbaum et al. ()]{b38}\label{b38} ‘An interactive facility for scene analysis research’. J M Tenenbaum , T D Garvey , S Weyl , H C Wolf . \textit{Artif. Intell. Center, Stanford Res. Institute} 1974. 87. (Tech. Rep.) \bibitem[Baraldi and Parmiggiani ()]{b21}\label{b21} ‘An Investigation of the Textural Characteristics Associated With GLCM Matrix Statistical Parameters’. A Baraldi , F Parmiggiani . \textit{IEEE Trans. on Geos. and Rem.Sens} 1995. 33 (2) . \bibitem[Cheng et al.]{b31}\label{b31} ‘Color image segmentation: Advances and prospects’. H D Cheng , X H Jiang , Y Sun , J L Wang . \textit{Pattern Recognit} (to be published) \bibitem[Fieguth and Terzopoulos ()]{b3}\label{b3} ‘Color-based tracking of heads and other mobile objects at video frame rates’. P Fieguth , D Terzopoulos . \textit{IEEE International Conference on Computer Vision and Pattern Recognition}, 1997. p. . \bibitem[Terrillon et al. ()]{b0}\label{b0} ‘Detection of human faces in complex scene images by use of a skin color model and of invariant Fourier-Mellin moments’. J Terrillon , M David , S Akamatsu . \textit{International Conference on Pattern Recognition}, August 16-20, 1998. 2 p. 1350. \bibitem[Martinkauppi et al. ()]{b30}\label{b30} ‘Detection of skin color under changing illumination: a comparative study’. B Martinkauppi , M Soriano , M Pietikainen . \textit{International Conference on Image Analysis and Processing}, September 17-19, 2003. p. . \bibitem[Caetano et al. ()]{b7}\label{b7} ‘Do mixture models in chromaticity space improve skin detection?’. T S Caetano , S D Olabarriaga , D A C Barone . \textit{Pattern Recognition} 2003. 36. \bibitem[Jayaram et al. ()]{b26}\label{b26} ‘Effect of colorspace transformation the illuminance component, and color modeling on skin detection’. S Jayaram , S Schmugge , M C Shin , L V Tsap . \textit{IEEE Computer Society Conference on Computer Vision and Pattern Recognition}, 2004. p. . \bibitem[Sobottka and Pitas ()]{b8}\label{b8} ‘Extraction of facial regions and features using color and shape information’. K Sobottka , I Pitas . \textit{International Conference on Pattern Recognition}, August 25-29, 1996. 3. \bibitem[Hsu et al. ()]{b10}\label{b10} ‘Face detection in color images’. R L Hsu , M Abdel-Mottaleb , A K Jain . \textit{IEEE Trans. Pattern Anal. Mach. Intell} 2002. 24 (5) p. . \bibitem[Abdel-Mottaleb ()]{b11}\label{b11} ‘Face detection in complex environments from color images’. M Abdel-Mottaleb , A . \textit{IEEE International Conference on Image Processing}, (Kobe, Japan) 1999. 3 p. . \bibitem[Dai and Nakano ()]{b2}\label{b2} ‘Face-texture model based on SGLD and its applications in face detection in a color scene’. Y Dai , Y Nakano . \textit{Pattern Recognition} 1996. 29 (6) . \bibitem[Argenti et al. ()]{b19}\label{b19} ‘Fast algorithms for texture analysis using co-occurrence matrices’. F Argenti , L Alparone , G Benelli . \textit{IEE Proc on Radar and Signal Processing} 1990. 137 (6) p. . \bibitem[Tomaz et al. ()]{b9}\label{b9} ‘Fast and accurate skin segmentation in color images’. F Tomaz , T Candeias , H Shahbaskia . \textit{Canadian Conference on Computer} 2004. \bibitem[Kiranyaz and Gabbouj ()]{b20}\label{b20} ‘Hierarchical Cellular Tree: An Efficient Indexing Scheme for Content-Based Retrieval on Multimedia Databases’. S Kiranyaz , M Gabbouj . \textit{IEEE Transactions on Multimedia} 2007. 9 (1) p. . \bibitem[Haralick and Shapiro]{b34}\label{b34} ‘Image segmentation techniques’. R M Haralick , L G Shapiro . \textit{Tech. Rep. CVGIP} 85. \bibitem[Underwood and Aggarwal ()]{b37}\label{b37} ‘Interactive computer analysis of aerial color infrared photographs’. S A Underwood , J K Aggarwal . \textit{Comput. Graph. Image Process} 1977. 6 p. . \bibitem[Mckenna et al. ()]{b6}\label{b6} ‘Modelling facial colour and identity with Gaussian mixtures’. S Mckenna , S Gong , Y Raja . \textit{Pattern Recognition} 1998. 31 p. . \bibitem[Gomez ()]{b4}\label{b4} ‘On selecting colour components for skin detection’. G Gomez . \textit{International Conference on Pattern Recognition}, . M Yang, D Kriegman, N Ahuja (ed.) August 11-15, 2002. 2002. 2 p. . (Detecting faces in images: a survey) \bibitem[Ohlander et al. ()]{b39}\label{b39} ‘Picture segmentation using a recursive region splitting method’. R Ohlander , K Price , D R Reddy . \textit{Comput. Graph. Image Process} 1978. 8 p. . \bibitem[Kawato and Ohya ()]{b12}\label{b12} ‘Real-time detection of nodding and head-shaking by directly detecting and tracking the between eyes’. S Kawato , J Ohya . \textit{IEEE International Conference on Automatic Face and Gesture Recognition}, (Grenoble) 2000. p. . \bibitem[Schacter et al. (1975)]{b35}\label{b35} ‘Scene segmentation by cluster detection in color space’. B Schacter , L Davis , A Rosenfeld . \textit{Dept. Comput. Sci} Nov. 1975. \bibitem[Sarabi and Aggarwal ()]{b36}\label{b36} ‘Segmentation of chromatic images’. A Sarabi , J K Aggarwal . \textit{Pattern Recognit} 1981. 13 (6) p. . \bibitem[Sigal et al. ()]{b29}\label{b29} ‘Skin color-based video segmentation under time-varying illumination’. L Sigal , S Sclaroff , V Athitsos . \textit{IEEE Trans. Pattern Anal. Mach. Intell} 2004. 26 (7) p. . \bibitem[Ruiz-Del-Solar and Verschae ()]{b1}\label{b1} ‘Skin detection using neighborhood information’. J Ruiz-Del-Solar , R Verschae . \textit{IEEE International Conference on Automatic Face and Gesture Recognition}, 2004. p. . \bibitem[Phung et al. ()]{b13}\label{b13} ‘Skin segmentation using color pixel classification: analysis and comparison’. S L Phung , A Bouzerdoum , D Chai . \textit{IEEE Trans. Pattern Anal. Mach. Intell} 2005. 27 (1) p. . \bibitem[Yang et al. ()]{b5}\label{b5} ‘Skin-color modeling and adaptation’. J Yang , W Lu , A Waibel . \textit{Asian Conference on Computer Vision}, 1998. 2 p. . \bibitem[Haralick et al. ()]{b22}\label{b22} ‘Texture Features For Image Classification’. R Haralick , K Shanmugam , I Dinstein . \textit{IEEE Transaction} 1973. (6) p. . \bibitem[Svolos and Todd-Pokropek ()]{b18}\label{b18} ‘Time and space results of dynamic texture feature extraction in MR and CT image analysis’. A E Svolos , A Todd-Pokropek . \textit{IEEE Trans. on Information Tech. in Biomedicine} 1998. 2 (2) . \end{bibitemlist} \end{document}