Global minimization for continuous multiphase partitioning problems using a dual approach

International Journal of Computer Vision

Volumn 92, Issue 1, 2011, Pages 112-129

  Bae, Egil ^a   Yuan, Jing ^b   Tai, Xue Cheng ^a,c  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

^c NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Convex relaxation; Image segmentation; Primal dual methods; Total variation

Indexed keywords

APPROXIMATE SOLUTION; CONTINUOUS OPTIMIZATION; CONVEX RELAXATION; DUAL APPROACH; DUAL FORMULATIONS; DUAL MODEL; DUAL PROBLEM; EXPECTATION MAXIMIZATION; GLOBAL MINIMIZATION; LABELINGS; LOWER ENERGIES; MAXIMUM ENTROPY; NON-SMOOTH; NONCONVEX; NUMERICAL EXPERIMENTS; OPTIMAL LABELING; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; PARTITIONING PROBLEM; POTTS MODELS; PRIMAL-DUAL; PRIMAL-DUAL METHODS; SMOOTHING METHODS; SUFFICIENT CONDITIONS; THRESHOLDING; TOTAL VARIATION; VISUAL QUALITIES;

ALGORITHMS; EXPONENTIAL FUNCTIONS; NUMERICAL METHODS; OPTIMIZATION; RELAXATION PROCESSES;

IMAGE SEGMENTATION;

EID: 79952192059     PISSN: 09205691     EISSN: 15731405     Source Type: Journal    
DOI: 10.1007/s11263-010-0406-y     Document Type: Article

References (54)

1. Bae, E., Tai, X. C. (2009a). Graph cut optimization for the piecewise constant level set method applied to multiphase image segmentation. In Scale space and variational methods in computer vision (pp. 1-13). Berlin: Springer.
2. Bae, E., Tai, X.-C. (2009b). Efficient global minimization for the multiphase Chan-Vese model of image segmentation. In Energy minimization methods in computer vision and pattern recognition (EMMCVPR) (pp. 28-41).
3. Banerjee, S., Merugu, I., Dhillon, J., Ghosh, J. (2004). Clustering with Bregman divergences. Journal of Machine Learning Research, 234-245.
4. Y. Boykov V. Kolmogorov 2001 An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision IEEE Transactions on Pattern Analysis and Machine Intelligence 26 359 374 (Pubitemid 33331827)
5. Boykov, Y., Kolmogorov, V. (2003). Computing geodesics and minimal surfaces via graph cuts. In ICCV '03: proceedings of the ninth IEEE international conference on computer vision (pp. 26-33). Washington: IEEE Computer Society.
6. Y. Boykov O. Veksler R. Zabih 2001 Fast approximate energy minimization via graph cuts IEEE Transactions on Pattern Analysis and Machine Intelligence 23 1222 1239 10.1109/34.969114 (Pubitemid 33137959)
7. Boykov, Y., Kolmogorov, V., Cremers, D., Delong, A. (2006). An integral solution to surface evolution pdes via geo-cuts. In ECCV (pp. 409-422). (Pubitemid 44029694)
8. X. Bresson S. Esedoglu P. Vandergheynst J. P. Thiran S. Osher 2007 Fast global minimization of the active contour/snake model Journal of Mathematical Imaging and Vision 28 2 151 167 2362922 10.1007/s10851-007-0002-0 (Pubitemid 47312505)
9. Brown, E. S., Chan, T. F., Bresson, X. (2009). Convex formulation and exact global solutions for multi-phase piecewise constant mumford-shah image segmentation (CAM-report-09-66). UCLA, Applied Mathematics, July 2009.
10. Brown, E. S., Chan, T. F., Bresson, X. (2010). A convex relaxation method for a class of vector-valued minimization problems with applications to mumford-shah segmentation (CAM-report-10-43). UCLA, Applied Mathematics, July 2010.
11. A. Chambolle 2004 An algorithm for total variation minimization and applications Journal of Mathematical Imaging and Vision 20 1 89 97 2049783 10.1023/B:JMIV.0000011320.81911.38
12. T. F. Chan S. Esedoglu 2005 Aspects of total variation regularized l[sup 1] function approximation SIAM Journal of Applied Mathematics 65 5 1817 1837 2177726 1096.94004 10.1137/040604297 (Pubitemid 41639797)
13. T. Chan L. A. Vese 2001 Active contours without edges IEEE Transactions on Image Processing 10 266 277 1039.68779 10.1109/83.902291 (Pubitemid 32254596)
14. P. L. Combettes V. R. Wajs 2005 Signal recovery by proximal forward-backward splitting Multiscale Modeling & Simulation 4 4 1168 1200 2203849 1179.94031 10.1137/050626090 (Pubitemid 44932287)
15. Ekeland, I., Téman, R. (1999). Convex analysis and variational problems. Philadelphia: Society for Industrial and Applied Mathematics.
16. K. Fan 1953 Minimax theorems Proceedings of the National Academy of Sciences of the United States of America 39 42 47 55678 0050.06501 10.1073/pnas.39.1.42
17. Goldstein, T., Bresson, X., Osher, S. (2009). Geometric applications of the split Bregman method: segmentation and surface reconstruction (UCLA CAM Report 09-06).
18. Greig, D. M., Porteous, B. T., Seheult, A. H. (1989). Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistical Society, Series B, 271-279.
19. J. M. Hyman M. J. Shashkov 1997 Adjoint operators for the natural discretizations of the divergence, gradient and curl on logically rectangular grids Applied Numerical Mathematics 25 4 413 442 1490922 1005.65024 10.1016/S0168-9274(97)00097-4 (Pubitemid 127403141)
20. J. M. Hyman M. J. Shashkov 1997 Natural discretizations for the divergence, gradient, and curl on logically rectangular grids Computer Mathematics and Its Applications 33 4 81 104 1433461 0868.65006 10.1016/S0898-1221(97)00009-6 (Pubitemid 127372185)
21. H. Ishikawa 2003 Exact optimization for Markov random fields with convex priors IEEE Transactions on Pattern Analysis and Machine Intelligence 25 1333 1336 10.1109/TPAMI.2003.1233908
22. M. Kass A. Witkin D. Terzopoulos 1988 Snakes: active contour models International Journal of Computer Vision 1 4 321 331 10.1007/BF00133570
23. K. C. Kiwiel 1995 Proximal minimization methods with generalized Bregman functions SIAM Journal on Control and Optimization 35 1142 1168 1453294 10.1137/S0363012995281742 (Pubitemid 127577145)
24. Klodt, M., Schoenemann, T., Kolev, K., Schikora, M., Cremers, D. (2008). An experimental comparison of discrete and continuous shape optimization methods. In ECCV '08: proceedings of the 10th European conference on computer vision (pp. 332-345). Berlin: Springer.
25. 3 and beyond: move making algorithms for solving higher order functions IEEE Transactions on Pattern Analysis and Machine Intelligence 31 9 1645 1656 10.1109/TPAMI.2008.217
26. Kolmogorov, V. (2005). What metrics can be approximated by geo-cuts, or global optimization of length/area and flux. In ICCV (pp. 564-571). (Pubitemid 44055006)
27. V. Kolmogorov 2006 Convergent tree-reweighted message passing for energy minimization IEEE Transactions on Pattern Analysis and Machine Intelligence 28 10 1568 1583 10.1109/TPAMI.2006.200 (Pubitemid 46405078)
28. V. Kolmogorov R. Zabih 2004 What energy functions can be minimized via graph cuts IEEE Transactions on Pattern Analysis and Machine Intelligence 26 65 81 10.1109/TPAMI.2004.1262177
29. Komodakis, N., Tziritas, G. (2007). Approximate labeling via graph-cuts based on linear programming. Pattern Analysis and Machine Intelligence, 1436-1453. (Pubitemid 47040441)
30. Lellmann, J., Kappes, J., Yuan, J., Becker, F., Schnörr, C. (2009). Convex multi-class image labeling by simplex-constrained total variation. In SSVM '09: proceedings of the second international conference on scale space and variational methods in computer vision (pp. 150-162). Berlin: Springer.
31. Lellmann, J., Breitenreicher, D., Schnörr, C. (2010). Fast and exact primal-dual iterations for variational problems in computer vision. In European conference on computer vision (ECCV).
32. Li, S. Z. (2001). Markov random field modeling in image analysis. New York: Springer.
33. H. Li X. C. Tai 2007 Piecewise constant level set methods for multiphase motion International Journal of Numerical Analysis and Modeling 4 274 293 2287609
34. J. Lie M. Lysaker X.-C. Tai 2006 A variant of the level set method and applications to image segmentation Mathematics of Computation 75 255 1155 1174 2219023 1096.35034 10.1090/S0025-5718-06-01835-7 (Pubitemid 44116291)
35. J. Lie M. Lysaker X. C. Tai 2006 A binary level set model and some applications to Mumford-Shah image segmentation IEEE Transactions on Image Processing 15 5 1171 1181 10.1109/TIP.2005.863956
36. Meyer, Y. (2001). University lecture series: Vol. 22. Oscillating patterns in image processing and nonlinear evolution equations. Providence: American Mathematical Society. The fifteenth Dean Jacqueline B. Lewis memorial lectures.
37. D. Mumford J. Shah 1989 Optimal approximation by piecewise smooth functions and associated variational problems Communications on Pure and Applied Mathematics 42 577 685 997568 0691.49036 10.1002/cpa.3160420503
38. M. Nikolova S. Esedoglu T. F. Chan 2006 Algorithms for finding global minimizers of image segmentation and denoising models SIAM Journal on Applied Mathematics 66 5 1632 1648 2246072 1117.94002 10.1137/040615286 (Pubitemid 44599935)
39. S. Osher J. A. Sethian 1988 Fronts propagating with curvature dependent speed: algorithms based on Hamilton-Jacobi formulations Journal of Computational Physics 79 1 12 49 965860 0659.65132 10.1016/0021-9991(88)90002-2
40. Paragios, N., Chen, Y., Faugeras, O. (2005). Handbook of mathematical models in computer vision. New York: Springer.
41. Pock, T., Schoenemann, T., Graber, G., Bischof, H., Cremers, D. (2008a). A convex formulation of continuous multi-label problems. In European conference on computer vision (ECCV), Marseille, France, October 2008.
42. Pock, T., Schoenemann, T., Graber, G., Bischof, H., Cremers, D. (2008b). A convex formulation of continuous multi-label problems. In ECCV '08: proceedings of the 10th European conference on computer vision (pp. 792-805). Berlin: Springer.
43. Pock, T., Chambolle, A., Bischof, H., Cremers, D. (2009). A convex relaxation approach for computing minimal partitions. In IEEE conference on computer vision and pattern recognition (CVPR), Miami, FL.
44. R. B. Potts 1952 Some generalized order-disorder transformations Proceedings of the Cambridge Philosophical Society 48 106 109 47571 0048.45601 10.1017/S0305004100027419
45. Rockafellar, R. T. (1970). Princeton mathematical series: Vol. 28. Convex analysis. Princeton: Princeton University Press.
46. Rose, K. (1998). Deterministic annealing for clustering, compression, classification, regression, and related optimization problems. In Proceedings of the IEEE (pp. 2210-2239). (Pubitemid 128720301)
47. G. Strang 1983 Maximal flow through a domain Mathematical Programming 26 123 143 700642 0513.90026 10.1007/BF02592050
48. Tao, W., Tai, X. (2009). Multiple piecewise constant active contours for image segmentation using graph cuts optimization (UCLA cam-report 09-13).
49. M. Teboulle 2007 A unified continuous optimization framework for center-based clustering methods Journal of Machine Learning Research 8 65 102 2280215 (Pubitemid 46168467)
50. F. R. D. Velasco 1980 Thresholding using the ISODATA clustering algorithm IEEE Transactions on Systems, Man, and Cybernetics 10 11 771 774 10.1109/TSMC.1980.4308400
51. L. A. Vese T. F. Chan 2002 A new multiphase level set framework for image segmentation via the mumford and shah model International Journal of Computer Vision 50 271 293 1012.68782 10.1023/A:1020874308076 (Pubitemid 35377416)
52. M. Wainwright T. Jaakkola A. Willsky 2002 Map estimation via agreement on (hyper)trees: message-passing and linear programming approaches IEEE Transactions on Information Theory 51 3697 3717 2238992 10.1109/TIT.2005.856938 (Pubitemid 41622574)
53. Yuan, J., Bae, E., Tai, X.-C., Boykov, Y. (2010). A continuous max-flow approach to Potts model. In ECCV 2010: proceedings of the 11th European conference on computer vision (pp. 332-345). Berlin: Springer.
54. Zach, C., Gallup, D., Frahm, J.-M., Niethammer, M. (2008). Fast global labeling for real-time stereo using multiple plane sweeps. In Vision, modeling and visualization workshop (VMV).