2 research outputs found
AMISP: A Complete Content-Based MPEG-2 Error-Resilient Scheme
We address a new error-resilient scheme for broadcast quality MPEG-2 video streams to be transmitted over lossy packet networks. A new scene-complexity adaptive mechanism, namely Adaptive MPEG-2 Information Structuring (AMIS) is introduced. AMIS modulates the number of resynchronization points (i.e., slice headers and intra-coded macroblocks) in order to maximize the perceived video quality, assuming that the encoder is aware of the underlying packetization scheme, the packet loss probability (PLR) and the error concealment technique implemented at the decoding side. The end-to-end video quality depends both on the encoding quality and the degradation due to data loss. Therefore, AMIS constantly determines the best compromise between the rate allocated to encode pure video information and the rate aiming at reducing the sensitivity to packet loss. Experimental results show that AMIS dramatically outperforms existing structuring techniques, thanks to its efficient adaptivity. We then extend AMIS with a Forward Error Correction (FEC) based Protection algorithm to become AMISP. AMISP triggers the insertion of FEC packets in the MPEG-2 video packet stream. Finally, the performances of the AMISP scheme in an MPEG-2 over RTP/UDP/IP scenario are evaluated
Concealment algorithms for networked video transmission systems
This thesis addresses the problem of cell loss when transmitting video data over an
ATM network. Cell loss causes sections of an image to be lost or discarded in the
interconnecting nodes between the transmitting and receiving locations.
The method used to combat this problem is to use a technique called Error
Concealment, where the lost sections of an image are replaced with approximations
derived from the information in the surrounding areas to the error. This technique
does not require any additional encoding, as used by Error Correction. Conventional
techniques conceal from within the pixel domain, but require a large amount of
processing (2N2 up to 20N2) where N is the dimension of an N×N square block.
Also, previous work at Loughborough used Linear Interpolation in the transform
domain, which required much less processing, to conceal the error. [Continues.