Weighted cross-modal hashing with label enhancement
Y Wang, F Dong, K Wang, X Nie, ZD Chen - Knowledge-Based Systems, 2024 - Elsevier
Hashing has been extensively studied for large-scale cross-modal retrieval. However, there
are still some unexplored issues with existing methods. First, both the initially-provided …
are still some unexplored issues with existing methods. First, both the initially-provided …
Constant Sequence Extension for Fast Search Using Weighted Hamming Distance
Representing visual data using compact binary codes is attracting increasing attention as
binary codes are used as direct indices into hash table (s) for fast non-exhaustive search …
binary codes are used as direct indices into hash table (s) for fast non-exhaustive search …
Online Hashing with Similarity Learning
Online hashing methods usually learn the hash functions online, aiming to efficiently adapt
to the data variations in the streaming environment. However, when the hash functions are …
to the data variations in the streaming environment. However, when the hash functions are …
Fast Search on Binary Codes by Weighted Hamming Distance
Weighted Hamming distance, as a similarity measure between binary codes and binary
queries, provides superior accuracy in search tasks than Hamming distance. However, how …
queries, provides superior accuracy in search tasks than Hamming distance. However, how …