Investigation of photoacoustic tomography reconstruction with a limited view from linear array
Bibliographic record
Abstract
SIGNIFICANCE: As linear array transducers are widely used in clinical ultrasound imaging, photoacoustic tomography (PAT) with linear arrays is similarly suitable for clinical applications. However, due to the limited-view problem, a linear array has limited performance and leads to artifacts and blurring, which has hindered its broader application. There is a need to address the limited-view problem in PAT imaging with linear arrays. AIM: We investigate potential approaches for improving PAT reconstruction from linear array, by optimizing the detection geometry and implementing iterative reconstruction. APPROACH: PAT imaging with a single-array, dual-probe configurations in parallel-shape and L-shape, and square-shape configuration are compared in simulations and phantom experiments. An iterative model-based algorithm based on the variance-reduced stochastic gradient descent (VR-SGD) method is implemented. The optimum configuration found in simulation is validated on phantom experiments. RESULTS: PAT imaging with dual-probe detection and VR-SGD algorithm is found to improve the limited-view problem compared to a single probe and provide comparable performance as full-view geometry in simulation. This configuration is validated in experiments where more complete structure is obtained with reduced artifacts compared with a single array. CONCLUSIONS: PAT with dual-probe detection and iterative reconstruction is a promising solution to the limited-view problem of linear arrays.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".