A “Nonconvex+Nonconvex” approach for image restoration with impulse noise removal

In this paper, we propose a new method for image restoration problems, which are degraded by impulsive noise, with nonconvex data fitting term and nonconvex regularizer.The proposed method possesses the advantages of nonconvex data fitting and nonconvex regularizer simultaneously, namely, robustness for impulsive noise and efficiency for restoring neat edge images.Further, we propose an efficient algorithm to solve the “Nonconvex+Nonconvex” structure problem via using the alternating direction minimization, and prove that the algorithm is globally convergent when the regularization parameter is known. However, the regularization parameter is unavailable in general. Thereby, we combine the algorithm with the continuation technique and modified Morozov’s discrepancy principle to get an improved algorithm in which a suitable regularization parameter can be chosen automatically. The experiments reveal the superior performances of the proposed algorithm in comparison with some existing methods.     

On nondecreasing sequences of regularization parameters for nonstationary iterated Tikhonov

Nonstationary iterated Tikhonov is an iterative regularization method that requires a strategy for defining the Tikhonov regularization parameter at each iteration and an early termination of the iterative process. A classical choice for the regularization parameters is a decreasing geometric sequence which leads to a linear convergence rate. The early iterations compute quickly a good approximation of the true solution, but the main drawback of this choice is a rapid growth of the error for later iterations. This implies that a stopping criteria, e.g. the discrepancy principle, could fail in computing a good approximation. In this paper we show by a filter factor analysis that a nondecreasing sequence of regularization parameters can provide a rapid and stable convergence. Hence, a reliable stopping criteria is no longer necessary. A geometric nondecreasing sequence of the Tikhonov regularization parameters into a fixed interval is proposed and numerically validated for deblurring problems.     

Embedded techniques for choosing the parameter in Tikhonov regularization

This paper introduces a new strategy for setting the regularization parameter when solving large‐scale discrete ill‐posed linear problems by means of the Arnoldi–Tikhonov method. This new rule is essentially based on the discrepancy principle, although no initial knowledge of the norm of the error that affects the right‐hand side is assumed; an increasingly more accurate approximation of this quantity is recovered during the Arnoldi algorithm. Some theoretical estimates are derived in order to motivate our approach. Many numerical experiments performed on classical test problems as well as image deblurring problems are presented. Copyright © 2014 John Wiley & Sons, Ltd.     

基于分数阶微积分正则化的图像处理

全变分正则化方法已被广泛地应用于图像处理,利用此方法可以较好地去除噪声,并保持图像的边缘特征,但得到的优化解会产生"阶梯"效应.为了克服这一缺点,本文通过分数阶微积分正则化方法,建立了一个新的图像处理模型.为了克服此模型中非光滑项对求解带来的困难,本文研究了基于不动点方程的迫近梯度算法.最后,本文利用提出的模型与算法进行了图像去噪、图像去模糊与图像超分辨率实验,实验结果表明分数阶微积分正则化方法能较好的保留图像纹理等细节信息.     

Multi-parameter Tikhonov Regularization—An Augmented Approach

We study multi-parameter regularization （multiple penalties） for solving linear inverse problems to promote simultaneously distinct features of the sought-for objects. We revisit a balancing principle for choosing regularization parameters from the viewpoint of augmented Tikhonov regularization, and derive a new parameter choice strategy called the balanced discrepancy principle. A priori and a posteriori error estimates are provided to theoretically justify the principles, and numerical algorithms for efficiently implementing the principles are also provided. Numerical results on deblurring are presented to illustrate the feasibility of the balanced discrepancy principle.     

基于混沌粒子群算法的Tikhonov正则化参数选取

Tikhonov正则化方法是求解不适定问题最为有效的方法之一,而正则化参数的最优选取是其关键.本文将混沌粒子群优化算法与Tikhonov正则化方法相结合,基于Morozov偏差原理设计粒子群的适应度函数,利用混沌粒子群优化算法的优点,为正则化参数的选取提供了一条有效的途径.数值实验结果表明,本文方法能有效地处理不适定问题,是一种实用有效的方法.     

An edge driven wavelet frame model for image restoration

Wavelet frame systems are known to be effective in capturing singularities from noisy and degraded images. In this paper, we introduce a new edge driven wavelet frame model for image restoration by approximating images as piecewise smooth functions. With an implicit representation of image singularities sets, the proposed model inflicts different strength of regularization on smooth and singular image regions and edges. The proposed edge driven model is robust to both image approximation and singularity estimation. The implicit formulation also enables an asymptotic analysis of the proposed models and a rigorous connection between the discrete model and a general continuous variational model. Finally, numerical results on image inpainting and deblurring show that the proposed model is compared favorably against several popular image restoration models.     

Application of denoising methods to regularizationof ill-posed problems

Linear systems of equations and linear least-squares problems with a matrix whose singular values “cluster” at the origin and with an error-contaminated data vector arise in many applications. Their numerical solution requires regularization, i.e., the replacement of the given problem by a nearby one, whose solution is less sensitive to the error in the data. The amount of regularization depends on a parameter. When an accurate estimate of the norm of the error in the data is known, this parameter can be determined by the discrepancy principle. This paper is concerned with the situation when the error is white Gaussian and no estimate of the norm of the error is available, and explores the possibility of applying a denoising method to both reduce this error and to estimate its norm. Applications to image deblurring are presented.     

Image restoration with a high-order total variation minimization method

In this paper, we propose a fast and efficient way to restore blurred and noisy images with a high-order total variation minimization technique. The proposed method is based on an alternating technique for image deblurring and denoising. It starts by finding an approximate image using a Tikhonov regularization method. This corresponds to a deblurring process with possible artifacts and noise remaining. In the denoising step, a high-order total variation algorithm is used to remove noise in the deblurred image. We see that the edges in the restored image can be preserved quite well and the staircase effect is reduced effectively in the proposed algorithm. We also discuss the convergence of the proposed regularization method. Some numerical results show that the proposed method gives restored images of higher quality than some existing total variation restoration methods such as the fast TV method and the modified TV method with the lagged diffusivity fixed-point iteration.     

Multi-parameter Tikhonov regularization and model function approach to the damped Morozov principle for choosing regularization parameters

In this paper, we study the multi-parameter Tikhonov regularization method which adds multiple different penalties to exhibit multi-scale features of the solution. An optimal error bound of the regularization solution is obtained by a priori choice of multiple regularization parameters. Some theoretical results of the regularization solution about the dependence on regularization parameters are presented. Then, an a posteriori parameter choice, i.e., the damped Morozov discrepancy principle, is introduced to determine multiple regularization parameters. Five model functions, i.e., two hyperbolic model functions, a linear model function, an exponential model function and a logarithmic model function, are proposed to solve the damped Morozov discrepancy principle. Furthermore, four efficient model function algorithms are developed for finding reasonable multiple regularization parameters, and their convergence properties are also studied. Numerical results of several examples show that the damped discrepancy principle is competitive with the standard one, and the model function algorithms are efficient for choosing regularization parameters.     

High-order total variation-based Poissonian image deconvolution with spatially adapted regularization parameter

Images captured by image acquisition systems using photon-counting devices such as astronomical imaging, positron emission tomography and confocal microscopy imaging, are often contaminated by Poisson noise. Total variation (TV) regularization, which is a classic regularization technique in image restoration, is well-known for recovering sharp edges of an image. Since the regularization parameter is important for a good recovery, Chen and Cheng (2012) proposed an effective TV-based Poissonian image deblurring model with a spatially adapted regularization parameter. However, it has drawbacks since the TV regularization produces staircase artifacts. In this paper, in order to remedy the shortcoming of TV of their model, we introduce an extra high-order total variation (HTV) regularization term. Furthermore, to balance the trade-off between edges and the smooth regions in the images, we also incorporate a weighting parameter to discriminate the TV and the HTV penalty. The proposed model is solved by an iterative algorithm under the framework of the well-known alternating direction method of multipliers. Our numerical results demonstrate the effectiveness and efficiency of the proposed method, in terms of signal-to-noise ratio (SNR) and relative error (RelRrr).     

A METHOD TO APPROACH OPTIMAL RESTORATION IN IMAGE RESTORATION PROBLEMS WITHOUT NOISE ENERGY INFORMATION

This paper proposes a new image restoration technique, in which the resulting regularized image approximates the optimal solution steadily. The affect of the regular-ization operator and parameter on the lower band and upper band energy of the residue of the regularized image is theoretically analyzed by employing wavelet transform. This paper shows that regularization operator should generally be lowstop and highpass. So this paper chooses a lowstop and highpass operator as regularization operator, and construct an optimization model which minimizes the mean squares residue of regularized solution to determine regularization parameter. Although the model is random, on the condition of this paper, it can be solved and yields regularization parameter and regularized solu-tion. Otherwise, the technique has a mechanism to predict noise energy. So, without noisei nformation, it can also work and yield good restoration results.     

Robust regression for mixed Poisson–Gaussian model

This paper focuses on efficient computational approaches to compute approximate solutions of a linear inverse problem that is contaminated with mixed Poisson–Gaussian noise, and when there are additional outliers in the measured data. The Poisson–Gaussian noise leads to a weighted minimization problem, with solution-dependent weights. To address outliers, the standard least squares fit-to-data metric is replaced by the Talwar robust regression function. Convexity, regularization parameter selection schemes, and incorporation of non-negative constraints are investigated. A projected Newton algorithm is used to solve the resulting constrained optimization problem, and a preconditioner is proposed to accelerate conjugate gradient Hessian solves. Numerical experiments on problems from image deblurring illustrate the effectiveness of the methods.     

Using the L--curve for determining optimal regularization parameters

Summary. The ``L--curve' is a plot (in ordinary or doubly--logarithmic scale) of the norm of (Tikhonov--) regularized solutions of an ill--posed problem versus the norm of the residuals. We show that the popular criterion of choosing the parameter corresponding to the point with maximal curvature of the L--curve does not yield a convergent regularization strategy to solve the ill--posed problem. Nevertheless, the L--curve can be used to compute the regularization parameters produced by Morozov's discrepancy principle and by an order--optimal variant of the discrepancy principle proposed by Engl and Gfrerer in an alternate way. Received June 29, 1993 / Revised version received February 2, 1994     

Multiscale total variation regularization in image restoration

A total variation model for image restoration is introduced. The model utilizes a spatially dependent regularization parameter in order to enhance image regions containing details while still sufficiently smoothing homogeneous features. A local variance estimator is used to automatically adjust the regularization parameter. A generalized hierarchical decomposition of the restored image is integrated to the algorithm in order to speed-up the performance of the update scheme. The corresponding subproblems are solved by a superlinearly convergent algorithm based on Fenchel-duality and inexact semismooth Newton techniques. Numerical tests illustrate the performance of the algorithm. (© 2011 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

An improved iteration regularization method and application to reconstruction of dynamic loads on a plate

We present an improved iteration regularization method for solving linear inverse problems. The algorithm considered here is detailedly given and proved that the computational costs for the proposed method are nearly the same as the Landweber iteration method, yet the number of iteration steps by the present method is even less. Meanwhile, we obtain the optimum asymptotic convergence order of the regularized solution by choosing a posterior regularization parameter based on Morozov’s discrepancy principle, and the present method is applied to the identification of the multi-source dynamic loads on a surface of the plate. Numerical simulations of two examples demonstrate the effectiveness and robustness of the present method.     

Discrepancy based model selection in statistical inverse problems

The reconstruction of solutions in statistical inverse problems in Hilbert spaces requires regularization, which is often based on a parametrized family of proposal estimators. The choice of an appropriate parameter in this family is crucial. We propose a modification of the classical discrepancy principle as an adaptive parameter selection. This varying discrepancy principle evaluates the misfit in some weighted norm, and it also has an incorporated emergency stop. These ingredients allow the order optimal reconstruction when the solution owns nice spectral resolution. Theoretical analysis is accompanied with numerical simulations, which highlight the features of the proposed varying discrepancy principle.     

Split Bregman iteration algorithm for total bounded variation regularization based image deblurring

Many existing algorithms taking the seminorm in BV(Ω) for regularization have achieved great success in image processing. However, this paper considers the total bounded variation regularization based approach to perform image deblurring. Based on this novel model, we introduce an extended split Bregman iteration to obtain the optimum solution quickly. We also provide the rigorous convergence analysis of the iterative algorithm here. Compared with the results of the ROF method, numerical simulations illustrate the more excellent reconstruction performance of the proposed algorithm.     

A hybrid convex variational model for image restoration

We propose a new hybrid model for variational image restoration using an alternative diffusion switching non-quadratic function with a parameter. The parameter is chosen adaptively so as to minimize the smoothing near the edges and allow the diffusion to smooth away from the edges. This model belongs to a class of edge-preserving regularization methods proposed in the past, the ?-function formulation. This involves a minimizer to the associated energy functional. We study the existence and uniqueness of the energy functional of the model. Using real and synthetic images we show that the model is effective in image restoration.     

AR模型辨识的稀疏结构迭代算法

模型估计是机器学习领域一个重要的研究内容,动态数据的模型估计是系统辨识和系统控制的基础.针对AR时间序列模型辨识问题,证明了在给定阶数下AR模型参数的最小二乘估计本质上也是一种矩估计.根据结构风险最小化原理,通过对模型拟合度和模型复杂度的折衷,提出了基于稀疏结构迭代的AR序列模型估计算法,并讨论了基于广义岭估计的最优正则化参数选取规则.数值结果表明,方法能以节省参数的方式有效地实现AR模型的辨识,比矩估计法结果有明显改善.