Exploiting Inter-pixel Coherence

Recall the measurement equation from last time:

\displaystyle C^T = (L^T B) \hat{T}

Suppose again that the responses of the pixels to each light source are coherent. That is, we may hope that there is a basis V such that the columns of \tilde{T}^T = V^T \hat{T}^T are sparse. Then, we have that

C^T = (L^T B) \tilde{T} V^T,

or

C^T V = (L^T B) \tilde{T}.


That is, as long as \tilde{T}‘s columns are sparse, we can infer it’s columns by working instead with the new measurements C^T V, which is basically C projected into V. One certainly hope that the columns of \tilde{T} are even sparser than the columns of \hat{T}. If so, the number of measurements can be reduced greatly. However, I’m not so sure about this myself when it comes to wavelets, which is the basis I’m most likely to use.

Again, one can see that a big bottleneck in the above equation: to compute C, we have to measure the color of every pixel of under every lighting condition used for measurement. And we know that measure the color of a pixel accurately takes a large number of rays. Actually, C^T V might be sparse in its rows. Can we acquire them with compressive sensing as well?

This entry was posted in computer graphics and tagged , . Bookmark the permalink.

Leave a comment