ArticleBiomedical optics express2025
Ultrafast filtered back-projection for photoacoustic computed tomography.
Article in Biomedical optics express, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.
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.
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.
Who cites it
1 citing paper in PubMed.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
The filtered back-projection (FBP) algorithm is widely used in photoacoustic computed tomography (PACT) for image reconstruction due to its simplicity and efficiency. Yet, the real-time processing of high-speed PACT data remains challenging for regular FBP implementations. To enhance the reconstruction efficiency of the FBP algorithm, researchers have developed FBP implementations based on the graphics processing units (GPUs). However, existing GPU-accelerated FBP algorithms either sacrifice accuracy for efficiency or are still inefficient for high-speed, real-time PACT imaging. Herein, we report an ultrafast GPU acceleration-based FBP implementation for PACT image reconstruction without sacrificing accuracy. Firstly, the computation complexity of the filtering part of the FBP algorithm is significantly simplified with a pre-computed filtering matrix to enhance filtering efficiency. Secondly, the computation efficiency of the back-projection part of the FBP algorithm is dramatically increased through parallel programming and GPU acceleration. As a result, the proposed FBP implementation takes only 0.38 ms to reconstruct a two-dimensional image of 512 × 512 pixels, which is 439 times faster than regular FBP implementations. Numerical and experimental results show that the proposed FBP implementation outperforms existing GPU-based FBP implementations in reconstruction accuracy and computation efficiency. To the best of our knowledge, this is the fastest implementation of the FBP algorithm ever reported in PACT. This work is expected to provide an ultrafast and accurate image reconstruction solution for high-speed, real-time PACT imaging.
Identifiers
What OpenQuestion holds
Registered trials
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.