continuous automata - 8 neighbors - G

Each pixel has a value between 0 and 1. At each iteration, each pixel's value is replaced by a value given by a linear function of the values of the 8 adjacent pixels, sorted so that the result is non-directional.

The coefficients of this linear function are especially simple: C[0]=1.1;C[1]=C[2]=C[3]=C[4]=C[5]=C[6]=-0.2;C[7]=1.1.