Hybrid Feature-Hash Module for Image Duplicate Detection
Bibliographic record
Abstract
Identifying duplicates from image databases has a vast significance in various domains. This process can be directly utilized for several use cases as a standalone application or integration to a broader workflow. This study focuses primarily on introducing a hybrid feature-hash model for image duplicate detection, leveraging existing state-of-the-art methods in this field. Our proposed framework combines selected feature extraction techniques and image hashing techniques for image processing. Later, based on their similarity, the top K images will be selected as the nearest duplicates for a query image in the image database. This pipeline consists of three main modules: a pre-processing with manual feature extraction module, a hybrid feature aggregation with image hashing module, and a K-Dimensional Tree module for top K images. Furthermore, we introduced a combined hashing technique, known as majority vote-based hashing, alongside the hybrid module. The performance of the proposed framework was evaluated with different combinations of hybrid feature-hash scenarios with state-of-the-art techniques, where the majority vote-based feature recovery combination outperformed the other combinations. Notably, our innovation in utilizing this novel hybrid feature-hash module over currently available modern architectures yields outstanding results in duplicate image detection.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
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".