Combinatorial maps for 2D and 3D image segmentation
From MaRDI portal
Publication:4648758
Recommendations
- Split-and-merge algorithms defined on topological maps for 3D image segmentation
- First Results for 3D Image Segmentation with Topological Map
- Combinatorial maps. Efficient data structures for computer graphics and image processing
- Topological map based algorithms for 3D image segmentation
- Representing and segmenting 2D images by means of planar maps with discrete embeddings: From model to applications
Cites work
- A First Step toward Combinatorial Pyramids in n-D Spaces
- Adjacency in digital pictures
- Computer graphics and connected topologies on finite ordered sets
- Efficiency of a Good But Not Linear Set Union Algorithm
- Efficient graph-based image segmentation
- First Results for 3D Image Segmentation with Topological Map
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- N-DIMENSIONAL GENERALIZED COMBINATORIAL MAPS AND CELLULAR QUASI-MANIFOLDS
- Region merging with topological control
- Removal and contraction for \(n\)-dimensional generalized maps.
- Topological map based algorithms for 3D image segmentation
- Topological models for boundary representation: A comparison with \(n\)- dimensional generalized maps
- XPMaps and topological segmentation -- a unified approach to finite topologies in the plane
Cited in
(5)- Split-and-merge algorithms defined on topological maps for 3D image segmentation
- Combinatorial maps. Efficient data structures for computer graphics and image processing
- Representing and segmenting 2D images by means of planar maps with discrete embeddings: From model to applications
- The GeoMap: A unified representation for topology and geometry
- Set-valued maps for image segmentation
This page was built for publication: Combinatorial maps for 2D and 3D image segmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648758)