English
Related papers

Related papers: Phase retrieval for imaging problems

200 papers

We propose a flexible convex relaxation for the phase retrieval problem that operates in the natural domain of the signal. Therefore, we avoid the prohibitive computational cost associated with "lifting" and semidefinite programming (SDP)…

Information Theory · Computer Science 2017-03-17 Sohail Bahmani , Justin Romberg

In many areas of imaging science, it is difficult to measure the phase of linear measurements. As such, one often wishes to reconstruct a signal from intensity measurements, that is, perform phase retrieval. In several applications the…

Information Theory · Computer Science 2015-06-16 Afonso S. Bandeira , Dustin G. Mixon

We report on progress in algorithms for iterative phase retrieval. The theory of convex optimization is used to develop and to gain insight into counterparts for the nonconvex problem of phase retrieval. We propose a relaxation of averaged…

Optimization and Control · Mathematics 2009-11-10 D. Russell Luke

It was recently shown that the phase retrieval imaging of a sample can be modeled as a simple convolution process. Sometimes, such a convolution depends on physical parameters of the sample which are difficult to estimate a priori. In this…

Numerical Analysis · Mathematics 2017-02-20 Eduardo X. Miqueles , Nathaly L. Archilha , Marcelo R. Dos Anjos , Harry Westfahl , Elias S. Helou

In imaging modalities recording diffraction data, the original image can be reconstructed assuming known phases. When phases are unknown, oversampling and a constraint on the support region in the original object can be used to solve a…

Signal Processing · Electrical Eng. & Systems 2018-10-17 Alberto Pietrini , Carl Nettelblad

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…

Information Theory · Computer Science 2011-09-21 Emmanuel J. Candes , Yonina Eldar , Thomas Strohmer , Vlad Voroninski

Phase retrieval refers to a classical nonconvex problem of recovering a signal from its Fourier magnitude measurements. Inspired by the compressed sensing technique, signal sparsity is exploited in recent studies of phase retrieval to…

Computational Physics · Physics 2013-02-04 Zai Yang , Cishen Zhang , Lihua Xie

We present a convex relaxation-based algorithm for large-scale general phase retrieval problems. General phase retrieval problems include i.a. the estimation of the phase of the optical field in the pupil plane based on intensity…

Optimization and Control · Mathematics 2018-08-15 Reinier Doelman , H. Thao Nguyen , Michel Verhaegen

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…

Information Theory · Computer Science 2015-10-28 Sohail Bahmani , Justin Romberg

Phase retrieval (PR), also sometimes referred to as quadratic sensing, is a problem that occurs in numerous signal and image acquisition domains ranging from optics, X-ray crystallography, Fourier ptychography, sub-diffraction imaging, and…

Machine Learning · Computer Science 2020-06-25 Namrata Vaswani

A recently proposed convex formulation of the phase retrieval problem estimates the unknown signal by solving a simple linear program. This new scheme, known as PhaseMax, is computationally efficient compared to standard convex relaxation…

Information Theory · Computer Science 2017-10-17 Oussama Dhifallah , Christos Thrampoulidis , Yue M. Lu

We consider the problem of recovering signals from their power spectral density. This is a classical problem referred to in literature as the phase retrieval problem, and is of paramount importance in many fields of applied sciences. In…

Information Theory · Computer Science 2013-11-12 Kishore Jaganathan , Samet Oymak , Babak Hassibi

Phase retrieval is a nonlinear inverse problem that arises in a wide range of imaging modalities, from electron microscopy to Fourier ptychography. In particular, the reconstruction is facilitated when the sensing matrix is i.i.d. random,…

This paper deals with sparse phase retrieval, i.e., the problem of estimating a vector from quadratic measurements under the assumption that few components are nonzero. In particular, we consider the problem of finding the sparsest vector…

Information Theory · Computer Science 2014-02-25 Fabien Lauer , Henrik Ohlsson

In phase retrieval, the goal is to recover a complex signal from the magnitude of its linear measurements. While many well-known algorithms guarantee deterministic recovery of the unknown signal using i.i.d. random measurement matrices,…

Information Theory · Computer Science 2017-03-24 Boshra Rajaei , Sylvain Gigan , Florent Krzakala , Laurent Daudet

This chapter develops a theoretical analysis of the convex programming method for recovering a structured signal from independent random linear measurements. This technique delivers bounds for the sampling complexity that are similar with…

Information Theory · Computer Science 2014-12-05 Joel A. Tropp

We study algorithms for solving quadratic systems of equations based on optimization methods over polytopes. Our work is inspired by a recently proposed convex formulation of the phase retrieval problem, which estimates the unknown signal…

Information Theory · Computer Science 2018-05-25 Oussama Dhifallah , Christos Thrampoulidis , Yue M. Lu

We consider the recovery of a (real- or complex-valued) signal from magnitude-only measurements, known as phase retrieval. We formulate phase retrieval as a convex optimization problem, which we call PhaseMax. Unlike other convex methods…

Information Theory · Computer Science 2018-01-31 Tom Goldstein , Christoph Studer

The phase retrieval problem has garnered significant attention since the development of the PhaseLift algorithm, which is a convex program that operates in a lifted space of matrices. Because of the substantial computational cost due to…

Information Theory · Computer Science 2016-11-15 Paul Hand , Vladislav Voroninski

We develop procedures, based on minimization of the composition $f(x) = h(c(x))$ of a convex function $h$ and smooth function $c$, for solving random collections of quadratic equalities, applying our methodology to phase retrieval problems.…

Statistics Theory · Mathematics 2018-04-24 John C. Duchi , Feng Ruan
‹ Prev 1 2 3 10 Next ›