University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Adding lossless video compression to MPEGs

Jiang, J and Xiao, G (2006) Adding lossless video compression to MPEGs IEEE Transactions on Multimedia, 8 (3). pp. 622-625.

Full text not available from this repository.

Abstract

In this correspondence, we propose to add a lossless compression functionality into existing MPEGs by developing a new context tree to drive arithmetic coding for lossless video compression. In comparison with the existing work on context tree design, the proposed algorithm features in 1) prefix sequence matching to locate the statistics model at the internal node nearest to the stopping point, where successful match of context sequence is broken; 2) traversing the context tree along a fixed order of context structure with a maximum number of four motion compensated errors; and 3) context thresholding to quantize the higher end of error values into a single statistics cluster. As a result, the proposed algorithm is able to achieve competitive processing speed, low computational complexity and high compression performances, which bridges the gap between universal statistics modeling and practical compression techniques. Extensive experiments show that the proposed algorithm outperforms JPEG-LS by up to 24% and CALIC by up to 22%, yet the processing time ranges from less than 2 seconds per frame to 6 seconds per frame on a typical PC computing platform. © 2006 IEEE.

Item Type: Article
Authors :
NameEmailORCID
Jiang, Jjianmin.jiang@surrey.ac.ukUNSPECIFIED
Xiao, GUNSPECIFIEDUNSPECIFIED
Date : 1 June 2006
Identification Number : https://doi.org/10.1109/TMM.2006.870721
Depositing User : Symplectic Elements
Date Deposited : 17 May 2017 12:24
Last Modified : 17 May 2017 15:03
URI: http://epubs.surrey.ac.uk/id/eprint/835222

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800