Year: 2011
International Journal of Numerical Analysis and Modeling, Vol. 8 (2011), Iss. 1 : pp. 137–155
Abstract
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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2011-IJNAM-678
International Journal of Numerical Analysis and Modeling, Vol. 8 (2011), Iss. 1 : pp. 137–155
Published online: 2011-01
AMS Subject Headings: Global Science Press
Copyright: COPYRIGHT: © Global Science Press
Pages: 19
Keywords: Multiphase Mumford-Shah graph cuts image segmentation domain decomposition.