Unsupervised Ensemble Hashing: Boosting Minimum Hamming Distance

Hashing aims at learning discriminative binary codes of high-dimensional data for the approximate nearest neighbor searching. However, the distance ranking obtained by traditional methods is not optimum in the Hamming space, and it degrades the performance for retrieval tasks. To tackle the above problem, an unsupervised ensemble hashing is proposed to improve the ranking accuracy by assembling the diverse hash tables independently in this paper. We observe that the higher the accuracy is the larger diversity the base learner has, and the more effective the ensemble method is. Based on this principle, two special ensembles hashing approaches are proposed to increase diversity by bootstrap sampling with data-dependent methods. Especially, the results are better when the minimum Hamming distance is large and the variance of the Hamming distance is small. This proposed method is conducted in the experiments and the results show that it can achieve about 10%–25% performance compared with the baseline algorithm, which achieves competitive results with the state-of-the-art methods on the CIFAR-10 and LabelMe benchmarks.

[1]  Yuxin Peng,et al.  Multi-Pathway Generative Adversarial Hashing for Unsupervised Cross-Modal Retrieval , 2020, IEEE Transactions on Multimedia.

[2]  Yuxin Peng,et al.  SSDH: Semi-Supervised Deep Hashing for Large Scale Image Retrieval , 2016, IEEE Transactions on Circuits and Systems for Video Technology.

[3]  Shih-Fu Chang,et al.  Semi-Supervised Hashing for Large-Scale Search , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Antonio Torralba,et al.  Modeling the Shape of the Scene: A Holistic Representation of the Spatial Envelope , 2001, International Journal of Computer Vision.

[5]  Weihong Deng,et al.  Distortion Minimization Hashing , 2017, IEEE Access.

[6]  Leo Breiman,et al.  Bagging Predictors , 1996, Machine Learning.

[7]  Thomas G. Dietterich.  Multiple Classifier Systems , 2000, Lecture Notes in Computer Science.

[8]  Shuicheng Yan,et al.  Non-Metric Locality-Sensitive Hashing , 2010, AAAI.

[9]  Nenghai Yu,et al.  Complementary hashing for approximate nearest neighbor search , 2011, 2011 International Conference on Computer Vision.

[10]  Yongdong Zhang,et al.  Double-Bit Quantization and Index Hashing for Nearest Neighbor Search , 2019, IEEE Transactions on Multimedia.

[11]  Antonio Torralba,et al.  Small codes and large image databases for recognition , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[12]  Shukai Duan,et al.  Distributed Fast Supervised Discrete Hashing , 2019, IEEE Access.

[13]  Anders Krogh,et al.  Neural Network Ensembles, Cross Validation, and Active Learning , 1994, NIPS.

[14]  Xingquan Zhu,et al.  Hashing Techniques , 2017 .

[15]  Minyi Guo,et al.  Manhattan hashing for large-scale image retrieval , 2012, SIGIR '12.

[16]  Daniel S. Yeung,et al.  Bagging-boosting-based semi-supervised multi-hashing with query-adaptive re-ranking , 2018, Neurocomputing.

[17]  Shih-Fu Chang,et al.  Circulant Binary Embedding , 2014, ICML.

[18]  Chang Liu,et al.  Kernelised supervised context hashing , 2016, IET Image Process..

[19]  Alex Krizhevsky,et al.  Learning Multiple Layers of Features from Tiny Images , 2009 .

[20]  Zhi-Hua Zhou,et al.  Learning to hash for big data: Current status and future trends , 2015 .

[21]  Heng Tao Shen,et al.  Principal Component Analysis , 2009, Encyclopedia of Biometrics.

[22]  Yongdong Zhang,et al.  Convolutional Attention Networks for Scene Text Recognition , 2019, ACM Trans. Multim. Comput. Commun. Appl..

[23]  Jian Sun,et al.  Sparse projections for high-dimensional binary codes , 2015, 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[24]  Paul A. Viola,et al.  Robust Real-Time Face Detection , 2001, International Journal of Computer Vision.

[25]  Chun Chen,et al.  Harmonious Hashing , 2013, IJCAI.

[26]  Wei Liu,et al.  Supervised Discrete Hashing , 2015, 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[27]  David Suter,et al.  Fast Supervised Hashing with Decision Trees for High-Dimensional Data , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[28]  Jiwen Lu,et al.  Learning Compact Binary Descriptors with Unsupervised Deep Neural Networks , 2016, 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[29]  Cheng Deng,et al.  Unsupervised Deep Generative Adversarial Hashing Network , 2018, 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition.

[30]  Trevor Darrell,et al.  Learning to Hash with Binary Reconstructive Embeddings , 2009, NIPS.

[31]  David J. Fleet,et al.  Minimal Loss Hashing for Compact Binary Codes , 2011, ICML.

[32]  Yuxin Peng,et al.  Unsupervised Generative Adversarial Cross-modal Hashing , 2017, AAAI.

[33]  Shih-Fu Chang,et al.  Spherical hashing , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[34]  Yoav Freund,et al.  Experiments with a New Boosting Algorithm , 1996, ICML.

[35]  Xiaofei He,et al.  Locality Preserving Projections , 2003, NIPS.

[36]  Rongrong Ji,et al.  Supervised hashing with kernels , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[37]  Hanqing Lu,et al.  Learning Binary Codes with Bagging PCA , 2014, ECML/PKDD.

[38]  Miguel Á. Carreira-Perpiñán,et al.  An ensemble diversity approach to supervised binary hashing , 2016, NIPS.

[39]  David Suter,et al.  A General Two-Step Approach to Learning-Based Hashing , 2013, 2013 IEEE International Conference on Computer Vision.

[40]  Yuxin Peng,et al.  Query-Adaptive Image Retrieval by Deep-Weighted Hashing , 2016, IEEE Transactions on Multimedia.

[41]  Alexandr Andoni,et al.  Beyond Locality-Sensitive Hashing , 2013, SODA.

[42]  Antonio Torralba,et al.  Spectral Hashing , 2008, NIPS.

[43]  Qiang Zhang,et al.  Deep Covariance Estimation Hashing , 2019, IEEE Access.

[44]  Yuxin Peng,et al.  Multi-Scale Correlation for Sequential Cross-modal Hashing Learning , 2018, ACM Multimedia.

[45]  Xudong Lin,et al.  Unsupervised Rank-Preserving Hashing for Large-Scale Image Retrieval , 2019, ICMR.

[46]  Huanyu Li,et al.  An Ensemble Hashing Framework for Fast Image Retrieval , 2017, EIDWT.

[47]  Naonori Ueda,et al.  Generalization error of ensemble estimators , 1996, Proceedings of International Conference on Neural Networks (ICNN'96).

[48]  Yuxin Peng,et al.  SCH-GAN: Semi-Supervised Cross-Modal Hashing by Generative Adversarial Network , 2018, IEEE Transactions on Cybernetics.

[49]  Wei Liu,et al.  Hashing with Graphs , 2011, ICML.

[50]  Svetlana Lazebnik,et al.  Iterative quantization: A procrustean approach to learning binary codes , 2011, CVPR 2011.

[51]  Piotr Indyk,et al.  Similarity Search in High Dimensions via Hashing , 1999, VLDB.

[52]  Nicu Sebe,et al.  A Survey on Learning to Hash , 2016, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[53]  Cordelia Schmid,et al.  Aggregating local descriptors into a compact image representation , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[54]  Svetlana Lazebnik,et al.  Locality-sensitive binary codes from shift-invariant kernels , 2009, NIPS.

[55]  Bing Chen,et al.  Image Retrieval via Balanced and Maximum Variance Deep Hashing , 2017, CCCV.

[56]  Kristen Grauman,et al.  Kernelized Locality-Sensitive Hashing , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.