arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1208.1430math.NAcs.NA
收藏

高效快速行进法用于Finsler度量

Efficient Fast Marching with Finsler metrics

CNRS, University Paris Dauphine(法国国家科学研究中心,巴黎第九大学)

Jean-Marie Mirebeau

AI总结:

提出FM-ASR算法,通过算术平均构造局部模板,解决二维笛卡尔网格上Finsler度量下的逃逸时间问题,在精度与复杂度权衡上提升一个数量级以上。

摘要:

我们研究了逃逸时间问题的离散化:找到域内任意一点到域边界的最短路径长度。路径长度通过Finsler度量局部测量,该度量可能非对称且强各向异性。该最优控制问题可以重新表述为静态Hamilton-Jacobi或各向异性Eikonal偏微分方程,以及前沿传播模型。它在从运动规划到图像分割的众多应用中都有应用。我们提出了一种新算法,即使用各向异性模板细化的快速行进法(FM-ASR),该算法在笛卡尔网格上离散化的二维域上解决此问题。我们离散化中使用的局部模板通过算术平均产生。FM-ASR的复杂度,在所有网格方向的平均意义上,仅(多)对数依赖于度量的各向异性比,而大多数替代方法具有多项式依赖性。数值实验表明,在多种情况下,精度/复杂度权衡改善了一个数量级或更多。

英文摘要:

We study the discretization of the Escape Time problem: find the length of the shortest path joining an arbitrary point of a domain, to the domain's boundary. Path length is measured locally via a Finsler metric, potentially asymmetric and strongly anisotropic. This Optimal Control problem can be reformulated as a static Hamilton Jacobi, or Anisotropic Eikonal, Partial Differential Equation, as well as a front propagation model. It has numerous applications, ranging from motion planning to image segmentation. We introduce a new algorithm, Fast Marching using Anisotropic Stencil Refinement (FM-ASR), which addresses this problem on a two dimensional domain discretized on a cartesian grid. The local stencils used in our discretization are produced by arithmetic means. The complexity of the FM-ASR, in an average sense over all grid orientations, only depends (poly-)logarithmically on the anisotropy ratio of the metric, while most alternative approaches have a polynomial dependence. Numerical experiments show, in several occasions, that the accuracy/complexity compromise is improved by an order of magnitude or more.

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

↑