收稿日期: 2016-05-10
修回日期: 2016-06-06
网络出版日期: 2016-12-01
基金资助
国家自然科学基金资助项目( 61471173)
An Approximate Message Passing Algorithm with Composite Sparse Constraint for CS Reconstruction
Received date: 2016-05-10
Revised date: 2016-06-06
Online published: 2016-12-01
Supported by
Supported by the National Natural Science Foundation of China( 61471173)
谢中华 马丽红 钟福平 . 基于复合稀疏约束的近似消息传递CS 重构算法[J]. 华南理工大学学报(自然科学版), 2017 , 45(1) : 18 -25 . DOI: 10.3969/j.issn.1000-565X.2017.01.003
In CS reconstruction,approximate message passing ( AMP) can realize the reconstruction of sparse signals quickly and accurately by performing both wavelet de-noising and residual updating iteratively.However,the sparse constraints of the wavelet coefficients used in AMP are not suitable for non-sparse natural images,especially when the measuring process of CS is disturbed by noises.In order to solve this problem,aCS image reconstruction algorithm is proposed on the basis of composite sparse constraints and an AMP framework.This algorithm takes both the low-rank constraint of similar image patches and the bilateral filter constraint as the joint prior information of natural images to enhance the recovery effect of image textures and edges,thus improving the performance of the algorithm.The results of the reconstruction experiment with no noise in the measuring process of CS show that,the proposed algorithm averagely improves PSNR( Peak Signal to Noise Ratio) by 0.45dB and 6.19dB,respectively in comparison with the AMP algorithm that only uses low-rank constraint and the original AMP algorithm.While in the presence of noise,the corresponding average PSNR gains are respectively 0.25 dB and 4.60 dB.In conclusion,the proposed algorithm can achieve a better visual quality whether it is noiseless or not.
/
| 〈 |
|
〉 |