\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={Implementation of Back Propagation Neural Network with PCA for Face Recognition},
 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{2019-01-15 (revised: 15 January 2019)}
\def\TheID{\makeatother }
\def\TheDate{2019-01-15}
\title{Implementation of Back Propagation Neural Network with PCA for Face Recognition}
\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]{Md. Manik  Ahmed}

             \author[2]{A F M Zainul  Abadin}

             \author[3]{A F M Zainul  Abadin}

             \author[4]{Md. Imran  Hossain}

             \affil[1]{  Rabindra Maitree University, Kushtia, Bangladesh.}

\renewcommand\Authands{ and }

\date{\small \em Received: 8 December 2018 Accepted: 1 January 2019 Published: 15 January 2019}

\maketitle


\begin{abstract}
        


Face recognition is truly one of the demanding fields of biometric image processing system. Within this paper, we have implemented Back Propagation Neural Network for face recognition using MATLAB, where feature extraction and face identification system completely depend on Principal Component Analysis (PCA). Face images are multidimensional and variable data. Hence we cannot directly apply Back Propagation Neural Network to classify face without extracting the core area of face. So, the dimensionality of face image is reduced by the Principal Component Analysis algorithm then we have to explore unique feature for all stored database images called eigenfaces of eigenvectors. These unique features or eigenvectors are given as parallel input to the Back Propagation Neural Network (BPNN) for recognition of given test images. Here test image is taken from the integrated webcam which is applied to the BPNN trained network. The maximum output of the tested network gives the index of recognized face image. BPNN employing PCA is more robust and reliable than PCA based face recognition system.

\end{abstract}


\keywords{face detection, face recognition, principal component analysis (PCA), eigenfaces, back propagation neural network (BPNN).}

\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
he human face represents a significant role in our social conversation, contain people's identity. In the past several years, Face recognition has been regarded as an important research subject in the area of Digital image processing (DIP) and Computer Vision mainly because of over growing security demand and both law or non-law enforcement.\par
The human face plays an important role in our social interaction; also contain people's identity and emotions among them. The human faces represent complex, multidimensional, meaningful visual stimulant. Developing a computational model for face recognition is difficult \hyperref[b0]{[1]}.\par
The primary approach for face recognition is face detection. It is easy and efficient for highly correlated biological neuron in the human brain. Even a small child can perfectly authenticate a human but it is difficult task for a computer. Here we present a mathematical model and computational model for face recognition that act as like as a human brain.\par
Due to the variational behavior of human face image, we need to extract unique feature. There are numerous strategies applied for this purpose. In this paper we have used principal component analysis algorithm to extract feature called Eigenfaces by modifying the image into one column and building a single matrix i.e. we must find the axis in which covariance matrix is diagonal or we determine a direction or a new axis where the data variation is the greatest. Then we find another direction where the remaining data variation is the greatest. But this two axes or direction is orthogonal from one another. The objective of PCA is usually to decrease the dimensionality of the image while retaining as a lot of information as possible in the original image. Using PCA we have calculated eigenface then all database face image projected on this eigenface space and we got a new face descriptor or feature vectors or weights matrix.\par
The eigenfaces or the principal Components of the faces are eigenvectors of the matrix and it is the eigenvectors. This combination of eigenvectors parallely given to the Back Propagation Neural Network input neuron. Training process in BPNN happens by back propagate the error and adjusting weights of each and every link. After training and testing is done by test image applied to the fully trained network. The maximum value of the tested network gives the recognized image index.\par
Face image is actually a biometrics physical feature which is used to verify the individuality of people. The main components involved in the face image space include mouth, nose, and eyes. Among various biometrics characteristics face is the most physical entity for identify among people \hyperref[b1]{[2]}. Face identification can be done significantly by capturing devices using digital cameras or webcam. 
\section[{II.}]{II.} 
\section[{Literature Review}]{Literature Review}\par
This section quickly discusses the pattern recognition process and after that highlights some of the current research in the area of autonomous face recognition. Traditionally, pattern recognition is split up three areas: (1) segmentation, (2) feature extraction, and (3) classification \hyperref[b2]{[3]}. Segmentation is the first step; it is finding regions of possible signals. The second stage is feature extraction and in this task we search for the most T An image is a two dimensional function I(x, y); so we consider the 2D case where we have an input image and compare this with the database to achieve the recognition goal. We also consider that the images are all of the same resolution. Each pixel can be regarded as a variable thus we have a very large dimensional problem which can be simplified by PCA. In image recognition an input image or test image with n×n pixels can be considered as a point inn 2 dimensional space called the image space. The coordinates of this point describes the values of each and every pixel of the image and form a column vector. This vector is formed by concatenating each column of 306×251resolution image; it will dimension 76806 so form of the vector is 76806 rows and 1 column.\par
After face database D is set then all images in the face database reshape to vector and forming a matrix which indicate the image matrix where number of column equal to the number of face image in database or training set. Here we have M images each with n 2 pixels. We can write our entire data set as an n 2 ×M data matrix D. Each column of D represents one image of our data set. Then concatenate column images form into one matrix. Test image from webcam important or significant features of the regions passed by the segmentor which can be used in the last step, classification. Classification analyzes the extracted features to those of previously identified objects and identifies the object as one of the previously identified classes.D = \{Î?" 1 , Î?" 2 , Î?" 3 , ? ? ? , Î?" M \}\textbf{(1)}\par
recognition \hyperref[b3]{[4]}. The first approach is local based, this approach based on some number of distinct feature on the face are recorded manually or through feature extraction modules. The features used in local based face recognition are the nose position, nostril position, eye brows positions, eyes position, mouth position and chin position etc. This data is then processes usually either through the neural network or some statistical method is used for the recognition process. Yullie and Cohen used deformable templates in contour extraction of face images \hyperref[b4]{[5]}. Another approach is holistic based, in this approach; the whole face is used for face recognition instead of taking only some local data. This may include a simple template matching or more sophisticated method such as PCA based method to extract the principle components for that huge set of data and reduced it into a smaller group of data. Matthew Turk and Alex Pentland, from the Massachusetts Institute of Technology Media Lab, have implemented this system for face recognition that also makes use of the Karhunen-Lobve Transform \hyperref[b0]{[1]}. 
\section[{III.}]{III.} 
\section[{Methods and Methodologies}]{Methods and Methodologies}\par
Our proposed technique based upon Principal Component analysis and Back Propagation Neural Network multilayer Classifier. Our proposed block diagram of face recognition procedure is as shown Figure \hyperref[fig_0]{1}. 
\section[{a) Preprocessing and Face Database}]{a) Preprocessing and Face Database}\par
The preprocessing of the images are Image size normalization, Histogram equalization, Median filtering and conversion RGB image to gray scale image. This module automatically takes same dimension image and perform preprocessing step in order to improve face recognition performance. The first criteria for face recognition is create a face database which contains all face images for training. There are two step to create face database: first, one is image taken from the live webcam and stored it to face database. Another one is image taken from a folder or disk storage or another external memory. Suppose total number of face image in this database is 'M'. Another important thing we should take all images in same dimension. In our system we take all image in the dimension of 306×251.\par
There are broadly two approaches used in face Then we calculated mean image of whole face image in database using the reshaped face matrix. We accomplished this by finding a mean image ? by averaging the columns of D matrix.? = 1 M ? Î?" n M n=1\textbf{(2)}\par
The calculation process is, Mean image = ? Column of reshaped face matrix 
\section[{Total number of column}]{Total number of column}\par
We need to adjust the images by subtract the computed average image from each image in the database. Consequently, the origin is moved to the mean of the data and this creates the mean centered data matrix.? i = Î?" i ? ?\textbf{(3)}\par
So the Adjusted image matrix is,A=[? 1 ,? 2 ,? 3 ,? 4 ????.? M ]\textbf{(4)}\par
These Adjusted images determine how each of the images in database differs from the average face.\par
We need calculate the M×M matrix to find its eigenvalues and eigenvectors and we selected the k eigenvectors with the highest related eigenvalues. As a property to the eigenvector, each of them has an eigenvalue associated with it. More valuable eigenvectors with greater eigenvalues supply more information on the face variation than those with smaller eigenvalues. Here images are matrix represented so we must need to compute covariance matrix of image matrix for determine the eigenvector. It is extremely simple to compute the covariance matrix from the mean centered data matrix. So, the equation of covariance matrix is,C = 1 M ? ? n ? n T M n=1 (5) = AA T\par
But Here a little problem in the output of covariance matrix. Where matrix dimension n 2 × n 2 that is too big, even it exceeds the total quantity of face images in the database and also break the condition eigenface ? M.\par
Then the correct calculation of eigen vectorV i of A T A A T AV i =? i * U i\textbf{(6)}\par
Eigenvectors with smaller eigenvalues lead tiny information in the data representation. Now compute the M best eigenvectors from covariance matrix and keep exactly the K eigenvectors equivalent to the K largest eigenvalues.To calculate the eigenfaces, the normalized or mean centered face multiplied with the highest eigenvector. These vectors describe the linear combinations of the M training set of stored face images which is called eigenfaces U i .U i = ? V k ? k M k=1\textbf{(7)}\par
Once the eigenfaces are taken from the covariance matrix of a collection of faces, every single face is projected onto the eigenface space and represented with a linear combination of the eigenfaces or provide a new descriptor related to a point under the high dimensional space with the eigenfaces as axes. A new face is turned into its eigenface components. Primary we compare our input image with our mean image and multiply their difference with each eigenvector. Every single value would represent a weight and would be saved on a vector ?.? k = U k T (Î?" ? ?)\textbf{(8)}\par
Where, k = 1??..M. This represents a set of point which determined by image multiplications and summations operations executed at approximately frame rate on current image processing hardware. The weights form a feature vector calculated from the above \hyperref[b7]{(8)} where each image project on the each of the eigenfaces. So, the new face descriptor is,? T = ?? 1 , ? 2, ? 3 ? ? ? . ? M ?\textbf{(9)}\par
That describes the best contribution of every eigenfaces in addressing the input face image. The vector are able to be used in a conventional pattern recognition algorithm to find out what of a number of predetermined face class if any best describes the face. The face class can be calculated by averaging the weight vectors for the images of a single person face. 
\section[{c) Face Detection}]{c) Face Detection}\par
The image of a face when projected into the face space does not radically change, while non-face image projection is quite different. Basic idea is always to detect the existence of a face in a scene by calculating the distance from face space. If distance is low then it is a face.\par
For an unknown image Î?", compute the mean centered image? = Î?" ? ?\textbf{(10)}\par
Now every face inside the training database set (minus the mean), ? i can be described as a linear combination of these Eigenvectors or eigenfaces.? i =? (? i U i ) k i=1 (11)\par
These weights may be computed as,? i = U i T ? i (12)\par
Then compute the Euclidean distance e d of unknown image from face Space.e d = ?? ? ? i ?\textbf{(13)}\par
If e d is less than specific threshold then Î?" is a face d) Face Reconstruction Each Normalized face ? i in A can be represented as a linear combination of the best k eigenvectors. So face reconstruction is very easy process by using eigenvectors. First we need to calculate weighted sum of all eigenfaces which is the reconstructed original image is equivalent to sum of all eigenfaces with every eigenface contain a certain weight. This weight describes to what amount of specific feature is present in the original image. If one face uses all the eigenfaces which is obtained from original face images it is possible to rebuild the main images from the eigenfaces exactly. Then this reconstructed image is definitely an approximation of the original image. Now every face inside the training database set (minus the mean), ? i can be described as a linear combination of these Eigenvectors or eigenfaces.? i =? (? i U i ) k i=1 (14)\par
These weights may be computed as,? i = U i T ? i (\textbf{15})\par
Where i = 1, 2... M. This means we have to calculate such a vector corresponding to every image in the training set and store them as template. In? i , where i is a number which indicates that which person face we want to reconstruct 
\section[{e) Back Propagation Neural Network}]{e) Back Propagation Neural Network}\par
In 1986, a group of scientists led by Rumelhart. J.L. McClelland and D.E. put forward a type of error back-propagation algorithm for training multilayer feedforward neural network, which is one of the widely used networks \hyperref[b5]{[6]}. The generalized delta rule  {\ref [7 8}] also referred to as backpropagation algorithm criteria is explained here briefly for feed forward neural network (NN). The NN explained here consist of 3 layers. This 3 layer are input, hidden, and output Layers. During the training phase, the training data is fed parallel to the input layer. The data are propagated to the hidden layer and then to the output layer. This process is known as the forward move of the BPNN algorithm. The error involving in actual output values and target output values is calculated and propagated back toward hidden layer to input layer. This process is known as the backward move of the BPNN algorithm. 
\section[{f) BPNN Algorithm}]{f) BPNN Algorithm}\par
The back propagation algorithm performs like this,\par
Step 1: First apply the inputs to the network to get the network output simply. Now remember this initial output could be anything, as the initial weights were random numbers between -0.3 to 0.3.\par
Step 2: For every node of output, simply calculate the error. The error is what you want -What you actually get. In other words,? K = ? K (1?? K )(? K ? T)\textbf{(16)}\par
The ? K (1?? K ) term is essential in the equation due to the Sigmoid Function, if we were only using a threshold neuron it would just be(? K ? T).\par
Step 3: Then calculate the Errors for theneurons of hidden layer.? J = ? K (1?? K ) ? ? K W JK k?K (17)\par
Where,W JK is the weight between layers J to layer K.\par
Step 4: For every Iteration, Update the weights and biases are as follows Updated weight, ?W = ??? l ? l?1 Updated Bias, ?? = ??? l\par
Where negative signs determine back propagate the errors and the constant ?is the learning rate is put in to speed up or slow down the learning if required. Then apply, W + ?W ? W ? + ?? ? ?\par
Step 5: Having acquired the Error for that hidden layer neurons now proceed as in step 4 to change the hidden layer weights. By reiterating this method, we can train a network of any number of layers. Back Propagation Neural network is broadly used pattern classification algorithm which reverse propagates the error and adjusts the weights to near the target output. 
\section[{g) Face Recognition Using BPNN}]{g) Face Recognition Using BPNN}\par
After feature extraction we have to create neural network. We created neural network one for each person in the database. Then extracted feature vectors are fed as inputs to train each person's networks.\par
In training, the faces feature vectors that belong to same person are used as positive examples for the person's network i.e. network gives 1 as output, and negative examples for the others network i.e. Network gives 0 as output which the target value were. The algorithm used to train the network is the back propagation Algorithm. The basic idea with the back propagation algorithm is to use gradient descent to update the weights so as to minimize the mean squared error between the network output values and the target output values. The update procedures are derived by taking the partial derivative from the error function with regards to the weights to find out each weight's contribution to the error. Then every weight is modified using gradient descent based on its participation to the error. The activation or transfer function use in Back Propagation neural network is sigmoid function which maps the output 0 to 1. With the effective operation of the back propagation network it is necessary for the appropriate selection of the parameters used for training. We have used initialize weights between -0.3 to 0.3 and here number of output neuron equal to number of input neuron because each network equal to the one person. In this training process we keep the learning rate 0.05 and hidden neuron 50.Also we have an option to change the hidden neuron for every execution. Here too few hidden units will prevent the network from being able to learn the required function, because it will have too few degrees of freedom. Too many hidden units may cause the network have a tendency to over fit the training data thus reducing generalization accuracy. Though learning rate is low but it gives the better accuracy than highest one. Additionally a small learning rate is used to avoid main disruption of the direction of learning when extremely unusual pair of training patterns is presented. When neural network met the stopping condition then it stops and gives the train output.\par
In testing, a new image is taken for recognition from face database or live webcam. We reshape this image to vector and calculated normalized image. This normalized face images are compared with the reconstructed face image. If Euclidian distance between two images is minimum or less than predefined threshold, then it is face otherwise this is not face. If this is face, then we are ready for testing the human face for recognition.\par
Before testing we need to extract feature of this unknown human face. Its feature vectors are determined from the eigenfaces identified before, and this image receives its new descriptors. These new descriptors are inputted to each network and also the networks are simulated using these descriptors. The network outputs are compared. If the maximum output exceeds the predefined threshold level, then this new face is decided to belong to person with this maximum output. 
\section[{IV. EXPERIMENTAL RESULTS AND DISCUSSIONS}]{IV. EXPERIMENTAL RESULTS AND DISCUSSIONS}\par
The Graphical User Interface was constructed using MATLAB GUIDE or Graphical User Interface Design Environment. Using the layout tools provided by GUIDE, we have designed the following graphical user interface figure (mainguinn.fig) for the face recognition user application.   V. 
\section[{CONCLUSION}]{CONCLUSION}\par
In this paper, Eigen face represented features vectors are used for face recognition. The features are obtained from the face image to shows unique identity of human face utilized as inputs to the neural network for classification. Eigenfaces are the most significant feature and reduce the size of input of neural network. This system performs human face recognition at a very high degree of accuracy. We encountered several problems in these experiments due to the lighting variation. However, we can overcome this issue by normalize the illumination. This is a biometric system and the work can be surely used in biometric applications like access control and verification systems. \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Fig. 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{23}\includegraphics[]{image-3.png}
\caption{\label{fig_2}Fig. 2 :Fig. 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7}\includegraphics[]{image-4.png}
\caption{\label{fig_3}Fig. 7 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{849}\includegraphics[]{image-5.png}
\caption{\label{fig_4}Fig. 8 :Fig. 4 :Fig. 9 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{10}\includegraphics[]{image-6.png}
\caption{\label{fig_5}Fig. 10 :}\end{figure}
 			\footnote{© 2019 Global Journals} 			\footnote{© 2019 Global Journals Implementation of Back Propagation Neural Network with PCA for Face Recognition} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Prakash (2013)]{b1}\label{b1} 	 		‘An Efficient Back Propagation Neural Network Based Face Recognition System Using Haar Wavelet Transform and PCA’.  		 			Ravi Prakash 		.  	 	 		\textit{international Journal of research review in engineering science and technology}  		June 2013. 2  (2) .  	 
\bibitem[He ()]{b5}\label{b5} 	 		‘Application Research of BP neural network in face recognition’.  		 			Yong He 		.  	 	 		\textit{International Conference on Information Sciences, Machinery, Materials and Energy},  				2015.  	 
\bibitem[Turk and Petland ()]{b0}\label{b0} 	 		‘Eigenfaces for Recognition’.  		 			M A Turk 		,  		 			A P Petland 		.  	 	 		\textit{Journal of Cognitive Neuroscience}  		1991. 3 p. .  	 
\bibitem[Yuille et al. ()]{b4}\label{b4} 	 		‘Feature extraction from faces using deformable templates’.  		 			A L Yuille 		,  		 			D S Cohen 		,  		 			P W Hallinan 		.  	 	 		\textit{Proc. of CVPR},  				 (of CVPR)  		1989.  	 
\bibitem[Nazari et al. (1992)]{b7}\label{b7} 	 		\textit{Implementation of back-propagation neural networks with MatLab},  		 			Jamshid Nazari 		,  		 			K Okan 		,  		 			Ersoy 		.  		Jan 1992.  	 
\bibitem[Rumelhart et al. ()]{b6}\label{b6} 	 		‘Leaning Internal Representaions by Ewvr Propagation in Rumelhart’.  		 			D E Rumelhart 		,  		 			G E Hinton 		,  		 			R J E Williams ; D 		,  		 			J L Mcclelland 		.  	 	 		\textit{Pamllel Distributed Processing: Explorations in the Microstructure of Cognition},  				 (Cambridge Massachusette)  		1986. MIT Press.  	 
\bibitem[Tou et al. ()]{b2}\label{b2} 	 		\textit{Pattern Recognition Principles},  		 			Julius C Tou 		,  		 			C Rafael 		,  		 			Gonzalez 		.  		1974. Addison Wesley Publishing.  	 
\bibitem[Gul ()]{b3}\label{b3} 	 		\textit{The graduate school of natural and applied science of the middle east technical university},  		 			A B Gul 		.  		2003. p. 121.  	 	 (Holistic face recognition by dimension reduction) 
\end{bibitemlist}
 			 		 	 
\end{document}
