Combinatorial Maps for 2D and 3D Image Segmentation
From MaRDI portal
Publication:4648758
DOI10.1007/978-94-007-4174-4_12zbMath1251.68297OpenAlexW170854733MaRDI QIDQ4648758
Alexandre Dupas, Guillaume Damiand
Publication date: 16 November 2012
Published in: Digital Geometry Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-94-007-4174-4_12
Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Machine vision and scene understanding (68T45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computer graphics and connected topologies on finite ordered sets
- Region merging with topological control
- Topological models for boundary representation: A comparison with \(n\)- dimensional generalized maps
- Efficient graph-based image segmentation
- A First Step toward Combinatorial Pyramids in n-D Spaces
- Efficiency of a Good But Not Linear Set Union Algorithm
- N-DIMENSIONAL GENERALIZED COMBINATORIAL MAPS AND CELLULAR QUASI-MANIFOLDS
- Adjacency in digital pictures
- First Results for 3D Image Segmentation with Topological Map
- Discrete Geometry for Computer Imagery
This page was built for publication: Combinatorial Maps for 2D and 3D Image Segmentation