Image encoding method

Abstract: There is provided an image encoding method in a facsimile apparatus or an image filing apparatus as an image communication apparatus. In this method, a color image signal which is expressed by a plurality of color component signals to be encoded is input, the input color image signal is converted into a bit stream signal, and the bit stream signal is encoded by the prediction encoding. A parameter for the prediction encoding is changed in accordance with the color image signal to be encoded. The encoding operation is executed adaptively to the color image signal to be encoded. By bit stream converting the binary color signal, the efficient encoding using the color correlation can be executed and an increase in data amount is prevented. By encoding the bit stream signal by using a dynamic arithmetic code, a binary color image can be efficiently encoded.

Description: BACKGROUND OF THE INVENTION Field of the Invention The present invention relates to an image encoding system in a facsimile apparatus or an image filing apparatus as an image communication apparatus. Related Background Art As a conventional image encoding system, a run length encoding system represented by the G3 or G4 facsimile which is recommended by CCITT (international Telegraph and Telephone Consultative Committee) is generally used. According to such an encoding system, a length (run length) in which white pixels or black pixels continue is counted and a code corresponding to its count value is determined from a prepared code table. The code table which is used in such a system is characterized in a manner such that a relatively short code is assigned to a long white run which is frequently seen in a document image. Therefore, in the case where the satistical characteristics of the run length differ from those of the image which was used as a reference upon making of the code table, for instance, in the case of encoding a pseudo half tone image in which white and black pixels are frequently inverted, there is a problem such that an amount of codes exceeds an amount of original data. Therefore, as one of encoding methods in which the encoding can be also efficiently executed even for an image such that an inconvenience occurs in the case where the encoding was executed on the basis of such a run length, an encoding method whereby a Markovian model code such as an arithmetic code or the like is used has been proposed. The conventional well-known arithmetic code is based on a method whereby a code is formed by the arithmetic operation so that an input signal train is set to a code which is expressed by a decimal binary number. The above method has been published by the literature by Langdon, Rissanen, et al., "Compression of Black/White Images with Arithmetic Coding," IEEE Transaction Com., COM-29, 6, June 1981, and the like. According to the literature, assuming that an input signal train which has already been encoded is set to S, a probability in which a less probable symbol (LPS) appears is set to q, an augend of the arithmetic register is set to A(S), and a code register is set to C(S), the following arithmetic operations are executed every input signal. A(S₁) = A(S) x q ≃ A(S) x 2 -Q A(S₀) = <A(S) - A(S₁)> ℓ < > ℓ denotes the cutting at an effective digit ℓ bits. C(S₀) = C(S) C(S₁) = C(S) + A(S₀) In the case where the encoding data is a most probable symbol (MPS: 0 in the above example), A(S₀) and C(S₀) are used to encode the next data. On the other hand, if the encoding data is a less probable symbol (LPS: 1 in the above example), A(S₁) and C(S₁) are used to encode the next data. The new value of A is increased by 2 S times (S is an integer of 0 or more) and is set to a value within a range of 0.5 ≦ A < 1.0. The above process corresponds to that the arithmetic register A is shifted S times in the hardware. The code register C is also shifted to the left by the same number of times and the signal which was shifted out is set to a code. By repeating the above processes, the codes are formed. On the other hand, as shown by the equation (1), by approximating the appearance probability q of the LPS by the power of 2 (2 -Q : Q is a positive integer), the multiplication is replaced by a shift arithmetic operation. To further improve such an approximation, there has been proposed a method whereby q is approximated by, for instance, a polynomial of the power of 2 as shown by the equation (5). The worst efficiency point is improved by the above approximation. q ≃ 2 -Q1 + 2 -Q2 However, in the above arithmetic encoding, the appearance probability which was approximated by the power of 2 is fixed and there is a case where the encoding is not efficiently executed for an image of a different appearance probability. Therefore, there has been proposed a method whereby the appearance probability q of the LPS is changed in accordance with the feature of the image to be encoded and the efficient encoding which is suitable to an image is performed. As such a probability estimating method, there have been known a static method of unconditionally deciding a probability in accordance with the status of pixel which has already been encoded and a dynamic method of estimating the probability while encoding. In the case where the appearance probability q of the LPS was approximated by the polynomial of the power of 2, the value of the appearance probability q is a discontinuous value. A condition, a timing, and the like to change a certain appearance probability to another appearance probability are large factors to accomplish the optimum encoding. On the other hand, as mentioned above, in a facsimile apparatus as a typical example of a conventional image communication apparatus, an MH code, an MR code, or the like is used as a system for encoding black/white binary data. On the other hand, in recent years, the development of a cheap color printer has been progressed and there has been proposed an image communication of a color image, particularly, a binary color image having data of red (R), green (G), and blue (B) each consisting of one bit or data of yellow (Y), cyan (C), and magenta (M) each consisting of one bit. As such an encoding system of a binary color image, there has been considered a method whereby three colors are encoded every bit plane and the MH or MR coding system for black/white data is used. However, according to the method of encoding three colors every bit plane, there is a problem such that by encoding three colors every bit plane of R, G, and B, the entropies of the original RGB information sources are increased, so that the encoding efficiency decreases. This typically results in that the color correlation information is not used. British patent specification GB-A-2154826 discloses an arrangement in which color image signals representing N colors are encoded by prediction coding. However, this arrangement does not fully meet the disadvantages discussed above. The present invention is made in consideration of the above problems and concerns providing an image encoding method which can accomplish the efficient image encoding. Accordingly the present invention provides an image coding method as set out in claim 1. In order that the present invention may be more readily understood, an embodiment thereof will now be described by way of example and with reference to the accompanying drawings, in which: Fig. 1 is a block diagram of an encoder to which the present invention is applied; Fig. 2 is a block diagram of a prediction converter circuit; Fig. 3 is a block diagram of a renewal circuit; Fig. 4 is a block diagram of a status determination circuit; Fig. 5 is a diagram showing reference pixels; Fig. 6 is a diagram showing encoding efficiency curves; Fig. 7 is a block diagram of an arithmetic encoder; Fig. 8 is a block diagram of a determination circuit of d by an updating history; Fig. 9 is a block diagram of a transmission system of a color image; Fig. 10 is a block diagram of a bit stream converter circuit; Fig. 11 is a block diagram of an encoder; Fig. 12 is a block diagram of a prediction converter circuit; Fig. 13 is a block diagram of a renewal circuit; Fig. 14 is a block diagram of a status prediction circuit; Fig. 15 is a diagram showing reference pixels; Fig. 16 is a diagram showing encoding efficiency curves; Fig. 17 is a block diagram of an arithmetic encoder; Fig. 18 is a block diagram of a switching mechanism; and Fig. 19 is a diagram showing an example of transmission data. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT Fig. 1 is a diagram showing an embodiment of an encoding apparatus to which the present invention is applied. An image signal 100 as binary data (0 or 1; white or black) is input to a line memory 10 and the data of a few lines is held. By inputting an output signal 103 from the line memory 10 to a status determination circuit 11, the status to which an objective pixel in the image signal 100 belongs is determined. The number of total statuses is determined by the number of peripheral pixels of the objective pixel which are referred to. Assuming that the number of reference pixels is set to n, the number of total statuses is equal to 2 n . A status signal St 104 indicative of the decided status is input to a counter memory 13 and an encoding condition memory 14. A most probable symbol MPS 108 as a symbol which is likely to appear and an index I 107 indicative of an encoding condition of an arithmetic code, which will be explained hereinlater, are stored in the encoding condition memory 14 every status which is indicated by the status signal St 104. The MPS 108 is input to a prediction converter circuit 17. The prediction converter circuit 17 outputs a YN signal 101 which is set to "1" when the image signal 100 coincides with the MPS 108. The YN signal 101 is input to a renewal circuit 15. When the YN signal is set to "1", in the renewal circuit 15, a count value of the corresponding status among count values stored in the counter memory 13 every status is increased by "1". When a count value C 106 stored in the counter memory 13 coincides with a set value MC 105 from a count table ROM 12, the index I 107 is updated in such a direction that it is increased (the direction to reduce the appearance probability q of the LPS). (The inversion of the MPS is not executed.) The set number MC 105 of the MPSs shown in Table 1 which has been predetermined in correspondence to the index I indicative of the appearance probability q of the LPS is supplied from the count table ROM 12 to the renewal circuit 15. In the renewal circuit 15, when the MPS 108 differs from the pixel signal 100, that is, when the YN signal from the prediction converter circuit 17 is set to "0", the index I 107 is updated in such a direction to reduce the index (the direction so as to increase the appearance probability q of the LPS). On the other hand, if the YN signal of "0" is input when the index is set to "1", the MPS is inverted (0 → 1 or 1 → 0). An output I′ 109 and an MPS′ 110 denote values of the index after it was updated. Those values are again stored into the encoding condition memory 14. An encoding parameter determination circuit 16 sets an encoding parameter Q 111 of an arithmetic code into an arithmetic encoder 18 on the basis of the value of the index I 107. In the arithmetic encoder 18, the YN signal 101 from the prediction converter circuit 17 is arithmetically encoded by using the parameter Q 111, thereby obtaining a code 102. Fig. 2 is a block diagram of the prediction converter circuit 17. The image signal 100 and the MPS 108 are input to an EX-NOR circuit 20. In accordance with a logic equation of Table 2, the EX-NOR circuit 20 outputs the YN signal 101 which is set to "1" when the image signal 100 and MPS 108 coincide and which is set to "0" when they differ. Fig. 3 is a block diagram of the renewal circuit 15. When the YN signal 101 is set to "1", the count value C 106 from the counter memory 13 is increased by "1" by an adder 21 and a signal C′ 112 is derived. The updated count value is compared with the set value MC 105 from the count table ROM 12 by a comparator 23. When the value of C′ coincides with the value of MC, an updating signal UPA 113 is set to "1". On the other hand, the YN signal 101 is transmitted through an invertor 24 and becomes an updating signal UPB 114. The updating signals UPA and UPB are input to an index change circuit 25. The OR of the UPA and UPB is calculated by an OR circuit 27. An output signal 115 of the OR circuit 27 is input as a switching signal to a selector 22. When the signal 115 is set to "1", the selector 22 selects a "0" signal 119 to reset the value of the counter. When the signal 115 is set to "0", the selector 22 selects the output signal C′ 112 of the adder 21 and outputs as a counter updating signal C″ 116 and stores into the counter memory 13. A signal d 117 (as a standard value, d = 1) to control the updating dividing level of the index, the updating signals UPA 113 and UPB 114, and the present index I 107 from the encoding condition memory 14 are input to the index change circuit 25. Table 3 indicates index updating methods in the index change circuit 25 (Table 3 shows the cases where the updating dividing level is set such that d = 1 and d = 2). An updated index I′ is determined by referring to the table with respect to the input I, condition d, UPA, and UPB. On the other hand, when I = 1 and UPB = 1, an EX signal 118 is set to "1". When the EX signal is set to "1", an invertor 26 inverts the symbol of the present MPS 108 (0 → 1 or 1 → 0) and obtains the updated MPS′ 110. On the other hand, when EX = 0, the MPS′ is not changed. The updated I′ 109 and MPS′ 110 are stored into the encoding condition memory 14 and are used as the index I and MPS for the next processings. The updating methods shown in Table 3 can be also constructed by a table by using an ROM or the like or can be also constructed by a logical circuit by using adders and subtracters. As mentioned above, when the MPSs of the number which has been predetermined in accordance with the value of the index I indicative of the appearance probability q of the LPS which was approximated by the polynomial of the power of 2 occurred as mentioned above, the index I is added by d, thereby reducing the appearance probability q of the LPS which is used for the arithmetic code. On the other hand, when the LPSs occurred, the index I is subtracted by d, thereby increasing the appearance probability q of the LPS which is used for the arithmetic code. On the other hand, when the LPS occurred in the state when the index I in which the appearance probability q of the LPS indicates 0.5 is set to "1", the MPS is inverted. As mentioned above, by updating the index and MPS so as to be adaptive to the input image, the arithmetic encoding of a high encoding efficiency can be accomplished. Fig. 4 is a block diagram of the status determination circuit 11. Four pixels A, B, C, and D shown in Fig. 5 are used as reference pixels to determine the status. * represents a position of the objective pixel to be encoded. In Fig. 4, reference numerals 42, 43, 44, and 45 denote latches. The A latch 42 holds the data of the preceding pixel of the image signal 100 of the objective pixel *. As shown in Fig. 5, the B latch 43 holds the data at the position which is one-pixel preceding to the present objective pixel position of one line before. The C latch 44 holds the data at the present objective pixel position of one line before. The D latch 45 holds the data at the position which is one-pixel after the present objective pixel position of one line before. The latched data of those.latches are input to a decoder 41. An output from the decoder 41 is used as the status signal St 104 (0 to 15) indicative of sixteen statuses. The number of reference pixels is not limited to four. Fig. 6 shows encoding efficiency curves of arithmetic codes which are used in the embodiment. The value of the index I is shown by a small letter i. The curves are shown by the equation (6) when the appearance probability of the LPS is set to q and the approximation probability upon encoding is set to q ei . The index I is sequentially set to 1, 2, 3, ... in the direction from the large value of the appearance probability q of the LPS to the small value. η = -qℓog₂q-(1-q)ℓog₂(1-q) -qℓog₂q ei -(1-q)ℓog₂(1-q ei ) The numerator indicates an entropy and q ei is set to a value shown by the equation (7). q ei = q₁ + q₂ q₁ and q₂ are set to the values which are approximated by the polynomial of the power of 2 and are given by Table 4. The values of q₁ and q₂ are shown by, for instance, the equations (8) to (10). q e1 = 2⁻² + 2⁻² q e2 = 2⁻¹ - 2⁻⁴ q e3 = 2⁻² + 2⁻³ q ei at the peak point when an efficiency η is set to 1.0 in the above probability is hereinafter called an effective probability. On the other hand, an intersection of the efficiency curve is called a boundary probability q bi . It will be obviously understood that the efficiency is improved by encoding by using the adjacent effective probabilities around the boundary probability as a turning point. In the embodiment, as shown in the equation (5), the effective probability q ei shown in Table 4 is selected from the probabilities which can be approximated by two terms. On the other hand, Q₁, Q₂, and Q₃ in Table 4 denote parameters Q c 111 which are sent to the arithmetic encoder 18. That is, Q₁ and Q₂ indicate shift amounts which are given to shift registers. The calculation of the power of 2 is executed by the shift arithmetic operations. Q₃ shows a coefficient of the second term and is used to switch between (+) and (-). The value of MC in Table 1 is determined in the following manner. That is, assuming that the number of LPSs is set to N L and the number of MPSs is set to N M , the appearance probability of the LPS is given by the equation (11). q = N L N M + N L The equation (12) is obtained by solving the equation (11) by N M . N M = └N L (1/q - 1)┘ where, └ x ┘ denotes t-at the figures below a decimal point are raised to a unit. By giving the boundary probability q bi shown in Fig. 6 to q in the equation (12), the number N Mi of most probable symbols (MPSs) which occurred there is calculated. Therefore, MC is calculated by the equation (13). MC i = N Mi+1 - N Mi The values of MC in Table 1 are obtained by the calculations on the basis of the equations (11), (12), and (13) on the assumption that N L = 2. As mentioned above, as shown in Fig. 6, the number N Mi of MPSs corresponding to each index I is obtained on the basis of each boundary probability q bi and the difference between the numbers N M of MPSs of the adjacent indices is set to the value of MC for each index I. The value of MC is compared with the number of MPSs which occur as mentioned above. When the value of MC coincides with the number of MPSs, the status in this case is determined to be the status in which the encoding using the adjacent index I is suitable, so that the index I is changed. Due to this, the index I is changed at a proper timing on the basis of the number of MPSs which occur. Further, the encoding using the optimum index I can be adaptively accomplished. Fig. 7 is a block diagram of the arithmetic encoder 18. Among the control signals Q c 111 (Table 4) which were determined by the encoding parameter determination circuit 16, Q₁ is input to a shift register A 70, Q₂ is input to a shift register B 71, and Q₃ is input to a selector 72. Q₁ and Q₂ instruct to the shift registers A and B with respect to by which number of bits an augend signal As 123 is shifted to the right, respectively. As the results of the shift, output signals 130 and 131 are obtained. A complement of the signal 131 is obtained by an invertor 76. The selector 72 selects either the signal 131 or an output signal of the invertor 76 on the basis of the control signal Q₃ and obtains an output signal 132. An adder 73 adds the signal 130 from the shift register A 70 and the signal 132 from the selector 72 and outputs an As₁ signal 124. A subtractor 74 subtracts the As₁ signal 124 from the As signal 123 and obtains an As₀ signal 125. A selector 75 selects either the As₀ signal 125 or the As₁ signal 124 on the basis of the YN signal 101. That is, when the YN signal is set to "1", the As₀ signal is selected. When the YN signal is set to "0", the As₁ signal is selected. Thus, an A′ signal 126 is output. A shift circuit 80 shifts the A′ signal to the left until the MSB of the A′ signal is set to "1". As the result of the shift, an As′ signal 127 is derived. A shift signal 132 corresponding to the number of shifting operation times is input to a code register 79. The bits of the number corresponding to the number of shifting operation times are sequentially output from the code register 79 in accordance with the order from the KSB, so that code data 130 is derived. The code data 130 is processed by a bit processing method (not shown) in a manner such that the number of continuous bits "1" is set within a limited number, and the processed data is sent to a receiver (not shown). On the other hand, a content CR 128 of the code register 79 is added to the As₀ signal 125 by an adder 77. The resultant signal is input to a selector 78. The signal CR 128 which is not added to the As₀ signal 125 is also input to the selector 78. Thus, a CR′ signal 129 which is set to CR′ = CR when the YN signal 101 is set to "1" and which is set to CR′ = CR + As₀ when YN = "0" is output. The foregoing shifting process regarding the code register 79 is executed for the CR′ signal. The signal d 117 in the renewal circuit shown in Fig. 3 may be also fixed such that d = 1. However, the tracing speed can be also made further high as will be explained hereinlater. Fig. 8 is a block diagram of the determination circuit of d. When either one of the UPA and UPB signals has been set to "1", it is detected by an EX-OR circuit 81 and a detection signal 140 is output. When the output 140 is set to "1", latches 83 to 87 are driven so as to hold the histories of the past few times of the UPA and UPB signals. As shown in Table 5, when a signal 146 is set to "1", this means that the UPA signal has been set to "1". When the signal 146 is set to "0", this means that the UPB signal has been set to "1". Output signals 141 to 145 from the latches 83 to 87 are supplied to a determination circuit 88. A determination signal 147 indicating, for instance, whether all of the output signals 141 to 145 are set to "1" or "0" or not is output to a "d" setting circuit 89 from the determination circuit 88. The "d" setting circuit 89 outputs the d signal 117 which is set to d = 2 when all of the output signals 141 to 145 are set to "1" or "0" and which is set to d = 1 in the other cases. Thus, the tables shown in Table 3 can be switched. As mentioned above, if the updating processes of the index continue, since the updating width of the index is set to a large value, the tracing of the index I according to the image can be promptly executed. On the other hand, although the value of d has been set to a positive integer in the embodiment, the circuit can be also changed so as to obtain a value of d = 1/2, 1/4, or the like. Although the appearance probability of the less probable symbol LPS has been approximated by the addition and subtraction of two terms of the power of 2, the number of terms is not limited to only two. As described above, the index to determine the parameters for the arithmetic encoding can be updated at the optimum updating timing in accordance with the occurrence states of the most probable symbol and less probable symbol and the encoding which is adaptive to the input image can be preferably executed. Further, by changing the updating width by the updating history, it is possible to realize the image encoding system which can preferably trace the change in prediction coincidence probability after completion of the prediction conversion of the image. Although the above embodiment has been described with respect to the encoding of the black/white binary image signal, an example of a construction in the case where the invention was applied to the encoding of a color image will now be described hereinbelow. Fig. 9 is a diagram showing an embodiment of a color image transmission system to which the invention is applied. Input data 200 to 202 of RGB each consisting of one bit and indicative of each pixel of a color image are converted into a bit stream signal D 203 by a bit stream converter 30. For instance, as shown in Table 6, a bit stream signal which is used in the embodiment has a length of 1 to 7 bits for each color pixel of white, black, red, green, blue, cyan, magenta, and yellow in a manner such that the signal is set to "1" for white and is set to "01" for black. When the first bit (MSB) of the bit stream signal is set to "1", the color signal is determined to be white. On the contrary, when the MSB is set to "0", the color signal is decided to be a color other than white. In the case of a color other than white, the second bit is checked. If the second bit is set to "1", the color signal indicates black. When the second bit is set to "0", the color signal indicates a color other than black. By repeating the processes similar to the above, when the seventh bit (LSB) is set to "1", the color signal indicates magenta. When the LSB is set to "0", the color signal indicates yellow. A method of assigning the bits in the bit stream conversion is not limited to that shown in the table. The bit stream signal D 203 which is output from the bit stream converter 30 is sent to an encoder 31. On the other hand, a Bt signal 204 indicating which number of bit of the bit stream signal has been output is output from the bit stream converter 30 to a status prediction circuit 33. On the other hand, the input data 200 to 202 are stored into a line memory 32 having a capacity of a plurality of lines and are output as an output signal 205 together with the information of a few lines before to the status prediction circuit 33. In the status prediction circuit 33, the encoding status of each bit of the bit stream signal to be encoded is determined on the basis of the output signal from the line memory 32 and the Bt signal 204 and a status signal St 206 indicative of the encoding state is output. The encoder 31 forms a code 207 by the encoding using a Markovian model code such as an arithmetic code on the basis of the bit stream signal D 203 and the status signal St 206 as will be explained hereinlater and transmits to a decoder 34. The decoder 34 executes a decoding process to the transmitted code 207, so that a decoding bit stream signal D′ 208 is formed. The signal D′ 208 is reconverted into binary colors of R′, G′, and B′ each consisting of one bit by an RGB converter 35. On the basis of the binary colors, a color image is displayed or recorded. It will be obviously understood from Table 6 that in the RGB converter 35, by counting the number of bits "0" subsequent to bit "1" of the signal D′ 208, the color signals R′, G′, and B′ which are indicated by the decoding bit stream signal D′ 208 can be determined. Fig. 10 is a block diagram of the bit stream converter 30. The input data 200 to 202 are converted every pixel into a 7-bit signal 212 shown in Table 6 on the basis of a table 36 such as an ROM or the like and input to a signal output unit 37. The signal output unit 37 has a shift register form. The 7-bit input signal 212 is input in parallel to the signal output unit 37 and serially output one bit by one in accordance with the order from the MSB, so that the bit stream signal D 203 is obtained. When the stream signal is set to "1" or when seven bits "0" are output, the signal output unit 37 finishes the output of the color signals of one pixel and receives the next input data. On the other hand, the signal Bt 204 indicating which number of bit of the stream signal is at present output is output from the signal output unit 37. As mentioned above, by bit stream converting and encoding the color image signal which is shown by the color component signals of each bit of R, G, and B, the encoding can be executed while preserving the color correlation without individually encoding R, G, and B having the correlation. On the other hand, when the encoding is executed while predicting the objective pixel such as in the arithmetic encoding, the prediction and encoding can be executed as color information without executing the prediction and encoding every component of R, G, and B. The encoding efficiency can be improved. On the other hand, since each color component of R, G, and B indicative of the color of each pixel is expressed as one data, upon decoding, by decoding one data, the R, G, and B signals corresponding to each pixel can be obtained in a lump and the color image can be promptly regenerated. Fig. 11 is a block diagram of the encoder 31. In the embodiment, the encoding is performed by using the arithmetic code. In the arithmetic code, since the value of Q indicative of the appearance probability of the LPS can be switched every encoding data, the probability estimating section can be separated from the encoding section. The embodiment uses a dynamic method of estimating the probability while executing the encoding. A block diagram of the encoder 31 in Fig. 11 to execute the above arithmetic encoding will now be explained. The status signal St 206 from the status prediction circuit 33 is input to a counter memory 53 and an encoding condition memory 54. A most probable symbol MPS 158 as a symbol which is likely to appear and an index I 157 indicative of the encoding condition including the appearance probability of the LPS of the arithmetic code, which will be explained hereinlater, are stored into the encoding condition memory 54 every status which is expressed by the status signal St 206. The MPS 158 is input to a prediction converter circuit 57. The prediction converter circuit 57 forms a YN signal 151 which is set to "1" when the bit stream signal D 203 coincides with the MPS 158. The YN signal 151 is input to a renewal circuit 55. In the renewal circuit 55, when the YN signal is set to "1", the count value of the corresponding state among the count values stored in the counter memory 53 is increased. When a count value C 156 stored in the counter memory 53 coincides with a set value MC 155 from a count table ROM 52, the index I 157 is updated in an increasing direction (the direction so as to reduce the appearance probability q of the LPS). (The MPS is not inverted.) The count table ROM 52 supplies to the renewal circuit 55 the number MC 155 of MPSs shown in Table 1 which has been predetermined in correspondence to the index I indicative of the appearance probability q of the LPS. On the other hand, in the renewal circuit 55, when the MPS 158 and the pixel signal D 203 differ, that is, when the YN signal from the prediction converter circuit 57 is set to "0", the index I 157 is updated in a decreasing direction (the direction so as to increase the appearance probability q of the LPS). On the other hand, if the YN signal of "0" is input when the index I is set to "1", the MPS is inverted (0 → 1 or 1 → 0). Outputs I′ 159 and MPS′ 160 indicate values of the index after completion of the updating process and are again stored into the encoding condition memory 54. An encoding parameter determination circuit 56 sets an encoding parameter Q 161 of the arithmetic code into an arithmetic encoder 58 on the basis of the value of the index I 157. In the arithmetic encoder 58, the YN signal 151 from the prediction converter circuit 57 is arithmetically encoded by using the parameter Q 161, thereby obtaining a code 152. By previously giving an initial value to the encoding condition memory 54 and by preventing that the I and MPS are updated, the static encoding can be easily realized. Fig. 12 is a block diagram of the prediction converter circuit 57. The bit stream signal D 203 and MPS 158 are input to an EX-NOR circuit 59. In accordance with the logic equation of Table 2, the YN signal 151 which is set to "1" when the bit stream signal D 203 and MPS 158 coincide and which is set to "0" when they differ is output from the EX-NOR circuit 59. Fig. 13 is a block diagram of the updating circuit 55. When the YN signal 151 is set to "1", the count value C 156 from the counter memory 53 is increased by "1" by an adder 31, so that a signal C′ 162 is obtained. The value of C′ is compared with the MC 155 from the count table ROM 52 by a comparator 33. When the value of C′ coincides with the value of MC, an updating signal UPA 163 is set to "1". On the other hand, the YN signal 151 is transmitted through an invertor 34 and becomes an updating signal UPB 164. The updating signals UPA and UPB are input an index change circuit 35. The OR of the UPA and UPB is calculated by an OR circuit 37. An output signal 165 of the OR circuit 37 becomes a switching signal of a selector 32. When the signal 165 is set to "1", the selector 32 selects a "0" signal 169 to reset the value of the counter. In the other cases, the selector 32 selects the output signal C′ 162 of the adder 31. The selected signal is output as a counter updating signal C″ 166 and stored into the counter memory 53. A signal d 167 (as a standard value, d = 1) to control the updating dividing level of the index, the updating signals UPA 163 and UPB 164, and the present index I 157 from the encoding condition memory 54 are input to the index change circuit 35. Table 3 shows index updating methods in the index change circuit 35 (Table 3 shows the cases where the updating dividing level is set such that d = 1 and d = 2). The updated index I′ is determined by referring to the table with respect to the input I, condition d, UPA, and UPB. On the other hand, when I = 1 and UPB = 1, an EX signal 168 is set to "1". When the EX signal is set to "1", an invertor 36 inverts the present MPS 158 (0 → 1 or 1 → 0), thereby obtaining the updated MPS′ 160. On the other hand, when the EX signal is set to "0", the MPS′ is not changed. The updated I′ 159 and MPS′ 160 are stored into the encoding condition memory 54 and are used as the index I and MPS for the next processings. The updating method shown in Table 3 can be also constructed by a table using an ROM or the like or can be also constructed by logic circuits using adders and subtractors. As mentioned above, when the MPSs of the number which has been predetermined in accordance with the value of the index I indicative of the appearance probability q of the LPS which was approximated by the polynomial of the power of 2 occurred, the index I is added by d and the appearance probability q of the LPS which is used for the arithmetic code is reduced. On the other hand, when the LPS occurred, the index I is subtracted by d and the appearance probability q of the LPS which is used for the arithmetic code is increased. On the other hand, further, if the LPS occurred in the state in which the index I in which the appearance probability q of the LPS indicates 0.5 is set to "1", the MPS is inverted. As mentioned above, by updating the index and MPS so as to be adaptive to the input image, the arithmetic encoding of a high encoding efficiency can be accomplished. Fig. 14 is a block diagram of the status prediction circuit 33. Four pixels A, B, C, and D shown in Fig. 15 are used as reference pixels to predict the status. Each of the reference pixels consists of three bits indicative of "1" or "0" of R, G, and B. * denotes a position of an objective pixel to be encoded. In Fig. 14, reference numerals 62, 63, 64, and 65 denote latches. The A latch 62 holds the 3-bit data of RGB of one pixel before the pixel to be encoded. As shown in Fig. 15, the B latch 63 holds the 3-bit data at the position which is one-pixel preceding to the objective pixel position of one line before. The C latch 64 holds the 3-bit data at the objective pixel position of one line before. The D latch 65 holds the 3-bit data at the position which is one-pixel after the objective pixel position of one line before. Those latch data are input to an ROM 61. The status signal St 206 is output from the ROM 61. The number of reference pixels is not limited to four. That is, in the status prediction circuit 33, the color (either one of eight colors in Table 6) of the objective pixel is predicted on the basis of the latched data in the latches 62 to 65 and the status signal St 206 indicative of the status of each bit of the bit stream signal indicative of the predicted color is output. Fig. 16 shows encoding efficiency curves of the arithmetic code which is used in the embodiment. The value of the index I will now be shown by a small letter i hereinbelow. The curve is shown by the equation (14) when it is assumed that the appearance probability of LPS is set to q and the approximation probability upon encoding is set to q ei . The index I is sequentially set to 1, 2, 3, ... in accordance with the order from the large value of the appearance probability q of the LPS to the small value. η = -qℓog₂q-(1-q)ℓog₂(1-q) -qℓog₂q ei -(1-q)ℓog₂(1-q ei ) where, a numerator indicates an entropy and q ei denotes a value shown by the equation (15). q ei = q₁ + q₂ q₁ and q₂ are set to values which are approximated by the polynomial of the power of 2 and are given by Table 5. For instance, those values are given by the following equations (16) to (18). q e1 ′ = 2⁻¹ q e2 ′ = 2⁻¹ - 2⁻⁴ q e3 ′ = 2⁻² + 2⁻³ q ei at the peak point when the efficiency η is set to 1.0 at the above probability is called an effective probability hereinafter. The intersection of the efficiency curve is called a boundary probability q bi . It will be obviously understood that the efficiency can be improved by encoding by using the adjacent effective probabilities around the boundary probability as a turning point. In the embodiment, as shown in the equation (5), the effective probability q ei shown in Table 4 is selected from the probabilities which can be approximated by two terms. On the other hand, Q₁, Q₂, and Q₃ in Table 4 denote the parameters Q c 161 which are sent to the arithmetic encoder 58. That is, Q₁ and Q₂ denote the shift amounts which are given to the shift registers. The calculation of the power of 2 is executed by the shifting operation. Q₃ denotes the coefficient of the second term and is used to switch between (+) and (-). The value of MC in Table 1 is determined in the following manner. That is, assuming that the number of LPSs is set to N L and the number of MPSs is set to N M , the appearance probability of the LPS is given by the following equation (19). q = N L N M + N L By solving the equation (19) by N M , the equation (20) is obtained. N M = └N L (1/q - 1)┘ where, └ x ┘ denotes that the figures below a decimal point are raised to a unit. By giving q bi shown in Fig. 16 to q in the equation (20), the number N Mi of MPSs which exist there is calculated. Therefore, the value of MC is calculated from the equation (21). MC i = N Mi+1 - N Mi The values of MC in Table 1 are obtained by the calculations based on the equations (19), (20), and (21) on the assumption that N L = 2. As mentioned above, the number N Mi of MPSs corresponding to each index I is obtained on the basis of each boundary probability q bi as shown in Fig. 16. The difference between the numbers N M of MPSs of the adjacent indices is set to MC for each index I. The value of MC is compared with the number of MPSs which occur as mentioned above. If the value of MC and the number of MPSs coincide, the state is decided to be the state in which the encoding using the adjacent index I is suitable, so that the index I is changed. Thus, the index I is changed at a proper timing on the basis of the number of MPSs which occur and the encoding using the optimum index I can be adaptively accomplished. Fig. 17 is a block diagram of the arithmetic encoder 58. Among the control signals Q₀ 161 (Table 4) which were determined by the encoding parameter determination circuit 56, Q₁ is input to a shift register A 170, Q₂ is input to a shift register B 171, and Q₃ is input to a selector 172. Q₁ and Q₂ instruct to the shift registers A and B that by how many bits an augend signal As 223 is shifted to the right, respectively. Signals 230 and 231 are output as the results of the shifting operation. A complement of the signal 231 is obtained by an inverter 176. On the basis of the control signal Q₃, the selector 172 selects the signal 231 or an output signal of the invertor 176, thereby obtaining an output signal 232. An adder 173 adds the signal 230 from the shift register A 170 and the signal 232 from the selector 172 and outputs an As₁ signal 224. A subtractor 174 subtracts the As₁ signal 224 from the As signal 223 and obtains an As₀ signal 225. A selector 175 selects either the As₀ signal 225 or the As₁ signal 224 on the basis of the YN signal 151. That is, when the YN signal is set to "1", the As₀ signal is selected. When the YN signal is set to "0", the As₁ signal is selected. The selected signal is used as an A′ signal 226. A shift circuit 180 shifts the A′ signal to the left until the MSB of the A′ signal is set to "1". By the shifting operation, an As′ signal 227 is obtained. A shift signal 234 corresponding to the number of shifting operation times is input to a code register 179. Bits of the number corresponding to the shifting operation times are sequentially output from the code register 179 in accordance with the order from the KSB, so that encoding data 233 is obtained. The encoding data 233 is processed by a bit processing method (not shown) in a manner such that the number of continuous bits "1" is set to a value within a limit value. The processed data is transmitted to the decoder 34. A content CR 228 of the code register 179 is added to the As₀ signal 225 by an adder 177 and the addition signal is input to a selector 178. On the other hand, the signal CR 228 which is not added to the As₀ signal 225 is also input to the selector 178. A signal CR′ 229 which is set to CR′ = CR when the YN signal 151 is set to "1" and which is set to CR′ = CR + As₀ when the YN signal 151 is set to "0" is output from the selector 178. The shifting process mentioned above with regard to the code register 179 is executed for the CR′ signal 229. Although the embodiment shown in Fig. 9 has been described with respect to the encoding of a color image, the embodiment has a feature such that there is a large compatibility with a system for encoding only a black and white binary image signal. That is, information of black and white binary values (white when "1"; color other than white, that is, black when "0") can be encoded by using only one bit of MSB of the bit stream signal shown in Table 6. Fig. 18 is a block diagram showing a construction which is added to the construction of Fig. 9 in order to switch between a black/white binary signal and a binary color signal. A B/W signal 300 and the bit stream signal D 203 are switched by a selector 38 on the basis of a switching signal 301 from a controller (not shown). ID information to discriminate whether the signal is a B/W binary signal or a binary color signal is sent to the decoding side by header data HD as a head of transmission data TD as shown in Fig. 19, thereby switching the decoding process. On the other hand, if the average appearance probability of each color is known to a certain extent as shown in Table 7, even if the bit stream converted signal shown in Table 6 is sent without being further encoded or even if the bit stream converted signal is subjected to other encoding process such as a run length encoding or the like instead of the foregoing arithmetic code and is sent, the easy encoding can be executed. As described above, according to the invention, by bit stream converting the binary color signal, the efficient encoding using the color correlation can be performed. An increase in information amount can be prevented. Further, by encoding the bit stream signal by using the dynamic arithmetic code, the binary color image can be efficiently encoded. Although the present invention has been described with respect to the preferred embodiment, the invention is not limited to the foregoing embodiment but many modifications and variations are possible within the scope of the appended claims of the invention. There has thus been described the provision of an image encoding method which efficiently encodes a color image signal by using the color correlation. The embodiment described also provides an image encoding method for adaptively encoding an image to be encoded. Additionally the embodiment described provides an image encoding method which can also preferably encode both of a color image and a black and white image.

Claims: An image encoding method comprising the steps of: sequentially inputting a plurality of color component signals for each pixel, the plurality of color component signals together representing a color of the pixel; sequentially converting the color component signals into a predetermined signal for each pixel; and sequentially encoding the converted predetermined signal; characterised in that, in said converting step, the color component signals (R,G,B) are converted into a bit stream signal (D) for each pixel, the bit stream signal (D) having a length dependent on the color of the pixel and comprising bits of logic "0" and/or logic 1", wherein the length of the bit stream signal is different for each different colour and the number of bits of logic "0" in the bit stream signal is different for each color, and in said encoding step, the bit stream signals are encoded by using a binary encoding method. A method according to claim 1, wherein in said encoding step, the bit stream signals are encoded by prediction encoding. A method according to claim 2, wherein in said encoding step, a parameter for the prediction encoding is changed in accordance with the color represented by the color component signals. A method according to claim 1, wherein in said encoding step, an adaptive encoding operation is executed for the bit stream signals. A method according to any one of the preceding claims, wherein the plurality of color component signals together represents one of the following N colors; namely white, black, red, green, blue, cyan, magenta and yellow. A method according to any one of the preceding claims, wherein the bit stream signals are different in the number of continued bits of logic 0's for each color.

Inventors: KATO SHIGEO, OSAWA HIDEFUMI C O CANON KABUS, YASUDA YASUHIKO, KATO, SHIGEO, OSAWA, HIDEFUMI, C/O CANON KABUSHIKI KAISHA, YASUDA, YASUHIKO
Applicants: CANON KK, CANON KABUSHIKI KAISHA
Application year: 1990
Main classification: H04N1
IPC codes: H04N1, G06T9