scholarly journals EXTRACTION OF OPTIMAL SPECTRAL BANDS USING HIERARCHICAL BAND MERGING OUT OF HYPERSPECTRAL DATA

2015 ◽  
Vol XL-3/W3 ◽  
pp. 459-465 ◽  
Author(s):  
A. Le Bris ◽  
N. Chehata ◽  
X. Briottet ◽  
N. Paparoditis
Keyword(s):  
Feature Selection ◽  
Hyperspectral Data ◽  
Band Selection ◽  
Data Set ◽  
Spectral Bands ◽  
Relevance Criterion ◽  
Spectral Optimization ◽  
The One ◽  
Selection Algorithms ◽  
Different Levels

Spectral optimization consists in identifying the most relevant band subset for a specific application. It is a way to reduce hyperspectral data huge dimensionality and can be applied to design specific superspectral sensors dedicated to specific land cover applications. Spectral optimization includes both band selection and band extraction. On the one hand, band selection aims at selecting an optimal band subset (according to a relevance criterion) among the bands of a hyperspectral data set, using automatic feature selection algorithms. On the other hand, band extraction defines the most relevant spectral bands optimizing both their position along the spectrum and their width. The approach presented in this paper first builds a hierarchy of groups of adjacent bands, according to a relevance criterion to decide which adjacent bands must be merged. Then, band selection is performed at the different levels of this hierarchy. Two approaches were proposed to achieve this task : a greedy one and a new adaptation of an incremental feature selection algorithm to this hierarchy of merged bands.

scholarly journals Spectral Optimization of Airborne Multispectral Camera for Land Cover Classification: Automatic Feature Selection and Spectral Band Clustering

2020 ◽  
Author(s):  
Arnaud Le Bris ◽  
Nesrine Chehata ◽  
Xavier Briottet ◽  
Nicolas Paparoditis
Keyword(s):  
Feature Selection ◽  
Land Cover ◽  
Spectral Band ◽  
Land Cover Classification ◽  
Hyperspectral Data ◽  
Data Sets ◽  
Relevance Score ◽  
Spectral Bands ◽  
Optimization Heuristics ◽  
Spectral Optimization

Hyperspectral imagery consists of hundreds of contiguous spectral bands. However, most of them are redundant. Thus a subset of well-chosen bands is generally sufficient for a specific problem, enabling to design adapted superspectral sensors dedicated to specific land cover classification. Related both to feature selection and extraction, spectral optimization identifies the most relevant band subset for specific applications, involving a band subset relevance score as well as a method to optimize it. This study first focuses on the choice of such relevance score. Several criteria are compared through both quantitative and qualitative analyses. To have a fair comparison, all tested criteria are compared to classic hyperspectral data sets using the same optimization heuristics: an incremental one to assess the impact of the number of selected bands and a stochastic one to obtain several possible good band subsets and to derive band importance measures out of intermediate good band subsets. Last, a specific approach is proposed to cope with the optimization of bandwidth. It consists in building a hierarchy of groups of adjacent bands, according to a score to decide which adjacent bands must be merged, before band selection is performed at the different levels of this hierarchy.

An Enhancement of Feature Selection Algorithm for EDM: A Review

2018 ◽  
Vol 8 (5) ◽  
pp. 29
Author(s):  
Manpreet Kaur ◽  
Chamkaur Singh
Keyword(s):  
Feature Selection ◽  
Educational Data Mining ◽  
Problem Formulation ◽  
Research Area ◽  
Education Quality ◽  
Educational Institutions ◽  
Selection Algorithm ◽  
Positive Role ◽  
Data Set ◽  
Selection Algorithms

Educational Data Mining (EDM) is an emerging research area help the educational institutions to improve the performance of their students. Feature Selection (FS) algorithms remove irrelevant data from the educational dataset and hence increases the performance of classifiers used in EDM techniques. This paper present an analysis of the performance of feature selection algorithms on student data set. .In this papers the different problems that are defined in problem formulation. All these problems are resolved in future. Furthermore the paper is an attempt of playing a positive role in the improvement of education quality, as well as guides new researchers in making academic intervention.

Dimensionality Reduction and Classification of Hyperspectral Images using Genetic Algorithm

2016 ◽  
Vol 3 (3) ◽  
pp. 503 ◽  
Author(s):  
R. Kiran Kumar ◽  
B. Saichandana ◽  
K. Srinivas
Keyword(s):  
Genetic Algorithm ◽  
Dimensionality Reduction ◽  
Hyperspectral Image ◽  
Image Data ◽  
Unsupervised Classification ◽  
Hyperspectral Data ◽  
Band Selection ◽  
Data Set ◽  
Mode Decomposition ◽  
Fused Image

<p>This paper presents genetic algorithm based band selection and classification on hyperspectral image data set. Hyperspectral remote sensors collect image data for a large number of narrow, adjacent spectral bands. Every pixel in hyperspectral image involves a continuous spectrum that is used to classify the objects with great detail and precision. In this paper, first filtering based on 2-D Empirical mode decomposition method is used to remove any noisy components in each band of the hyperspectral data. After filtering, band selection is done using genetic algorithm in-order to remove bands that convey less information. This dimensionality reduction minimizes many requirements such as storage space, computational load, communication bandwidth etc which is imposed on the unsupervised classification algorithms. Next image fusion is performed on the selected hyperspectral bands to selectively merge the maximum possible features from the selected images to form a single image. This fused image is classified using genetic algorithm. Three different indices, such as K-means Index (KMI) and Jm measure are used as objective functions. This method increases classification accuracy and performance of hyperspectral image than without dimensionality reduction.</p>

Evaluating the Potential of Clonal Selection Optimization Algorithm to Hyperspectral Image Feature Selection

2012 ◽  
Vol 500 ◽  
pp. 799-805 ◽  
Author(s):  
Farhad Samadzadegan ◽  
Shahin Rahmatollahi Namin ◽  
Mohammad Ali Rajabi
Keyword(s):  
Feature Selection ◽  
Optimization Algorithm ◽  
Hyperspectral Image ◽  
Clonal Selection ◽  
Fitness Function ◽  
Hyperspectral Images ◽  
Image Feature ◽  
Spectral Bands ◽  
Selection Algorithms ◽  
Selection Of

The great number of captured near spectral bands in hyperspectral images causes the curse of dimensionality problem and results in low classification accuracy. The feature selection algorithms try to overcome this problem by limiting the input space dimensions of classification for hyperspectral images. In this paper, immune clonal selection optimization algorithm is used for feature selection. Also one of the fastest Artificial Immune classification algorithms is used to compute fitness function of the feature selection. The comparison of the feature selection results with genetic algorithm shows the clonal selection’s higher performance to solve selection of features.

Feature Selection Algorithm for Hyperlipidemia Classification

2014 ◽  
Vol 701-702 ◽  
pp. 110-113
Author(s):  
Qi Rui Zhang ◽  
He Xian Wang ◽  
Jiang Wei Qin
Keyword(s):  
Feature Selection ◽  
Nearest Neighbor ◽  
Information Gain ◽  
Classification Systems ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Data Set ◽  
Document Frequency ◽  
Selection Algorithms ◽  
Term Weights

This paper reports a comparative study of feature selection algorithms on a hyperlipimedia data set. Three methods of feature selection were evaluated, including document frequency (DF), information gain (IG) and aχ2 statistic (CHI). The classification systems use a vector to represent a document and use tfidfie (term frequency, inverted document frequency, and inverted entropy) to compute term weights. In order to compare the effectives of feature selection, we used three classification methods: Naïve Bayes (NB), k Nearest Neighbor (kNN) and Support Vector Machines (SVM). The experimental results show that IG and CHI outperform significantly DF, and SVM and NB is more effective than KNN when macro-averagingF1 measure is used. DF is suitable for the task of large text classification.

scholarly journals CLASSIFICATION OF HYPERSPECTRAL DATA BASED ON GUIDED FILTERING AND RANDOM FOREST

2017 ◽  
Vol XLII-2/W7 ◽  
pp. 821-824
Author(s):  
H. Ma ◽  
W. Feng ◽  
X. Cao ◽  
L. Wang
Keyword(s):  
Random Forest ◽  
Infrared Imaging ◽  
Image Filtering ◽  
Hyperspectral Data ◽  
Spectral Information ◽  
Data Set ◽  
Imaging Spectrometer ◽  
Guided Image Filter ◽  
Spectral Bands ◽  
Guided Image Filtering

Hyperspectral images usually consist of more than one hundred spectral bands, which have potentials to provide rich spatial and spectral information. However, the application of hyperspectral data is still challengeable due to “the curse of dimensionality”. In this context, many techniques, which aim to make full use of both the spatial and spectral information, are investigated. In order to preserve the geometrical information, meanwhile, with less spectral bands, we propose a novel method, which combines principal components analysis (PCA), guided image filtering and the random forest classifier (RF). In detail, PCA is firstly employed to reduce the dimension of spectral bands. Secondly, the guided image filtering technique is introduced to smooth land object, meanwhile preserving the edge of objects. Finally, the features are fed into RF classifier. To illustrate the effectiveness of the method, we carry out experiments over the popular Indian Pines data set, which is collected by Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) sensor. By comparing the proposed method with the method of only using PCA or guided image filter, we find that effect of the proposed method is better.

scholarly journals OPTIMIZATION OF ATTRIBUTE SELECTION MODEL USING BIO-INSPIRED ALGORITHMS

2018 ◽  
Author(s):  
Mohammad Aizat Basir ◽  
Yuhanis Yusof ◽  
Mohamed Saifullah Hussin
Keyword(s):  
Feature Selection ◽  
Search Algorithm ◽  
Classification Performance ◽  
Selection Model ◽  
Attribute Selection ◽  
Data Set ◽  
Good Classification ◽  
Two Stages ◽  
Mining Model ◽  
Selection Algorithms

Attribute selection which is also known as feature selection is an essential process that is relevant to predictive analysis. To date, various feature selection algorithms have been introduced, nevertheless they all work independently. Hence, reducing the consistency of the accuracy rate. The aim of this paper is to investigate the use of bio-inspired search algorithms in producing optimal attribute set. This is achieved in two stages; 1) create attribute selection models by combining search method and feature selection algorithms, and 2) determine an optimized attribute set by employing bio-inspired algorithms. Classification performance of the produced attribute set is analyzed based on accuracy and number of selected attributes. Experimental results conducted on six (6) public real datasets reveal that the feature selection model with the implementation of bio-inspired search algorithm consistently performs good classification (i.e higher accuracy with fewer numbers of attributes) on the selected data set. Such a finding indicates that bio-inspired algorithms can contribute in identifying the few most important features to be used in data mining model construction.  

scholarly journals EBARec-BS: Effective Band Attention Reconstruction Network for Hyperspectral Imagery Band Selection

2021 ◽  
Vol 13 (18) ◽  
pp. 3602
Author(s):  
Yufei Liu ◽  
Xiaorun Li ◽  
Ziqiang Hua ◽  
Liaoying Zhao
Keyword(s):  
Hyperspectral Image ◽  
Effective Means ◽  
Scoring Function ◽  
Hyperspectral Data ◽  
Band Selection ◽  
Data Sets ◽  
Hyperspectral Image Processing ◽  
Spectral Bands ◽  
Adaptive Weight ◽  
Robust To Noise

Hyperspectral band selection (BS) is an effective means to avoid the Hughes phenomenon and heavy computational burden in hyperspectral image processing. However, most of the existing BS methods fail to fully consider the interaction between spectral bands and cannot comprehensively consider the representativeness and redundancy of the selected band subset. To solve these problems, we propose an unsupervised effective band attention reconstruction framework for band selection (EBARec-BS) in this article. The framework utilizes the EBARec network to learn the representativeness of each band to the original band set and measures the redundancy between the bands by calculating the distance of each unselected band to the selected band subset. Subsequently, by designing an adaptive weight to balance the influence of the representativeness metric and redundancy metric on the band evaluation, a final band scoring function is obtained to select a band subset that well represents the original hyperspectral image and has low redundancy. Experiments on three well-known hyperspectral data sets indicate that compared with the existing BS methods, the proposed EBARec-BS is robust to noise bands and can effectively select the band subset with higher classification accuracy and less redundant information.

Feature selection for cross-scene hyperspectral image classification using cross-domain ReliefF

2019 ◽  
Vol 17 (05) ◽  
pp. 1950039 ◽  
Author(s):  
Minchao Ye ◽  
Yongqiu Xu ◽  
Chenxi Ji ◽  
Hong Chen ◽  
Huijuan Lu ◽  
...  
Keyword(s):  
Feature Selection ◽  
Hyperspectral Image ◽  
Classification Problem ◽  
Spectral Shift ◽  
Simple Problem ◽  
Spectral Bands ◽  
Cross Domain ◽  
Two Factors ◽  
Single Dataset ◽  
Selection Algorithms

Hyperspectral images (HSIs) have hundreds of narrow and adjacent spectral bands, which will result in feature redundancy, decreasing the classification accuracy. Feature (band) selection helps to remove the noisy or redundant features. Most traditional feature selection algorithms can be only performed on a single HSI scene. However, appearance of massive HSIs has placed a need for joint feature selection across different HSI scenes. Cross-scene feature selection is not a simple problem, since spectral shift exists between different HSI scenes, even though the scenes are captured by the same sensor. The spectral shift makes traditional single-dataset-based feature selection algorithms no longer applicable. To solve this problem, we extend the traditional ReliefF to a cross-domain version, namely, cross-domain ReliefF (CDRF). The proposed method can make full use of both source and target domains and increase the similarity of samples belonging to the same class in both domains. In the cross-scene classification problem, it is necessary to consider the class-separability of spectral features and the consistency of features between different scenes. The CDRF takes into account these two factors using a cross-domain updating rule of the feature weights. Experimental results on two cross-scene HSI datasets show the superiority of the proposed CDRF in cross-scene feature selection problems.

scholarly journals A survey of band selection techniques for hyperspectral image classification

2020 ◽  
Author(s):  
Shrutika Sawant ◽  
Manoharan Prabukumar
Keyword(s):  
Image Classification ◽  
Hyperspectral Image ◽  
Hyperspectral Data ◽  
Band Selection ◽  
Hyperspectral Image Classification ◽  
Spectral Bands ◽  
Time Operation ◽  
Ground Object ◽  
Comprehensive Survey ◽  
Highly Correlated

Hyperspectral images usually contain hundreds of contiguous spectral bands, which can precisely discriminate the various spectrally similar classes. However, such high-dimensional data also contain highly correlated and irrelevant information, leading to the curse of dimensionality (also called the Hughes phenomenon). It is necessary to reduce these bands before further analysis, such as land cover classification and target detection. Band selection is an effective way to reduce the size of hyperspectral data and to overcome the curse of the dimensionality problem in ground object classification. Focusing on the classification task, this article provides an extensive and comprehensive survey on band selection techniques describing the categorisation of methods, methodology used, different searching approaches and various technical difficulties, as well as their performances. Our purpose is to highlight the progress attained in band selection techniques for hyperspectral image classification and to identify possible avenues for future work, in order to achieve better performance in real-time operation.

Sign in / Sign up

Export Citation Format

Share Document