HyperSpectral classification with adaptively weighted L1-norm regularization and spatial postprocessing
원문 초록
Sparse regression methods have been proven effective in a wide range of signal processing problems such as image compression, speech coding, channel equalization, linear regression and classification. In this paper a new convex method of hyperspectral image classification is developed based on the sparse unmixing algorithm SUnSAL for which a pixel adaptive L1-norm regularization term is introduced. To further enhance class separability, the algorithm is kernelized using an RBF kernel and the final results are improved by a combination of spatial pre and post-processing operations. It is shown that the proposed method is competitive with state of the art algorithms such as SVM-CK, KSOMP-CK and KSSP-CK.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Generative Adversarial Minority Oversampling for Spectral-Spatial Hyperspectral Image Classification
Attention-Based Adaptive Spectral-Spatial Kernel ResNet for Hyperspectral Image Classification
Multi-direction Networks with Attentional Spectral Prior for Hyperspectral Image Classification
Multiscale Context-Aware Ensemble Deep KELM for Efficient Hyperspectral Image Classification
Hyperspectral Image Classification Method Based on 2D–3D CNN and Multibranch Feature Fusion
Deep Prototypical Networks with Hybrid Residual Attention for Hyperspectral Image Classification
토론
이 논문과 연결된 포럼 글이 아직 없습니다.