Hi,
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...