- related to Gibson's concept of optical flow and affordance perception
- used in many applications: movement detection, video compression, frame reconstruction, image stabilization etc.

[poz 191023] proposals:

- lindenmayer system
- optical flow (lucas-kanade is a possible implementation)

- clustering algorithms
- rewriting systems (how to think it more abstract?)
- cellular automata
- referntial transparency

maket the input signal part of the program

It assumes that the flow is essentially constant in a local neighbourhood of the pixel under consideration, and solves the basic optical flow equations for all the pixels in that neighbourhood, by the least squares criterion

(in relation to the disposition of 'Differential Segmentation')

the 10 most important algorithms for:

in series (chomsky)

in parallel (lindenmayer)

- rewriting system
- self similarity
- easy to communicate

axiom: | 0 |

1st recursion: | 1[0]0 |

2nd recursion: | 11[1[0]0]1[0]0 |

3rd recursion: | 1111[11[1[0]0]1[0]0]11[1[0]0]1[0]0 |

[L] John R. Rice (1975), The Algorithm Selection Problem

criteria for selection

- renowned / unknown
- classical (input->run->output) vs non-terminating

a simple neural network (with python examples)

[in SC]