MétaCan
Menu
Back to cohort

Improving Image Retrieval by Clustering

2009· book-chapter· en· W2476617612 on OpenAlexaff
Dany Gebara, Reda Alhajj

Bibliographic record

VenueIGI Global eBooks · 2009
Typebook-chapter
Languageen
FieldComputer Science
TopicImage Retrieval and Classification Techniques
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsCluster analysisComputer scienceImage retrievalArtificial intelligencePattern recognition (psychology)Feature vectorImage textureContent-based image retrievalFeature detection (computer vision)Image (mathematics)Feature (linguistics)Cluster (spacecraft)Computer visionData miningImage processing

Abstract

fetched live from OpenAlex

This chapter presents a novel approach for content-fbased image retrieval and demonstrates its applicability on non-texture images. The process starts by extracting a feature vector for each image; wavelets are employed in the process. Then the images (each represented by its feature vector) are classified into groups by employing a density-based clustering approach, namely OPTICS. This highly improves the querying facility by limiting the search space to a single cluster instead of the whole database. The cluster to be searched is determined by applying on the query image the same clustering process OPTICS. This leads to the closest cluster to the query image, and hence, limits the search to the latter cluster without adding the query image to the cluster, except if such request is explicitly specified. The power of this system is demonstrated on non-texture images from the Corel dataset. The achieved results demonstrate that the classification of images is extremely fast and accurate.

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.003
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: Methods · Consensus signal: Methods
Teacher disagreement score0.005
Threshold uncertainty score0.017

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0040.004
Science and technology studies0.0010.001
Scholarly communication0.0020.003
Open science0.0020.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0050.007

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.013
GPT teacher head0.242
Teacher spread0.229 · 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
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

Citations3
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueIGI Global eBooksSame topicImage Retrieval and Classification TechniquesFrench-language works237,207