Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations
Journal of Computational Physics
A viscosity solutions approach to shape-from-shading
SIAM Journal on Numerical Analysis
Fundamenta Informaticae - Special issue on mathematical morphology
Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces: 730
Journal of Computational Physics
High-Order WENO Schemes for Hamilton-Jacobi Equations on Triangular Meshes
SIAM Journal on Scientific Computing
Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
SIAM Journal on Numerical Analysis
Texture Synthesis by Non-Parametric Sampling
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Weighted distance maps computation on parametric three-dimensional manifolds
Journal of Computational Physics
Nonlocal Image and Movie Denoising
International Journal of Computer Vision
Partial Difference Equations over Graphs: Morphological Processing of Arbitrary Discrete Data
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part III
Discrete regularization on weighted graphs for image and mesh filtering
SSVM'07 Proceedings of the 1st international conference on Scale space and variational methods in computer vision
Evolution equations for continuous-scale morphological filtering
IEEE Transactions on Signal Processing
Efficient algorithms for image and high dimensional data processing using eikonal equation on graphs
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part II
Hi-index | 0.00 |
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.