Globally Optimal 3D Image Reconstruction and Segmentation Via Energy Minimisation Techniques

  • Brian C. Lovell
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3776)


This paper provides an overview of a number of techniques developed within our group to perform 3D reconstruction and image segmentation based of the application of energy minimisation concepts. We begin with classical snake techniques and show how similar energy minimisation concepts can be extended to derive globally optimal segmentation methods. Then we discuss more recent work based on geodesic active contours that can lead to globally optimal segmentations and reconstructions in 2D. Finally we extend the work to 3D by introducing continuous flow globally minimal surfaces. Several applications are discussed to show the wide applicability and suitability of these techniques to several difficult image analysis problems.


  1. 1.
    Gunn, S.R.: Dual Active Contour Models for Image Feature Extraction. University of Southampton, PhD Thesis (1996)Google Scholar
  2. 2.
    Bamford, P., Lovell, B.: Unsupervised cell nucleus segmentation with active contours. Signal Processing Special Issue: Deformable Models and Techniques for Image and Signal Processing 71, 203–213 (1998)zbMATHGoogle Scholar
  3. 3.
    Appleton, B., Sun, C.: Circular shortest paths by branch and bound. Pattern Recognition 36, 2513–2520 (2003)CrossRefGoogle Scholar
  4. 4.
    Appleton, B.: Optimal geodesic active contours: application to heart segmentation. In: Lovell, B.C., Maeder, A.J. (eds.) APRS Workshop on Digital Image Computing, Brisbane, APRS, vol. 1, pp. 27–32 (2003)Google Scholar
  5. 5.
    Appleton, B., Talbot, H.: Globally optimal geodesic active contours. Journal of Mathematical Imaging and Vision (2005)Google Scholar
  6. 6.
    Appleton, B., Talbot, H.: Globally optimal surfaces by continuous maximal flows. In: Sun, C., Talbot, H., Ourselin, S., Adriaansen, T. (eds.) Digital Image Computing: Techniques and Applications, vol. 2, pp. 987–996. CSIRO Publishing, Sydney (2003)Google Scholar
  7. 7.
    Kass, M., Witten, A., Terzopoulos, D.: Snakes: Active contour models. International Journal of Computer Vision 1, 321–331 (1987)CrossRefGoogle Scholar
  8. 8.
    Cohen, L.D., Cohen, I.: Finite-element methods for active contour models and balloons for 2-D and 3-D images. IEEE Transactions on Pattern Analysis and Machine Intelligence 15, 1131–1147 (1993)CrossRefGoogle Scholar
  9. 9.
    Davatzikos, C.A., Prince, J.L.: An active contour model for mapping the cortex. IEEE Transactions on Medical Imaging 14, 65–80 (1995)CrossRefGoogle Scholar
  10. 10.
    Geiger, D., Gupta, A., Costa, L., Vlontzos, J.: Dynamic programming for detecting, tracking, and matching deformable contours. IEEE Transactions on Pattern Analysis and Machine Intelligence 17, 294–302 (1995)CrossRefGoogle Scholar
  11. 11.
    Bamford, P., Lovell, B.: Improving the robustness of cell nucleus segmentation. In: Lewis, P.H., Nixon, M.S. (eds.) Proceedings of the Ninth British Machine Vision Conference, BMVC 1998, University of Southampton, pp. 518–524 (1998)Google Scholar
  12. 12.
    Lovell, B.C.: Hidden markov models for spatio-temporal pattern recognition and image segmentation. In: Mukherjee, D.P., Pal, S. (eds.) International Conference on Advances in Pattern Recognition, Calcutta, vol. 1, pp. 60–65 (2003)Google Scholar
  13. 13.
    Sethian, J.A.: A fast marching level set method for monotonically advancing fronts. Proceedings of the National Academy of Sciences 93, 1591–1595 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Sethian, J.A.: Level Set Methods and Fast Marching Methods — Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science. Cambridge University Press, Cambridge (1999)zbMATHGoogle Scholar
  15. 15.
    Dijkstra, E.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Osher, S., Sethian, J.A.: Fronts propagating with curvature dependent speeed: Algorithms based on hamilton-jacobi formulations. Journal of Computational Physics 79, 12–49 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Caselles, V., Kimmel, R., Sapiro, G.: Geodesic active contours. International Journal of Computer Vision 22, 61–79 (1997)zbMATHCrossRefGoogle Scholar
  18. 18.
    Appleton, B.C.: Globally Minimal Contours and Surfaces for Image Segmentation, The University of Queensland (2004)Google Scholar
  19. 19.
    Leung, C., Appleton, B., Lovell, B.C., Sun, C.: An energy minimisation approach to stereo-temporal dense reconstruction. In: International Conference on Pattern Recognition, Cambridge, vol. 1, pp. 72–75 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Brian C. Lovell
    • 1
  1. 1.Intelligent Real-Time Imaging and Sensing Group, EMI, The School of Information Technology and Electrical EngineeringThe University of Queensland 

Personalised recommendations