Compressed sensing for finite-valued signals

DOI10.1016/j.laa.2017.07.006zbMath1370.94153arXiv1609.09450OpenAlexW2963765059MaRDI QIDQ2401311

Sandra Keiper, Dae Gwan Lee, Gitta Kutyniok, Götz E. Pfander

Publication date: 8 September 2017

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.09450

zbMATH Keywords

phase transitionsfinite alphabetsparse recoverycompressed sensingnull space propertystatistical dimension

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Random matrices (algebraic aspects) (15B52) Sampling theory in information and communication theory (94A20) Conditioning of matrices (15A12) Probabilistic methods for one variable harmonic analysis (42A61)

Related Items (7)

A survey on compressive sensing: classical results and recent advancements ⋮ Sparse recovery with integrality constraints ⋮ Block-sparse recovery of semidefinite systems and generalized null space conditions ⋮ Finite alphabet phase retrieval ⋮ One-dimensional phase retrieval: regularization, box relaxation and uniqueness ⋮ Unbiasing in iterative reconstruction algorithms for discrete compressed sensing ⋮ Recovery under side constraints

Uses Software

• PDCO

Cites Work

• A mathematical introduction to compressive sensing
• PROMP: a sparse recovery approach to lattice-valued signals
• Sparse recovery with integrality constraints
• Probability of unique integer solution to a system of linear equations
• Counting the faces of randomly-projected hypercubes and orthants, with applications
• Convex Recovery of a Structured Signal from Independent Random Linear Measurements
• Counting faces of randomly projected polytopes when the projection radically lowers dimension
• Compressed sensing and best 𝑘-term approximation
• Atomic Decomposition by Basis Pursuit
• Uncertainty principles and ideal atomic decomposition
• Spatial Compressive Sensing for MIMO Radar
• Closest point search in lattices
• A generalized uncertainty principle and sparse representation in pairs of bases
• Sparse Approximate Solutions to Linear Systems
• Living on the edge: phase transitions in convex programs with random data
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing

This page was built for publication: Compressed sensing for finite-valued signals