Study on 2D Feature-Based Hash Learning
- 11 September 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 22 (5) , 1298-1309
Abstract
Hashing is an important topic in image processing, as it can help save a considerable amount of storage and computational cost. Recently, inspired by 2D strategies employed in other areas of image processing, such as feature extraction, some 2D-based hashing methods were proposed. Related papers have shown that these methods may have better image retrieval performance in terms of both effectiveness and efficiency. However, the difference in the retrieval performances of hashing methods resulting from different forms of input (1D or 2D) has not been previously studied. Whether the widely used bilinear strategy in 2D-based hashing can truly help improve the retrieval precision has not been investigated in existing research. In this paper, we conduct a comparison study on 1D and 2D feature-based hashing methods and attempt to theoretically and experimentally analyse the differences in using 1D and 2D features in hashing. Furthermore, two new hashing methods and a CNN-based 2D image feature are proposed for conducting the comparison experiments. Through a comprehensive study, we obtain three main conclusions in this paper: 1) Linear projection on 1D features and bilinear projection on 2D features are essentially the same. 2) 2D-based hashing methods are obviously more efficient than 1D-based methods for analysing high-dimensional input features. 3) 2D-based hashing methods show generally better performance for solving small sample size problems.Keywords
Funding Information
- Hong Kong Polytechnic University
This publication has 37 references indexed in Scilit:
- Image Classification with the Fisher Vector: Theory and PracticeInternational Journal of Computer Vision, 2013
- Bilinear Lanczos components for fast dimensionality reduction and feature extractionPattern Recognition, 2010
- The Pascal Visual Object Classes (VOC) ChallengeInternational Journal of Computer Vision, 2009
- 1D-LDA vs. 2D-LDA: When is vector-based linear discriminant analysis better than matrix-based?Pattern Recognition, 2008
- Computing Information Retrieval Performance Measures Efficiently in the Presence of Tied Scores2008
- Reducing the Dimensionality of Data with Neural NetworksScience, 2006
- : Two-directional two-dimensional PCA for efficient face representation and recognitionNeurocomputing, 2005
- Distinctive Image Features from Scale-Invariant KeypointsInternational Journal of Computer Vision, 2004
- Two-dimensional pca: a new approach to appearance-based face representation and recognitionIEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- Gradient-based learning applied to document recognitionProceedings of the IEEE, 1998