Institute of Imaging Science, Vanderbilt University, Nashville, TN 37232, USA.
IEEE Trans Image Process. 2010 Dec;19(12):3243-54. doi: 10.1109/TIP.2010.2069690. Epub 2010 Aug 26.
Level set methods have been widely used in image processing and computer vision. In conventional level set formulations, the level set function typically develops irregularities during its evolution, which may cause numerical errors and eventually destroy the stability of the evolution. Therefore, a numerical remedy, called reinitialization, is typically applied to periodically replace the degraded level set function with a signed distance function. However, the practice of reinitialization not only raises serious problems as when and how it should be performed, but also affects numerical accuracy in an undesirable way. This paper proposes a new variational level set formulation in which the regularity of the level set function is intrinsically maintained during the level set evolution. The level set evolution is derived as the gradient flow that minimizes an energy functional with a distance regularization term and an external energy that drives the motion of the zero level set toward desired locations. The distance regularization term is defined with a potential function such that the derived level set evolution has a unique forward-and-backward (FAB) diffusion effect, which is able to maintain a desired shape of the level set function, particularly a signed distance profile near the zero level set. This yields a new type of level set evolution called distance regularized level set evolution (DRLSE). The distance regularization effect eliminates the need for reinitialization and thereby avoids its induced numerical errors. In contrast to complicated implementations of conventional level set formulations, a simpler and more efficient finite difference scheme can be used to implement the DRLSE formulation. DRLSE also allows the use of more general and efficient initialization of the level set function. In its numerical implementation, relatively large time steps can be used in the finite difference scheme to reduce the number of iterations, while ensuring sufficient numerical accuracy. To demonstrate the effectiveness of the DRLSE formulation, we apply it to an edge-based active contour model for image segmentation, and provide a simple narrowband implementation to greatly reduce computational cost.
水平集方法已广泛应用于图像处理和计算机视觉领域。在传统的水平集公式中,水平集函数在演化过程中通常会出现不规则现象,这可能导致数值误差,并最终破坏演化的稳定性。因此,通常会应用一种数值修正方法,称为重新初始化,定期用符号距离函数替换退化的水平集函数。然而,重新初始化的实践不仅提出了何时以及如何执行的严重问题,而且还以不理想的方式影响数值精度。本文提出了一种新的变分水平集公式,在该公式中,水平集函数的规则性在水平集演化过程中得到了内在的保持。水平集演化是作为最小化能量泛函的梯度流推导出来的,该能量泛函具有距离正则化项和外部能量,外部能量驱使零水平集向期望的位置运动。距离正则化项是通过定义势函数来定义的,使得推导出来的水平集演化具有独特的前向-后向(FAB)扩散效应,该效应能够保持水平集函数的期望形状,特别是在零水平集附近的符号距离轮廓。这产生了一种新的水平集演化,称为距离正则化水平集演化(DRLSE)。距离正则化效应消除了重新初始化的需要,从而避免了其引起的数值误差。与传统水平集公式的复杂实现相比,更简单、更有效的有限差分方案可用于实现 DRLSE 公式。DRLSE 还允许使用更通用和有效的水平集函数初始化。在数值实现中,可以在有限差分方案中使用较大的时间步长来减少迭代次数,同时确保足够的数值精度。为了演示 DRLSE 公式的有效性,我们将其应用于基于边缘的主动轮廓模型进行图像分割,并提供了一种简单的窄带实现方法,以大大降低计算成本。