full
search.png

Search

close.png

Cancel

arrow
Volume 8, Issue 1
Domain Decomposition Methods with Graph Cuts Algorithms for Image Segmentation

X.-C. Tai & Y. Duan

Int. J. Numer. Anal. Mod., 8 (2011), pp. 137-155.

Published online: 2011-08

Preview Full PDF 2852 24705

Cited by

google scholar semantic scholar
Export citation
  • 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.

  • Keywords

Multiphase Mumford-Shah, graph cuts, image segmentation, domain decomposition.

  • AMS Subject Headings

65N55, 65F10, 68U10

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{IJNAM-8-137, author = {Tai , X.-C. and Duan , Y.}, 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 = {

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.

}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/678.html} }
TY - JOUR T1 - Domain Decomposition Methods with Graph Cuts Algorithms for Image Segmentation AU - Tai , X.-C. AU - Duan , Y. JO - International Journal of Numerical Analysis and Modeling VL - 1 SP - 137 EP - 155 PY - 2011 DA - 2011/08 SN - 8 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/ijnam/678.html KW - Multiphase Mumford-Shah, graph cuts, image segmentation, domain decomposition. AB -

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.

Tai , X.-C. and Duan , Y.. (2011). Domain Decomposition Methods with Graph Cuts Algorithms for Image Segmentation. International Journal of Numerical Analysis and Modeling. 8 (1). 137-155. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard