Deterministic Construction of Sparse Sensing Matrices via Finite Geometry

DOI10.1109/TSP.2014.2318139MaRDI QIDQ4579228zbMATH OpenFDO

Authors Shuxing Li, Gennian Ge

Publication date 22 August 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2014.2318139

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Deterministic Constructions of Compressed Sensing Matrices From Unitary Geometry
• Deterministic construction of compressed sensing matrices over finite sets
• Deterministic constructions of compressed sensing matrices
• Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
• Deterministic construction of compressed sensing matrices from codes
• Deterministic construction of compressed sensing matrices based on semilattices
• Deterministic Compressed Sensing Matrices: Construction via Euler Squares and Applications
• Deterministic constructions of compressed sensing matrices based on codes
• Role of sparsity and structure in the optimization landscape of non-convex matrix sensing
• Construction of sparse binary sensing matrices using set systems

Cited in

(14)

• Deterministic construction of compressed sensing matrices based on semilattices
• Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs
• Determinantal conditions for homomorphic sensing
• On atomic density of numerical semigroup algebras
• Three deterministic constructions of compressed sensing matrices with low coherence
• Bipolar measurement matrix using chaotic sequence
• An effective algorithm for the spark of sparse binary measurement matrices
• Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
• Cayley sum graphs and their applications to codebooks
• Deterministic convolutional compressed sensing matrices
• Deterministic Constructions of Binary Measurement Matrices From Finite Geometry
• Non-Cartesian spiral binary sensing matrices
• Non-iterative sparse signal recovery algorithms for sparse matrices and their guarantees
• On numerical semigroup elements and the \(\ell_0\) and \(\ell_{\infty}\) norms of their factorizations

This page was built for publication: Deterministic Construction of Sparse Sensing Matrices via Finite Geometry

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