POLYGONAL-APPROXIMATION OF DIGITAL CURVE BY GRADUATE ITERATIVE MERGING

被引：2
|
作者：
KU, KM
CHIU, PK
机构：
[1] Department of Electronic Engineering, Hong Kong Polytechnic University, Kowloon, Hung Horn
来源：
ELECTRONICS LETTERS | 1995年 / 31卷 / 06期
关键词：
PATTERN RECOGNITION; COMPUTER GRAPHICS; EDGE DETECTION;
D O I：
10.1049/el:19950319
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
In the Letter a graduate iterative merging algorithm for polygon approximation is described. The algorithm always gives a minimum area difference between the curve and the polygon with the minimum number of breakpoints. Realisation of the algorithm is compared with other algorithms as tested on good and noisy images, and the performance is very close to that of a human viewer.
引用
收藏
页码：444 / 446
页数：3
相关论文
共 50 条
12345