Local similarity constraint-based sparse algorithm for hyperspectral target detection

被引:2
作者
Li, Xiaorun [1 ]
Huang, Risheng [1 ]
Niu, Shengda [2 ]
Cao, Zhiyu [2 ]
Zhao, Liaoying [3 ]
Li, Jing [1 ]
机构
[1] Zhejiang Univ, Coll Elect Engn, Hangzhou, Peoples R China
[2] Shanghai Inst Satellite Engn, Shanghai, Peoples R China
[3] Hangzhou Dianzi Univ, Hangzhou, Peoples R China
关键词
target detection; sparse representation; local similarity constraint; LAPLACIAN EIGENMAPS;
D O I
10.1117/1.JRS.13.046516
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
Target detection is a crucial problem for the analysis of hyperspectral remote sensing image. Sparse representation-based methods have shown considerable potential in hyperspectral target detection. In a hyperspectral image (HSI), the sparse representation with respect to a certain pixel means the pixel can be sparsely represented by the linear combination of data vectors from the data dictionary. When applied to target detection, a training dictionary needs to be constructed, consisting of both target and background samples in the same feature space. Then the test pixels can be sparsely represented through the decomposition over the constructed dictionary. Sparse representation is considered to preserve the main information of most pixels in HSI target detection. However, some background pixels may possess spectra similar to the target pixels' spectra, which may cause false detection. Therefore, more constraints are needed to smooth these pixels. We propose a local similarity constraint-based sparse algorithm to deal with this problem. Based on the assumption that pixels have both spectral and spatial similarity should have similar sparse representation, a local similarity constraint term is incorporated into the sparsity model. Then, an iterative sparse recovery algorithm is provided to obtain the recovered sparse vectors composed of sparse coefficients corresponding to both the target subdictionary and the background subdictionary. With the obtained sparse vectors, the residuals between the original test samples and the estimates recovered from the dictionary (including the target subdictionary and the background subdictionary) can be calculated and used to decide which class the test pixels belong to. The proposed algorithm has been applied on real HSIs to test the performance of detecting targets of interest. Experimental results demonstrate that the proposed model achieves better target detection performance than the state-of-the-art methods. (C) 2019 Society of Photo-Optical Instrumentation Engineers (SPIE)
引用
收藏
页数:15
相关论文
共 25 条
[21]  
Thenkabail PS, 2014, PHOTOGRAMM ENG REM S, V80, P697
[22]   Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit [J].
Tropp, JA ;
Gilbert, AC ;
Strauss, MJ .
SIGNAL PROCESSING, 2006, 86 (03) :572-588
[23]   Greed is good: Algorithmic results for sparse approximation [J].
Tropp, JA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (10) :2231-2242
[24]   Signal recovery from random measurements via orthogonal matching pursuit [J].
Tropp, Joel A. ;
Gilbert, Anna C. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (12) :4655-4666
[25]   Sparse Representation for Computer Vision and Pattern Recognition [J].
Wright, John ;
Ma, Yi ;
Mairal, Julien ;
Sapiro, Guillermo ;
Huang, Thomas S. ;
Yan, Shuicheng .
PROCEEDINGS OF THE IEEE, 2010, 98 (06) :1031-1044