Pages that link to "Item:Q2659754"
From MaRDI portal
The following pages link to \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed? (Q2659754):
Displaying 17 items.
- A modified greedy analysis pursuit algorithm for the cosparse analysis model (Q513670) (← links)
- Image reconstruction using analysis model prior (Q519588) (← links)
- Analysis \(\ell_1\)-recovery with frames and Gaussian measurements (Q904283) (← links)
- A general version of Price's theorem. A tool for bounding the expectation of nonlinear functions of Gaussian random vectors (Q2042047) (← links)
- One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations (Q2374380) (← links)
- Greedy-like algorithms for the cosparse analysis model (Q2437331) (← links)
- NESTANets: stable, accurate and efficient neural networks for analysis-sparse inverse problems (Q2700171) (← links)
- What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization? (Q5001600) (← links)
- Performance analysis for unconstrained analysis based approaches* (Q5097569) (← links)
- On the Convergence Rate of Projected Gradient Descent for a Back-Projection Based Objective (Q5860373) (← links)
- Compressed data separation via unconstrained l1-split analysis (Q5889890) (← links)
- Star DGT: a robust Gabor transform for speech denoising (Q6049823) (← links)
- A unified approach to uniform signal recovery from nonlinear observations (Q6101267) (← links)
- Compressed data separation via \(\ell_q\)-split analysis with \(\ell_\infty\)-constraint (Q6596308) (← links)
- Compressed sensing with frames and sparsity in levels class (Q6632182) (← links)
- Theory and fast learned solver for \(\ell^1\)-TV regularization (Q6659670) (← links)
- Convergence on thresholding-based algorithms for dictionary-sparse recovery (Q6669595) (← links)
