Collision-Resistant Single-Pass Method for Unsupervised Fine-Grained Image Hashing
About
Unsupervised fine-grained image hashing aims to learn compact binary codes that preserve subtle visual differences among highly similar instances without manual annotations. However, most existing methods neglect collision resistance, leading to identical hash codes for slightly semantically different samples. In this paper, we propose Collision-Resistant Single-Pass Self-Supervised Semantic Hashing (CS3H), a collision-resistant framework that directly optimizes Hamming-space similarity via a single-pass normalized Hamming distance loss to produce well-separated binary representations. We further introduce a collision-sensitive attention module to emphasize rare and discriminative local patterns, reducing hash collisions and improving fine-grained discrimination. Experiments on multiple benchmarks show that CS3H consistently outperforms state-of-the-art methods in retrieval accuracy while achieving superior collision resistance with minimal computational overhead.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Image Retrieval | Oxford Flowers | mAP97.85 | 99 | |
| Image Retrieval | NUS-WIDE | mAP85 | 57 | |
| Image-to-Image Retrieval | Food101 | mAP17.02 | 55 | |
| Fine-grained Image Hashing | CUB200-2011 | Collision Probability2.00e-4 | 30 | |
| Fine-grained Image Hashing | CUB200 2011 (test) | Collision Probability2.00e-6 | 30 | |
| Fine-grained Image Hashing | Stanford Dogs | Collision Probability0.2 | 30 | |
| Fine-grained Image Hashing | Stanford Dogs (test) | Collision Probability0.0014 | 30 | |
| Image Retrieval | CUB200-2011 | mAP33.92 | 25 | |
| Image Retrieval | Stanford Dogs | mAP62.64 | 25 | |
| Retrieval | StanfordCars | mAP7.86 | 25 |