Sparse Representation Classification Based on Flexible Patches Sampling of Superpixels for Hyperspectral Images

10Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Aiming at solving the difficulty of modeling on spatial coherence, complete feature extraction, and sparse representation in hyperspectral image classification, a joint sparse representation classification method is investigated by flexible patches sampling of superpixels. First, the principal component analysis and total variation diffusion are employed to form the pseudo color image for simplifying superpixels computing with (simple linear iterative clustering) SLIC model. Then, we design a joint sparse recovery model by sampling overcomplete patches of superpixels to estimate joint sparse characteristics of test pixel, which are carried out on the orthogonal matching pursuit (OMP) algorithm. At last, the pixel is labeled according to the minimum distance constraint for final classification based on the joint sparse coefficients and structured dictionary. Experiments conducted on two real hyperspectral datasets show the superiority and effectiveness of the proposed method.

Cite

CITATION STYLE

APA

Sima, H., Liu, P., Liu, L., Mi, A., & Wang, J. (2018). Sparse Representation Classification Based on Flexible Patches Sampling of Superpixels for Hyperspectral Images. Mathematical Problems in Engineering, 2018. https://doi.org/10.1155/2018/8264961

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free