Flavors of compressive sensing (Q4609797)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Flavors of compressive sensing

scientific article; zbMATH DE number 6852805

Language	Label	Description	Also known as
default for all languages	No label defined
English	Flavors of compressive sensing	scientific article; zbMATH DE number 6852805

Statements

instance of

scholarly article

0 references

title

Flavors of Compressive Sensing (English)

0 references

author

Simon Foucart

0 references

published in

Springer Proceedings in Mathematics & Statistics

0 references

publication date

26 March 2018

0 references

zbMATH Keywords

Gelfand width

0 references

Random matrices

0 references

restricted isometry property

0 references

iterative hard thresholding

0 references

orthogonal matching pursuit

0 references

basis pursuit

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-59912-0_4

0 references

cites work

Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling

0 references

Living on the edge: phase transitions in convex programs with random data

0 references

Certifying the Restricted Isometry Property is Hard

0 references

One-bit compressive sensing of dictionary-sparse signals

0 references

Hard thresholding pursuit algorithms: number of iterations

0 references

Bounded orthogonal systems and the $\Lambda$ (p)-set problem

0 references

Explicit constructions of RIP matrices and related problems

0 references

Are bitvectors optimal?

0 references

Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices

0 references

Solving quadratic equations via phaselift when there are about as many equations as unknowns

0 references

Exact matrix completion via convex optimization

0 references

Decoding by Linear Programming

0 references

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

0 references

Compressed sensing with coherent and redundant dictionaries

0 references

Phaselift: exact and stable signal recovery from magnitude measurements via convex programming

0 references

Polynomial approximation via compressed sensing of high-dimensional functions on lower sets

0 references

Compressed sensing and best $k$-term approximation

0 references

Orthogonal matching pursuit under the restricted isometry property

0 references

Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries

0 references

Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$

0 references

For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution

0 references

Counting faces of randomly projected polytopes when the projection radically lowers dimension

0 references

Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing

0 references

Stability and robustness of weak orthogonal matching pursuits

0 references

Stability and robustness of $\ell_1$-minimizations with Weibull matrices and redundant dictionaries

0 references

Dictionary-sparse recovery via thresholding-based algorithms

0 references

Real versus complex null space properties for sparse vector recovery

0 references

Sparse recovery with pre-Gaussian random matrices

0 references

Sparse disjointed recovery from noninflating measurements

0 references

The Gelfand widths of $\ell_p$-balls for $0 < p \leq 1$

0 references

A mathematical introduction to compressive sensing

0 references

Q3715582

0 references

Lower bounds for constant weight codes

0 references

Recovering Low-Rank Matrices From Few Coefficients in Any Basis

0 references

Sobolev duals for random frames and $\varSigma \varDelta $ quantization of compressed sensing measurements

0 references

Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes

0 references

Robust sparse phase retrieval made easy

0 references

DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS

0 references

One-Bit Compressive Sensing With Norm Estimation

0 references

Q4868577

0 references

Sparse recovery under weak moment assumptions

0 references

Sparse signal recovery from quadratic measurements via convex programming

0 references

How neighborly can a centrally symmetric polytope be?

0 references

Q4320142

0 references

The geometry of random $\{-1,1\}$-polytopes

0 references

Hardness vs randomness

0 references

Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices

0 references

Q3344608

0 references

One-bit compressed sensing by linear programming

0 references

Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach

0 references

A simpler approach to matrix completion

0 references

Two observations regarding embedding subsets of Euclidean spaces in normed spaces

0 references

Selecting a proportion of characters

0 references

Greedy approximation

0 references

The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing

0 references

Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

0 references

Widths of embeddings in function spaces

0 references

Sparse Recovery With Orthogonal Matching Pursuit Under RIP

0 references

Identifiers

zbMATH Open document ID

1391.94211

0 references

DOI

10.1007/978-3-319-59912-0_4

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Flavors of compressive sensing