SE(2)中的亚黎曼快速推进
Sub-Riemannian Fast Marching in SE(2)
AI总结:
本文提出了一种基于快速推进的方法,用于计算SE(2)罗托-平移群中的亚黎曼度量的测地线,利用图像数据诱导的成本,通过黎曼近似计算亚黎曼度量,并利用先进的快速推进求解器解决相应的eikonal方程,以获得测地线距离图,验证了方法的准确性及计算效率。
摘要:
我们提出了一种基于快速推进的实现,用于计算SE(2)罗托-平移群中的亚黎曼(SR)测地线,其度量依赖于由图像数据诱导的成本。关键成分是亚黎曼度量的黎曼近似。然后,一种能够处理极端各向异性状态的先进快速推进求解器被用来计算相应的eikonal方程的解,即SR距离图。随后对距离图的回溯给出测地线。为了验证该方法,我们考虑了均匀成本情况,其中已知SR测地线的精确公式,并展示了数值计算的SR球体具有显著的准确性。我们还展示了与之前基于偏微分方程的迭代方法相比,计算时间显著减少。在图像分析应用方面,我们展示了考虑这些数据自适应测地线用于全自动视网膜血管树分割的潜力。
英文摘要:
We propose a Fast Marching based implementation for computing sub-Riemanninan (SR) geodesics in the roto-translation group SE(2), with a metric depending on a cost induced by the image data. The key ingredient is a Riemannian approximation of the SR-metric. Then, a state of the art Fast Marching solver that is able to deal with extreme anisotropies is used to compute a SR-distance map as the solution of a corresponding eikonal equation. Subsequent backtracking on the distance map gives the geodesics. To validate the method, we consider the uniform cost case in which exact formulas for SR-geodesics are known and we show remarkable accuracy of the numerically computed SR-spheres. We also show a dramatic decrease in computational time with respect to a previous PDE-based iterative approach. Regarding image analysis applications, we show the potential of considering these data adaptive geodesics for a fully automated retinal vessel tree segmentation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。