Global minimum for active contour models: A minimal path approach

International Journal of Computer Vision

Volumn 24, Issue 1, 1997, Pages 57-78

  Cohen, Laurent D ^a   Kimmel, Ron ^b  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Curve evolution; Deformable models snakes; Energy minimization; Feature extraction; Level sets; Partial differential equations; Path of minimal cost; Segmentation; Shape modeling

Indexed keywords

COMPUTER SIMULATION; EDGE DETECTION; FEATURE EXTRACTION; IMAGE SEGMENTATION; NUMERICAL METHODS; PARTIAL DIFFERENTIAL EQUATIONS;

ACTIVE CONTOUR MODELS; TOPOLOGY BASED SADDLE SEARCH ROUTINE;

COMPUTER VISION;

EID: 0031213363     PISSN: 09205691     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007922224810     Document Type: Article

References (72)

1. Adalsteinsson, D. and Sethian, J.A. 1995. A fast level set method for propagating interfaces. J. of Comp. Phys., 118:269-277.
2. Adalsteinsson, D., Kimmel, R., Malladi, R., and Sethian, J.A. 1996. Fast marching method for computing solutions to static Hamilton-Jacobi equations. Technical report, LBL UC Berkeley, CA 94720. Submitted for publication.
3. Amini, A.A., Weymouth, T.E., and Jain, R.C. 1990. Using dynamic programming for solving variational problems in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-12(9):855-867.
4. Bellman, R. and Kalaba, R. 1965. Dynamic Programming and Modern Control Theory. London Mathematical Society Monographs: London.
5. Borgefors, G. 1984. Distance transformations in arbitrary dimensions. Computer Vision, Graphics, and Image Processing, 27:321-345.
6. Bruckstein, A.M. 1988. On shape from shading. Computer Vision, Graphics, and Image Processing, 44:139-154.
7. Canny, J. 1986. A computational approach to edge detection. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-8(6):679-698.
8. Caselles, V., Catté, F., Coll, T., and Dibos, F. 1993. A geometric model for active contours. Numerische Mathematik, 66:1-31.
9. Caselles, V., Kimmel, R., and Sapiro, G. 1995. Geodesic active contours. In Proc. Fifth IEEE International Conference on Computer Vision (ICCV'95), Cambridge, USA, pp. 694-699.
10. Long version in International Journal of Computer Vision, 1997, 22(1):61-79.
11. Caselles, V., Kimmel, R., Sapiro, G., and Sbert, C. 1996. Three dimensional object modeling via minimal surfaces. In Proc. Third European Conference on Computer Vision (ECCV'96), Cambridge, U.K.
12. Chandran, S., Meajima, T., and Miyazaki, S. 1991. Global minima via dynamic programming: Energy minimizing active contours. In Proc. SPIE Vol. 1570 Geometric Methods in Computer Vision, San Diego, pp. 391-402.
13. Cohen, Laurent D. 1991. On active contour models and balloons. Computer Vision, Graphics, and Image Processing: Image Understanding, 53(2):211-218.
14. Cohen, Laurent D. 1995. Variational Methods for Image Processing (in French). Université Paris Dauphine. "Mémoire d'Habilitation à diriger des recherches" Presented together with 10 main publications (in English) during 1988-1995.
15. Cohen, Laurent D. 1996. Auxiliary variables and two-step iterative algorithms in computer vision problems. Journal of Mathematical Imaging and Vision, 6(1):61-86.
16. See also ICCV'95.
17. Cohen, Laurent D., Bardinet, E., and Ayache, N. 1993. Surface reconstruction using active contour models. In Proceedings SPIE 93 Conference on Geometric Methods in Computer Vision, San Diego, CA. See also INRIA TR 1824, Dec. 1992.
18. Cohen, Laurent D. and Cohen, Isaac 1993. Finite element methods for active contour models and balloons for 2-D and 3-D images. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-15(11).
19. Crandall, M.G., Ishii, H., and Lions, P.L. 1992. User's guide to viscosity solutions of second order partial linear differential equations. Bulletin of the American Math. Society, 27:1-67.
20. Danielsson, P.E. 1980. Euclidean distance mapping. Computer Vision, Graphics, and Image Processing, 14:227-248.
21. Davatzikos, C. and Prince, J. 1993. Adaptive active contour algorithms for extracting and mapping thick curves. In Proc. 1993 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, New York, pp. 524-529.
22. Dijkstra, E.W. 1959. A note on two problems in connection with graphs. Numerische Mathematic, 1:269-271.
23. Dubrovin, B.A., Fomenko, A.T., and Novikov, S.P 1984. Modern Geometry-Methods and Applications I. Springer-Verlag: New York.
24. Dupuis, P. and Oliensis, J. 1994. An optimal control formulation and related numerical methods for a problem in shape reconstruction. Annals of Applied Probability, 4(2):287-346.
25. Fischler, M.A., Tenenbaum, J.M., and Wolf, H.C. 1981. Detection of roads and linear structures in low-resolution aerial imagery using a multisource knowledge integration technique. Computer Graphics and Image Processing, 15:201-223.
26. Fua, P. and Leclerc, Y.G. 1990. Model driven edge detection. Machine Vision and Applications, 3:45-56.
27. Fujimura, K., Yokoya, N., and Yamamoto, K. 1992. Motion tracking of deformable objects based on energy minimization using multiscale dynamic programming. In Proc. IEEE International Conference on Pattern Recognition, The Hague, 1:83-86.
28. Geiger, D., Gupta, A., Costa, L., and Vlontzos, J. 1995. Dynamic programming for detecting, tracking, and matching deformable contours. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI 17(3):294-302.
29. Geman, D. and Jedynak, B. 1996. An active testing model for tracking roads in satellite images. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI 18(1):1-14.
30. Grzeszczuk, R.P. and Levin, D.N. 1994. Brownian strings: Segmenting images with stochastically deformable contours. In Proceedings of Visualization in Biomedical Computing (VBC'94), pp. 72-89.
31. Kass, M., Witkin, A., and Terzopoulos, D. 1988. Snakes: Active contour models. International Journal of Computer Vision, 1(4):321-331.
32. Kichenassamy, S., Kumar, A., Olver, P., Tannenbaum, A., and Yezzi, A. 1995. Gradient flows and geometric active contour models. In Proc. Fifth IEEE International Conference on Computer Vision (ICCV'95), Cambridge, USA, pp. 810-815.
33. Kimmel, R. 1995. Curve Evolution on Surfaces. Ph.D. thesis, Technion, Israel Institute of Technology, Haifa, Israel.
34. Kimmel, R. and Kiryati, N. 1994. Finding shortest paths on surfaces by fast global approximation and precise local refinement. In Proceedings of SPIE Vision Geometry III, vol. 2356, pp. 198-209, Boston, Massachusetts.
35. Long version to appear in International Journal of Pattern Recognition and Artificial Intelligence 1996, 10(6):643-656.
36. Kimmel, R., Amir, A., and Bruckstein, A. 1995. Finding shortest paths on surfaces using level sets propagation. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-17(6):635-640.
37. Kimmel, R. and Sethian, J.A. 1996. Fast marching methods for computing distance maps and shortest paths. Technical report, LBL, Univ. of California, Berkeley.
38. Kimmel, R., Kiryati, N., and Bruckstein, A.M. 1996. Distance maps and weighted distance transforms. Journal of Mathematical Imaging and Vision. Special Issue on Topology and Geometry in Computer Vision, 6(2/3):223-233.
39. Kiryati, N. and Székely, G. 1993. Estimating shortest paths and minimal distances on digitized three dimensional surfaces. Pattern Recognition, 26(11):1623-1637.
40. Leitner, F. and Cinquin, P. 1991. Dynamic segmentation: Detecting complex topology 3D-object. In Proceedings of International Conference of the IEEE Engineering in Medicine and Biology Society, Orlando, Florida, pp. 295-296.
41. Leymarie, F. and Levine, M.D. 1993. Tracking deformable objects in the plane using an active contour model. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15(6):617-634.
42. Malladi, R. and Sethian, J.A. 1994. A unified framework for shape segmentation representation, and recognition. Technical Report LBL-36069 UC-405, Dept. of Mathematics, Univ. of California, Berkeley.
43. Malladi, R., Sethian, J.A., and Vemuri, B.C. 1994. Evolutionary fronts for topology-independent shape modeling and recovery. In Proc. Third European Conference on Computer Vision, Stockholm, Sweden, pp. 3-13.
44. Malladi, R., Sethian, J.A., and Vemuri, B.C. 1995. Shape modeling with front propagation: A level set approach. IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI 18(4):426-431.
45. McInerney, T. and Terzopoulos, D. 1995. Medical image segmentation using topologically adaptable snakes. In Proceedings of the First International Conference on Computer Vision, Virtual Reality, and Robotics in Medicine CVRMed'95, Springer (Ed.), Nice, France.
46. See also ICCV'95.
47. Merlet, N. and Zerubia, J. 1993. A curvature dependent energy function for detecting lines in satellite images. In Proc. of 8th SCIA, Tromso.
48. Merlet, N. and Zerubia, J. 1994. New prospects in line detection for remote sensing images. In Proc. of IEEE ICASSP, Adelaide.
49. Mitchell, J.S.B., Payton, D., and Keirsey, D. 1987. Planning and reasoning for autonomous vehicle control. International Journal of Intelligent Systems, 2:129-198.
50. Montanari, U. 1971. On the optimal detection of curves in noisy pictures. Communications of the ACM, 14(5):335-345.
51. Mortensen, E. and Barrett, W. 1995. Intelligent scissors for image composition. In Computer Graphics (Proceedings of SIGGRAPH'95), Los Angeles, pp. 191-198.
52. Neuenschwander, W., Fua, P., Szekely, G., and Kubler, O. 1994. Making snakes converge from minimal initialization. In Proc. 12th IEEE International Conference on Pattern Recognition, Jerusalem, Israel, pp. A-613-615.
53. Osher, S.J. and Sethian, J.A. 1988. Fronts propagation with curvature dependent speed: Algorithms based on Hamilton-Jacobi formulations. Journal of Computational Physics, 79:12-49.
54. Rouy, E. and Tourin, A. 1992. A viscosity solutions approach to shape-from-shading. SIAM. J. Numer. Analy., 29:867-884.
55. Rutovitz, D. 1968. Data structures for operations on digital images. In Pictorial Pattern Recognition, G.C. Cheng, R.S. Ledley, D.K. Pollock, and A. Rosenfeld (Eds.), Thompson Book: Washington, pp. 105-133.
56. Sapiro, G. 1996. Vector-valued active contours. In Proc. IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '96), San Francisco, USA.
57. Sedgewick, R. 1988. Algorithms. Addison-Wesley.
58. Sethian, J.A. 1989. A review of recent numerical algorithms for hypersurfaces moving with curvature dependent flows. J. Differential Geometry, 31:131-161.
59. Sethian, J.A. 1995. A review of the theory, algorithms, and applications of level set methods for propagating interfaces. Acta Numerica.
60. Sethian, J.A. 1996. A fast marching level set method for monotonically advancing fronts. Proc. Nat. Acad. Sci., 93(4).
61. Sethian, J.A. 1996b. Level Set Methods: Evolving Interfaces in Geometry, Fluid Mechanics, Computer Vision and Materials Sciences. Cambridge Univ. Press.
62. Shaashua, A. and Ullman, S. 1988. Structural saliency: The detection of globally salient structures using a locally connected network. In Proc. Second IEEE International Conference on Computer Vision (ICCV'88), pp. 321-327.
63. Shah, J. 1996. A common framework for curve evolution, segmentation and anisotropic diffusion. In Proc. IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '96), San Francisco, USA.
64. Sussman, M., Smereka, P., and Osher, S. 1994. A level set approach for computing solutions to incompressible two-phase flow. J. of Computational Physics, 114:146-159.
65. Szeliski, R. and Tonnesen, D. 1992. Surface modeling with oriented particle systems. In SIGGRAPH'92 Conference Proceedings Computer Graphics, Chicago, IL, pp. 185-194.
66. Szeliski, R., Tonnessen, D., and Terzopoulos, D. 1993. Curvature and continuity control in particle-based surface models. In Proceedings SPIE 93 Conference on Geometric Methods in Computer Vision, San Diego, CA.
67. Tek, H. and Kimia, B. 1995. Image segmentation by reaction-diffusion bubbles. In Proc. Fifth IEEE International Conference on Computer Vision (ICCV'95), Cambridge, USA, pp. 156-162.
68. Terzopoulos, D. 1987. On matching deformable models to images: Direct and iterative solutions. In Topical Meeting on Machine Vision, Technical Digest Series, Optical Society of America, 12:160-167.
69. Thiel, E. and Montanvert, A. 1992. Chamfer masks: Discrete distance functions, geometrical properties and optimization. In IEEE ICPR, The Hague, C:244-247.
70. Tsitsiklis, J.N. 1995. Efficient Algorithms for Globally Optimal Trajectories. IEEE Transactions on Automatic Control, 40(9):1528-1538.
71. Verbeek, P.W. and Verwer, B.J.H. 1990. Shading from shape, the eikonal equation solved by gray-weighted distance transform. Pattern Recognition Letters, 11:681-690.
72. Whitaker, R. 1995. Algorithms for implicit deformable models. In Proc. Fifth IEEE International Conference on Computer Vision (ICCV'95), Cambridge, USA, pp. 822-827.