Unsupervised Feature Extraction for Reliable Hyperspectral Imagery Clustering via Dual Adaptive Graphs

被引:2
|
作者
Chen, Jinyong [1 ,2 ]
Wu, Qidi [3 ]
Sun, Kang [2 ]
机构
[1] Harbin Engn Univ, Coll Comp Sci & Technol, Harbin 150001, Peoples R China
[2] CETC, Res Inst 54, CETC Key Lab Aerosp Informat Applicat, Shijiazhuang 050081, Hebei, Peoples R China
[3] Harbin Engn Univ, Dept Informat & Commun Engn, Harbin 150001, Peoples R China
关键词
Feature extraction; Reliability; Hyperspectral imaging; Task analysis; Manifolds; Laplace equations; Data models; Hyperspectral imagery; reliable clustering; unsupervised feature extraction; adaptive graph learning; low-rank representation; CLASSIFICATION; REPRESENTATION;
D O I
10.1109/ACCESS.2021.3071425
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Hyperspectral imagery (HSI) clustering aims to assign pixel-wise data with large amount of spectral bands into different groups, where each group indicates one of land-cover objects existed in HSI. Without available label information in clustering task, the clustering performance heavily depends on the reliability of unsupervised feature learned from HSI. Nevertheless,when HSI data are corrupted with noise,the conventional feature learning methods often failed. To address this problem, in this paper, a dual graph-based robust unsupervised feature extraction framework for HSI is proposed to realize reliable clustering. Firstly, low-rank reconstruction and projected learning are incorporated into the proposed framework to improve the data quality and obtain their robust structures. Then, a novel learning schemes is designed to learn two reliable graphs from the above robust structures respectively. We show that the scheme can reveals the latent similarity relationships while removing the noise influence. Meanwhile, the two reliable graphs are also integrated into a comprehensive graph with consistent constraint. At last, a joint learning framework is proposed, in which the data quality improvement, reliable graphs and consistent graph are learned iteratively to benefit from each other. After that, the normalized cut technique is applied to the learned consistent graph to obtain the final unsupervised feature. Several experiments are conducted on the two public HIS datasets to show advantage of our proposed method against the existing methods.
引用
收藏
页码:63319 / 63330
页数:12
相关论文
empty
未找到相关数据