By Topic

Segmentation of depth image using graph cut

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jiangming Yu ; Research Institute of Computer Science and Technology, Ningbo University, China, 315211 ; Jieyu Zhao

A large number of tasks in computer vision involve finding a target from a background image. It is also known as the foreground/background discrimination problem. Various methods have been developed to solve this problem. [1, 2, 10, 11, 12] Newly developed techniques for general purpose of object abstraction use both color and edge information for segmentation purpose. In this paper, we use graph cut methods on images with depth information from A Kinect camera. Also, we apply the approach with pyramid representation. This greatly reduces the time used with the iterative graph cut methods. We estimate the statistic model on the bottom of the pyramid, while use graph cut on the top of the pyramid. This speeds up the whole segmentation process while keeps a good segmentation quality at the same time. When come across the situation like the object's color resembles that of the background but with different depth, our method can still achieve a good result.

Published in:

Fuzzy Systems and Knowledge Discovery (FSKD), 2012 9th International Conference on

Date of Conference:

29-31 May 2012