Quick matting: A matting method based on pixel spread and propagation

The problem of matting is always solved by finding the alpha value for each pixel in the image. Many recent methods combine color sampling and affinity definition in different steps, leading to large computational cost. In the proposed method, when the alpha value of a pixel Pi is calculated, the pixel is regarded as a foreground pixel to help calculate its adjacent pixels' alpha values, resulted in a faster solution. This spreading way of traversal also ensures local continuity of foreground object and improves the visual result. Experiments show our Quick Matting can achieve comparable alpha mattes as Robust Matting, while the speed is enhanced by about 25 times.

[1]  Harry Shum,et al.  Flash matting , 2006, ACM Trans. Graph..

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

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

[4]  Wojciech Matusik,et al.  Natural video matting using camera arrays , 2006, SIGGRAPH '06.

[5]  Xiaofei He,et al.  Locality Preserving Projections , 2003, NIPS.

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

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

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

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

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

[11]  Maneesh Agrawala,et al.  Soft scissors: an interactive tool for realtime high quality matting , 2007, ACM Trans. Graph..