|Publication number||USRE36507 E|
|Application number||US 08/954,916|
|Publication date||Jan 18, 2000|
|Filing date||Oct 21, 1997|
|Priority date||Mar 27, 1992|
|Also published as||US5293229, USRE36015|
|Publication number||08954916, 954916, US RE36507 E, US RE36507E, US-E-RE36507, USRE36507 E, USRE36507E|
|Inventors||Siu L. Iu|
|Original Assignee||Matsushita Electric Corporation Of America|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (19), Non-Patent Citations (24), Referenced by (88), Classifications (9), Legal Events (3)|
|External Links: USPTO, USPTO Assignment, Espacenet|
.Iadd.Application Ser. No 08/538,101, filed Oct. 2, 1995, now U.S. Pat. No. RE 36,015, and application Ser. No. 08/954,916, filed Oct. 21, 1997, are reissue applications of U.S. Pat. No. 5,293,229, which issues from application Ser. No. 07/859,145, filed Mar. 27, 1992..Iaddend.
The present invention concerns video data compression and in particular, apparatus and a method for processing groups of successive fields of video information to obtain high levels of data compression.
Image sequence data compression systems such as that proposed by the Moving Pictures Experts Group (MPEG), a committee within the International Standards Organization (ISO), have been very effective in coding image sequences for video signals under the NTSC standard as well as for High Definition Television (HDTV) sources. The MPEG system is described in a paper entitled "MPEG Video Simulation Model Three (SM3)" by the Simulation Model Editorial Group, available from ISO as ISO-IEC/JTC1/SC2/WG11/N0010 MPEG 90/041, 1990 which is hereby incorporated by reference for its teachings on the MPEG video signal encoding method.
The MPEG system integrates a number of well-known data compression techniques into a single system. These include motion-compensated predictive coding, discrete cosine transformation (DCT), adaptive quantization and variable length coding (VLC).
The motion-compensated predictive coding schemes used in HDTV systems process the video data in groups of frames in order to achieve relatively high levels of compression without allowing the performance of the system to be degraded by excessive error propagation. In these group of frame processing schemes, image frames are classified into one of three types: the intra-frame (I-frame) the predicted frame (P-frame) and the bidirectional frame (B-frame).
A two dimensional DCT is applied to small regions such as blocks of 8 by 8 pixels to encode each of the I-frames. The resulting data stream is quantized and encoded using a variable-length code, such as an amplitude run-length Huffman code, to produce the compressed output signal. P-frames and B-frames are processed as residues of corresponding I and P-frames, respectively, encoded using the two-dimensional DCT, quantized and variable-length coded. A typical sequence of frames may be represented by a sequence such as I, B, B, P, B, B, I, B, etc.
To operate effectively in the presence of inter-frame motion, several overlapping corresponding blocks from the I-frame or P-frame are compared with each block of a P or B-frame to find the one with the smallest residue. The esidue block is then encoded using the two-dimensional DCT, adaptive quantization and variable-length coding. The reference block that was used to obtain the residue is then designated as the predecessor of the block to be encoded and is defined by a motion vector which is transmitted with the encoded residue block. This vector describes the displacement in the image plane which is needed to place the reference block in its target position in the new frame.
Processing frames in groups achieves a high level of data compression due to the strong temporal correlation among successive frames in conventional video images. Redundant information in the images is greatly reduced by the predictive coding method used for the P and B-frames. Under this method, small blocks of data from reconstructed I and P-frames are subtracted from corresponding blocks of data from the respective frames to be encoded as P and B-frames. The result of this operation is residue data values which describe the P-frames in terms of the I-frames and the B-frames in terms of the I and/or P-frames. For P and B-frames, only this residue data is encoded and transmitted.
This coding is undone at a receiver which reverses the steps to obtain reconstructed image data. Any errors in a frame that is used to predict other frames may propagate to the predicted frames. In addition, the dependence of one frame on its predecessor I or P-frame limits the ability of the receiver to display a frame selected at random and to accommodate standard television functions such as intra-group scene changes and channel switching. These limitations could be removed by encoding each frame as an I-frame, however, the resulting coded video signal would need considerably more bits per frame since it would not exploit the temporal redundancy that is inherent in most video information.
The MPEG encoding standard is designed for frame-oriented image sequences. Most video sources, however, provide a frame of information as two interlaced fields which are separated in time by one field interval. The standard has been adapted in two ways to accommodate field-oriented image sequences. The first method combines the successive even and odd fields of the interlaced source to form a sequence of frame images and then applies MPEG encoding to the sequence of frames. It is well known that, due to the temporal separation between successive fields, this method may produce unsatisfactory results. The second method avoids these problems by applying MPEG encoding to the sequence of fields in the same manner that it would be applied to a sequence of frames.
Motion predictive encoding is a problem with any of the MPEG encoding methods. As described above, the process of matching blocks in a predicted frame to displaced blocks in an anchor frame plays a key role in reducing the prediction residue and, thus, the bit rate for an MPEG encoded signal. The block matching method which is most commonly used assumes that blocks of pixels move by simple translation (i.e. vertically and/or horizontally) in the image plane from frame to frame or from field to field. This method does not perform well, for example, when the block is part of an object which is rotated about an axis in the image plane or which is subject to a change in size due to motion into or out of the frame or such as would result from an image zoom. In addition, this encoding method may not work well when there is a relatively large temporal separation between a frame to be predicted and its reference or anchor frame.
The present invention is embodied in a video encoding system which uses field-oriented motion predictive coding based on data in one or more anchor fields to compress video data. The system includes apparatus which processes groups of fields of video data such that a predicted field is encoded using at least one anchor field which has previously been encoded and which is which closer in time to the predicted field than any other previously encoded field.
According to another aspect of the invention, the motion predictive coding method employs I, P and B-field types. The input video fields are encoded such that a sequence of B-fields separates each I or P-field from the next successive I or P-field.
According to another aspect of the invention, the method modifies the sequence of I, P and B-fields defined by the MPEG group of frames to substitute P or B-fields for I-fields and B-fields for P-fields in selected positions in the sequence.
FIG. 1 is a block diagram of an exemplary video encoding system which includes an embodiment of the invention.
FIGS. 2 and 3, labeled prior art, are field sequence diagrams which are useful for describing the environment in which the invention operates.
.[.FIGS. 4-9 are.]. .Iadd.FIG. 8 is a .Iaddend.field sequence .[.diagrams which are.]. .Iadd.diagram which is .Iaddend.useful for describing the invention as embodied in the system shown in FIG. 1
FIG. 1 is a block diagram of an encoder adapted to perform a modified version of the MPEG video signal encoding method using successive video fields instead of frames. Source 20, which may be, for example, a high-definition video camera, supplies a digital video signal to an input multiplexer 22 as well as to the input port of multi-field memory 24. Multi-field memory 24 includes a sufficient number of storage locations to hold N image fields provided by the source 20. In the exemplary embodiments of the invention, N may be an integer between 6 and 9, depending upon the embodiment. Smaller memories may be used if the processes are optimized to store only the actual data that are needed for present or future encoding operations. This memory holds successive video fields provided by the source 20 while the fields are being encoded using the disclosed encoding methods. The number of fields used in each of the exemplary methods is set forth below with reference to .[.FIGS. 2-9 which illustrate the various methods..]. .Iadd.FIG. 8..Iaddend.
The multi-field memory 24 supplies a signal to an input port of multiplexer 22. This signal is used for processing B-fields. The multiplexer 22 is controlled by a signal MX1 to select either the signal from source 20 or one of the signals provided by the multi-field memory 24, to the plus input port of a subtracter 26. The minus input port of the subtracter 26 is coupled to a multiplexer 34 which may be controlled by a signal MX6 to provide either a zero value or the output signal A from motion a compensator circuit 36, as described below. The exemplary subtracter 26 is actually 256 eight-bit subtracters which are configured to simultaneously subtract four 8 by 8 pixel blocks provided by the motion compensator circuit 36 from four corresponding 8 by 8 pixel blocks provided by the multiplexer 22. The arrangement of four 8 by 8 blocks as one 16 by 16 pixel block is defined in the MPEG standard as a macroblock. In the exemplary embodiment of the invention, all motion compensation is performed on the basis of a macroblock.
The motion compensator receives five input signals, a Backward Motion vector (BMv) and a Forward Motion vector (FMv) from a motion estimator 32, the output signal of the multiplexer 22, and macroblocks of pixel data from one or two reconstructed fields which are held in a second multi-field memory 48. These macroblocks are provided via the multiplexers 50 and 52.
When the field being encoded is a B-field, the motion compensator 36 selects pixel values indicated by one or both of the signals FMv and BMv from one of the two macroblocks provided by the multi-field memory 48 or the average values of the two macroblocks. If the field being encoded is a P-field, the compensator selects the pixel values indicated by the signal FMv from the forward macroblock provided by the multi-field memory 48.
These pixel values are applied to the minus input port of the subtracter 26 while the corresponding pixel values from the field to be encoded are applied to the plus input port. The signal provided by the subtracter 26 is the predictive code residue of the input macroblock provided by the multiplexer 22. That is to say, the input macroblock minus the macroblock provided by the multiplexer 34.
The motion vectors, BMv and FMv, are provided by motion estimator circuitry 32 which receives respective input signals, each representing at least a macroblock of pixels, from multiplexer 22, multiplexer 28 and multiplexer 30. These multiplexers, in turn, are coupled to receive signals representing stored video data from the multi-field memory 24. The motion estimator 32 used in this embodiment of the invention, simultaneously compares a macroblock of data provided by the multiplexer 22 with corresponding overlapping macroblocks of data from one or two fields held by the multi-field memory 24. The exemplary motion estimator 32 is a high-performance processor which simultaneously compares a target macroblock of 16 by 16 pixels, provided by the multiplexer 22, with 256 overlapping 16 by 16 macroblocks of pixels provided from a single field. A motion estimator suitable for use as the estimator 32 may be constructed from multiple conventional motion estimation chips, for example, the ST-13-220 integrated circuit available from SGS Thomson semiconductors. Each macroblock of pixels processed by the motion estimator 32 represents a possible displacement of the target macroblock of pixels in the previous field. The 256 overlapping macroblocks of pixels define a 48 by 48 pixel block in the anchor field which is centered about the position of the target block and which defines the area that is processed to find a reference macroblock. The macroblock in the search area having, for example, the smallest difference with respect to the target macroblock is selected as the reference to be used to predict the target macroblock.
The output signal of subtracter 26 is either a macroblock of pixels from an I-field or a macroblock of residue pixels which represents either the difference between a P-field and its anchor I-field or the difference between a B-field and one or both of its anchor I and P-fields.
The next step in the process is to diagonally (i.e. zigzag) scan each of the four blocks within the macroblock and to transform the diagonally scanned data into DCT coefficients using a Discrete Cosine Transform processor 38. In the exemplary embodiment of the invention, the DCT processor 38 is able to simultaneously process the four blocks of data that make up the macroblock provided by the subtracter 26 to produce four sets of DCT data. Once transformed, the DCT coefficients are quantized in parallel by quantizer 40.
The quantizer 40 assigns differing numbers of bits (i.e. uses a different quantization resolution) to represent the magnitude of each of the DCT coefficients, based in part on how people see video information at the frequency represented by the DCT coefficient. Since people are more sensitive to the quantization of image data at low spatial frequencies than to the quantization of data at high spatial frequencies, the coefficients representing the high spatial frequencies may be quantized more coarsely than the coefficients that represent low spatial frequencies.
The output signal of quantizer 40 is applied to Variable Length Coder (VLC) 54 as well as to an inverse quantizer 42. The VLC 54 encodes the quantized DCT coefficients by their amplitudes, at least one of the forward and backward motion vectors (FMv and BMv) and a mode signal provided by the motion compensator 36 for each block. The VLC 54 applies both run-length encoding and variable length code, such as a Huffman code to the block data. The data provided by the VLC 54 is then stored in a first-in-first-out (FIFO) memory device 56 that buffers the data, which may be supplied at varying rates, for transmission to a receiver through a signal conveyor 58.
To ensure that the average rate at which data is encoded matches the transmission rate, the FIFO 56 is coupled to a buffer control circuit 60. The circuit 60 monitors the amount of data in the FIFO 56 to change the size of the quantization steps applied by the quantizer 40. If the amount of data in the FIFO 56 is relatively low, then the quantization steps may be relatively fine, reducing any quantization related errors in the decoded video signal. If, however, the FIFO 56 is almost at its capacity, the buffer control 60 conditions the quantizer 40 to coarsely quantize the DCT coefficients, thus reducing the volume of data used to represent an image.
As described above, the quantized DCT coefficients from the quantizer 40 are also applied to an inverse quantizer circuit 42. This circuit reverses the process performed by the quantizer to recover the DCT coefficients with the precision of the assigned quantization resolution. Once the signal has been dequantized, it is subject to an Inverse Discrete Cosine Transform operation (IDCT) as represented by element 44. This element reverses the process performed by the DCT element 38 to recover macroblocks of image data from the quantized data stream.
If an I-field is being encoded, the data provided by the IDCT circuit 44 represents macroblocks of the signal as it would be reconstructed at the receiver. This signal is summed with zero-valued pixels, as provided by the multiplexer 34, in an adder 46 and stored in the second multi-field memory 48.
If, however, a P or B-field is being encoded, the output signal provided by the IDCT circuit 44 is added, by adder 46, to the selected macroblock of pixels from the anchor field (provided by the multiplexer 34) to produce a reconstructed macroblock of pixels. This macroblock is then stored in the multi-field memory 48 as a portion of a reconstructed version of the P or B-field which is being encoded. As described below, the reconstructed fields of pixels stored in the multi-field memory 48 may be used by the motion compensator 36 and subtracter 26 to generate the residue data for predictively encoding other P and B-fields.
Turning to the methods of field processing, .[.FIGS. 2 through 9.].EP .Iadd.FIGS. 2, 3 and 8 .Iaddend.show exemplary group-of-field configurations for a field-oriented MPEG system. Prior to describing these configurations, a discussion of the notation used in these figures is in order. The vertical lines in these figures represent successive fields of a video signal. The solid lines represent even fields and the broken lines represent odd fields. The letter above each line describes the type of field (i.e. either I, P or B) with the subscript indicating the number of the field in the represented sequence. I and P-field designators are surrounded by squares and circles, respectively.
Fields marked with a square are intra-coded. These fields are encoded using only data in the field. A field to which an arrow points, a target field, is predictively coded. The order in which the fields are encoded is indicated by the vertical position of the arrow or the square. A dot is placed on the arrow where it crosses a field to indicate that the dotted field may be used to predictively code the target field. An arrow having dots on two fields indicates that the target field may be predictively coded using either of the dotted fields as an anchor field. only one field is selected for prediction, however, based on some measure of difference between the anchor field and the target field. Exemplary difference measures include the absolute magnitude of the differences between the anchor and target fields, and the mean squared magnitude of the differences between the anchor field and the target field.
A field to which two arrows point is a bidirectionally coded field. In a standard MPEG system, a B-field is coded using a preceding field, a following field or an average of the preceding and following fields as the anchor field. B-fields which have two dotted fields on each arrow indicate that two preceding and two following fields are compared to determine which preceding field and which following field have the smallest measure of difference with the target field. This determination is made on a macroblock basis by the motion estimator 32 which produces the motion vector output signals FMv and BMv. The determined preceding and following fields are then processed according to the MPEG method to predictively encode the target field.
FIGS. 2 and 3 show two commonly used group-of-fields configurations for field-oriented MPEG systems. In these configurations, there are two I-fields, eight P-fields and twenty B-fields in a one-half second interval. Using these configurations, the predictive coding is refreshed at one-half second intervals.
FIG. 2 shows the generation, without prediction, of fields I0 and I1, the even and odd fields of the I-frame, respectively. As these fields are encoded, the pixel values from the source 20 are stored into respective field stores in the multi-field memory 24 while pixel values representing reconstructed versions of the image data are stored in the multi-field memory 48.
Next, image data from source 20 which will be encoded as the fields B2 through B5 is stored in respectively different field stores of the multi-field memory 24. Then, as represented by the dots and arrows, the fields I0 and I1 are used to successively predict the even P-fields, P6 and P7 as they are provided by the source 20 and stored into the multifield memory 24. To calculate the motion vectors for field P6, for example, the control circuitry 21 conditions the multiplexers 28 and 30 to provide blocks of pixels from field I0.
The exemplary embodiment of the invention uses a search area of 32 by 32 pixels from the anchor field to locate possible reference macroblocks for a field that is displaced by one frame interval (i.e. two field intervals) from the anchor. Since the search area is referenced to the center pixel of the macroblock, pixels from the reference field which may be used to calculate the residue and, thus the motion vectors, are defined by a 48 by 48 pixel block (i.e. 8+32+8 by 8+32+8).
In the exemplary sequence shown in FIG. 2, each P-field is separated from its anchor I-field by three frame intervals. Thus, the search area for the motion vectors defines a 96 by 96 block of pixels and, to calculate motion vectors for this sequence which cover the same range of motions as is covered by a single frame vector, a block of 12544 pixels (8+96+8=112 by 112) from the anchor field would be required. This scheme would use a relatively large data path and a motion estimator 32 that could simultaneously process a very large number of combinations to achieve equivalent performance to the single frame motion estimation.
Alternatively, the motion vector may be calculated in steps using a number of method collectively known as telescoping. By these methods, the motion vector from I0 to P6 would be calculated in steps, using the intervening field data in the multi-field memory 24. In an exemplary telescoping scheme, the motion vector from B4 to P6 would be calculated and recorded, next, the motion vector from B2 to B4 would be calculated and recorded, and finally, the motion vector from I0 to B2 would be calculated. All motion vectors are calculated based on a 32 by 32 pixel search area. The equivalent motion vector from I0 to P6 may be determined by summing the final vector with the recorded intermediate vectors. This method uses a smaller data path from the multi-field memory 24 to the motion estimator 32, but uses more time to calculate the motion vector since it involves a sequence of steps. Some of this time may be recovered by using pipeline processing to calculate the motion vectors and/or by saving the intermediate motion vectors for use when the motion vectors for the B-fields are calculated.
As each of the P-fields is encoded, a reconstructed version of the field is stored in the multi-field memory 48. Once the reconstructed even and odd I-fields and the even and odd P-fields have been stored in the multi-field memory 48, the intermediate even and odd B-fields (i.e. B2, B3, B4 and B5 which are held in the multi-field memory 24) can be predicted using the fields I0, I1, P6 and P7 fields as anchor fields. In the exemplary group-of-fields sequence shown in FIG. 2 B2 and B4 are predicted from I0 and P6 while B3 and B5 are predicted from I1 and P7.
The circuitry shown in FIG. 1 encodes these fields as follows. The control circuitry 21, via signal M1C, conditions the field memory 24 to provide the stored data for field B2, one macroblock at a time, to the multiplexer 22. At the same time, the circuitry 21 uses the signals MX2 and MX3 to provide corresponding 48 by 48 pixel blocks from each of the fields I0 and P6 to the motion estimator 32 via the multiplexers. Motion vectors from I0 to B2 may be calculated by the motion estimator 32 in one step. Motion vectors from B2 to P6, on the other hand, may be calculated by at least two methods. First, an 80 by 80 pixel block may be provided to the motion estimator by the multi-field memory 24 and the motion vector may be calculated using conventional methods, over this larger block. Second, the motion vector may be calculated by any one of a number of well known telescoping techniques.
The circuitry 21 uses the signal MX1 to condition the multiplexer 22 to apply the B2 macroblocks to the subtracter 22, to the motion estimator 32 and to the motion compensator 36. The motion estimator 32 uses the data from fields I0 and P6 to calculate the best backward and forward motion vectors (BMv and FMv) for the macroblock that is currently being processed from field B2.
The motion vectors BMv and FMv are applied to the motion compensator 36 and to the control circuitry 21. Based on these vectors, the circuitry 21 conditions the multi-field memory 48 and the multiplexers 50 and 52 to apply the indicated macroblocks to the motion compensator 36. The motion compensator 36 calculates three residue values, one for forward motion, using I0 as the anchor field; one for backward motion, using P6 as the anchor field; and one in which the anchor field is the average of the anchor macroblocks from I0 and P6.
Of these three residues, one is selected as the best based on a measure of the entropy of the residue. Exemplary measures include the absolute difference and the mean squared difference between the anchor and target macroblocks. The macroblock which produces the best residue is applied, by the motion compensator 36, to the subtracter 26 via the multiplexer 34. As described above, subtracter 26 generates the residue and applies it to the DCT circuitry 38 and to the quantization circuitry 40 which encodes it. The encoded data is then combined with the motion vectors BMv and FMv provided by the motion estimator 32 in a variable length coder 54. The signal provided by the coder 54 is transmitted by the signal conveyor 58 to a remote destination.
In the sequence shown in FIG. 2, the B2 -B5 fields are not used to generate any other fields. Accordingly, they are not decoded and stored in the multi-field memory 48.
FIG. 3 shows a method which is similar to that shown in FIG. 2 except that, instead of the corresponding odd and even I and P-fields being used to predict other odd and even fields, either the odd I and P-fields or the even I and P-fields may be used as an anchor to predict an individual odd or even predictive field. In the field sequence of FIG. 3, I0 and I0 are created the same way as in FIG. 2; however, P6 is now predicted based on the minimum difference value (or some other criterion) developed using I0 or I1 as the anchor field. The same is true for P7, both the odd and even fields of the I frame, I0 and I1, are used to predict the odd field, P7. Finally, the individual B-fields, odd or even, are predicted using the both fields of each of the I and P-frames: B2, B3, B4 and B5 are all predicted using the best match obtained from I0, I1, P6 and P7 or from combinations of one of the I-fields and one of the P-fields.
The above configurations derive directly from the frame-oriented MPEG system. The present invention, as illustrated by the group of field configurations described below, differs from these schemes by taking advantage of the field-oriented MPEG system to decrease the prediction time interval and the predictive refresh time. In addition, these schemes reduce the number of bits used to convey the image by substituting P-fields for I-fields and B-fields for P-fields where appropriate. So, progressing from the traditional methods of field processing, .[.FIGS. 4 through 10 show.]. .Iadd.FIG. 8 shows .Iaddend.new and better group of field configurations for image processing.
.[.FIG. 4 shows a configuration which can be characterized as using the available closer fields to do the predictions. As in the configurations shown in FIGS. 2 and 3, I0 and I1 are encoded using intrafield processing. Then, these are used as the anchor frame to predict the even field of the next anchor frame, P6. To predict the odd field, P7, of the next anchor frame however, I1 and P6 are used and not I0 and I1. The use of field P6, instead of field I0, to predict field P7 reduces the prediction time span from 7 field intervals to 1 field interval. Thus, it is likely that the prediction of P7 based on I1 and P6 will produce a residue signal that can be encoded in fewer bits than the prediction of P7 based on I0 and I1..].
.[.Similarly, this method is applied to the bidirectional B-field prediction. Field B2 is predicted as shown above in FIG. 3 as the minimum residue of I0, I1, P6 and P7 or as the residue of the average of one of the I-fields and one of the P-fields if that residue is smaller. Field B5, however, is calculated as the minimum residue of the fields I1, B2, P6 and P7. Similarly, B3 is calculated from fields I1, B2, B5 and P6 and B4 is calculated from fields B2, B3, B5 and P6. In order to avoid the error propagation among B-fields, the use of B-fields for predicting other B-fields is restricted to be within the boundaries of the anchor frames on either side of the B-fields..].
.[.The processing of the I0, I1, P6 and P7 fields is essentially the same as outlined above with reference to FIGS. 2 and 3. The processing for field B2, however, is different; since this field is later used to predict fields B3, B4 and B5, B2 is reconstructed and stored in the multi-field memory 48. In addition, the processing of the fields B3, B4 and B5 is different since these fields are encoded with reference to reconstructed B-fields. These fields are also encoded in a different order: B2, B5, B3 and B4 instead of B2, B3, B4 and B5. Since the anchor B-field is often the closest in time to the field that is being encoded, it is likely that it will provide better motion compensation than the other anchor field. The inventor has determined that this method significantly reduces the number of bits needed to encode a sequence of video fields compared to the methods described above with reference to FIGS. 2 and 3..].
.[.In the system shown in FIG. 4, fields B2, B3 and B5 are stored in the memory 48 while none of the B-fields are stored when the group of fields configuration shown in FIGS. 2 and 3 is used. In the configuration shown in FIG. 5, however, field B2 may overwrite field I0 and field B3 may overwrite field I1. Consequently, only one additional field of storage is used for the configuration shown in FIG. 5 compared to those shown in FIGS. 2 and 3..].
.[.Another variation on the methods shown in FIGS. 2 and 3 which has produced a significant increase in video data compression is to distribute the I-fields and the P-fields among the B-fields. FIG. 5 shows an exemplary group of fields configuration in which the P-fields are not grouped in P-frames, as in FIGS. 2, 3 and 4, but occur as single fields separated by intervening B-fields..].
.[.The increase in data compression achieved by using this scheme results from a reduction in the prediction time span relative to the configurations shown in FIGS. 2 and 3. In the group-of-fields configuration FIG. 5 the first predictive field is P4, the fourth field rather than the sixth field. Thus, the time span for the prediction is three or four field intervals rather than five or six as in the configuration shown in FIG. 3. Furthermore, the second predictive field, P7 is generated either from field I1 or from field P4 depending on which has the smaller residue. As described above, for images of moving objects, especially if the objects do not move by simple translation, the prediction of P7 based on P4 will generally produce a smaller residue than the prediction based on I0..].
.[.In addition to shortening the time span over which P-fields are predicted, the configuration shown in FIG. 5 also reduces the time span over which B-fields are predicted. As shown in FIG. 5, fields B2 and B3 are predicted from fields I0, I1, P4 and P7, while fields B5 and B6 are predicted from fields I1, P4, P7 and P10..].
.[.FIG. 6 shows a configuration in which both the P-fields and I-fields are distributed among the B-fields. In addition to reducing the time span over which P-fields and B-fields are predicted, this scheme refreshes the prediction more frequently and, so, reduces the visibility of any errors that may occur in the prediction process..].
.[.In FIG. 6, field P3 is predicted from field I0, field P6 is predicted from I0 and P3 and field P9 is predicted from P3 and P6. Fields B1 and B2 are predicted from fields I0, P3 and P6, while fields B4 and B5 are predicted from fields I0, P3, P6 and P9. Each of the B-fields may be predicted over a time span of one field interval while each of the P-fields may be predicted over a time span of three field intervals..].
.[.If the prediction refresh time is kept the same as in the sequences shown in FIGS. 2 and 3, the number of I-fields can be decreased by one-half. This results in fewer bits on the average being used to encode a group of fields..].
.[.FIG. 7 illustrates a group-of-fields configuration in which P-fields and I-fields are distributed among the B-fields and the closer available field is used to predict B-fields. The processing of the first six fields for this group-of-fields configuration is the same as for the configuration shown in FIG. 6 except for field B5. In the scheme shown in FIG. 7, this field is predicted from fields P3, B4, P6 and P9 while in the scheme shown in FIG. 6 it was predicted from fields I0, P3, P6 and P9. This reduction in the predictive time span for one of the anchor fields from three field intervals to one field interval increases the likelihood of producing a predictive residue that has a relatively small average magnitude..].
The group-of-fields configuration shown in FIG. 8 reduces the number of I-fields and P-fields used to represent the image, and at the same time, uses the closer available I, P or B-field to predict each B-field. This scheme reduces the total number of bits needed to encode the image since, in general, P-fields use fewer bits than I-fields and B-fields use fewer bits than P-fields.
In the configuration shown in FIG. 8, field P1 is predicted from field I0 and field P7 is predicted from I0 and P1. Field B6 is predicted from three fields, I0, P1 and P7, while B2 is predicted from four fields, I0, P1, B6 and P7. Field B5 is predicted using fields P1, B2, B6 and P7. Field B5 is then used along with fields B6, P1 and B2 to predict field B3. Finally, field B4 is predicted entirely from B-fields: B2, B3, B5 and B6.
.[.In this configuration, predictive field P1 is used in the same manner as the intra field I1 was used in the configuration shown in FIG. 4 while the field B6 is used in the same manner as field P6 in FIG. 4..].
.[.A final group-of-fields configuration is shown in FIG. 9. This configuration is an extension of that shown in FIG. 8. Instead of substituting P-fields for I-fields the configuration shown in FIG. 9 substitutes B-fields for I-fields. This scheme achieves a lower average bit-rate than the scheme shown in FIG. 8 since, on the average, fewer bits are used to encode a B-field than are used to encode a P-field..].
.[.In addition to the group-of-field configurations shown in FIGS. 4-9, it is contemplated that other configurations based on other combinations of the described techniques may be used to efficiently encode images. Furthermore, it is contemplated that several of these group-of-fields configurations could be used to encode a single image sequence by adding a code at the start of a sequence to define the group-of-fields configuration to the receiver. A particular group-of-fields configuration may be automatically selected by an image signal preprocessor, for example, based on the amount and type of motion in an image or upon the level of detail in the image..].
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4217609 *||Feb 27, 1979||Aug 12, 1980||Kokusai Denshin Denwa Kabushiki Kaisha||Adaptive predictive coding system for television signals|
|US4771439 *||May 12, 1987||Sep 13, 1988||Fujitsu Limited||Differential coding circuit with reduced critical path applicable to DPCM|
|US4951140 *||Feb 22, 1989||Aug 21, 1990||Kabushiki Kaisha Toshiba||Image encoding apparatus|
|US4985768 *||Jan 18, 1990||Jan 15, 1991||Victor Company Of Japan, Ltd.||Inter-frame predictive encoding system with encoded and transmitted prediction error|
|US4999705 *||May 3, 1990||Mar 12, 1991||At&T Bell Laboratories||Three dimensional motion compensated video coding|
|US5025482 *||May 21, 1990||Jun 18, 1991||Mitsubishi Denki Kabushiki Kaisha||Image transformation coding device with adaptive quantization characteristic selection|
|US5063443 *||May 18, 1990||Nov 5, 1991||Nec Corporation||Codec system encoding and decoding an image signal at a high speed|
|US5089889 *||Apr 27, 1990||Feb 18, 1992||Victor Company Of Japan, Ltd.||Apparatus for inter-frame predictive encoding of video signal|
|US5093720 *||Aug 20, 1990||Mar 3, 1992||General Instrument Corporation||Motion compensation for interlaced digital television signals|
|US5103307 *||Jan 18, 1991||Apr 7, 1992||Victor Company Of Japan, Ltd.||Interframe predictive coding/decoding system for varying interval between independent frames|
|US5146325 *||Apr 29, 1991||Sep 8, 1992||Rca Thomson Licensing Corporation||Video signal decompression apparatus for independently compressed even and odd field data|
|US5150432 *||Mar 22, 1991||Sep 22, 1992||Kabushiki Kaisha Toshiba||Apparatus for encoding/decoding video signals to improve quality of a specific region|
|US5168356 *||Dec 20, 1991||Dec 1, 1992||General Electric Company||Apparatus for segmenting encoded video signal for transmission|
|US5175618 *||Oct 30, 1991||Dec 29, 1992||Victor Company Of Japan, Ltd.||Compression method for interlace moving image signals|
|US5185819 *||Apr 29, 1991||Feb 9, 1993||General Electric Company||Video signal compression apparatus for independently compressing odd and even fields|
|US5191414 *||Mar 26, 1991||Mar 2, 1993||Victor Company Of Japan, Ltd.||Interfield predictive encoder and decoder for reproducing a signal subjected to predictive encoding by encoder into an image signal|
|US5193004 *||Dec 3, 1990||Mar 9, 1993||The Trustees Of Columbia University In The City Of New York||Systems and methods for coding even fields of interlaced video sequences|
|US5228028 *||Feb 5, 1991||Jul 13, 1993||Telettra-Telefonia Elettronica E Radio S.P.A.||System including packet structure and devices for transmitting and processing output information from a signal encoder|
|WO1992010061A2 *||Dec 3, 1991||Jun 11, 1992||The Trustees Of Columbia University In The City Of New York||Systems and methods for coding even fields of interlaced video sequences|
|1||"Advanced Digital Television Description", The Advanced Television Consortium, Feb. 1991.|
|2||"MPEG Video Simulation Model Three (SM3)", ISO Simulation Model Editorial Group, Jul. 1990.|
|3||A. Nagata et al., "Moving Pictures coding System for Digital Storage Media Using Hybrid Coding", Signal Processing: Image Communication 2, vol. 2, No. 2, pp. 106-116, Aug. 1990.|
|4||*||A. Nagata et al., Moving Pictures coding System for Digital Storage Media Using Hybrid Coding , Signal Processing: Image Communication 2, vol. 2, No. 2, pp. 106 116, Aug. 1990.|
|5||A. Puri et al., "On Comparing Motion-Interpolation Structures for Video Coding", SPIE vol. 1360, Visual Communications and Image Processing '90, pp. 1560-1571, (month not avail.), 1990.|
|6||A. Puri et al., "Video Coding With Motion-Compensated Interpolation for CD-ROM Applications", Signal Processing: Image Communication 2, vol. 2, No. 2, pp. 127-144, Aug. 1990.|
|7||*||A. Puri et al., On Comparing Motion Interpolation Structures for Video Coding , SPIE vol. 1360, Visual Communications and Image Processing 90, pp. 1560 1571, (month not avail.), 1990.|
|8||*||A. Puri et al., Video Coding With Motion Compensated Interpolation for CD ROM Applications , Signal Processing: Image Communication 2, vol. 2, No. 2, pp. 127 144, Aug. 1990.|
|9||*||Advanced Digital Television Description , The Advanced Television Consortium, Feb. 1991.|
|10||D.D. Grossman, "Double Compression", IBM Technical Disclosure Bulletin, vol. 15, No. 5, pp. 1698-1699, Oct. 1972.|
|11||*||D.D. Grossman, Double Compression , IBM Technical Disclosure Bulletin, vol. 15, No. 5, pp. 1698 1699, Oct. 1972.|
|12||Eric DuBois et al., "Noise Reduction in Image Sequences Using Motion-Compensated Temporal Filtering", IEEE Transactions on Communcations, vol. CO-M-32, No. 7, Jul. 1984.|
|13||*||Eric DuBois et al., Noise Reduction in Image Sequences Using Motion Compensated Temporal Filtering , IEEE Transactions on Communcations, vol. CO M 32, No. 7, Jul. 1984.|
|14||*||Feng Ming Wang et al., High Quality Coding of the Even Fields Based on the Odd Fields of Interlaced Video Sequences , IEEE Transactions on Circuits and Systems, vol. 38, No. 1, pp. 140 142, (month not avail.), 1991.|
|15||Feng-Ming Wang et al., "High-Quality Coding of the Even Fields Based on the Odd Fields of Interlaced Video Sequences", IEEE Transactions on Circuits and Systems, vol. 38, No. 1, pp. 140-142, (month not avail.), 1991.|
|16||Hirofumi Nishikawa et al., "A Study on a Moving Picture Coding Scheme for Storage Media Using Frame/Field Adaptive Motion Compensation", Mitsubishi Electric Corporation Systems Development Laboratory, pp. 1-4, Jul. 1991.|
|17||*||Hirofumi Nishikawa et al., A Study on a Moving Picture Coding Scheme for Storage Media Using Frame/Field Adaptive Motion Compensation , Mitsubishi Electric Corporation Systems Development Laboratory, pp. 1 4, Jul. 1991.|
|18||Jae S. Lim, "Two Dimensional Signal and Image Processing", Prentice Hall, pp. 568-575, (month not avail.), 1990.|
|19||*||Jae S. Lim, Two Dimensional Signal and Image Processing , Prentice Hall, pp. 568 575, (month not avail.), 1990.|
|20||*||MPEG Video Simulation Model Three (SM3) , ISO Simulation Model Editorial Group, Jul. 1990.|
|21||T. Okada et al., "Coded Representation of Picture and Audio Information", ISO-IEC/JTC1/SC2/WG11, pp. 1-10, Nov. 1991.|
|22||*||T. Okada et al., Coded Representation of Picture and Audio Information , ISO IEC/JTC1/SC2/WG11, pp. 1 10, Nov. 1991.|
|23||Yukitoshi Tsuboi et al., "Adaptive Line Interpolated Inter-field Motion Compensation Method", Consumer Products Research Center, Hitachi Ltd., pp. 1-6, Oct. 1990.|
|24||*||Yukitoshi Tsuboi et al., Adaptive Line Interpolated Inter field Motion Compensation Method , Consumer Products Research Center, Hitachi Ltd., pp. 1 6, Oct. 1990.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7149247||Jan 22, 2003||Dec 12, 2006||Microsoft Corporation||Methods and systems for encoding and decoding video data to enable random access and splicing|
|US7280700||Jun 13, 2003||Oct 9, 2007||Microsoft Corporation||Optimization techniques for data compression|
|US7426308||Jul 18, 2003||Sep 16, 2008||Microsoft Corporation||Intraframe and interframe interlace coding and decoding|
|US7577198||Sep 2, 2004||Aug 18, 2009||Microsoft Corporation||Number of reference fields for an interlaced forward-predicted field|
|US7590179||Sep 15, 2004||Sep 15, 2009||Microsoft Corporation||Bitplane coding of prediction mode information in bi-directionally predicted interlaced pictures|
|US7609762||Nov 15, 2004||Oct 27, 2009||Microsoft Corporation||Signaling for entry point frames with predicted first field|
|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|
|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|
|US7839930||Nov 23, 2010||Microsoft Corporation||Signaling valid entry points in a video stream|
|US7852919||Dec 14, 2010||Microsoft Corporation||Field start code for entry point frames with predicted first field|
|US7852936||Sep 15, 2004||Dec 14, 2010||Microsoft Corporation||Motion vector prediction in bi-directionally predicted interlaced field-coded pictures|
|US7885327||Feb 8, 2011||Samsung Electronics Co., Ltd.||Video coding and decoding methods with hierarchical temporal filtering structure, and apparatus for the same|
|US7924920||Sep 2, 2004||Apr 12, 2011||Microsoft Corporation||Motion vector coding and decoding in interlaced frame coded pictures|
|US7924921||Nov 15, 2004||Apr 12, 2011||Microsoft Corporation||Signaling coding and display options in entry point headers|
|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|
|US7961786||Nov 15, 2004||Jun 14, 2011||Microsoft Corporation||Signaling field type information|
|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|
|US8107531||Nov 12, 2004||Jan 31, 2012||Microsoft Corporation||Signaling and repeat padding for skip frames|
|US8116380||Sep 4, 2004||Feb 14, 2012||Microsoft Corporation||Signaling for field ordering and field/frame display repetition|
|US8189666||Feb 2, 2009||May 29, 2012||Microsoft Corporation||Local picture identifier and computation of co-located information|
|US8213779||Jul 3, 2012||Microsoft Corporation||Trick mode elementary stream and receiver system|
|US8254455||Jun 30, 2007||Aug 28, 2012||Microsoft Corporation||Computing collocated macroblock information for direct mode macroblocks|
|US8340181||Jan 3, 2011||Dec 25, 2012||Samsung Electronics Co., Ltd.||Video coding and decoding methods with hierarchical temporal filtering structure, and apparatus for the same|
|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|
|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|
|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|
|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|
|US20030156640 *||Jan 22, 2003||Aug 21, 2003||Sullivan Gary J.||Methods and systems for encoding and decoding video data to enable random access and splicing|
|US20040008899 *||Jun 13, 2003||Jan 15, 2004||Alexandros Tourapis||Optimization techniques for data compression|
|US20040098009 *||Jul 3, 2003||May 20, 2004||Pelikan Technologies, Inc.||Method and apparatus for body fluid sampling and analyte sensing|
|US20050013365 *||Jul 18, 2003||Jan 20, 2005||Microsoft Corporation||Advanced bi-directional predictive coding of video frames|
|US20050013372 *||Jul 16, 2004||Jan 20, 2005||Microsoft Corporation||Extended range motion vectors|
|US20050013497 *||Jul 18, 2003||Jan 20, 2005||Microsoft Corporation||Intraframe and interframe interlace coding and decoding|
|US20050013498 *||Jul 18, 2003||Jan 20, 2005||Microsoft Corporation||Coding of motion vector information|
|US20050041738 *||Jul 17, 2004||Feb 24, 2005||Microsoft Corporation||DC coefficient signaling at small quantization step sizes|
|US20050053134 *||Sep 2, 2004||Mar 10, 2005||Microsoft Corporation||Number of reference fields for an interlaced forward-predicted field|
|US20050053137 *||May 27, 2004||Mar 10, 2005||Microsoft Corporation||Predicting motion vectors for fields of forward-predicted interlaced video frames|
|US20050053143 *||Sep 2, 2004||Mar 10, 2005||Microsoft Corporation||Motion vector block pattern coding and decoding|
|US20050053146 *||Sep 15, 2004||Mar 10, 2005||Microsoft Corporation||Prediction mode switching in macroblocks of bi-directionally predicted interlaced frame-coded pictures|
|US20050053149 *||Sep 15, 2004||Mar 10, 2005||Microsoft Corporation||Direct mode motion vectors for Bi-directionally predicted interlaced pictures|
|US20050053292 *||Jun 29, 2004||Mar 10, 2005||Microsoft Corporation||Advanced bi-directional predictive coding of interlaced video|
|US20050053293 *||Sep 2, 2004||Mar 10, 2005||Microsoft Corporation||Motion vector coding and decoding in interlaced frame coded pictures|
|US20050053294 *||Sep 2, 2004||Mar 10, 2005||Microsoft Corporation||Chroma motion vector derivation|
|US20050053298 *||Sep 15, 2004||Mar 10, 2005||Microsoft Corporation||Four motion vector coding and decoding in bi-directionally predicted interlaced pictures|
|US20050053300 *||Sep 15, 2004||Mar 10, 2005||Microsoft Corporation||Bitplane coding of prediction mode information in bi-directionally predicted interlaced pictures|
|US20050099869 *||Nov 15, 2004||May 12, 2005||Microsoft Corporation||Field start code for entry point frames with predicted first field|
|US20050100093 *||Nov 15, 2004||May 12, 2005||Microsoft Corporation||Signaling field type information|
|US20050111547 *||Nov 15, 2004||May 26, 2005||Microsoft Corporation||Signaling reference frame distances|
|US20050120340 *||Sep 9, 2004||Jun 2, 2005||Skazinski Joseph G.||Apparatus, system, and method for automated generation of embedded systems software|
|US20050123274 *||Nov 15, 2004||Jun 9, 2005||Microsoft Corporation||Signaling coding and display options in entry point headers|
|US20050152448 *||Nov 15, 2004||Jul 14, 2005||Microsoft Corporation||Signaling for entry point frames with predicted first field|
|US20050152457 *||Nov 12, 2004||Jul 14, 2005||Microsoft Corporation||Signaling and repeat padding for skip frames|
|US20050237987 *||Jun 28, 2005||Oct 27, 2005||Microsoft Corporation||Media coding for loss recovery with remotely predicted data units|
|US20060072662 *||Dec 9, 2005||Apr 6, 2006||Microsoft Corporation||Improved Video Coding|
|US20060146830 *||Dec 30, 2004||Jul 6, 2006||Microsoft Corporation||Use of frame caching to improve packet loss recovery|
|US20060182179 *||Feb 14, 2006||Aug 17, 2006||Samsung Electronics Co., Ltd.||Video coding and decoding methods with hierarchical temporal filtering structure, and apparatus for the same|
|US20060280253 *||Aug 21, 2006||Dec 14, 2006||Microsoft Corporation||Timestamp-Independent Motion Vector Prediction for Predictive (P) and Bidirectionally Predictive (B) Pictures|
|US20070014358 *||Sep 20, 2006||Jan 18, 2007||Microsoft Corporation||Spatiotemporal prediction for bidirectionally predictive(B) pictures and motion vector prediction for multi-picture reference motion compensation|
|US20090003446 *||Jun 30, 2007||Jan 1, 2009||Microsoft Corporation||Computing collocated macroblock information for direct mode macroblocks|
|US20090074073 *||Nov 21, 2008||Mar 19, 2009||Microsoft Corporation||Coding of motion vector information|
|US20090168890 *||Mar 11, 2009||Jul 2, 2009||Microsoft Corporation||Predicting motion vectors for fields of forward-predicted interlaced video frames|
|US20090245373 *||May 29, 2009||Oct 1, 2009||Microsoft Corporation||Video coding|
|US20090297123 *||Dec 3, 2009||Microsoft Corporation||Media streaming with enhanced seek operation|
|US20090300203 *||Dec 3, 2009||Microsoft Corporation||Stream selection for enhanced media streaming|
|US20090300204 *||Dec 3, 2009||Microsoft Corporation||Media streaming using an index file|
|US20100135390 *||Feb 4, 2010||Jun 3, 2010||Microsoft Corporation||Video coding|
|US20110096841 *||Apr 28, 2011||Samsung Electronics Co., Ltd.|
|International Classification||H04N7/32, H04N7/46, H04N7/50, G06T9/00|
|Cooperative Classification||H04N19/61, H04N19/577|
|European Classification||H04N7/50, H04N7/46E|
|Aug 16, 2001||FPAY||Fee payment|
Year of fee payment: 8
|Jun 30, 2005||FPAY||Fee payment|
Year of fee payment: 12
|Jul 11, 2005||AS||Assignment|
Owner name: PANASONIC CORPORATION OF NORTH AMERICA, NEW JERSEY
Free format text: MERGER;ASSIGNOR:MATSUSHITA ELECTRIC CORPORATION OF AMERICA;REEL/FRAME:016237/0751
Effective date: 20041123