Self-calibrated algorithms for diffuse optical tomography and bioluminescence tomography using relative transmission images
Bibliographic record
Abstract
Reconstruction algorithms for diffuse optical tomography (DOT) and bioluminescence tomography (BLT) have been developed based on diffusion theory. The algorithms numerically solve the diffusion equation using the finite element method. The direct measurements of the uncalibrated light fluence rates by a camera are used for the reconstructions. The DOT is self-calibrated by using all possible pairs of transmission images obtained with external sources along with the relative values of the simulated data and the calculated Jacobian. The reconstruction is done in the relative domain with the cancelation of any geometrical or optical factors. The transmission measurements for the DOT are used for calibrating the bioluminescence measurements at each wavelength and then a normalized system of equations is built up which is self-calibrated for the BLT. The algorithms have been applied to a three dimensional model of the mouse (MOBY) segmented into tissue regions which are assumed to have uniform optical properties. The DOT uses the direct method for calculating the Jacobian. The BLT uses a reduced space of eigenvectors of the Green's function with iterative shrinking of the permissible source region. The reconstruction results of the DOT and BLT algorithms show good agreement with the actual values when using either absolute or relative data. Even a small calibration error causes significant degradation of the reconstructions based on absolute data.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".