Better Foreground Segmentation for 3D Face Reconstruction Using Graph Cuts

  • Anjin Park
  • Kwangjin Hong
  • Keechul Jung
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4872)

Abstract

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.

Keywords

Foreground Segmentation Graph Cuts Shadow Elimination 3D Face Reconstruction 

References

  1. 1.
    Laurentini, A.: The Visual Hull Concept for Silhouette-based Image Understanding. IEEE Transactions on Pattern Analysis and Machine Intelligence 16(2), 150–162 (1994)CrossRefGoogle Scholar
  2. 2.
    Wayne Power, P., Schoonees, J.: Understanding Background Mixture Models for Foreground Segmentation. In: Proceedings of Image and Vision Computing, New Zealand, pp. 267–271 (2002)Google Scholar
  3. 3.
    Image Processing Toolbox, ch. 9: Morphological Operations, The Mathworks (2001)Google Scholar
  4. 4.
    Li, Y., Sun, J., Tang, C-K., Shum, H-Y.: Lazy Snapping. ACM Transactions on Graphics 23(3), 303–308 (2004)CrossRefGoogle Scholar
  5. 5.
    Boykov, Y., Funka-Lea, G.: Graph Cuts and Efficient N-D Image Segmentation. International Journal of Computer Vision 70(2), 109–131 (2006)CrossRefGoogle Scholar
  6. 6.
    Rother, C., Kolmogorov, V., Blake, A.: GrabCut - Interactive Foreground Extraction using Iterated Graph Cuts. ACM Transactions on Graphics 23(3), 309–314 (2004)CrossRefGoogle Scholar
  7. 7.
    Ahn, J-H., Kim, K., Byun, H.: Robust Object Segmentation using Graph Cut with Object and Background Seed Estimation. In: Proceedings of International Conference on Pattern Recognition, vol. 2, pp. 361–364 (2006)Google Scholar
  8. 8.
    Kolmorogov, V., Criminisi, A., Blake, A., Cross, G., Rother, C.: Probabilistic Fusion of Stereo with Color and Contrast for Bilayer Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 28(9), 1480–1492 (2006)CrossRefGoogle Scholar
  9. 9.
    Kutulakos, K.N., Seitz, S.M.: A Theory of Shape by Space Carving. International Journal of Computer Vision 38(3), 199–218 (2000)MATHCrossRefGoogle Scholar
  10. 10.
    Howe, N.R., Deschamps, A.: Better Foreground Segmentation through Graph Cuts. Technical Report (2004), http://arxiv.org/abs/cs.CV/0401017
  11. 11.
    Sun, Y., Li, B., Yuan, B., Miao, Z., Wan, C.: Better Foreground Segmentation for Static Cameras via New Energy Form and Dynamic Graph-cut. In: Proceedings of International Conference on Pattern Recognition, vol. 2, pp. 49–52 (2006)Google Scholar
  12. 12.
    Boykov, Y., Veksler, O., Zabih, R.: Fast Approximate Energy Minimization via Graph Cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence 23(11), 1222–1239 (2001)CrossRefGoogle Scholar
  13. 13.
    Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton (1962)MATHGoogle Scholar
  14. 14.
    Kumar, M.P., Torr, P.H.S, Zisserman, A.: Obj Cut. Proceedings of Computer Vision and Pattern Recognition 1, 18–25 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Anjin Park
    • 1
  • Kwangjin Hong
    • 1
  • Keechul Jung
    • 1
  1. 1.School of Digital Media, College of Information Science, Soongsil University, 156-743, SeoulS. Korea

Personalised recommendations