Comments:
Yue
Summary:
In this paper, the author proposed a graph-based recognizer. Each sketch symbol is represented by attributes relational graph, where vertices represent a primitive, and each edge represents a relation between primitives.
For every input, the author did a graph marching to find the each corresponding node between two graphs. This is well-known NP -complete problem. However, author gives some approximate the best solution. The author defines six different marching score metric in this paper as well as its weight value, which get from empirical study. Result shows that about 93% accuracy.
Discussion:
The key idea of this paper is the graph matching problem that the author tried to solve. The accuracy depends on how well the approximate isomorphism algorithm. More improvement can be made here.
Isomorphism, always the isomorphism that's the word I learned from you in this class.
ReplyDelete