Fujipress Home | Search | About FINDER

Paper:
Language: English:

Dyadic Curvelet Transform (DClet) for Image Noise Reduction


Marjan Sedighi Anaraki*, Fangyan Dong*, Hajime Nobuhara**, and Kaoru Hirota*


*Dept. of Computational Intelligence and Systems Science, Tokyo Institute of Technology
G3-49, 4259 Nagatsuta, Midori-ku, Yokohama 226-8502, Japan
**Dept. of Intelligent Interaction Technologies, University of Tsukuba
1-1-1 Tennoudai, Tsukuba science city, Ibaraki 305-8573, Japan


Received: January 15, 2007

Accepted: March 20, 2007


Keywords: image processing, curvelet, noise reduction, wavelet, ridgelet

Journal ref: Journal of Advanced Computational Intelligence and Intelligent Informatics, Vol.11, No.6 pp. 641-647, 2007

Abstract



Dyadic Curvelet transform (DClet) is proposed as a tool for image processing and computer vision. It is an extended curvelet transform that solves the problem of conventional curvelet, of decomposition into components at different scales. It provides simplicity, dyadic scales, and absence of redundancy for analysis and synthesis objects with discontinuities along curves, i.e., edges via directional basis functions. The performance of the proposed method is evaluated by removing Gaussian, Speckles, and Random noises from different noisy standard images. Average 26.71 dB Peak Signal to Noise Ratio (PSNR) compared to 25.87 dB via the wavelet transform is evidence that the DClet outperforms the wavelet transform for removing noise. The proposed method is robust, which makes it suitable for biomedical applications. It is a candidate for gray and color image enhancement and applicable for compression or efficient coding in which critical sampling might be relevant.

preview Preview (PDF)  full text Full Text (PDF 531KB)

Reference

[Notice]
* "Preview" is the first 2 pages of the article. You don't need the registration.
* To read the PDF file you will then need to download and install the Adobe Reader.
Adobe Reader is free and available for download here:

adobe reader

Terms and Conditions | Privacy Policy | Recruit | Advertising Information | Contact Us