\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={Texture Image Segmentation using Morphology in Wavelet Transforms}, 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{2017 2017-01-15 (revised: 18 Year 2017 15 January 2017)} \def\TheID{\makeatother } \def\TheDate{2017 2017-01-15} \title{Texture Image Segmentation using Morphology in Wavelet Transforms} \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]{V Vijaya Kumar} \author[2]{V Vijaya Kumar} \affil[1]{ Anurag Group of Institutions, Hyderabad, India} \renewcommand\Authands{ and } \date{\small \em Received: 12 December 2016 Accepted: 4 January 2017 Published: 15 January 2017} \maketitle \begin{abstract} One of the essential and crucial steps for image understanding, interpretation, analysis and recognition is the image segmentation. This paper advocates a new segme- ntation scheme using morphology on wavelet decomposed images. The present paper provides a good segmentation on natural images and textures by dividing an image into non overlapping regions, which are homogenous in terms of certain features such as texture, spatial coordinates etc. using simple morphological operations. Morphological enhancement technique based on Top Hat transforms enhances the local contrast in this paper. The morphological treatment and followed by Otsu?s threshold overcomes the problem of noise and thin gaps, and also smooth the final regions. The experimental results on four different databases demonstrate the success of the proposed method, compared to many other methods. \end{abstract} \keywords{morphology, top hat transform, local contrast, otsu threshold.} \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[{I. Introduction}]{I. Introduction}\par esearch on texture segmentation has been carried out for decades; this is because image analysis, description, illustration, classification, image understanding and restoration are largely dependent on the segmentation results. The texture segmentation plays a vital role in a variety of applications such as medical imaging, textile designs, identification of human faces and expressions, various military applications, remote sensing, robot vision, cartography, identification of vehicles and quality assurance in industries etc. The texture is still a relatively poorly understood phenomenon. It is very easy and natural for human being to understand a texture; it is extremely difficult to define it. That's why many researchers attempted to define texture based on their application and a catalogue of texture definitions is available in literature \hyperref[b0]{[1]}.Texture segmentation \hyperref[b1]{[2,}\hyperref[b2]{3,}\hyperref[b4]{4,}\hyperref[b5]{5]} break ups an image texture into dissimilar areas depending on a variety of attributes. The attributes can be texture, pixel intensities, color, shape or any other feature of interest according to the particular application. Researchers contributed significantly to the problem of image segmentation in the literature \hyperref[b6]{[6,}\hyperref[b7]{7,}\hyperref[b8]{8,}\hyperref[b9]{9,}\hyperref[b10]{10,}\hyperref[b11]{11]}. Color is one of the important attribute of the texture and there are many segmentation schemes that are based on color \hyperref[b10]{[10,}\hyperref[b12]{12,}\hyperref[b2]{3,}\hyperref[b14]{14,}\hyperref[b15]{15,}\hyperref[b16]{16,}\hyperref[b17]{17]}.\par The segmentation methods based on wavelets \hyperref[b18]{[18]}, hidden Markov models \hyperref[b19]{[19]},multichannel filtering \hyperref[b20]{[20]}, quadtree \hyperref[b21]{[21]}, fractal dimension \hyperref[b22]{[22]}, feature smoo thing \hyperref[b23]{[23]}, split-and-merge methods \hyperref[b24]{[24]}, autoregressive models \hyperref[b25]{[25]}, pyramid node linking \hyperref[b26]{[26]}, local linear transforms \hyperref[b27]{[27]}, Markov random field models \hyperref[b28]{[28]}, and selective feature smoothing with clustering \hyperref[b29]{[29]} are proposed in the literature. The above methods \hyperref[b18]{[18]}\hyperref[b19]{[19]}\hyperref[b20]{[20]}\hyperref[b21]{[21]}\hyperref[b22]{[22]}\hyperref[b23]{[23]}\hyperref[b24]{[24]}\hyperref[b25]{[25]}\hyperref[b26]{[26]}\hyperref[b27]{[27]}\hyperref[b28]{[28]}\hyperref[b29]{[29]} attained fine results for texture like mosaics (a tiny set of fine-grained texture); and failed to achieve a precise segmentation for natural texture images. The present paper considered Brodtaz and other natural textures and implemented segmentation on wavelet based images using morphological and thresholding techniques to obtain better results.\par Edge-based \hyperref[b30]{[30,}\hyperref[b31]{31]}, region-based \hyperref[b32]{[32]} and pixel-based segmentation \hyperref[b33]{[33]} methods are also popular in the literature. Region-based segmentation can identify partitions in a given image. The region based methods \hyperref[b34]{[34,}\hyperref[b40]{[41]}\hyperref[b41]{[42]}\hyperref[b42]{[43]} arepopular in literature. The segmentation methods based on normalized cuts are also proposed \hyperref[b35]{[35]}\hyperref[b36]{[36]}\hyperref[b37]{[37]}\hyperref[b38]{[38]} {\ref [39]}\hyperref[b39]{[40]} and among these, the multi scale normalized cut approach [39] obtained a precise segmentation. The histogram based \hyperref[b43]{[44]}\hyperref[b44]{[45]}\hyperref[b45]{[46]}\hyperref[b46]{[47]}\hyperref[b47]{[48]} methods, fall in to pixel based segmentation approaches. Thetextonor shape based methods \hyperref[b48]{[49]}\hyperref[b49]{[50]}\hyperref[b50]{[51]}\hyperref[b51]{[52]} also attained good results. The exactness of segmentation method is highly dependent on i) Type of textures ii) The type of attributes considered iii) The way the attributes are evaluated (global, local or region wise etc.). This indicates that segmentation methods are application dependent. The present paper initially decomposes the texture images using wavelet transforms. The segmentation scheme is applied on the decomposed image and quality assessment parameters are evaluated. The present paper is organized as follows: The section 2 describes the related work. The section 3 and 4 describes the proposed method and results and discussions respectively. The section five describes the conclusions. other applications. Mathematical morphology refers to image components like topology, shape, connectivity etc. The morphological operations are very simple, easy to understand, compute and analyze because they are basically derived from algebraic operators and it is proposed by Matheron and Serra and it is an extension of Minkowski's set theory \hyperref[b52]{[53]}, \hyperref[b53]{[54]}. Morphology is gained much attention in solving and analyzing image processing problems related to geometrical variations and aspects of the image, whereas most of the nonmorphological image processing methods are mostly unsuccessful in this aspect. These methods have additional advantages in dealing with textures, because the texture is basically nonlinear in nature. The morphology basically deals with shape or topological properties of objects. That is the reason they are most significant in segmentation problems. Using morphological operations one can easily represent or capture the various dissimilarities between geometrical properties such as size, connectivity, shape, which are considered as essential feature parameters that are basically needed to partition or segment an image texture. Many researchers used morphological operations extensively in various computer vision and pattern recognition applications like: preprocessing, boundary detection, removal of noise, image segmentation, image enhancement, image smoothening, image understanding and analysis of images. The main reason for the popular usage of mathematical morphology in image processing is they are based on dilation and erosion operations, which can be implemented in binary and gray leveldomains. \section[{b) Gray Value Morphological Processing}]{b) Gray Value Morphological Processing}\par The dilation operation, in gray level is given by equation 1. The images grow in size by dilation. The erosion is given by the following equation 2. The image size is reduced in size, based on the specifications of the structure element (SE). The morphological gray level opening and closing are defined in equations 3 and 4.???????????????? = max [?? ,??]???? \{??[?? ? ??, ?? ? ??]\} = max ?? ??\textbf{(1)}?????????????? = min [?? ,??]??? \{??[?? ? ??, ?? ? ??]\} = min ?? (??) (2) ?????????????? ? ?? ?? (??, ??) = max ?? ? min ?? (??) ? (3) ?????????????? ? ?? ?? (??, ??) = min ?? ?max ?? (??)? (\textbf{4})\par Where P and Q are the original image and structuring element.\par The Structuring element Q contains fixed number pixels, which are bounded and convex in nature. The erosion followed by dilation is called morphological opening. In opening the erosion of an image removes all structures that cannot fit inside. Further shrinks all other structures. Then by dilating the result of the erosion with the same structuring element, the structures that are survived by the erosion (were shrunken, not deleted) will be restored. Opening generally smoothes the contour of an image, splits slim isthmuses, and overcomes from thin protrusions affect. The closing smooth the image removes minute holes, and fills gaps in the contour. This retains the uniformity of a local region. \section[{III. Methodology}]{III. Methodology}\par To derive precise segmentation the present paper initially converts the color image in to gray level image using HSV color quantization. The present paper then convert the gray level image into discrete wavelet transform (DWT) using Harr wavelet transform. \section[{a) Wavelet transforms}]{a) Wavelet transforms}\par The mathematical function that is used to divide a given function into components of different frequency is called wavelet transform. And each component is studied by wavelets with a resolution that matches its scale. An image signal is passed through an analysis filter bank followed by a decimation operation and analyzed in wavelet transforms. This filter bank consists of a low pass and a high pass filter at each decomposition stage. The low pass filter, corresponds to an averaging operation. The low pass filters extracts the coarse information of a signal. The high pass filter extracts the detail information of the signal and it represents to a differencing operation. The image will be divided i.e., decomposed into four sub-bands i.e. denoted by low-low (LL), high-low (HL), low-high (LH) and high-high (HH). The LH1, HL1 and HH1 sub bands correspond to the detail images i.e., finest scale wavelet coefficients. The LL1 sub-band corresponds to approximation image (coarse level coefficients). By decomposing LL1 sub band alone, the next coarse level of wavelet coefficients will be obtained and they are denoted as LL2, LH2, HL2, and HH2. Similarly, to obtain further decomposition, LL2 will be used. The features obtained from these DWT transformed images are useful for texture analysis, namely segmentation. The \section[{b) Identification of interior regions by Top-hat transform}]{b) Identification of interior regions by Top-hat transform}\par Initially the image is converted in to DWT image. To recognize details of interior regions and to improve the contrast of the image texture, morphological treatment is given by using Top Hat transform (THT). This paper used THT, instead of Histogram Equalization (HE) to deal with the natural textures with high and low mean brightness values; The present paper also overcomes the enhancement disadvantages that arises from the global content of the image. HE may produce over enhancement and saturation artifacts \hyperref[b54]{[55,}\hyperref[b55]{56]}. That is why researchers are focusing on upgrading of the conventional histogram equalization. To overcome this present paper derive contrast enhancement based on THT of morphology. The THT is used to extract image features. There two types THTs: white top hat transforms (WTH) and black top hat transformation (BTH). The morphological WTH is applied to take out bright or over intensity features of texture mage. It is derived from equation 5.P WTH = P ? (P ? Q) (5)\par To extract the darker features of image texture the BTH is used and it is derived by equation 6.P BTH = (P ? Q) -P\textbf{(6)}\par To increase the contrast between the black and white regions of image the present paper derived a new contrast enhancement using MM operations as given below.\par P CE = P +P WHT -P \hyperref[b7]{(7)} where, P is the original image. P CE is the final enhanced image. P WHT represents the extracted white image regions. P b represents the extracted black image regions.\par To derive the uniform local regions of the texture image, closing operation is applied in this paper. This has connected the objects that are nearer to each other and it has filled small gaps. \section[{c) Thresholding by Otsu method}]{c) Thresholding by Otsu method}\par To set upwell defined boundaries in the texture image, Otsu thresholding is applied in this paper. One of the important steps in segmentation is thresholding. Thresholding divides the texture image in to two or more units. Threshold will be chosen based on intensity attribute of the objects, sizes of the objects, number of different types of objects appearing in an image etc. One should have proper knowledge about the images and the application to choose the threshold. The Otsu method \hyperref[b56]{[57]} is based on discriminate analysis. This method \hyperref[b56]{[57]} selects the threshold by limiting the withinclass variance of the two groups of pixels separated by the thresholding operator. A measure of region homogeneity is variance. The OTSU thresholddoes not depend on modeling the probability density functions and it is based on a bimodal distribution of gray-level values. The OTSU threshold operation performs the division of image pixels into two classes C0 and C1 (e.g., objects and background) at gray level. \section[{IV. Results and Discussions}]{IV. Results and Discussions}\par The performance of the texture segmentation schemes can be assessed by subjective evaluation, supervised and non-supervised evaluation: Comparing the approximate segmentation results with various other segmentation approaches is called subjective evaluation; The segmented output, is compared with the original image in supervised evaluation. The above two assessments are impractical and not popular because they are not automatic and requires human interaction. Year 2017 ( ) \section[{F}]{F}\par In "unsupervised approaches" \hyperref[b57]{[58,}\hyperref[b58]{59]} comparison with ground truth or original images is not required. And they take less time in evaluating the performance of the segmentation method. The proposed segmentation scheme is assessed by unsupervised parameters like: Discrepancy, Entropy, Standard deviation, internal region contrast as given below. The value of these indicates the following: If the value of discrepancy is high, then it indicates a better segmentation. Using entropy value one can recognize the Over segmentation and under segmentations. Over segmentation will be resulted if entropy value less than 1 and if it is above 1.5 then represents under segmentation. A better segmentation is estimated with lower values of standard deviation. Region uniformity should not be disturbed while segmenting. If the segmented image results a low internal contrast then it indicates a high uniformity.?????????????????????? = ? ? (??(??, ??) ? ??(??, ??)) ?? ??=1 ?? ??=1 (8)\par Where A(r,c) and B(r,c) represents the gray level original and segmented image. Entropy of an image is given as?????????????? = ? ? ? ??(??, ??)?????????(??, c)? ?? ?? (9)\par Where B is segmented image Standard deviation of a given vector is expressed asStandared deviation S = ? 1 n?1 ? (x i ? x ?) 2 n i=1 ? 1 2 (10)\par Where x i andx ? are the value of vector and average of all values.\par Internal region contrast is defined asInternal region contrast I j = 1 S j ? max?cont(??, t), t ? s?R j N???Rj (\textbf{11})\par Where N(s) is the neighborhood and contrast (s,t) = |C x (s) -C x (t)| is the contrast of pixel 's' and 't'. The region uniformity is measured by internal contrast, I j . The I j represents "region average Max Contrast".\par The present method is tested on Brodtaz \hyperref[b59]{[60]}, Oxford flowers [61], {\ref Wang [62]} and standard images from Google (Lena, Camera man, House, Mandrill, and Ship) {\ref [63]}. The experiments are carried out by considering 100 images from each data base, thus it results a total of 400images.There are 1,000 natural images in Wang database and these images are selected manually from Corel stock photo database. These images are divided into 10 categories (each category consists 100 images). There are 17 classes (80 images per class) in Oxford flower database. There are 112 texture images in the Brodatz album with different background intensities. The proposed method is compared with three existing methods ISLGHEM \hyperref[b60]{[64]}, automatic thresholding method \hyperref[b61]{[65]}, wavelet based watershed method \hyperref[b62]{[66]} and MULBP method \hyperref[b63]{[67]}. To show the performance, the proposed integrated DWT segmentation scheme is applied on input images and results are shown in Fig. {\ref 2} The present paper evaluated the above statistical parameter or unsupervised approaches on the proposed and the other methods. The results are di splayed in Table \hyperref[tab_0]{1}, 2, 3 and 4 and also plotted in Fig. {\ref 6} to Fig. {\ref 9}.\par The proposed method is compared with the existing methods \hyperref[b60]{[64,}\hyperref[b61]{65,}\hyperref[b62]{66,}\hyperref[b63]{67]}. A high discrepancy rate is noted for all considered textures (14.56 to 15.66) except standard images of Google on the proposed method, which has shown low discrepancy rate of 12.19, and resulted an average value of 14.5.The average value of entropy, standard deviation and internal region contrast for the proposed methods are 1.26, 1.75 and 0.91 respectively, which clearly indicates a good segmentation. The proposed method resulted high discrepancy value and the low standard deviation over the other methods (Fig: {\ref 6} and Fig. {\ref 9}). This reflects a better segmentation of the proposed over the existing methods. The low value of internal contrast and a decent value of entropy also indicate the high performance of the proposed method over the existing methods. \section[{V. Conclusions}]{V. Conclusions}\par The morphological operations covered the small holes with intensities and borders are connected for a better segmentation. The Otsu threshold established local boundaries efficiently and provided better contrast and also removed the unwanted local scenes of the image. The whole process of segmentation is automatic and requires no supervision. The present paper improves the contrast of sharp details in light and dark areas. The present method is experimented on the four standard databases namely Brodatz, Wang, Oxford flowers and standard images. The present method attained a good segmentation on the four datasets: however the proposed method have shown significantly high performance on Brodatz database textures when compared with other standard datasets; followed by Wang and oxford datasets. Further no over and under segmentation is reported by the present method on the considered databases. The present method is simple and suitable to real time applications because it achieved good segmentation with three basic steps. 0 0.5 1 1.5 2 2.5 3 3. {\ref 5 4} Proposed method MULBP method \hyperref[b63]{[67]} Automatic threshold method \hyperref[b61]{[65]} ISLGHEM method \hyperref[b60]{[64]} Wavelet based watershed method {\ref [} \begin{figure}[htbp] \noindent\textbf{1}\includegraphics[]{image-2.png} \caption{\label{fig_0}Figure 1 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{1}\includegraphics[]{image-3.png} \caption{\label{fig_1}Figure 1 (}\end{figure} \begin{figure}[htbp] \noindent\textbf{2345}\includegraphics[]{image-4.png} \caption{\label{fig_2}Figure 2 :Figure 3 :Figure 4 :Figure 5 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{8}\includegraphics[]{image-5.png} \caption{\label{fig_3}Figure 8 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{1} \par \begin{longtable}{P{0.19023809523809523\textwidth}P{0.2651190476190476\textwidth}P{0.09107142857142857\textwidth}P{0.30357142857142855\textwidth}} Year 2017\tabcellsep \tabcellsep \tabcellsep \\ 12\tabcellsep \tabcellsep \tabcellsep \\ Volume XVII Issue I Version I\tabcellsep \tabcellsep \tabcellsep \\ ( ) F\tabcellsep \tabcellsep \tabcellsep \\ Global Journal of Computer Science and Technology\tabcellsep Name of the data base Brodatz texture Wang Oxford flower Standard image Average of all databases\tabcellsep Proposed method 15.66 15.64 14.56 12.10 14.49\tabcellsep ISLGHEM [64] ATM [65] WWM[66] MULBP method [67] 12.56 13.68 11.20 14.3 11.3 13.2 10.3 14.1 11.4 12.3 10.6 13.2 8.3 9.6 7.8 10.3 10.37 11.67 9.65 12.42\\ \tabcellsep © 20 7 Global Journa ls Inc. (US) 1\tabcellsep \tabcellsep \end{longtable} \par \caption{\label{tab_0}Table 1 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{2} \par \begin{longtable}{P{0.320954356846473\textwidth}P{0.12344398340248963\textwidth}P{0.0987551867219917\textwidth}P{0.08817427385892117\textwidth}P{0.1516597510373444\textwidth}P{0.06701244813278008\textwidth}} Name of the data base\tabcellsep Proposed method\tabcellsep ISLGHEM [64]\tabcellsep ATM [65]\tabcellsep \multicolumn{2}{l}{WWM [66] MULBP method[67]}\\ Brodatz texture\tabcellsep 1.20\tabcellsep 2.35\tabcellsep 2.10\tabcellsep 1.98\tabcellsep 1.4\\ Wang\tabcellsep 1.21\tabcellsep 3.1\tabcellsep 3.4\tabcellsep 2.6\tabcellsep 1.28\\ Oxford flower\tabcellsep 1.36\tabcellsep 2.7\tabcellsep 3.1\tabcellsep 2.6\tabcellsep 1.44\\ Standard image\tabcellsep 1.30\tabcellsep 2\tabcellsep 2.3\tabcellsep 1.8\tabcellsep 1.35\\ Average of all databases\tabcellsep 1.26\tabcellsep 2.475\tabcellsep 2.85\tabcellsep 2.225\tabcellsep 1.36\end{longtable} \par \caption{\label{tab_1}Table 2 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{3} \par \begin{longtable}{P{0.3384012539184953\textwidth}P{0.09059561128526646\textwidth}P{0.08793103448275862\textwidth}P{0.1225705329153605\textwidth}P{0.12523510971786833\textwidth}P{0.08526645768025078\textwidth}} Name of the data base\tabcellsep Proposed method\tabcellsep ISLGHEM method[64]\tabcellsep Automatic threshold method[65]\tabcellsep Wavelet watershed based method[66]\tabcellsep MULBP method[67]\\ Brodatz texture database\tabcellsep 1.5\tabcellsep 3.8\tabcellsep 3.3\tabcellsep 3.6\tabcellsep 2.1\\ Wang database\tabcellsep 1.98\tabcellsep 4.4\tabcellsep 4.1\tabcellsep 3.8\tabcellsep 2.7\\ Oxford flower database\tabcellsep 1.86\tabcellsep 4.4\tabcellsep 3.5\tabcellsep 4.2\tabcellsep 2.1\\ Standard image database\tabcellsep 1.69\tabcellsep 4.3\tabcellsep 3.5\tabcellsep 4\tabcellsep 2.6\\ Average of all databases\tabcellsep 1.75\tabcellsep 4.3\tabcellsep 3.85\tabcellsep 3.9\tabcellsep 2.55\end{longtable} \par \caption{\label{tab_2}Table 3 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{4} \par \begin{longtable}{P{0.10933609958506223\textwidth}P{0.1822268326417704\textwidth}P{0.01293222683264177\textwidth}P{0.01998616874135546\textwidth}P{0.0035269709543568465\textwidth}P{0.30567081604426\textwidth}P{0.11874135546334716\textwidth}P{0.004702627939142462\textwidth}P{0.005878284923928077\textwidth}P{0.08699861687413554\textwidth}} Year 2017\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\ 14\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\ Volume XVII Issue I Version I ( )\tabcellsep Average standard deviation value\tabcellsep 0 1 2 3 4 5\tabcellsep \multicolumn{3}{l}{Proposed method}\tabcellsep \multicolumn{3}{l}{MULBP method[67] Proposed and existing methods Automatic threshold method[65] ISLGHEM method[64]}\tabcellsep Wavelet based watershed method[66]\\ Global Journal of Computer Science and Technology\tabcellsep \multicolumn{4}{l}{Name database of Brodatz texture the database Wang database Oxford flower database Standard image database}\tabcellsep \multicolumn{4}{l}{Proposed method 0.82 0.89 0.86 1.1 Wang database ISLGHEM method[64] 1.20 1.8 1.5 2.8 Broadtaz texture database Automatic threshold method[65] 1.68 1.4 1.8 2.6 Oxford flower database Wavelet watershed method[66] based 2.3 1.9 2.6 3.4 Standard image database}\tabcellsep MULBP method[67] 1.13 0.90 1.10 1.52\\ \tabcellsep \multicolumn{2}{l}{Average databases}\tabcellsep of\tabcellsep all\tabcellsep 0.91\tabcellsep 2.175\tabcellsep 1.95\tabcellsep 2.675\tabcellsep 1.28\end{longtable} \par \caption{\label{tab_3}Table 4 :}\end{figure} \footnote{© 2017 Global Journals Inc. (US)} \footnote{© 20 7 Global Journa ls Inc. (US)} \footnote{Year 2017 ( ) F} \footnote{© 20 7 Global Journa ls Inc. (US) 1} \backmatter \begin{bibitemlist}{1} \bibitem[Sakakezia et al. ()]{b7}\label{b7} ‘A colortexture based segmentation method to extract object from background’. I Sakakezia , V Santiprabha , Vijayakumar . \textit{International Journal Image, And Graphics And Signal Processing} 2074-9082. 2013. 5 p. . (IJIGSP)) \bibitem[Cheng and Sun ()]{b15}\label{b15} ‘A hierarchical approach to color image segmentation using homogeneity’. H D Cheng , Y Sun . \textit{IEEE Transaction on Image Processing} 2000. 9 (12) p. . \bibitem[Kervrann and Heitz (1995)]{b29}\label{b29} ‘A Markov Random Field model-based approach to unsupervised texture segmentation using local and global statistics’. C Kervrann , F Heitz . \textit{IEEE Trans. Image Processing} June 1995. 4 (6) p. . \bibitem[Prakash and Vijayakumar ()]{b8}\label{b8} ‘A new texture based segmentation method to extract object from background’. M. Joseph Prakash , V Vijayakumar . \textit{Global Journal of Computer Science And Technology Graphics \& Vision (GJCST)} 0975 -4350. 2012. 12 (15) p. . \bibitem[Kumar et al. ()]{b6}\label{b6} ‘A new texture segmentation approach for medical images’. Vijaya Kumar , I Sakakezia , Santiprabha . \textit{International Journal of Scientific \& Engineering Research (IJSER)} 2229-5518. 2013. 4 (1) p. . \bibitem[Saka et al. (2013)]{b60}\label{b60} ‘A New Texture Segmentation Approach for Medical Images’. Saka , Kezia , . I Dr , Santiprabha , . V Dr , Vijayakumar . \textit{International Journal of Scientific \& Engineering Research} January-2013. 4 (1) . \bibitem[Sayadi and Fnaiech ()]{b58}\label{b58} ‘A new texture segmentation method based on the fuzzy Cmean algorithm and statistical features’. Mounir Sayadi , Lotfitlig , Farhat Fnaiech . Applied Mathematical Sciences 2007. 1 (60) p. . \bibitem[Brodatz and Textures ()]{b59}\label{b59} \textit{A Photographic Album for Artists and Designers}, P Brodatz , Textures . 1999. New York, NY, USA: Dover. \bibitem[Spann and Wilson ()]{b21}\label{b21} ‘A quad-tree approach to image segmentation which combines statistical and spatial information’. M Spann , R Wilson . \textit{Pattern Recognition} 1985. 18 p. . \bibitem[Anuradha et al. ()]{b63}\label{b63} ‘A Segmentation scheme based on uniform LBP and morphological approach, Graphics’. S G Anuradha , K Karibasappa , B Eswar Reddy . \textit{Vision and Image Processing (ICGST-GVIP)}, 2016. 16. \bibitem[Lalitha1 et al. (2013)]{b30}\label{b30} ‘A Survey on Image Segmentation through Clustering Algorithm’. M Lalitha1 , M Kiruthiga2 , C Loganathan3 . \textit{International Journal of Science and Research} 2319-7064. February 2013. 2 (2) . \bibitem[Otsu ()]{b56}\label{b56} ‘A threshold selection method from graylevel histograms’. Otsu . \textit{IEEE Trans. Sys., Man., Cyber} 1979. 9 p. . \bibitem[Cummings et al. ()]{b12}\label{b12} ‘A Vision Chip for Colour Segmentation and Pattern Matching’. R E Cummings , P Pouliquen , M A Lewis . \textit{EURASIP Journal on Applied Signal Processing} 2003. (7) p. . \bibitem[Carreira-Perpinan (2006)]{b41}\label{b41} ‘Acceleration strategies for Gaussian mean-shift image segmentation’. M A Carreira-Perpinan . \textit{Proc. IEEE Conf. on Computer Vision Pattern Recognition}, (IEEE Conf. on Computer Vision Pattern Recognition) June 2006. 1 p. . \bibitem[Mayer and Greenspan ()]{b43}\label{b43} ‘An adaptive mean-shift framework for MRI brain segmentation’. A Mayer , H Greenspan . \textit{IEEE Trans. Med. Imag} 2009. 28 (8) p. . \bibitem[Cui and Zhou ()]{b57}\label{b57} ‘An Early Fire Detection Method Based on Smoke Texture Analysis and Discrimination’. Dong Y H Cui , . E Zhou . \textit{Journal Congress on Image and Sig. Proc} 2008. p. . \bibitem[Ghamisi et al. ()]{b48}\label{b48} ‘An efficient method for segmentation of images based on fractional calculus and natural selection’. P Ghamisi , M S Couceiro , J A Benediktsson , N M Ferreira . \textit{Expert Syst. Appl} 2012. 39 (16) p. . \bibitem[Peng et al. ()]{b32}\label{b32} ‘Automatic image segmentation by dynamic region merging’. B Peng , L Zhang , D Zhang . \textit{IEEE Trans. Image Process} 2011, 20. (12) p. . \bibitem[Tan et al. ()]{b46}\label{b46} ‘Color image segmentation using adaptive unsupervised clustering approach’. K S Tan , N A M Isa , W H Lim . \textit{Appl. Soft Comput} 2012. 13 p. . \bibitem[Tan and Isa ()]{b45}\label{b45} ‘Color image segmentation using histogram Thresholding -Fuzzy C-means hybrid approach’. K S Tan , N A M Isa . \textit{Patt. Recogn} 2011. (1) p. . \bibitem[Seddik and Ben Braiek ()]{b16}\label{b16} ‘Color Medical Images Watermarking, Based Neural Network Segmentation’. H Seddik , E Ben Braiek . \textit{Medical Image Processing}, 2006. p. . \bibitem[Conf. on Advances in Pattern recog ()]{b3}\label{b3} \textit{Conf. on Advances in Pattern recog}, Lecture Notes in Computer Science 2013. \bibitem[Malik et al. ()]{b36}\label{b36} ‘Contour and texture analysis for image segmentation’. J Malik , S Belongie , T Leung , J Shi . \textit{Int. J. Comput. Vis} 2001. (1) p. . \bibitem[Arbelaez et al. ()]{b33}\label{b33} ‘Contour detection and hierarchical image segmentation’. P Arbelaez , M Maire , C Fowlkes , J Malik . \textit{IEEE Trans. Patt. Anal. Mach. Intell} 2010. (5) p. . \bibitem[Mairal et al. ()]{b31}\label{b31} ‘Discriminative sparse image models for class-specific edge detection and image interpretation’. J Mairal , M Leordeanu , F Bach , M Hebert , J Ponce . \textit{Proc. 10th European Conf. Computer Vision}, (10th European Conf. Computer Vision) 2008. p. . \bibitem[Ashwinikunte and Bhalchandra (2010)]{b11}\label{b11} ‘Efficient DIS Based Region Growing Segmentation Technique for VHR Satellite Images ICGST-GVIP’. Anjali Ashwinikunte , Bhalchandra . \textit{Journal} August 2010. 10 (3) . \bibitem[Derong et al.]{b55}\label{b55} ‘Fast Computation of Multiscale Morphological Operations for Local Contrast Enhancement’. Y Derong , Z Yuanyuan , L Dongguo . \textit{Proceedings of the 2005 IEEE}, (the 2005 IEEE) p. . \bibitem[Chen et al. (2008)]{b44}\label{b44} ‘Fast image segmentation based on K-means clustering with histograms in HSV color space’. T W Chen , Y L Chen , S Y Chien . \textit{Proc. IEEE Int. Workshop on Multimedia Signal Processing}, (IEEE Int. Workshop on Multimedia Signal essing) October 2008. p. . \bibitem[Laine and Fan ()]{b17}\label{b17} ‘Frame representations for texture segmentation’. A Laine , J Fan . \textit{IEEE Trans. Image Processing} 1996. 5 p. . \bibitem[Yang et al. ()]{b13}\label{b13} ‘Fuzzy C-means clustering algorithm with a novel penalty term for image segmentation’. Y Yang , C Zhen , P Lin . \textit{Opto-Electronics Rev} 2005. 13 (4) . \bibitem[Yu (2004)]{b38}\label{b38} ‘I-247-I-254. normalized-cut segmentation for spinal MRI’. S X Yu . \textit{Proc. IEEE Conf. on Comput. Vision Pattern Recognition}, (IEEE Conf. on Comput. Vision Pattern Recognition) June 2004. 2009. 1 p. . (Segmentation using multiscale cues) \bibitem[Serra ()]{b52}\label{b52} \textit{Image Analysis and Mathematical Morphology}, J Serra . 1982. London, U.K: Academic. \bibitem[Antonini et al. ()]{b54}\label{b54} ‘Image coding using wavelet transform’. M Antonini , M Barlaud , P Mathieu , I Daubechies . \textit{IEEE Trans. Image Process} 1992. 1 (2) p. . \bibitem[Pietika¬ Inen and Rosenfeld ()]{b26}\label{b26} ‘Image segmentation by texture using pyramid node linking’. M Pietika¬ Inen , A Rosenfeld . \textit{IEEE Trans. Systems Man Cybernet} 1981. 11 p. . \bibitem[Yuan Been Chen and Chen ()]{b61}\label{b61} ‘Image Segmentation Method Using Thresholds Automatically Determined from Picture Contents’. Oscal T C Yuan Been Chen , Chen . \textit{Eurasip journal on image and video processing}, 2009. 2009. p. . \bibitem[Kezia et al. (2012)]{b51}\label{b51} ‘Innovative segmentation approach based on LRTM’. S Kezia , I Shantiprabha , Vijayakumar . \textit{Int. Journal of Soft Computing and Engg} Nov. 2012. 2 (5) p. . \bibitem[Serra ()]{b53}\label{b53} ‘Introduction to mathematical morphology’. J Serra . \textit{Comput. Vis., Graph., Image Process} 1986. 35 p. . \bibitem[Greenspan et al. ()]{b20}\label{b20} ‘Learning texture discrimination rules in a multiresolution system’. H Greenspan , R Goodman , R Chellappa , C H Anderson . \textit{IEEE Trans. Pattern Anal. Machine Intelligence} 1994. 16 p. . \bibitem[Jp et al. ()]{b18}\label{b18} ‘Morphological Multi-scale Stationary Wavelet Transform based Texture Segmentation’. Jp , Mosiganti , V Vijay Kezia , Kumar . \textit{International Journal of Artificial Intelligence \& Applications (IJAIA)} 2074-9082. 2014. 8 (1) p. . \bibitem[Yu and Shi (2003)]{b37}\label{b37} ‘Multiclass spectral clustering’. S X Yu , J Shi . \textit{Proc. Int. Conf. Computer Vision}, (Int. Conf. Computer Vision) October 2003. p. . \bibitem[Unser and Eden ()]{b27}\label{b27} ‘Multiresolution feature extraction and selection for texture segmentation’. M Unser , M Eden . \textit{IEEE Trans. Pattern Anal. Machine Intelligence} 1989. 11 p. . \bibitem[Shi and Malik ()]{b35}\label{b35} ‘Normalized cuts and image segmentation’. J Shi , J Malik . \textit{IEEE Trans. Patt. Anal. Mach. Intell} 2000. 22 (8) p. . \bibitem[Tan et al. ()]{b47}\label{b47} ‘Novel initialization scheme for Fuzzy C-Means algorithm on color image segmentation’. K S Tan , W H Lim , N A M Isa . \textit{Appl. Soft Comput} 2013. 13 p. . \bibitem[Kumar et al. ()]{b10}\label{b10} ‘Pipeline implementation of new segmentation based on cognate neighborhood approach’. V Kumar , A Rao , U S N Raju , B Eswar Reddy . \textit{International Journal of Computer Science (IJCS)} 1552-6607. 2008. 35 (1) p. . (Science publications) \bibitem[Jähne ()]{b34}\label{b34} \textit{Practical handbook on image processing for scientific and technical applications}, B Jähne . 2004. CRC Press. p. 15. (2nd Ed) \bibitem[Chen and Pavlidis ()]{b24}\label{b24} ‘Segmentation by texture using a co-occurrence matrix and a split-and-merge algorithm’. P C Chen , T Pavlidis . \textit{Comput. Graphics Image Processing} 1979. 10 p. . \bibitem[Yu (2005)]{b39}\label{b39} ‘Segmentation induced by scale invariance’. S X Yu . \textit{Proc. IEEE Conf. on Comput. Vision Pattern Recognition}, (IEEE Conf. on Comput. Vision Pattern Recognition) June 2005. 1 p. . \bibitem[Wirth et al. ()]{b5}\label{b5} ‘Segmentation of the Breast Region in Mammograms using a Rule-Based Fuzzy Reasoning Algorithm’. M Wirth , D Nikitenko , J Lyon . \textit{GVIP Journal Special Issue on Mammograms} 2007. p. . \bibitem[Cour et al. (2005)]{b40}\label{b40} ‘Spectral segmentation with Multiscale graph decomposition’. T Cour , F Benezit , J Shi . \textit{Proc. IEEE Conf. on Computer Vision Pattern Recognition}, (IEEE Conf. on Computer Vision Pattern Recognition) June 2005. 2 p. . \bibitem[Wang and Zhang ()]{b4}\label{b4} ‘Supervised texture segmentation using wavelet transform’. Wang , Zhang . \textit{Proc. of Int. Conf. on Neural Networks and Signal Processing}, (of Int. Conf. on Neural Networks and Signal essing) 2003. 2 p. . \bibitem[Donald and Adjeroh (2007)]{b49}\label{b49} ‘Texton-based segmentation of retinal vessels’. A Donald , Umasankarkandaswamy Adjeroh . \textit{Journal of Optical Society of America} May 2007. 24 (5) p. . \bibitem[Kekre and Gharge (2010)]{b0}\label{b0} ‘Texture Based Segmentation using Statistical Properties for Mammographic Images’. . H Kekre , Gharge . \textit{Int. Journal of Advanced Computer Science and Applications(IJACSA)} Nov 2010. 1 (5) p. . \bibitem[Mao and Jain ()]{b25}\label{b25} ‘Texture classification and segmentation using multi resolution simultaneous autoregressive models’. J Mao , A K Jain . \textit{Pattern Recognition} 1992. 25 p. . \bibitem[Singh and Sharma]{b2}\label{b2} ‘Texture experiments with Meastex and Vistex benchmarks’. Singh , Sharma . \textit{Proc. Inter}, (Inter) \bibitem[Idrissisidiyassine and Belfkih (2013)]{b50}\label{b50} ‘Texture image segmentation using a new descriptor and mathematical morphology’. Samir Idrissisidiyassine , Belfkih . \textit{Int. Arab Journal of Information Technology} March 2013. 10 (2) p. . \bibitem[Kumar et al.]{b9}\label{b9} ‘Texture segmentation methods based on combinatorial of morphological and statistical operations’. V Kumar , B Eswar Reddy , A Rao , U S N Raju . \textit{Journal of multimedia} JMM. \bibitem[Chaudhuri and Sarkar ()]{b22}\label{b22} ‘Texture segmentation using fractal dimension’. B B Chaudhuri , N Sarkar . \textit{IEEE Trans. Pattern Anal. Machine Intelligence} 1995. 17 p. . \bibitem[Goldmann et al. ()]{b1}\label{b1} ‘Towards Fully Automatic , Image Segmentation Evaluation’. Lutz Goldmann , Tomasz Adamek , Peter Vajda . \textit{Advanced Concepts for Intelligent Vision Systems}, Lecture Notes in Comp. Science 2008. 5259 p. . \bibitem[3tao et al. ()]{b42}\label{b42} ‘Unified mean shift segmentation and graph region merging algorithm for infrared ship target segmentation’. W 3tao , H Jin , J Liu . \textit{Opt. Eng} 2007. 46 (12) p. . \bibitem[Hsiao and Sawchuk ()]{b23}\label{b23} ‘Unsupervised texture image segmentation using feature smoothing and probabilistic relaxation techniques’. J Y Hsiao , A A Sawchuk . \textit{Computer Vision Graphics Image Processing} 1989. 48 p. . \bibitem[Jain and Farrokhnia ()]{b28}\label{b28} ‘Unsupervised texture segmentation using Gabor filters’. A K Jain , F Farrokhnia . \textit{Pattern Recognition} 1991. 24 p. . \bibitem[Chen and Kundu ()]{b19}\label{b19} ‘Unsupervised texture segmentation using multichannel decomposition and hidden Markov models’. J.-L Chen , A Kundu . \textit{IEEE Trans. Image Processing} 1995. 4 p. . \bibitem[Meevathi and Rajesh ()]{b14}\label{b14} ‘Volterra Filter for color image segmentation’. M B Meevathi , K Rajesh . \textit{Inter. Journal of Computer Science and Engineering} 2008. 2 (1) . \bibitem[Chai et al. ()]{b62}\label{b62} ‘Wavelet-based Watershed for Image Segmentation’. Yu-Hua Chai , Li- , Shun Lu , Lei Tian . \textit{Proc. of the 6th World Congress on Intelligent Control and Automation}, (of the 6th World Congress on Intelligent Control and AutomationDalian, China) June 21 -23, 2006. \end{bibitemlist} \end{document}