MétaCan
Menu
Back to cohort
Record W4249076918 · doi:10.1109/icpr.2004.1334086

Coarse-to-fine multiscale affine invariant shape matching and classification

2004· article· en· W4249076918 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

VenueProceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004. · 2004
Typearticle
Languageen
FieldComputer Science
TopicImage Retrieval and Classification Techniques
Canadian institutionsWilfrid Laurier UniversityUniversity of Waterloo
Fundersnot available
KeywordsAffine transformationInvariant (physics)MathematicsPattern recognition (psychology)Boundary (topology)Matching (statistics)Wavelet transformWaveletPoint set registrationTransformation (genetics)AlgorithmArtificial intelligenceComputer sciencePoint (geometry)GeometryMathematical analysis

Abstract

fetched live from OpenAlex

A multiscale algorithm for matching and classifying 2-D shapes is developed. The algorithm uses the 1-D dyadic wavelet transform (DWT) to decompose a shape's boundary into multiscale levels. Then the coarse to fine matching and classification are achieved in two stages. In the first stage, the global features are extracted by calculating the curve moment invariants of the approximation coefficients. By calculating the normalized cross correlation of the 1-D triangle area representation of the detail coefficients, the local similarity is achieved by the second stage. The proposed algorithm is invariant to the affine transformation and to the boundary starting point variation. In addition, the results demonstrate that the new algorithm is not sensitive to small boundary deformations.

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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.652
Threshold uncertainty score0.842

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.001
Open science0.0010.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.056
GPT teacher head0.281
Teacher spread0.226 · 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