arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1205.5300math.NAcs.NA
收藏

各向异性快速行进算法的精度

On the Accuracy of Anisotropic Fast Marching

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

J. -M. Mirebeau

AI总结:

针对黎曼度量下广义程函方程的快速行进算法,本文在常度量简化设定下证明了一种基于格基约化的变体算法在平均意义下的精度对各向异性比率不敏感,并将其推广到高维。

摘要:

快速行进算法及其变体数值求解了与底层黎曼度量相关的广义程函方程。这些算法面临的一个主要挑战是黎曼度量的非各向同性。程函方程在图像处理中的应用通常涉及显著的各向异性,这促使了新算法的设计。最近引入的一种快速行进算法变体使用一种名为格基约化的代数工具来解决大各向异性的问题。在弱假设下,该算法的数值复杂度对各向异性不敏感。本文在常黎曼度量的简化设定下证明,该算法的精度对各向异性也极其鲁棒:在平均意义上,它与各向异性比率无关。我们还将该算法推广到更高维度。

英文摘要:

The fast marching algorithm, and its variants, solves numerically the generalized eikonal equation associated to an underlying riemannian metric. A major challenge for these algorithms is the non-isotropy of the riemannian metric. Applications of the eikonal equation to image processing often involve pronounced anisotropies, which motivated the design of new algorithms. A recently introduced variant of the fast marching algorithm addresses the problem of large anisotropies using an algebraic tool named lattice basis reduction. The numerical complexity of this algorithm is insensitive to anisotropy, under weak assumptions. We establish in this paper, in the simplified setting of a constant riemannian metric, that the accuracy of this algorithm is also extremely robust to anisotropy : in an average sense, it is independent of the anisotropy ratio. We also extend this algorithm to higher dimension.

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

↑