@Article{IJNAM-8-1,
author = {X.-C., Tai and Y., Duan},
title = {Domain Decomposition Methods with Graph Cuts Algorithms for Image Segmentation},
journal = {International Journal of Numerical Analysis and Modeling},
year = {2011},
volume = {8},
number = {1},
pages = {137--155},
abstract = {<p style="text-align: justify;">Recently, it is shown that graph cuts algorithms can be used to solve some variational
image restoration problems, especially connected with noise removal and segmentation. For very
large size images, the usage for memory and computation increases dramatically. We propose a
domain decomposition method with graph cuts algorithms. We show that the new approach costs
effective both for memory and computation. Experiments with large size 2D and 3D data are
supplied to show the efficiency of the algorithms.</p>},
issn = {2617-8710},
doi = {https://doi.org/2011-IJNAM-678},
url = {https://global-sci.com/article/83544/domain-decomposition-methods-with-graph-cuts-algorithms-for-image-segmentation}
}