Professional Documents
Culture Documents
11+alg Stat Paper
11+alg Stat Paper
Received: 2022 March 15; Revised: 2022 April 20; Accepted: 2022 May 10
Abstract:
There are certain challenges when dealing with hyperspectral images including limited training
samples, high dimensionality of the data, Hughes phenomena, handling the noisy information,
problem of overfitting and information loss. The work presented here describes the various
techniques to handle the challenges above while working with the hyperspectral images and their
applications. The mostly used classification algorithms are the k nearest neighbor algorithm, the
support vector machine, Convolutional neural networks, Decision Trees, Random Forests, and
other deep learning algorithms. The work reviews in detail the above algorithms and their
performance based on few publicly available hyperspectral images datasets.
Keywords: Hyperspectral images, handling HSI, classification, KNN, CNN, Decision trees,
Random Forests.
the various existing technologies and the give its best performance for classification
evaluation results. task. The implementation cost and the high
classification efficiency is the main
2. Literature Review: advantage of this method.
The involvement of the machine learning S. KLIBI, K. TOUNSI, Z. B. REBAH, B.
and deep learning algorithms in our day to SOLAIMAN and I. R. FARAH [2], In the
day have given us opportunities that fuel our work presented, the authors have worked on
future in many ways.The literature soil salinity prediction model. The machine
mentioned in this work highlights the learning approaches applied in the model for
implementation and utilization of the improving the efficiency of the system
various learning algorithms in the analysis include the mix of auto encoders with
and applications of the Hyperspectral methods like KNN, SVM and Decision
images information. The Spectral and the Trees. The authors have proposed the pixel
spatial information represented over the based approach using spectral signature and
bands can be utilized for the betterment of the feature vector of the input hyperspectral
the mankind at various levels. The work images. The problem of insufficient data for
presented gives an idea about the various classification was handled in the work with
applications and features of the deep the help of the neighborhood matrix for each
learning algorithms over the hyperspectral of the image pixels. The accuracy and the
images data from various fields. efficiency of the method applied by the
2.1 KNN combination of the auto encoders and other
deep learning methods have proved to be
Giuseppe Bonifazi, Giuseppe Capobianco, better for image classification.
Riccardo Gasbarrone, Silvia Serranti [1], In
the work, the authors have utilized the Yanhui Guo, Siming Han, Ying Li, Cuifen
Principal Component Analysis method of Zhang, Yu Bai [3], The authors have used
the K nearest Neighbor algorithm in order to the combination of K-nearest Neighbor
evaluate the quality control of the pistachio along with the guided filter method in order
nuts. The other methods were applied for the to increase the accuracy of the image
same including the Principal Component classification. Pattern recognition is one of
analysis- Discriminant Analysis and Partial the applications of the non – parametric
Least Square- Discriminant Analysis. The KNN. The authors have used the integration
PCA-KNN is basically called the mixed of the spatial and the spectral information
classification method that combines the for bettering the classification accuracy.
advantages of linear method that is PCA and They have also used the guided filter to
the non linear method KNN. In this case the extract the spatial features of the image for
KNN uses maximal margin hyperplane to an guided image and then applied a joint
4396
JOURNAL OF ALGEBRAIC STATISTICS
Volume 13, No. 3, 2022, p. 4395-4411
https://publishoa.com
ISSN: 1309-3452
They have analysed that the support vector information. The input data is divided into
machines can handle large amount of data 3D patches and is given as an input to the
and noisy samples as well. The approach proposed model in order to feature
mentioned in the article shows good extraction. For implementing the model, two
performance with respect to accuracy with convolutional layers along with two ReLu
even small number of uneven training layers, then, used one- max pooling layer are
samples. It is mentioned that the method of used. Better overall classification accuracies
incorporating the spectral and the spatial are obtained over three considered data sets.
features is the main strength of the system
and the performance was better than other C. Yu et al., [11], The authors in this work
methods like KNN, Linear Discriminant have worked on the CNN method along with
analysis, etc, an extracted hashing feature for performing
hyperspectral image classification. The hash
2.3 Conventional Neural Network: functions are constructed for locality and
discriminability of the designed classes. The
S. Mei, X. Chen, Y. Zhang, J. Li and A. CNN has been designed to get the
Plaza [9], The authors have observed that hierarchical feature maps including the
the CNN can perform better when it comes spatial and the spectral information. The
to feature extraction capabilities. The CNN extraction of deep features from the images
has the capability to learn the spectral and considered is possible using this approach.
spatial features from the given images data. Hence, the classification accuracy can be
To further improve the performance further improved using these extracted
of the network, the paper presents a new features.
step activation quantization method. The
method discussed here is effective and also J. Li, Q. Du, B. Xi and Y. Li [12], The work
reduces memory requirement during the presents the approach for hyperspectral
process of classification. The proposed image classification where the combination
method even proved effective in terms of of the CNN architecture along with the
processing speeds in turn benefitting in the orthogonal complement subspace projection
requirements of the hardware balance solution is mentioned in order to
implementations by constraining the handle the problem of few training samples.
network layes with the binary weights. . The authors then have used the synthetic
minority oversampling technique for
M. Kanthi, T. H. Sarma and C. S. Bindu improving the classification accuracy. The
[10], The work mentioned in this article benefit of the combined approach is that the
concentrates on the implementation of the classification performance can be improved
new approach by utilizing the CNN model with the help of more distinctive and refined
to implement 3d deep feature extraction spectral features.
using both the spectral and the spatial
4398
JOURNAL OF ALGEBRAIC STATISTICS
Volume 13, No. 3, 2022, p. 4395-4411
https://publishoa.com
ISSN: 1309-3452
Guangxin Ren, Yujie Wang, Jingming Ning, hyperspectral images. The method ID3
Zhengzhu Zhang [17], The authors in this decision tree method has been modified for
work have developed a quality assessment the incorporation of the spatial information
method for testing the tea quality without of neighboring objects in turn helping
involving humans. The near-infrared predict the actual interested object. The
hyperspectral imaging has been combined spatial information involved can be nominal
with the multiple decision tree method for or continuous values based on which the
the analyzing the quality of the delineating splitting criterion was decided. The work
black tea. Various decision tree algorithms has successful implementation of the spatial
including the fine tree, medium tree and relationships and have generated reduced
course tree were used for testing the error rates. The method was implemented
modeling effect in the created method. The with better classification accuracies and can
performance of the system was based on be applied where spatiality plays a vital role.
parameters including correct classification
rate which has generated 93.13 prediction 2.6 Random Forest
accuracy. K. M. Sai Kishore, M. Kumar Behera, S.
N. Praditya and A. H. Saputro [18], The Chakravarty and S. Dash [20], The authors
authors have concentrated on the in this work have mentioned that the
hyperspectral image classification classification of the features of the
application for identifying the beewax over hyperspectral image is a crucial task. They
the Rome beauty apples. Here, the have focused on the classification of the
hyperspectral images of the wavelength complex hyperspectral images with the help
ranging from 400 to 1000 nm was utilized. of the SVM, Decision tree, Polinomial
The reflectance profile measure was used in logistic regression and other classification
order to classify the waxed and nonwaxed methods. The method of minimum noise
apples. The dimensionality reduction fraction have been used to reduce the un-
clustering was applied using the Principal necessary and noisy data bands for the input
Componenet Analysis. The decision tree data of the hyperspectral images. The
model was applied which showed better authors have observed that the decision trees
classification accuracy. The Decision tree serve as the one of the best solutions for
model was implemented using 13 essential classification of the hyperspectral images.
variables and 13 features for performing the Over the data considered for the
classificationtask. classification, the random forest gives the
best overall classification accuracy results.
M. Gupta and S. Minz [19], The authors
have worked on a spatial classification X. Liu, R. Wang, Z. Cai, Y. Cai and X. Yin
information for the classification of the [21], The authors have highlighted that the
overall performance of the Deep neural
4400
JOURNAL OF ALGEBRAIC STATISTICS
Volume 13, No. 3, 2022, p. 4395-4411
https://publishoa.com
ISSN: 1309-3452
Networks is dependent on the quality of the worked on the classification of the tobacco
input data. The input data dimension is too leaves and their impurities. The methods
high and very fine tuned due to which the utilized here are smoothing filter,
structural complexity is also increased. The multiplicative scatter correction method and
proposed work concentrates on the the random forest classifier. The random
implementation of the Deep forest for HIS forest classifier consists of series of decision
classification task. Later the Deep forest tree classifiers in which independent random
have been extended fo deep multigrained variable exist which is utilized for pixel
cascade forest in order to implement spatial classification. Here each decision tree
feature based hyperspectral image required only few training samples to train
classification. The Cascade Random Forest and only k features randomly extracted are
was developed to perform the multigrain required for the input nodes for
scanning over the input data in order to classification process. The random forest
enhance the output. Further, a pooling layer have shown a better overall classification
has been added to reduce the generated accuracy.
output dimension.
3. Proposed Methodology:
I. Khosravi and Y. Jouybari-Moghaddam
[22], The authors have worked on the 3.1 Dataset
implementation of the filter based forest 1. ROSIS Pavia University
methods for hyperspectral image Hyperspectral Image: Reflective optics
classification. The methods used are the spectrographic image system (ROSIS) Pavia
balanced filter based forest and the other University hyperspectral image was
method is the cost sensitive filter based acquired with ROSIS optical sensor which
forest for the classification of the high provides 115 bands with a spectral range
dimensional hyperspectral data. The authors coverage ranging from 0.43 to 1µ. The
in the work highlighted that the methods spatial resolution is 1.3 m. The each image
have the capability to handle the imbalanced has pixels with 103 spectral channels and 9
data problems during the classification classes were considered.
process. The implementation of the methods
have proved to be more efficient than the 2. Kennedy Space Center (KSC)
existing classical forests methods. The SVM Hyperspectral Image: KSC hyperspectral
served better for handling of the imbalanced image shown in Fig. 1(e) was acquired with
data used in the hyperspectral image airborne visible/infrared imaging
classification. spectrometer (AVIRIS) sensor over the
Z. Long, M. Xiaoyu, L. Zhigang and L. Kennedy Space Center (KSC), Florida,
Yong [23], In the work, the authors have USA, on March 23, 1996. This image has
224 bands from 400 to 2500 nm and the
4401
JOURNAL OF ALGEBRAIC STATISTICS
Volume 13, No. 3, 2022, p. 4395-4411
https://publishoa.com
ISSN: 1309-3452
Refer to Table 2 for more information about designed and implemented for compilation.
the CNN architecture. As far as the Afterwards the training data is provided to
summarized process for proposed work is the model for and the output is analyzed for
concerned, first of all the CNN model is proper validation of outputs. Total 13
4402
JOURNAL OF ALGEBRAIC STATISTICS
Volume 13, No. 3, 2022, p. 4395-4411
https://publishoa.com
ISSN: 1309-3452
iterations are considered for complete whether the given image is having a tumor
analysis to find out the iterations with best or not. This process provides a good way to
accuracy results. These results are used for draw results with better accuracy.
providing the actual input and find out the
3.4 Crop the part of the image want all of our images to be (240, 240, 3) to
representing only the brain. feed it as an input to the neural network.
Resize the image (because the images in the 1. Apply normalization because we
dataset come in different sizes (meaning want pixel values to be scaled to the range
width, height and # of channels). So, we 0-1.
4403
JOURNAL OF ALGEBRAIC STATISTICS
Volume 13, No. 3, 2022, p. 4395-4411
https://publishoa.com
ISSN: 1309-3452
2. Append the image to X and its label contains the first part belonging to one class
to y. and the second part belonging to the other
3. After that, Shuffle X and y, because class, and we don't want that).
the data is ordered (meaning the arrays 4. Finally, Return X and y.
4. Prediction Model
4.1 Implementation
3
2.5
2
1.5
1
0.5
0
4405
JOURNAL OF ALGEBRAIC STATISTICS
Volume 13, No. 3, 2022, p. 4395-4411
https://publishoa.com
ISSN: 1309-3452
F1 score: 0.9814814814814815
F1 score: 0.9602446483180428
4406
JOURNAL OF ALGEBRAIC STATISTICS
Volume 13, No. 3, 2022, p. 4395-4411
https://publishoa.com
ISSN: 1309-3452
4408
JOURNAL OF ALGEBRAIC STATISTICS
Volume 13, No. 3, 2022, p. 4395-4411
https://publishoa.com
ISSN: 1309-3452
4410
JOURNAL OF ALGEBRAIC STATISTICS
Volume 13, No. 3, 2022, p. 4395-4411
https://publishoa.com
ISSN: 1309-3452
[26] S. Ajani and M. Wanjari, "An Efficient [29] Ajani, S., Amdani, S.Y. and Asole,
Approach for Clustering Uncertain Data S.S., 2021. Probabilistic Path Planning
Mining Based on Hash Indexing and over Dynamic environment using
Voronoi Clustering," 2013 5th Improved Dynamic RRT*
International Conference and Algorithm. Design Engineering,
Computational Intelligence and pp.6613-6621.
Communication Networks, 2013, pp.
486-490, doi: 10.1109/CICN.2013.106.
4411