EE382C Embedded Software Systems - Complexity Distortion Theory Project
Complexity Distortion Theory Project
A study of Complexity Distortion Theory, which is the tradeoff
between rate-distortion performance in a compression system
and computational complexity in a model of computation.
Information theory (Shannon) <----> Computing theory (Turing)
This is where information theory meets the theory of computing.
A key recent reference:
- D. Sow and
A. Eleftheriadis,
"Algorithmic Representation of Visual Information,"
Proc. IEEE Int. Conf. on Image Processing,
vol. 2, pp. 250-253, Oct. 26-29, 1997, Santa Barbara, CA.
I also have copies of three journal papers on the topic submitted by
Prof. Eleftheriadis at Columbia University.
Columbia University is involved in Complexity Distortion
Theory because of their work in the emerging MPEG-4 standard.
In MPEG-4, they have the responsibility of developing the
syntax for extending functionality of decoders.
That is, they have to define a syntax that is general enough to
support the MPEG IV coding toolset, but simple enough to be
implemented on a virtual machine running on programmable processors
in the decoder.
A good example of a highly efficient software implementation
of an MPEG-2 video encoder with improved rate-distortion
performance is described in the following paper:
- Y. -W Lee and
F. Kossentini,
Proc. IEEE Int. Conf. on Image Processing,
"Efficient RD Optimized Macroblock Coding Mode Selection
for MPEG-2 Video Encoding'',
Proc. IEEE Int. Conf. on Image Processing,
vol.\ 2, pp.\ 803-806, Oct. 26-29, 1997, Santa Barbara, CA.
Group Home Page
Last updated 01/26/98.