Sampling adaptive block compressed sensing reconstruction algorithm for images based on edge detection

被引：15

作者：

机构：

[1] School of Telecommunication and Information Engineering, Nanjing University of Posts and Telecommunications

来源：

Zheng, H.-B. (1012010638@njupt.edu.cn) | 1600年 / Beijing University of Posts and Telecommunications卷 / 20期

基金：

中国国家自然科学基金;

关键词：

block compressed sensing; directional transforms; edge detection; sampling-adaptive; variance;

D O I：

10.1016/S1005-8885(13)60056-4

中图分类号：

学科分类号：

摘要：

In this paper, a sampling adaptive for block compressed sensing with smooth projected Landweber based on edge detection (SA-BCS-SPL-ED) image reconstruction algorithm is presented. This algorithm takes full advantage of the characteristics of the block compressed sensing, which assigns a sampling rate depending on its texture complexity of each block. The block complexity is measured by the variance of its texture gradient, big variance with high sampling rates and small variance with low sampling rates. Meanwhile, in order to avoid over-sampling and sub-sampling, we set up the maximum sampling rate and the minimum sampling rate for each block. Through iterative algorithm, the actual sampling rate of the whole image approximately equals to the set up value. In aspects of the directional transforms, discrete cosine transform (DCT), dual-tree discrete wavelet transform (DDWT), discrete wavelet transform (DWT) and Contourlet (CT) are used in experiments. Experimental results show that compared to block compressed sensing with smooth projected Landweber (BCS-SPL), the proposed algorithm is much better with simple texture images and even complicated texture images at the same sampling rate. Besides, SA-BCS-SPL-ED-DDWT is quite good for the most of images while the SA-BCS-SPL-ED-CT is likely better only for more-complicated texture images. © 2013 The Journal of China Universities of Posts and Telecommunications.

引用

页码：97 / 103

页数：6

共 10 条

[1] Donoho D.L., Compressed sensing, IEEE Transactions on Information Theory, 52, 4, pp. 1289-1306, (2006)
[2] Baraniuk R., Compressive sensing, IEEE Signal Processing Magezine, 24, 4, pp. 118-121, (2007)
[3] Candes E., Wakin M., An introduction to compressive sampling: A sensing/sampling paradigm that goes against the common knowledge in data acquisition, IEEE Signal Processing Magazine, 25, 2, pp. 21-30, (2008)
[4] Donoho D.L., For most large underdetermined systems of linear equations, the minimal ell-1 norm near-solution approximates the sparsest near-solution, Communications on Pure and Applied Mathematics, 59, 7, pp. 907-934, (2006)
[5] Figueiredo M.A.T., Nowak R.D., Wright S.J., Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems, IEEE Journal of Selected Topics in Signal Processing, 1, 4, pp. 586-597, (2007)
[6] Do T.T., Gan L., Nguyen N., Et al., Sparsity adaptive matching pursuit algorithm for practical compressed sensing, Proceedings of the 42nd Asilomar Conference on Signals, Systems and Computers (ACSSC'08), Oct 26-29, 2008, Pacific Grove, CA, USA, pp. 581-587, (2008)
[7] Haupt J., Nowak R., Signal reconstruction from noisy random projections, IEEE Transactions on Information Theory, 52, 9, pp. 4036-4048, (2006)
[8] Gan L., Block compressed sensing of natural images, Proceedings of the 15th International Conference on Digital Signal Processing (DSP'07), Jul 1-4, 2007, Cardiff, UK, pp. 403-406, (2007)
[9] Mun S., Fowler J.E., Block compressed sensing of images using directional transforms, Proceedings of the 16th International Conference on Image Processing (ICIP'09), Nov 7-10, 2009, Cairo, Egypt, pp. 3021-3024, (2009)
[10] Fowler J.E., Mun S., Tramel E.W., Multiscale block compressed sensing with smoothed projected landweber reconstruction, Proceedings of the 19th European Signal Processing Conference (EUSIPCO'11), Aug 29-Sep 2, 2011, Barcelona, Spain, pp. 564-568, (2011)

← 1 →