This paper considers a distributed sourcecoding (DSC) problem where L encoders observe noisy linear combinations of K correlated remote Gaussian sources, and separately transmit the compressed observations to the dec...
详细信息
This paper considers a distributed sourcecoding (DSC) problem where L encoders observe noisy linear combinations of K correlated remote Gaussian sources, and separately transmit the compressed observations to the decoder to reconstruct the remote sources subject to a sum-distortion constraint. This DSC problem is referred to as the generalized Gaussian CEO problem since it can be viewed as a generalization of the quadratic Gaussian CEO problem where the number of remote source K = 1. First, we provide a new outer region obtained using the entropy power inequality and an equivalent argument (in the sense of having the same rate-distortion region and Berger-Tung inner region) among a certain class of generalized Gaussian CEO problems. We then give two sufficient conditions for our new outer region to match the inner region achieved by Berger-Tung schemes, where the second matching condition implies that in the low-distortion regime, the Berger-Tung inner rate region is always tight, while in the high-distortion regime, the same region is tight if a certain condition holds. The sum-rate part of the outer region is also studied and shown to meet the Berger-Tung sum-rate upper bound under a certain condition, which is obtained using the Karush-Kuhn-Tucker conditions of the underlying convex semidefinite optimization problem, and is in general weaker than the aforesaid two for rate region tightness.
multiterminal (MT) video coding is a practical application of the MT sourcecoding theory. For MT sourcecoding theory, two problems associated with achievable rate regions are well investigated into in this thesis: a...
详细信息
multiterminal (MT) video coding is a practical application of the MT sourcecoding theory. For MT sourcecoding theory, two problems associated with achievable rate regions are well investigated into in this thesis: a new sufficient condition for BT sum-rate tightness, and the sum-rate loss for quadratic Gaussian MT sourcecoding. Practical code design for ideal Gaussian sources with quadratic distortion measure is also achieved for cases more than two sources with minor rate loss compared to theoretical limits. However, when the theory is applied to practical applications, the performance of MT video coding has been unsatisfactory due to the difficulty to explore the correlation between different camera views. In this dissertation, we present an MT video coding scheme under the H.264/AVC framework. In this scheme, depth camera information can be optionally sent to the decoder separately as another source sequence. With the help of depth information at the decoder end, inter-view correlation can be largely improved and thus so is the compression performance. With the depth information, joint estimation from decoded frames and side information at the decoder also becomes available to improve the quality of reconstructed video frames. Experimental result shows that compared to separate encoding, up to 9.53% of the bit rate can be saved by the proposed MT scheme using decoder depth information, while up to 5.65% can be saved by the scheme without depth camera information. Comparisons to joint video coding schemes are also provided.
In this paper, we proposed a multi-view images coding method based on multiterminal source coding (MSC). Due to separate encoding in MSC, our coding scheme can achieve good random access performance and the spatial re...
详细信息
ISBN:
(纸本)9781424407286
In this paper, we proposed a multi-view images coding method based on multiterminal source coding (MSC). Due to separate encoding in MSC, our coding scheme can achieve good random access performance and the spatial redundancy can be exploited even if the encoders can not communicate with each other. Because of joint decoding, the compression performance of our scheme is promising, far better than that of separate encoding and decoding scheme. Compared to multi-view coding based on Wyner Ziv coding, our coding scheme is more flexible and can be easily extended to N views coding. There is no need to classify the view images into key images and Wyner Ziv images, images can be compressed in the same way and we can easily change the compression rate of each view to adapt to the resource conditions, like network bandwidth or storage. Experiment results show that the compression performance of our scheme is better than that of JPEG encoder and decoder scheme.
We consider multi-terminal sourcecoding with a single encoder and multiple decoders where either the encoder or the decoders can take actions which affect the quality or availability of the side information present a...
详细信息
ISBN:
(纸本)9781457705953
We consider multi-terminal sourcecoding with a single encoder and multiple decoders where either the encoder or the decoders can take actions which affect the quality or availability of the side information present at the decoders, subjected to an additional cost constraint on the actions taken. For the scenario where a joint action is taken at the decoders, we characterize the rate-cost trade-off region for lossless sourcecoding, and give an achievability scheme for lossy sourcecoding for two decoders which is optimum for several special cases. For the case where the encoder takes actions, we characterize the rate-cost trade-off for a class of lossless sourcecoding scenarios with multiple decoders.
We describe a scheme for rate-distortion with distributed encoding in which the sources to be compressed contain a common component. We show that this scheme is optimal in some situations and that it strictly improves...
详细信息
We describe a scheme for rate-distortion with distributed encoding in which the sources to be compressed contain a common component. We show that this scheme is optimal in some situations and that it strictly improves upon existing schemes, which do not make full use of common components. This establishes that independent quantization followed by independent binning is not optimal for the two-encoder problem with a distortion constraint on one source. We also show that independent quantization and binning is suboptimal for the three-encoder problem in which the goal is to reproduce one of the sources losslessly. This provides a counterexample that is fundamentally different from one provided earlier by Korner and Marton. The proofs rely on the binary analogue of the entropy power inequality and the existence of a rate loss for the binary symmetric Wyner-Ziv problem.
This paper deals with a universal coding problem for a certain kind of multiterminal source coding network called a generalized complementary delivery network. In this network, messages from multiple correlated source...
详细信息
This paper deals with a universal coding problem for a certain kind of multiterminal source coding network called a generalized complementary delivery network. In this network, messages from multiple correlated sources are jointly encoded, and each decoder has access to some of the messages to enable it to reproduce the other messages. Both fixed-to-fixed length and fixed-to-variable length lossless coding schemes are considered. Explicit constructions of universal codes and the bounds of the error probabilities are clarified by using methods of types and graph-theoretical analysis.
multiterminal source coding refers to separate encoding and joint decoding of multiple correlated sources. Joint decoding requires all the messages to be decoded simultaneously which is exponentially more complex than...
详细信息
multiterminal source coding refers to separate encoding and joint decoding of multiple correlated sources. Joint decoding requires all the messages to be decoded simultaneously which is exponentially more complex than a sequence of single-message decodings. Inspired by previous work on successive coding, we apply the successive Wyner-Ziv coding, which is inherently a low complexity approach of obtaining a prescribed distortion, to the two-terminal sourcecoding scheme. First, we consider 1-helper problem where one source provides partial side information to the decoder to help the reconstruction of the main source. Our results show that the successive coding strategy is an optimal strategy in the sense of achieving the rate-distortion function. By developing connections between source encoding and data fusion steps, it is shown that the whole rate-distortion region for the 2-terminal sourcecoding problem is achievable using the successive coding strategy. Comparing the performance of the sequential coding with the performance of the successive coding, we show that there is no sum-rate loss when the side information is not available at the encoder. This result is of special interest in some applications such as video coding where there are processing and storage constraints at the encoder. Finally, we provide an achievable rate-distortion region for the m-terminal sourcecoding.
作者：
Oohama, YKyushu Univ
Grad Sch Fac Informat Sci & Elect Engn Dept Comp Sci & Commun EngnHigashi Ku Fukuoka 8128581 Japan
In this paper, we consider the separate coding problem for L + 1 correlated Gaussian memoryless sources. We deal with the case where L sources work as partial side information at the decoder for the reconstruction of ...
详细信息
In this paper, we consider the separate coding problem for L + 1 correlated Gaussian memoryless sources. We deal with the case where L sources work as partial side information at the decoder for the reconstruction of the remaining source. The determination problem of the rate-distortion region for this system is the so-called many-help-one problem and it has been known as a highly challenging problem for almost 20 years. In this paper, we give a partial solution to this problem. We determine the rate-distortion region in the case where the L sources working as partial side information are conditionally independent if the remaining source we wish to reconstruct is given. The additive white Gaussian noise CEO problem is a special case of this. We also discuss the relation of the result previous results of ours.
Following recent works on the rate region of the quadratic Gaussian two-terminal sourcecoding problem and limit-approaching code designs, this paper examines multiterminal source coding of two correlated, i.e., stere...
详细信息
Following recent works on the rate region of the quadratic Gaussian two-terminal sourcecoding problem and limit-approaching code designs, this paper examines multiterminal source coding of two correlated, i.e., stereo, video sequences to save the sum rate over independent coding of both sequences. Two multiterminal video coding schemes are proposed. In the first scheme, the left sequence of the stereo pair is coded by H.264/AVC and used at the joint decoder to facilitate Wyner-Ziv coding of the right video sequence. The first I-frame of the right sequence is successively coded by H.264/AVC Intracoding and Wyner-Ziv coding. An efficient stereo matching algorithm based on loopy belief propagation is then adopted at the decoder to produce pixel-level disparity maps between the corresponding frames of the two decoded video sequences on the fly. Based on the disparity maps, side information for both motion vectors and motion-compensated residual frames of the right sequence are generated at the decoder before Wyner-Ziv encoding. In the second scheme, source splitting is employed on top of classic and Wyner-Ziv coding for compression of both I-frames to allow flexible rate allocation between the two sequences. Experiments with both schemes on stereo video sequences using H.264/AVC, LDPC codes for Slepian-Wolf coding of the motion vectors, and scalar quantization in conjunction with LDPC codes for Wyner-Ziv coding of the residual coefficients give a slightly lower sum rate than separate H.264/AVC coding of both sequences at the same video quality.
This paper clarifies the adequacy of the linear channel coding approach for the sourcecoding with partial side information at the decoder. A sufficient condition for an ensemble of linear codes which achieves the Wyn...
详细信息
This paper clarifies the adequacy of the linear channel coding approach for the sourcecoding with partial side information at the decoder. A sufficient condition for an ensemble of linear codes which achieves the Wyner's bound is given. Our result reveals that, by combining a good lossy code, an LDPC code ensemble gives a good code for sourcecoding with partial side information at the decoder.
暂无评论