.png){kind=icon}
返回
Improving fitting quality of polygonal approximation by using the dynamic programming technique
.png){kind=icon}
PRE
AI
DOI：10.1016/S0167-8655(02)00129-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
curve fitting
polygonal approximation
dynamic programming
dominant point detection
scale-space filtering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
暂无机构信息
引用论文
Developmental changes in the major inclusion bodies of polytene nuclei from larval tissues of the blowfly, Calliphora stygia.png)
Chromosoma
ChromosomaIF0
PREAI
分享收藏Reliable polygonal approximations of imaged real objects through dominant point detectionPATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏分享收藏
查看更多内容