Fixed Point Algorithm Based on Quasi-Newton Method for Convex Minimization Problem with Application to Image Deblurring

by   Dai-Qiang Chen, et al.

Solving an optimization problem whose objective function is the sum of two convex functions has received considerable interests in the context of image processing recently. In particular, we are interested in the scenario when a non-differentiable convex function such as the total variation (TV) norm is included in the objective function due to many variational models established in image processing have this nature. In this paper, we propose a fast fixed point algorithm based on the quasi-Newton method for solving this class of problem, and apply it in the field of TV-based image deblurring. The novel method is derived from the idea of the quasi-Newton method, and the fixed-point algorithms based on the proximity operator, which were widely investigated very recently. Utilizing the non-expansion property of the proximity operator we further investigate the global convergence of the proposed algorithm. Numerical experiments on image deblurring problem with additive or multiplicative noise are presented to demonstrate that the proposed algorithm is superior to the recently developed fixed-point algorithm in the computational efficiency.


page 14

page 15

page 16

page 18

page 19


Fast Krasnosel'skii-Mann algorithm with a convergence rate of the fixed point iteration of o(1/k)

The Krasnosel'skii-Mann (KM) algorithm is the most fundamental iterative...

Inverting Incomplete Fourier Transforms by a Sparse Regularization Model and Applications in Seismic Wavefield Modeling

We propose a sparse regularization model for inversion of incomplete Fou...

Distance Majorization and Its Applications

The problem of minimizing a continuously differentiable convex function ...

Inexact Alternating Direction Method Based on Newton descent algorithm with Application to Poisson Image Deblurring

The recovery of images from the observations that are degraded by a line...

Fast Linearized Alternating Direction Minimization Algorithm with Adaptive Parameter Selection for Multiplicative Noise Removal

Owing to the edge preserving ability and low computational cost of the t...

Approximate Primal-Dual Fixed-Point based Langevin Algorithms for Non-smooth Convex Potentials

The Langevin algorithms are frequently used to sample the posterior dist...

Compensated Convex Based Transforms for Image Processing and Shape Interrogation

This paper reviews some recent applications of the theory of the compens...

Please sign up or login with your details

Forgot password? Click here to reset