Hi,

thanks for your suggestions! The js approach doesn’t give me any speedup on my machine, unfortunately.

I’d like to try the java one, but that will require a bit of research on my part^^

I did some test yesterday and found that I can do the operation quite fast by generating a 4k, 8 bit image template of 1’s and 0’s, which takes a few seconds, but needs to run only once, and multiplying that with any image that needs to be processed (which only takes an instant).

The question is, can I replicate that behavior in my program in a way that it doesn’t end up as a series of weird hacks and work-arounds, held together by duct tape and voodoo?

Have a great day,

Florian

PS: A little background might be helpful. I wrote a bit of jython code for a Gaussian / Laplace Pyramid decomposition and synthesis, and one of the operations I need to do is to double the image size by interleaving rows an columns of zeros. For that, I used Image>Scale without interpolation and set all the odd rows and columns to 0.