By Topic

Alternative minimisation algorithm for non-local total variational image deblurring

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Daiqiang Chen ; National University of Defense and Technology, Changsha 410073, People's Republic of China ; Lizhi Cheng

Recently, variational models based on non-local regularisation obtain superior results over traditional methods, and many iterative algorithms have been proposed for these models. At present, Xiaoqun Zhang et al. proposed two algorithms based on Bregman iteration for solving non-local regularisation problems, these algorithms converge fast but the calculation quantity is large for each iterative step. Here, based on the idea of variable splitting and penalty techniques in optimisation and fast Fourier transform, the authors present a non-local total variational model and propose a fast iterative algorithm for the model. Under some assumption, q-linear convergence of the iterative algorithm is proved. Experiments demonstrate that the algorithm can efficiently speed up the execution of the variational model and obtain an improvement in signal-to-noise ratio through the selection of penalty parameters.

Published in:

IET Image Processing  (Volume:4 ,  Issue: 5 )