Flavors of compressive sensing
From MaRDI portal
Publication:4609797
DOI10.1007/978-3-319-59912-0_4zbMATH Open1391.94211OpenAlexW2736618363MaRDI QIDQ4609797FDOQ4609797
Authors: Simon Foucart 
Publication date: 26 March 2018
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-59912-0_4
Recommendations
iterative hard thresholdingorthogonal matching pursuitrestricted isometry propertybasis pursuitRandom matricesGelfand width
Cites Work
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Robust sparse phase retrieval made easy
- Exact matrix completion via convex optimization
- Decoding by Linear Programming
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Title not available (Why is that?)
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Compressed sensing and best \(k\)-term approximation
- Title not available (Why is that?)
- A mathematical introduction to compressive sensing
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Hardness vs randomness
- Greedy approximation
- Stability and robustness of \(\ell_1\)-minimizations with Weibull matrices and redundant dictionaries
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- Sparse recovery under weak moment assumptions
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- One-bit compressed sensing by linear programming
- Certifying the Restricted Isometry Property is Hard
- Title not available (Why is that?)
- Living on the edge: phase transitions in convex programs with random data
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
- A simpler approach to matrix completion
- Widths of embeddings in function spaces
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS
- Explicit constructions of RIP matrices and related problems
- Title not available (Why is that?)
- Solving quadratic equations via phaselift when there are about as many equations as unknowns
- Lower bounds for constant weight codes
- Compressed sensing with coherent and redundant dictionaries
- Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
- Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling
- Sparse signal recovery from quadratic measurements via convex programming
- Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
- How neighborly can a centrally symmetric polytope be?
- Sparse recovery with pre-Gaussian random matrices
- Real versus complex null space properties for sparse vector recovery
- Two observations regarding embedding subsets of Euclidean spaces in normed spaces
- Orthogonal matching pursuit under the restricted isometry property
- Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements
- The geometry of random \(\{-1,1\}\)-polytopes
- Stability and robustness of weak orthogonal matching pursuits
- Bounded orthogonal systems and the \(\Lambda\) (p)-set problem
- Are bitvectors optimal?
- Selecting a proportion of characters
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
- One-bit compressive sensing of dictionary-sparse signals
- Hard thresholding pursuit algorithms: number of iterations
- Dictionary-sparse recovery via thresholding-based algorithms
- Sparse disjointed recovery from noninflating measurements
- One-Bit Compressive Sensing With Norm Estimation
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
Cited In (13)
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
- Robust one-bit compressed sensing with partial circulant matrices
- Sparse recovery from inaccurate saturated measurements
- Nonlinear approximation and compressed sensing
- A unified approach to uniform signal recovery from nonlinear observations
- Low-rank matrix recovery via regularized nuclear norm minimization
- An introduction to compressed sensing
- Quantized compressed sensing: a survey
- Preserving injectivity under subgaussian mappings and its application to compressed sensing
- A survey on compressive sensing: classical results and recent advancements
- Applied harmonic analysis and data processing. Abstracts from the workshop held March 25--31, 2018
- Endpoint results for Fourier integral operators on noncompact symmetric spaces
- A Variable Density Sampling Scheme for Compressive Fourier Transform Interferometry
Uses Software
This page was built for publication: Flavors of compressive sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4609797)
