Similarity of inference face matching on angle oriented

Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 3, No.2, 2012

Similarity of Inference Face Matching On Angle Oriented
Face Recognition
R.N.V.Jagan Mohan1, R.SubbaRao2 and Dr.K.Raja Sekhara Rao3
1. Research Scholar, Acharya Nagarjuna University, Mobile: 91-9848957141,Email:mohanrnvj@gmail.com
2. Shri Vishnu Engineering College for Women, Bhimavaram-534202, Andhra Pradesh, India,rsr_vishnu@rediffmail.com.
3. Prinipal,K.L.University,Vaddeswaram,Guntur-522510,email:rajasekhar.kurra@klce.ac.in

Abstract: Face Recognition is a well-known image processing technique that has been used in many
applications like Law enforcement security, Bio-Metric Systems etc. In this paper complete image of face
recognition algorithm is proposed. In the prepared algorithm the local information is extracted using angle
oriented discrete cosine transforms and invokes certain normalization techniques. To increase the
Reliability of the Face detection process, neighborhood pixel information is incorporated into the proposed
method. Also this study analyzes and compares the obtained results from the proposed Angle oriented face
recognition with threshold based face detector to show the level of robustness using texture features in the
proposed face detector. It was verified that a face recognition based on textual features can lead to an
efficient and more reliable face detection method compared with KLT (Karhunen Loeve Transform), a
threshold face detector.

Keywords: Angle Oriented, Euclidian Distance, Face Recognition, Feature Extraction,
Image texture features.

Introduction
Many authors discussed the face recognition by comparing the face of human being with the database and
identifying the features of image. Face Recognition has received considerable attention over past two
decades, where variation caused by illumination is most significant factor that alerts the appearance of face
[15]. The database of system consists of individual facial features along with their geometrical relations. So
for the input taken the facial features are compared with the database. If a match is found the face of the
person is said to be recognized. In this process we consider feature extraction capabilities of discrete cosine
transform (DCT) and invoke certain normalization techniques which increase its robust face recognition.

The face recognition falls in to two main categories, Chellappa et al., 1995[5]; they are (i) feature-based
and (ii) holistic. Feature-based approach to face recognition relies on detection and characterization of the
individual facial features like eyes, nose and mouth etc, and their geometrical relationships. On the other
hand, holistic approach to face recognition involves encoding of the entire facial image. Earlier works on
face recognition as discussed by Ziad M.Hafed and Martin Levine 2001 [17], Ting Shan et al 2006 [14], are
considered. Alaa Y. Taqa and Hamid A. Jalab 2010 [1, 2] are proposed color-based or texture-based skin
detector approaches.

In this paper we discussed a new computational approach that is converting the input image to database
image using Angle orientation technique in section1. Section 2 deals with the mathematical definition of
the discrete cosine transform and its relationship to KLT. The basics of face recognition system using DCT
that includes the details of proposed algorithm and discussion of various parameters which affect its
performance are discussed in section 3. The experimental results of the proposed system are highlighted in
section 4.The conclusion and future perceptives are mentioned in section 5.

1. Angle Orientation

First the input image is selected and compared with the database image. If input image size is not
equivalent to database size, the input image is to be resized to match with the size of database image. We
compare the pose of the image in both input and database images. If the input image is not at an angle of

45

Vol 3, No.2, 2012
900 we can’t compare the images; some authors Ziad. M. Hafed and Martine D. Levine (2001) [17] used
eye coordinates techniques to recognize such an image. In this approach one can identify the feature images
of the faces even though they are angle oriented. If the input image angle is not 900, rotate the image to 900
and then apply normalization technique such as geometric and illumination technique. Recognition of an
image by using rotational axis is easy to achieve or recognize the face. When the input image rotates from
horizontal axis to vertical axis the face rotates anti-clock wise and the face appears in which it is the same
as the database pose, then the object is recognized. Similarly, when the input image rotates from vertical
axis to horizontal axis the face rotates clock wise and the face appears in which it is the same as the
database pose, then the object is recognized. Therefore if input image is Angle oriented, the pose is
changed or Angle is altered using rotational axis and then compared.

The Two types of angle rotations, clock wise and Anti-clock wise, with different angles are given in the
images of Figure.1.1 and Figure 1.2.

Figure1.1: Angle Rotation – Anti Clock Wise Direction

46

Vol 3, No.2, 2012
Figure1.2: Angle Rotation – Clock Wise Direction
2.0. Discrete Cosine Transform

Discrete cosine transform (DCT) has been used as a feature extraction step in various studies on face
recognition [8, 9, 11, 12, and 17]. Until now, discrete cosine transforms have been performed either in a
holistic appearance-based sense [7], or in a local appearance-based sense ignoring the spatial information to
some extent during the classification step by feeding some kind of neural networks with local DCT
coefficients or by modelling them with some kind of statistical tools [8,9,11,12,17].

Ahmed, Natarajan, and Rao (1974) first introduced the discrete cosine transform (DCT) in the early
seventies. Ever since, the DCT has grown in popularity, and several variants have been proposed (Rao and
Yip, 1990) [10]. In particular, the DCT was categorized by Wang (1984) [16] into four slightly different
transformations named DCT-I, DCT-II, DCT-III, and DCT-IV. Of the four classes we concern with DCT-II
suggested by Wang, in this paper.

(2.1.1)

Where

(2.1.2)

N is the length of x; x and y of the same size. If x is a matrix, DCT transforms its columns. The series is
indexed from n = 1 and k = 1 instead of the usual n = 0 and k = 0 because vectors run from 1 to N instead
of 0 to N-1.Using the formulae (2.1.1) and (2.1.2) we find the feature vectors of an input sequence using
discrete cosine transform.

2.1. Similarity Matching Methods

The main objective of similarity measures is to define a value that allows the comparison of feature vectors
(reduced vectors in discrete cosine transform frameworks). With this measure the identification of a new
feature vector will be possible by searching the most similar vector into the database. This is the well-
known nearest-neighbor method. One way to define similarity is to use a measure of distance, d(x, y), in
which the similarity between vectors, S(x, y) is inverse to the distance measure. In the next sub-sections
distance measures are shown (Euclidean) and similarity measures (Cosine).

Euclidean Distance

D(x, y) = √(x-y)T(x-y) ---4.0.1

Cosine Similarity

S(x, y) = cos (x, y) = (xTy/||x||.||y||) ---4.0.2

2.2. Relationship with KLT

Karhunen-Loeve Transform (KLT) is a unitary transform that diagonalizes the covariance or the correlation
matrix of a discrete random sequence. Also it is considered as an optimal transform among all discrete
transforms based on a number of criteria. It is, however, used infrequently as it is dependent on the

47

Vol 3, No.2, 2012
statistics of the sequence i.e. when the statistics changes so as the KLT. Because of this signal dependence,
generally it has no fast algorithm. Other discrete transforms such as cosine transform (DCT) even though
suboptimal; have been extremely popular in video coding. The principal reasons for the heavy usage of
DCT are that it is signal independent and it has fast algorithms resulting in efficient implementation. In
spite of this, KLT has been used as a bench mark in evaluating the performance of other transforms.
Furthermore, DCT closely approximates the compact representation ability of the KLT, which makes it a
very useful tool for signal representation both in terms of information packing and in terms of
computational complexity due to its data independent nature.

3. Basic Algorithm for Angle Oriented Face Recognition using DCT

The basic algorithm for Angle Oriented Face Recognition discussed in this paper is depicted in figure 3.1.
The algorithm involves both face normalization and Recognization. Mathew Turk and Alex Pentland [15]
expanded the idea of face recognition. It can be seen in the figure 3.1 that the system receives input image
of size N x N and is compared with the size of database image, if the input image and database image are
not equal, is to be resized the image. While implementing an image processing solution, the selection of
suitable illumination is a crucial element in determining the quality of the captured images and can have a
huge effect on the subsequent evaluation of the image. If the pose of the selected image is required to rotate
to obtain the database image rotate the face with an angle θ until it matches with the database image. The
rotation of the image may be bidirectional, clock wise or anti-clock wise, depending on the selected pose of
the image.

Once a normalized face obtained, it can be compared with other faces, under the same nominal size,
orientation, position, and illumination conditions. This comparison is based on features extracted using
DCT. The input images are divided into N x N blocks to define the local regions of processing. The N x N
two-dimensional Discrete Cosine Transform (DCT) is used to transform the data into the frequency
domain. Thereafter, statistical operators that calculate various functions of spatial frequency in the block
are used to produce a block-level DCT coefficient.

To recognize a particular input image or face, the system compares this image feature vector to the feature
vector of database faces using a Euclidean Distance nearest neighbor classifier [6] (Duda and Fart, 1973).
After obtaining the Euclidean Distances for N x N Matrix one needs to find the averages of the each
column of the matrix, and then find the average of all these averages, if the overall average is negative we
may say there is a match between the input image and database image.

48

Vol 3, No.2, 2012

Figure 3.1: Angle Oriented Face Recognition using DCT

4.0. Experimental Results
4.1. Clock wise Rotation
The experimental Results are calculated for various angles of θ in clock wise direction using the two
methods DCT with Euclidean Distance and DCT with Cosine Similarity. The mean recognition values of
two methods are measured. Out of a sample of 13 observations 12 are recognized. The percentage of
recognition for DCT with Euclidean distance and Cosine Similarity is 92.31% and the same for is 80%.

Figure 4.1.2: Graph for Clock wise Angle Oriented Face Recognition
Using DCT with Euclidean Distance and Cosine Similarity

49

Vol 3, No.2, 2012
The obtained data was presented in Figure 4.1.2. In Figure 4.1.2 the red line indicates the recognition level
for KLT and that of blue gives for DCT. It can be observed that the recognition level of input image in
DCT is very high. It is also noticed that as the sample size is increasing the recognition level is also
increasing in DCT while comparing with KLT.

4.2. Anti-Clock wise

The same methodology as that of clock wise rotation is maintained in anti-clock wise rotation, as well. The
mean recognition values of DCT with Euclidean distance and DCT with Cosine Similarity for the both
methods are calculated for several values of θ using Anti-Clock wise direction. In this method also DCT
with Euclidean Distance has shown high reliability of recognition level because the percentage of
recognition is 92.30% whereas the same is 85.46% in DCT with Cosine Similarity. In Figure 4.2.2 the
results are shown graphically, we can find the rapid decrease in the graph for DCT which showed with blue
colored line, indicates the high reliability of recognition of the input image.

Figure 4.2.2: Graph for Anti-Clock wise Angle Oriented Face
Recognition using Euclidean Distance and Cosine Similarity

4.3. Comparison between DCT and KLT

The DCT and KLT techniques are experimented under standard execution environment by considering the
synthesized data of the students of Sri Vishnu Educational Society. The Percentage of recognition level in
both the methods of experimental results is shown in Table 4.3.1. The phenomenal growth of DCT
reliability is observed when compared with KLT.

The Performance of recognition level of 10000 records for both the methods of experimental results is
given in Figure 4.3.2. The graph clearly shows that the reliability performance of DCT is constant
increasing with respect to KLT while the number of records is increased.

S. No. No. of records Performance in DCT Performance in KLT
1 1000 91.46 65.42

50

Vol 3, No.2, 2012
2 2000 92.01 64.23
3 3000 93.25 52.15
4 4000 94.12 54.12
5 5000 94.62 53.10
6 6000 96.5 52.63
7 7000 97.23 51.71
8 8000 97.56 50.46
9 9000 98.46 50.04
10 10000 98.89 54.13

Table 4.3.1: Performance Records in DCT and KLT

Figure 4.3.2: Bar Chart for Performance in DCT and KLT

5. Conclusion and Perspectives

Holistic approach to face recognition is used which has involved in encoding the entire facial image. An
angle oriented algorithm which can be rotated either clock wise or anti clock wise directions is proposed
and successfully implemented through the experimental results. The algorithm is proposed with the mean
values of the Euclidian classifiers. It is proved that the proposed angle oriented discrete cosine transform
increases the reliability of the face detection when compared with the KLT.

This approach has applications in Intrusion detection and new technologies like Biometric systems etc. The
authors view a random variable which indicates the magnitude of the recognition level of an image which
will follow some probability distribution.

References:

[1]. Alaa Y.Taqa, Hamid A.Jalab, “Increasing the Reliability of Fuzzy Inference System Skin Detector”
American Journal of Applied Sciences 7(8):1129-1138, 2010.

51

Vol 3, No.2, 2012
[2]. Alaa Y.Taqa, Hamid A.Jalab, ”Increasing the reliability of skin detectors” Scientific Research and
Essays Vol.5(17),PP.2480-2490,4 September,2010.

[3]. Almas Anjum, M., and Yunus Javed, M. “Face Images Feature Extraction Analysis for Recognition
in Frequency Domain” Proc. of the 6th WSEAS Int. Conf. on Signal Processing, Computational Geometry
& Artificial Vision, Elounda, Greece, 2006.

[4]. Annadurai, S., and Saradha, A. “Discrete Cosine Transform Based Face Recognition Using Linear
Discriminate Analysis” Proceedings of International Conference on Intelligent Knowledge Systems, 2004.

[5]. Chellappa, R., Wilson, .C, and Sirohey, S. 1995. Human and machine recognition of faces: A survey.
In Proc. IEEE, 83(5):705-740.

[6]. Duda, R.O., and Hart, P.E. 1973 Pattern Classification and Scene Analysis. Wiley: New York, NY.

[7]. Ekenel, H.K., and Stiefelhagen, R. “Local Appearance based Face Recognition Using Discrete Cosine
Transform”, EUSIPCO 2005, Antalya, Turkey, 2005.

[8]. Nefian, A. “A Hidden Markov Model-based Approach for Face Detection and Recognition“, PhD
thesis, Georgia Institute of Technology, 1999.

[9]. Pan, Z., and Bolouri, H. “High speed face recognition based on discrete cosine transforms and neural
networks”, Technical report, University of Hertfordshire, UK, 1999.

[10]. Rao, K. and Yip, P. 1990. Discrete Cosine Transform-Algorithm, Advantages, Applications.
Academic: New York, N.Y.

[11]. Sanderson, and Paliwal, K.K. “Features for robust face based identity verification”, Signal processing,
83(5), 2003.

[12]. Scott, W.L. “Block-level Discrete Cosine Transform Coefficients for Autonomic Face Recognition”,
P.hd thesis, Louisiana State University, USA, May 2003.

[13]. Shin, D., Lee, H.S., and Kim, D. “Illumination-robust face recognition using ridge regressive
bilinear models”, Pattern Recognition Letters, Vol.29, no.1, pp, 49-58, 2008.

[14]. Ting Shan, Brain, Lovell, C., and Shaokang Chen. “Face Recognition to Head Pose from One sample
Image” proceedings of the 18th International conference on Pattern Recognition, 2006.

[15].Turk, M., and Pentland, A. “Eigen faces for recognition”, Journal of Cognitive Neuroscience, vol.3,
no.1, pp.71-86, 1991.

[16]. Wang, Z. 1984. Fast algorithms for the discrete W transform and for the Discrete Fourier Transform.
IEEE Trans. Acoust., Speech, and Signal Proc., 32:803-816.

[17]. Ziad Hafed, M., and Martin Levine, “Face Recognition using Discrete Cosine Transform”,
International Journal of Computer Vision 43(3), 167-188, 2001.

52

Similarity of inference face matching on angle oriented

More Related Content

What's hot (15)

Viewers also liked (20)

Similar to Similarity of inference face matching on angle oriented (20)

More from Alexander Decker (20)

Recently uploaded (20)

Similarity of inference face matching on angle oriented