Modeling Errors Compensation With Total Least Squares for Limited Data Photoacoustic Tomography
Bibliographic record
Abstract
The limited data photoacoustic image reconstruction problem is typically solved using either weighted or ordinary least squares (LS), with regularization term being added for stability, which account only for data imperfections (noise). Numerical modeling of acoustic wave propagation requires discretization of imaging region and is typically developed based on many assumptions, such as speed of sound being constant in the tissue, making it imperfect. In this paper, two variants of total least squares (TLS), namely ordinary TLS and Sparse TLS were developed, which account for model imperfections. The ordinary TLS is implemented in the Lanczos bidiagonalization framework to make it computationally efficient. The sparse TLS utilizes the total variation penalty to promote recovery of high frequency components in the reconstructed image. The Lanczos truncated TLS and Sparse TLS methods were compared with the recently established state-of-the-art methods, such as Lanczos Tikhonov and Exponential Filtering. The TLS methods exhibited better performance for experimental data as well as in cases where modeling errors were present, such as few acoustic detectors malfunctioning and speed of sound variations. Also, the TLS methods does not require any prior information about the errors present in the model or data, making it attractive for real-time scenarios.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| 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.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".