Results 181 to 190 of about 1,759 (223)
Some of the next articles are maybe not open access.
2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017
Among learning based hashing methods, supervised hashing seeks compact binary representation of the training data to preserve semantic similarities. Recent years have witnessed various problem formulations and optimization methods for supervised hashing.
Zihao Hu +3 more
openaire +1 more source
Among learning based hashing methods, supervised hashing seeks compact binary representation of the training data to preserve semantic similarities. Recent years have witnessed various problem formulations and optimization methods for supervised hashing.
Zihao Hu +3 more
openaire +1 more source
Computer Vision and Image Understanding, 2017
Fast nearest neighbor search is becoming more and more crucial given the advent of large-scale data in many computer vision applications. Hashing approaches provide both fast search mechanisms and compact index structures to address this critical need.
Fatih Çakir +2 more
openaire +2 more sources
Fast nearest neighbor search is becoming more and more crucial given the advent of large-scale data in many computer vision applications. Hashing approaches provide both fast search mechanisms and compact index structures to address this critical need.
Fatih Çakir +2 more
openaire +2 more sources
Discrete Hashing With Multiple Supervision
IEEE Transactions on Image Processing, 2019Supervised hashing methods have achieved more promising results than unsupervised ones by leveraging label information to generate compact and accurate hash codes. Most of the prior supervised hashing methods construct an n × n instance-pairwise similarity matrix, where n is the number of training samples.
Xin Luo 0006 +4 more
openaire +5 more sources
Supervised Hashing with Soft Constraints
Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014Due to the ability to preserve semantic similarity in Hamming space, supervised hashing has been extensively studied recently. Most existing approaches encourage two dissimilar samples to have maximum Hamming distance. This may lead to an unexpected consequence that two unnecessarily similar samples would have the same code if they are both dissimilar ...
Cong Leng +4 more
openaire +1 more source
Semi-supervised online hashing
2016 International Conference on Machine Learning and Cybernetics (ICMLC), 2016Most of existing hashing methods for image retrieval problems assume all images are given at the beginning. However, in some image retrieval problems, images may arrive or be labeled in an online or streaming manner. Current online hashing methods are fully supervised which assume all images come with labels.
Tian Xing, Wing W. Y. Ng
openaire +2 more sources
Semi-supervised Discriminant Hashing
2011 IEEE 11th International Conference on Data Mining, 2011Hashing refers to methods for embedding high dimensional data into a similarity-preserving low-dimensional Hamming space such that similar objects are indexed by binary codes whose Hamming distances are small. Learning hash functions from data has recently been recognized as a promising approach to approximate nearest neighbor search for high ...
Saehoon Kim, Seungjin Choi
openaire +1 more source
2016
Hashing methods on large scale image retrieval have been extensively in attention. These methods can be roughly categorized as supervised and unsupervised. Unsupervised hashing methods mainly search for a projection matrix of the original data to preserve the Euclidean distance similarity, while supervised hashing methods aim to preserve the label ...
Tongtong Yuan, Weihong Deng
openaire +1 more source
Hashing methods on large scale image retrieval have been extensively in attention. These methods can be roughly categorized as supervised and unsupervised. Unsupervised hashing methods mainly search for a projection matrix of the original data to preserve the Euclidean distance similarity, while supervised hashing methods aim to preserve the label ...
Tongtong Yuan, Weihong Deng
openaire +1 more source
Hashing with Inductive Supervised Learning
2015Recent years have witnessed the effectiveness and efficiency of learning-based hashing methods which generate short binary codes preserving the Euclidean similarity in the original space of high dimension. However, because of their complexities and out-of-sample problems, most of methods are not appropriate for embedding of large-scale datasets.
Mingxing Zhang +4 more
openaire +3 more sources
Supervised Consistent and Specific Hashing
2019 IEEE International Conference on Multimedia and Expo (ICME), 2019Most existing methods seek for the common semantics using different projections for different modalities, which isolates the intrinsic relationships among different modalities. Besides, to avoid the large quantization error, some of them adopt the discrete cyclic coordinate descent schemes which are usually time-consuming.
Haitao Wang 0026 +3 more
openaire +2 more sources
Supervised Adaptive Similarity Matrix Hashing
IEEE Transactions on Image Processing, 2022Compact hash codes can facilitate large-scale multimedia retrieval, significantly reducing storage and computation. Most hashing methods learn hash functions based on the data similarity matrix, which is predefined by supervised labels or a distance metric type.
Yang Shi +4 more
openaire +2 more sources

