|Publication number||USRE35093 E|
|Application number||US 08/353,968|
|Publication date||Nov 21, 1995|
|Filing date||Dec 9, 1994|
|Priority date||Dec 3, 1990|
|Publication number||08353968, 353968, US RE35093 E, US RE35093E, US-E-RE35093, USRE35093 E, USRE35093E|
|Inventors||Feng M. Wang, Dimitris Anastassiou|
|Original Assignee||The Trustees Of Columbia University In The City Of New York|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (9), Non-Patent Citations (12), Referenced by (108), Classifications (14), Legal Events (3)|
|External Links: USPTO, USPTO Assignment, Espacenet|
.Iadd.The U.S. Government has a paid-up license in this invention and the right in limited circumstances to require the patent owner to license others on reasonable terms as provided for by the terms of contract No. CDR-88-1111 awarded by the National Science Foundation. .Iaddend.
.Iadd.This application is a continuation of application Ser. No. 08/218,970, filed on Mar. 25, 1994, now abandoned, and is a reissue of U.S. Pat. No. 5,193,004. .Iaddend.
This invention relates to methods and systems for coding alternate fields of an interlaced video format and has particular applicability to arrangements wherein the other fields have already been coded.
Interlaced scanning is an efficient method of bandwidth compression for television transmission. Further bandwidth compression can be achieved by downsampling the interlaced video sequence by deleting either all the even or all the odd fields. This scheme is used, for example, in the current Motion Picture Experts Group (MPEG) proposal relating to coding and decoding protocols for the compression of video data. In that proposed format only the odd fields of an interlaced video sequence are encoded and transmitted. The present invention, utilizing the fact that even and odd fields are highly correlated, makes it possible to code the missing even fields very efficiently.
It is therefore the object of this invention to provide methods and systems for efficiently coding one field of an interlaced video.
It is a further object of this invention to provide methods and systems for coding interlaced video data so as to permit efficient and accurate decoding using methods and systems also in accordance with the invention.
In accordance with the present invention, a system, for multi-mode predictive interpolative coding of fields of video, includes input means for coupling current and later fields of interlaced data, such fields including even fields having pixel data for line positions at which pixel data is omitted in prior and later odd fields, separator means for separating even fields of data from odd fields of data and delayed coupling means for providing past odd field data. The system also includes storage means for storing data and for providing past even field data from storage and interpolation means, coupled to receive current even, future odd and past odd fields of data, for deriving and coupling to the storage means enhanced fields of data corresponding to each of such fields of data and having estimated pixel data at omitted line positions. Block matching means are included for comparing current even enhanced field data with each of the future odd and past odd enhanced fields and past even field data to develop motion vector signals indicative of location of best matched blocks of future odd, past odd and past even data, and for coupling motion-vector signals to the storage means. The system further includes comparator means for utilizing blocks of pixel data retrieved from storage in response to motion vector signals for performing a plurality of mode comparisons of a block of current even pixel data with different ones of the best matched blocks alone or on an averaged basis for deriving a best mode signal representative of a single best mode block having the least error and deriving pixel error signals representing pixel by pixel errors in the best mode block, and output means for providing pixel error signals, best matched block location signals based on motion vector signals corresponding to the best mode signal, and odd field pixel data signals for transmission for use by a decoder.
Also in accordance with the invention a system, for decoding coded fields of video, includes input means for coupling location signals providing location data for best matched blocks, pixel error signals representative of pixel value errors in a best mode block relative to a current even field of pixel data, and odd field pixel data signals, and storage means for storing fields of pixel data, including a future odd field and past odd and even fields. Address generator means are included for providing address signals for retrieving one or more blocks of pixel data from stored future odd and past odd and even fields, and block coupling means provide a single best mode data block regardless of the number of blocks of pixel data simultaneously retrieved, and includes means for averaging simultaneously retrieved blocks of pixel data. Also included are block adder means for combining pixel error signals with the single best mode data block to provide a block of current even field pixel data, and combiner means for providing video signals including alternating odd and even fields of data.
Further in accordance with the invention, a method, for coding multi-mode predictive interpolative coded fields of video, includes the steps of:
(a) providing a current field of interlaced pixel data, and past and future fields of such data;
(b) providing estimated pixel data at omitted line positions in the past and future fields of data to form enhanced fields of pixel data;
(c) comparing a block of pixel data from the current field with corresponding blocks of data from such past and future fields to derive motion vector signals indicative of best matched blocks of data;
(d) developing pixel error signals representing pixel by pixel errors based on utilization of best matched blocks in different modes for comparison with the block of pixel data from the current field and developing best mode signals indicative of which of such modes represents the least overall error; and
(e) providing the best mode signals, motion vector signals, pixel error signals, and the future odd field of data for transmission for use by a decoder.
Also in accordance with the invention a method, for decoding coded fields of video, includes the steps of:
(a) receiving location signals providing location data for best matched blocks of data, pixel error signals representative of pixel value errors in a best mode block relative to a current even field of data, and odd field pixel data signals;
(b) storing fields of pixel data which, relative to the current even field, include a future odd field and past odd and even fields;
(c) deriving, with use of location signals, address signals used in retrieving from storage one or more blocks of pixel data from stored future odd and past odd and even fields;
(d) providing an averaging function, responsive to blocks of pixel data retrieved in step (c), to provide a single best mode data block regardless of the number of blocks of pixel data simultaneously retrieved from storage;
(e) combining the best mode data block with such pixel error signals to derive a block of current even field pixel data; and
(f) assembling even fields of data for combination with the odd fields of data to provide video signals including alternating odd and even fields.
For a better understanding of the present invention, together with other and further objects, reference is made to the following description, taken in conjunction with the accompanying drawings, and its scope will be pointed out in the appended claims.
FIG. 1 shows the a system diagram of an encoder in accordance with the invention.
FIG. 2 shows a field splitter useful in the FIG. 1 encoder.
FIG. 3 shows a linear interpolator useful in the FIG. 1 encoder.
FIG. 4 shows a block data encoder useful in the FIG. 1 encoder.
FIG. 5 shows a uniform quantization table used for coding block data.
FIG. 6 shows a zig-zag scanning diagram of an 8×8 DCT block.
FIG. 7 shows a block data decoder useful in the FIG. 1 encoder and the FIG. 13 decoder.
FIG. 8 shows a best mode generator useful in the FIG. 1 encoder.
FIG. 9 shows an error generator useful in the FIG. 8 best mode generator.
FIG. 10 shows an average error generator useful in the FIG. 8 best mode generator.
FIG. 11 shows a comparator useful in the FIG. 8 best mode generator.
FIG. 12 shows a block selector useful in the FIG. 8 best mode generator.
FIG. 13 is a system diagram of a decoder according to the invention.
FIG. 14 is a block coupling unit useful in the FIG. 13 decoder.
FIG. 15(a) shows an alternative arrangement of a best mode generator useful in the FIG. 1 encoder.
FIG. 15(b) shows a coupling unit corresponding to the FIG. 15(a) best mode generator.
Referring now to FIG. 1, there is illustrated a system for coding alternate fields of an interlaced video sequence for transmission to a decoder. Thus, for frames of video made up of successive odd and even fields of video data, the FIG. 1 system is useable for coding the even fields for example.
As used herein:
"field" refers to an incomplete frame of data, for example, the alternate fields of an NTSC television signal;
"frame" refers to a complete frame of data, for example, the composite of two fields of NTSC data;
In FIG. 1 the encoder includes input means shown as terminal 20 for receiving an interlaced video sequence and separator means, shown as field splitter 22, for separating odd fields of data O(t) from even fields of data E(t). FIG. 2 is an illustration of a suitable field splitter. A de-multiplexer, shown as DMUX unit 25 takes an interlaced video sequence and uses a counter as a control signal. When the output of the counter is even, the "Even" output port of the 2-to-1 DMUX is selected, otherwise the "Odd" output port is selected.
The odd field data is encoded by umit 21 and provided to modulator unit 68. Encoded odd field data is decoded by unit 23. In this way any errors introduced by coding and decoding will be taken into account during the block matching process. Decoded odd field data is designated Oc(t).
Delayed coupling means, including delay units 19 and 24 are arranged so that when an odd field of data, denoted as Oc(t) for reference timing purposes, is supplied to a point 26, the previous odd field of data denoted as Oc(t-1) and the even field of data E(t) are simultaneously supplied to points 28 and 30. Thus at any given iteration of the system's operation, the fields Oc(t), Oc(t-1) and E(t) are simultaneously available at 26, 28 and 30 respectively.
The encoder also includes interpolation means, shown as linear interpolators (LI) 32, 34, and 36 which may be separate channels of a single interpolation unit, effective to fill in an approximation of the pixel data at missing lines of each individual field of data by interpolation of pixel data at corresponding positions in preceding and succeeding lines of the same individual field. This provides full frames of alternating lines of actual input pixel data and interleaved lines of interpolated data, at the frame rate. These interpolated fields will be referred to as enhanced fields. Non-linear interpolation is also possible. As shown, unit 32 receives the current odd field input data Oc(t) from the separator means, via encoder unit 21 and decoder unit 23, and its output is an enhanced field version Oci(t). Similarly, unit 34 receives past odd field Oc(t-1) from delay unit 24 and its output is an enhanced field version Oci(t-1). Similarly, interpolation unit 36 receives the current even field of input data E(t) from the separator and its output is an enhanced field version Ei(t). The interpolation means provide Oci(t), Oci(t-1) and Ei(t) to memory bank 50 and to block matching means.
Referring to FIG. 3, there is illustrated an embodiment of an interpolation circuit suitable for units 32, 34 and 36. In FIG. 3, linear interpolations are performed between two scanning lines of one field to generate the missing intermediate line. This is done by a full adder means 31 and a shift register 29 for each missing pixel. As shown, the input field containing only even or odd lines of a frame is input to field buffer 35. Under the control of values provided by counter means, two pixels are selected which are at the same horizontal position on two consecutive lines (i.e., the lines before and after the missing line position) and stored separately in the two registers 37 and 39. The values of the two pixels are then added in means 31 and shifted to the right by one bit one bit in shift register 29, which is the equivalent to dividing the sum of the two pixel values by a factor of two. The same process is applied for every missing pixel of the field, sequentially. In practice, this sequence of operations is performed in parallel through use of additional adder and register combinations. The output signal of units 32, 34 and 36 are linearly interpolated enhanced fields. As indicated, inputing Oc(t) to unit 32 results in the interpolated output Oci(t) and similarly, interpolating of input OC(t-1) results in interpolated output Oci(t-1) and interpolating of E(t) results in interpolated output Ei(t).
Block matching means, shown as forward, backward and cosited block matching (BM) units 40, 42 and 44, may also be separate channels of a single unit. The block matching means receive as input the enhanced fields of data Ei(t), Oci(t), Oci(t-1) and Eci(t-1). Eci(t-1), the previous even field of data, is received from memory bank 50 where it has been stored after having been derived in the previous iteration of the encoder.
The block matching means finds for each given block of pixels in Ei(t), the corresponding blocks in Oci(t), Oci(t-1) and Eci(t-1) which match the given block in Ei(t) most closely. These can be referred to as the best matched forward, backward and cosited blocks. The block matching means then calculates an appropriate motion vector to each of the identified best matching blocks and outputs that data to memory bank 50. Thus "fmv" is the appropriate motion vector indicating which block in Oci(t) best matches the appropriate block in Ei(t). Similarly "bmv" is the appropriate motion vector indicating which block in Oci(t-1) best matches the appropriate block in Ei(t). Finally, "cmv" represents the appropriate motion vector indicating which block in Eci(t-1) best matches the appropriate block in Ei(t). In the present embodiment, blocks of 16×16 pixels are used for motion compensated block matching. Block matching techniques are known and block matching units 40, 42, and 44 may appropriately use block matching as shown in U.S. Pat. No. 4,897,720 by Wu and Yang.
The counter 52 and best-match selector 54 use the motion vector information to generate addresses for the best matched blocks in memory bank 50 corresponding to block in Ei(t) being matched.
Memory bank 50 can be composed of random access memory (RAM) chips which have to be big enough to hold five M×N images (M and N are the width and height in terms of pixels of one image) and three sets of N/16×M/16 motion vectors.
Best mode generator means 60 receives as input each block of Ei(t) and the best matched forward, backward and cosited blocks found by the block matching means. Concurrently, motion vector selector, shown as unit 62, receives the motion vector values for each of the best matched blocks. The best mode generator determines which of the best matched blocks most closely matches the appropriate block in Ei(t). These different comparisons are known as modes. Thus there can be a forward mode, a backward mode and a cosited mode based on a comparison of a specific block of pixel data from Ei(t) with the best matched blocks of future odd, past odd and past even pixel data, respectively, The best mode generator can also create and compare blocks which are averages of two or more of the best matched blocks which are received from the block matching means. These averaged modes can be based on any averaged combination of the best matched blocks. In certain applications, the most useful averaged modes have been found to be combinations of the past even and future odd blocks and of the past and future odd blocks from their respective enhanced fields of pixel data. The best mode generator then picks from among those modes the overall best matched block, also known as the best mode block.
After selecting the best mode block, the best mode generator generates three different outputs; the best mode block, a difference block and a signal to motion vector selector unit 62 and modulator unit 68 indicating which mode has been selected. Motion vector selector unit 62 then sends the motion vector information regarding the appropriate block or blocks (in the case of an averaged mode) to motion vector encoder 64. Unit 64 encodes the motion vector data and provides it to modulator 68. The motion vector encoder uses variable length coding (VLC) which is based on a look-up table that stores the binary codes for all possible motion vectors. The look-up table is custom definable, however the present invention uses the same one which is used in the current MPEG proposal.
The difference block is the result of a pixel by pixel subtraction of the values of the overall best mode block from the block in Ei(t). The difference block is then coded by block data encoder 41 and provided to modulator unit 68. Data encoder 41 is illustrated in more detail in FIG. 4. Unit 48 converts the 16×16 blocks received from the best mode generator to four 8×8 blocks. A discrete cosine transform is applied to the difference block data by DCT unit 43. The transform is performed on blocks of an 8×8 size The 8×8 discrete cosine transform is defined as: ##EQU1## where x(i,j), i,j=0, . . . , 7, is the pixel value, X(u,v), u,v=0, . . . , 7, is the transformed coefficient, ##EQU2## and C(u)=1, u,v=1, . . . , 7. DCT is well known in the art, and there are IC chips available for this purpose.
To achieve higher coding efficiency, the DCT coefficients are quantized by a uniform quantizer, shown in FIG. 5, with a fixed step S. The values of S, which are stored in a quantization table, typically vary from one coefficient to another. While FIG. 5 shows linear quantization, non-linear quantization is also possible. In the present instance the quantization table which is used is the current MPEG standard. Other quantization tables, however, are useable. After quantization, the DCT blocks contain a large amount of zero coefficients. Known techniques of zig-zag scanning may be applied to the DCT blocks in order to maximize the runs of zero coefficients and thereby effectuate higher data compression. The zig-zag scanning is implemented by a look-up table, shown in FIG. 6, which maps coordinates of DCT coefficient blocks to values between 0 and 63. This represents the order of variable length coding. A known form of Huffman coding may then be applied to convert the quantized DCT coefficients to binary codes. In the present instance, the MPEG VLC table is used for these purposes although other tables are also useable.
The coded difference block data is also provided to block data decoder 58 shown in FIG. 7. The block data decoder performs the reverse operations in the reverse order of the encoder. First the coded data is Huffman decoded and next unzig-zag scanning is applied. The data is then unquantized and an inverse discrete cosine transform is applied using known techniques. The decoder uses the same tables as the encoder. The output of block data decoder 58 is provided to block adder 56. Block adder 56 also receives the best mode block from the best mode generator. It adds the difference block to the best mode block to create the same even field which will be recreated by the decoder. That even field is then provided to memory bank 50 where it will be used as the cosited past even field by cosited block matching unit 44 during the next iteration of the system.
Modulator unit 68 then combines the four sets of data it has received (odd field data, coded motion vector data, coded difference block data and best mode signal data) and provides an appropriate signal to terminal 70. From there the data can be sent to an appropriate decoder.
FIG. 8 illustrates a suitable embodiment of the best mode generator 60. The best mode generator includes four error generators shown as forward error generator (FEG) 92, average error generator (FCEG) 94, average error generator (BFEG) 96 and cosited error generator (CEG) 98. The error generators receive as input a block from Ei(t) and the appropriate best matched blocks.
The forward error generator FEG compares the appropriate block in Ei(t) to the best matched forward block. The cosited error generator CEG compares the appropriate block in Ei(t) to the best matched cosited block.
The average error generators receive two or more best matched blocks which they average together to produce an average block. This average block is then compared to the appropriate block in Ei(t). Thus average error generator BFEG creates a block which is the average of the best matched backwards block and the best matched forward block. Similarly the average error generator FCEG creates a block which is the average of the best matched forward block and the best matched cosited block. Averaging can be done by adding pixel values from the two blocks on a pixel by pixel basis and reducing each resulting pixel value by a factor of two (i.e. dividing each value in half.
From these inputs the error generators produce three outputs; a prediction block, a difference block and an absolute error.
The prediction block is the block which the error generator compares to the appropriate block in Ei(t). Thus in the case of FEG or CEG, the prediction block is just the best matched block received from the block matching units. In the case of the average error generators, the prediction block is the average of two or more best matched blocks. The prediction blocks are outputted to the prediction block selector 93.
The difference block is calculated by subtracting the value of a pixel in one block from the value of the corresponding pixel in the other block on a pixel by pixel basis. This value of this difference is then assigned to a corresponding pixel in the difference block. The sum of the absolute value of all of these pixels in the difference block is the absolute error.
The difference blocks are provided to the difference block selector unit 95. The absolute errors are outputted to comparator unit 97. Based on the absolute errors the comparator chooses the best mode. Typically this is the mode having the least absolute error, however, other selections are possible. This is referred to as the best mode. The comparator then supplies a signal indicating the best mode to the difference block selector unit 95, modulator unit 68, motion vector selector unit 62 and to the prediction block selector 93. Upon receipt of the signal the difference block selector sends the appropriate difference block to block data encoder 41, and the prediction block selector sends the appropriate prediction block (the best mode block) to block adder 56.
Referring to FIG. 9, there is illustrated an embodiment of the suitable error generator circuit for either the forward error generator FEG or the cosited error generator CEG, in FIG. 9 buffer block unit 67 and buffer block unit 69 receive a block from Ei(t) and the best matched block from either Oci(t) or Eci(t-1). Subtraction unit 51 calculates the difference in value of each set of corresponding pixels in the two blocks and assigns that value to a corresponding pixel value in block buffer 55. This is known as the difference block. Absolute value generator 53 converts the value of the difference for each set of pixels to an absolute value and provides that information to the adder unit 57. The adder unit 57 sums all of the absolute values for the differences of the two blocks being compared to create an absolute error value.
Referring to FIG. 10, an embodiment of a suitable average error generator circuit is shown. Block buffer 78 receives a block in Ei(t). Block buffers 79 and 83 receive the best matched blocks from the fields being averaged to create a block. In the case of error generator BFEG, the best matched blocks from Oci(t-1) and Oci(t) are used. In the case of average error generator FCEG, the best matched blocks from Oci(t) and Eci(t-1) are used. The values of each of the corresponding pixels in each of the best matched blocks is added and divided by two to create an average block. This is accomplished by unit 81. This average block is then subtracted from the corresponding block in Ei(t) by subtraction unit 77. In the same fashion as the other error generators, both a difference block and an absolute error value is created.
Referring to FIG. 11, a suitable embodiment of the comparator unit 97 is shown. Minimum decision unit 74 picks the least value of the four absolute error inputs and outputs an appropriate best mode signal. While the current embodiment picks the mode with the least possible absolute error, other decision criterion are also available.
Referring to FIG. 12, a suitable embodiment of a difference block selector is shown. Multiplexer unit 73 receives the four difference blocks as input. Responsive to the best mode signal, unit 73 outputs the appropriate difference block.
Because the implemented coding scheme is very unsymmetrical, the decoder is simpler than the encoder. This is due largely to the fact that the decoder does not have to perform block matching or make a best mode determination.
In FIG. 13, the decoder includes input means, shown as terminal 80, for receiving encoded data. Demodulating means, shown as demodulator unit 82 separates the encoded data into four bit streams: location signals in the form of a motion vector bit stream, a best mode signal bit stream, pixel error signals in the form of a difference block bit stream and an odd field data signal bit stream.
The first bit stream, containing the motion vector data, is decoded by a motion vector decoder 84 which uses the same VLC table as used in the encoder. The motion vector decoder 84 segments the bit stream into portions which represent one or two different motion vectors. Using the VLC table, the decoder provides the corresponding motion vectors. The motion vectors represent the displacement of the best matched blocks from the original blocks in Ei(t). The motion vector decoder supplies the motion vectors to address generator unit 88. The address generator also receives the best mode signal from demodulator unit 82. The address generator uses the decoded motion vectors and the best mode signal to generate memory addresses of one or more of the best matched future odd, past odd and past even blocks, depending on the specific motion vector signals and the best mode signal. These blocks are sometimes referred to as the best matched forward, backward and cosited blocks, respectively.
In an alternative arrangement, only three bit streams need to be sent. In this arrangement the best mode signal and the motion vector would be combined in to an address bit stream which would describe where in the receiver's memory the appropriate best matched blocks could be found.
Block coupling means, shown as prediction block generator unit 85, receives the best matched forward, backward and cosited blocks from storage means shown as memory bank 86. It also receives the best mode signal from demodulator 82. Unit 85 then generates the same mode data block which was identified in the encoder. The mode data block is then provided to block adder unit 87. Referring more specifically to FIG. 14, a suitable embodiment of block generator 85 is shown. The best matched block or blocks representing the best mode data block are received from memory bank 86 into the appropriate block buffers. In this embodiment the two average modes are created by units 102 and 103. The two other modes which merely use best matched blocks, are already available as received in the appropriate buffers. In operation, only the best matched block or blocks needed to provide the desired best mode block are supplied to block generator unit 85. Thus, if either the future odd block or past even block represents the best mode block, only the respective desired block is received by unit 85 and it is coupled by unit 85 to block adder unit 87. If, however, the best mode block is the block of data representing an average of the past even block and the future odd block, those blocks are provided from memory to buffers 100 & 101, respectively, for averaging in unit 103 and coupling to block adder unit 87. Operation is similar via buffers 99 and 100 and unit 102, when the best mode block represents the average of the past and future odd field best matched blocks. As illustrated, unit 85 is responsive to the best mode signal in implementing the averaging function however, in other applications unit 85 need only be arranged to simply pass through any single input block and, in response to the input of two blocks simultaneously, to provide an averaged output to unit 87 whenever two blocks are received. In operation of unit 85 as illustrated, the appropriate mode is then loaded into MUX unit 106, which outputs the appropriate prediction block to block adder unit 87.
Block decoder unit 89 decodes the difference blocks and then provides the difference block to the block adder unit 87 where it is added to the single best mode data block from unit 85. Referring more specifically to FIG. 7 there is an illustration of the decoder 89. This decoder is of the same design as the decoder unit 58 in the FIG. 1 encoder. Units 59, 61, 63, and 65 respectively perform the following functions in sequence: Huffman decode, unzig-zag scan, unquantize and inverse discrete cosine transform, upon the incoming coded difference block data. Unit 66 reassembles the four 8×8 blocks into one 16×16 block.
The combination by block adder unit 87 of the best mode block and the difference block creates the coded field Eci(t). This field is then provided to memory bank 86 where it can be used to recreate the next even field. It is also provided to combiner means shown as unit 90.
The fourth bit stream outputted by demodulator unit 82 is the coded odd field data. This data is provided to decoder unit 91, which may provide MPEG type coding compatible with prior encoding. The decoded odd field data is provided to linear interpolator 107 which operates in the same fashion as the linear interpolator units in the encoder. Thus enhanced field of data Oci(t) is created and sent to combiner unit 90 and memory bank 86. Memory bank 86 uses Oci(t) and Oci(t-1) pixel field data which was created in the system's previous iteration, to generate the appropriate blocks for block coupling means 85. As previously mentioned, Eci(t) and hence Eci(t-1) are available also from storage in memory bank 86.
Combiner unit 90 drops half the lines out of both the even and odd enhanced fields of data it receives. Eci(t) and Oci(t) and sequentially combines them to provide reconstruction of the interlaced sequence of data that was originally inputed into terminal 20 of the encoder. As shown in FIG. 13, the interlaced video data is supplied to delay unit 72 to permit viewing of the video sequence.
The term "best mode" as used herein is used to identify a selected mode. Normally the mode selection is made to minimize pixel error signals to be transmitted to a decoder, however, the term is used to include reference to any available mode selected for use in a particular application.
Combinations of modes, other than those described above are also available. FIG. 15(a) shows an arrangement of a best mode generator which uses a different set of modes. The FIG. 15(a) best mode generator compares the appropriate block in Ei(t) to the best matched future odd block, the best matched past odd block, the best matched past even block and to a block which is the average of the best matched future odd block and the best matched past even block. Error generator 110-113 carry out the appropriate comparisons. The other operations of the FIG. 15(a) best mode generator block are similar to that of the FIG. 8 best mode generator block.
FIG. 15(b) shows a suitable embodiment of a prediction block generator corresponding to the FIG. 15(a) best mode generator. Unit 125 generates the average of the future odd and past even best matched blocks while units 121-123 couple as appropriate the best matched past odd, future odd and past even blocks to unit 127. Unit 127 outputs the appropriate block responsive to the best mode signal.
Other arrangements are also possible. Original odd field data can be used for block matching purposes even if the odd field is being coded.
In another arrangement, the best mode generator could make comparisons based on only the past even field and the future odd field. Thus the best mode generator would require only 3 inputs.
In another alternative arrangement, the data received at terminal 20 can be interlaced data which has been compressed in to fall frames of data. In arrangements of this type, field delay unit 19 is not necessary.
In summary, methods and systems according to the invention contain various modes of operation. The following four modes were found to be most useful, but it is possible to have more, at the expense of increased complexity, including intrafield, backward, or even three-way averaging.
1. A "recursive", predictive, mode in which the past cosited even field is used for prediction. A motion vector must be sent, which often has zero values for stationary objects.
2. A "forward" mode, in which the future odd field is used for prediction. A motion vector must be sent.
3. An "averaged" mode, in which both past and future odd fields are used, by averaging the pixel values of the two optimum blocks. In that case, two motion vectors must be sent.
4. A "recursive averaged" mode, in which the previous even cosited field is combined as above, with the future odd field.
Methods and systems according to the invention, when combined with appropriate coding of the progressive sequence resulting from dropping the even fields of interlaced video, yields high quality compression with reasonable encoder complexity. This technique can be used for about 5 Mbits/s coding of standard-quality video coding, or for high-compression distribution quality digital HDTV coding. Coding the quantized DCT coefficients must be optimized depending on their statistical nature, which, in turn, depends on the desired quality of the final reconstructed signal. If horizontal downsampling is avoided, then the resulting asymmetry between the horizontal and vertical frequencies must be considered when coding the DCT blocks, for optimum results. We have used 16×16 blocks for motion estimation and 8×8 blocks for DCT coding, but other configurations may be optimum, depending on the application, including, e.g., a quadtree-based segmented block matching approach using both 16×16 and 8×8 blocks. In our simulations, we have found that the even fields are coded with about 60% of the bit rate of the odd fields, with the same quality. The same concept can be used for HDTV coding at low bit rates (e.g. below 20 Mbits/s). There are various proposals for HDTV coding, using at least 70 Mbits/s. We also found that nonlinear edge preserving noise smoothing preprocessing greatly enhances coding performance, particularly in the case of coding noisy HDTV video signals.
While there have been described what are believed to be the preferred embodiments of the invention, those skilled in the art will recognize that other and further modifications may be made thereto without departing from the of the invention, and it is intended to claim all such embodiments as fall within the true scope of the invention.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4821119 *||May 4, 1988||Apr 11, 1989||Bell Communications Research, Inc.||Method and apparatus for low bit-rate interframe video coding|
|US4873573 *||Dec 23, 1986||Oct 10, 1989||British Broadcasting Corporation||Video signal processing for bandwidth reduction|
|US4897720 *||Mar 14, 1988||Jan 30, 1990||Bell Communications Research, Inc.||Circuit implementation of block matching algorithm|
|US4999705 *||May 3, 1990||Mar 12, 1991||At&T Bell Laboratories||Three dimensional motion compensated video coding|
|US5001559 *||Oct 12, 1989||Mar 19, 1991||International Business Machines Corporation||Transform coding using coefficient prediction techniques|
|US5008746 *||Jun 16, 1989||Apr 16, 1991||Centre National D'etudes Des Telecommunications||High definition television signal processing including subsampling and motion compensation|
|US5049991 *||Feb 20, 1990||Sep 17, 1991||Victor Company Of Japan, Ltd.||Movement compensation predictive coding/decoding method|
|US5134480 *||Aug 31, 1990||Jul 28, 1992||The Trustees Of Columbia University In The City Of New York||Time-recursive deinterlace processing for television-type signals|
|EP0374548A2 *||Dec 1, 1989||Jun 27, 1990||ALCATEL ITALIA Societą per Azioni||System for package multiplexing in transmission of data streams generated by the same algorithm|
|1||*||Anastassiou D., " Generalized Pyramid Coding Using Nonlinear Interpolation for HDTV Coding", Proceedings, 1990 Picture Coding Symposium.|
|2||*||Anastassiou D., " Generalized Three-Dimensional Pyramid Coding for HDTV Using Nonlinear Interpolation", Columbia University.|
|3||*||Anastassiou, Dimitris et al., " Gray-Scale Image Coding for Freeze-Frame Videoconferencing", IEEE Transactions or Communications, Vol. 34, No. 4, April 1986.|
|4||*||Barbero, M. et al., " A System for the Transmission of HDTV Signals Based on the Discrete Cosine Transform", Proceedings, 1990 International Symposium on Circuits and Systems, pp. 1887-1890.|
|5||*||Burt, P. J. et al., " The Laplacian Pyramid as a Compact Image Code", IEEE Transactions on Communications, Vol. COM-31, No. 4, April 1983.|
|6||*||Fleischler, P. E. et al., " Coding of Advanced TV for BISDN Using Multiple Subbands", Proceedings, 1990 International Symposium on Circuits and Systems, pp. 1314-1317.|
|7||*||International Organization for Standardization Simulation Model Editorial Group, "MPEG Video Simulation Mode Three", July 25 1990.|
|8||*||Netravali, A. N. and Haskell, B. G., " Digital Pictures: Representation and Compression ", Plenum Press, 1988.|
|9||*||Puri, A, et al., "Video Coding with Motion-Compensated Interpolation for CD-Rom Applications", Image Communication, Vol. 2, No. 2, pp. 127-144, Aug. 1990.|
|10||*||UZ, K. M. et al., " A Multiresultion Approach to Motion Estimation and Interpolation with Application to Coding of Digital HDTV", Proceedings, 1990 International Symposium on Circuits and Systems, p.1298.|
|11||*||Wang, F. and Anastassiou, D., " Time Recursive Deinterlacing for HDTV and Pyramid Coding", Image Communication, Vol. 2, No. 3, Oct. 1990.|
|12||*||Yashima, Y. et al., " HDTV/Standard-TV Compatible Coding Based on DTC", Proceedings, 1990, International Symposium on Circuits and Systems, pp. 1894-1898.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US5689305 *||Aug 3, 1994||Nov 18, 1997||Kabushiki Kaisha Toshiba||System for deinterlacing digitally compressed video and method|
|US5734677 *||Mar 15, 1995||Mar 31, 1998||The Chinese University Of Hong Kong||Method for compression of loss-tolerant video image data from multiple sources|
|US5768430 *||Jun 5, 1997||Jun 16, 1998||Sony Corporation||Motion vector detection apparatus and predictive coding system for compensating for movement with the apparatus|
|US6219455 *||May 20, 1998||Apr 17, 2001||Sony Corporation||Method and apparatus for detecting motion vectors|
|US6351545||Dec 14, 1999||Feb 26, 2002||Dynapel Systems, Inc.||Motion picture enhancing system|
|US6408029||Mar 22, 1999||Jun 18, 2002||Intel Corporation||Method and apparatus for simplifying real-time data encoding|
|US6449312 *||Jun 8, 2000||Sep 10, 2002||Motorola, Inc.||Method of estimating motion in interlaced video|
|US6574278||Mar 22, 1999||Jun 3, 2003||Intel Corporation||Method and apparatus for performing real-time data encoding|
|US6826294 *||Mar 5, 1999||Nov 30, 2004||Koninklijke Philips Electronics N.V.||Block matching motion estimation using reduced precision clustered predictions|
|US6904174||Dec 11, 1998||Jun 7, 2005||Intel Corporation||Simplified predictive video encoder|
|US7046734||Jan 8, 2003||May 16, 2006||Intel Corporation||Method and apparatus for performing real-time data encoding|
|US7194137||May 16, 2003||Mar 20, 2007||Cisco Technology, Inc.||Variable length coding method and apparatus for video compression|
|US7203372||May 19, 2003||Apr 10, 2007||Cisco Technology, Inc.||Extension of two-dimensional variable length coding for image compression|
|US7212681||Jan 15, 2003||May 1, 2007||Cisco Technology, Inc.||Extension of two-dimensional variable length coding for image compression|
|US7215384||Mar 22, 1999||May 8, 2007||Intel Corporation||Method and apparatus for simplifying field prediction motion estimation|
|US7231091||May 16, 2005||Jun 12, 2007||Intel Corporation||Simplified predictive video encoder|
|US7242328||Feb 3, 2006||Jul 10, 2007||Cisco Technology, Inc.||Variable length coding for sparse coefficients|
|US7263127||Mar 22, 1999||Aug 28, 2007||Intel Corporation||Method and apparatus for simplifying frame-based motion estimation|
|US7280700||Jun 13, 2003||Oct 9, 2007||Microsoft Corporation||Optimization techniques for data compression|
|US7317839||Sep 2, 2004||Jan 8, 2008||Microsoft Corporation||Chroma motion vector derivation for interlaced forward-predicted fields|
|US7324699||Feb 15, 2007||Jan 29, 2008||Cisco Technology, Inc.||Extension of two-dimensional variable length coding for image compression|
|US7352905||Sep 2, 2004||Apr 1, 2008||Microsoft Corporation||Chroma motion vector derivation|
|US7394942||Jan 5, 2007||Jul 1, 2008||Cisco Technology, Inc.||Variable length coding method and apparatus for video compression|
|US7408990||Jun 30, 2004||Aug 5, 2008||Microsoft Corporation||Efficient motion vector coding for video compression|
|US7426308||Jul 18, 2003||Sep 16, 2008||Microsoft Corporation||Intraframe and interframe interlace coding and decoding|
|US7454073||Aug 3, 2004||Nov 18, 2008||Cisco Technology, Inc.||Video compression using multiple variable length coding processes for multiple classes of transform coefficient blocks|
|US7454076||Jun 15, 2004||Nov 18, 2008||Cisco Technology, Inc.||Hybrid variable length coding method for low bit rate video coding|
|US7471840||Aug 18, 2004||Dec 30, 2008||Cisco Technology, Inc.||Two-dimensional variable length coding of runs of zero and non-zero transform coefficients for image compression|
|US7471841||Feb 28, 2005||Dec 30, 2008||Cisco Technology, Inc.||Adaptive breakpoint for hybrid variable length coding|
|US7483584||Jul 22, 2004||Jan 27, 2009||Cisco Technology, Inc.||Extended hybrid variable length coding of transform coefficients for video compression|
|US7486212||Jun 11, 2007||Feb 3, 2009||Cisco Technology, Inc.||Variable length coding for sparse coefficients|
|US7492956||Aug 18, 2004||Feb 17, 2009||Cisco Technology, Inc.||Video coding using multi-dimensional amplitude coding and 2-D non-zero/zero cluster position coding|
|US7499495||Jul 16, 2004||Mar 3, 2009||Microsoft Corporation||Extended range motion vectors|
|US7499595||Feb 28, 2005||Mar 3, 2009||Cisco Technology, Inc.||Joint amplitude and position coding for photographic image and video coding|
|US7499596||Feb 28, 2005||Mar 3, 2009||Cisco Technology, Inc.||Amplitude coding for clustered transform coefficients|
|US7529302||Sep 15, 2004||May 5, 2009||Microsoft Corporation||Four motion vector coding and decoding in bi-directionally predicted interlaced pictures|
|US7567617||May 27, 2004||Jul 28, 2009||Microsoft Corporation||Predicting motion vectors for fields of forward-predicted interlaced video frames|
|US7577198||Sep 2, 2004||Aug 18, 2009||Microsoft Corporation||Number of reference fields for an interlaced forward-predicted field|
|US7577200||Oct 6, 2004||Aug 18, 2009||Microsoft Corporation||Extended range variable length coding/decoding of differential motion vector information|
|US7590179||Sep 15, 2004||Sep 15, 2009||Microsoft Corporation||Bitplane coding of prediction mode information in bi-directionally predicted interlaced pictures|
|US7599438||Sep 2, 2004||Oct 6, 2009||Microsoft Corporation||Motion vector block pattern coding and decoding|
|US7609763||Oct 27, 2009||Microsoft Corporation||Advanced bi-directional predictive coding of video frames|
|US7616692||Sep 2, 2004||Nov 10, 2009||Microsoft Corporation||Hybrid motion vector prediction for interlaced forward-predicted fields|
|US7620106||Sep 2, 2004||Nov 17, 2009||Microsoft Corporation||Joint coding and decoding of a reference field selection and differential motion vector information|
|US7620258||Nov 9, 2005||Nov 17, 2009||Cisco Technology, Inc.||Extended amplitude coding for clustered transform coefficients|
|US7623574||Sep 2, 2004||Nov 24, 2009||Microsoft Corporation||Selecting between dominant and non-dominant motion vector predictor polarities|
|US7630438||Sep 15, 2004||Dec 8, 2009||Microsoft Corporation||Direct mode motion vectors for Bi-directionally predicted interlaced pictures|
|US7646810||Dec 9, 2005||Jan 12, 2010||Microsoft Corporation||Video coding|
|US7664177||Sep 15, 2004||Feb 16, 2010||Microsoft Corporation||Intra-coded fields for bi-directional frames|
|US7680185||Sep 15, 2004||Mar 16, 2010||Microsoft Corporation||Self-referencing bi-directionally predicted frames|
|US7680349||Mar 20, 2006||Mar 16, 2010||Cisco Technology, Inc.||Variable length coding for clustered transform coefficients in video compression|
|US7685305||Mar 23, 2010||Microsoft Corporation||Media coding for loss recovery with remotely predicted data units|
|US7734821||Mar 22, 2005||Jun 8, 2010||Microsoft Corporation||Media coding for loss recovery with remotely predicted data units|
|US7738554||Jul 17, 2004||Jun 15, 2010||Microsoft Corporation||DC coefficient signaling at small quantization step sizes|
|US7852936||Sep 15, 2004||Dec 14, 2010||Microsoft Corporation||Motion vector prediction in bi-directionally predicted interlaced field-coded pictures|
|US7912306||Nov 25, 2009||Mar 22, 2011||Cisco Technology, Inc.||Variable length coding for clustered transform coefficients in video compression|
|US7924920||Sep 2, 2004||Apr 12, 2011||Microsoft Corporation||Motion vector coding and decoding in interlaced frame coded pictures|
|US7925774||Apr 12, 2011||Microsoft Corporation||Media streaming using an index file|
|US7949775||Aug 7, 2008||May 24, 2011||Microsoft Corporation||Stream selection for enhanced media streaming|
|US8031777||Mar 21, 2006||Oct 4, 2011||Apple Inc.||Multipass video encoding and rate control using subsampling of frames|
|US8064520||Jun 29, 2004||Nov 22, 2011||Microsoft Corporation||Advanced bi-directional predictive coding of interlaced video|
|US8085844||Nov 15, 2004||Dec 27, 2011||Microsoft Corporation||Signaling reference frame distances|
|US8111934||Feb 7, 2012||Cisco Technology, Inc.||Extension of two-dimensional variable length coding for image compression|
|US8131096||Mar 5, 2011||Mar 6, 2012||Cisco Technology, Inc.||Variable length coding for clustered transform coefficients in video compression|
|US8189666||Feb 2, 2009||May 29, 2012||Microsoft Corporation||Local picture identifier and computation of co-located information|
|US8233535||Aug 4, 2006||Jul 31, 2012||Apple Inc.||Region-based processing of predicted pixels|
|US8254455||Jun 30, 2007||Aug 28, 2012||Microsoft Corporation||Computing collocated macroblock information for direct mode macroblocks|
|US8295343||Oct 23, 2012||Apple Inc.||Video bit rate control method|
|US8370887||Aug 7, 2008||Feb 5, 2013||Microsoft Corporation||Media streaming with enhanced seek operation|
|US8374245||Sep 20, 2006||Feb 12, 2013||Microsoft Corporation||Spatiotemporal prediction for bidirectionally predictive(B) pictures and motion vector prediction for multi-picture reference motion compensation|
|US8379722||Feb 19, 2013||Microsoft Corporation||Timestamp-independent motion vector prediction for predictive (P) and bidirectionally predictive (B) pictures|
|US8406300||Mar 26, 2013||Microsoft Corporation||Video coding|
|US8494295||Feb 16, 2012||Jul 23, 2013||Cisco Technology, Inc.||Variable length coding for clustered transform coefficients in video compression|
|US8548051||Feb 3, 2010||Oct 1, 2013||Microsoft Corporation||Media coding for loss recovery with remotely predicted data units|
|US8625669||Mar 11, 2009||Jan 7, 2014||Microsoft Corporation||Predicting motion vectors for fields of forward-predicted interlaced video frames|
|US8634413||Dec 30, 2004||Jan 21, 2014||Microsoft Corporation||Use of frame caching to improve packet loss recovery|
|US8638853||Feb 4, 2010||Jan 28, 2014||Microsoft Corporation||Video coding|
|US8687697||Apr 24, 2012||Apr 1, 2014||Microsoft Corporation||Coding of motion vector information|
|US8774280||Jan 29, 2013||Jul 8, 2014||Microsoft Corporation||Timestamp-independent motion vector prediction for predictive (P) and bidirectionally predictive (B) pictures|
|US8780997||Aug 4, 2006||Jul 15, 2014||Apple Inc.||Regulation of decode-side processing based on perceptual masking|
|US8819754||Jan 10, 2013||Aug 26, 2014||Microsoft Corporation||Media streaming with enhanced seek operation|
|US8873630||Feb 6, 2013||Oct 28, 2014||Microsoft Corporation||Spatiotemporal prediction for bidirectionally predictive (B) pictures and motion vector prediction for multi-picture reference motion compensation|
|US8917768||Nov 21, 2008||Dec 23, 2014||Microsoft Corporation||Coding of motion vector information|
|US9049451||Jul 30, 2012||Jun 2, 2015||Apple Inc.||Region-based processing of predicted pixels|
|US9077960||Aug 12, 2005||Jul 7, 2015||Microsoft Corporation||Non-zero coefficient block pattern coding|
|US9148668||Feb 13, 2014||Sep 29, 2015||Microsoft Technology Licensing, Llc||Coding of motion vector information|
|US9185427||Sep 30, 2014||Nov 10, 2015||Microsoft Technology Licensing, Llc||Spatiotemporal prediction for bidirectionally predictive (B) pictures and motion vector prediction for multi-picture reference motion compensation|
|US9232219||Aug 14, 2013||Jan 5, 2016||Microsoft Technology Licensing, Llc||Media coding for loss recovery with remotely predicted data units|
|US9313501||Sep 13, 2012||Apr 12, 2016||Microsoft Technology Licensing, Llc||Use of frame caching to improve packet loss recovery|
|US9313509||Jun 14, 2010||Apr 12, 2016||Microsoft Technology Licensing, Llc||DC coefficient signaling at small quantization step sizes|
|US20010053183 *||Mar 22, 1999||Dec 20, 2001||Mcveigh Jeffrey S.||Method and apparatus for simplifying field prediction motion estimation|
|US20040183761 *||Dec 23, 2003||Sep 23, 2004||Koichi Miyachi||Method and device for driving display device, and program and recording medium therefor|
|US20040228540 *||May 16, 2003||Nov 18, 2004||Wen-Hsiung Chen||Variable length coding method and apparatus for video compression|
|US20050053134 *||Sep 2, 2004||Mar 10, 2005||Microsoft Corporation||Number of reference fields for an interlaced forward-predicted field|
|US20050237987 *||Jun 28, 2005||Oct 27, 2005||Microsoft Corporation||Media coding for loss recovery with remotely predicted data units|
|US20050265615 *||May 16, 2005||Dec 1, 2005||Michael Keith||Simplified predictive video encoder|
|US20050276497 *||Jul 22, 2004||Dec 15, 2005||Wen-Hsiung Chen||Extended hybrid variable length coding method for low bit rate video coding|
|US20060039615 *||Feb 28, 2005||Feb 23, 2006||Wen-Hsiung Chen||Joint amplitude and position coding for photographic image and video coding|
|US20060039621 *||Aug 18, 2004||Feb 23, 2006||Toebes John A||Two-dimensional variable length coding of runs of zero and non-zero transform coefficients for image compression|
|US20060056720 *||Nov 9, 2005||Mar 16, 2006||Wen-Hsiung Chen||Extended amplitude coding for clustered transform coefficients|
|US20070116115 *||Jun 23, 2006||May 24, 2007||Xin Tong||Video bit rate control method|
|US20070116117 *||Jun 15, 2006||May 24, 2007||Apple Computer, Inc.||Controlling buffer states in video compression coding to enable editing and distributed encoding|
|US20070116437 *||Aug 4, 2006||May 24, 2007||Apple Computer, Inc.||Region-based processing of predicted pixels|
|US20070133890 *||Feb 15, 2007||Jun 14, 2007||Wen-Hsiung Chen||Extension of two-dimensional variable length coding for image compression|
|US20070165724 *||Mar 21, 2007||Jul 19, 2007||Wen-Hsiung Chen||Extension of two-dimensional variable length coding for image compression|
|US20070279266 *||Jun 11, 2007||Dec 6, 2007||Wen-Hsiung Chen||Variable length coding for sparse coefficients|
|US20100067814 *||Mar 18, 2010||Wen-Hsiung Chen||Variable length coding for clustered transform coefficients in video compression|
|US20110150352 *||Jun 23, 2011||Wen-Hsiung Chen||Variable length coding for clustered transform coefficients in video compression|
|U.S. Classification||348/413.1, 348/420.1|
|International Classification||G06T9/00, H04N7/46, H04N7/26, H04N7/50|
|Cooperative Classification||H04N19/137, H04N19/105, H04N19/577, H04N19/112|
|European Classification||H04N7/46E, H04N7/26A4C4, H04N7/26A6C4, H04N7/26A4B|
|Sep 6, 1996||FPAY||Fee payment|
Year of fee payment: 4
|Sep 8, 2000||FPAY||Fee payment|
Year of fee payment: 8
|Sep 9, 2004||FPAY||Fee payment|
Year of fee payment: 12