Compressive Sampling With Generalized Polygons
Authors:
- 27 June 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 59 (10) , 4759-4766
Abstract
We consider the problem of compressed sensing and propose new deterministic low-storage constructions of compressive sampling matrices based on classical finite-geometry generalized polygons. For the noiseless measurements case, we develop a novel exact-recovery algorithm for strictly sparse signals that utilizes the geometry properties of generalized polygons and exhibits complexity that depends on the sparsity value only. In the presence of measurement noise, recovery of the generalized-polygon sampled signals can be carried out effectively using a belief propagation algorithm. Experimental studies included in this paper illustrate our theoretical developments.Keywords
This publication has 26 references indexed in Scilit:
- Iterative hard thresholding for compressed sensingApplied and Computational Harmonic Analysis, 2009
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samplesApplied and Computational Harmonic Analysis, 2009
- Deterministic constructions of compressed sensing matricesJournal of Complexity, 2007
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- Combinatorial Algorithms for Compressed Sensing2006
- LDPC Codes From Generalized PolygonsIEEE Transactions on Information Theory, 2005
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- Expander codesIEEE Transactions on Information Theory, 1996
- A Finite Generalized Hexagon Admitting a Group Acting Transitively on Ordered Heptagons is ClassicalJournal of Combinatorial Theory, Series A, 1996
- The nonexistence of certain generalized polygonsJournal of Algebra, 1964