On Training Sketch Recognizers for New Domains
Kemal Tugrul Yesilbek, T. Metin Sezgin

TL;DR
This paper investigates the challenges of training sketch recognizers for new domains, emphasizing data collection validity, dataset size, and the performance gap between deep learning and traditional methods in realistic, small-data scenarios.
Contribution
It highlights the importance of ecological validity and dataset size in sketch recognition, and compares deep learning with traditional methods under small-data constraints.
Findings
Deep learning methods suffer from dataset shift in realistic scenarios.
Standard data augmentation and transfer learning are insufficient for small datasets.
Traditional classifiers outperform deep learning when data is scarce.
Abstract
Sketch recognition algorithms are engineered and evaluated using publicly available datasets contributed by the sketch recognition community over the years. While existing datasets contain sketches of a limited set of generic objects, each new domain inevitably requires collecting new data for training domain specific recognizers. This gives rise to two fundamental concerns: First, will the data collection protocol yield ecologically valid data? Second, will the amount of collected data suffice to train sufficiently accurate classifiers? In this paper, we draw attention to these two concerns. We show that the ecological validity of the data collection protocol and the ability to accommodate small datasets are significant factors impacting recognizer accuracy in realistic scenarios. More specifically, using sketch-based gaming as a use case, we show that deep learning methods, as well as…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
