loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'01) - Volume 2
A Bayesian Approach to Digital Matting
Kauai, Hawaii
December 08-December 14
ISBN: 0-7695-1272-0
Yung-Yu Chuang, University of Washington, Seattle
Brian Curless, University of Washington, Seattle
David H. Salesin, University of Washington, Seattle; Microsoft Research
Richard Szeliski, Microsoft Research
This paper proposes a new Bayesian framework for solving the matting problem, i.e. extracting a foreground element from a background image by estimating an opacity for each pixel of the foreground element. Our approach models both the foreground and background color distributions with spatially-varying sets of Gaussians, and assumes a fractional blending of the foreground and background colors to produce the final output. It then uses a maximum-likelihood criterion to estimate the optimal opacity, foreground and background simultaneously. In addition to providing a principled approach to the matting problem, our algorithm effectively handles objects with intricate boundaries, such as hair strands and fur, and provides an improvement over existing techniques for these difficult cases.
Citation:
Yung-Yu Chuang, Brian Curless, David H. Salesin, Richard Szeliski, "A Bayesian Approach to Digital Matting," cvpr, vol. 2, pp.264, 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'01) - Volume 2, 2001
Usage of this product signifies your acceptance of the Terms of Use.