文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > 工程科技 > 信息与通信 > 贪婪算法与压缩感知理论
侵权投诉

贪婪算法与压缩感知理论

1420自

表2

Table2

动化学报37卷

100次高斯噪声测量下的重建时间和重建误差的比较

Thecomparisonofreconstructiontimeanderrorswith100timesGaussiannoise

ROMP

e0.13630.5635—

T(s)1.191.2811.343

e0.28791.47062.9046

T(s)0.4830.5150.516

SP

e0.13630.56351.5447

CoSaMPT(s)92.53192.07992.282

e0.15750.75341.7544

9.87510.42110.531

StOMPT(s)

e1.16815.563315.4059

方差OMPT(s)1.4061.454—

σ20.0010.0050.01

References

1DonohoDL.Compressedsensing.IEEETransactionsonInformationTheory,2006,52(4):1289 13062CandesEJ.Compressivesampling.In:ProceedingsoftheInternationalCongressofMathematics.Madrid,Spain:theEuropeanMathematicalSociety,2006.1433 14523DonohoDL,HuoX.Uncertaintyprinciplesandidealatomicdecompositions.IEEETransactionsonInformationTheory,2001,47(7):2845 28624DonohoDL,EladM.Optimallysparserepresentationingeneral(nonorthogonal)dictionariesviaL1minimization.ProceedingsoftheNationalAcademyofSciencesUSA,2003,100(5):2197 22025LaskaJN,KirolosS,DuarteMF,RaghebTS,BaraniukRG,MassoudY.Theoryandimplementationofananalog-to-informationconverterusingrandomdemodulation.In:Pro-ceedingsoftheIEEEInternationalSymposiumonCircuitsandSystems.NewOrleans,USA:IEEE,2007.1959 19626RaghebT,KirolosS,LaskaJ,GilbertA,StraussM,Bara-niukR,MassoudY.Implementationmodelsforanalog-to-informationconversionviarandomsampling.In:Proceed-ingsofthe50thSymposiumonCircuitsandSystems.Mon-treal,Canada:IEEE,2007.325 3287BajwaW,HauptJ,SayeedA,NowakR.Compressivewire-lesssensing.In:Proceedingsofthe5thInternationalCon-ferenceonInformationProcessinginSensorNetworks.NewYork,USA:IEEE,2006.134 1428ChenSB,DonohoDL,SaundersMA.Atomicdecomposi-tionbybasispursuit.SIAMJournalonScienti cComput-ing,1998,20(1):33 619FigueiredoMA,NowakRD,WrightSJ.Gradientpro-jectionforsparsereconstruction:applicationtocompressedsensingandotherinverseproblems.IEEEJournalofSe-lectedTopicsinSignalProcessing,2007,1(4):586 59710DaubechiesI,DefriseM,DeMolC.Aniterativethresh-oldingalgorithmforlinearinverseproblemswithasparsityconstraint.CommunicationsonPureandAppliedMathe-matics,2004,57(11):1413 145711BlumensathT,DaviesM.Iterativehardthresholdingfor

compressedsensing.AppliedandComputationalHarmonicAnalysis,2009,27(3):265 27412CaiJF,OsherS,ShenZW.LinearizedBregmaniterations

forcompressedsensing.MathematicsofComputation,2008,78(267):1515 153613YinW,OsherS,GoldfarbD,DarbonJ.Bregmaniterative

algorithmsforL1-minimizationwithapplicationstocom-pressedsensing.SIAMJournalonImagingSciences,2008,1(1):143 168

14OsherS,MaoY,DongB,YinWT.FastlinearizedBregman

iterationforcompressivesensingandsparsedenoising.Com-municationsinMathematicalSciences,2010,8(1):93 11115CaiJF,OsherS,ShenZW.Convergenceofthelinearized

BregmaniterationforL1-normminimization.MathematicsofComputation,2009,78(268):2127 213616GilbertAC,GuhaS,IndykP,MuthukrishnanS,Strauss

MJ.Near-optimalsparseFourierrepresentationsviasam-pling.In:Proceedingsofthe34thAnnualACMSympo-siumonTheoryofComputing.NewYork,USA:ACM,2000.152 16117GilbertA,StraussM,TroppJ,VershyninR.Algorithmic

lineardimensionreductionintheL1normforsparsevec-tors.In:Proceedingsofthe44thAnnualAllertonConfer-enceonCommunication,ControlandComputing.Allerton,USA:CurranAssociates,2006.1 918GormodeG,MuthukrishanS.Combinatorialalgorithmsfor

compressedsensing.In:Proceedingsofthe40thAnnualConferenceonInformationSciencesandSystems.Prince-ton,USA:IEEE,2006.280 29419GilbertA,StraussM,TroppJ,VershyninR.Onesketchfor

all:fastalgorithmsforcompressedsensing.In:Proceedingsofthe39thAnnualACMSymposiumonTheoryofCom-puting.NewYork,USA:ACM,2007.237 24620ZayyaniH,Babaie-ZadehM,JuttenC.Bayesianpursuital-gorithmforsparserepresentation.In:ProceedingsoftheIEEEInternationalConferenceonAcoustics,SpeechandSignalProcessing.Taipei,China:IEEE,2009.1549 155221BaronS,SarvohamR,BaraniukRG.Bayesiancompressive

sensingviabeliefpropagation.IEEETransactionsonSignalProcessing,2010,58(1):269 28022SeegerMW,SteinkeF,TsudaK.Bayesianinferenceandop-timaldesigninthesparselinearmodel.JournalofMachineLearningResearch-ProceedingsTrack,2007,2(6):444 45123WeissY,ChangHS,FreemanWT.Learningcompressed

sensing.In:Proceedingsofthe45thAllertonConferenceonCommunications,ControlandComputing.Illinois,USA:CurranAssociates,2007.1 724MallatS,ZhangZ.Matchingpursuitwithtime-frequency

dictionaries.IEEETransactionsonSignalProcessing,1993,41(12):3397 341525TroppJ,GilbertA.Signalrecoveryfromrandommeasure-mentsviaorthogonalmatchingpursuit.IEEETransactionsonInformationTheory,2007,53(12):4655 466626DonohoDL,TsaigY,DroriI,StarckJL.SparseSolu-tionofUnderdeterminedLinearEquationsbyStageWiseOrthogonalMatchingPursuit,TechnicalReportNo.2006-2,DepartmentofStatistics,StanfordUniversity,USA,2006

上一页第8页

你可能喜欢

热门文档

相关文档

  • 贪婪算法与压缩感知理论

    37, No. 12 December, 2011 贪婪算法与压缩感知理论方 红1 杨海蓉 2 摘要 贪婪算法以其重建速度快、 重建方法实现简便的特点在压缩感知 (Compressed sensing, ...

  • 一种基于贪婪基追踪算法的压缩感知超宽带信道估计方法

    因此,如何设计出计算复 杂度低、稳定且所需观测数较少的重构算法已成为目 前压缩感知理论的一个热点问题 [8]。 Huggins和Zucker等人于2006提出的贪婪基追踪算 法...

  • 压缩感知算法

    和 Candes 等人[1,2]在稀疏表 示和优化理论的基础上提出的一种成像理论。...模型化压缩感知重构算法利用贪婪搜索的方法 寻找最优小波系数子树集,而这些最优...

  • 一种贪婪自适应压缩感知重构

    10.3969/j.issn.1001-2400.2012.03.008 一种贪婪自适应压缩感知重构甘 伟 ...针对 CoSaMP 算法关于信号稀疏度的非自适应性问题, 本文通过采用具有理论保证的...

  • 一种贪婪自适应压缩感知重构

    0.9 9ji n 1 0-4 0.0 2.3.0 s 一种贪婪自适应压缩感知重构甘 伟, ...算法该 采用了具有理论保证的模糊阈值预选方案以 避免预选时使用信号的先验信息,...

  • 压缩感知理论及其重构算法

    压缩感知理论及其重构算法_工学_高等教育_教育专区。压缩感知算法...东莞理 工学院学报 年 匹配跟踪 算法匹 配跟 踪算法是一种迭代贪婪算法 , ...

  • 压缩感知理论及其重构算法

    12压 缩感 知信号表示 . 为 了避 免上 述缺点 ,压缩感知理论不需要获取J ...生QQ 匹配 跟 踪算 法 是一 种迭代贪婪算法 ,它 是通 过对一系列 的单 ...

  • 压缩感知理论(Compressive)

    压缩感知理论(Compressive)_IT/计算机_专业资料。压缩感知理论(Compressive ...(2)贪婪匹配追踪(MP)算法 :从字典中一 个一个挑选向量,每一步都使得信号的...

  • 压缩感知理论综述(原创)

    K X K 如何找到信号最佳的稀疏域?这是压缩感知理论应用的基础和前提,只有选择...由于 l1 最小范数下的算法 速度慢,新的快速贪婪法被逐渐采用,如匹配追踪法(...

  • 压缩感知原理

    连续边缘的图像信号的Curvelet系数等都具有足够的 稀疏性,可以通过压缩感知理论...在稀疏分解算法的设计方面,基于贪婪迭代思想的MP(Matching Pursuit)算法表现出 ...

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email