Weighted Contrastive Hashing
نویسندگان
چکیده
The development of unsupervised hashing is advanced by the recent popular contrastive learning paradigm. However, previous learning-based works have been hampered (1) insufficient data similarity mining based on global-only image representations, and (2) hash code semantic loss caused augmentation. In this paper, we propose a novel method, namely Weighted Contrative Hashing (WCH), to take step towards solving these two problems. We introduce mutual attention module alleviate problem information asymmetry in network features missing structure during contrative Furthermore, explore fine-grained relations between images, i.e., divide images into multiple patches calculate similarities patches. aggregated weighted similarities, which reflect deep relations, are distilled facilitate codes with distillation loss, so as obtain better retrieval performance. Extensive experiments show that proposed WCH significantly outperforms existing methods three benchmark datasets. Code available at: http://github.com/RosieYuu/WCH .
منابع مشابه
Weighted Contrastive Divergence
Learning algorithms for energy based Boltzmann architectures that rely on gradient descent are in general computationally prohibitive, typically due to the exponential number of terms involved in computing the partition function. In this way one has to resort to approximation schemes for the evaluation of the gradient. This is the case of Restricted Boltzmann Machines (RBM) and its learning alg...
متن کاملBagMinHash - Minwise Hashing Algorithm for Weighted Sets
Minwise hashing has become a standard tool to calculate signatures which allow direct estimation of Jaccard similarities. While very ecient algorithms already exist for the unweighted case, the calculation of signatures for weighted sets is still a time consuming task. BagMinHash is a new algorithm that can be orders of magnitude faster than current state of the art without any particular rest...
متن کاملSimple and Efficient Weighted Minwise Hashing
Weighted minwise hashing (WMH) is one of the fundamental subroutine, required by many celebrated approximation algorithms, commonly adopted in industrial practice for large -scale search and learning. The resource bottleneck with WMH is the computation of multiple (typically a few hundreds to thousands) independent hashes of the data. We propose a simple rejection type sampling scheme based on ...
متن کاملExact Weighted Minwise Hashing in Constant Time
Weighted minwise hashing (WMH) is one of the fundamental subroutine, required by many celebrated approximation algorithms, commonly adopted in industrial practice for large scale-search and learning. The resource bottleneck of the algorithms is the computation of multiple (typically a few hundreds to thousands) independent hashes of the data. The fastest hashing algorithm is by Ioffe (Ioffe, 20...
متن کاملSampled Weighted Min-Hashing for Large-Scale Topic Mining
We present Sampled Weighted Min-Hashing (SWMH), a randomized approach to automatically mine topics from large-scale corpora. SWMH generates multiple random partitions of the corpus vocabulary based on term cooccurrence and agglomerates highly overlapping inter-partition cells to produce the mined topics. While other approaches define a topic as a probabilistic distribution over a vocabulary, SW...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-26348-4_15