Spatial-Spectral Clustering With Anchor Graph for Hyperspectral Image

@article{Wang2021SpatialSpectralCW,
  title={Spatial-Spectral Clustering With Anchor Graph for Hyperspectral Image},
  author={Qi Wang and Yanling Miao and Mulin Chen and Yuan Yuan},
  journal={IEEE Transactions on Geoscience and Remote Sensing},
  year={2021},
  volume={60},
  pages={1-13}
}
Hyperspectral image (HSI) clustering, which aims at dividing hyperspectral pixels into clusters without labeled training data, has drawn significant attention in practical applications. Recently, many graph-based clustering methods, which construct an adjacent graph to model the data relationship, have shown dominant performance. However, the high dimensionality of HSI data makes it hard to construct the pairwise adjacent graph. Besides, abundant spatial structures are often overlooked during… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 54 REFERENCES

Fast Spectral Clustering With Anchor Graph for Large Hyperspectral Images

This letter considers the spectral and spatial properties of HSI in the anchor graph construction and proposes a novel approach, called fast spectral clustering with anchor graph (FSCAG), to efficiently deal with the large-scale HSI clustering problem.

Dimensionality Reduction of Hyperspectral Image Using Spatial Regularized Local Graph Discriminant Embedding

  • Renlong HangQingshan Liu
  • Mathematics
    IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
  • 2018
The obtained results show that the proposed regularization method can achieve higher classification performance than many state-of-the-art graph embedding models, and the kernel extension model can further improve the classification performance.

Dimensionality Reduction of Hyperspectral Imagery Based on Spatial–Spectral Manifold Learning

An unsupervised dimensionality reduction algorithm called spatial–spectral manifold reconstruction preserving embedding (SSMRPE) for HSI classification can extract the discriminant features and subsequently improve the classification performance of HSI.

Spectral–Spatial Sparse Subspace Clustering for Hyperspectral Remote Sensing Images

A novel spectral-spatial sparse subspace clustering S4C algorithm for hyperspectral remote sensing images is proposed by treating each kind of land-cover class as a subspace and considering the spectral and spatial properties of HSIs.

Hyperspectral image feature selection for the fuzzy c-means spatial and spectral clustering

A new version of the fuzzy c-means clustering algorithm is proposed; this version includes spatial and spectral features and shows an improvement on the accuracy over conventional clustering methods.

Locality Adaptive Discriminant Analysis for Spectral–Spatial Classification of Hyperspectral Images

A novel dimensionality reduction algorithm, locality adaptive discriminant analysis (LADA) for HSI classification that aims to learn a representative subspace of data, and focuses on the data points with close relationship in spectral and spatial domains.

Locality and Structure Regularized Low Rank Representation for Hyperspectral Image Classification

A novel locality- and structure-regularized LRR (LSLRR) model is proposed for HSI classification and a new distance metric is introduced, which combines both spatial and spectral features, to explore the local similarity of pixels.

Hyperspectral Image Clustering: Current achievements and future lines

Hyperspectral remote sensing organically combines traditional space imaging with advanced spectral measurement technologies, delivering advantages stemming from continuous spectrum data and rich

A Fast Neighborhood Grouping Method for Hyperspectral Band Selection

This work proposes a fast neighborhood grouping method for hyperspectral band selection (FNGBS), which can obtain the most relevant and informative bands simultaneously as subset in accordance with two factors, such as local density and information entropy.

Subspace Clustering for Hyperspectral Images via Dictionary Learning With Adaptive Regularization

This article proposes a scalable subspace clustering method, which integrates the learning of a concise dictionary and robust subspace representation in a unified model and derives an effective solver based on alternating minimization and alternating direction method of multipliers (ADMMs) to solve the resulting optimization problem.
...