khan2021 optometry
khan2021 optometry
Abstract
Glaucoma is a domineering and irretrievable neurodegenerative eye disease produced by the optical nerve head owed
to extended intra-ocular stress inside the eye. Recognition of glaucoma is an essential job for ophthalmologists. In this
paper, we propose a methodology to classify fundus images into normal and glaucoma categories. The proposed
approach makes use of image denoising of digital fundus images by utilizing a non-Gaussian bivariate probability distribu-
tion function to model the statistics of wavelet coefficients of glaucoma images. The traditional image features were
extracted followed by the popular feature selection algorithm. The selected features are then fed to the least square
support vector machine classifier employing various kernel functions. The comparison result shows that the proposed
approach offers maximum classification accuracy of nearly 91.22% over the existing best approaches.
Keywords
Glaucoma fundus images, wavelet transform, feature extraction, feature selection, LS-SVM
glaucoma from fundus images. Nyul (2009) used pixel Analysis Group, n.d.). The main contribution of the
intensities and fast Fourier transform (FFT) as a fea- present paper is the hybridization of image denoising
ture for classifying glaucoma and normal fundus with machine learning approaches, which is an unex-
image. Raja and Gangatharan (2013) have used com- plored area for fundus image analysis for glaucoma
plex wavelet transform and higher-order spectra for the detection. Thus, the proposed approach is suitable in
analysis of normal and glaucoma fundus images. Raja circumstances where computationally extensive
and Gangatharan (2015) have used wavelet packet approaches like deep learning are not feasible.
decomposition (WPD) combined with entropy and The remaining parts of this paper are given as fol-
energy geographies as a feature to detect glaucoma lows: In section II we have discussed the methodology
from fundus images. Townsend et al. (2008) have uti- which includes, the image database, pre-processing, fea-
lized Heidelberg retinal tomograph (HRT), recursive ture extraction, feature selection, and classification. The
screen, and corrosion tree with SVM classifier for ana- outcomes achieved and their discussions are listed in
lysing and classifying normal and glaucoma fundus section III. Section IV concludes the paper.
images. Kirar and Agrawal (2018) have suggested the
identification of glaucoma from fundus images using
DWT and histogram functions. In Maheshwari et al. Methodology
(2017), the fixed number of modes for variational mode The various steps of the proposed approach are
decomposition (VMD) has been proposed to detect explained in this section. These steps are pre-process-
glaucoma. In Kirar and Agrawal (2019), 2D-DWT has ing, feature selection using the NCA method, and
been proposed to decompose glaucoma and healthy
LS-SVM classifier to process fundus images. The meth-
images and classification has been performed over
odology of the proposed approach using the CAD tool
histogram-based features. Yadav et al. (2014) used
is shown in Figure 1. The input image is a fundus
texture-based feature extraction and classification of
image and data are taken from the MIAG image data-
glaucoma fundus images. To overcome the shortcom-
base. The extraction of glaucoma and healthy images
ings of Empirical mode decomposition (EMD) (Yu
from fundus image is performed in five different
et al., 2020), Agrawal et al. (2019) have proposed glau-
stages as
coma detection using quasi-bivariate variational mode
decomposition (QB-VMD) from digital fundus images.
Maheshwari et al. (2017) decomposed fundus images Stage-1: The R-component, B-component, and G-com-
utilizing empirical wavelet transform (EWT). ponent of the fundus input image are extracted.
Almost all the state-of-the-art techniques require a Stage-2: The pre-processing of R-plane, B-plane, and
tremendous amount of computational resources due to G-plane was performed.
image conversion in the frequency domain or decom- Stage-3: The different feature extraction techniques are
position using computationally extensive methods like used. The details of extracted features of fundus images
EMD and VMD. are shown in Table 1.
In this paper, we have employed spatial features with Stage-4: Various features selection approaches have
a denoising approach for RGB fundus images. The been used, out of which, the neighbourhood compo-
inclusion of all three planes has been carried out to nent analysis (NCA) approach has resulted in better
avoid any possible loss of information. Various feature results.
selection and ranking techniques have been tested to Stage-5: The LV-SVM classifier is used to classify
reduce the dimensionality of the feature space. In the healthy and glaucoma images.
recently reported literature related to glaucoma diagno-
sis from fundus images, the least square support vector
machine (LS-SVM) has been proved to be effective for
classifying fundus images in normal and glaucoma cate-
Image database
gories (Kirar and Agrawal, 2019; Martins et al., 2020; The approach described is tested on 455 images of
Parashar and Agrawal, 2020). Hence in the present RIM-One of MIAG (Medical Image Analysis Group,
study, we have used LS-SVM as a classifier that cate- n.d.). There are 200 fundus images that correspond to
gorizes glaucoma and normal fundus images using the the glaucoma category and 255 fundus images corre-
pull-out features.LS-SVM classifier with linear, polyno- spond to the normal category. It’s worthwhile to note
mial, and RBF kernel has been tested for all the possi- here that the glaucoma category also contains the pre-
ble feature spaces formed by various ranking methods. glaucoma fundus images. The proposed approach is
Accuracy, sensitivity, and specificity were measured implemented using MATLAB 2017 (b) running on a
and tested using tenfold cross-validation. The suggested 2.10 GHz, 12 GB RAM laptop with an Intel i7
approach applies to 455 MIAG images (Medical Image processor.
Khan et al. 3
Table 1. Feature extraction parameter and corresponding mapping with R-G-B plane (Hira and Gillies, 2015; Khaire and
Dhanalakshmi, 2019).
1 Contrast P
X P
Y It measures local 1 9 17
jx yj2 P(x, y) intensity variation.
x¼1 y¼1
2 Mean (m) 1 XX XY It is defined as the measure 2 10 18
P(x, y) of average intensity and denoted by m.
XY x¼1 y¼1
3 Homogeneity P
X P
Y P(x, y) It is used to quantify the 3 11 19
1 þ jx yj distribution of pixel intensities
x¼1 y¼1
in the region of image.
4 Energy (En) X P
P Y It is defined as the measure 4 12 20
P(x, y)2 of uniformity in the range [0, 1].
x¼1 y¼1
5 Entropy (H) P X P Y It is defined as the measure of 5 13 21
P(x, y)log2 ½P(x, y) uncertainty and randomness.
vx¼1 y¼1
ffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi
6 Standard Deviation (s) u X It is used to quantify the closeness 6 14 22
u1 X X Y
t ðPðx, y Þ mÞ2 of pixel intensities to the mean.
XY x¼1 y¼1
vffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi
7 Root mean square (RMS) u X To quantify the distribution of 7 15 23
u1 X X Y
t ðP(x, y Þ2 pixel intensities of the image.
XY x¼1 y¼1
8 Variance (s2 ) 1 XX X Y It is defined as the measure of 8 16 24
ðPðx, yÞ mÞ2 the spread of pixels value about
XY x¼1 y¼1
mean and denoted by s2.
Figure 2. Block diagram of pre-processing steps of the proposed system and image filtering.
for improved interpretation of data on the same scale. X, Y denotes total number of pixels in an image.
All planes in the images are conserved to retain maxi-
mum information. Denoising is important in the area (d) Feature Selection: It is important to select sig-
of medical imaging. In general, optical coherence tomo- nificant features from a large feature set (Li
graphy (OCT) images are corrupted by speckle noise et al., 2020). This procedure overwhelms the
(Sahu et al., 2019). Speckle noise is a multiplicative problem of overfitting, lessens the data size,
noise. The value of the noisy pixel is the multiplication which diminishes the complexity of the scheme
of the noise value and the original pixel value. As a and hence growths speed and classification cor-
pre-processing step denoising procedure is as follows. rectness of the system. The details of feature
We have proposed the use of simple non-Gaussian selection and ranking methods used in the pres-
bivariate probability distribution function to model the ent work are shown in Table 2. For getting
statistics of wavelet coefficients of the fundus images. more insight into these methods, the readers
The model captures the dependence between a wavelet are encouraged to refer (Hira and Gillies, 2015;
coefficient and its parent. Using Bayesian estimation Khaire and Dhanalakshmi, 2019).
theory, we derive from this model a simple non-linear
shrinkage function for wavelet denoising, which gener-
alizes the soft thresholding approach. Least squares support vector machine
Briefly, the algorithm is summarized as,
The support vector machine (SVM) classifier is a popu-
lar classification algorithm used in pattern recognition
1. Calculate the noise variance.
tasks (Suykens and Vandewalle, 1999). SVM constructs
2. For each wavelet coefficient,
optimal hyperplane in higher dimensional feature space
(a) Calculate signal variance,
to separate various classes
(b) Estimate each coefficient using the bivariate
For a feature space containing K data points
shrinkage function.
fxk , yk gKk= 1 , where xk 2 Rn and yk 2 R is kth input data
The algorithmic details of the mentioned method can and the k th output class label respectively, addition-
xendur and Selesnick, 2002).
be found at (S ally, yk can take the value of either + 1 or 21, repre-
(c) Feature Extraction: Feature extraction is an senting two different classes. The SVM classifier
important step towards the accurate classifica- function to discriminate two classes is given as (Chen
tion of normal and glaucoma images. In the et al., 2020),
present study, to keep the computational com-
plexity at a minimum, we use basic spatial vð xÞ = sign OT uð xÞ + b ð1Þ
domain methods for image feature extraction.
These features for each R-G-B plane include Where O and b are the weight vector and bias term in
contrast, mean, variance, energy, entropy, d-dimensional feature space, respectively. The function
homogeneity, standard deviation and root uð xÞ maps x into d dimensional feature space. The core
mean square (Chowdhary and Acharjya, 2020), principle of SVM is to determine the optimal hyper-
which are shown in Table 1. In Table 1, the plane that maximizes the distance of data points to that
exact terminologies are as follows: of hyperplane for the respective class. This maximiza-
tion problem stated in SVM may be termed as an opti-
P(x, y) denotes instantaneous pixel values at coordinates mization problem with inequality constraints. For
(x, y). classifying biomedical signals, the least square SVM
Khan et al. 5
1 T-Test (T) This method analyses the features and checks whether the means
of two independent classes (samples) coming from the population
(normal distributions) are statistically different from each other.
2 Bhattacharyya Distance method (B) This method can be used as a class reparability measure to
evaluate the statistical dependence between two classes
of a feature.
3 Entropy Ranking Method (E) Here the divergence of two classes is tested by calculating a
measure called Relative Entropy.
4 Neighbourhood Component Analysis It is a non-parametric technique of feature selection wherein,
the stochastic nearest neighbour is used to find optimum set of
features for achieving maximum classification accuracy.
5 Receiver Operating Characteristics (ROC) Method (R) It is a normally used method to assess the presentation of a
classification procedure. ROC curve is a feature ranking
technique that events the individual implication of structures in
the feature vector. The benefit of the ROC curve system is that
it provides evidence around the overlapping of classes.
6 Wilcoxon rank-sum test Method (W) It compares two unpaired classes of the feature set. It is a
non-parametric test in which no assumptions about the
distribution of classes are needed.
(LS-SVM) has been frequently used [41] (Kumar et al., In equation (7), s is the hyperparameter.
2019). In LS-SVM, the optimization problem can be
stated as (Suykens and Vandewalle, 1999): 2. The polynomial kernel function (Medical Image
Analysis Group, n.d.):
1 T gX K
Minimize
|fflfflfflfflffl{zfflfflfflfflffl} = ðO, b, z Þ = O O + z 2 ð2Þ
2 2 k=1 k
O, b, z K xi , xj = (xi xj + 1)p ð7Þ
subjected to equality constraints as where p is the degree of the polynomial.
For evaluating the effectiveness of the classifier, we
yk OT uðxk Þ + b = 1 zk k = 1, 2, 3, :::, K: ð3Þ use performance metrics, namely, sensitivity, specificity,
accuracy, precision, recall and F-score. To compute
where z = (z1 , z2 , ::::zk )T :For equation (3), the
these metrics, four parameters, namely true-positive
Lagrangian multiplier ak can be defined as
(TP), true-negative (TN), false-positive (FP) and false-
negative (FN), are required. These parameters are
X
K
ðO, b, z; aÞ = =ðO, b, zÞ ak obtained from the resultant confusion matrix. TP and
k=1 ð4Þ TN denote correctly classified positive and negative
T instances, respectively, whereas incorrectly classified
yk O uðxk Þ + b 1 + zk
positive and negative instances are denoted by FP and
Solving equation (5) results in decision hyperplane FN, respectively. The performance measures are shown
function (Sharma and Pachori, 2015) as, in Table 3.
" #
X
K
nð xÞ = sign ak yk K(x, xk ) + b (5) ð5Þ Results and discussion
k=1
In the proposed work, automatic glaucoma detection
In equation (6) the Kðx, xk Þ is a kernel function. In this from fundus images has been proposed. In total, 455
work, the following kernel functions are used: images have been used from RIM-MIAG image data-
base (Agrawal et al., 2019; Kirar and Agrawal, 2019;
1. The radial basis function (RBF) kernel (Sharma Parashar and Agrawal, 2020). After extensive pre-
and Pachori, 2015): processing of the images, the eight features were
extracted for three planes of the images. We extracted a
jjxxk jj total of 24 features from three (RGB) planes. External
Kðx, xk Þ = e 2s2 ð6Þ synthetic speckle noise has been added to verify the
6 Concurrent Engineering: Research and Applications 00(0)
Table 3. Performance measures parameters (Chen et al., 2020; Zhang and He, 2020).
Table 4. Feature selection on noisy images with respect to RGB planes using the proposed method.
NCA
robustness of the proposed method. The process is selected features using NCA have been tested using
repeated for noisy and denoised images. Figures 3 and Kruskal Wallis statistical test and the p-value is com-
4 show the noisy and denoised fundus images of nor- puted. Figures 5 and 6 show the comparison of selected
mal and glaucoma category respectively. The signifi- feature sets for noisy and denoised images respectively.
cant features were selected using various feature The selected best features for noisy and denoiy
selection and ranking methods. The detailed outcomes images have been described and tabulatd in Tables 6
for the feature selection techniques are shown in Table and 7 respectively. With respect to the classification
4 for noisy images and in Table 5 for denoised images. problem in hand, from Tables 6 and 7, we can conclude
It is observed that from Table 5, that neighbourhood that image entropy, standard deviation, variance and
component analysis (NCA) has resulted in a smaller RMS value are the prominent features for classifying
number of features than its other counterparts. The fundus images into normal and glaucoma category.
Khan et al. 7
Table 5. Feature selection on denoised images with respect to RGB planes using the proposed method.
NCA
Figure 3. Normal fundus images: (a) orignal, (b) noisy and (c) denoised.
Figure 4. Glucoma fundus images: (a) orignal, (b) noisy and (c) denoisy.
Figure 5. Feature selected using NCA for the noisy image using the proposed method.
8 Concurrent Engineering: Research and Applications 00(0)
Figure 6. Feature selected using NCA for the denoised image using the proposed method.
Table 6. Description of the selected feature using NCA method for noisy fundus images.
2 Red Mean
5 Entropy
10 Green Mean
13 Entropy
14 Standard deviation
15 RMS
16 Variance
20 Blue Energy
21 Entropy
23 RMS
24 Variance
Table 7. Description of the selected feature using NCA method for denoised fundus images.
4 Red Energy
12 Green Energy
13 Entropy
14 Standard deviation
15 RMS
16 Variance
19 Blue Homogeneity
20 Energy
21 Entropy
24 Variance
The p-value for both the cases is less than 0.05, over the computed feature set. Tables 8 and 9 show the
which indicates the good discrimination ability of the performance of the LS-SVM classifier for various ker-
said feature set in classifying normal and glaucoma nels as well as the feature set obtained through various
fundus images. LS-SVM has been widely used in the feature selection techniques for noisy and denoised fun-
classification of glaucoma images (Azar and El-Said, dus images. From Table 9, it is evident that the maxi-
2014). Therefore, taking motivation from previously mum performance of LS-SVM is achieved with radial
reported work, in the present work we have used LS- basis function over the feature set provided by the
SVM with various kernels namely linear, polynomial NCA method. The improved performance by the LS-
(with the degree of 3), and radial basis function (with SVM classifier may be attributed to the non-linear
s = 1) to classify normal and glaucoma fundus images separability of the constructed feature space. This may
Khan et al. 9
be the reason for the underperformance of the linear radial basis function (with s = 1) to classify normal
kernel in LS-SVM. From Table 9, it is evident that the and glaucoma fundus images over the computed fea-
LS-SVM classifier performs well for the RBF kernel ture set. From Table 9, it is evident that the maximum
compared to other kernel. The p-value for both the performance of LS-SVM is achieved with radial basis
cases is less than 0.05, which indicates the good dis- function over the feature set provided by the NCA
crimination ability of the said feature set in classifying method. The improved performance by the LS-SVM
normal and glaucoma fundus images. LS-SVM has classifier may be attributed to the non-linear separabil-
been widely used in the classification of glaucoma ity of the constructed feature space. This may be the
images (Azar and El-Said, 2014). Therefore, taking reason for the underperformance of the linear kernel in
motivation from previously reported work, in the pres- LS-SVM. From Table 9, it is evident that the LS-SVM
ent work we have used LS-SVM with various kernels classifier performs well for the RBF kernel compared
namely linear, polynomial (with the degree of 3), and to other kernel. For the LS-SVM with RBF kernel, the
10 Concurrent Engineering: Research and Applications 00(0)
Table 10. Performance comparison of the proposed method and existing methods over MIAG dataset for two-class classification.
performance parameters too performed well with accu- dataset. In a recently reported study by Parashar and
racy, sensitivity and specificity of 91.22 %, 85.51% and Agrawal (2020), flexible analytic wavelet transform has
98.50% respectively. been utilized followed by the entropies and fractal fea-
Moreover, the robustness of the noise removal algo- tures. Parashar and Agrawal (2020) have attended an
rithm is verified from Tables 8 and 9, in which the slight impressive classification accuracy of 90.76% using LS-
increase in the performance for denoised images is evi- SVM classifier. A convolution neural network has been
dent. In Table 9 the bold text signifies the highest per- employed to classify glaucoma from fundus images in
formance. Here it is worthwhile to mention that the Martins et al. (2020). The classification accuracy
LS-SVM classifier is used with 10% outlier removal. reported in Martins et al. (2020) is 87%.
Without outlier removal, we observed a decrease in The common aspect of the state-of-the-art methods
classification performance by 4%–5%. proposed in the existing literature is that they involve
A comparison of the proposed technique with exist- time-frequency analysis and deep learning approaches
ing methods is given in Table 10. Nyul (2009) have used for classification. The advantages associated with the
LS-SVM classifier for classifying normal and glaucoma existing methods can be highlighted as follows:
fundus images over the feature space constructed by
empirical wavelet transform and correlation entropy. 1. The use of time-frequency analysis techniques
The authors in (Nyúl, 2009) have achieved a classifica- enables to capture of the non-linearity in the data-
tion accuracy of 84%. In Raja and Gangatharan set, thereby making classification more accurate.
(2015), wavelet packet transform has been used to 2. The deep learning approach does not require
extract the features from glaucoma images. The features hand-crafted features, which in turn makes further
extracted from wavelet packet transform have been research feasible thereby reducing the feature
used to train the artificial neural network (ANN). Raja exploration burden.
and Gangatharan (2015) have achieved a classification
accuracy of 85%. Higher-order statistics obtained from Being said the advantages of existing methodologies,
continuous wavelet transform has been employed by these methods are generally computationally extensive
Kirar and Agrawal (2018) to classify normal and glau- due to the application of time-frequency analysis meth-
coma fundus images. Kirar and Agrawal (2018) have ods and deep learning approaches.
achieved the classification accuracy of 88.33% with the Thus, the proposed method has an edge over existing
ANN classifier. Recently, Agrawal et al. (2019) have methods in the following aspects:
used a variational mode decomposition technique to
extract the mono frequency modes of glaucoma images. a. The analysis is carried out in the time domain;
Various features based on entropy and fractals have hence the computational complexity is less.
been extracted from the modes and subsequently, LS- b. All three RGB planes of the fundus image have
SVM has been employed for classification to get an been used to preserve the maximum information.
accuracy of 86.13%. Kumar et al. (2019) have used rim c. Classical image feature extraction algorithms
to disc ratio to classify fundus images into normal and have been used, making the proposed approach
glaucoma categories. The classification accuracy simpler.
reported in Kumar et al. (2019) is 84% over the Drishti
Khan et al. 11
Author biographies
Sibghatullah I. Khan. completed his B.E, M.E and Ph.D in Electronics and
Telecommunication Engineering from SGB Amravati University, India in the years 2007,
2012, and 2018 respectively. Presently he is working as an Associate Professor in the
Department of Electronics and Communication Engineering at Sreenidhi Institute of
Science and Technology Hyderabad, INDIA. His research interests focus on Bio-Medical
Signal Processing.
Khan et al. 13
Dr.Shruti Bhargava Choubey received BE with honors from RGPV Bhopal and M.
Tech.degree in Digital Communication Engineering from RGPV Bhopal subsequently she
carried out her research from Dr.K.N. Modi University Banasthali Rajasthan and awarded
Ph.D. in 2015. Presently she is working as an Associate Professor in the Department of
Electronics and Communication at Sreenidhi Institute of Science and Technology,
Hyderabad she has published more than 100 papers of national and international repute.
She has been a Member of many selection committees for the recruitment of staff and
faculty. her research areas include signal processing Image processing and Biomedical
Engineering. He has produced 18 M.Tech degrees & guided more than 70 B.Tech Project.
She is a member of IETE, New Delhi and International Association of Engineers (IAENG)
and IEEE. She worked in different positions like Dean academic & HOD with numerous
capacities. she is awarded by MP Young scientist Award 2015 & Received mp council fellow-
ship in year 2014 & 2015’’ for her contribution to Research.
Abhishek Choubey received a Ph.D. degree in the field of VLSI for digital signal processing
from Jaypee University and technology Guna MP, in 2017. He is currently associated with
Sreenidhi institute of science and technology, Hyderabad, as an Associate Professor. He has
published nearly 70 technical articles. His research interest includes reconfigurable architec-
tures, approximate-computation, algorithm design, and implementation of high-performance
VLSI systems for signal processing applications. He was a recipient of the Sydney R. Parker
and M. N. S. Swamy Best Paper Award for Circuits, Systems, and Signal Processing in 2018.
Pandya Vyomal completed his B.E. in Electronics Engineering from Veer Narmad South
Gujarat University in 2007, M.E. in Electronics and Communication Systems from
Dharmsinh desai University, Nadiad, Gujarat in 2010 and Ph.D. from Gujarat
Technological University, Chandkheda, Gujarat in 2016. He is working as an Associate
Professor in the Department of Electronics & Communication Engineering. He has a total 8
years of experience in academia. He has published 15 technical papers in international jour-
nal. He guided 12 UG projects and 8 M.Tech. Thesis. He worked in various engineering col-
leges of Gujarat. He is a life time member of IEEE. He is also a member of ISTE. He has
very strong research foundation. His areas of research are Wireless Sensor Network, Delay
Tolerant Networks and Computer Networking.