z-logo
open-access-imgOpen Access
Sketch Retrieval via Dense Stroke Features
Author(s) -
Chao Ma,
Xiaokang Yang,
Chongyang Zhang,
Xiang Ruan,
Ming–Hsuan Yang
Publication year - 2013
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5244/c.27.65
Subject(s) - sketch , computer science , visual word , image retrieval , representation (politics) , histogram , information retrieval , artificial intelligence , codebook , pattern recognition (psychology) , image (mathematics) , algorithm , politics , political science , law
Sketch retrieval aims at retrieving most similar sketches from a large database based on one hand-drawn query. Successful retrieval hinges on an effective representation of sketch images and an efficient search method. In this paper, we propose a representation scheme which takes sketch strokes into account with local features, thereby facilitating efficient retrieval with codebooks. Stroke features are detected via densely sampled points on stroke lines from which local gradients are further enhanced and described by a quantized histogram of gradients. A codebook is organized in a hierarchical vocabulary tree, which maintains structural information of visual words and enables efficient retrieval in sub-linear time. Experimental results on three data sets demonstrate the merits of the proposed algorithm for effective and efficient sketch retrieval.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom