Abstract: 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.

Abstract: Phase retrieval problems involve solving linear equations, but with missing sign (or phase, for complex numbers) information. More than four decades after it was first proposed, the seminal error reduction algorithm of Gerchberg and Saxton and Fienup is still the popular choice for solving many variants of this problem. The algorithm is based on alternating minimization; i.e., it alternates between estimating the missing phase information, and the candidate solution. Despite its wide usage in practice, no global convergence guarantees for this algorithm are known. In this paper, we show that a (resampling) variant of this approach converges geometrically to the solution of one such problem—finding a vector $\bf x$ from ${\bf y}, {\bf A}$ , where ${\bf y} = \vert {\bf A}^T{\bf x}\vert$ and $\vert{\bf z}\vert$ denotes a vector of element-wise magnitudes of ${\bf z}$ —under the assumption that $ {\bf A}$ is Gaussian. Empirically, we demonstrate that alternating minimization performs similar to recently proposed convex techniques for this problem (which are based on “lifting” to a convex matrix problem) in sample complexity and robustness to noise. However, it is much more efficient and can scale to large problems. Analytically, for a resampling version of alternating minimization, we show geometric convergence to the solution, and sample complexity that is off by log factors from obvious lower bounds. We also establish close to optimal scaling for the case when the unknown vector is sparse. Our work represents the first theoretical guarantee for alternating minimization (albeit with resampling) for any variant of phase retrieval problems in the non-convex setting.

Abstract: 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, cal...

Abstract: Phase retrieval seeks to recover a signal $$x \in {\mathbb {C}}^p$$ x ? C p from the amplitude $$|A x|$$ | A x | of linear measurements $$Ax \in {\mathbb {C}}^n$$ A x ? C n . We cast the phase retrieval problem as a non-convex quadratic program over a complex phase vector and formulate a tractable relaxation (called PhaseCut) similar to the classical MaxCut semidefinite program. We solve this problem using a provably convergent block coordinate descent algorithm whose structure is similar to that of the original greedy algorithm in Gerchberg and Saxton (Optik 35:237---246, 1972), where each iteration is a matrix vector product. Numerical results show the performance of this approach over three different phase retrieval problems, in comparison with greedy phase retrieval algorithms and matrix completion formulations.

Abstract: Realizing high resolution across large volumes is challenging for 3D imaging techniques with high-speed acquisition. Here, we describe a new method for 3D intensity and phase recovery from 4D light field measurements, achieving enhanced resolution via Fourier ptychography. Starting from geometric optics light field refocusing, we incorporate phase retrieval and correct diffraction artifacts. Further, we incorporate dark-field images to achieve lateral resolution beyond the diffraction limit of the objective (5× larger NA) and axial resolution better than the depth of field, using a low-magnification objective with a large field of view. Our iterative reconstruction algorithm uses a multislice coherent model to estimate the 3D complex transmittance function of the sample at multiple depths, without any weak or single-scattering approximations. Data are captured by an LED array microscope with computational illumination, which enables rapid scanning of angles for fast acquisition. We demonstrate the method with thick biological samples in a modified commercial microscope, indicating the technique’s versatility for a wide range of applications.

Abstract: Optical tomography has been widely investigated for biomedical imaging applications. In recent years optical tomography has been combined with digital holography and has been employed to produce high-quality images of phase objects such as cells. In this paper we describe a method for imaging 3D phase objects in a tomographic configuration implemented by training an artificial neural network to reproduce the complex amplitude of the experimentally measured scattered light. The network is designed such that the voxel values of the refractive index of the 3D object are the variables that are adapted during the training process. We demonstrate the method experimentally by forming images of the 3D refractive index distribution of Hela cells.

Abstract: Illumination-based differential phase contrast (DPC) is a phase imaging method that uses a pair of images with asymmetric illumination patterns. Distinct from coherent techniques, DPC relies on spatially partially coherent light, providing 2× better lateral resolution, better optical sectioning and immunity to speckle noise. In this paper, we derive the 2D weak object transfer function (WOTF) and develop a quantitative phase reconstruction method that is robust to noise. The effect of spatial coherence is studied experimentally, and multiple-angle DPC is shown to provide improved frequency coverage for more stable phase recovery. Our method uses an LED array microscope to achieve real-time (10 Hz) quantitative phase imaging with in vitro live cell samples.

Abstract: Fourier ptychography is a new computational microscopy technique that provides gigapixel-scale intensity and phase images with both wide field-of-view and high resolution. By capturing a stack of low-resolution images under different illumination angles, an inverse algorithm can be used to computationally reconstruct the high-resolution complex field. Here, we compare and classify multiple proposed inverse algorithms in terms of experimental robustness. We find that the main sources of error are noise, aberrations and mis-calibration (i.e. model mis-match). Using simulations and experiments, we demonstrate that the choice of cost function plays a critical role, with amplitude-based cost functions performing better than intensity-based ones. The reason for this is that Fourier ptychography datasets consist of images from both brightfield and darkfield illumination, representing a large range of measured intensities. Both noise (e.g. Poisson noise) and model mis-match errors are shown to scale with intensity. Hence, algorithms that use an appropriate cost function will be more tolerant to both noise and model mis-match. Given these insights, we propose a global Newton’s method algorithm which is robust and accurate. Finally, we discuss the impact of procedures for algorithmic correction of aberrations and mis-calibration.

Abstract: In phase retrieval, the goal is to recover a signal x ∈ C N from the magnitudes of linear measurements Ax ∈ C M . While recent theory has established that M ≈ 4N intensity measurements are necessary and sufficient to recover generic x, there is great interest in reducing the number of measurements through the exploitation of sparse \mbi x, which is known as compressive phase retrieval. In this work, we detail a novel, probabilistic approach to compressive phase retrieval based on the generalized approximate message passing (GAMP) algorithm. We then present a numerical study of the proposed PR-GAMP algorithm, demonstrating its excellent phase-transition behavior, robustness to noise, and runtime. Our experiments suggest that approximately M ≥ 2 Klog 2 (N/K) intensity measurements suffice to recover K-sparse Bernoulli-Gaussian signals for \mbi A with i.i.d Gaussian entries and K ≪ N. Meanwhile, when recovering a 6678-sparse 65536-pixel grayscale image from 32768 randomly masked and blurred Fourier intensity measurements at 30 dB measurement SNR, PR-GAMP achieved an output SNR of no less than 28 dB in all of 100 random trials, with a median runtime of only 7.3 seconds. Compared to the recently proposed CPRL, sparse-Fienup, and GESPAR algorithms, our experiments suggest that PR-GAMP has a superior phase transition and orders-of-magnitude faster runtimes as the sparsity and problem dimensions increase.

Abstract: Statistical inference and information processing of high-dimensional data often require an efficient and accurate estimation of their second-order statistics. With rapidly changing data, limited processing power and storage at the acquisition devices, it is desirable to extract the covariance structure from a single pass over the data and a small number of stored measurements. In this paper, we explore a quadratic (or rank-one) measurement model which imposes minimal memory requirements and low computational complexity during the sampling process, and is shown to be optimal in preserving various low-dimensional covariance structures. Specifically, four popular structural assumptions of covariance matrices, namely, low rank, Toeplitz low rank, sparsity, jointly rank-one and sparse structure, are investigated, while recovery is achieved via convex relaxation paradigms for the respective structure. The proposed quadratic sampling framework has a variety of potential applications, including streaming data processing, high-frequency wireless communication, phase space tomography and phase retrieval in optics, and noncoherent subspace detection. Our method admits universally accurate covariance estimation in the absence of noise, as soon as the number of measurements exceeds the information theoretic limits. We also demonstrate the robustness of this approach against noise and imperfect structural assumptions. Our analysis is established upon a novel notion called the mixed-norm restricted isometry property (RIP- $\ell _{2}/\ell _{1}$ ), as well as the conventional RIP- $\ell _{2}/\ell _{2}$ for near-isotropic and bounded measurements. In addition, our results improve upon the best-known phase retrieval (including both dense and sparse signals) guarantees using PhaseLift with a significantly simpler approach.

Abstract: This paper investigates experimental means of measuring the transmission matrix (TM) of a highly scattering medium, with the simplest optical setup. Spatial light modulation is performed by a digital micromirror device (DMD), allowing high rates and high pixel counts but only binary amplitude modulation. We used intensity measurement only, thus avoiding the need for a reference beam. Therefore, the phase of the TM has to be estimated through signal processing techniques of phase retrieval. Here, we compare four different phase retrieval principles on noisy experimental data. We validate our estimations of the TM on three criteria : quality of prediction, distribution of singular values, and quality of focusing. Results indicate that Bayesian phase retrieval algorithms with variational approaches provide a good tradeoff between the computational complexity and the precision of the estimates.

Abstract: Fourier ptychography is a new computational microscopy technique that provides gigapixel-scale intensity and phase images with both wide field-of-view and high resolution. By capturing a stack of low-resolution images under different illumination angles, a nonlinear inverse algorithm can be used to computationally reconstruct the high-resolution complex field. Here, we compare and classify multiple proposed inverse algorithms in terms of experimental robustness. We find that the main sources of error are noise, aberrations and mis-calibration (i.e. model mis-match). Using simulations and experiments, we demonstrate that the choice of cost function plays a critical role, with amplitude-based cost functions performing better than intensity-based ones. The reason for this is that Fourier ptychography datasets consist of images from both brightfield and darkfield illumination, representing a large range of measured intensities. Both noise (e.g. Poisson noise) and model mis-match errors are shown to scale with intensity. Hence, algorithms that use an appropriate cost function will be more tolerant to both noise and model mis-match. Given these insights, we propose a global Newton's method algorithm which is robust and computationally efficient. Finally, we discuss the impact of procedures for algorithmic correction of aberrations and mis-calibration.

Abstract: Recently Fourier Ptychography (FP) has attracted great attention, due to its marked effectiveness in leveraging snapshot numbers for spatial resolution in large field-of-view imaging. To acquire high signal-to-noise-ratio (SNR) images under angularly varying illuminations for subsequent reconstruction, FP requires long exposure time, which largely limits its practical applications. In this paper, based on the recently reported Wirtinger flow algorithm, we propose an iterative optimization framework incorporating phase retrieval and noise relaxation together, to realize FP reconstruction using low SNR images captured under short exposure time. Experiments on both synthetic and real captured data validate the effectiveness of the proposed reconstruction method. Specifically, the proposed technique could save ~ 80% exposure time to achieve similar retrieval accuracy compared to the conventional FP. Besides, we have released our source code for non-commercial use.

Abstract: This paper investigates experimental means of measuring the transmission matrix (TM) of a highly scattering medium, with the simplest optical setup. Spatial light modulation is performed by a digital micromirror device (DMD), allowing high rates and high pixel counts but only binary amplitude modulation. On the sensor side, without a reference beam, the CCD camera provides only intensity measurements. Within this framework, this paper shows that the TM can still be retrieved, through signal processing techniques of phase retrieval. This is experimentally validated on three criteria : quality of prediction, distribution of singular values, and quality of focusing.

Abstract: This paper makes use of Hilbert transform to analyze and compensate the phase error caused by the nonlinear effect in phase shifting profilometry (PSP). The characteristics of the phase error distribution in Hilbert transform domain was analyzed and compared with spatial domain. A simple and flexible phase error compensation method was proposed to directly process the phase-shifting fringe images without any auxiliary conditions or complicated computation. Experimental results demonstrated that the phase error can be reduced by about 80% in three-step PSP, and more than 95% in four or more step PSP, which verified the effectiveness, flexibility, robustness and automation of the proposed phase error compensation method.

Abstract: Two modified Gerchberg–Saxton (GS) iterative phase retrieval algorithms are proposed. The first we refer to as the spatial phase perturbation GS algorithm (SPP GSA). The second is a combined GS hybrid input–output algorithm (GS/HIOA). In this paper (Part I), it is demonstrated that the SPP GS and GS/HIO algorithms are both much better at avoiding stagnation during phase retrieval, allowing them to successfully locate superior solutions compared with either the GS or the HIO algorithms. The performances of the SPP GS and GS/HIO algorithms are also compared. Then, the error reduction (ER) algorithm is combined with the HIO algorithm (ER/HIOA) to retrieve the input object image and the phase, given only some knowledge of its extent and the amplitude in the Fourier domain. In Part II, the algorithms developed here are applied to carry out known plaintext and ciphertext attacks on amplitude encoding and phase encoding double random phase encryption systems. Significantly, ER/HIOA is then used to carry out a ciphertext-only attack on AE DRPE systems.

Abstract: The classical iterative phase retrieval method has the disadvantages of poor anti-noise performance,and can not converge to the global optimal solution.The optimization of phase retrieval technology via PhaseCut(PC)transforms the phase retrieval problem into quadratic constrained convex programming problem,and gets the global optimal solution up to global phase.Some more structured and less random ternary masks and octonary masks are used to code the signal of interest to acquire diffraction patterns which can recover the missing phase information by solving PhaseCut.Simulations are firstly performed to test the one dimensional complex signal and compare the success rates of reconstruction using different masks.Secondly,the reconstruction results of two dimensional molecular images are compared for different masks.The results show that the method can obtain better reconstruction results than the traditional method which is based on binary masks.Moreover,the recovered phase distributions are loaded to the optical reconstruction system based on liquid crystal on silicon(LCOS).The diffraction pattern of real experiment proves the effectiveness of the proposed method.

Abstract: A phase unwrapping algorithm for interferometric fringes based on the unscented Kalman filter (UKF) technique is proposed. The algorithm can bring about accurate phase unwrapping and good noise suppression simultaneously by incorporating the true phase and its derivative in the state vector estimation through the UKF process. Simulations indicate that the proposed algorithm has better accuracy than some widely employed phase unwrapping approaches in the same noise condition. Also, the time consumption of the algorithm is reasonably acceptable. Applications of the algorithm in our different optical interferometer systems are provided to demonstrate its practicability with good performance. We hope this algorithm can be a practical approach that can help to reduce the systematic errors significantly induced by phase unwrapping process for interferometric measurements such as wavefront distortion testing, surface figure testing of optics, etc.

Abstract: In this Letter, a proposal addressing the problem of two-dimensional phase unwrapping based on the theory of residues is presented. Here, wrapped phase maps with shifted phase jumps are used to balance residue charges. With this approach, we seek to minimize processing time and residue connection, which is essential in the development of branch-cut algorithms. Finally, a phase-unwrapping algorithm is applied to these wrapped maps, generated by Fourier transform profilometry to obtain three-dimensional profiles of objects illuminated by photorefractive moire-like patterns generated in an experiment of real-time dynamic holography, and by fringe patterns generated with a Michelson interferometer.

Abstract: For the iterative phase retrieval, multiple measured intensity images in output plane are only considered for accelerating the convergence. The amplitude and phase at the observed object plane of measurement system are unknown in this research. The observing system is composed of gyrator transform, in which several images are recorded by using several transform angles for the same input image. An amplitude-phase retrieval scheme is designed and tested. The numerical simulations have demonstrated that the amplitude and phase pattern within a very small error (less than 0.04 and 0.0005 for an 8-bit two-dimensional data) can be recovered after 1000 iterations.

Abstract: Addition of random phase to the object light is required in computer-generated holograms (CGHs) to widely diffuse the object light and to avoid its concentration on the CGH; however, this addition causes considerable speckle noise in the reconstructed image. For improving the speckle noise problem, techniques such as iterative phase retrieval algorithms and multi-random phase method are used; however, they are time consuming and are of limited effectiveness. Herein, we present a simple and computationally inexpensive method that drastically improves the image quality and reduces the speckle noise by multiplying the object light with the virtual convergence light. Feasibility of the proposed method is shown using simulations and optical reconstructions; moreover, we apply it to lens-less zoom-able holographic projection. The proposed method is useful for the speckle problems in holographic applications.

Abstract: We demonstrate a digital holographic setup for Terahertz imaging of surfaces in reflection. The set-up is based on a high-power continuous wave (CW) THz laser and a high-resolution (640 × 480 pixel) bolometer detector array. Wave propagation to non-parallel planes is used to reconstruct the object surface that is rotated relative to the detector plane. In addition we implement synthetic aperture methods for resolution enhancement and compare Fourier transform phase retrieval to phase stepping methods. A lateral resolution of 200 μm and a relative phase sensitivity of about 0.4 rad corresponding to a depth resolution of 6 μm are estimated from reconstructed images of two specially prepared test targets, respectively. We highlight the use of digital THz holography for surface profilometry as well as its potential for video-rate imaging.

Abstract: In order to overcome the limitations of the sequential phase-shifting fringe pattern profilometry for dynamic measurements, a color-channel-based approach is presented. The proposed technique consists of projecting and acquiring a colored image formed by three sinusoidal phase-shifted patterns. Therefore, by using the conventional three-step phase-shifting algorithm, only one color image is required for phase retrieval each time. However, the use of colored fringe patterns leads to a major problem, the color crosstalk, which introduces phase errors when conventional phase-shifting algorithms with fixed phase-shift values are utilized to retrieve the phase. To overcome the crosstalk issue, we propose the use of a generalized phase-shifting algorithm with arbitrary phase-shift values. The simulations and experimental results show that the proposed algorithm can significantly reduce the influence of the color crosstalk.

Abstract: Although the field of quantitative phase imaging (QPI) has wide-ranging biomedical applicability, many QPI methods are not well-suited for such applications due to their reliance on coherent illumination and specialized hardware. By contrast, methods utilizing partially coherent illumination have the potential to promote the widespread adoption of QPI due to their compatibility with microscopy, which is ubiquitous in the biomedical community. Described herein is a new defocus-based reconstruction method that utilizes a small number of efficiently sampled micrographs to optimally invert the partially coherent phase optical transfer function under assumptions of weak absorption and slowly varying phase. Simulation results are provided that compare the performance of this method with similar algorithms and demonstrate compatibility with large phase objects. The accuracy of the method is validated experimentally using a microlens array as a test phase object. Lastly, time-lapse images of live adherent cells are obtained with an off-the-shelf microscope, thus demonstrating the new method's potential for extending QPI capability widely in the biomedical community.

Abstract: Coherent anti-Stokes Raman scattering (CARS) microspectroscopy has demonstrated significant potential for biological and materials imaging. To date, however, the primary mechanism of disseminating CARS spectroscopic information is through pseudocolor imagery, which explicitly neglects a vast majority of the hyperspectral data. Furthermore, current paradigms in CARS spectral processing do not lend themselves to quantitative sample-to-sample comparability. The primary limitation stems from the need to accurately measure the so-called nonresonant background (NRB) that is used to extract the chemically-sensitive Raman information from the raw spectra. Measurement of the NRB on a pixel-by-pixel basis is a nontrivial task; thus, reference NRB from glass or water are typically utilized, resulting in error between the actual and estimated amplitude and phase. In this manuscript, we present a new methodology for extracting the Raman spectral features that significantly suppresses these errors through phase detrending and scaling. Classic methods of error-correction, such as baseline detrending, are demonstrated to be inaccurate and to simply mask the underlying errors. The theoretical justification is presented by re-developing the theory of phase retrieval via the Kramers-Kronig relation, and we demonstrate that these results are also applicable to maximum entropy method-based phase retrieval. This new error-correction approach is experimentally applied to glycerol spectra and tissue images, demonstrating marked consistency between spectra obtained using different NRB estimates, and between spectra obtained on different instruments. Additionally, in order to facilitate implementation of these approaches, we have made many of the tools described herein available free for download.

Abstract: We propose a robust and efficient approach to the problem of compressive phase retrieval in which the goal is to reconstruct a sparse vector from the magnitude of a number of its linear measurements. The proposed framework relies on constrained sensing vectors and a two-stage reconstruction method that consists of two standard convex programs that are solved sequentially. In recent years, various methods are proposed for compressive phase retrieval, but they have suboptimal sample complexity or lack robustness guarantees. The main obstacle has been that there is no straightforward convex relaxations for the type of structure in the target. Given a set of underdetermined measurements, there is a standard framework for recovering a sparse matrix, and a standard framework for recovering a low-rank matrix. However, a general, efficient method for recovering a jointly sparse and low-rank matrix has remained elusive. Deviating from the models with generic measurements, in this paper we show that if the sensing vectors are chosen at random from an incoherent subspace, then the low-rank and sparse structures of the target signal can be effectively decoupled. We show that a recovery algorithm that consists of a low-rank recovery stage followed by a sparse recovery stage will produce an accurate estimate of the target when the number of measurements is $\mathsf{O}(k\,\log\frac{d}{k})$, where $k$ and $d$ denote the sparsity level and the dimension of the input signal. We also evaluate the algorithm through numerical simulation.

Abstract: In this work, we propose using camera arrays coupled with coherent illumination as an effective method of improving spatial resolution in long distance images by a factor of ten and beyond. Recent advances in ptychography have demonstrated that one can image beyond the diffraction limit of the objective lens in a microscope. We demonstrate a similar imaging system to image beyond the diffraction limit in long range imaging. We emulate a camera array with a single camera attached to an X-Y translation stage. We show that an appropriate phase retrieval based reconstruction algorithm can be used to effectively recover the lost high resolution details from the multiple low resolution acquired images. We analyze the effects of noise, required degree of image overlap, and the effect of increasing synthetic aperture size on the reconstructed image quality. We show that coherent camera arrays have the potential to greatly improve imaging performance. Our simulations show resolution gains of 10x and more are achievable. Furthermore, experimental results from our proof-of-concept systems show resolution gains of 4x-7x for real scenes. Finally, we introduce and analyze in simulation a new strategy to capture macroscopic Fourier Ptychography images in a single snapshot, albeit using a camera array.