Dynamic graph merging for image segmentation
From MaRDI portal
Publication:2867977
DOI10.1142/S0219691313500513zbMATH Open1286.94015MaRDI QIDQ2867977FDOQ2867977
Authors: Jianping Gu, Cun Cheng, Li Zhang
Publication date: 23 December 2013
Published in: International Journal of Wavelets, Multiresolution and Information Processing (Search for Journal in Brave)
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
Applications of graph theory (05C90) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10)
Cites Work
Cited In (9)
- Modified Split-Merge image segmentation algorithm
- Graph-Based Representations in Pattern Recognition
- Title not available (Why is that?)
- Automatic Image Segmentation by Dynamic Region Merging
- Uniqueness of the perfect fusion grid on \(\mathbb{Z}^d\)
- Fusion graphs: merging properties and watersheds
- 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)