BLOCK ADAPTIVE LINEAR PREDICTIVE CODING WITH ADAPTIVE GAIN AND BIAS

Abstract: A block adaptive linear predictive coding method for encoding a digital image is improved by calculating the mean of the error signals in each block, and selecting a quantizer for each block, using the calculated signal and the calculated mean, from a set of minimum square error two-variable quantizers.

Description: BLOCK ADAPTIVE LINEAR PREDICTIVE CODING WITH ADAPTIVE GAIN AND BIAS A portion of the disclosure of this patent document contains material to which a claim of copyright protection is made. The copyright owner has no objection to the copying of the patent document or the patent disclosure, but reserves all other rights. Technical Field The present invention relates to the field of digital image processing and more particularly to a method for compressing a digital image signal by block adaptive linear predictive coding. Background Art Image compression-is an essential element of many digital imaging systems due to the vast amount of information contained in a digitized image. Because of its simplicity, compression efficiency and ease of implementation, li-near predictive coding (LPC) is often used to compress image data for storage and transmission. LPC refers to the general class of coding techniques in which the difference or error between a given signal value and a linear prediction of the signal value, based on correlated signal values, is coded. The advantage of coding the error signal is that it is less correlated, has lower variance, and is more stationary than the original signal, which make it easier to compress. Depending on the type of image and the level of adaptability to variations in image structure, compression ratios of from 2:1 to 6:1 have been achieved. Both adaptive prediction (see, for example, "DPCM Picture Coding with Adaptive Prediction" by Zschunke, IEEE Transaction on Communications, Vol. Com-25, November, 1977, pages 1295—1302), and adaptive quantization (see, for example, "Adaptive Predictive Coding with Applications to Radiographs" by M. Rabani, L. A. Ray, and J. Sullivan, Medical Instrumentation, Vol. 20, No. 4, July-August, 1986, pages 182-191) have been examined, with most of the emphasis being placed on adaptive quantization due to its superior performance for a given hardware implementation complexity. The predominant adaptive quantization technique is termed block—adaptive wherein a quantizer is selected from a finite set of quantizers to encode a linear block of error signals based on the statistics of independent linear blocks. A number of empirical studies have been conducted to establish the best set of quantizers (see, for example, "On the Design of Quantizers for DPCM Coders: A Functional Relationship Between Visibility, Probability, and Masking" by J. 0. Limb and C. B. Rubinstein, IEEE Transactions on Communications Techniques, COM-26, 1978, pages 573-578). All of these studies have concerned variations in the quantizer range or gain based on the block-to—block variations of the error signal sigma value assuming that the error signal is zero-mean. It is an object of the present invention to provide a new block adaptive LPC technique that improves the compression ratio over the aforementioned gain adaptive techniques for a given image fidelity for all classes of images of interest to a human observer, thereby reducing storage requirements and/or transmission times. Summary of the Invention According to one aspect of the present invention, the object is achieved by taking into account the block—to—block variations of the mean of the error signal from zero as well as the block—to— block variations of the sigma value of the error signal, and adapting to these variations by selecting from a set of two—variable quantizers optimally designed to minimize the square difference between the input error signal and the coded error signal. Excluding the first pixel in each image line and the first line of pixels (which are directly quantized) the error signal is formed for a given pixel by making a prediction of the pixel value from previously coded error signals that are in close proximity to the pixel value in two dimensions, and subtracting the prediction from the pixel value. The error signals in a linear block are then quantized by selecting from a set of two-variable quantizers designed for the class of images to which the current image ■ belongs, by performing the following steps: (1) forming independent linear blocks of error signals; (2) forming, maximum likelihood (ML) estimates for a function of the mean and sigma value of the error signals in a block; (3) from the minimum square error decision regions of the mean and sigma values for the class of images, determining which two-variable decision region contains the ML estimates; (4) using the minimum square error reconstruction values for sigma (gain) and mean (bias) from the selected region to construct the minimum square error quantizer for the error signal in the block; (5) quantizing the error signal in the block employing the constructed quantizer; (6) transmitting or storing the quantized (coded) error signal and a code word for the selected quantizer; and (7) proceeding to the next block and repeating the steps (l)-(6) until the line of image signals is processed. According to another aspect of the present invention, the object is achieved by identifying runs of blocks having low contrast, and encoding these blocks with a flag indicating a run, and a value indicating the number of blocks in the run. According to a further aspect of the present invention, the object is achieved by providing quantizers having different numbers of quantization levels based on the value of sigma, higher values of sigma having more quantization levels. Brief Description of the Drawings Figures la and lb are block diagrams of a compressor and expander, respectively for practicing the image signal processing method according to the present invention; Figure 2 is a graph showing the pixels included in a typical two—dimensional linear predictor, and the prediction equation; Figure 3 is a graph showing a typical error signal histogram illustrating the peaked, Laplacian-like nature of the error signal; Figure 4 is a graph showing a typical joint histogram of the ML estimates for the Laplacian mean and sigma in independent image blocks; Figure 5 is a graph showing the marginal histogram of the ML estimate for the Laplacian mean in independent image blocks; Figure 6 is a graph showing the marginal histogram of the ML estimate for the Laplacian sigma in independent image blocks; Figure 7 is a graph illustrating the quantizer selection for the three—bias, two—gain block adaptive quantizer; Figures 8a and 8b are flow charts illustrating the compressor for a block adaptive gain and bias linear predictive coding technique according to the present invention. Figure 9 is a plot of the log probability of sigma and mean in a polar transformed coordinate system; Figure 10 is a graph showing the quantizer decision and reconstruction values for the polar transformed coordinate system; Figure 11 is a graph showing the quantizer decision and reconstruction values similar to Figure 10, for a reduced region of support, and; Figure 12 is a schematic diagram useful in 5 explaining the present invention. Modes of Carrying Out the Invention Before describing the method of the present invention in detail, the derivation of the mean and sigma ML estimates for a Laplacian signal and the 0 derivation of the minimum square error set of quantizers will be described. The most commonly employed model for probability density function (pdf) of the error signal formed by subtracting from an input pixel value the 5 linear combination of reconstructed pixel values as illustrated in Figure 2 is a Laplacian (see "Digital Image Processing" by W. K. Pratt, page 653, John Wiley & Sons, 1978) which for a non-zero mean signal is given by p(Δ) - 7α exp-^ α . (1) Figure 3 shows a full image error signal histogram that is well fit by this model with v. = 0. Locally, in small image blocks, this 5 zero—mean model breaks down, as illustrated in Figure 4 which shows the joint histogram of the maximum likelihood (ML) estimates for the Laplacian mean and sigma values of a typical image in five pixel linear blocks. The method of maximum likelihood moment C estimation which can be found in many textbooks on mathematical statistics such as " An Introduction to Mathematical Statistics" by R. J. Larsen and M. L. Max, Prentice Hall, Inc., Englewood Cliffs, New Jersey, 1981, gives for the ML estimates 5 . N σ = Σ lΔ(i) - vl, (2) N i=l μ = median{Δ(i),i=l,N} ,N=5. Figure 4 shows that the variations in mean are as significant as the variations in sigma. To optimally adapt to these variations it is necessary to select a set of quantizers that minimizes the total error introduced by the non-stationarity of the differential signal, i.e. variations in μ and σ, as well as the variations in Δ given μ and σ. For a normalized, i.e. unit variance, reconstruction level r; based on estimates μm, σn of the true Laplacian moments μ, σ in a given image block the square error is given by: -.2 (σ n r + μ m ) - (σΔ + μ) (3) The total square error for normalized decision levels dd;; aanndd ttlhe moment decision levels q m and t n are given by To optimize the quantization, it is necessary to minimize this error with respect to q , t , d., n j μ , σn, and rj.. In a given stationary image block defined by μ, σ and estimates μ , σ m n the minimum error decision and reconstruction levels are given by The values of μ and σ are not known exactly and can only be estimated by the quantized values μ , σ . Substitution of μ and σ for μ and n m n a gives for the decision and reconstruction levels d , r .1 + r 1-ι α j 2 Using these in the error minimizations for μm, t gives n 'π' n m + μ m-l q m = 2 c o r _ n + n-1 z n ~ 2 Assuming that μ and σ are independent for the sake of simplicity, the reconstruction equations reduce to To use the reconstruction equations (8) and the equations for q and t in equations (7) to construct the set of minimum square error quantizer models for mean and sigma pdf's, p(μ) and p(σ) must be selected. Figures 5 and 6 show marginal histograms (dashed curves) for the block mean and the block sigma values for a typical image, the Laplacian (mean) and exponential (sigma) models used to represent them, and the reconstruction levels from equations (8) (solid curves) for a three—bias, two—gain quantizer. The decision levels from equations (7) lie halfway between the reconstruction levels. This three— y-two quantizer is illustrated in Figure 7, where the dashed lines represent the decision regions and the * is the optimal two—variable quantizer in each region. Referring now to Figure la, a generic image processing apparatus employing the block adaptive gain and bias linear predictive coding technique according to the present invention will be described. An image or scene is sampled by a scanning apparatus 10, such as a video scanner or graphic arts scanner. The sampled image is digitized by an analog—to— igital converter 12 and the digitized sampled image is input into the compressor where it is delayed one line (14) and the length of one block (16) along the current line. Predictions are made (18) for the pixel values in each block using the previous coded pixel values on the line and coded pixel values on the previous line. These predictions are subtracted from the actual pixel values and the ML estimates (20) for the error signal mean and sigma are calculated in each block according to equations (2). The ML estimates are then used to select (22) the quantizer q (see Figure 7), and the error signal Δ is quantized (24) using the selected quantizer, with all error signals in the block in decision region j being replaced by reconstruction levels r.. The quantized error signal Δ is fed back for subsequent predictions (18) and coded (26) along with the selected quantizer q by a lossless minimum redundancy coding technique such as Huffman coding or run-length coding (see for example "Digital Image Processing" by W. K. Pratt, Chapter 22.3, John Wiley & Sons, 1978). The quantized coded error signal Δ and quantizer q are then transmitted or stored. The decompressor accepts the coded values for the selected quantizer q and the quantized error signals Δ, decodes (28) the values and performs the inverse process of the compressor by delaying the signal one line (30) and one block (32), scaling the signal (34) according to the selected quantizer and using the previously decompressed pixel values for predicting (36) the pixel value and adding the predicted pixel values to the decoded error signals. The image compression and decompression apparatus comprise a programmed general purpose computer such as a microprocessor or alternately a custom designed digital signal processing circuit. The decompressed image can be supplied to an output device 38, such as a CRT display .or a hardcopy recorder in the event that the image coding was performed to reduce the transmission time or storage requirements of the image. The quantizer selection apparatus (22) includes a memory that contains the quantizer decision and reconstruction levels q , The predictor apparatus 18 includes a memory that contains the prediction coefficients a Q , a., a 2 , a- for forming the linear prediction. The quantizer apparatus 24 includes a memory that contains Max quantizer decision and reconstruction values for a zero-mean, unit variance Laplacian signal. See for example, "Digital Image Processing" by W. K. Pratt, Table 6.1-1, page 144, John Wiley & Sons, 1978. The compressor for the block adaptive gain and bias linear predictive coding technique by programming a microprocessor will now be described with reference to the flow charts shown in Figures 8a and 8b. It will be obvious to one skilled in the art how to program the microprocessor from the following description. The following description assumes that the image signal is presented to the compressor in a linear raster scan. At the start of scan, internal counters p for the pixel number, 1 for the scan line, b for the pixel number in a block, and k for the block number are initialized (100). Counters 1 and p are incremented by 1 (102, 104) and " a check (106) is made for the first line 1 = 1. If true, p is compared (108) with the line length L and if it is less than or equal to L, the pixel value x 1 is assigned (110) to the reconstructed pixel value x„ -, for future use in prediction and is transmitted (112). The pixel number p is incremented (104) by 1 and the process is repeated until p is greater than L at which point the first line has been transmitted without compression. The pixel number is reinitialized (110) and 1 and p are incremented by 1. The check for first (106) and last (114) line are false, which is followed by a check (116) for the first pixel, p -= 1. If true, x , is assigned (110) to the reconstructed pixel x ,, and transmitted (112). Next p is incremented by 1 (104). If false the block count b is incremented by 1 (118) and a prediction x , is formed (120) for the current pixel using the prediction coefficients (122) from memory and the reconstructed pixels x , around the current pixel. P.1 The error signal Δ, is calculated (124) and stored (126) in a memory equal to the block size. A check is made (128) for the last pixel in a line. If false, p and b are incremented by 1 (104, 118), new prediction and error signals are calculated (120, 124), and the error signal is stored (126) until b = B (130) at which time the error signal memory contains one block. ML estimates for the mean error μΛ and sigma error σ^ are then made (132) in the block. If p = L (128), the error signals accumulated in the memory (126) to that point are used to estimate the mean and sigma error values. These estimates are then used to select the quantizer as follows. The two variable quantizer counters s fi and s, are initialized (134). The mean estimate μ. is incrementally (136) compared with the mean decision levels q stored in ascending order in memory (138) until it 0is less than a particular level (140) identifying the estimate as contained within that decision region. The reconstruction mean μ .for that decision region then defines the quantizer 0bias (142). In a like manner, the sigma estimate a . is incrementally compared (144, 146, 148) with the sigma decision levels t , until a decision region is identified and the reconstruction a for the decision region is selected as the quantizer s l gain (142). The decision d. and reconstruction r. levels for an n—bit zero—mean, unit—sigma Laplacian Max quantizer are recalled from memory (150) and numerically shifted by μ and scaled by a . The error signal n the block is then quantized by initializing the decision region j and the pixel number m (152). These are then incremented by 1 (154) and a check (156) is made for the end of the block, m>b. If false, the error signal Δ is retrieved from memory (126) and incrementally compared . (159, 160) with decision levels d, arranged in ascending order until it is less than a particular level identifying it as contained within that decision region. The error signal is then replaced by the reconstruction level r. (162) coded (164) and transmitted (166). The current pixel number number n is calculated (168) and the prediction and quantized error signal Δ are added (170) to obtain the current reconstructed pixel value~x_n,,l which is stored for future predictions. The decision level count j is reinitialized (153), and incremented by 1 along with the block pixel count m (154). If m>b (156) and all the error signals in the current block have been quantized, coded, and transmitted, the selected quantizer for the k block Q, (172) is coded (174) and transmitted (176) as overhead. The block count is reinitialized (179) and a check is made (180) for the end of line. If false, block count k is incremented by 1 (182), the pixel value is incremented by 1 (104) and a new block is processed. If true, the pixel value and block count are reinitialized (184), 1 is incremented by 1 (102) and the next line is processed. This process is continued until the last line T is processed in which case the full image has been transmitted and the compressor stops (186). The decompressor accepts the transmitted signals and performs predictions and addition processes identical to those defined by the reconstruction steps (120, 170) in the flow chart of Figures 8a, 8b using the transmitted quantizer (176) for scaling the transmitted Δ values. Results of the applying the image compression and decompression method according to the present invention to a 11—bit (i.e. 0—2047) aerial image and an 11—bit portrait will now be discussed. Tables I and II show the root mean square error in 11—bit counts between the original and compressed/decompressed image for the aerial and portrait images respectively for 1-bit non-adaptive LPC, 1-bit gain adaptive LPC, and the 1—bit gain and bias adaptive LPC method of the present invention. For reference, the input ' sigma values for the image and error image in 11— it counts are 403 and 112 respectively for the aerial image and 834 and 83 respectively for the portrait. The signal—to—noise improvement for the aerial image is approximately 4dB, i.e. 93->59 rms noise counts, and for the portrait it is 6dB, i.e. 109->51 rms noise counts. TABLE I = Aerial Image rms error LPC method /11-bit counts non—adaptive / 141 gain-adaptive / 93 gain and bias adaptive/ 59 TABLE II = Portrait rms error LPC method /11-bit counts non-adaptive / 171 gain-adaptive / 109 gain and bias adaptive/ 51 Extensions of the present invention will now be discussed. Reference to Figure 4 shows that the assumption of independence for μ and σ used to simplify equations (8) is not strictly correct. The figure displays a radial symmetry rather than the rectangular symmetry required for independence Indicating that the variable defined by μ ' 2 + σ ' 2, and arctan (?) are more likely independent variables. μ A transformation of this form followed by independent sealer quantizations, such as in equations (8) can be used to define the decision and reconstruction levels in terms of the transformed variables and an inverse transformation performed on these levels to determine the mean and sigma decision and reconstruction levels. The resultant decision regions will be annular and the reconstruction levels will lie along radial arcs. The transformation of Fig. 4, is shown' in Fig. 9, and the resultant quantizer decision and reconstruction values for seven quantizers are shown in Fig. 10. Also to simplify the implementation, the ML estimates for μ and σ in equation (2) have been replaced by and N σ 2 = ∑ Δ 2 (i),N=5. (10) N i=l In addition to allowing for a parallel estimation of σ by not subtracting μ, equation (10) produces an image quality improvement because it increases the weighting of large Δ(i) values compared to equation (2) causing larger steps in the quantizers and better rendition of edges. By not subtracting μ the region—of- support of Fig. 10 is reduced as shown in Fig. 11. The new decision regions and reconstruction levels represent a uniform Max quantizer for arctan (?) and an exponential Max quantizer for μ + σ. μ A second improvement regards the design of the selected quantizes to have a variable number of decision and reconstruction levels. For example, the high or low mean, high sigma value quantizers represent high contrast positively or negatively sloped edges which may require more levels than lower contrast image structures for adequate coding. Increasing the number of levels for these quantizers does not increase the required overhead information but it does cause a variable number of differential signal bits/block. Reference to Fig. 4, however, shows that the total number of bits for the compressed image will not be increased signi icantly by such a modification because the high or low mean, high sigma value quantizers are not used often in a typical image. For highly detailed graphical images, it has been empirically determined that the low-to—medium contrast (i.e. low—to— edium σ) quantizers, (see decision regions 1—4 in Fig. 11) require 3 levels, and the high contrast quantizers (i.e. high o) (see decision regions 5—7 in Fig. 11) require 8 levels. This trend toward fewer levels in low contrast regions, have been extended to the limit of no leve'ls for extremely low contrast areas of visually subthreshold modulation. In such areas the output image is defined by a fixed function of the previously reconstructed pixels that requires no pixel information. This is termed a "run" and it is defined by comparing a fixed threshold value with a structure estimate S in a 1 x N image block where S is given by the mean absolute difference between the pixel values in the block and averages of their three nearest reconstructed neighbors. This is shown schematically in Fig. 12. With i denoting the first pixel in a block and i. the line number, S is where X. « is an input pixel value, A, - is given by A i,£ ~ 3 X i-1,i +X i-l,4-l +X i,2-1 (12) and X is the reconstructed value for the 4th line th 1,1 ρixel, using A. . as the reconstruction function within the block. For a fixed threshold T, the block is part of a run if S ≤ T. The number of contiguous runs times the number of pixels in a block defines the total number of pixels that are reconstructed at the average-value A. 0 . A flag bit indicates that a run is beginning 1 , x. and the length of the run, in blocks, is transmitted in the next k bits. It has been empirically determined that the optimal value for k is 2, which 2 corresponds to a maximum run length of 2 x 5 or 20 pixels. For " the maximum length and a T value of 4, the number of runs in a typical high—qualit , continuous—tone image ranges from 30—60% corresponding to an approximate bit—rate reduction of 0.5—1.0 bits/pixel without visible degradation. To improve the bit—rate without a loss in image quality, Huffman coding and decoding (see, for example, Digital Signal Processing by R. C. Gonzalez and P. Wintz, Addison—Wesley Co., Pages 239-241) has been added for the quantizer, the run length k, and the 3 and 8 level differential signal values. Fig. 4 shows that the low—sigma, zero—mean quantizer is selected a high percentage of the time and therefore it is coded with the fewest bits and the remaining quantizers being coded with a number of bits that is inversely proportional to their usage. For runs it has been determined that long lengths, i.e. blocks, are most probable and therefore assigned the fewest bits with the remaining lengths assigned more bits according to their inverse probabilities. For the 3 and 8 level differential signals the central levels which correspond to the mean reconstruction value are used more often and therefore coded with the fewest bits and the larger differences are coded with more bits. Example Huffman codes are shown in Tables 1, 2, 3, and 4 for the quantizer selection, run length and differential signals respectively. Quantizer Number Average Huffman Code (see Fig. . 11) Probability 1 0.50 0 2 0.14 001 4 0.14 101 3 0.07 0011 5 0.06 1011 7 0.06 0111 6 0.03 1111 Table 1: Huffman codes for quantizer selection. Run Length Average ' Huff:man Code in Blocks Probability 4 0.41 0 1 0.32 01 2 0.17 011 3 0.10 111 Table 2: Huffman codes for run lengths Level Number A Avveerraaggee Huffman Code Probability 2 0 0..6600 0 1 00..2200 01 3 0 0..2200 011 Table 3: Huffman codes for 3 level quantizer. -18- Level Number Average Huffman Code Probability 4 0.22 10 5 0.22 01 3 0.19 11 6 0.19 000 2 0.08 1100 7 0.08 00100 1 0.01 010100 8 0.01 110100 Table 4: Huffman codes for 8 level quantizer. Implementation of the coding and decoding techniques have been carried out in the C programming language on an Intel computer for a high quality digital graphics image transmission system that utilizes standard telephone communication links. The coding and decoding software are listed in Appendix A and Appendix B respectively. Industrial Applicability and Advantages The digital image processing method of the present invention is useful in systems for compressing digital images for storage or transmission. The invention has the advantage that compression ratios are substantially improved without substantially adding to the complexity of the hardware for compressing and expanding the image.

Claims: Claims: 1. An improved block adaptive linear predictive coding method for compressing and transmitting or storing a digital image of the type including the steps of: dividing the image into 1 x B blocks of pixels; forming a two—dimensional prediction for each pixel value based upon a linear combination of neighboring pixel values; subtracting successive predictions from actual pixel values to form a one—dimensional block of error signals; calculating the sigma (σ) of the error signals in each block; selecting a quantizer for each block from a set of scaled sigma Max quantizers using the calculated sigma; quantizing the error signals in each block with the selected quantizer; transmitting or storing the first line of an image and the first pixel in each line, a code word for the quantizer, and the quantized error signals as the compressed image, wherein the improvement comprises the steps of: (a) calculating the mean (μ) of the error signals in each block; and (b) selecting the quantizer for each block using the calculated sigma and the calculated mean from a set of minimum square error two—variable quantizers based on probability models for a function of the mean (μ) and sigma (α) values. 2. The method claimed in Claim 1, wherein the mean (μ) and signal (σ) values are employed to select the quantizers, and the probability model for the mean (μ) is a Laplacian, and the probability model for sigma (σ) is an exponential. 3. The method claimed in Claim 1, further comprising the steps of: (a) performing a polar transformation on the mean (μ) and sigma (σ) values, where the polar angle is arctan — and the polar radius is^v.' + σ 12 and (b) The transformed polar angle and polar radius values are employed to select a set of minimum square error two—variable quantizers based upon a uniform probability model for the polar angle and an exponential probability model for the polar radius. 4. An improved block adaptive linear predictive coding method for compressing and transmitting or storing a digital image of the type including the steps of: dividing the image into 1 x B blocks of pixels; forming a two—dimensional prediction for each pixel value based upon a linear combination of neighboring pixel values; subtracting successive predictions from actual pixel values for form a one—dimensional block of error signals; calculating the sigma (σ) of the error signals in each block; selecting a quantizer for each block from a set of scaled sigma Max quantizers using the calculated sigma; quantizing the error signals in each block with the selected quantizer; transmitting or storing the first line of an image and the first pixel in each line, a code word for the quantizer and the quantized error signals as the compressed image, wherein the improvement comprises the steps of: (a) prior to the step of calculating the sigma value, comparing the average absolute value S of the difference between the input signal values and the average A of their three nearest reconstructed neighbors in a block with the threshold value T, and if S is less than T, treating the block as one in a run of blocks for which no sigma value is calculated, no quantizer is selected and no error signal is transmitted; and (b) generating and transmitting a flag indicating a run of blocks and a value indicating the length of the run. 5. The method claimed in Claim 4, further including the steps of: (a) calculating the mean (μ) of the error signals in each block; and (b) selecting the quantizer for each block using the calculated sigma and the calculated mean from a set of minimum square error two—variable quantizers based on probability models for a function of the mean (μ) and sigma (σ) values. 6. The method claimed in Claim 5, wherein the mean (μ) and sigma (σ) values are employed to select the quantizers, and the probability model for the mean (μ) is a Laplacian and the probability model for sigma (σ) is an exponential. 7. The method claimed in Claim 5, further including the steps of: (a) performing a polar. transformation on the mean (μ) and sigma ( ) values, where the polar angle is arctan — and the polar radius is (b) The transformed polar angle and polar radius values are employed to select from a set of minimum square error two—variable quantizers based upon a uniform probability model for the polar angle and an exponential probability model for the polar radius. 8. An improved block adaptive linear predictive coding method for compressing and transmitting or storing a digital image of the type including the steps of: dividing the image into 1 x B blocks of pixels; forming a two—dimensional prediction for each pixel value based upon a linear combination of neighboring pixel values; subtracting successive predictions from actual pixel values for form a cne—dimensional block of error signals; calculating the sigma (σ) of the error signals in each block; selecting a quantizer for each block from a set of scaled sigma Max quantizers using the calculated sigma; " quantizing the error signals in each block with the selected quantizer; transmitting or storing the first line of an image and the first pixel in each line, a code word for the quantizer and the quantized error signals as the compressed image, wherein the improvement comprises: The quantizers having different numbers of quantization levels based on the value of σ, higher values of σ having more quantization levels. 9. The method claimed in Claim 1, 2, or 3, wherein the quantizers have different numbers of quantization levels based on the value of σ, higher values of σ having more quantization levels. 10. The method claimed in Claims 1, 2, 3, or 8, further including the steps of Huffman encoding the code "word for the quantizer and the error signals. 11. The method claimed in Claims 4, 5, 6, or 7 wherein the quantizers have different numbers of quantization levels based on the value of σ, higher values of a having more quantization levels. 12. The method claimed in Claims 4, 5, 6, or 7, further including the steps of Huffman encoding the code word for the quantizer, the error signals, and the run lengths. 13. The method claimed in Claim 9, further including the step of Huffman encoding the code word for the quantizer and the error signals. 14. The method claimed in Claim 11, further including the steps of Huffman encoding the code word for the quantizer, the error signals, and the run lengths.

Inventors: SULLIVAN JAMES ROBERT, SULLIVAN, JAMES, ROBERT
Applicants: EASTMAN KODAK CO, EASTMAN KODAK COMPANY
Application year: 1988
Main classification: H04N7
IPC codes: G06T9, H04N1, H04N7