期刊
PATTERN RECOGNITION
卷 41, 期 1, 页码 227-239出版社
ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2007.05.021
关键词
dominant points; polygonal approximation; DP table; associated error value; optimal algorithm
An algorithm for polygonal approximation based on dominant point (DP) deletion is presented in this paper. The algorithm selects an initial set of DPs and starts eliminating them one by one depending upon the error associated with each DP. The associated error value is based on global measure. A local optimization of few neighboring points is performed after each deletion. Although the algorithm does not guarantee an optimal solution, the combination of local and global optimization is expected to produce optimal results. The algorithm is extensively tested on various shapes with varying number of DPs and error threshold. In general, optimal results were observed for about 96% of the times. A good comparative study is also presented in this paper (C) 2007 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据