Efficient Computation of Attributes and Saliency Maps on Tree-Based Image Representations

DOI10.1007/978-3-319-18720-4_58zbMath1445.68270OpenAlexW2293635884MaRDI QIDQ2946858

Laurent Najman, Thierry Géraud, Yongchao Xu, 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://doi.org/10.1007/978-3-319-18720-4_58

zbMATH Keywords

algorithmsaliency mapattributetree of shapesmin/max-tree

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

A tutorial on well-composedness

Cites Work

• Geometric description of images as topographic maps
• Extracting meaningful curves from images
• A Color Tree of Shapes with Illustrations on Filtering, Simplification, and Segmentation
• A Comparative Review of Component Tree Computation Algorithms
• A Quasi-linear Algorithm to Compute the Tree of Shapes of nD Images
• Two Applications of Shape-Based Morphology: Blood Vessels Segmentation and a Generalization of Constrained Connectivity
• Edge detection by Helmholtz principle

This page was built for publication: Efficient Computation of Attributes and Saliency Maps on Tree-Based Image Representations