Matteo Marson

I'm trying to implement a sorting algorithm in jit.gen.

I think i understood the logic behind the sorting itself but i cannot grasp how looping structures work inside the jit.gen family and how to write a single pixel data to an "update matrix". I feel it would be some sort of workaround, dealing with the fact that jit.gen thinks in tems of vectors and not single pixels, but i can't figure out how to do this.

a possible workaround i'm thinking about is to normalize between [ 0 - 1 ] the incoming matrix and dispose the pixels according to their value doing a pseudo-sorting

I'm trying to implement a sorting algorithm in jit.gen.
I think i understood the logic behind the sorting itself but i cannot grasp how looping structures work inside the jit.gen family and how to  write a single pixel data to an "update matrix". I feel it would be some sort of workaround, dealing with the fact that jit.gen thinks in tems of vectors and not single pixels, but i can't figure out how to do this.

sorting-in-jit-gen

To clarify, this is what i'm thinking as pseudo-sorting

this is basically the concept of a video scope

Normalizing each row indipendently and Interpolating for the missing values you should get an approximated sorting of the pixel value per row (aproximated since the values are ordered but no more the same)

this is basically the concept of a video scope
Normalizing each row indipendently and Interpolating for the missing values you should get an approximated sorting of the pixel value per row (aproximated since the values are ordered but no more the same)


Same patch with normalization per row (very slow code)

is there supposed to be a jit.gen in there?

Sorting in jit.gen