科研之友
微信
新浪微博
Facebook
分享链接
摘要
We present IStraw, a corner finding technique based on the ShortStraw algorithm. This new algorithm addresses deficiencies with ShortStraw while maintaining its simplicity and efficiency. We also develop an extension for ink strokes containing curves and arcs. We compare our algorithm against ShortStraw and two other state of the art corner finding approaches, MergeCF and Sezgin's scale space algorithm. Based on an all-or-nothing accuracy metric, IStraw shows significant improvements over these algorithms for ink strokes with and without curves.
- 出版日期2010-10
