Optimized Feature Space Learning For Generating Efficient Binary Codes For Image Retrieval

Abstract

In this paper we propose an approach for learning low dimensional optimized feature space with minimum intra-class variance and maximum inter-class variance. We address the problem of high-dimensionality of feature vectors extracted from neural networks by taking care of the global statistics of feature space. Classical approach of Linear Discriminant Analysis (LDA) is generally used for generating an optimized low dimensional feature space for single-labeled images. Since, image retrieval involves both multi-labeled and single-labeled images, we utilize the equivalence between LDA and Canonical Correlation Analysis (CCA) to generate an optimized feature space for single-labeled images and use CCA to generate an optimized feature space for multi-labeled images. Our approach correlates the projections of feature vectors with label vectors in our CCA based network architecture. The neural network minimize a loss function which maximizes the correlation coefficients. We binarize our gener

Stats

• citations4
• S2 citations—
• github stars0
• HF likes0
• heat score5.24
• arxiv keyjose2020optimized

Related papers

• LLC: Accurate, Multi-purpose Learnt Low-dimensional Binary Codes (2021)2.29
• Simultaneous Feature Aggregating And Hashing For Compact Binary Code Learning (2019)9.92
• Compact Hash Code Learning With Binary Deep Neural Network (2017)9.03
• Binary Constrained Deep Hashing Network For Image Retrieval Without Manual Annotation (2018)5.84
• From Selective Deep Convolutional Features To Compact Binary Representations For Image Retrieval (2018)10.35
• Efficient Image Retrieval Using Multi Neural Hash Codes And Bloom Filters (2020)2.26
• Bilinear Supervised Hashing Based On 2D Image Features (2019)8.60
• Binary Generative Adversarial Networks For Image Retrieval (2017)18.34