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

快速求解eikonal方程的方法:实验调查

Fast Methods for Eikonal Equations: an Experimental Survey

Carlos III University of Madrid(马德里卡洛斯三世大学)

Javier V. Gomez, David Alvarez, Santiago Garrido, Luis Moreno

AI总结:

本文通过实验对比了9种改进标准快速推进法的算法,重点研究单线程方法和各向同性环境下的计算效率提升。

摘要:

快速推进法是一种计算到达时间地图(以时间单位测量距离地图)非常流行的算法。自1995年提出以来,它已被应用于许多不同领域,如机器人学、医学计算机视觉、流体模拟等。许多替代方法被提出,主要目标是减少计算时间并提高精度。本文收集了主要改进标准快速推进法计算时间的方法,重点研究单线程方法和各向同性环境。9种不同方法在共同的数学框架下进行实验,在代表性环境中进行研究:具有二叉堆的快速推进法、具有斐波那契堆的快速推进法、简化快速推进法、Untidy快速推进法、快速迭代法、群体推进法、快速扫描法、锁定扫描法和双动态队列法。

英文摘要:

The Fast Marching Method is a very popular algorithm to compute times-of-arrival maps (distances map measured in time units). Since their proposal in 1995, it has been applied to many different applications such as robotics, medical computer vision, fluid simulation, etc. Many alternatives have been proposed with two main objectives: to reduce its computational time and to improve its accuracy. In this paper, we collect the main approaches which improve the computational time of the standard Fast Marching Method, focusing on single-threaded methods and isotropic environments. 9 different methods are studied under a common mathematical framework and experimentally in representative environments: Fast Marching Method with binary heap, Fast Marching Method with Fibonacci Heap, Simplified Fast Marching Method, Untidy Fast Marching Method, Fast Iterative Method, Group Marching Method, Fast Sweeping Method, Lock Sweeping Method and Double Dynamic Queue Method.

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

↑