Adaptation of Eikonal Equation over Weighted Graph
SSVM '09 Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision
Partial differences as tools for filtering data on graphs
Pattern Recognition Letters
Mathematical morphology on hypergraphs: preliminary definitions and results
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Mathematical morphology on hypergraphs, application to similarity and positive kernel
Computer Vision and Image Understanding
Morphological filtering on graphs
Computer Vision and Image Understanding
Hi-index | 0.00 |
Mathematical Morphology (MM) offers a wide range of operators to address various image processing problems. These processing can be defined in terms of algebraic set or as partial differential equations (PDEs). In this paper, a novel approach is formalized as a framework of partial difference equations (PdEs) on weighted graphs. We introduce and analyze morphological operators in local and nonlocal configurations. Our framework recovers classical local algebraic and PDEs-based morphological methods in image processing context; generalizes them for nonlocal configurations and extends them to the treatment of any arbitrary discrete data that can be represented by a graph. It leads to considering a new field of application of MM processing: the case of high-dimensional multivariate unorganized data.