MétaCan
Menu
Back to cohort
Record W2502796253 · doi:10.1017/cbo9780511635465.017

Visual Object Discovery

2009· book-chapter· en· W2502796253 on OpenAlexaff
Pawan Sinha, Benjamin Balas, Yuri Ostrovsky, Jonas Wulff

Bibliographic record

VenueCambridge University Press eBooks · 2009
Typebook-chapter
Languageen
FieldComputer Science
TopicImage Retrieval and Classification Techniques
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsObject (grammar)PhraseEvent (particle physics)Computer scienceCommunicationCognitive scienceArtificial intelligencePsychology

Abstract

fetched live from OpenAlex

The Problem of Object Discovery It is perhaps not inaccurate to say that much of the brain's machinery is, in essence, devoted to the detection of repetitions in the environment. Knowing that a particular entity is the same as the one seen on a previous occasion allows the organism to put into play a response appropriate to the reward contingencies associated with that entity. This entity can take many forms. It can be a temporally extended event, such as an acoustic phrase or a dance move, a location, such as a living room, or an individual object, such as a peacock or a lamp. Irrespective of what the precise entity is, the basic informationprocessing problem is the same – to discover how the complex sensory input can be carved into distinct entities and to recognize them on subsequent occasions. In this chapter, we examine different pieces of knowledge regarding visual object discovery and attempt to synthesize them into a coherent framework. Let us examine the challenges inherent in this problem a little more closely. Consider Figure 16.1(a). This complex landscape appears to be just a random collection of peaks and valleys, with no clearly defined groups. Yet it represents an image that is easily parsed into distinct objects by the human visual system. Figure 16.1(b) shows the image that corresponds exactly to the plot shown in Figure 16.1(a), which simply represents pixel luminance by height. It is now trivial for us to notice that there are three children, and we can accurately delimit their extents as shown in Figure 16.1(c).

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.002
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods · Consensus signal: none
Teacher disagreement score0.016
Threshold uncertainty score0.052

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.002
Scholarly communication0.0040.006
Open science0.0020.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0160.009

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.019
GPT teacher head0.218
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

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 designBench or experimental
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

Citations6
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueCambridge University Press eBooksSame topicImage Retrieval and Classification TechniquesFrench-language works237,207