English

HyperSpectral classification with adaptively weighted L1-norm regularization and spatial postprocessing

Optimization and Control 2018-03-07 v3 Computer Vision and Pattern Recognition

Abstract

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.

Keywords

Cite

@article{arxiv.1412.2684,
  title  = {HyperSpectral classification with adaptively weighted L1-norm regularization and spatial postprocessing},
  author = {Victor Stefan Aldea},
  journal= {arXiv preprint arXiv:1412.2684},
  year   = {2018}
}

Comments

v3: 11 pages, 2 Figures, 10 Tables. Updated the results for the Indian Pines image; added the results for the Pavia University image

R2 v1 2026-06-22T07:24:02.948Z