MergeCF : Eliminating false positives during corner finding by Merging Similar Segments

Comments

Summary

This paper actually discusses corner finding algorithm based on curvature and speed differences within a stroke. Once the corner are found from the algorithm tries to merge the smaller stroke segments with longer segments and if the fit for the segment is below a threshold that corner is removed between the two segments.

The segments after merging produces a low primitive error is used for merging and no merging is done if the error when merging the two segments is much higher that the sum of the original errors of the segments.

MergeCF has a high accuracy rate when compare to Sezgin and Kim.

Discussion

This algorithm is extension to corner finding algorithms from Sezgin and ShortStraw for arcs which rely on curvature and speed differences and then uses the top down approach for eliminating the false positives.