Techniques for assessing polygonal approximations of curves

被引:171
作者
Rosin, PL
机构
[1] Department of Computer Science and Information Systems, Brunei University, Uxbridge, Middlesex
关键词
polygonal approximation; assessment; optimal breakpoints; dynamic programming;
D O I
10.1109/34.601253
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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 [37]; their 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.
引用
收藏
页码:659 / 666
页数:8
相关论文
共 42 条
[1]  
ABE K, 1993, INT C DOC AN REC, P954
[3]   NONPARAMETRIC DOMINANT POINT DETECTION [J].
ANSARI, N ;
HUANG, KW .
PATTERN RECOGNITION, 1991, 24 (09) :849-862
[4]   A PIECEWISE LINEAR-APPROXIMATION METHOD PRESERVING VISUAL FEATURE POINTS OF ORIGINAL FIGURES [J].
AOYAMA, H ;
KAWAGOE, M .
CVGIP-GRAPHICAL MODELS AND IMAGE PROCESSING, 1991, 53 (05) :435-446
[5]   FINDING CONTOUR-BASED ABSTRACTIONS OF PLANAR PATTERNS [J].
ARCELLI, C ;
RAMELLA, G .
PATTERN RECOGNITION, 1993, 26 (10) :1563-1577
[6]  
BANERJEE S, 1996, 10007 RJ IBM RES DIV
[7]   POLYGONAL-APPROXIMATION USING A COMPETITIVE HOPFIELD NEURAL-NETWORK [J].
CHUNG, PC ;
TSAI, CT ;
CHEN, EL ;
SUN, YN .
PATTERN RECOGNITION, 1994, 27 (11) :1505-1512
[8]  
DEGUCHI A, 1990, INT C PATT REC, V1, P865
[9]  
DOUGLAS DH, 1973, CANADIAN CARTOGRAPHE, V10, P111