Materials Today: Proceedings xxx (xxxx) xxx

Contents lists available at ScienceDirect

Materials Today: Proceedings

journal homepage: www.elsevier.com/locate/matpr

Finger veins recognition using machine learning techniques

Ashraf Tahseen Ali ⇑, Hasanen S. Abdullah, Mohammad N. Fadhil
Department of Computer Science, University of Technology, Baghdad, Iraq

a r t i c l e i n f o a b s t r a c t

Article history: This study aims The Finger veins are a unique feature of the human, this differs from other biometric
Received 30 March 2021 signs. That impossibility for an imposter to discovered and penetrate the system and difficult to know
Accepted 5 April 2021 because the veins are under the skin, and is distinguished from the rest by its flexibility because the per-
Available online xxxx
son has more than one finger to take. In this paper, we will present impostor detection using seven
machine-learning techniques, preceded description of preprocessing, and features extraction. These steps
Keywords: implemented on two datasets. The best performance of the classifiers was naive bias followed by random
Machine learning
forest. While the lower classifier accuracy was JRip.
Veins
Imposter
Ó 2021 Elsevier Ltd. All rights reserved.
Naïve Bayes Selection and peer-review under responsibility of the scientific committee of the Emerging Trends in
k-Nearest Neighbor Materials Science, Technology and Engineering.
Random forest

1. Introduction
Finger veins are attracting more researchers than in previous
decades because they are easy to reach, highly accurate, and
impossible to replicate [1]. Most Finger veins identification meth-
ods endure the ill consequences of the downsides related to the
extraction of important features because of bad quality pictures
and weak permeability of the Finger veins. Bad quality pictures
can be because of low control of infrared radiation, low lighting
conditions and light scattering in tissues coating the vein construc-
tion to be captured [2]. Image collection, image preprocessing, fea-
ture extraction, and feature matching are the four phases of a
biometric method based on finger veins. Near infrared light applied
to acquire images in two different ways: light reflection and light
refraction [3]. The use of a good image acquisition system is essen-
tial; otherwise, there would be too much preprocessing. With a
tidy and clean picture, several current finger vein identification
models function well [4]. Even if the image is not clear and the fin-
ger location is perverted or depraved, changes are needed. After
obtaining a vein image, it is important to preprocess it in order
to improve the image’s efficiency [5]. feature extraction of images
can be taken out in two ways the first is to see an image as a gen-
eral image, through some mature feature extraction algorithms in
the area of image processing can be called image-level feature
⇑ Corresponding author.
E-mail addresses: cs.19.12@grad.uotechnology.edu.iq (A. Tahseen Ali),
110014@uotechnology.edu.iq (H.S. Abdullah), mohammad.n.fadhil@uotechnology.
edu.iq (M.N. Fadhil).
extraction. the second way is to attempt to depart the vein patterns
from the image, and then extract features on the pure vein patterns
can called vein-level feature extraction [6]. Table1 show the Survey
of existing biometric characteristics.
2. Literature survey
Since the beginning of the current century, the methods have
been widely developed finger vein identification systems. In this
section, some of the previous work related to this research that
presented veins recognition using machine learning classifiers will
be reviewed:
In 2021, they achieved an efficient finger vein recognition con-
sisting of the hybrid Local Phase Quantization (LPQ) for strong fea-
ture extraction and Grey Wolf Optimization-based SVM (GWO-
SVM) to calculate the best parameter combination of SVM for opti-
mal decisions of binary classification. GWO-SVM is used for classi-
fication in order to maximize the classification accuracy by
determining the optimal SVM parameters the effectiveness of the
suggested framework on four tested finger vein datasets, which
performing a recognition accuracy of 98% [7]. In 2021, they intro-
duced an adaptive k-nearest centroid neighbour (akNCN) achieved
as an enhancement to the kNCN classifier. Two new rules added to
adaptively choose the neighbourhood size of the test sample. The
neighbourhood size for the test sample is modified, the size of
the neighbourhood is adaptively modified to j. Experimental
results on the Finger Vein (FV-USM) image database demonstrate
the promising results in which the classification of the akNCN clas-

https://doi.org/10.1016/j.matpr.2021.04.076
2214-7853/Ó 2021 Elsevier Ltd. All rights reserved.
Selection and peer-review under responsibility of the scientific committee of the Emerging Trends in Materials Science, Technology and Engineering.

Please cite this article as: A. Tahseen Ali, H.S. Abdullah and M.N. Fadhil, Finger veins recognition using machine learning techniques, Materials Today: Pro-
ceedings, https://doi.org/10.1016/j.matpr.2021.04.076
A. Tahseen Ali, H.S. Abdullah and M.N. Fadhil Materials Today: Proceedings xxx (xxxx) xxx

Table 1
The Survey of existing biometric characteristics [3].

Biometric characteristics Key Advantage disadvantage Safety Level Cost

Voice Natural and comfortable Noises Ordinary Low
Face Remote capturing Illumination requirements Ordinary Low
Iris High accuracy Glasses Very Good High
Fingerprint Extensively implemented Skin Good Low
Finger -veins Large-safety level Disease Very Good Low

greatest exactness of 98.11 has been performed [2]. In 2019, they

achieved Finger veins recognition using discriminant analysis and
KNN of the machine learning system, as it stands for K- nearest
neighbor algorithm was used to test and measure the accuracy of
the features of the finger vein images. The accuracy obtained from
KNN is 55.84% whereas from discriminant analysis the accuracy
achieved is 92.21%, using SDUMLA-HMT dataset [9].

3. The proposed system architecture

The proposed system which is using biometrics will be recog-

nized Finger veins depending on machine learning system. In gen-
eral, consist of Finger veins records, dataset description, pre-
processing, feature extraction and classification stages and post-
processing stage. The proposed system architecture is as shown
in Figs. 1 and 2.

3.1. Database description

The details of these data are shown in the Table 2.

Fig. 1. The propose Finger veins recognition system architecture.
3.2. Pre-processing

sifier is 85.64% [8]. In 2020, They achieved finger vein improve-
ment in the motivations behind ID and check, s based on the equal-
ization of fuzzy histograms. A mixture of Hierarchical Centroid and
Gradient Histograms was applied to extract features. Both the
enhancement stages were evaluated using 6 fold stratified cross-
validation. The results are altogether tried with KNN and moreover
with SVM. KNN’s forecasts on test information demonstrated con-
siderably more exact. Employing delineated 6- overlap investiga-
tion on all hands fingers in the SDUMLA information dataset, the
The preprocessing stage’s main advantage is that it organizes
the data, making the recognition task easier. All operations relating
to image are referred to as ‘‘preprocessing.”
a) Increase Lustring using Gamma Correlation
After capturing the finger image, it was dark and dim, the
following step is to increase its lustre with Gamma modifica-
tion. By increasing the dynamic range of pixel forces by con-
trolling the pixels in a nonlinear way. It’s cultivated by

Fig. 2. Image Gamma Correlation.

2
A. Tahseen Ali, H.S. Abdullah and M.N. Fadhil
Table 2
System’s Finger veins Datasets [1].
Dataset ame No of images No of persons Finger Number
per person
SDMULA-HMT 3816 106 6 (Index, ring, middle,
of both hands)
UTFV 1440 60 6 (Index, ring, middle,
of both hands)
diminishing co-event network homogeneity. This plans to
hold the essential distinctions to the surface and make them
more noticeable. It significantly enhances image quality by
adjusting normal image brilliance in an excellent way.
b) Color to gray level image using Grayscale Image
Because only one channel is dealt with within the grayscale
domain instead of three as in RGB (Red, Green, and Blue),
converting a color image to the grayscale domain reduces
data and improves processing speed. A weighted average
method was used to convert the RGB colored image to a gray
image; this method was chosen because it produces a purer
image in which the colors are not equally weighted. Because
pure green is lighter than pure blue and pure red, it has a
heavier weight. As can be seen in Eq. (1), pure blue is the
darkest of the three and thus gets the least weight [10].
Gray scale = 0.2989 Red + 0.5870 Green + 0.1140 Blue [10]
c) Contrast enhancement using Histogram Equalization
The principal purpose of HE is to level the probability inten-
sity function of the input image and remap the grey levels to
create a treated image with enhanced contrast. It meaning-
ful changes the average brightness of the processed image
with regard to the initial image. It also includes noise and
density saturation effects which appear in a loss of image
details and give the appearance of the processed image
unnatural [11]. (1)
d) Resizing and Cropping (R&C)
(R&C) are the basic image editing functions. Both must care-
fully considered because they have the potential to degrade
image quality. Resizing an image alters its dimensions,
resulting in a larger file size (and, thereby, image quality).
Cropping often involves removing a portion of the original
image, resulting in the loss of some pixels.
3.3. Feature extraction using (LDA)
(LDA) is a conventional analytical technique. (LDA) depends on
linear combinations of variables to distinguish among classes that
result in linear decision limits. The technique search for a linear
transformation that maximizes class separability in a reduced
dimensional space [12]. Distinctive essential that merge linear fea-
tures, determine axes that maximize the variance, can dimension
reduction. Calculated according to Eq. (2) below:
y ¼ k1 þ ax1 þ bx2 . . . axn ½ldaŠ ð2Þ
3.4. Proposed system classifiers
Machine learning classifiers, including feature extraction tech-
niques, are critical in assessing the overall effectiveness of the
speaker recognition model. This is a classification problem since
we want to classify audios and figure out who is speaking in them.
3
Materials Today: Proceedings xxx (xxxx) xxx
Image Number Image resolution Format Typical Image
per Finger
6 320  240pxl .BMP
4 672  380pxl 8 bit gray
scale .PNG
As a result, the following successful supervised classification
machine learning algorithms will be used:
a) Naïve Bayes (NB)
The Nave Bayes classifier is a simple probabilistic classifier
based on Bayes’ Theorem and strict independence assump-
tions, as shown in Eq. (3), with all features being equally
independent [13]. Using the NB classifier of the probability
that the function belongs to a class of prior probability, the
feature will be assigned to the class of posterior probability.
The class with the highest posterior likelihood is the product
of prediction. This classifier accurately and quickly predicts
the test data set’s class, and it also performs well in multi-
class prediction [13].
pðxjcÞpðcÞ
pðcjxÞ ¼ ð3Þ
pðxÞ
where
pðcjxÞ: the posterior probability of class (c, target) given predic-
tor (x, attributes).
pðcÞ: the prior probability of class.
pðxjcÞ : the likelihood which is the probability of predictor given
class.
pðxÞ : the prior probability of predictor.
b) k-Nearest Neighbor
The KNN is a supervised learning system that allows machi-
nes to classify objects, problems, or situations using data
that has already been fed into them [14]. An unlabeled vec-
tor (a query or test point) is classified by assigning the mark
that appears most frequently among the k training samples
closest to that query point, where k is a user-defined con-
stant in the classification process. For continuous variables,
Euclidean distance was used as a distance metric, which
was measured using Eq. (4) below: [14]
qffiX
ffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi
n
dðx; yÞ ¼ i¼1 i
ða ðxÞ ai ðyÞÞ2 ð4Þ
c) Random Forest (RF)
Random Forest Classification (RFC) is a decision tree-based
supervised classification technique for machine learning
[15]. Each tree in the collection is made by randomly select-
ing a small group of features to split on for each node, and
then deciding the best split based on these features in the
training set. Each tree gives the particular feature vector a
vote. The forest selects the class with the most votes for each
feature vector. It’s easy to make and forecast, runs quickly on
large datasets, estimates missing data quickly, and main-
tains accuracy even when a large percentage of data is
missing.
A. Tahseen Ali, H.S. Abdullah and M.N. Fadhil
d) J48
Missing values, rule derivation, continuous attribute value
ranges, and decision tree pruning are only a few of the
J480 s features. Over fitting pruning can be used as a precision
device if necessary [16]. This algorithm used to establish the
rules that resulted in the data creating a unique identity. The
aim of using this classifier is to progressively mainstream
the decision tree until a balance of versatility and accuracy
is achieved.
e) Part
PART is ruled learner which separate-and-conquer. ‘‘Deci-
sion lists,” which are pre-determined sets of rules, are gener-
ated by the algorithm [17]. This algorithm creates a decision
list, which is a set of rules in a logical order. The data is allo-
cated to the category of the rule with the best match after
each rule in the list is compared to new data.
f) JRIp
JRip is one of the most common and commonly used algo-
rithms. As classes grow larger, they are evaluated and an initial
set of rules for the class is generated based on decreasing error
rates [18]. This algorithm, which is used to create the law,
results in the data acquiring a unique identity. The aim of using
this classifier is to progressively mainstream the decision tree
until a balance of versatility and accuracy is achieved.
g) REP Tree (RT)
The REPTree is an ensemble model that combines decision
tree (DT) and reduced error pruning (REP) algorithms to
solve classification and regression problems [19]. This algo-
rithm builds a decision tree using information gain and
prunes it using reduced-error pruning. REP removes uncer-
Input -: Finger veins
Output: -
Begin
SDMULA-HMT UTFV
:
End
4
Materials Today: Proceedings xxx (xxxx) xxx
tainty by eliminating leaves and branches from the DT struc-
ture, which can lead to overfitting and reduced model
interpretability.
4. The proposed system implementation
This system was implemented into two Phases as follows:
4.1. Training phase
The proposed system’s first step is the training of the two data-
sets using cross-validation, where the largest part of data enters to
training phase Frequent and random then the reminder data
passed to testing phase sec. (4.2). The dataset will be preprocessed
using a Gamma correlation, after which the images will be con-
verted from RGB to Gray Level, and these images will be prepro-
cessed using Histogram Equalization, later that images will be
cropped and resized. the features extracted using LDA prepare for
the classification algorithms. The mixed features are saved as refer-
ence models during the training process. These models are then
compared to the Finger veins that has been entered.
4.2. Testing phase
The proposed system’s testing phase is the second phase. As
mentioned above the reminder data will be tested after applying
the same pre-processing steps which applied on data in training
phase. The proposed system architecture is as shown in Algorithm
(1) below.
// Input //
Pre-processing Phase
Feature Extraction Phase
Output
A. Tahseen Ali, H.S. Abdullah and M.N. Fadhil Materials Today: Proceedings xxx (xxxx) xxx

5. Proposed system evaluation

0.972
0.974
0.972
0.972

0.999
0.971
0.028
UTFV
1440
1400
40
For evaluating a model’s performance, certain parameters are
used to determine its behavior. The results are influenced by the

SDMULA-HMT
size of the training data, the quality of the audio files, and, most
importantly, the type of machine-learning algorithm used. The fol-
lowing criteria are used to assess the models’ efficacy [20]:

0.847
0.926
0.846
0.864
0.153
0.998
0.845
3816
3232
KNN

584
 Accuracy: Percentage of examples correctly categorized from
0.981
all given examples. It is calculated as [20]:
0.982
0.981
0.981

0.999
0.019
UTFV

1413
1440

0.98
27

tp þ tn
Accuracy ¼ ð5Þ
tp þ tn þ fp þ fn
SDMULA-HMT

0.932
0.931
0.932
0.931

0.999
0.931
0.068
3816
3558
258

 Precision: The percentage of true x-class instances for all those

RF

listed as class x. It is calculated as [20]:

0.657
0.666
0.656
0.658
0.343
0.994
0.651
UTFV
1440
946
494

tp
Precision ¼ ð6Þ
tp þ fp
SDMULA-HMT

 Recall: The percentage of examples listed as class x among all

0.631
0.633

0.369
0.996
0.627
3816
2409

0.63
0.63
539

examples of class x. It is calculated as [20]:

J48

tp
Recall ¼
0.572
0.581
0.572
0.566
0.428
0.993
0.565

ð7Þ
UTFV
1440
842
616

tp þ fn
SDMULA-HMT

 F- measure: is the harmonic mean of precision and recall. It is

calculated as [20]:
0.477

0.476
0.471
0.523
0.995
0.472
3816

1996
1820

0.92
RT

precision  recall
F1 ¼ 2  ð8Þ
precision þ recall
0.993
0.994
0.993
0.994

0.991
0.993
0.007
UTFV

1431
1440

where
9
SDMULA-HMT

tp = true positives: number of examples predicted positive that

are actually positive
fp = false positives: number of examples predicted positive that
0.972
0.974
0.972
0.972

0.999
0.971
0.028
3816
3710

are actually negative

106
NB

tn = true negatives: number of examples predicted negative

that are actually negative
0.532
0.613
0.531
0.554
0.468
0.992
0.524
UTFV
1440

fn = false negatives: number of examples predicted negative

766
674

that are actually positive

 Error rate: An error is simply a misclassification: the classifier
SDMULA-HMT

has presented a case, and it classifies the case incorrectly, as

shown in Eq. (9) below [20]:
0.459
0.496

0.994
0.454
3816
1753
2063
0.46
0.58

0.64
JRip

ErrorRate ¼ 1 accuracy ð9Þ

0.672
0.659

0.994
0.654
UTFV
1440

0.66

0.66
0.34
950
490

 Specificity: measures the ability of a test to be negative when

the condition is actually not present. It is also known as false-
Results of Machine Learning Classifiers.

SDMULA-HMT

positive rate, precision, Type I error, a error, the error of com-

mission, or null hypothesis [20].
0.596

0.595
0.597

0.996
0.592
0.607

0.404
PART

3816
2274
1542

TN
Specificity ¼ 100% ð10Þ
TN þ FP
Total instances

Total incorrect
Total correct

F- measure

Specificity
Error rate
Precision
Accuracy

 KAPPA: Cohen’s kappa coefficient can be used for assessing

KAPPA
Recall
Table 3

agreement between two regular nominal classifications. If one

uses Cohen’s kappa to quantify agreement between the classifi-

5
A. Tahseen Ali, H.S. Abdullah and M.N. Fadhil Materials Today: Proceedings xxx (xxxx) xxx

Fig. 3. Image Color to Gray level.

Fig. 4. Image Histogram Equalization.

Fig. 5. Image Resizing and Cropping.

Fig. 6. Accuracy measured for Classifiers. Fig. 7. Precision measured for Classifiers.

cations, the distances between all categories are considered

equal, and this makes sense if all nominal categories reflect dif- O E
K¼ ð11Þ
ferent types of ‘presence’ [21,22]. The weighted kappa coeffi- I E
cient is defined as [23,24]:

6
A. Tahseen Ali, H.S. Abdullah and M.N. Fadhil Materials Today: Proceedings xxx (xxxx) xxx

Fig. 8. Recall measured for Classifiers.

Fig. 12. KAPPA measured for Classifiers.

Fig. 9. F-measure measured for Classifiers. Fig. 13. Results Comparison Figure.

Table 4
Results Comparison.

RF NB J48 Ref. [7] Ref. [8] Ref. [2] Ref. [9]

Accuracy 95.7% 98.25% 90.9% 98% 85.64% 98.11% 92.21%

6. Experiential results

In this experiment, we test our datasets with (PART, JRip, NB,

RT, J48, RF, KNN) classifiers. The results of using the Finger veins
(SDMULA-HMT),(UTFV) as input will illustrate in Table 2. From
Table 3 and figures numbered from Figs. 3–9, for SDMULA-HMT
and UTFV datasets can notice that the (NB) classifier gives the best
accuracy, precision, recall, f-measure and specificity while JRip
classifier gives the worst accuracy, precision recall, f-measure
Fig. 10. Error Rate measured for Classifiers.
and specificity. As for error rate the results were on the contrary,
where the PART classifier produced highest error rate and NB pro-
duced lowest error rate among other classifiers Figs. 10–13.

7. Results comparison

In Table 4 the comparison between the best three performances

of proposed system algorithms with the related work. The average
accuracy of the proposed system for the three classifiers (RF, J48,
NB) are calculated by Eq. (12):
accuracyof dataset1 þ accuracyof dataset2
av e:accuracy ¼
2
ð12Þ
The results refer to that the proposed system showed superior-
ity using (NB) algorithm in terms of the average accuracy of Finger
veins recognition over all Literature Survey techniques, which
Fig. 11. Specificity measured for Classifiers. mentioned in Table 4.
7
A. Tahseen Ali, H.S. Abdullah and M.N. Fadhil
8. Conclusions
It turns out that the finger veins are one of the biometric fea-
tures that are most difficult for the imposter to gain and avoid.
Choosing two datasets in different formats. Applying preprocessing
on images to remove noise, enhance quality, resize, and cropping
image. Feature extraction is an important phase, using the LDA
method for features extractions. In the training and testing phase
using cross-validation. Machine-learning techniques are used that
achieved ranged performances, (NV) achieved the highest average
accuracy which was 98.25%, followed by an (RF) outcome was
95.7%.
Declaration of Competing Interest
The authors declare that they have no known competing finan-
cial interests or personal relationships that could have appeared
to influence the work reported in this paper.
References
[1] K. Syazana-Itqan, A.R. Syafeeza, N.M. Saad, N.A. Hamid, W.H.B.M. Saad, A
review of finger-vein biometrics identification approaches, Indian J. Sci.
Technol. 9 (32) (2016) 1–9.
[2] Zidan, Khamis A., and Shereen S. Jumaa. ‘‘A New Finger Vein Verification
Method Focused On The Protection Of The Template.” in: IOP Conference
Series: Materials Science and Engineering, vol. 993, no. 1, p. 012108. IOP
Publishing, 2020.
[3] H.G. Hong, Min Beom Lee, Kang Ryoung Park, ‘‘onvolutional neural network-
based finger-vein recognition using NIR image sensors, Sensors 17 (6) (2017)
1297.
[4] Y.i. Liu, J. Ling, Z. Liu, J. Shen, C. Gao, Finger vein secure biometric template
generation based on deep learning, Soft Comput. 22 (7) (2018) 2257–2265.
[5] Tagkalakis, Fotios, Dimitrios Vlachakis, Vasileios Megalooikonomou, and
Athanassios Skodras. ‘‘A novel approach to finger vein authentication.”
In 2017 IEEE 14th International Symposium on Biomedical Imaging (ISBI
2017), pp. 659-662. IEEE, 2017.
[6] Q. Yao, D. Song, X.u. Xiang, K. Zou, A novel finger vein recognition method
based on aggregation of radon-like features, Sensors 21 (5) (2021) 1885.
[7] B.A. Rosdi, N. Mukahar, N.T. Han, Finger Vein Recognition Using Principle
Component Analysis and Adaptive k-Nearest Centroid Neighbor Classifier, Int.
J. Integr. Eng. 13 (1) (2021) 177–187.
[8] K. Kapoor, S. Rani, M. Kumar, V. Chopra, G.S. Brar, Hybrid local phase
quantization and grey wolf optimization based SVM for finger vein
recognition, Multimedia Tools Appl. (2021) 1–39.
[9] Khanam, Ruqaiya, Ramsha Khan, and Rajeev Ranjan. ‘‘Analysis of finger vein
feature extraction and recognition using DA and KNN methods.” In 2019 Amity
International Conference on Artificial Intelligence (AICAI), pp. 477-483. IEEE,
2019.
[10] K. Padmavathi, K. Thangadurai, Implementation of RGB and grayscale images
in plant leaves disease detection–comparative study, Indian J. Sci. Technol. 9
(6) (2016) 1–6.
[11] Zhu, Xiangyuan, Xiaoming Xiao, Tardi Tjahjadi, Zhihu Wu, and Jin Tang. ‘‘Image
enhancement using fuzzy intensity measure and adaptive clipping histogram
equalization.” arXiv preprint arXiv:2101.05922 (2021).
Materials Today: Proceedings xxx (xxxx) xxx
[12] T. Zarra, G.K. Mark, F.C. Galang, V.B. Ballesteros, V. Naddeo, Instrumental odour
monitoring system classification performance optimization by analysis of
different pattern-recognition and feature extraction techniques, Sensors 21 (1)
(2021) 114.
[13] P. Dhakal, P. Damacharla, A.Y. Javaid, V. Devabhaktuni, A near real-time
automatic speaker recognition architecture for voice-based user interface,
Machine Learn. Knowledge Extraction 1 (1) (2019) 504–520.
[14] A. Bombatkar, G. Bhoyar, K. Morjani, S. Gautam, V. Gupta, Emotion recognition
using Speech Processing Using k-nearest neighbor algorithm, Int. J. Eng. Res.
Appl. (IJERA) (2014) 2248–9622, ISSN 2014.
[15] J.T. Senders, M.M. Zaki, A.V. Karhade, B. Chang, W.B. Gormley, M.L. Broekman,
T.R. Smith, O. Arnaout, An introduction and overview of machine learning in
neurosurgical care, Acta Neurochirurgica 160 (1) (2018) 29–38.
[16] P. Song, W. Zheng, Feature selection based transfer subspace learning for
speech emotion recognition, IEEE Trans. Affective Comput. (3) (2018) 373–
382.
[17] A.K. Sandhu, R.S. Batth, Software reuse analytics using integrated random
forest and gradient boosting machine learning algorithm, Software: Pract.
Experience 51 (4) (2021) 735–747.
[18] Dhakal, Parashar, Praveen Damacharla, Ahmad Y. Javaid, and Vijay
Devabhaktuni. ‘‘Detection and Identification of Background Sounds to
Improvise Voice Interface in Critical Environments.” in: 2018 IEEE
International Symposium on Signal Processing and Information Technology
(ISSPIT), pp. 078-083. IEEE, 2018.
[19] Bilal Alhayani, Rane Milind, Face recognition system by image processing, Int.
J. Electron. Commun. Eng. Technol. (IJCIET) 5 (5) (2014) 80–90.
[20] A.H. Meftah, Y.A. Alotaibi, S.-A. Selouani, Evaluation of an Arabic speech corpus
of emotions: a perceptual and statistical analysis, IEEE Access 6 (2018) 72845–
72861.
[21] M.J. Warrens, Kappa coefficients for dichotomous-nominal classifications, Adv.
Data Anal. Classification (2020) 1–16.
[22] B. Al Hayan, H. Ilhan, Visual sensor intelligent module based image
transmission in industrial manufacturing for monitoring and manipulation
problems, J. Intell. Manuf. 32 (2021) 597–610.
[23] B. Al-Hayani, H. Ilhan, Efficient cooperative image transmission in one-way
multi-hop sensor network, Int. J. Electr. Eng. Educ. 57 (4) (2020) 321–339.
[24] B. Alhayani, A. Abdallah,, Manufacturing intelligent corvus corone module for a
secured two way image transmission under WSN, Eng. Comput. 37 (2020) 1–
17.
Further Reading
[1] Milind E. Rane, Umesh S. Bhadade, Comparative Study of ROI Extraction of
Palmprint, IJCSN Int. J. Comput. Sci. Network 5 (2) (2016).
[2] Milind. Rane and Umesh. Bhadade, ‘‘ Multimodal score level fusion for
recognition using face and palmprint”, The International Journal of Electrical
Engineering & Education, PP1-19, 2020.
[3] Milind Rane, Tejas Latne, Umesh Bhadade, Biometric recognition using fusion,
ICDSMLA 2019 (2019) 1320–1329.
[4] B. ALhayani, H. Ilhan, Image transmission over decode and forward based
cooperative wireless multimedia sensor networks for Rayleigh fading channels
in medical internet of things (MIoT) for remote health-care and health
communication monitoring, J. Medical Imaging Health Inf. 10 (2020) 160–168.
[5] Bilal Alhayani, Husam Jasim Mohammed, Ibrahim Zeghaiton Chaloob, Jehan
Saleh Ahmed, Effectiveness of artificial intelligence techniques against cyber
security risks apply of IT industry, Mater. Today: Proceedings (2021), https://
doi.org/10.1016/j.matpr.2021.02.531.
[6] Bilal Alhayani, Sara Taher Abbas, Dawood Zahi Khutar, Husam Jasim
Mohammed, Best ways computation intelligent of face cyber attacks, Mater.
Today Proc. (2021), https://doi.org/10.1016/j.matpr.2021.02.557.