2014
DOI: 10.1109/tsp.2014.2304932
|View full text |Cite
|
Sign up to set email alerts
|

Smoothing and Decomposition for Analysis Sparse Recovery

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 shrinkagethresholding 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 transformat… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
58
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 90 publications
(59 citation statements)
references
References 37 publications
1
58
0
Order By: Relevance
“…It can be seen that smaller leads to a more accurate reconstruction, which is consistent with [27,28]. In our method, we inherit the continuation technique of [27] to accelerate the convergence while obtaining a desired reconstruction accuracy.…”
Section: Parameters Sensitivity Analysis For Two Experiments Sce-supporting
confidence: 62%
See 2 more Smart Citations
“…It can be seen that smaller leads to a more accurate reconstruction, which is consistent with [27,28]. In our method, we inherit the continuation technique of [27] to accelerate the convergence while obtaining a desired reconstruction accuracy.…”
Section: Parameters Sensitivity Analysis For Two Experiments Sce-supporting
confidence: 62%
“…To solve the weighted ℓ 1 -minimization problem (5) in the weighted reconstruction phase, an extension of the SFISTA [27] is employed. Recently, the SFISTA is a fast iterative thresholding algorithm-(FISTA-) based algorithm, which allows for solving the ℓ 1 -norm minimization problem based on analysis sparse model:…”
Section: Optimizationmentioning
confidence: 99%
See 1 more Smart Citation
“…To solve the ℓ 1 -minimization problem (3) in the weighted reconstruction phase, we use an extension of SFISTA. 48 The extended algorithm is summarized in Algorithm II, where the notation ∥ · ∥ 2 for matrices denotes the largest singular value. The operator Γ λ µ (z) is the soft shrinkage operator, which is applied element-wise on z and is defined as (for complex A II.…”
Section: C Adaptive Weighting For Reference Based Mrimentioning
confidence: 99%
“…The primary computational step of STAR is the constrained minimization in line 4 of the algorithm given in Table 1. This is a convex optimization problem and can be readily solved by existing techniques (e.g., Douglas-Rachford splitting [28], ADMM [29], NESTA-UP [26], and MFISTA [30]. In addition, the positivity constraint was enforced on the estimate of F because EPR images are real-valued and positive in general.…”
Section: Theorymentioning
confidence: 99%