QHash: An efficient hashing algorithm for low-variance image deduplication
Bibliographic record
Abstract
Attributed to the widespread use of general artificial intelligence (AI), large-scale datasets have become a critical component for the success of AI-powered applications. While collecting a larger dataset is desirable in general, studies have revealed that many databases include duplicated images. The accumulation of redundant images will result in excessive resource usage and inefficient cloud storage utilization. To get rid of the duplicates, hashing-based methods have been developed for the problem of image deduplication. However, as demonstrated in our experiments, current approaches fail in dataset with small visual difference, such as medical images. To this end, we propose QHash, which achieves effective image deduplication on the low-variance dataset. QHash leverages Vector Quantized Variational AutoEncoder (VQ-VAE) to learn the data distribution in an unsupervised manner. In addition, hash sequences are implemented using integer-based tensor, enabling distance calculation and deduplication being processed in parallel on either CPU or GPU. Extensive experiments show that QHash outperforms other baseline approaches by at least 50%, while is about 23% memory efficient and 18% deduplication time speedup.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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 source (direct Gemma or distilled Codex), 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".