1、完整版MATLAB外文资料翻译毕业设计论文优秀论文 审核通过未经允许 切勿外传大连民族学院毕业设计外文资料翻译所 在 学 院：机电信息工程学院专 业 (班级)： 自动化063 学 生 姓 名： 徐睿 指 导 教 师： 王培昌 2010年6月4日 复杂脊波图像去噪作者：G. Y. Chen and B. Kegl刊名：Pattern Recognition;出版日期：20071.介绍小波变换已成功地应用于many scientific fields such as image compression, i许多科学领域，如图像压缩，图像age denoising, signal processin
2、g, com去噪，信号处理，计算机图形，ics, and pattern recognition, to name only a feIC和模式识别，仅举几例。Donoho和他的同事们提出了小波阈值去噪通过软阈值和阈值.这种方法的出现对于大量的应用程序是一个好的选择。这是因为一个小波变换能结合的能量,在一小部分的大型系数和大多数的小波系数中非常小,这样他们可以设置为零。这个阈值的小波系数是可以做到的只有细节的小波分解子带。我们有一些低频波子带不能碰触，让他们不阈值。众所周知，Donoho提出的方法的优势是光滑和自适应。然而，Coifman和Donoho指出，这种算法展示出一个视觉产出：吉布斯现
3、象在邻近的间断。因此，他们提出对这些产出去噪通过平均抑制所有循环信号。实验结果证实单目标识别小波消噪优于没有目标识别的情况。Bui和Chen扩展了这个目标识别计划，他们发现多小波的目标识别去噪的结果比单小波去噪的结果要好。蔡和西尔弗曼提出了一种阈值方案通过采取相邻的系数。他们结果表现出的优势超于了传统的一对一小波消燥。Chen和Bui扩展这个相邻小波阈值为多小波方法。他们声称对于某些标准测试信号和真实图像相邻的多小波降噪优于相邻的单一小波去噪。陈等人提出一种图像去噪是考虑方形相邻的小波域。陈等人也尝试对图像去噪自定义小波域和阈值。实验结果表明：这两种方法产生更好的去噪效果。 研究脊波变换的数多
4、年来打破了小波变换的局限性。将小波变换产生的二维图像在每个规模大的小波系数的分解。有这么多的大系数，对于图像去噪有很多困难。我们知道脊波变换已经成功用于分析数字图像。不像小波变换,脊波变换过程首先计算积分在不同的方向和位置的数据。沿着“x1cos_ + x2sin_ = 常数” 一条线的脊波是不变的。在这些脊的方向正交小波变换是一。最近脊波已成功应用于图像去噪。在本文中，我们结合dual-tree complex wavelet in the ridgelet transfo二元树复小波的脊波变换中并将其应用到图像降噪。这种近似二元树性能的复杂变性小波和良好性能的脊波使我们有更好的方法去图像去
5、噪。实验结果表明，采用二元树复杂脊波在所有去噪图像和许多不同噪音中我们的算法获得较高的峰值信噪比（PSNR）。这篇文章大体是这样的。在第二部分，我们将解释如何将二元树复杂的波变换成脊波去图像去噪。实验结果在第3节。第4节是最后得出的结论和未来需要做的工作。2.用复杂脊波图像去噪离散脊波变换提供接近理想的稀松代表光滑的物体边缘。高斯去噪是一个接近最优的方法。脊波变换能够压缩图像能量成为少量的脊波系数。在另一方面,利用小波变换产生的多大的小波系数对每个尺度边缘二维小波分解。这句话的意思是说许多小波系数进行重构在图像的边缘。我们知道近似氡转化为数字数据可以基于离散傅立叶变换。普通的脊波变换即可达到如
6、下：1. 计算出二维FFT的图像。2. 替补的采样傅里叶广域上变换得到晶格和极性格的采样值。3. 计算一维逆FFT每一个角的线。4. 执行一维标量小波对角线结果，获取脊波系数。众所周知，普通的离散小波变换在变换期间是不移位和不转变的。输入信号的一个小小的改变能够引起输出小波系数很大的变化。为了克服这个问题，Kingsbury发明了一种新型的小波变换，叫做二元树复杂小波变换，它能够转移性能和提高近似角分辨率不变。由于标量波不是转移不变的，在脊波变换中就更好的应用二元树复杂小波变换这样我们就可以叫我们的复杂脊波。这样可以通过取代一维标量小波的一维二元树复杂小波在最后一步进行脊波变换。用这种方法我们
7、可以优秀品质的脊波变换用来替换二元树发杂脊波。这个复杂的脊波变换可以应用到整体图像，或者我们可以应用到分割图像大量重叠的平方或者在每一平方上运用脊波变换。我们分解一组n*n的影像重叠顺利进入边长R的象素是重叠的是两个相邻长方形的数组大小为R2*R两者之间重叠的相邻区域就是一个长方形的大小R*R2。对于一个n*n的图像，我们能够计数2n=R对于不同方向的模块，这个分区就引入了4倍的冗余。为了得到降噪的复杂脊波系数我们通常在当前象素地位对降噪的复杂脊波系数进行平均4份。复杂的脊波变换阈值类似于曲波阈值。当我们求阈值时一个不同是我们采取的是复杂的脊波系数。当y是带噪的脊波系数。我们使用下列硬阈值规则
8、估算未知的脊波系数。当y k, 我们令= .否则, y_ = 0.在这里，是通过用蒙特卡罗模拟接近。采用的系数k是依赖于噪声系数。当这个小于30时，我们用k=5首先分解尺度和k=4分解其他尺度。当这个噪音系数大于30时，我们用k=6首次分解尺度和k=5分解其他尺度。这个复杂的脊波去噪算法能够被描述如下：1. 图像分割成R*R块，两个垂直相邻的R 2*R重叠，两个水平象素块R*R2重叠。2. 对于每一块，应用所提出的复杂脊波，复杂脊波系数的阈值，复杂脊波的逆换算。3. 在同一位置以平均象素对图像去噪。我们称这种算法叫，同时我们使用普通的脊波。这个计算复杂度的ComRidgeletShrink是和
9、小波RidgeletShrink的标量相似。唯一的区别是我们取代了一维小波变换与一维二元树发杂小波变换。这个数量的计算是一维二元树复数小波的变换是一维小波变换的两倍。该算法的其他计算步骤保持相同。我们的实验结果显示ComRidgeletShrink优于V isuShrink, RidgeletShink, and 过滤器wiener2等所有测试案例。在某些情况下，我们在RidgeletShink中能够提高0.8db的信噪比。通过V isuShrink,能够改善更大的去噪图像。这表明ComRidgeletSrink对于自然图像去噪是一个很好的选择。 3.实验结果 我们通过对众所周知的蕾娜进行处理
10、，通过Donoho等人我们得到了这种图片的自由软体包WaveLab。带有不同噪音的噪音图像时通过对原无噪音图像添加高斯白噪音得到的。与之相比，我们实行VisuShrink, RidgeletShrink, ComRidgeletShrink and wiener2。VisuShrink是通用软阈值去噪技术。这个wiener2函数是可以从MatLab图像工具箱得到，我们用一个5*5的相邻图像在每个象素中。该wiener2适用于一个维纳滤波器（一种线性的滤波器）图形自适应。剪裁自己的图像局部方差。峰值信噪比的实验结果显示的表1.我们发现对于分区块的大小32*32或者64*64是最好的选择。表1是对
11、蕾娜图像进行去噪，根据不同的噪声水平固定分区和一素块为32*32。表格中的第一栏是原来带噪图片的信噪比，其他列是通过不同去噪方法得到的去噪图像信噪比。这个信噪比被定义PSNR = 10 log10Pi;j (B(i; j) A(j)2n22552 :; 其中B是去噪图像A是无噪音图像。从表1.我们可以看出VisuShrink ,ComRidgeletShrink是优于不同RidgeletShrink和wiener2在所有案例中。当噪音低时VisuShrink没有去噪能力。在这样的情况下，VisuShrink将产生比原来的去噪图像更糟的结果。然而，Com
12、RidgeletShrink在这种情况下取得较好的效果。在某些情况下，ComRidgeletShrink能够比普通RidgeletShrink多提供给我们0.8db。这表明，我们把二元树结合复数的小波变换成脊波变换能够明显的改善我们图像去噪的效果。ComRidgeletShrink超越VisuShrink的表现更重要的是所有噪音水平和图像测试。图一显示的是在无噪音图像，添加噪音的图像，用VisuShrink去噪的图像，用RidgeletShrink去噪的图像，用ComRidgeletShrink去噪的图像，用wiener2去噪的图像，在一个分区大小为32*32的象素块中。ComRidgelet
13、Shrink在视觉上产生的效果比VisuShrink ，wiener2 RidgeletShrink更清晰具有高线性和恢复曲线的特点。4结论和未来工作在这篇文章中我们研究了用复杂脊波对图像去噪。复杂脊波变换是通过执行一维二元树复杂小波在空气中氡的变换系数获得的。氡变换是通过投影片定理得到的。对于图像去噪近似转换不变性质的二元树复数小波变换对于复杂小波变换是一个很好的选择。复杂脊波变换提供了近乎完美的对于光滑的物体和表现对象与边缘。这使噪音阈值的脊波系数更接近高斯白噪音的消噪。我们测试了我们新的去噪方法和几个标准图像和加入高斯白噪音的图像。用一个非常简单的硬阈值复杂脊波系数。在这些脊波实验中，实
14、验结果表明复杂的脊波有更好的去噪能力比起VisuShrink和普通的wiener2。我们建议ComRidgeletShrink用于实际的图像去噪中。未来工作主要是考虑在复杂图像应用曲波复杂脊波。同样，复杂脊波还可以应用的不变特征提取模式识别方法。Complex Ridgelets for Image DenoisingG. Y. Chen and B. Kegl1 IntroductionWavelet transforms successfully used in many scientific fields such as image compression, image denoisin
15、g, signal processing, computer graphics,and pattern recognition, to name only a few.Donoho and compact the energy of the image to only a small number of large coefficients and the majority of the wavelet coeficients are very small so that they can be set to zero. The thresholding of the wavelet coef
16、icients can be done at only the detail wavelet decomposition subbands. We keep a few low frequency wavelet subbands untouched so that they are not thresholded. It is well known that Donohos method offers the advantages of smoothness and adaptation. However, as Coifmanand Donoho pointed out, this alg
17、orithm exhibits visual artifacts: Gibbs phenomena in the neighbourhood of discontinuities. Therefore, they propose in a translation invariant (TI) denoising scheme to suppress such artifacts by averaging over the denoised signals of all circular shifts. The experimental results in confirm that singl
18、e TI wavelet denoising performs better than the non-TI case. Bui and Chen extended this TI scheme to the multiwavelet case and they found that TI multiwavelet denoising gave better results than TI single wavelet denoising. Cai and Silverman proposed a thresholding scheme by taking the neighbour coef
19、icients into account Their experimental results showed apparent advantages over the traditional term-by-term wavelet denoising.Chen and Bui extended this neighbouring wavelet thresholding idea to the multiwavelet case. They claimed that neighbour multiwavelet denoising outperforms neighbour single w
20、avelet denoising for some standard test signals and real-life images.Chen et al. proposed an image denoising scheme by considering a square neighbourhood in the wavelet domain. Chen et al. also tried to customize the wavelet _lter and the threshold for image denoising. Experimental results show that
21、 these two methods produce better denoising results. The ridgelet transform was developed over several years to break the limitations of the wavelet transform. The 2D wavelet transform of images produces large wavelet coeficients at every scale of the decomposition.With so many large coe_cients, the
22、 denoising of noisy images faces a lot of diffculties. We know that the ridgelet transform successfully used to analyze digital images. Unlike wavelet transforms, the ridgelet transform processes data by first computing integrals over different orientations and locations. A ridgelet is constantalong
23、 the lines x1cos_ + x2sin_ = constant. In the direction orthogonal to these ridges it is a wavelet.Ridgelets successfully applied in image denoising recently. In this paper, we combine the dual-tree complex wavelet in the ridgelet transform and apply it to image denoising. The approximate shift inva
24、riance property of the dual-tree complex wavelet and the good property of the ridgelet make our method a very good method for image denoising.Experimental results show that by using dual-tree complex ridgelets, our algorithms obtain of this paper is as follows. In Section 2, we explain Section 3. Fi
25、nally we give the conclusion and future work to be done in section 4.2 Image Denoising by using ComplexRidgelets Discrete ridgelet transform provides near-ideal sparsity of representation of both smooth objects and of objects with edges. It is a near-optimal method of denoising for Gaussian noise. T
26、he ridgelet transform can compress the energy of the image into a smaller number of ridgelet coe_cients. On the other the edges on every scale of the 2D wavelet decomposition. This means that many wavelet coe_cients are needed in order to reconstruct the edges in the image. We know that approximate
27、Radon transforms for digital data can be based on discrete fast Fouriertransform. The ordinary ridgelet transform can be achieved as follows:1. Compute the 2D FFT of the image.2. Substitute the sampled values of the Fourier transform obtained on the square lattice with sampled values on a polar latt
28、ice.3. Compute the 1D inverse FFT on each angular line.4. Perform the 1D scalar wavelet transform on the resulting angular lines in order to obtain the ridgelet coe_cients.It is well known that the ordinary discrete wavelet transform is not shift invariant because of the decimation operation during
29、the transform. A small shift in the input signal can cause very di_erent output wavelet coe_cients. In order to overcome this problem, Kingsbury introduced a new kind of wavelet transform, called the dual-tree complex wavelet transform, that exhibits approximate shift invariant property and improved
30、 angular resolution. Since the scalar wavelet is not shift invariant, it is better to apply the dual-tree complex wavelet in the ridgelet transform so that we can be done by replacing the 1D scalar wavelet with the 1D dualtree complex wavelet transform in the last step of the ridgelet transform. In
31、this way, we can combine the good property of the ridgelet transform with the approximate shift invariant property of the dual-tree complex wavelets.The complex ridgelet transform can be applied to the entire image or we can partition the image into a number of overlapping squares and we apply the r
32、idgelet transform to each square. We decompose the original n _ n image into smoothly overlapping blocks of sidelength R pixels so that the overlap between two vertically adjacent blocks is a rectangular array of size R=2 _ R and the overlap between two n _ n image, we count 2n=R such blocks in each direction. This partitioning introduces a redundancy of 4 times. In order to get the denoised complex ridgelet coe_cient, we use the average of the four denoised complex ridgelet coe_cients in the current pixel location.The thresholding for the complex ridgelet transform is similar to t
