CVMar 16, 2017

Deep Sketch Hashing: Fast Free-hand Sketch-Based Image Retrieval

arXiv:1703.05605v1290 citations
Originality Incremental advance
AI Analysis

This work addresses the challenge of efficient and accurate cross-view retrieval for applications like image search, though it is incremental as it builds on existing hashing and deep learning techniques.

The paper tackles the problem of free-hand sketch-based image retrieval (SBIR) by introducing Deep Sketch Hashing (DSH), a binary coding method that uses a semi-heterogeneous deep architecture to mitigate geometric distortion between sketches and images. The result shows superior retrieval accuracies on large-scale datasets, with significantly reduced retrieval time and memory footprint compared to state-of-the-art methods.

Free-hand sketch-based image retrieval (SBIR) is a specific cross-view retrieval task, in which queries are abstract and ambiguous sketches while the retrieval database is formed with natural images. Work in this area mainly focuses on extracting representative and shared features for sketches and natural images. However, these can neither cope well with the geometric distortion between sketches and images nor be feasible for large-scale SBIR due to the heavy continuous-valued distance computation. In this paper, we speed up SBIR by introducing a novel binary coding method, named \textbf{Deep Sketch Hashing} (DSH), where a semi-heterogeneous deep architecture is proposed and incorporated into an end-to-end binary coding framework. Specifically, three convolutional neural networks are utilized to encode free-hand sketches, natural images and, especially, the auxiliary sketch-tokens which are adopted as bridges to mitigate the sketch-image geometric distortion. The learned DSH codes can effectively capture the cross-view similarities as well as the intrinsic semantic correlations between different categories. To the best of our knowledge, DSH is the first hashing work specifically designed for category-level SBIR with an end-to-end deep architecture. The proposed DSH is comprehensively evaluated on two large-scale datasets of TU-Berlin Extension and Sketchy, and the experiments consistently show DSH's superior SBIR accuracies over several state-of-the-art methods, while achieving significantly reduced retrieval time and memory footprint.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes