English
Related papers

Related papers: Uniform recovery in infinite-dimensional compresse…

200 papers

In this paper we extend results taken from compressed sensing to recover Hilbert-space valued vectors. This is an important problem in parametric function approximation in particular when the number of parameters is high. By expanding our…

Numerical Analysis · Mathematics 2020-06-09 Jean-Luc Bouchot

Many applications have benefited remarkably from low-dimensional models in the recent decade. The fact that many signals, though high dimensional, are intrinsically low dimensional has given the possibility to recover them stably from a…

Information Theory · Computer Science 2015-07-29 Raja Giryes , Yaniv Plan , Roman Vershynin

This paper introduces a novel framework and corresponding methods for sampling and reconstruction of sparse signals in shift-invariant (SI) spaces. We reinterpret the random demodulator, a system that acquires sparse bandlimited signals, as…

Signal Processing · Electrical Eng. & Systems 2022-01-24 Tin Vlašić , Damir Seršić

In recent years, the use of sparse recovery techniques in the approximation of high-dimensional functions has garnered increasing interest. In this work we present a survey of recent progress in this emerging topic. Our main focus is on the…

Numerical Analysis · Mathematics 2017-06-12 Ben Adcock , Simone Brugiapaglia , Clayton G. Webster

In one-bit compressed sensing, previous results state that sparse signals may be robustly recovered when the measurements are taken using Gaussian random vectors. In contrast to standard compressed sensing, these results are not extendable…

Information Theory · Computer Science 2013-04-10 Albert Ai , Alex Lapanowski , Yaniv Plan , Roman Vershynin

This paper studies several aspects of signal reconstruction of sampled data in spaces of bandlimited functions. In the first part, signal spaces are characterized in which the classical sampling series uniformly converge, and we investigate…

Information Theory · Computer Science 2014-10-23 Holger Boche , Volker Pohl

This paper considers compressed sensing and affine rank minimization in both noiseless and noisy cases and establishes sharp restricted isometry conditions for sparse signal and low-rank matrix recovery. The analysis relies on a key…

Information Theory · Computer Science 2013-10-23 T. Tony Cai , Anru Zhang

Recent research has shown that performance in signal processing tasks can often be significantly improved by using signal models based on sparse representations, where a signal is approximated using a small number of elements from a fixed…

Optimization and Control · Mathematics 2011-11-18 Adam S. Charles , Pierre Garrigues , Christopher J. Rozell

Radio interferometry has always faced the problem of incomplete sampling of the Fourier plane. A possible remedy can be found in the promising new theory of compressed sensing (CS), which allows for the accurate recovery of sparse signals…

Instrumentation and Methods for Astrophysics · Physics 2015-12-22 Clara Fannjiang

Compressed sensing has been a very successful high-dimensional signal acquisition and recovery technique that relies on linear operations. However, the actual measurements of signals have to be quantized before storing or processing.…

Information Theory · Computer Science 2026-01-09 Namiko Matsumoto , Arya Mazumdar

We study the support recovery problem for a high-dimensional signal observed with additive noise. With suitable parametrization of the signal sparsity and magnitude of its non-zero components, we characterize a phase-transition phenomenon…

Statistics Theory · Mathematics 2019-04-16 Zheng Gao , Stilian Stoev

Signal processing is rich in inherently continuous and often nonlinear applications, such as spectral estimation, optical imaging, and super-resolution microscopy, in which sparsity plays a key role in obtaining state-of-the-art results.…

Machine Learning · Computer Science 2020-03-23 Luiz F. O. Chamon , Yonina C. Eldar , Alejandro Ribeiro

The Unlimited Sensing Framework (USF) is a digital acquisition protocol that allows for sampling and reconstruction of high dynamic range signals. By acquiring modulo samples, the USF circumvents the clipping or saturation problem that is a…

Information Theory · Computer Science 2022-07-28 Ayush Bhandari

In phase-only compressive sensing (PO-CS), our goal is to recover low-complexity signals (e.g., sparse signals, low-rank matrices) from the phase of complex linear measurements. While perfect recovery of signal direction in PO-CS was…

Information Theory · Computer Science 2023-07-10 Junren Chen , Michael K. Ng

Compressed sensing is a signal processing scheme that reconstructs high-dimensional sparse signals from a limited number of observations. In recent years, various problems involving signals with a finite number of discrete values have been…

Statistical Mechanics · Physics 2024-08-20 Mikiya Doi , Masayuki Ohzeki

Recovery of the sparsity pattern (or support) of an unknown sparse vector from a limited number of noisy linear measurements is an important problem in compressed sensing. In the high-dimensional setting, it is known that recovery with a…

Information Theory · Computer Science 2012-06-26 Galen Reeves , Michael Gastpar

Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this correspondence, a $K \times N$ measurement matrix for compressed sensing is deterministically constructed via additive…

Information Theory · Computer Science 2010-10-04 Nam Yul Yu

Inverse problems constrained by partial differential equations are often ill-conditioned due to noisy and incomplete data or inherent non-uniqueness. A prominent example is full waveform inversion, which estimates Earth's subsurface…

Geophysics · Physics 2026-03-03 Ali Siahkoohi , Kamal Aghazade , Ali Gholami

The field of compressed sensing has become a major tool in high-dimensional analysis, with the realization that vectors can be recovered from relatively very few linear measurements as long as the vectors lie in a low-dimensional structure,…

Information Theory · Computer Science 2020-04-30 Pete Casazza , Xuemei Chen , Richard Lynch

We study generative compressed sensing when the measurement matrix is randomly subsampled from a unitary matrix (with the DFT as an important special case). It was recently shown that $\textit{O}(kdn\| \boldsymbol{\alpha}\|_{\infty}^{2})$…

Information Theory · Computer Science 2023-11-21 Aaron Berk , Simone Brugiapaglia , Yaniv Plan , Matthew Scott , Xia Sheng , Ozgur Yilmaz
‹ Prev 1 8 9 10 Next ›