Grouping Connected Components using Minimal Path Techniques

  • T. Deschamps
  • L. D. Cohen
Part of the Mathematics and Visualization book series (MATHVISUAL)


We address the problem of finding a set of contour curves in a 2D or 3D image. We consider the problem of perceptual grouping and contour completion, where the data is an unstructured set of regions in the image. A new method to find complete curves from a set of edge points is presented. Contours are found as minimal paths between connected components, using the fast marching algorithm. We find the minimal paths between each of these components, until the complete set of these “regions” is connected. The paths are obtained using backpropagation from the saddle points to both components.

We then extend this technique to 3D. The data is a set of connected components in a 3D image. We find 3D minimal paths that link together these components. Using a potential based on vessel detection, we illustrate the capability of our approach to reconstruct tree structures in a 3D medical image dataset.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    V. Caselles, R. Kimmel, and G. Sapiro. Geodesic active contours. IJCV, 22(1):61–79, 1997.zbMATHCrossRefGoogle Scholar
  2. 2.
    Laurent D. Cohen. On active contour models and balloons. CVGIP:IU, 53(2):211–218, March 1991.zbMATHCrossRefGoogle Scholar
  3. 3.
    Laurent D. Cohen. Multiple Contour Finding and Perceptual Grouping using Minimal Paths. Journal of Mathematical Imaging and Vision, 14(3), 2001, to appear.Google Scholar
  4. 4.
    Laurent D. Cohen and R. Kimmel. Global minimum for active contour models: A minimal path approach. IJCV, 24(1):57–78, August 1997.CrossRefGoogle Scholar
  5. 5.
    T. Deschamps and L. D. Cohen. Minimal paths in 3D images and application to virtual endoscopy. In Proc. ECCV’00, Dublin, Ireland, July 2000.Google Scholar
  6. 6.
    T. Deschamps and L. D. Cohen. Fast extraction of minimal paths in 3D images and applications to virtual endoscopy. Medical Image Analysis, 2001, to appear.Google Scholar
  7. 7.
    E. W. Dijkstra. A note on two problems in connection with graphs. Numerische Math., 1:269–271, 1959.MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    A. Frangi and W. Niessen, Multiscale Vessel Enhancement Filtering. MICCAI’98, Cambridge.Google Scholar
  9. 9.
    G. Guy and G. Medioni. Inferring global perceptual contours from local features. IJCV, 20(1/2) Oct. 1996.Google Scholar
  10. 10.
    M. Kass, A. Witkin and D. Terzopoulos. Snakes: Active contour models. IJCV, 1(4):321–331, Jan. 1988.CrossRefGoogle Scholar
  11. 11.
    R. Kimmel, A. Amir, and A. Bruckstein. Finding shortest paths on surfaces using level sets propagation. IEEE PAMI-17(6):635–640, June 1995.CrossRefGoogle Scholar
  12. 12.
    R. Kimmel, N. Kiryati, and A. M. Bruckstein. Distance maps and weighted distance transforms. JMIV, 6:223–233, May 1996.MathSciNetCrossRefGoogle Scholar
  13. 13.
    R. Malladi, J. A. Sethian, and B. C. Vemuri. Shape modeling with front propagation: A level set approach. IEEE PAMI, 17(2):158–175, february 1995.CrossRefGoogle Scholar
  14. 14.
    J. A. Sethian. Level Set Methods: Evolving Interfaces in Geometry, Fluid Mechanics, Computer Vision and Materials Sciences. Cambridge Univ. Press, 1996.Google Scholar
  15. 15.
    A. Shaashua and S. Ullman. Structural saliency: The detection of globally salient structures using a locally connected network. In Proc. ICCV’88, Dec. 1988.Google Scholar
  16. 16.
    L. R. Williams and D. W. Jacobs. stochastic completion fields: a neural model of illusory contour shape and salience. In Proc. ICCV’95, June 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • T. Deschamps
    • 1
    • 2
  • L. D. Cohen
    • 2
  1. 1.Medical Imaging Systems Group, Philips Research FranceSuresnesFrance
  2. 2.Laboratoire CEREMADE, UMR 7534Université Paris DauphineParis cedex 16France

Personalised recommendations