Abstract:
An arithmetic coding method for encoding each pixel of image containing half-tones in an image processing system is provided. This method includes the steps of: initializing an encoder before encoding each line; reading a pixel of a dithered image signal; determining reference pixels being an immediately preceding pixel, and a preceding pixel by a horizontal size of a dithering matrix for the read pixel; selecting a corresponding context number according to the values of the two reference pixels and a remainder obtained by dividing a horizontal position of the read pixel by the horizontal size of the dithering matrix; identifying context information corresponding to the context number, the context information including a more probable symbol and a probability therefor; encoding the more probable symbol if it matches the read pixel value, and encoding a less probable symbol otherwise; and updating a probability estimation of the context information.

Description:
FIELD OF THE INVENTION 
     The present invention relates to a method and device for arithmetically encoding an image containing half-tones and, more particularly, to a one-dimensional arithmetic coding method and device in a facsimile machine. 
     BACKGROUND OF THE INVENTION 
     Images containing half-tones can be binarized using dither matrices. A dither matrix is a two-dimensional matrix of thresholds. The images are binarized by comparing each successive pixel of a generated image signal to a corresponding threshold of the dither matrix and generating a binary signal, a dithered signal, in dependence upon whether the pixel value of the image signal is greater or smaller than the corresponding threshold in the dither matrix. Therefore, only a single bit is allocated to each pixel in the dithered signal. Further, since adjacent pixels are binarized in response to different thresholds, the local density of the dithered signal will correspond to the density in the original image. A more complete explanation of half-tone binarization using a dither matrix can be found in U.S. Pat. No. 4,766,499 to Inuzuka. 
     Group III facsimile machines incorporate modified Huffman encoders as recommended by CCITT T.4. Modified Huffman encoding is a one-dimensional coding method in which code words corresponding to black/white run-lengths are generated. The modified Huffman encoding technique used by Group III facsimiles, however, is optimized to the first through eighth characters of the CCITT test chart. Consequently, this technique does not yield an adequate compression when encoding nonstandard images that do not contain characters of the CCITT test chart. Moreover, half-tone images that have been binarized using dither matrices also have a considerably low compression rate when using the modified Huffman encoding method. In some cases, the coded data from half-tone images can even exceed the data in the original image. For example, in a half-tone image on A-4 paper, using a transmission speed of 9600 bits per second (bps), approximately ten minutes are required to transmit the image. Therefore, this conventional technique is inadequate for the transmission of half-tone and nonstandard images. 
     SUMMARY OF THE INVENTION 
     Accordingly, it is object of the present invention to provide a coding method that provides high compression for nonstandard and half-tone images. 
     It is another object of the present invention to provide an improved coding method. 
     It is still another object of the present invention to provide a one-dimensional coding method capable of highly compressing half-tone images. 
     It is a further object of the present invention to provide an arithmetic coding method that shortens a data transmission time. 
     It is another object of the present invention to provide an arithmetic coding method that reduces data storage space of an encoder. 
     In an image processing system including a model for generating context numbers in response to masking on current pixels with a local template, adapters for storing stored context information corresponding to the context numbers, and an encoder for encoding the current pixels in response to the storm context information, an arithmetic coding method comprising: initializing the encoder; generating dithered signals by thresholding pixels of image data in response to a dither matrix; identifying reference pixels in the dithered signals corresponding to the current pixels, the reference pixels being an adjacent pixel and a pixel preceding the current pixel by a horizontal size of the dithering matrix; generating a selected context number in response to the reference pixels and a remainder obtained by dividing a horizontal position of the current pixels by the horizontal size of the dithering matrix; encoding a more probable symbol if the more probable symbol of the stored context information corresponding to the selected context number is equal to the current pixels, and encoding a less probable symbol if the more probable symbol of the context information corresponding to the context number is not equal to the current pixel; updating a probability estimation of the context information; checking for completion of encoding a current line; and checking for completion of encoding for a current page after completion of the current line. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     In more complete appreciation of this invention, and many of the attendant advantages thereof, will be readily apparent as the same becomes better understood by reference to be following detailed description when considered in conjunction with the accompanying drawings in which like symbols indicate the same or similar components, wherein: 
     FIG. 1 is a block diagram of a Conventional facsimile machine; 
     FIG. 2 in a block diagram of a one-dimensional arithmetic encoding device of the present invention; 
     FIG. 3 is an illustration of a local template of applied by the device of FIG. 2; 
     FIG. 4 is a context table stored for adapter 23 of FIG. 2; 
     FIG. 5 is an illustration of repeated thresholds in an arbitrary line of pixels; 
     FIG. 6 is an illustration of an image having a size of 2×12 pixels expressed as half-tones by a 4×4 dither matrix; 
     FIG. 7 is a context table used for coding the image of FIG. 6; and 
     FIG. 8 is a flowchart of arithmetic coding operations of the invention. 
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT 
     Turning now to FIG. 1, a block diagram of a Conventional facsimile machine is illustrated. The facsimile has a Central Processing Unit 10 for controlling the operation of the facsimile and its several units according to a predetermined program. A document scanner 20 scans a document to generate a digital image data in which each pixel is represented by a plurality of bits. The Central processing unit, in conjunction with a signal processing portion 30, stores and then compares the digital image data from the document scanner 20 to a dither matrix. On the basis of comparisons between the thresholds of the dither matrix and the digital image signal, a dithered signal is generated in which each pixel is represented by a single bit. The dithered signal is then encoded and compressed for transmission. A transmitter 50 modulates the encoded signals from the signal processing portion for transmission across a public switched telephone network (PSTN) to another system. 
     The transmitter 50 also receives and demodulates transmissions from other system received via the PSTN. The demodulated transmissions are provided to central processing unit 10 and signal processing portion 30 where the demodulated transmissions are decoded. A printer 40 then prints the decoded transmissions. 
     Turning now to FIG. 2, a one-dimensional arithmetic coding device constructed according to the principles of the present invention is illustrated. The one-dimensional arithmetic coding device of FIG. 2 would be realized as a portion of the CPU 10 in FIG. 1, i.e. the model 21 is symbolic of a number of functions performed by the CPU 10 of FIG. 1. The one-dimensional arithmetic coding device includes a model 21 that receives an image signal X(i,j) from the document scanner 20. Each pixel of the image signal X(i,j) is then binarized in the model in dependence upon a four-by-four dither matrix to generate a dithered signal I(i,j). More specifically, if the four-by-four dither matrix had thresholds of A, B, C, and D on a single horizontal row, each of a first fifteen pixels of the image signal&#39;s horizontal row would be recursively thresholded in response to the thresholds A, B, C and D as shown in FIG. 5. The result of this thresholding of the image signal X(i,j) yields the dithered signal I(i,j). Here, i and j represent the horizontal and vertical coordinate position of a pixel. 
     After generating the dithered signal I(i,j), the model 21 generates a context number for each pixel on the basis the pixel&#39;s horizontal position divided by four and the pixel&#39;s reference pixels. Specifically, for each pixel, the references pixels are an immediately preceding pixel and a pixel preceding the pixel by four pixels in the dithered signal. That is, for a pixel (i,j), the model 21 generates a context number in response to the remainder of i divided by 4, the dithered signal pixel value I(i-1,j), and the dithered signal pixel value I(i-4,j). 
     Sixteen possible context numbers exist if a four-by-four dither matrix is used since there are four possible remainders of a pixel&#39;s horizontal position divided by four and four possible combinations of the two reference pixel values. FIG. 7 illustrates the conditions under which each of the different context numbers would be generated. For example, if the horizontal position i were 9, and the dithered signal pixels values I(9-4, j) and I(9-1,j) were 1 and 0, respectively, context number 6 would be selected. That is, since the remainder of the horizontal position divided by four is 1, the possible context numbers from FIG. 7 are 4, 5, 6, and 7. Only context number 6, however, corresponds to pixels (5,j) and (8,j) being 1 and 0, respectively. 
     FIG. 3 illustrates the local template applied by the model 21 to isolate the reference pixels in the dithered signal. As shown in FIG. 3, for each pixel there are two reference pixels, a first reference pixel immediately preceding the current pixel and a second reference pixel preceding the current pixel by four pixels. 
     The model 21 additionally controls the switch SW to selectively connect to the model 21 to one of a first adapter 23, a second adapter 24, a third adapter 25, and a fourth adapter 26 on the basis of the remainder of the horizontal position i of the current pixel divided by four. As a result, the model 21 provides the context number of a current pixel to only one of the four adapters on the basis of the position of the switch SW. 
     Each of the four adapter 23 through 26 comprises a memory. The memory of each adapter stores a more probable symbol MPS and a probability of a less probable symbol P LPS  for each context number to which that adapter is responsive, probability of the more probable symbol P MPS  =1-P LPS . For example, the third adapter 25 is switched to receive the context numbers 8, 9, 10, and 11 since these context numbers and this adapter correspond to pixels in which the horizontal position divided by four is two. Consequently, the third adapter 25 stores a more probable symbol MPS and a probability of the less probable symbol P LPS  for each of the context number 8, 9, 10, and 11. In other words, the memory of each adapter comprises four groups of two storage positions. Each of the four groups is addressed by a different context number whereas the two storage positions of each group contain a more probable symbol MPS and a probability of the less probable symbol P LPS . A single bit is necessary to store a more probable symbol MPS of the context number; several bits are necessary for the probability of the less probable symbol P LPS  of the context number. 
     Based upon the address determined by the context number and the adapter selected by switch SW, the more probable symbol MPS and the probability of the less probable symbol P LPS  indicated by the context number are provided to the encoder 22. That is, the model 21, on the basis of the reference pixels, generates a context number which is selectively provided to one of the four adapters 23-26. This selected adapter is addressed by the received context number and provides the corresponding more probable symbol and the probability of the less probable symbol to the encoder 22. 
     The encoder 22 receives the dithered signal I(i,j) from the model 21 and the more probable symbol MPS and the probability of the less probable symbol P LPS  and encodes the dithered signal by sending either the more probable symbol or the less probable symbol on a basis of a comparison between the dithered signal and the provided more probable symbol. Also, on the basis of the comparison between the dither signal I(i,j) and the more probable symbol provided by the selected adapter, the encoder updates the more probable symbol and the probability of the less probable symbol of that selected adapter. In this way, the encoder 22 adaptively updates its method of encryption by modifying the stored more probable symbol and the probability of the less probable symbol in response to the current encoding. 
     The probability transition table used for estimating and updating the probability of the less probable symbol stored in each adapter and the algorithm for encoding the more probable symbol MPS and the less probable symbol LPS are applied in the same way as the Q coder suggested by I.B.M. Co. in the Joint Photograph Export Group (JPEG) draft chapter 5.12, Dec. 15, 1989, attached hereto, the disclosure of which is incorporated hereinto by reference thereto. It is further suggested that in the implementation of this Q coder, since the encoded data of two continuous bytes will not fall in the range of FF80H through to FFFFH, values within this range should be used as control signals. Specifically, for example, an end of line EOL could be identified as FFFEH and an end of page EOP could be identified as FFFFH. 
     FIG. 8 is a flowchart of an arithmetic coding operation conceived according to the principles of the present invention. The following paragraphs specifically describe the flowchart by way of example. FIG. 6 is an illustration of an exemplary portion of an image of two-by-twelve pixels and the dithered signal pixel values for each of the pixels to aid in the example. The dithered signal expressed in FIG. 6 was generated in response to a four-by-four dither matrix. For the convenience of the description, references (1) to (24) in FIG. 6 are numerals for identifying the corresponding pixels. FIG. 7 is the context table used in the following example. 
     In accordance with block 8a of the flowchart of FIG. 8, the encoder 22 is initialized when an encoding operation is started or after one line of encoding is completed. Then, a more probable symbol MPS and the probability of the less probable symbol P LPS  for each context number in each adapter 23 through 26 is initialized to &#34;0&#34; and 0.503937, respectively. 
     After the initialization, a CPU 10 receives an image signal of a document from a scanner 20 and applies the local template for the current pixel in block 8b. As a result, the reference pixels for the current pixel are isolated as shown in FIG. 3. 
     At block 8c, the CPU 10 determines the context number which corresponds to the horizontal position of the current pixel and the isolated reference pixels of the current pixel. 
     If, in decision block 8d, the current pixel value of the dithered signal were determined to be equal to the more probable symbol, then the encoder 22 encodes the more probable symbol MPS by making use of the probability of the less probable symbol P LPS , in block 8e. If, in decision block 8d, the current pixel value of the dithered signal were determined to be not equal to the that the more probable symbol MPS, then the encoder 22 encodes a less probable symbol at block 8f. 
     Accordingly, detailed description of encoding operations for the successive pixels (1) to (24) of FIG. 6 is as follows. 
     Encoding pixel (1): Dithered signal I(i-1,j)=0, I(i-4,j)=0, Remainder (i/4)=0. Consequently, the model 21 provides a context number 0 to the first adapter 23. For the context number 0, the more probable symbol MPS=0 and the probability of the less probable symbol P LPS  =0.503937, the initialized values. Since current pixel value for the dithered signal is &#34;0,&#34; the more probable symbol matches the current pixel value. Therefore, the more probable symbol is encoded by the encoder 22 of FIG. 2. In step 8g, the encoder 22 then updates the more probable symbol MPS and the probability of the less probable symbol P LPS  of context number 0 to &#34;0&#34; and 0.492218, respectively, in the first adapter 23. 
     Encoding pixel (2): Dithered signal I(0,j)=0, I(i-4,j)=0, Remainder (i/4)=1. Consequently, the model 21 provides a context number 4 to the second adapter 24. For the context number 4, the more probable symbol MPS=0 and the probability of the less probable symbol P LPS  =0.503937, the initialized values. Since current pixel value for the dithered signal is &#34;1,&#34; the more probable symbol does not match the current pixel value. Therefore, the less probable symbol is encoded by the encoder 22 of FIG. 2. The encoder 22 then updates the more probable symbol MPS and the probability of the less probable symbol P LPS  of context number 4 to &#34;1&#34; and 0.503937, respectively, in the second adapter 24. 
     Encoding pixel (3): Dithered signal I(1,j)=1, I(i-4,j)=0, Remainder (i/4)=2. Consequently, the model 21 provides a context number 9 to the third adapter 25. For the context number 9, the more probable symbol MPS=0 and the probability of the less probable symbol P LPS  =0.503937, the initialized values. Since current pixel value for the dithered signal is &#34;1,&#34; the more probable symbol does not match the current pixel value. Therefore, the less probable symbol is encoded by the encoder 22 of FIG. 2. The encoder 22 then updates the more probable symbol MPS and the probability of the less probable symbol P LPS  of context number 9 to &#34;1&#34; and 0.503937, respectively, in the third adapter 25. 
     Encoding pixel (4): Dithered signal I(2,j)=1, I(i-4,j)=0, Remainder (i/4)=3. Consequently, the model 21 provides a context number 13 to the fourth adapter 26. For the context number 13, the more probable symbol MPS=0 and the probability of the less probable symbol P LPS  =0.503937, the initialized values. Since current pixel value of dithered signal is &#34;0,&#34; the more probable symbol matches the current pixel value. Therefore, the more probable symbol is encoded by the encoder 22 of FIG. 2. The encoder 22 then updates the more probable symbol MPS and the probability of the less probable symbol P LPS  of context number 13 to &#34;0&#34; and 0.492218, respectively, in the fourth adapter 26. 
     Encoding pixel (5): Dithered signal I(3,j)=0, I(0,j)=0, Remainder (i/4)=0. Consequently, the model 21 provides a context number 0 to the first adapter 23. For the context number 0, the more probable symbol MPS=0 and the probability of the less probable symbol P LPS  =0.492218. Since current pixel value for the dithered signal is &#34;0,&#34; the more probable symbol matches the current pixel value. Therefore, the more probable symbol is encoded by the encoder 22 of FIG. 2. The encoder 22 then updates the more probable symbol MPS and the probability of the less probable symbol P LPS  of context number 0 to &#34;0&#34; and 0.474640, respectively, in the first adapter 23. 
     Encoding pixel (6): Dithered signal I(4,j)=0, I(1,j)=1, Remainder (i/4)=1. Consequently, the model 21 provides a context number 6 to the second adapter 24. For the context number 6, the more probable symbol MPS=0 and the probability of the less probable symbol P LPS  =0.503937, the initialized values. Since current pixel value for the dithered signal is &#34;1,&#34; the more probable symbol does not match the current pixel value. Therefore, the less probable symbol is encoded by the encoder 22 of FIG. 2. The encoder 22 then updates the more probable symbol MPS and the probability of the less probable symbol P LPS  of context number 6 to &#34;1&#34; and 0.503937, respectively, in the second adapter 24. 
     Encoding pixel (7): Dithered signal I(5,j)=1, I(2,j)=1, Remainder (i/4)=2. Consequently, the model 21 provides a context number 11 to the third adapter 25. For the context number 11, the more probable symbol MPS=0 and the probability of the less probable symbol P LPS  =0.503937, the initialized values. Since current pixel value for the dithered signal is &#34;0,&#34; the more probable symbol matches the current pixel value. Therefore, the more probable symbol is encoded by the encoder 22 of FIG. 2. The encoder 22 then updates the more probable symbol MPS and the probability of the less probable symbol P LPS  of context number 11 to &#34;0&#34; and 0.492218, respectively, in the third adapter 25. 
     Encoding pixel (8): Dithered signal I(6,j)=0, I(3,j)=0, Remainder (i/4)=3. Consequently, the model 21 provides a context number 12 to the fourth second adapter 26. For the context number 12, the more probable symbol MPS=0 and the probability of the less probable symbol P LPS  =0.503937, the initialized values. Since current pixel value for the dithered signal is &#34;1,&#34; the more probable symbol does not match the current pixel value. Therefore, the less probable symbol is encoded by the encoder 22 of FIG. 2. The encoder 22 then updates the more probable symbol MPS and the probability of the less probable symbol P LPS  of context number 4 to &#34;1&#34; and 0.503937, respectively, in the fourth adapter 26. 
     Encoding pixel (9): Dithered signal I(7,j)=1, I(4,j)=0, Remainder (i/4)=0. Consequently, the model 21 provides a context number 1 to the first adapter 23. For the context number 1, the more probable symbol MPS=0 and the probability of the less probable symbol P LPS  =0.503937, the initialized values. Since current pixel value for the dithered signal is 37 0,&#34; the more probable symbol matches the current pixel value. Therefore, the more probable symbol is encoded by the encoder 22 of FIG. 2. The encoder 22 then updates the more probable symbol MPS and the probability of the less probable symbol P LPS  of context number 1 to &#34;0&#34; and 0.492218, respectively, in the first adapter 23. 
     Encoding pixel (10): Dithered signal I(8,j)=0, I(5,j)=1, Remainder (i/4)=1. Consequently, the model 21 provides a context number 6 to the second adapter 26. For the context number 6, the more probable symbol MPS=1 and the probability of the less probable symbol P LPS  =0.503937. Since current pixel value for the dithered signal is &#34;0,&#34; the more probable symbol does not match the current pixel value. Therefore, the less probable symbol is encoded by the encoder 22 of FIG. 2. The encoder 22 then updates the more probable symbol MPS and the probability of the less probable symbol P LPS  of context number 6 to &#34;0&#34; and 0.503937, respectively, in the second adapter 24. 
     Encoding pixel (11): Dithered signal I(9,j)=0, I(6,j)=0, Remainder (i/4)=2. Consequently, the model 21 provides a context number 8 to the third adapter 25. For the context number 8, the more probable symbol MPS=0 and the probability of the less probable symbol P LPS  =0.503937, the initialized values. Since current pixel value for the dithered signal is &#34;0,&#34; the more probable symbol matches the current pixel value. Therefore, the more probable symbol is encoded by the encoder 22 of FIG. 2. The encoder 22 then updates the more probable symbol MPS and the probability of the less probable symbol P LPS  of context number 8 to &#34;0&#34; and 0.492218, respectively, in the third adapter 25. 
     Encoding pixel (12): Dithered signal I(10,j)=0, I(7,j)=1, Remainder (i/4)=3. Consequently, the model 21 provides a context number 14 to the fourth adapter 26. For the context number 14, the more probable symbol MPS=0 and the probability of the less probable symbol P LPS  =0.503937, the initialized values. Since current pixel value for the dithered signal is &#34;1,&#34; the more probable symbol does not match the current pixel value. Therefore, the less probable symbol is encoded by the encoder 22 of FIG. 2. The encoder 22 then updates the more probable symbol MPS and the probability of the less probable symbol P LPS  of context number 4 to &#34;1&#34; and 0.503937, respectively, in the adapter 26. 
     At decision block 8h, the CPU 10 determines whether all the pixels in the first line have been encoded. If first line encoding has not been completed, program flow then s continues back to block 8b at which time the next pixel is read out. 
     A supplementary bit (FILL) is inserted to maintain a minimum line scanning time after first line encoding has been completed as seen at block 8i. At block 8j, an end-of-line control signal (EOL) is inserted after the supplementary bit has been inserted. 
     At decision block 8k, the CPU 10 checks the completion of encoding for one page, and controls to initialize the encoder 22 if the one-page encoding is not completed. That is, after encoding for 1st line in FIG. 6 is completed as described above, the MPS and the P LPS  of each of 16 contexts are initialized, encoding for (13) to (24) in 2nd line is performed by the same way. 
     An end-of-page control signal (EOP) is inserted after one-page encoding is completed as seen at block 81. 
     Although in this particular embodiment of the present invention as described above refers to a four-by-four dither matrix, invention may also be practiced using M×M dither matrix with appropriate changes to the number of adapters and context table. In the half-tones image obtained by using M×M dither matrix, a correlation of neighboring pixels having M pixel interval and binarized by the same threshold value is higher than that of neighboring pixels having 1 pixel interval. Even if a decoding party is not illustrated and described, it may also be changed according to the change of the encoding party. 
     In summary, the foregoing describes method for converting prior arithmetic coding method that applies to a Group III facsimile. There is an advantage of reducing the amount of computation and the size of memory with a high data compression rate by s adapting a one-dimensional arithmetic coding method. Also, there are advantages of reducing an image transmission time, and also preventing transmission errors from affecting subsequent lines. 
     While only certain preferred features of the invention have been shown by way of illustration, many modifications and changes will be apparent to those skilled in the art. It is, therefore, to be understood that the present claims are intended to cover all such modifications and changes which fall within the true spirit of the invention.