English
Related papers

Related papers: Sampling Theorem and Discrete Fourier Transform on…

200 papers

A connected homogeneous space X=G/K is called commutative if G is a connected Lie group, $K$ is a compact subgroup and the B*-algebra L^1(X)^K of K-invariant integrable function on X is commutative. In this article we introduce the space…

Functional Analysis · Mathematics 2011-07-25 Jens Gerlach Christensen , Gestur Olafsson

The ability to resolve detail in the object that is being imaged, named by resolution, is the core parameter of an imaging system. Super-resolution is a class of techniques that can enhance the resolution of an imaging system and even…

Data Structures and Algorithms · Computer Science 2022-10-13 Yaonan Jin , Daogao Liu , Zhao Song

Hyperuniformity characterizes a state of matter for which density fluctuations diminish towards zero at the largest length scales. However, the task of determining whether or not an experimental system is hyperuniform is experimentally…

Soft Condensed Matter · Physics 2015-06-22 Remi Dreyfus , Ye Xu , Tim Still , Lawrence A. Hough , A. G. Yodh , Salvatore Torquato

Sonography techniques use multiple transducer elements for tissue visualization. Signals detected at each element are sampled prior to digital beamforming. The sampling rates required to perform high resolution digital beamforming are…

Information Theory · Computer Science 2013-07-25 Tanya Chernyakova , Yonina C. Eldar

Applications such as Magnetic Resonance Tomography acquire imaging data by point samples of their Fourier transform. This raises the question of balancing the efficiency of the sampling strategies with the approximation accuracy of an…

Numerical Analysis · Mathematics 2015-10-20 Gitta Kutyniok , Wang-Q Lim

For a class $F$ of complex-valued functions on a set $D$, we denote by $g_n(F)$ its sampling numbers, i.e., the minimal worst-case error on $F$, measured in $L_2$, that can be achieved with a recovery algorithm based on $n$ function…

Numerical Analysis · Mathematics 2023-05-15 Matthieu Dolbeault , David Krieg , Mario Ullrich

We unify the discrete Fourier transform (DFT), discrete cosine transform (DCT), Walsh-Hadamard, Haar wavelet, Karhunen-Lo\`eve transform, and several others along with their continuous counterparts (Fourier transform, Fourier series,…

Signal Processing · Electrical Eng. & Systems 2026-05-19 Mitchell A. Thornton

Band theory provides the foundation for understanding electronic structure in crystalline materials, but its reliance on exact translational symmetry limits its applicability to systems with defects, disorder, incommensurate modulations, or…

Materials Science · Physics 2026-05-08 Christopher A. Bairnsfather , Ralph M. Kaufmann , Terry A. Loring , Alexander Cerjan

Reconstructing a band-limited function from its finite sample data is a fundamental task in signal analysis. A Gaussian regularized Shannon sampling series has been proved to be able to achieve exponential convergence for uniform sampling.…

Signal Processing · Electrical Eng. & Systems 2022-10-10 Yunfei Yang , Haizhang Zhang

Compressive Sensing (CS) is a new technique for the efficient acquisition of signals, images, and other data that have a sparse representation in some basis, frame, or dictionary. By sparse we mean that the N-dimensional basis…

Information Theory · Computer Science 2015-05-18 Chinmay Hegde , Richard G. Baraniuk

Sampling theories lie at the heart of signal processing devices and communication systems. To accommodate high operating rates while retaining low computational cost, efficient analog-to digital (ADC) converters must be developed. Many of…

Information Theory · Computer Science 2010-10-12 Moslem Rashidi

In the analysis of High-Energy Physics data, it is frequently desired to separate resonant signals from a smooth, non-resonant background. This paper introduces a new technique - functional decomposition (FD) - to accomplish this task. It…

Data Analysis, Statistics and Probability · Physics 2018-05-15 Ryan Edgar , Dante Amidei , Christopher Grud , Karishma Sekhon

The present paper introduces a method for substantial reduction of the number of diffusion encoding gradients required for reliable reconstruction of HARDI signals. The method exploits the theory of compressed sensing (CS), which…

Information Theory · Computer Science 2010-09-21 Oleg Michailovich , Yogesh Rathi , Sudipto Dolui

Compressed sensing (CS) theory assures us that we can accurately reconstruct magnetic resonance images using fewer k-space measurements than the Nyquist sampling rate requires. In traditional CS-MRI inversion methods, the fact that the…

Computer Vision and Pattern Recognition · Computer Science 2018-03-28 Liyan Sun , Zhiwen Fan , Xinghao Ding , Congbo Cai , Yue Huang , John Paisley

We study the recovery of operators with bandlimited Kohn-Nirenberg symbol from the action of such operators on a weighted impulse train, a procedure we refer to as operator sampling. Kailath, and later Kozek and the authors have shown that…

Information Theory · Computer Science 2015-03-03 Götz E. Pfander , David F. Walnut

Sun and Farooq [2] showed that random samples can be efficiently drawn from an arbitrary n-dimensional hyperellipsoid by transforming samples drawn randomly from the unit n-ball. They stated that it was a straightforward to show that, given…

Statistics Theory · Mathematics 2020-07-06 Jonathan D. Gammell , Timothy D. Barfoot

Sampling strategies are important for sparse imaging methodologies, especially those employing the discrete Fourier transform (DFT). Chaotic sensing is one such methodology that employs deterministic, fractal sampling in conjunction with…

Image and Video Processing · Electrical Eng. & Systems 2022-05-23 Jacob M. White , Stuart Crozier , Shekhar S. Chandra

Compressive sensing (CS) has recently emerged as a framework for efficiently capturing signals that are sparse or compressible in an appropriate basis. While often motivated as an alternative to Nyquist-rate sampling, there remains a gap…

Information Theory · Computer Science 2012-03-23 Mark A. Davenport , Michael B. Wakin

Compressed sensing is a theory which guarantees the exact recovery of sparse signals from a small number of linear projections. The sampling schemes suggested by current compressed sensing theories are often of little practical relevance…

Information Theory · Computer Science 2014-07-22 Jérémie Bigot , Claire Boyer , Pierre Weiss

The Special Affine Fourier Transformation or the SAFT generalizes a number of well known unitary transformations as well as signal processing and optics related mathematical operations. Shift-invariant spaces also play an important role in…

Information Theory · Computer Science 2016-01-25 Ayush Bhandari , Ahmed I. Zayed
‹ Prev 1 3 4 5 6 7 10 Next ›