https://bugs.kde.org/show_bug.cgi?id=425190
--- Comment #21 from Claudius Ellsel <claudius.ell...@live.de> --- (In reply to Roman Gilg from comment #20) > Interesting comparison. Linear looks to me even better. Might there be other > algorithms improving upon that though? Yes, there might. Although from what I read NoHalo in GIMP already seems to do a pretty decent job for most cases (https://www.gimpusers.com/system/tutorial_steps/3061/sampling-original.jpg), although that might not cover the special use case of KDE. There seems to have also been a LoBlur algorithm be planned for GIMP (https://www.gimpusers.com/tutorials/whats-new-in-gimp-2-10 point 4) in 2012, which is not available today. Since GIMP is probably only using known approaches, there might be already at least theoretical algorithms out there for this use case. Also another reference for the NoHalo algorithm in GIMP: http://libregraphicsworld.org/blog/entry/advanced-samplers-for-gegl-to-be-crowdfunded -- You are receiving this mail because: You are watching all bug changes.
