Sparse Recovery With Orthogonal Matching Pursuit Under RIP

Sparse Recovery With Orthogonal Matching Pursuit Under RIP

ID:41220830

大小:188.48 KB

页数:7页

时间:2019-08-19

Sparse Recovery With Orthogonal Matching Pursuit Under RIP_第1页
Sparse Recovery With Orthogonal Matching Pursuit Under RIP_第2页
Sparse Recovery With Orthogonal Matching Pursuit Under RIP_第3页
Sparse Recovery With Orthogonal Matching Pursuit Under RIP_第4页
Sparse Recovery With Orthogonal Matching Pursuit Under RIP_第5页
资源描述:

《Sparse Recovery With Orthogonal Matching Pursuit Under RIP》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、IEEETRANSACTIONSONINFORMATIONTHEORY,VOL.57,NO.9,SEPTEMBER20116215SparseRecoveryWithOrthogonalMatchingPursuitUnderRIPTongZhang,Member,IEEEAbstract—Thispaperpresentsanewanalysisfortheorthog-onalmatchingpursuit(OMP)algorithm.Itisshownthatifthere-strictedisometryproperty(RIP)issatisfiedatsparsityl

2、evel,thenOMPcanstablyrecovera-sparsesignalin2-normundermeasurementnoise.Forcompressedsensingapplications,thisre-sultimpliesthatinordertouniformlyrecovera-sparsesignalin,onlyrandomprojectionsareneeded.Thisanal-ysisimprovessomeearlierresultsonOMPdependingonstrongerconditio

3、nsthatcanonlybesatisfiedwithorrandomprojections.IndexTerms—Estimationtheory,featureselection,greedyalgo-Fig.1.Fullycorrectivegreedyboostingalgorithm(OMP).rithms,statisticallearning,sparserecovery.However,thisoptimizationproblemisgenerallyNP-hard.I.INTRODUCTIONThereforeoneseeksc

4、omputationallyefficientalgorithmsthatONSIDERasignal,andsupposethatweobservecanapproximatelysolve(3),withthegoalofrecoveringsparseCitslineartransformationplusmeasurementnoiseassignal.Thispaperconsidersthepopularorthogonalmatchingpursuitalgorithm(OMP),whichhasbeenwidelyusedforthispurpose(forexam

5、ple,see[5],[14],[15]).Wearespecificallyinterestedintwoissues:theperformanceofOMPintermsHere,isanmatrix.IfwedefineanobjectivefunctionofoptimizingandtheperformanceofOMPintermsofrecoveringthesparsesignal.(1)thenwemayestimatetheparameterbyminimizing,II.MAINRESULTsubjecttoappropriateconstraints.Oura

6、nalysisconsidersamoregeneralobjectivefunctionIf,thenthesolutionoftheunconstrainedoptimizationthatdoesnotnecessarilytakethequadraticformin(1).problemHowever,weassumethatisconvex.Forsuchageneralconvexobjectivefunction,weconsiderthefully(ortotally)(2)correctivegreedyalgorithminFig.1,whichwasanal

7、yzedin[13].Thispaperrefinestheanalysistoshowthatthealgorithmisnotunique.Inordertoestimate,additionalassumptionsonworksundertherestrictedisometryproperty(RIP)of[3](theisnecessary.Wearespecificallyinterestedinthecasewhererequiredconditionwillbede

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。