Handling ambiguity in constraint-based recognition of stick figure sketches

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 4670, Issue , 2002, Pages 89-100

  Mahoney, James V ^a   Fromherz, Markus P J ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

Author keywords

Diagram understanding; Graph elaboration; Segmentation ambiguity; Sketch recognition; Subgraph matching

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAM LISTINGS; CONSTRAINT THEORY; DRAWING (GRAPHICS); GRAPH THEORY;

SEGMENTATION AMBIGUITY;

OBJECT RECOGNITION;

EID: 0036028555     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.450718     Document Type: Conference Paper

References (14)

1. D. Bainbridge and T. Bell. An extensible optical music recognition system. In Proc. Nineteenth Australasian Computer Science Conf., 1996.
2. M. Carlsson, G. Ottosson, B. Carlson. An open-ended finite domain constraint solver. Proc. Programming Languages: Implementations, Logics, and Programs, 1997.
3. S. Chok, K. Marriot. Parsing visual languages. Proc. 18th Australasian Computer Science Conf., 27(1), 1995: 90-98.
4. T. Cormen, C. Leiserson, R. Rivest. Introduction to Algorithms. Cambridge, MA: M.I.T. Press, 1990.
5. B. Couasnon, P. Brisset, I. Stephan. Using logic programming languages for optical music recognition. Proc. 3rd Int. Conf. on Practical Application of Prolog, Paris, 1995.
6. H. Fahmy and D. Blostein. A graph-rewriting paradigm for discrete relaxation: application to sheet music recognition. Int. Journal of Pattern Recognition and Artificial Intelligence, Vol. 12, No. 6, Sept. 1998,pp. 763-799.
7. M. Fromherz and J. Mahoney. Interpreting sloppy stick figures with constraint-based subgraph matching. 7th Int. Conf. on Principles and Practice of Constraint Programming. Paphos, Cyprus: 2001.
8. D. Isenor and S. Zaky. Fingerprint identification using graph matching. Pattern Recognition, vol. 19, no. 2, 1986, pp. 113-122.
9. J. Larrosa and G. Valiente, Constraint satisfaction algorithms for graph pattern matching. Under consideration for publication in J. Math. Struct. in Computer Science, 2001.
10. J. Mahoney and M. Fromherz. Interpreting sloppy stick figures by graph rectification and constraint-based matching. 4th IAPR Int. Workshop on Graphics Recognition: Kingston, Ontario: Sept., 2001.
11. B. Messmer. Efficient graph matching algorithms for preprocessed model graphs. PhD thesis. Bern Univ., Switzerland, 1995.
12. E. Saund. Perceptual organization in an interactive sketch editor. 5th Int. Conf. on Computer Vision. Cambridge, MA: 1995: 597-604.
13. E. Saund. Perceptually closed paths in sketches and drawings. Submitted for publication.
14. L.G. Shapiro and R.M. Haralick. Structural descriptions and inexact matching. In IEEE PAMI, vol. 3, no. 5, Sept. 1981, pp. 504-519.