Robust patch-based sparse representation for hyperspectral image classification

2017 ◽  
Vol 15 (03) ◽  
pp. 1750028 ◽  
Author(s):  
Haoliang Yuan
Keyword(s):  
Sparse Representation ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Real Life ◽  
Test Sample ◽  
Classification Performance ◽  
Iteration Algorithm ◽  
Frobenius Norm ◽  
Training Samples ◽  
Sparse Representation Classification

Sparse representation classification (SRC) has been successfully applied into hyperspectral image (HSI). A test sample (pixel) can be linearly represented by a few training samples of the training set. The class label of the test sample is then decided by the reconstruction residuals. To incorporate the spatial information to improve the classification performance, a patch matrix, which includes a spatial neighborhood set, is used to replace the original pixel. Generally, the objective function of the reconstruction residuals is represented as Frobenius-norm, which actually treats the elements in the reconstruction residuals in the same way. However, when a patch locates in the image edge, the samples in the patch may belong to different classes. Frobenius-norm is not suitable to compute the reconstruction residuals. In this paper, we propose a robust patch-based sparse representation classification (RPSRC) based on [Formula: see text]-norm. An iteration algorithm is given to compute RPSRC efficiently. Extensive experimental results on two real-life HSI datasets demonstrate the effectiveness of RPSRC.

Integrating Sparse and Collaborative Representation Classifications for Image Classification

2017 ◽  
Vol 17 (02) ◽  
pp. 1750007 ◽  
Author(s):  
Chunwei Tian ◽  
Guanglu Sun ◽  
Qi Zhang ◽  
Weibing Wang ◽  
Teng Chen ◽  
...  
Keyword(s):  
Sparse Representation ◽  
Image Classification ◽  
Linear Combination ◽  
Image Recognition ◽  
Test Sample ◽  
Collaborative Representation ◽  
Training Samples ◽  
Sparse Representation Classification ◽  
The Difference ◽  
Representation Method

Collaborative representation classification (CRC) is an important sparse method, which is easy to carry out and uses a linear combination of training samples to represent a test sample. CRC method utilizes the offset between representation result of each class and the test sample to implement classification. However, the offset usually cannot well express the difference between every class and the test sample. In this paper, we propose a novel representation method for image recognition to address the above problem. This method not only fuses sparse representation and CRC method to improve the accuracy of image recognition, but also has novel fusion mechanism to classify images. The implementations of the proposed method have the following steps. First of all, it produces collaborative representation of the test sample. That is, a linear combination of all the training samples is first determined to represent the test sample. Then, it gets the sparse representation classification (SRC) of the test sample. Finally, the proposed method respectively uses CRC and SRC representations to obtain two kinds of scores of the test sample and fuses them to recognize the image. The experiments of face recognition show that the combination of CRC and SRC has satisfactory performance for image classification.

Nonnegative Sparse Probabilistic Estimation for Single Sample Face Recognition

2020 ◽  
Vol 34 (12) ◽  
pp. 2056008
Author(s):  
Shuhuan Zhao
Keyword(s):  
Face Recognition ◽  
Sparse Representation ◽  
Real Life ◽  
Test Sample ◽  
Single Sample ◽  
Collaborative Representation ◽  
Adaptive Variation ◽  
Training Set ◽  
Probabilistic Estimation ◽  
Training Samples

Face recognition (FR) is a hotspot in pattern recognition and image processing for its wide applications in real life. One of the most challenging problems in FR is single sample face recognition (SSFR). In this paper, we proposed a novel algorithm based on nonnegative sparse representation, collaborative presentation, and probabilistic graph estimation to address SSFR. The proposed algorithm is named as Nonnegative Sparse Probabilistic Estimation (NNSPE). To extract the variation information from the generic training set, we first select some neighbor samples from the generic training set for each sample in the gallery set and the generic training set can be partitioned into some reference subsets. To make more meaningful reconstruction, the proposed method adopts nonnegative sparse representation to reconstruct training samples, and according to the reconstruction coefficients, NNSPE computes the probabilistic label estimation for the samples of the generic training set. Then, for a given test sample, collaborative representation (CR) is used to acquire an adaptive variation subset. Finally, the NNSPE classifies the test sample with the adaptive variation subset and probabilistic label estimation. The experiments on the AR and PIE verify the effectiveness of the proposed method both in recognition rates and time cost.

scholarly journals Sparse Representation Based SAR Vehicle Recognition along with Aspect Angle

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Xiangwei Xing ◽  
Kefeng Ji ◽  
Huanxin Zou ◽  
Jixiang Sun
Keyword(s):  
Sparse Representation ◽  
Test Sample ◽  
Automatic Target Recognition ◽  
Reconstruction Error ◽  
Stationary Target ◽  
Vehicle Recognition ◽  
Aspect Angle ◽  
Training Samples ◽  
Coefficient Vector ◽  
Sparse Representation Classification

As a method of representing the test sample with few training samples from an overcomplete dictionary, sparse representation classification (SRC) has attracted much attention in synthetic aperture radar (SAR) automatic target recognition (ATR) recently. In this paper, we develop a novel SAR vehicle recognition method based on sparse representation classification along with aspect information (SRCA), in which the correlation between the vehicle’s aspect angle and the sparse representation vector is exploited. The detailed procedure presented in this paper can be summarized as follows. Initially, the sparse representation vector of a test sample is solved by sparse representation algorithm with a principle component analysis (PCA) feature-based dictionary. Then, the coefficient vector is projected onto a sparser one within a certain range of the vehicle’s aspect angle. Finally, the vehicle is classified into a certain category that minimizes the reconstruction error with the novel sparse representation vector. Extensive experiments are conducted on the moving and stationary target acquisition and recognition (MSTAR) dataset and the results demonstrate that the proposed method performs robustly under the variations of depression angle and target configurations, as well as incomplete observation.

An efficient superpixel-based sparse representation framework for hyperspectral image classification

2017 ◽  
Vol 15 (06) ◽  
pp. 1750061 ◽  
Author(s):  
Sen Jia ◽  
Bin Deng ◽  
Qiang Huang
Keyword(s):  
Sparse Representation ◽  
Visual Recognition ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Spectral Characteristics ◽  
Small Region ◽  
Data Sets ◽  
Training Samples ◽  
The Rich ◽  
Highly Correlated

As a powerful classifier, sparse representation-based classification (SRC) has successfully been applied in various visual recognition problems. However, due to the highly correlated bands and insufficient training samples of hyperspectral image (HSI) data, it still remains a challenging problem to effectively apply SRC in HSI. Considering the rich information of spatial structure of materials in HSI, that means the adjacent pixels belong to the same class with a high probability, in this paper, we propose an efficient superpixel-based sparse representation framework for HSI classification. Each superpixel can be regarded as a small region consisting of a number of pixels with similar spectral characteristics. The proposed framework utilizes superpixel to exploit spatial information which can greatly improve classification accuracy. Specifically, SRC is firstly used to classify the HSI data. Meanwhile, an efficient segmentation algorithm is applied to divide the HSI into many disjoint superpixels. Then, each superpixel is used to fuse the SRC classification results in superpixel level. Experimental results on two real-world HSI data sets have shown that the proposed superpixel-based SRC (SP-SRC) framework has a significant improvement over the pixel-based SRC method.

scholarly journals Sparse Representation Graph for Hyperspectral Image Classification Assisted by Class Adjusted Spatial Distance

2020 ◽  
Vol 10 (21) ◽  
pp. 7740
Author(s):  
Wanghao Xu ◽  
Siqi Luo ◽  
Yunfei Wang ◽  
Youqiang Zhang ◽  
Guo Cao
Keyword(s):  
Sparse Representation ◽  
Image Classification ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Spatial Distance ◽  
Spectral Information ◽  
Hyperspectral Image Classification ◽  
Distance Information ◽  
Training Samples ◽  
Two Samples

In the past few years, the sparse representation (SR) graph-based semi-supervised learning (SSL) has drawn a lot of attention for its impressive performance in hyperspectral image classification with small numbers of training samples. Among these methods, the probabilistic class structure regularized sparse representation (PCSSR) approach, which introduces the probabilistic relationship between samples into the SR process, has shown its superiority over state-of-the-art approaches. However, this category of classification methods only apply another SR process to generate the probabilistic relationship, which focuses only on the spectral information but fails to utilize the spatial information. In this paper, we propose using the class adjusted spatial distance (CASD) to measure the distance between each two samples. We incorporate the proposed a CASD-based distance information into PCSSR mode to further increase the discriminability of original PCSSR approach. The proposed method considers not only the spectral information but also the spatial information of the hyperspectral data, consequently leading to significant performance improvement. Experimental results on different datasets demonstrate that compared with state-of-the-start classification models, the proposed method achieves the highest overall accuracies of 99.71%, 97.13%, and 97.07% on Botswana (BOT), Kennedy Space Center (KSC) and the truncated Indian Pines (PINE) datasets, respectively, with a small number of training samples selected from each class.

scholarly journals A DIVERSIFIED DEEP BELIEF NETWORK FOR HYPERSPECTRAL IMAGE CLASSIFICATION

2016 ◽  
Vol XLI-B7 ◽  
pp. 443-449
Author(s):  
P. Zhong ◽  
Z. Q. Gong ◽  
C. Schönlieb
Keyword(s):  
Image Classification ◽  
Real World ◽  
Hyperspectral Image ◽  
Classification Performance ◽  
Fine Tuning ◽  
Hyperspectral Image Classification ◽  
Latent Factors ◽  
Deep Model ◽  
Training Samples ◽  
Limited Training Samples

In recent years, researches in remote sensing demonstrated that deep architectures with multiple layers can potentially extract abstract and invariant features for better hyperspectral image classification. Since the usual real-world hyperspectral image classification task cannot provide enough training samples for a supervised deep model, such as convolutional neural networks (CNNs), this work turns to investigate the deep belief networks (DBNs), which allow unsupervised training. The DBN trained over limited training samples usually has many “dead” (never responding) or “potential over-tolerant” (always responding) latent factors (neurons), which decrease the DBN’s description ability and thus finally decrease the hyperspectral image classification performance. This work proposes a new diversified DBN through introducing a diversity promoting prior over the latent factors during the DBN pre-training and fine-tuning procedures. The diversity promoting prior in the training procedures will encourage the latent factors to be uncorrelated, such that each latent factor focuses on modelling unique information, and all factors will be summed up to capture a large proportion of information and thus increase description ability and classification performance of the diversified DBNs. The proposed method was evaluated over the well-known real-world hyperspectral image dataset. The experiments demonstrate that the diversified DBNs can obtain much better results than original DBNs and comparable or even better performances compared with other recent hyperspectral image classification methods.

scholarly journals A new data classification improvement approach based on kernel clustering

2021 ◽  
Vol 2082 (1) ◽  
pp. 012021
Author(s):  
Bingsen Guo
Keyword(s):  
High Performance ◽  
Real Life ◽  
Data Classification ◽  
Classification Performance ◽  
Training Set ◽  
Kernel Clustering ◽  
Training Samples ◽  
Critical Issues ◽  
Extensive Performance ◽  
Query Sample

Abstract Data classification is one of the most critical issues in data mining with a large number of real-life applications. In many practical classification issues, there are various forms of anomalies in the real dataset. For example, the training set contains outliers, often enough to confuse the classifier and reduce its ability to learn from the data. In this paper, we propose a new data classification improvement approach based on kernel clustering. The proposed method can improve the classification performance by optimizing the training set. We first use the existing kernel clustering method to cluster the training set and optimize it based on the similarity between the training samples in each class and the corresponding class center. Then, the optimized reliable training set is trained to the standard classifier in the kernel space to classify each query sample. Extensive performance analysis shows that the proposed method achieves high performance, thus improving the classifier’s effectiveness.

scholarly journals Kernel Joint Sparse Representation Based on Self-Paced Learning for Hyperspectral Image Classification

2019 ◽  
Vol 11 (9) ◽  
pp. 1114
Author(s):  
Sixiu Hu ◽  
Jiangtao Peng ◽  
Yingxiong Fu ◽  
Luoqing Li
Keyword(s):  
Sparse Representation ◽  
Hyperspectral Image ◽  
Feature Space ◽  
Classification Performance ◽  
Hyperspectral Data ◽  
Data Sets ◽  
Neighborhood Structure ◽  
Joint Sparse Representation ◽  
Negative Effect ◽  
Sparse Coefficient

By means of joint sparse representation (JSR) and kernel representation, kernel joint sparse representation (KJSR) models can effectively model the intrinsic nonlinear relations of hyperspectral data and better exploit spatial neighborhood structure to improve the classification performance of hyperspectral images. However, due to the presence of noisy or inhomogeneous pixels around the central testing pixel in the spatial domain, the performance of KJSR is greatly affected. Motivated by the idea of self-paced learning (SPL), this paper proposes a self-paced KJSR (SPKJSR) model to adaptively learn weights and sparse coefficient vectors for different neighboring pixels in the kernel-based feature space. SPL strateges can learn a weight to indicate the difficulty of feature pixels within a spatial neighborhood. By assigning small weights for unimportant or complex pixels, the negative effect of inhomogeneous or noisy neighboring pixels can be suppressed. Hence, SPKJSR is usually much more robust. Experimental results on Indian Pines and Salinas hyperspectral data sets demonstrate that SPKJSR is much more effective than traditional JSR and KJSR models.

scholarly journals A Sparse Representation-Based Sample Pseudo-Labeling Method for Hyperspectral Image Classification

2020 ◽  
Vol 12 (4) ◽  
pp. 664 ◽  
Author(s):  
Binge Cui ◽  
Jiandi Cui ◽  
Yan Lu ◽  
Nannan Guo ◽  
Maoguo Gong
Keyword(s):  
Sparse Representation ◽  
Image Classification ◽  
Information Entropy ◽  
Hyperspectral Image ◽  
Hyperspectral Data ◽  
Hyperspectral Images ◽  
Hyperspectral Image Classification ◽  
Training Set ◽  
Training Samples ◽  
Labeling Method

Hyperspectral image classification methods may not achieve good performance when a limited number of training samples are provided. However, labeling sufficient samples of hyperspectral images to achieve adequate training is quite expensive and difficult. In this paper, we propose a novel sample pseudo-labeling method based on sparse representation (SRSPL) for hyperspectral image classification, in which sparse representation is used to select the purest samples to extend the training set. The proposed method consists of the following three steps. First, intrinsic image decomposition is used to obtain the reflectance components of hyperspectral images. Second, hyperspectral pixels are sparsely represented using an overcomplete dictionary composed of all training samples. Finally, information entropy is defined for the vectorized sparse representation, and then the pixels with low information entropy are selected as pseudo-labeled samples to augment the training set. The quality of the generated pseudo-labeled samples is evaluated based on classification accuracy, i.e., overall accuracy, average accuracy, and Kappa coefficient. Experimental results on four real hyperspectral data sets demonstrate excellent classification performance using the new added pseudo-labeled samples, which indicates that the generated samples are of high confidence.

scholarly journals Integrating the Symmetry Image and Improved Sparse Representation for Railway Fastener Classification and Defect Recognition

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Jiajia Liu ◽  
Bailin Li ◽  
Ying Xiong ◽  
Biao He ◽  
Li Li
Keyword(s):  
Sparse Representation ◽  
State Of The Art ◽  
Identification Problem ◽  
Test Sample ◽  
Computationally Efficient ◽  
Railway Traffic ◽  
Training Samples ◽  
Inspection Systems ◽  
Representation Method ◽  
Defect Recognition

The detection of fastener defects is an important task for ensuring the safety of railway traffic. The earlier automatic inspection systems based on computer vision can detect effectively the completely missing fasteners, but they have weaker ability to recognize the partially worn ones. In this paper, we propose a method for detecting both partly worn and completely missing fasteners, the proposed algorithm exploits the first and second symmetry sample of original testing fastener image and integrates them for improved representation-based fastener recognition. This scheme is simple and computationally efficient. The underlying rationales of the scheme are as follows: First, the new virtual symmetrical images really reflect some possible appearance of the fastener; then the integration of two judgments of the symmetrical sample for fastener recognition can somewhat overcome the misclassification problem. Second, the improved sparse representation method discarding the training samples that are “far” from the test sample and uses a small number of samples that are “near” to the test sample to represent the test sample, so as to perform classification and it is able to reduce the side-effect of the error identification problem of the original fastener image. The experimental results show that the proposed method outperforms state-of-the-art fastener recognition methods.

Sign in / Sign up

Export Citation Format

Share Document