Please use this identifier to cite or link to this item:
Title: Efficient reference picture selection algorithm for error-resilient video transcoding
Authors: Chan, YL 
Cheung, HK
Siu, WC 
Issue Date: 2010
Source: Proceedings of the 7th IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2010, 2010, p. 374-381
Abstract: Many error-resilient video coding schemes that protect compressed video data against transmission errors have been proposed in the literature. One of the well-known schemes is reference picture selection (RPS). So far, various RPS techniques have been investigated widely for use in real-time encoding. However, the RPS has not been examined in transmitting an already encoded MPEG bitstream. One simple approach in adopting the RPS scheme in an already MPEG encoded bitstream is to decode all the P-frames from the previously nearest I-frame to the current transmitted frame which is then re-encoded by using a new reference. This straightforward approach induces a huge amount of complexity in the video transcoder and introduces re-encoding errors. Thus, in this paper, some compressed-domain algorithms are proposed to mitigate the trancoding complexity when RPS is adopted in an already MPEG encoded bitstream. According to the types of blocks, different novel techniques are operated on the blocks in the compressed domain. The transcoder then sends the processed blocks to the client machine. Experimental results show that the proposed transcoder can reduce the transcoding complexity with maintaining high quality of reconstructed video.
Keywords: Compressed-domain processing
Error-resilient transcoding
Streaming video
Video coding
ISBN: 9780889868236
Description: 7th IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2010, Innsbruck, 17-19 February 2010
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of Sep 16, 2020

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.