Journal of System Simulation ›› 2018, Vol. 30 ›› Issue (7): 2558-2567.doi: 10.16182/j.issn1004731x.joss.201807016

Previous Articles     Next Articles

RGBD Image Co-segmentation via Saliency Detection and Graph Cut

Li Xiaoyang1,2, Wan Lili1,2, Li Henan1,2, Wang Shenghui1,2   

  1. 1. Institute of Information Science, Beijing Jiaotong University, Beijing 100044, China;
    2. Beijing Key Laboratory of Advanced Information Science and Network Technology, Beijing 100044, China
  • Received:2017-07-30 Online:2018-07-10 Published:2019-01-08

Abstract: In order to solve the problem that it is difficult to accurately segment images with similar colors in the foreground, we propose a RGBD image co-segmentation algorithm that utilizes saliency detection and graph cut. Our algorithm not only achieves the co-segmentation of multiple images, but also uses depth data to solve the foreground and background confusion problem caused by color similarity. Depth is incorporated into a superpixel segmentation algorithm to change each RGBD image into a set of superpixel blocks. A graph model of superpixels is constructed and saliency detection is used to extend the seed nodes area. The co-segmentation is achieved based on the Biased Normalized Cuts. Depth information is used to further optimize the segmentation results. Extensive experiments show that our method can significantly improve the accuracy of segmentation for those scenes with similar foreground and background colors.

Key words: co-segmentation, depth, saliency detection, superpixel, graph cut

CLC Number: