Skip to Main content Skip to Navigation
Conference papers

Nonnegativity and Bound Constrains for Compressed Sensing

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 }.
Complete list of metadatas
Contributor : Ist Rennes <>
Submitted on : Tuesday, March 31, 2009 - 11:03:53 AM
Last modification on : Thursday, October 26, 2017 - 4:34:02 PM


  • HAL Id : inria-00369486, version 1



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⟩



Record views