A Combinatorial Approach to Multi-Domain Sketch Recognition

Simple item page
dc.contributor.authorHall, A.en_US
dc.contributor.authorPomm, C.en_US
dc.contributor.authorWidmayer, P.en_US
dc.contributor.editorMichiel van de Panne and Eric Saunden_US
dc.date.accessioned2014-01-28T17:52:42Z
dc.date.available2014-01-28T17:52:42Z
dc.date.issued2007en_US
dc.description.abstractIn 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.en_US
dc.description.seriesinformationEUROGRAPHICS Workshop on Sketch-Based Interfaces and Modelingen_US
dc.identifier.isbn978-3-905674-00-2en_US
dc.identifier.issn1812-3503en_US
dc.identifier.urihttps://doi.org/10.2312/SBM/SBM07/007-014en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.7.5 [Document and Text Processing]: Graphics Recognition and Interpretationen_US
dc.titleA Combinatorial Approach to Multi-Domain Sketch Recognitionen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
007-014.pdf
Size:
2.14 MB
Format:
Adobe Portable Document Format
Download
Collections
SBM07: Sketch Based Interfaces and Modeling 2007