A likelihood-based hyperparameter-free algorithm for robust block-sparse recovery

Chunlei Zhao

doi:10.1016/j.sigpro.2019.03.009

Return

A likelihood-based hyperparameter-free algorithm for robust block-sparse recovery

2019-08-01

PRE

DOI：10.1016/j.sigpro.2019.03.009

Original

Original request for help

Save

Abstract

En 中文

In this paper, a novel hyperparameter-free algorithm, which requires no a priori knowledge of block-sparsity level, is proposed for robust recovery of block-sparse signals with single/multiple measurement vector(s). The algorithm is based on the minimization of the negative log-likelihood function via majorization-minimization, and the block-sparsity is further induced by performing a Holder inequality based relaxation. Two alternative noise variance updating rules are established upon the assumptions of equal and unequal noise variances, respectively. Furthermore, the proposed algorithm is proved to be theoretically equivalent to iteratively optimizing the combination of linear minimum mean square error criterion and weighted block-sparse penalty, and also equivalent to the iterative reweighted versions of covariance-based LASSO-type group sparse regression algorithms. Through the simulation results, we show that proper parameter setting is potential to improve the robustness against inaccurate knowledge of block partition, while the provided two noise variance updating rules are well applicable to white Gaussian noise case and impulsive noise case, respectively. Moreover, compared to some existing algorithms, the proposed algorithm offers superior recovery performance with incoherent dictionary, as well as greater robustness against highly coherent dictionary. (C) 2019 Elsevier B.V. All rights reserved.

Keywords:

Block-sparse

Compressive sensing

Maximum-likelihood

Majorization-minimization

LASSO

Impulsive noise

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.