Adaptively-Regularized Compressive Sensing With Sparsity Bound Learning

Haihui Xie

doi:10.1109/LCOMM.2020.3045763

Adaptively-Regularized Compressive Sensing With Sparsity Bound Learning

2021-04-01

2

PRE

AI

DOI：10.1109/LCOMM.2020.3045763

Original

Original request for help

Save

Abstract

En 中文

In this letter, an adaptively-regularized iterative reweighted least squares algorithm with sparsity bound learning is designed to efficiently recover sparse signals from measurements. In particular, at each iteration the support of estimated signal is exploited to construct a sparsity-promoting matrix and, then, formulate an adaptive regularization. Since this algorithm could learn sparsity information at each iteration, it ensures a sparser and sparser solution, and the mean squared error analysis corroborates its convergence. Experimental results demonstrate that the proposed algorithm outperforms other typical ones in terms of sparsity level, compressive ratio, and detection probability.

Keywords:

Sparse matrices

Sensors

Matching pursuit algorithms

Computational complexity

Minimization

Covariance matrices

Convergence

Compressive sensing

iterative reweighted least-square algorithm

sparsity bound learning

Adaptively-Regularized Compressive Sensing With Sparsity Bound Learning

Abstract

AI Summary

Journal

Organization