# Compressed Sensing

(Abhinav Katoch) #1

I’m having trouble understanding what is going on in this algorithm. Can someone explain in plain English

1. how we build the projection operator?
2. what does Linear Algebra have to do this problem? My gloss from reading around on the web is that we are trying to solve a linear system of equations Ax = b where the system is underdetermined. I guess this is why we use the L1 minimization to find the best solution instead of least squares but I haven’t been able to find a good explanation for how this works. Could someone help me out with this?

Thanks.

(Rachel Thomas) #2

Have you watched the beginning of video 8? I try to re-explain the compressed sensing problem there and I think I do a clearer job than in video 7.

A: is the projection matrix, based on the location and angles where the x-ray passes (for each of the k x-rays taken). These are unraveled to make a k by (l x l) matrix.

This is always the same and doesn’t depend on what is being x-rayed.

Each box below is flattened to be one row of the projection matrix:

x: what we’re solving for, the thing being x-rayed
b: intensities measured by the x-ray passing through what is being x-rayed