An Iterative Re-Weighting Algorithm for Element to Solve Sparsity-Regularized Linear Inverse Problem and an Application in Sparse-Spike Deconvolution of Seismic Data

The sparsity-regularized linear inverse problem has been widely used in many fields, such as remote sensing imaging, image processing and analysis, seismic deconvolution, compressed sensing, medical imaging, etc. This method offers greater flexibility in solving real-world problems. There are various sparse regularization method available, such as L0-norm, Lp-norm ( $0\lt {p} \lt 1$ ) regularization, L1-norm, weighted L1-norm regularization, Cauchy regularization, modified Cauchy regularization, t regularization, and so on. L1-norm regularization is the most well-known and widely used due to its convexity and linearity. It can be efficiently solved by the iterative soft thresholding algorithm (ISTA) or its faster variants. The soft thresholding operator works on each element individually and is highly efficient. In contrast, some other efficient sparse regularization methods are nonlinear, making them more challenging to solve. These sparse regularization can address the limitations of L1-norm regularization, such as degeneracy. An effective approach to solving sparse regularization problems is the iterative re-weighting least squares (IRLSs) algorithm. However, IRLS is computationally intensive and may not be suitable for massive data applications. In this letter, we propose a unified algorithmic framework for solving sparse regularization linear inverse problems. Our method combines the principles of ISTA and IRLS to create an element-wise iterative re-weighting algorithm. We have applied this algorithm to the sparse spike deconvolution of real seismic data and demonstrated its effectiveness when solve sparsity-regularized linear inverse problems.