In this letter, we investigate the error resilience properties of JPEG2000. We identify the dependencies among coding passes of a codeblock codestream, and determine the sections of the codestream that can be salvaged in the presence of errors. In our analysis, we consider the effects of mode variations provided by the standard. The proposed methods are derived using the existing dependency structure of coding passes and do not require a substantial increase in computational complexity of the decoder. Experimental results indicate that the proposed methods can improve the error resilience performance substantially.

A framework is proposed for iterative joint source-channel decoding of JPEG2000 codestreams. At the encoder, JPEG2000 is used to perform source coding with certain error-resilience (ER) modes, and LDPC codes are used to perform channel coding. During decoding, the source decoder uses the ER modes to identify corrupt sections of the codestream and provides this information to the channel decoder. Decoding is carried out jointly in an iterative fashion. Experimental results indicate that the proposed method requires fewer iterations and improves overall system performance.

Summary form only given. In this work, we extend the methods of (Z. Wu et al, Proc. IEEE Global Telecom. Conf. (Globecom), 2004) to video coding. The proposed algorithm considers the transmission of one or more motion JPEG2000 (MJP2) coded video sequence(s) over a constant bit rate channel. Rate distortion diversity over several dimensions is exploited. This work demonstrates that by minimizing the expected overall distortion at the receiver, both improved average quality of the frames (quality multiplexing gain), as well as more uniform quality across the frames (variance multiplexing gain) can be achieved. Experimental results illustrate the efficiency of the proposed methods.

A joint source/channel coding algorithm is proposed for the transmission of multiple image sources over memoryless channels. The proposed algorithm uses a quality scalable image coder to optimally allocate a limited bit budget among all the sources to achieve the optimal overall distortion reduction for the multiple reconstructed images. In addition to the conventional un gain, it provides channel multiplexing gain, which can be much more significant. Furthermore, an extended scheme is proposed to provide flexibility between the optimization performance and complexity.

The high compression efficiency and various features provided by JPEG2000 make it attractive for image transmission purposes. A novel joint source/channel coding scheme tailored for JPEG2000 is proposed in this paper to minimize the end-to-end image distortion within a given total transmission rate through memoryless channels. It provides unequal error protection by combining the forward error correction capability from channel codes and the error detection/localization functionality from JPEG2000 in an effective way. The proposed scheme generates quality scalable and error-resilient codestreams. It gives competitive performance with other existing schemes for JPEG2000 in the matched channel condition case and provides more graceful quality degradation for mismatched cases. Furthermore, both fixed-length source packets and fixed-length channel packets can be efficiently formed with the same algorithm.

A joint source/channel coding algorithm is proposed for the transmission of multiple image sources over memoryless channels. The proposed algorithm uses a quality scalable image coder to allocate a limited bit budget optimally among all the sources to achieve the optimal overall distortion reduction for the multiple reconstructed images. In addition to the conventional unequal error protection gain, it provides channel multiplexing gain which can be much more significant. Furthermore, an extended scheme is proposed to provide flexibility between the optimization performance and complexity.

In this paper, a robust image transmission scheme based on JPEG2000 is proposed for packet erasure channels. Error resilience functionalities provided by JPEG2000 are utilized to control the source coding efficiency and the robustness according to channel conditions. Furthermore, together with the proposed interleaving scheme, some erasures can be recovered. Experimental results show the effectiveness of the scheme.

The error resilience properties of JPEG2000 are investigated. Through a careful analysis of the structure of the JPEG2000 codestreams, the dependencies among coding passes of a codeblock are identified. In the analysis, the effects of mode variations provided by the standard for low-memory, low-complexity implementations are considered. The proposed methods are derived using the existing dependency structure of coding passes and do not require a substantial increase in computational capabilities of the decoder. Experimental results indicate that these methods can improve error resilience performance substantially.

A two-level, hybrid-optimization scheme is proposed for rate allocation of JPEG2000 (J2K) transmission over noisy channels. It combines forward error correction (FEC) and the J2K error resilience modes to minimize the expected end-to-end image distortion. Subject to a total target bit rate, it forms fixed-length channel packets in a straightforward manner. The proposed scheme utilizes the source distortion rate characteristics and the BER statistics of the available channel codes. It has complexity less than 0 (R/sup 2/) for a specific J2K codestream, where R is the number of available channel code rates. Performance results with both RCPC and turbo codes for fixed-length source packets are provided to show the effectiveness of the scheme.

A method for joint source/channel rate allocation for transmission of JPEG2000 (J2K) codestreams over noisy channels is proposed. The rate allocation method uses the BER statistics of different channel codes and the rate-distortion characteristics of the source generated by the J2K encoder. The features of the J2K codestream are utilized to form a multilayer codestream and an unequal amount of protection is applied to each layer. The proposed method is capable of accommodating different channel coding strategies. Experimental results indicate that the presented method compares favorably with methods existing in the literature.