利用分裂Bregman方法的图像恢复组合模型

ROF模型是图像恢复中的经典模型,具有保留图像边缘的优点,但同时也存在梯子现象.而利用二次范数fΩ｜▽u｜2 dxdy的模型可以避免梯子现象,但容易使图像变得模糊.针对两种方法的优缺点,提出了一种新的通过设置边缘检测开关函数的组合模型,在图像平坦区利用二次范数模型处理,而在强边缘处利用ROF模型处理,而且应用分裂的Br...     

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.     

Fraction-order total variation blind image restoration based on L1-norm

A fraction-order total variation blind image restoration algorithm based on L1-norm was proposed for restoring the images blurred by unknown point spread function (PSF) during imaging. According to the form of total variation, this paper introduced an arithmetic operator of fraction-order total variation and generated a mathematical model of cost. Semi-quadratic regularization was used to solve the model iteratively so that the solution of this algorithm became easier. This paper also analyzed the convergence of this algorithm and then testified its feasibility in theory. The experimental results showed the proposed algorithm can increase the PSNR of the restored image by 1 dB in relation to the first order total variation blind restoration method and Bayesian blind restoration method. The details in real blurred image were also pretty well restored. The effectiveness of the proposed algorithm revealed that it was practical in the blind image restoration.     

修正的TV-Stokes模型的新快速算法

基于Tai等人的前期工作,本文研究修正的TV-Stokes图像去噪模型,提出一些新的求解该两步模型的快速算法.我们利用对偶形式和多重网格方法得到一个求解第1步的快速算法.给出另外一种新的求解光滑的切向量场的保不可压性质的算法.在第2步中,我们提出一类有效的全新算法:首先通过计算Poisson方程得到具有光滑法向量场的函数g,然后利用Jia和Zhao的方法得到恢复的图像.新算法的运算速度非常快,用于图像恢复的CPU时间少于0.1 s.数值结果显示新的快速算法是有效的和稳定的,恢复图像的质量也超过了一般去噪方法.     

Convergence analysis of the Bregman method for the variational model of image denoising

The total variation model of Rudin, Osher, and Fatemi for image denoising is considered to be one of the best denoising models. Recently, by using the Bregman method, Goldstein and Osher obtained a very efficient algorithm for the solution of the ROF model. In this paper, we give a rigorous proof for the convergence of the Bregman method. We also indicate that a combination of the Bregman method with wavelet packet decomposition often enhances performance for certain texture rich images.     

On decomposition-based block preconditioned iterative methods for half-quadratic image restoration

Image restoration is a fundamental problem in image processing. Except for many different filters applied to obtain a restored image in image restoration, a degraded image can often be recovered efficiently by minimizing a cost function which consists of a data-fidelity term and a regularization term. In specific, half-quadratic regularization can effectively preserve image edges in the recovered images and a fixed-point iteration method is usually employed to solve the minimization problem. In this paper, the Newton method is applied to solve the half-quadratic regularization image restoration problem. And at each step of the Newton method, a structured linear system of a symmetric positive definite coefficient matrix arises. We design two different decomposition-based block preconditioning matrices by considering the special structure of the coefficient matrix and apply the preconditioned conjugate gradient method to solve this linear system. Theoretical analysis shows the eigenvector properties and the spectral bounds for the preconditioned matrices. The method used to analyze the spectral distribution of the preconditioned matrix and the correspondingly obtained spectral bounds are different from those in the literature. The experimental results also demonstrate that the decomposition-based block preconditioned conjugate gradient method is efficient for solving the half-quadratic regularization image restoration in terms of the numerical performance and image recovering quality.     

Data-Driven Tight Frame Construction for Impulsive Noise Removal

The method of data-driven tight frame has been shown very useful in image restoration problems.We consider in this paper extending this important technique,by incorporating L₁ data fidelity into the original data-driven model,for removing impulsive noise which is a very common and basic type of noise in image data.The model contains three variables and can be solved through an efficient iterative alternating minimization algorithm in patch implementation,where the tight frame is dynamically updated.It constructs a tight frame system from the input corrupted image adaptively,and then removes impulsive noise by the derived system.We also show that the sequence generated by our algorithm converges globally to a stationary point of the optimization model.Numerical experiments and comparisons demonstrate that our approach performs well for various kinds of images.This benefits from its data-driven nature and the learned tight frames from input images capture richer image structures adaptively.     

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 automatic regularization parameter selection algorithm in the total variation model for image deblurring

Image restoration is an inverse problem that has been widely studied in recent years. The total variation based model by Rudin-Osher-Fatemi (1992) is one of the most effective and well known due to its ability to preserve sharp features in restoration. This paper addresses an important and yet outstanding issue for this model in selection of an optimal regularization parameter, for the case of image deblurring. We propose to compute the optimal regularization parameter along with the restored image in the same variational setting, by considering a Karush Kuhn Tucker (KKT) system. Through establishing analytically the monotonicity result, we can compute this parameter by an iterative algorithm for the KKT system. Such an approach corresponds to solving an equation using discrepancy principle, rather than using discrepancy principle only as a stopping criterion. Numerical experiments show that the algorithm is efficient and effective for image deblurring problems and yet is competitive.     

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.     

Image segmentation by level set evolution with region consistency constraint

Image segmentation is a key and fundamental problem in image processing, computer graphics, and computer vision. Level set based method for image segmentation is used widely for its topology flexibility and proper mathematical formulation. However, poor performance of existing level set models on noisy images and weak boundary limit its application in image segmentation. In this paper, we present a region consistency constraint term to measure the regional consistency on both sides of the boundary, this term defines the boundary of the image within a range, and hence increases the stability of the level set model. The term can make existing level set models significantly improve the efficiency of the algorithms on segmenting images with noise and weak boundary. Furthermore, this constraint term can make edge-based level set model overcome the defect of sensitivity to the initial contour. The experimental results show that our algorithm is efficient for image segmentation and outperform the existing state-of-art methods regarding images with noise and weak boundary.     

A unifying approach to isotropic and anisotropic total variation denoising models

Total variation minimisation is a well-established method for digital image restoration. Its implicit preservation of edges permits the derivation of anisotropic models for a qualitative improvement at corners. This paper is a synopsis of anisotropic models with state-of-the-art insights into the numerics of isotropic models. We generalise two representative models from both branches of research. This formulation leads to a general convergent algorithm and a general highly efficient algorithm which apply for both cases. A transfer of the discretisation from the anisotropic model to the isotropic setting results in an improvement of rotational invariance.     

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.     

Preconditioned Iterative Methods for Algebraic Systems from Multiplicative Half-Quadratic Regularization Image Restorations

<正>Image restoration is often solved by minimizing an energy function consisting of a data-fidelity term and a regularization term.A regularized convex term can usually preserve the image edges well in the restored image.In this paper,we consider a class of convex and edge-preserving regularization functions,i.e.,multiplicative half-quadratic regularizations,and we use the Newton method to solve the correspondingly reduced systems of nonlinear equations.At each Newton iterate,the preconditioned conjugate gradient method,incorporated with a constraint preconditioner,is employed to solve the structured Newton equation that has a symmetric positive definite coefficient matrix. The eigenvalue bounds of the preconditioned matrix are deliberately derived,which can be used to estimate the convergence speed of the preconditioned conjugate gradient method.We use experimental results to demonstrate that this new approach is efficient, and the effect of image restoration is reasonably well.     

脉冲噪声下图像去模糊非光滑非凸最小化问题的近端线性化最小化算法

去除脉冲噪声是图像复原中的重要任务之一.我们提出一类非光滑非凸模型来恢复模糊和脉冲噪声污染的图像,该模型具有灵活的先验信息引入机制,如盒子约束或低秩等.为了求解所提非凸问题,我们采用近端线性化最小化算法.对于算法中的子问题,我们运用交替方向乘子法.在目标函数满足Kurdyka-Lojasiewicz性质的假设下,我们证明所提算法的全局收敛性.数值实验表明,在主观和客观质量评价方面,我们的方法优于$\ell_{1}$TV和非凸TV模型.     

On weak solutions for an image denoising-deblurring model

A new denoising-deblurring model in image restoration is proposed,in which the regularization term carries out anisotropic diffusion on the edges and isotropic diffusion on the regular regions.The existence and uniqueness of weak solutions for this model are proved,and the numerical model is also testified.Compared with the TV diffusion,this model preferably reduces the staircase appearing in the restored images.     

A new method for parameter estimation of edge-preserving regularization in image restoration

In image restoration, the so-called edge-preserving regularization method is used to solve an optimization problem whose objective function has a data fidelity term and a regularization term, the two terms are balanced by a parameter λ$\lambda$. In some aspect, the value of λ$\lambda$ determines the quality of images. In this paper, we establish a new model to estimate the parameter and propose an algorithm to solve the problem. In order to improve the quality of images, in our algorithm, an image is divided into some blocks. On each block, a corresponding value of λ$\lambda$ has to be determined. Numerical experiments are reported which show efficiency of our method.     

A Recursive Algorithm to Restore Images Based on Robust Estimation of NSHP Autoregressive Models

The objective of this article is to present a new image restoration algorithm. First, each pixel in the image is classified into k categories. Then we assume that the gray levels in each category follow a nonsymmetric half-plane (NSHP) autoregressive model. Robust estimation of the parameters of the model is considered to attenuate the effect of the image contamination on the parameters. In each iteration we will construct a new image using a robustified version of the residuals. The introduction of the classification techniques as a first step of the algorithm reduces considerably the number of parameters to estimate. Hence, the computational time is also reduced because the robust estimations of the parameters are solutions of nonlinear system of equations. Some applications are presented to real synthetic aperture radar (SAR) images to illustrate how our algorithm restores an image in practice.     

Two-Phase Model Algorithm with Global Convergence for Nonlinear Programming

The family of feasible methods for minimization with nonlinear constraints includes the nonlinear projected gradient method, the generalized reduced gradient method (GRG), and many variants of the sequential gradient restoration algorithm (SGRA). Generally speaking, a particular iteration of any of these methods proceeds in two phases. In the restoration phase, feasibility is restored by means of the resolution of an auxiliary nonlinear problem, generally a nonlinear system of equations. In the minimization phase, optimality is improved by means of the consideration of the objective function, or its Lagrangian, on the tangent subspace to the constraints. In this paper, minimal assumptions are stated on the restoration phase and the minimization phase that ensure that the resulting algorithm is globally convergent. The key point is the possibility of comparing two successive nonfeasible iterates by means of a suitable merit function that combines feasibility and optimality. The merit function allows one to work with a high degree of infeasibility at the first iterations of the algorithm. Global convergence is proved and a particular implementation of the model algorithm is described.     

New time dependent pretreat models based on total variational image restoration

In this paper,we propose new pretreat models for total variation (TV) minimization problems in image deblurring and denoising.Specially,blur operator is considered as useful information in restoration.New models in form is equivalent to pretreat the initial value by image blur operator.We successfully get a new (L.Rudin,S.Osher,and E.Fatemi) ROF model,a new level set motion model and a new anisotropic diffusion model respectively.Numerical experiments demonstrate that,under the same stopping rule,the proposed methods significantly accelerate the convergence of the mothed,save computation time and get the same restored effect.