Learning Binary Codes for High-Dimensional Data Using Bilinear Projections
Recent advances in visual recognition indicate that to achieve good retrieval and classification accuracy on largescale datasets like ImageNet, extremely high-dimensional visual descriptors, e.g., Fisher Vectors, are needed. We present a novel method for converting such descriptors to compact similarity-preserving binary codes that exploits their natural matrix structure to reduce their dimensionality using compact bilinear projections instead of a single large projection matrix. This method achieves comparable retrieval and classification accuracy to the original descriptors and to the state-of-the-art Product Quantization approach while having orders of magnitude faster code generation time and smaller memory footprint.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationCode GenerationGeneral ClassificationQuantizationRetrievalVocal Bursts Intensity PredictionSimilar Papers 제목 키워드 기반
Bilinear Random Projections for Locality-Sensitive Binary Codes
Locality-sensitive hashing (LSH) is a popular data-independent indexing method for approximate similarity search, where random projections followed by quantization hash the points from the database so as to ensure that t…
QuantizationBilinear Supervised Hashing Based on 2D Image Features
Hashing has been recognized as an efficient representation learning method to effectively handle big data due to its low computational complexity and memory cost. Most of the existing hashing methods focus on learning th…
Representation LearningRetrievalProjection Bank: From High-dimensional Data to Medium-length Binary Codes
Recently, very high-dimensional feature representations, e.g., Fisher Vector, have achieved excellent performance for visual recognition and retrieval. However, these lengthy representations always cause extremely heavy …
Computational EfficiencyRetrievalVocal Bursts Intensity PredictionLLC: Accurate, Multi-purpose Learnt Low-dimensional Binary Codes
Learning binary representations of instances and classes is a classical problem with several high potential applications. In modern settings, the compression of high-dimensional neural representations to low-dimensional …
Image RetrievalOut of Distribution (OOD) DetectionRetrievalOnline Hashing with Similarity Learning
Online hashing methods usually learn the hash functions online, aiming to efficiently adapt to the data variations in the streaming environment. However, when the hash functions are updated, the binary codes for the whol…
Image RetrievalMetric LearningMulti-Label Image RetrievalRetrieval