W Zhou, H Li, Q Tian - arXiv preprint arXiv:1706.06064, 2017 - arxiv.org
The explosive increase and ubiquitous accessibility of visual data on the Web have led to the prosperity of research activity in image search or retrieval. With the ignorance of visual …
SR Dubey - IEEE Transactions on Circuits and Systems for …, 2021 - ieeexplore.ieee.org
The content based image retrieval aims to find the similar images from a large scale dataset against a query image. Generally, the similarity between the representative features of the …
C Yan, B Gong, Y Wei, Y Gao - IEEE Transactions on Pattern …, 2020 - ieeexplore.ieee.org
Hashing is an efficient method for nearest neighbor search in large-scale data space by embedding high-dimensional feature descriptors into a similarity preserving Hamming …
H Lu, M Zhang, X Xu, Y Li… - IEEE transactions on fuzzy …, 2020 - ieeexplore.ieee.org
Hashing methods for efficient image retrieval aim at learning hash functions that map similar images to semantically correlated binary codes in the Hamming space with similarity well …
Existing data-dependent hashing methods usually learn hash functions from pairwise or triplet data relationships, which only capture the data similarity locally, and often suffer from …
JT Hoe, KW Ng, T Zhang, CS Chan… - Advances in Neural …, 2021 - proceedings.neurips.cc
A deep hashing model typically has two main learning objectives: to make the learned binary hash codes discriminative and to minimize a quantization error. With further …
Learning to hash has been widely applied to approximate nearest neighbor search for large- scale multimedia retrieval, due to its computation efficiency and retrieval quality. Deep …
In this paper, we present a new hashing method to learn compact binary codes for highly efficient image retrieval on large-scale datasets. While the complex image appearance …