Fast matting using large kernel matting Laplacian matrices

Image matting is of great importance in both computer vision and graphics applications. Most existing state-of-the-art techniques rely on large sparse matrices such as the matting Laplacian [12]. However, solving these linear systems is often time-consuming, which is unfavored for the user interaction. In this paper, we propose a fast method for high quality matting. We first derive an efficient algorithm to solve a large kernel matting Laplacian. A large kernel propagates information more quickly and may improve the matte quality. To further reduce running time, we also use adaptive kernel sizes by a KD-tree trimap segmentation technique. A variety of experiments show that our algorithm provides high quality results and is 5 to 20 times faster than previous methods.

[1]  Franklin C. Crow,et al.  Summed-area tables for texture mapping , 1984, SIGGRAPH.

[2]  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.

[3]  Patrick Pérez,et al.  Poisson image editing , 2003, ACM Trans. Graph..

[4]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[5]  Jian Sun,et al.  Poisson matting , 2004, ACM Trans. Graph..

[6]  Dani Lischinski,et al.  Colorization using optimization , 2004, ACM Trans. Graph..

[7]  Marisa E. Campbell,et al.  SIGGRAPH 2004 , 2004, INTR.

[8]  Michael F. Cohen,et al.  An iterative optimization approach for unified image segmentation and matting , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[9]  Rüdiger Westermann,et al.  RANDOM WALKS FOR INTERACTIVE ALPHA-MATTING , 2005 .

[10]  Wei Chen,et al.  Easy Matting ‐ A Stroke Based Approach for Continuous Image Matting , 2006, Comput. Graph. Forum.

[11]  R. Szeliski.  Locally adapted hierarchical basis preconditioning , 2006, SIGGRAPH '06.

[12]  Michael F. Cohen,et al.  Image and Video Matting: A Survey , 2007, Found. Trends Comput. Graph. Vis..

[13]  Guillermo Sapiro,et al.  A Geodesic Framework for Fast Interactive Image and Video Segmentation and Matting , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[14]  Michael F. Cohen,et al.  Soft scissors: an interactive tool for realtime high quality matting , 2007, ACM Trans. Graph..

[15]  Michael F. Cohen,et al.  Optimized Color Sampling for Robust Matting , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[16]  Toby Sharp,et al.  High resolution matting via interactive trimap segmentation , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[17]  Dani Lischinski,et al.  A Closed-Form Solution to Natural Image Matting , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Zeev Farbman,et al.  Edge-preserving decompositions for multi-scale tone and detail manipulation , 2008, SIGGRAPH 2008.

[19]  Zeev Farbman,et al.  Edge-preserving decompositions for multi-scale tone and detail manipulation , 2008, ACM Trans. Graph..

[20]  Carsten Rother,et al.  Improving Color Modeling for Alpha Matting , 2008, BMVC.

[21]  Frédo Durand,et al.  Light mixture estimation for spatially varying white balance , 2008, ACM Trans. Graph..

[22]  Sylvain Paris,et al.  User-assisted intrinsic images , 2009, ACM Trans. Graph..

[23]  Carsten Rother,et al.  New appearance models for natural image matting , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[24]  Pushmeet Kohli,et al.  A perceptually motivated online benchmark for image matting , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[25]  Yuanjie Zheng,et al.  Learning based digital matting , 2009, 2009 IEEE 12th International Conference on Computer Vision.