Deep Self-taught Graph Embedding Hashing with Pseudo Labels for Image Retrieval

It has always been a tricky task to generate image hashing function via deep learning without labels and allocate the relative distance between data through their features. Existing methods can complete this task and prevent the overfitting problem using shallow graph embedding technique. However, they only capture the first-order proximity. To address this problem, we design DSTGeH, a deep self-taught graph embedding hashing framework which learns hash function without labels for image retrieval. DSTGeH introduces deep graph embedding means to capture more complex topological relationships (the second-order proximity) on the graph and maps these relationships into pseudo labels, which enables an end-to-end hash model and helps recognize the samples outside the graph. We present the ablation studies and compare DSTGeH with the state-of-the-art label-free hashing algorithms. Extensive experiments show DSTGeH can achieve the best performances and produce an overwhelming advantage on multi-object datasets.