T-Secured: Intruder Detection in Home Security

Systems
Anna Roy Ankit Suresh Julia Anna Saju
(Computer Science Engineering) (Computer Science Engineering) (Computer Science Engineering)
MBCET (of Aff.) MBCET (of Aff.) MBCET (of Aff.)
Trivandrum, India Trivandrum, India Trivandrum, India
annaannu252000@gmail.com ankitsuresh001@gmail.com juliaannasaju1010@gmail.com

Linda Maria K J
(Computer Science Engineering)
MBCET (of Aff.)
Trivandrum, India
mlindakj@gmail.com

Abstract—Image processing has made a huge impact in the the other two algorithms, the LBPH method is more versatile
advancement of home security.Face recognition, object identi- since it can distinguish both the front and side faces.
fication, and object tracking, among other things, all help to
improve the situation. The existing security systems do not notify II. P ROPOSED M ETHOD
the owners of any potential incursion. They only capture security
video for future reference and do not participate in active threat A. Work flow of face recognition system
prevention.The work uses Local Binary Patter (LBP) algorithm
and histogram equalization to improve the detection rate and
reduce errors in face detection.For future reference, a database is
kept track of all the persons who enter and depart the residence.

Index Terms—Face Recognition, Features Extraction, LBPH

algorithm, Intruder Detection

I. I NTRODUCTION
Face recognition technology is a significant research project
in the fields of computer vision and pattern recognition. It can
detect people’s identities and other information based on the
visual aspects of a face image, and it has a lot of potential.
It is frequently employed in areas such as authentication,
criminal investigation, video surveillance, robotic intelligence,
and medical science. It has a wide range of applications as
well as economic value. When compared to other biological
traits, face features have the characteristics of being nice,
straightforward, and convenient. As a result, users are more
accepting of facial recognition.
Many researchers have developed a variety of face recog-
nition algorithms over the years, including the Sparse Cod-
ing (SC) algorithm, Local Binary Pattern (LBP) algorithm,
Histograms of Oriented Gradients (HOG) algorithm, Deep
Convolution Network algorithm, Linear Discriminant Analysis
(LDA) algorithm, and Gabor feature algorithm, among others.
Eigenfaces, Fisherfaces, and Local Binary Pattern Histogram
are three built-in face recognition algorithms in OpenCV, an
open source computer vision library (LBPH). In comparison to

Identify applicable funding agency here. If none, delete this. Fig. 1. Face recognition system work flow
 The input gathering module, feature extraction module,
classification module, and training classifier database module
are the four essential components of most face recognition
systems. The learning acquisition module’s picture informa-
tion, which will be utilised as a test sample for analysis. The
feature extraction module extracts and examines features that
potentially represent human identifying information. In the
classification module, the database-trained classifier is utilised
to categorise test samples in order to derive individual identity
information.
1) Face Detection:
For face detection, we utilised OpenCV, which has a Haar
cascade classifier. The AdaBoost method is used by the Haar
cascade classifier to recognise various face characteristics. It
begins by reading the picture to be identified and converting
it to grayscale, after which it loads the Haar cascade classifier
to determine whether or not it contains a human face.
If this is the case, it examines the characteristics of the face and
draws a rectangle frame around the detected face. Otherwise,
it moves on to the next image to be tested.
2) Feature Extraction:
The LBP operator is used to express a pixel’s contrast infor-
mation in relation to its neighbours. In the 3*3 window, the
original LBP operator is specified.
It compares the grey value of the next 8 pixels to the median
pixel value as the window’s threshold. The value of pixel
position is indicated as 1 if the neighbouring pixel value is
greater or equal to the median pixel value, otherwise it is
written as (0). Equation 1 shows how to define the function.
It’s seen in the diagram below.
Fig. 2. Original LBP Operator
To create 8-bit binary integers, 8 locations in the 3*3 neigh-
bourhood are compared. The LBP values of the centre pixel
points of the window are acquired by converting it to decimal
integers, and these values are utilised to display the texture
properties of the region. A new circular LBP operator is used
in the current LBPH method. Figure 3 and equation 2 show
how to express it.
The grey value GP of the pixel C’s P neighbourhoods, with
a radius of R. The grey value pixel value C is GC (xc ,yc ).
This approach frees the LBP operator from the constraints of a
given radius and neighbourhood, allowing it to handle a wider
range of size and texture characteristics. It calculates the LBP
Fig. 3. Circular LBP Operator
eigenvalues for each pixel in a picture. These eigenvalues can
then be combined to generate the LBP feature spectrum. The
feature vector for classification in the LBPH method is the his-
togram of the LBP characteristic spectrum. It divides a picture
into several sub-regions, extracts LBP features from each pixel
in each sub-region, and creates a statistical histogram of the
LBP characteristic spectrum in each sub-region, allowing each
sub-region to use a statistical histogram to describe the entire
picture through a number of statistical histogram components.
The benefit is that the mistake of the picture not being properly
aligned with a specified range is reduced.
3) Data Set:
B. Face Recognition Algorithm
The recognition procedure revolves around face recognition.
Face recognition is a type of computer vision technology
that analyses facial characteristic data to determine a person’s
identity. Face recognition is separated into two components
in a general sense: face recognition matching and detection.
The technique of face recognition is based on a person’s facial
attributes. and either a facial picture or a video stream as input.
Determine whether a human face exists, and if so,
provide information on the position, size, and positioning of
each major facial organ. Based on this data, the identification
elements in each face are retrieved and compared to known
faces in order to determine the identity of each face. Face
recognition is a type of biometric recognition that comprises
of 4 parts: face picture collecting, face image preprocessing,
face image feature extraction, matching and combining hard
recognition, all of which are implemented using hardware
cameras, network lines, and compute clusters. The technique
of computation is as follows:
T = min {T1, T2, · · · , Tn}
Face recognition is based on this premise. Facial recognition
technology is a type of biometrics technology that works by
collecting and preprocessing face information from camera
equipment. Face recognition is a technique for detecting
people’s faces Face detection’s major objective is to collect
data in order to establish whether there is a human face image
in the image, as well as the image’s size and orientation, and
to segment the detected human facial image into the adult
face region. Face recognition is the final connection, which
extracts facial feature information and picture information to
see if it’s in the repository. If it is, it has matching identification
information; otherwise, no recognition results will be obtained.
1) Face Feature Extraction by LBPH Method:
Local Binary Pattern (LBP) is a basic yet effective texture
operator that identifies pixels in an image by thresholding
each pixel’s neighbourhood and treating the result as a binary
integer.
It was initially described in 1994 (LBP) and has subsequently
been discovered to be a useful texture segmentation trait. On
some datasets, it has also been discovered that coupling LBP
with the histograms of oriented gradients (HOG) descriptor
boosts detection performance substantially. We can represent
the facial shots with a simple data matrix using the LBP and
histograms. Because LBP is a visual descriptor, it may also
be utilised for face recognition tasks, as seen in the steps
below.
1. Parameters:
a. Radius- The radius represents the radius about the centre
pixel and is used to construct the circular local binary pattern.
Normally, it is set to 1.
b. Neighbors- the number of sample points required to build
a circular local binary pattern Keep in mind that now the
higher the computational cost, the further sample points you
include. Normally, it is set to 8.
c. Grid X- in the horizontal direction, the number of cells.
The bigger the dimensionality of the produced feature vector,
so more cells there are in the grid and the finer the grid is.
Typically, it is set to 8.
d. Grid Y- in the vertical direction, the number of cells The
larger the dimensionality of the produced feature vector, the
more cells there are in the grid and the finer the grid is.
Typically, it is set to 8.
2. Training the Algorithm:
We first should train the algorithm. To do so, we’ll want
a dataset containing the faces of the persons we’re hoping
to recognise. We must therefore assign each image an ID
(which might be a number or a person’s name) so that the
algorithm can distinguish an input image and provide you
with an output. The ID for all pictures of the same individual
must be the same. Let’s look at the LBPH computational
stages now that the training set has been built.
3. Applying the LBP operation:
The LBPH’s initial computational step is to develop an
intermediate output that best describes the original image by
accentuating the facial features. To do so, the method employs
a sliding window idea based on the radius and neighbours
parameters.
• Assume we have a grayscale picture of a face.
• We can acquire a 3x3 pixel window of a portion of this
image.
Fig. 4.
• It can alternatively be expressed as a 3x3 matrix with each
pixel’s intensity (0255).
• After that, we need to utilise the matrix’s centre value as
the threshold.
• This value will be used to define the 8 neighboring new
values.
• We create a new binary output for each neighbour of the
core value (threshold). We used a 1 for numbers that were
equal or greater than the threshold, and a 0 for values that
were lower.
• The matrix will now only contain binary values (ignoring
the central value). Each binary value from each point in the
matrix must be concatenated line by line into a new binary
value (e.g. 10001101). Note that other experts concatenate
the binary values in different approaches (for example, in a
clockwise manner), but the end result is the same.
• After that, we transform the binary value to a decimal value
and assign it to the matrix’s centre value, which is a pixel
from the original picture.
• We get a new image at the conclusion of this technique
(LBP procedure) that better matches the properties of the
original image.
• Note: Circular LBP is an extension of the LBP process that
uses a different number of radius and neighbours.
Fig. 5.
Bilinear interpolation can be used to accomplish this. If a data
point falls between the pixels, the value of the four closest
pixels (2x2) is used to estimate the new data point’s value.
4. Extracting the Histograms: Using the picture created
in the previous phase, we can now divide the image into
numerous grids using the Grid X and Grid Y properties, as
seen in the following image:
We may extract the histogram of each zone as follows using
the image above:
• Because we’re working with a grayscale image, each

Fig. 6.
histogram (from each grid) will only have 256 points (0255)
to record the instances of each pixel intensity.
• Then, to make a new, larger histogram, we must concatenate
each histogram. In the case of 8x8 grids, the final histogram
will contain 8x8x256=16.384 places. The features of the
original image are represented by the final histogram.
Performing the face recognition:
The algorithm has already been trained at this point. Each
image from the training dataset is depicted by a different
histogram. As a result, given an input image, we repeat the
procedures for this new image, ending in a histogram that
describes the image.
• So, all we have to do to identify the picture that fits the
input image is compare two histograms and return the image
with the nearest histogram.
• To compare histograms (measure the distance between two
histograms), we can use a variety of techniques, such as
euclidean distance, chi-square, absolute value, and so on. We
may utilise the Euclidean distance (which is well-known) in
this case, which is calculated using the formula:
Fig. 7.
• As a result, the ID from the image with the closest histogram
is returned by the algorithm. The computed distance, which
may be used as a ’confidence’ measurement, should also be
delivered by the algorithm.
• Then we can use a threshold and the ’confidence’ to
determine if the algorithm appropriately detected the image.
If the confidence is less than the stated threshold, we may
infer that the algorithm has effectively recognised it.
CONCLUSION
Security is a major concern in any part of the world. The
homes we live in are supposedly the safest place we know but
in this era we live, no place is safe, not even our homes.
Especially when crimes like house intrusions and break-in
robbery and so on are at its highest, home security is a vital
issue to be taken care of.
R EFERENCES
Please number citations consecutively within brackets [1].
The sentence punctuation follows the bracket [2]. Refer simply
to the reference number, as in [3]—do not use “Ref. [3]”
or “reference [3]” except at the beginning of a sentence:
“Reference [3] was the first . . .”
Number footnotes separately in superscripts. Place the ac-
tual footnote at the bottom of the column in which it was
cited. Do not put footnotes in the abstract or reference list.
Use letters for table footnotes.
Unless there are six authors or more give all authors’ names;
do not use “et al.”. Papers that have not been published,
even if they have been submitted for publication, should be
cited as “unpublished” [4]. Papers that have been accepted for
publication should be cited as “in press” [?]. Capitalize only
the first word in a paper title, except for proper nouns and
element symbols.
For papers published in translation journals, please give the
English citation first, followed by the original foreign-language
citation [?].
R EFERENCES
[1] L. Li, X. Mu, S. Li and H. Peng, ”A Review of Face Recognition
Technology,” in IEEE Access, vol. 8, pp. 139110-139120, 2020.
[2] M. A. Abuzneid and A. Mahmood, ”Enhanced Human Face Recognition
Using LBPH Descriptor, Multi-KNN, and Back-Propagation Neural
Network,” in IEEE Access, vol. 6, pp. 20641-20651, 2018
[3] A. Ahmed, J. Guo, F. Ali, F. Deeba and A. Ahmed, ”LBPH based
improved face recognition at low resolution,” 2018 International Con-
ference on Artificial Intelligence and Big Data (ICAIBD), 2018, pp.
144-147
[4] G. Xiang, Z. Qiuyu, W. Hui and C. Yan, ”Face recognition based
on LBPH and regression of Local Binary features,” 2016 International
Conference on Audio, Language and Image Processing (ICALIP), 2016,
pp. 414-417
IEEE conference templates contain guidance text for compos-
ing and formatting conference papers. Please ensure that all
template text is removed from your conference paper prior to
submission to the conference. Failure to remove the template
text from your paper may result in your paper not being
published.