Smoothing and Decomposition for Analysis Sparse Recovery
arXiv:1308.5000 · doi:10.1109/TSP.2014.2304932
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.
arXiv commentSubmitted on Aug 22th, 2013; Updated on Dec 1st, 2013
References in corpus (7)
- Simultaneous analysis of Lasso and Dantzig selector
- Fast Image Recovery Using Variable Splitting and Constrained Optimization
- NESTA: A Fast and Accurate First-order Method for Sparse Recovery
- The Cosparse Analysis Model and Algorithms
- Greedy-Like Algorithms for the Cosparse Analysis Model
- On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
- Compressed Sensing with coherent tight frames via -minimization for
Cited by in corpus (13)
- Plug and play methods for magnetic resonance imaging (long version)
- Joint Sparse Recovery Method for Compressed Sensing with Structured Dictionary Mismatches
- -Analysis Minimization and Generalized (Co-)Sparsity: When Does Recovery Succeed?
- Sub-Nyquist SAR via Fourier Domain Range Doppler Processing
- Reference-Based MRI
- Undersampled Phase Retrieval with Outliers
- Signal Recovery under Cumulative Coherence
- Projected Nesterov's Proximal-Gradient Algorithm for Sparse Signal Reconstruction with a Convex Constraint
- High-dimensional Fast Convolutional Framework (HICU) for Calibrationless MRI
- A new variational model for shape graph registration with partial matching constraints
- Iteratively Reweighted Approaches to Sparse Composite Regularization
- Restricted -Isometry Properties Adapted to Frames for Nonconvex -Analysis
- A symmetric alternating minimization algorithm for total variation minimization