A Color Tree of Shapes with Illustrations on Filtering, Simplification, and Segmentation

DOI10.1007/978-3-319-18720-4_31zbMath1445.68281OpenAlexW2276418283MaRDI QIDQ2946823

Thierry Géraud, Edwin Carlinet

Publication date: 18 September 2015

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

Full work available at URL: https://hal.inria.fr/hal-01476208/file/carlinet.2015.ismm.pdf

zbMATH Keywords

color image processinghierarchical representationconnected operatorstree of shapes

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (3)

Efficient Computation of Attributes and Saliency Maps on Tree-Based Image Representations ⋮ N-ary mathematical morphology ⋮ How to make \(n\)-D plain maps defined on discrete surfaces Alexandrov-well-composed in a self-dual way

Cites Work

• Self-dual morphological operators and filters.
• Geometric description of images as topographic maps
• Geometry and color in natural images
• Grain filters
• Extracting meaningful curves from images
• A comparative study on multivariate mathematical morphology
• A Quasi-linear Algorithm to Compute the Tree of Shapes of nD Images
• Towards Connected Filtering Based on Component-Graphs
• Supervised Ordering in ${\rm I}\!{\rm R}^p$: Application to Morphological Processing of Hyperspectral Images

This page was built for publication: A Color Tree of Shapes with Illustrations on Filtering, Simplification, and Segmentation