Fast Iterative Algorithms for Blind Phase Retrieval: A Survey

Huibin Chang, Li Yang and Stefano Marchesini
Additional contact information
Huibin Chang: Tianjin Normal University, School of Mathematical Sciences
Li Yang: Tianjin Normal University, School of Mathematical Sciences
Stefano Marchesini: SLAC National Laboratory

Chapter 4 in Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging, 2023, pp 139-174 from Springer

Abstract: Abstract In nanoscale imaging technique and ultrafast laser, the reconstruction procedure is normally formulated as a blind phase retrieval (BPR) problem, where one has to recover both the sample and the probe (pupil) jointly from phaseless data. This survey first presents the mathematical formula of BPR and related nonlinear optimization problems and then gives a brief review of the recent iterative algorithms. It mainly consists of three types of algorithms, including the operator-splitting-based first-order optimization methods, second-order algorithm with Hessian, and subspace methods. The future research directions for experimental issues and theoretical analysis are further discussed.

Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-98661-2_116

Ordering information: This item can be ordered from
http://www.springer.com/9783030986612

DOI: 10.1007/978-3-030-98661-2_116

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().