Deflated preconditioned Conjugate Gradient methods for noise filtering of low-field MR images
نویسندگان
چکیده
We study efficient implicit methods to denoise low-field MR images using a nonlinear diffusion operator as regularizer. This problem can be formulated solving reaction–diffusion equation. After discretization, lagged-diffusion approach is used which requires linear system solve in every iteration. The choice of model determines the denoising properties, but it also influences conditioning systems. As solution method, we use Conjugate Gradient (CG) combination with suitable preconditioner and deflation technique. consider four different preconditioners subdomain deflation. evaluate for commonly operators: standard Laplace operator, two Perona–Malik type operators, Total Variation (TV) operator. show that Discrete Cosine Transform (DCT) works best problems slowly varying coefficient, while Jacobi preconditioning strongly diffusion, happens TV research part larger effort aims provide low-cost imaging capabilities low-resource settings. have evaluated algorithms on MRI inexpensive commodity hardware. With chosen model, are able limit time three-dimensional more than 2 million pixels less 15 s, fast enough practice.
منابع مشابه
Comparison of the Deflated Preconditioned Conjugate Gradient Method and Algebraic Multigrid for Composite Materials
Many applications in computational science and engineering concern composite materials, which are characterized by large discontinuities in the material properties. Such applications require fine-scale finite-element (FE) meshes, which lead to large linear systems that are challenging to solve with current direct and iterative solutions algorithms. In this paper, we consider the simulation of a...
متن کاملPreconditioned Conjugate Gradient
.. ................................................................................................................... ix Chapter 1. Introduction ..................................................................................................1 Chapter 2. Background ..................................................................................................6 2.1. Matrix Compu...
متن کاملPreconditioned Conjugate Gradient Schemes
The conjugate gradient method is a powerful algorithm to solve well-structured sparse linear systems that arise from partial diierential equations. We consider here three diierent conjugate gradient schemes for solving elliptic partial diierential equations that arise from 5-point diierence schemes: the classical CG, CG with a block diagonal-block incomplete Cholesky preconditioner and the redu...
متن کاملPreconditioned Conjugate Gradient Methods for Three Dimensional Linear Elasticity
Finite element modelling of three dimensional elasticity problems gives rise to large sparse matrices. Various preconditioning methods are developed for use in preconditioned conjugate gradient iterative solution techniques. Incomplete factorizations based on levels of fill, drop tolerance, and a two level hierarchical basis are developed. Various techniques for ensuring that the incomplete fac...
متن کاملVectorization of some block preconditioned conjugate gradient methods
The block preconditioned conjugate gradient methods are very effective to solve the linear systems arising from the discretization of elliptic PDE. Nevertheless, the solution of the linear system Ms = r, to get the preconditioned residual, is a 'bottleneck', on vector processors. In this paper, we show how to modify the algorithm, in order to get better performances, on such computers. Numerica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2022
ISSN: ['0377-0427', '1879-1778', '0771-050X']
DOI: https://doi.org/10.1016/j.cam.2021.113730