When Pixels Team up: Spatially Weighted Sparse Coding for Hyperspectral Image Classification
In this letter, a spatially weighted sparse unmixing approach is proposed as a front-end for hyperspectral image classification using a linear SVM. The idea is to partition the pixels of a hyperspectral image into a number of disjoint spatial neighborhoods. Since neighboring pixels are often composed of similar materials, their sparse codes are encouraged to have similar sparsity patterns. This is accomplished by means of a reweighted ℓ 1 framework where it is assumed that fractional abundances of neighboring pixels are distributed according to a common Laplacian Scale Mixture (LSM) prior with a shared scale parameter. This shared parameter determines which endmembers contribute to the group of pixels. Experiments on the AVIRIS Indian Pines show that the model is very effective in finding discriminative representations for HSI pixels, especially when the training data is limited.
