MétaCan
Menu
Back to cohort
Record W2105932063 · doi:10.1109/cvprw.2010.5543597

Graph-based tracking of the tongue contour in ultrasound sequences with adaptive temporal regularization

2010· article· en· W2105932063 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

Venuenot available
Typearticle
Languageen
FieldMedicine
TopicTraditional Chinese Medicine Studies
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsRegularization (linguistics)Computer scienceArtificial intelligenceComputer visionGraphPattern recognition (psychology)Theoretical computer science

Abstract

fetched live from OpenAlex

We propose a graph-based approach for semi-automatic tracking of the human tongue in 2D+time ultrasound image sequences. We construct a graph capturing the intra- (spatial) and inter-frame (temporal) relationships between the dynamic contour vertices. Tongue contour tracking is formulated as a graph-labeling problem, where each vertex is labeled with a displacement vector describing its motion. The optimal displacement labels are those minimizing a multi-label Markov random field energy with unary, pairwise, and ternary potentials, capturing image evidence and temporal and smoothness regularization, respectively. The regularization strength is designed to adapt to the reliability of images features. Evaluation based on real clinical data and comparative analyses with existing approaches demonstrate the accuracy and robustness of our method.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: Observational
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.038
Threshold uncertainty score0.285

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
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.019
GPT teacher head0.255
Teacher spread0.236 · 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

Quick stats

Citations19
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicTraditional Chinese Medicine StudiesFrench-language works237,207