omp matlab,Orthogonal Matching Pursuit Algorithm (OMP)

Orthogonal Matching Pursuit Algorithm (OMP) is a greedy compressed sensing recovery algorithm which selects the best fitting column of the sensing matrix in each iteration. A least squares (LS) optimization is then performed in the subspace spanned by all previously picked columns. This method is less accurate than the Basis pursuit algorithms but has a lower computational complexity. The Matlab function has three inputs: Sparsity K, measurements vector y and sensing matrix A. The output of this function is the recovered sparse vector x.

Cite As

Mohamed Shaban (2021). Orthogonal Matching Pursuit Algorithm (OMP) (https://www.mathworks.com/matlabcentral/fileexchange/50584-orthogonal-matching-pursuit-algorithm-omp), MATLAB Central File Exchange.

Retrieved March 17, 2021.

Comments and Ratings (23)

29 Jun 2020

26 Sep 2019

Least Squares 为什么后面还要写这个 感觉不太明白 请问有没有这个程序的理论 我参照的问文献比较浅 没有很多步骤 到上面那个残差迭代就完成了 所以我想要这个程序的解释 麻烦了 刚刚才开始学习这个东西 很多都不明白

26 Aug 2019

Hi Can you please clarify how are you running loops on 1 to K, because K will always have values less than 1 i.e in fractional values. In my case its 0.9375

I am not able to use the zeroes also with dimensions m and K as K is not an integer.

Do you suggest taking the greatest integer function for K for implementing the Zeroes and running the loops?

26 Dec 2018

what is the K mean?

Kindly give a little bit of explanation about how it is different from matching pursuit.

What should we take as mesurement vector y. If I will use this code for face recognition..??

What should we take as mesurement vector y. If I will use this code for face recognition..??

12 Jul 2016

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值