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
- scientific article; zbMATH DE number 2087466
- Graph-Based Representations in Pattern Recognition
Cites work
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 2087448 (Why is no real title available?)
- scientific article; zbMATH DE number 2087466 (Why is no real title available?)
- 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
- N-DIMENSIONAL GENERALIZED COMBINATORIAL MAPS AND CELLULAR QUASI-MANIFOLDS
- Region merging with topological control
- Removal and contraction for \(n\)-dimensional generalized maps.
- Topological models for boundary representation: A comparison with \(n\)- dimensional generalized maps
Cited in
(5)- Set-valued maps for image segmentation
- Combinatorial maps. Efficient data structures for computer graphics and image processing
- Graph-Based Representations in Pattern Recognition
- Split-and-merge algorithms defined on topological maps for 3D image segmentation
- Graph-Based Representations in Pattern Recognition
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)