A METHOD FOR COMPRESSION ENCODING OF DIGITAL PICTURE VIDEO SIGNALS, USING CO-ENCODING OF BLOCKS FROM SEVERAL PICTURES

Abstract: In a digital picture video signal compression encoding process for transmitting such signals via a narrowband transmission medium, two or more pictures are co-encoded by encoding/decoding blocks having the same picture position, together. First, the block of the last picture is encoded/decoded, and thereafter, the decoded result in this block is used as a prediction for the remaining blocks, together with information from previously decoded pictures. Preferably one single shift/movement vector is used in order to indicate a prediction for several blocks. In addition, transform coefficients representing difference signals to be transmitted, are interwoven from the blocks to be co-encoded, so that the transmission format for transforming coefficients will be the same as when encoding/decoding one block.

Description: A method for compression encoding of digital picture video signals, using co-encoding of blocks from several pictures The present invention relates to a method for encoding digital picture video signals in order to reduce the amount of data possibly to be transmitted.- More particularly the inven¬ tion concerns how to encode more than one picture at the same time, or more precisely, a number of blocks from different pictures simultaneously. Several standard methods exist for compressing video signals. In a number of these methods (ITU recommendation H.261 and ISO/IEC 11172) the following techniques are substan¬ tially utilized in order to achieve compression of the data to be transmitted: 1. The pictures, which consist of a number of pixels, are divided into a number of blocks, e.g. consisting of 8x8 or 16x16 pixels. The size utilized depends on what is to be done. 2. Since pictures following each other in direct temporal succession often are relatively similar, a picture block can often be described approximately by using parts of previously encoded pictures. If one presupposes that a block of 8x8 pixels is to be encoded, said block being referred to as 0RIG(i,j) i,j=1...8, one will search for a suitable block of 8x8 pixels in a pre¬ viously encoded picture. This block in the previously encoded picture will typically have a shifted position in the picture as compared to ORIG, which fact reflects movements in the picture content. The magnitude of the shift is indicated by means of a so-called vector stating the number of pixels along which the block has been shifted in a horizontal and a verti¬ cal direction. The block which has been found to be rather similar to the ORIG block, is referred to as a prediction for the ORIG block, and it is defined as PRED(i,j) i,j=l...8. Algorithms exist for finding a best possible PRED block in a previously encoded picture, however such algorithms are not investigated in detail in this specification, since detai¬ led formulations of such algorithms do not constitute any part of the present invention. 3. Since a receiver is capable itself of generating PRED (the receiver has stored the necessary previously reconstruc¬ ted encoded/decoded pictures, and is also itself able to compute PRED in accordance with the same algorithm as the transmitter) , there is no need to transmit the full ORIG. It is sufficient to transmit a so-called difference signal defined as follows: DIFF(i,j) = ORIG(i,j) - PRED(i,j) i,j=1...8. 4. In order to transmit DIFF in a form as highly compressed as possible, one usually converts the DIFF block (which in the present example is 8x8 pixels) into a matrix which contains 8x8 transform coefficients which thus represent DIFF. To a large degree the so-called two-dimensional Cosine transform is utilized, which transform has favourable characteristics. The transform coefficients obtained by transforming DIFF are referred to as TRANS, and are defined as follows: TRANS(i,j) i,j=1...8. 5. Subsequent to transforming DIFF into TRANS, the transform coefficients are quantized, and the transformed and quantized coefficients which through quantizing now constitute an appro¬ ximate representation of DIFF, can then be transmitted to a receiver in accordance with a certain matrix reading strategy, see e.g. the reading strategy and formatting into transmit- table data described in Norwegian patent no. 157.080 belonging to the applicant in the present application. In the receiver, inverse quantizing and inverse transforming are undertaken in order to reconstruct DIFF, but what is reconstructed, are values DIFF' deviating somewhat from DIFF. The reason for the deviation is the quantization. It is to be noted that the two last mentioned operations must be made in an equal manner at both the transmitting and the receiving sides. The obtained DIFF' values are utilized for reconstructing a representation ORIG' of the picture block which was to be encoded: ORIG'(i,j) = PRED(i,j) + DIFF' (i,j) i,j=1...8. When picture compression is taken into use, it is neces¬ sary both to compress in order to represent the pictures by as few bits as possible, and de-compress to be able to display the pictures again. It is an expression often used, that compression is undertaken at the transmitter side, and de¬ compression is undertaken at the receiver side. The calcula¬ tion operations to be done are therefore also divided in two parts quite naturally: One set of operations for the trans- mitter and one set of operations for the receiver. The calcu¬ lation operations at the transmitter side, which roughly comprise finding a prediction, constructing a difference signal, making a transformation and finally preparing a bit stream, is usually referred to as "encoding". Thus, it is referred to encoding e.g. a block or a complete picture. In the same manner the calculating operations at the receiver side are referred to as "decoding", which operation roughly comprises finding the prediction from a received vector, making an inverse transformation and assembling the picture for display. Encoding and decoding are in reality closely connected, since an encoding process followed by a decoding process shall lead to a reconstructed picture. It is impor¬ tant to note that the transmitter must also undertake large parts of the decoding process, because the transmitter and the receiver must have exactly the same reconstructed pictures as a basis for the predictions. From what has been stated above, many of the calculating operations used in compression, will be reflected both at encoding and decoding (this relates e.g. to "run patterns" for coefficients. One has to use the same run pattern both at the transmitter side and the receiver side) . The present inven¬ tion deals with such operations which must be made both at the transmitter and the receiver sides. Often when talking about "encoding", one will thus actually include both encoding and decoding. This holds valid also regarding parts of this description, as well as the patent claims. In the ISO/IEC 11172 and ISO/IEC 13818 standards for picture compression, one utilizes different picture types. These types are largely characterized by the manner of prepa¬ ring predictions of blocks. In the cases where a picture is encoded without using any prediction, the designation "I pic- tures" is used. In the case where there is used a prediction from one single previously decoded picture, the picture being encoded is designated as a "P picture" (P meaning predicted) . A third type of picture is a "B picture" (B meaning two-way or "bidirectional" prediction) . In order to encode a B picture, one utilizes information from two previously decoded pictures, one of which being ahead of and one of which succeeding the picture to be encoded, as a prediction. In figs. 1 and 2 is illustrated how to prepare a predic¬ tion of blocks if there is a situation with a mixture of P and B pictures. It is presumed that picture 1 has been trans¬ mitted to the receiver. This cannot have been a B picture. The next to happen is that the whole of picture 3 will be encoded. Predictions for the blocks in picture 3 can be found in picture 1, and an example is shown by the block 0RIG2 in picture 3 finding its prediction as block PRED1 in picture 1. The movement vector (shift vector) describing the position of PREDl in relation to ORIG2, is VI. Correspondingly predic¬ tions in picture 1 are found for all blocks in picture 3, i.e. a set of movement vectors are listed corresponding to all blocks in picture 3. Next, all of picture 2 shall be encoded. As appears from fig. 2, block ORIG1 in picture 2 can then be predicted as a mean value between blocks PRED2 and PRED3 in the two encoded pictures 1 and 3. PRED2 and PRED3 are found separately by using the ordinary algorithm, and two movement vectors V2 and V3 indicate where the two blocks used for the prediction are situated. Thus, the prediction itself is here generated as a calculated combination of the PRED2 and PRED3 blocks, i.e. in the simplest manner as a mean value, (PRED2 + PRED3)/2. Such an encoding method often turns out to be efficient, because the prediction of picture 2 comes out well, and for this reason the rest signal ("quantized TRANS") requires only few bits for the transmission. The greatest disadvantage of the method described here, is that for prediction of B pictures, one has to read data from two pictures (PRED2 and PRED3) , and every such data reading is resource-demanding as to implementation. The invention aims at providing an alternative method of encoding P and B pictures, in order to simplify the data reading and to save transmission capacity by reducing the amount of data to be transmitted. The goal is achieved in accordance with the invention by means of a method of the type stated in the appended patent claims. In the following the invention shall be explained in more detail, preferably using a description of the preferred embo- diment. It is at the same time referred to the enclosed drawing, where fig. 1 and fig. 2 illustrate previously known techniques for prediction, and fig. 3 shows a prediction technique in accordance with the present invention. According to the present invention one does not encode pictures one by one, as described above in connection with the prior art techniques. Instead, a number (N>1) of blocks having the same position in N successive pictures are encoded "simul- taneously". (Regarding the term "simultaneously", this means actually that the bits produced from the N blocks are made in one unity. Usually this will also mean that all calculating operations for the N blocks are made prior to passing to a new set of blocks. However, this last operation is not strictly necessary. One might contemplate that a manufacturer would find some advantage in making the calculating operations themselves at different times, storing the necessary results and then at a later time packing them together to a unity as mentioned above.) As an example, it is now demonstrated how to co-encode blocks from two pictures, but the invention also covers the possibility of encoding blocks from more than two pictures (i.e. from N pictures) simultaneously. While referring to fig. 1 and fig. 3, the encoding process starts by encoding ORIG2 (see fig. 1) using a predic¬ tion from PRED1. This process then leads to the making of a reconstructed block ORIG2' . Then one passes directly to block ORIGl in picture 2 (see fig. 3) , which block thus has the same picture position as 0RIG2 in picture 3 (see both fig. 1 and fig. 3) . The predic¬ tion now to be used for ORIGl, can be formed on the basis of both PRED4 in picture 1, and parts of the just decoded 0RIG2' . The vectors used here, are down-scaled from vector VI which was used for preparing a prediction of ORIG 2 (see fig. 1) . Thus, in this example one has used V4V1 og --Vl. As appears from fig. 3, the dark shaded part of ORIGl can be predicted as a mean value of PRED4 and ORIG2' . The light shaded part of ORIGl is predicted only from PRED4. The strategy outlined above, can be extended to comprise more than two pictures (i.e. pictures 2 and 3 as shown), e.g. when encoding three pictures, the last picture (picture 4) , or rather a block in picture 4, will first be predicted by a block in picture 1, and thereafter a reconstructed block will be prepared in picture 4. Thereafter, a one picture jump back is made, that is to picture 3, in order to attack a block in the same position as the block in picture 4. This block in picture 3 is then predicted by means of parts of the recon¬ structed block in picture 4, as well as information from decoded picture 1. Finally, a prediction is made for the block in the same position in picture 2, and in a correspon¬ ding manner, as a combination of the reconstructed block in picture 4 and information from encoded picture 1. Also in this case down-scaled vectors from the first vector VI are used, for instance down-scaled by a factor 1/3. In order to return to the example using two pictures, i.e. picture 2 and picture 3 as shown in the drawing figures, the rest signal of the blocks in picture 2 and picture 3 are then grouped together, before attacking a block in another picture position. In order to transmit the rest signals of the blocks in picture 2 and picture 3, one gets two difference blocks DIFF1 and DIFF2 and thereafter two sets of transform coefficients TRANS1 and TRANS2. These sets of transform coefficients are then interweaved, so that the transmission of transform coefficients takes place in the same manner as if only one single block were encoded. The advantages of the form of encoding of B pictures shown hereabove, are as follows: It is only necessary to read one data block for each picture block to be predicted (PREDl and PRED4 must be read to predict ORIGl and ORIG2, while the B picture appearing in fig. 2, raises a need for reading two blocks per prediction). Further, only one vector (VI) is used for predicting both (all) blocks. Hence, on the transmitter side one must only find one vector, as opposed to the three vectors which were necessary in order to encode ORIG2 and ORIGl as separate P and B pictures in accordance with the technique exhibited in fig. 1 and fig. 2. Transmission capacity is saved by the use of only one vector VI for the prediction of two blocks, and by co-encoding two pictures, capacity is saved, which capacity would other¬ wise have been used for transmitting various side information. To sum up, blocks in the same positions in the successive pictures to be encoded, are encoded together. This is done by predicting the block of the last picture, i.e. block N, by a block in an encoded picture preceding the N pictures. A reconstructed and decoded block N is then provided, and this block is used further for producing predictions for the remai¬ ning ones of the N blocks in the same picture position, how- ever information from previously decoded pictures are also utilized together with reconstructed block N. (In the exam- plified case, the information mentioned here is constituted by the content of a predicted block in the previously decoded picture, but it is also possible to use other previously decoded pictures.) Preferably one single vector is then used to indicate a prediction for all the topical N blocks, with a suitable down- scaling. In order to obtain a further favourable effect, transform coefficients for the N blocks are combined into a matrix, so that the same transmission format can be used as when one single block is encoded/decoded and transmitted.

Claims: P A T E N T C L A I M S 1. A method for compression encoding of digital picture video signals, for example in connection with transmission of such signals via a narrowband transmission medium, said method comprising the following steps: a) dividing pictures to be encoded into a number of blocks of a given size, i.e. having a given number of pixels; b) establishing predictions for each block using blocks in one or several previously encoded pictures and according to predetermined algorithms; and c) providing reconstructed blocks, i.e. blocks having been encoded and decoded in accordance with a predetermined encoding/decoding scheme, using said predictions, c h a r a c t e r i z e d in that blocks from N>1 successive pictures are encoded and decoded together by grouping together blocks in the same picture position for each one of the N pictures, the last one of these blocks (block N) first being pre- dieted by a block in an encoded picture prior to the N pictu¬ res, thereafter to reconstruct block N using the prediction block and in accordance with said encoding/decoding scheme; and thereafter, the reconstructed, decoded block N is used in a combination, computable in accordance with said predetermi¬ ned algorithms, with information from previously decoded pictures, for producing predictions for the remaining ones of said N blocks, whereby all N blocks are also produced in a reconstructed, encoded form and are able to be treated as a unity signalwise, prior to grouping a new set of N blocks in another picture position in a corresponding manner. 2. The method of claim 1, in which reconstructed blocks are provided by adding to predictions, reconstructed difference blocks being produced by a) first establishing a difference block as a difference between an original block and the established prediction thereof, b) transforming said difference block in accordance with a predetermined transformation scheme, e.g. using a two- dimensional Cosine transformation, for providing a matrix of transform coefficients, c) quantizing said transform coefficients to form a simpli¬ fied and approximate representation of said difference block, e.g. for transmission of this representation via said narrowband transmission medium, and d) undertaking inverse quantizing and inverse transformation in order to produce said reconstructed difference blocks, c h a r a c t e r i z e d in that said transform coeffi- cients representing difference blocks for said N blocks, are interweaved in a combined matrix according to a predetermined rule, e.g. in order to utilize the same transmission format as when encoding/decoding one single block. 3. The method of claim 1 or 2, in which blocks from two successive pictures are co-encoded and co-decoded, the predic¬ tion block for the topical block in the last picture being determined in the reconstructed version of the picture imme¬ diately prior to the first one of said two successive pictures, c h a r a c t e r i z e d in that a vector for indicating shift in the picture plane from said determined prediction block to said topical block in the last picture, is estab¬ lished as the only necessary indication of the prediction, and the same vector is used twice in a down-scaled form also for providing a prediction for the first picture, using blocks from the reconstructed versions of said immediately prior picture and said last picture.

Inventors: BJOENTEGAARD GISLE, BJOENTEGAARD, GISLE
Applicants: BJOENTEGAARD GISLE, TELENOR FORSKNING OG UTVIKLING, BJOENTEGAARD, GISLE
Application year: 1995
Main classification: H04N7
IPC codes: G06T9, H04N7