Spectral–Spatial Hyperspectral Image Classification Using src='/images/tex/29720.gif' alt='ell _{1/2}'> Regularized Low-Rank Representation and Sparse Representation-Based Graph Cuts

摘要

Hundreds of narrow contiguous spectral bands collected by a hyperspectral sensor have provided the opportunity to identify the various materials present on the surface. Moreover, spatial information, enforcing the assumption that the adjacent pixels belong to the same class with a high probability, is a valuable complement to the spectral information. In this paper, two predominant approaches have been developed to exploit the spatial information. First, by decomposing each pixel and the spatial neighborhood into a low-rank form, the spatial information can be efficiently integrated into the spectral signatures. Meanwhile, in order to describe the low-rank structure of the decomposed data more precisely, an norm regularization is introduced and a discrete algorithm is proposed to solve the combined optimization problem by the augmented Lagrange multiplier (ALM) and a half-threshold operator. Second, a graph cuts segmentation algorithm has been applied on the sparse-representation-based probability estimates of the hyperspectral data to further improve the spatial homogeneity of the material distribution. Experimental results on four real hyperspectral data with different spectral and spatial resolutions have demonstrated the effectiveness and versatility of the proposed spatial information-fused approaches for hyperspectral image classification.