Ask Your Question

filter2D implementation details

asked 2016-02-11 08:24:06 -0500

pmousoul gravatar image


Is it possible to have a more detailed description of the implementation of the filter2D() function?

Browsing and checking the source code I understood that in general it does the following:

if (kernel_size > some_threshold) then do correlation using dft(). else compute filtering using recursion.

But in both cases (using dft() or recursion), I'm unable to follow what the code actually does - what is the exact implementation.

So, can anyone provide a description of the implementation in each case using some high level pseudocode (or even a list of well defined steps)?

If the implementation in each case (using dft() or recursion) depends on some literature (books, papers), could anyone provide these literature sources?

Thanks in advance, Panos

edit retag flag offensive close merge delete

1 answer

Sort by ยป oldest newest most voted

answered 2016-02-11 15:47:20 -0500

Tetragramm gravatar image

Here's how the FFT version works.

edit flag offensive delete link more

Question Tools

1 follower


Asked: 2016-02-11 08:24:06 -0500

Seen: 1,157 times

Last updated: Feb 11 '16