Active contours without level sets

Proceedings - International Conference on Image Processing, ICIP

Volumn , Issue , 2012, Pages 2549-2552

  Yildizoglu, Romain ^a   Aujol, Jean François ^a   Papadakis, Nicolas ^b  

^a UNIVERSITÉ DE BORDEAUX   (France)

^b UNIV GRENOBLE ALPES   (France)

Author keywords

active contours; convexification; Segmentation; total variation

Indexed keywords

ACTIVE CONTOURS; CONVEXIFICATION; FIRST ORDER; LEVEL SET; NUMERICAL EXPERIMENTS; TOTAL VARIATION;

NUMERICAL METHODS;

IMAGE SEGMENTATION;

EID: 84875836434     PISSN: 15224880     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIP.2012.6467418     Document Type: Conference Paper

References (17)

1. M. Kass, A. Witkin, and D. Terzopoulos, "Snakes: Active contour models," IJCV, vol. 1, pp. 321-331, 1988.
2. V. Caselles, R. Kimmel, and G. Sapiro, "Geodesic active contours," IJCV, vol. 22, pp. 61-79, 1997.
3. S. Osher and J. A. Sethian, "Fronts propagating with curvature-dependent speed: Algorithms based on hamiltonjacobi formulations," JCP, vol. 79, no. 1, pp. 12 - 49, 1988.
4. T. F. Chan and L. A. Vese, "Active contours without edges," IEEE TIP, vol. 10, no. 2, pp. 266-277, 2001.
5. Y. Boykov and M. P. Jolly, "Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images," in ICCV'01, 2001, vol. 1, pp. 105-112.
6. E. Bae, J. Yuan, and X.-C. Tai, "Global minimization for continuous multiphase partitioning problems using a dual approach," IJCV, vol. 92, pp. 112-129, 2011.
7. G. Aubert and P. Kornprobst, Mathematical Problems in Image Processing, vol. 147, Springer-Verlag, 2002.
8. M. Nikolova, S. Esedoglu, and T. F. Chan, "Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models," SIAM JAM, 66(5):1632-1648, 2006.
9. T. Pock, T. Schoenemann, G. Graber, H. Bischof, and D. Cremers, "A convex formulation of continuous multi-label problems," in ECCV, 2008, vol. 5304, pp. 792-805.
10. T. Pock, D. Cremers, H. Bischof, and A. Chambolle, "Global solutions of variational models with convex regularization," SIAM JIS, vol. 3, pp. 1122-1145, 2010.
11. E. Brown, T. F. Chan, and X. Bresson, "Completely Convex Formulation of the Chan-Vese Image Segmentation Model," IJCV, pp. 1-19, 2011.
12. T. F. Chan, G. H. Golub, and Pep Mulet, "A nonlinear primal-dual method for total variation-based image restoration," SIAM JSC, vol. 20, pp. 1964-1977, 1999.
13. A. Chambolle and T. Pock, "A first-order primal-dual algorithm for convex problems with applications to imaging," JMIV, vol. 40, pp. 120-145, 2011.
14. K. J. Arrow, L. Hurwicz, and H. Uzawa, Studies in linear and non-linear programming, vol. 2, Stanford Un. Press, 1964.
15. R. T. Rockafellar, "Augmented lagrangians and applications of the proximal point algorithm in convex programming," Mathematics of Operations Research, vol. 1, no. 2, pp. 97-116, 1976.
16. M. Zhu and T Chan, "An efficient primal-dual hybrid gradient algorithm for total variation image restauration," Tech. Rep., UCLA CAM Report 08-34, 2008.
17. A. Baeza, V. Caselles, P. Gargallo, and N. Papadakis, "A narrow band method for the convex formulation of discrete multilabel problems," SIAM JMMS, 8(5):2048-2078, 2010.