Smoothing and Decomposition for Analysis Sparse Recovery

DOI10.1109/TSP.2014.2304932zbMath1394.94580arXiv1308.5000MaRDI QIDQ4579107

Arye Nehorai, Amir Beck, Yonina C. Eldar, Zhao Tan

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.5000

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (16)

Compressed data separation via unconstrained l1-split analysis ⋮ Signal recovery under cumulative coherence ⋮ A New Variational Model for Shape Graph Registration with Partial Matching Constraints ⋮ \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed? ⋮ Performance analysis for unconstrained analysis based approaches* ⋮ Analysis non-sparse recovery for relaxed ALASSO ⋮ Sampling in the analysis transform domain ⋮ Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery ⋮ Multiple-prespecified-dictionary sparse representation for compressive sensing image reconstruction with nonconvex regularization ⋮ Signal recovery under mutual incoherence property and oracle inequalities ⋮ A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems ⋮ On inexact ADMMs with relative error criteria ⋮ Combined similarity to reference image with joint sparsifying transform for longitudinal compressive sensing MRI ⋮ SPARCOM: Sparsity Based Super-resolution Correlation Microscopy ⋮ Approximate first-order primal-dual algorithms for saddle point problems ⋮ Stable recovery of analysis based approaches

This page was built for publication: Smoothing and Decomposition for Analysis Sparse Recovery