Natural image matting with non-negative matrix factorization

This paper addresses the well-known problem of natural image matting. It proposes a whole new framework that could effectively deals with the confused boundaries such as hair, furs and other complicated situations. We take the natural image matting problem as a pattern recognition problem and use the recently developed non-negative matrix factorization technique to solve it. Experimental results show that our approach could properly handle the confused boundaries. Compared with other algorithms visually, the results of our algorithm are comparable to the algorithms that are the best of nowadays.

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

[2]  H. Sebastian Seung,et al.  Learning the parts of objects by non-negative matrix factorization , 1999, Nature.

[3]  David Salesin,et al.  A Bayesian approach to digital matting , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[4]  Patrik O. Hoyer,et al.  Non-negative Matrix Factorization with Sparseness Constraints , 2004, J. Mach. Learn. Res..

[5]  James F. Blinn,et al.  Blue screen matting , 1996, SIGGRAPH.