Академический Документы
Профессиональный Документы
Культура Документы
Abstract - The paper deals with 5 different techniques for recognition system. As a result, to improve the
feature extraction of face. First-step in face recognition recognition performance of such systems one has to
systems is face detection, with purpose of localizing and enhance these operations. Prior to classification, the
extracting the face region from the background. Self- features should be extracted from the human face images.
Organizing Map (SOM) Neural Network has been used for Feature extraction in the sense of some linear or nonlinear
training of database and simulation of FR system. The
transforms of the face images with subsequent feature
algorithm developed for the face recognition system and an
image-based approach is formulated, using Directional selection is commonly used for reducing the
Discrete Cosine Transform (DDCT), Discrete Wavelet dimensionality of these images so that the extracted
Transform (DWT), Discrete Cosine Transform (DCT) , features are as representative as possible. However, the
Sobel Edge Detection and DCT-Pyramid Transform (DCT- problem of extracting features from a human face remains
PT) , simulated in MATLAB. Simulation results are very a barrier to apply the practical applications, since it is
promising. influenced by the lighting condition, illumination
changes, various backgrounds and individual variations.
Keywords - Face Recognition (FR), Directional Discrete
Cosine Transform (DDCT), Discrete Cosine Transform (DCT), Recently, several methods for feature extraction have been
Discrete Wavelet Transform (DWT), Sobel Edge Detection proposed [1-5]. Of these reported techniques, the principle
(SED), SOM Neural Network, DCT-PT.
component analysis (PCA)) [1] and linear discriminant
analysis (LDA) [2] are regarded to be the well known
1. Introduction feature extraction methods. PCA linearly projects the
image space along the direction of maximal variance into
The automatic recognition of people is a challenging a low-dimensional subspace. These methods are statistical
problem which has received much attention during the linear projection methods which largely rely on the
recent years due to its many applications in different representation of the training samples. Major drawbacks
fields. Face recognition is one of those challenging with these techniques are the performance drop of face
problems and up to date, there is no technique that recognition whenever face appearances are subject to
provides a robust solution to all situations and different variations by factors such as illumination, expression,
applications that face recognition may encounter. Face pose, accessories and aging. Moreover, they require
recognition has several characteristics that are intensive computations in determining the basis space for
advantageous for consumer applications. In addition to, a large number of images and when adding new images to
the need for an automatic face recognition system a facial image database. On the other hand, multi-
especially in the field like at the border control, airports resolution techniques have been used for feature
etc. is becoming very important to strengthen the security extraction in many face recognition systems [58].
check. Generally, feature extraction and classification Among them, the most popular are the discrete wavelet
criterion are the two basic operations of any face transform (DWT). 2D DWT has been used in various face
Rohit Giri is M.Tech Scholar with the Department of Electronics & Communication Engineering, Mewar University, Chittorgrah , Rajasthan ,India (e-
mail: goswami.rohit41@gmail.com).
Mahendra Kumar is Faculty with Department of Electronics & Communication Engineering, University College of Engineering, RTU, Kota, India.
(Corresponding author e-mail: miresearchlab@gmail.com).
Shilpa Jangid is Faculty with the Department of Electronics & Communication Engineering, Mewar University, Chittorgrah , Rajasthan ,India ( e-mail
:shilpa.jangid08@gmail.com).
IJCSN International Journal of Computer Science and Network, Volume 5, Issue 5, October 2016
ISSN (Online) : 2277-5420 www.IJCSN.org
Impact Factor: 1.02
764
Once the feature vectors for all existing images are n1 = IW11 p
developed the new database consist of all feature vectors
is formed and then stored inside our storage device. To a1 = compet(n1 )
retrieve all images that are similar to the target image, we
must extract the features of the target image and compare
it with all features vectors. Discrete cosine transform So, when a vector p is presented, the weights of the
(DCT) is a powerful transform to extract proper features winning neuron and its close neighbours move toward p.
for face recognition. After applying DCT to the entire face Consequently, after many presentations, neighbouring
images, some of the coefficients are selected to construct neurons learn vectors similar to each other[16]. Hence,
feature vectors. the SOM network learns to categorize the input vectors it
sees.
3. Self-Organizing Map (SOM) Neural
Network The SOM network used here contains N nodes ordered in
a two-dimensional lattice structure. In these cases, each
3.1 Network Architecture node has 2 or 4 neighboring nodes, respectively.
Typically, a SOM has a life cycle of three phases: the
In Network Architecture , SOMs can be one-dimensional, learning phase, the training phase and the testing phase.
two-dimensional or multi-dimensional maps. The number
of input connections in a SOM network depends on the IV. Proposed DCT Based Laplacian Pyramid
number of attributes to be used in the classification [14]. Transform
Laplacian pyramid: The Laplacian pyramid was first
introduced as a model for binocular fusion in human
stereo vision [3], where the implementation used a
Laplacian pyramid and a maximum selection rule at each
point of the pyramid transform. Essentially, the procedure
involves a set of band-pass copies of an image is referred
to as the Laplacian pyramid due to its similarity to a
Laplacian operator. Each level of the Laplacian pyramid
is recursively constructed from its lower level by applying
the following four basic steps: blurring (low-pass
filtering);sub-sampling (reduce size); interpolation
Fig 2: Architecture of a simple SOM Neural Network [15] (expand); and differencing (to subtract two images pixel
by pixel). In the Laplacian pyramid, the lowest level of
The input vector p shown in fig. 2 is the row of pixels of the pyramid is constructed from the original image [5].
the input compressed image. The ||dist|| box accepts the
input vector p and the input weight matrix IW1, 1, which Discrete Cosine Transform (DCT)
produces a vector having S1 elements. The elements are
the negative of the distances between the input vector and The Discrete cosine transform (DCT) is an important
vectors iIW1,1 formed from the rows of the input weight transform in image processing. Large DCT coefficients
matrix. The ||dist|| box computes the net input n1 of a are concentrated in the low frequency region; hence, it is
competitive layer by finding the Euclidean distance known to have excellent energy compactness properties.
between input vector p and the weight vectors. The The 2D discrete cosine transform Z (u, v) of an image or
competitive transfer function C accepts a net input vector 2D signal z(x, y) of size MxN is define as:
for a layer and returns neuron outputs of 0 for all neurons
except for the winner, the neuron associated with the most
positive element of net input n1. The winners output is 1.
The neuron whose weight vector is closest to the input
vector has the least negative net input and, therefore, wins
the competition to output a1. Thus the competitive transfer
function C produces a 1 for output element a1i
corresponding to i*, the winner. All other output
elements in a1 are 0[16].
IJCSN International Journal of Computer Science and Network, Volume 5, Issue 5, October 2016
ISSN (Online) : 2277-5420 www.IJCSN.org
Impact Factor: 1.02
766
4. Experimental Results
4.1 Image Database
performed on all 5 test images to form the input data for TABLE 1
FACE RECOGNITION RATE AT EPOCH=1000
testing the recognition system. Similarly, the image
Techniq Test Test Test Test Test Test Recogn
database for training uses 30 images and forms a matrix ue Img 1 Img 2 Img 3 Img Img Img 6 ition-
of 64 30 with 64 rows and 30 columns. The input 4 5 rate
vectors defined for the SOM are distributed over a 2D- SED NR R R R R R 84.33%
input space varying over [0 255], which represents
DCT R R R R R R 100%
intensity levels of the gray scale pixels. These are used to
train the SOM with dimensions [64 2], where 64 DWT R R R R R R 100%
minimum and 64 maximum values of the pixel intensities DDCT R R R R R R 100%
are represented for each image sample. The resulting DCT- R R R R R R 100%
SOM created with these parameters is a single-layer feed PT
forward SOM map with 128 weights and a competitive
transfer function. The weight function of this network is 5. Conclusion
the negative of the Euclidean distance [13]. As many as 5
test images are used with the image database for This paper presents a novel face recognition technique
performing the experiments. Training and testing sets that uses features derived from DCT-PT, DDCT, DCT,
were used without any overlapping Fig. 4 shows the result DWT, Sobel coefficients, along with a SOM-based
of training and testing simulated in MATLAB using the classifier. The system was evaluated in MATLAB using
image database and test input image. an image database of 30 face images, containing six
subjects and each subject having 5 images with different
facial expressions. After training for approximately 1000
epochs the system achieved a recognition rate of as shown
in table 1 for 5 consecutive trials. A reduced feature
space, described for experiment, dramatically reduces the
computational requirements of the methods. DCT-PT
feature extraction method gives better results compared to
DDCT, DWT, DCT and SED methods as shown in table
2. This makes our system well suited for high speed, low-
cost, real-time hardware implementation.
Fig 5: For DDCT: (a) SOM Layer Vector (b) Weight Vector
IJCSN International Journal of Computer Science and Network, Volume 5, Issue 5, October 2016
ISSN (Online) : 2277-5420 www.IJCSN.org
Impact Factor: 1.02
768
[24] M. Kumar et. Al., Comparative Study Of Different [28] Mahendra Kumar et. al., Image Fusion based on the
Classifiers Based Speaker Recognition System Using Modified Curvelet Transform In International
Modified MFCC For Noisy Environment, Conference on Smart Trends for Information
International Conference Green Computing and Technology and Computer Communications
Internet of Things (ICGCIoT - 2015) 08-10 Oct., 2015, (SmartCom 2016), Jaipur, India, 6 7 August, 2016.
Delhi, IND. (Proceeding in CCIS Series of Springer ) (ISSN
[25] M. Kumar et. Al., Robust Digital Image Number - 1865-0929).
Watermarking using DCT based Pyramid Transform [29] Mahendra Kumar et. Al., Robust Image Fusion
via image compression, 4th IEEE International based on Optimal Cuve-let Transform, IEEE
Conference on Communication and Signal Processing International Conference on Micro-Electronics and
(ICCSP 2015) 02-04 April 2015 - Melmaruvathur, Telecommunication Engineering 22 & 23, September,
TN, IND. 2016 (ICMETE-2016) 22-23 Sept. 2016 - SRM
[26] Swati Jadon et. Al.,Face Recognition Using SOM University, Modinagar, UP, IND. (Accepted)
Neural Network with DDCT Facial Feature Extraction [30] Mahendra Kumar et. Al., Image Fusion Based On
Techniques, 4th IEEE International Conference on Hybrid SPIHT and SOMA, IEEE International
Communication and Signal Processing (ICCSP 2015) Conference on Micro-Electronics and
02-04 April 2015 - Melmaruvathur, TN, IND. Telecommunication Engineering 22 & 23, September,
[27] Reema Jain et. Al., Digital Image Watermarking 2016 (ICMETE-2016) 22-23 Sept. 2016 - SRM
using Hybrid DWT - FFT Technique with Different University, Modinagar, UP, IND.
Attacks, 4th IEEE International Conference on
Communication and Signal Processing (ICCSP 2015)
02-04 April 2015 - Melmaruvathur, TN, IND.
TABLE 2
COMPARISON AT EPOCH=1000
Technique Time Test Img 1 Test Img 2 Test Img 3 Test Img 4 Test Img 5 Test Img 6 Remarks
(Speed)