Component-Trees and Multivalued Images: Structural Properties

  • Authors:
  • Nicolas Passat;Benoît Naegel

  • Affiliations:
  • CReSTIC, Université de Reims Champagne-Ardenne, Reims, France;ICube, CNRS, Université de Strasbourg, Strasbourg, France

  • Venue:
  • Journal of Mathematical Imaging and Vision
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

Component-trees model the structure of grey-level images by considering their binary level-sets obtained from successive thresholdings. They also enable to define anti-extensive filtering procedures for such images. In order to extend this image processing approach to any (grey-level or multivalued) images, both the notion of component-tree, and its associated filtering framework, have to be generalised. In this article we deal with the generalisation of the component-tree structure. We define a聽new data structure, the component-graph, which extends the notion of component-tree to images taking their values in any (partially or totally) ordered set. The component-graphs are declined in three variants, of increasing richness and size, whose structural properties are studied.