Given the benefits of its low storage requirements and high retrieval efficiency, hashing has recently received increasing attention. In particular, cross-modal hashing has been widely and successfully used in multimedia similarity search applications. However, almost all existing methods employing cross-modal hashing cannot obtain powerful hash codes due to their ignoring the relative similarity between heterogeneous data that contains richer semantic information, leading to unsatisfactory retrieval performance. In this paper, we propose a tripletbased deep hashing (TDH) network for cross-modal retrieval. First, we utilize the triplet labels, which describes the relative relationships among three instances as supervision in order to capture more general semantic correlations between cross-modal instances. We then establish a loss function from the inter-modal view and the intra-modal view to boost the discriminative abilities of the hash codes. Finally, graph regularization is introduced into our proposed TDH method to preserve the original semantic similarity between hash codes in Hamming space. Experimental results show that our proposed method outperforms several state-of-the-art approaches on two popular cross-modal datasets.

Download full-text PDF

Source
http://dx.doi.org/10.1109/TIP.2018.2821921DOI Listing

Publication Analysis

Top Keywords

hash codes
12
deep hashing
8
network cross-modal
8
cross-modal retrieval
8
cross-modal hashing
8
cross-modal
6
hashing
5
triplet-based deep
4
hashing network
4
retrieval
4

Similar Publications

Article Synopsis
  • - The study addresses challenges in retrieving microscopic images of osteosarcoma by using advanced deep hashing techniques and attention mechanisms, which enhance both efficiency and accuracy in image retrieval.
  • - The algorithm employs various preprocessing methods and a WRN-AM model for feature extraction, achieving a high classification accuracy of 93.2% and a mean Average Precision (mAP) of 97.09% with 64-bit hash codes.
  • - This innovative method not only improves the retrieval process for healthcare professionals, aiding in faster diagnosis and treatment planning, but also benefits researchers by enhancing the utilization of medical image data for further advancements in the field.
View Article and Find Full Text PDF

Text-Enhanced Graph Attention Hashing for Cross-Modal Retrieval.

Entropy (Basel)

October 2024

College of Computer Science and Technology, Xinjiang University, Urumqi 830046, China.

Deep hashing technology, known for its low-cost storage and rapid retrieval, has become a focal point in cross-modal retrieval research as multimodal data continue to grow. However, existing supervised methods often overlook noisy labels and multiscale features in different modal datasets, leading to higher information entropy in the generated hash codes and features, which reduces retrieval performance. The variation in text annotation information across datasets further increases the information entropy during text feature extraction, resulting in suboptimal outcomes.

View Article and Find Full Text PDF

Parameter Adaptive Contrastive Hashing for multimedia retrieval.

Neural Netw

February 2025

Big Data Institute, School of Computer Science and Engineering, Central South University, ChangSha, Hunan, 410000, China. Electronic address:

With the emergence of massive amounts of multi-source heterogeneous data on the Internet, quickly retrieving effective information from this extensive data has become a hot research topic. Due to the efficiency and speed of hash learning methods in multimedia retrieval, they have become a mainstream method for multimedia retrieval. However, unsupervised multimedia hash learning methods still face challenges with the difficulties of tuning due to the excessive number of hyperparameters and the lack of precise guidance on semantic similarity.

View Article and Find Full Text PDF

In this research, we present PerceptHashing, a technique designed to categorize million-scale agricultural scenic images by incorporating human gaze shifting paths (GSPs) into a hashing framework. For each agricultural image, we identify visually and semantically significant object patches, such as fields, crops, and water bodies. These patches are linked to form a graphlet, establishing a network of spatially adjacent patches, and a GSP is then extracted using an active learning algorithm.

View Article and Find Full Text PDF

The post-processing of quantum key distribution mainly includes error correction and privacy amplification. The error correction algorithms and privacy amplification methods used in the existing quantum key distribution are completely unrelated. Based on the principle of correspondence between error-correcting codes and hash function families, we proposed the idea of time-division multiplexing for error correction and privacy amplification for the first time.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!