scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Exploitation of temporal redundancy for lossless video coding

TL;DR: The proposed method is computationally very simple and results into better performance as compared to competitive but complex methods reported in literature.
Abstract: In this paper, we are proposing a simple lossless prediction based coding method for videos. Our algorithm works on 3 modes of operations and selection of the mode is done on a pixel-by-pixel basis. Selection of the mode is based on intensity variation of pixels in temporal direction. If there is a large intensity value variation, intraframe prediction mode is chosen. Otherwise interframe prediction mode is activated. Intraframe prediction uses Gradient Adaptive Predictor [5] whereas Interframe prediction switches between two algorithms. In interframe case, one prediction mode takes care of local characteristics of pixels of current and motion compensated frames while the other incorporates global characteristics. The proposed method is computationally very simple and results into better performance as compared to competitive but complex methods reported in literature.
References
More filters
Journal ArticleDOI
TL;DR: The CALIC obtains higher lossless compression of continuous-tone images than other lossless image coding techniques in the literature and can afford a large number of modeling contexts without suffering from the context dilution problem of insufficient counting statistics as in the latter approach.
Abstract: We propose a context-based, adaptive, lossless image codec (CALIC). The codec obtains higher lossless compression of continuous-tone images than other lossless image coding techniques in the literature. This high coding efficiency is accomplished with relatively low time and space complexities. The CALIC puts heavy emphasis on image data modeling. A unique feature of the CALIC is the use of a large number of modeling contexts (states) to condition a nonlinear predictor and adapt the predictor to varying source statistics. The nonlinear predictor can correct itself via an error feedback mechanism by learning from its mistakes under a given context in the past. In this learning process, the CALIC estimates only the expectation of prediction errors conditioned on a large number of different contexts rather than estimating a large number of conditional error probabilities. The former estimation technique can afford a large number of modeling contexts without suffering from the context dilution problem of insufficient counting statistics as in the latter approach, nor from excessive memory use. The low time and space complexities are also attributed to efficient techniques for forming and quantizing modeling contexts.

1,099 citations

Journal ArticleDOI
TL;DR: A compression technique is proposed which is based on motion compensation, optimal three-dimensional (3-D) linear prediction and context based Golomb-Rice entropy coding, which is compared with 3-D extensions of the JPEG-LS standard for still image compression.
Abstract: We consider the problem of lossless compression of video by taking into account temporal information. Video lossless compression is an interesting possibility in the line of production and contribution. We propose a compression technique which is based on motion compensation, optimal three-dimensional (3-D) linear prediction and context based Golomb-Rice (1966, 1979) entropy coding. The proposed technique is compared with 3-D extensions of the JPEG-LS standard for still image compression. A compression gain of about 0.8 bit/pel with respect to static JPEG-LS, applied on a frame-by-frame basis, is achievable at a reasonable computational complexity.

106 citations


"Exploitation of temporal redundancy..." refers methods in this paper

  • ...LS based methods have been used by LOPT [2] where the LS based predictors are estimated for selected pixels based on the amplitude of the prediction error at the previous location....

    [...]

  • ...Feedback type LS based methods have been used by LOPT [2] where the LS based predictors are estimated for selected pixels based on the amplitude of the prediction error at the previous location....

    [...]

  • ...ProAB,M (P ),ProAB,M (B),ProAB,M (S) REFERS TO COMBINED PROPOSED ALGORITHM WHICH GENERATES MCF USING PIXEL BASED, BLOCK BASED AND SWITCHING BASED RESPECTIVELY WITH PARAMETER A,B AND M WHERE E th IS 0 Video LOPT M-CALIC [4] Pro13,80(P ) Pro13,80(B) Pro13,80(S) Pro25,80(S) Pro25,120(S) Salesman 4.32 3.33 3.58 3.47 3.45 3.43 3.41 3.39 Container 3.51 3.16 3.13 3.06 3.03 2.99 3.02 3.00 Tempete 4.53 4.45 4.08 4.00 4.04 3.96 3.94 3.91 Kitchgrass 4.22 4.11 3.95 3.93 3.90 3.86 3.83 3.81 Sean 3.40 2.94 2.83 2.78 2.76 2.71 2.69 2.66 Silent 3.55 3.13 3.04 2.94 2.96 2.89 2.92 2.91 Avg 3.92 3.52 3.44 3.37 3.35 3.31 3.30 3.28 X ′ = ∑ α(k)× xk ∀ k = 1...7 (7)...

    [...]

  • ...The first scheme uses global characteristics of the frame based on block (16 × 16) by block matching [2],[3] whereas the other scheme uses local characteristics of the frame on pixel by pixel basis....

    [...]

Proceedings ArticleDOI
Kyeong Ho Yang1, A.F. Faryar
10 Sep 2000
TL;DR: A new approach to context-based predictive coding of video, where the interframe or intraframe coding mode is adaptively selected on a pixel basis, which enables the coder to easily incorporate error modeling and context modeling by performing the intraframes coding with one of the existing image coders such as the JPEG-LS standard.
Abstract: We propose a new approach to context-based predictive coding of video, where the interframe or intraframe coding mode is adaptively selected on a pixel basis. We perform the coding mode selection using only the previously reconstructed samples which are also available at the decoder, so that any overhead information on the coding mode selection does not need to be transmitted to the decoder. The proposed coder also provides the lossless concatenated coding property when applied to multigeneration of video sequences since the same coding mode information is available at the second time encoding. The proposed coding mode selection enables the coder to easily incorporate error modeling and context modeling by performing the intraframe coding with one of the existing image coders such as the JPEG-LS standard. Experiments show that the proposed approach in conjunction with the JPEG-LS standard provides significant improvements in compression efficiency.

36 citations


"Exploitation of temporal redundancy..." refers background in this paper

  • ...Few of lossless video coding methods can be found such as [1] - [4]....

    [...]

Proceedings ArticleDOI
21 Dec 2005
TL;DR: This paper presents a lossless video coding technique which extends interframe-CALlC by employing multi-frame motion compensation to first temporally decorrelate the video material, followed by context-based arithmetic coding of the residual data.
Abstract: In this paper we consider the problem of lossless compression of video sequences exploiting the temporal redundancy between subsequent frames. More specifically, we present a lossless video coding technique which extends interframe-CALlC by employing multi-frame motion compensation to first temporally decorrelate the video material, followed by context-based arithmetic coding of the residual data. To avoid the well known context-dilution problem, we perform context quantization. The proposed technique, called motion-CALIC, is shown to outperform competing methods such as interframe-CALIC and LOPT-3D up to 22.93% in terms of bitrate savings, while still maintaining manageable complexity

12 citations


"Exploitation of temporal redundancy..." refers methods in this paper

  • ...For decoder simplicity, Motion-CALIC (M-CALIC) [3] proposed a block based feed-forward type of prediction using previous twoframes for prediction and to make decoder simple, the predictors are sent to the decoder as an overhead....

    [...]

  • ...ProAB,M (P ),ProAB,M (B),ProAB,M (S) REFERS TO COMBINED PROPOSED ALGORITHM WHICH GENERATES MCF USING PIXEL BASED, BLOCK BASED AND SWITCHING BASED RESPECTIVELY WITH PARAMETER A,B AND M WHERE E th IS 0 Video LOPT M-CALIC [4] Pro13,80(P ) Pro13,80(B) Pro13,80(S) Pro25,80(S) Pro25,120(S) Salesman 4.32 3.33 3.58 3.47 3.45 3.43 3.41 3.39 Container 3.51 3.16 3.13 3.06 3.03 2.99 3.02 3.00 Tempete 4.53 4.45 4.08 4.00 4.04 3.96 3.94 3.91 Kitchgrass 4.22 4.11 3.95 3.93 3.90 3.86 3.83 3.81 Sean 3.40 2.94 2.83 2.78 2.76 2.71 2.69 2.66 Silent 3.55 3.13 3.04 2.94 2.96 2.89 2.92 2.91 Avg 3.92 3.52 3.44 3.37 3.35 3.31 3.30 3.28 X ′ = ∑ α(k)× xk ∀ k = 1...7 (7)...

    [...]

  • ...simplicity, Motion-CALIC (M-CALIC) [3] proposed a block based feed-forward type of prediction using previous twoframes for prediction and to make decoder simple, the predictors are sent to the decoder as an overhead....

    [...]

  • ...The first scheme uses global characteristics of the frame based on block (16 × 16) by block matching [2],[3] whereas the other scheme uses local characteristics of the frame on pixel by pixel basis....

    [...]

Proceedings ArticleDOI
12 Nov 2007
TL;DR: A context-based predictive coding method for lossless compression of video using a model to estimate level of activity in the prediction context of a pixel in terms of slope and a LS based method to find switched predictors to be associated with the various bins.
Abstract: This paper presents a context-based predictive coding method for lossless compression of video. For this method, we propose a model to estimate level of activity in the prediction context of a pixel. This is measured in terms of slope and the same is optimally classified to results in a small number of slope bins. After finding the slope bins, we propose a LS based method to find switched predictors to be associated with the various bins. The set of the predictors are found on a frame-by-frame basis and when it is incorporated in CALIC frame work, the proposed method results in, on an average, a better compression performance than that is obtained using recently published methods - LOPT and M-CALIC. The proposed codec has higher coding complexity but much lower decoding complexity, which is necessary for real-time video decoding. The proposed method of coding, however, has much lower complexity as compared to the LOPT method, which has same order of high coding and decoding complexity.

7 citations


"Exploitation of temporal redundancy..." refers background or methods in this paper

  • ...In second stage, LS Based optimal predictors are estimated for pixels belonging to each bin [4]....

    [...]

  • ...The E CBP works in three stages as follows : 1) First Stage : Construction of 21 Bins: 1) Like CBP, we created 7 bins based on the value of D1....

    [...]

  • ...In such case, we have proposed an extended version of CBP [4] method....

    [...]

  • ...Few of lossless video coding methods can be found such as [1] - [4]....

    [...]

  • ...In requirement of low complex decoder, Tiwari and Kumar [4] proposed an algorithm in which the LS based approach is used to find...

    [...]