高技术通讯Issue(10)：1-11,11.DOI:10.3772/j.issn.10020470.2014.10.001
基于局部随机游走的超像素分割方法
Superpixel segmentation based on local random walk
摘要
Abstract
A novel approach to generate superpixels based on local lazy random walk (LLRW) was proposed to improve the compactness of superpixels and reduce the computational complexity. The superpixel segmentation was formulated as a problem of local partition of pixel adjacency graphs, and an intuitive quality measure for superpixel segmentation was given. The LLRW approach firstly initializes the centroids of uniformly titled hexagons as the positions of superpixel seeds, and then uses the local lazy random walk (LLRW) algorithm to calculate the correlation between nearby pixels and superpixel seeds, and sets the label of each pixel as the label of its most correlated seed. Finally, it calculates the new centroids of superpixels as the next iteration’s seed positions, and iterates these steps to refine the superpixel segmentation result. This algorithm has the linear time complexity and the space complexity, as well as a theoretical guarantee on the quality of superpixels. The experimental results show that the new method can preserve smooth boundaries and generate compact superpixels, so it is an ideal algorithm for real world applications.关键词
超像素分割/归一化割/局部图划分/传导率/局部懒惰随机游走(LLRW)Key words
superpixel segmentation/normalized cut/local graph partition/conductance/local lazy random walk (LLRW)引用本文复制引用
苗军,卿来云,陈熙霖,马志国..基于局部随机游走的超像素分割方法[J].高技术通讯,2014,(10):1-11,11.基金项目
973计划(2009CB320900)和国家自然科学基金(61175115,61272320,61070116)资助项目。 （2009CB320900）
