Abstract
Image segmentation based on graph representations has been a very active field of research recently. One major reason is that pairwise similarities (encoded by a graph) are also applicable in general situations where prototypical image descriptors as partitioning cues are no longer adequate. In this context, we recently proposed a novel convex programming approach for segmentation in terms of optimal graph cuts which compares favorably with alternative methods in several aspects.
In this paper we present a fully elaborated version of this approach along several directions: first, an image preprocessing method is proposed to reduce the problem size by several orders of magnitude. Furthermore, we argue that the hierarchical partition tree is a natural data structure as opposed to enforcing multiway cuts directly. In this context, we address various aspects regarding the fully automatic computation of the final segmentation. Experimental results illustrate the encouraging performance of our approach for unsupervised image segmentation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Zhu, S.-C.: Statistical modeling and conceptualization of visual patterns. IEEE Trans. Patt. Anal. Mach. Intell. 25(6), 691–712 (2003)
van Cutsem, B. (ed.): Classification and Dissimilarity Analysis. Lecture Notes in Statistics, vol. 93. Springer, Heidelberg (1994)
Hahn, U., Ramscar, M. (eds.): Similarity and Categorization. Oxford Univ. Press, Oxford (2001)
Hofmann, T., Buhmann, J.: Pairwise data clustering by deterministic annealing. IEEE Trans. Patt. Anal. Mach. Intell. 19(1), 1–14 (1997)
Puzicha, J., Buhmann, J.M.: Multiscale annealing for unsupervised image segmentation. Comp. Vision and Image Underst. 76(3), 213–230 (1999)
Mohar, B., Poljak, S.: Eigenvalues in combinatorial optimization. In: Combinatorial and Graph-Theoretical Problems in Linear Algebra. IMA Vol. Math. Appl., vol. 50, pp. 107–151. Springer, Heidelberg (1993)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Patt. Anal. Mach. Intell. 22(8), 888–905 (2000)
Keuchel, J., Schnörr, C., Schellewald, C., Cremers, D.: Binary partitioning, perceptual grouping, and restoration with semidefinite programming. IEEE Trans. Patt. Anal. Mach. Intell. 25(11), 1364–1379 (2003)
Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proc. 8th Int. Conf. Computer Vision (ICCV), vol. 2, pp. 416–423. IEEE Comp. Soc, Los Alamitos (2001)
Comaniciu, D., Meer, P.: Mean shift: A robust approach toward feature space analysis. IEEE Trans. Patt. Anal. Mach. Intell. 24(5), 603–619 (2002)
Ren, X., Malik, J.: Learning a classification model for segmentation. In: Proc. 9th Int. Conf. Computer Vision (ICCV), pp. 10–17. IEEE Comp. Soc, Los Alamitos (2003)
Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. International series in operations research & management science, vol. 27. Kluwer Acad. Publ., Boston (2000)
Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 42(6), 1115–1145 (1995)
Malik, J., Belongie, S., Leung, T., Shi, J.: Contour and texture analysis for image segmentation. Int. J. Comp. Vision 43(1), 7–27 (2001)
Alpert, C.J., Kahng, A.B., Yao, S.-Z.: Spectral partitioning with multiple eigenvectors. Discrete Applied Math. 90, 3–26 (1999)
Yu, S.X., Shi, J.: Multiclass spectral clustering. In: Proc. 9th Int. Conf. Computer Vision (ICCV), pp. 313–319. IEEE Comp. Soc., Los Alamitos (2003)
Fowlkes, C., Belongie, S., Chung, F., Malik, J.: Spectral grouping using the Nyström method. IEEE Trans. Pattern Anal. Mach. Intell. 26(2), 214–225 (2004)
Keuchel, J., Schnörr, C.: Efficient graph cuts for unsupervised image segmentation using probabilistic sampling and SVD-based approximation. In: 3rd Internat. Workshop on Statist. and Comput. Theories of Vision, Nice, France (2003)
Martin, D., Fowlkes, C., Malik, J.: Learning to detect natural image boundaries using local brightness, color, and texture cues. IEEE Trans. Patt. Anal. Mach. Intell. 26(5), 530–549 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Keuchel, J., Heiler, M., Schnörr, C. (2004). Hierarchical Image Segmentation Based on Semidefinite Programming. In: Rasmussen, C.E., Bülthoff, H.H., Schölkopf, B., Giese, M.A. (eds) Pattern Recognition. DAGM 2004. Lecture Notes in Computer Science, vol 3175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28649-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-28649-3_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22945-2
Online ISBN: 978-3-540-28649-3
eBook Packages: Springer Book Archive