Journal of Xidian University

Previous Articles     Next Articles

Hyperspectral unmixing method based on the non-convex sparse and low-rank constraints

KONG Fanqiang1;BIAN Chending1;LI Yunsong2;GUO Wenjun1   

  1. (1. College of Astronautics, Nanjing Univ. of Aeronautics and Astronautics, Nanjing 210016, China;
    2. State Key Lab. of Integrated Service Networks, Xidian Univ., Xi'an 710071, China)
  • Received:2015-11-09 Online:2016-12-20 Published:2017-01-19

Abstract:

Aiming at the row sparse feature of the abundance matrix of hyperspectral mixed pixels, a hyperspectral unmixing method based on the non-convex sparse and low-rank constraints is presented. The non-convex sparse representation and non-convex low-rank models are first constructed, which take the non-convex p-norm of the abundance matrix as the sparse constraint and the non-convex p-norm of the singular values of the abundance matrix as the low-rank constraint. Then the low-rank prior and the sparse prior are jointly utilized to construct a non-convex minimization model. An augmented lagrange alternating minimization method is proposed to solve the unmixing model, the compound regularization problem is decomposed into multiple single regularization problems solved by the variable separation method. Experimental results demonstrate that the proposed method outperforms the greedy algorithm and the convex algorithms with a better spectral unmixing accuracy, and is suitable for high signal-to-noise ratio hyperspectral data.

Key words: image processing, sparse unmixing, sparse representation, low-rank, convex optimization


Baidu
map