Unsupervised Hashing with Semantic Concept Mining

TL;DR

This paper introduces UHSCM, an unsupervised hashing method that leverages a vision-language model to mine semantic concepts, improving image retrieval performance by constructing a high-quality semantic similarity matrix.

Contribution

The paper proposes a novel unsupervised hashing approach that uses a VLP model for semantic concept mining to enhance similarity measurement.

Findings

Outperforms state-of-the-art methods on three benchmark datasets.

Effectively mines semantic concepts using a vision-language pretraining model.

Improves image retrieval accuracy with semantic-aware hashing.

Abstract

Recently, to improve the unsupervised image retrieval performance, plenty of unsupervised hashing methods have been proposed by designing a semantic similarity matrix, which is based on the similarities between image features extracted by a pre-trained CNN model. However, most of these methods tend to ignore high-level abstract semantic concepts contained in images. Intuitively, concepts play an important role in calculating the similarity among images. In real-world scenarios, each image is associated with some concepts, and the similarity between two images will be larger if they share more identical concepts. Inspired by the above intuition, in this work, we propose a novel Unsupervised Hashing with Semantic Concept Mining, called UHSCM, which leverages a VLP model to construct a high-quality similarity matrix. Specifically, a set of randomly chosen concepts is first collected. Then, by employing a vision-language pretraining (VLP) model with the prompt engineering which has shown strong power in visual representation learning, the set of concepts is denoised according to the training images. Next, the proposed method UHSCM applies the VLP model with prompting again to mine the concept distribution of each image and construct a high-quality semantic similarity matrix based on the mined concept distributions. Finally, with the semantic similarity matrix as guiding information, a novel hashing loss with a modified contrastive loss based regularization item is proposed to optimize the hashing network. Extensive experiments on three benchmark datasets show that the proposed method outperforms the state-of-the-art baselines in the image retrieval task.