English
Related papers

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

200 papers

The problem of minimization of the number of measurements needed for digital image acquisition and reconstruction with a given accuracy is addressed. Basics of the sampling theory are outlined to show that the lower bound of signal sampling…

Computer Vision and Pattern Recognition · Computer Science 2018-03-01 Leonid P. Yaroslavsky

In many applications, the observations can be represented as a signal defined over the vertices of a graph. The analysis of such signals requires the extension of standard signal processing tools. In this work, first, we provide a class of…

Discrete Mathematics · Computer Science 2016-08-24 Mikhail Tsitsvero , Sergio Barbarossa , Paolo Di Lorenzo

This paper introduces Manhattan sampling in two and higher dimensions, and proves sampling theorems. In two dimensions, Manhattan sampling, which takes samples densely along a Manhattan grid of lines, can be viewed as sampling on the union…

Information Theory · Computer Science 2015-02-06 Matthew A. Prelee , David L. Neuhoff

Consider a continuous signal that cannot be observed directly. Instead, one has access to multiple corrupted versions of the signal. The available corrupted signals are correlated because they carry information about the common remote…

Information Theory · Computer Science 2016-12-06 Elaheh Mohammadi , Alireza Fallah , Farokh Marvasti

A class of random recursive sequences (Y_n) with slowly varying variances as arising for parameters of random trees or recursive algorithms leads after normalizations to degenerate limit equations of the form X\stackrel{L}{=}X. For…

Probability · Mathematics 2016-09-07 Ralph Neininger , Ludger Ruschendorf

The paper studies spectral representation and its applications for non-decaying continuous time signals that are not necessarily bounded at $\pm\infty$. The paper introduces notions of transfer functions, spectrum degeneracy, spectrum gaps,…

Information Theory · Computer Science 2025-04-08 Nikolai Dokuchaev

A problem is addressed of minimization of the number of measurements needed for digital image acquisition and reconstruction with a given accuracy. A sampling theory based method of image sampling and reconstruction is suggested that allows…

Computer Vision and Pattern Recognition · Computer Science 2017-05-24 Leonid Yaroslavsky

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ć

We address the problem of reconstructing a multi-band signal from its sub-Nyquist point-wise samples. To date, all reconstruction methods proposed for this class of signals assumed knowledge of the band locations. In this paper, we develop…

Cellular Automata and Lattice Gases · Physics 2007-09-12 Moshe Mishali , Yonina C. Eldar

In the first part of the series papers, we set out to answer the following question: given specific restrictions on a set of samplers, what kind of signal can be uniquely represented by the corresponding samples attained, as the foundation…

Information Theory · Computer Science 2021-08-25 Hanshen Xiao , Yaowen Zhang , Guoqiang Xiao

Sampling theory has traditionally drawn tools from functional and complex analysis. Past successes, such as the Shannon-Nyquist theorem and recent advances in frame theory, have relied heavily on the application of geometry and analysis.…

Algebraic Topology · Mathematics 2014-05-05 Michael Robinson

Compressed Sensing (CS) is an effective approach to reduce the required number of samples for reconstructing a sparse signal in an a priori basis, but may suffer severely from the issue of basis mismatch. In this paper we study the problem…

Information Theory · Computer Science 2014-02-04 Yuejie Chi

This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, which is a composition of a random matrix of certain type and a…

Probability · Mathematics 2010-11-10 Holger Rauhut , Karin Schnass , Pierre Vandergheynst

Compressive sensing is a methodology for the reconstruction of sparse or compressible signals using far fewer samples than required by the Nyquist criterion. However, many of the results in compressive sensing concern random sampling…

Information Theory · Computer Science 2013-06-11 Atul Divekar , Deanna Needell

In this manuscript, we analyze the sparse signal recovery (compressive sensing) problem from the perspective of convex optimization by stochastic proximal gradient descent. This view allows us to significantly simplify the recovery analysis…

Data Structures and Algorithms · Computer Science 2013-04-19 Rong Jin , Tianbao Yang , Shenghuo Zhu

We study the problem of sampling a random signal with sparse support in frequency domain. Shannon famously considered a scheme that instantaneously samples the signal at equispaced times. He proved that the signal can be reconstructed as…

Information Theory · Computer Science 2012-11-22 Adel Javanmard , Andrea Montanari

Periodic nonuniform sampling is a known method to sample spectrally sparse signals below the Nyquist rate. This strategy relies on the implicit assumption that the individual samplers are exposed to the entire frequency range. This…

Information Theory · Computer Science 2009-01-27 Moshe Mishali , Yonina C. Eldar , Joel A. Tropp

Because optical systems have huge bandwidth and are capable of generating low noise short pulses they are ideal for undersampling multi-band signals that are located within a very broad frequency range. In this paper we propose a new scheme…

Optics · Physics 2009-11-13 Amir Rosenthal , Alex Linden , Moshe Horowitz

The spectral theory of quantum graphs is related via an exact trace formula with the spectrum of the lengths of periodic orbits (cycles) on the graphs. The latter is a degenerate spectrum, and understanding its structure (i.e.,finding out…

Mathematical Physics · Physics 2009-11-13 U. Gavish , U. Smilansky

In this chapter, we discuss recent work on learning sparse approximations to high-dimensional functions on data, where the target functions may be scalar-, vector- or even Hilbert space-valued. Our main objective is to study how the…

Numerical Analysis · Mathematics 2022-02-08 Ben Adcock , Juan M. Cardenas , Nick Dexter , Sebastian Moraga
‹ Prev 1 3 4 5 6 7 10 Next ›