Pages that link to "Item:Q2464708"
From MaRDI portal
The following pages link to Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms (Q2464708):
Displaying 13 items.
- Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms (Q466526) (← links)
- Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms (Q734954) (← links)
- Compressed sensing with structured sparsity and structured acquisition (Q1713639) (← links)
- Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all (Q1748256) (← links)
- Stable restoration and separation of approximately sparse signals (Q2252500) (← links)
- Beyond coherence: Recovering structured time-frequency representations (Q2470546) (← links)
- When does OMP achieve exact recovery with continuous dictionaries? (Q2659744) (← links)
- Low Complexity Regularization of Linear Inverse Problems (Q2799919) (← links)
- Learning the Structure for Structured Sparsity (Q4580804) (← links)
- A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimization (Q5105438) (← links)
- A Greedy Approach to $\ell_{0,\infty}$-Based Convolutional Sparse Coding (Q5236637) (← links)
- Sampling rates for \(\ell^1\)-synthesis (Q6142336) (← links)
- Representation of operators using fusion frames (Q6185687) (← links)
