Sketch retrieval via dense stroke features

Chao Ma, Xiaokang Yang, Chongyang Zhang, Xiang Ruan, Ming Hsuan Yang

Research output: Contribution to conferencePaper

14 Citations (Scopus)

Abstract

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.

Original languageEnglish
DOIs
Publication statusPublished - 2013 Jan 1
Event2013 24th British Machine Vision Conference, BMVC 2013 - Bristol, United Kingdom
Duration: 2013 Sep 92013 Sep 13

Conference

Conference2013 24th British Machine Vision Conference, BMVC 2013
CountryUnited Kingdom
CityBristol
Period13/9/913/9/13

Fingerprint

Hinges

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition

Cite this

Ma, C., Yang, X., Zhang, C., Ruan, X., & Yang, M. H. (2013). Sketch retrieval via dense stroke features. Paper presented at 2013 24th British Machine Vision Conference, BMVC 2013, Bristol, United Kingdom. https://doi.org/10.5244/C.27.65
Ma, Chao ; Yang, Xiaokang ; Zhang, Chongyang ; Ruan, Xiang ; Yang, Ming Hsuan. / Sketch retrieval via dense stroke features. Paper presented at 2013 24th British Machine Vision Conference, BMVC 2013, Bristol, United Kingdom.
@conference{ab3f382de6aa4ad5bdf6d6a289af09f1,
title = "Sketch retrieval via dense stroke features",
abstract = "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.",
author = "Chao Ma and Xiaokang Yang and Chongyang Zhang and Xiang Ruan and Yang, {Ming Hsuan}",
year = "2013",
month = "1",
day = "1",
doi = "10.5244/C.27.65",
language = "English",
note = "2013 24th British Machine Vision Conference, BMVC 2013 ; Conference date: 09-09-2013 Through 13-09-2013",

}

Ma, C, Yang, X, Zhang, C, Ruan, X & Yang, MH 2013, 'Sketch retrieval via dense stroke features', Paper presented at 2013 24th British Machine Vision Conference, BMVC 2013, Bristol, United Kingdom, 13/9/9 - 13/9/13. https://doi.org/10.5244/C.27.65

Sketch retrieval via dense stroke features. / Ma, Chao; Yang, Xiaokang; Zhang, Chongyang; Ruan, Xiang; Yang, Ming Hsuan.

2013. Paper presented at 2013 24th British Machine Vision Conference, BMVC 2013, Bristol, United Kingdom.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Sketch retrieval via dense stroke features

AU - Ma, Chao

AU - Yang, Xiaokang

AU - Zhang, Chongyang

AU - Ruan, Xiang

AU - Yang, Ming Hsuan

PY - 2013/1/1

Y1 - 2013/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84898438755&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84898438755&partnerID=8YFLogxK

U2 - 10.5244/C.27.65

DO - 10.5244/C.27.65

M3 - Paper

AN - SCOPUS:84898438755

ER -

Ma C, Yang X, Zhang C, Ruan X, Yang MH. Sketch retrieval via dense stroke features. 2013. Paper presented at 2013 24th British Machine Vision Conference, BMVC 2013, Bristol, United Kingdom. https://doi.org/10.5244/C.27.65