Segmentation of depth image using graph cut

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.

[1]  Donald Geman,et al.  Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images , 1984 .

[2]  Marie-Pierre Jolly,et al.  Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images , 2001, ICCV.

[3]  Vladimir Kolmogorov,et al.  Graph cut based image segmentation with connectivity priors , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[4]  Linda G. Shapiro,et al.  Computer and Robot Vision , 1991 .

[5]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[6]  J. Besag.  On the Statistical Analysis of Dirty Pictures , 1986 .

[7]  Vladimir Kolmogorov,et al.  A global perspective on MAP inference for low-level vision , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[8]  Vladimir Kolmogorov,et al.  Joint optimization of segmentation and appearance models , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[9]  D. Greig,et al.  Exact Maximum A Posteriori Estimation for Binary Images , 1989 .

[10]  Mary Inaba,et al.  Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering: (extended abstract) , 1994, SCG '94.

[11]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Vladimir Kolmogorov,et al.  An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision , 2004, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Carlo Tomasi,et al.  Alpha estimation in natural images , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).