Signal Reconstruction From Noisy Random Projections

DOI10.1109/TIT.2006.880031zbMath1323.94046MaRDI QIDQ3548034

Jarvis D. Haupt, Robert D. Nowak

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

samplingdata compressiondenoisingwireless sensor networksRademacher chaosrandom projectionsComplexity regularization

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)

Related Items (17)

Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity ⋮ Wavelet denoising via sparse representation ⋮ Efficient uncertainty quantification of stochastic CFD problems using sparse polynomial chaos and compressed sensing ⋮ Optimization Methods for Synthetic Aperture Radar Imaging ⋮ Density-sensitive semisupervised inference ⋮ On group-wise \(\ell_p\) regularization: theory and efficient algorithms ⋮ Analog random coding ⋮ Democracy in action: quantization, saturation, and compressive sensing ⋮ Solve exactly an under determined linear system by minimizing least squares regularized with an \(\ell_0\) penalty ⋮ The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder). ⋮ A statistical approach to the problem of restoring damaged and contaminated images ⋮ Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO ⋮ Compressive sensing for multi-static scattering analysis ⋮ Random projections of smooth manifolds ⋮ Compressive sensing for subsurface imaging using ground penetrating radar ⋮ DOA estimation with a rotational uniform linear array (RULA) and unknown spatial noise covariance ⋮ Efficient Sparse Hessian-Based Semismooth Newton Algorithms for Dantzig Selector

This page was built for publication: Signal Reconstruction From Noisy Random Projections