Variable-Length Hashing
Hashing has emerged as a popular technique for large-scale similarity search. Most learning-based hashing methods generate compact yet correlated hash codes. However, this redundancy is storage-inefficient. Hence we propose a lossless variable-length hashing (VLH) method that is both storage- and search-efficient. Storage efficiency is achieved by converting the fixed-length hash code into a variable-length code. Search efficiency is obtained by using a multiple hash table structure. With VLH, we are able to deliberately add redundancy into hash codes to improve retrieval performance with little sacrifice in storage efficiency or search complexity. In particular, we propose a block K-means hashing (B-KMH) method to obtain significantly improved retrieval performance with no increase in storage and marginal increase in computational cost.
Code (0)
등록된 구현이 없습니다.
Tasks
Code SearchRetrievalSimilar Papers 제목 키워드 기반
A Generalized Approach for Cancellable Template and Its Realization for Minutia Cylinder-Code
Hashing technology gains much attention in protecting the biometric template lately. For instance, Index-of-Max (IoM), a recent reported hashing technique, is a ranking-based locality sensitive hashing technique, which i…
A Flexible Plug-and-Play Module for Generating Variable-Length
Deep supervised hashing has become a pivotal technique in large-scale image retrieval, offering significant benefits in terms of storage and search efficiency. However, existing deep supervised hashing models predominant…
Deep HashingImage RetrievalRetrievalVideo Segment Copy Detection Using Memory Constrained Hierarchical Batch-Normalized LSTM Autoencoder
In this report, we introduce a video hashing method for scalable video segment copy detection. The objective of video segment copy detection is to find the video (s) present in a large database, one of whose segments (cr…
Copy DetectionReinforcing Short-Length Hashing
Due to the compelling efficiency in retrieval and storage, similarity-preserving hashing has been widely applied to approximate nearest neighbor search in large-scale image retrieval. However, existing methods have poor …
Image RetrievalRetrievalLearning Decorrelated Hashing Codes for Multimodal Retrieval
In social networks, heterogeneous multimedia data correlate to each other, such as videos and their corresponding tags in YouTube and image-text pairs in Facebook. Nearest neighbor retrieval across multiple modalities on…
Retrieval