Normalized cuts revisited: A reformulation for segmentation with linear grouping constraints

Journal of Mathematical Imaging and Vision

Volumn 39, Issue 1, 2011, Pages 45-61

  Eriksson, Anders ^a   Olsson, Carl ^b   Kahl, Fredrik ^b  

^a UNIVERSITY OF ADELAIDE   (Australia)

^b LUND UNIVERSITY   (Sweden)

Author keywords

Image segmentation; Linear grouping constraints; Normalized Cuts; Optimization

Indexed keywords

ARBITRARY NUMBER; BELONG TO; INTERACTIVE SEGMENTATION; LINEAR CONSTRAINTS; LINEAR EQUALITY CONSTRAINTS; LINEAR GROUPING; LINEAR GROUPING CONSTRAINTS; MULTI-CLASS; MULTIPLE CLASS; NORMALIZED CUTS; OPTIMIZATION SCHEME; PRIORI INFORMATION; SEGMENTATION ALGORITHMS;

COMPUTER VISION; OPTIMIZATION;

IMAGE SEGMENTATION;

EID: 79952002461     PISSN: 09249907     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10851-010-0223-5     Document Type: Article

References (26)

1. W.E. Arnoldi 1951 The principle of minimized iterations in the solution of the matrix eigenvalue problem Q. Appl. Math. 9 1 17 29 0042.12801 42792
2. Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming, Theory and Algorithms. Wiley, New York (2006)
3. P. Belhumeur J. Hespanha D. Kriegman 1997 Eigenfaces vs. fisherfaces: Recognition using class specific linear projection IEEE Trans. Pattern Anal. Mach. Intell. 19 7 711 720 10.1109/34.598228 (Pubitemid 127762263)
4. Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
5. Boykov, Y., Jolly, M.-P.: Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images. In: International Conference on Computer Vision, pp. 05-112, Vancouver, Canada (2001)
6. Y. Boykov O. Veksler R. Zabih 2001 Fast approximate energy minimization via graph cuts IEEE Trans. Pattern Anal. Mach. Intell. 23 11 1222 1239 10.1109/34.969114 (Pubitemid 33137959)
7. Cour, T., Shi, J.: Solving Markov random fields with spectral relaxation. In: Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, vol. 11 (2007)
8. Eriksson, A., Olsson, C., Kahl, F.: Image segmentation with context. In: Proc. Conf. Scandinavian Conference on Image Analysis, Ahlborg, Denmark (2007)
9. Eriksson, A., Olsson, C., Kahl, F.: Normalized cuts revisited: A reformulation for segmentation with linear grouping constraints. In: International Conference on Computer Vision, Rio de Janeiro, Brazil (2007)
10. P. Felzenszwalb D. Huttenlocher 2004 Efficient graph-based image segmentation Int. J. Comput. Vis. 59 2 167 181 10.1023/B:VISI.0000022288.19776. 77
11. Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins Studies in Mathematical Sciences. Johns Hopkins University Press, Baltimore (1996)
12. L. Grady 2006 Random walks for image segmentation IEEE Trans. Pattern Anal. Mach. Intell. 28 11 1768 1783 10.1109/TPAMI.2006.233 (Pubitemid 46405425)
13. C. Lanczos 1950 An iteration method for the solution of the eigenvalue problem of linear differential and integral operators J. Res. Nat. Bur. Stand. 45 4 225 281 42791
14. J. Malik S. Belongie T.K. Leung J. Shi 2001 Contour and texture analysis for image segmentation Int. J. Comput. Vis. 43 1 7 27 0972.68604 10.1023/A:1011174803800 (Pubitemid 32720090)
15. Olsson, C., Eriksson, A., Kahl, F.: Solving large scale binary quadratic problems: Spectral methods vs. semidefinite programming. In: Proc. Conf. Computer Vision and Pattern Recognition, Mineapolis, USA (2007)
16. Parlett, B.: The Symmetric Eigenvalue Problem. Prentice-Hall, New York (1980)
17. Rendl, F., Wolkowicz, H.: A semidefinite framework for trust region subproblems with applications to large scale minimization. Technical Report CORR 94-32, Department of Combinatorics and Optimization, December 1994
18. Rother, C., Kolmogorov, V., Blake, A.: "GrabCut": interactive foreground extraction using iterated graph cuts. In: ACM Transactions on Graphics, pp. 309-314 (2004)
19. Shen, C., Li, H., Brooks, M.: A convex programming approach to the trace quotient problem. In: Asian Conf. Computer Vision, Tokyo, Japan (2007)
20. J. Shi J. Malik 2000 Normalized cuts and image segmentation IEEE Trans. Pattern Anal. Mach. Intell. 22 8 888 905 10.1109/34.868688
21. D.C. Sorensen C. Yang 1998 Truncated QZ methods for large scale generalized eigenvalue problems SIAM J. Matrix Anal. Appl. 19 4 1045 1073 0918.65023 1636520 10.1137/S0895479896305398
22. Tolliver, D., Miller, G.: Graph partitioning by spectral rounding: Applications in image segmentation and clustering. In: Proc. Conf. Computer Vision and Pattern Recognition, pp. 1053-1060, New York City, USA (2006) (Pubitemid 44931438)
23. Werner, T.: High-arity interactions, polyhedral relaxations, and cutting plane algorithm for map-mrf. In: Proc. Conf. Computer Vision and Pattern Recognition, Anchorage, USA (2008)
24. Xu, L., Li, W., Schuurmans, D.: Fast normalized cut with linear constraints. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 2866-2873 (2009)
25. Yu, S., Shi, J.: Multiclass spectral clustering. In: International Conference on Computer Vision. Nice, France (2003)
26. S. Yu J. Shi 2004 Segmentation given partial grouping constraints IEEE Trans. Pattern Anal. Mach. Intell. 2 26 173 183 10.1109/TPAMI.2004.1262179