English
Related papers

Related papers: Sampling theorems and compressive sensing on the s…

200 papers

Compressed sensing aims to undersample certain high-dimensional signals, yet accurately reconstruct them by exploiting signal characteristics. Accurate reconstruction is possible when the object to be recovered is sufficiently sparse in a…

Information Theory · Computer Science 2015-05-13 David L. Donoho , Arian Maleki , Andrea Montanari

In this paper, we give a survey of various sphere theorems in geometry. These include the topological sphere theorem of Berger and Klingenberg as well as the differentiable version obtained by the authors. These theorems employ a variety of…

Differential Geometry · Mathematics 2009-07-01 S. Brendle , R. M. Schoen

Compressive sensing (CS) is a new technology which allows the acquisition of signals directly in compressed form, using far fewer measurements than traditional theory dictates. Recently, many so-called signal space methods have been…

Numerical Analysis · Mathematics 2015-11-13 Xiaoyi Gu , Deanna Needell , Shenyinying Tu

We derive quantitative volume constraints for sampling measures $\mu_t$ on the unit sphere $\mathbb{S}^d$ that satisfy Marcinkiewicz-Zygmund inequalities of order $t$. Using precise localization estimates for Jacobi polynomials, we obtain…

Numerical Analysis · Mathematics 2026-01-08 Martin Ehler , Karlheinz Gröchenig

The present article is the third part of a series of papers devoted to the shallow water wave modelling. In this part, we investigate the derivation of some long wave models on a deformed sphere. We propose first a suitable for our purposes…

Fluid Dynamics · Physics 2020-02-20 Gayaz Khakimzyanov , Denys Dutykh , Zinaida Fedotova

Shannon's sampling theorem is one of the cornerstone topics that is well understood and explored, both mathematically and algorithmically. That said, practical realization of this theorem still suffers from a severe bottleneck due to the…

Information Theory · Computer Science 2020-12-02 Ayush Bhandari , Felix Krahmer , Ramesh Raskar

A notorious problem in mathematics and physics is to create a solvable model for random sequential adsorption of non-overlapping congruent spheres in the $d$-dimensional Euclidean space with $d\geq 2$. Spheres arrive sequentially at…

Probability · Mathematics 2019-01-25 Souvik Dhara , Johan S. H. van Leeuwaarden , Debankur Mukherjee

Recovering sparse signals from linear measurements has demonstrated outstanding utility in a vast variety of real-world applications. Compressive sensing is the topic that studies the associated raised questions for the possibility of a…

Optimization and Control · Mathematics 2020-07-24 Ahmad Mousavi , Mehdi Rezaee , Ramin Ayanzadeh

The paper establishes an analog Whittaker-Shannon-Kotelnikov sampling theorem for unbounded non-decaying band-limited signals. An explicit interpolation formula is obtained for signals sublinear growth with rate of growth less than 1/2. At…

Functional Analysis · Mathematics 2025-04-10 Nikolai Dokuchaev

In this work, we study the properties of sampling sets on families of large graphs by leveraging the theory of graphons and graph limits. To this end, we extend to graphon signals the notion of removable and uniqueness sets, which was…

Machine Learning · Computer Science 2026-03-16 Alejandro Parada-Mayorga , Alejandro Ribeiro

We consider the problem of sampling from data defined on the nodes of a weighted graph, where the edge weights capture the data correlation structure. As shown recently, using spectral graph theory one can define a cut-off frequency for the…

Information Theory · Computer Science 2014-11-13 Ilan Shomorony , A. Salman Avestimehr

A signal space approach is presented to study the Nyquist sampling, number of degrees of freedom and reconstruction of an electromagnetic field under arbitrary scattering conditions. Conventional signal processing tools, such as the…

Signal Processing · Electrical Eng. & Systems 2022-10-12 Andrea Pizzo , Andrea de Jesus Torres , Luca Sanguinetti , Thomas L. Marzetta

The field of compressed sensing has shown that a sparse but otherwise arbitrary vector can be recovered exactly from a small number of randomly constructed linear projections (or samples). The question addressed in this paper is whether an…

Information Theory · Computer Science 2010-01-26 Galen Reeves , Michael Gastpar

Compressive Sensing (CS) exploits the surprising fact that the information contained in a sparse signal can be preserved in a small number of compressive, often random linear measurements of that signal. Strong theoretical guarantees have…

Information Theory · Computer Science 2014-05-02 Armin Eftekhari , Michael B. Wakin

We study the compressed sensing reconstruction problem for a broad class of random, band-diagonal sensing matrices. This construction is inspired by the idea of spatial coupling in coding theory. As demonstrated heuristically and…

Information Theory · Computer Science 2015-03-19 David L. Donoho , Adel Javanmard , Andrea Montanari

The paper investigates possibility of recovery of sequences from their decimated subsequences. It is shown that this recoverability is associated with certain spectrum degeneracy of a new kind, and that a sequences of a general kind can be…

Information Theory · Computer Science 2017-10-31 Nikolai Dokuchaev

In many signal processing applications, one wishes to acquire images that are sparse in transform domains such as spatial finite differences or wavelets using frequency domain samples. For such applications, overwhelming empirical evidence…

Computer Vision and Pattern Recognition · Computer Science 2013-10-22 Felix Krahmer , Rachel Ward

The distributions of toroidal data, often viewed as an extension of circular distributions, do not consider the intrinsic geometry of a curved torus. For the first time, Diaconis et al. (2013)[Diaconis, P., Holmes, S., & Shahshahani, M.…

Methodology · Statistics 2023-04-05 Buddhananda Banerjee , Surojit Biswas

Compressed sensing theory indicates that selecting a few measurements independently at random is a near optimal strategy to sense sparse or compressible signals. This is infeasible in practice for many acquisition devices that acquire…

Statistics Theory · Mathematics 2013-03-14 Nicolas Chauffert , Philippe Ciuiu , Jonas Kahn , Pierre Weiss

Algorithms for rare event complex systems simulations are proposed. Compressed Sensing (CS) has {\it revolutionized} our understanding of limits in signal recovery and has forced us to re-define Shannon-Nyquist sampling theorem for sparse…

Computational Physics · Physics 2018-04-27 Mehmet Süzen
‹ Prev 1 4 5 6 7 8 10 Next ›