Color clustering matting

Natural image matting refers to the problem of extracting regions of interest such as foreground object from an image based on user inputs like scribbles or trimap. More specifically, we need to estimate the color information of background, foreground and the corresponding opacity, which is an ill-posed problem inherently. Inspired by closed-form matting and KNN matting, in this paper, we extend the local color line model which is based on the assumption of linear color clustering within a small local window, to nonlocal feature space neighborhood. New affinity matrix is defined to achieve better clustering. Further, we demonstrate that good clustering ensures better prediction of alpha matte. Experimental evaluations on benchmark datasets and comparisons show that our matting algorithm is of higher accuracy and better visual quality than some state-of-the-art matting algorithms.

[1]  Jiaya Jia,et al.  Poisson matting , 2004, SIGGRAPH 2004.

[2]  Jian Sun,et al.  A global sampling method for alpha matting , 2011, CVPR 2011.

[3]  Qingsong Zhu,et al.  Learning based alpha matting using support vector regression , 2012, ICIP.

[4]  Manuel Menezes de Oliveira Neto,et al.  Shared Sampling for Real‐Time Alpha Matting , 2010, Comput. Graph. Forum.

[5]  Ying Wu,et al.  Nonlocal matting , 2011, CVPR 2011.

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

[7]  Tae-Sun Choi,et al.  Focusing techniques , 1992, Other Conferences.

[8]  Carsten Rother,et al.  New appearance models for natural image matting , 2009, CVPR.

[9]  Deepu Rajan,et al.  Weighted color and texture sample selection for image matting , 2012, CVPR.

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

[11]  Jean-Michel Morel,et al.  Nonlocal Image and Movie Denoising , 2008, International Journal of Computer Vision.

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

[13]  Dani Lischinski,et al.  A Closed-Form Solution to Natural Image Matting , 2008 .

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

[15]  Chi-Keung Tang,et al.  KNN Matting , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[16]  Dani Lischinski,et al.  Spectral Matting , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Richard Barrett,et al.  Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.

[18]  Jue Wang,et al.  A perceptually motivated online benchmark for image matting , 2009, CVPR.

[19]  David G. Lowe,et al.  Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration , 2009, VISAPP.