Minimization of the q-ratio sparsity with 1 < q ≤∞ for signal recovery

10/07/2020
by   Zhiyong Zhou, et al.
0

In this paper, we propose a general scale invariant approach for sparse signal recovery via the minimization of the q-ratio sparsity. When 1 < q ≤∞, both the theoretical analysis based on q-ratio constrained minimal singular values (CMSV) and the practical algorithms via nonlinear fractional programming are presented. Numerical experiments are conducted to demonstrate the advantageous performance of the proposed approaches over the state-of-the-art sparse recovery methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/12/2021

Block sparse signal recovery via minimizing the block q-ratio sparsity

In this paper, we propose a method for block sparse signal recovery that...
research
12/20/2018

A Scale Invariant Approach for Sparse Signal Recovery

In this paper, we study the ratio of the L_1 and L_2 norms, denoted as...
research
05/26/2021

Sparse recovery based on the generalized error function

In this paper, we propose a novel sparse recovery method based on the ge...
research
08/08/2023

Sorted L1/L2 Minimization for Sparse Signal Recovery

This paper introduces a novel approach for recovering sparse signals usi...
research
10/08/2018

JOBS: Joint-Sparse Optimization from Bootstrap Samples

Classical signal recovery based on ℓ_1 minimization solves the least squ...
research
10/19/2020

Sparse Recovery Analysis of Generalized J-Minimization with Results for Sparsity Promoting Functions with Monotonic Elasticity

In this paper we theoretically study exact recovery of sparse vectors fr...
research
05/29/2021

The Dantzig selector: Recovery of Signal via ℓ_1-αℓ_2 Minimization

In the paper, we proposed the Dantzig selector based on the ℓ_1-αℓ_2 (0<...

Please sign up or login with your details

Forgot password? Click here to reset