Authors

Y. Y. Xiong;J. J. LaViola

Comments

Authors: contact us about adding a copy of your work at [email protected]

Abbreviated Journal Title

Comput. Graph.-UK

Keywords

ShortStraw; Corner finding; Polyline ink strokes; Sketch recognition; SYMBOL RECOGNIZER; SEGMENTATION; CURVES; Computer Science, Software Engineering

Abstract

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. (C) 2010 Elsevier Ltd. All rights reserved.

Journal Title

Computers & Graphics-Uk

Volume

34

Issue/Number

5

Publication Date

1-1-2010

Document Type

Article

Language

English

First Page

513

Last Page

527

WOS Identifier

WOS:000282529400004

ISSN

0097-8493

Download

Share

COinS
 

Accessibility Statement

This item was created or digitized prior to April 24, 2027, or is a reproduction of legacy media created before that date. It is preserved in its original, unmodified state specifically for research, reference, or historical recordkeeping. In accordance with the ADA Title II Final Rule, the University Libraries provides accessible versions of archival materials upon request. To request an accommodation for this item, please submit an accessibility request form.