Phaseless Sampling on Square-Root Lattices

In the article, we consider the problem of phase retrieval from magnitudes of STFT (short-time Fourier transform) measurements. The uniqueness of STFT phase retrieval had been established when the signal is one-dimensional function. In this article, we investigate the uniqueness of STFT phase retrieval when the signal is a two-dimensional vector function. And we prove the uniqueness theorem of STFT phase retrieval for bandlimited real-valued and complex-valued vector functions, respectively.

Uniqueness of STFT phase retrieval in shift-invariant spaces

Iterative algorithms for phase retrieval from intensity data are compared to gradient search methods. Both the problem of phase retrieval from two intensity measurements (in electron microscopy or wave front sensing) and the problem of phase retrieval from a single intensity measurement plus a non-negativity constraint (in astronomy) are considered, with emphasis on the latter. It is shown that both the error-reduction algorithm for the problem of a single intensity measurement and the Gerchberg-Saxton algorithm for the problem of two intensity measurements converge. The error-reduction algorithm is also shown to be closely related to the steepest-descent method. Other algorithms, including the input-output algorithm and the conjugate-gradient method, are shown to converge in practice much faster than the error-reduction algorithm. Examples are shown.

Phase retrieval problems occur in a wide range of optical systems characterized by different forward path complexities. The Gerchberg–Saxton algorithm deep unrolling technique is a state-of-the-art phase retrieval method. Its inference speed is determined by the complexity of the forward path. We propose FourierGSNet, an efficient Gerchberg–Saxton algorithm deep unrolling method, to achieve faster phase retrieval for applications with high forward path complexities. FourierGSNet does not directly unroll Gerchberg–Saxton iterations with the forward path of the system. Instead, it extracts physics knowledge from unrolled iterations using the Fourier transform as a simplified forward path and injects the knowledge into a cascaded neural network for phase retrieval for the actual system. We evaluated FourierGSNet on three applications with three degrees of complexities: (i) coherent diffractive imaging with Fourier transform as a simple forward path, (ii) near-field X-ray imaging with Fresnel diffraction as a medium-complexity forward path, and (iii) laser beam shaping with the entire simulated optical train as a complex forward path. We compare FourierGSNet with direct unrolling, two fitting methods, and state-of-the-art data-driven methods. Experiments show that FourierGSNet is significantly faster in inference than direct unrolling on high-complexity applications while achieving equal or higher accuracy than compared methods.

We consider the classical 1D phase retrieval problem. In order to overcome the difficulties associated with phase retrieval from measurements of the Fourier magnitude, we treat recovery from the magnitude of the short-time Fourier transform (STFT). We first show that the redundancy offered by the STFT enables unique recovery for arbitrary nonvanishing inputs, under mild conditions. An efficient algorithm for recovery of a sparse input from the STFT magnitude is then suggested, based on an adaptation of the recently proposed GESPAR algorithm. We demonstrate through simulations that using the STFT leads to improved performance over recovery from the oversampled Fourier magnitude with the same number of measurements.

To obtain spatial information about an arbitrary atomic distribution in x-ray structure analysis, e.g. in molecules or proteins, the standard method is to measure the intensity in the far field, i.e. the first-order photon correlation function of the coherently scattered x-ray photons (coherent diffractive imaging). Recently, it was suggested to record alternatively the incoherently scattered photons and measure the second-order photon correlation function to reconstruct the geometry of the unknown atomic distribution (incoherent diffractive imaging). Yet, besides various advantages of the latter method, both techniques suffer from the so-called phase retrieval problem. Lately, an ab-initio phase retrieval algorithm to reconstruct the phase of the so-called structure factor of the scattering objects based on the third-order photon correlation function was reported. The algorithm makes use of the closure phase, which contains important, yet incomplete phase information, well-known from triple correlations and their bispectrum in speckle masking and astronomy applications. Here, we provide a detailed analysis of the underlying scheme and quantities in the context of x-ray structure analysis. In particular, we explicitly calculate for the first time the third-order photon correlation function for single photon emitters in a full quantum mechanical treatment and discuss the uniqueness of the closure phase equations constructed from. In this context, we recapitulate the sign problem of the closure phase and how it can be lifted using redundant information. We further show how the algorithm can be improved using even higher-order photon correlation functions produced by single photon emitters, e.g. the fourth-order correlation function, delivering new phase relations appearing in the four-point correlations.

The classical problem of phase retrieval has found a wide array of applications in optics, imaging and signal processing. In this paper, we consider the phase retrieval problem in a one-bit setting, where the signals are sampled using one-bit analog-to-digital converters (ADCs). A significant advantage of deploying one-bit ADCs in signal processing systems is their superior sampling rates as compared to their high-resolution counterparts. This leads to an enormous amount of one-bit samples gathered at the output of the ADC in a short period of time. We demonstrate that this advantage pays extraordinary dividends when it comes to convex phase retrieval formulations, namely that the often encountered matrix semi-definiteness constraints as well as rank constraints (that are computationally prohibitive to enforce), become redundant for phase retrieval in the face of a growing sample size. Several numerical results are presented to illustrate the effectiveness of the proposed methodologies.

There are several important remote sensing applications where the development of Ground Penetrating Synthetic Aperture Radar (GPENSAR) is the logical approach, e.g., searching for buried military facilities, minefield mapping, survey of underground pipelines. Penetration of sufficient soil depth for useful results require a SAR to operate at VHF/UHF frequencies, e.g., 200 - 300 MHz. At these frequencies a satellite SAR will encounter substantial distortion in the double passage of the SAR signal through the ionosphere. One of the ionospheric distortions is equivalent the phase aberrations caused in imaging through the turbulent atmosphere, and the problem of phase retrieval for the GPENSAR becomes a necessity. For GPENSR there are imaging concepts that exploit dual polarization radiation of the SAR pulse. The phase retrieval problem then becomes one of compensation for the phase aberrations induced in each of the polarization components returned to the satellite receiver. We discuss the use of the two polarizations to cancel the ionospheric phase aberrations. Unfortunately, the resulting signal has only relative phase of the two polarizations. We discuss an algorithm for the retrieval of the absolute phase. The algorithm is based on an optimization approach. Although phase retrieval by optimization is difficult because of local minima, the retrieval of absolute phase in the dual polarization case is substantially less difficult, because the two polarizations constrain the solution sufficiently to eliminate many local minima.

Phase retrieval and coherent diffraction imaging by a linear scanning pinhole sampling array

i»?The problem of phase retrieval, i.e., the recovery of a function given the magnitude of its Fourier transform, arises in various fields of science and engineering, including electron microscopy, crystallography, astronomy, and optical imaging. Exploring phase retrieval in optical settings, specifically when the light originates from a laser, is natural since optical detection devices [e.g., charge-coupled device (CCD) cameras, photosensitive films, and the human eye] cannot measure the phase of a light wave. This is because, generally, optical measurement devices that rely on converting photons to electrons (current) do not allow for direct recording of the phase: the electromagnetic field oscillates at rates of ~1015 Hz, which no electronic measurement device can follow. Indeed, optical measurement/detection systems measure the photon flux, which is proportional to the magnitude squared of the field, not the phase. Consequently, measuring the phase of optical waves (electromagnetic fields oscillating at 1015 Hz and higher) involves additional complexity, typically by requiring interference with another known field, in the process of holography.

Signal recovery from the magnitude of the Fourier transform, or equivalently, from the autocorrelation, is a classical problem known as phase retrieval. Due to the absence of phase information, some form of additional information is required in order to be able to uniquely identify the underlying signal. In this work, we consider the problem of phase retrieval using masks. Due to our interest in developing robust algorithms with theoretical guarantees, we explore a convex optimization-based framework. In this work, we show that two specific masks (each mask provides 2n Fourier magnitude measurements) or five specific masks (each mask provides n Fourier magnitude measurements) are sufficient for a convex relaxation of the phase retrieval problem to provably recover almost all signals (up to global phase). We also show that the recovery is stable in the presence of measurement noise. This is a significant improvement over the existing results, which require O(log2 n) random masks (each mask provides n Fourier magnitude measurements) in order to guarantee unique recovery (up to global phase). Numerical experiments complement our theoretical analysis and show interesting trends, which we hope to explain in a future publication.

Phase-Contrast Tomography (PCT) is becoming an important technique for nondestructive, in-situ characterization of soft and hard condensed matter. This thesis sheds light on our progress in developing novel tomographic reconstruction algorithms in combination with in-situ experimental approaches that employ propagation-based PCT. These developments are aimed to improve the spatial and temporal resolutions of in-situ studies of the soft and hard condensed matter. The mechanical properties of materials such as steel are, to a large extent, defined by its microstructure. Propagation-based PCT (i.e. holotomography) can be used to visualize the microstructures associated with small variations in density or composition in the bulk of the specimen. This imaging technique has the advantage of being non-destructive and allows to carry out in-situ, time-resolved observations of miscrostructural changes during dynamic processes such as solid-state phase transformations. Sufficient spatial and temporal resolution can be achieved only when an extremely bright x-ray source is used. In order to test whether a novel table-top x-ray source, the MIRRORCLE-6X, can be used for implementation of a propagation-based PCT system, we have carried out a series of experiments. The characteristics of a propagation-based PCI system that employs the MIRRORCLE-6X were analyzed. In our further research we have focused on the experiments that could be performed at the European Synchrotron Radiation Facility (ESRF) in Grenoble, France. We reported on the investigation of the cementite microstructure in carbon steel. In this work we present the reconstruction of the three-dimensional morphology of cementite grains in the bulk of steel using a non-destructive imaging technique – x-ray Phase-Contrast Tomography (PCT). Complementary information about the crystalline structure of the ferrite grains surrounding the cementite is obtained using x-ray Diffraction-Contrast Tomography (DCT). The work was continued by a time-resolved x-ray PCT investigation of the austenite grain growth during the ferrite-to-austenite phase transformation in low-carbon steel. Experimental data allows to visualize the evolution of the three-dimensional morphology of the austenite-ferrite interfaces with a spatial resolution on the order of 1 ?m and a time resolution of less than 9 minutes. The in-situ measurements show that the theory for grain growth during diffusional solid-state phase transformations needs to be extended in order to describe the drastically lower mobility that we observed for flat interfaces compared to curved interfaces. We observe that some flat interfaces are completely immobile, which is not predicted by the state-of-the-art theories and showed - for the first time - that new computational model for grain growth are needed. Quantitative image reconstruction based on PCT data requires solving two inverse problems: phase retrieval and tomographic reconstruction. In most cases, the problem of phase retrieval is ill-posed and requires that some type of a prior knowledge about the reconstructed image (i.e. particular regularization method) is used. We present a novel algebraic approach suitable for phase retrieval using various linear models. In this approach Total Variation (TV) minimization is used for regularization of the linearized inverse problem by promoting the solution with a sparse gradient magnitude (i.e. piece-wise constant solution). In that case prior knowledge about the reconstructed image may allow to (partially) recover the unknown spatial frequencies that are undefined by the experimental data. The problem of tomographic reconstruction based on PCT data can be solved using a similar approach. We conclude our investigation of the image reconstruction algorithms by introducing several algebraic approaches suitable for tomographic reconstruction based on PCT data. In these approaches TV minimization is used to find a regularized solution to an underdetermined linear system based on a linearized representation of the PCT. When the density of the reconstructed object is piece-wise constant (or close to it) a virtually artifact-free solution can be computed for the tomographic problem. The proposed approach can also be used to radically improve the accuracy of the tomographic reconstruction based on incomplete data (e.g. small number of projections) or data with low signal to noise ratio.

The problem of phase retrieval is revisited and studied from a fresh perspective. In particular, we establish a connection between the phase retrieval problem and the sensor network localization problem, which allows us to utilize the vast theoretical and algorithmic literature on the latter to tackle the former. Leveraging this connection, we develop a two-stage algorithm for phase retrieval that can provably recover the desired signal. In both sparse and dense settings, our proposed algorithm improves upon prior approaches simultaneously in the number of required measurements for recovery and the reconstruction time. We present numerical results to corroborate our theory and to demonstrate the efficiency of the proposed algorithm. As a side result, we propose a new form of phase retrieval problem and connect it to the complex rigidity theory proposed by Gortler and Thurston (in: Connelly R, Ivic Weiss A, Whiteley W (eds) Rigidity and symmetry, Springer, New York, pp 131–154, 2014).

Coherent diffraction imaging (CDI) is a powerful method for visualizing the structure of an object with a high spatial resolution that exceeds the performance limits of the lens. Single-frame CDI in the X-ray region has potential use for probing dynamic phenomena with a high spatiotemporal resolution. Here, we experimentally demonstrate a general method for single-frame X-ray CDI using a triangular aperture and a Fresnel zone plate. Using 5 keV synchrotron radiation X-rays, we reconstructed the object image of the locally illuminated area with a spatial resolution of higher than 50 nm and an exposure time of more than 0.1 s without prior information about the sample. After a 10 s exposure, a resolution of 17 nm was achieved. The present method opens new frontiers in the study of dynamics at the nanoscale by using next-generation synchrotron radiation X-rays/free-electron lasers as light sources.

The problem of phase retrieval underlies various imaging methods from astronomy to nanoscale imaging. Traditional phase retrieval methods are iterative and are therefore computationally expensive. Deep learning (DL) models have been developed to either provide learned priors or completely replace phase retrieval. However, such models require vast amounts of labeled data, which can only be obtained through simulation or performing computationally prohibitive phase retrieval on experimental datasets. Using 3D X-ray Bragg coherent diffraction imaging (BCDI) as a representative technique, we demonstrate AutoPhaseNN, a DL-based approach which learns to solve the phase problem without labeled data. By incorporating the imaging physics into the DL model during training, AutoPhaseNN learns to invert 3D BCDI data in a single shot without ever being shown real space images. Once trained, AutoPhaseNN can be effectively used in the 3D BCDI data inversion about 100× faster than iterative phase retrieval methods while providing comparable image quality.