MétaCan
Menu
Back to cohort
Record W2348664854

A SVM Based Relevance Feedback Algorithm for Image Retrieval

2008· article· en· W2348664854 on OpenAlexvenueno aff
Hao Chong-yang

Bibliographic record

VenueMicrocomputer applications · 2008
Typearticle
Languageen
FieldComputer Science
TopicImage Retrieval and Classification Techniques
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceRelevance feedbackSupport vector machineImage retrievalPattern recognition (psychology)Artificial intelligenceRelevance (law)Content-based image retrievalGeneralizationClassifier (UML)HistogramImage (mathematics)Machine learningData miningMathematics
DOInot available

Abstract

fetched live from OpenAlex

Relevance feedback technique has been an important approach in image retrieval. A novel relevance feedback algorithm is presented based on Support Vector Machine (SVM) in content-based image retrieval system, using MPEG-7 edge histogram feather. During the retrieval process, users can mark positive sample images similar to the query image. Then, the algorithm constructs a SVM classifier, which uses the updated training samples. The performances of SVMs with different kernel functions have been tested and compared. The RBF function has higher precision of retrieval than others. Experiments were carried out on a database of 10000 images. It shows that more images relevant to the query can be found efficiently by the retrieval procesS. It also shows the generalization ability of SVM under the conditions of limited training samples.

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.002
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0020.001
Insufficient payload (model declined to judge)0.0030.002

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.017
GPT teacher head0.255
Teacher spread0.239 · 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 designSimulation or modeling
Domainnot available
GenreEmpirical

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
Published2008
Admission routes1
Has abstractyes

Explore more

Same venueMicrocomputer applicationsSame topicImage Retrieval and Classification TechniquesFrench-language works237,207