A Survey of Compressed Sensing (Q3460827)

From MaRDI portal

Revision as of 07:01, 11 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: A Survey of Compressed Sensing

scientific article

Language	Label	Description	Also known as
English	A Survey of Compressed Sensing	scientific article

Statements

scholarly article

0 references

A Survey of Compressed Sensing (English)

0 references

0 references

Robert Calderbank

0 references

0 references

0 references

Compressed Sensing and its Applications

0 references

publication date

8 January 2016

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI profile type

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-16042-9_1

0 references

Database-friendly random projections: Johnson-Lindenstrauss with binary coins.

0 references

Computational Complexity

0 references

Model-Based Compressive Sensing

0 references

A simple proof of the restricted isometry property for random matrices

0 references

Templates for convex cone problems with applications to sparse signal recovery

0 references

Iterative hard thresholding for compressed sensing

0 references

New Bounds for Restricted Isometry Constants

0 references

Shifting Inequality and Recovery of Sparse Signals

0 references

The restricted isometry property and its implications for compressed sensing

0 references

A Probabilistic and RIPless Theory of Compressed Sensing

0 references

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

0 references

Stable signal recovery from incomplete and inaccurate measurements

0 references

Decoding by Linear Programming

0 references

Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

0 references

The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).

0 references

Atomic Decomposition by Basis Pursuit

0 references

Compressed sensing and best 𝑘-term approximation

0 references

Capturing ridge functions in high dimensions from point queries

0 references

An elementary proof of a theorem of Johnson and Lindenstrauss

0 references

Approximation of functions of few variables in high dimensions

0 references

Compressed sensing

0 references

Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit

0 references

0 references

Robust Recovery of Signals From a Structured Union of Subspaces

0 references

Sparse and Redundant Representations

0 references

Compressive Sensing

0 references

Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints

0 references

Learning functions of few arbitrary linear parameters in high dimensions

0 references

A note on guaranteed sparse recovery via \(\ell_1\)-minimization

0 references

Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)

0 references

A mathematical introduction to compressive sensing

0 references

Approximate sparse recovery

0 references

0 references

Kirkman Equiangular Tight Frames and Codes

0 references

Extensions of Lipschitz mappings into a Hilbert space

0 references

New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property

0 references

0 references

0 references

On the performance of algorithms for the minimization of ℓ <sub>1</sub> -penalized functionals

0 references

Matching pursuits with time-frequency dictionaries

0 references

On variants of the Johnson–Lindenstrauss lemma

0 references

Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds

0 references

CoSaMP: Iterative signal recovery from incomplete and inaccurate samples

0 references

0 references

Random sampling of sparse trigonometric polynomials

0 references

Compressed Sensing and Redundant Dictionaries

0 references

Sparse Legendre expansions via \(\ell_1\)-minimization

0 references

On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements

0 references

0 references

Greed is Good: Algorithmic Results for Sparse Approximation

0 references

Algorithms for simultaneous sparse approximation. II: Convex relaxation

0 references

Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

0 references

Algorithms for simultaneous sparse approximation. I: Greedy pursuit

0 references

Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals

0 references

Lower bounds on the maximum cross correlation of signals (Corresp.)

0 references

Complexity of approximation of functions of few variables in high dimensions

0 references

Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-16042-9_1

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3460827

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3460827&oldid=36222593"