Image Denoising Using Complex Ridgelet Trasform

Image Denoising Using Complex Ridgelet Trasform

V.Krishnanaik 1 Dr.G.Manoj Someswar 2 K.Purushotham 3 R. Suvarna Rao 4

1Asst. Professor, Department of Electrical & Computer Engineering, College of Engineering & Tech, Aksum University, Axsum, Ethiopia,.

2Professor Department of Computer Science and Engineering, Anwarul- uloom College of Engineering

and Technology, Hyderabad. India.

3Asst. Professor, Department of Electrical & Computer Engineering, College of Engineering & Tech, Jigjiga University, Jigjiga, Ethiopia.

4Asst. Professor, Department of Computer Science and Engineering, VIF College of Engineering &

Tech, Himayath Nagar, Gandipet, Hyderanad, A.P, India.

Abstract

In this paper, we plan a new image denoising technique by integrating the dual-tree complex wavelets into the usual ridgelet transform. To make a new method for image donoising from approximate shift invariant property of the dual-tree complex wavelet and the high directional sensitivity of the ridgelet transform. We spread on the digital complex ridgelet transform to the image denoising of particular standard images added in white noise. In this procedure normal hard thresholding of the complex ridgelet coefficient is used. The results of this paper show better than VisuShrink, the ordinary ridgelet image denoising, and wiener2 filter, and also Complex ridgelets applied to curvelet image denoising.

Keywords: complex ridgelets Transform, Image denoising, wavelets, ridgelets, VisuShrink.

1. INTRODUCTION(BACKGROUND)

   The image processing scientific field normally wavelet transforms used for image denoising, image compression, signal processing, pattern recognition, many image applications and computer graphics. The Donoho and his coworkers pioneered a wavelet denoising scheme by performing soft thresholding, hard thresholding both. In this approach cover many number of image processing applications. Because wavelet transform can perfume compact the energy of the image to only a small number of large co-efficient and the majority of the wavelet coefficients are very small so that they can be set to be zero. The thresholding of the wavelet coefficients can be done by wavelet decomposition subbands. So that they are not thresholded because of a few low frequency wavelet subbands untouched. The Donoho's method used for advantages of smoothness and adaptation. However, as

   Coifman and Donoho pointed out, this algorithm exhibits visual artifacts: Gibbs phenomena in the neighbourhood of discontinuities. Consequently, 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 single TI wavelet denoising performs better than the non-TI case. Bui and Chen [2] 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 co-efficient into account. Their experimental results showed apparent advantages over the traditional term-by-term wavelet denoising. Chen and Bui [3] extended this neighbouring wavelet thresholding idea to the multiwavelet case. They claimed that neighbour multiwavelet denoising outperforms neighbour single wavelet denoising for some standard test signals and real-life images. Chen et al. [6] proposed an image denoising scheme by considering a square neighbourhood in the wavelet domain.

   Chen et al. [5] also tried to customize the wavelet filter and the threshold for image denoising. The above method results show and produce better denoising results. The ridgelet transform was developed to break the limitations of the wavelet transform. The large wavelet coefficients there in 2D wavelet transform, at every scale of the decomposition. With so many large coefficients, the denoising of noisy images faces a lot of difficulties. The following papers know that the ridgelet transform has been successfully used to analyze digital images. Unlike wavelet transforms, the ridgelet transform processes data by major computing integrals over different orientations and locations. A ridgelet is constant along the lines x1cos + x2sin = constant. In the direction orthogonal

   to these ridges it is a wavelet. Ridgelets have been 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 invariance property of the dual-tree complex wavelet and the good property of the ridgelet make our method a very good method for image denoising. The results show that by using dual- tree complex ridgelets, this algorithms obtain higher Peak Signal to Noise Ratio for all the denoised images including different noise levels.

2. COMPLEX RIDGELET

Both smooth objects and of objects with edges representation using in Discrete ridelet transform. It is same and near-optimal method of denoising for Gaussian noise. The ridgelet transform can resizing the energy of the image into a smaller number of ridgelet coefficients. In the same way, the wavelet transform produces many large wavelet coefficients on the edges on every scale of the 2D wavelet decomposition. These wavelet coefficients are needed in order to reconstruct the edges in the image. These are same approximate Radon transforms for digital data can be based on discrete fast Fourier transform. The ordinary ridgelet transform can be realized as shadows.

1. Find 2D FFT of the image first.

2. Change the sampled values of the Fourier transform achieved on the square lattice with sampled values of a polar lattice.

3. Find and compute the inverse FFT 1D on each angular line.

4. To make the 1D wavelet transform of resulting angular lines in order to obtain the ridgelet coefficients.

The ordinary discrete wavelet transform is not shift invariant because of the decimation operation during the transform. The small shift in the input signal can cause very different output wavelet coefficients. This overcome problem, Kingsbury introduced a new kind of wavelet transform, called the dual-tree complex 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 dual-tree complex wavelet in the ridgelet transform so that we can have what we call complex ridgelets. This procedure 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 the way, we can association 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 total entire image or we can partition the image into a number of overlapping squares and we apply the ridgelet transform to each square. The decompose the original NxN 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 x R=2. For an NxN image, we count 2n/R such blocks in each direction. The above partitioning introduces a redundancy of 4 times. In order to get the denoised complex ridgelet coefficient, we use the average of the four denoised complex ridgelet coefficients inthe current pixel location.

The thresholding for the complex ridgelet transform is similar to the curvelet thresholding. One difference is that we take the magnitude of the complex ridgelet coefficients when we do the thresholding. Let y be the noisy ridgelet coefficients. We use the following hard thresholding rule for estimating the unknown ridgelet coefficients. When y > k~ we let y^ = y. Otherwise, y^ = 0. Here, ~ is approximated by using Monte-Carlo simulations. The constant k used is dependent on the noise . When the noise is less than 30, we use k = 5 for the first decomposition scale and k = 4 for other decomposition scales. When the noise is greater than 30, we use k = 6 for the first decomposition scale and k = 5 for other decomposition scales.

Algorithm

1. Divide the image into RxR blocks with 2 vertically adjacent blocks overlapping R=2 / R

   pixels and two horizontally adjacent blocks overlapping R x R=2 pixels.

2. Each block, Apply complex ridgelets, threshold the complex ridgelet coefficients, and apply inverse complex ridgelet transform.

3. Proceeds the average of the denoising image pixel values at the same place.

The above algorithm call as ComRidgeletShrink, however the algorithm using the ordinary ridgelets RidgeletShrink. The computational complexity of ComRidgeletShrink is similar to RidgeletShrink by by means of the scalar wavelets. The difference is that we replaced the 1D wavelet transform with the 1D dual-tree complex wavelet transform. The amount of computation for the 1D dual-tree complex wavelet is twice that of the 1D scalar wavelet transform. But, other steps of the algorithm keep the same amount of calculation. The experimental results show that ComRidgeletShrink outperforms V isuShrink, RidgeletShink, and wiener2 filter for all cases. In r some case, we obtain some improvement in

Peak Signal to Noise Ratio (PSNR) over RidgeletShrink. The development over V isuShink is even bigger for denoising all images. This shows that ComRidgeletShrink is an outstanding choice for denoising usual noisy images.

3 RESULTS

We use for famous image Lena. The from the free software package WaveLab developed by Donoho et al. at Stanford University. The above images with different noise levels are generated by adding Gaussian white noise to the original noise-free images. For comparison, we implement VisuShrink, RidgeletShrink, ComRidgeletShrink and wiener2. The VisuShrink is the universal soft-thresholding denoising procedure. The wiener2 function uses 5 x 5 neighborhood of each pixel in the image it is presented in the MATLAB Toolbox and applies a Wiener filter to an image adaptively, tailoring to the local image variance. The searching ,investigational results in the form of Peak Signal to Noise Ratio (PSNR). In that values to choose the partition block size of 64 x64 or 32 x32 is our best choice. The results for denoising image Lena with different noise levels and a fixed partition block size of 32 x 32 pixels. The first column of value is the PSNR of the original noisy images, and other columns are the PSNR of the denoised images by expending different denoising methods.

Where M is the noise-free imageand N is the denoised image. The improvement of ComRidgeletShrink over V isuShrink is even more significant for all noisy levels and testing images. The figure shows the noise free image, the image with noise added, the denoised image with VisuShrink, the denoised image with RidgeletShrink, the denoised image with ComRidgeletShrink, and the denoised image with wiener2 for images Lena, at a partition block size of 32 x 32 pixels.

4. CONCLUSION

The paper complex ridgelet transform is obtained by execution 1D dual-tree complex wavelet onto the Radon transform coefficients. The Radon transform is done by resources of the projection-slice theorem. The complex ridgelet transform an outstanding best for image denoising because of we uses the approximate shift invariant property of the dual-tree complex wavelet transform. The complex ridgelet transform provides near-ideal sparsity of representation for both objects with edges and smooth objects.

Figure 1. Original Image Figure2. Noisy Image

Figure 3. Redgelet Shrink Figure 4: Complex RegeletShrink

Figure5. VisuShrink Figure 6. Resultant Image

REFERENCES

1. T. T. Cai and B. W. Silverman, Incorporating information on neighbouring coefficients into wavelet estimation," Sankhya: The Indian Journal of Statistics, Vol. 63, Series B, Pt. 2,pp. 127-148, 2001.

2. G. Y. Chen and T. D. Bui, Multiwavelet Denoising using Neighbouring Coe_cients," IEEE Signal Processing Letters, vol.10, no.7, pp.211-214, 2003.

3. R. R. Coifman and D. L. Donoho, Translation Invariant Denoising," In Wavelets and Statistics, Springer Lecture Notes in Statistics 103, pp. 125-150, New York:Springer-Verlag.

4. T. D. Bui and G. Y. Chen,Translation invariant denoising using multiwavelets," IEEE Transactions on Signal Processing, vol.46, no.12, pp.3414-3420, 1998.

5. G. Y. Chen, T. D. Bui and A. Krzyzak, Image Denoising with Neighbour Dependency and Customized Wavelet and Threshold," Pattern Recognition, vol. 38, no. 1, pp. 115-124, 2005.

6. G. Y. Chen, T. D. Bui and A. Krzyzak, Image Denoising using Neighbouring Wavelet Coefficients," Integrated Computer-Aided Engineer- ing, vol. 12, no. 1, pp. 99-107, 2005.

7. G. Y. Chen, T. D. Bui and A. Krzyzak, Rotation Invariant Pattern Recognition using Ridgelet, Wavelet Cycle-spinning, and Fourier Features," Pattern Recognition, to appear.

8. D. L. Donoho and A. G. Flesia, Digital ridgelet transform based on true ridge functions," Be-yond Wavelets, J. Stoecker and G. V. Welland eds., Academic Press, 2001.

9. E. J. Candes, Ridgelets and the representation of mutilated Sobolev functions," SIAM Journal on Mathematical Analysis, vol. 33, no. 2, pp. 347-368, 2001.

10. E. J. Candes and D. L. Donoho, Ridgelets: a key to higher-dimensional intermittency?"Philosophical Transactions of the Royal Societyof London, Ser. A vol. 357, no. 1760, pp. 2495- 2509, 1999.

11. M. N. Do and M. Vetterli, The _nite ridgelet transform for image representation," IEEE Transactions on Image Processing, vol. 12, no. 1, pp. 16-28, 2003.

12. J. L. Starck, E. J. Candes and D. L. Donoho, Astronomical Image Representation by the Curvelet Transform," Astronomy & Astro-physics, vol. 398, no. 2, pp. 785-800, 2003.

13. J. L. Starck, E. J. Candes and D. L. Donoho, The Curvelet Transform for Image Denoising,"IEEE Transactions on Image Processing, vol.11, no. 6, pp. 670-684, 2002.

14. A. G. Flesia, H. Hel-Or, A. Averbuch, E. J.Candes, R. R. Coifman and D. L. Donoho, Digital implementation of ridgelet packets," Be-yond Wavelets, J. Stoeckler and G. V. Welland eds., Academic Press, 2001.

15. J. Romberg, H. Choi, R. Baraniuk and N. G. Kingsbury, Multiscale classi_cation using complex wavelets," Proc. IEEE ICIP, Vancouver, Sept. 11-13, 2000.

16. N. G. Kingsbury, A dual-tree complex wavelet transform with improved orthogonality and symmetry properties," Proc. IEEE ICIP, Vancouver, Sept. 11-13, 2000

17. N. G. Kingsbury, The dual-tree complex wavelet transform: a new e_cient tool for image restoration and enhancement," Proc.EUSIPCO'98, Rhodes, Sept. 1998, pp. 319-322.

AUTHORS PROFILE:

Sri.V.KRISHNA NAIK,

pursuing Ph.D., currently working as Asst. Professor, in the Department of Electrical & Computer Engineering, College of Engineering & Tech, Aksum University, Axum, Ethiopia, North East Africa. He studied B.E (ECE) from C.B.I.T, Osmania University, Hyderabad and M.Tech (Systems & Signal Processing) from J.N.U.C, J.N.T.U, Hyderabad, A.P, India. He is having 12+ years of work experience in Academics, Teachin, Industry & Research. He participated and presented research papers in both national and international conferences, seminars and workshops; also published 10 research papers in national and international peer reviewed journals.

Dr.G.Manoj Someswar,

B.Tech.,M.S.(USA), M.C.A., Ph.D. is having 20+

years of relevant work experience in Academics, Teaching, Industry, Research and Software Development. At present, he is working as PRINCIPAL and Professor CSE Department Anwarul-uloom College of Engineering & Technology, Yennepally, Vikarabad – 501101, RR Dist., A.P., and utilizing his teaching skills, knowledge, experience and talent to achieve the goals and objectives of the Engineering College in the fullest perspective. He has attended more than

100 national and international conferences, seminars and workshops. He has more than 30 publications to his credit both in national and international journals. He is also having to his credit more than 50 research articles and paper presentations which are accepted in national and international conference proceedings both in India and Abroad. He received National Awards like Rajiv Gandhi VidyaGold Medal Award for Excellence in the field of Education and Rashtriya Vidya Gaurav Gold Medal Award for Remarkable Achievements in the field of Education.

work experience in Academics, Teaching & Research. He participated and presented research papers in both national and international conferences, seminars and workshops.

Mr.K.Purushotham, M.Tech.

is

having 8+ years of relevant work experience in Academics, Teaching, Industry and Research. He participated and presented research papers in both national and international conferences, seminars and workshops; also published 3 research papers. At present, he is working as Senior Lecturer in the Department of Electrical & Computer Engineering, Jigjiga University, Jigjiga, Ethiopia, North East Africa. He studied B.Tech (ECE) from GRRIET, JNTU Hyderabad and M.Tech (Systems and Signal Processing) from JNTUCEH, Hyderabad, A.P, India.

Mr. Runja Suvarna Rao, currently working as Asst. Professor, in the Department of Computer Science and Engineering, VI F College of Engineering & Tech, Himayath Nagar, Gandipet, Hyderanad, A.P, India. He studied B.Tech (CSE) from Adams Engineering College, Palvoncha, JNTU University, Hyderabad and M.Tech Specialization in CSE from C.B.I.T, Osmania University, Hyderabad, A.P, India. He is having 7 years of