\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={The Impact of Different Image Thresholding based Mammogram Image Segmentation-A Review},
 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{2021-01-15 (revised: 15 January 2021)}
\def\TheID{\makeatother }
\def\TheDate{2021-01-15}
\title{The Impact of Different Image Thresholding based Mammogram Image Segmentation-A Review}
\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]{  Krishnaveni}

\renewcommand\Authands{ and }

\date{\small \em Received: 8 December 2020 Accepted: 5 January 2021 Published: 15 January 2021}

\maketitle


\begin{abstract}
        


Images are examined and discretized numerical capacities. The goal of computerized image processing is to enhance the nature of pictorial data and to encourage programmed machine elucidation. A computerized imaging framework ought to have fundamental segments for picture procurement, exceptional equipment for encouraging picture applications, and a tremendous measure of memory for capacity and info/yield gadgets. Picture segmentation is the field broadly scrutinized particularly in numerous restorative applications and still offers different difficulties for the specialists. Segmentation is a critical errand to recognize districts suspicious of tumor in computerized mammograms. Every last picture have distinctive sorts of edges and diverse levels of limits. In picture transforming, the most regularly utilized strategy as a part of extricating articles from a picture is "thresholding". Thresholding is a prevalent device for picture segmentation for its straightforwardness, particularly in the fields where ongoing handling is required.

\end{abstract}


\keywords{}

\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
igital Image Processing is a quickly advancing field with developing applications in science and engineering \hyperref[b2]{[3]}. Digital image processing is adaptable research in this period \hyperref[b0]{[1]}. Scientific visualization is the representation of data graphically as a means of gaining understanding and insight into the information. A wonderful place to start out learning scientific visualization is within the field of image process, since it involves algorithms that facilitate convert information into pictures. In today's technologyoriented world, the term `image process' usually refers to the processing of a two-dimensional information set employing a computer \hyperref[b6]{[7]}. Digital image processing involves the control and investigation of images or pictures utilizing digital computers \hyperref[b4]{[5]}. Alongside the advancement of data innovation with the development of information technology (IT), computerized sign loaded with the entire world, so see the picture changed over to be computer to manage an advanced sign. Advanced picture transforming is through computer instrument, with computerized picture motion by a progression of handling operations, and get individuals with the needs of the application \hyperref[b3]{[4]}.\par
Many researchers implement differing types of organizations like image restoration, image improvement, color image process, image segmentation etc. Image improvement technique is among the only and most appealing space of digital image process. Improvement techniques like intensity conservation, distinction improvement highlight sure options means that rely that a part of the image wish to be enhance some application some input image as well as noise, reduction or removal of noise is additionally style of image improvement. Brightness preservation has increased visual quality of digital image in order that the limitation contained in these pictures is employed for varied applications during a higher method. A really common technique for image improvement is histogram equalization (HE) and curvelet transformation. HE technique is often utilized for image improvement owing to its simplicity and relatively higher performance on the majority forms of pictures. Another wide used technique is curvelet transformation. This system is known and separate bright regions of image however additional error rate and low Peak Signal to Noise Ratio (PSNR), result of this system is brightness preservation level is low and output image is grey \hyperref[b0]{[1]}.\par
Digital image process has several applications in several fields like medication, forensic, robotics, industrial automatic scrutiny systems, navigation etc. This field has attracted attentions of researchers and students to develop and/or to enhance algorithms for various applications \hyperref[b1]{[2]}. With the event of image process techniques, individuals will simply tamper digital pictures by using some advanced 
\section[{D}]{D}\par
Author: e-mail: krishnaveni120691@gmail.com Thresholding could be a common image segmentation methodology that converts a gray-level image into a binary image. The choice of optimum thresholds has remained a challenge over decades \hyperref[b8]{[9]}. Binarization (i.e., image thresholding) is wide used as a preprocess algorithmic rule in image analysis and understanding \hyperref[b16]{[17]}. Image thresholding (or binarization) could be a basic kind of image segmentation capability \hyperref[b18]{[19]}. In all ancient segmentation schemes, statically measured thresholds or primary points are wont to binarize pictures. Due to the variations in pictures characteristics, these techniques could generate high segmentation accuracy for a few pictures and low accuracy for different pictures. For many pictures, the quantity of grey level is way smaller than the quantity of pixels \hyperref[b14]{[15]}. Intelligent segmentation by "dynamic" determination of thresholds supported image properties is also a lot of sturdy answer \hyperref[b17]{[18]}.\par
Thresholding is a crucial method in several image process applications \hyperref[b9]{[10]}  \hyperref[b12]{[13]}. However, the execution time needs should still be important, particularly if it's of interest to perform period of time thresholding of an outsized variety of pictures, like within the case of high-resolution video sequences \hyperref[b9]{[10]}. The image thresholding drawback is treated as a crucial issue in image process, and it can not only reduce the image data, however additionally lay a decent foundation for succedent target recognition and image sympathetic.\par
Nature of global thresholding segmentation and local thresholding was analyzed in image segmentation \hyperref[b7]{[8]}  \hyperref[b13]{[14]}. In image analysis, image thresholding that is employed for separating the object from the background is one in every of the foremost common application. For the preprocessing functions of a picture, thresholding could be a necessary tool  {\ref [16] [18]}.\par
Automatic thresholding is a very important technique within the image segmentation method. The essential plan of automatic thresholding is to mechanically choose an optimal gray-level threshold value for partitioning pixels within the pictures into object and background supported their gray-level distribution \hyperref[b11]{[12]}. Entropy-based image thresholding has received wide interest in recent years. It's a very important concept within the space image segmentation. The entropy-based approach was wont to get the brink of image from eighty ages; it's wont to weight the quantity of reserved data of image once segmentation \hyperref[b10]{[11]}. Thresholding segmentation may be a vital preprocessing tread on several image process applications. However, most of the prevailing thresholding ways will solely cope with a picture with some special histogram patterns \hyperref[b12]{[13]}.\par
Examples of thresholding applications are document image analysis wherever the goal is to extract written characters \hyperref[b26]{[26]}, \hyperref[b27]{[27]} logos, graphical content, musical scores, map process wherever lines, legends, characters are to be found \hyperref[b28]{[28]}, scene process wherever a target is to detected \hyperref[b29]{[29]}, quality examination of materials \hyperref[b30]{[30]}, \hyperref[b31]{[31]}. Alternative applications embrace cell pictures \hyperref[b32]{[32]}, \hyperref[b33]{[33]} and data illustration \hyperref[b34]{[34]}, segmentation of assorted image modalities for non-destructive testing (NDT) applications, like ultrasonic pictures in \hyperref[b35]{[35]}, eddy current pictures \hyperref[b36]{[36]}, thermal pictures \hyperref[b37]{[37]}, X-raying computed tomography (CAT) \hyperref[b38]{[38]}, optical device scanning confocal research \hyperref[b38]{[38]}, extraction of edge field \hyperref[b39]{[39]}, image segmentation normally \hyperref[b40]{[40]}, \hyperref[b42]{[41]} spatio-temporal segmentation of video pictures \hyperref[b43]{[42]} etc. 
\section[{II.}]{II.} 
\section[{Literature Review}]{Literature Review}\par
Despite a lots of works out there within the literature, a handful of important explore works are reviewed here. In recent years, the outstanding advances in medical imaging instruments have enlarged their use significantly for medical specialty likewise as designing and follow-up of treatment \hyperref[b19]{[20]}. Thresholding is that the simplest technique of image segmentation. From a grayscale image, thresholding is wont to produce binary pictures  {\ref (Shapiro, et al. 2001:83)}  \hyperref[b20]{[21]}.\par
Martin Luessi et al.. discussed image thresholding could be a quite common image process operation, since the majority image process schemes would like some style of separation of the pixels into totally different categories. So as to work out the thresholds, most ways analyze the histogram of the image. The optimum thresholds are usually found by either minimizing or maximizing an objective function with reference to the values of the thresholds. By process two categories of objective functions that the optimum thresholds may be found by efficient algorithms \hyperref[b21]{[22]}.\par
Bong Chin-Wei et al analyses thresholding may be a common region segmentation technique. During this technique a threshold is chosen, and a picture is split into collections of pixels having value but the threshold and collections of pixels with values bigger or adequate to the brink. In 2007, Nakid and his team a) Thresholding software system. For pictures are wide used for the recent years, great amount of digital image manipulation might be seen in magazine, Industry, Scientific Journals, Court Rooms, News etc. The tampered pictures can turn out nice impact, and hurt to the traditional order of the society. The way to build effectively forensics to the tampered pictures is changing into a hunt hotspot within the data security field. Wherever digital image forensics has emerged as a replacement analysis field that aims to reveal meddling in digital pictures detection forgery in digital pictures is a rising analysis field \hyperref[b5]{[6]}.\par
backgrounds \hyperref[b47]{[46]}. Sahoo et al analyses nine thresholding algorithms and illustrated relatively their performance \hyperref[b48]{[47]}. Glasbey have introduced the relationships and performance variations between eleven histogram-based algorithms supported an in depth statistical study \hyperref[b49]{[48]}. \hyperref[b33]{Kapur et al (1985)} employed the Global entropic thresholding algorithm. Unsupervised thresholding progress wherever the most excellent thresholding grey level is chosen by exhaustive search among obtainable grey intensities has been improved. One of the approach examined by the author is the make use of signal dispensation methods specifically thresholding and information fusion to recover the correctness of information mined from the restructured tomograms (Mwambela \& Johansen 2001, Mwambela 1999, Mwambelaet al1997) \hyperref[b24]{[24]}. Murthy et al have demonstrated the use of fuzzy and rough set theories to grip the vagueness there in pictures whereas performing histogram thresholding. Pal et al in the year 1983 established make use of the concept of decreasing fuzziness measures, which enumerate vagueness in information to achieve image segmentation based on histogram thresholding \hyperref[b25]{[25]}.\par
Solihin and Leedham have developed a global thresholding technique to extract written components from low-quality documents \hyperref[b64]{[59]}. In an additional motivating approach Aviad and Lozinskii \hyperref[b65]{[60]} have pioneered semantic thresholding to emulate human approach to image binarization. The "semantic" threshold is found by minimizing measures of conflict criteria in order that the binary image resembles most to a "verbal" description of the scene. Gallo and Spinello \hyperref[b66]{[61]} have developed a method for thresholding and isocontour extraction via fuzzy arithmetic. Fernandez \hyperref[b67]{[62]}has investigated the choice of a threshold in matched filtering applications within the detection of tiny target objects. During this application the Kolmogorov-Smirnov distance between the background and object histograms is maximized as a purpose of the threshold value.\par
Anderson, J. et al have propose a technique supported the graph cut thresholding method, that is all the same acceptable for hardware (FPGA) time period implementations. The image of the weld pool was processed employing a series of methods: image truncation, bi-level thresholding, median filter and edge detection. Recently, a bi-level image thresholding technique supported graph cut was projected. The technique provided thresholding results that were superior to those obtained with previous techniques. Moreover, the technique was computationally less complicated compared to different graph cut-based sized range of pictures, like within the case of highresolution video sequences. \hyperref[b88]{[80]}.\par
Traditional best thresholding techniques are terribly computationally high once extended to multilevel thresholding for their thoroughly search mode. Thus their applications are restricted. One in every of the foremost well-liked techniques for image segmentation is understood as multilevel thresholding. Multilevel thresholding amounts to segmenting a gray-level image into many distinct regions. The most distinction between multilevel and binary thresholding, is that the binary thresholding outputs a two-color image, sometimes black and white, whereas the multilevel thresholding outputs a gray scale image within which a lot of details from the first image may be unbroken. Two major issues with utilizing the multilevel thresholding technique are: it's a time overwhelming approach, i.e., finding acceptable threshold values may take exceptionally long process time; process a correct range of thresholds or levels that may keep most of the relevant details from the first image may be a troublesome task \hyperref[b90]{[81]}. 
\section[{III.}]{III.} 
\section[{Existing Image Thresholding Techniques}]{Existing Image Thresholding Techniques}\par
The output of the thresholding operation could be a binary image whose grey level of zero (black) can indicate a picturing element fit in to a print, legend, drawing, or target and a grey level of one (white) can indicate the background. Taxonomy of thresholding algorithms supported on the sort of knowledge used. We have a tendency to distinguish six classes, namely, thresholding algorithms supported the exploitation of 1) Histogram entropy data, 2) Histogram shape data, 3) Image attribute data like contours, 4) Clump of graylevel data, 5) Domestically adaptative characteristics, 6) Spatial data \hyperref[b44]{[43]} There are varieties of survey papers on thresholding. Lee, Chung, and Park \hyperref[b45]{[44]} conducted a comparative analysis of five global thresholding techniques and advanced helpful criteria for thresholding performance analysis. In an earlier work, Weszka and Rosenfeldcon jointly outlined many analysis criteria \hyperref[b46]{[45]}. Palumbo, Swaminathan and Srihari addressed the problem of document binarization compares three techniques; whereas Trier and Jain had have planned to use the multi-objective approach to find the optimal thresholds of three criteria: the within-class criterion, the entropy and therefore the overall chance of error criterion \hyperref[b23]{[23]}.\par
Local techniques don't verify an only single value of threshold however adapt the threshold value relying upon the local image characteristics. 
\section[{a) Histogram Shape-Based Thresholding Methods}]{a) Histogram Shape-Based Thresholding Methods}\par
This class of techniques achieves thresholding supported the form properties of the histogram. Essentially two most important peaks and an intervening valley is searched for using such tools because the protrusive hull of the histogram, or its curvature and 0 (zero) crossings of the wavelet elements. Alternative authors try and approximate the histogram via two-step functions or two-pole autoregressive smoothing.\par
Using a differencing operation on the ironed kernel, the histogram is characterized by the set S of peaks, that's the triplet of early, peaking and terminating zero-crossings on the peak detection signal:1,..I i s m e S i i i = =\par
), , , [( , wherever I is that the variety of peaks wanted. The particular variety of peaks obtained is reduced to I, that's two for binarization, by adjusting the support of the smoothing filter and a peak-merging criterion. For two-level illustration of a picture the threshold ought to be somewhere in between the primary early and therefore the second terminating zero crossing, that is \hyperref[b55]{[50]}:1. 0 s ) - (1 e T 2 1 opt ? ? + = ? ? ? , 
\section[{b) Clustering based thresholding methods}]{b) Clustering based thresholding methods}\par
In this category of algorithms the grey level information undergoes a clump analysis with the amount of clusters being set to two. Alternately the grey level distribution is shapely as a combination of two Gaussian distributions representing, correspondingly, the background and foreground regions.\par
Otsu advised minimizing the weighted total of within-class variances of the foreground associated background pixels to determine an optimum threshold. Since step-down of within-class variances is equal to the maximization of between-class scatter, the selection of the optimum threshold may be developed as \hyperref[b56]{[51]}:] )) ( ) ( )).( ( 1 ).( ( max[ arg 2 T m T m T P T P T b f opt ? ? =\par
The Otsu technique provides satisfactory results once the numbers of pixels in every category are nearone other. The Otsu technique still remains one in every of the foremost documented thresholding techniques. During a similar study thresholding supported on isodata clump is given in Velasco \hyperref[b57]{[52]}. Some limitations of the Otsu technique is mentioned in Lee \hyperref[b58]{[53]}. 
\section[{c) Entropy based thresholding methods}]{c) Entropy based thresholding methods}\par
This category of algorithms exploits the entropy of the distribution of the grey levels during a scene. The maximization of the entropy of the thresholded image is understood as indicative of most data transfer. Alternative authors try and minimize the cross-entropy between the input gray-level image and therefore the output binary image as indicative of preservation of data. Johannsen and Bille \hyperref[b59]{[54]} and Pal, King, Hashim \hyperref[b60]{[55]} were the primary to check Shannon entropy based mostly thresholding.\par
In this technique the foreground and background categories are thought about as two completely different sources. Once the total of the two category entropies may be a most the image is alleged to be optimally thresholded. Therefore using the description of the foreground and background entropies,? = ? = T g f T P g p T P g p T H 0 ) ( ) ( log ) ( ) ( ) (\textbf{and}? + = ? = G T g b T P g p T P g p T H 1 ) ( ) ( log ) ( ) ( ) (\par
one has \hyperref[b61]{[56]}:)] ( ) ( max[ arg T H T H T b f opt + =\par
Yen, Chang and Chang \hyperref[b61]{[56]} have thought about a multilevel thresholding method wherever additionally to the category entropies a cost purpose based on the amount of bits required to the thresholded image is enclosed. 
\section[{d) Thresholding Algorithms Based on Attribute Similarity}]{d) Thresholding Algorithms Based on Attribute Similarity}\par
The calculations considered under this class select the limit quality in light of some similitude measure between the first picture and the binarized adaptation of the picture. These characteristics can take the manifestation of edges, shapes, or one can specifically consider the first dim level picture to parallel picture similarity. Then again they consider certain picture properties, for example, reduction or integration of the items coming about because of the binarization process or the happenstance of the edge fields.\par
Hertz and Schafer \hyperref[b91]{[82]} consider a multi thresholding method where a beginning global 5. The spatial techniques use the likelihood mass performs models taking under consideration correlation between pixels on a global scale. 6.\par
threshold assessment is refined provincially by background and foreground (object) or alternately are measure shapely as two Gaussian distributions. 3. Entropy-based techniques lead to algorithms, as an example, that uses the entropy foregroundbackground regions, the cross-entropy between the first and binarized image etc. 4. Object attribute-based techniques search a measure of similarity between the gray-level and binarized pictures, like as fuzzy similarity, shape, edges, variety of objects etc.\par
the Sobel administrator. The worldwide limit is given by that esteem that expands the occurrence of the two edge fields in light of the check of coordinating edges and punishing the overabundance unique edges and the abundance thresholded picture edges.)] ( max[ arg T E E T binary gray opt ? =\par
In a corresponding study  {\ref Venkatesh and Rosin [83]} have identified the difficulty of best possible thresholding for edge field assessment. 
\section[{e) Spatial thresholding methods}]{e) Spatial thresholding methods}\par
In this category of algorithms one utilizes spatial details of object and background pixels, for instance, within the sort of context possibilities, correlation functions, co-occurrence possibilities, local linear dependence models of pixels, two-dimensional entropy etc. One in the entire primary to explore spatial details was Rosenfeld \hyperref[b68]{[63]} who thought about such ideas as local average grey level for thresholding. Alternative authors have used relaxation to improve on the binary map \hyperref[b69]{[64]}, \hyperref[b70]{[65]}, the Laplacian of the images to enhance histograms \hyperref[b53]{[49]}, the quad tree thresholding and second-order statistics \hyperref[b71]{[66]}. Co-occurrence probabilities have been used as indicator of spatial dependence as in Lie \hyperref[b72]{[67]}, Pal \hyperref[b73]{[68]}, and Chang \hyperref[b74]{[69]}. Recently Leung and Lam have thought about thresholding within the context of a posteriori spatial chance estimation \hyperref[b75]{[70]}.\par
Chanda and Majumder \hyperref[b76]{[71]} had advised the employment of co-occurrences for threshold choice. Lie \hyperref[b72]{[67]} has projected many measures to the present result. Within the technique by Chang, Chen, Wang and Althouse the co-occurrence possibilities of each the initial image and of the thresholded image are calculated. A suggestion that the thresholded image is most kind of like the initial image is obtained whenever they possess as similar co-occurrences as doable. In alternative words the threshold T is set in such a way that the grey level transition possibilities of the initial image has minimum relative entropy (discrepancy) with reference to that of the initial image. This assess of similarity is obtained by the relative entropy, as an alternative referred to as the directed divergence or the Kullback-Leibler distance, that for two generic distributions p, q has the shape? = q p q p p q p D , log ) , (\textbf{.}\par
Think about the four quadrants of the cooccurrence matrix: The primary quadrant denotes the background-to-background (bb) transitions whereas the third quadrant corresponds to the foreground-toforeground (ff) transitions. Equally the second and fourth quadrants denote, correspondingly, the background-toforeground (bf) and also the foreground-to-background (fb) transitions. Belongings the cell possibilities be denoted as p ij , that is that the i to j grey level transitions normalized by the overall variety of transitions. The quadrant probabilities are obtained as:? ? = = = T i T j ij bb p T P 0 0 ) ( , ? ? = + = = T i G T j ij bf p T P 0 1 ) ( , ? ? + = + = = G T i G T j ij ff p T P 1 1 ) ( , ? ? + = = = G T i T j ij fb p T P 1 0 ) (\par
and equally for the thresholded image one finds the quantities Q bb (T), Q bf (T), Q ff (T), Q fd (T). Plugging these expressions of co-occurrence possibilities within the relative entropy expression one will establish an optimum threshold as \hyperref[b74]{[69]}: 
\section[{(T)] (T)logQ P (T) (T)logQ P (T) (T)logQ P (T) (T)logQ argmin[P T}]{(T)] (T)logQ P (T) (T)logQ P (T) (T)logQ P (T) (T)logQ argmin[P T}fb fb ff ff bf bf bb bb opt + + + = 
\section[{f) Locally adaptive thresholding strategies}]{f) Locally adaptive thresholding strategies}\par
A threshold that's calculated at every picture element characterizes this category of algorithms. The worth of the threshold depends upon some narrow statistics like vary, variance, and surface fitting parameters or their logical mixtures. It's typical of domestically adaptive strategies to own many adjustable parameters \hyperref[b77]{[72]}. The threshold T (i, j) are going to be indicated as a purpose of the coordinates i, j; otherwise the thing or background selections at every picture element are going to be indicated by the logical variable B (i, j). Nakagawa and Rosenfeld \hyperref[b78]{[73]}, Deravi and Pal \hyperref[b82]{[74]} were the first users of adaptive techniques for thresholding.\par
This technique claims to recover on the Niblack technique particularly for stained and badly well-lighted documents. It adapts the threshold according to the local mean and variance over a window size of bxb. The threshold at picture element (i,j) is calculated as:)] 1 ) , ( .( 1 [ ) , ( ) , ( ? + + = R j i k j i m j i T ?\par
where m(i,j) and ) , ( j i ? are as in Niblack \hyperref[b64]{[59]} and edges and missed edges. For our situation we have considered a streamlined adaptation of this methodology. Both the dark level picture edge field and the twofold picture edge field have been gotten through considering edge data. The system expect that a diminished edge field is gotten from the dim level picture E gray , which is contrasted and the edge field got from the binarized picture, E binary (T). The edge is balanced in such a path, to the point that the fortuitous event between theories two edge fields is expanded. This infers there is least stipend for both overabundance IV. 
\section[{Results and Discussion}]{Results and Discussion}\par
develop a two-stage technique, the primary being a global threshold, followed by a neighborhood refinement. Eikvil, Taxt and Moen \hyperref[b85]{[77]} think about a quick adaptive technique for binarization of documents whereas Pavlidis \hyperref[b86]{[78]} uses the second-derivative of the gray-level image. Zhao and Ong \hyperref[b87]{[79]} have thought about validity-guided fuzzy c-clustering to supply thresholding strong against illumination and shadow effects. 
\section[{NORMAL Mammogram images of (Mdb003)}]{NORMAL Mammogram images of (Mdb003)}\par
Histogram Shape based methods Therefore the contribution of the standard deviation is converted into adaptive. For instance within the case of text written on a grimy or stained paper the threshold is down \hyperref[b83]{[75]}. Among different local thresholding strategies specifically meshed to document pictures one will mention the work of Kamada and Fujimoto \hyperref[b84]{[76]}who V. 
\section[{Examinations}]{Examinations}\par
Beside an unpleasant portrayal of every system, we introduce a valuable measurement and exchanges about the recurrence of the most utilized picture transforming techniques as a part of the issue of tiny picture division. This investigation is useful for a superior utilization of existing systems, for enhancing their execution and in addition for outlining new ones. As pointed out in [Malpica and de Solorzano, 2002], the most widely spread segmentation method is grey level thresholding. 
\section[{VI.}]{VI.} 
\section[{Conclusions}]{Conclusions}\par
Since there is no general methodology for getting precise picture segmentation, pretty much all systems consolidate the two fundamental methodologies: region based plans and edge based plans. This is way a characterization taking into account the paradigm utilized by every segmentation procedure is practically inconceivable. Rather, a rundown of the most utilized routines and how they are normally joined to accomplish great segmentation results is useful for better utilization of existing strategy and for enhancing their execution and in addition for planning new ones. In this paper we generally depict some illustrative studies in the field of thresholding for picture segmentation. Some of them utilize just basic transforming methods yet the larger part consolidates techniques without considering their multifaceted nature, e.g. edge with molecule calculation  {\ref (Wang et al., 2008)} or fuzzy cmeans calculation with manufactured neural system  {\ref (Colantonio et al., 2007)}. As a general propensity we can presume that the new systems utilize two principle headings which appear to give steady and precise segmentation results. The first has a tendency to utilize the geometrical properties as from the earlier information, i.e. geometrical model fitting. At the point when this is unrealistic because of powerless limits, low between item complexities or high variability fit as a fiddle and size, the second inclination taking into account items gimmicks is viewed as; these peculiarities are utilized to prepare an ANN, a Bayesian systems or a SVM.\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.3199261992619926\textwidth}P{0.5300738007380074\textwidth}}
\tabcellsep image thresholding approaches. However, the execution\\
for most in depth comparison basis techniques in the\tabcellsep time necessities should still be vital, particularly if it's of\\
context of character segmentation from complicated\tabcellsep interest to perform time period thresholding of about\end{longtable} \par
  {\small\itshape [Note: 2. Clustering-based techniques wherever the grey level samples are clustered in two components as]} 
\caption{\label{tab_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.16657509157509157\textwidth}P{0.045535714285714284\textwidth}P{0.15528846153846151\textwidth}P{0.28138736263736264\textwidth}P{0.20121336996336994\textwidth}}
Author Name\tabcellsep Year\tabcellsep Domain\tabcellsep Model\tabcellsep Applications\\
Bamford and Lovell\tabcellsep 1998\tabcellsep Cell Segmentation\tabcellsep Level set methods\tabcellsep Biological images\\
Solorzano et al.,\tabcellsep 1999\tabcellsep Networking\tabcellsep World Wide Lightning Location Network (WWLN)\tabcellsep Lightning data for hurricanes\\
Cong and Parvin\tabcellsep 2000\tabcellsep Segmentation and Classification\tabcellsep Image analysis geometrical model fitting) techniques (the\tabcellsep Cellular images\\
Boland and Murphy\tabcellsep 2001\tabcellsep Pattern classification\tabcellsep Interpretation the concavity points\tabcellsep Microscope images\\
Malpica and de Solorzano\tabcellsep 2002\tabcellsep Segmentation\tabcellsep Grey Level thresholding\tabcellsep Cellular images\\
Hu, et al.,\tabcellsep 2004\tabcellsep segmentation\tabcellsep improved active contour model\tabcellsep Cell images.\\
Wahlby, et al.,\tabcellsep 2004\tabcellsep segmentation\tabcellsep watershed segmentation\tabcellsep Cell images.\\
Naik, et al.,\tabcellsep 2007\tabcellsep segmentation\tabcellsep Bayesian classifier and a level-set\tabcellsep Medical images\\
Lebrun et al.,\tabcellsep 2007\tabcellsep segmentation\tabcellsep support vector machine (SVM)\tabcellsep Cellular images\\
Colantonio et al.,\tabcellsep 2007\tabcellsep segmentation\tabcellsep fuzzy c-means algorithm\tabcellsep Medical image\\
Yang et al.,\tabcellsep 2005\tabcellsep segmentation\tabcellsep gradient vector\tabcellsep Color images\\
Nilsson \&Heyden,\tabcellsep 2005\tabcellsep segmentation\tabcellsep level set methods and the watershed\tabcellsep Bone marrow sample images\\
Wang, et al.,\tabcellsep 2008\tabcellsep Segmentation\tabcellsep Adaptive thrsholding algorithm\tabcellsep Leaf images\\
Angulo\tabcellsep 2008\tabcellsep Segmentation\tabcellsep watershed segmentation and thresholding\tabcellsep Light channel image\\
Bai, et al.,\tabcellsep 2009\tabcellsep Segmentation\tabcellsep Thresholding\tabcellsep MRI brain images\\
Coelho, et al.,\tabcellsep 2009\tabcellsep Segmentation\tabcellsep watershed\tabcellsep Microscope Cell images\\
Dalle, et al.,\tabcellsep 2009\tabcellsep Histopathology Image Segmentation\tabcellsep Thresholding\tabcellsep Histopathological H \& E Stained Breast Cancer Images\\
Danek et al.,\tabcellsep 2009\tabcellsep segmentation\tabcellsep graph-cut\tabcellsep Cellular images\\
Russell, et al.,\tabcellsep 2009\tabcellsep segmentation\tabcellsep Stable Count Thresholding (SCT)\tabcellsep Cellular images\\
Ta, et al.,\tabcellsep 2009\tabcellsep segmentation\tabcellsep Otsu's method\tabcellsep fluorescence microscopic images\\
\tabcellsep \tabcellsep \tabcellsep The adaptive\tabcellsep \\
Zhou,et al.,\tabcellsep 2009\tabcellsep segmentation\tabcellsep thresholding and watershed, Markov\tabcellsep Satellite imagery\\
\tabcellsep \tabcellsep \tabcellsep model.\tabcellsep \\
Jeong, et al.,\tabcellsep 2009\tabcellsep Classification\tabcellsep Thresholding\tabcellsep Microscopy images.\\
(Yang \&Choe,\tabcellsep 2009)\tabcellsep segmentation\tabcellsep graph-cut\tabcellsep Microscopy images.\\
Xiangzhi,et al.,\tabcellsep 2009\tabcellsep Edge detection\tabcellsep Thresholding\tabcellsep Real time images\\
Madhloom,et al.,\tabcellsep 2010\tabcellsep segmentation\tabcellsep The adaptive thresholding\tabcellsep Cellular images\\
Wei,et al.,\tabcellsep 2011\tabcellsep segmentation\tabcellsep Renyi entropy thresholding\tabcellsep 3-d images\\
Seroussi,et al.,\tabcellsep 2012\tabcellsep Segmentation\tabcellsep Modified active contour model\tabcellsep Microscopy images\\
Ali El-Zaart and Ali A.Ghosn\tabcellsep 2013\tabcellsep Segmentation\tabcellsep Bimodal and multimodal thresholding\tabcellsep MRI Brian images\end{longtable} \par
 
\caption{\label{tab_1}Table 1}\end{figure}
 			\footnote{( )Year 2021 F © 2021 Global JournalsThe Impact of Different Image Thresholding based Mammogram Image Segmentation-A Review} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Luessi]{b49}\label{b49} 	 		\textit{},  		 			Martin Luessi 		.  		 	 
\bibitem[Eichmann]{b50}\label{b50} 	 		\textit{},  		 			Marco Eichmann 		.  		 	 
\bibitem[Schuster]{b51}\label{b51} 	 		\textit{},  		 			Guido M Schuster 		.  		 	 
\bibitem[Zeng et al.]{b53}\label{b53} 	 		\textit{},  		 			Ming Zeng 		,  		 			; Tiemao Han 		,  		 			; Qinghaomeng 		.  		 	 
\bibitem[Tao]{b78}\label{b78} 	 		\textit{},  		 			Wenbing Tao 		.  		 	 
\bibitem[Jin]{b79}\label{b79} 	 		\textit{},  		 			Hai Jin 		.  		 	 	 (Yimin Zhang) 
\bibitem[Liu]{b80}\label{b80} 	 		\textit{},  		 			Liman Liu 		.  		 	 
\bibitem[Liang]{b88}\label{b88} 	 		\textit{},  		 			Yun-Chia Liang 		.  		 	 
\bibitem[Pal et al. ()]{b58}\label{b58} 	 		\textit{},  		 			N R Pal 		,  		 			S K Pal 		,  		 			Entropic Thresholding 		.  	 	 		\textit{Signal Processing}  		1989. 16 p. .  	 
\bibitem[Gonzalez and Woods ()]{b21}\label{b21} 	 		\textit{},  		 			Rafael C Gonzalez 		,  		 			Richard E Woods 		.  		2002.  	 
\bibitem[Le et al. ()]{b69}\label{b69} 	 		‘A Comparative Performance Study of Several Global Thresholding Techniques for Segmentation’.  		 			S U Le 		,  		 			S Y Chung 		,  		 			R H Park 		.  	 	 		\textit{Graphical Models and Image Processing},  				1990. 52 p. .  	 
\bibitem[Yen et al. ()]{b32}\label{b32} 	 		‘A new criterion for automatic multilevel thresholding’.  		 			J C Yen 		,  		 			F J Chang 		,  		 			, S Chang 		.  		 IP-4.  	 	 		\textit{IEEE Trans. on Imag Processing}  		1995. p. .  	 
\bibitem[Sezgin and Tasaltin ()]{b44}\label{b44} 	 		‘A new dichotomization technique to multilevel thresholding devoted to inspection applications’.  		 			M Sezgin 		,  		 			R Tasaltin 		.  	 	 		\textit{Pattern Recognition Letters}  		2000. 21 p. .  	 
\bibitem[Kapur et al. ()]{b33}\label{b33} 	 		‘A New Method for Gray-Level Picture Thresholding Using the Entropy of the Histogram’.  		 			J N Kapur 		,  		 			P K Sahoo 		,  		 			A K C Wong 		.  	 	 		\textit{Graphical Models and Image Processing}  		1985. 29 p. .  	 
\bibitem[Kirby and Rosenfeld ()]{b66}\label{b66} 	 		‘A Note on the Use of (Gray Level, Local Average Gray Level) Space as an Aid in Threshold Selection’.  		 			R L Kirby 		,  		 			A Rosenfeld 		.  		 SMC-9.  	 	 		\textit{IEEE Trans. Systems, Man and Cybernetics}  		1979. p. .  	 
\bibitem[Chanda and Majumder ()]{b9}\label{b9} 	 		‘A note on the use of gray level co-occurrence matrix in threshold selection’.  		 			D D Chanda 		,  		 			Majumder 		.  	 	 		\textit{Signal Processing}  		1988. 15 p. .  	 
\bibitem[Ahuja and Rosenfeld ()]{b56}\label{b56} 	 		‘A Note on the Use of Second-Order Gray-Level Statistics for Threshold Selection’.  		 			A Ahuja 		,  		 			Rosenfeld 		.  		 SMC-5.  	 	 		\textit{IEEE Trans. Systems Man and Cybernetics}  		1975. p. .  	 
\bibitem[Sezan ()]{b46}\label{b46} 	 		‘A Peak Detection Algorithm and its Application to Histogram-Based Image Data Reduction’.  		 			M I Sezan 		.  	 	 		\textit{Graphical Models and Image Processing}  		1985. 29 p. .  	 
\bibitem[Chang et al. ()]{b11}\label{b11} 	 		‘A Relative Entropy Based Approach in Image Thresholding’.  		 			K Chang 		,  		 			J Chen 		,  		 			M L G Wang 		,  		 			Althouse 		.  	 	 		\textit{Pattern Recognition}  		1994. 27 p. .  	 
\bibitem[Kohler ()]{b65}\label{b65} 	 		‘A segmentation system based on thresholding’.  		 			Kohler 		.  	 	 		\textit{Graphical Models and Image Processing},  				1981. 15 p. .  	 
\bibitem[Mahmoudi and El Zaart ()]{b48}\label{b48} 	 		‘A survey of entropy image thresholding techniques’.  		 			L Mahmoudi 		,  		 			A El Zaart 		.  	 	 		\textit{Advances in Computational Tools for Engineering Applications (ACTEA)},  				 (Page(s)  		2012. p. .  	 
\bibitem[Sahoo et al. ()]{b62}\label{b62} 	 		‘A Survey of Thresholding Techniques’.  		 			P K Sahoo 		,  		 			S Soltani 		,  		 			A K C Wong 		,  		 			Y Chen 		.  	 	 		\textit{Computer Graphics and Image Process}  		1988. 41 p. .  	 
\bibitem[Krishnaveni et al. ()]{b93}\label{b93} 	 		‘A Survey on Nature-Inspired Computing (NIC): Algorithms and Challenges’.  		 			A Krishnaveni 		,  		 			R Shankar 		,  		 			S Duraisamy 		.  	 	 		\textit{Global Journal of Computer Science and Technology: D Neural \&amp}  		2019. 19.  	 	 (Artificial Intelligence. Issue 3 Version 1.0 Year) 
\bibitem[Otsu ()]{b57}\label{b57} 	 		‘A Threshold Selection Method From Gray Level Histograms’.  		 			N Otsu 		.  		 SMC-9.  	 	 		\textit{IEEE Transactions on Systems, Man, and Cybernetics}  		1979. p. .  	 
\bibitem[Johannsen and Bille ()]{b20}\label{b20} 	 		‘A threshold selection method using information measures’.  		 			J Johannsen 		,  		 			Bille 		.  	 	 		\textit{ICPR'82: Proc. 6th Int. Conf. Pattern Recognition},  				 (Berlin)  		1982. p. .  	 
\bibitem[Ahirwar et al. ()]{b3}\label{b3} 	 		‘A. Hybrid model for preserving brightness over the digital image processing’.  		 			V Ahirwar 		,  		 			H Yadav 		,  		 			Jain 		.  	 	 		\textit{4th International Conference on Page},  				2013. p. .  	 
\bibitem[Moysan et al. ()]{b28}\label{b28} 	 		‘Adapting an ultrasonic image threshold method to eddy current images and defining a validation domain of the thresholding method’.  		 			G Moysan 		,  		 			T Corneloup 		,  		 			Sollier 		.  	 	 		\textit{NDT\&E International}  		1999. 32 p. .  	 
\bibitem[Sauvola and Pietaksinen ()]{b29}\label{b29} 	 		‘Adaptive document image binarization’.  		 			J Sauvola 		,  		 			M Pietaksinen 		.  	 	 		\textit{Pattern Recognition}  		2000. 33 p. .  	 
\bibitem[Zhao and Ong ()]{b83}\label{b83} 	 		‘Adaptive local thresholding with fuzzy-validity guided spatial partitioning’.  		 			X Zhao 		,  		 			S H Ong 		.  	 	 		\textit{ICPR'98, Int. Conf. on Pattern Recognition},  				 (Barcelona)  		1998. p. .  	 
\bibitem[Glasbey ()]{b12}\label{b12} 	 		‘An analysis of histogram-based thresholding algorithms’.  		 			C A Glasbey 		.  	 	 		\textit{Graphical Models and Image Processing},  				1993. 55 p. .  	 
\bibitem[Al-Ghaib and Adhami ()]{b4}\label{b4} 	 		‘An E-learning interactive course for teaching digital image processing at the undergraduate level in engineering’.  		 			H Al-Ghaib 		,  		 			R Adhami 		.  	 	 		\textit{15th International Conference on Page},  				2012. p. .  	 
\bibitem[Wu et al. ()]{b39}\label{b39} 	 		‘An Effective Entropic Thresholding for Ultrasonic Imaging’.  		 			L U Wu 		,  		 			M A Songde 		,  		 			L U Hanqing 		.  	 	 		\textit{ICPR'98: Int. Conf. on Pattern Recognition},  				 (Australia)  		1998. p. .  	 
\bibitem[Lie ()]{b77}\label{b77} 	 		‘An efficient threshold-evaluation algorithm for image segmentation based on spatial gray level co-occurrences’.  		 			W N Lie 		.  	 	 		\textit{Signal Processing}  		1993. 33 p. .  	 
\bibitem[Perez and Pavlidis ()]{b64}\label{b64} 	 		‘An iterative thresholding algorithm for image segmentation’.  		 			T Perez 		,  		 			Pavlidis 		.  	 	 		\textit{IEEE Trans. Pattern Analysis and Machine Intelligence}  		1987. 9 p. .  	 
\bibitem[Sohi and Devgan ()]{b72}\label{b72} 	 		‘Application to enhance the teaching and understanding of basic image processing techniques" Southeastcon’.  		 			D S Sohi 		,  		 			S S Devgan 		.  	 	 		\textit{Proceedings of the IEEE Page},  				 (the IEEE Page)  		2000. p. .  	 
\bibitem[Russ ()]{b31}\label{b31} 	 		‘Automatic discrimination of features in gray-scale images’.  		 			J C Russ 		.  	 	 		\textit{Journal of Microscopy}  		1987. 148  (3)  p. .  	 
\bibitem[Pal et al. ()]{b68}\label{b68} 	 		‘Automatic Gray Level Thresholding Through Index of Fuzziness and Entropy’.  		 			S K Pal 		,  		 			R A King 		,  		 			A A Hashim 		.  	 	 		\textit{Pattern Recognition Letters}  		1980. 1 p. .  	 
\bibitem[Bhanu ()]{b8}\label{b8} 	 		‘Automatic Target Recognition: State of the Art Survey’.  		 			Bhanu 		.  		 AES-22.  	 	 		\textit{IEEE Transactions on Aerospace and Electronics Systems}  		1986. p. .  	 
\bibitem[Bankman (2000)]{b26}\label{b26} 	 		 			Isaac Bankman 		.  	 	 		\textit{Handbook of Medical Imaging Processing and Analysis Management},  				September 2000. Academic Press.  	 
\bibitem[Ma]{b37}\label{b37} 	 		\textit{Based on the fourier transform and the wavelet transformation of the digital image processing},  		 			Juxia Ma 		.  		Page(s. p. .  	 
\bibitem[Janakiraman et al.]{b36}\label{b36} 	 		\textit{Certain studies on thresholding based defect detection algorithms for Magnetic Flux Leakage images "Emerging Trends in Computing},  		 			S Janakiraman 		,  		 			J Daniel 		,  		 			A Abudhahir 		.  		p. .  		 			Communication and Nanotechnology (ICE -CCN 		 	 
\bibitem[Lee and Park ()]{b25}\label{b25} 	 		‘Comments on an optimal threshold scheme for image segmentation’.  		 			H Lee 		,  		 			R H Park 		.  	 	 		\textit{IEEE Trans. System, Man and Cybernetics}  		1990. 20 p. .  	 
\bibitem[Sezgin and Sankur ()]{b42}\label{b42} 	 		‘Comparison of thresholding methods for non-destructive testing applications’.  		 			B Sezgin 		,  		 			Sankur 		.  	 	 		\textit{International Conference on Image Processing},  				 (Thessaloniki, Greece)  		October 7-10, 2001.  	 
\bibitem[Corson and Moss ()]{b15}\label{b15} 	 		\textit{Computer vision: An indepth look at the technique and applications of digital image processing},  		 			M S Corson 		,  		 			R H Moss 		.  		1986. p. .  	 	 (Issue: 4 Page(s) 
\bibitem[Yasuda et al. ()]{b86}\label{b86} 	 		\textit{Data Compression for Check Processing Machines, Proceeding of IEEE},  		 			Y Yasuda 		,  		 			M Dubois 		,  		 			T S Huang 		.  		1980. 68 p. .  	 
\bibitem[Palumbo et al. ()]{b63}\label{b63} 	 		‘Document image binarization: Evaluation of algorithms’.  		 			P W Palumbo 		,  		 			P Swaminathan 		,  		 			S N Srihari 		.  	 	 		\textit{Proc. SPIE Applications of Digital Image Proc., SPIE},  				 (SPIE Applications of Digital Image ., SPIE)  		1986. 697 p. .  	 
\bibitem[Venkatesh and Rosin ()]{b67}\label{b67} 	 		‘Dynamic Threshold Determination by Local and Global Edge Evaluation’.  		 			P L Venkatesh 		,  		 			Rosin 		.  	 	 		\textit{CVGIP: Graphical Models and Image Processing}  		1995. 57 p. .  	 
\bibitem[Eikvil et al. ()]{b38}\label{b38} 	 		 			T Eikvil 		,  		 			K Taxt 		,  		 			Moen 		.  		\textit{A fast adaptive method for binarization of document images, ICDAR'91, Int. Conf. On Document Analysis and Recognition},  				 (St. Malo)  		1991. p. .  	 
\bibitem[Sieracki et al. ()]{b45}\label{b45} 	 		‘Evaluation of automated threshold selection methods for accurately sizing microscopic fluorescent cells by image analysis’.  		 			M E Sieracki 		,  		 			S E Reichenbach 		,  		 			K L Webb 		.  	 	 		\textit{Applied and Environmental Microbiology}  		1989. 55 p. .  	 
\bibitem[Kamel and Zhao ()]{b47}\label{b47} 	 		‘Extraction of Binary Character/Graphics Images From Grayscale Document Images’.  		 			M Kamel 		,  		 			A Zhao 		.  	 	 		\textit{Graphical Models and Image Processing},  				1993. 55 p. .  	 
\bibitem[Fernandez ()]{b82}\label{b82} 	 		 			X Fernandez 		.  		\textit{Implicit model oriented optimal thresholding using Kolmogorov-Smirnov similarity measure, ICPR'2000: Int. Conf. Pattern Recognition},  				 (Barcelona)  		2000.  	 
\bibitem[Anderson et al.]{b6}\label{b6} 	 		‘FPGA implementation of graph cut based image thresholding’.  		 			J Anderson 		,  		 			M Gundam 		,  		 			A Joginipelly 		,  		 			D Charalampidis 		.  	 	 		\textit{System Theory (SSST), 2012 44th Southeastern Symposium on Page(s)},  				p. .  	 
\bibitem[Anderson et al. ()]{b5}\label{b5} 	 		\textit{FPGA implementation of graph cut based image thresholding},  		 			J Anderson 		,  		 			M Gundam 		,  		 			A Joginipelly 		,  		 			D Charalampidis 		.  		2012. Page(s: SSST. p. .  	 
\bibitem[Aggelos and Katsaggelos ()]{b52}\label{b52} 	 		‘Framework foe efficient optimal multilevel image thresholding’.  		 			K Aggelos 		,  		 			Katsaggelos 		.  	 	 		\textit{J. Electron. Imaging}  		2009.  	 
\bibitem[Salim and Salman ()]{b71}\label{b71} 	 		‘Fuzzy gradient based image reconstruction as a means for detection the tampering’.  		 			S R Salim 		,  		 			H M Salman 		.  	 	 		\textit{Computer Science and Electronic Engineering Conference (CEEC)}  		2014. p. .  	 
\bibitem[Trier and Jain ()]{b59}\label{b59} 	 		‘Goal-directed evaluation of binarization methods’.  		 			O D Trier 		,  		 			A K Jain 		.  	 	 		\textit{IEEE Tran. Pattern Analysis and Machine Intelligence}  		1995. p. .  	 
\bibitem[Bock et al. ()]{b61}\label{b61} 	 		‘Gray-scale ALIAS’.  		 			R Bock 		,  		 			R Klinnert 		,  		 			R M Kober 		,  		 			H Rovner 		,  		 			Schmidt 		.  	 	 		\textit{IEEE Trans. on Knowledge and Data Processing}  		1992. 4 p. .  	 
\bibitem[Deravi ()]{b16}\label{b16} 	 		‘Grey level thresholding using second-order statistics’.  		 			S K Deravi 		.  	 	 		\textit{Pattern Recognition Letters}  		1983.  (1)  p. .  	 
\bibitem[Kamada and Fujimoto ()]{b24}\label{b24} 	 		‘High-speed, high-accuracy binarization method for recognizing text in images of low spatial resolution’.  		 			K Kamada 		,  		 			Fujimoto 		.  	 	 		\textit{ICDAR'99, Int. Conf. On Document Analysis and Recognition},  				 (Ulm, Germany)  		1999. p. .  	 
\bibitem[Weszka and Rosenfeld ()]{b30}\label{b30} 	 		‘Histogram Modification for Threshold Selection’.  		 			J Weszka 		,  		 			A Rosenfeld 		.  		 SMC-9.  	 	 		\textit{IEEE Trans. System, Man and Cybernetics}  		1979. p. .  	 
\bibitem[Murthy and Pal ()]{b55}\label{b55} 	 		‘histogram thresholding by minimizing graylevel fuzziness’.  		 			C A Murthy 		,  		 			S Pal 		.  	 	 		\textit{Information Sciences}  		1992. 60 p. .  	 
\bibitem[Zhengbiaobai ; Zhengcun and Liu ()]{b54}\label{b54} 	 		‘Image thresholding based on edge information analysis’.  		 			Zhengbiaobai ; Zhengcun 		,  		 			Liu 		.  	 	 		\textit{Image and Signal Processing}  		2012. p. .  	 	 (CISP). 5th International Congress on Page(s) 
\bibitem[Lei ()]{b41}\label{b41} 	 		‘Image thresholding based on maximum mutual information’.  		 			Bangjun Lei 		.  	 	 		\textit{7th International Congress on 2014},  				 (Page(s)  		2014. p. .  	 	 (CISP)) 
\bibitem[Oh and Lindquist ()]{b76}\label{b76} 	 		‘Image thresholding by indicator kriging’.  		 			W Oh 		,  		 			B Lindquist 		.  	 	 		\textit{IEEE Trans. Pattern Analysis and Machine Intelligence}  		1999. p. .  	 
\bibitem[Sezgin and Sankur ()]{b43}\label{b43} 	 		\textit{Image Thresholding Techniques: Quantitative Performance Evaluation, submitted to Pattern Recognition},  		 			B Sezgin 		,  		 			Sankur 		.  		2001.  	 
\bibitem[Wang]{b81}\label{b81} 	 		‘Image Thresholding Using Graph Cuts" Systms, Man and Cybernetics, Part A: Systems and Humans’.  		 			Desheng Wang 		.  	 	 		\textit{IEEE Transactions on}  		p. .  	 	 (Issue: 5 Page(s) 
\bibitem[Yumusak et al. ()]{b87}\label{b87} 	 		‘Image thresholding using measures of fuzziness’.  		 			N Yumusak 		,  		 			F Temurtas 		,  		 			O C?rezci 		,  		 			S Pazar 		.  	 	 		\textit{IECON '98. Proceedings of the 24th Annual Conference of the IEEE},  				 (Page(s)  		1998. p. .  	 
\bibitem[Arifin et al. ()]{b7}\label{b7} 	 		‘Image thresholding using ultra fuzziness optimization based on type II fuzzy sets’.  		 			A Z Arifin 		,  		 			A F Heddyanna 		,  		 			H Studiawan 		.  	 	 		\textit{Communications, Information Technology, and Biomedical Engineering}  		2009. p. .  		 			ICICI-BME 		 	 	 (Instrumentation. International Conference on Page(s) 
\bibitem[Solihin and Leedham ()]{b85}\label{b85} 	 		‘Integral ratio: A new class of global thresholding techniques for handwriting images’.  		 			Y Solihin 		,  		 			C G Leedham 		.  	 	 		\textit{IEEE Trans Pattern Recognition and Machine Intelligence}  		1999. p. .  	 
\bibitem[Leung and Lam ()]{b13}\label{b13} 	 		 			C K Leung 		,  		 			F K Lam 		.  		\textit{Maximum a Posteriori Spatial Probability Segmentation, IEE Proc. Vision, Image and Signal Proc},  				1997. 144 p. .  	 
\bibitem[Lulu Fang ; YaobinZou ; Fangmin Dong ; Shuifa Sun]{b40}\label{b40} 	 		\textit{Lulu Fang ; YaobinZou ; Fangmin Dong ; Shuifa Sun},  				 	 
\bibitem[Vajda ()]{b75}\label{b75} 	 		‘Mathematical Modelling and Simulation of Industrial and Economic Processes’.  		 			F Vajda 		.  	 	 		\textit{IEE Colloquium on}  		1994.  	 	 (Techniques and trends in digital image processing and computer vision) 
\bibitem[Brink and Pendock ()]{b2}\label{b2} 	 		‘Minimum Cross Entropy Threshold Selection’.  		 			A D Brink 		,  		 			N E Pendock 		.  	 	 		\textit{Pattern Recognition}  		1996. 29 p. .  	 
\bibitem[Brink ()]{b1}\label{b1} 	 		‘Minimum spatial entropy threshold selection, IEE Proeeding of Vis’.  		 			A D Brink 		.  	 	 		\textit{Image Signal Processing}  		1995. 142 p. .  	 
\bibitem[Cuevas ()]{b89}\label{b89} 	 		‘Multilevel image thresholding using relative entropy and Virus Optimization Algorithm’.  		 			J Cuevas 		,  		 			JR 		.  	 	 		\textit{Evolutionary Computation (CEC)}  		2012. IEEE Congress on Page. p. .  	 
\bibitem[Hertz and Schafer ()]{b91}\label{b91} 	 		‘Multilevel thresholding using edge matching’.  		 			L Hertz 		,  		 			R W Schafer 		.  	 	 		\textit{Computer vision graphics and image processing},  				1988. 44 p. .  	 
\bibitem[Chin et al. (2010)]{b10}\label{b10} 	 		‘Multiobjective optimization approaches in image segmentation-the directions and challenges’.  		 			Bong Chin 		,  		 			- Wei 		,  		 			Mandava Rajeswari 		.  	 	 		\textit{Int. J. Advance. Soft Comput. Appl}  		March 2010. 2  (1) .  	 
\bibitem[Othman and Tizhoosh]{b60}\label{b60} 	 		‘Neural image thresholding with SIFT-Controlled gabor features’.  		 			A A Othman 		,  		 			H R Tizhoosh 		.  	 	 		\textit{The 2011 International Joint Conference on 2011},  				 (Page(s)  		p. .  	 
\bibitem[Chang et al. ()]{b34}\label{b34} 	 		‘New Automatic Multi-level Thresholding Technique for Segmentation of Thermal Images’.  		 			J S Chang 		,  		 			H Y M Liao 		,  		 			M K Hor 		,  		 			J W Hsieh 		,  		 			M Y Chern 		.  	 	 		\textit{Image Vision and Computing}  		1997. 15 p. .  	 
\bibitem[Saha and Udupa ()]{b70}\label{b70} 	 		‘Optimum image thresholding via class uncertainty and region homogeneity’.  		 			P K Saha 		,  		 			J K Udupa 		.  	 	 		\textit{Pattern Analysis and Machine Intelligence}  		2001. p. 7.  	 	 (IEEE Transactions on) 
\bibitem[Fekete et al. ()]{b18}\label{b18} 	 		‘Relaxation: Evaluation and Applications’.  		 			J O Fekete 		,  		 			A Eklundh 		,  		 			Rosenfeld 		.  	 	 		\textit{IEEE Transactions on Pattern Analysis and Machine Intelligence}  		1981.  (4)  p. .  	 
\bibitem[Venkatesh ()]{b92}\label{b92} 	 		\textit{Rosin, threshold determintion by 83. local and global edge evaluation, CVIP: Graphical models and image processing},  		 			S Venkatesh 		,  		 			PI 		.  		1995. 57 p. .  	 
\bibitem[Chen and Takagi ()]{b14}\label{b14} 	 		‘Run length coding based new approach to automatic image thresholding" Circuits and Systems’.  		 			T Chen 		,  		 			M Takagi 		.  	 	 		\textit{IEEE International Symposium on Page(s)},  				1993. 1993. 1 p. .  	 	 (ISCAS '93) 
\bibitem[Aviad and Lozinskii ()]{b90}\label{b90} 	 		‘Semantic thresholding’.  		 			Z Aviad 		,  		 			E Lozinskii 		.  	 	 		\textit{Pattern Recognition Letters}  		1987. 5 p. .  	 
\bibitem[Nakagawa and Rosenfeld ()]{b84}\label{b84} 	 		‘Some experiments on variable thresholding’.  		 			Y Nakagawa 		,  		 			A Rosenfeld 		.  	 	 		\textit{Pattern Recognition}  		1979. 11  (3)  p. .  	 
\bibitem[Fan et al. ()]{b27}\label{b27} 	 		‘Spatiotemporal segmentation for compact video representation’.  		 			J Fan 		,  		 			G Yu 		,  		 			T Fujita 		,  		 			L Onoye 		,  		 			I Wu 		,  		 			Shirakawa 		.  	 	 		\textit{Signal Processing: Image Communication}  		2001. 16 p. .  	 
\bibitem[Abak et al. ()]{b74}\label{b74} 	 		‘The Performance of Thresholding Algorithms for Optical Character Recognition’.  		 			T Abak 		,  		 			U Bar?? 		,  		 			B Sankur 		.  	 	 		\textit{Int. Conf. on Document Analysis and Recognition: ICDAR'97},  				 (Ulm., Germany)  		1997. p. .  	 
\bibitem[Weszka and Rosenfeld ()]{b35}\label{b35} 	 		‘Threshold evaluation techniques’.  		 			J S Weszka 		,  		 			A Rosenfeld 		.  		 SMC-8.  	 	 		\textit{IEEE Trans. Systems, Man and Cybernetics}  		1978.  (8)  p. .  	 
\bibitem[Pavlidis ()]{b73}\label{b73} 	 		‘Threshold selection using second derivatives of the gray-scale image’.  		 			Pavlidis 		.  	 	 		\textit{ICDAR'93, Int. Conf. On Document Analysis and Recognition},  				1993. South Korea. p. .  	 
\bibitem[Thresholding]{b22}\label{b22} 	 		 			Thresholding 		.  		\textit{Digital Image Processing},  				Pearson Education. p. .  	 
\bibitem[Gallo and Spinello ()]{b19}\label{b19} 	 		‘Thresholding and fast iso-contour extraction with fuzzy arithmetic’.  		 			S Gallo 		,  		 			Spinello 		.  	 	 		\textit{Pattern Recognition Letters}  		2000. 21 p. .  	 
\bibitem[Rosenfeld and Smith ()]{b0}\label{b0} 	 		‘Thresholding Using Relaxation’.  		 			R Rosenfeld 		,  		 			Smith 		.  	 	 		\textit{IEEE Transactions on Pattern Analysis and Machine Intelligence}  		1981. 3 p. .  	 
\bibitem[Velasco ()]{b17}\label{b17} 	 		‘Thresholding using the Isodata Clustering Algorithm’.  		 			F R D Velasco 		.  		 SMC-10.  	 	 		\textit{IEEE Trans. System Man and Cybernetics}  		1980. p. .  	 
\bibitem[Yang et al. ()]{b23}\label{b23} 	 		 			Guang Yang 		,  		 			Kexiong Chen 		,  		 			Maiyu Zhou 		,  		 			Yongtian Zhonglinxu 		,  		 			Chen 		.  	 	 		\textit{Study on Statistics Iterative Thresholding Segmentation Based on Aviation Image" Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing},  				2007.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
