2016
DOI: 10.1109/lgrs.2016.2536658
|View full text |Cite
|
Sign up to set email alerts
|

Weighted Sparse Graph Based Dimensionality Reduction for Hyperspectral Images

Abstract: Abstract-Dimensionality reduction (DR) is an important and helpful preprocessing step for hyperspectral image (HSI) classification. Recently, sparse graph embedding (SGE) has been widely used in the DR of HSIs. In this letter, we propose a weighted sparse graph based DR (WSGDR) method for HSIs. Instead of only exploring the locality structure (as in neighborhood preserving embedding) or the linearity structure (as in SGE) of the HSI data, the proposed method couples the locality and linearity properties of HSI… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
9
1

Relationship

1
9

Authors

Journals

citations
Cited by 45 publications
(10 citation statements)
references
References 19 publications
0
10
0
Order By: Relevance
“…Unfortunately, the converse is not true: sparsity does not always guarantee locality [56]. He et al [57] proposed a weighted sparse graph to overcome the drawback of sparse coding in SGE, where both the locality and sparsity structure of the training pixels are integrated.…”
Section: B Supervised Drmentioning
confidence: 99%
“…Unfortunately, the converse is not true: sparsity does not always guarantee locality [56]. He et al [57] proposed a weighted sparse graph to overcome the drawback of sparse coding in SGE, where both the locality and sparsity structure of the training pixels are integrated.…”
Section: B Supervised Drmentioning
confidence: 99%
“…Recently, various graph-based algorithms are demonstrated to be effective for solving dimensionality reduction problems in high-dimensional data [26][27][28][29]. How to construct the similarity graph plays a vital role in these algorithms.…”
Section: Similarity Graph In Lpp and Sgdamentioning
confidence: 99%
“…Other related techniques include Discriminative Gaussian Process Latent Variable Model (DGPLVM) [47], Locally Weighted Discriminant Analysis (LWDA) [48], Multi-Feature Manifold Discriminant Analysis (MFMDA) [49], etc. Similarly, the representation based algorithms have also been introduced to supervised DR framework, such as Sparse Graph-based Discriminate Analysis (SGDA) [50], Weighted Sparse Graph-based Discriminate Analysis (WSGDA) [51], Collaborative Graph-based Discriminate Analysis (CGDA) [52], Laplacian regularized CGDA (LapCGDA) [53], Discriminant Analysis with Graph Learning (DAGL) [54], Graph-based Discriminant Analysis with Spectral Similarity (GDA-SS) [55], Local Geometric Structure Fisher Analysis (LGSFA) [56], Sparse and Low-Rank Graph-based Discriminant Analysis (SLGDA) [57], Kernel CGDA (KCGDA) [53], Laplacian Regularized Spatial-aware CGDA (LapSaCGDA) [58], etc. A good survey of these discriminant analysis models can be found in [31].…”
Section: Introductionmentioning
confidence: 99%