Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images.
Yun ZengDimitris SamarasWei ChenQunsheng PengPublished in: Comput. Vis. Image Underst. (2008)
Keyphrases
- topology preserving
- min cut max flow
- topology preservation
- energy minimization
- segmentation algorithm
- maximum flow
- energy function
- competitive learning
- low level vision
- minimum cut
- segmentation method
- image segmentation
- k means
- graph cuts
- machine learning
- self organizing maps
- max flow
- multiscale
- computer vision
- expectation maximization
- image analysis
- probabilistic model
- data clustering
- clustering method
- input data