2015
DOI: 10.1088/1367-2630/17/5/053044
|View full text |Cite
|
Sign up to set email alerts
|

Solving ptychography with a convex relaxation

Abstract: Ptychography is a powerful computational imaging technique that transforms a collection of low-resolution images into a high-resolution sample reconstruction. Unfortunately, algorithms that currently solve this reconstruction problem lack stability, robustness, and theoretical guarantees. Recently, convex optimization algorithms have improved the accuracy and reliability of several related reconstruction efforts. This paper proposes a convex formulation of the ptychography problem. This formulation has no loca… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
87
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
7
2

Relationship

3
6

Authors

Journals

citations
Cited by 89 publications
(87 citation statements)
references
References 48 publications
0
87
0
Order By: Relevance
“…This class of phase retrieval algorithms, called PhaseLift, re-frames the problem in higher dimensions such that it becomes convex, then aims to minimize the cost function between actual and predicted intensity via semidefinite programming. These algorithms come with the significant advantage of rigorous mathematical guarantees [28] and were successfully applied to FPM data [27]. The actual implementations of these algorithms, however, deviate from the provable case due to computational limitations.…”
Section: Introductionmentioning
confidence: 99%
“…This class of phase retrieval algorithms, called PhaseLift, re-frames the problem in higher dimensions such that it becomes convex, then aims to minimize the cost function between actual and predicted intensity via semidefinite programming. These algorithms come with the significant advantage of rigorous mathematical guarantees [28] and were successfully applied to FPM data [27]. The actual implementations of these algorithms, however, deviate from the provable case due to computational limitations.…”
Section: Introductionmentioning
confidence: 99%
“…We used the well-known alternating projections phase retrieval update. Other solvers based upon convex optimization [55] or alternative gradient descent techniques [56,57] may perform better in the presence of noise. Alternative approximations besides first Born approximation (e.g., Rytov [15]) are also available to simplify the Born series.…”
Section: Discussionmentioning
confidence: 99%
“…Better pupil characterization via a global-minimum search method similar to the convex optimization approach by Ref. [16] will make the system's performance more uniform throughout its FOV.…”
Section: Discussionmentioning
confidence: 99%
“…Insights from FPM carried over to incoherent imaging to improve the resolution of fluorescence images [14]. There also have been numerous efforts in improving the Fourier ptychographic (FP) reconstruction by adopting more noise-robust algorithms [15][16][17][18]. Alternative FPM modalities involving aperture scanning instead of angular illuminations were demonstrated, which allowed for imaging the complex field of a thick specimen [19,20] and estimating optical aberrations [21].…”
Section: Introductionmentioning
confidence: 99%