Comparative Analysis of Binarization Methods For Medical Image Hashing On Odir Dataset
Not on the map. Why?
Abstract (arXiv)
In this study, we evaluated four binarization methods. Locality-Sensitive Hashing (LSH), Iterative Quantization (ITQ), Kernel-based Supervised Hashing (KSH), and Supervised Discrete Hashing (SDH) on the ODIR dataset using deep feature embeddings. Experimental results show that SDH achieved the best performance, with an mAP@100 of 0.9184 using only 32-bit codes, outperforming LSH, ITQ, and KSH. Compared with prior studies, our method proved highly competitive: Fang et al. reported 0.7528 (Fundus-iSee, 48 bits) and 0.8856 (ASOCT-Cataract, 48 bits), while Wijesinghe et al. achieved 94.01 (KVASIR, 256 bits). Despite using significantly fewer bits, our SDH-based framework reached retrieval accuracy close to the state-of-the-art. These findings demonstrate that SDH is the most effective approach among those tested, offering a practical balance of accuracy, storage, and efficiency for medical image retrieval and device inventory management.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 8 references that are in the map. First posted on arXiv 5 Jan 2026.
Builds on
2 of 8 references.
References · 2
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2022One Loss for Quantization: Deep Hashing with Discrete Wasserstein Distributional Matching
- 2021Deep Hash Distillation for Image Retrieval
- 2021Deep Asymmetric Hashing with Dual Semantic Regression and Class Structure Quantization
- 2021Rescuing Deep Hashing from Dead Bits Problem
- 2021One Loss for All: Deep Hashing with a Single Cosine Similarity based Learning Objective
- 2025Enhancing Medical Cross-Modal Hashing Retrieval using Dropout-Voting Mixture-of-Experts Fusion
- 2021HHF: Hashing-guided Hinge Function for Deep Hashing Retrieval
- 2021FDDH: Fast Discriminative Discrete Hashing for Large-Scale Cross-Modal Retrieval