pith. sign in

arxiv: 1304.7735 · v2 · pith:MYT3MPYWnew · submitted 2013-04-29 · 🧮 math.OC

Phase retrieval for imaging problems

classification 🧮 math.OC
keywords imagingproblemsphaseretrievalalgorithmsassumptionsconvergenceconvex
0
0 comments X
read the original abstract

We study convex relaxation algorithms for phase retrieval on imaging problems. We show that structural assumptions on the signal and the observations, such as sparsity, smoothness or positivity, can be exploited to both speed-up convergence and improve recovery performance. We detail experimental results in molecular imaging problems simulated from PDB data.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.