Related papers: On the Injectivity of STFT Phase Retrieval with su…
Background: Windowed Fourier decompositions (WFD) are widely used in measuring stationary and non-stationary spectral phenomena and in describing pairwise relationships among multiple signals. Although a variety of WFDs see frequent…
In this paper we consider Sparse Fourier Transform (SFT) algorithms for approximately computing the best $s$-term approximation of the Discrete Fourier Transform (DFT) $\mathbf{\hat{f}} \in \mathbb{C}^N$ of any given input vector…
This paper develops a novel framework for phase retrieval, a problem which arises in X-ray crystallography, diffraction imaging, astronomical imaging and many other applications. Our approach combines multiple structured illuminations…
We study the problem of recovering an unknown compactly-supported multivariate function from samples of its Fourier transform that are acquired nonuniformly, i.e. not necessarily on a uniform Cartesian grid. Reconstruction problems of this…
The problem of computing the Fourier Transform of a signal whose spectrum is dominated by a small number $k$ of frequencies quickly and using a small number of samples of the signal in time domain (the Sparse FFT problem) has received…
This paper builds upon two key principles behind the Bourgain-Dyatlov quantitative uniqueness theorem for functions with Fourier transform supported in an Ahlfors regular set. We first provide a characterization of when a quantitative…
We consider the problem of recovering a compactly-supported function from a finite collection of pointwise samples of its Fourier transform taking nonuniformly. First, we show that under suitable conditions on the sampling frequencies -…
The paper considers the phase retrieval problem in N-dimensional complex vector spaces. It provides two sets of deterministic measurement vectors which guarantee signal recovery for all signals, excluding only a specific subspace and a…
The Phase Retrieval problem is dealt with for the challenging case where just a single set of (phaseless) radiated field data is available. In particular, even still emulating the solution of crosswords puzzles, we provide decisive…
The windowed quadratic phase Fourier transform (WQPFT) combines the localization capabilities of windowed transforms with the phase modulation structure of the quadratic phase Fourier transform (QPFT). This paper investigates fundamental…
This paper is concerned with stable phase retrieval for a family of phase retrieval models we name "locally stable and conditionally connected" (LSCC) measurement schemes. For every signal $f$, we associate a corresponding weighted graph…
This paper proposes a new framework to regularize the highly ill-posed and non-linear phase retrieval problem through deep generative priors using simple gradient descent algorithm. We experimentally show effectiveness of proposed algorithm…
While spike trains are obviously not band-limited, the theory of super-resolution tells us that perfect recovery of unknown spike locations and weights from low-pass Fourier transform measurements is possible provided that the minimum…
This paper concerns the study of reconstructing a function $f$ in the Hardy space of the unit disc $\D$ from intensity measurements $|f(z)|,\ z\in \D.$ It's known as the problem of phase retrieval. We transform it into solving the…
The singular values of convolutional mappings encode interesting spectral properties, which can be used, e.g., to improve generalization and robustness of convolutional neural networks as well as to facilitate model compression. However,…
Conjugate phase retrieval considers the recovery of a function, up to a unimodular constant and conjugation, from its phaseless measurements. In this paper, we explore the conjugate phase retrieval in a shift-invariant space generated by a…
We develop a unified approach for establishing rates of decay for the Fourier transform of a wide class of dynamically defined measures. Among the key features of the method is the systematic use of the $L^2$-flattening theorem obtained in…
In this paper a deterministic sparse Fourier transform algorithm is presented which breaks the quadratic-in-sparsity runtime bottleneck for a large class of periodic functions exhibiting structured frequency support. These functions…
In this paper, we present an assortment of both standard and advanced Fourier techniques that are useful in the analysis of astrophysical time series of very long duration -- where the observation time is much greater than the time…
Fourier ptychography (FP) is an enabling imaging technique that produces high-resolution complex-valued images with extended field coverages. However, when FP images a phase object with any specific spatial frequency, the captured images…