作者: Leo Grady , Gareth Funka-Lea
DOI: 10.1007/978-3-540-27816-0_20
关键词: Minimum spanning tree-based segmentation 、 Image segmentation 、 Scale-space segmentation 、 Pixel 、 Segmentation-based object categorization 、 Graph (abstract data type) 、 Discrete space 、 Random walker algorithm 、 Computer science 、 Computer vision 、 Artificial intelligence 、 Algorithm
摘要: A novel method is proposed for performing multi-label, semi-automated image segmentation. Given a small number of pixels with user-defined labels, one can analytically (and quickly) determine the probability that random walker starting at each unlabeled pixel will first reach pre-labeled pixels. By assigning to label which greatest calculated, high-quality segmentation may be obtained. Theoretical properties this algorithm are developed along corresponding connections discrete potential theory and electrical circuits. This formulated in space (i.e., on graph) using combinatorial analogues standard operators principles from continuous theory, allowing it applied arbitrary dimension.