Towards Connected Filtering Based on Component-Graphs

DOI10.1007/978-3-642-38294-9_30zbMath1382.68307OpenAlexW53267500MaRDI QIDQ4925126

Benoît Naegel, Nicolas Passat

Publication date: 11 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.univ-reims.fr/hal-01695064/file/Naegel_ISMM_2013.pdf

zbMATH Keywords

partially ordered setsconnected operatorscomponent-graphcomponent-treemultivalued imagesantiextensive filtering

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Data structures (68P05)

Related Items (6)

A Color Tree of Shapes with Illustrations on Filtering, Simplification, and Segmentation ⋮ Shape-Based Analysis on Component-Graphs for Multivalued Image Processing ⋮ Shape-based analysis on component-graphs for multivalued image processing ⋮ Component-graph construction ⋮ Implicit Component-Graph: A Discussion ⋮ Inf-structuring functions: a unifying theory of connections and connected operators

This page was built for publication: Towards Connected Filtering Based on Component-Graphs