Evidence map›Paper›PMID 37065711›Full record

ArticleIEEE transactions on computational imaging2022

Poisson Phase Retrieval in Very Low-count Regimes.

Zongyu Li, Kenneth Lange, Jeffrey A Fessler

Abstract read
In one paragraph

Article in IEEE transactions on computational imaging, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Zongyu LiDepartment of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109-2122.
Kenneth LangeDepartments of Computational Medicine, Human Genetics, and Statistics, University of California, Los Angeles, CA 90095.
Jeffrey A FesslerDepartment of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109-2122.

Funding

STATISTICAL METHODS FOR GENE MAPPINGR01GM053275 · NIGMS · UNIVERSITY OF MICHIGAN AT ANN ARBOR · PI LANGE, KENNETH L · 1995 to 2019
$9.3M
Genomics, GPUs, and Next Generation Computational StatisticsR01HG006139 · NHGRI · UNIVERSITY OF CALIFORNIA LOS ANGELES · PI SOBEL, ERIC · 2011 to 2023
$5.1M
Imaging and Dosimetry of Yttrium-90 for Personalized Cancer TreatmentR01EB022075 · NIBIB · UNIVERSITY OF MICHIGAN AT ANN ARBOR · PI DEWARAJA, YUNI K · 2016 to 2023
$4.7M
Modeling, Inference, and Optimization for Genomic and Biomedical Big DataR35GM141798 · NIGMS · UNIVERSITY OF CALIFORNIA LOS ANGELES · PI LANGE, KENNETH L · 2021 to 2025
$2.7M
NHGRI NIH HHS R01 HG006139NIBIB NIH HHS R01 EB022075NIGMS NIH HHS R01 GM053275NIGMS NIH HHS R35 GM141798
6 · The paper itself

Abstract

This paper discusses phase retrieval algorithms for maximum likelihood (ML) estimation from measurements following independent Poisson distributions in very low-count regimes, e.g., 0.25 photon per pixel. To maximize the log-likelihood of the Poisson ML model, we propose a modified Wirtinger flow (WF) algorithm using a step size based on the observed Fisher information. This approach eliminates all parameter tuning except the number of iterations. We also propose a novel curvature for majorize-minimize (MM) algorithms with a quadratic majorizer. We show theoretically that our proposed curvature is sharper than the curvature derived from the supremum of the second derivative of the Poisson ML cost function. We compare the proposed algorithms (WF, MM) with existing optimization methods, including WF using other step-size schemes, quasi-Newton methods such as LBFGS and alternating direction method of multipliers (ADMM) algorithms, under a variety of experimental settings. Simulation experiments with a random Gaussian matrix, a canonical DFT matrix, a masked DFT matrix and an empirical transmission matrix demonstrate the following. 1) As expected, algorithms based on the Poisson ML model consistently produce higher quality reconstructions than algorithms derived from Gaussian noise ML models when applied to low-count data. Furthermore, incorporating regularizers, such as corner-rounded anisotropic total variation (TV) that exploit the assumed properties of the latent image, can further improve the reconstruction quality. 2) For unregularized cases, our proposed WF algorithm with Fisher information for step size converges faster (in terms of cost function and PSNR vs. time) than other WF methods, e.g., WF with empirical step size, backtracking line search, and optimal step size for the Gaussian noise model; it also converges faster than the LBFGS quasi-Newton method. 3) In regularized cases, our proposed WF algorithm converges faster than WF with backtracking line search, LBFGS, MM and ADMM.

Indexed as

low-count image reconstructionnon-convex optimizationPoisson phase retrieval

Identifiers

PMID37065711
PMCPMC10099278

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.