Related papers: Frame Phase-retrievability and Exact phase-retriev…

This work takes the first steps towards solving the "phaseless subspace tracking" (PST) problem. PST involves recovering a time sequence of signals (or images) from phaseless linear projections of each signal under the following structural…

In this manuscript we demonstrate a method to reconstruct the wavefront of focused beams from a measured diffraction pattern behind a diffracting mask in real-time. The phase problem is solved by means of a neural network, which is trained…

We introduce the natural notion of a matching frame in a $2$-dimensional string. A matching frame in a $2$-dimensional $n\times m$ string $M$, is a rectangle such that the strings written on the horizontal sides of the rectangle are…

We study theoretical limits of \emph{descending} phase retrieval algorithms. Utilizing \emph{Random duality theory} (RDT) we develop a generic program that allows statistical characterization of various algorithmic performance metrics.…

Sublinear time complexity is required by the massively parallel computation (MPC) model. Breaking dynamic programs into a set of sparse dynamic programs that can be divided, solved, and merged in sublinear time. The rectangle escape problem…

The mutual intensity and its equivalent phase-space representations quantify an optical field's state of coherence and are important tools in the study of light propagation and dynamics, but they can only be estimated indirectly from…

This paper considers the robust phase retrieval problem, which can be cast as a nonsmooth and nonconvex optimization problem. We propose a new inexact proximal linear algorithm with the subproblem being solved inexactly. Our contributions…

Determining the phase of a wave from intensity measurements has many applications in fields such as electron microscopy, visible light optics, and medical imaging. Propagation based phase retrieval, where the phase is obtained from…

Real-valued Phase retrieval is a non-convex continuous inference problem, where a high-dimensional signal is to be reconstructed from a dataset of signless linear measurements. Focusing on the noiseless case, we aim to disentangle the two…

This paper is concerned with achieving optimal coherence for highly redundant real unit-norm frames. As the redundancy grows, the number of vectors in the frame becomes too large to admit equiangular arrangements. In this case, other…

Characterizing the phase space distribution of particle beams in accelerators is a central part of accelerator understanding and performance optimization. However, conventional reconstruction-based techniques either use simplifying…

We study a class of real robust phase retrieval problems under a Gaussian assumption on the coding matrix when the received signal is sparsely corrupted by noise. The goal is to establish conditions on the sparsity under which the input…

A topological phase is a phase of matter which cannot be characterized by a local order parameter. It has been shown that gapped phases in 1D systems can be completely characterized using tools related to projective representations of the…

The phase retrieval problem in the presence of noise aims to recover the signal vector of interest from a set of quadratic measurements with infrequent but arbitrary corruptions, and it plays an important role in many scientific…

Let $\mathbb{F}$ be a field, and $n \geq p \geq r>0$ be integers. In a recent article, Rubei has determined, when $\mathbb{F}$ is the field of real numbers, the greatest possible dimension for an affine subspace of $n$--by--$p$ matrices…

This paper investigates solution strategies for nonlinear problems in Hilbert spaces, such as nonlinear partial differential equations (PDEs) in Sobolev spaces, when only finite measurements are available. We formulate this as a nonlinear…

In this paper we study a realistic setup for phase retrieval, where the signal of interest is modulated or masked and then for each modulation or mask a diffraction pattern is collected, producing a coded diffraction pattern (CDP) [CLM13].…

We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank…

We show that any two frames in a separable Hilbert space that are dual to each other have the same excess. Some new relations for the analysis resp. synthesis operators of dual frames are also derived. We then prove that pseudo-dual frames…

In this paper we consider the following problem of phase retrieval: Given a collection of real-valued band-limited functions $\{\psi_{\lambda}\}_{\lambda\in \Lambda}\subset L^2(\mathbb{R}^d)$ that constitutes a semi-discrete frame, we ask…