Sliding slice: A novel approach for high accuracy and automatic 3D localization of seeds from CT scans
Bibliographic record
Abstract
We present a conceptually novel principle for 3D reconstruction of prostate seed implants. Unlike existing methods for implant reconstruction, the proposed algorithm uses raw CT data (sinograms) instead of reconstructed CT slices. Using raw CT data solves several inevitable problems related to the reconstruction from CT slices. First, the sinograms are not affected by reconstruction artifacts in the presence of metallic objects and seeds in the patient body. Second, the scanning axis is not undersampled as in the case of CT slices; as a matter of fact the scanning axis is the most densely sampled and each seed is typically represented by several hundred samples. Moreover, the shape of a single seed in a sinogram can be modeled exactly, thus facilitating the detection. All this allows very accurate 3D reconstruction of both position and the orientation of the seeds. Preliminary results indicate that the seed position can be estimated with 0.15 mm accuracy (average), while the orientation estimate accuracy is within 3 deg on average. Although the main contribution of the paper is to present a new principle of reconstruction, a preliminary implementation is also presented as a proof of concept. The implemented algorithm has been tested on a phantom and the obtained results are presented to validate the proposed approach.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| 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.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".