image input
image width
image height
normalized and integrated probability table.
Like the image, the cells are read horizontally first,
every widthKernel
cell begins a new cell. The cell probabilities
must have been integrated from first to last, and must be normalized
so that the last cell value equals one. A new kernel signal is read
once per input image. (If the signal ends, the previous kernel will
be used again).
width of the kernel signal. Read once per input image.
height of the kernel signal. Read once per input image.
number of recursive application of the displacement per image. Read once per input image.
if non-zero, wraps pixels around the image bounds, otherwise clips.
image height
image input
normalized and integrated probability table.
normalized and integrated probability table.
Like the image, the cells are read horizontally first,
every widthKernel
cell begins a new cell. The cell probabilities
must have been integrated from first to last, and must be normalized
so that the last cell value equals one. A new kernel signal is read
once per input image. (If the signal ends, the previous kernel will
be used again).
height of the kernel signal.
height of the kernel signal. Read once per input image.
width of the kernel signal.
width of the kernel signal. Read once per input image.
Abstract method which must be implemented by creating the actual UGen
s
during expansion.
number of recursive application of the displacement per image.
number of recursive application of the displacement per image. Read once per input image.
image width
if non-zero, wraps pixels around the image bounds, otherwise clips.
A UGen similar to GIMP's Slur image filter. Instead of a hard-coded kernel, the probability table must be provided as a separate input. The kernel width and height should be odd, so that the kernel is considered to be symmetric around each input image's pixel. If they are odd, the centre corresponds to integer divisions
kernelWidth/2
andkernelHeight/2
.image input
image width
image height
normalized and integrated probability table. Like the image, the cells are read horizontally first, every
widthKernel
cell begins a new cell. The cell probabilities must have been integrated from first to last, and must be normalized so that the last cell value equals one. A new kernel signal is read once per input image. (If the signal ends, the previous kernel will be used again).width of the kernel signal. Read once per input image.
height of the kernel signal. Read once per input image.
number of recursive application of the displacement per image. Read once per input image.
if non-zero, wraps pixels around the image bounds, otherwise clips.