WaldHash: sequential similarity-preserving hashing
Similarity-sensitive hashing seeks compact representation of vector data as binary codes, so that the Hamming distance between code words approximates the original similarity. In this paper, we show that using codes of flxed length is inherently ine‐cient as the similarity can often be approximated well using just a few bits. We formulate a sequential embedding problem and approach similarity computation as a sequential decision strategy. We show the relation of the optimal strategy that minimizes the average decision time to Wald’s sequential probability ratio test. Numerical experiments demonstrate that the proposed approach outperforms embedding into the Hamming space of flxed dimension in terms of the average decision time, while having similar accuracy.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
K-Means Hashing: An Affinity-Preserving Quantization Method for Learning Binary Compact Codes
In computer vision there has been increasing interest in learning hashing codes whose Hamming distance approximates the data similarity. The hashing functions play roles in both quantizing the vector space and generating…
ClusteringQuantizationDeep Residual Hashing
Hashing aims at generating highly compact similarity preserving code words which are well suited for large-scale image retrieval tasks. Most existing hashing methods first encode the images as a vector of hand-crafted …
BinarizationImage RetrievalQuantizationRepresentation Learning+1Adaptive Object Retrieval with Kernel Reconstructive Hashing
Hashing is very useful for fast approximate similarity search on large database. In the unsupervised settings, most hashing methods aim at preserving the similarity defined by Euclidean distance. Hash codes generated by …
ObjectRetrievalvalidSparse similarity-preserving hashing
In recent years, a lot of attention has been devoted to efficient nearest neighbor search by means of similarity-preserving hashing. One of the plights of existing hashing techniques is the intrinsic trade-off between pe…
Ranking Preserving Hashing for Fast Similarity Search
Hashing method becomes popular for large scale similarity search due to its storage and computational efficiency. Many machine learning techniques, ranging from unsupervised to supervised, have been proposed to design co…
Computational Efficiency