Morphological filtering on graphs

Abstract : We study some basic morphological operators acting on the lattice of all subgraphs of an arbitrary (unweighted) graph G. To this end, we consider two dual adjunctions between the edge set and the vertex set of G. This allows us (i) to recover the classical notion of a dilation/erosion of a subset of the vertices of G and (ii) to extend it to subgraphs of G. Afterward, we propose several new openings, closings, granulometries and alternate filters acting (i) on the subsets of the edge and vertex set of G and (ii) on the subgraphs of G. The proposed framework is then extended to functions that weight the vertices and edges of a graph. We illustrate with applications to binary and grayscale image denoising, for which, on the provided images, the proposed approach outperforms the usual one based on structuring elements.
Type de document :
Article dans une revue
Computer Vision and Image Understanding, Elsevier, 2013, 117 (4), pp.370-385
Liste complète des métadonnées
Contributeur : Jean Cousty <>
Soumis le : jeudi 12 juillet 2012 - 13:13:38
Dernière modification le : jeudi 5 juillet 2018 - 14:25:25
Document(s) archivé(s) le : samedi 13 octobre 2012 - 02:25:31


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00700784, version 2


Jean Cousty, Laurent Najman, Fabio Dias, Jean Serra. Morphological filtering on graphs. Computer Vision and Image Understanding, Elsevier, 2013, 117 (4), pp.370-385. 〈hal-00700784v2〉



Consultations de la notice


Téléchargements de fichiers