Overlapped Quasi-Arithmetic Codes for Distributed Video Coding
Xavi Artigas, Simon Malinowski, Christine M. Guillemot et al. · Proceedings - International Conference on Image Processing · 2007
This paper describes Slepian-Wolf codes based on overlapped quasi-arithmetic codes, where overlapping allows lossy compression of the source below its entropy. In the context of separate decoding, these codes are not uniquely decodable: the overlap introduces ambiguity in the decoding process leading to decoding errors. The presence of correlated side information at the decoder is used to remove this ambiguity and achieve a vanishing error probability. The state models and the automata of the overlapped quasi-arithmetic codes are described. The soft decoding algorithm with side information is then presented. The performance of these codes has been assessed first on theoretical sources and integrated in a distributed video coding platform.
Cited by 47 works. doi:10.1109/icip.2007.4379079
Authors
References
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
- Optimal decoding of linear codes for minimizing symbol error rate
- Noiseless coding of correlated information sources
- The rate-distortion function for source coding with side information at the decoder
- An Introduction to Arithmetic Coding
- Distributed Video Coding
- Practical Implementations of Arithmetic Coding
- Improving Transform Domain Wyner-Ziv Video Coding Performance
- Optimal code design for lossless and near lossless source coding in multiple access networks