\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={Real-Time Face Recognition System Based On Morphological Gradient Features and ANN},
 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{Real-Time Face Recognition System Based On Morphological Gradient Features and ANN}
\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]{Dr. Pallab Kanti  Podder}

             \author[2]{Dilip Kumar  Sarker}

             \author[3]{Diponkar  Kundu}

             \affil[1]{  Pabna Science and Technology University}

\renewcommand\Authands{ and }

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

\maketitle


\begin{abstract}
        


Faces represent complex, multidimensional, meaningful visual stimuli. A real-time face recognition system has been implemented which is based on Artificial Neural Network. The system integrates three phases. At the initial phase, an image or a frame is grabbed from a real-time video source or webcam. Then the face region is detected using Local SMQT features and Split up SNoW Classifier and after that the detected face is sent for recognition using Backpropagation Neural Network. Feature extraction has been performed on Gray-Scale images of detected faces using Gray-Scale Morphology that are nonlinear and translationinvariant. The feature extraction and classification networks are trained together, allowing the network to simultaneously perform feature extraction and classification. This system performs extremely well under constrained conditions such as gross variation in expression, position, orientation and illumination which are the complications of face recognition.

\end{abstract}


\keywords{Face Recognition, Real-Time, Artificial Neural Network, Backpropagation, SMQT Features, SNoW Classifier, Gray-Scale Morphology.}

\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
ace is the most precise and extensively used key to a person's identity. Face recognition has attracted perceptible attention in the advancement of human-machine interaction as it provides a natural and efficient way to communicate between humans and machines. In recent years considerable progress has been made in the area of face recognition through which computers can now compete favorably with humans in many face recognition tasks, particularly those in which large databases of faces must be searched. The problem of detecting and recognizing faces in real-time video sequences has become a popular area of research due to emerging applications in humancomputer interface, surveillance systems; secure access control, video conferencing, financial transaction, forensic applications, pedestrian detection, driver alertness monitoring systems, image database management system and so on. The goal of this work is to develop an efficient, real-time face recognition system that would be able to recognize a person as soon as he will be in front of camera. 
\section[{II.}]{II.} 
\section[{SYSTEM ARCHITECTURE}]{SYSTEM ARCHITECTURE}\par
The process of identifying/recognizing a person in this research is based on mainly three phases: i.\par
Image Acquisition from pc camera.\par
ii.\par
Face Detection using Local SMQT Features and Split up SNoW Classifier.\par
iii. Face Recognition, a) Facial Feature Extraction using Gray-Scale Morphology b) Classification using Artificial Neural Network.\par
Internally, all pattern recognition systems have the following processes \hyperref[b0]{[1]}. Since the output of each operation is the input to the next, the functional parts (1-6) must execute in sequence. In our research, Task 4 and 5 are combined. The size of every image (input and output) is to be kept standard so that there is better control and accuracy during matrix computation and parameter training.The project did not work well when it was first created.\par
There were a lot of tests and changes along the way. At that time, it was decided that as long as we had enough images to give a good training to reveal the mapping structure, we should keep the algorithm and the training data simple. Fig. \hyperref[fig_0]{1} pictorially describes the whole system.  
\section[{III. FACE DETECTION USING LOCAL SMQT FEATURES AND SPLIPT UP SNOW CLASSIFIER}]{III. FACE DETECTION USING LOCAL SMQT FEATURES AND SPLIPT UP SNOW CLASSIFIER}\par
Pattern recognition in the context of appearance based on face detection can be approached in several ways \hyperref[b4]{[5]}, \hyperref[b5]{[6]}. Techniques proposed for this task are for example the Neural Network (NN) \hyperref[b6]{[7]}, probabilistic modeling \hyperref[b7]{[8]}, cascade of boosted feature (AdaBoost) \hyperref[b8]{[9]}, Sparse Network of Windows (SNoW) \hyperref[b3]{[4]}, \hyperref[b9]{[10]}, combination of AdaBoost and SNoW \hyperref[b10]{[11]} and the Support Vector Machine (SVM) \hyperref[b11]{[12]}. We used a framework for face detection which is proposed using illumination insensitive features gained from the local SMQT features and rapid detection is achieved by the split up SNoW classifier. SMQT (The Successive Mean Quantization Transform) \hyperref[b3]{[4]} is used for automatic enhancement of gray-scale images. The SMQT enhanced image histogram retains the basic shape of the original but stretches it to explore the whole dynamic range. Hence, the SMQT adapts the shape of the histogram by performing a nonlinear stretch. The nonlinear properties of the SMQT will yield a balanced stretch of the histogram which shows in Fig. \hyperref[fig_1]{2}. The SNoW learning architecture is a multi-class classifier that is specifically tailored for large scale learning tasks and for domains in which the potential number of features taking part in decisions is very large. With the SNoW and the split up SNoW classifier, a pre trained lookup table searched for face. Overlapped detections are pruned using geometrical location and classification scores. Each detection is tested against all other detections. If one of the area overlap ratio is over a fixed threshold, then the different detections are considered to belong to the same face. Given that two detections overlap each other, the detection with the highest classification score is kept and the other one is removed. This procedure is repeated until no more overlapping detections are found. 
\section[{IV. FACIAL FEATURE EXTRACTION USING GRAY-SCALE MORPHOLOGY}]{IV. FACIAL FEATURE EXTRACTION USING GRAY-SCALE MORPHOLOGY}\par
Morphological operation \hyperref[b1]{[2]}, \hyperref[b13]{[14]} is used as a tool for extracting image components that are useful in the representation and description of region shape namely, boundaries, skeletons, and the convex hull.\par
Morphological processes have nonlinear and translation-invariant properties \hyperref[b1]{[2]}, while neural networks have good generalization capabilities \hyperref[b2]{[3]}. Therefore our system is a heterogeneous network that produces highorder features based on local features extracted by morphological operations. Information obtained by mathematical morphology is highly dependent on structuring elements or kernels \hyperref[b1]{[2]}.\par
In its initial stage, we performed a combination of grayscale erosion and dilation known as the hit-miss transform \hyperref[b13]{[14]}. Each input image was eroded by a hit structuring element and dilated by a miss structuring element separately. Both outputs are then deducted to derive their overlapping difference. The result from this process forms the feature map shows in Fig.  {\ref 3}, which becomes the direct input to a Backpropagation network \hyperref[b2]{[3]}. The network can have one or more layers, and each layer can also have one or more feature maps. The gray-scale erosion of f by structuring element b, denoted f ? b , is defined as Where Db is the domain of b and f(x, y) is assumed to equal + ? outside the domain of f. In practice grayscale dilation usually is performed using flat structuring elements in which the value (height) of b is 0, and then the simplified gray-scale dilation is,(A) (B)\par
Dilation and erosion can be combined to achieve a variety of effects. For instance, subtracting an eroded image from its dilated version produces a "morphological gradient" which is a measure of local gray level variation in the image and which is shown in Fig.  {\ref 6}.\par
Morphological gradient = ( f ?b) ? ( f?b) 
\section[{V. FACE RECOGNITION USING ARTIFICIAL NEURAL NETWORK}]{V. FACE RECOGNITION USING ARTIFICIAL NEURAL NETWORK}\par
A Neural Network based face recognition system is used for recognizing front-view face images \hyperref[b3]{[4]}. The standard backpropagation algorithm is redesigned with multiple hidden layers to simultaneously perform hitmiss transformation, train, and classify features within the same iteration. The recognized image  is determined by the corresponding output value that lies within a certain threshold.x x f y x b f ? ? ? ? ? + ? ? ? ? = ? \} ) , ( | ) , ( max\{ ) , )( ( b D y x y y x x f y x b f ? ? ? ? ? ? ? = ? (B) (A) \} ) , ( | ) , ( ) , ( min\{ ) , )( ( b D y x y x b y y x x f y x b f ? ? ? ? ? ? ? + ? + = ? \} ) | ) , ( min\{ ) b y x y x x f y x b f ? ? ? + ? + = ?\par
There are virtually no tools to help us select an appropriate architecture and learning parameters for a neural network. In most cases, learning parameters are determined by experience or based on the trial and error method \hyperref[b2]{[3]}. We may work both ways to select our best set of parameters: a. Start from a large network and successively remove some neurons and links until network performance degrades. b. Start with a small network and introduce new neurons until performance is satisfactory.\par
Our proposed system is special because it has an extra network stage that depends on structuring elements to extract features. Feature extraction is performed over the entire image as well as its sub image in separate networks. We found that besides gray-level shifts, Won \hyperref[b12]{[13]} and Skubic \hyperref[b13]{[14]} were also concerned with the sensitivity of network performance to the size of the structuring element. We use the size of structure element is 2, it can be varied 1 to 3 but by testing we found that size of 2 is the best for our system.\par
The complete system can be described in two stages: 1) Learning phase and 2) Testing phase.\par
In the learning phase, some reference faces are selected to create a knowledge base. Facial images are acquired directly from camera device. The next step is face detection in which face region from a total image is detected. Then the step is preprocessing in which necessary enhancement is applied to improve the quality of images. The next phase is the feature extraction in which face feature is extracted which is the form of 50×50 face image matrix. These features are fed into the neural network for training and after training the weights are saved as knowledge base.  
\section[{RESULT AND DISCUSSION}]{RESULT AND DISCUSSION}\par
At first to check the reliability of the system we use offline testing using ORL (Olivetti Research Laboratory) database [15] as well as our locally created database (Fig. \hyperref[fig_7]{8}), where the recognition rate was approximately 98\% and 94\% respectively. This rate of accuracy can be made high if the number iteration of backpropagation is 20000 or more. This accuracy also extensively depends on the sensing devices or camera and lighting conditions. If high quality camera is used and approximately constant lighting system can be managed then the recognition rate will increase. Finally, an attempt was made to recognize Human Faces using online interface, where as soon as any person present himself in front of the camera, the result of recognition procedure will be shown almost simultaneously frame by frame. For the online purpose we strictly try to reduce false recognition rather than In the testing phase, the system is allowed to recognize an unknown face. In this case, the all steps are done in the same way as in the learning stage before classification. In the phase of classification, the selected features having enough information within it are used to identify each facial image uniquely. This is done by the system using the knowledge base (weights) and extracted features of unknown face as input to the network. At the last step, final decision about the unknown face is taken by comparing the test output with the target defined for each person or class during training phase by specifying a threshold value for deciding 0 or 1 like target digit. Our proposed Backpropagation Network consists of one input layer of 2500 neurons, three hidden layers (855-500-30) and one output layer of 10 neurons. The Fig. \hyperref[fig_6]{7} shows our proposed Network:\par
unrecognizing. Due to the use of very high threshold (0.98) on the test output the chance of appearing false recognizing result is reduced but the rate of showing unrecognizing result was going high. 
\section[{VII.}]{VII.} 
\section[{CONCLUDING REMARKS}]{CONCLUDING REMARKS}\par
This system works predictably and fairly reliably. A face recognition system must be able to recognize a face in many different imaging situations. The appearance of a face in a 2D image is not only influenced by its identity but by other variables such as brightness, dimension and direction of face in photo. We have tested our project for slightly different directions. The performance of our online system heavily depends on the learning phase. With the increase of the number of faces per person of varying different directions and illuminations in the training phase, the result of recognition appearing more accurate. Our future work includes developing a new algorithm which will eliminate the drawbacks of this system by enhancing the capacity of the face database. For this purpose Clustered Network can be implemented.\begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}FFFigure 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{34}\includegraphics[]{image-4.png}
\caption{\label{fig_3}Figure 3 :Figure 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{fig_4}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{56}\includegraphics[]{image-6.png}
\caption{\label{fig_5}Figure 5 :Figure 6 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7}\includegraphics[]{image-7.png}
\caption{\label{fig_6}Figure 7 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{8}\includegraphics[]{image-8.png}
\caption{\label{fig_7}Figure 8 :}\end{figure}
 			\footnote{© 2012 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Roth et al. ()]{b9}\label{b9} 	 		‘A snow-based face detector’.  		 			D Roth 		,  		 			M Yang 		,  		 			N Ahuja 		.  	 	 		\textit{Advances in Neural Information Processing Systems 12 (NIPS 12)},  				2000. MIT Press. p. .  	 
\bibitem[Yang et al. ()]{b4}\label{b4} 	 		‘Detecting faces in images: A survey’.  		 			M.-H Yang 		,  		 			D Kriegman 		,  		 			N Ahuja 		.  	 	 		\textit{IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI)}  		2002. 24  (1)  p. .  	 
\bibitem[Nilsson et al. ()]{b3}\label{b3} 	 		‘Face Detection using Local SMQT Features and Split Up SNoW Classifier’.  		 			M Nilsson 		,  		 			J Nordberg 		,  		 			I Claesson 		.  		 \url{http://www.ieeexplore.ieee.org/}  	 	 		\textit{IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)},  				2007.  	 
\bibitem[Froba and Ernst (2004)]{b10}\label{b10} 	 		‘Face detection with the modified census transform’.  		 			B Froba 		,  		 			A Ernst 		.  	 	 		\textit{Sixth IEEE International Conference on Automatic Face and Gesture Recognition},  				May 2004. p. .  	 
\bibitem[Hjelmas and Low ()]{b5}\label{b5} 	 		‘Face detection: A survey’.  		 			E Hjelmas 		,  		 			B K Low 		.  	 	 		\textit{Computer Vision and Image Understanding}  		2001. 3  (3)  p. .  	 
\bibitem[Gonzalez and Woods ()]{b0}\label{b0} 	 		 			R Gonzalez 		,  		 			R Woods 		.  		\textit{Digital Image Processing},  				1991. Wiley and Sons Inc.  	 	 (2nd Edition) 
\bibitem[Sivanandam and Raj]{b2}\label{b2} 	 		\textit{Introduction to Artificial Neural Networks},  		 			S N Sivanandam 		,  		 			M Raj 		.  		 	 
\bibitem[Haun et al. ()]{b13}\label{b13} 	 		\textit{Morphological Neural Network Vision Processing for Mobile Robots},  		 			D Haun 		,  		 			K Hummel 		,  		 			M Skubic 		.  		 \url{http://www.ieeexplore.ieee.org/}  		1997.  		 			University of Missouri-Columbia 		 	 
\bibitem[Won ()]{b12}\label{b12} 	 		\textit{Morphological Shared-Weight Networks with Applications to Automatic Target Recognition},  		 			Y Won 		.  		 \url{http://www.ieeexplore.ieee.org/}  		1995. Daejon, South Korea: Electronics and Telecommunications Research Institute.  	 
\bibitem[Rowley et al. (1996)]{b6}\label{b6} 	 		‘Neural network-based face detection’.  		 			H Rowley 		,  		 			S Baluja 		,  		 			T Kanade 		.  	 	 		\textit{Proceedings of Computer Vision and Pattern Recognition},  				 (Computer Vision and Pattern Recognition)  		June 1996. p. .  	 
\bibitem[Schneiderman and Kanade (1998)]{b7}\label{b7} 	 		‘Probabilistic modeling of local appearance and spatial relationships for object recognition’.  		 			H Schneiderman 		,  		 			T Kanade 		.  	 	 		\textit{Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR '98)},  				 (the IEEE Conference on Computer Vision and Pattern Recognition (CVPR '98))  		July 1998. p. .  	 
\bibitem[Rafael et al.]{b1}\label{b1} 	 		 			C Rafael 		,  		 			Richard E Gonzalez 		,  		 			Woods 		,  		 			L Stevens 		,  		 			Eddins 		.  		\textit{Digital Image Processing using MATLAB},  				 	 
\bibitem[Viola and Jones ()]{b8}\label{b8} 	 		‘Rapid object detection using a boosted cascade of simple features’.  		 			P Viola 		,  		 			M Jones 		.  	 	 		\textit{Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR)},  				 (the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR))  		2001. 1 p. .  	 
\bibitem[Osuna et al. ()]{b11}\label{b11} 	 		‘Training support vector machines: an application to face detection’.  		 			E Osuna 		,  		 			R Freund 		,  		 			F Girosi 		.  	 	 		\textit{Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR '97},  				 (the IEEE Conference on Computer Vision and Pattern Recognition (CVPR '97)  		1997. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
