Hausdorff distance constraint for multi-surface segmentation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7572 LNCS, Issue PART 1, 2012, Pages 598-611

  Schmidt, Frank R ^a   Boykov, Yuri ^b  

^a UNIVERSITÉ PARIS EST   (France)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FEASIBLE SOLUTION; GLOBAL OPTIMALITY; HAUSDORFF DISTANCE; MULTI-SURFACE; NP-HARD; OPTIMAL SOLUTIONS; OPTIMIZATION PROCESS; SEMANTIC OBJECTS; ULTRASOUND IMAGES; UPPER BOUND;

GEOMETRY; MEDICAL APPLICATIONS; OPTIMIZATION; SEMANTICS;

COMPUTER VISION;

EID: 84867885413     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33718-5_43     Document Type: Conference Paper

References (17)

1. Delong, A., Boykov, Y.: Globally optimal segmentation of multi-region objects. In: IEEE ICCV, Kyoto, Japan, pp. 285-292 (2009)
2. 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)
3. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE PAMI 23, 1222-1239 (2001)
4. Freedman, D., Zhang, T.: Interactive graph cut based segmentation with shape priors. In: IEEE Int. Conf. on CVPR, pp. 755-762 (2005)
5. Cremers, D.: Dynamical statistical shape priors for level set based tracking. IEEE PAMI 28, 1262-1273 (2006)
6. 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)
7. 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)
8. Narasimhan, M., Bilmes, J.A.: A submodular-supermodular procedure with applications to discriminative structure learning. In: UAI, pp. 404-412 (2005)
9. Yuille, A.L., Rangarajan, A.: The concave-convex procedure. Neural Computation 15, 915-936 (2003)
10. 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)
11. 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)
12. 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
13. Felzenszwalb, P., Huttenlocher, D.: Distance transforms of sampled functions. Computing and Information Science TR2004-1963, Cornell (2004)
14. Caselles, V., Kimmel, R., Sapiro, G.: Geodesic active contours. Int. J. of Computer Vision 22, 61-79 (1997)
15. Ishikawa, H.: Exact optimization for markov random fields with convex priors. IEEE PAMI 25, 1333-1336 (2003)
16. Boros, E., Hammer, P.L.: Pseudo-boolean optimization. Discrete Applied Mathematics 123, 155-225 (2002)
17. Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? IEEE PAMI 24, 657-673 (2004)