Evidence map›Paper›PMID 27446648›Full record

ArticleBiomedical optics express2016

Nonlinear greedy sparsity-constrained algorithm for direct reconstruction of fluorescence molecular lifetime tomography.

Chuangjian Cai, Lin Zhang, Wenjuan Cai, Dong Zhang, Yanlu Lv, Jianwen Luo

Abstract read
In one paragraph

Article in Biomedical optics express, 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing 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

1 citing paper in PubMed.

  1. Article
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

6 authors.

Chuangjian CaiDepartment of Biomedical Engineering, School of Medicine, Tsinghua University, Beijing 100084, China.
Lin ZhangDepartment of Biomedical Engineering, School of Medicine, Tsinghua University, Beijing 100084, China.
Wenjuan CaiDepartment of Biomedical Engineering, School of Medicine, Tsinghua University, Beijing 100084, China.
Dong ZhangDepartment of Biomedical Engineering, School of Medicine, Tsinghua University, Beijing 100084, China.
Yanlu LvDepartment of Biomedical Engineering, School of Medicine, Tsinghua University, Beijing 100084, China.
Jianwen LuoDepartment of Biomedical Engineering, School of Medicine, Tsinghua University, Beijing 100084, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

In order to improve the spatial resolution of time-domain (TD) fluorescence molecular lifetime tomography (FMLT), an accelerated nonlinear orthogonal matching pursuit (ANOMP) algorithm is proposed. As a kind of nonlinear greedy sparsity-constrained methods, ANOMP can find an approximate solution of L0 minimization problem. ANOMP consists of two parts, i.e., the outer iterations and the inner iterations. Each outer iteration selects multiple elements to expand the support set of the inverse lifetime based on the gradients of a mismatch error. The inner iterations obtain an intermediate estimate based on the support set estimated in the outer iterations. The stopping criterion for the outer iterations is based on the stability of the maximum reconstructed values and is robust for problems with targets at different edge-to-edge distances (EEDs). Phantom experiments with two fluorophores at different EEDs and in vivo mouse experiments demonstrate that ANOMP can provide high quantification accuracy, even if the EED is relatively small, and high resolution.

Indexed as

(100.3010) Image reconstruction techniques(100.3190) Inverse problems(110.6955) Tomographic imaging(170.3660) Light propagation in tissues(170.3880) Medical and biological imaging(290.1990) Diffusion

Identifiers

PMID27446648
PMCPMC4929634

What OpenQuestion holds

Textmetadata
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.