December 3, 2015
We propose an information-theoretic framework for analog signal separation. Specifically, we consider the problem of recovering two analog signals, modeled as general random vectors, from the noiseless sum of linear measurements of the signals. Our framework is inspired by the groundbreaking work of Wu and Verd\'u (2010) on analog compression and encompasses, inter alia, inpainting, declipping, super-resolution, the recovery of signals corrupted by impulse noise, and the sepa...
September 25, 2024
The main result of this thesis is an efficient protocol to determine the frequencies of a signal $C(t)= \sum_k |a_k|^2 e^{i \omega_k t}$, which is given for a finite time, to a high degree of precision. Specifically, we develop a theorem that provides a fundamental precision guarantee. Additionally, we establish an approximation theory for spectral analysis through low-dimensional subspaces that can be applied to a wide range of problems. The signal processing routine relies ...
May 13, 2008
In this paper, we generalise Hardy's uncertainty principle to vector-valued functions, and hence to operators. The principle for operators can be formulated loosely by saying that the kernel of an operator cannot be localised near the diagonal if the spectrum is also localised.
July 18, 2022
Time-frequency localization operators (with Gaussian window) $L_F:L^2(\mathbb{R}^d)\to L^2(\mathbb{R}^d)$, where $F$ is a weight in $\mathbb{R}^{2d}$, were introduced in signal processing by I. Daubechies in 1988, inaugurating a new, geometric, phase-space perspective. Sharp upper bounds for the norm (and the singular values) of such operators turn out to be a challenging issue with deep applications in signal recovery, quantum physics and the study of uncertainty principles....
November 11, 1999
We demonstrate that the Dirac representation theory can be effectively adjusted and applied to signal theory. The main emphasis is on orthogonality as the principal physical requirement. The particular role of the identity and projection operators is stressed. A Dirac space is defined, which is spanned by an orthonormal basis labeled with the time points. An infinite number of orthonormal bases is found which are labeled with frequencies, they are distinguished by the continu...
October 10, 2018
The Weinstein operator has several applications in pure and applied Mathematics especially in Fluid Mechanics and satisfies some uncertainty principles similar to the Euclidean Fourier transform. The aim of this paper is establish a generalization of uncertainty principles for Weinstein transform in $L_\alpha^p$-norm. Firstly, we extend the Heisenberg-Pauli-Weyl uncertainty principle to more general case. Then we establish three continuous uncertainty principles of concentrat...
July 24, 2013
By use of window functions, time-frequency analysis tools like Short Time Fourier Transform overcome a shortcoming of the Fourier Transform and enable us to study the time- frequency characteristics of signals which exhibit transient os- cillatory behavior. Since the resulting representations depend on the choice of the window functions, it is important to know how they influence the analyses. One crucial question on a window function is how accurate it permits us to analyze ...
July 10, 2023
In the work of Donoho and Stark, they study a manifestation of the uncertainty principle in signal recovery. They conjecture that, for a function with support of bounded size T, the maximum concentration of its Fourier transform in the low frequencies [-W/2,W/2] is achieved when the support of the function is an interval. They are able to prove a positive result under the extra assumption that WT $\leq$ 0.8, using an inequality with symmetric rearrangements. In our work, we p...
August 29, 2006
We establish an operator-theoretic uncertainty principle over arbitrary compact groups, generalizing several previous results. As a consequence, we show that if f is in L^2(G), then the product of the measures of the supports of f and its Fourier transform ^f is at least 1; here, the dual measure is given by the sum, over all irreducible representations V, of d_V rank(^f(V)). For finite groups, our principle implies the following: if P and R are projection operators on the gr...
December 2, 2015
In many applications, from sensor to social networks, gene regulatory networks or big data, observations can be represented as a signal defined over the vertices of a graph. Building on the recently introduced Graph Fourier Transform, the first contribution of this paper is to provide an uncertainty principle for signals on graph. As a by-product of this theory, we show how to build a dictionary of maximally concentrated signals on vertex/frequency domains. Then, we establish...