Domain decomposition methods with graph cuts algorithms for total variation minimization

@article{Duan2012DomainDM,
  title={Domain decomposition methods with graph cuts algorithms for total variation minimization},
  author={Yuping Duan and Xue-Cheng Tai},
  journal={Adv. Comput. Math.},
  year={2012},
  volume={36},
  pages={175-199}
}
Recently, graph cuts algorithms have been used to solve variational image restoration problems, especially for noise removal and segmentation. Compared to time-marching PDE methods, graph cuts based methods are more efficient and able to obtain the global minimizer. However, for high resolution and large-scale images, the cost of both memory and computational time increases dramatically. In this paper, we combine the domain decomposition method and the graph cuts algorithm for solving the total… CONTINUE READING

Similar Papers

Loading similar papers…