Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images

@article{Zeng2008TopologyCA,
  title={Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images},
  author={Yun Zeng and Dimitris Samaras and Wei Chen and Qunsheng Peng},
  journal={Computer Vision and Image Understanding},
  year={2008},
  volume={112},
  pages={81-90}
}
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology priors as global constraints. We show that optimization of the energy function we consider here is NPhard. However, our algorithm is guaranteed to find an approximate solution that conforms to the initialization, which is a desirable property in many applications since the global optimum solution does not consider any… CONTINUE READING
Highly Cited
This paper has 129 citations. REVIEW CITATIONS
56 Extracted Citations
24 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 56 extracted citations

129 Citations

01020'09'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 129 citations based on the available data.

See our FAQ for additional information.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 24 references

Similar Papers

Loading similar papers…