Error estimation for non-convex relaxation cosparse optimization problems
From MaRDI portal
Cites work
- A modified greedy analysis pursuit algorithm for the cosparse analysis model
- Analysis K-SVD: A Dictionary-Learning Algorithm for the Analysis Sparse Model
- Analysis vs synthesis with structure -- an investigation of union of subspace models on graphs
- Compressed sensing
- Compressed sensing with coherent and redundant dictionaries
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
- DC formulations and algorithms for sparse optimization problems
- Decoding by Linear Programming
- Extensions of compressed sensing
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
- Greedy-like algorithms for the cosparse analysis model
- Non-uniform recovery guarantees for binary measurements and infinite-dimensional compressed sensing
- Performance Guarantees of the Thresholding Algorithm for the Cosparse Analysis Model
- Quantized frame expansions with erasures
- Restricted isometry properties and nonconvex compressive sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Smoothing and Decomposition for Analysis Sparse Recovery
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse image and signal processing. Wavelets, curvelets, morphological diversity
- The cosparse analysis model and algorithms
This page was built for publication: Error estimation for non-convex relaxation cosparse optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7353604)
