Domain Decomposition Methods Using Dual Conversion for the Total Variation Minimization with L-1 Fidelity Term

Cited 5 time in webofscience Cited 0 time in scopus
  • Hit : 251
  • Download : 0
Nowadays, as large scale images become available, the necessity of parallel algorithms for image processing has been arisen. In this paper, we propose domain decomposition methods as parallel solvers for solving total variation minimization problems with L1 fidelity term. The image domain is decomposed into rectangular subdomains, where the local total variation problems are solved. We introduce the notion of dual conversion, which generalizes the framework of Chambolle-Pock primal-dual algorithm (J Math Imaging Vis 40:120-145, 2011). By the dual conversion, the TV-L1 model is transformed into an equivalent saddle point problem which has a natural parallel structure. The primal problem of the resulting saddle point problem is decoupled in the sense that each local problem can be solved independently. Convergence analysis of the proposed algorithms is provided. We apply the proposed algorithms for image denoising, inpainting, and deblurring problems. Our numerical results ensure that the proposed algorithms have good performance as parallel solvers.
Publisher
SPRINGER/PLENUM PUBLISHERS
Issue Date
2019-02
Language
English
Article Type
Article
Citation

JOURNAL OF SCIENTIFIC COMPUTING, v.78, no.2, pp.951 - 970

ISSN
0885-7474
DOI
10.1007/s10915-018-0791-x
URI
http://hdl.handle.net/10203/254145
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 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0