Sketch recognition algorithms for comparing complex and unpredictable shapes

Field, Martin, et al. "Sketch recognition algorithms for comparing complex and unpredictable shapes." IJCAI. 2011.
Direct Link: http://www.researchgate.net/profile/Tracy_Hammond/publication/220812144_Sketch_Recognition_Algorithms_for_Comparing_Complex_and_Unpredictable_Shapes/links/0deec529f76e510edf000000.pdf

Summary

This work describes the algorithms used in a previously discussed paper, which itself discusses a sketch-based tutoring system, Mechanix. In this work, the authors describe the algorithms used and provide some detail on the accuracy and results for a two class (match vs. no match) classification problem.

Discussion

Pros

Paper is well written and organized. Authors provide sufficient motivation for their work, as well as a good review of previous related work.

Cons.

I found it difficult to understand the use of BFS as described in the paper (even though I understand in principle how and why their approach works, this is not well communicated in the paper).

While the two class problem breakdown works well in the intended application, perhaps it would have been interesting to understand where the system fails (FP and FNs), the 'why' and the 'future' work suggestions.