Hi,
today I had look at the code in gaussian.c, which (to my surprise) is
not just a straight-forward implementation of a Gaussian filter.
After some google search I realized that several approximate algorithms
exist that are able to approximate a Gaussian filter within a computing
time that is independent of the kernel's support (the width of the
Gaussian). Presumably the algorithm that is implemented in darktable is
such an algorithm. But I still do not have a clue how it works. Any
pointers to the literature? Which algorithm has been implemented in
gaussian.c?
Regards,
Heiko
--
-- Number Crunch Blog @ https://www.numbercrunch.de
-- Cluster Computing @ https://www.clustercomputing.de
-- Social Networking @ https://www.researchgate.net/profile/Heiko_Bauke
___________________________________________________________________________
darktable developer mailing list
to unsubscribe send a mail to darktable-dev+unsubscr...@lists.darktable.org
