Corpus ID: 14283511

Hashing for Distributed Data

@inproceedings{Leng2015HashingFD,
  title={Hashing for Distributed Data},
  author={Cong Leng and Jiaxiang Wu and Jian Cheng and Xi Zhang and Hanqing Lu},
  booktitle={ICML},
  year={2015}
}
Recently, hashing based approximate nearest neighbors search has attracted much attention. Extensive centralized hashing algorithms have been proposed and achieved promising performance. However, due to the large scale of many applications, the data is often stored or even collected in a distributed manner. Learning hash functions by aggregating all the data into a fusion center is infeasible because of the prohibitively expensive communication and computation overhead. In this paper, we… Expand
Distributed Graph Hashing
TLDR
This paper proposes a novel distributed graph hashing model for learning efficient hash functions based on the data distributed across multiple agents over network, and proposes two algorithmsbased on the idea of alternating direction method of multipliers to solve this problem in a distributed manner. Expand
General Distributed Hash Learning on Image Descriptors for $k$-Nearest Neighbor Search
TLDR
This letter proposes a novel general distributed hash learning model, which can be viewed as an effective distributed model of most hashing methods, and can achieve up to 15.2% accuracy gains over state-of-the-art distributed hashing methods. Expand
Supervised Distributed Hashing for Large-Scale Multimedia Retrieval
TLDR
An efficient and effective method called supervised distributed hashing (SupDisH), which learns discriminative hash functions by leveraging the semantic label information in a distributed manner, which is competitive to centralized hashing methods and outperforms the state-of-the-art unsupervised distributed method significantly. Expand
DisITQ: A Distributed Iterative Quantization Hashing Learning Algorithm
TLDR
A distributed learning algorithm which is based on MapReduce and Iterative Quantization (ITQ) to train hashing functions, named as distributed iterative quanti-zation hashing (DisITQ), which can be performed on large scale datasets, but can also be applied to distributed data storing scenarios. Expand
Fast image similarity search by distributed locality sensitive hashing
TLDR
This study proposes an approach called as Randomized Distributed Hashing (RDH) which uses Locality Sensitive Hashes (LSH) in a distributed scheme which is promising for searching images in large datasets with multiple nodes. Expand
Distributed Discrete Hashing by Equivalent Continuous Formulation
TLDR
A novel distributed discrete hashing method is proposed, which learns effective hash codes without using any relaxations, and a method to transform the discrete hashing problem into an equivalent distributed continuous optimization problem is given. Expand
Distributed Fast Supervised Discrete Hashing
TLDR
The distributed fast supervised discrete hashing (DFSDH), which both inherits the excellent retrieval performance of SupDisH and gets significant enhancement in efficiency, is proposed and is competitive to most centralized supervised hashing methods and existing distributed hashing methods. Expand
Scalable Supervised Discrete Hashing for Large-Scale Search
TLDR
Scalable Supervised Discrete Hashing is presented, a novel hashing method that bypasses the direct optimization on the n by n pairwise similarity matrix and adopts no relaxation optimization scheme in the learning procedure and avoids the large quantization error problem. Expand
Distributed Supervised Discrete Hashing With Relaxation
TLDR
Experiments show that DSDHR has certain competitive advantages over some centralized hashing algorithms and some distributed hashing algorithms. Expand
Binary Hashing for Approximate Nearest Neighbor Search on Big Data: A Survey
TLDR
This paper illustrates the development of binary hashing research by proposing an overall and clear classification of them, and conducts extensive experiments to compare the performance of these methods on five famous and public data sets. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 33 REFERENCES
Online sketching hashing
TLDR
A novel approach to handle these two problems simultaneously based on the idea of data sketching, which can learn hash functions in an online fashion, while needs rather low computational complexity and storage space. Expand
Hashing with Graphs
TLDR
This paper proposes a novel graph-based hashing method which automatically discovers the neighborhood structure inherent in the data to learn appropriate compact codes and describes a hierarchical threshold learning procedure in which each eigenfunction yields multiple bits, leading to higher search accuracy. Expand
Semi-Supervised Hashing for Large-Scale Search
TLDR
This work proposes a semi-supervised hashing (SSH) framework that minimizes empirical error over the labeled set and an information theoretic regularizer over both labeled and unlabeled sets and presents three different semi- supervised hashing methods, including orthogonal hashing, nonorthogonal hash, and sequential hashing. Expand
Locality-sensitive hashing scheme based on p-stable distributions
TLDR
A novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under lp norm, based on p-stable distributions that improves the running time of the earlier algorithm and yields the first known provably efficient approximate NN algorithm for the case p<1. Expand
Spherical hashing
TLDR
The extensive experiments show that the spherical hashing technique significantly outperforms six state-of-the-art hashing techniques based on hyperplanes across various image benchmarks of sizes ranging from one to 75 million of GIST descriptors, which confirms the unique merits of the proposed idea in using hyperspheres to encode proximity regions in high-dimensional spaces. Expand
Supervised hashing with kernels
TLDR
A novel kernel-based supervised hashing model which requires a limited amount of supervised information, i.e., similar and dissimilar data pairs, and a feasible training cost in achieving high quality hashing, and significantly outperforms the state-of-the-arts in searching both metric distance neighbors and semantically similar neighbors is proposed. Expand
Kernelized locality-sensitive hashing for scalable image search
  • B. Kulis, K. Grauman
  • Mathematics, Computer Science
  • 2009 IEEE 12th International Conference on Computer Vision
  • 2009
TLDR
It is shown how to generalize locality-sensitive hashing to accommodate arbitrary kernel functions, making it possible to preserve the algorithm's sub-linear time similarity search guarantees for a wide class of useful similarity functions. Expand
A General Two-Step Approach to Learning-Based Hashing
TLDR
This framework decomposes the hashing learning problem into two steps: hash bit learning and hash function learning based on the learned bits, and can typically be formulated as binary quadratic problems, and the second step can be accomplished by training standard binary classifiers. Expand
Fast Supervised Hashing with Decision Trees for High-Dimensional Data
TLDR
Experiments demonstrate that the proposed method significantly outperforms most state-of-the-art methods in retrieval precision and training time, and is orders of magnitude faster than many methods in terms of training time. Expand
K-Means Hashing: An Affinity-Preserving Quantization Method for Learning Binary Compact Codes
  • Kaiming He, Fang Wen, Jian Sun
  • Mathematics, Computer Science
  • 2013 IEEE Conference on Computer Vision and Pattern Recognition
  • 2013
TLDR
A novel Affinity-Preserving K-means algorithm which simultaneously performs k-mean clustering and learns the binary indices of the quantized cells and outperforms various state-of-the-art hashing encoding methods. Expand
...
1
2
3
4
...