Nonnegativity and Bound Constrains for Compressed Sensing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Nonnegativity and Bound Constrains for Compressed Sensing

David L. Donoho
  • Function : Author
  • PersonId : 858905

Abstract

Let A be an n by N real valued random matrix, and HN denote the N-dimensional hypercube. For numerous random matrix ensembles, the expected number of k-dimensional faces of the random n-dimensional zonotope AHN obeys the formula Efk(AHN)/fk(HN) = 1 − PN−n,N−k, where PN−n,N−k is a fair-coin-tossing probability: PN−n,N−k [\equiv] Prob{N−k−1 or fewer successes in N−n−1 tosses }.
No file

Dates and versions

inria-00369486 , version 1 (31-03-2009)

Identifiers

  • HAL Id : inria-00369486 , version 1

Cite

David L. Donoho, Jared Tanner. Nonnegativity and Bound Constrains for Compressed Sensing. SPARS'09 - Signal Processing with Adaptive Sparse Structured Representations, Inria Rennes - Bretagne Atlantique, Apr 2009, Saint Malo, France. ⟨inria-00369486⟩

Collections

SPARS09
43 View
0 Download

Share

Gmail Facebook X LinkedIn More