MétaCan
Menu
Back to cohort
Record W2003014378 · doi:10.1109/3dpvt.2006.34

Automatic Locating of Anthropometric Landmarks on 3D Human Models

2006· article· en· W2003014378 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
FieldEngineering
Topic3D Shape Modeling and Analysis
Canadian institutionsNational Research Council Canada
Fundersnot available
KeywordsLandmarkArtificial intelligenceComputer sciencePairwise comparisonInferencePattern recognition (psychology)Computer visionBayesian networkSet (abstract data type)Markov random fieldProbabilistic logicHidden Markov modelNode (physics)Markov chainImage segmentationMachine learningSegmentation

Abstract

fetched live from OpenAlex

We present an algorithm for automatic locating of anthropometric landmarks on 3D human scans. Our method is based on learning landmark characteristics and the spatial relationships between them from a set of human scans where the landmarks are identified. The learned information is formulated by a pairwise Markov network. Each node of the network is a random variable corresponding to the position of a landmark. The edges of the network represent correlations between the positions of landmark pairs. Probabilistic inference is then performed over the Markov network to locate the landmarks. We evaluated the algorithm on 30 human models with different shapes. The results showed good accuracy for most of the landmarks.

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.296
Threshold uncertainty score0.297

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.012
GPT teacher head0.221
Teacher spread0.209 · 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

Citations74
Published2006
Admission routes1
Has abstractyes

Explore more

Same topic3D Shape Modeling and AnalysisFrench-language works237,207