A. N. Netravali and J. O. Limb, "Picture coding: A review", Proceedings of IEEE, Vol. 68, No. 3, pp. 366-406, 1980  Home/Search   Document Not in Database   Summary   Related Articles   Check

....on the structure of images to be compressed) allows for a larger number of contexts without penalty in overall model cost. The discussion thus far applies to general parametric classes of information sources. Motivated by the application of lossless image compression, in which prediction [8] is a very useful tool to capture expected relations (e.g. smoothness) between adjacent pixels, our focus henceforth will be con ned to the class of integer valued sources with a distribution given by the two sided geometric (TSG) model. It has been observed [9] that prediction errors are ....

A. Netravali and J. O. Limb, \Picture coding: A review," Proc. IEEE, vol. 68, pp. 366-406, 1980.

....a midriser uniform quantizer can never have an entropy of less than one bit per sample, since the maximum possible probability of a quantization region in that case is 1 2. 2. 3 MSE Suboptimality of Uniform Quantization for Laplacian Sources It has been asserted by several authors [19] 25] 36] 37][38], all of whom cite Berger[23] 22 that when a Laplacian source is to be quantized subject to an entropy constraint, the uniform quantizer is exactly optimal in the MSE sense for all values of entropy. This assertion, which appears to be a misinterpretation of Berger s findings, can be seen to be ....

Netravali, A.N., and Limb, J.O., "Picture Coding: A Review," Proceedings of the IEEE, vol. 68, no. 3, Mar. 1980, pp. 366-406.

....H.263, JPEG, and MPEG. These codes combine uniform scalar quantization of the transform coe#cients with an e#cient lossless coding of the quantizer indices, as will be considered in the next section as a variable rate quantizer. For discussions of transform coding for images see [533] 422] [375], 265] 98] 374] 261] 424] 196] 208] 408] 50] 458] More recently transform coding has also been widely used in high fidelity audio coding [272] 200] Unlike predictive quantizers, the transform coding approach lent itself quite well to the Bennett high resolution ....

A. N. Netravali and J. O. Limb, "Picture coding: a review," Proc. IEEE, vol. 68, pp. 366--406, March 1980.

....theory can be used to evaluate how the change affects its performance. Index Terms Motion estimation, optimal bit allocation, ratedistortion theory, quantizer selection, video compression. I. INTRODUCTION V IDEO compression has attracted considerable attention over the last decade [2] [5]. Several standards for video coding such as MPEG 1 [6] MPEG 2 [7] H.261 [8] and most recently, H.263 [9] have been established. There is a large redundancy in any video sequence which has to be exploited by every efficient video coding scheme. This redundancy is divided into temporal and ....

A. N. Netravali and J. O. Limb, "Picture coding: A review," Proc. IEEE, vol. 68, pp. 366--406, Mar. 1980.

....of compression ratios, should rather be applied to obtain competitive compression at significantly lower complexity levels. On the other hand, simplicity driven schemes (e.g. the most popular version of the lossless JPEG standard [19] propose minor variations of traditional DPCM techniques [20], which include Huffman coding [21] of prediction residuals obtained with some fixed predictor. These simpler techniques are fundamentally limited in their compression performance by the first order entropy of the prediction residuals, which in general cannot achieve total decorrelation of the ....

....by fitting parametric distributions with few parameters per context to the data. This approach allows for a larger number of contexts to capture higher order dependencies without penalty in overall model cost. Although there is room for creative combinations, the widely accepted observation [20] that prediction residuals in continuous tone images are well modeled by a two sided geometric distribution (TSGD) makes this model very appealing in image coding. It is used in [10] and requires only two parameters (representing the rate of decay and the shift from zero) per context, as discussed ....

[Article contains additional citation context not shown here]

A. Netravali and J. O. Limb, "Picture coding: A review," Proc. IEEE, vol. 68, pp. 366--406, 1980.

....the Golomb code, originally designed for one sided geometric distributions of non negative integers, so as to apply to the encoding of any integer. Index Terms: image compression, adaptive coding, Golomb codes, geometric distribution, low complexity 1 Introduction Predictive coding techniques [1] have become very widespread in lossless compression of continuous tone images, due to their usefulness in capturing expected relations (e.g. smoothness) between adjacent pixels. It has been observed [2] that a good probabilistic model for prediction errors is given by a two sided geometric ....

A. Netravali and J. O. Limb, "Picture coding: A review," Proc. IEEE, vol. 68, pp. 366-- 406, 1980.

....in data compression has grown rapidly the last 50 years. This resulted in a large number of both lossless and lossy compression methods. It is difficult to create an exhaustive list of all techniques and their variations that have been developed throughout these years. Review papers (e.g. [Netravali80, Jain81a, Bassiouni85, Wong95]) usually provide an overview of the latest developments in this area and the major techniques used. In the same spirit, only some of the major image compression methods will be reviewed here. These methods are representative of research directions in data compression. Chapter 2: Image ....

....Chapter 2: Image Compression 7 different regions in the same image have different optimal prediction coefficients. To account for this, adaptive prediction can be used, which splits the image into blocks and then computes independently the prediction coefficients for each block. Netravalli in [Netravali80] presented a review of predictive coding techniques. 2.2.6 Hierarchical Interpolation (HINT) Hierarchical Interpolation [Roos88] is a multi resolution coding scheme based on subsampling. It starts with a low resolution version of the input image, and it interpolates the pixel values to generate ....

Netravali A.N., and Limb J.O., "Picture coding: a review", Proc. IEEE, vol. 68, no. 3, pp. 366-406, 1980.

....H.263, JPEG, and MPEG. These codes combine uniform scalar quantization of the transform coefficients with an efficient lossless coding of the quantizer indices, as will be considered in the next section as a variable rate quantizer. For discussions of transform coding for images see [533] 422] [375], 265] 98] 374] 261] 424] 196] 208] 408] 50] 458] More recently transform coding has also been widely used in high fidelity audio coding [272] 200] Unlike predictive quantizers, the transform coding approach lent itself quite well to the Bennett high resolution ....

A. N. Netravali and J. O. Limb, "Picture coding: a review," Proc. IEEE, vol. 68, pp. 366--406, March 1980.

....discrete cosine transform (DCT) is most commonly used because of its computational simplicity and its good performance. Indeed DCT coding is the basic approach dominating current image and video coding standards, including H.263, JPEG, and MPEG. For discussions of transform coding for images see [377, 297, 267, 197, 77, 268, 192, 298, 149, 160, 293, 317]. More recently transform coding has also been widely used in high fidelity audio coding [202, 152] Unlike predictive quantizers, the transform coding approach lent itself quite well to the Bennett high resolution approximations, the classical analysis being Huang s and Schultheiss development ....

A. N. Netravali and J. O. Limb, "Picture coding: a review," Proc. IEEE, Vol. 68, pp. 366-406, March 1980. 85

....and Sub band Coding schemes. In addition, hierarchical coding schemes which utilize components from the various techniques have been proposed to improve the compression ratios or reduce the processing complexity of a given technique. A good survey of several of the above schemes can be found in [8,9]. 1) Pulse Code Modulation: The PCM derived schemes work by using a predictor function in order to determine the value of the current pixel based upon the values of previously encoded pixels. The simplest predictor uses a 2 level quantizer and is termed Delta Modulation. It has the disadvantage ....

Netravali, A., Limb, J., "Picture Coding: A Review," Proceedings of the IEEE, Vol. 68, No. 3, pp. 366--406, March 1980.

....of compression ratios, should rather be applied to obtain competitive compression at significantly lower complexity levels. On the other hand, simplicity driven schemes (e.g. the most popular version of the lossless JPEG standard [20] propose minor variations of traditional DPCM techniques [21], which include Huffman coding [22] of prediction residuals obtained with some fixed predictor. These simpler techniques are fundamentally limited in their compression performance by the first order entropy of the prediction residuals, which in general cannot achieve total decorrelation of the ....

....by fitting parametric distributions with few parameters per context to the data. This approach allows for a larger number of contexts to capture higher order dependencies without penalty in overall model cost. Although there is room for creative combinations, the widely accepted observation [21] that prediction residuals in continuous tone images are well modeled by a two sided geometric distribution (TSGD) makes this model very appealing in image coding. It is used in [11] and requires only two parameters (representing the rate of decay and the shift from zero) per context, as discussed ....

[Article contains additional citation context not shown here]

A. Netravali and J. O. Limb, "Picture coding: A review," Proc. IEEE, vol. 68, pp. 366--406, 1980.

....Similar images. 1 Corresponding author. E mail: kosmas bit.csc.lsu.edu 2 E mail: tyler bit.csc.lsu.edu 1. Introduction Research in data compression has grown rapidly the last 50 years producing a large number of lossless and lossy compression methods (for some excellent reviews see Netravali and Limb, 1980; Jain, 1981; Bassiouni, 1985; Rabbani and Jones, 1991; Wong et al. 1995) Data compression is possible because of data redundancies. In gray scale digital images three basic data redundancies can be identified and reduced: the coding redundancy, the interpixel (or spatial) redundancy, and the ....

Netravali, A.N., Limb, J.O., 1980. Picture coding: a review. Proc. IEEE 68, 366-406.

....INTRODUCTION Most research in image quantization has been for the purpose of data compression in picture transmission systems. In these systems, quantization is frequently used in combination with other compression methods such as transform coding, DPCM, and coarse sampling (see Netravali and Limb [35]) Until recently, most image processing work was on monochromatic images. The research described in this thesis addresses itself to the problem of color image display rather than image transmission or storage. To solve this problem, we borrow some monochromatic quantization methods which are ....

Netravali, A. N., and J. O. Limb, "Picture Coding: A Review," Proc. IEEE, Vol. 68, No. 3, Mar. 1980, p. 366.

....Symposium on Information Theory, Ulm, Germany. y This work was done while the author was on sabbatical leave at Hewlett Packard Laboratories, Palo Alto, California. The author is also with Hewlett Packard Laboratories Israel in Haifa, Israel. 1 Introduction Predictive coding techniques [1] have become very widespread in lossless image compression, due to their usefulness in capturing expected relations (e.g. smoothness) between adjacent pixels. It has been observed [2] that a good probabilistic model for image prediction errors is given by a two sided geometric distribution (TSGD) ....

A. Netravali and J. O. Limb, "Picture coding: A review," Proc. IEEE, vol. 68, pp. 366--406, 1980.

....and interpolation algorithms. Keywords: Video coding, image compression, low bit rate, motion compensation, image warping, geometric transforms. 1. Introduction Interframe predictive coding is one of the most powerful image coding technique which can eliminate redundancy in moving scenes [1, 2]. In a general interframe predictive coder, the input frame is subtracted from the predicted preceding frame and the difference signal is coded and transmitted. As information rate is associated with the difference signal, its reduction will reduce the bit rate and such requirement necessitates a ....

A. Netravali and J. O. Limb, "Picture coding: A review," IEEE Proceedings, vol. 68, pp. 366--406, March 1980.

No context found.

A. N. Netravali and J. O. Limb, "Picture coding: A review", Proceedings of IEEE, Vol. 68, No. 3, pp. 366-406, 1980

No context found.

A.N. Netravali, J.O. Limb, Picture coding: a review, Proc. IEEE 68 (3) (March 1980) 366--406.

No context found.

A. Netravali and J. O. Limb, "Picture coding: A review," Proc. IEEE, vol. 68, pp. 366--406, 1980.

No context found.

A. Netravali and J. O. Limb, "Picture coding: A review," Proc. IEEE, vol. 68, pp. 366--406, 1980.

No context found.

A. Netravali and J. O. Limb, "Picture coding: A review," Proc. IEEE, vol. 68, pp. 366--406, 1980.

No context found.

A. N. Netravali and J. O. Limb, "Picture coding: A review," Proc. IEEE, vol. PROC-68, pp. 366-406, Mar. 1980.

No context found.

A. N. Netravali and J. O. Limb, "Picture Coding: A Review," Proceedings of the IEEE, Vol. 68, No. 3, pp. 366-406, March 1980.

No context found.

A. Netravali and J. O. Limb, `Picture coding: A Review,' Proceedings of IEEE, vol. 68, pp. 366-406, 1980.

No context found.

Netravali, A. and Limb, J.O. (1980). Picture coding: a review. Proceedings of the IEEE, 68(3), 366-406.

No context found.

A. N. Netravali and J. O. Limb, Picture Coding : A Review, Proc. IEEE, 68, 366-406 (1980).

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC