Abstract
It is well known that multi-surface segmentation can be cast as a multi-labeling problem. Different segments may belong to the same semantic object which may impose various inter-segment constraints [1]. In medical applications, there are a lot of scenarios where upper bounds on the Hausdorff distances between subsequent surfaces are known. We show that incorporating these priors into multi-surface segmentation is potentially NP-hard. To cope with this problem we develop a submodular-supermodular procedure that converges to a locally optimal solution well-approximating the problem. While we cannot guarantee global optimality, only feasible solutions are considered during the optimization process. Empirically, we get useful solutions for many challenging medical applications including MRI and ultrasound images.
Chapter PDF
Similar content being viewed by others
References
Delong, A., Boykov, Y.: Globally optimal segmentation of multi-region objects. In: IEEE ICCV, Kyoto, Japan, pp. 285–292 (2009)
Li, K., Wu, X., Chen, D.Z., Sonka, M.: Optimal surface segmentation in volumetric images-a graph-theoretic approach. IEEE PAMI 28, 119–134 (2006)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE PAMI 23, 1222–1239 (2001)
Freedman, D., Zhang, T.: Interactive graph cut based segmentation with shape priors. In: IEEE Int. Conf. on CVPR, pp. 755–762 (2005)
Cremers, D.: Dynamical statistical shape priors for level set based tracking. IEEE PAMI 28, 1262–1273 (2006)
Veksler, O.: Star Shape Prior for Graph-Cut Image Segmentation. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part III. LNCS, vol. 5304, pp. 454–467. Springer, Heidelberg (2008)
Lempitsky, V., Blake, A., Rother, C.: Image Segmentation by Branch-and-Mincut. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part IV. LNCS, vol. 5305, pp. 15–29. Springer, Heidelberg (2008)
Narasimhan, M., Bilmes, J.A.: A submodular-supermodular procedure with applications to discriminative structure learning. In: UAI, pp. 404–412 (2005)
Yuille, A.L., Rangarajan, A.: The concave-convex procedure. Neural Computation 15, 915–936 (2003)
Rother, C., Minka, T., Blake, A., Kolmogorov, V.: Cosegmentation of image pairs by histogram matching - incorporating a global constraint into mrfs. In: IEEE Int. Conf. on CVPR, pp. 993–1000 (2006)
Ladicky, L., Russell, C., Kohli, P., Torr, P.H.S.: Graph Cut Based Inference with Co-occurrence Statistics. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part V. LNCS, vol. 6315, pp. 239–253. Springer, Heidelberg (2010)
Karzanov, A.V.: Quick algorithm for determining the distance from the points of the given subset of an integer lattice to the points of its complement. Cybernetics and System Analysis, 177–181 (1992); translation by Julia Komissarchik
Felzenszwalb, P., Huttenlocher, D.: Distance transforms of sampled functions. Computing and Information Science TR2004-1963, Cornell (2004)
Caselles, V., Kimmel, R., Sapiro, G.: Geodesic active contours. Int. J. of Computer Vision 22, 61–79 (1997)
Ishikawa, H.: Exact optimization for markov random fields with convex priors. IEEE PAMI 25, 1333–1336 (2003)
Boros, E., Hammer, P.L.: Pseudo-boolean optimization. Discrete Applied Mathematics 123, 155–225 (2002)
Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? IEEE PAMI 24, 657–673 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmidt, F.R., Boykov, Y. (2012). Hausdorff Distance Constraint for Multi-surface Segmentation. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds) Computer Vision – ECCV 2012. ECCV 2012. Lecture Notes in Computer Science, vol 7572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33718-5_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-33718-5_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33717-8
Online ISBN: 978-3-642-33718-5
eBook Packages: Computer ScienceComputer Science (R0)