Computer Science ›› 2018, Vol. 45 ›› Issue (4): 306-311.doi: 10.11896/j.issn.1002-137X.2018.04.052

Previous Articles     Next Articles

Support Similarity between Lines Based CoSaMP Algorithm for Image Reconstruction

DU Xiu-li, GU Bin-bin, HU Xing, QIU Shao-ming and CHEN Bo   

  • Online:2018-04-15 Published:2018-05-11

Abstract: The performance of compressive sampling matching pursuit(CoSaMP) is restricted to the choice of its initial support set. Choosing initial support set inaccurately will not only affect the accuracy of recons itution,but also reduce the speed of reconstruction.In order to solve this problem,the stucture of image in sparse domain was introduced into CoSaMP algorithm,and the concept of support set similarity was presented.Then CoSaMP algorithm based on support similarity between lines was proposed and the high similarity between the adjoining rows in one digital image was used.The results of this experiment show that the proposed algorithm has higher quality in reconstruction without increa-sing the time complexity of algorithm,and the peak signal-to-noise ratio enhances 0.6~2.5dB compared with the traditional CoSaMP algorithm under the same condition of sampling frequency.

Key words: Compressive sensing,Greedy algorithm,Compressive sampling matching pursuit,Sparse support,Similarity

[1] CAND S E.Compressive sampling[C]∥International Congress of Mathematicians.Madrid,Spain,2006:1433-1452.
[2] DONOHO D L.Compressed sensing[J].IEEE Transactions on Information Theory,2006,2(4):1289-1306.
[3] DONOHO D L,TSAIG Y.Extensions of compressed sensing[J].Signal Processing,2006,6(3):533-548.
[4] JING M L,ZHOU X Q,QI C.Quasi-Newton Iterative Projection Algorithm for Sparse Recovery[J].Neurocomputing,2014,4(20):169-173.
[5] FANG H,YANG H R.Greedy algorithm and compression perception theory[J].Journal of Automation,2011,2(37):1413-1421.(in Chinese) 方红,杨海荣.贪婪算法与压缩感知理论[J].自动化学报,2011,2(37):1413-1421.
[6] WANG J,KWON S,SHIM B.Generalized orthogonal matching pursuit[J].IEEE Transactions on Signal Processing,2012,0(2):6202-6216.
[7] DAS B K,CHAKRABORTY M.Sparse Adaptive Filtering by an Adaptive Convex Combination of the LMS and the ZA-LMS Algorithms[J].IEEE Transactions on Circuits and Systems-I:Regular Papers,2014,61(5):1499-1507.
[8] NEEDELL D,TROPP J A.CoSaMP:Iterative signal recovery from incomplete and inaccurate samples[J].Applied and Compatational Harmonic Analysis,2008,6(3):301-321.
[9] ZHANG X W,LI M,ZUO L.Based on SWCoSaMP algorithm for sparse signal reconstruction[J].Signal Processing,2012,28(6):886-893.(in Chinese) 张晓伟,李明,左磊.基于SWCoSaMP算法的稀疏信号重构[J].信号处理,2012,8(6):886-893.
[10] DAVENPORT M A,NEEDELL D,WAKIN M B.Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries[J].IEEE Transactions on Information Theory,2013,9(10):6820-6829.
[11] GIRYES R,ELAD M.RIP-Based Near-Oracle PerformanceGuarantees for SP,CoSaMP,and IHT[J].IEEE Transactions on Signal Processing,2012,0(3):1465-1468.
[12] LIANG D Y,LI H W,LI Q,et al.An Improved Compression-aware Reconstruction Algorithm[J].Computer Simulation,2014,1(9):310-313.(in Chinese) 梁丹亚,李宏伟,李琦,等.一种改进的压缩感知重构算法[J].计算机仿真,2014,1(9):310-313.
[13] LI X X,WEI Z H,XIAO L.Compressed Sensing ImageSeuqence Reconstruction Algorithm Based on Sparse Support Prior[J].Journal of Nanjing University of Science and Techno-logy (Natural Science Edition),2012,6(6):973-978.(in Chinese) 李星秀,韦志辉,肖亮.基于稀疏支撑集先验的压缩感知图像序列重构算法[J].南京理工大学学报(自然科学版),2012,6(6):973-978.
[14] XIN Y H,LIN Y.Improved Compression Sampling MatchingTracking Algorithm [J].Journal of Computer Applications,2015,5(S1):331-334.(in Chinese) 刑岩辉,林云.改进的压缩采样匹配追踪算法[J].计算机应用,2015,5(S1):331-334.
[15] 胡学龙.数字图像处理(第三版)[M].北京:电子工业出版社,2014.
[16] ZHANG F Z,ZHAO R Z,CEN Y G,et al.Sparse difference degree adaptive reconstruction algorithm[J].Journal of Computer Aided Design and Computer Graphics,2015,7(6):1047-1052.(in Chinese) 张凤珍,赵瑞珍,岑翼刚,等.基于差分的稀疏度自适应重构算法[J].计算机辅助设计与图形学学报,2015,7(6):1047-1052.
[17] DING H,WANG Y,YUAN L,et al.A new greedy backtracking subspace tracking algorithm[J].Computer Application Research,2017,4(10):144-153.(in Chinese) 丁函,王毅,袁磊,等.一种新的贪婪回溯子空间追踪算法研究[J].计算机应用研究,2017,34(10):144-153.
[18] LI Z M.L1 norm based fully variational regularized super-resolution reconstruction algorithm[J].Computer Engineering and Application,2016,2(15):212-216.(in Chinese) 李志明.基于L1范数的全变分正则化超分辨率重构算法[J].计算机工程与应用,2016,2(15):212-216.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] . [J]. Computer Science, 2018, 1(1): 1 .
[2] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[3] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[4] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[5] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[6] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[7] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[8] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[9] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[10] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .