Abstract
We consider approaches to computer vision problems which require the minimization of a global energy functional over binary variables and take into account both local similarity and spatial context. The combinatorial nature of such problems has lead to the design of various approximation algorithms in the past which often involve tuning parameters and tend to get trapped in local minima.
In this context, we present a novel approach to the field of computer vision that amounts to solving a convex relaxation of the original problem without introducing any additional parameters. Numerical ground truth experiments reveal a relative error of the convex minimizer with respect to the global optimum of below 2% on the average.
We apply our approach by discussing two specific problem instances related to image partitioning and perceptual grouping. Numerical experiments illustrate the quality of the approach which, in the partitioning case, compares favorably with established approaches like the ICM-algorithm.
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
S. Geman and D. Geman. Stochastic relaxation, gibbs distributions, and the bayesian restoration of images. IEEE Trans. Patt. Anal. Mach. Intell., 6(6):721–741, 1984.
J.E. Besag. On the analysis of dirty pictures (with discussion). J. R. Statist. Soc. B, 48:259–302, 1986.
L. Herault and R. Horaud. Figure-ground discrimination: A combinatorial optimization approach. IEEE Trans. Patt. Anal. Mach. Intell., 15(9):899–914, 1993.
C. Schellewald, J. Keuchel, and C. Schnörr. Image labeling and grouping by minimizing linear functionals over cones. In Proc. Third Int. Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition (EMM-CVPR’01), Lect. Notes Comp. Science, INRIA, Sophia Antipolis, France, Sept. 3-5 2001. Springer. in press.
E. Aarts and J.K. Lenstra, editors. Local Search in Combinatorial Optimization, Chichester, 1997. Wiley & Sons.
L. Lovász and A. Schrijver. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optimization, 1(2):166–190, 1991.
M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42:1115–1145, 1995.
M. Bertero, T. Poggio, and V. Torre. Ill-posed problems in early vision. Proc. IEEE, 76:869–889, 1988.
S.J. Benson, Y. Ye, and X. Zhang. Mixed linear and semidefinite programming for combinatorial and quadratic optimization. Optimiz. Methods and Software, 11&12:515–544, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Keuchel, J., Schellewald, C., Cremers, D., Schnörr, C. (2001). Convex Relaxations for Binary Image Partitioning and Perceptual Grouping. In: Radig, B., Florczyk, S. (eds) Pattern Recognition. DAGM 2001. Lecture Notes in Computer Science, vol 2191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45404-7_47
Download citation
DOI: https://doi.org/10.1007/3-540-45404-7_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42596-0
Online ISBN: 978-3-540-45404-5
eBook Packages: Springer Book Archive