Related papers: Phaseless sampling on square-root lattices
We provide the foundations of a Hilbert space theory for the short-time Fourier transform (STFT) where the flat tori \begin{equation*} \mathbb{T}_{N}^2=\mathbb{R}^2/(\mathbb{Z}\times N\mathbb{Z})=[0,1]\times \lbrack 0,N] \end{equation*} act…
We study the problem of recovering a signal $x\in\mathbb{C}^N$ from samples of its phaseless periodic short-time Fourier transform (STFT): the magnitude of the Fourier transform of the signal multiplied by a sliding window $w\in…
In this paper, we investigate the uniqueness of the phase retrieval problem for the fractional Fourier transform (FrFT) of variable order. This problem occurs naturally in optics and quantum physics. More precisely, we show that if $u$ and…
In this paper, we focus on the approximation of smooth functions $f: [-\pi, \pi] \rightarrow \mathbb{C}$, up to an unresolvable global phase ambiguity, from a finite set of Short Time Fourier Transform (STFT) magnitude (i.e., spectrogram)…
We establish novel uniqueness results for the Gabor phase retrieval problem: if $\mathcal{G} : L^2(\mathbb{R}) \to L^2(\mathbb{R}^2)$ denotes the Gabor transform then every $f \in L^4[-\tfrac{c}{2},\tfrac{c}{2}]$ is determined up to a…
Traditional phase-shifting interferometry technique cannot be used to measure time-varying phase distributions. But single shot techniques could resolve the problem. Many efforts have been made on the phase retrieval methods from a single…
We study the real-time dynamics retrieval from a time series via the time-frequency (TF) analysis with the minimal latency guarantee. While different from the well-known intrinsic latency definition in the filter design, a rigorous…
If the phase retrieval problem can be solved by a method similar to that of solving a system of linear equations under the context of FFT, the time complexity of computer based phase retrieval algorithm would be reduced. Here I present such…
We develop an alternative approach to the study of Fourier series, based on the Short-Time-Fourier Transform (STFT) acting on $L_{\nu }^{2}(0,1)$, the space of measurable functions $f$ in ${R}$, square-integrable in $ (0,1)$, and…
The graph Fourier transform (GFT) is a fundamental tool in graph signal processing and has recently been extended to the graph fractional Fourier transform (GFRFT). Existing sampling methods in the GFRFT domain are primarily designed to…
The realm of classical phase retrieval concerns itself with the arduous task of recovering a signal from its Fourier magnitude measurements, which are fraught with inherent ambiguities. A single-exposure intensity measurement is commonly…
The dependability of power electronics systems, such as three-phase inverters, is critical in a variety of applications. Different types of failures that occur in an inverter circuit might affect system operation and raise the entire cost…
In recent years, the synchrosqueezing transform (SST) has gained popularity as a method for the analysis of signals that can be broken down into multiple components determined by instantaneous amplitudes and phases. One such version of SST,…
Sampled Gabor phase retrieval - the problem of recovering a square-integrable signal from the magnitude of its Gabor transform sampled on a lattice - is a fundamental problem in signal processing, with important applications in areas such…
Sampling theory in fractional Fourier Transform (FrFT) domain has been studied extensively in the last decades. This interest stems from the ability of the FrFT to generalize the traditional Fourier Transform, broadening the traditional…
The short-time Fourier transform (STFT) represents a window of audio samples as a set of complex coefficients. These are advantageously viewed as magnitudes and phases and the overall distribution of phases is very often assumed to be…
Similar to the obstacle or medium scattering problems, an important property of the phaseless far field patterns for source scattering problems is the translation invariance. Thus it is impossible to reconstruct the location of the…
In this work, we introduce a definition of the Discrete Fourier Transform (DFT) on Euclidean lattices in $\R^n$, that generalizes the $n$-th fold DFT of the integer lattice $\Z^n$ to arbitrary lattices. This definition is not applicable for…
Estimation of the Discrete-Time Fourier Transform (DTFT) at points of a finite domain arises in many imaging applications. A new approach to this task, the Golden Angle Linogram Fourier Domain (GALFD), is presented, together with a…
One of the major challenges of employing a dual-frequency phase-shifting algorithm for phase retrieval is its sensitivity to noise. Yun et. al [H Yun, B Li, S Zhang. 2017] proposed a dual-frequency method based on the Fourier transform…