A convex approach for computing minimal partitions
作者： Antonin Chambolle , Thomas Pock , Daniel Cremers , ur Informatik
DOI:
关键词:
摘要: We describe a convex relaxation for family of problems minimal perimeter partitions. The minimization the relaxed problem can be tackled numerically, we an algorithm and show some results. In most cases, our finds correct (approximate) solution: give arguments to explain why it should so, also discuss situation where fails.
tum.edu
researchgate.net 参考文章(39)
Marc Niethammer, David Gallup, Christopher Zach, Jan Michael Frahm, Fast Global Labeling for Real-Time Stereo Using Multiple Plane Sweeps. vision modeling and visualization. pp. 243- 252 ,(2008)
Giuseppe Congedo, Italo Tamanini, Optimal segmentation of unbounded functions Rendiconti del Seminario Matematico della Università di Padova. ,vol. 95, pp. 153- 174 ,(1996)
T. F. Chan, L. A. Vese, Active Contour and Segmentation Models using Geometric PDE’s for Medical Imaging Mathematics and visualization. pp. 63- 75 ,(2002) , 10.1007/978-3-642-55987-7_4
I. Tamanini, U. Massari, Regularity properties of optimal segmentations. Crelle's Journal. ,vol. 420, pp. 61- 84 ,(1991)
Claudio Verdi, Giovanni Bellettini, Maurizio Paolini, Convex approximations of functionals with curvature Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni. ,vol. 2, pp. 297- 306 ,(1991)
Gianni Dal Maso, An Introduction to Γ-Convergence ,(1992)
Diego Pallara, Luigi Ambrosio, Nicola Fusco, Functions of Bounded Variation and Free Discontinuity Problems ,(2000)
Herbert Federer, Geometric Measure Theory ,(1969)
Alexis Bonnet, Guy David, Cracktip is a global Mumford-Shah minimizer ,(2001)
Jan Lellmann, Jörg Kappes, Jing Yuan, Florian Becker, Christoph Schnörr, Convex Multi-class Image Labeling by Simplex-Constrained Total Variation international conference on scale space and variational methods in computer vision. pp. 150- 162 ,(2009) , 10.1007/978-3-642-02256-2_13