For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Boundary-Aware Superpixel Segmentation Based on Minimum Spanning Tree
Li XU Bing LUO Zheng PEI
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2018/06/01
Online ISSN: 1745-1361
Type of Manuscript: LETTER
Category: Image Recognition, Computer Vision
superpixel segmentation, boundary-aware, minimum spanning tree,
Full Text: PDF(1.8MB)>>
In this paper, we propose a boundary-aware superpixel segmentation method, which could quickly and exactly extract superpixel with a non-iteration framework. The basic idea is to construct a minimum spanning tree (MST) based on structure edge to measure the local similarity among pixels, and then label each pixel as the index with shortest path seeds. Intuitively, we first construct MST on the original pixels with boundary feature to calculate the similarity of adjacent pixels. Then the geodesic distance between pixels can be exactly obtained based on two-round tree recursions. We determinate pixel label as the shortest path seed index. Experimental results on BSD500 segmentation benchmark demonstrate the proposed method obtains best performance compared with seven state-of-the-art methods. Especially for the low density situation, our method can obtain the boundary-aware oversegmentation region.