Piecewise polygonal approximation of digital curves

被引:10
作者
Sarfraz, M [1 ]
Asim, MR [1 ]
Masood, A [1 ]
机构
[1] King Fahd Univ Petr & Minerals, Dept Informat & Comp Sci, Dhahran 31261, Saudi Arabia
来源
EIGHTH INTERNATIONAL CONFERENCE ON INFORMATION VISUALISATION, PROCEEDINGS | 2004年
关键词
D O I
10.1109/IV.2004.1320262
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we present a recursive algorithm for piecewise polygonal approximation of a digital curves. The idea behind is to look for an optimal solution while approximating the given curve segment with a set of longest and minimum line segments such that the maximum squared error is less than the given threshold. The given curve is divided into pieces and parallel processing can be applied to each piece of curve thus making it computationally more efficient. Experimental results show that the proposed method has promising results.
引用
收藏
页码:991 / 996
页数:6
相关论文
共 20 条
[1]   NONPARAMETRIC DOMINANT POINT DETECTION [J].
ANSARI, N ;
HUANG, KW .
PATTERN RECOGNITION, 1991, 24 (09) :849-862
[2]   FINDING CONTOUR-BASED ABSTRACTIONS OF PLANAR PATTERNS [J].
ARCELLI, C ;
RAMELLA, G .
PATTERN RECOGNITION, 1993, 26 (10) :1563-1577
[3]   SOME INFORMATIONAL ASPECTS OF VISUAL PERCEPTION [J].
ATTNEAVE, F .
PSYCHOLOGICAL REVIEW, 1954, 61 (03) :183-193
[4]   A boundary concavity code to support dominant point detection [J].
Cronin, TM .
PATTERN RECOGNITION LETTERS, 1999, 20 (06) :617-634
[6]  
Freeman H., 1961, IRE T ELECTRON COMPU, V10, P260, DOI DOI 10.1109/TEC.1961.5219197
[7]   POLYGONAL-APPROXIMATION BY THE MINIMAX METHOD [J].
KUROZUMI, Y ;
DAVIS, WA .
COMPUTER GRAPHICS AND IMAGE PROCESSING, 1982, 19 (03) :248-264
[8]   3-DIMENSIONAL OBJECT RECOGNITION FROM SINGLE TWO-DIMENSIONAL IMAGES [J].
LOWE, DG .
ARTIFICIAL INTELLIGENCE, 1987, 31 (03) :355-395
[9]   A new algorithm for dominant points detection and polygonization of digital curves [J].
Marji, M ;
Siy, P .
PATTERN RECOGNITION, 2003, 36 (10) :2239-2251
[10]  
Ramer U., 1972, Comput Graph Image Process, V1, P244, DOI [10.1016/S0146-664X(72)80017-0, DOI 10.1016/S0146-664X(72)80017-0]