I understand what h_l^T h_l and h_c^T h_c do and how to apply the resulting matrices. However, I do not understand how the author arrived at the ‘unseparable’ matrices in (3.6). Reading the references paper [32] did not help too much.
Is anyone here who can clear up the confusion, and possibly show me how this could be extended to even larger filters (just for fun)?
@Thanatomanic Roel, is the 7x7 kernel in 3.6) meant to be for the green channel of a bayer array?
If that’s the case, It looks wrong… and the 3x3 kernel as well
@heckflosse Are you saying this is not the way to interpolate missing color values in a Bayered image?
x x x x x x x x
x B x B x B x B
x x x x * x x x
x B x B x B x B
To find the B component of the marked (*) pixel, you can use the bilinear 3x3 kernel and look at the surrounding blue values and simply take the average. That is basically what equation (10) below tells me:
And that works similar for the other channels.
I kind of understand why the green channel must be different, because there are two G-pixels in a single Bayer-block. But I don’t understand at all how to derive the matrix. And for the more complicated case you can use a 7x7 bicubic kernel. The principle is the same, but again, I would like to understand how those matrices are derived.