关于快速行进法O(N)实现的评述
Remarks on the O(N) Implementation of the Fast Marching Method
AI总结:
本文针对快速行进法的O(N)实现,基于离散比较原理给出误差显式估计,指出精度选择独立于速度函数时复杂度为O(Fmax/Fmin N),并通过数值实验展示大比值下的鲁棒性问题。
摘要:
快速行进算法以O(N log N)时间计算程函方程的近似解,其中log N因子源于优先队列的管理。最近,Yatziv、Bartesaghi和Sapiro建议使用非整洁优先队列,以计算解中引入小误差为代价,将总体复杂度降低至O(N)。本文基于离散比较原理,给出了所引入误差的显式估计。该估计特别表明,选择与速度函数F无关的精度水平会导致复杂度界O(Fmax /Fmin N)。数值实验展示了在Fmax /Fmin比值较大时这一鲁棒性问题。
英文摘要:
The fast marching algorithm computes an approximate solution to the eikonal equation in O(N log N) time, where the factor log N is due to the administration of a priority queue. Recently, Yatziv, Bartesaghi and Sapiro have suggested to use an untidy priority queue, reducing the overall complexity to O(N) at the price of a small error in the computed solution. In this paper, we give an explicit estimate of the error introduced, which is based on a discrete comparison principle. This estimates implies in particular that the choice of an accuracy level that is independent of the speed function F results in the complexity bound O(Fmax /Fmin N). A numerical experiment illustrates this robustness problem for large ratios Fmax /Fmin .
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。