matlab畢業(yè)設(shè)計(jì)外文翻譯--復(fù)雜脊波圖像去噪-全文預(yù)覽
【正文】 good method for image results show that by using dualtree plex ridgelets, our algorithms obtain higher Peak Signal to Noise Ratio (PSNR) for all the denoised images with di_erent noise organization of this paper is as follows. In Section 2, we explain how to incorporate the dualtree plex wavelets into the ridgelet transform for image denoising. Experimental results are conducted in Section 3. Finally we give the conclusion and future work to be done in section 4. 2 Image Denoising by using Complex Ridgelets Discrete ridgelet transform provides nearideal sparsity of representation of both smooth objects and of objects with edges. It is a nearoptimal method of denoising for Gaussian noise. The ridgelet transform can press the energy of the image into a smaller number of ridgelet coe_cients. On the other hand, the wavelet transform produces many large wavelet coe_cients on the edges on every scale of the 2D wavelet deposition. This means that many wavelet coe_cients are needed in order to reconstruct the edges in the image. We know that approximate 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 lattice. 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 the transform. A small shift in the input signal can cause very di_erent output wavelet coe_cients. In order to overe this problem, Kingsbury introduced a new kind of wavelet transform, called the dualtree plex wavelet transform, that exhibits approximate shift invariant property and improved angular resolution. Since the scalar wavelet is not shift invariant, it is better to apply the dualtree plex wavelet in the ridgelet transform so that we can have what we call plex ridgelets. This can be done by replacing the 1D scalar wavelet with the 1D dualtree plex wavelet transform in the last step of the ridgelet transform. In this way, we can bine the good property of the ridgelet transform with the approximate shift invariant property of the dualtree plex wavelets. The plex 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 ridgelet transform to each square. We depose 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 horizontally adjacent blocks is a rectangular array of size R _ R=2 . For an 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 plex ridgelet coe_cient, we use the average of the four denoised plex ridgelet coe_cients in the current pixel location. The thresholding for the plex ridgelet transform is simila
畢業(yè)設(shè)計(jì)相關(guān)推薦
鄂ICP備17016276號-1