This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Spectral Matting
October 2008 (vol. 30 no. 10)
pp. 1699-1712
Anat Levin, MIT, cambridge
Alex Rav-Acha, The Hebrew University of Jerusalem, Jerusalem
Dani Lischinski, The Hebrew University of Jerusalem, Jerusalem
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] E. Borenstein and S. Ullman, “Class-Specific, Top-Down Segmentation,” Proc. Seventh European Conf. Computer Vision, pp. 109-122, 2002.
[2] Y. Chuang, B. Curless, D. Salesin, and R. Szeliski, “A Bayesian Approach to Digital Matting,” Proc. IEEE Int'l Conf. Computer Vision and Pattern Recognition, pp. 264-271, 2001.
[3] J. Dennis, J. Robert, and B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, 1983.
[4] W. Donath and A. Hoffman, Algorithms for Partitioning Graphs and Computer Logic Based on Eigenvectors of Connection Matrices, 1973.
[5] M. Fiedler, “Algebraic Connectivity of Graphs,” Czechoslovak Math. J., vol. 23, no. 98, pp. 298-305, 1973.
[6] M. Fiedler, “Eigenvectors of Acyclic Matrices,” Czechoslovak Math. J., vol. 25, no. 100, pp. 607-618, 1975.
[7] M. Fiedler, “A Property of Eigenvectors of Nonnegative Symmetric Matrices and Its Application to Graph Theory,” Czechoslovak Math. J., vol. 25, no. 100, pp. 619-633, 1975.
[8] L. Grady, T. Schiwietz, S. Aharon, and R. Westermann, “Random Walks for Interactive Alpha-Matting,” Proc. Fifth IASTED Int'l Conf. Visualization, Imaging and Image Processing, pp. 423-429, 2005.
[9] Y. Guan, W. Chen, X. Liang, Z. Ding, and Q. Peng, “Easy Matting: A Stroke Based Approach for Continuous Image Matting,” Computer Graphics Forum, Proc. Eurographics '06, vol. 25, no. 3, pp. 567-576, 2006.
[10] S. Guattery and G.L. Miller, “On the Quality of Spectral Separators,” SIAM J. Matrix Analysis and Applications, vol. 19, no. 3, pp. 701-719, 1998.
[11] K. Hall, “An R-Dimensional Quadratic Placement Algorithm,” Management Science, vol. 17, no. 3, pp. 219-229, 1970.
[12] V. Kolmogorov and C. Rother, “Minimizing Nonsubmodular Functions with Graph Cuts—A Review,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, no. 7, pp. 1274-1279, July 2007.
[13] K. Lang, “Fixing Two Weaknesses of the Spectral Method,” Proc. Advances in Neural Information Processing Systems, vol. 18, 2005.
[14] A. Levin, D. Lischinski, and Y. Weiss, “A Closed Form Solution to Natural Image Matting,” Proc. IEEE Int'l Conf. Computer Vision and Pattern Recognition, pp. 61-68, 2006.
[15] A. Levin, A. Rav-Acha, and D. Lischinski, “Spectral Matting,” Proc. IEEE Int'l Conf. Computer Vision and Pattern Recognition, June 2007.
[16] Y. Li, J. Sun, C.-K. Tang, and H.-Y. Shum, “Lazy Snapping,” ACM Trans. Graphics, vol. 23, no. 3, pp. 303-308, 2004.
[17] A. Ng, M. Jordan, and Y. Weiss, “On Spectral Clustering: Analysis and an Algorithm,” Proc. Advances in Neural Information Processing Systems, 2001.
[18] A. Pothen, H. Simon, and K.-P. Liou, “Partitioning Sparse Matrices with Eigenvalues of Graphs,” SIAM J. Matrix Analysis and Applications, vol. 11, no. 3, pp. 430-452, 1990.
[19] C. Rother, V. Kolmogorov, and A. Blake, “'GrabCut': Interactive Foreground Extraction Using Iterated Graph Cuts,” ACM Trans. Graphics, vol. 23, no. 3, pp. 309-314, 2004.
[20] J. Shi and J. Malik, “Normalized Cuts and Image Segmentation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888-905, Aug. 2000.
[21] A. Smith and J. Blinn, “Blue Screen Matting,” Proc. ACM SIGGRAPH '96, pp. 259-268, 1996.
[22] J. Sun, J. Jia, C.-K. Tang, and H.-Y. Shum, “Poisson Matting,” ACM Trans. Graphics, vol. 23, no. 3, pp. 315-321, 2004.
[23] D. Tolliver and G. Miller, “Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering,” Proc. IEEE Int'l Conf. Computer Vision and Pattern Recognition, pp.1053-1060, 2006.
[24] J. Wang and M. Cohen, “An Iterative Optimization Approach for Unified Image Segmentation and Matting,” Proc. Int'l Conf. Computer Vision, pp. 936-943, 2005.
[25] Y. Weiss, “Segmentation Using Eigenvectors: A Unifying View,” Proc. Int'l Conf. Computer Vision, pp. 975-982, 1999.
[26] S.X. Yu and J. Shi, “Multiclass Spectral Clustering,” Proc. Int'l Conf. Computer Vision, pp. 313-319, 2003.
[27] L. Zelnik-Manor and P. Perona, “Self-Tuning Spectral Clustering,” Proc. Advances in Neural Information Processing Systems, 2005.

Index Terms:
matting, spectral analysis, image segmentation
Citation:
Anat Levin, Alex Rav-Acha, Dani Lischinski, "Spectral Matting," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 30, no. 10, pp. 1699-1712, Oct. 2008, doi:10.1109/TPAMI.2008.168
Usage of this product signifies your acceptance of the Terms of Use.