Deep hash: semantic similarity preserved hash scheme

A novel hashing scheme based on a deep network architecture is proposed to tackle semantic similarity problems. The proposed methodology utilises the ability of deep networks to learn nonlinear representations of the input features. The equivalence of the neuron layer and the sigmoid smoothed hash functions is introduced, and by incorporating the saturation and orthogonality regulariser, the final compact binary embeddings can be achieved. The experiments illustrate that the proposed scheme exhibits superior improvement compared with conventional hashing methods.

[1]  Geoffrey E. Hinton,et al.  Semantic hashing , 2009, Int. J. Approx. Reason..

[2]  Antonio Torralba,et al.  Ieee Transactions on Pattern Analysis and Machine Intelligence 1 80 Million Tiny Images: a Large Dataset for Non-parametric Object and Scene Recognition , 2022 .

[3]  Jun Wang,et al.  Self-taught hashing for fast similarity search , 2010, SIGIR.

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

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

[6]  Geoffrey E. Hinton,et al.  Reducing the Dimensionality of Data with Neural Networks , 2006, Science.

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

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

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