Hi,
Not in the sense of a question asked by a dummy, but a question about a dummy [pix_crop] :)
Well the question is this: given this setup:
[gemhead] | [pix_film] | [pix_crop] ...
When the pix_crop is set to 0,0 offset and a size equal to the input image size, that is it is identical to no crop at all, will it consume the same amount of CPU as a nontrivial crop?
And by the way, I suppose that (at least when the crop is actually nontrivial) when the input image changes, performing the crop means actually copying all the pixels within the cropped region, doesn't it?
thanks m.
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1
Matteo Sisti Sette wrote:
Hi,
When the pix_crop is set to 0,0 offset and a size equal to the input image size, that is it is identical to no crop at all, will it consume the same amount of CPU as a nontrivial crop?
most likely (but i don't know; every now and then there are optimizations...) i'd say: try it out :-)
"nontrivial" should consume more processing power (and bus transfer) than the optimized "trivial" case.
And by the way, I suppose that (at least when the crop is actually nontrivial) when the input image changes, performing the crop means actually copying all the pixels within the cropped region, doesn't it?
yes.
so you can perform weird stuff inline on the cropped image without affecting the original image.
fg,asr IOhannes