A linear framework for region-based image segmentation and inpainting involving curvature penalization

International Journal of Computer Vision

Volumn 99, Issue 1, 2012, Pages 53-68

  Schoenemann, Thomas ^a   Kahl, Fredrik ^a   Masnou, Simon ^b   Cremers, Daniel ^c  

^a LUND UNIVERSITY   (Sweden)

^b UNIVERSITÉ LYON 1   (France)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Cell complexes; Curvature regularity; Image segmentation; Inpainting; Linear programming

Indexed keywords

BOUNDARY ELEMENTS; BOUNDARY VARIABLES; CELL COMPLEXES; CONSTRAINT SET; CURVATURE REGULARITY; GLOBAL OPTIMUM; INPAINTING; INTEGER LINEAR PROGRAMS; LINEAR PROGRAMMING RELAXATION; OPTIMIZATION PROBLEMS; OPTIMIZATION SCHEME; REGION-BASED;

CURVE FITTING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION;

IMAGE SEGMENTATION;

EID: 84860525582     PISSN: 09205691     EISSN: 15731405     Source Type: Journal    
DOI: 10.1007/s11263-012-0518-7     Document Type: Article

References (37)

1. A. A. Amini T. E. Weymouth R. C. Jain 1990 Using dynamic programming for solving variational problems in vision IEEE Transactions on Pattern Analysis and Machine Intelligence 12 9 855 867 10.1109/34.57681 (Pubitemid 20739142)
2. Bertalmío, M., Sapiro, G., Caselles, V., & Ballester, C. (2001). Image inpainting. In ACM SIGGRAPH, July 2001.
3. Blake, A., & Zissermann, A. (1987). Visual reconstruction. Cambridge: MIT press.
4. F. Bornemann T. März 2007 Fast image inpainting based on coherence transport Journal of Mathematical Imaging and Vision 28 3 259 278 2367298 10.1007/s10851-007-0017-6 (Pubitemid 350001080)
5. Boykov, Y., & Jolly, M. P. (2001). Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images. In IEEE international conference on computer vision (ICCV), Vancouver, Canada, July 2001.
6. Boykov, Y., & Kolmogorov, V. N. (2003). Computing geodesics and minimal surfaces via graph cuts. In IEEE international conference on computer vision (ICCV), Nice, France, October 2003.
7. A. M. Bruckstein A. N. Netravali T. J. Richardson 2001 Epi-convergence of discrete elastica Applicable Analysis 79 137 171 1880530 1035.49010 10.1080/00036810108840955 Bob Caroll Special Issue
8. Cao, F., Gousseau, Y., Masnou, S., & Pérez, P. (2012). Geometrically guided expemplar-based inpainting. SIAM Journal on Imaging Sciences, submitted.
9. T. F. Chan S. H. Kang J. Shen 2002 Euler's elastica and curvature based inpaintings SIAM Journal on Applied Mathematics 2 564 592 1951951
10. T. F. Chan L. Vese 2001 Active contours without edges IEEE Transactions on Image Processing 10 2 266 277 1039.68779 10.1109/83.902291 (Pubitemid 32254596)
11. Dantzig, G. B., & Thapa, M. N. (1997). Linear programming 1: introduction. Springer series in operations research. Berlin: Springer.
12. El-Zehiry, N. Y., & Grady, L. (2010). Fast global optimization of curvature. In IEEE computer society conference on computer vision and pattern recognition (CVPR), San Francisco, California, June 2010.
13. S. Esedoglu R. March 2003 Segmentation with depth but without detecting junctions Journal of Mathematical Imaging and Vision 18 7 15 1966172 1033.68132 10.1023/A:1021837026373
14. Goldlücke, B., & Cremers, D. (2011). Introducing total curvature for image processing. In IEEE international conference on computer vision (ICCV), Barcelona, Spain, November 2011.
15. L. Grady 2010 Minimal surfaces extend shortest path segmentation methods to 3d IEEE Transactions on Pattern Analysis and Machine Intelligence 32 2 321 334 10.1109/TPAMI.2008.289
16. D. M. Greig B. T. Porteous A. H. Seheult 1989 Exact maximum a posteriori estimation for binary images Journal of the Royal Statistical Society Series B Methodological 51 2 271 279
17. G. Kanizsa 1971 Contours without gradients or cognitive contours Giornale Italiano Di Psicologia 1 93 112
18. Klodt, M., Schoenemann, T., Kolev, K., Schikora, M., & Cremers, D. (2008). An experimental comparison of discrete and continuous shape optimization methods. In European conference on computer vision (ECCV), Marseille, France, October 2008.
19. S. Masnou 2002 Disocclusion: A variational approach using level lines IEEE Transactions on Image Processing 11 68 76 1888912 10.1109/83.982815 (Pubitemid 34278444)
20. Masnou, S., & Morel, J. M. (1998). Level-lines based disocclusion. In International conference on image processing (ICIP), Chicago, Michigan, 1998.
21. D. Mumford J. Shah 1989 Optimal approximations by piecewise smooth functions and associated variational problems Communications on Pure and Applied Mathematics 42 577 685 997568 0691.49036 10.1002/cpa.3160420503
22. M. Nikolova S. Esedoglu T. 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)
23. Nitzberg, M., Mumford, D., & Shiota, T. (1993). Filtering, segmentation and depth. In LNCS, vol. 662. Berlin: Springer.
24. P. Parent S. W. Zucker 1989 Trace inference, curvature consistency, and curve detection IEEE Transactions on Pattern Analysis and Machine Intelligence 11 8 823 839 10.1109/34.31445
25. Rudin, W. (1987). Real and complex analysis. New York: McGraw-Hill.
26. Schoenemann, T., & Cremers, D. (2007). Introducing curvature into globally optimal image segmentation: minimum ratio cycles on product graphs. In IEEE international conference on computer vision (ICCV), Rio de Janeiro, Brazil, October 2007.
27. Schoenemann, T., Kahl, F., & Cremers, D. (2009). Curvature regularity for region-based image segmentation and inpainting: A linear programming relaxation. In IEEE international conference on computer vision (ICCV), Kyoto, Japan, September 2009.
28. Schoenemann, T., Kuang, Y., & Kahl, F. (2011). Curvature regularity for multi-label problems-standard and customized linear programming. In International workshop on energy minimization methods in computer vision and pattern recognition, St. Petersburg, Russia, July 2011.
29. Schrijver, A. (1986). Theory of linear and integer programming. Wiley-Interscience series in discrete mathematics and optimization. New York: Wiley.
30. Strandmark, P., & Kahl, F. (2011). Curvature regularization for curves and surfaces in a global optimization framework. In International workshop on energy minimization methods in computer vision and pattern recognition, St. Petersburg, Russia, July 2011.
31. Sullivan, J. M. (1992). A crystalline approximation theorem for hypersurfaces. PhD thesis, Princeton University, Princeton, New Jersey.
32. Sullivan, J. M. (1994). Computing hypersurfaces which minimize surface energy plus bulk energy. In Motion by mean curvature and related topics (pp. 186-197).
33. Toshev, A., Taskar, B., & Daniilidis, K. (2010). Object detection via boundary structure segmentation. In IEEE computer society conference on computer vision and pattern recognition (CVPR), San Francisco, California, June 2010.
34. D. Tschumperlé 2006 Fast anisotropic smoothing of multi-valued images using curvature-preserving PDE's International Journal of Computer Vision 68 1 65 82 10.1007/s11263-006-5631-z (Pubitemid 43724018)
35. Weickert, J. (1998). Anisotropic diffusion in image processing. Stuttgart: Teubner.
36. Weickert, J. (2003). Coherence-enhancing shock filters. In Pattern recognition (proc. DAGM), Magdeburg, Germany, September 2003.
37. Ye, Y. (1997). Interior point algorithms: theory and analysis. Wiley-Interscience series in discrete mathematics. New York: Wiley.