Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Reconstruction Method for Band-Limited Signals on the Hyperbolic Plane
110
0
0.0
(
0
)
Added by
Isaac Pesenson
Publication date
2011
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
A notion of band limited functions is considered in the case of the hyperbolic plane in its Poincare upper half-plane $mathbb{H}$ realization. The concept of band-limitedness is based on the existence of the Helgason-Fourier transform on $mathbb{H}$. An iterative algorithm is presented, which allows to reconstruct band-limited functions from some countable sets of their values. It is shown that for sufficiently dense metric lattices a geometric rate of convergence can be guaranteed as long as the sampling density is high enough compared to the band-width of the sampled function.
rate research
Read More
Reconstructing a band-limited function from its finite sample data is a fundamental task in signal analysis. A simple Gaussian or hyper-Gaussian regularized Shannon sampling series has been proved to be able to achieve exponential convergence for uniform sampling. In this paper, we prove that exponential approximation can also be attained for general nonuniform sampling. The analysis is based on the the residue theorem to represent the truncated error by a contour integral. Several concrete examples of nonuniform sampling with exponential convergence will be presented.
Phaseless reconstruction from space-time samples is a nonlinear problem of recovering a function $x$ in a Hilbert space $mathcal{H}$ from the modulus of linear measurements ${lvert langle x, phi_irangle rvert$, $ ldots$, $lvert langle A^{L_i}x, phi_i rangle rvert : i inmathscr I}$, where ${phi_i; i inmathscr I}subset mathcal{H}$ is a set of functionals on $mathcal{H}$, and $A$ is a bounded operator on $mathcal{H}$ that acts as an evolution operator. In this paper, we provide various sufficient or necessary conditions for solving this problem, which has connections to $X$-ray crystallography, the scattering transform, and deep learning.
We consider the problem of recovering a set of correlated signals (e.g., images from different viewpoints) from a few linear measurements per signal. We assume that each sensor in a network acquires a compressed signal in the form of linear measurements and sends it to a joint decoder for reconstruction. We propose a novel joint reconstruction algorithm that exploits correlation among underlying signals. Our correlation model considers geometrical transformations between the supports of the different signals. The proposed joint decoder estimates the correlation and reconstructs the signals using a simple thresholding algorithm. We give both theoretical and experimental evidence to show that our method largely outperforms independent decoding in terms of support recovery and reconstruction quality.
Correlation coefficient is usually used to measure the correlation degree between two time signals. However, its performance will drop or even fail if the signals are noised. Based on the time-frequency phase spectrum (TFPS) provided by normal time-frequency transform (NTFT), similarity coefficient is proposed to measure the similarity between two non-narrow-band time signals, even if the signals are noised. The basic idea of the similarity coefficient is to translate the interest part of signal f1(t)s TFPS along the time axis to couple with signal f2(t)s TFPS. Such coupling would generate a maximum if f1(t)and f2(t) are really similar to each other in time-frequency structure. The maximum, if normalized, is called similarity coefficient. The location of the maximum indicates the time delay between f1(t) and f2(t). Numerical results show that the similarity coefficient is better than the correlation coefficient in measuring the correlation degree between two noised signals. Precision and accuracy of the time delay estimation (TDE) based on the similarity analysis are much better than those based on cross-correlation (CC) method and generalized CC (GCC) method under low SNR.
We prove a counterpart of the log-convex density conjecture in the hyperbolic plane.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
