Dynamic graph merging for image segmentation

DOI10.1142/S0219691313500513MaRDI QIDQ2867977zbMATH OpenFDO

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)

Full work available at URL https://doi.org/10.1142/S0219691313500513

zbMATH Keywords

continuous combined cutdynamic graph merginggraph cutimage segmentation

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

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

• Clustering by passing messages between data points
• Medical Image Segmentation by Combining Graph Cuts and Oriented Active Appearance Models

Cited in

(9)

• Fusion graphs: merging properties and watersheds
• Efficient graph-based image segmentation
• An image cosegmentation algorithm using hypergraph cut
• Modified Split-Merge image segmentation algorithm
• scientific article; zbMATH DE number 2043691 (Why is no real title available?)
• Automatic Image Segmentation by Dynamic Region Merging
• Graph-Based Representations in Pattern Recognition
• An efficient segmentation method based on dynamic graph merging
• Uniqueness of the perfect fusion grid on \(\mathbb{Z}^d\)

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)