A Finite Element Nonoverlapping Domain Decomposition Method with Lagrange Multipliers for the Dual Total Variation Minimizations

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 44
  • Download : 0
In this paper, we consider a primal-dual domain decomposition method for total variation regularized problems appearing in mathematical image processing. The model problem is transformed into an equivalent constrainedminimization problem by tearing-andinterconnecting domain decomposition. Then, the continuity constraints on the subdomain interfaces are treated by introducing Lagrange multipliers. The resulting saddle point problem is solved by the first order primal-dual algorithm. We apply the proposed method to image denoising, inpainting, and segmentation problems with either L2-fidelity or L1-fidelity. Numerical results show that the proposed method outperforms the existing state-of-the-art methods.
Publisher
SPRINGER/PLENUM PUBLISHERS
Issue Date
2019-12
Language
English
Article Type
Article
Citation

JOURNAL OF SCIENTIFIC COMPUTING, v.81, no.3, pp.2331 - 2355

ISSN
0885-7474
DOI
10.1007/s10915-019-01085-z
URI
http://hdl.handle.net/10203/270915
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0