Browse State-of-the-Art › Deep Hashing
Deep Hashing
56 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Most implemented papers archive 2025-07-28
30 shown of 56 papers with code (149 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
22 Jun 2017 7 repositories listed Syntology ran 1 of 1 samples · 0 unverifiedDomain adaptation or transfer learning algorithms address this challenge by leveraging labeled data in a different, but related source domain, to develop a model for the target domain.
-
29 Sep 2021 2 repositories listed Syntology ran 4 of 6 samples · 2 unverifiedIn this work, we propose a novel deep hashing model with only a single learning objective.
-
12 Aug 2020 2 repositories listedExisting methods are not based on hash codes.
-
15 Apr 2020 2 repositories listedIn this paper, we propose a novel method, dubbed deep hashing targeted attack (DHTA), to study the targeted attack on such retrieval.
-
1 Dec 2018 2 repositories listedTo convert the input into binary code, hashing algorithm has been widely used for approximate nearest neighbor search on large-scale image sets due to its computation and storage efficiency.
-
23 Feb 2025 1 repository listed Syntology ran 2 of 9 samples · 7 unverifiedIn our previous work, we propose a novel method to realize seamless adaptation of foundation models to VPR (SelaVPR).
-
27 Dec 2024 1 repository listed Syntology ran 0 of 5 samples · 5 unverifiedDeep hashing has been widely used for large-scale approximate nearest neighbor search due to its storage and search efficiency.
-
12 Dec 2024 1 repository listedThe NHL framework introduces a novel mechanism to simultaneously generate hash codes of varying lengths in a nested manner.
-
20 Oct 2024 1 repository listedDeep hashing, due to its low cost and efficient retrieval advantages, is widely valued in cross-modal retrieval.
-
13 May 2024 1 repository listedThe experimental results demonstrate that the method proposed in this paper has superior performance with respect to state-of-the-art deep hashing methods.
-
21 Nov 2023 1 repository listedOur work focuses on tackling large-scale fine-grained image retrieval as ranking the images depicting the concept of interests (i.
-
7 Nov 2023 1 repository listedHashing is at the heart of large-scale image similarity search, and recent methods have been substantially improved through deep learning techniques.
-
23 Oct 2023 1 repository listedFurther, we, for the first time, formulate the formalized adversarial training of deep hashing into a unified minimax optimization under the guidance of the generated mainstay codes.
-
19 Jun 2023 1 repository listedOther existing methods construct the similarity graph and consider all points simultaneously.
-
8 May 2023 1 repository listedIt is based on a deep hashing model to learn hash codes for fine-grained image similarity search in natural images and a two-stage method for efficiently searching binary hash codes using Elasticsearch (ES).
-
15 Feb 2023 1 repository listedHowever, these methods often overlook the fact that the similarity between data points in the continuous feature space may not be preserved in the discrete hash code space, due to the limited similarity range of hash…
-
14 Oct 2022 1 repository listedDeep hashing has been widely applied to large-scale image retrieval tasks owing to efficient computation and low storage cost by encoding high-dimensional image data into binary codes.
-
14 Aug 2022 1 repository listedImage retrieval has become an increasingly appealing technique with broad multimedia application prospects, where deep hashing serves as the dominant branch towards low storage and efficient retrieval.
-
1 Jul 2022 1 repository listed Syntology ran 1 of 12 samples · 11 unverifiedIn this paper, we propose BadHash, the first generative-based imperceptible backdoor attack against deep hashing, which can effectively generate invisible and input-specific poisoned images with clean label.
-
31 May 2022 1 repository listed Syntology ran 2 of 2 samples · 0 unverifiedHowever, in the existing deep supervised hashing methods, coding balance and low-quantization error are difficult to achieve and involve several losses.
-
18 Apr 2022 1 repository listedOn the one hand, CgAT generates the worst adversarial examples as augmented data by maximizing the Hamming distance between the hash codes of the adversarial examples and the center codes.
-
15 Feb 2022 1 repository listedWe simultaneously learn binary hash codes and quantization codes to preserve semantic information in multiple modalities by an end-to-end deep learning architecture.
-
15 Jan 2022 1 repository listedIn this paper, we propose a novel deep hashing method, named asymmetric hash code learning (AHCL), for RSIR.
-
16 Dec 2021 1 repository listedTo mitigate this issue, data augmentation can be applied during training.
-
4 Dec 2021 1 repository listedDeep hashing has shown promising performance in large-scale image retrieval.
-
26 Sep 2021 1 repository listedWe utilize the pre-trained ViT on ImageNet as the backbone network and add the hashing head.
-
18 Sep 2021 1 repository listedTo this end, we propose the confusing perturbations-induced backdoor attack (CIBA).
-
11 Sep 2021 1 repository listedThe high efficiency in computation and storage makes hashing (including binary hashing and quantization) a common strategy in large-scale retrieval systems.
-
1 Jul 2021 1 repository listedExperiments are conducted on four commonly-used face datasets under both seen and unseen identities retrieval settings.
-
17 May 2021 1 repository listedHowever, deep hashing networks are vulnerable to adversarial examples, which is a practical secure problem but seldom studied in hashing-based retrieval field.
Syntology lines on 6 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections