Colour image filtering with component-graphs - Université de Reims Champagne-Ardenne Access content directly
Conference Papers Year : 2014

Colour image filtering with component-graphs


Mathematical morphology, initially devoted to binary and grey-level image processing, also offers opportunities to develop efficient tools for multivalued – and in particular, colour – images. In this context, connected operators are increasingly considered as a relevant way to obtain such tools, mainly for image filtering and segmentation purposes. In this article, we focus on connected operators based on component-trees and their extension to multivalued images, namely component-graphs. Beyond the classical colour-handling strategies, we show how component-graphs can be algorithmically used to efficiently handle the whole structural information gathered by colour spaces, in order to finally design original image filtering tools.
Fichier principal
Vignette du fichier
Naegel_ICPR_2014.pdf (557.45 Ko) Télécharger le fichier
Naegel ICPR 2014 Slides.pdf (8.45 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01695069 , version 1 (15-02-2018)



Benoît Naegel, Nicolas Passat. Colour image filtering with component-graphs. International Conference on Pattern Recognition (ICPR), 2014, Stockholm, Sweden. pp.1621-1626, ⟨10.1109/ICPR.2014.287⟩. ⟨hal-01695069⟩
117 View
149 Download



Gmail Facebook Twitter LinkedIn More