Recovery of Compactly Supported Functions from Spectrogram Measurements via Lifting
Sami Merhi, Aditya Viswanathan, Mark Iwen

TL;DR
This paper introduces a new phase retrieval technique inspired by ptychography, enabling the approximate reconstruction of compactly supported functions from spectrogram data using a lifted formulation and numerical validation.
Contribution
It presents a novel phase retrieval method based on lifting for spectrogram measurements, extending phaseLift ideas to infinite-dimensional functions with practical truncation.
Findings
Numerical experiments show promising reconstruction results.
The method effectively handles infinite-dimensional spectrogram data.
The approach offers a new avenue for phase retrieval in imaging applications.
Abstract
A novel phase retrieval method, motivated by ptychographic imaging, is proposed for the approximate recovery of a compactly supported specimen function from its continuous short time Fourier transform (STFT) spectrogram measurements. The method, partially inspired by the well known PhaseLift algorithm, is based on a lifted formulation of the infinite dimensional problem which is then later truncated for the sake of computation. Numerical experiments demonstrate the promise of the proposed approach.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Recovery of Compactly Supported Functions from Spectrogram Measurements via Lifting
Sami Merhi
Department of Mathematics
Michigan State University
East Lansing, MI 48824, U.S.A.
Email: [email protected]
Aditya Viswanathan
Department of Mathematics
Michigan State University
East Lansing, MI 48824, U.S.A.
Email: [email protected]
Mark Iwen
Dept. of Mathematics and Dept. of Computational
Mathematics, Science and Engineering (CMSE)
Michigan State University
East Lansing, MI 48824, U.S.A.
Email: [email protected]
Abstract
A novel phase retrieval method, motivated by ptychographic imaging, is proposed for the approximate recovery of a compactly supported specimen function from its continuous short time Fourier transform (STFT) spectrogram measurements. The method, partially inspired by the well known PhaseLift [4] algorithm, is based on a lifted formulation of the infinite dimensional problem which is then later truncated for the sake of computation. Numerical experiments demonstrate the promise of the proposed approach.
I Introduction
The problem of signal recovery (up to a global phase) from phaseless STFT measurements appears in many audio engineering and imaging applications. Our principal motivation here, however, is ptychographic imaging (see, e.g., [14, 11]) in the 1-D setting where a compactly supported specimen, , is scanned by a focused illuminating beam which translates across the specimen in fixed overlapping shifts . At each such shift of the beam (or, equivalently, the specimen) a phaseless diffraction image is then sampled in bulk by a detector. Due to the underlying physics the collected measurements are then modeled as sampled STFT magnitude measurements of of the form
[TABLE]
for a finite set of shift and frequency pairs . Our objective is to approximate (up to a global phase) using these measurements.
There has been a good deal of work on signal recovery from phaseless STFT measurements in the last couple of years in the discrete setting, where and are modeled as vectors ab initio, and then recovered from discrete STFT magnitude measurements. In this setting many related recovery techniques have been considered including iterative methods along the lines of Griffin and Lim [12, 18] and alternating projections [11], graph theoretic methods for Gabor frames based on polarization [15, 13], and semidefinite relaxation-based methods [8], among others [5, 2, 7, 6].
Herein we will instead consider the approximate recovery of (as a compactly supported function) from samples of its continuous STFT magnitude measurements as per (I.1). Besides perhaps better matching the continuous models considered in some applications such as ptychography, and allowing one to more naturally consider approaches that utilize, e.g., irregular sampling, we also take recent work on phase retrieval in infinite dimensional Hilbert spaces [19, 3, 1] as motivation for exploring numerical methods to solve this problem.
In particular, the recent work of Daubechies and her collaborators implies that the stability of such continuous phase retrieval problems is generally less well behaved than their discrete counterparts [3, 1]. Specifically, [1] characterizes a class of functions for which infinite dimensional phase retrieval (up to a single global phase) from Gabor measurements is unstable, and then proposes the reconstruction of these worst-case functions up to several local phase multiples as a stable alternative. We take this initial work on stable infinite dimensional phase retrieval from Gabor measurements as a further motivation to explore new fast numerical techniques for the robust recovery of compactly supported functions from their continuous spectrogram measurements.
I-A The Problem Statement and Specifications
Given a vector of stacked spectrogram samples from (I.1),
[TABLE]
our goal is to approximately recover a piecewise smooth and compactly supported function . Of course can only be recovered up to certain ambiguities (such as up to a global phase, etc.) which depend not only on , but also the window function (see, e.g., [1]). Without loss of generality, we will assume that the support of is contained in . Given our motivation from ptychographic imaging we will, herein at least, primarily consider the unshifted beam function to also be (approximately) compactly supported within a smaller subset . Furthermore, we will also assume that is smooth enough that its Fourier transform decays relatively rapidly in frequency space compared to . Examples of such include both suitably scaled Gaussians, as well as compactly supported bump functions [9].
I-B The Proposed Numerical Approach
The proposed method aims to recover samples from the Fourier transform of at frequencies in , giving with , from which can then be approximately recovered via standard sampling theorems (see, e.g., [17]). The inverse Fourier transform of this approximation of then provides our approximation of .
Recovery of the samples from , , is performed in two steps using techniques from [7, 6] adapted to this continuous setting: first, a truncated lifted linear system is inverted in order to learn a portion of the rank-one matrix from a finite set of STFT spectrogram samples, then, an eigenvector based angular synchronization method is used in order to recover from the portion of computed in the first step. Note that this truncated lifted linear system is both banded and Toeplitz, with band size determined by the decay of . If is effectively bandlimited to the proposed lifting-based algorithm can be implemented to run in -time, which is essentially FFT-time in for small .
II Our Lifted Formulation
The following theorem forms the basis of our lifted setup.
Theorem 1**.**
Suppose is piecewise smooth and compactly supported in . Let be supported in for some , with . Then for all ,
[TABLE]
for all shifts .
Proof.
Denote by the right shift of by . The short-time Fourier transform (STFT) [10] of given , at a shift and frequency , is defined by
[TABLE]
The squared magnitude of the Fourier transform above is called a spectrogram measurement:
[TABLE]
where . We calculate
[TABLE]
By Plancherel’s theorem, we have
[TABLE]
where in the last equality we have used
[TABLE]
And so, by Shannon’s Sampling theorem [16], applied to , we see that is equal to
[TABLE]
where denotes convolution.
Recall that so that We calculate the Fourier transform
[TABLE]
and the Fourier transform as
[TABLE]
With this, the spectrogram measurements are given by
[TABLE]
Since is such that , we have that equals
[TABLE]
We have now proven the theorem. ∎
Using Theorem 1 we may now write
[TABLE]
where
II-A Obtaining a Truncated, Finite Lifted Linear System
If decays quickly we may truncate the sums above for a given frequency with minimal error. To that end, we pick the indices and so that and for some fixed . If we denote
[TABLE]
then
[TABLE]
We may write
[TABLE]
where and are the vectors
[TABLE]
This notation allows us to write our measurements in a lifted form
[TABLE]
Here, is the rank-one matrix
[TABLE]
For each , rewrite it as
[TABLE]
so that . Then construct the Toeplitz matrix as
[TABLE]
where is the number of frequencies being considered. Then we construct the block matrix as
[TABLE]
where is the number of shifts of the window .
Let be defined as
[TABLE]
where . Note that is composed of overlapping segments of the rank-1 matrices for . Thus, our measurements can be written as
[TABLE]
where is defined in (I.2). By consistently vectorizing (II.2), we can obtain a simple linear system which can be inverted to learn , a vectorized version of . In particular, we have
[TABLE]
where the matrix can be computed by, e.g., passing the canonical basis elements for , , through (II.2).
We solve the linear system (II.3) as a least squares problem; experiments have shown that is of rank . The process of recovering the Fourier coefficients of from is known as angular synchronization, and is described in detail in [6].
III Numerical Results
We test the Phase Retrieval algorithm above for two different choices of signal . The first is a Gaussian signal , and the second is a modified Gaussian . In both cases, the window used is the Gaussian where is a constant chosen so that .
We use a total of 11 shifts of in each experiment. Since is supported on , any two consecutive shifts are separated by (see Figure III.1). We choose 61 values of from sampled in half-steps, and set .
The reconstructions in physical space are shown at selected grid points in Figures III.2 and III.3. The relative error in physical space is for the first experiment and for the second.
IV Future Work
While this paper addresses the 1D problem, the extension of this method to the 2D setting is an appealing avenue for future research. Indeed, preliminary results indicate that the underlying discrete method that forms the basis for this paper extends to two dimensions without too much difficulty. Furthermore, empirical results suggest that the method proposed here demonstrates robustness to noise, although we defer a detailed analysis (and derivation of an associated robust recovery guarantee) to future work.
Acknowledgement
This work was supported in part by the National Science Foundation grant NSF DMS-1416752.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. Alaifari, I. Daubechies, P. Grohs, and R. Yin. Stable phase retrieval in infinite dimensions. 2016. preprint, ar Xiv:1609.00034.
- 2[2] T. Bendory and Y. C. Eldar. Non-convex phase retrieval from STFT measurements. 2016. preprint, ar Xiv:1607.08218.
- 3[3] J. Cahill, P. Casazza, and I. Daubechies. Phase retrieval in infinite-dimensional Hilbert spaces. Trans. Amer. Math. Soc., Ser. B , 3(3):63–76, 2016.
- 4[4] E. J. Candes, T. Strohmer, and V. Voroninski. Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming. Commun. Pur. Appl. Math. , 66(8):1241–1274, 2013.
- 5[5] Y. C. Eldar, P. Sidorenko, D. G. Mixon, S. Barel, and O. Cohen. Sparse phase retrieval from short-time Fourier measurements. IEEE Signal Process. Lett. , 22(5):638–642, 2015.
- 6[6] M. A. Iwen, B. Preskitt, R. Saab, and A. Viswanathan. Phase retrieval from local measurements: Improved robustness via eigenvector-based angular synchronization. 2016. preprint, ar Xiv:1612.01182.
- 7[7] M. A. Iwen, A. Viswanathan, and Y. Wang. Fast phase retrieval from local correlation measurements. SIAM J. Imaging Sci. , 9(4):1655–1688, 2016.
- 8[8] K. Jaganathan, Y. C. Eldar, and B. Hassibi. STFT phase retrieval: Uniqueness guarantees and recovery algorithms. IEEE J. Sel. Topics Signal Process. , 10(4):770–781, 2016.
