Improvement of Gaussian Random Measurement Matrices in Compressed Sensing

Biao Wang; She Xiang Ma

doi:10.4028/www.scientific.net/AMR.301-303.245

Paper Titles

Secondary Optical Design of LED Road Lights
p.223

Fabric Defect Detection Method Based on Gabor Filters
p.229

Isobaric Vapor Liquid Equilibrium (VLE) Data of the Systems Ethylene Glycol-Glycerol and 1,2-Propylene Glycol-Ethylene Glycol at 20Pa
p.235

The Content Determination of Strongly Acidic Alkyl Phosphate with the Method of Potentiometric Titration
p.241

Improvement of Gaussian Random Measurement Matrices in Compressed Sensing
p.245

Partition Slub Yarn into Slub Parts and Base Parts
p.251

Design of Antenna with a Solar Cell as a Parasitic Element in the UHF RFID Tag
p.257

Quantum Chemical Calculation on ¹H NMR Chemical Shifts of PMMA/PVPh Blends
p.263

Application of Coordinate Measuring Machine in Reverse Engineering
p.269

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 301-303Improvement of Gaussian Random Measurement...

Improvement of Gaussian Random Measurement Matrices in Compressed Sensing

Abstract:

Compressed sensing seeks to recover a sparse or compressible signal from a small number of linear and non-adaptive measurements. Gaussian random matrix is a kind of fundamental measurement matrices, but its performance isn’t perfect because of more errors in recovery. This paper studies a new kind of matrix based on improving Gaussian random matrices. Measure sparse signals with improved matrices and recover original signals with orthogonal matching pursuit. Numerical experiments showed that the quality of recovered signal by improved measurement matrices is better than Gaussian random matrices.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 301-303)

Pages:

245-250

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.301-303.245

Citation:

Cite this paper

Online since:

July 2011

Authors:

Biao Wang, She Xiang Ma

Keywords:

Compressed Sensing, Gaussian Random Matrices, Measurement Matrix, Orthogonal Matching Pursuit

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] D. Donoho, Compressed sensing, IEEE Trans. on Information Theory, vol. 52, pp.1289-1306, (2006).

DOI: 10.1109/tit.2006.871582

Google Scholar

[2] D L Donoho , Y Tsaig. Extension of compressed sensing, [J]. Signal Processing, vol. 86, pp.533-548, (2006).

Google Scholar

[3] E. Candès. Compressive sampling, [A]. Proceedings of the Internat- ional Congress of Mathematicians[C]. Madrid, Spain, 3: 1433-1452, 206.

DOI: 10.4171/022-3/69

Google Scholar

[4] E Candès. The restricted isometry property and its implications for compressed sensing, [J]. Acadèmie des sciences, vol. 346, pp.598-592 (2006).

DOI: 10.1016/j.crma.2008.03.014

Google Scholar

[5] Cande`s E, Tao T. Decoding by linear programming, [J]. IEEE Tra-nsaction on Information Theory, vol. 51, pp.4203-4215, (2005).

Google Scholar

[6] Candès E J, Romberg J and Tao T 2006. Stable signal recovery fr-om incomplete and inaccurate measurements Commun, [J]. Pure Appl. Math. 2006, 59(8): 1207–1223.

DOI: 10.1002/cpa.20124

Google Scholar

[7] E. Candès, J. Romberg, and T. Tao. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, [J]. IEEE Trans. On Information Theory, 2006, 52(2): 489-509.

DOI: 10.1109/tit.2005.862083

Google Scholar

[8] E. Candès and T. Tao. Near optimal signal recovery from random projections: Universal encoding strategies, [J]. IEEE Trans. on Information Theory, 2006, 52(12): 5406-5425.

DOI: 10.1109/tit.2006.885507

Google Scholar