A Method of Graph-Based Composite Sketchy Graphics Recognition
Zhang Li · 2004
Composite sketchy graphics recognition is a difficult task in sketch-based graphics input. Existing sketchy graphics recognition ways have emphasized on simple graphic objects and have not suited for recognition of composite graphic objects with different complexity. This paper presents a graph-based uniform representation for composite graphic objects with different complexity, which, concerts them respectively into Spatial Relation Graph (SRGs)in different information granularity. Accordingly, a Constrained Partial Permutation algorithm is proposed to. reduce state space in matching SRGs for recqgnizing composite sketchy graphics by predicting the directly next state of the current state and neglect invalid states in order- Experiments show that the proposed method can be adapted for recognition of various composite graphic objects with different complexity.