You can use FFT or cosine-transform (which is probably easier). But, you might be right about the size of the kernel affecting the usefullness of the transform.
/ Marcus Agehall (PacketFront)
Previous text:
2004-08-26 17:45: Subject: nice-to-have-function
(I assume that when you say "transform", you mean "fourier-transform") Transforming/multiplying/transforming is only faster for fairly large kernels. Weather it is more accurate or not depends on what you're doing, and on the size of the kernel and transforms.
When it comes right down to it, I don't really care *how* it does it.
/ Fredrik (Naranek) Hubinette (T minus 2 weeks)