Sciweavers

11 search results - page 1 / 3
» Deterministic constructions of compressed sensing matrices
Sort
View
TIT
2011
120views more  TIT 2011»
12 years 11 months ago
Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
—In this paper we establish the connection between the Orthogonal Optical Codes (OOC) and binary compressed sensing matrices. We also introduce deterministic bipolar m × n RIP f...
Arash Amini, Farokh Marvasti
JC
2007
119views more  JC 2007»
13 years 4 months ago
Deterministic constructions of compressed sensing matrices
Compressed sensing is a new area of signal processing. Its goal is to minimize the number of samples that need to be taken from a signal for faithful reconstruction. The performan...
Ronald A. DeVore
ICASSP
2011
IEEE
12 years 8 months ago
Additive character sequences with small alphabets for compressed sensing matrices
Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this paper, a K × N measurement matrix for compressed sensing ...
Nam Yul Yu
ICASSP
2011
IEEE
12 years 8 months ago
Deterministic compressed-sensing matrices: Where Toeplitz meets Golay
Recently, the statistical restricted isometry property (STRIP) has been formulated to analyze the performance of deterministic sampling matrices for compressed sensing. In this pa...
Kezhi Li, Cong Ling, Lu Gan
ICASSP
2010
IEEE
12 years 11 months ago
Using reed-muller sequences as deterministic compressed sensing matrices for image reconstruction
An image reconstruction algorithm using compressed sensing (CS) with deterministic matrices of second-order ReedMuller (RM) sequences is introduced. The 1D algorithm of Howard et ...
Kangyu Ni, Somantika Datta, Prasun Mahanti, Svetla...