Method and apparatus for encoding and decoding digital image data

Abstract: An encoding method for digital image data comprising consecutive blocks of data groups having as content binary values always of an equal number of pixels of an image. In this method use is made of a code which indicates that the encoded block is partly equal to the corresponding part of a reference block, the reference block preferably being the preceding block. The code identifies the end point of that part of the reference block by reference to transitions in pixel value in the reference block. On decoding, that part of the reference block is taken over in the decoded block. This encoding method is in practice combined with run length encoding and encoding by copying an entire data group in the code.

Description: The invention relates to a method of encoding digital image data comprising consecutive blocks of data groups which are situated at consecutive positions within the blocks and which have as content binary values always of the same number of pixels of an image. The invention also relates to an apparatus in which this method is employed. Encoding of image data is of use in systems for digitising images, such as documents, by linewise scanning with a light-sensitive sensor, processing, storing in a memory and/or transmission of the scanning signals, and printing thereof, for example on paper. To digitise an image with sufficient quality it is necessary to extract and further process a very large number of data thereof and it is therefore desirable to be able to compress such data, particularly for storage and transmission. A first form of compression comprises changing from the multi-value scanning data (grey values) to binary signals (white or black), so that each signal can be represented by just one bit, but even then there are many image data left over. Taking the resolution of 300 dots per inch, which is frequently used in the art, each square centimetre of the image contains approximately 14000 image elements, known as pixels, so that almost one million bits are required for an A4 document. The Applicants' earlier European patent application EP-A-0 498 511 published 12.08.92 (corresponding to Netherlands patent application No. 9100225) discloses an encoding method for digital image data comprising consecutive blocks of data groups which are situated at consecutive positions within the blocks and which have as content binary values always of the same number of pixels of an image. In this method, run length encoding is applied to series of consecutive data groups in which each data group has the same content as the data group in the same position in the reference block. Consequently, the code contains the number of data groups in the series. Frequently, however, such series contain a very large number of data groups, such as, for example, in completely white areas at the top and bottom of a document. However, consecutive image lines may contain locally identical information even in parts of an original image which do contain image information, for example if the original image contains parallel lines perpendicular to the scanning direction. In such cases the run length code contains a long number and consequently the code is longer. Apart from the obvious objection of more space taken up by the code, another objection is the fact that the length of the codeword becomes variable as a result and this makes decoding more tedious. Although there are methods of obviating this disadvantage, they in turn make the codewords longer and thus reduce the possible compression factor. The object of the invention is to obviate the above disadvantages and thus to increase the attainable compression factor. This object is attained in that the method of the invention comprises: providing a reference block of data groups; selecting a current block of data groups for encoding; searching, within the current block for encoding, for series of consecutive data groups in which series each data group of the current block has the same content as the data group in the same position in the reference block; generating, for a series thus found, a code which specifies a specific data group of the reference block marking the position of the end of the said series, said code specifying said specific data group with respect to value transitions in the reference block; and replacing said series by the code generated for it. In the method of the invention, the said code does not specify the number of data groups in the encoded series but the position of the end of the series with respect to a transition in pixel value in the reference block. A code of this kind is thus independent of the length of the series, and if only a small repertoire of possibilities is made available for the position indication, the code can be kept very short, even if very long series are encoded. Since the encoding according to the invention is always carried out for complete data groups simultaneously, it is sufficient to indicate in the code that data group of the reference block in which the intended transition in pixel value is situated. In an embodiment, the method according to the invention further comprises making a transition count by counting, starting from the position of the first data group of said series thus found up and until said specific data group of the reference block, data groups of the reference block in which at least one value transition is located, and generating said code as a function of said transition count. If a data group contains more than one transition, both in the block for encoding and in the reference block, it nevertheless counts as just one transition for the code. As a result, the distance that the code can bridge is increased. The number of serial numbers to be selected is preferably kept small, since otherwise a longer code is required. In one specific embodiment of the method according to the invention, the encoding method described with reference to a reference block is combined with normal run length encoding. In this embodiment, starting at a starting position in a block for encoding, a check is made whether it is possible to effect encoding with reference to a reference block and run length encoding, and what their result is. That encoding method which yields the most efficient code, i.e. the shortest codeword, is then selected. It will be clear that if both encoding methods yield the same series, the reference encoding will quickly have preference, certainly for long series. In practice, the code for the reference encoding can be kept so short that this encoding method always has preference. Preferably, the reference block selected is the block directly preceding the block for encoding. This choice, of course, gives the greatest expectation of coincidence of pixel values. Encoding in series form is not possible in every case. In such cases recourse may be had to the known encoding method in which the content of the next data group for encoding is completely included in the code, provided with a code prefix indicating that the code contains the data group itself. This solution is applied in the above-mentioned patent application and is termed "copy encoding" therein. No proof is necessary that this encoding method is very unfavourable, because the addition of the prefix results in data expansion instead of data compression. Nevertheless, the use of this encoding method is inescapable. It has been found that after a series encoding there follows practically always a data group which is not the start of a new series and which thus requires copy encoding. In one embodiment of the encoding method according to the invention, therefore, a series encoding is in most cases, as determined by a selection rule, automatically followed by a copy encoding of special form, namely without a code prefix. Since this selection rule is known on decoding, it is always clear when a copy code follows so that the prefix is superfluous. As a result, data expansion is obviated in these cases. The invention also relates to a method and apparatus for decoding a code stream formed by encoding digital image data according to the method of the invention. The structure of the method and apparatus for decoding are a mirror image of the method and apparatus for encoding. The invention will now be described in detail by reference to the accompanying drawings wherein: Figs. 1A and 1B are flow diagrams of the procedure for checking consecutive pixel values; Figs. 2A and 2B are flow diagrams of the procedure for forming a code; and Figs. 3A, 3B, 3C and 3D are flow diagrams of the procedure for forming a code for a series of pixel values to be taken over from the reference block. Fig. 4 is a schematic representation of a device for encoding image data in accordance with the invention. Fig. 5 is a schematic representation of a device for decoding image data in accordance with the invention. The encoding method according to the invention will now first be described generally. In the exemplified embodiment described, the data for encoding are available in the form of groups of 4 bits known as nibbles. However, other numbers of bits per group can be encoded in the same way by obvious adaptation of the method. Examples of other numbers are 1 and 8 bits per group. A fixed number of groups always forms a block. A block is, for example, an image line while the said bits correspond to the values of the pixels on that image line. A number of blocks (image lines) together correspond to an image of a document, the image data of which must be encoded for storage in a memory or for transmission to another device. The data for encoding are always encoded in units of the size of the said groups (nibbles). Generally, starting from a starting position in a block, one or more groups of bits are replaced by a code, whereafter the next non-encoded bit (this is therefore always a first bit of a group) is designated as the next starting position. The method comprises four different basic encoding procedures, one of which is selected according to the content of the bits for encoding, viz.: run length encoding (designation:m1) takeover from the previous line (designation:m2) takeover from the current line (designation:m3) codeless takeover from the current line (designation:m4) Run length encoding (m1) In run length encoding a series of nibbles in the block for encoding in which the bits all have the same value is counted and replaced by a code. The form of the code is: 01cxxxxx where "01" forms the code prefix which indicates that it is a run length code, "c" indicates the value (0 or 1) of the bits, and xxxxx indicates in binary form the number of nibbles in the encoded series. An extra codeword, consisting entirely of the number code, is added for larger numbers of nibbles than can be reproduced by a binary number of five bits. The value "00000" of xxxxx (which is not used for obvious reasons) is now used as an escape code in order to signal this to the decoder. In decoding, each code is again expanded to the specified number of nibbles of bits with the value c. Takeover from the previous line (m2) In this method of encoding, a series of nibbles within the block for encoding in which the bits each have the same value as the bit in the same position in the reference block (normally the preceding block), is replaced by a code which relates the end of the series to a value change in the reference block i.e. to a bit in the reference block having a value which is the opposite of the value of the immediately preceding bit in the reference block. The code also specifies what value change in the reference block is meant, counting from the starting position. The following codes are used in this procedure. After each code is given the designation used in this description and the meaning of the code to the decoder. 000 (designation:m21): take over the content of the reference block from the position corresponding to the starting position until the beginning of the first nibble in the reference block in which a value change occurs. 00100 (designation:m22): take over the content of the reference block from the position corresponding to the starting position up to and including the end of the first nibble in the reference block in which a value change occurs. 00101 (designation: m23): take over the content of the reference block from the position corresponding to the starting position up to the beginning of the second nibble in the reference block in which a value change occurs. 00110 (designation: m24): take over the content of the reference block from the position corresponding to the starting position up to and including the end of the second nibble in the reference block in which a value change occurs. 00111 (designation: m25): take over the content of the reference block from the position corresponding to the starting position up to the beginning of the third nibble in the reference block in which a value change occurs. For the above codes, it is immaterial whether more than one or exactly one value change occurs in a nibble: either case counts as a "value change". Takeover from the current line (m3) In this encoding method, the next nibble for encoding is completely contained in the code. This has the following form: 1 bbbb where bbbb are the values of the bits of the intended nibble. This encoding method will be used only if none of the other coding methods is usable. For decoding, the content of the part bbbb of the code is added to the data stream. Codeless takeover from the current line (m4) This encoding method is the same as the preceding one but has no code prefix. It is automatically either carried out or not carried out after one of the other codings, in accordance with a rule known both to the encoder and the decoder. The reason for this is that in many cases encoding in accordance with one of the other encoding methods, of the nibbles directly prior to the nibble for encoding, has been terminated because an irregularity in the bit pattern occurs in the next nibble i.e. the nibble now to be encoded. It is then advantageous for the next nibble also to be taken over into the code gratuitously. If the preceding code is an m22 or an m24 code, then no m4 code follows, because then the irregular nibble has already been included in the preceding code. In all other cases, an m4 code is always added. The code word has the form: bbbb which is equal to the content of the nibble in question. Since the decoder has the same selection rule, it is known when this code is used so that the situation remains unambiguous despite the absence of the code prefix. The decoder adds the value bbbb to the decoded data stream. Decoding can be performed very rapidly and simply by the choice of the code words. If the decoder sees a "1" as the first code bit, the m3 decoding procedure is immediately selected, if the first code bit is a "0", then the second code bit is examined. If this is a "1", then the next six code bits are interpreted as a run length code (m1) and if these six code bits contain the escape code c00000, the next byte is also decoded as an extra run length code. If the second code bit is a "0", the next bit is examined. If this is a "0", then the code is an m21 code and the following code bit forms the first of the next codeword. If the third code bit is a "1", the two following bits determine the type of code, m22, m23, m24 or m25. The decoding procedure for these codes has already been described above. An m21, m23 and m25 code is always followed by an m4 code, i.e., the next four code bits are taken over as values of the bits in the nibble. The procedure during encoding of a data stream, e. g. binary pixel values of an image, will now be explained by reference to the drawings. The pixel values (bits) are supplied in consecutive image lines, the length (II) of which is known in numbers of bits. The following variables are also used in the Figures: pointer = current variable which always indicates the position in the line of the pixel value for encoding sp = the starting position, the first bit for encoding following the last encoded bit pixc(i) = the value of pixel i in the line for encoding (0 or 1) pixr(i) = the value of pixel i in the reference line (0 or 1) WC = the starting position of the first nibble in the line for encoding, in which a value change has occurred WR = the starting position of the nibble, relevant for encoding, in the reference line, in which a value change has occurred nov = a state variable which indicates that it is no longer possible to take over nibbles from the reference line in the current cycle; it is reset (0) when a new sp is defined, and set at the time when it is found that pixc(pointer) and pixr(pointer) have unequal values nr = the number of nibbles in which a value change occurs in the reference line counting from the sp. Figs. 1A and 1B describe the investigation of the pixel values one by one in the line for encoding. If a value change is found in that line, then a separate routine is adopted to make a code as described in Figs. 2A and 2B. If this routine shows that there is also a value change in the reference line at the position of the value change, then a check is made whether a longer series is to be encoded with an m2 code. This is described in Figs. 3A, 3B, 3C and 3D. The procedure in Fig. 1A starts at the beginning of a new line or a new code series within the current line (A). In an initialisation routine, the value of the pointer, WR and WC is made equal to the starting position and nov is reset. A check is then made whether the first pixel value of the line for encoding is the same as that of the reference line. If not, then only the encoding methods m1 and m3 are possible, and in that case the procedure continues with counting equal pixel values in the line for encoding, after which a procedure is adopted to form the code in dependence on the length of the series found during the count (Fig. 2B). During counting a check is made whether the end of the line is reached and if so then the procedure for forming a code in Fig. 2B is forcedly adopted. If the first pixel values of the line for encoding and the reference line are the same, a loop routine is started as described in Fig. 1B. In this a check is made in each case for a subsequent pixel value to determine whether the pixel values at the pointer position in the line for encoding and the reference line are equal to one another and whether they are each equal to the pixel value in the position preceding them. If the pixel values at the pointer position in the line for encoding and reference line are not equal to one another, then any m2 code series can in no case proceed beyond the nibble in which the pointer is at that moment situated. This is determined by giving the variable nov the value "1". If a value change has occurred at the pointer position in the reference line, then if this is the first time after the starting position the starting position of the current nibble is stored in WR. If a value change has occurred at the pointer position in the line for encoding, then the loop of Fig. 1B is left and the procedure for forming a code is adopted. The loop of Fig. 1B is also left if the end of the line for encoding is reached. Here again the forming of a code is forced by giving some variables a different value. The procedure for forming a code is shown in Figs. 2A and 2B. This procedure consists of two branches, one for forming an m2 code (Fig. 2A) and the other for forming an m1 or an m3 code respectively (Fig. 2B). Before a choice is made between one of these two branches, a check is made to determine whether the pointer is still in the first nibble after the starting position. If so, then only an m3 code is possible, and for that purpose the m1/m3 branch is immediately taken. If the pointer is already past the first nibble, the starting positions of the first nibbles in which a value change has occurred, in the line for encoding (WC) and in the reference line (WR), are compared with one another. Since this procedure is adopted at the first value change in the line for encoding, WC is thus always the starting position of the current nibble. If WR is smaller than WC, then a value change has occurred in the reference line rather than in the line for encoding, and run length encoding is selected because a longer series can be encoded by this. Since an m2 code is shorter than a run length code, m2 encoding could also be chosen if WR is a small number of positions, for example 4 (one nibble), smaller than WC, but that has not been worked out in this example. In the case of run length encoding (Fig. 2B), a check is first made whether the series of nibbles for encoding consists of at least two elements (8 pixel values). If this is so, an m1 code is formed for the nibbles from the starting position up to the current nibble, with the value of the pixels in the nibble preceding the current nibble as the value for the bit "c" in the code, followed by an m4 code. A new starting position is then determined for the next code cycle and a test is carried out as to whether this new starting position extends past the end of the line (this is possible as a result of the m4 code), in which case everything is prepared for encoding the following line. The decoder is informed of the length of the lines so that the code does not have to be adapted. Any excessive pixel values generated are simply cancelled. If the number of nibbles for encoding is smaller than or equal to 2, an m3 code is formed for the first nibble for encoding, followed by an m4 code, so that in each case the entire series is encoded. A check is again made as to whether the line end is reached. If WC and WR are equal, the branch for the m2 codes is taken in the procedure for forming a code. In this case, a value change has occurred in the line for encoding and in the reference line, in the same nibble. A check is now made whether there was already a value change in that nibble in the reference line. If that is the case (nov = 1) then the line for encoding, from the starting position up to the current nibble, is equal to the reference line (encoding is always effected in whole nibbles) and this part of the line for encoding can be encoded with an m21 code followed by an m4 code. A new starting position is then determined for the following code cycle and a test is again made as to whether this new starting position extends past the end of the line. If WC and WR are equal and if nov is still equal to 0, then the value change found is apparently situated in the same position in the line for encoding as the first value change in the reference line, and both lines are equal from the starting position up to and including the current pixel value. A check is now made whether the encoding can be extended by reference to the reference line to an m22, m23, m24 or m25 encoding. This is described with reference to Figs. 3A, 3B, 3C and 3D. Stepping along the pixel values of the line for encoding, this procedure is aimed at finding a series of consecutive positions in which the pixel values in both lines are equal 2 by 2. At the instant that this is no longer the case the encoding cannot be continued and the code is formed. This code relates the end of the series of nibbles for copying from the reference line during decoding from the reference line, to a specific value change named by name in the reference line and will therefore depend on whether the first value change not occurring simultaneously in the two lines is situated in the line for encoding or in the reference line. If this value change is situated in the reference line, a code is selected which describes a series from the starting position up to the nibble in which the value change is situated (m23 or m25). An m4 code following thereon then encodes the nibble with the value change itself. If the value change in question is situated in the line for encoding, the end of the series described by the code cannot extend further than up to and including the nibble in which the last value change was situated in the reference line (m22 or m24). In that case the addition of an m4 code is not logical, because the nibble following thereon will frequently not contain any value change. The procedure will now be described in detail. At the start, the variable nr in which the number of nibbles in the reference line with at least one value change is noted, is brought to the value "1", since, of course, the first value change has already been found. A loop operation is then started, in which the pointer is always set one pixel value further and then a test is made whether a value change has occurred at the new pointer position in the line for encoding and/or the reference line. After a test for the end of the line being reached the loop returns to its start. If a value change is found in the line for encoding, a subroutine follows (Fig. 3B) in which a check is first made whether there is also a value change in the same position in the reference line. If that is so, a check is made whether a value change has already been found in the reference line in the current nibble. This test is carried out by determining the starting position WR' of the nibble and comparing it with the starting position WR of the nibble in which the previous value change was found in the reference line. If WR' and WR are equal, then the last value change found really is situated in a nibble which already contains another value change and can therefore be cancelled because the number of value changes per nibble is not used for the encoding as long as they occur simultaneously in both lines. If WR' and WR are unequal, a new nibble is obviously found with a value change and this is administered by raising the value of nr by 1 and making WR equal to that of WR'. The code can point ahead to a maximum of three nibbles and a test is now therefore made whether the number of nibbles found from the starting position (nr) has reached the value 3, in which case this code cycle is terminated by forming an m25 code followed by an m4 code, calculating a new starting value and the usual test for reaching the line end. If the variable nr has not yet reached the value 3 and also if WR' and WR are equal, the procedure returns to the loop (Fig. 3A) and the next pixel value is examined. If at the start of the subroutine of Fig. 3B no value change is found in the reference line, so that there has been a value change in the line for encoding and not in the reference line at the pointer position, then the end of the encodable series is reached and a code is formed (Fig. 3C) in dependence on the number (nr) of nibbles found in the meantime with at least 1 value change. If this number is 1, then an m22 code follows, otherwise (nr = 2) an m24 code. No m4 code then follows. A new starting position is then determined and a new encoding cycle started. In this case no test is necessary for the line end, because in an m22 and an m24 code the end of the encoded series is set back with respect to the pointer position. If no value change is found in the line for encoding in the loop shown in Fig. 3A, a check is made within the loop whether there has been a value change in the reference line at the pointer position. If this is also not the case, then the two lines are equal and the next pixel value can be checked. If a value change is found, the end of the encodable series is reached and a code (m23 or m25) is formed in a subroutine which is shown in Fig. 3D. In this subroutine the starting position of the current nibble is first determined in order to determine the new starting position. Depending on the number of nibbles already found with at least 1 value change (nr), an m23 code is then formed (for nr = 1) or an m25 code (for n = 2), followed by an m4 code in both cases. A new starting position is then determined, a test is made for reaching the end of the line and then a new encoding cycle is started. This completes the description of the embodiment of the encoding method according to the invention. It should however be noted that other embodiments of the invention are possible. For example, a whole nibble can also always be processed at any one time. The method must be adapted to some extent for this purpose, but that is within the scope of the claims. An apparatus for performing the encoding or decoding according to the invention can be embodied by programming a general computer in accordance with the flow diagrams shown in the drawings and requires no further explanation. An apparatus can also be constructed which performs the same operations with tailored hardware circuits or which consists of a suitably programmed computer expanded with hardware circuits for specific functions. Here, too, numerous variants are possible within the scope of the claims. A block scheme of an apparatus for performing the encoding according to the invention is shown in Fig.4. It comprises a supply module 1 for supplying image data, connected to two comparators 2 and 3 and to a control module 4. Also each of the comparators is connected to the control module 4, which is further connected to two code generators 5 and 6. Both code generators and the control module are connected to a code string compiler 7. The supply module 1, which may be a memory having a read-out pointer, controlled by the control module 4, supplies the image data for encoding to the comparators 2 and 3 in nibbles of four bits at a time. It supplies the data of the image line to be encoded (the "current" line) and those of the previous image line to comparator 2, each time delivering the next nibble of the current line and the nibble at the same position of the previous line at the same time. Comparator 2 checks wether the contents of the two delivered nibbles are identical, and reports its findings to control module 4. Comparator 3, which is supplied with nibbles of the current line only, checks wether the content of the nibble delivered is identical to that of the previous nibble of the current line, and also reports its findings to control module 4. Control module 4 processes the findings of the comparators in accordance with the method described above in relation to Figs.1A and 1B, and decides what kind of encoding should be performed on the image data. In case it decides for run length encoding, it starts up code generator 6, which forms a code in accordance with the method described above in relation to Fig.2B, and in case control module 4 decides for encoding with reference to the previous image line, it starts up code generator 5, which first investigates what coding scheme (m21 to m25) to use and then encodes the image data in accordance with the method described above in relation to Fig. 2A and Figs. 3A, 3B and 3C. Each time a code is delivered, it is added to the code string by code string compiler 7 on a command of control module 4, which also directs the pointer of supply module 1 to the next nibble to be encoded. A block scheme of an apparatus for performing the decoding according to the invention is shown in Fig.5. It comprises a receiver 11 for receiving a code string, connected to a first interpreter 12, the latter being further connected to a run length decoder 13, a decoder 16 and a second interpreter 14. The second interpreter 14 is further connected to a decoder 15, which is also connected to a memory 17. The three decoders 13,15 and 16, and memory 17 are further connected to a data string compiler 18. The receiver 11 delivers the code string to first interpreter 12, which reads the first two bits of the code word and therefrom decides which of the three decoders 13, 15 and 16 should be used to expand the code. Further, since the length of the code word is uniquely determined by the coding scheme, it determines the length of the code word. In case the code is a copy code that should simply be copied into the decoded data string, first interpreter 12 passes the code word to decoder 16, which delivers the decoded data to data string compiler 18. In case the code is a run length code, first interpreter 12 passes the code word to run length decoder 13, which expands the code and delivers it to data string compiler 18. In case the code is one with reference to the previous image data line, the first interpreter passes the code word to second interpreter 14, wich further decides from the code word, what decoding scheme should be used for reconstructing the image data. Second interpreter 14 then instructs decoder 15 to actually reconstruct the image data, using the previous line of image data, which has previously been stored in memory 17. Decoder 15 delivers the reconstructed image data to data string compiler 18. Data string compiler 18 adds the delivered decoded image data to the data already decoded and passes the data on for further processing, e.g. printing. Also, when it has compiled one line of image data, it writes it into memory 17 for use by decoder 15.

Claims: A method of encoding digital image data comprising consecutive blocks of data groups which are situated at consecutive positions within the blocks and which have as content binary values always of the same number of pixels of an image, said method comprising providing a reference block of data groups, selecting a current block of data groups for encoding, searching, within the current block for encoding, for series of consecutive data groups in which series each data group of the current block has the same content as the data group in the same position in the reference block, generating, for a series thus found, a code which specifies a specific data group of the reference block marking the position of the end of the said series, said code specifying said specific data group with respect to value transitions in the reference block, and replacing said series by the code generated for it. A method according to claim 1, further comprising making a transition count by counting, starting from the position of the first data group of said series thus found up and until said specific data group of the reference block, data groups of the reference block in which at least one value transition is located, and generating said code as a function of said transition count. A method according to claim 1 or 2, further comprising indicating in the said code, whether the data group in the current block for encoding situated in the position of said specific data group of the reference block is included in the encoded series. A method according to any one of the preceding claims, wherein: starting at a starting position in a current block for encoding and always for a following position within the block, a check is made whether the data group situated at that position has the same content as the data group in the same position in the reference block, and for the longest series of data groups with a content identical to the content of the corresponding data group in the reference block, found in this way, said code is generated. A method according to claim 4, wherein also: starting at the same starting position in the current block for encoding, and always for a following position within the block, a check is made whether the content of the data group situated in that position is identical to the content of the data group preceding the same, and a run length code is formed for the longest series of data groups with identical contents, found in this way; and whichever of the two said longest series yields the most efficient code is selected and replaced by the associated code. A method according to any one of the preceding claims, characterised in that the block immediately preceding the current block for encoding is used as the reference block. A method according to any one of the preceding claims, wherein after replacement of a series by a code the next uncoded data group of the current block for encoding is encoded with a code consisting completely of the content of that data group. A method according to any one of the preceding claims, wherein a data group comprises a group of four bits. A method according to any one of claims 1 to 8, wherein a data group comprises one bit. A method according to any one of claims 1 to 8, wherein a data group comprises a group of eight bits. A method of decoding encoded digital image data, which image data comprise in uncoded form consecutive blocks of data groups situated in consecutive positions within the blocks and having as content binary values always of an equal number of pixels of an image, and comprise in encoded form a series of codes, comprising determining always, for a following code of the code series, by reference to a predetermined part of the code, whether the same refers to a reference block of uncoded image data and, if so, selecting, by reference to a second predetermined part of the code, a data group having at least one value transition in the reference block and expanding the associated code as a series of data groups having the same content as the series of data groups in the reference block, starting at the position following the position of the last data group formed from the preceding code and ending at the position of the selected data group in the reference block. A method according to claim 11, wherein, in addition, there is determined from a predetermined part of the code whether the said selected data group in the reference block does or does not belong to the data groups to be taken over during the said expansion, and wherein the said selected data group in the reference block is, in the affirmative case, taken over as the last element of the series formed by the expansion. A method according to claim 11 or 12, wherein the preceding decoded block is used as reference block. A method according to claim 11, 12 or 13, wherein after expansion of a code a data group is formed from the next code by taking over the content of that code unchanged. Apparatus for encoding digital image data comprising consecutive blocks of data groups situated in consecutive positions within the blocks and having as content binary values always having the same number of pixels of an image, comprising supply means (1) for supplying the pixel values of a current block for encoding and those of a reference block determining means (2,4), connected to the supply means (1), for determining whether the current block for encoding contains a series of consecutive data groups each having the same content as the data group in the same position in the reference block, and for collecting information identifying such series, and a code generator (5), connected to said determining means (2,4) for delivering a code for such series based on the information collected by said determining means (2,4), said code generator (5) being provided with means for indicating a specific data group of the reference block marking the end of the series, for relating the position of said specific data group to value transitions in the reference block and for compiling a code describing this position with respect to said value transitions. Apparatus according to claim 15, wherein said determining means (2,4) is adapted to make a transition count by counting, starting from the position of the first data group of said series up and until the end of said series, data groups of the reference block in which at least one value transition is located, and said code generator (5) is adapted to compile said code as a function of said transition count. Apparatus according to claim 15 or 16, wherein said code generator (5) is also adapted to indicate in the code whether the data group in the block for encoding situated in the position of said specific data group in the reference block is included in the encoded series. Apparatus for decoding encoded digital image data, which image data comprise in uncoded form consecutive blocks of data groups situated in consecutive positions within the blocks and having as content binary values always of an equal number of pixels of an image, and comprise in encoded form, a series of codes comprising receiving means (11) for receiving the series of codes; a memory (17) for storing a reference block of data groups in uncoded form; first interpretation means (12), connected to said receiving means (11) for selecting always, for a following code of the code series, a predetermined part of the code, interpreting that part, determining, on the basis of such interpretation, the length of the code and determining whether the said code refers to a reference block of uncoded image data and, if the latter test is answered in the affirmative, passing the code to: second interpretation means (14), connected to said first interpretation means (12) for selecting a second predetermined part of the code, interpreting the same, and, on the basis of such interpretation, selecting a specific data group of the reference block, expansion means (15), connected to said second interpretation means (14) and to said memory (17) for forming a series of data groups by copying the content of consecutive data groups of the reference block, from the data group at the position following that of the last data group formed from the preceding code up to a position related to the position of said specific data group selected by the second interpretation means (14), and compiling means (18), connected to said expansion means (15) for appending the series thus formed to the data groups formed from preceding codes.

Inventors: VAN DORSSELAER ETIENNE LUDOVIC, VAN DORSSELAER, ETIENNE LUDOVICUS M.E.
Applicants: OCE TECH BV, OCE-TECHNOLOGIES B.V.
Application year: 1993
Main classification: H04N1
IPC codes: H04N1, G06T9