Research map / Label-efficient and robust learning / Recognition and long-tail
Discretely Coding Semantic Rank Orders for Supervised Image Hashing
Check your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use DSeRH-L instead of Top-RSBC | CIFAR-10 image hashing with 32-bit codes · CIFAR-10 | MAP: 0.4081 -> 0.4373 | Helped |
| Use DSeRH-L instead of Top-RSBC | CIFAR-10 image hashing with 32-bit codes · CIFAR-10 | Precision@top100: 0.4496 -> 0.4732 | Helped |
| Use DSeRH-L instead of Top-RSBC | CIFAR-10 image hashing with 32-bit codes · CIFAR-10 | NDCG@rank50: 0.2745 -> 0.2902 | Helped |
| Use DSeRH-D instead of DSRH | SUN397 image hashing with 32-bit codes · SUN397 | MAP: 0.3918 -> 0.4337 | Helped |
| Use DSeRH-D instead of DSRH | SUN397 image hashing with 32-bit codes · SUN397 | Precision@top100: 0.4928 -> 0.5373 | Helped |
| Use DSeRH-D instead of DSRH | SUN397 image hashing with 32-bit codes · SUN397 | NDCG@rank50: 0.3343 -> 0.3622 | Helped |
| Use DSeRH-D instead of DSRH | ImageNet100 image hashing with 32-bit codes · ImageNet100 | MAP: 0.1315 -> 0.1453 | Helped |
| Use DSeRH-D instead of DSRH | ImageNet100 image hashing with 32-bit codes · ImageNet100 | Precision@top100: 0.2779 -> 0.2904 | Helped |
| Use DSeRH-D instead of DSRH | ImageNet100 image hashing with 32-bit codes · ImageNet100 | NDCG@rank50: 0.2421 -> 0.2689 | Helped |
| Replace discrete binary-code optimization with continuous relaxation (ablation) | DSeRH-L on CIFAR-10 · CIFAR-10 | MAP | Hurt |
| Replace discrete binary-code optimization with continuous relaxation (ablation) | DSeRH-L on CIFAR-10 · CIFAR-10 | Precision@top100 | Hurt |
Closest papers by meaning
- Deep Supervised Hashing for Fast Image Retrieval (CVPR 2016 · similarity 0.91)
- Deep Supervised Discrete Hashing (NeurIPS 2017 · similarity 0.91)
- Hashing as Tie-Aware Learning to Rank (CVPR 2018 · similarity 0.90)
- Learning Attribute-Aware Hash Codes for Fine-Grained Image Retrieval via Query Optimization (ICML 2025 · similarity 0.87)
- Deep Unsupervised Hashing via External Guidance (ICML 2025 · similarity 0.87)
- Pairwise-Label-Based Deep Incremental Hashing with Simultaneous Code Expansion (AAAI 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.