Handling ambiguity in constraint-based recognition of stick figure sketches
暂无分享,去创建一个
[1] James V. Mahoney,et al. Interpreting Sloppy Stick Figures by Graph Rectification and Constraint-Based Matching , 2001, GREC.
[2] Robert M. Haralick,et al. Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[3] Javier Larrosa,et al. Constraint satisfaction algorithms for graph pattern matching , 2002, Mathematical Structures in Computer Science.
[4] Eric Saund,et al. Perceptual organization in an interactive sketch editing application , 1995, Proceedings of IEEE International Conference on Computer Vision.
[5] C. Brisset. Using Logic Programming Languages For Optical Music Recognition , 1995 .
[6] Dorothea Blostein,et al. A Graph-Rewriting Paradigm for Discrete Relaxation: Application to Sheet-Music Recognition , 1998, Int. J. Pattern Recognit. Artif. Intell..
[7] Eric Saund,et al. Finding Perceptually Closed Paths in Sketches and Drawings , 2003, IEEE Trans. Pattern Anal. Mach. Intell..
[8] Mats Carlsson,et al. An Open-Ended Finite Domain Constraint Solver , 1997, PLILP.
[9] James V. Mahoney,et al. Interpreting Sloppy Stick Figures with Constraint-Based Subgraph Matching , 2001, CP.
[10] David Bainbridge,et al. Extensible optical music recognition , 1997 .
[11] Safwat G. Zaky,et al. Fingerprint identification using graph matching , 1986, Pattern Recognit..