Graph-Cut Based Background Subtraction Using Visual Hull in Multiveiw Images

A graph-cut method has been successfully used in many applications for image segmentation. However, it needs lots of time and user intervention. In case of multi view image (MVI), it is especially hard to segment all images in a short time because of numerous images in MVI. In this paper, we describe a new technique for multi view image segmentation, which needs minimum user intervention and provides fast processing time. The user marks certain pixels as "target object" or "background" to provide a constraint for segmentation to only one of the MVI. The seed information is propagated to all images in the MVI. In this step, we can acquire tentative segment result and then apply them to reconstruct the 3D model which exploits the visual hull. After the 3D model is reconstructed, segment error that is found located out of foreground is eliminated. Although visual hull has a shortcoming that cannot represent whether the object is convex or concave, tentative segment result is easy to use and proven to be enough as our proposed method. We can acquire final segment result in a short time by integrating these two simple methods. According to the experiments, our method shows better performance in terms of processing time and minimizing user intervention.

[1]  Andrew Blake,et al.  "GrabCut" , 2004, ACM Trans. Graph..

[2]  Josef Kittler,et al.  Automatic watershed segmentation of randomly textured color images , 1997, IEEE Trans. Image Process..

[3]  Hans-Peter Seidel,et al.  Hardware-Accelerated Visual Hull Reconstruction and Rendering , 2003, Graphics Interface.

[4]  B. S. Manjunath,et al.  Edge flow: A framework of boundary detection and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[5]  Junho Cho,et al.  Hardware-accelerated jaggy-free visual hulls with silhouette maps , 2006, VRST '06.

[6]  Olga Veksler,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  A. Laurentini,et al.  The Visual Hull Concept for Silhouette-Based Image Understanding , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Gareth Funka-Lea,et al.  Graph Cuts and Efficient N-D Image Segmentation , 2006, International Journal of Computer Vision.

[9]  Jian Sun,et al.  Lazy snapping , 2004, SIGGRAPH 2004.

[10]  Hong Zhang,et al.  Automatic Video Object Segmentation using Graph Cut , 2007, 2007 IEEE International Conference on Image Processing.

[11]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[12]  Jitendra Malik,et al.  Color- and texture-based image segmentation using EM and its application to content-based image retrieval , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

[13]  Richard Szeliski,et al.  Rapid octree construction from image sequences , 1993 .

[14]  Richard Szeliski,et al.  A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Richard Szeliski,et al.  A Comparative Study of Energy Minimization Methods for Markov Random Fields , 2006, ECCV.

[16]  Wojciech Matusik,et al.  Polyhedral Visual Hulls for Real-Time Rendering , 2001, Rendering Techniques.