• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Compressed sensing (2004)

Cached

  • Download as a PDF

Download Links

  • [www.researchgate.net]
  • [www.researchgate.net]
  • [www.ece.ubc.ca]
  • [www.signallake.com]
  • [ivm.sjtu.edu.cn]
  • [ivm.sjtu.edu.cn]
  • [www-stat.stanford.edu]
  • [statweb.stanford.edu]
  • [statweb.stanford.edu]
  • [www.caam.rice.edu]
  • [www-stat.stanford.edu]
  • [www.cs.jhu.edu]
  • [www.signallake.com]
  • [www.cs.jhu.edu]
  • [statweb.stanford.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Yaakov Tsaig , David L. Donoho
Citations:3606 - 22 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Tsaig04compressedsensing,
    author = {Yaakov Tsaig and David L. Donoho},
    title = {Compressed sensing},
    year = {2004}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We study the notion of Compressed Sensing (CS) as put forward in [14] and related work [20, 3, 4]. The basic idea behind CS is that a signal or image, unknown but supposed to be compressible by a known transform, (eg. wavelet or Fourier), can be subjected to fewer measurements than the nominal number of pixels, and yet be accurately reconstructed. The samples are nonadaptive and measure ‘random’ linear combinations of the transform coefficients. Approximate reconstruction is obtained by solving for the transform coefficients consistent with measured data and having the smallest possible `1 norm. We perform a series of numerical experiments which validate in general terms the basic idea proposed in [14, 3, 5], in the favorable case where the transform coefficients are sparse in the strong sense that the vast majority are zero. We then consider a range of less-favorable cases, in which the object has all coefficients nonzero, but the coefficients obey an `p bound, for some p ∈ (0, 1]. These experiments show that the basic inequalities behind the CS method seem to involve reasonable constants. We next consider synthetic examples modelling problems in spectroscopy and image pro-

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University