Improved Recovery of Analysis Sparse Vectors in Presence of Prior Information

08/13/2018
by   Sajad Daei, et al.
0

In this work, we consider the problem of recovering analysis-sparse signals from under-sampled measurements when some prior information about the support is available. We incorporate such information in the recovery stage by suitably tuning the weights in a weighted ℓ_1 analysis optimization problem. Indeed, we try to set the weights such that the method succeeds with minimum number of measurements. For this purpose, we exploit the upper-bound on the statistical dimension of a certain cone to determine the weights. Our numerical simulations confirm that the introduced method with tuned weights outperforms the standard ℓ_1 analysis technique.

READ FULL TEXT
research
04/20/2018

Exploiting Prior Information in Block Sparse Signals

We study the problem of recovering a block-sparse signal from under-samp...
research
12/27/2022

Distribution-aware ℓ_1 Analysis Minimization

This work is about recovering an analysis-sparse vector, i.e. sparse vec...
research
09/09/2019

Sparse linear regression with compressed and low-precision data via concave quadratic programming

We consider the problem of the recovery of a k-sparse vector from compre...
research
09/09/2018

Distribution-aware Block-sparse Recovery via Convex Optimization

We study the problem of reconstructing a block-sparse signal from compre...
research
08/12/2020

Signal-Dependent Performance Analysis of Orthogonal Matching Pursuit for Exact Sparse Recovery

Exact recovery of K-sparse signals x ∈ℝ^n from linear measurements y=Ax,...
research
06/26/2021

Recovery from Power Sums

We study the problem of recovering a collection of n numbers from the ev...
research
11/21/2018

Reconstruction of jointly sparse vectors via manifold optimization

In this paper, we consider the challenge of reconstructing jointly spars...

Please sign up or login with your details

Forgot password? Click here to reset