Smoothing and Decomposition for Analysis Sparse Recovery

DOI10.1109/TSP.2014.2304932MaRDI QIDQ4579107zbMATH OpenFDO

Authors Zhao Tan, Y. C. Eldar, Amir Beck, Arye Nehorai

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)

Abstract: We consider algorithms and recovery guarantees for the analysis sparse model in which the signal is sparse with respect to a highly coherent frame. We consider the use of a monotone version of the fast iterative shrinkage- thresholding algorithm (MFISTA) to solve the analysis sparse recovery problem. Since the proximal operator in MFISTA does not have a closed-form solution for the analysis model, it cannot be applied directly. Instead, we examine two alternatives based on smoothing and decomposition transformations that relax the original sparse recovery problem, and then implement MFISTA on the relaxed formulation. We refer to these two methods as smoothing-based and decomposition-based MFISTA. We analyze the convergence of both algorithms, and establish that smoothing- based MFISTA converges more rapidly when applied to general nonsmooth optimization problems. We then derive a performance bound on the reconstruction error using these techniques. The bound proves that our methods can recover a signal sparse in a redundant tight frame when the measurement matrix satisfies a properly adapted restricted isometry property. Numerical examples demonstrate the performance of our methods and show that smoothing-based MFISTA converges faster than the decomposition-based alternative in real applications, such as MRI image reconstruction.

Cited in

(23)

• Signal recovery under cumulative coherence
• Smoothed _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
• On inexact ADMMs with relative error criteria
• Combined similarity to reference image with joint sparsifying transform for longitudinal compressive sensing MRI
• Analysis non-sparse recovery for relaxed ALASSO
• A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems
• Stable recovery of analysis based approaches
• \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
• The Whittaker smoother and the Moore-Penrose inverse in signal reconstruction
• A new variational model for shape graph registration with partial matching constraints
• Performance analysis for unconstrained analysis based approaches
• SPARCOM: sparsity based super-resolution correlation microscopy
• Approximate first-order primal-dual algorithms for saddle point problems
• Compressed data separation via unconstrained l1-split analysis
• Tight-frame-like analysis-sparse recovery using nontight sensing matrices
• Inexact fixed-point proximity algorithm for the _0 sparse regularization problem
• Compressed data separation via \(\ell_q\)-split analysis with \(\ell_\infty\)-constraint
• Iterative gradient denoising algorithm for signal recovery using analysis-based implicit prior
• Convergence analysis on the alternating direction method of multipliers for the cosparse optimization problem
• Error estimation for non-convex relaxation cosparse optimization problems
• Sampling in the analysis transform domain

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579107)