ZHANG Zongnian1, LIN Shengxin1, MAO Huanzhang2, HUANG Rentai2
1. School of Electronic Engineering, Dongguan University of Technology, Dongguan Guangdong 523808, China;
2. School of Computer, Dongguan University of Technology, Dongguan Guangdong 523808, China
As subspace pursuit algorithm under cosparsity analysis model in compressed sensing has the shortcomings of low completely successful reconstruction probability and poor reconstruction performance, a cosparsity analysis subspace pursuit algorithm was proposed. The proposed algorithm was realized by adopting the selected random compact frame as the analysis dictionary and redesigning target optimization function. The selecting method of cosparsity value and the iterated process were improved. The simulation experiments show that the proposed algorithm has obviously higher completely successful reconstruction probability than that of Analysis Subspace Pursuit (ASP) and other five algorithms, and has higher comprehensive average Peak Signal-to-Noise Ratio (PSNR) for the reconstructed signal than that of ASP and other three algorithms, but a little bit lower than that of Gradient Analysis Pursuit (GAP) and other two algorithms when the original signal has Gaussion noise. The new algorithm can be used in audio and image signal processing.
ELAD E, MILANFAR P, RUBINSTEIN R. Analysis versus synthesis in signal priors[J]. Inverse Problems,2007,23(3):947-968.
[2]
CANDES E J, ELADAR Y C, NEEDEL D. Compressed sensing with coherent and redundant dictionaries [J]. Applied and Computational Harmonic Analysis, 2011, 31(1):59-73.
[3]
RAUHUT H, SCHNASS K, VANDERHEYNEST P. Compressed sensing and redundant dictionaries [J]. IEEE Transactions on Information Theory, 2008,54(5):2210-2219.
[4]
CANDES E J, TAO T. Near-optimal signal recovery from random projections: universal encoding strategies?[J]. IEEE Transactions on Information Theory,2006,52(12):5406-5425.
[5]
ZHANG Z, HUANG R, YAN J. A blind reconstruction algorithm for compressed sensing signal[J]. Acta Electronica Sinica, 2011,39(1):18-21.(张宗念,黄仁泰,闫敬文.压缩感知盲稀疏度重构算法[J].电子学报,2011,39(1):18-21.)
[6]
FOUCART S. Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants[C]// Proceedings of Approximation Theory XIII. Piscataway: IEEE, 2012,13:65-77.
[7]
NAM S, DAVIS M, ELAD M, et al. Cosparse analysis modeling[C]// Proceedings of the 2011 IEEE International Conference on Acoustics, Speech and Signal Processing. Piscataway: IEEE, 2011:5804-5807.
[8]
LIU X, LI Y, LI C, et al. One projection subspace pursuit for signal reconstruction in compressed sensing[J]. Journal of Computer Applications,2014,34(9):2514-2517.(刘小青,李有明,李程程,等. 基于一次投影子空间追踪的压缩感知信号重构[J].计算机应用,2014,34(9):2514-2517.)
[9]
LIU X, GAO X, ZHOU D. l2-total variation image restoration based on subspace optimization[J]. Journal of Computer Applications, 2013,33(4):1112-1114.(刘晓光,高兴宝,周冬梅.基于子空间优化的l2-总变分图像恢复[J].计算机应用, 2013,33(4):1112-1114.)
[10]
DAI W, MILENKOVIC O. Subspace pursuit for compressive sensing signal reconstruction[J]. IEEE Transactions on Information Theory, 2009,55(5):2230-2249.
[11]
NAM S, DAVIS M E, ELAD E, et al. The cosparse analysis model and algorithms [J]. Applied and Computational Harmonic Analysis,2013,34(1): 30-56.
[12]
GIRYES R, NAM S, GRIBONVAL R. Iterative cosparse projection algorithms for the recovery of cosparse vectors[EB/OL]. [2012-10-10]. https://hal.inria.fr/inria-00611592/file/1569427149.pdf.
[13]
BLUMENSATH T, DAVIS M. Iterative hard thresholding for compressed sensing[J]. Applied and Computational Harmonic Analysis,2009, 27(3):265-274.
[14]
FOUCART S. Hard thresholding pursuit: an algorithm for compressive sensing[J]. SIAM Journal on Numerical Analysis, 2011,49(6):2543-2563.
[15]
LIU X, FENG X, YU H. Group mosquito host seeking algorithm [J]. Journal of Computer Applications, 2014,34(4):1055-1059.(刘晓婷,冯翔,虞慧.群蚊子追踪算法[J].计算机应用,2014,34(4):1055-1059.)
[16]
WU T, CHEN L, GUO G. High-dimensional data clustering algorithm with subspace optimization [J]. Journal of Computer Applications, 2014, 34(8):2279-2284.(吴涛,陈黎飞,郭躬德.优化子空间的高维聚类算法[J].计算机应用,2014, 34(8):2279-2284.)
[17]
LU Y M, DO M N. A theory for sampling signals from a union of subspaces [J]. IEEE Transactions on Signal Processing, 2008,56(6):2334-2345.
[18]
BLUMENSATH T, DAVIES E. Sampling theorems for signals from the union of finite-dimensional linear subspaces[J]. IEEE Transactions on Information Theory, 2009,55(4):1872-1882.
[19]
GIRYES R, NAM S, ELAD M. CoSamp and SP for the cosparse analysis model[C]// Proceedings of the 20th European Signal Processing Conference. Piscataway: IEEE Press, 2012:964-968.
[20]
GIRYES R, NAM S, ELAD M. Greedy-like algorithm for the cosparse analysis model [J]. Special Issue in LAA on Sparse Approximate solution of Linear Systems, 2012(7):22-60.
2015, Vol. 35 
