Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadatas
Contributor : Jean Cousty <>
Submitted on : Thursday, July 12, 2012 - 1:13:38 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:05 PM
Document(s) archivé(s) le : Saturday, October 13, 2012 - 2:25:31 AM


Files produced by the author(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⟩



Record views


Files downloads