Techniques for assessing polygonal approximations of curves
Rosin, P.L.
Dept. of Comput. Sci. & Inf. Syst., Brunel Univ., Uxbridge;
This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Jun 1997
Volume: 19,
Issue: 6
On page(s): 659-666
ISSN: 0162-8828
References Cited: 42
CODEN: ITPIDJ
INSPEC Accession Number: 5625820
Digital Object Identifier: 10.1109/34.601253
Current Version Published: 2002-08-06
Abstract
Given the enormous number of available methods for finding
polygonal approximations to curves techniques are required to assess
different algorithms. Some of the standard approaches are shown to be
unsuitable if the approximations contain varying numbers of lines.
Instead, we suggest assessing an algorithm's results relative to an
optimal polygon, and describe a measure which combines the relative
fidelity and efficiency of a curve segmentation. We use this measure to
compare the application of 23 algorithms to a curve first used by Teh
and Chin (1989); their integral square errors (ISEs) are assessed
relative to the optimal ISE. In addition, using an example of pose
estimation, it is shown how goal-directed evaluation can be used to
select an appropriate assessment criterion
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
