MétaCan
Menu
Back to cohort
Record W1990994043 · doi:10.1118/1.2409238

Subvoxel precise skeletons of volumetric data based on fast marching methods

2007· article· en· W1990994043 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueMedical Physics · 2007
Typearticle
Languageen
FieldComputer Science
TopicMedical Image Segmentation Techniques
Canadian institutionsTerahertz Technology Solutions (Canada)
FundersNational Institutes of Health
KeywordsVoxelComputer scienceSkeletonizationSmoothingArtificial intelligenceComputer visionRepresentation (politics)Field (mathematics)AlgorithmFast marching methodObject (grammar)Distance transformMathematicsImage (mathematics)

Abstract

fetched live from OpenAlex

The accurate calculation of the skeleton of an object is a problem not satisfactorily solved by existing approaches. Most algorithms require a significant amount of user interaction and use a voxel grid to compute discrete and often coarse approximations of this representation of the data. We present a novel, automatic algorithm for computing subvoxel precise skeletons of volumetric data based on subvoxel precise distance fields. Most voxel based centerline and skeleton algorithms start with a binary mask and end with a list of voxels that define the centerline or skeleton. Even though subsequent smoothing may be applied, the results are inherently discrete. Our skeletonization algorithm uses as input a subvoxel precise distance field and employs a number of fast marching method propagations to extract the skeleton at subvoxel precision. We present the skeletons of various three-dimensional (3D) data sets and digital phantom models as validations of our algorithm.

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.996
Threshold uncertainty score0.500

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0040.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0030.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.059
GPT teacher head0.414
Teacher spread0.356 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it