# 5.2 Greedy algorithms  (Page 2/3)

 Page 2 / 3
$\begin{array}{cc}\hfill {x}_{k}& =arg\underset{x}{min}{\parallel y-{\Phi }_{\Omega }x\parallel }_{2},\hfill \\ \hfill {\stackrel{^}{\alpha }}_{t}& ={\Phi }_{\Omega }{x}_{t},\hfill \\ \hfill {r}_{t}& =y-{\stackrel{^}{\alpha }}_{t}.\hfill \end{array}$

These steps are repeated until convergence. This is known as Orthogonal Matching Pursuit (OMP)  [link] . Tropp and Gilbert  [link] proved that OMP can be used to recover a sparse signal with high probability using compressive measurements. The algorithm converges in at most $K$ iterations, where K is the sparsity, but requires the added computational cost of orthogonalization at each iteration. Indeed, the total complexity of OMP can be shown to be $O\left(MNK\right).$

While OMP is provably fast and can be shown to lead to exact recovery, the guarantees accompanying OMP for sparse recovery are weaker than those associated with optimization techniques . In particular, the reconstruction guarantees are not uniform , i.e., it cannot be shown that a single measurement matrix with $M=CKlogN$ rows can be used to recover every possible $K-$ sparse signal with $M=CKlogN$ measurements. (Although it is possible to obtain such uniform guarantees when it is acceptable to take more measurements. For example, see [link] .) Another issue with OMP is robustness to noise; it is unknown whether the solution obtained by OMP will only be perturbed slightly by the addition of a small amount of noise in the measurements. Nevertheless, OMP is an efficient method for CS recovery, especially when the signal sparsity $K$ is low. A pseudocode representation of OMP is shown below.

Inputs: Measurement matrix $\Phi$ , signal measurements $y$ Outputs: Sparse representation $\stackrel{^}{x}$ Initialize: ${\stackrel{^}{\theta }}_{0}=0$ , $r=y$ , $\Omega =\varnothing$ , $i=0$ . while ħalting criterion false do 1. $i←i+1$ 2. $b←{\Phi }^{T}r$ {form residual signal estimate} 3. $\Omega ←\Omega \cup \mathrm{supp}\left(\mathbf{T}\left(b,1\right)\right)$ {add index of residual's largest magnitude entry to signal support} 4. ${\stackrel{^}{x}}_{i}{|}_{\Omega }←{\Phi }_{\Omega }^{†}x$ , ${\stackrel{^}{x}}_{i}{|}_{{\Omega }^{C}}←0$ {form signal estimate} 5. $r←y-\Phi {\stackrel{^}{x}}_{i}$ {update measurement residual} end while return $\stackrel{^}{x}←{\stackrel{^}{x}}_{i}$ 

## Stagewise orthogonal matching pursuit (stomp)

Orthogonal Matching Pursuit is ineffective when the signal is not very sparse as the computational cost increases quadratically with the number of nonzeros $K$ . In this setting, Stagewise Orthogonal Matching Pursuit (StOMP)  [link] is a better choice for approximately sparse signals in a large-scale setting.

StOMP offers considerable computational advantages over ${\ell }_{1}$ minimization and Orthogonal Matching Pursuit for large scale problems with sparse solutions. The algorithm starts with an initial residual ${r}_{0}=y$ and calculates the set of all projections ${\Phi }^{T}{r}_{k-1}$ at the ${k}^{th}$ stage (as in OMP). However, instead of picking a single dictionary element, it uses a threshold parameter $\tau$ to determine the next best set of columns of $\Phi$ whose correlations with the current residual exceed $\tau$ . The new residual is calculated using a least squares estimate of the signal using this expanded set of columns, just as before.

Unlike OMP, the number of iterations in StOMP is fixed and chosen before hand; $S=10$ is recommended in [link] . In general, the complexity of StOMP is $O\left(KNlogN\right)$ , a significant improvement over OMP. However, StOMP does not bring in its wake any reconstruction guarantees. StOMP also has moderate memory requirements compared to OMP where the orthogonalization requires the maintenance of a Cholesky factorization of the dictionary elements.

how do we prove the quadratic formular
hello, if you have a question about Algebra 2. I may be able to help. I am an Algebra 2 Teacher
thank you help me with how to prove the quadratic equation
Seidu
may God blessed u for that. Please I want u to help me in sets.
Opoku
what is math number
4
Trista
x-2y+3z=-3 2x-y+z=7 -x+3y-z=6
Need help solving this problem (2/7)^-2
x+2y-z=7
Sidiki
what is the coefficient of -4×
-1
Shedrak
the operation * is x * y =x + y/ 1+(x × y) show if the operation is commutative if x × y is not equal to -1
An investment account was opened with an initial deposit of $9,600 and earns 7.4% interest, compounded continuously. How much will the account be worth after 15 years? Kala Reply lim x to infinity e^1-e^-1/log(1+x) given eccentricity and a point find the equiation Moses Reply 12, 17, 22.... 25th term Alexandra Reply 12, 17, 22.... 25th term Akash College algebra is really hard? Shirleen Reply Absolutely, for me. My problems with math started in First grade...involving a nun Sister Anastasia, bad vision, talking & getting expelled from Catholic school. When it comes to math I just can't focus and all I can hear is our family silverware banging and clanging on the pink Formica table. Carole I'm 13 and I understand it great AJ I am 1 year old but I can do it! 1+1=2 proof very hard for me though. Atone Not really they are just easy concepts which can be understood if you have great basics. I am 14 I understood them easily. Vedant hi vedant can u help me with some assignments Solomon find the 15th term of the geometric sequince whose first is 18 and last term of 387 Jerwin Reply I know this work salma The given of f(x=x-2. then what is the value of this f(3) 5f(x+1) virgelyn Reply hmm well what is the answer Abhi If f(x) = x-2 then, f(3) when 5f(x+1) 5((3-2)+1) 5(1+1) 5(2) 10 Augustine how do they get the third part x = (32)5/4 kinnecy Reply make 5/4 into a mixed number, make that a decimal, and then multiply 32 by the decimal 5/4 turns out to be AJ how Sheref A soccer field is a rectangle 130 meters wide and 110 meters long. The coach asks players to run from one corner to the other corner diagonally across. What is that distance, to the nearest tenths place. Kimberly Reply Jeannette has$5 and \$10 bills in her wallet. The number of fives is three more than six times the number of tens. Let t represent the number of tens. Write an expression for the number of fives.
What is the expressiin for seven less than four times the number of nickels
How do i figure this problem out.
how do you translate this in Algebraic Expressions
why surface tension is zero at critical temperature
Shanjida
I think if critical temperature denote high temperature then a liquid stats boils that time the water stats to evaporate so some moles of h2o to up and due to high temp the bonding break they have low density so it can be a reason
s.
Need to simplify the expresin. 3/7 (x+y)-1/7 (x-1)=
. After 3 months on a diet, Lisa had lost 12% of her original weight. She lost 21 pounds. What was Lisa's original weight?
Got questions? Join the online conversation and get instant answers!