Morphological Hierarchical Image Decomposition Based on Laplacian 0-Crossings
From MaRDI portal
Publication:5270544
DOI10.1007/978-3-319-57240-6_13zbMath1479.94032OpenAlexW2605560723MaRDI QIDQ5270544
Thierry Géraud, Yongchao Xu, Lê Duy Huỳnh
Publication date: 23 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01476302
hierarchical decompositiontext detectionwell-composed imagestree of shapesmorphological Laplace operator
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites Work
- Computer graphics and connected topologies on finite ordered sets
- How to Make nD Functions Digitally Well-Composed in a Self-dual Way
- Self-duality and Digital Topology: Links Between the Morphological Tree of Shapes and Well-Composed Gray-Level Images
- On Making nD Images Well-Composed by a Self-dual Local Interpolation
- A Comparative Review of Component Tree Computation Algorithms
- A Quasi-linear Algorithm to Compute the Tree of Shapes of nD Images
This page was built for publication: Morphological Hierarchical Image Decomposition Based on Laplacian 0-Crossings
