MétaCan
Menu
Back to cohort
Record W3183228818 · doi:10.5220/0010823400003122

Relative Position φ-Descriptor Computation for Complex Polygonal Objects

2022· article· en· W3183228818 on OpenAlexaff
Tyler Laforet, Pascal Matsakis

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicConstraint Satisfaction and Optimization
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsComputationPosition (finance)Computer scienceArtificial intelligenceComputer visionComputer graphics (images)Algorithm

Abstract

fetched live from OpenAlex

As a part of regular conversation, one often will refer to the spatial relationships between objects by way of their positioning relative to each other. Relative Position Descriptors (RPDs) are a type of image descriptor tuned to extract this spatial relationship information from pairs of objects within an image. Of the existing RPDs, the Φ-descriptor encapsulates the widest variety of spatial relationships. Currently, algorithms exist for its computation in the case of both 2D raster and 2D vector objects. However, the algorithm for its calculation in the 2D vector case can only handle pairs of simple polygons and lacks some key features, including support for objects made of disjoint parts, objects with holes, objects sharing vertices or with parallel overlapping edges, and various spatial relationships. This thesis presents an approach for complex polygonal object Φ-descriptor computation built upon the previous vector approach. The new algorithm breaks the problem down into the analysis of object boundaries, polygon edges that represent changes in the membership of objects and spatial relationships, and brings it more in-line with the design of the 2D raster approach.

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 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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.934
Threshold uncertainty score0.380

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.030
GPT teacher head0.263
Teacher spread0.233 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
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

Citations0
Published2022
Admission routes1
Has abstractyes

Explore more

Same topicConstraint Satisfaction and OptimizationFrench-language works237,207