arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0906.3089cs.DMcs.CGcs.CY
收藏

离散正切估计的凸形与收敛速度

Convex shapes and convergence speed of discrete tangent estimators

Jacques-Olivier Lachaud, François De Vieilleville

摘要:

离散几何估计器的目标是仅以其数字化作为输入数据来估计形状的几何特征。当数字化步长h趋于0时,这种估计器的估计趋于形状的几何特征时,这种估计器是多重网格收敛的。研究了基于最大数字直线段识别的切线估计的多重网格收敛性。我们证明了这类估计对某些凸形族是多重网格收敛的,并且它们的收敛速度平均为O(h^(2/3)).实验证实了这一结果,并表明该界限是紧的。

英文摘要:

Discrete geometric estimators aim at estimating geometric characteristics of a shape with only its digitization as input data. Such an estimator is multigrid convergent when its estimates tend toward the geometric characteristics of the shape as the digitization step h tends toward 0. This paper studies the multigrid convergence of tangent estimators based on maximal digital straight segment recognition. We show that such estimators are multigrid convergent for some family of convex shapes and that their speed of convergence is on average O(h^(2/3)). Experiments confirm this result and suggest that the bound is tight.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑