Hierarchical Image Segmentation Based on Semidefinite Programming
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.
Unable to display preview. Download preview PDF.
- 3.Hahn, U., Ramscar, M. (eds.): Similarity and Categorization. Oxford Univ. Press, Oxford (2001)Google Scholar
- 6.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)Google Scholar
- 9.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)Google Scholar
- 12.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)Google Scholar
- 18.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)Google Scholar