\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={Active Contours and Image Segmentation: The Current State of the Art},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

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

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


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

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

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2012-03-15 (revised: 15 March 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-03-15}
\title{Active Contours and Image Segmentation: The Current State of the Art}
\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]{D.  Baswaraj}

             \author[2]{Dr. A.  Govardhan}

             \affil[1]{  Jawaharlal Nehru Technological University, Hyderabad.}

\renewcommand\Authands{ and }

\date{\small \em Received: 11 February 2012 Accepted: 3 March 2012 Published: 15 March 2012}

\maketitle


\begin{abstract}
        


Image segmentation is a fundamental task in image analysis responsible for partitioning an image into multiple sub-regions based on a desired feature. Active contours have been widely used as attractive image segmentation methods because they always produce sub-regions with continuous boundaries, while the kernel-based edge detection methods, e.g. Sobel edge detectors, often produce discontinuous boundaries. The use of level set theory has provided more flexibility and convenience in the implementation of active contours. However, traditional edge-based active contour models have been applicable to only relatively simple images whose sub-regions are uniform without internal edges. Here in this paper we attempt to brief the taxonomy and current state of the art in Image segmentation and usage of Active Contours.

\end{abstract}


\keywords{Active Contours, Snakes, Level Sets.}

\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
n most image study operations, example classifiers need individual objects to be divided from the image, so the explanation of those objects can be transformed into a proper structure for computer processing. Image segmentation is a basic task, responsible for the separating process. The function of segmentation is to dividing an image into its basic and disjoint sub-regions, which are identical according to their property, e.g. intensity, color, and quality. Segmentation algorithms are usually based on either discontinuity with sub regions, i.e. edges, or equality within a sub-region, though there are a few segmentation algorithms depends on both discontinuity and equality.\par
The difference between image segmentation and sample classification is often not clear. The purpose of segmentation is simply to divide an image into several sub-regions, while the role of sample classification is to identify the partitioned sub-regions. Thus, segmentation and sample classification generally functions as individual and sequential process as shown in table 1.1.\par
However, they might work as an integrated procedure as shown in table 1.2 depending on the image study problem and the performance of the segmentation process. In both way, segmentation significantly affects the outcome of pattern classification, and frequently determines the ultimate success or failure of the image analysis. Since segmentation is an essential job in image analysis, it is involved in mainly image analysis applications, mostly those connected to pattern classification, e.g. medical imaging, remote sensing, security surveillance, military object detection. The stage to which segmentations carried depends on the difficulty being solved. That is, segmentation should end when the region of interest (ROI) in the function have been isolated. Due to this property of trouble dependence, independent segmentation is one of the mainly difficult tasks in image study. Noise and mixed pixels cause by the poor resolution of sensor images create the segmentation problem even more complex. In this document, we recommend novel segmentation methods with a variation framework called active contours.\par
Active contours are connectivity-preserving relaxation \hyperref[b12]{[10]} methods, valid to the image segmentation problems. Active contours have been used for image segmentation and boundary tracking since the first introduction of snakes by Kass et al. \hyperref[b13]{[11]}. The fundamental idea is to start with first boundary shapes represented in a type of closed curves, i.e. contours, and iteratively change them by applying shrink/expansion operations according to the constraints of images. Those shrink/expansion operations, called contour evolution, are done by the minimization of an energy function like fixed regionbased segmentation methods or by the simulation of a geometric fractional differential equation (PDE) \hyperref[b14]{[12]}. An benefit of dynamic contours as image segmentation methods is that they dividing an image into sub-regions with continuous boundaries, while the border detectors based on threshold or local filtering, e.g. Canny \hyperref[b15]{[13]} or Sobel operator, regularly result in irregular boundaries. Apply of level set theory has provided more flexibility and convenience in the completion of active contours. Depending on the implementation method, active contours can use diverse properties used for other segmentation methods such as edges, statistics, and texture. In this paper, the proposed active contour models using the statistical information of image intensity inside a sub-region. 
\section[{II.}]{II.} 
\section[{Image Segmentation using Active contours: the Taxonomy}]{Image Segmentation using Active contours: the Taxonomy}\par
There are two major approaches in image segmentation: edge-and region-based. Edge based segmentation partitions an image based on discontinuities with sub-regions, while region-based segmentation does the similar function based on the uniformity of a desired property within a sub-region. In this chapter, we briefly discuss existing image segmentation technologies as background. 
\section[{a) Edge-based Segmentation}]{a) Edge-based Segmentation}\par
Edge-based segmentation looks for discontinuities in the intensity of an image. It is more likely edge detection or boundary detection rather than the exact meaning of image segmentation. An edge can be defined as the border between two regions with relatively separate properties. The assumption of edgebased segmentation is that every sub-region in an image is sufficiently uniform so that the transition between two sub-regions can be determined on the basis of discontinuities alone. When this statement is not valid, region-based segmentation, discussed in the next section, regularly provides more reasonable segmentation outcome. Basically, the idea underlying most edge-detection techniques is the computation of a local derivative operator.\par
Edge detection by gradient operations usually works well only in the images with sharp intensity transitions and relatively low noise. Due to its sensitivity to noise, various smoothing operation is usually essential as preprocessing, and the smoothing effect consequently blurs the edge information. However, the computational cost is comparatively lower than other segmentation methods because the computation can be complete by a local filtering operation, i.e. convolution of an image with a kernel. 
\section[{b) Region-based Segmentation}]{b) Region-based Segmentation}\par
Region-based segmentation looks for equality inside a sub-region, based on a desired property, e.g. intensity, color, and texture. Clustering techniques encountered in pattern classification literature have related objectives and can be applied for image segmentation \hyperref[b16]{[14]}.Region rising \hyperref[b17]{[15]} is a technique that merges pixels or small sub-regions into a bigger sub region. The simplest implementation of this approach is pixel aggregation \hyperref[b21]{[19]}, which starts with a set of seed points and grows regions from these seeds by appending nearby pixels if they satisfy the given criteria.\par
Additional criteria that use properties to raise the regions lead area growing into more sophisticated methods, e.g. region competition. Region competition \hyperref[b18]{[16,}\hyperref[b19]{17]} merges neighboring sub-regions under criteria involving the equality of regions or sharpness of boundaries. Strong criteria tend to generate oversegmented results, while weak criteria lean to produce poor segmentation outcome by over-merging the subregions with blurry boundaries. An alternative of region rising is split-and-merge \hyperref[b20]{[18]}, which partitions an image firstly into a set of arbitrary, disjointed sub-regions, and then combine and/or split the sub-regions in an attempt to satisfy the segmentation criteria. 
\section[{c) Active Contours}]{c) Active Contours}\par
The method of active contours has become quite popular for a range of applications, mainly image segmentation and motion tracking, through the last decade. This methodology is based upon the use of deformable contours which match to various object shapes and motions. This section provides a theoretical setting of active contours and an indication of existing active contour methods. There are two main approaches in active contours based on the mathematic implementation: snakes and level sets. Snakes explicitly shift predefined snake points based on an energy minimization method, while level set approaches move contours completely as a particular level of a function.\par
As image segmentation methods, there are two kinds of active contour models according to the force evolving the contours: edge-and region-based. Edge- 
\section[{Year}]{Year}\par
Despite the simple character of the algorithm, there are basic problems in region rising: the selection of initial seeds and suitable properties to grow the regions. Selecting initial seeds can be frequently based on the character of applications or images. For example, the ROI is generally brighter than the background in IR images. In this case, choosing bright pixels as initial seeds would be a suitable choice.\par
Volume XII Issue XI Version I based active contours apply an edge detector, typically based on the image gradient, to locate the boundaries of sub-regions and to draw the contours to the detected boundaries. Edge-based approaches are closely connected to the edge-based segmentation. Regionbased active contours apply the statistical information of image intensity inside each subset instead of searching geometrical boundaries. Region-based approaches are also closely connected to the region-based segmentation. 
\section[{d) Snakes}]{d) Snakes}\par
The initial model of active contour was proposed by Kass et al. \hyperref[b13]{[11]} and named snakes suitable to the appearance of contour evolution.\par
Solving the problem of snakes is to locate the contour C that minimizes the total energy term E with the certain set of weights? , ? , and ? . In numerical experiments, a set of snake points residing on the image plane are defined in the first stage, and then the next location of those snake points are determined by the local minimum E. The associated form of those snake points is considered as the contour. Figure  {\ref 2}.1 shows an example of classic snakes \hyperref[b22]{[20]}. There are about 70 snakes points in the image, and the snake points form a contour around the moth. The snakes points are firstly placed at more distance from the boundary of the object, i.e. the moth. Then, every point moves towards the optimum coordinates, where the energy utility converges to the minimum. The snakes points ultimately stop on the boundary of the object.\par
The classic snakes give an perfect location of the edges only if the first contour is given sufficiently near the edges because they make use of only the local information along the contour. Estimating a correct position of first contours without prior knowledge is a complex problem. Also, classic snakes cannot detect more than one boundary concurrently because the snakes maintain the equal topology throughout the evolution stage. That is, snakes cannot divide to several boundaries or combine from multiple first contours. Level set theory \hyperref[b14]{[12]} has given a result for this problem. ? ? ? ? defined on the image plane. The function ( , )\par
x y ? is called level set function, and a particular level, generally the zero level, of ( , )\par
x y ? is defined as the contour. f) Edge-based Active Contours Edge-based active contours are strongly connected to the edge-based segmentation. Most edge based active contour models consist of two parts: the regularity part, which determines the form of contours, and the edge recognition part, which attracts the contour towards the boundaries. Edge-based active contour models have a little disadvantages compared to the region-based active contour models, discussed in the next section. Because of the constant term, edgebased active contour models evolve the contour towards only one way, each inside or outside. Therefore, an primary contour must be placed completely inside or outside of ROI, and some level of a previous knowledge is still necessary .Also, edge-based active contours inherit a few disadvantages of the edge-based segmentation methods due to the parallel method used. Since both edge-based segmentation and edge-based active contours rely on the image gradient process, edge-based active contours may omit the blurry boundaries, and they are sensitive to local minima or noise as edge-based segmentation does. Gradient vector flow quick geodesic dynamic contours \hyperref[b23]{[21,}\hyperref[b24]{22]} proposed by Paragios replaced the border detection (boundary attraction) word with gradient vector field \hyperref[b25]{[23,}\hyperref[b26]{24,}\hyperref[b27]{25,}\hyperref[b28]{26,}\hyperref[b29]{27]}, that refers to a spatial diffusion of the boundary information and guides the propagation to the object boundaries from equally sides, to give extra freedom from the restriction of first contour position. 
\section[{g) Region-based Active Contours}]{g) Region-based Active Contours}\par
Most region-based active contour models consist of two parts: the regularity part, which determines the smooth form of contours, and the energy minimization part, which searches for equality of a preferred feature within a subset. A good characteristic of region-based active contours is that the first contours can be situated anyplace in the image as region-based segmentation relies on the global energy minimization rather than local energy minimization. Therefore, less previous knowledge is required than edge-based active contours.\par
Although usual region-based active contours partition an image into several sub regions, those several regions belong to only two subsets: both the inside or the outside of contours. Chan and Vese proposed multi-phase active contour model \hyperref[b30]{[28,}\hyperref[b31]{29,}\hyperref[b32]{30,}\hyperref[b33]{31,}\hyperref[b34]{32]}, which increases the amount of subsets that active contours can locate simultaneously. Multiple active contours evolve independently based on the piecewise-constant model or the piecewise-smooth Due to the global energy minimization; regionbased active contours usually do not have any restriction on the placement of first contours. That is, region-based active contour can detect interior boundaries regardless of the position of initial contour.\par
That is, region-based active contour can detect inner boundaries regardless of the position of initial contours. The use of pre-defined initial contours provides a method of independent segmentation. Also, they are less responsive to local minima or noise than edge-based active contours. However, due to the supposition of uniform image intensity, most methods are relevant only to images where each subset is stand for able by a simple expression, e.g. single Gaussian distribution or a constant. If a subset, i.e. class, consists of multiple distinguishing sub-classes, these methods would produce over-segmented or under-segmented results. We propose novel region-based active contour models which produce better results using multivariate mixture density functions. 
\section[{h) Active Contours integrating Edge-and Regionbased Segmentation}]{h) Active Contours integrating Edge-and Regionbased Segmentation}\par
In order to develop the segmentation performance, the integration of edge-and region based information sources using active contours has been proposed by a few authors. Geodesic active region is a supervised active contour model, proposed by Paragios \hyperref[b35]{[33,}\hyperref[b36]{34,}\hyperref[b37]{35]}, integrating edge-and region-based segmentation module in an energy function. A statistical analysis based on the Minimum Description Length (MDL) measure and the Maximum Likelihood (ML) principle for the observed density function, i.e. an image histogram, indicates the number of sub-regions and the statistical PDF within those sub-regions using a mixture of Gaussian elements. Regional probability is estimated from the statistical PDF based on previous knowledge, i.e. training samples. Then, the margin information is resolute by a probabilistic edge detector, expected from the regional probabilities of neighborhood \hyperref[b38]{[36,}\hyperref[b39]{37]}. For example, an image pixel is more likely an edge pixel if the neighborhood pixels, located on the opposed sides, have high regional probabilities for a different class.\par
The geodesic active region model is later useful to a medical imaging problem \hyperref[b40]{[38,}\hyperref[b41]{39]} with a gradient vector flow-based boundary factor. The approach was based on a joined propagation of two active contours, and integrates visual information with anatomical constraints.\par
Jehan-Besson et al. also proposed an active contour model \hyperref[b42]{[40,}\hyperref[b43]{41]} minimizing an energy criterion concerning both region and boundary functional. These functional are consequent through a shape derivative approach as an alternative of classical calculus of variation. They focus on statistical property, i.e. the PDF of the color histogram of a sub-region. Active contours are propagated minimizing the distance between two histograms for corresponding or tracking purposes. 
\section[{III.}]{III.} 
\section[{Current State Of the Art}]{Current State Of the Art}\par
In order to overcome the difficulties caused by various intensity in Image segmentation,  {\ref Chunming}  Observation: Chunming Li et al \hyperref[b0]{[1]} presented a new region-based active contour model that draws upon intensity information in local regions at a convenient scale to segment images with various intensity, and has advantageous performance for images with weak object limits. To ensure exact computation and avoid expensive repeated initialization procedures in promptness of the level set function, the authors succeed by introducing the level set regularization term in the proposed level set formulation.\par
In the research area of multi agent IVUS image segmentation, Bovenkamp et al \hyperref[b2]{[2]} introduced a novel User-Agent Cooperation methodology, which initiated the expert communication with a multi-agent image interpretation system using only a limited vocabulary of high-level user communications. The aim is to minimize the influence of expert's views those encouraging the variations in image segmentation. This model is attempting to do this by keeping the total number of communications as low and simple as possible. The multi-agent image interpretation system has complicated high-level knowledge-based control over low-level image segmentation algorithms. The user, in turn, can correct, supplement, and/or confirm the results of image-processing agents. High-level communication thereby replaces more conventional contour correction methods like inserting points and/or (re)drawing contours. The system has been applied to intravascular ultrasound (IVUS) images. semi-automatic system with low-level user communication. With comparatively few (2-3) high-level 
\section[{Year}]{Year}\par
Here in this model proposed by Bovenkamp et al \hyperref[b2]{[2]}, agents use the moving-average of the crosssectional lumen and vessel area to estimate when user communication is required. When a newly found result is within limits of this moving-average, the new result is unspecified to be ok, and the user is not consulted. Otherwise the user is asked to confirm that a result is not-ok and should, for instance, actually be much-larger. The terms ok, not-ok, and much-larger are instances of the formalized and high-level communication vocabulary between agents and user. Possible agent-user communications in differing situations are listed in Table  {\ref I}, while Table II lists agent-user communications when image-processing results are not trusted or need to be quantified.\par
The tables show which choices can be presented to the user by the agent and list the possible specifications of each choice as well as the result it will have on the agent.\par
Observation: Bovenkamp et al \hyperref[b2]{[2]} aimed to found whether it is possible to get more accurate, reproducible results in an professional manner with only a limited set of high-level user communications. And also aimed to introduce agents those regularly adjust their behavior by learning from these communications such that less user interference may be necessary. As a result it was observed that this leads to minimal variations due to expert's role in segmentation and increased ability of repeats and effectiveness. It has been shown that with only high-level user communication in a multi-agent IVUS image segmentation system it is possible to obtain results which are at the least competitive with a committed  Srinivasa, G et al \hyperref[b3]{[3]} proposed an active mask algorithm for the segmentation of fluorescence microscope images of punctate patterns. In order to develop this algorithm, Srinivasa, G et al \hyperref[b3]{[3]} considered active-contour methods for their flexibility, multi resolution methods due to their magnitude speed, multiscale methods by considering their efficiency in smoothing, and region-growing methods for their statistical modeling. The framework developed as top layer of the algorithm proposed moves from the idea of the ldquo contour rdquo to that of ldquo inside and outside, rdquo or masks, allowing for easy multidimensional segmentation. The framework was aimed to adapt the topology of the image through the use of several masks. To claim the benefit of the algorithm proposed, Srinivasa, G et al \hyperref[b3]{[3]} argued that since a fluorescent microscope images the cells by revealing the specimen with light of a specific wavelength, exciting the fluorescent probes to emit light of a longer wavelength; a CCD camera records photon emissions resultant in a digital image. As only some parts of the sample are tagged and the tagging is not uniform, the resulting image looks like a allocation of bright dots on a dark background, a punctate pattern. Hence they focused on images in which such patterns represent individual cells in a multi cell specimen.\par
The algorithm is almost invariant under initialization, allowing for random initialization, and uses a few easily tunable parameters. Experiments show that the active mask algorithm matches the ground truth well and outperforms the algorithm widely used in fluorescence microscopy, seeded watershed, both qualitatively, as well as quantitatively.\par
? Difficulty in identifying the contour in a digital images ? Updating the level set function in active-contour algorithms, which is ineffective and slow. ? Difficulty in reconstructing the level set function in the multi resolution version? ? Difficulty in protect topology during Updating in large increments in the multiscale version.\par
Observation: Srinivasa, G et al \hyperref[b3]{[3]} worked on fluorescence microscope images of punctate patterns, and assume that: (a) the statistical properties of the foreground (cell) and background are distinct and relatively uniform; (b) the foreground is bright, while the background is dark. The first assumption is crucial, the second not at all; one can easily change the algorithm should the position be reversed in another modality (such as bright field microscopy). Thus, in this proposal, the authors are basically looking for two different statistical models in the image (foreground and background). We note, however, that the techniques existing here may be generalized to the case of more models. The proposed new algorithm termed as active mask segmentation that designed for segmentation of fluorescence microscope images of punctate patterns, a large class of data. It seems to disappear from the idea of the contour and instead uses that of a mask, as well as several masks. The algorithm easily performs multidimensional segmentation, can be initialized with random seeds, and uses a few easily tunable parameters.\par
Wenxian Yang et al \hyperref[b4]{[4]} proposed a constrained random walks algorithm that facilitates the use of three types of user inputs: 1) foreground and background seed input, 2) soft constraint input, and 3) hard constraint input, as well as their combinations. To support the context of their research model Wenxian Yang et al \hyperref[b4]{[4]} argued that one common fault in the existing interactive image segmentation algorithms is the lack of more intellectual ways to understand the intention of user inputs.\par
The foreground and background seed input of the proposed model is meant to allow a user to draw strokes to specify foreground and background seeds. The soft constraint input is meant to allow a user to draw strokes to point out the region that the boundary should pass through. The hard constraint input meant to allow a user to specify the pixels that the boundary must align with. The proposed method attempted to support all three types of user inputs in one logical computational framework consisting of a constrained random walks and a local editing algorithm, which would allow more accurate contour refinement. This proposed model formulates the segmentation problem on a graph, where each node represents a pixel and neighboring nodes are linked with undirected edges. In particular, a graph is represented by its vertices and edges also integrate two other types of user inputs as constraints into the random walks algorithm. We call such an extension as constrained random walks. In particular, boundary brush strokes that roughly mark parts of the boundary are introduced as the soft constraint. A vertex on which the soft constraint is forced has the property that the difference between its probability and 1/2 is within a small given range (-e, e). The second type of user inputs, boundary pixel selector, 
\section[{Year}]{Year}\par
With issues rose in order to segment fluorescence microscope images such as( D D D D ) F 2012\par
which selects pixels on the desired contour, is introduced as the hard constraint. A vertex on which the hard constraint is imposed has a probability of 1/2.\par
Observation: The proposed model can be summarized as follows. First, the proposed constrained random walks algorithm together with the proposed local editing algorithm supports the three types of user inputs and their combinations in a coherent and unified framework. Second, the region prior term is integrated in the edge weights so that the proposed constrained random walks algorithm does not lose the connectivity property and is less demanding on the positions and quantities of the user input strokes than the original random walks algorithm \hyperref[b45]{[43]}. Third, the proposed local editing algorithm also allows additional local refinement to reach a satisfactory segmentation.\par
Ping-Feng Chen et al \hyperref[b5]{[5]} proposed a novel model to jointly segment and register objects of interest in layered images. Since the Layered images refer to imageries taken from different perspectives and possibly by different sensors, the registration and segmentation are therefore the two main tasks which contribute to the bottom level, data alignment, of the multi sensor data fusion hierarchical structures. In contrast to most exploitation of two layered images those assumed that scanners are at very high altitudes and that only one transformation ties the two images, the proposed model consider the data as taken at mid-range and therefore require segmentation in the process of examining different object regions in a divide-and-conquer fashion. The proposed multiphase joint segmentation by Ping-Feng Chen et al \hyperref[b5]{[5]} is a combination of multiphase method with a combined segmentation registration practice in short that referred as MPJSR agreed out in a local moving window earlier to a global optimization. To auxiliary address layered video sequence and tracking objects in frame, MPJSR is using a trouble-free adaptation of optical flow calculation along the lively contours in a pair of layered illustration sequences.\par
The related kind of works introduced former to MPJSR are delineating a intention of interest \hyperref[b46]{[44]}, mosaic king scenes \hyperref[b47]{[45]}, \hyperref[b48]{[46]}, and inclusion data \hyperref[b49]{[47]}. Techniques which jointly exploit the information from special sensors formally fall within data fusion \hyperref[b50]{[48]}. Data fusion incorporate a well-established categorization of "fusion levels" that groups different iterative processes of opposed maturity levels. The foundation level, i.e., 0level of "data alignment" \hyperref[b51]{[49]}, is the preprocessing, registration, and geo-registration of metaphors, which prepares the data for other blend levels. Image registration, which finds the correspondence or the transformation between two images \hyperref[b48]{[46]}, \hyperref[b52]{[50]}- \hyperref[b58]{[56]}, therefore contributes to this stage in the data fusion hierarchical structure.\par
Observation: Ping-Feng Chen et al \hyperref[b5]{[5]} have projected a joint segmentation and register method adapted to multiphase active contours (MPJSR) using a heartrending local window. By first resembling the detected object surface within a window in the basis and the reference images by planes, and then by evolving a m-phase active contour via the proposed joint segmentation-registration technique, The proposed MPJSR would able to 1) delineate an object of interest, 2) obtain the acquired transformations between two images. This method successfully segments and registers a pair of layered images, and moreover allows us to align segmented objects from one image to another, thus, achieving a 0-level data alignment stage in the data fusion hierarchy.\par
Figueiredo et al \hyperref[b7]{[6]} proposal expected to introduce a variational image segmentation method for assess the aberrant crypt foci (ACF) in the person colon captured in vivo by endoscopy. The proposed segmentation technique enhanced the active contours without edges model of Chan and Vese to account for the ACF's particular structure. Level sets to represent the segmentation boundaries and discretize in space by finite elements and in (artificial) time by fixed differences are employed. The model proposed by Figueiredo et al \hyperref[b7]{[6]} aimed to classify the ACF, their boundaries, and some of the internal crypts' orifices. Figueiredo et al \hyperref[b7]{[6]} suggestion focused on a fussy image processing method, for assess the ACF captured in vivo by endoscopy: image segmentation. This method consists in the dividing wall of the given image into put out of joint regions, representing distinct objects. Moreover, we use image segmentation methods based on partial differential equations, more exactly, active contours without edges (ACWEs) and level-set methods. These combine techniques of curve evolution (where the basic idea is to start with an initial curve in the image and to deform it to the boundaries of the objects in the image, and stop it there, see \hyperref[b59]{[57]}, \hyperref[b60]{[58]}, and \hyperref[b13]{[11]}), Mumford-Shah functional for image segmentation (an optimization problem to obtain a sliding doors of the given image into different regions, see \hyperref[b61]{[59]}) and level-set methods (essentially these consist in considering the problem in a higher measurement, such that the evolving curve is the zero level set of an unknown function; these methods allow cusps, corners, and usual topology changes, as merging and breaking curves, see \hyperref[b62]{[60]}, \hyperref[b63]{[61]}, and \hyperref[b64]{[62]}). We note that the expression "without edges" in "ACWEs" refers to the fact that in these models it is not used any edge-detector function, based on the gradient of the given image, to identify the different objects (the "edges," in an image, are the boundaries of the distinct objects, corresponding to the places where these objects meet). This latter property allows the model to segment images where there are no clear gradient boundaries, which is often the case for ACF endoscopic images.\par
Observation: The aid of the model proposed can be refer to enhancements of the  {\ref Chan}  Optical coherence tomography (OCT) is a noninvasive, depth-resolved imaging modality that has become a high up ophthalmic diagnostic technique. Yazdanpanah et al \hyperref[b8]{[7]} presented a semi-automated segmentation algorithm to detect intra-retinal layers in OCT images acquired from rodent models of retinal degeneration. The proposed segmentation technique was adapted Chan-Vese's energy-minimizing active contours without edges for the OCT images, which in turn suffered from low contrast and were highly tarnished by noise. Hence a multiphase scaffold with a circular shape prior was adopted in order to model the borders of retinal layers and educated guess the shape parameter using least squares. A related scheme was used to balance the weight of poles apart terms in the energy functional.\par
Observation: Earlier to the Yazdanpanah et al \hyperref[b8]{[7]} proposal, several robotic and semi-automated approaches have been employed in OCT segmentation \hyperref[b65]{[63]}- \hyperref[b74]{[72]}. Some method rely on pixel-level edge exposure algorithms \hyperref[b12]{[10]} or are based on performing a 1-D importance peak detection procedure for each Ascan \hyperref[b66]{[64]}- \hyperref[b68]{[66]}. These low-level approaches could potentially lead to the finding of not working restrictions and erroneous edges. Moreover, since OCT images are highly corrupted by speckle noise, these algorithms required preprocessing to reduce the effect of noise. The de-noising procedure, however, affects the sharpness of the edges, which subsequently reduces the segmentation appearance. In \hyperref[b69]{[67]} and \hyperref[b70]{[68]}, a Support Vector Machine (SVM) algorithm is used to perform segmentation of retinal layers. By deportment in mind the mean intensity of six neighbors at each voxel, the SVM approach can handle noisy OCT images. However, this approach is not only dependent on a user to mark a set of points for the rationale of training and segmentation but also fails to segment the layers accurately if the feature and environment points are not chosen properly. Further, SVM is computationally expensive and is not able to segment all layers at the same time. Garvin et al. \hyperref[b71]{[69]} and Haeker et al. \hyperref[b72]{[70]}, \hyperref[b73]{[71]} model the segmentation problem as finding the minimum s-t cut of a geometric graph. The cost function is the summation of an edge-based term and one or more region-based terms. They have developed a sequential approach to segment the intra retinal layers. First, the three easier-to-segment surfaces are found (upper surface of NFL and better and lower surfaces of OS). The position of the previous segmented surface is incorporated into the cost function to explain the remaining surfaces. The problem arises when the preceding surface are segmented inaccurately. This may result in an erroneous segmentation of the remaining surfaces. Recently, Garvin et al. \hyperref[b74]{[72]} have proposed an extension to their algorithm. By learning the surface feasibility constraints using a training set, they can segment the layers in two stages incorporating both the image edge and true regional information in the cost function. The residential iterative algorithm \hyperref[b8]{[7]} to segment OCT images of rodent retinal layers using a multi-phase framework with a rounded shape prior attempt to demonstrate that the approach is able to truthfully segment all of the intra-retinal layers, even when the small size and similar texture make them difficult to make a distinction visually. And also this model attempted to show that the inclusion of a shape prior constraint improves show on regions with intensity\par
The objective of the projected segmentation technique is to segment a given OCT image define on the image domain into R disjoint sub-regions, which exactly label the retinal layers. The decomposition of the image I will be modeled using the level set framework as a set of R?1 Signed Distance Functions (SDFs), ?. The distance function captures the distance from any point in the image province to the object limit and assigns this distance to that point's location. The SDF assigns opposite signs to the interior versus exterior of the object. Formally, the SDF is an implicit function with positive values in the interior region, negative values in the exterior region, and zero on the boundary with the property that ranges between 0 and 1. 
\section[{Year}]{Year}( D D D D ) F 2012\par
heterogeneity. This proposed segmentation technique backed with a contextual scheme to stability the weight of different terms in the energy functional, which seems to make the algorithm more robust when the image information is not sufficient to accurately detect the layers. This method is a region-based segmentation approach combining the intensity information and the implicit use of edge information, through the shape term, to improve the final segmentation accuracy.\par
Delu Zeng et al \hyperref[b9]{[8]} considered the task of object segmentation and achieve in a novel manner that backed by the Poincare? map method in a defined vector field in view of dynamical systems. An interpolated swirl and attract flow (ISAF) vector field is first generated for the observed image. Then, the states on the limit cycles of the ISAF are located by the convergence of Newton-Raphson sequences on the given Poincare? sections. Meanwhile, the periods of limit cycles are determined. Consequently, the objects' boundaries are represented by integral equations with the corresponding converged states and periods.\par
In this developed model \hyperref[b9]{[8]}, intially an interpolated swirling and attract flow (ISAF) field is generated by extending a so-called edge tangent flow (ETF) only with a nonzero value at the boundaries to the whole image domain. It is a static vector field. Different from traditional vector fields, the components in this vector field near the boundary are not making a corner but tangent to the boundary. Thus, in the proposed vector field, it is possible for evolution to be carried out along the boundaries. Then, the proposed time-invariant vector field is considered as the right-hand-side vectorvalued function of an autonomous dynamical system. As a result, the segmentation problem is translated to the problem of the limit cycle location by applying the related theory in dynamical systems. ISAF is composed of two components, namely, diffused ETF (DETF; swirling component) and diffused edge perpendicular Observation: The object segmentation is achieved in a novel manner by the Poincaré map method in the field of dynamical systems. First, for an observed image, an ISAF vector field is proposed, where there exist to swirling components (with fixed directions) near the object's borders. This is a key feature of the ISAF compared with the traditional vector field utilized in the ACM method. These swirling workings treated as limit cycles in view of dynamical systems correspond to the desired objects. Then, the Poincaré section and the corresponding Poincaré map for the ISAF are defined. Accordingly, given some initial states in the vector field, they naturally belong to the basins of attraction of the corresponding limit cycles. After that, the Newton-Raphson algorithm is utilized to locate the limit cycles via locating one point on each limit cycle. In the end, the objects' boundaries are represented by integral equations. Without using the time-consuming level-set methods like most of the ACMs, the proposed algorithm can achieve multipleboundary extraction by placing some initial states in the vector field. In addition, it runs more competently since the Newton-Raphson algorithm is carried out in the Poincaré section, a lower dimensional subspace of the image domain, while the long-established ACMs evolve the contour in the whole image area. 
\section[{IV.}]{IV.} 
\section[{Conclusion}]{Conclusion}\par
Active contour models (ACMs) integrated with various kinds of external force fields to pull the contours to the exact boundaries have shown their powerful abilities in object segmentation. However, local minimum problems still exist within these models. The current state of the art in image segmentation mostly cornered to furbish active contour models for domain specific image segmentation, more specific to medical images. The majority of the interactive approaches mainly targeting the accuracy of the segmentation process results. It is clearly evident that these interactive models probabilistic due to the role of the observers and in recent literature, it is hard to find interactive models with optimal resource utilization and computational efficiency. Hence the research scope in interactive image segmentation is optimistic. On other side the statistical and numerical analysis models introduced in recent literature are more specific to contextual issues of the domain to which the input images are belongs to. Hence it is clear evident of scope to perform research that introduce machine learning and data engineering approaches those can generalize the optimistic statistical and numerical methods to improve the computational performance and minimal resource usage in active contour based image segmentation. Year flow (DEPF; attracting component). DETF is given by the steady-state solution. However, in DETF, the degree of swirl (rotation) for the streamlines away from the boundary is too high; thus, the journeys are so long for the streamlines start away from the boundary to move to the boundary. In fact, it just need a flow field bearing the properties that its components away from the boundary would point directly to the boundary and its components near the boundary are tangent to the boundary with a fixed direction (either clockwise or counterclockwise). ETF is a thin flow affecting around the objects' boundaries with a fixed direction. It has components with a nonzero vector value near the boundaries and with a zero vector value to another place. \begin{figure}[htbp]
\noindent\textbf{21}\includegraphics[]{image-2.png}
\caption{\label{fig_1}Figure 2 . 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_2}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.47651515151515145\textwidth}P{0.3734848484848485\textwidth}}
\tabcellsep 1 : Medical imaging situation 1: an X-ray image\\
\multicolumn{2}{l}{of a hand segmentation and pattern classification as}\\
\tabcellsep sequential and separate actions\\
\multicolumn{2}{l}{Input data: an X-ray image of a hand}\\
\multicolumn{2}{l}{1. Segmentation: separate bones from the X-ray image.}\\
?\tabcellsep Supervised method: qualified features or sample data of\\
\tabcellsep bones are provided.\\
?\tabcellsep Unsupervised method: divide bright regions from the\\
\tabcellsep background.\\
?\tabcellsep Result: bones are extracted, but we do not know what\\
\tabcellsep kinds of bones they are.\\
\multicolumn{2}{l}{2. Shape description: explain the extracted bones in a form of}\\
\multicolumn{2}{l}{numerical features}\\
\multicolumn{2}{l}{3. Pattern classification: recognize each bone based on the}\\
\multicolumn{2}{l}{features}\\
\multicolumn{2}{l}{Output data: the character of bones, e.g. thumb, index finger, ring}\\
\multicolumn{2}{l}{finger, etc.}\end{longtable} \par
 
\caption{\label{tab_0}Table 1 .}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.3475\textwidth}P{0.5025\textwidth}}
\multicolumn{2}{l}{Input data: an MR image of a brain}\\
\multicolumn{2}{l}{1. Segmentation \& pattern classification: partition white}\\
\tabcellsep and gray matters in the MR image.\\
?\tabcellsep Supervised: trained features or sample data of\\
\tabcellsep white and gray Matters are provided.\\
?\tabcellsep Unsupervised: partition the brightest regions and\\
\tabcellsep brighter regions from the background.\\
\multicolumn{2}{l}{Output data: extracted white and gray matter.}\end{longtable} \par
 
\caption{\label{tab_1}Table 1 .}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.8392490118577075\textwidth}P{0.01075098814229249\textwidth}}
observed in the PS model.\tabcellsep \\
Li et\tabcellsep \\
al[1] proposed a region-based active contour model,\tabcellsep \\
that draws upon intensity information in local regions at\tabcellsep \\
a convenient scale. A data appropriate energy is defined in terms of a contour and two fitting functions that locally estimated the image intensities on the two sides of the\tabcellsep 2012\\
contour. This energy is then integrated into a dissimilar\tabcellsep \\
level set formulation with a level set regularization term,\tabcellsep \\
from which a curve development equation is derived for\tabcellsep \\
energy minimization. Due to a kernel function in the data\tabcellsep \\
fitting term, intensity information in local regions is\tabcellsep \\
extracted to guide the motion of the contour, which\tabcellsep \\
thereby enables our model to cope with dissimilar\tabcellsep \\
intensity. The Region Scalable Fitting Model consists\tabcellsep \\
fallowing phases, which are\tabcellsep \\
The authors are opted\tabcellsep \\
\tabcellsep D D D D ) F\\
\tabcellsep (\\
? Implementing Level Set Formulation: In contrast to\tabcellsep \\
Level set Formulation[42], to protect the reliability of\tabcellsep \\
the level set function , which is necessary for exact\tabcellsep \\
calculation and stable level set evolution, here an\tabcellsep \\
approach called level set regularization introduced\tabcellsep \\
that is part of different level set formulation. In this\tabcellsep \\
level set regularization, its gradient flow is used as\tabcellsep \\
the level set development equation that attempts to\tabcellsep \\
minimize the energy functional.\tabcellsep \end{longtable} \par
  {\small\itshape [Note: ? Energy Minimization: The proposed model is using standard gradient descent (or steepest descent) method to minimize the energy functional. ? Fitting Functions and Level Set Function regularization: The two fitting functions introduced here are different from the data fitting functions Year ? Introduction of nonnegative kernel function with Region-Scalable Fitting Energy. The choice of the kernel function is flexible, as long as it satisfies the above three basic properties. Gaussian kernel. The fitting energy defined in the following. First, considering a weighted mean square error of the estimate of the image intensities outside and inside the contour by the fitting values for x as center point, respectively, the result of the kernel function useful on x and y coordinate difference as weight assigned to intensity at selected y-coordinate. Second, due to the localization property of the kernel function, the contribution of the intensity of y-coordinate to the fitting energy decreases and approaches to zero as y-coordinate point goes away from the center point x. Therefore, the energy is dominated by the intensities of the points in a region of. In particular, the Gaussian kernel decreases considerably to zero as y-coordinate goes away from center point x.]} 
\caption{\label{tab_2}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{II} \par 
\begin{longtable}{P{0.0466030989272944\textwidth}P{0.8033969010727057\textwidth}}
\tabcellsep user communications per improvement, multi-agent\\
\tabcellsep IVUS image segmentation can significantly be improved,\\
\tabcellsep while the user is initiating corrective actions in only about\\
\tabcellsep 43\% (255 versus 594) of the cases when compared with\\
\tabcellsep the committed semi-automatic system. No image\\
\tabcellsep processing or agent knowledge is required of the user to\\
\tabcellsep correct image segmentation results. Experiments show\\
\tabcellsep that even when images are very difficult to segment,\\
\tabcellsep aggressive results can be obtained in this fashion.\\
2012\tabcellsep However, although enough for most cases limited control by the user over the segmentation process (only very high level) was sometimes too preventive to get to\\
\tabcellsep the desired result and is a source of observer errors.\\
6\tabcellsep \\
Volume XII Issue XI Version I\tabcellsep \\
D D D D ) F\tabcellsep \\
(\tabcellsep \\
\tabcellsep : Agent-User Interaction, initiated when an agent\\
\tabcellsep need user input during evaluation of image processing\\
\tabcellsep result\end{longtable} \par
 
\caption{\label{tab_4}Table II}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.05333333333333333\textwidth}P{0.7827777777777777\textwidth}P{0.005555555555555556\textwidth}P{0.0011111111111111111\textwidth}P{0.007222222222222221\textwidth}}
\tabcellsep \multicolumn{4}{l}{these models to version for the in vivo endoscopic ACF}\\
\tabcellsep \multicolumn{4}{l}{segmentation. More specifically, these main issues are}\\
\tabcellsep the following.\tabcellsep \tabcellsep \tabcellsep \\
\tabcellsep \multicolumn{4}{l}{? A new numerical system for solve the weak}\\
\tabcellsep \multicolumn{4}{l}{difference formulation of the Chan and Vese model}\\
\tabcellsep \multicolumn{4}{l}{is defined. The weak formulation has the help of}\\
\tabcellsep \multicolumn{4}{l}{requiring less functional regularity for the unknown}\\
\tabcellsep \multicolumn{4}{l}{level set function. The numerical scheme involves a}\\
\tabcellsep \multicolumn{4}{l}{finite element discretization in space and implicit}\\
2012\tabcellsep \multicolumn{4}{l}{finite differences in (artificial) time. It is correspondent to a L-M Newton-type optimization method.}\\
\tabcellsep \multicolumn{4}{l}{? A new ACWEs model is definite. It relies on the}\\
\tabcellsep \multicolumn{4}{l}{Chan and Vese model, but incorporates additional}\\
8\tabcellsep \multicolumn{4}{l}{terms whose goal is to confine specific features of the ACF that are important to clinicians: the}\\
Volume XII Issue XI Version I\tabcellsep \multicolumn{4}{l}{anomalous crypts' restrictions stain darker than normal crypt and in general inside each focal point, the crypts' orifices have shapes that are similar to each other. ? The mixed regularize model is based on the Chan and Vese model, but involve an additional regularization term, which penalize deviations of the angle of the level set function from unity, and thus address the heterogeneity of the level-set function for a given shape. This avoids the standard line of periodically reinitializing the level-set function to a signed distance function, and permits the full power}\\
( D D D D ) F\tabcellsep \multicolumn{4}{l}{of a Newton-type optimization method to be applied to minimization of the objective (since the}\\
Global Journal of Computer Science and Technology\tabcellsep uniqueness incorporated).\tabcellsep constraint\tabcellsep is\tabcellsep automatically\end{longtable} \par
 
\caption{\label{tab_5}}\end{figure}
 			\footnote{© 2012 Global Journals Inc. (US)} 			\footnote{© 2012 Global Journals Inc. (US) Global Journal of Computer Science and Technology} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Li]{b0}\label{b0} 	 		\textit{},  		 			Chunming Li 		.  		 	 
\bibitem[Chen]{b5}\label{b5} 	 		\textit{},  		 			Ping-Feng Chen 		.  		 	 
\bibitem[Zeng]{b9}\label{b9} 	 		\textit{},  		 			Delu Zeng 		.  		 	 
\bibitem[Canny ()]{b15}\label{b15} 	 		‘A computational approach to edge detection’.  		 			J Canny 		.  	 	 		\textit{IEEE Transactions on Pattern Analysis and Machine Intelligence}  		1986.  (8)  p. 769.  	 
\bibitem[Zheng and Chellappa (1993)]{b54}\label{b54} 	 		‘A computational vision approach to image registration’.  		 			Q Zheng 		,  		 			R Chellappa 		.  	 	 		\textit{IEEE Trans. Image Process}  		Jul. 1993. 2  (3)  p. .  	 
\bibitem[He et al. (2003)]{b53}\label{b53} 	 		‘A generalized divergence measure for robust image registration’.  		 			Y He 		,  		 			A Hamza 		,  		 			H Krim 		.  	 	 		\textit{IEEE Trans. Signal Process}  		May 2003. 51  (5)  p. .  	 
\bibitem[Caselles et al. ()]{b59}\label{b59} 	 		‘A geometric model for active contour in image processing’.  		 			V Caselles 		,  		 			F Catté 		,  		 			T Coll 		,  		 			F Dibos 		.  	 	 		\textit{Numer, Math}  		1993. 66 p. .  	 
\bibitem[Chan and Vese ()]{b34}\label{b34} 	 		‘A level set algorithm for minimizing the mumford-shah functional in image processing’.  		 			T Chan 		,  		 			L Vese 		.  	 	 		\textit{Computational Applied Math Group}  		2000.  	 	 (Tech. Rep. 0013) 
\bibitem[Chan and Vese ()]{b32}\label{b32} 	 		‘A level set algorithm for minimizing the mumford-shah functional in image processing’.  		 			T Chan 		,  		 			L Vese 		.  	 	 		\textit{Proc. of IEEE Workshop on Variational, Geometric and Level Set Methods in Computer Vision},  				 (of IEEE Workshop on Variational, Geometric and Level Set Methods in Computer Vision)  		2001. p. .  	 
\bibitem[Vese and Chan ()]{b33}\label{b33} 	 		‘A multiphase level set framework for image segmentation using the mumford and shah model’.  		 			L Vese 		,  		 			T Chan 		.  	 	 		\textit{Computational Applied Math Group}  		2001.  	 	 (Tech. Rep. 0125) 
\bibitem[Vese and Chan ()]{b31}\label{b31} 	 		‘A multiphase level set framework for image segmentation using the mumford and shah model’.  		 			L Vese 		,  		 			T Chan 		.  	 	 		\textit{International Journal of Computer Vision}  		2002.  (3)  p. .  	 
\bibitem[Paragios ()]{b41}\label{b41} 	 		‘A variational approach for the segmentaion of the left ventricle in mr cardiac images’.  		 			N Paragios 		.  	 	 		\textit{Proc. of IEEE Workshop on Variational, Geometric and Level Set Methods in Computer Vision},  				 (of IEEE Workshop on Variational, Geometric and Level Set Methods in Computer Vision)  		2001.  	 
\bibitem[Paragios ()]{b40}\label{b40} 	 		‘A variational approach for the segmentation of the left ventricle in cardiac image analysis’.  		 			N Paragios 		.  	 	 		\textit{International Journal of Computer Vision}  		2002.  (3)  p. .  	 
\bibitem[Young (1995)]{b22}\label{b22} 	 		\textit{Active contour models (snakes)},  		 			D Young 		.  		 \url{http://www.cogs.susx.ac.uk/users/davidy/teachvision/vision7.html}  		March 1995.  	 
\bibitem[Chan and Vese (2001)]{b60}\label{b60} 	 		‘Active contours without edges’.  		 			T F Chan 		,  		 			L A Vese 		.  	 	 		\textit{IEEE Trans. Image Process}  		Feb. 2001. 10  (2)  p. .  	 
\bibitem[Srinivasa et al. (2009)]{b3}\label{b3} 	 		‘Active Mask Segmentation of Fluorescence Microscope Images’.  		 			G Srinivasa 		,  		 			M C Fickus 		,  		 			A D Yusong Guo; Linstedt 		,  		 			J Kovacevic 		.  		 \xref{http://dx.doi.org/10.1109/TIP.2009.2021081}{10.1109/TIP.2009.2021081}.  	 	 		\textit{IEEE Transactions on}  		Aug. 2009. 18  (8)  p. .  	 	 (Image Processing) 
\bibitem[Zawadzki et al. ()]{b69}\label{b69} 	 		‘Adaptation of a support vector machine algorithm for segmentation and visualization of retinal structures in volumetric optical coherence tomography data sets’.  		 			R J Zawadzki 		,  		 			A R Fuller 		,  		 			D F Wiley 		,  		 			B Hamann 		,  		 			S S Choi 		,  		 			J S Werner 		.  	 	 		\textit{Journal of Biomedical Optics}  		2007. 12  (4)  p. .  	 
\bibitem[Hall and Llinas (1997)]{b51}\label{b51} 	 		‘An introduction to multisensor data fusion’.  		 			D Hall 		,  		 			J Llinas 		.  	 	 		\textit{Proc. IEEE}  		Jan. 1997. 85  (1)  p. .  	 
\bibitem[Garvin et al. ()]{b74}\label{b74} 	 		‘Automated 3-D intraretinal layer segmentation of macular spectraldomain optical coherence tomography images’.  		 			M Garvin 		,  		 			M Abramoff 		,  		 			X Wu 		,  		 			S Russell 		,  		 			T Burns 		,  		 			M Sonka 		.  	 	 		\textit{IEEE Trans. Med. Imag}  		2009. 28  (9)  p. .  	 
\bibitem[Fern´andez et al. ()]{b65}\label{b65} 	 		‘Automated detection of retinal layer structures on optical coherence tomography images’.  		 			D C Fern´andez 		,  		 			H M Salinas 		,  		 			C A Puliafito 		.  	 	 		\textit{Opt. Express}  		2005. 13  (25)  p. .  	 
\bibitem[Haeker et al. ()]{b72}\label{b72} 	 		‘Automated segmentation of intraretinal layers from macular optical coherence tomography images’.  		 			M Haeker 		,  		 			M Sonka 		,  		 			R Kardon 		,  		 			V A Shah 		,  		 			X Wu 		,  		 			M D Abramoff 		.  	 	 		\textit{Progress in Biomedical Optics and Imaging -Proceedings of SPIE},  				2007. 6512 p. 651214.  	 
\bibitem[Fonseca et al. ()]{b48}\label{b48} 	 		‘Automatic registration and mosaicking system for remotely sensed imagery’.  		 			L M G Fonseca 		,  		 			D Fedorov 		,  		 			B S Manjunath 		,  		 			C Kenney 		,  		 			E Castejon 		,  		 			J S De Medeiros 		.  	 	 		\textit{Revista Brasileira de Cartografia}  		2006. 58 p. .  	 
\bibitem[Brice and Fennema ()]{b17}\label{b17} 	 		\textit{Computer Method in Image Analysis, ch. Scene Analysis using Regions},  		 			C Brice 		,  		 			C Fennema 		.  		1977. Los Angeles: IEEE Computer Society.  	 
\bibitem[Paragios and Deriche ()]{b39}\label{b39} 	 		\textit{Coupled geodesic active regions for image segmentation},  		 			N Paragios 		,  		 			R Deriche 		.  		1999. INRIA.  	 	 (Tech. Rep. 3783) 
\bibitem[Paragios and Deriche ()]{b38}\label{b38} 	 		‘Coupled geodesic active regions for image segmentation: a level set approach’.  		 			N Paragios 		,  		 			R Deriche 		.  	 	 		\textit{Proc. of European Conference on Computer Vision},  				 (of European Conference on Computer Vision)  		2000.  	 
\bibitem[Fern´andez ()]{b66}\label{b66} 	 		‘Delineating fluid-filled region boundaries in optical coherence tomography images of the retina’.  		 			D C Fern´andez 		.  	 	 		\textit{IEEE Trans. Med. Imag}  		2005. 24  (8)  p. .  	 
\bibitem[Osher and Sethian ()]{b14}\label{b14} 	 		‘Fronts propagating with curvature dependent speed: Algorithms based on hamilton-jacobi formulations’.  		 			S Osher 		,  		 			J Sethian 		.  	 	 		\textit{Journal of Computationl Physics}  		1988. p. .  	 
\bibitem[Osher and Sethian ()]{b44}\label{b44} 	 		‘Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations’.  		 			S Osher 		,  		 			J Sethian 		.  	 	 		\textit{J. Comput. Phys}  		1988. 79 p. .  	 
\bibitem[Osher and Sethian ()]{b63}\label{b63} 	 		‘Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations’.  		 			S Osher 		,  		 			J A Sethian 		.  	 	 		\textit{J. Comput. Phys}  		1988. 79  (1)  p. .  	 
\bibitem[Xu and Prince ()]{b27}\label{b27} 	 		‘Generalized gradient vector flow external forces for active contours’.  		 			C Xu 		,  		 			J Prince 		.  	 	 		\textit{Signal Processing}  		1998.  (3)  p. .  	 
\bibitem[Paragios ()]{b36}\label{b36} 	 		‘Geodesic Active Regions and Level Set Methods: Contributions and Applications in Artificial Vision’.  		 			N Paragios 		.  	 	 		\textit{INRIA}  		2000.  		 			Dept. of Electrical and Computer Engineering 		 	 	 (PhD thesis) 
\bibitem[Paragios and Deriche ()]{b35}\label{b35} 	 		‘Geodesic active regions: A new framework to deal with frame partition problems in computer vision’.  		 			N Paragios 		,  		 			R Deriche 		.  	 	 		\textit{Journal of Visual Communication and Image Representation}  		2002. p. .  	 
\bibitem[Vese ()]{b30}\label{b30} 	 		\textit{Geometric Level Set Methods in Imaging, Vision, and Graphics, ch. Multiphase Object Year Detection and Image Segmentation},  		 			L Vese 		.  		2003. New York: Springer-Verlog. p. .  	 
\bibitem[Gonzales and Woods ()]{b21}\label{b21} 	 		 			R Gonzales 		,  		 			R Woods 		.  		\textit{Digital Image Processing},  				1993. Addison-Wesley Publishing.  	 	 (1st ed.) 
\bibitem[Paragios et al. ()]{b24}\label{b24} 	 		‘Gradient vector flow fast geodesic active contours’.  		 			N Paragios 		,  		 			O Mellina-Gottardo 		,  		 			V Ramesh 		.  	 	 		\textit{Proc. of IEEE International Conference on Computer Vision},  				 (of IEEE International Conference on Computer Vision)  		2001.  	 
\bibitem[Paragios et al. ()]{b23}\label{b23} 	 		‘Gradient vector flow fast geometric active contours’.  		 			N Paragios 		,  		 			O Mellina-Gottardo 		,  		 			V Ramesh 		.  	 	 		\textit{IEEE Transactions on Pattern Analysis and Machine Intelligence}  		2004.  (3)  p. .  	 
\bibitem[Xu and Prince ()]{b29}\label{b29} 	 		‘Gradient vector flow: a new external force for snakes’.  		 			C Xu 		,  		 			J Prince 		.  	 	 		\textit{Proc. of IEEE Conference on Computer Vision and Pattern Recognition},  				 (of IEEE Conference on Computer Vision and Pattern Recognition)  		1997. p. .  	 
\bibitem[Xu and Prince ()]{b25}\label{b25} 	 		\textit{Handbook of Medical Imaging: Processing and Analysis Management, ch. Gradient Vector Flow Deformable Models},  		 			C Xu 		,  		 			J Prince 		.  		2000. Academic Press.  	 
\bibitem[Xu et al. ()]{b26}\label{b26} 	 		\textit{Handbook of Medical Imaging: Processing and Analysis Management, ch. Image Segmentation Using Deformable Models},  		 			C Xu 		,  		 			D Pham 		,  		 			J Prince 		.  		2000. Academic Press. p. .  	 
\bibitem[Kim and Krim (1999)]{b46}\label{b46} 	 		‘Hierarchical stochastic modeling of sar imagery for segmentation/compression’.  		 			A Kim 		,  		 			H Krim 		.  	 	 		\textit{IEEE Trans. Signal Process}  		Feb. 1999. 47  (2)  p. .  	 
\bibitem[Zitova and Flusser ()]{b52}\label{b52} 	 		‘Image registration methods:Asurvey’.  		 			B Zitova 		,  		 			J Flusser 		.  	 	 		\textit{Image Vis. Comput}  		2003. 21  (11)  p. .  	 
\bibitem[Zhou and Xie (2012)]{b10}\label{b10} 	 		‘Image Segmentation Based on the Poincaré Map Method’.  		 			Zhiheng Zhou 		,  		 			; Shengli Xie 		.  		 \xref{http://dx.doi.org/10.1109/TIP.2011.2168408}{10.1109/TIP.2011.2168408}.  	 	 		\textit{IEEE Transactions on}  		March 2012. 21  (3)  p. .  	 	 (Image Processing) 
\bibitem[Jwa et al. (2008)]{b57}\label{b57} 	 		‘Informationtheoretic data registration for uav-based sensing’.  		 			S Jwa 		,  		 			U Ozguner 		,  		 			Z Tang 		.  	 	 		\textit{IEEE Trans. Intell, Transp. Syst}  		Mar. 2008. 9  (1)  p. .  	 
\bibitem[Garvin et al. ()]{b71}\label{b71} 	 		‘Intraretinal layer segmentation of macular optical coherence tomography images using optimal 3-D graph search’.  		 			M Garvin 		,  		 			M Abramoff 		,  		 			R Kardon 		,  		 			S Russell 		,  		 			X Wu 		,  		 			M Sonka 		.  	 	 		\textit{IEEE Transactions on}  		2008. 27  (10)  p. .  	 	 (Medical Imaging) 
\bibitem[Jain ()]{b16}\label{b16} 	 		 			A Jain 		.  		\textit{Fundamentals of Digital Image Processing},  				1989. Prentice Hall.  	 
\bibitem[Hall ()]{b49}\label{b49} 	 		\textit{Mathematical Techniques in Multisensor Data Fusion},  		 			D L Hall 		.  		1992. Norwood, MA: Artech House.  	 
\bibitem[Chiu-Yen et al. (2008)]{b1}\label{b1} 	 		‘Minimization of Region-Scalable Fitting Energy for Image Segmentation’.  		 			Chiu-Yen 		,  		 			J C Kao; Gore 		,  		 			Zhaohua Ding 		.  		 \xref{http://dx.doi.org/10.1109/TIP.2008}{10.1109/TIP.2008}.  	 	 		\textit{IEEE Transactions on}  		Oct. 2008. 2002304. 17  (10)  p. .  	 	 (Image Processing) 
\bibitem[Irani et al. ()]{b47}\label{b47} 	 		‘Mosaic based representations of video sequences and their applications’.  		 			M Irani 		,  		 			P Anandan 		,  		 			S Hsu 		.  	 	 		\textit{Proc. IEEE Int. Conf. Computer Vision},  				 (IEEE Int. Conf. Computer Vision)  		1995. p. 605.  	 
\bibitem[Krim and Mendoza (2010)]{b6}\label{b6} 	 		‘Multiphase Joint Segmentation-Registration and Object Tracking for Layered Images’.  		 			H Krim 		,  		 			O L Mendoza 		.  		 \xref{http://dx.doi.org/10.1109/TIP.2010.2045164}{10.1109/TIP.2010.2045164}.  	 	 		\textit{IEEE Transactions on}  		July 2010. 19  (7)  p. .  	 	 (Image Processing) 
\bibitem[Mumford and Shah ()]{b61}\label{b61} 	 		‘Optimal approximations by piecewise smooth functions and associated variational problems’.  		 			D Mumford 		,  		 			J Shah 		.  	 	 		\textit{Comm. Pure Appl. Math}  		1989. 42  (5)  p. .  	 
\bibitem[Osher and Fedkiw ()]{b62}\label{b62} 	 		 			S Osher 		,  		 			R Fedkiw 		.  		\textit{Level Set Methods and Dynamic Implicit Surfaces},  				 (New York)  		2003. Applied Mathematical Sciences. 153.  	 
\bibitem[Grady (2006)]{b45}\label{b45} 	 		‘Random walks for image segmentation’.  		 			L Grady 		.  	 	 		\textit{IEEE Trans. PAMI}  		Nov. 2006. 28  (11)  p. .  	 
\bibitem[Zhu and Yuille ()]{b19}\label{b19} 	 		\textit{Region competition and its analysis: a unified theory for image segmentation},  		 			S Zhu 		,  		 			A Yuille 		.  		1995.  		 			Robotics Lab, Havard University 		 	 	 (Tech. Rep. 7) 
\bibitem[Zhu and Yuille ()]{b18}\label{b18} 	 		‘Region competition: Unifying snakes, region growing, and bayes/MDL for multiband image segmentation’.  		 			S Zhu 		,  		 			A Yuille 		.  	 	 		\textit{IEEE Transactions on Pattern Analysis and Machine Intelligence}  		1996.  (9)  p. .  	 
\bibitem[Jehan-Besson et al. ()]{b43}\label{b43} 	 		‘Region-based active contours using geometrical and statistical features for image segmentation’.  		 			S Jehan-Besson 		,  		 			M Barlaud 		,  		 			G Aubert 		.  	 	 		\textit{Proc. of IEEE International Conference on Image Processing},  				 (of IEEE International Conference on Image essing)  		2003. p. .  	 
\bibitem[Kumar et al. ()]{b58}\label{b58} 	 		‘Registration of highly-oblique and zoomed in aerial video to reference imagery’.  		 			R Kumar 		,  		 			S Samarasekera 		,  		 			S Hsu 		,  		 			K Hanna 		.  	 	 		\textit{Proc. 15th Int. Conf. Pattern Recognition},  				 (15th Int. Conf. Pattern Recognition)  		2000. 4 p. .  	 
\bibitem[Kumar et al. (1998)]{b56}\label{b56} 	 		‘Registration of video to geo-referenced imagery’.  		 			R Kumar 		,  		 			H Sawhney 		,  		 			J Asmuth 		,  		 			A Pope 		,  		 			S Hsu 		.  	 	 		\textit{Proc. 14th International Conf. Pattern Recognition},  				 (14th International Conf. Pattern Recognition)  		Aug. 1998. 2 p. .  	 
\bibitem[Koozekanani et al. ()]{b68}\label{b68} 	 		‘Retinal thickness measurements from optical coherence tomography using a Markov boundary model’.  		 			D Koozekanani 		,  		 			K Boyer 		,  		 			C Roberts 		.  	 	 		\textit{IEEE Trans. Med. Imag}  		2001. 20  (9)  p. .  	 
\bibitem[Fu et al. ()]{b20}\label{b20} 	 		\textit{Robotics: Control, Sensing, Vision, and Inteligence},  		 			K Fu 		,  		 			R Gonzales 		,  		 			C Lee 		.  		1987. New York: McGraw-Hill.  	 
\bibitem[Nguyen et al.]{b11}\label{b11} 	 		‘Robust Interactive Image Segmentation Using Convex Active Contour’.  		 			T Nguyen 		,  		 			J Cai 		,  		 			J Zhang 		,  		 			J Zheng 		.  		 \xref{http://dx.doi.org/10.1109/TIP.2012.2191566}{10.1109/TIP.2012.2191566}.  	 	 		\textit{IEEE Transactions on}  		 (99)  p. 1.  	 	 (Image Processing) 
\bibitem[Yazdanpanah et al. (2011)]{b8}\label{b8} 	 		‘Segmentation of Intra-Retinal Layers From Optical Coherence Tomography Images Using an Active Contour Approach’.  		 			A Yazdanpanah 		,  		 			G Hamarneh 		,  		 			B R Smith 		,  		 			M V Sarunic 		.  		 \xref{http://dx.doi.org/10.1109/TMI.2010.2087390}{10.1109/TMI.2010.2087390}.  	 	 		\textit{IEEE Transactions on}  		Feb. 2011. 30  (2)  p. .  	 	 (Medical Imaging) 
\bibitem[Haeker et al. ()]{b73}\label{b73} 	 		‘Segmentation of the surfaces of the retinal layer from OCT images’.  		 			M Haeker 		,  		 			M Abrmoff 		,  		 			R Kardon 		,  		 			M Sonka 		.  	 	 		\textit{Medical Image Computing and Computer-Assisted Intervention (MICCAI)},  				2006. p. .  	 
\bibitem[Fuller et al. ()]{b70}\label{b70} 	 		‘Segmentation of threedimensional retinal image data’.  		 			A R Fuller 		,  		 			R J Zawadzki 		,  		 			S Choi 		,  		 			D F Wiley 		,  		 			J S Werner 		,  		 			B Hamann 		.  	 	 		\textit{IEEE Transactions on}  		2007. 13  (6)  p. .  	 	 (Visualization and Computer Graphics) 
\bibitem[Klein ()]{b50}\label{b50} 	 		\textit{Sensor and Data Fusion Concepts and Applications},  		 			L A Klein 		.  		1993. Bellingham, WA: SPIE.  	 
\bibitem[Sethian ()]{b64}\label{b64} 	 		 			J A Sethian 		.  	 	 		\textit{Level Set Methods and Fast Marching Methods},  				 (Cambridge, U.K.)  		1999. Cambridge Univ. Press. 3.  	 	 (2nd ed) 
\bibitem[Jehan-Besson et al. ()]{b42}\label{b42} 	 		‘Shape gradients for histogram segmentation using active contours’.  		 			S Jehan-Besson 		,  		 			M Barlaud 		,  		 			G Aubert 		.  	 	 		\textit{Proc. of IEEE International Conference on Computer Vision},  				 (of IEEE International Conference on Computer Vision)  		2003.  	 
\bibitem[Shekhar et al. ()]{b55}\label{b55} 	 		 			C Shekhar 		,  		 			V Govindu 		,  		 			R Chellappa 		.  		\textit{Multisensor Image Registration by Feature Consensus},  				1996.  	 
\bibitem[Kass et al. ()]{b13}\label{b13} 	 		‘Snakes, active contour model’.  		 			M Kass 		,  		 			A Witkin 		,  		 			D Terzopoulos 		.  	 	 		\textit{International Journal of Computer Vision}  		1988. p. .  	 
\bibitem[Xu and Prince ()]{b28}\label{b28} 	 		‘Snakes, shapes, and gradient vector flow’.  		 			C Xu 		,  		 			J Prince 		.  	 	 		\textit{IEEE Transactions on Image Processing}  		1998.  (3)  p. .  	 
\bibitem[Fukuda et al. ()]{b12}\label{b12} 	 		‘Theory of communication’.  		 			T Fukuda 		,  		 			Y Morimoto 		,  		 			S Morishita 		,  		 			T Tokuyama 		.  	 	 		\textit{ACM Transactions on Database Systems}  		2001. 26  (2)  p. .  	 
\bibitem[Bagci et al. ()]{b67}\label{b67} 	 		‘Thickness profiles of retinal layers by optical coherence tomography image segmentation’.  		 			A M Bagci 		,  		 			M Shahidi 		,  		 			R Ansari 		,  		 			M Blair 		,  		 			N P Blair 		,  		 			R Zelkha 		.  	 	 		\textit{American Journal of Ophthalmology}  		2008. 146  (5)  p. .  	 
\bibitem[Paragios and Deriche ()]{b37}\label{b37} 	 		‘Unifying boundary and region-based information for geodesic active tracking’.  		 			N Paragios 		,  		 			R Deriche 		.  	 	 		\textit{Proc. of IEEE Conference on Computer Vision and Pattern Recognition},  				 (of IEEE Conference on Computer Vision and Pattern Recognition)  		1999. p. .  	 
\bibitem[Bovenkamp et al. (2009)]{b2}\label{b2} 	 		‘User-Agent Cooperation in Multiagent IVUS Image Segmentation’.  		 			E G P Bovenkamp 		,  		 			J Dijkstra 		,  		 			J G Bosch 		,  		 			J H C Reiber 		.  		 \xref{http://dx.doi.org/10.1109/TMI.2008.927351}{10.1109/TMI.2008.927351}.  	 	 		\textit{IEEE Transactions on}  		Jan. 2009. 28  (1)  p. .  	 	 (Medical Imaging) 
\bibitem[Yang and Luo (2010)]{b4}\label{b4} 	 		‘User-Friendly Interactive Image Segmentation Through Unified Combinatorial User Inputs’.  		 			Wenxian Yang 		,  		 			; Jianfei Cai; Jianmin Zheng; Jiebo Luo 		.  		 \xref{http://dx.doi.org/10.1109/TIP.2010.2048611}{10.1109/TIP.2010.2048611}.  	 	 		\textit{IEEE Transactions on}  		Sept. 2010. 19  (9)  p. .  	 	 (Image Processing) 
\bibitem[Figueiredo et al. (2010)]{b7}\label{b7} 	 		‘Variational Image Segmentation for Endoscopic Human Colonic Aberrant Crypt Foci’.  		 			I N Figueiredo 		,  		 			P N Figueiredo 		,  		 			G Stadler 		,  		 			O Ghattas 		,  		 			A Araujo 		.  		 \xref{http://dx.doi.org/10.1109/TMI.2009.2036258}{10.1109/TMI.2009.2036258}.  	 	 		\textit{IEEE Transactions on}  		April 2010. 29  (4)  p. .  	 	 (Medical Imaging) 
\end{bibitemlist}
 			 		 	 
\end{document}
