Graph-Based Segmentation for RGB-D Data Using 3-D Geometry Enhanced Superpixels
Lists
Only you see this
Abstract
With the advances of depth sensing technologies, color image plus depth information (referred to as RGB-D data hereafter) is more and more popular for comprehensive description of 3-D scenes. This paper proposes a two-stage segmentation method for RGB-D data: 1) oversegmentation by 3-D geometry enhanced superpixels and 2) graph-based merging with label cost from superpixels. In the oversegmentation stage, 3-D geometrical information is reconstructed from the depth map. Then, a K-means-like clustering method is applied to the RGB-D data for oversegmentation using an 8-D distance metric constructed from both color and 3-D geometrical information. In the merging stage, treating each superpixel as a node, a graph-based model is set up to relabel the superpixels into semantically-coherent segments. In the graph-based model, RGB-D proximity, texture similarity, and boundary continuity are incorporated into the smoothness term to exploit the correlations of neighboring superpixels. To obtain a compact labeling, the label term is designed to penalize labels linking to similar superpixels that likely belong to the same object. Both the proposed 3-D geometry enhanced superpixel clustering method and the graph-based merging method from superpixels are evaluated by qualitative and quantitative results. By the fusion of color and depth information, the proposed method achieves superior segmentation performance over several state-of-the-art algorithms.
BibTeX
@article{yang2015graph,
author = {Jing-Yu Yang and Ziqiao Gan and Kun Li and Chunping Hou},
title = {{Graph-Based Segmentation for RGB-D Data Using 3-D Geometry Enhanced Superpixels}},
journal = {IEEE Trans. Cybernetics},
year = {2015},
doi = {10.1109/tcyb.2014.2340032},
}Loading related content...