Hyperspectral Anomaly Detection Based on Tensor Truncated Nuclear Norm and Linear Total Variation Regularization

2021 ◽  
pp. 250-261
Author(s):  
Xiangbo Wang ◽  
Zebin Wu ◽  
Yang Xu ◽  
Zhihui Wei ◽  
Lei Xia
2018 ◽  
Vol 289 ◽  
pp. 1-12 ◽  
Author(s):  
Zhibin Zhu ◽  
Jiawen Yao ◽  
Zheng Xu ◽  
Junzhou Huang ◽  
Benxin Zhang

2018 ◽  
Vol 173 ◽  
pp. 03084
Author(s):  
Ju Huihui ◽  
Liu Zhigang ◽  
Jiangjun Jiang ◽  
Yang Wang

A novel anomaly detection method for hyperspectral images (HSIs) is proposed based on anisotropic spatial-spectral total variation and sparse constraint. HSIs are assumed to be not only smooth in spectral dimension but also piecewise smooth in spatial dimension. The proposed method adopts the anisotropic spatial-spectral total variation model which combines 2D spatial total variation and 1D spectral variation to explore the spatial-spectral smooth property of HSIs. Meanwhile, the sparse property of anomalies is exploited for its low probability in the image. To utilize both the spatial and spectral information of HSIs, we preserve the original cubic form of HSIs and divide the HSIs into three 3D arrays, each representing the background, the anomaly, and the noise respectively. By using anisotropic spatial-spectral total variation regularization on the background component and sparse constraint on the anomaly component, this anomaly detection problem has therefore been formulated as a constraint optimization problem whose solution has been derived by alternately using Split Bregman Method and Go Decomposition (GoDec) Method. Experimental results on hyperspectral datasets illustrate that our proposed method has a better detection performance than state-of-the-art hyperspectral anomaly detection methods.


2021 ◽  
Vol 13 (13) ◽  
pp. 2514
Author(s):  
Qianwei Dai ◽  
Hao Zhang ◽  
Bin Zhang

The chaos oscillation particle swarm optimization (COPSO) algorithm is prone to binge trapped in the local optima when dealing with certain complex models in ground-penetrating radar (GPR) data inversion, because it inherently suffers from premature convergence, high computational costs, and extremely slow convergence times, especially in the middle and later periods of iterative inversion. Considering that the bilateral connections between different particle positions can improve both the algorithmic searching efficiency and the convergence performance, we first develop a fast single-trace-based approach to construct an initial model for 2-D PSO inversion and then propose a TV-regularization-based improved PSO (TVIPSO) algorithm that employs total variation (TV) regularization as a constraint technique to adaptively update the positions of particles. B by adding the new velocity variations and optimal step size matrices, the search range of the random particles in the solution space can be significantly reduced, meaning blindness in the search process can be avoided. By introducing constraint-oriented regularization to allow the optimization search to move out of the inaccurate region, the premature convergence and blurring problems can be mitigated to further guarantee the inversion accuracy and efficiency. We report on three inversion experiments involving multilayered, fluctuated terrain models and a typical complicated inner-interface model to demonstrate the performance of the proposed algorithm. The results of the fluctuated terrain model show that compared with the COPSO algorithm, the fitness error (MAE) of the TVIPSO algorithm is reduced from 2.3715 to 1.0921, while for the complicated inner-interface model the fitness error (MARE) of the TVIPSO algorithm is reduced from 1.9539 to 1.5674.


2011 ◽  
Vol 82 (9) ◽  
pp. 093504 ◽  
Author(s):  
Weixin Qian ◽  
Shuangxi Qi ◽  
Wanli Wang ◽  
Jinming Cheng ◽  
Dongbing Liu

Sign in / Sign up

Export Citation Format

Share Document