Abstract
Indisputably Normalized Cuts is one of the most popular segmentation algorithms in pattern recognition and computer vision. It has been applied to a wide range of segmentation tasks with great success. A number of extensions to this approach have also been proposed, including ones that can deal with multiple classes or that can incorporate a priori information in the form of grouping constraints. However, what is common for all these methods is that they are noticeably limited in the type of constraints that can be incorporated and can only address segmentation problems on a very specific form. In this paper, we present a reformulation of Normalized Cut segmentation that in a unified way can handle linear equality constraints for an arbitrary number of classes. This is done by restating the problem and showing how linear constraints can be enforced exactly in the optimization scheme through duality. This allows us to add group priors, for example, that certain pixels should belong to a given class. In addition, it provides a principled way to perform multi-class segmentation for tasks like interactive segmentation. The method has been tested on real data showing good performance and improvements compared to standard normalized cuts.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arnoldi, W.E.: The principle of minimized iterations in the solution of the matrix eigenvalue problem. Q. Appl. Math. 9(1), 17–29 (1951)
Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming, Theory and Algorithms. Wiley, New York (2006)
Belhumeur, P., Hespanha, J., Kriegman, D.: Eigenfaces vs. fisherfaces: Recognition using class specific linear projection. IEEE Trans. Pattern Anal. Mach. Intell. 19(7), 711–720 (1997)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
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)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell. 23(11), 1222–1239 (2001)
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)
Eriksson, A., Olsson, C., Kahl, F.: Image segmentation with context. In: Proc. Conf. Scandinavian Conference on Image Analysis, Ahlborg, Denmark (2007)
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)
Felzenszwalb, P., Huttenlocher, D.: Efficient graph-based image segmentation. Int. J. Comput. Vis. 59(2), 167–181 (2004)
Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins Studies in Mathematical Sciences. Johns Hopkins University Press, Baltimore (1996)
Grady, L.: Random walks for image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 28(11), 1768–1783 (2006)
Lanczos, C.: 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 (1950)
Malik, J., Belongie, S., Leung, T.K., Shi, J.: Contour and texture analysis for image segmentation. Int. J. Comput. Vis. 43(1), 7–27 (2001)
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)
Parlett, B.: The Symmetric Eigenvalue Problem. Prentice-Hall, New York (1980)
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
Rother, C., Kolmogorov, V., Blake, A.: “GrabCut”: interactive foreground extraction using iterated graph cuts. In: ACM Transactions on Graphics, pp. 309–314 (2004)
Shen, C., Li, H., Brooks, M.: A convex programming approach to the trace quotient problem. In: Asian Conf. Computer Vision, Tokyo, Japan (2007)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2000)
Sorensen, D.C., Yang, C.: Truncated QZ methods for large scale generalized eigenvalue problems. SIAM J. Matrix Anal. Appl. 19(4), 1045–1073 (1998)
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)
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)
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)
Yu, S., Shi, J.: Multiclass spectral clustering. In: International Conference on Computer Vision. Nice, France (2003)
Yu, S., Shi, J.: Segmentation given partial grouping constraints. IEEE Trans. Pattern Anal. Mach. Intell. 2(26), 173–183 (2004)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Eriksson, A., Olsson, C. & Kahl, F. Normalized Cuts Revisited: A Reformulation for Segmentation with Linear Grouping Constraints. J Math Imaging Vis 39, 45–61 (2011). https://doi.org/10.1007/s10851-010-0223-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10851-010-0223-5