Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Compressed Sensing: Matching Pursuit

  1. Mar 18, 2012 #1

    I need a geometric explanation for this algorithm: Suppose we have the system Ax=b, where A is and M-by-N matrix, x is N-dimensional s(<<N)-sparse vector, and b is M-dimensional vector. There is an algorithm called Matching Pursuit to solve the above system efficiently:

    1- Find the column of A that best match b.
    2- The projection of b along that direction is removed and an updated b is obtained.
    3- Repeat 1 and 2 until some termination criterion is met.

    How these 3 steps solve the above system of linear equations?

    Thanks in advance
  2. jcsd
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?
Draft saved Draft deleted

Similar Discussions: Compressed Sensing: Matching Pursuit
  1. 6 Matches (Replies: 8)