Paper
Hammond, Tracy, and Brandon Paulson. "Recognizing sketched multistroke primitives." ACM Transactions on Interactive Intelligent Systems (TiiS) 1.1 (2011): 4.
Publication Link: http://dl.acm.org/citation.cfm?id=2030369
Hammond, Tracy, and Brandon Paulson. "Recognizing sketched multistroke primitives." ACM Transactions on Interactive Intelligent Systems (TiiS) 1.1 (2011): 4.
Publication Link: http://dl.acm.org/citation.cfm?id=2030369
Summary
The motivation behind this paper is to develop an algorithm that handles one of the major flaws in the way humans draw sketches. The authors use the term "multistroke" to describe the process of modifying a sketch using an additional stroke. This, they highlight, causes a number of issues for highlevel recognizers, which typically identify the two strokes as independent sketches.
The authors propose a novel graph technique that is able to group strokes together using a novel graph building and linear search algorithm that identifies potential objects as composite strokes of strongly connected components.
Discussion
The authors propose a novel graph technique that is able to group strokes together using a novel graph building and linear search algorithm that identifies potential objects as composite strokes of strongly connected components.
Discussion
Pros
Their approach to using strongly connected components is very interesting and creative. I think that making the graph building and search algorithm suitable for real time applications was interesting.
Cons.
What would the impact of adding time to their algorithm be? How much cost is associated with using a time threshold in cases when a person goes back much much later to add additional strokes? Perhaps combining time and proximity might help solve the arrow issue?
No comments:
Post a Comment