๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[ACM Press ACM SIGGRAPH 2007 courses - San Diego, California (2007.08.05-2007.08.09)] ACM SIGGRAPH 2007 courses on - SIGGRAPH '07 - Hierarchical parsing and recognition of hand-sketched diagrams

โœ Scribed by Kara, Levent Burak; Stahovich, Thomas F.


Book ID
121434639
Publisher
ACM Press
Year
2007
Weight
311 KB
Category
Article
ISBN
1450318231

No coin nor oath required. For personal study only.

โœฆ Synopsis


A long standing challenge in pen-based computer interaction is the ability to make sense of informal sketches. A main difficulty lies in reliably extracting and recognizing the intended set of visual objects from a continuous stream of pen strokes. Existing pen-based systems either avoid these issues altogether, thus resulting in the equivalent of a drawing program, or rely on algorithms that place unnatural constraints on the way the user draws. As one step toward alleviating these difficulties, we present an integrated sketch parsing and recognition approach designed to enable natural, fluid, sketch-based computer interaction. The techniques presented in this paper are oriented toward the domain of network diagrams. In the first step of our approach, the stream of pen strokes is examined to identify the arrows in the sketch. The identified arrows then anchor a spatial analysis which groups the uninterpreted strokes into distinct clusters, each representing a single object. Finally, a trainable shape recognizer, which is informed by the spatial analysis, is used to find the best interpretations of the clusters. Based on these concepts, we have built SimuSketch, a sketch-based interface for Matlab's Simulink software package. An evaluation of Simu-Sketch has indicated that even novice users can effectively utilize our system to solve real engineering problems without having to know much about the underlying recognition techniques.


๐Ÿ“œ SIMILAR VOLUMES


[ACM Press ACM SIGGRAPH 2007 papers - Sa
โœ Guenter, Brian ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› ACM Press โš– 725 KB

Functions with densely interconnected expression graphs, which arise in computer graphics applications such as dynamics, spacetime optimization, and PRT, can be difficult to efficiently differentiate using existing symbolic or automatic differentiation techniques. Our new algorithm, D\*, computes ef