MétaCan
Menu
Back to cohort
Record W2006355160 · doi:10.1145/2021164.2021190

Neatening sketched strokes using piecewise French curves

2011· article· en· W2006355160 on OpenAlex
James McCrae, Karan Singh

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
TopicAdvanced Numerical Analysis Techniques
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsCurvatureClassification of discontinuitiesPiecewiseComputer scienceSketchCurve fittingAlgorithmSet (abstract data type)Stroke (engine)Artificial intelligenceMathematicsGeometryMathematical analysisMachine learning

Abstract

fetched live from OpenAlex

We apply traditional bimanual curve modeling using French curves to the problem of automatic neatening of sketched strokes. Given a sketched input stroke and a set of template French curves we present an approach that fits the stroke using an optimal number of French curve segments. Our algorithm operates in both curvature and point space, reconstructing the salient curvature profiles of French curve segments, while limiting error accumulation resulting from curvature integration. User-controlled parameters allow the neatened stroke to model G2 continuous curves, capture G1 discontinuities, define closed curves and explore the trade-off between fitting error and the number of French curve segments used. We present an interactive sketch stroke neatening implementation to demonstrate the real-time performance of our algorithm and evaluate the quality of its results.

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: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.647
Threshold uncertainty score0.608

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.0010.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.040
GPT teacher head0.241
Teacher spread0.200 · 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

Citations17
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Numerical Analysis TechniquesFrench-language works237,207