Adaptation of Eikonal Equation over Weighted Graph

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.

[1]  R. LeVeque.  Finite Volume Methods for Hyperbolic Problems: Characteristics and Riemann Problems for Linear Hyperbolic Equations , 2002 .

[2]  Abderrahim Elmoataz,et al.  Partial Difference Equations over Graphs: Morphological Processing of Arbitrary Discrete Data , 2008, ECCV.

[3]  A. Elmoataz,et al.  Author Manuscript, Published in "international Workshop on Local and Non-local Approximation in Image Processing, Suisse Unifying Local and Nonlocal Processing with Partial Difference Operators on Weighted Graphs , 2022 .

[4]  F. Mémoli,et al.  Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces: 730 , 2001 .

[5]  Guy Gilboa,et al.  Nonlocal Operators with Applications to Image Processing , 2008, Multiscale Model. Simul..

[6]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[7]  J. Tsitsiklis,et al.  Efficient algorithms for globally optimal trajectories , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[8]  Sung Yong Shin,et al.  On pixel-based texture synthesis by non-parametric sampling , 2006, Comput. Graph..

[9]  Alexander Vladimirsky,et al.  Ordered Upwind Methods for Static Hamilton-Jacobi Equations: Theory and Algorithms , 2003, SIAM J. Numer. Anal..

[10]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid , 2012 .

[11]  Alex M. Andrew,et al.  Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science (2nd edition) , 2000 .

[12]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[13]  Jean-Michel Morel,et al.  Nonlocal Image and Movie Denoising , 2008, International Journal of Computer Vision.

[14]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods , 1999 .

[15]  Kaleem Siddiqi,et al.  The Hamilton-Jacobi skeleton , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[16]  Chi-Wang Shu,et al.  High-Order WENO Schemes for Hamilton-Jacobi Equations on Triangular Meshes , 2003, SIAM J. Sci. Comput..

[17]  Petros Maragos,et al.  Curve Evolution, Differential Morphology, and Distance Transforms Applied to Multiscale and Eikonal Problems , 2000, Fundam. Informaticae.

[18]  Abderrahim Elmoataz,et al.  Discrete Regularization on Weighted Graphs for Image and Mesh Filtering , 2007, SSVM.

[19]  Hongkai Zhao,et al.  A fast sweeping method for Eikonal equations , 2004, Math. Comput..

[20]  Petros Maragos,et al.  Evolution equations for continuous-scale morphological filtering , 1994, IEEE Trans. Signal Process..

[21]  R. Abgrall.  Numerical discretization of the first‐order Hamilton‐Jacobi equation on triangular meshes , 1996 .

[22]  E. Rouy,et al.  A viscosity solutions approach to shape-from-shading , 1992 .

[23]  Alexander M. Bronstein,et al.  Weighted distance maps computation on parametric three-dimensional manifolds , 2007, J. Comput. Phys..