Image Compressed Sensing based on universal HMT of the dual-tree wavelets

被引：1
|
作者：
Lian Q.-S. [1 ]
Wang Y. [1 ]
机构：
[1] Institute of Information Science and Technology, Yanshan University
来源：
Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology | 2010年 / 32卷 / 10期
关键词：
Alternating convex projection; Compressed Sensing (CS); Dual-tree wavelet; Model-based CS; UHMT model;
D O I：
10.3724/SP.J.1146.2009.01153
中图分类号：
学科分类号：
摘要：
The standard Compressed Sensing (CS) reconstructions of image exploit simply the sparse priors of the wavelet coefficients, ignoring the structural information of the wavelet coefficients. In this paper, the Hidden Markov Tree (HMT) model is integrated in the compressed sensing, which has been found successful in capturing the key features of the joint probability density of the wavelet coefficients of real-world image. An optimization issue which is similar to the standard compressed sensing is derived from the MAP reconstructions for the image based on HMT model, and an alternating convex projection algorithm based on Bayesian optimization is proposed. What's more, a universal HMT (uHMT) model based on the dual-tree wavelet transform and its improved form are integrated to improve the reconstruction performance further, instead of the HMT model of the orthogonal wavelet transform. As the experiments show, the average Peak Signal-to-Noise Ratio (PSNR) of the reconstructed image based on the improved uHMT (iuHMT) model in the dual-tree wavelets domain outperforms uHMT model 0.97 dB.
引用
收藏
页码：2301 / 2306
页数：5
相关论文
共 18 条
  • [1] Donoho D.L., Compressed sensing, IEEE Transactions on Information Theory, 52, 4, pp. 1289-1306, (2006)
  • [2] Candes E.J., Romberg J.T., Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, IEEE Transactions on Information Theory, 52, 2, pp. 489-509, (2006)
  • [3] Blumensath T., Davies M.E., Iterative thresholding for sparse approximations, Journal of Fourier Analysis and Applications, 14, 5, pp. 629-654, (2008)
  • [4] Bregman L.M., The method of successive projection for finding a common point of convex sets, Soviet Math, 6, 3, pp. 688-692, (1965)
  • [5] Chartrand R., Yin W., Iteratively reweighted algorithms for compressive sensing, IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 3869-3872, (2008)
  • [6] Chartrand R., Exact reconstruction of sparse signals via nonconvex minimization, IEEE Signal Processing Letters, 14, 10, pp. 707-710, (2007)
  • [7] Mohimani G.H., Babaie-Zadeh M., Jutten C., A fast sparse approach for overcomplete sparse decomposition based on smoothed l<sub>0</sub> norm, IEEE Transactions on Signal Processing, 57, 1, pp. 289-301, (2009)
  • [8] Needell D., Tropp J.A., CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, Applied and Computational Harmonic Analysis, 26, 3, pp. 301-321, (2008)
  • [9] Needell D., Vershynin R., Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit, Foundations of Computational Mathematics, 9, 3, pp. 317-334, (2009)
  • [10] Baraniuk R.G., Volkan C., Marco T.D., Et al., Model-Based compressive sensing, IEEE Transactions on Information Theory, 56, 4, pp. 1982-2001, (2010)
12