MétaCan
Menu
Back to cohort
Record W2125020571 · doi:10.1109/icpr.1990.118078

Recognizing planar curves using curvature-tuned smoothing

2002· article· en· W2125020571 on OpenAlexaff
Gregory Dudek, John K. Tsotsos

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Numerical Analysis Techniques
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsCurvaturePlanarSmoothingComputer scienceGeometryComputer visionComputer graphics (images)Mathematics

Abstract

fetched live from OpenAlex

The authors present a technique for both the smoothing and decomposition of planar curves. This technique, called curvature-tuned smoothing, provides for robust rotation- and translation-invariant smoothing of planar curves. As the smoothing is performed, parts are extracted robustly and at multiple scales. These parts can subsequently be used for object recognition. The parts extracted correspond to regions of roughly uniform curvature and constitute a rich description of the original data. This representation describes some regions at multiple scales, since multiple structures may occur.>

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 imitation

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

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0040.003
Science and technology studies0.0010.001
Scholarly communication0.0020.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.002

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.038
GPT teacher head0.237
Teacher spread0.199 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreMethods

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

Quick stats

Citations14
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Numerical Analysis TechniquesFrench-language works237,207