MétaCan
Menu
Back to cohort
Record W1975732275 · doi:10.1145/1032604.1032607

Content-based sub-image retrieval using relevance feedback

2004· article· en· W1975732275 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
TopicImage Retrieval and Classification Techniques
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsRelevance feedbackWeightingTileRelevance (law)Computer scienceImage retrievalRGB color modelImage (mathematics)Artificial intelligenceComputer visionScheme (mathematics)Content-based image retrievalInformation retrievalMathematics

Abstract

fetched live from OpenAlex

This paper presents the use of relevance feedback to the problem of content-based sub-image retrieval (CBsIR). Relevance feedback is used to improve the accuracy of successive retrievals via a tile re-weighting scheme that assigns penalties to each tile of database images and updates the tile penalties for all relevant images retrieved at each iteration using both the relevant (positive) and irrelevant (negative) images identified by the user. Performance evaluation on a dataset of over 10,000 images shows the effectiveness and efficiency of the proposed framework. Using 64 quantized colors in the RGB color space, the system can achieve a stable average recall value of 70% within the top 20 retrieved (and presented) images after only 5 iterations, with each such iteration taking about 2 seconds.

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: Methods
Teacher disagreement score0.375
Threshold uncertainty score0.516

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.001
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.053
GPT teacher head0.273
Teacher spread0.220 · 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