A description is given of studies of source coding in the specialists group on coding for visual telephony in CCITT SG XV. Using a macro block approach, the source coding algorithm will have the capability of operatin...
详细信息
A description is given of studies of source coding in the specialists group on coding for visual telephony in CCITT SG XV. Using a macro block approach, the source coding algorithm will have the capability of operating from 64 kb/s for videophone applications up to 2 Mb/s for high-quality videoconferencing applications. The authors describe the existing reference model and the evolution toward the latest reference model (RM5), which is going to be submitted for standardization. Theoretical information is provided and some examples for possible improvements are presented for the most important techniques used in the reference model, among which are quantization, variable block size, scanning classes, loop filter, entropy coding, multiple vs. single variable-length coding, and block-type discrimination.< >
We investigate two source coding problems with secrecy constraints. In the first problem we consider real-time fully secure transmission of a memoryless source. We show that although classical variable-rate coding is ...
详细信息
We investigate two source coding problems with secrecy constraints. In the first problem we consider real-time fully secure transmission of a memoryless source. We show that although classical variable-rate coding is not an option since the lengths of the codewords leak information on the source, the key rate can be as low as the average Huffman codeword length of the source. In the second problem we consider causal source coding with a fidelity criterion and side information at the decoder and the eavesdropper. We show that when the eavesdropper has degraded side information, it is optimal to first use a causal rate distortion code and then encrypt its output with a key.
We consider the problem of lossy source coding for transmission across an unknown or time-varying noisy channel. The objective is to design an optimal compression system for applications where the unknown channel char...
详细信息
We consider the problem of lossy source coding for transmission across an unknown or time-varying noisy channel. The objective is to design an optimal compression system for applications where the unknown channel characteristics are independently estimated at the channel encoder and decoder. Channel estimation reliability is allowed to vary from perfect channel identification to no channel identification. In each case, the goal in system design and operation is to achieve the best possible expected performance with respect to the unknown channel state and the accuracy of the channel estimators. We describe an optimal design technique and an algorithm for achieving optimal expected performance for the entire array of channel estimation accuracies. The resulting system achieves up to 9 dB improvement over the performance on a system designed assuming zero probability of error when used to encode a collection of medical brain scans for transmission across a finite state channel containing two equally probable binary symmetric channels with crossover probabilities .05 and .001.
The problem of asymptotic (i.e., low-distortion) behavior of the rate-distortion function of a random vector is investigated for a class of non-difference distortion measures. The main result is an asymptotically tigh...
详细信息
The problem of asymptotic (i.e., low-distortion) behavior of the rate-distortion function of a random vector is investigated for a class of non-difference distortion measures. The main result is an asymptotically tight expression which parallels the Shannon lower bound for difference distortion measures. Applications include remote source coding and high resolution quantization theory for non-difference distortion measures.
Neuhoff and Gilbert (1982) defined a causal lossy source code as a system where the reconstruction of the present source sample is restricted to be a function of the present and past source samples, while the code str...
详细信息
ISBN:
(纸本)0780371232
Neuhoff and Gilbert (1982) defined a causal lossy source code as a system where the reconstruction of the present source sample is restricted to be a function of the present and past source samples, while the code stream itself may be non-causal and have variable rate. They showed that for stationary and memoryless sources, optimum causal source coding is achieved by time-sharing at most two entropy coded scalar quantizers. We extend this result to general real valued stationary sources with finite differential entropy rate, in the limit of small distortions. We show that for the mean square distortion, the optimum causal encoder at high resolution is a fixed uniform quantizer followed by a sequence entropy coder. Thus, the cost of causality is the "space filling loss" of the uniform quantizer, i.e., (1/2)log(2/spl pi/e/12)/spl ap/0.254 bit. This generalizes the well known result of Gish and Pierce on asymptotically optimal entropy constrained scalar quantization.
Diversity techniques are commonly used to increase the robustness of communication systems. The corresponding source coding scheme in this field is multiple description coding (MDC). In this paper, we consider the pro...
详细信息
Diversity techniques are commonly used to increase the robustness of communication systems. The corresponding source coding scheme in this field is multiple description coding (MDC). In this paper, we consider the problem of determining the redundancy of binary multiple description source coding in the case of no excess rate for the joint description.
Various authors have obtained state-of-the-art results in lossy source coding by applying algorithms based on a combination of message-passing and decimation to low-density generator matrix codes, but to date, theoret...
详细信息
Various authors have obtained state-of-the-art results in lossy source coding by applying algorithms based on a combination of message-passing and decimation to low-density generator matrix codes, but to date, theoretical understanding of these procedures has been limited. We show that certain forms of soft decimation can be understood as iterative procedures for attempting to maximize a cost function of the node biases. This variational characterization allows us to exhibit appropriate choices of stepsize that ensure convergence to a fixed point, and to provide guarantees on the distortion of the encoding obtained from the fixed point for the case of symmetric Bernoulli sources. Our analysis applies to both an oracle form of soft decimation, in which exact marginals can be computed, and a practical form based on the (reweighted) sum-product algorithm.
In this paper, we propose a scheme for distributed source coding (DSC) that achieves any arbitrary rate on the Slepian-Wolf rate region using a single systematic LDPC code. This method is based on sending a fraction o...
详细信息
In this paper, we propose a scheme for distributed source coding (DSC) that achieves any arbitrary rate on the Slepian-Wolf rate region using a single systematic LDPC code. This method is based on sending a fraction of the information bits along with a fraction of parity bits generated by the LDPC code. First, we study the problem of DSC of two correlated sources at the symmetric rate. We propose to use nonuniform LDPC codes for this application. Then, we generalize our approach to any arbitrary rate. The detailed construction of this scheme is investigated. We illustrate that the design procedure for the LDPC code simplifies to the design of rate-adaptive LDPC codes that need unequal error protection. It is shown that the performance of DSC at any arbitrary rate is almost the same as that of asymmetric rates. Because of the proposed decoding algorithm, each of the sources is decoded independently (only part of the information bits are being exchanged between the decoders). Therefore, this approach does not suffer from the problems of heavy damage or propagation of errors. This method can be easily applied to joint source-channel coding.
One-shot achievable rate region for source coding when coded side information is available at the decoder (source coding with a helper) is proposed. The achievable region proposed is in terms of conditional smooth max...
详细信息
ISBN:
(纸本)9781479904440
One-shot achievable rate region for source coding when coded side information is available at the decoder (source coding with a helper) is proposed. The achievable region proposed is in terms of conditional smooth max Rényi entropy and smooth max Rényi divergence. Asymptotically (in the limit of large block lengths) this region is quantified in terms of spectral-sup conditional entropy rate and spectral-sup mutual information rate. In particular, it coincides with the rate region derived in the limit of unlimited arbitrarily distributed copies of the sources.
Media authentication is important in content delivery via untrusted intermediaries, such as peer-to-peer (P2P) file sharing. Many differently encoded versions of a media file might exist. Our previous work applied dis...
详细信息
Media authentication is important in content delivery via untrusted intermediaries, such as peer-to-peer (P2P) file sharing. Many differently encoded versions of a media file might exist. Our previous work applied distributed source coding not only to distinguish the legitimate diversity of encoded images from tampering but also to localize tampered regions in an image already deemed to be inauthentic. In both cases, authentication requires a Slepian-Wolf encoded image projection that is supplied to the decoder. We extend our scheme to authenticate images that have undergone contrast, brightness, and affine warping adjustment. Our approach incorporates an expectation maximization algorithm into the Slepian-Wolf decoder. Experimental results demonstrate that the proposed algorithm can distinguish legitimate encodings of authentic images from illegitimately modified versions, despite arbitrary contrast, brightness, and affine warping adjustment, using authentication data of less than 250 bytes per image.
暂无评论