Maximum flow minimum cost algorithm for reconstruction of images represented on the triangular grid.
Elisa Valentina MoisiBenedek NagyVladimir-Ioan CretuPublished in: SACI (2013)
Keyphrases
- maximum flow
- np hard
- minimum cost
- segmentation algorithm
- reconstruction process
- square grid
- segmentation method
- approximation algorithms
- worst case
- input image
- spanning tree
- network flow
- k means
- objective function
- energy function
- similarity measure
- directed graph
- multi objective
- network flow problem
- lower bound
- minimum cost flow