Digital topology: introduction and survey
Computer Vision, Graphics, and Image Processing
The algebraic basis of mathematical morphology. I. dilations and erosions
Computer Vision, Graphics, and Image Processing
Why mathematical morphology needs complete lattices
Signal Processing
The algebraic basis of mathematical morphology
CVGIP: Image Understanding
Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing
Combinatorics and image processing
Graphical Models and Image Processing
Comparability graphs and digital topology
Computer Vision and Image Understanding
Partial Difference Equations over Graphs: Morphological Processing of Arbitrary Discrete Data
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part III
Some Morphological Operators in Graph Spaces
ISMM '09 Proceedings of the 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing
Morphology on Graphs and Minimum Spanning Trees
ISMM '09 Proceedings of the 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing
Hypergraph Cuts & Unsupervised Representation for Image Segmentation
Fundamenta Informaticae
A Hypergraph Approach to Linear Network Coding in Multicast Networks
IEEE Transactions on Parallel and Distributed Systems
Hy-SN: Hyper-graph based semantic network
Knowledge-Based Systems
Relational granularity for hypergraphs
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
Mathematical morphology on hypergraphs: preliminary definitions and results
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Some morphological operators on simplicial complex spaces
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Hypergraph with sampling for image retrieval
Pattern Recognition
Mathematical Morphology on Complete Semilattices and its Applications to Image Processing
Fundamenta Informaticae
| Hi-index | 0.00 |
The focus of this article is to develop mathematical morphology on hypergraphs. To this aim, we define lattice structures on hypergraphs on which we build mathematical morphology operators. We show some relations between these operators and the hypergraph structure, considering in particular transversals and duality notions. Then, as another contribution, we show how mathematical morphology can be used for classification or matching problems on data represented by hypergraphs: thanks to dilation operators, we define a similarity measure between hypergraphs, and we show that it is a kernel. A distance is finally introduced using this similarity notion.