Results 191 to 200 of about 1,759 (223)
Some of the next articles are maybe not open access.

Supervised topology preserving hashing

2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR), 2015
Learning based hashing is gaining traction in large-scale retrieval systems. It aims to learn compact binary codes that can preserve semantic similarity in the hamming space. This paper presents a supervised topology hashing (SPTH) algorithm to learn compact binary codes that can exploit both the supervisory information as well as the local topology ...
Shu Zhang 0015   +4 more
openaire   +2 more sources

Discrete hashing with triple supervision learning

Journal of Visual Communication and Image Representation, 2021
Abstract In recent years, discrete supervised hashing methods have attracted increasing attention because of their high retrieval efficiency and precision. However, in these methods, some effective semantic information is typically neglected, which means that all the information is not sufficiently utilized.
Shaohua Wang   +4 more
openaire   +1 more source

Reconstruction-based supervised hashing

2017 IEEE International Conference on Multimedia and Expo (ICME), 2017
In this paper, we propose a reconstruction-based supervised hashing (RSH) method to learn compact binary codes with holistic structure preservation for large scale image search. Unlike most existing hashing methods which consider pair-wise similarity, our method exploits the structural information of samples by employing a reconstruction-based ...
Xin Yuan 0006   +4 more
openaire   +2 more sources

Fast Scalable Supervised Hashing

The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, 2018
Despite significant progress in supervised hashing, there are three common limitations of existing methods. First, most pioneer methods discretely learn hash codes bit by bit, making the learning procedure rather time-consuming. Second, to reduce the large complexity of the n by n pairwise similarity matrix, most methods apply sampling strategies ...
Xin Luo 0006   +5 more
openaire   +2 more sources

Supervised Hashing with Recurrent Scaling

2019
Learning to hash is a method that can deal with content-based information retrieval efficiently. Traditional learning to hash methods, however, lack the ability to map the generated hash codes to the high-level semantic space. Attributes, as a kind of higher level of visual data representation compared to features, have the potential ability in deep ...
Xiyao Fu   +4 more
openaire   +2 more sources

Learning Hash Codes with Listwise Supervision

2013 IEEE International Conference on Computer Vision, 2013
Hashing techniques have been intensively investigated in the design of highly efficient search engines for large-scale computer vision applications. Compared with prior approximate nearest neighbor search approaches like tree-based indexing, hashing-based search schemes have prominent advantages in terms of both storage and computational efficiencies ...
Jun Wang 0006   +3 more
openaire   +2 more sources

Supervised hashing with error correcting codes

Proceedings of the 22nd ACM international conference on Multimedia, 2014
One widely-used solution to expedite similarity search of multimedia data is to construct hash functions to map the data into a Hamming space where linear search is known to be fast and often sublinear solutions perform well. In this paper, we propose a Boosting based formulation for supervised learning of the hash functions that is based on Error ...
Fatih Çakir, Stan Sclaroff
openaire   +1 more source

Semi-supervised constraints preserving hashing

Neurocomputing, 2015
With the ever-increasing amount of multimedia data on the web, hashing-based approximate nearest neighbor search methods have attracted significant attention due to its remarkable efficiency gains and storage reductions. Traditional unsupervised hashing methods are designed for preserving distance metric similarity which may lead to semantic gap among ...
Di Wang 0011   +2 more
openaire   +2 more sources

Large-Margin Supervised Hashing

2017
Learning to hash embeds objects (e.g. images/documents) into a binary space with the semantic similarities preserved from the original space, which definitely benefits large-scale tough tasks such as image retrieval. By leveraging semantic labels, supervised hashing methods usually achieve better performance than unsupervised ones in real-world ...
Xiaopeng Zhang 0007   +3 more
openaire   +2 more sources

Supervised hashing with extreme learning machine

2017 IEEE Visual Communications and Image Processing (VCIP), 2017
Supervised hashing methods, which aim to generate semantic similarity-preserving binary codes, have been proposed to improve the performance of large-scale image retrieval. However, learning binary codes remains an NP-hard problem due to the binary constraints and complex computation. Existing hashing methods have never explored the potentiality of the
Tongtong Yuan, Weihong Deng, Jiani Hu
openaire   +1 more source

Home - About - Disclaimer - Privacy