On Mar 10, 2009, at 8:56 AM, Nicolas Robidoux wrote:
Hello Rahul:
i m a student and interested in gsoc project:Fast Adaptive Resampler
Tailored For Transformations Which Mostly Downsample
I have read the requirements properly for this project which also
includes jacobian
Hello Craig:
Numerical Jacobian calculation is not so bad in terms of coding effort
The issue is that, if I understand correctly, GEGL's current pure
demand-driven structure means that resamplers have no information
whatsoever about what other nearby locations are being resampled, and
Hello Rahul:
Indeed, the GSoC I suggested can be roughly described as implementing
a poor man's version of the scheme Craig describes in
http://adsabs.harvard.edu/abs/2004SoPh..2193D
Replace circles/ellipses by parallelograms/rectangles, and notice that
padding the singular values of the
This being said, what I have in mind in way simpler than what Craig
implemented. But if you understand Craig's paper, you probably
understand what I want to do.
Actually, if I took the time to completely understand Craig's paper, I
probably would understand what I want to do.
;-)
Nicolas
Rahul:
exact area box filtering with sides no less than the input image's
inter-pixel distance
This was a bit terse:
Exact area box filtering with a square box with diameter equal to the
inter-pixel distance is exactly bilinear interpolation. So, it's only
when the sides are larger than the
