Skip to main content

Riemannian Drums, Anisotropic Curve Evolution and Segmentation

  • Conference paper
  • First Online:
Scale-Space Theories in Computer Vision (Scale-Space 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1682))

Included in the following conference series:

Abstract

The method of curve evolution is a popular method for recovering shape boundaries. However isotropic metrics have always been used to induce the flow of the curve and potential steady states tend to be difficult to determine numerically, especially in noisy or low-contrast situations. Initial curves shrink past the steady state and soon vanish. In this paper, anisotropic metrics are considered which remedy the situation by taking the orientation of the feature gradient into account. The problem of shape recovery or segmentation is formulated as the problem of finding minimum cuts of a Riemannian manifold. Approximate methods, namely anisotropic geodesic flows and solution of an eigenvalue problem are discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Bellettini and M. Paolini: “Anisotropic Motion by Mean Curvature in the Context of Finsler Geometry”, Tech. Report, Universita Degli Studi di Milano, (1994).

    Google Scholar 

  2. V. Caselles, F. Catte, T. Coll and F. Dibos: “A Geometric Model for Active Contours”, Numerische Mathematik 66, (1993).

    Google Scholar 

  3. V. Caselles, R. Kimmel and G. Sapiro: “Geodesic Active Contours”, Fifth International Conference on Computer Vision, (1995).

    Google Scholar 

  4. J. Cheeger: “A Lower Bound for the Smallest Eigenvalue of the Laplacian”, in Problems in Analysis, Ed: R.C. Gunning, Princeton University Press, (1970).

    Google Scholar 

  5. Golub and Van Loan: Matrix Computation, John Hopkins University Press, (1989).

    Google Scholar 

  6. M. Kass, A. Witkin and D. Terzopoulos: “Snakes: Active Contour Models”, International J. of Computer Vision, v.1, (1988).

    Google Scholar 

  7. S. Kichenassamy, A. Kumar, P. Olver, A. Tannenbaum and A. Yezzi: “Gradient Flows and Geometric Active Contour Models”, Fifth International Conference on Computer Vision, (1995).

    Google Scholar 

  8. R. Malladi, J.A. Sethian and B.C. Vemuri: “Shape Modeling with Front Propagation: A Level Set Approach”, IEEE-PAMI 17, (1995).

    Google Scholar 

  9. R. Merris: “Laplacian Matrices of Graphs: A Survey”, Linear Algebra and its Applications 197,198, (1994).

    Google Scholar 

  10. B. Mohar: “Laplace Eigenvalues of Graphs-A Survey”, Discrete Math. 109, (1992).

    Google Scholar 

  11. D. Mumford and J. Shah: “Optimal Approximations by Piecewise Smooth Functions and Associated Variational Problems”, Comm. on Pure and Appl. Math, v.XLII, n.5, pp.577–684, (July, 1989).

    Google Scholar 

  12. S. Osher and J. Sethian: “Fronts Propagating with Curvature Dependent Speed: Algorithms based on the Hamilton-Jacobi Formulation”, J. Comp. Physics, 79, (1988).

    Google Scholar 

  13. J. Sethian: “Numerical Algorithms for Propagating Interfaces”, J. of Diff. Geom. v.31, (1990).

    Google Scholar 

  14. J. Shah: “Shape Recovery from Noisy Images by Curve Evolution”, IASTED International Conference on Signal and Image Processing, (1995).

    Google Scholar 

  15. J. Shah: “A Common Framework for Curve Evolution, Segmentation and Anisotropic Diffusion”, IEEE Conference on Computer Vision and Pattern Re:cogntion, June, 1996.

    Google Scholar 

  16. J. Shah: “Segmentation as a Riemannian Drum problem”, IEEE International Conference on Image Processing, October, 1998.

    Google Scholar 

  17. J. Shi and J. Malik: “Normalized Cuts and Image Segmentation”, IEEE Conf. on Computer Vision and Pattern Recognition, (1997).

    Google Scholar 

  18. H. Tek and B.B. Kimia: “Image Segmentation by Reaction-Diffusion Bubbles”, Fifth International Conference on Computer Vision, (1995).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shah, J. (1999). Riemannian Drums, Anisotropic Curve Evolution and Segmentation. In: Nielsen, M., Johansen, P., Olsen, O.F., Weickert, J. (eds) Scale-Space Theories in Computer Vision. Scale-Space 1999. Lecture Notes in Computer Science, vol 1682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48236-9_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-48236-9_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66498-7

  • Online ISBN: 978-3-540-48236-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics