Algorithmic representation of visual information

Sow and Eleftheriadis (see Proceedings of IEEE International Symposium on Information Theory, Germany, p.188, 1997) have introduced complexity distortion theory, a mathematical framework characterizing the design of programmable communication systems. In this paper, we show how complexity distortion theory fits in the MPEG-4 context and more generally in any system allowing programmability, by formalizing the concept of programmable decoders. We also show how it can be used to design intelligent encoders at two flexibility levels: the first one corresponding to the case where flexibility in the algorithm selection is allowed and the second where downloading of new tools for representation is also allowed