[ijeta-v2i5p4]: priyanka kumbham, dr. g. r. sakthidharan

International Journal of Engineering Trends and Applications (IJETA) – Volume 2 Issue 5, Sep-Oct 2015

ISSN: 2393 - 9516 www.ijetajournal.org 7

RESEARCH ARTICLE OPEN ACCESS

Face Recognition Using LAPP Algorithm Priyanka Kumbham [1], Dr. G. R. Sakthidharan[2]

M.Tech Student [1], Associate Professor [2]

Department of Computer Science and Engineering

Gokaraju Rangaraju Institute of Engineering and Technology

Telangana – India

ABSTRACT

In the proposed work it is aimed to find the influence of local information on facial image and use them for effective

recognition. Local Active Pixel Pattern (LAPP) is one of the approaches capable of supporting face recognition for

using conventional and resource constraint environment. Active pixel is one which denotes the essential information

of images. Active pixel approach is aimed to consume fairly small amount of memory and processing power fo r

performing face recognition. For computation of active pixel Brody transform is used. Brody transform extracts

information from images. Brody transform helps to construct active pixel pattern matrix. Brody Transform provides

cyclic shift invariance, dyadic invariance and graphical inverse of input pattern. The transformed data is independent

of cyclic shift of input signal.

Keywords:- Face Recognition, Local Binary Pattern, Active Pixels.

I. INTRODUCTION

Face recognition is one of the most relevant packages

of picture evaluation. It’s a real challenge to construct

an automatic gadget which equals human capability

to apprehend faces. Despite the fact that human

beings are pretty precise figuring out known faces,

we aren't very skilled while we must address a big

amount of unknown faces. The computers, with an

almost infinite memory and computational pace, must

overcome human’s barriers. Face recognition remains

as an unsolved hassle and a demanded era. There are

many extraordinary enterprise regions interested in

what it may offer. Some examples consist of video

surveillance, human-gadget interplay, photo cameras,

digital reality or law enforcement. This

multidisciplinary hobby pushes the research and

draws hobby from diverse disciplines. Consequently,

it’s no longer a hassle restricted to pc imaginative and

prescient studies. Face reputation is a relevant

problem in pattern popularity, neural networks, pc

portraits, picture processing and psychology.

In computer vision tasks face reputation systems have

won sizeable importance ever in view that security

difficulty has reached its peaks. For such systems

synthetic Intelligence (AI) performs a pivotal

position in recognition and authentication duties.

Humans have an inherit functionality of without

difficulty figuring out someone via using

reminiscence however pc systems lack reminiscence

issues. It is able to be made to don't forget matters via

artificially inducing codes and functions and thru

getting to know mechanisms named as supervised

gaining knowledge of and unsupervised studying.

However this studying can be efficaciously applied

handiest if pics of people are given in controlled

situations i.e., static historical past, impartial frontal

face and so on. But popularity will become hard

when out of control situation occurs. Out of control

situation may rise up because of facial expression

modifications, head orientations, partial occlusions

and varying lighting fixtures conditions and many

others.

In such state of affairs characteristic extraction and

class becomes crucial assignment for laptop vision

programs. For this, techniques like PCA, LDA,

neural networks and numerous variations of them are

used but each one has its barriers. Despite the fact

that a success in many applications, they do now not

show first-rate overall performance when the face

image is in part occluded. For the reason that they're

linear in nature they do not paintings well in non-

linear cases. Several non-linear strategies namely

http://www.ijetajournal.org/


ISSN: 2393 - 9516 www.ijetajournal.org Page 18

Kernel-device-based Discriminate evaluation (KDA),

neural networks, flexible Discriminate analysis

(FDA) and Generalized Discriminate evaluation

(GDA) are used. However a chief drawback of those

strategies is that they've a high computational price in

phrases of schooling and testing the statistics. Some

of the maximum relevant are PCA, ICA, LDA and

their derivatives.

But, the techniques adopted aren't adequate for

quality recognition inside the environments in which

varying expression, pose and Illumination conditions

are inherent to the surroundings. Modern-day Face

reputation algorithms LBP are proposed to make a

grip on lighting fixtures elements seemed on the pix,

side detection is a superb method to shape the facial

features that may be hidden due to unusual lighting

fixtures conditions. Even though a fore stated

strategies solve the face recognition hassle however

there are some other troubles like facial features,

partial occlusion, pose variation, illumination

conditions, facial getting older that without a doubt

degrade the overall performance of face reputation.

those troubles truly upward push in actual lifestyles

due to the fact in real scenario the person’s face is not

continually neutral. Other face reputation problems

arise because of varied pose, expression, lighting

situations on the photo and occluded items and so on

as proven in Fig. 1.1.

Face reputation has long been a goal of laptop

imaginative and prescient, however only in latest

years dependable computerized face recognition has

end up a practical goal of biometrics studies.

Basically, face popularity relies upon face detection.

This naturally ends in estimation of the individual’s

recognition of attention and estimation of gaze that

are vital in human computer interplay for

understanding purpose, specifically in conversational

interfaces. Pastime expertise which might be critical

guides for face tracking and for which face

recognition is a treasured source of facts. Latest

research have additionally all started to cognizance

on facial features evaluation both to deduce affective

state.In this paper we're inquisitive about addressing

the problem of confined resources including memory

and processing power by way of suggesting a new

approach, local active pattern (LAPP), that reduces

the function elements without scarifying the

popularity accuracy.

II. LOCAL BINARY PATTERN

Local Binary Pattern (LBP) is a simple yet efficient

texture operator which labels the pixels of an image

by way of threshold of the community of each pixel

and considers the result as a binary variety. Due to its

discriminative power and computational simplicity,

LBP texture operator has emerge as a famous

approach in numerous programs. It could be visible

as a unifying method to the traditionally divergent

statistical and structural fashions of texture

evaluation. possibly the most essential property of the

LBP operator in real-international packages is its

robustness to monotonic gray –scale changes

prompted, as an instance, by using illumination

variations.

The unique LBP operator labels the pixels of an

image by means of thresholding a 3x3 neighborhood

of every pixel with the middle price and thinking

about the effects as a binary number, of which the

corresponding decimal number is used for labeling.

The derived binary numbers are referred to as local

Binary styles or LBP codes.

Formally, given a pixel at (xc, yc), the resulting LBP

can be expressed in

Decimal form as:

LBP ( (1)

where n runs over the 8 neighbors of the central

pixel, ic and in are gray-level values of the central

pixel and the surrounding pixels, and the function

s(x) is defined as:

s( )= (2)

The LBP feature vector, in its simplest form, is

created in the following manner described in the

below figure.

Divide the examined window to cells (e.g. 16x16

pixels for each cell).




Fig.1: Basic LBP Operator

For each pixel in

a cell, compare the pixel to each of its 8

neighbors (on its left-top, left-middle, left-

bottom, right-top, etc.). Follow the pixels along

a circle, i.e. clockwise or counter-clockwise.

If the center

pixel's value is greater than the neighbor, write

"1". Otherwise, write "0". This gives an 8-digit

binary number (which is usually converted to

decimal for convenience).

Compute the

histogram, over the cell, of the frequency of

each "number" occurring (i.e., each combination

of which pixels are smaller and which are

greater than the center).

Normalize the

histogram.

Concatenate

normalized histograms of all cells. This gives

the feature vector for the window.

Face description using LBP

In the LBP approach for texture classification, the

occurrences of the LBP codes in a picture are accrued

right into a histogram. The category is then achieved

by computing simple histogram similarities. But,

thinking about a similar technique for facial image

representation consequences in a loss of spatial

information and consequently one need to codify the

texture information whilst keeping additionally their

locations. One way to achieve this intention is to use

the LBP texture descriptors to build numerous nearby

descriptions of the face and combine them right into a

worldwide description. Such local descriptions have

been gaining hobby lately which is comprehensible

given the limitations of the holistic representations.

Those local characteristic based totally methods are

greater sturdy in opposition to variations in pose or

illumination than holistic methods .

Fig.2: Face description with local binary patterns

The basic method for LBP based totally face

description is described. The facial picture is divided

into nearby areas and LBP texture descriptors are

extracted from each area independently. The

descriptors are then concatenated to shape an

international description of the face. This histogram

correctly has an outline of the face on three exclusive

stages of locality: the LBP labels for the histogram

include information approximately the patterns on a

pixel-level, the labels are summed over a small

location to supply facts on a regional degree and the

local histograms are concatenated to construct a

international description of the face. It need to be

noted that once the use of the histogram based

strategies the regions do now not want to be

rectangular. Neither they need to be of the identical

size or form, nor do they now not necessarily need to

cowl the complete image. It’s also viable to have

partly overlapping areas.

III. BRODY TRANSFORMATION

The Brody Transform is one among the several

power transforms proposed to provide shift invariant

output from input spectral components. Unlike the

others, it uses simple pair of symmetric functions.

This Cyclic Shift Invariant Transform is also called

R-transform or Rapid Transform, RT, for its faster

convergence. The RT results from a simple

modification of the Walsh-Hadamard Transform. The

signal flow diagram of RT is similar to that of WHT

except that the absolute value of the output of the

each stage of the iteration is taken before feeding it to

the next stage. Fig 3 reveals the translation invariance

behavior of Brody transform. Since the Brody

Transformation is not an orthogonal transform, it has

no inverse.




1

1

1

1 1 1 1

1

1

1 1 1 1

Fig.3: Invariance of Brody Transform

The Brody Transform is the same for all the

translated versions of the object.

BT {1 0 0 0 1 0 0 0 1 0 0 0 1 1 1 0} ={6 4 4 2 2 0 2 0

2 0 2 0 2 0 2 0}

BT {0 0 0 1 0 0 0 1 1 1 1 1 0 0 0 0} = {6 4 4 2 2 0 2 0

2 0 2 0 2 0 2 0}

BT {0 0 1 0 0 0 1 0 0 0 1 0 1 1 1 0} = {6 4 4 2 2 0 2 0

2 0 2 0 2 0 2 0}

IV. APPROACH

As shown in Fig. 4, it is capable of supporting face

recognition in both conventional and resource

constraint environment.

The Active Pixel is the one which denotes essential

information of the image. The first element of Brody

Transform is considered the cumulative spectral

strength of that region. In terms of signals it denotes

maximum energy of the region. It can be termed as

CPI, Cumulative Point Index. The (𝑛/2+1)ℎ element

indicates total subtractive spectral strength of the

spectral components and termed as SBI, Subtractive

Point Index. These two play decisive role while

determining the active pixel. The threshold value is

computed as normalized difference of CPI and SBI,

A pixel is said be ACTIVE if its n/2 or more

neighborhood Brody transform spectral values are

greater than the threshold.

This conclusion is based on trial and error process.

Figure 4 shows the effect of the threshold on

computation of active pixel. The image is

reconstructed using only active pixels.

Procedure for extraction of Active Pixels:

Divide the resized image into 8 x 8 blocks.

Use 3 x 3 mask and compute the Brody

Transformation for ith pixel gives 8 spectral

values.

Compare each spectral value with the threshold,

Increment Active pixel count if 4 or more

spectral values are greater than the threshold.

Move the mask by 3-units and repeat the same

until the entire block is covered.

The active pixel count represents feature

elementforthis region.

Repeat this for all blocks. The feature vector

(combination of each block feature elements)

gives the signature of the image.

1

1

1

1 1 1




V. SCREENSHOTS

Fig: Reading an Input Image

Fig: Edge Detection

Fig: Active Pixels

Fig: Comparing images within the train database

Fig: Comparing images within the train database

Fig: Comparing features of data base to selected

person

Fig: Output

IV. CONCLUSION

It is concluded that by using LAPP algorithm we

extracted active pixels for an image and we compared

that image with the image in the train database. Face

recognition using LAPP reduces feature elements

compared to LBP and also it reduces the

computational time. To get better results we can try

for other algorithms. The LAPP reduces the feature

elements compared to LBP and also it reduces the

computational time. Hence, the face recognition

approach based on LAPP is quite suitable for both

conventional and resource constrained environment.




REFERENCES

[1] A Transformation With Invariance Under

Cyclic Permutation for Applications in

Pattern Recognition. Reitboeck .H , Brody

T. P. , Inf. & Control., Vol. 15, No. 2, 1969.

[2] Anthropometric 3D Face Recognition,

Shalini Gupta, Mia K. Markey, Alan C.

Bovik, International Journal of Computer

Vision 90(3): 331-349 (201

[3] Comparison of visible and infrared imagery

for face recognition, Wilder J., Phillips P.J.,

Jiang C. & Wiener S. (1996), Proceedings of

2nd International Conference on Automatic

Face and Gesture Recognition, pp. 182-187,

Killington, VT.

[4] Exploiting approximate communication for

mobile media applications. Stephen Schmitt,

Mason Donahue, Suman Banerjee,

SayandeepSen, 2009.ACM. pp. 1-6.

[5] Face Recognition with Local Binary

Patterns. Pajdla, T, Matas. J, (Eds.):ECCV

2004, LNCS v 3021, pp. 469–481, 2004.

[6] Multiresolution gray-scale and rotation

invariant texture classification with local

binary patterns .Ojala, T., Pietikainen.M,

Maenpaa. T, IEEE Transactions on Pattern

Analysis and Machine Intelligence 24

(2002) 971–987.

[7] Praveen Kumar. G, VijayaKumari G,

AmitPande, Babu G.R, MallikarjunaRao,

"Role of Active Pixels for Efficient Face

Recognition on Mobile Environment",

International Journal of Intelligent

Information Processing(IJIIP), Vol. 2, No. 3,

2011.

[8] Thermal Face Recognition in an Operational

Scenario, Socolinsky D.A. &Selinger A.

(2004), Proceedings of the IEEE Computer

Society Conference on Computer Vision and

Pattern Recognition (CVPR’04), 2004.

[9] P. J. Phillips, H. Wechsler, J. Huang,

P.Rauss, “The FERET database and

evaluation procedure for face recognition

algorithms”, Image and Vision Computing J,

Vol. 16, No. 5, 295-306, 1998.


[ijeta-v2i5p4]: priyanka kumbham, dr. g. r. sakthidharan

Documents

introduction face recognition

effective recognition

active pixel pattern

active pixel approach

impartial frontal face

pattern popularity

active pixels

local binary pattern