Spectral Matting

We present spectral matting: a new approach to natural image matting that automatically computes a basis set of fuzzy matting components from the smallest eigenvectors of a suitably defined Laplacian matrix. Thus, our approach extends spectral segmentation techniques, whose goal is to extract hard segments, to the extraction of soft matting components. These components may then be used as building blocks to easily construct semantically meaningful foreground mattes, either in an unsupervised fashion, or based on a small amount of user input.

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

[2]  Stephen Guattery,et al.  On the Quality of Spectral Separators , 1998, SIAM J. Matrix Anal. Appl..

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

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

[5]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

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

[7]  Vladimir Kolmogorov,et al.  Minimizing Nonsubmodular Functions with Graph Cuts-A Review , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Shimon Ullman,et al.  Class-Specific, Top-Down Segmentation , 2002, ECCV.

[9]  Gary L. Miller,et al.  Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[10]  Harry Shum,et al.  Lazy snapping , 2004, ACM Trans. Graph..

[11]  Pietro Perona,et al.  Self-Tuning Spectral Clustering , 2004, NIPS.

[12]  Kenneth M. Hall.  An r-Dimensional Quadratic Placement Algorithm , 1970 .

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

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

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

[16]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[17]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[18]  Michael Schmeing,et al.  A Closed Form Solution to Natural Image Matting , 2010 .

[19]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[20]  Jianbo Shi,et al.  Multiclass spectral clustering , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[21]  Kevin J. Lang.  Fixing two weaknesses of the Spectral Method , 2005, NIPS.

[22]  M. Fiedler.  A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[23]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[24]  M. Fiedler.  Eigenvectors of acyclic matrices , 1975 .

[25]  Yair Weiss,et al.  Segmentation using eigenvectors: a unifying view , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[26]  Andrew Blake,et al.  "GrabCut" , 2004, ACM Trans. Graph..