Random walks for image segmentation
Random walks for image segmentation
复制标题
DOI：
10.1109/tpami.2006.233
复制
发表时间：
2006-11-01
影响因子：
23.6
通讯作者：
Grady, Leo
中科院分区：
文献类型：
--
作者：
Grady, Leo
提出了一种用于执行多标签、交互式图像分割的新方法。给定少量具有用户定义（或预定义）标签的像素，我们可以通过分析快速确定从每个未标记像素开始的随机游走器首先到达预标记像素之一的概率。通过将每个像素分配给计算出最大概率的标签，可以获得高质量的图像分割。该算法的理论特性是随着与离散势理论和电路的相应联系而发展的。该算法是使用标准算子的组合类似物和连续势理论的原理在离散空间（即图上）中制定的，使其可以应用于任意图上的任意维度。
A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or predefined) labels, one can analytically and quickly determine the probability that a random walker starting at each unlabeled pixel will first reach one of the prelabeled pixels. By assigning each pixel to the label for which the greatest probability is calculated, a high-quality image segmentation may be obtained. Theoretical properties of this algorithm are developed along with the corresponding connections to discrete potential theory and electrical circuits. This algorithm is formulated in discrete space (i.e., on a graph) using combinatorial analogues of standard operators and principles from continuous potential theory, allowing it to be applied in arbitrary dimension on arbitrary graphs.