期刊文献+

Tunable-Q contourlet transform for image representation 被引量:1

Tunable-Q contourlet transform for image representation
下载PDF
导出
摘要 A novel tunable-quality-factor (tunable-Q) contourlet transform for geometric image representation is proposed. The Laplacian pyramid in original contourlet decomposes a signal into channels that have the same bandwidth on a logarithmic scale, and is not suitable for images with different behavior in frequency domain. We employ a new tunable-Q decomposition defined in the frequency domain by which one can flexibly tune the bandwidth of decomposition channels. With an acceptable redundancy, this tunable-Q contourlet is also anti-aliasing and its basis is sharply localized in the desired area of frequency and spatial domain. Our experiments in nonlinear approximation and denoising show that the contourlet using a better-suitable quality factor can achieve a more promising performance and often outperform wavelets and the previous contourlets both in visual quality and in terms of peak signal-to-noise ratio. A novel tunable-quality-factor (tunable-Q) contourlet transform for geometric image representation is proposed. The Laplacian pyramid in original contourlet decomposes a signal into channels that have the same bandwidth on a logarithmic scale, and is not suitable for images with different behavior in frequency domain. We employ a new tunable-Q decomposition defined in the frequency domain by which one can flexibly tune the bandwidth of decomposition channels. With an acceptable redundancy, this tunable-Q contourlet is also anti-aliasing and its basis is sharply localized in the desired area of frequency and spatial domain. Our experiments in nonlinear approximation and denoising show that the contourlet using a better-suitable quality factor can achieve a more promising performance and often outperform wavelets and the previous contourlets both in visual quality and in terms of peak signal-to-noise ratio.
出处 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2013年第1期147-156,共10页 系统工程与电子技术(英文版)
基金 supported by the National Natural Science Foundation of China(40971173 41071188)
关键词 CONTOURLET quality factor (Q-factor) ANTI-ALIASING mul-tiscale decomposition. contourlet, quality factor (Q-factor), anti-aliasing, mul-tiscale decomposition.
  • 相关文献

参考文献1

二级参考文献20

  • 1练秋生,孔令富.圆对称轮廓波变换的构造[J].计算机学报,2006,29(4):652-657. 被引量:12
  • 2Easley G R, Labate D, Colonna F. Shearlet-based total variation diffusion for denoising[J]. IEEE Trans. on Image Processing,2009,18(2):260 -268.
  • 3Mustaffa I, Trenado C, Schwerdtfeger K, et al. Denoising of single-trial matrix representations using 2D nonlinear diffusion fiitering[J]. Journal of Neuroscience Methods, 2010, 185 (2) : 284 - 292.
  • 4Protter M, Elad M. hnage sequence denoising via sparse and redundant representations[J]. IEEE Trans. on Image Processing, 2009,18(1) 227 - 35.
  • 5Yu H, Zhao L, Wang H. Image denoising using trivariate shrinkage filter in the wavelet domain and joint bilateral filter in the spatial domain[J]. IEEE Trans. on Image Processing, 2009,18(10) :2364 - 2369.
  • 6Dore V, Cheriet M. Robust NL means filter with optimal pixelwise smoothing parameter for statistical image denoising[J]. IEEE Trans. on Signal Processing ,2009,57(5) : 1703 - 1716.
  • 7Gal Y, Mehnert A J H, Bradley A P, et al. Denoising of dynamic contrast enhanced MR images using dynamic nonlocal means[J]. IEEE Trans. on Medical Imaging, 2010,29(2) : 302 - 310.
  • 8Awate S P, Whitaker R T. Feature preserving MRI denoising: a nonparametric empirical Bayes approach[J]. IEEE Trans. on Medical Imaging ,2007,26(9) :1242 - 1255.
  • 9Luisier F, Blu T, Unser M. SURE LET for orthonormal wavelet domain video denoising[J]. IEEE Trans. on Circuits and Systems for Video Technology, 2010,20 (6) : 913 - 919.
  • 10Luisier F, Blu T. SURE-LET multichannel image denoising: inter scale orthonomlal wavelet thresholding[J]. IEEE Trans. on Image Processing, 2008,17 (4) : 482 - 492.

共引文献3

同被引文献11

引证文献1

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部