Improving fitting quality of polygonal approximation by using the dynamic programming technique

被引:17
作者
Horng, JH [1 ]
机构
[1] Natl Kaohsiung Univ Appl Sci, Dept Informat Management, Kaohsiung, Taiwan
关键词
curve fitting; polygonal approximation; dynamic programming; dominant point detection; scale-space filtering;
D O I
10.1016/S0167-8655(02)00129-0
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The dynamic programming technique is applied to improve the fitting quality of polygonal approximation. The dominant points of a digital curve are detected by applying a scale-based approach. Then, a polygonal approximation of the digital curve can be obtained by connecting its dominant points. The fitting quality of the polygonal approximation is improved by using a novel dynamic programming algorithm. The combination of the dominant point detection and the dynamic programming can produce a description that has high geometric importance and good fitting quality. Experimental results are provided and compared with several existing methods to show the excellence of the proposed method. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:1657 / 1673
页数:17
相关论文
共 30 条
[2]   NONPARAMETRIC DOMINANT POINT DETECTION [J].
ANSARI, N ;
HUANG, KW .
PATTERN RECOGNITION, 1991, 24 (09) :849-862
[3]   SOME INFORMATIONAL ASPECTS OF VISUAL PERCEPTION [J].
ATTNEAVE, F .
PSYCHOLOGICAL REVIEW, 1954, 61 (03) :183-193
[4]   THE LAPLACIAN PYRAMID AS A COMPACT IMAGE CODE [J].
BURT, PJ ;
ADELSON, EH .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (04) :532-540
[5]   Another look at the dominant point detection of digital curves [J].
Cornic, P .
PATTERN RECOGNITION LETTERS, 1997, 18 (01) :13-25
[6]   A boundary concavity code to support dominant point detection [J].
Cronin, TM .
PATTERN RECOGNITION LETTERS, 1999, 20 (06) :617-634
[7]   Boundary simplification using a multiscale dominant-point detection algorithm [J].
Garrido, A ;
de la Blanca, NP ;
Garcia-Silvente, M .
PATTERN RECOGNITION, 1998, 31 (06) :791-804
[8]   An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves [J].
Horng, JH ;
Li, JT .
PATTERN RECOGNITION LETTERS, 2002, 23 (1-3) :171-182
[9]  
Hu JM, 1997, PATTERN RECOGN, V30, P701, DOI 10.1016/S0031-3203(96)00105-7
[10]   Polygonal approximation using genetic algorithms [J].
Huang, SC ;
Sun, YN .
PATTERN RECOGNITION, 1999, 32 (08) :1409-1420