2015
DOI: 10.1007/s00530-015-0450-0
|View full text |Cite
|
Sign up to set email alerts
|

Spectral–spatial co-clustering of hyperspectral image data based on bipartite graph

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
8
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(8 citation statements)
references
References 38 publications
0
8
0
Order By: Relevance
“…In the future work, more advanced features, such as deep learning-based features, can be considered to improve the performance further [32,33]. Besides, the spectral and spatial information can be fused to obtain more powerful features [34,35]. …”
Section: Resultsmentioning
confidence: 99%
“…In the future work, more advanced features, such as deep learning-based features, can be considered to improve the performance further [32,33]. Besides, the spectral and spatial information can be fused to obtain more powerful features [34,35]. …”
Section: Resultsmentioning
confidence: 99%
“…Thus, in this paper, we mainly focused on the clustering approach for HSI partitioning. Generally speaking, clustering techniques can be mainly categorized into nine main types [5]: centroid-based clustering [6][7][8], density-based clustering [9][10][11], probability-based clustering [12][13][14][15], bionics-based clustering [16,17], intelligent computingbased clustering [18,19], graph-based clustering [20,21], subspace clustering [22][23][24][25], deep learning-based clustering [26][27][28], and hybrid mechanism-based clustering [29,30]. Affinity propagation (AP) [31] is a centroid-based clustering method that identifies a set of data points that best represent the dataset and assigns each data point to a single exemplar.…”
Section: Introductionmentioning
confidence: 99%
“…The traditional spectral clustering algorithm, however, focuses on clustering accuracy whereas ignores the underlying computational complexity and memory requirements for constructing the similarity matrix and computing eigenvectors. Therefore, it is difficult to be directly applied to large‐scale data, such as hyperspectral remote sensing image classification [10, 11]. Meanwhile, anchor graph provides a better solution.…”
Section: Introductionmentioning
confidence: 99%
“…ficult to be directly applied to large-scale data, such as hyperspectral remote sensing image classification [10,11]. Meanwhile, anchor graph provides a better solution.…”
mentioning
confidence: 99%