Advertisement

Adaptation of Eikonal Equation over Weighted Graph

  • Vinh-Thong Ta
  • Abderrahim Elmoataz
  • Olivier Lézoray
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5567)

Abstract

In this paper, an adaptation of the eikonal equation is proposed by considering the latter on weighted graphs of arbitrary structure. This novel approach is based on a family of discrete morphological local and nonlocal gradients expressed by partial difference equations (PdEs). Our formulation of the eikonal equation on weighted graphs generalizes local and nonlocal configurations in the context of image processing and extends this equation for the processing of any unorganized high dimensional discrete data that can be represented by a graph. Our approach leads to a unified formulation for image segmentation and high dimensional irregular data processing.

Keywords

Image Segmentation Weighted Graph Initial Seed Weighted Distance Eikonal Equation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Rouy, E., Tourin, A.: A viscosity solutions approach to shape-from-shading. SIAM J. Num. Anal. 29, 867–884 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Sethian, J.: A fast marching level set methods for monotonically advancing fronts. Proc. Nat. Acad. Sci. 41(2), 199–235 (1999)zbMATHGoogle Scholar
  3. 3.
    Siddiqi, K., Bouix, S., Tannenbaum, A., Zucker, S.W.: The hamilton-jacobi skeleton. In: Proc. ICCV, pp. 828–834 (1999)Google Scholar
  4. 4.
    Maragos, P., Butt, M.: Curve evolution, differential morphology and distance transforms as applied to multiscale and eikonal problems. Fundamentae Informatica 41, 91–129 (2000)zbMATHGoogle Scholar
  5. 5.
    Bronstein, A.M., Bronstein, M.M., Kimmel, R.: Weighted distance maps computation on parametric three-dimensional manifolds. J. Comput. Phys. 225(1), 771–784 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Sethian, J.A., Vladimirsky, A.: Ordered upwind methods for static hamiton-jacabi equations: Theory and algorithms. SIAM J. Num. Anal. 41(1), 325–363 (2003)CrossRefzbMATHGoogle Scholar
  7. 7.
    Abgrall, R.: Numerical discretization of the first-order hamilton-jacobi equations on triangular meshes. Comm. Pure and Applied Math. 49, 1339–1373 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Shu, C.-W., Zhang, Y.-T.: High order WENO schemes for hamilton-jacobi equations on triangular meshes. SIAM J. Scien. Comp. 24, 1005–1030 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Mémoli, F., Sapiro, G.: Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces. J. Comput. Phys. 173, 730–764 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Leveque, R.: Finite Volume Methods for Hyperbolic Problems. Cambridge University Press, Cambridge (2002)CrossRefzbMATHGoogle Scholar
  11. 11.
    Sethian, J.A.: Level Set Methods and Fast Marching Methods. Evolving Interfaces in Computational Geometry. In: Fluid Mechanics, Computer Vision, and Materials Science, 2nd edn. Cambridge University Press, Cambridge (1999)Google Scholar
  12. 12.
    Zhao, H.K.: Fast sweeping method for eikonal equations. Math. Comp. 74, 603–627 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Tsitsiklis, J.: Efficient algorithms for globally optimal trajectories. IEEE Trans. Autom. Control 40(9), 1528–1538Google Scholar
  14. 14.
    Osher, S., Sethian, J.: Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations. J. Comput. Phys. 79, 12–49 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Jaromczyk, J., Toussaint, G.: Proc. IEEE. Relative Neighborhood Graphs and Their Relatives 80(9), 1502–1517 (1992)Google Scholar
  16. 16.
    Elmoataz, A., Lézoray, O., Bougleux, S., Ta, V.T.: Unifying local and nonlocal processing with partial difference operators on weighted graphs. In: Proc. LNLA, pp. 11–26 (2008)Google Scholar
  17. 17.
    Efros, A., Leung, T.: Texture synthesis by non-parametric sampling. In: Proc. ICCV, pp. 1033–1038 (1999)Google Scholar
  18. 18.
    Buades, A., Coll, B., Morel, J.: Nonlocal image and movie denoising. IJCV 76(2), 123–139 (2008)CrossRefGoogle Scholar
  19. 19.
    Gilboa, G., Osher, S.: Nonlocal operators with applications to image processing. Report 07-23, UCLA (2007)Google Scholar
  20. 20.
    Bougleux, S., Elmoataz, A., Melkemi, M.: Discrete regularization on weighted graphs for image and mesh filtering. In: Sgallari, F., Murli, A., Paragios, N. (eds.) SSVM 2007. LNCS, vol. 4485, pp. 128–139. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  21. 21.
    Ta, V.T., Elmoataz, A., Lézoray, O.: Partial difference equations over graphs: Morphological processing of arbitrary discrete data. In: Proc. ECCV, pp. 668–680 (2008)Google Scholar
  22. 22.
    Brockett, R., Maragos, P.: Evolution equations for continuous-scale morphological filtering. IEEE Trans. Signal Process. 42(12), 3377–3386 (1994)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Vinh-Thong Ta
    • 1
  • Abderrahim Elmoataz
    • 1
  • Olivier Lézoray
    • 1
  1. 1.Université de Caen Basse-Normandie, GREYC CNRS UMR 6072, Image TeamFrance

Personalised recommendations