Pattern Analysis and Applications (2022) 25:1015–1024

https://doi.org/10.1007/s10044-022-01058-3

INDUSTRIAL AND COMMERCIAL APPLICATION

Multimodal biometric crypto system for human authentication using

ear and palm print
Mariyappan Kandasamy1

Received: 13 February 2021 / Accepted: 11 January 2022 / Published online: 11 April 2022
© The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2022

Abstract
The fuzzy vault structure, which is a biometric pattern safety process in which the biometric traits are represented as an
unordered group, is an example of a biometric cryptosystem. A Hybrid Fuzzy Vault-Cuckoo Search algorithm is proposed
in this article to provide the best recognition when compared to the existing approach. The module's methods include pre-
processing, characteristic elimination, creating characteristic vectors, synthesis, and reformation. The proposed approach's
performance is assessed using evaluation metrics.

Keywords Multimodal biometric · Fuzzy vault · Median filter · Region growing · Grey level co-occurrence matrix

1 Introduction distinctiveness [7]. The phases of this research will be as

Biometric is an emerging technology that utilizes vein scan,
facial thermogram, DNA matching, blood pulse, ear shape,
gait recognition, etc. [1]. Due to the cumulative requirement
of higher security schemes, multiple biometrics is preferred
over single biometric to generate the most accurate authen-
tication result [2]. It is an integral component of identity sci-
ence, and biometric modalities such as the face, fingerprint,
iris, and voice are being applied to recognize an individual
[3]. Particularly, palm print has stable and rich characteris-
tics, such as textures, wrinkles, and local direction features
[4]. Combining multiple human trait features for biometric
identification is multimodal biometric identification. Here,
ear and palm prints are the two biometric modalities used for
personal identification fused at feature level [5]. In general
[6], biometrics is classified into two types:
1. Physiological biometrics.
2. Behavioral biometrics.
The main characteristics of biometric are as follows: It
should have universality, collectability, permanence, and
* Mariyappan Kandasamy
mariwithgold@gmail.com
1
Department of Computer Science and Engineering,
Faculty of Engineering and Technology, CMR University,
Bangalore, India
follows: (1) Pre-Processing (2) Feature Extraction (3) Gen-
eration of assembled highlight vectors (4) Fusion and Rec-
ognition. Reasons for the preference of ear biometric are as
follows: i) the shape and appearance of the ear do not change
with expression, ii) the uniform distribution of ear color is
more prominent than other biometric traits, and iii) medical
studies confirm that noticeable change of ear shape happens
from 4 months to 8 years and over 70 years. Therefore, the
characteristics of the ear are more reliable compared to other
biometric traits [8].
A large number of feature extraction algorithms are
used for feature extraction from a training dataset. Features
extracted from the test images are compared using the clas-
sifier to predict the class of the test image [9]. Initially, pre-
processing is done with the help of a median filter which
lends a helping hand to the task of cropping the image for
choosing the position [1]. It is known that palm print fea-
tures have multiple levels, and different levels of features
are visible in different types of palm print images [10]. We
can generate an x- and y-coordinate repartee matrix with
the help of a boundary matrix from the extracted features.
In this research, Cuckoo search Algorithm is incorporated
with fuzzy vault to give less complexity and best recognition
compared with the existing method.
The remaining research article is as follows. Section 2
surveys the literature review. In Sect.3, human authentica-
tion and its various methodologies are demonstrated. The
proposed method to authenticate the biometric cryptosystem

13
Vol.:(0123456789)

Content courtesy of Springer Nature, terms of use apply. Rights reserved.

1016
is proposed in Sect. 4. In Sect.5, results are discussed and
represent the performance of evaluation metrics between
the existing method and the proposed method. Finally, the
research article concluded in Sect. 6.
2 Review of recent researches
Harsh Sinha et al. [11] proposed a framework for ear locali-
zation and recognition in order to shorten the pipeline for
a biometric recognition system. The majority of ear biom-
etric identification approaches were based on classic image
processing techniques or custom ensemble elements. The
possibility of deep neural networks has been investigated
as a result of substantial work in the field of computer
vision employing convolutional neural networks (CNNs)
and histogram of oriented gradients (HOG). The suggested
technique's practicality was assessed using the USTB III
database.
Mozammel Chowdhury et al. [12] suggested an ear bio-
metric authentication technique that is both quick and resil-
ient. In their study, they employed a quick approach based
on the AdaBoost algorithm to determine the user's ear from
profile images. The experimental findings indicated that the
proposed strategy outperformed other prominent strategies
reported in the work.
To detect ear images, Santham Bharathy Alagarsamy
et al. [13] proposed a unique technique for segmentation
based on the adaptive approach Runge–Kutta. The use of
AARK's numerical methods in calculating the threshold
value for the ear identification procedure enhanced the accu-
racy of the results. The proposed strategy enhanced PSNR
by 72 percent while increasing accuracy by 63.3 percent.
In many ways, palm print recognition has emerged as
the most powerful tool for human verification. To perform
successful recognition, Gaurav Jaswal et al. [14] developed
a feature level fusion of block-wise scale invariant feature
transform and texture code co-occurrence matrix-based fea-
tures. A trained support vector machine used the specified
attributes to evaluate whether the image was real or a scam.
Syed Ali Tariq et al. [15] proposed a novel palm print
recognition method based on better frequency estimation
and a unique region-quality-based minutiae extraction
approach that raised the accuracy of minutia detection. In
comparison to the existing state of the art, the proposed palm
print ID results demonstrated great accuracy and substan-
tially quicker recognition speeds. It might be regarded as a
dependable, efficient, and practical option for palm print-
based identifying systems.
13
Content courtesy of Springer Nature, terms of use apply. Rights reserved.
Pattern Analysis and Applications (2022) 25:1015–1024
3 Problem definition
Human authentication plays a vital role in our society with
the evolution of mankind. Using unique characteristics of
humans for authentication is widely used in physiological
and forensic applications. Some of the most commonly
used biometric qualities are face, unique mark, palm print
and iris. In this article, we will develop an efficient multi-
modal biometrics human authentication system using Palm
print and Ear.
4 Proposed methodology
Multimodal biometric framework is required for a con-
vincing combination strategy for merging data from
single methodological frameworks. In earlier work, we
performed multimodal biometrics of palm print and ear
based on fuzzy vault in order to produce a fused biom-
etric system. In that work, Fuzzy vault is utilized to pro-
vide security duties, but the disadvantage is that biom-
etric information will be visible, making it possible for
the information to be hacked. Furthermore, the aggressors
can quickly locate the chaff spots created at random using
the biometric traits. In order to increase security by con-
cealing the mystery key within biometric information, we
will present a novel debris point-based Fuzzy Vault in our
second effort. Our effort will be divided into four phases:
(1) pre-processing, (2) feature extraction, (3) generation
of combined highlight vectors, and (4) fusion and recogni-
tion. The contribution palm print and ear descriptions will
be pre-processed using a median filter to remove noise and
blur from pictures, and then the figure and surface charac-
teristics of the ear and palm print will be extracted using
the Modified Region Growing (MRG) technique and the
GLCM method. For the mixture process, Fuzzy Vault will
be utilized by the new chaff point’s creation method. For
the age of mystery key in combination process, we have
to produce assembled highlight vectors by consolidating
the separated shape and surface element vectors with this
new debris point include vectors. In our previous work,
we have created the chaff points by randomly selecting the
extracted features. But, in this work, we can generate an x-
and y-coordinate repartee matrix with the help of bound-
ary matrix from the extracted features. By picking optimal
distance ranges, we can generate new chaff points. The
optimal distance ranges will be calculated using Binary
Cuckoo search Algorithm. This new generated chaff points
will be a more beneficial one by providing less computa-
tion rigorous and are very faster than the existing method.
Finally, the authentication will be carried out for every
Pattern Analysis and Applications (2022) 25:1015–1024
Fig. 1  Proposed biometric cryptosystem
palm print and ear image. The detailed explanation of the
proposed method is given as follows in Fig. 1.
4.1 Preprocessing
In order to get better results, the input palm print image and
ear images are pre-processed before their components are
removed. Preprocessing the image makes it ready for further
processing of highlight extraction and removes disturbance
and obscurity from the information image. The palm image is
cropped first, as there is no editing of the facial image. In face
image, edge detection is employed instead of the motion filter
that is used in palm image.
4.2 Feature extraction
Initially, the input palm print and ear images will be subjected
to pre-processing using median filter for the expulsion of com-
motions and obscure from images. The middle channel work-
ing procedure is quickly clarified in the beneath area.
4.2.1 Median filter
The central filter is a flexible line of choice, also known as the
Median Smooth, introduced by Tukey in 1971. And it tries
to remove the noise by changing the brightness of the filter
element center on the average pixel pixels window. Although
the central filter is simple and reduces noise, it removes nega-
tive fine lines and details even in the presence of loud noise.
The filtered SMF image S = {S (i, j)} can be defined by this
equation,
S(i, j) = median(k, l) ∈ wm,n {D(i + k, j + 1)} (1)
Content courtesy of Springer Nature, terms of use apply. Rights reserved.
1017
where Wm,n is a sliding window of size m ∗ n pixels centered
at coordinates (i, j). The median value is calculated by using
Eq. (1) with ns = m ∗ n . While SMF can reduce the dam-
age directly by improper noise, the donation values do not
change and change through SMF. An unpleasant situation
occurs because SMF cannot differentiate between indiffer-
ence to damaged pixels. In addition, SMF requires a large
filter size with a high deceleration rate.
4.3 Generation of grouped feature vectors
By using Modified Region Growing (MRG) method with
GLCM technique, the profile and surface features of ear and
palm print will be extracted.
4.3.1 Modified region growing (MRG)
Here, in the modified region growing the highest intensity
value attained in the histogram is assigned to be the seed
point and the threshold value is assigned manually. The opti-
mal threshold value is predicted for the better segmentation
and this will increase the sensitivity of the segmented image
using lion algorithm optimization techniques that are uti-
lized. The steps in MRG are shown as follows:
• Ridding.
• Point selection seed.
• Determining the optimal threshold value.
• Utilizing the growing district at the seed point.
Gridding From the beginning, the image is divided into
several blocks ( sb ), and as it is similar in comparison to the
image, this process is known as a grid. The menu is designed
to categorize each site and individual categories.
Seed point selection In the process, we test the history on
the user level. Note that the process of this narration applies
to each gift in the block, the gift value is between 0 and 255,
and the most common pixel gift is given to the seed field. In
each image area, the blocks are divided and the letter space
is fixed.
block(i, j) = fi (z ∶ (z + sb ) − 1, l ∶ (l + sb ) − 1)
for(i = 1......10) ∶ r
(j = 1.....10) ∶ c
(2)
[Szij Slij ] = find(block{i, j} == max(block{i, j})) (3)
z = z + sb , l = l + sb
4.3.2 Grey level co‑occurrence matrix (GLCM)
GLCM stands for a permanent mattress in which the num-
ber of rows and columns corresponds to the color level of the
13
1018 Pattern Analysis and Applications (2022) 25:1015–1024

image. The paper matrix model correctly determines the area
of the points (d1 and d2). GLCM can get enough statistics
from them with the Gray Blur feature which contains caption
information which can be edited as follows.
• Power.
• Deterioration.
• Masonry shadow.
• Honesty.
• Maximum probability.
Energy The second overtime, also called connection or
force, describes the total number of squares included in the
GLCM. He is treated with the word "similarity." The power
range is defined as [0]. Maximum video power is taken into
account. The power test equation is given as follows,
∑ every palm print and ear image.
Energy = p (x, y)2 (4)
x,y
4.4 Fusion and recognition
The combination procedure, Fuzzy Vault will be used by
new chaff point's design strategy. For the age of mystery
key in combination process, we have to produce assembled
include vectors by joining the extricated shape and surface
element vectors with this new chaff point highlight vec-
tors. In any case, in this work, we can produce an x- and
y-coordinate chaff matrix among the assistance of limit
matrix commencing the extricated highlights. By picking
optimal distance ranges, we can generate new chaff points.
The optimal distance ranges will be calculated using
Binary Cuckoo search Algorithm. These new generated
chaff points will be a more beneficial one by providing less
computation rigorous and are very faster than the existing
method. Finally, the authentication will be carried out for

where with p(x, y) the number of contributions in the x, y 4.4.1 Fuzzy vault

field of image design ( M × N ).
Entropy Entropy provides a helpful hand to represent the A clear example of biometric cryptosystems is the encryp-
text of the text and to determine the distribution change in the tion process which is a biometric protection system where
image area. The corresponding hell counts the image damage biometric skin issues are represented as an undesirable
successfully. While the image may not be spelled as text, the practice. The concept of valley expansion can be explained
GLCM object value is of unknown value, indicating the fact in more detail, let alone explain the biometric effect of
that the entropy is too large. Entropy is calculated according element elements k. The user needs to select the U key
to the following equation. and it contains the code in the form of a polynomial Q of
magnitude r and the polynomial Q ratio of all objects in
P. Fields and numbers are arranged together in V or also
∑
Ent = p(x, y) log(p(x, y)) (5)
x,y called auxiliary details. The user's biometric data is there-
fore protected by vault adjustment.
Cluster Shade
During verification, the user must provide a sample for
his query which is indicated by P '. If P 'is full to P, the
∑
CS = ((x − 𝛼x ) + (y − 𝛼y ))3 T(x, y) (6)
x,y user can see more spaces in V lying on polynomials. If
the difference between P and P 'exceeds certain limita-
Homogeneity Homogeneity tests the similarity of nonzero tions, it can also be used to reproduce Reed–Solomon to
input in GLCM. When the gray color difference is high, the the polynomial reconstruction. If this is multiplied with
low GLCM concentration is slightly lower, and the high polynomial and the secret key can also be selected in poly-
GLCM variance is lower. Homogeneity is in the range of [0, nomial, the solution will be successful. If P and P 'are not
1]. If the image differs only in proportion, the correlation is very good and repulse polynomial, the certification will
much higher and if the image is not changed, the same uni- not be successful. Headphones would be done with multi-
formity is equal to one. ple combinations of multimodal biometrics.
∑ P (x, y)
Hom ogeneity =
[1 + (x − y)2 ] (7) 4.4.1.1 Advantages of fuzzy vault
x,y

Maximum probability • Fuzzy Vault is safe in the sense that it will not leak
information about minutes because it uses hoax tech-
Max probability = max(p(x, y)) (8) nology in writing such as "Cancellable."
• The flexibility of phase flexibility in biometric data.
Unlike crypto technology, it can allow mergers to occur
when data and biometric analysis are limited.

13

Content courtesy of Springer Nature, terms of use apply. Rights reserved.

Pattern Analysis and Applications (2022) 25:1015–1024
• Fuzzy's concept will plan to refer only to the modified
version of the model, which makes it work in different
positions without fingers.
4.4.1.2 Issues in fuzzy vault
• Very accurately meeting the question with a biometri-
cally modified version is very difficult.
• Point the fields of the husk are formed later when the
process becomes independent. Points with less freedom
have more points and are easier to find.
• In the two-space or more positions such as the sharp
edges formed on the same space, but different buttons
and small guns.
• If the attacker is able to obtain the secret K with methods
without attacking against the model, he will not want
to collect biometric data. Of a secret, the polynomial is
directly reconstructed, and therefore biometric can be
obtained.
4.4.1.3 Fuzzy vault generation phase The estimated vault
increases the security of the layout by extending the secret
key idea to the element vector; initially, the information key
is encrypted to have special foci that complement the com-
ponents of the component vector to create unobtrusively
wavy foci. The number of chimneys in a legally produced
secret key depends on the number of digits in the secret key.
If the secret key is 4 pieces long, then 4 are added to the
component vector to form the fuzzy wrap. An approximate
diagram of the era of corrugated arches is shown in Fig. 2.
Age of focus for the mystery key depends on the
underneath referenced planned system which gives
Fig. 2  Block diagram of the
fuzzy vault generation phase
Content courtesy of Springer Nature, terms of use apply. Rights reserved.
1019
security to the consolidated face and palm formats.
The x-coordinates of the secret key points are the
digit itself and the y-coordinate is the next odd num-
ber in case if the digit is odd and next even number
in case of an even digit. Assume the info key is of
size and the key is spoken to by Ki = Ki1 Ki2 ... KiNk ,
where Kij is the jth digit of the ith individual mys-
ter y key. Taking a digit Kij in the secret key, cor-
responding point KLij is for med by coordinates
(Kij , Lij ) , where Lij is the next odd number after Kij
when Kij is odd and Lij is the next even number
after Kij when Kij is even. Similarly, all the focuses
for every one of the mystery key digits are shaped
in t he comparative way to br ing about focuses
EK i = {KLi1 , KLi2 , ..., KLiNk } = {(Ki1 , Li1 )(Ki2 , Li2 ) ... (KiNk , , LiNk )}.
These focuses are added to t he connected vec-
tor to frame t he fuzzy vault which is given by
FVi = {Ei , EK i } , which can be expanded to shape
FVi = {Epi , Efi , Eci , KLi1 , KLi2 , ..., KLiNk } . T h e v e c -
tor in full expanded structure can be spoken to by
FVi = {epi1 , epi2 , ..., epiNep ,efi1 , efi2 , ..., efiNef , eci1 , eci2 , ...,
eciNec , KLi1 , KLi2 , ..., KLiNk } . Thus, the all-out number
of focuses in the fuzzy vault is Nep + Nef + Nec + Nk .
In our procedure, we utilize mystery key of size 4 to
create an aggregate of 124 in the fuzzy vault. Every
one of the individuals will have a relating fuzzy vault
and all the fuzzy vaults shaped FVi for 0 < i < Np are
put away in the database, where is the complete num-
ber of people.
4.4.1.4 Test case phase At this stage, the face and palms
of the tested person are given the details described before
emphasizing that it forms a component formed by a com-
13
1020
Fig. 3  Block diagram of the test
case phase
posite vector. The information notification is compared to
sapphire crystals in the database and when combined, a pri-
vate key is generated to interact with the person and pro-
vided as a guarantee. An image of the experimental phase
is given in Fig. 3.
For each information in the world enter the vector focus
to be discussed Et = {Ept , Eft , Ect }, compared to a large
database FVi for 0 < i < Np. In a situation where the pub-
lic focus indicates that the test taker hand test is the same
as in the predicted field, at the time the person is allowed
to confirm further confirmation. If all the focus on testing
of individual application failure is on a hot data system
(Ki1 , Li1 )(Ki2 , Li2 ) ... (KiNk , LiNk ) , then some focus on the
clean space KLi1 KL ... KLiNk will also be overlooked. The
focus is the key to the mystery and the x-ray of that focus
will give the person that private key. Well, the key to the
mystery. Personal age is the second priority for the indi-
vidual and promotes the security of this format.
4.4.2 Cuckoo search
The Cuckoo Search Algorithm is a metaheuristic algorithm
developed by Cuckoo Development Exercises and reduced
to completion. They have a lot of houses in Kuckuck City.
Each egg is directed to the target, and the egg from the crow
provides clear cleansing. The new and improved statement
replaces the dominant valuable statement at home. The dis-
play structure shown together is chosen by the crow's search
algorithm: each house egg symbolizes the explanation, and
the crow's egg symbolizes the new explanation. It is hoped
that a new and possibly improved egg will be used to prevent
all large cuckoo eggs from regenerating at home. Although
the cuckoo is a crucial condition for any house, the assess-
ment of the strategy can be improved by integrating the
13
Content courtesy of Springer Nature, terms of use apply. Rights reserved.
Pattern Analysis and Applications (2022) 25:1015–1024
property, which can have more than one egg in each house,
and this involves many explanations. The grouping strategy
is shown as follows:
Each egg is opened with a cucumber. The cuckoo lays her
eggs in an unoccupied house.
• The number of access points is changing and areas with
very low traffic cells will increase in the future.
• By the passage of predators that find cuckoo eggs, you
can add egg manure or soil and plant a completely new
nest.
4.4.2.1 Generating new cuckoo phase We use charter jets
for random selection of cucumber and create new excep-
tions. The cucumber result was tested with force to obtain a
specified amount.
4.4.2.2 Fitness evaluation phase Survey the wellness
capacity dependent on the condition and after that pick the
best one.
fitness = maximum popularity (9)
4.4.2.3 Updation phase Fixing the database is a binding air-
craft when the cosine transition is locked in the Earth other
than the emergence of new locations in the selected building
has improved as the previous spaces, will be replaced by
introducing new information (cuckoo). Though wickedness
is near, previous data is already set as the best information.
Responsible aircraft used for Cuckoo's advanced algorithm,
m∗i = m(t+1)
i
= m(t)
i
+ 𝛼 ⊕ Levy(n) (10)
Pattern Analysis and Applications (2022) 25:1015–1024
where t is step size, and 𝛼 > 0 and is the progression size
scaling highlight limit. Here, the section shrewd item ⊕ s
practically identical to those used in PSO, xi(t+1) and speaks
egg (feature) at home (solution), i=1, 2,….m, and t=1,2,…
d. The Levy flights use a self-assertive level degree which
is used up from a Levy allotment. Along these lines, the
CS algorithm is extra gifted in finding the hunt break as its
movement degree is phenomenally longer as time goes on.
In the traditional COA, definitions are reviewed in trans-
ferring the test to unauthorized areas. In contrast, the BCOA
has adopted a trademark inserted insert as the bullion com-
posite, in which it is configured to specify a hypercube.
In addition, although the problem with selection is not a
known trademark, the same plastic is locked, where I explain
whether a trademark will be selected to make the novel and
0 in total. To formulate this mythical vector, we have drawn
position 4, which can provide integrated elements in the
Boolean high class that processes the novel description in
only two cases:
1
( )
S xi(t+1) = (t) (11)
1 + e−xi
if S < rand then xi(t+1) = 0
{
if S > rand then xi(t+1) = 1
4.4.2.4 Reject worst nest phase Terrible houses of this
level are avoided, rely on their alternative properties and
build new ones. The detailed explanations are then noted,
depending on their suitability for the task. The best explana-
tions are then predictable and marked as optimal solutions.
4.4.2.5 Stopping criterion phase Until the most extreme
cycle achieves this procedure is reproduced. Optimized
results are investigated to decide on biometric images. The
particular frameworks are clearly settled in flowchart. It is
uncovered underneath.
5 Results and discussions
The proposed procedure to create a face and palm-based
fuzzy vault for multi-biometric cryptosystem is assessed and
broken down in this area. Area 5.1 surrenders the trial set
and the assessment measurements utilized. The trial results
are talked about in segment 5.2 and execution investiga-
tion is made in area 5.3. Comparison result is explained in
Sect. 5.4.
Content courtesy of Springer Nature, terms of use apply. Rights reserved.
1021
5.1 Experimental setup and evaluation metrics
The proposed method is used in MATLAB for a proces-
sor with 6 GB RAM and a 2.6 GHz Intel I-7 processor. To
determine the accuracy and completeness of the system,
error rates were calculated and distributed.
False match rate (FMR) Incorrect measurements have
suggested that they will advertise to match the selected
"non-personal" model. (In books it is often referred to as
"indirect.")
False non-match rate (FNMR) False correlations are
two times that it is possible for a model to mean an error
that matches the model and size of the same user who pro-
vided the model. (Unlike a false game it is called a "false
wall" in the text.)
Jaccard coefficient and Jaccard distance are measure-
ment of asymmetric information on binary variables. Com-
pare Jaccard coefficient with simple matching coefficient.
NGRA (Number of Genuine Recognition Attempts) gives
the quantity of accomplished matches. Dismissal of ear
and palm print images may occur because of different rea-
sons and every one of these dismissals are summarized
REJENROLL.
gms
FNMR(t) =
NGRA
Here, there are points for comparison. Similarly, all
face-to-face images K1i , i = 1, 2, .., 10 , combined with the
primary editing of face-to-face F1k (i < k ≤ 10) image edit-
ing and image editing (ims) of the database and compared
to the impostor compatibility scale. Quality-Matching
(shown as NIRA—Impostor Identification Test) only if
((50 × 49)∕2) = 975 only if, REJENROLL = 0.
ims
FMR(t) =
NIRA
Also, the scale (false game rating) and (false match
rate) are determined from the customizable from the top
to the start from 0 to 1.
Dice coefficient Dice coefficient D is one of the methods
of calculating the life span of space between two binary
images. It is often used to report the work of the depart-
ments and give weight in situations when two images are
obtained. Its values are between 0 (no urgency) and 1 (per-
fect compliance).
2(A ∩ G)
D=
(A ∩ G) + (A ∪ G) 4.4.2
13
1022 Pattern Analysis and Applications (2022) 25:1015–1024

0.7
0.6
0.5
Jaccard
(a) Input Ear images 0.4 coefficient

0.3
Genuine
0.2 Acceptance
Rate
0.1
0
(b) Preprocessed Ear Images Iteration Iteration Iteration
50 75 100
Fig. 4  a and b Sample input and preprocessed ear image
Fig. 6  The graphical representation of evaluation metrics

Table 2  The performance result of Iteration 50

Iteration 50 Proposed Existing

Jaccard coefficient 0.5 0.44

(a) Input palm print images Genuine acceptance rate 0.6 0.51
False matching rate 0.15 0.3
Dice coefficient 0.3 0.28
False non-matching rate 0.41 0.4

(b) Preprocessed palm print images Table 1 gives the assessment metric qualities got without
clamor (Fig. 6).
Fig. 5  a and b Sample input and preprocessed palm image The performance analysis result shows the cryptosys-
tem for human authentication of ear and palm print image
Table 1  The performance result of evaluation metrics are viewed with the metric values for iteration 50, 75
Iteration 50 Iteration 75 Iteration 100
and 100 from Table 1. The human authentication of our
proposed work presents improved accuracy outcomes for
Jaccard coefficient 0.5 0.52 0.54 the Jaccard coefficient, Genuine Acceptance Rate, False
Genuine acceptance rate 0.6 0.6 0.62 Matching Rate, Dice coefficient and False Non-Matching
False matching rate 0.15 0.15 0.12 Rate, respectively, for iteration 50 gives a 0.5, 0.6, 0.15,
Dice coefficient 0.3 0.34 0.35 0.3, and 0.41. Iteration 75 gives 0.52, 0.6, 0.15, 0.34 and
False non-matching rate 0.41 0.44 0.45 0.44, iteration 100 gives 0.54, 0.62, 0.12, 0.35 and 0.45.
It’s a great benefit for our work to get improved accuracy
of classification.
5.2 Experimental results
5.4 Comparison result
The area gives the image at various phases of execution.
For palm print and ear image, the images are given. Here, The outcomes of biometric cryptosystem for human
we give the palm images and ear image (Figs. 4 and 5). authentication of ear and palm print image are viewed
with the metric values for iteration 50 from Table 2 and
5.3 Performance analysis Fig. 7. Our proposed study gives the better result when we
compare to the existing study the human authentication of
The assessment metric estimations of FNMR, FMR, Jac- our proposed work presents improved accuracy outcomes
card coefficient, NGRA, Dice coefficient and GAR acquired are 0.5, 0.6, 0.15, 0.3 and 0.41 for the Jaccard coefficient,
for the proposed strategy are talked about in this segment. Genuine Acceptance Rate, False Matching Rate, Dice
The examination is made in nearness and without clamor coefficient and False Non-Matching Rate, respectively. It’s
and furthermore by shifting the key size of the mystery key. a great benefit for our work to get improved accuracy of

13

Content courtesy of Springer Nature, terms of use apply. Rights reserved.

Pattern Analysis and Applications (2022) 25:1015–1024 1023

Table 3  The performance result of evaluation metrics for iteration 75 Table 4  The performance result of evaluation metrics for iteration
100
Iteration 75 Proposed Existing
Iteration 100 Proposed Existing
Jaccard coefficient 0.52 0.45
Genuine acceptance rate 0.6 0.52 Jaccard coefficient 0.54 0.48
False matching rate 0.15 0.28 Genuine acceptance rate 0.62 0.55
Dice coefficient 0.34 0.28 False matching rate 0.12 0.22
False non-matching rate 0.44 0.41 Dice coefficient 0.35 0.3
False non-matching rate 0.45 0.41

0.7
0.7
0.6 0.6

0.5 Jaccard 0.5 Jaccard

coefficient coefficient
0.4 0.4
Genuine
Acceptance 0.3 Genuine
0.3
Rate Acceptance
False Matching 0.2
0.2 Rate
Rate
0.1
0.1
0
0
Proposed Existing
Proposed method Existing

Fig. 9  The graphical representation of evaluation metrics

Fig. 7  The graphical representation of evaluation metrics for iteration
50
compare to the existing study the human authentication of
our proposed work presents improved accuracy outcomes
are 0.54, 0.62, 0.12, 0.35 and 0.45 for the Jaccard coef-
0.7
ficient, Genuine Acceptance Rate, False Matching Rate,
0.6 Dice coefficient and False Non-Matching Rate, respec-
0.5 Jaccard tively. It’s a great benefit for our work to get improved
0.4
coefficient accuracy of classification. We can achieve classification
effectiveness from Table 3 and its equivalent graph in
0.3 Genuine
Acceptance Fig. 8. But the existing result gives 0.45, 0.52, 0.28, 0.28
0.2
Rate and 0.41.
0.1 The outcomes of biometric cryptosystem for human
0 authentication of ear and palm print image are viewed with
Proposed method Exisng the metric values for iteration 100 from Table 4 and Fig. 9.
Our proposed study gives the better result when we compare
to the existing study; the human authentication of our pro-
Fig. 8  The graphical representation of evaluation metrics for iteration
75 posed work presents improved accuracy and outcomes are
0.54, 0.62, 0.12, 0.35 and 0.45 for the Jaccard coefficient,
Genuine Acceptance Rate, False Matching Rate, Dice coeffi-
classification. We can achieve classification effectiveness cient and False Non-Matching Rate, respectively. It’s a great
in Table 2 and its equivalent flowchart in Fig. 7. But the benefit for our work to get improved accuracy of classifica-
existing result gives 0.44, 0.51, 0.3, 0.28 and 0.4. tion. We can achieve classification effectiveness in Table 4
The outcomes of biometric cryptosystem for human and its equivalent flowchart in Fig. 9. But the existing result
authentication of ear and palm print image are viewed gives 0.48, 0.55, 0.22, 0.3 and 0.41.
with the metric values for iteration 75 from Table 3 and
Fig. 8. Our proposed study gives the better result when we

13

Content courtesy of Springer Nature, terms of use apply. Rights reserved.

1024
6 Conclusion
The proposed method will be implemented in MATLAB
and tested with various images. In the first phase, we use
preprocessing to eliminate noise from the images, which
reduces computing costs. The median filter is then used to
extract significant characteristics such as MRG and GLCM.
The last step is recognition, in which we will recognize the
human palm print and ear images based on the score level
fusion using a hybrid fuzzy vault-cuckoo search, and in
which we will detect facial emotions.
References
1. Chanukya PS, Thivakaran TK (2020) Multimodal biometric
cryptosystem for human authentication using fingerprint and ear.
Multimed Tools Appl 79(1):659–673
2. Bokade GU, Rajendra DK (2019) Secure multimodal biometric
authentication using face, palmprint and ear: a feature level fusion
approach. In: 2019 10th International Conference on Computing,
Communication and Networking Technologies (ICCCNT), pp.
1–5. IEEE
3. Purohit H, Ajmera PK (2021) Optimal feature level fusion for
secured human authentication in multimodal biometric system.
Mach Vis Appl 32(1):1–12
4. Zhao S, Wei N, Bob Z (2021) Deep learning-based hyperspectral
multimodal biometric authentication system using palmprint and
dorsal hand vein. In: AI and Deep Learning in Biometric Security,
CRC Press pp. 1–22
5. Lohith MS, Eshwarappa MN (2021) Multimodal biometrics for
person identification using ear and palm print features. IETE J Res
67(1):90–97
6. Vijayakumar T (2021) Synthesis of palm print in feature fusion
techniques for multimodal biometric recognition system online
signature. J Innov Image Process (JIIP) 3(02):131–143
13
Content courtesy of Springer Nature, terms of use apply. Rights reserved.
Pattern Analysis and Applications (2022) 25:1015–1024
7. Ramachandran C, Deepa S (2020) Score level based fusion
method for multimodal biometric recognition using palmprint and
iris. In: 2020 Advanced Computing and Communication Tech-
nologies for High Performance Applications (ACCTHPA), IEEE.
pp. 281–286
8. Pramanik A, Apurba G, Sobhan S, Phalguni G (2018) A novel
feature extraction-based human identification approach using 2D
ear biometric. In: 2018 IEEE Applied Signal Processing Confer-
ence (ASPCON), IEEE. pp. 168–172
9. Poonia P, Pawan KA, Amey B (2019) Palm-print recognition
based on scale invariant features. In: 2019 IEEE 16th India Coun-
cil International Conference (INDICON), IEEE. pp. 1–4
10. Fei L, Guangming Lu, Jia W, Teng S, Zhang D (2018) Feature
extraction methods for palmprint recognition: a survey and evalu-
ation. IEEE Trans Syst Man Cybern Syst 49(2):346–363
11. Sinha H, Raunak M, Yash S, Pawan KA (2019) Convolutional
neural network-based human identification using outer ear images.
In: Soft computing for problem solving, Springer, Singapore, pp.
707–719
12. Chowdhury M, Rafiqul I, Junbin G (2017) Fast and robust bio-
metric authentication scheme using human ear. In: International
Conference on Security and Privacy in Communication Systems,
Springer, Cham, pp. 133–144
13. Alagarsamy SB, Saravanan K (2020) Ear recognition system
using adaptive approach Runge-Kutta (AARK) threshold seg-
mentation with ANFIS classification. Neural Comput Appl
32(15):10995–11006
14. Jaswal G, Kaul A, Nath R (2018) Multiple feature fusion for
unconstrained palm print authentication. Comput Electr Eng
72:53–78
15. Tariq SA, Iqbal S, Ghafoor M, Taj IA, Jafri NM, Razzaq S, Zia T
(2019) Massively parallel palmprint identification system using
gpu. Clust Comput 22(3):7201–7216
Publisher's Note Springer Nature remains neutral with regard to
jurisdictional claims in published maps and institutional affiliations.
Terms and Conditions
Springer Nature journal content, brought to you courtesy of Springer Nature Customer Service Center GmbH (“Springer Nature”).
Springer Nature supports a reasonable amount of sharing of research papers by authors, subscribers and authorised users (“Users”), for small-
scale personal, non-commercial use provided that all copyright, trade and service marks and other proprietary notices are maintained. By
accessing, sharing, receiving or otherwise using the Springer Nature journal content you agree to these terms of use (“Terms”). For these
purposes, Springer Nature considers academic use (by researchers and students) to be non-commercial.
These Terms are supplementary and will apply in addition to any applicable website terms and conditions, a relevant site licence or a personal
subscription. These Terms will prevail over any conflict or ambiguity with regards to the relevant terms, a site licence or a personal subscription
(to the extent of the conflict or ambiguity only). For Creative Commons-licensed articles, the terms of the Creative Commons license used will
apply.
We collect and use personal data to provide access to the Springer Nature journal content. We may also use these personal data internally within
ResearchGate and Springer Nature and as agreed share it, in an anonymised way, for purposes of tracking, analysis and reporting. We will not
otherwise disclose your personal data outside the ResearchGate or the Springer Nature group of companies unless we have your permission as
detailed in the Privacy Policy.
While Users may use the Springer Nature journal content for small scale, personal non-commercial use, it is important to note that Users may
not:

1. use such content for the purpose of providing other users with access on a regular or large scale basis or as a means to circumvent access
control;
2. use such content where to do so would be considered a criminal or statutory offence in any jurisdiction, or gives rise to civil liability, or is
otherwise unlawful;
3. falsely or misleadingly imply or suggest endorsement, approval , sponsorship, or association unless explicitly agreed to by Springer Nature in
writing;
4. use bots or other automated methods to access the content or redirect messages
5. override any security feature or exclusionary protocol; or
6. share the content in order to create substitute for Springer Nature products or services or a systematic database of Springer Nature journal
content.
In line with the restriction against commercial use, Springer Nature does not permit the creation of a product or service that creates revenue,
royalties, rent or income from our content or its inclusion as part of a paid for service or for other commercial gain. Springer Nature journal
content cannot be used for inter-library loans and librarians may not upload Springer Nature journal content on a large scale into their, or any
other, institutional repository.
These terms of use are reviewed regularly and may be amended at any time. Springer Nature is not obligated to publish any information or
content on this website and may remove it or features or functionality at our sole discretion, at any time with or without notice. Springer Nature
may revoke this licence to you at any time and remove access to any copies of the Springer Nature journal content which have been saved.
To the fullest extent permitted by law, Springer Nature makes no warranties, representations or guarantees to Users, either express or implied
with respect to the Springer nature journal content and all parties disclaim and waive any implied warranties or warranties imposed by law,
including merchantability or fitness for any particular purpose.
Please note that these rights do not automatically extend to content, data or other material published by Springer Nature that may be licensed
from third parties.
If you would like to use or distribute our Springer Nature journal content to a wider audience or on a regular basis or in any other manner not
expressly permitted by these Terms, please contact Springer Nature at

onlineservice@springernature.com