scholarly journals Superpixel-Based Minimum Noise Fraction Feature Extraction for Classification of Hyperspectral Images

2020 ◽  
Vol 37 (5) ◽  
pp. 812-822
Author(s):  
Behnam Asghari Beirami ◽  
Mehdi Mokhtarzade
Keyword(s):  
Feature Extraction ◽  
Extraction Methods ◽  
Hyperspectral Images ◽  
Support Vector ◽  
Minimum Noise Fraction ◽  
Vector Machines ◽  
Noise Covariance ◽  
Noise Fraction ◽  
Minimum Noise

In this paper, a novel feature extraction technique called SuperMNF is proposed, which is an extension of the minimum noise fraction (MNF) transformation. In SuperMNF, each superpixel has its own transformation matrix and MNF transformation is performed on each superpixel individually. The basic idea behind the SuperMNF is that each superpixel contains its specific signal and noise covariance matrices which are different from the adjacent superpixels. The extracted features, owning spatial-spectral content and provided in the lower dimension, are classified by maximum likelihood classifier and support vector machines. Experiments that are conducted on two real hyperspectral images, named Indian Pines and Pavia University, demonstrate the efficiency of SuperMNF since it yielded more promising results than some other feature extraction methods (MNF, PCA, SuperPCA, KPCA, and MMP).

scholarly journals Analyzing the Effectiveness of the Brain–Computer Interface for Task Discerning Based on Machine Learning

Sensors ◽  
2020 ◽  
Vol 20 (8) ◽  
pp. 2403
Author(s):  
Jakub Browarczyk ◽  
Adam Kurowski ◽  
Bozena Kostek
Keyword(s):  
Feature Extraction ◽  
Principal Component ◽  
Component Analysis ◽  
Mental States ◽  
Extraction Methods ◽  
Support Vector ◽  
Discrete Wavelet ◽  
K Nearest Neighbors ◽  
Vector Machines

The aim of the study is to compare electroencephalographic (EEG) signal feature extraction methods in the context of the effectiveness of the classification of brain activities. For classification, electroencephalographic signals were obtained using an EEG device from 17 subjects in three mental states (relaxation, excitation, and solving logical task). Blind source separation employing independent component analysis (ICA) was performed on obtained signals. Welch’s method, autoregressive modeling, and discrete wavelet transform were used for feature extraction. Principal component analysis (PCA) was performed in order to reduce the dimensionality of feature vectors. k-Nearest Neighbors (kNN), Support Vector Machines (SVM), and Neural Networks (NN) were employed for classification. Precision, recall, F1 score, as well as a discussion based on statistical analysis, were shown. The paper also contains code utilized in preprocessing and the main part of experiments.

scholarly journals Feature extraction from terahertz pulses for classification of RNA data via support vector machines

2006 ◽  
Author(s):  
Xiaoxia Yin ◽  
Brian W.-H. Ng ◽  
Bernd Fischer ◽  
Bradley Ferguson ◽  
Samuel P. Mickan ◽  
...  
Keyword(s):  
Feature Extraction ◽  
Support Vector Machines ◽  
Support Vector ◽  
Terahertz Pulses ◽  
Vector Machines

scholarly journals A COMPARISON STUDY OF DIFFERENT MARKER SELECTION METHODS FOR SPECTRAL-SPATIAL CLASSIFICATION OF HYPERSPECTRAL IMAGES

2015 ◽  
Vol XL-1-W5 ◽  
pp. 37-41 ◽  
Author(s):  
D. Akbari ◽  
A. R. Safari ◽  
S. Homayouni ◽  
S. Khazai
Keyword(s):  
Spatial Information ◽  
Selection Process ◽  
Hyperspectral Images ◽  
Support Vector ◽  
Washington Dc ◽  
Spatial Classification ◽  
Marker Selection ◽  
Vector Machines ◽  
Segmentation Algorithms

An effective approach based on the Minimum Spanning Forest (MSF), grown from automatically selected markers using Support Vector Machines (SVM), has been proposed for spectral-spatial classification of hyperspectral images by Tarabalka et al. This paper aims at improving this approach by using image segmentation to integrate the spatial information into marker selection process. In this study, the markers are extracted from the classification maps, obtained by both SVM and segmentation algorithms, and then are used to build the MSF. The segmentation algorithms are the watershed, expectation maximization (EM) and hierarchical clustering. These algorithms are used in parallel and independently to segment the image. Moreover, the pixels of each class, with the largest population in the classification map, are kept for each region of the segmentation map. Lastly, the most reliable classified pixels are chosen from among the exiting pixels as markers. Two benchmark urban hyperspectral datasets are used for evaluation: Washington DC Mall and Berlin. The results of our experiments indicate that, compared to the original MSF approach, the marker selection using segmentation algorithms leads in more accurate classification maps.

scholarly journals UNLABELED SELECTED SAMPLES IN FEATURE EXTRACTION FOR CLASSIFICATION OF HYPERSPECTRAL IMAGES WITH LIMITED TRAINING SAMPLES

2015 ◽  
Vol XL-1-W5 ◽  
pp. 411-416
Author(s):  
A. Kianisarkaleh ◽  
H. Ghassemian ◽  
F. Razzazi
Keyword(s):  
Feature Extraction ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Sample Selection ◽  
Extraction Methods ◽  
Hyperspectral Images ◽  
Training Samples ◽  
Samples Selection ◽  
Limited Training Samples

Feature extraction plays a key role in hyperspectral images classification. Using unlabeled samples, often unlimitedly available, unsupervised and semisupervised feature extraction methods show better performance when limited number of training samples exists. This paper illustrates the importance of selecting appropriate unlabeled samples that used in feature extraction methods. Also proposes a new method for unlabeled samples selection using spectral and spatial information. The proposed method has four parts including: PCA, prior classification, posterior classification and sample selection. As hyperspectral image passes these parts, selected unlabeled samples can be used in arbitrary feature extraction methods. The effectiveness of the proposed unlabeled selected samples in unsupervised and semisupervised feature extraction is demonstrated using two real hyperspectral datasets. Results show that through selecting appropriate unlabeled samples, the proposed method can improve the performance of feature extraction methods and increase classification accuracy.

FEATURE EXTRACTION AND CLASSIFICATION OF FETAL HEART RATE USING WAVELET ANALYSIS AND SUPPORT VECTOR MACHINES

2006 ◽  
Vol 15 (03) ◽  
pp. 411-432 ◽  
Author(s):  
GEORGE GEORGOULAS ◽  
CHRYSOSTOMOS STYLIOS ◽  
PETER GROUMPOS
Keyword(s):  
Heart Rate ◽  
Feature Extraction ◽  
Support Vector Machines ◽  
Fetal Heart Rate ◽  
Umbilical Artery ◽  
Fetal Heart ◽  
Support Vector ◽  
Ph Values ◽  
Vector Machines

Since the fetus is not available for direct observations, only indirect information can guide the obstetrician in charge. Electronic Fetal Monitoring (EFM) is widely used for assessing fetal well being. EFM involves detection of the Fetal Heart Rate (FHR) signal and the Uterine Activity (UA) signal. The most serious fetal incident is the hypoxic injury leading to cerebral palsy or even death, which is a condition that must be predicted and avoided. This research work proposes a new integrated method for feature extraction and classification of the FHR signal able to associate FHR with umbilical artery pH values at delivery. The proposed method introduces the use of the Discrete Wavelet Transform (DWT) to extract time-scale dependent features of the FHR signal and the use of Support Vector Machines (SVMs) for the categorization. The proposed methodology is tested on a data set of intrapartum recordings were the FHR categories are associated with umbilical artery pH values, This proposed approach achieved high overall classification performance proving its merits.

IMPLEMENTATION OF SUPPORT VECTOR MACHINES FOR CLASSIFICATION OF CLINICAL DATASETS

2010 ◽  
Vol 07 (04) ◽  
pp. 347-356
Author(s):  
E. SIVASANKAR ◽  
R. S. RAJESH
Keyword(s):  
Feature Extraction ◽  
Dimensional Space ◽  
Principal Component ◽  
Kernel Functions ◽  
Support Vector ◽  
Optimal Hyperplane ◽  
Higher Dimensional ◽  
Vector Machines ◽  
Map Data

In this paper, Principal Component Analysis is used for feature extraction, and a statistical learning based Support Vector Machine is designed for functional classification of clinical data. Appendicitis data collected from BHEL Hospital, Trichy is taken and classified under three classes. Feature extraction transforms the data in the high-dimensional space to a space of fewer dimensions. The classification is done by constructing an optimal hyperplane that separates the members from the nonmembers of the class. For linearly nonseparable data, Kernel functions are used to map data to a higher dimensional space and there the optimal hyperplane is found. This paper works with different SVMs based on radial basis and polynomial kernels, and their performances are compared.

Sign in / Sign up

Export Citation Format

Share Document