节点文献

图像恢复中的数值计算方法

On the Numerical Methods of Image Restoration

【作者】 卢德勇

【导师】 黄玉梅;

【作者基本信息】 兰州大学 , 计算数学, 2013, 硕士

【摘要】 图像作为人类感知世界的视觉基础,是人类获取信息、表达信息和传递信息的重要手段。在过去的几十年里,我们见证了一个影像科学的时代。从卫星图像、X光成像,到现代医学中的电脑断层扫描(CT)、核磁共振成像(MRI)和正电子发射断层显像(PET),数字图像越来越普遍和重要,同时也得到了越来越多的研究和成果。总的来说,图像处理包括图像增强、图像恢复(或图像复原)、图像修补、图像分割等方面。本文主要研究基于基本数学模型上的图像恢复问题的数值计算方法。首先,简单介绍数字图像的基本知识和涉及到的两个基本数学模型,并且简单介绍图像处理中的反问题和求解反问题的正则化方法。其次,研究预处理方法在半二次图像恢复问题中的应用。图像恢复是图像处理中的基本问题,除了采用恢复图像的各种滤波方法之外,常常应用正则化方法将问题等价于一个优化问题,目标函数包含一个数据保真项和正则项。特别地,半二次正则项能够有效恢复图像的基本特征,因此我们的目标函数采用半二次正则项。我们利用牛顿法求解该优化问题,在每步牛顿迭代中,都有一个结构化的、系数矩阵是对称正定的线性方程组,从而可以利用预处理共轭梯度法求解这个方程组。我们提出了两个有效的预处理算子,并且给出一些理论结果。数值试验表明预处理共轭梯度法求解半二次图像恢复问题是有效的、快速的。同时,本文还研究乘性噪声下图像恢复的快速算法。乘性噪声下图像恢复问题是应用数学中的一个富有挑战性的问题,近年来吸引了很多的关注和研究。受到前人对脉冲噪声下的图像恢复的方法的启示,我们提出一个快速的两步方法解决乘性噪声下的图像恢复问题。该方法的第一步,利用非局部滤波来降低乘性噪声,然后利用正则化方法将问题转换为一个优化问题,目标函数由混合保真项和一个总变差正则项组成。我们利用著名的交替迭代法求解这个优化问题,并证明算法至少线性收敛。数值试验表明两步法求解乘性噪声下图像恢复问题是非常有效的,在恢复图像的质量和速度上都优于目前其它方法。

【Abstract】 Images, as an important bridge of the human and the world, play an significant role in human’s obtaining information, expressing information and transmitting information. In the last few decades, we have witnessed an era of imaging sciences. From satellite imaging, X-ray imaging to modern medical computer tomography (CT), magnetic reso-nance imaging (MRI) and positron emission tomography (PET), digital images became more and more common and important. In general, image processing includes image enhancement, image restoration, image inpainting, image segmentation, etc.In this paper, we focus on the numerical methods in image restoration problems. First of all, we simply introduce some basic concepts of digital image and two basic mathematical models, then study the inverse problem and regularization method.Then, we apply the preconditioned conjugate gradient method to solve the half-quadratic regularization image restoration problem. Image restoration is the fundamental problem in image processing area. Except for many different filters applied to obtain an restored image, a degraded image can often be recovered efficiently by solving a mini-mization function which consists of a data-fidelity term and a regularization term. In spe-cific, 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, Newton method is applied to solve the half-quadratic regular-ization image restoration problem. And at each step of the Newton method, a structured linear system of a symmetric positive definite coefficient matrix arises and preconditioned conjugate gradient method is applied to solve it with a product preconditioner.The exper-imental results demonstrate that the product preconditioned conjugate gradient method is efficient for the half-quadratic regularization image restoration in terms of the numerical performance and image recovering quality.At last, we propose two step method to handle the multiplicative noise restoration problem. Restoration of images corrupted by blur and multiplicative noise is a challeng-ing problem in applied mathematics and it has attracted much attention in recent years. Inspired by previous works on image recovery under impulse noise with blur, we pro-pose a two-step approach to handle the multiplicative noise restoration problem. In the proposed method, the multiplicative noise is first reduced by nonlocal filters, and then a convex variational model is further adopted on the result of the first step. The variational model is composed of an L1-L2data-fidelity term and a total variation (TV) regulariza-tion term. The alternating direction method (ADM) is utilized to solve this variational problem, and we also demonstrate that the ADM algorithm converges at least linearly. Experimental results are given to show that the proposed two-step approach performs bet-ter than the existing methods for multiplicative noise image restoration both in the quality of the restored images and the convergence speed of the algorithms.

  • 【网络出版投稿人】 兰州大学
  • 【网络出版年期】2013年 11期
节点文献中: