MétaCan
Menu
Back to cohort
Record W2153952576 · doi:10.1109/icpr.2002.1047976

Shape representation using concavity graphs

2003· article· en· W2153952576 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
FieldComputer Science
TopicDigital Image Processing Techniques
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceRepresentation (politics)Political science

Abstract

fetched live from OpenAlex

In this paper, a new graph data structure for 2-D shape representation is proposed. The new structure is called a concavity graph, and is an evolution from the already known "concavity tree". Even though a concavity graph bears a fundamental resemblance to a concavity tree, the former is able to describe the shape of multiple objects in an image and their spatial configuration, and is hence inherently more complex. The aim of concavity graphs is two-fold: first we want to analyze the patterns in a multi-object image in a way that will (1) provide better representation of their shapes, and (2) convey useful information about how they "interact" together. Second, we want our analysis technique to facilitate similarity matching between two images. This paper introduces the new structure and outlines how it can be used for shape representation as well as similarity matching.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.547
Threshold uncertainty score0.353

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.002
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.058
GPT teacher head0.330
Teacher spread0.271 · 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

Citations21
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicDigital Image Processing TechniquesFrench-language works237,207