Joint Cluster Unary Loss for Efficient Cross-Modal Hashing
Shifeng Zhang, Jianmin Li, Bo Zhang

TL;DR
This paper introduces a novel efficient cross-modal hashing method using a unary loss to reduce training complexity and improve retrieval performance on large-scale multimodal datasets.
Contribution
The paper proposes the Cross-Modal Unary Loss (CMUL) with linear complexity and the Joint Cluster Cross-Modal Hashing (JCCH) algorithm, enhancing efficiency and semantic clustering in cross-modal hashing.
Findings
Outperforms state-of-the-art methods on large-scale datasets
Achieves comparable or better retrieval accuracy
Significantly reduces training time and computational complexity
Abstract
With the rapid growth of various types of multimodal data, cross-modal deep hashing has received broad attention for solving cross-modal retrieval problems efficiently. Most cross-modal hashing methods follow the traditional supervised hashing framework in which the data pairs and data triplets are generated for training, but the training procedure is less efficient because the complexity is high for large-scale dataset. To address these issues, we propose a novel and efficient cross-modal hashing algorithm in which the unary loss is introduced. First of all, We introduce the Cross-Modal Unary Loss (CMUL) with complexity to bridge the traditional triplet loss and classification-based unary loss. A more accurate bound of the triplet loss for structured multilabel data is also proposed in CMUL. Second, we propose the novel Joint Cluster Cross-Modal Hashing (JCCH)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Image and Video Retrieval Techniques · Video Surveillance and Tracking Methods · Multimodal Machine Learning Applications
