Flavors of Compressive Sensing
From MaRDI portal
Publication:4609797
DOI10.1007/978-3-319-59912-0_4zbMath1391.94211OpenAlexW2736618363MaRDI QIDQ4609797
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
iterative hard thresholdingorthogonal matching pursuitrestricted isometry propertybasis pursuitRandom matricesGelfand width
Related Items
Sparse recovery from inaccurate saturated measurements, A unified approach to uniform signal recovery from nonlinear observations, Robust one-bit compressed sensing with partial circulant matrices, A Variable Density Sampling Scheme for Compressive Fourier Transform Interferometry, An Introduction to Compressed Sensing, Quantized Compressed Sensing: A Survey, Applied harmonic analysis and data processing. Abstracts from the workshop held March 25--31, 2018, Low-rank matrix recovery via regularized nuclear norm minimization, Endpoint Results for Fourier Integral Operators on Noncompact Symmetric Spaces, Preserving injectivity under subgaussian mappings and its application to compressed sensing, Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust sparse phase retrieval made easy
- A mathematical introduction to compressive sensing
- Solving quadratic equations via phaselift when there are about as many equations as unknowns
- Orthogonal matching pursuit under the restricted isometry property
- Sparse recovery under weak moment assumptions
- Compressed sensing with coherent and redundant dictionaries
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling
- Explicit constructions of RIP matrices and related problems
- Hard thresholding pursuit algorithms: number of iterations
- Two observations regarding embedding subsets of Euclidean spaces in normed spaces
- Sparse disjointed recovery from noninflating measurements
- Widths of embeddings in function spaces
- Real versus complex null space properties for sparse vector recovery
- Bounded orthogonal systems and the \(\Lambda\) (p)-set problem
- Selecting a proportion of characters
- Hardness vs randomness
- Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements
- Stability and robustness of \(\ell_1\)-minimizations with Weibull matrices and redundant dictionaries
- How neighborly can a centrally symmetric polytope be?
- The geometry of random \(\{-1,1\}\)-polytopes
- Exact matrix completion via convex optimization
- Stability and Robustness of Weak Orthogonal Matching Pursuits
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- One-Bit Compressed Sensing by Linear Programming
- Sparse Signal Recovery from Quadratic Measurements via Convex Programming
- One-Bit Compressive Sensing With Norm Estimation
- Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
- Certifying the Restricted Isometry Property is Hard
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
- Sparse recovery with pre-Gaussian random matrices
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Compressed sensing and best 𝑘-term approximation
- Greedy Approximation
- Are bitvectors optimal?
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Lower bounds for constant weight codes
- DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- Living on the edge: phase transitions in convex programs with random data
- One-bit compressive sensing of dictionary-sparse signals
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
- A Simpler Approach to Matrix Completion
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Dictionary-sparse recovery via thresholding-based algorithms
