Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images

Computer Vision and Image Understanding

Volumn 112, Issue 1, 2008, Pages 81-90

  Zeng, Yun ^a   Samaras, Dimitris ^a   Chen, Wei ^b   Peng, Qunsheng ^b  

^a Stony Brook University   (United States)

^b ZHEJIANG UNIVERSITY   (China)

Author keywords

Graph cuts; Image segmentation; Min cut max flow; Topology cuts; Topology preservation

Indexed keywords

CANNING; DATA STRUCTURES; FILE ORGANIZATION; GRAPH THEORY; IMAGE PROCESSING; IMAGE SEGMENTATION; NEURAL NETWORKS; NUCLEAR PROPULSION; TOPOLOGY;

APPROXIMATE SOLUTIONS; DISTANCE FUNCTIONS; DISTANCE MAPS; ENERGY FUNCTIONS; FLOW ALGORITHM; GLOBAL CONSTRAINTS; GRAPH CUTS; GRAPH-BASED; MAXIMUM FLOWS; MIN-CUT/MAX-FLOW; MINIMAL DISTANCE; NP-HARD; OBJECT TRACKING; OPTIMUM SOLUTIONS; PRIORITY QUEUEING; SEGMENTATION TASKS; TOPOLOGY CONSTRAINTS; TOPOLOGY CUTS; TOPOLOGY PRESERVATION; TOPOLOGY PRESERVING;

ALGORITHMS;

EID: 52949102105     PISSN: 10773142     EISSN: 1090235X     Source Type: Journal    
DOI: 10.1016/j.cviu.2008.07.008     Document Type: Article

References (32)

1. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network Flows: Theory, Algorithms, and Applications (1993), Prentice Hall
2. Bertrand G. Simple points, topological numbers and geodesic neighborhoods in cubic grids. Pattern Recognition Letters 15 10 (1994) 1003-1011
3. Boykov Y., and Funka-Lea G. Graph cuts and efficient N-D image segmentation. IJCV 70 2 (2006) 109-131
4. Y. Boykov, V. Kolmogorov, Computing geodesics and minimal surfaces via graph cuts, in: ICCV 03, 2003, pp. 26-33.
5. Boykov Y., and Kolmogorov V. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. PAMI 26 9 (2004) 1124-1137
6. Y. Boykov, V. Kolmogorov, D. Cremers, A. Delong, An integral solution to surface evolution PDEs via geo-cuts, in: ECCV 06, 2006, pp. 409-422.
7. Boykov Y., and Veksler O. Graph cuts in vision and graphics: theories and applications. In: Paragios N., Chen Y., and Faugeras O. (Eds). The Handbook of Mathematical Models in Computer Vision (2006), Springer-Verlag 79-96
8. Boykov Y., Veksler O., and Zabih R. Fast approximate energy minimization via graph cuts. PAMI 23 11 (2001) 1222-1239
9. Brown R. Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem. Commun. ACM 31 10 (1998) 1220-1227
10. Chan T., and Vese L. Active contour model without edges. IEEE Transactions on Image Processing 10 2 (2001) 266-277
11. Cherkassky B.V., and Goldberg A.V. On implementing the push-relabel method for the maximum flow problem. Algorithmica 19 4 (1997) 390-410
12. D. Freedman, T. Zhang, Interactive graph cut based segmentation with shape priors. in: CVPR 05, 2005, pp. 755-762.
13. German S., and German D. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images (1988), MIT Press, Cambridge, MA, USA
14. Han X., Xu C., and Prince J.L. A topology preserving level set method for geometric deformable models. PAMI 25 6 (2003) 755-768
15. O. Juan, Y. Boykov, Active graph cuts, in: CVPR 06, 2006, pp. 1023-1029.
16. N. Komodakis, G. Tziritas, A new framework for approximate labeling via graph cuts, in: ICCV'05, 2005, pp. 1018-1025.
17. N. Komodakis, Nikos Paragios, Georgios Tziritas, MRF optimization via dual decomposition: message-passing revisited, in: ICCV'07.
18. N. Komodakis, G. Tziritas, N. Paragios, Fast, approximately optimal solutions for single and dynamic MRFs, in: CVPR'07, 2007, pp. 1-8.
19. V. Kolmogorov, Y. Boykov, What metrics can be approximated by geo-cuts, or global optimization of length/area and flux, in: ICCV 05, 2005, pp. 564-571.
20. Kolmogorov V., and Zabih R. What energy functions can be minimized via graph cuts?. PAMI 26 2 (2004) 147-159
21. M.P. Kumar, P.H.S. Torr, A. Zisserman, OBJ CUT, in: CVPR 05, 2005, pp. 18-25.
22. H. Lombaert, Y. Sun, L. Grady, C. Xu, A multilevel banded graph cuts method for fast image segmentation, in: ICCV 05, vol. 1, 2005, pp. 259-265.
23. In: Osher S., and Fedkiw R. (Eds). Level Set Methods and Dynamic Implicit Surfaces (1998), Springer-Verlag
24. Osher S., and Sethian J. Fronts propagating with curvature-dependent speed: Algorithms based on the Hamilton-Jacobi formulation. J. Comput. Phys. 79 2 (1988) 12-49
25. In: Paragios N., Chen Y., and Faugeras O. (Eds). The Handbook of Mathematical Models in Computer Vision (2005), Springer-Verlag
26. Rother C., Kolmogorov V., and Blake A. Grabcut: interactive foreground extraction using iterated graph cuts. ACM Trans. Graph. 23 3 (2004) 309-314
27. W. Shi, C. Su, The rectilinear steiner arborescence problem is np-complete, in: SODA 00, 2000, pp. 780-787.
28. Y. Shi, W.C. Karl, Real-time tracking using level sets, in: CVPR 05, 2005, pp. 34-41.
29. Vazirani V.V. Approximation Algorithms (2001), Springer-Verlag
30. Garey M.R., and Johnson D.S. The rectilinear steiner tree problem is NP-complete. SIAM J. Appl. Math. 32 4 (1977) 826-834
31. Florent Ségonne, Segmentation of Medical Images under Topological Constraints. PhD Thesis, MIT, 2005.
32. G. Sundaramoorthi, A. Yezzi, More-than-topology-preserving flows for active contours and polygons, in: ICCV 05, vol. 2, 2005, pp. 1276-1283.