Robust Scalable Video Transmission using Adaptive Multiple Reference Motion Compensated Prediction 


Vol. 29,  No. 3, pp. 408-418, Mar.  2004


PDF
  Abstract

In this paper, we propose a novel scalable video coding algorithm based on adaptively weighted multiple reference frame method. To improve the coding efficiency in the enhancement layer, the enhancement frame is predicted by the sum of adaptively weighted double motion compensated frames in the enhancement layer and the current frame in the base layer, according to the input video characteristics. By employing adaptive reference selection scheme at the decoder, the proposed method reduce the drift problem significantly. From the experimental results, the proposed algorithm shows more than 1.0 dB PSNR improvement, compared with the conventional scalable H.263+ for various packet loss rate channel conditions.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

Y. K. Kim, S. H. Kim, S. Lee, "Robust Scalable Video Transmission using Adaptive Multiple Reference Motion Compensated Prediction," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 3, pp. 408-418, 2004. DOI: .

[ACM Style]

Yong Kwan Kim, Seung Hwan Kim, and Sang-Uk Lee. 2004. Robust Scalable Video Transmission using Adaptive Multiple Reference Motion Compensated Prediction. The Journal of Korean Institute of Communications and Information Sciences, 29, 3, (2004), 408-418. DOI: .

[KICS Style]

Yong Kwan Kim, Seung Hwan Kim, Sang-Uk Lee, "Robust Scalable Video Transmission using Adaptive Multiple Reference Motion Compensated Prediction," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 3, pp. 408-418, 3. 2004.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880