Sammanfattning
In this paper non-overlapping domain decomposition methods for the pre-dual total variation minimization problem are introduced. Both parallel and sequential approaches are proposed for these methods for which convergence to a minimizer of the original problem is established. The associated subproblems are solved by a semi-smooth Newton method. Several numerical experiments are presented, which show the successful application of the sequential and parallel algorithm for image denoising.
Originalspråk | engelska |
---|---|
Sidor (från-till) | 456-481 |
Antal sidor | 26 |
Tidskrift | Journal of Scientific Computing |
Volym | 62 |
Nummer | 2 |
DOI | |
Status | Published - 2014 feb. |
Externt publicerad | Ja |
Bibliografisk information
Publisher Copyright:© 2014, Springer Science+Business Media New York.
Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.
Ämnesklassifikation (UKÄ)
- Beräkningsmatematik
- Datorgrafik och datorseende