A linear system output transformation for sparse approximation
From MaRDI portal
Recommendations
- Sparse Approximate Solutions to Linear Systems
- Sparse system identification in pairs of pulse and Takenaka-Malmquist bases
- On Sparse Representations in Arbitrary Redundant Bases
- For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution
- Special issue on sparse approximate solution of linear systems
Cites work
- scientific article; zbMATH DE number 50881 (Why is no real title available?)
- A randomized method for solving discrete ill-posed problems
- A simple test to check the optimality of a sparse signal approximation
- Analytical study of error components for solving discrete ill-posed problems using random projections
- Binary vectors for fast distance and similarity estimation
- Formation of similarity-reflecting binary vectors with random binary projections
- Increasing the accuracy of solving discrete ill-posed problems by the random projection method
- Matching pursuits with time-frequency dictionaries
- Model selection criteria for a linear model to solve discrete ill-posed problems on the basis of singular decomposition and random projection
- New approaches to the analysis and interpretation of the shape of cyclic signals
- Real-valued embeddings and sketches for fast distance and similarity estimation
- Restoration of a standard sample of cyclic waveforms with the use of the Hausdorff metric in a phase space
- Sparse and redundant representations. From theory to applications in signal and image processing.
This page was built for publication: A linear system output transformation for sparse approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103842)
