\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={Normalized Vector Codes for Object Recognition using Artificial Neural Networks in the Framework of Picture Description Languages},
 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{2013-05-15 (revised: 15 May 2013)}
\def\TheID{\makeatother }
\def\TheDate{2013-05-15}
\title{Normalized Vector Codes for Object Recognition using Artificial Neural Networks in the Framework of Picture Description Languages}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

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

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

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

\usepackage[absolute,overlay]{textpos}

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

             \author[1]{G.D.  Jasmin}

             \author[2]{E.G.  Rajan}

             \affil[1]{  Mysore University}

\renewcommand\Authands{ and }

\date{\small \em Received: 11 April 2013 Accepted: 3 May 2013 Published: 15 May 2013}

\maketitle


\begin{abstract}
        


Your Understanding how biological visual systems recognize objects is one of the ultimate goals in computational neuroscience. People are able to recognize different types of objects despite the fact that the objects may vary in view, points, sizes, scale, texture or even when they are translated or rotated. In this paper we focus on syntactic approach for the description of objects as Normalized Vector Codes using which objects are recognized based on their shapes.

\end{abstract}


\keywords{pattern recognition, formal representation of images, object recognition.}

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

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


\let\tabcellsep& 	 	 		 \par
Introduction attern recognition could be formally defined as categorization of input data into identifiable classes via extraction of significant features or attributes of the data from the background of irrelevant detail. A pattern class is a category, determined by some given common attributes. When a set of patterns falling into disjoint classes are available, it is desired to categorize these patterns into their respective classes through the use of some automatic device. It is important to note that learning or training takes place only during the design (or updating) phase of a pattern recognition system. Once acceptable results have been obtained, the system is engaged in the task of actually performing recognition on samples drawn from the environment in which it is expected to operate. The main objective of this research is to investigate and develop a general approach formally from a new theory based on Structural or Syntactic Pattern Recognition.\par
The problem of pattern recognition is divided into the following sub problems:\par
1. Image pre processing 2. Object Description 3. Classification  
\section[{D}]{D}\par
The pre-processing also known as low level image processing is performed on the input image to improve the quality of the image and to simplify the image for further processing. The pre-processing steps involve noise removal, conversion of gray scale and colour images into binary images and the extraction of contour from the binary image. The object description module takes an input contour image and gives a vector of direction and length called a knowledge vector as output. This plays an important role in the whole process as the knowledge vector gives more information about the objects present in the image which is used to characterize the pattern. We use a syntactic approach for the description of objects. The knowledge vector obtained here gives information about the direction and the length of lines in the contour of objects which can then be given as input to a classifier module. The normalization of this vector plays an important role in the classification process. The vector has to be analyzed and normalized in such a way that it better suits for more variance of objects. The classification module takes the normalized vector as input and identifies them as a member of one of the predefined classes depending on the set of attributes that they hold. The design of a classifier involves the selection of the classifier and the estimate of parameters for the classifier. The feedforward artificial neural networks with back-propagation learning algorithm could be used for classification. Details of such neural networks could be obtained from standard literature.\par
of noise in the image. The pixel point processing techniques such as binary contrast enhancement, stretching or shrinking and histogram equalization are used to improve the contrast of the image.\par
The input image to the system may be a colour image, a gray scale image or a binary image. These images have to be converted to binary images for further processing. Segmentation is an important process in our object recognition system as it highlights the objects present in the image from its background. The function im2bw() in matlab is used to convert the images to binary. The graythresh() function computes a global threshold (level) that can be used to convert an intensity image to a binary image with im2bw. Level is a normalized intensity value that lies in the range [0, 1].\par
The contours are extracted as they give the outlines of shapes of the objects present in the image. The function bwtraceboundary() in matlab is used for finding the contours. The initial point of the object is identified, and the outline tracing algorithm is used. bwtraceboundary() traces the outline pixels of an object in binary image bw. Nonzero pixels belong to an object and zero pixels constitute the background. Figure \hyperref[fig_1]{2} shows a sample binary image and its contour. The notion of 'Picture Description Languages' refers to the language of digital images defined over a regular array of vertices. Having extracted the contour of an image this process involves running through the contour pixel by pixel and performing some form of calculations using every pixel and its surrounding pixels. This involves finding the length of the contour in every possible direction. The eight possible directions are two horizontal directions, two vertical directions and four diagonal directions. As the lines other than straight lines have more variations in their directions, the length of the descriptor becomes large. It is then reduced to a single occurrence of eight directions and normalized to fixed number of pixels for making it invariant. Following is the knowledge vector of a hexagon.  
\section[{GENERATION OF DIRECTION LENGTH CODE (DLC)}]{GENERATION OF DIRECTION LENGTH CODE (DLC)}\par
The connectivity between the pixels is an important concept used in the field of object recognition. Two pixels are said to be connected, if they are adjacent in some sense and their intensity levels satisfy a specified criterion of similarity. If pixel p with coordinates (x,y) and pixel q with coordinates (s,t) are pixels of object (image subset) S, a path from p to q is a sequence of distinct pixels with coordinates (x0, y0), (x1, y1),???..,  {\ref (xn, yn)} where (x0, y0) = (x,y) and (xn, yn) = (s,t), (xi, yi) is adjacent to (xi-1, yi-1), 1 ? i ? n, and n is the length of the path. If there a path exists from p to q consisting of pixels in S, then p is said to be connected to q. The gap of one or two pixels marks the presence of the next component in the same object or the beginning of the next object which can be then found by analysing the relationship among the components.\par
With this background, we shall see now as to how to apply Look Ahead Tracer (LAT) algorithm to various image types and extract knowledge from them. Let (x,y) be the initial point. The algorithm continues to find the immediate pixel connected to (x,y) in one of the 8 directions. In this technique, a previously recognized direction during a scan is given the first priority status when compared to the other preferential ones. If R is the identified direction, then the other preferential directions are DR, D, DL, L, UL, U, UR.\par
The trace continues until there is no pixel connectivity to the current point (x,y), after removing the  One can easily say that the above knowledge vector represents a square from the fact that the four directions R,D,L and U has the same length except the direction U that has 1 pixel less than other 3 sides. This is because of the immediate removal of the scanned pixels. The starting pixel at position <104,109> is removed after its scan. 
\section[{III.}]{III.} 
\section[{KNOWLEDGE VECTOR ANALYSIS}]{KNOWLEDGE VECTOR ANALYSIS}\par
The direction codes in the knowledge vector obtained by tracing the contour of an object are R, DR, D, DL, L, UL, U and UR. For better processing, let us categorize these directions into basic directions R,D,L and U and diagonal directions DR,DL,UL and UR. For example, consider the knowledge vector of a square in figure  {\ref 5}. R100*D100*L100*U99 Figure  {\ref 5} : The knowledge vector of a square This shows the square consists of four basic directions with all lengths equal. Shapes with all the basic directions but with equal alternate length can be identified as a rectangle. Shapes with four sides consisting of only diagonal directions can be considered as rhombus.\par
The task of identifying regular shaped objects is simple. Objects in a real time environment may not be regular always. For the effective identification of those objects, the shapes of the objects can be approximated to some regular polygons to which it is closer to. This is possible by predefining the classes of regular shapes with some pre conditions set and approximating the other shapes to one of these shapes by identifying them as a member of the predefined class.\par
It is important to note that, the diagonal sides present in the shape of an object do not necessarily appear alone as the connection of only diagonal pixels. The occurrence of other pixels depends on the angle at which the diagonal lines appear in the image. Possibly D and R pixels appear more with DR, D and L pixels appear more with DL, U and L pixels appear with UL and U and R pixels appear with UR. For example consider a line with the direction code DR. As shown in fig: if the line bends more towards right the more R pixels appear, in the same way if it bends more towards down the more D pixels present with DR as shown in figure \hyperref[fig_5]{6}. In this respect, when the lineis rotated with a small change in the slope, they can be approximated to one of these shapes. Four basic sides or four diagonal sides with equal alternate lengths.\par
In the same manner, shapes with more sides can be predefined. When the shape of an object appears it can be then classified by artificial neural networks as a member of one of these classes.  
\section[{THE SHORT COMINGS OF TRADITIONAL PATTERN RECOGNITION SYSTEMS AND THE NEED FOR ADAPTIVE PROCESSING}]{THE SHORT COMINGS OF TRADITIONAL PATTERN RECOGNITION SYSTEMS AND THE NEED FOR ADAPTIVE PROCESSING}\par
Objects in the real world from an image or image sequence of the world are detected with the advanced software tools the imaging applications like Automatic Object Recognition (AOR) that uses different object models which are known a-priori. Humans can perform this task of object recognition effortlessly and instantaneously. However, such a task of implementation based on machines is performed using algorithms and has been very difficult in networks for real time imaging problems which are non-linear in nature. In some applications, the patterns/objects to be recognized are so fuzzy that they cannot be modelled with conventional tools. In order to solve these neural network processors can be used as the best tool because of the fact that the processor can build a recognition engine from simple image annotations made by the programmer. It then extracts the characteristics or feature vectors from the annotated objects and sends them to the neural network. Neural networks having adaptive processing elements are capable of performing generalization and can consequently classify situations never seen before by associating them to similar learned situations. 
\section[{a) Artificial Neural Networks}]{a) Artificial Neural Networks}\par
Learning from a set of examples is an important attribute needed for most pattern recognition systems. Artificial neural network is an adaptive system being widely used in pattern recognition systems that changes its structure based on external or internal information that flows through the network. Artificial neural networks are adjusted, or trained, so that a particular input leads to a specific target output. The neural network design part consists of two processes, training and application. The training of the neural network continues until the mean squared error reduces to a certain threshold or until the maximum number of iterations is reached. Once training is completed, the network can be applied for the actual classification of the data. The classification technique used may be one of the following:\par
1. Supervised classification -in which the input pattern fall as a member of a predefined class. 2. Unsupervised classification -in which the pattern falls into an unknown class as there are no predefined classes. The learning or training takes place only during the design phase of a pattern recognition system. Once the results obtained are satisfactory, the system is ready to perform the task of recognition on samples drawn from the environment in which it is expected to operate. b) Feed-forward neural networks Feed-forward networks are commonly used for pattern recognition. A three-layer feed forward neural network is typically composed of one input layer, one output layer and one hidden layer. In the input layer, each neuron corresponds to a given input pattern while in the output layer each neuron corresponds to a predefined pattern. Once a certain sample is input into the network, he best situation is that the output will be a vector with all elements as zero only except the one corresponding to the pattern that the sample belongs to. Of course, it is very complex to construct such types of neural networks. The commonly used networks for minimizing the cost are multi-layer-feed-forward neural networks, which uses the back-propagation learning algorithm for training neural networks. and transmits it to all units in the hidden layer z j (j=1,?.,p). 5. Each hidden unit z j sums its weighted input signals and applies its activation function and sends this signal to all units in the output layer y k (k=1,?.,m).    \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{fig_3}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{34}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Figure 3 :Figure 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-7.png}
\caption{\label{fig_5}Figure 6 :D}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-8.png}
\caption{\label{fig_6}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-9.png}
\caption{\label{fig_7}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-10.png}
\caption{\label{fig_8}6 .}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7}\includegraphics[]{image-11.png}
\caption{\label{fig_9}DFigure 7 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_0}Table 1}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.049999999999999996\textwidth}P{0.09999999999999999\textwidth}P{0.049999999999999996\textwidth}P{0.09999999999999999\textwidth}P{0.049999999999999996\textwidth}P{0.09999999999999999\textwidth}P{0.049999999999999996\textwidth}P{0.09999999999999999\textwidth}P{0.25\textwidth}}
R\tabcellsep DR\tabcellsep D\tabcellsep DL\tabcellsep L\tabcellsep UL\tabcellsep U\tabcellsep UR\tabcellsep Class\end{longtable} \par
 
\caption{\label{tab_1}Table 1 :}\end{figure}
 			\footnote{DNormalized Vector Codes for Object Recognition using Artificial Neural Networks in the Framework of Picture Description Languages} 			\footnote{DNormalized Vector Codes for Object Recognition using Artificial Neural Networks in the Framework of Picture Description Languages} 			\footnote{DNormalized Vector Codes for Object Recognition using Artificial Neural Networks in the Framework of Picture Description Languages} 		 		\backmatter  			 \par
In the same way the DLC of real time images also can be approximated and normalized to fixed number of pixels. Such code gives us the input vector that can be given to the neural networks for the classification of their shapes as the shape in one of the 9 classes. Later more analysis can be done for further classification of these shapes inside the classes to produce more detailed classes for the actual identification of objects.  
\subsection[{CONCLUSION}]{CONCLUSION}\par
In this Paper a syntactic approach is proposed for shape based object recognition. The knowledge vector is reduced to the input vector to a neural network by some vector approximation and normalization processes. The research efforts during the last decade have made significant progresses in both theoretical development and practical applications. The method presented here may offer a promising solution for object recognition problem.			 			  				\begin{bibitemlist}{1}
\bibitem[*R1*DR6*R1*DR2*R1*DR1*D1*DR1*R2*D1*DR1*D1]{b1}\label{b1} 	 		\textit{*R1*DR6*R1*DR2*R1*DR1*D1*DR1*R2*D1*DR1*D1},  				 	 
\bibitem[*UL4*U1*UL1*L2*U1*UL1*L1*UL1*U3*UR5*R1*U R1*U1*UR1*R1*UR1*U1*UR2*R1*UR5*R1*UR1*R2* UR2*R1*UR3*R1*UR2*R1*UR1*R2*UR1*R2*UR2*R2* UR1*R2*UR2*R1*UR1*U1*UL1*U2*UL2*U3*UL1*U3* UL2*U5*UL1*U20*UR1*U8*UR1*R11*UR1*R26*DR1* R7*DR1*R5*DR1*R5*DR1*R3*DR1*R2*UR3*D1*U2* UR2*U1*UR3*U1*UR4*R1*UR1*U2*UR1*R1*UR2*U1]{b2}\label{b2} 	 		\textit{*UL4*U1*UL1*L2*U1*UL1*L1*UL1*U3*UR5*R1*U R1*U1*UR1*R1*UR1*U1*UR2*R1*UR5*R1*UR1*R2* UR2*R1*UR3*R1*UR2*R1*UR1*R2*UR1*R2*UR2*R2* UR1*R2*UR2*R1*UR1*U1*UL1*U2*UL2*U3*UL1*U3* UL2*U5*UL1*U20*UR1*U8*UR1*R11*UR1*R26*DR1* R7*DR1*R5*DR1*R5*DR1*R3*DR1*R2*UR3*D1*U2* UR2*U1*UR3*U1*UR4*R1*UR1*U2*UR1*R1*UR2*U1},  				 	 
\bibitem[*UR1*U1*UR2*R1*UR1*R2*UR1*/<65,183># <64,184>/R26+160*DR74*D19+91*DL82*L29+153* UL74*U20+94*UR77*/<65,183># References Références Referencias]{b3}\label{b3} 	 		\textit{*UR1*U1*UR2*R1*UR1*R2*UR1*/<65,183>\# <64,184>/R26+160*DR74*D19+91*DL82*L29+153* UL74*U20+94*UR77*/<65,183>\# References Références Referencias},  				 	 
\bibitem[Cohen and Wang]{b5}\label{b5} 	 		\textit{3-D recognition and shape estimation from image contours},  		 			F S Cohen 		,  		 			J.-Y Wang 		.  		 	 	 (in Proc) 
\bibitem[<64,184>/R4*DR2*R2*D1*DR1*R2*DR4*R2*DR1*R1]{b0}\label{b0} 	 		\textit{<64,184>/R4*DR2*R2*D1*DR1*R2*DR4*R2*DR1*R1},  				 	 
\bibitem[Rajan (1993)]{b7}\label{b7} 	 		‘Cellular Logic Array Processing Techniques for High-Throughput Image Processing Systems’.  		 			E G Rajan 		.  	 	 		\textit{The Indian Academy of Sciences}  		June 1993. 18  (2)  p. .  	 	 (Invited paper, SADHANA, Special Issue on Computer Vision) 
\bibitem[Mori et al. (2005)]{b9}\label{b9} 	 		‘Efficient shape matching using shape contexts’.  		 			Greg Mori 		,  		 			Member 		,  		 			Serge Ieee 		,  		 			Belongie 		,  		 			Ieee Member 		,  		 			Jitendra Malik 		,  		 			Member 		,  		 			Ieee 		.  	 	 		\textit{IEEE Transactions on pattern analysis and machine intelligence},  				November 2005. 27.  	 
\bibitem[IEEE Conf Computer Vision Pan. Recognition (1992)]{b6}\label{b6} 	 		\textit{IEEE Conf Computer Vision Pan. Recognition},  				June 1992.  	 
\bibitem[Hafiz et al.]{b10}\label{b10} 	 		‘Intelligent Object and Pattern Recognition using Ensembles in Back Propagation Neural Network’.  		 			T Hafiz 		,  		 			Muhammad U Hassan 		,  		 			Kashif Khalid 		,  		 			Imran 		.  	 	 		\textit{International Journal of Electrical \& Computer Sciences IJECS-IJENS}  		10 p. 6.  	 
\bibitem[Rowley et al. ()]{b11}\label{b11} 	 		‘Neural network-based face detection’.  		 			H Rowley 		,  		 			S Baluja 		,  		 			T Kanade 		.  	 	 		\textit{IEEE Transactions on Pattern Analysis and Machine intelligence}  		1998. 20 p. .  	 
\bibitem[Belongie et al. (2002)]{b4}\label{b4} 	 		‘Shape matching and object recognition using shape contexts’.  		 			S Belongie 		,  		 			J Malik 		,  		 			J Puzicha 		.  	 	 		\textit{IEEE Transactions on Pattern Analysis and Intelligence}  		April 2002. 4  (24)  p. .  	 
\bibitem[Chen et al. ()]{b8}\label{b8} 	 		‘Two-Dimensional Packing For Irregular Shaped Objects’.  		 			Ping Chen 		,  		 			Zhaohui Fu 		,  		 			Andrew Lim 		,  		 			Brian Rodrigues 		.  		 0-7695-1874-5/03 \$17.00.  	 	 		\textit{Proceedings of the 36th Hawaii International Conference on System Sciences -2003},  				 (the 36th Hawaii International Conference on System Sciences -2003)  		2003. IEEE.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
