欧几里得距离函数的新变分原理:非线性程函问题的线性方法
A new variational principle for the Euclidean distance function: Linear approach to the non-linear eikonal problem
AI总结:
提出一种基于卷积的快速算法,通过求解线性微分方程并取负对数来近似计算欧几里得距离函数,利用快速傅里叶变换高效实现,避免了传统方法对非线性Hamilton-Jacobi方程的直接求解。
摘要:
我们提出了一种基于卷积的快速技术,用于在二维和三维网格位置上计算近似的有符号欧几里得距离函数 $S$。我们的方法不是求解非线性的静态Hamilton-Jacobi方程($\\|\nabla S\\|=1$),而是首先求解线性微分方程中的标量场 $\phi$,然后通过取负对数推导出 $S$ 的解。换句话说,当 $S$ 和 $\phi$ 通过 $\phi = \exp\left(-\frac{S}{\tau}\right)$ 关联,且 $\phi$ 满足对应于变分问题极值的特定线性微分方程时,我们得到近似的欧几里得距离函数 $S = -\tau\log(\phi)$,该函数在 $\tau\rightarrow 0$ 的极限下收敛于真实解。这与快速行进法和快速扫描法等直接通过Godunov迎风离散格式求解Hamilton-Jacobi方程的技术形成鲜明对比。我们的线性公式导致近似欧几里得距离函数的闭式解可表示为离散卷积,因此可通过快速傅里叶变换(FFT)高效计算。我们的解还避免了对导数算子进行空间离散化的需要。当 $\tau\rightarrow 0$ 时,我们展示了结果收敛于真实解,并针对给定的 $\tau$ 值限定了误差。我们解的可微性允许我们通过一组卷积计算近似距离函数的一阶和二阶导数。为了确定距离函数的符号(定义为在封闭区域内为正,区域外为负),我们计算二维中的缠绕数和三维中的拓扑度,这些计算也可以通过快速卷积进行。我们通过一组实验结果证明了我们方法的有效性。
英文摘要:
We present a fast convolution-based technique for computing an approximate, signed Euclidean distance function $S$ on a set of 2D and 3D grid locations. Instead of solving the non-linear, static Hamilton-Jacobi equation ($\|\nabla S\|=1$), our solution stems from first solving for a scalar field $ϕ$ in a linear differential equation and then deriving the solution for $S$ by taking the negative logarithm. In other words, when $S$ and $ϕ$ are related by $ϕ= \exp \left(-\frac{S}τ \right)$ and $ϕ$ satisfies a specific linear differential equation corresponding to the extremum of a variational problem, we obtain the approximate Euclidean distance function $S = -τ\log(ϕ)$ which converges to the true solution in the limit as $τ\rightarrow 0$. This is in sharp contrast to techniques like the fast marching and fast sweeping methods which directly solve the Hamilton-Jacobi equation by the Godunov upwind discretization scheme. Our linear formulation results in a closed-form solution to the approximate Euclidean distance function expressible as a discrete convolution, and hence efficiently computable using the fast Fourier transform (FFT). Our solution also circumvents the need for spatial discretization of the derivative operator. As $τ\rightarrow0$ we show the convergence of our results to the true solution and also bound the error for a given value of $τ$. The differentiability of our solution allows us to compute---using a set of convolutions---the first and second derivatives of the approximate distance function. In order to determine the sign of the distance function (defined to be positive inside a closed region and negative outside), we compute the winding number in 2D and the topological degree in 3D, whose computations can also be performed via fast convolutions. We demonstrate the efficacy of our method through a set of experimental results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。