Better Foreground Segmentation for 3D Face Reconstruction Using Graph Cuts

Research on image-based 3D reconstruction has recently shown a lot of good results, but it assumes precise target objects are already segmented from each input image. Traditionally, background subtraction was used to segment the target objects, but it can yield serious problems, such as noises and holes. To precisely segment the target objects, graph cuts have recently been used. Graph cuts showed good results in many engineering problems, as they can globally minimize energy functions composed of data terms and smooth terms, but it is difficult to automatically obtain prior information necessary for data terms. Depth information generated by stereo vision was used as prior information, which shows good results in their experiments, but it is difficult to calculate depth information for 3D face reconstruction, as the most of faces have homogeneous regions. In this paper, we propose better foreground segmentation method for 3D face reconstruction using graph cuts. The foreground objects are approximately segmented from each background image using background subtraction to assist to estimate data terms of energy functions, and noises and shadows are removed from the segmented objects to reduce errors of prior information. Removing the noises and shadows should cause to lose detail in the foreground silhouette, but smooth terms that assign high costs if neighboring pixels are not similar can fill out the lost silhouette. Consequently, the proposed method can segment more precise target objects by globally minimizing the energy function composed of smooth terms and approximately estimated data terms using graph cuts.

[1]  Hyeran Byun,et al.  Robust Object Segmentation Using Graph Cut with Object and Background Seed Estimation , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[2]  Andrew Blake,et al.  Probabilistic Fusion of Stereo with Color and Contrast for Bilayer Segmentation , 2006, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Vladimir Kolmogorov,et al.  "GrabCut": interactive foreground extraction using iterated graph cuts , 2004, ACM Trans. Graph..

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

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

[6]  Kiriakos N. Kutulakos,et al.  A Theory of Shape by Space Carving , 2000, International Journal of Computer Vision.

[7]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

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

[9]  Baozong Yuan,et al.  Better Foreground Segmentation for Static Cameras via New Energy Form and Dynamic Graph-cut , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[10]  P. Wayne Power,et al.  Understanding Background Mixture Models for Foreground Segmentation , 2002 .

[11]  Andrew Zisserman,et al.  OBJ CUT , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

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