Fast object segmentation by growing minimal paths from a single point on 2D or 3D images

Journal of Mathematical Imaging and Vision

Volumn 33, Issue 2, 2009, Pages 209-221

  Benmansour, Fethallah ^a   Cohen, Laurent D ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Digital topology; Energy minimizing curves; Fast marching method; Image segmentation; Minimal paths; Object extraction; Surface meshing

Indexed keywords

FEATURE EXTRACTION; TOPOLOGY;

DIGITAL TOPOLOGY; ENERGY MINIMIZING CURVES; FAST MARCHING METHODS; MINIMAL PATH; OBJECT EXTRACTION; SURFACE MESHING;

IMAGE SEGMENTATION;

EID: 59849098516     PISSN: 09249907     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10851-008-0131-0     Document Type: Article

References (22)

1. R. Ardon L.D. Cohen A. Yezzi 2007 A new implicit method for surface segmentation by minimal paths in 3d images Appl. Math. Optim. 55 18 127 144
2. Benmansour, F., Bonneau, S., Cohen, L.D.: Finding a closed boundary by growing minimal paths from a single point on 2d or 3d images. In: MMBIA07, pp. 1-8 (2007)
3. Bonneau, S.: Chemins minimaux en Analyse d'images: Nouvelles contributions et applications à l'imagerie biologique. PhD thesis, Université Paris-Dauphine, France (2006)
4. S. Bonneau M. Dahan L.D. Cohen 2005 Single quantum dot tracking based on perceptual grouping using minimal paths in a spatiotemporal volume IEEE Trans. Image Process. 14 1384 1395
5. V. Caselles R. Kimmel G. Sapiro 1997 Geodesic active contours Int. J. Comput. Vis. 22 61 79
6. L.D. Cohen 2001 Multiple contour finding and perceptual grouping using minimal paths J. Math. Imaging Vis. 14 225 236
7. Cohen, L.D.: Minimal paths and fast marching methods for image analysis. In: Paragios, N., Chen, Y., Faugeras, O. (eds.) Mathematical Models in Computer Vision: The Handbook. Springer, Berlin (2005)
8. L.D. Cohen R. Kimmel 1997 Global minimum for active contour models: a minimal path approach Int. J. Comput. Vis. 24 57 78
9. T. Deschamps L.D. Cohen 2001 Fast extraction of minimal paths in 3D images and applications to virtual endoscopy Med. Image Anal. 5 281 299
10. E.W. Dijkstra 1959 A note on two problems in connection with graphs Numer. Math. 1 269 271
11. A.X. Falcão J.K. Udupa F.K. Miyazawa 2000 An ultra-fast user-steered image segmentation paradigm: Live-wire-on-the-fly IEEE Trans. Med. Imaging 19 1 55 62
12. M. Kass A. Witkin D. Terzopoulos 1988 Snakes: active contour models Int. J. Comput. Vis. 1 321 331
13. S. Kim 2001 An mathcal(O)((N)) level set method for Eikonal equations SIAM J. Sci. Comput. 22 2178 2193
14. R. Kimmel J.A. Sethian 2001 Optimal algorithm for shape from shading and path planning J. Math. Imaging Vis. 14 237 244
15. G. Peyré L.D. Cohen 2006 Geodesic remeshing using front propagation Int. J. Comput. Vis. 69 145 156
16. E. Rouy A. Tourin 1992 A viscosity solution approach to shape from shading SIAM J. Numer. Anal. 29 867 884
17. J.A. Sethian 1996 A fast marching level set for monotonically advancing fronts Proc. Natl. Acad. Sci. 93 1591 1595
18. J.A. Sethian 1999 Fast marching methods SIAM Rev. 41 199 235
19. Sethian, J.A.: Level Set Methods and Fast Marching Methods. Cambridge University Press, Cambridge (1999)
20. J.N. Tsitsiklis 1995 Efficient algorithms for globally optimal trajectories IEEE Trans. Autom. Control 40 1528 1538
21. L. Yatziv A. Bartesaghi G. Sapiro 2006 Mathcal(O)((N)) implementation of the fast marching algorithm J. Comput. Phys. 212 393 399
22. A. Yezzi S. Kichenassamy A. Kumar P. Olver A. Tannenbaum 1997 A geometric snake model for segmentation of medical imagery IEEE Trans. Med. Imaging 16 199 209