Am Donnerstag, 12. Oktober 2017, 00:23:42 CEST schrieb Aurélien PIERRE: > Hi ! > > I understand the performance concerns and I'm working on some trade off. > But…
[...] > 3 - The most computation-demanding operation is convolution product (2 > FFT-convolve by non blind iteration, 4 by blind iteration). The good > news is we don't need to compute them on the whole picture (it's > actually bad when you have a large bokeh area) and you can/should mask > the area of interest and do the computations only on it. It saves a lot > of time and gives better results on some cases. How big is the data this step computes? If it's just a few values required to process the whole image with afterwards and not changing once it's been computed, then we could easily have a button in the module that does the heavy lifting once for the image and stores it in its params. Similar to what "color mapping" does. Provided the rest of the computations that just use the values computed here are fast, we don't have to worry too much how long a one-time operation takes. [...] > Thanks for your interest ! > > *Aurélien PIERRE* > aurelienpierre.com <http://aurelienpierre.com> Tobias [...]
signature.asc
Description: This is a digitally signed message part.
