Paper Details: Downloads: 471
Serial Number: P1140802001
Title: Networked Interactive Media Codec Algorithm
Authors: Kostas E. Psannis and Yutaka Ishibashi
Abstract: This paper presents a novel networked interactive media codec algorithm. An MPEG/H.264 coded media sequence is typically partitioned into small intervals called GoP (Group of Pictures). An MPEG/H.264 video stream comprises intra-frames (I), predicted frames (P), and interpolated frames (B). This structure allows a simple realization of forward (normal)-pay operation but imposes several additional constraints on the other interactive functions. Implementation of the rewind operations requires that the decoder either decodes the whole GoP and store it, or it decodes the GoP up to the current frame to be displayed. Both of these techniques lead either to the requirement for large storage at the client machine (to store a fully decoded GoP) or massive decoding processing power (to fully decode a GoP at required displayed frame rate). Neither of these options is desirable. Furthermore, Fast Play (Fast Forward/Jump Forward) functions of MPEG/H.264 coded video present are problematic. When a P-/B- frame is requested, all the related previous P-/I-frames need to be sent over the network. This is likely to lead in considerable increase in communication bandwidth and decoding power compared to the normal-play mode. Several interactive algorithms are detailed with respect to additional resources. Finally an extensive comparative study has been carried out in order to determine the trade offs of the proposed media codec algorithm.
Keywords: Streaming Algorithms, Interactive Media Algorithms, VCR functionality.
Journal/Conference: International Journal of Computer Networks and Internet Research
Volume:
Issue:
Submission Date: 2/1/2008 12:00:00 AM
Review Date: 4/1/2008 12:00:00 AM
Publishing Date: 8/1/2008 12:00:00 AM
Article Downloads: 471
Download:

Facebook