Two kinds of problems - multiterminal hypothesis testing and one-to-many lossy sourcecoding - are investigated in a unified way. It is demonstrated that a simple key idea, which is developed by Iriyama for one-to-one...
详细信息
Two kinds of problems - multiterminal hypothesis testing and one-to-many lossy sourcecoding - are investigated in a unified way. It is demonstrated that a simple key idea, which is developed by Iriyama for one-to-one sourcecoding systems, can be applied to multiterminal source coding systems. In particular, general bounds on the error exponents for multiterminal hypothesis testing and one-to-many lossy sourcecoding are given.
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.
In this paper, we derive the suboptimal sum-rate distortion bound for encoding correlated Gaussian sources for which the uniform scalar quantizers are used to convert the signals from analog to the discrete form. The ...
详细信息
ISBN:
(纸本)9781936968602
In this paper, we derive the suboptimal sum-rate distortion bound for encoding correlated Gaussian sources for which the uniform scalar quantizers are used to convert the signals from analog to the discrete form. The correlated discrete signals are further compressed using the lossless Slepian and Wolf encoder. The gap between the suboptimal bound and the inner/outer bounds is also investigated. The result shows that the gap is at most 0.255 bits/sample/source which is far less than the universal bound of 2.45 bits/sample given in [1] for the three tree-structured Gaussian sources.
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.
We determine the rate region of the Gaussian one-helper source-coding problem in which the helper observes a scalar, the main encoder observes a vector, and the distortion constraint is a positive semidefinite upper b...
详细信息
We determine the rate region of the Gaussian one-helper source-coding problem in which the helper observes a scalar, the main encoder observes a vector, and the distortion constraint is a positive semidefinite upper bound on the error covariance matrix of the main source. The rate region is achieved by a Gaussian achievable scheme. We introduce a novel outer bounding technique to establish the converse. Our approach is to create a reduced dimensional problem by projecting the main source and the distortion constraint in certain directions determined by the optimal Gaussian scheme. We also provide an outer bound to the rate region of the more general problem in which there are distortion constraints on both sources. This outer bound is partially tight in general and completely tight in some nontrivial cases.
Real-time multimedia multicast over wireless networks is an exciting application that has generated a lot of interest recently. Its main challenge lies in the stringent bandwidth and time-delay requirements of real-ti...
详细信息
Real-time multimedia multicast over wireless networks is an exciting application that has generated a lot of interest recently. Its main challenge lies in the stringent bandwidth and time-delay requirements of real-time multimedia and severe impairments of the wireless channels. We develop a network-aware cross-layer design for multimedia multicast over heterogeneous wireless-wireline networks, that leverages the knowledge on network information theory, multimedia processing, error control, and networking. In particular, the encoded multimedia data are broadcast to multiple Internet servers over a wireless radio link. Each server merely compresses the signal it has received using distributed sourcecoding by exploiting mutual correlation among signals received at different servers. The receiver collects bitstreams from the servers before performing joint decoding. We provide an algorithm for optimal nonuniform scalar quantizer design at the server side that minimizes the required rate under the decoder bit error rate constraint. For scalable multimedia codes, we develop a joint source-channel coding scheme which combines error-protection at the base station and distributed sourcecoding at the servers. Our experimental results show significant performance improvements over conventional solutions due to spatial diversity and distributed sourcecoding gains.
We derive a lower bound on each supporting line of the rate region of the vector Gaussian two-terminal CEO problem, which is a special case of the indirect vector Gaussian two-terminal sourcecoding problem. The key t...
详细信息
We derive a lower bound on each supporting line of the rate region of the vector Gaussian two-terminal CEO problem, which is a special case of the indirect vector Gaussian two-terminal sourcecoding problem. The key technical ingredient is a new extremal inequality. It is shown that the lower bound coincides with the Berger-Tung upper bound in the high-resolution regime. Similar results are derived for the direct vector Gaussian two-terminal sourcecoding problem.
This paper studies variable-length (VL) sourcecoding of general sources with side-information. Novel one-shot coding bounds for Slepian-Wolf (SW) coding, which give nonasymptotic tradeoff between the error probabilit...
详细信息
This paper studies variable-length (VL) sourcecoding of general sources with side-information. Novel one-shot coding bounds for Slepian-Wolf (SW) coding, which give nonasymptotic tradeoff between the error probability and the codeword length of VL-SW coding, are established. One-shot results are applied to asymptotic analysis, and a general formula for the optimal coding rate achievable by weakly lossless VL-SW coding (i.e., VL-SW coding with vanishing error probability) is derived. Our general formula reveals how the encoder side-information and/or VL coding improve the optimal coding rate in the general setting. In addition, it is shown that if the encoder side-information is useless in weakly lossless VL coding then it is also useless even in the case where the error probability may be positive asymptotically.
We determine the rate region of the vector Gaussian one-helper source-coding problem under a covariance matrix distortion constraint. The rate region is achieved by a simple scheme that separates the lossy vector quan...
详细信息
We determine the rate region of the vector Gaussian one-helper source-coding problem under a covariance matrix distortion constraint. The rate region is achieved by a simple scheme that separates the lossy vector quantization from the lossless spatial compression. The converse is established by extending and combining three analysis techniques that have been employed in the past to obtain partial results for the problem.
暂无评论