Download area

Here you can find Fig.1 and Fig.4 of the manuscript.

Here you can find the proof of Eq.3 in Sec. III of the manuscript.

Here you can find the YUV sequences mentioned in Sec. VII.C of the manuscript.

Here you can find a binary file (compiled statically for linux environment), which demonstrates the ability to MAP decode arithmetic codes. See Marco Grangetto web page for the details.

Here you can find the multiple description codec for still images. This codec allows to generate two representations (JPEG2000-compliant) of the original image. See Tammam Tillo web page for the details.

Test this fast H.264/AVC encoder. It is a modified version of the popular x264 coder. It handles creation of slices with a size limit in bytes; moreover, there is a simple implementation of the redundant slice option (a redundant representation with a larger quantization parameter can be coded for each slice).
State of the art H.264/AVC software is available at H.264/AVC software page. FFMPEG project now includes a fast H.264/AVC decoder. Here a patched version with the ability to decode redundant slices is available (it works if and only if a single representation of each slice is present in the compressed stream).

If you are looking for an implementation of Multiple Description Coding in H.264/AVC, you could check the webpages of the DiVA project. Diva fosters the development of efficient tools for the reliable delivery of multimedia contents across heterogeneous networks using H.264/AVC video standard and Multiple Description Coding.

Here you can find the N-description codec for still images. We have modified the JPEG 2000 codec engine from the OpenJPEG libraries, in order to support the encoding/decoding procedure of an arbitrary number of descriptions, see the paper for some details. In this scheme, the descriptions are generated so that the quality obtained when decoding a subset of them only depends on their number and not on the particular received subset. These methods are easily adaptive to many different network scenarios and allow fast and fine tuning of the encoder parameters, such as the number of descriptions and their redundancy so as to match the network condition.

Here you can find the Linux binaries of the M-CALIC hyperspectral image coder, in the lossless and near-lossless versions. The algorithm is described in the following paper: E. Magli, G. Olmo, E. Quacchio, "Optimized Onboard Lossless and Near-Lossless Compression of Hyperspectral Data Using CALIC," IEEE Geoscience and Remote Sensing Letters, vol. 1, n. 1,pp. 21-25, Jan. 2004.

Here you can find the Linux binaries of the DSC hyperspectral lossless image coder. The algorithm is similar to the one described in our paper at the SPIE EUROPTO 2008 conference (see list of publications of Enrico Magli). The exact algorithm description is provided in a whitepaper included in the zip archive.

Foreman YUV sequence 352x288 (300 frames)

YUV viewer utility