Linear cost reconstruction of vascular trees from intensity volume angiograms
Bibliographic record
Abstract
This paper introduces a two-phase algorithm to extract a center-adjusted, one-voxel-thick line representation of cerebral vascular trees from volume angiograms coded in gray-scale intensity. The first stage extracts and arranges the vessel system in the form of a directed graph whose nodes correspond to the cross sections of the vessels and whose node connectivity encodes their adjacency. The manual input reduces to the selection of two thresholds and the designation of a single initial point. In a second stage, each node is replaced by a centered voxel. The locations of the extracted centerlines are insensitive to noise and to the thresholds used. The overall computational cost is linear, of the order of the size of the input image. An example is provided which demonstrates the result of the algorithm applied to actual data. While being developed to reconstruct a line representation of a vessel network, the proposed algorithm can also be used to estimate quantitative features in any 2-D and/or 3-D intensity images. This technique is sufficiently fast to process large 3-D images at interactive rates using commodity computers.
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.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| 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.001 | 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".