2,262 research outputs found

    Distributed video coding for wireless video sensor networks: a review of the state-of-the-art architectures

    Get PDF
    Distributed video coding (DVC) is a relatively new video coding architecture originated from two fundamental theorems namely, Slepian–Wolf and Wyner–Ziv. Recent research developments have made DVC attractive for applications in the emerging domain of wireless video sensor networks (WVSNs). This paper reviews the state-of-the-art DVC architectures with a focus on understanding their opportunities and gaps in addressing the operational requirements and application needs of WVSNs

    Joint On-the-Fly Network Coding/Video Quality Adaptation for Real-Time Delivery

    Get PDF
    This paper introduces a redundancy adaptation algorithm for an on-the-fly erasure network coding scheme called Tetrys in the context of real-time video transmission. The algorithm exploits the relationship between the redundancy ratio used by Tetrys and the gain or loss in encoding bit rate from changing a video quality parameter called the Quantization Parameter (QP). Our evaluations show that with equal or less bandwidth occupation, the video protected by Tetrys with redundancy adaptation algorithm obtains a PSNR gain up to or more 4 dB compared to the video without Tetrys protection. We demonstrate that the Tetrys redundancy adaptation algorithm performs well with the variations of both loss pattern and delay induced by the networks. We also show that Tetrys with the redundancy adaptation algorithm outperforms FEC with and without redundancy adaptation

    Joint Exploitation of Residual Source Information and MAC Layer CRC Redundancy for Robust Video Decoding

    No full text
    International audienceThis paper presents a MAP estimation method allowing the robust decoding of compressed video streams by exploiting the bitstream structure (i.e., information about the source, related to variable-length codes and source characteristics) together with the knowledge of the MAC layer CRC (here considered as additional redundancy on the MAC packet). This method is implemented via a sequential decoding algorithm in which the branch selection metric in the decoding trellis incorporates a CRC-dependent factor, and the paths which are not compatible with the source constraints are pruned. A first implementation of the proposed algorithm performs exact computations of the metrics, and is thus computationally expensive. Therefore, we also introduce a suboptimal (with tunable complexity) version of the proposed metric computation. This technique is then applied to the robust decoding of sequences encoded using the H.264/AVC standard based on CAVLC, and transmitted using aWiFi-like packet structure. Significant link budget improvement results are demonstrated for BPSK modulated signals sent over AWGN channels, even in the presence of channel coding

    A unary error correction code for the near-capacity joint source and channel coding of symbol values from an infinite set

    No full text
    A novel Joint Source and Channel Code (JSCC) is proposed, which we refer to as the Unary Error Correction (UEC) code. Unlike existing JSCCs, our UEC facilitates the practical encoding of symbol values that are selected from a set having an infinite cardinality. Conventionally, these symbols are conveyed using Separate Source and Channel Codes (SSCCs), but we demonstrate that the residual redundancy that is retained following source coding results in a capacity loss, which is found to have a value of 1.11 dB in a particular practical scenario. By contrast, the proposed UEC code can eliminate this capacity loss, or reduce it to an infinitesimally small value. Furthermore, the UEC code has only a moderate complexity, facilitating its employment in practical low-complexity applications

    Robust decoder-based error control strategy for recovery of H.264/AVC video content

    Get PDF
    Real-time wireless conversational and broadcasting multimedia applications offer particular transmission challenges as reliable content delivery cannot be guaranteed. The undelivered and erroneous content causes significant degradation in quality of experience. The H.264/AVC standard includes several error resilient tools to mitigate this effect on video quality. However, the methods implemented by the standard are based on a packet-loss scenario, where corrupted slices are dropped and the lost information concealed. Partially damaged slices still contain valuable information that can be used to enhance the quality of the recovered video. This study presents a novel error recovery solution that relies on a joint source-channel decoder to recover only feasible slices. A major advantage of this decoder-based strategy is that it grants additional robustness while keeping the same transmission data rate. Simulation results show that the proposed approach manages to completely recover 30.79% of the corrupted slices. This provides frame-by-frame peak signal-to-noise ratio (PSNR) gains of up to 18.1%dB, a result which, to the knowledge of the authors, is superior to all other joint source-channel decoding methods found in literature. Furthermore, this error resilient strategy can be combined with other error resilient tools adopted by the standard to enhance their performance.peer-reviewe

    Joint source-channel coding/decoding of 3D-ESCOT bitstreams

    No full text
    International audienceJoint source-channel decoding (JSCD) exploits residual redundancy in compressed bitstreams to improve the robustness to transmission errors of multimedia coding schemes. This paper proposes an architecture to introduce some additional side information in compressed streams to help JSCD. This architecture exploits a reference decoder already present or introduced at the encoder side. An application to the robust decoding of 3D-ESCOT encoded bitstreams generated within the Vidwav video coder is presented. The layered bitstream generated by this encoder allows SNR scalability, and moreover, when processed by a JSCD, provides increased robustness to transmission errors compared with a single layered bitstream

    Distributed Video Coding for Multiview and Video-plus-depth Coding

    Get PDF

    Decoding H.264/AVC using prior information and source constraints

    Get PDF
    The H.264/AVC standard employs a number of errorresilient mechanisms to correct transmission errors. These methods assume a packet-loss scenario, where all the macroblocks (MBs) contained within a corrupted slice are dropped and concealed. However, most of the MBs contained within corrupted slices provide minimal (if any) visual distortions and therefore concealing them causes a superfluous drop in the quality of the recovered video content. This paper presents a novel error control mechanism which employs prior information and residual source-redundancy to recover the most-likelihood feasible H.264/AVC bitstream. Simulation results show that the algorithm recovers a number of corrupted sequences and achieves overall Peak Signal-to-Noise Ratio (PSNR) gains between 1dB and 2dB over the standard. The proposed solution is compatible with the H.264/AVC with no additional bandwidth requirements.peer-reviewe

    Extrinsic information modification in the turbo decoder by exploiting source redundancies for HEVC video transmitted over a mobile channel

    Get PDF
    An iterative turbo decoder-based cross layer error recovery scheme for compressed video is presented in this paper. The soft information exchanged between two convolutional decoders is reinforced both by channel coded parity and video compression syntactical information. An algorithm to identify the video frame boundaries in corrupted compressed sequences is formulated. This paper continues to propose algorithms to deduce the correct values for selected fields in the compressed stream. Modifying the turbo extrinsic information using these corrections acts as reinforcements in the turbo decoding iterative process. The optimal number of turbo iterations suitable for the proposed system model is derived using EXIT charts. Simulation results reveal that a transmission power saving of 2.28% can be achieved using the proposed methodology. Contrary to typical joint cross layer decoding schemes, the additional resource requirement is minimal, since the proposed decoding cycle does not involve the decompression function
    • 

    corecore