Fast Nonoverlapping Block Jacobi Method for the Dual Rudin-Osher-Fatemi Model

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 156
  • Download : 0
We consider nonoverlapping domain decomposition methods for the Rudin-Osher-Fatemi~(ROF) model, which is one of the standard models in mathematical image processing. The image domain is partitioned into rectangular subdomains and local problems in subdomains are solved in parallel. Local problems can adopt existing state-of-the-art solvers for the ROF model. We show that the nonoverlapping relaxed block Jacobi method for a dual formulation of the ROF model has the O(1/n) convergence rate of the energy functional, where n is the number of iterations. Moreover, by exploiting the forward-backward splitting structure of the method, we propose an accelerated version whose convergence rate is O(1/n2). The proposed method converges faster than existing domain decomposition methods both theoretically and practically, while the main computational cost of each iteration remains the same. We also provide the dependence of the convergence rates of the block Jacobi methods on the image size and the number of subdomains. Numerical results for comparisons with existing methods are presented.
Publisher
SIAM PUBLICATIONS
Issue Date
2019-12
Language
English
Article Type
Article
Citation

SIAM JOURNAL ON IMAGING SCIENCES, v.12, no.4, pp.2009 - 2034

ISSN
1936-4954
DOI
10.1137/18m122604x
URI
http://hdl.handle.net/10203/274411
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0