Iterative and discrete reconstruction in the evaluation of the rabbit model of osteoarthritis
Bibliographic record
Abstract
Micro-computed tomography (µCT) is a standard method for bone morphometric evaluation. However, the scan time can be long and the radiation dose during the scan may have adverse effects on test subjects, therefore both of them should be minimized. This could be achieved by applying iterative reconstruction (IR) on sparse projection data, as IR is capable of producing reconstructions of sufficient image quality with less projection data than the traditional algorithm requires. In this work, the performance of three IR algorithms was assessed for quantitative bone imaging from low-resolution data in the evaluation of the rabbit model of osteoarthritis. Subchondral bone images were reconstructed with a conjugate gradient least squares algorithm, a total variation regularization scheme, and a discrete algebraic reconstruction technique to obtain quantitative bone morphometry, and the results obtained in this manner were compared with those obtained from the reference reconstruction. Our approaches were sufficient to identify changes in bone structure in early osteoarthritis, and these changes were preserved even when minimal data were provided for the reconstruction. Thus, our results suggest that IR algorithms give reliable performance with sparse projection data, thereby recommending them for use in µCT studies where time and radiation exposure are preferably minimized.
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.003 | 0.002 |
| 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.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".