English
Related papers

Related papers: On sampling theorem with sparse decimated samples:…

200 papers

Super-resolution theory aims to estimate the discrete components lying in a continuous space that constitute a sparse signal with optimal precision. This work investigates the potential of recent super-resolution techniques for spectral…

Information Theory · Computer Science 2016-11-24 M. Ferreira Da Costa , W. Dai

Compressive sensing is a technique to sample signals well below the Nyquist rate using linear measurement operators. In this paper we present an algorithm for signal reconstruction given such a set of measurements. This algorithm…

Information Theory · Computer Science 2009-06-08 Graeme Pope

In this paper we analyze approximation and recovery properties with respect to systems satisfying universal sampling discretization property and a special incoherence property. We apply a powerful nonlinear approximation method -- the Weak…

Numerical Analysis · Mathematics 2024-01-02 V. Temlyakov

We develop a unified sampling theory based on sheaves and show that the Shannon-Nyquist theorem is a cohomological consequence of an exact sequence of sheaves. Our theory indicates that there are additional cohomological obstructions for…

Algebraic Topology · Mathematics 2013-07-30 Michael Robinson

The problem of compressing a real-valued sparse source using compressive sensing techniques is studied. The rate distortion optimality of a coding scheme in which compressively sensed signals are quantized and then reconstructed is…

Information Theory · Computer Science 2010-11-09 Rajiv Soundararajan , Sriram Vishwanath

The support recovery problem consists of determining a sparse subset of a set of variables that is relevant in generating a set of observations, and arises in a diverse range of settings such as compressive sensing, and subset selection in…

Information Theory · Computer Science 2016-08-31 Jonathan Scarlett , Volkan Cevher

Recently, a number of variants of the notion of cut-preserving hypergraph sparsification have been studied in the literature. These variants include directed hypergraph sparsification, submodular hypergraph sparsification, general notions…

Data Structures and Algorithms · Computer Science 2024-02-21 Sanjeev Khanna , Aaron L. Putterman , Madhu Sudan

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

Compressed sensing provided a data-acquisition paradigm for sparse signals. Remarkably, it has been shown that practical algorithms provide robust recovery from noisy linear measurements acquired at a near optimal sampling rate. In many…

Information Theory · Computer Science 2017-08-03 Kiryung Lee , Yanjun Li , Kyong Hwan Jin , Jong Chul Ye

The standard approach to compressive sampling considers recovering an unknown deterministic signal with certain known structure, and designing the sub-sampling pattern and recovery algorithm based on the known structure. This approach…

Information Theory · Computer Science 2016-02-03 Yen-Huan Li , Volkan Cevher

This paper studies sequential methods for recovery of sparse signals in high dimensions. When compared to fixed sample size procedures, in the sparse setting, sequential methods can result in a large reduction in the number of samples…

Information Theory · Computer Science 2014-10-07 Matthew L. Malloy , Robert Nowak

Resampling is an operation costly in calculation time and accuracy. It regularizes irregular sampling, replacing N data by N periodic estimations. This stage can be suppressed, using formulas built with incoming data and completed by…

Data Analysis, Statistics and Probability · Physics 2019-05-28 Bernard Lacaze

We study the impact of sampling theorems on the fidelity of sparse image reconstruction on the sphere. We discuss how a reduction in the number of samples required to represent all information content of a band-limited signal acts to…

Information Theory · Computer Science 2013-04-17 J. D. McEwen , G. Puy , J. -Ph. Thiran , P. Vandergheynst , D. Van De Ville , Y. Wiaux

Approximation of high-dimensional functions is a problem in many scientific fields that is only feasible if advantageous structural properties, such as sparsity in a given basis, can be exploited. A relevant tool for analysing sparse…

Numerical Analysis · Mathematics 2023-10-16 Philipp Trunschke , Anthony Nouy , Martin Eigel

Compressed sensing is a relatively new mathematical paradigm that shows a small number of linear measurements are enough to efficiently reconstruct a large dimensional signal under the assumption the signal is sparse. Applications for this…

Numerical Analysis · Mathematics 2018-01-08 Lenny Fukshansky , Deanna Needell , Benny Sudakov

The aim of this chapter is to give an overview of the recent advances related to sampling and recovery of signals defined over graphs. First, we illustrate the conditions for perfect recovery of bandlimited graph signals from samples…

Signal Processing · Electrical Eng. & Systems 2017-12-27 P. Di Lorenzo , S. Barbarossa , P. Banelli

This paper considers the problem of sampling and reconstruction of a continuous-time sparse signal without assuming the knowledge of the sampling instants or the sampling rate. This topic has its roots in the problem of recovering multiple…

Information Theory · Computer Science 2017-01-31 Ayush Bhandari , Aurelien Bourquard , Ramesh Raskar

The random equivalent sampling (RES) is a well-known sampling technique that can be used to capture a high-speed repetitive waveform with low sampling rate. In this paper, the feasibility of spectrum-blind multiband signal reconstruction…

Instrumentation and Detectors · Physics 2017-01-10 Yijiu Zhao , Li Wang , Houjun Wang , Changjian Liu

We study the information-theoretic limits of exactly recovering the support of a sparse signal using noisy projections defined by various classes of measurement matrices. Our analysis is high-dimensional in nature, in which the number of…

Statistics Theory · Mathematics 2008-06-04 Wei Wang , Martin J. Wainwright , Kannan Ramchandran

The fundamental principle underlying compressed sensing is that a signal, which is sparse under some basis representation, can be recovered from a small number of linear measurements. However, prior knowledge of the sparsity basis is…

Information Theory · Computer Science 2010-04-29 Sivan Gleichman , Yonina C. Eldar
‹ Prev 1 4 5 6 7 8 10 Next ›