scholarly journals Learning nonlocal regularization operators

2019 ◽  
Vol 0 (0) ◽  
pp. 0-0
Author(s):  
Gernot Holler ◽  
◽  
Karl Kunisch ◽  
2016 ◽  
Vol 24 (2) ◽  
pp. 207-219 ◽  
Author(s):  
Daniil Kazantsev ◽  
Enyu Guo ◽  
Anders Kaestner ◽  
William R. B. Lionheart ◽  
Julian Bent ◽  
...  

2021 ◽  
Vol 2021 ◽  
pp. 1-6
Author(s):  
Quan Yuan ◽  
Zhenyun Peng ◽  
Zhencheng Chen ◽  
Yanke Guo ◽  
Bin Yang ◽  
...  

Medical image information may be polluted by noise in the process of generation and transmission, which will seriously hinder the follow-up image processing and medical diagnosis. In medical images, there is a typical mixed noise composed of additive white Gaussian noise (AWGN) and impulse noise. In the conventional denoising methods, impulse noise is first removed, followed by the elimination of white Gaussian noise (WGN). However, it is difficult to separate the two kinds of noises completely in practical application. The existing denoising algorithm of weight coding based on sparse nonlocal regularization, which can simultaneously remove AWGN and impulse noise, is plagued by the problems of incomplete noise removal and serious loss of details. The denoising algorithm based on sparse representation and low rank constraint can preserve image details better. Thus, a medical image denoising algorithm based on sparse nonlocal regularization weighted coding and low rank constraint is proposed. The denoising effect of the proposed method and the original algorithm on computed tomography (CT) image and magnetic resonance (MR) image are compared. It is revealed that, under different σ and ρ values, the PSNR and FSIM values of CT and MRI images are evidently superior to those of traditional algorithms, suggesting that the algorithm proposed in this work has better denoising effects on medical images than traditional denoising algorithms.


1994 ◽  
Vol 09 (26) ◽  
pp. 4549-4564 ◽  
Author(s):  
M.A. CLAYTON ◽  
L. DEMOPOULOS ◽  
J.W. MOFFAT

The nonlocal regularization of QED is shown to possess an axial anomaly of the same form as other regularization schemes. The Noether current is explicitly constructed and the symmetries are shown to be violated, whereas the identities constructed when one properly considers the contribution from the path integral measure are respected. We also discuss the merits and new features of the regularization scheme, as well as the barrier to quantizing the fully gauged chiral-invariant theory.


2010 ◽  
Vol 3 (3) ◽  
pp. 253-276 ◽  
Author(s):  
Xiaoqun Zhang ◽  
Martin Burger ◽  
Xavier Bresson ◽  
Stanley Osher

1998 ◽  
Vol 13 (05) ◽  
pp. 797-829 ◽  
Author(s):  
P. C. RAJE BHAGEERATHI ◽  
KURUVILLA EAPEN

Evens et al.1 have given a gauge-invariant regularization scheme for QED which they have named nonlocal regularization. The present authors2 have worked out the QED vertex part in this scheme of regularization. In this paper we present a Ward identity for nonlocal QED to the order of two loops (order e4). In the limit of QED (Λ→∞), this identity reduces to the usual form of the Ward identity.


2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Rubing Xi ◽  
Zhengming Wang ◽  
Xia Zhao ◽  
Meihua Xie

The variational models with nonlocal regularization offer superior image restoration quality over traditional method. But the processing speed remains a bottleneck due to the calculation quantity brought by the recent iterative algorithms. In this paper, a fast algorithm is proposed to restore the multichannel image in the presence of additive Gaussian noise by minimizing an energy function consisting of anl2-norm fidelity term and a nonlocal vectorial total variational regularization term. This algorithm is based on the variable splitting and penalty techniques in optimization. Following our previous work on the proof of the existence and the uniqueness of the solution of the model, we establish and prove the convergence properties of this algorithm, which are the finite convergence for some variables and theq-linear convergence for the rest. Experiments show that this model has a fabulous texture-preserving property in restoring color images. Both the theoretical derivation of the computation complexity analysis and the experimental results show that the proposed algorithm performs favorably in comparison to the widely used fixed point algorithm.


Sign in / Sign up

Export Citation Format

Share Document