An effective algorithm for the spark of sparse binary measurement matrices

DOI10.1016/J.AMC.2019.124965MaRDI QIDQ2287709zbMATH OpenOpenAlexWikidataFDO

Authors Fenghua Tong, Lixiang Li, Haipeng Peng, Yi-Xian Yang

Publication date 21 January 2020

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2019.124965

zbMATH Keywords

compressed sensingfinite fieldssparkbinary measurement matrices

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Combinatorial optimization (90C27) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Sampling theory in information and communication theory (94A20)

Recommendations

• Deterministic construction of sparse binary matrices via incremental integer optimization
• Two new lower bounds for the spark of a matrix
• Computing the spark: mixed-integer programming for the (vector) matroid girth problem
• An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices
• Sparsification of matrices and compressed sensing

Cites work

• A simple proof of the restricted isometry property for random matrices
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Compressed sensing
• Decoding by Linear Programming
• Deterministic Compressed Sensing Matrices: Construction via Euler Squares and Applications
• Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
• Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
• Deterministic Construction of Sparse Sensing Matrices via Finite Geometry
• Deterministic Constructions of Binary Measurement Matrices From Finite Geometry
• Deterministic Sensing Matrices Arising From Near Orthogonal Systems
• Deterministic constructions of compressed sensing matrices
• Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
• Full spark frames
• LDPC Codes for Compressed Sensing
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• On the Minimum/Stopping Distance of Array Low-Density Parity-Check Codes
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Shortened Array Codes of Large Girth
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• Sparse representations in unions of bases
• The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing

Cited in

(3)

• Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs
• Two new lower bounds for the spark of a matrix
• Computing the spark: mixed-integer programming for the (vector) matroid girth problem

Describes a project that uses

Uses Software

• CoSaMP

This page was built for publication: An effective algorithm for the spark of sparse binary measurement matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287709)