Minimum description length arc spline approximation of digital curves
Minimum description length arc spline approximation of digital curves
复制标题
数字曲线的最小描述长度圆弧样条逼近
DOI：
10.1109/icip.2012.6467248
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
A. Schindler
中科院分区：
文献类型：
--
作者：
G. Maier;F. Janda;A. Schindler
提出了一种数字曲线的无监督双模型逼近方法。对于任何最大公差，我们都可以得到圆弧和直线段平滑连接的最小数量。结果曲线的断点既不限于像素离散，也不一定要从有限的点集合中选择。相反，它们是自动计算的。这对分段的数量有相当积极的影响。此外，我们还提出了一种对逼近曲线进行编码的非常有效的方法。因此，我们得到了任意公差的最小描述长度。通过描述长度、拟合误差和长度-角度表示等特性的不同例子说明了该方法的性能。
We present a method for an unsupervised two model approximation of digital curves. For any maximum tolerance, we obtain the minimum number of smoothly joined circular arcs and line segments. The breakpoints of the resulting curve are neither restricted to be pixel discrete nor they have to be chosen from a finite set of points. Instead, they are computed automatically. This has a considerably positive effect on the number of segments. In addition, we present a very efficient way to encode the approximating curve. Thus, we achieve the minimum description length for any tolerance. The performance of the proposed method is illustrated by different examples including characteristics as the description length, the fitting error and the length-angle representation.