Dynamic graph merging for image segmentation
From MaRDI portal
Publication:2867977
Recommendations
- An efficient segmentation method based on dynamic graph merging
- Efficient graph-based image segmentation
- A Multiscale Algorithm for Image Segmentation by Variational Method
- Fast Constrained Image Segmentation Using Optimal Spanning Trees
- Unsupervised color image segmentation using region merging and graph cuts
Cites work
Cited in
(9)- Modified Split-Merge image segmentation algorithm
- Graph-Based Representations in Pattern Recognition
- scientific article; zbMATH DE number 2043691 (Why is no real title available?)
- Uniqueness of the perfect fusion grid on \(\mathbb{Z}^d\)
- Fusion graphs: merging properties and watersheds
- Automatic Image Segmentation by Dynamic Region Merging
- An efficient segmentation method based on dynamic graph merging
- An image cosegmentation algorithm using hypergraph cut
- Efficient graph-based image segmentation
This page was built for publication: Dynamic graph merging for image segmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867977)