A new weakly supervised discrete discriminant hashing for robust data representation.

In real applications, the label information on many data is inaccurate, or a completely reliable label needs to be obtained at a high cost. The previous supervised hashing algorithms consider only the label information in the mapping process from Euclidean space to Hamming space when learning hash codes. However, there is no doubt that these algorithms are suboptimal in maintaining the relationships between high-dimensional data spaces. To overcome this problem, this paper advances a new weakly supervised discrete discriminant hashing (WDDH) to ensure a more effective representation of data and better retrieval of information. First, we consider the nearest neighbour relationship between samples, and new neighbourhood graphs are constructed to describe the geometric relationship between samples. Second, the algorithm embeds the learning of the hash function into the model and optimises the hash codes by a one-step iterative updating algorithm. Finally, it is compared with the existing classical unsupervised hashing algorithm and supervised hashing algorithm on different databases. The results and discussion of the experiments clearly show that the proposed WDDH algorithm in this paper is more robust for data representation in learning low-quality label data, coarse-grained label data and noisy data. [ABSTRACT FROM AUTHOR]