Deterministic Compressed Sensing Matrices: Construction via Euler Squares and Applications

DOI10.1109/TSP.2016.2550020MaRDI QIDQ4622043zbMATH OpenOpenAlexFDO

Authors R. Ramu Naidu, Phanindra Jampana, C. S. Sastry

Publication date 8 February 2019

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

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

Mathematics Subject Classification ID

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

Abstract: In Compressed Sensing the matrices that satisfy the Restricted Isometry Property (RIP) play an important role. But to date, very few results for designing such matrices are available. For applications such as multiplier-less data compression, binary sensing matrices are of interest. The present work constructs deterministic and binary sensing matrices using Euler Squares. In particular, given a positive integer $m$ different from $p,p^2$ for a prime $p$, we show that it is possible to construct a binary sensing matrix of size $mimesc(mmu{)}^2$, where $mu$ is the coherence parameter of the matrix and $cin[1,2)$. The matrices that we construct have smaller density (that is, percentage of nonzero entries in the matrix is small) with no function evaluation in their construction, which support algorithms with low computational complexity. Through experimental work, we show that our binary sensing matrices can be used for such applications as content based image retrieval. Our simulation results demonstrate that the Euler Square based CS matrices give better performance than their Gaussian counterparts.

Cited in

(17)

• Computing the spark: mixed-integer programming for the (vector) matroid girth problem
• Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
• Flexible construction of measurement matrices in compressed sensing based on extensions of incidence matrices of combinatorial designs
• Sufficient conditions for the uniqueness of solution of the weighted norm minimization problem
• Determinantal conditions for homomorphic sensing
• Local recovery bounds for prior support constrained compressed sensing
• Bipolar measurement matrix using chaotic sequence
• An effective algorithm for the spark of sparse binary measurement matrices
• Deterministic constructions of compressed sensing matrices based on codes
• Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
• Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields
• Deterministic convolutional compressed sensing matrices
• Deterministic Construction of Sparse Sensing Matrices via Finite Geometry
• Deterministic Constructions of Compressed Sensing Matrices From Unitary Geometry
• Chaotic Binary Sensing Matrices
• Non-Cartesian spiral binary sensing matrices
• Non-iterative sparse signal recovery algorithms for sparse matrices and their guarantees

This page was built for publication: Deterministic Compressed Sensing Matrices: Construction via Euler Squares and Applications

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