Abstract

Hash is a method that is widely used in nearest neighbor retrieval, and its goal is to convert high-dimensional image data into low-dimensional representations or into a set of ordered binary code. As one of the more efficient methods of data storage and retrieval, the hash method is widely used in the nearest neighbor retrieval of large-scale image data. The traditional hashing method generates a hash code by manually extracting features, so that the feature and the hash code do not have the best fit, so that the generated hash code is suboptimal. The rapid development of deep learning makes the computer have a good effect on image visual feature recognition. Combining the learning of hash function makes the performance better than the traditional hash method. In this paper, a deep hash method based on triple constraint is proposed to extract the similarity features of the same category and distinguish the features between different categories. Further learning the hash code makes the similarity of the image preserved. Experiments show that the Hash-based learning method has better performance on CIFAR-10 and NUS-WIDE than other methods.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call