A Combinatorial Approach to Multi-Domain Sketch Recognition

Hall, A.; Pomm, C.; Widmayer, P.

A Combinatorial Approach to Multi-Domain Sketch Recognition

Files

007-014.pdf (2.14 MB)

Date

2007

Authors

Hall, A.
Pomm, C.
Widmayer, P.

Publisher

The Eurographics Association

Abstract

In this paper we propose a combinatorial model for sketch recognition. Two fundamental problems, the evaluation of individual symbols and the interpretation of a complete sketch scene possibly containing several symbols, are expressed as combinatorial optimization problems. We settle the computational complexity of the combinatorial problems and present a branch and bound algorithm for computing optimal symbol confidences. To handle sketch scenes in practice we propose a modest restriction of drawing freedom and present an algorithm which only needs to compute a polynomial number of symbol confidences.

        @inproceedings{:10.2312/SBM/SBM07/007-014
,
booktitle = {EUROGRAPHICS Workshop on Sketch-Based Interfaces and Modeling
},
editor = {Michiel van de Panne and Eric Saund
},
title = {{A Combinatorial Approach to Multi-Domain Sketch Recognition
}},
author = {Hall, A. and 
Pomm, C. and 
Widmayer, P.
},
year = {2007
},
publisher = {The Eurographics Association
},
ISSN = {1812-3503
},
ISBN = {978-3-905674-00-2
},
DOI = {/10.2312/SBM/SBM07/007-014
}
}