Share Email Print

Proceedings Paper

Handling ambiguity in constraint-based recognition of stick figure sketches
Author(s): James V. Mahoney; Markus P.J. Fromherz
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Even seemingly simple drawings, diagrams, and sketches are hard for computer programs to interpret, because these inputs can be highly variable in several respects. This variability corrupts the expected mapping between a prior model of a configuration and an instance of it in the scene. We propose a scheme for representing ambiguity explicitly, within a subgraph matching framework, that limits its impact on the computational and program complexity of matching. First, ambiguous alternative structures in the input are explicitly represented by coupled subgraphs of the data graph, using a class of segmentation post-processing operations termed graph elaboration. Second, the matching process enforces mutual exclusion constraints among these coupled alternatives, and preferences or rankings associated with them enable better matches to be found early on by a constrained optimization process. We describe several elaboration processes, and extend a straightforward constraint-based subgraph matching scheme to elaborated data graphs. The discussion focuses on the domain of human stick figures in diverse poses.

Paper Details

Date Published: 18 December 2001
PDF: 12 pages
Proc. SPIE 4670, Document Recognition and Retrieval IX, (18 December 2001); doi: 10.1117/12.450718
Show Author Affiliations
James V. Mahoney, Xerox Palo Alto Research Ctr. (United States)
Markus P.J. Fromherz, Xerox Palo Alto Research Ctr. (United States)

Published in SPIE Proceedings Vol. 4670:
Document Recognition and Retrieval IX
Paul B. Kantor; Tapas Kanungo; Jiangying Zhou, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?