资源论文Learning Binary Codes for High-Dimensional Data Using Bilinear Projections

Learning Binary Codes for High-Dimensional Data Using Bilinear Projections

2019-11-27 | |  62 |   48 |   0
Abstract Recent advances in visual recognition indicate that to achieve good retrieval and classi?cation 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 classi?cation 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.

上一篇:3D R Transform on Spatio-Temporal Interest Points for Action Recognition

下一篇:Improving an Object Detector and Extracting Regions using Superpixels

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...