JP3415390B2 - Moving picture coding apparatus and moving picture coding method - Google Patents

Description

Detailed Description of the Invention

[0001]

The present invention relates to image communication, transmission,
The present invention relates to a moving picture coding apparatus and a moving picture coding method for coding a moving picture signal such as a video signal in storage and broadcasting, and particularly to a moving picture coding apparatus and a moving picture using motion compensation predictive coding. The present invention relates to an encoding method.

[0002]

2. Description of the Related Art Video telephones, video conferences, optical disk devices,
Devices such as VTRs and CATVs require a technique for encoding moving image signals. As such a moving image encoding method, the pixel value of an image to be encoded (hereinafter referred to as an encoded image) is used by using the pixel value of an already encoded reference image specified by a motion vector. There is known a so-called motion compensation predictive coding which predicts and codes the prediction error and the motion vector.

When this motion compensation predictive coding is applied to an interlaced image (field image) such as a normal television video signal, a motion accuracy of 1/2 line precision or more in a field (motion of 1 line precision or more in a frame). There is a problem in that the accuracy cannot be met because the corresponding pixel value does not exist in the reference image.

Therefore, there has been proposed a method of performing motion compensation by interpolating pixel values of pixels having no corresponding pixels on a reference image using images of two adjacent fields (for example, 1990 Image Coding Symposium). (PCSJ9
0), 8-1, "Study of adaptive line interpolation inter-field motion compensation method"). In this motion compensation method, the encoding target image signal is encoded using the reference image signal and the optimum motion vector. The reference image signal is created by interpolation from the signal of the position specified by the motion vector obtained by the motion vector search circuit, out of the coded image signals of the past two fields. Specifically, three field memories are prepared, and the signal generated by the intra-field interpolation from the output of the first field memory and the output of the second field memory are mixed at a mixing ratio km: 1-km. Thus, a reference image signal is created. km varies depending on the amount of motion detected by the motion detection circuit based on the outputs of the first field memory and the third field memory.

FIG. 2 is a diagram showing the relationship between the image signals according to this conventional technique. The relationship between the image signals 41, 42, 43 and the encoding target image signal 44 stored in the three field memories is as shown in the figure, and the vertical component of the motion vector is n + 1/2 lines (n
Is an integer), the corresponding pixel value in the image signal 41 is output as it is as the reference image signal. For example, when n = 0, the pixel value of the reference image signal is 46 with respect to the pixel value 45 of the encoding target image signal 44. If the vertical component of the motion vector is n lines in the field, the image signal 4
Interpolation value △ using the signal ○ adjacent to the interpolation value △ of 2,43
To create. That is, for example, the interpolated value 49 that becomes the reference image signal for the pixel value 45 in the encoding target image signal 44 is
The value obtained by inter-field interpolation is the sum of the value obtained by multiplying the average value of the pixel value 46 and the pixel value 47 by km and the value obtained by multiplying the pixel value 48 by (1-km). At this time,
If the motion detection circuit determines that the motion is large,
Since it is appropriate to interpolate the interpolated value Δ mainly by using the signal adjacent to the interpolated value Δ in the image signal of the same field as that, it is appropriate to set km to be large, and when it is determined that the motion is small, the interpolated value is interpolated. Since it is appropriate to interpolate the value Δ mainly by using the signal adjacent to the interpolation value Δ in the image signal of the field adjacent thereto, km is set to be small.

As described above, the interpolated value is created by adapting the motion amount using the image signals of the adjacent two fields, so that even in the field image, it is 1/2 in the field.
It becomes possible to generate a reference image signal suitable for motion accuracy of line accuracy or more (motion accuracy of one line in a frame or more), and it is possible to perform accurate motion compensation prediction.

However, in this method, it is necessary to detect the motion in the reference image as described above, and the motion detection circuit for that is required. Also, in order to be able to detect motion, three adjacent fields must already be coded. Therefore, if the three adjacent fields have not been coded, there is a problem that motion detection cannot be performed.

FIG. 3 shows an example in which three adjacent fields have not been encoded. In this example,
Special playback on VTR (random access, fast forward playback,
In consideration of adaptation to a necessary storage system such as reverse reproduction, two adjacent fields (fields 1, 2, 7, in the example in the figure) every plural fields (every 6 fields in the figure)
8) is pre-encoded, and the remaining 4 fields (3 to 6 in the example in the figure) are pre-encoded. The neighboring 2 fields are used as a reference image for motion compensation prediction encoding. In such a case, the motion detection cannot be performed because the three adjacent fields have not been encoded.

On the other hand, in the moving picture coding apparatus using the motion compensation predictive coding method as described above, conventionally, in the motion vector search for the forward or backward motion compensation, the reference picture for searching the motion vector. If the image to be encoded is a non-interlaced image, it is limited to only one image that has already been encoded.
There is a problem in that accurate motion compensation cannot be performed on a moving image in which a movement of / 2 pixels is present. If the image is an interlaced image, two consecutive screens that have already been coded are used as described above. However, since the same area is searched for on both screens in the past, the amount of calculation for searching is extremely large. Was increasing.

Among the moving picture coding methods described above, a moving picture coding method targeting a transmission rate of about 1 to 2 Mbps is particularly used as a coding method for a storage medium such as a VTR or an optical disk. Is MPEG
It is being standardized under the standard name of 1. This is a method based on motion-compensated interframe prediction + DCT.

[0011] At present, for a similar purpose, studies are underway on a method of encoding a moving image of a quality equal to or higher than TV broadcasting at about 2 to 10 Mbps. When trying to adapt the encoding method of MPEG1 to this, while MPEG1 presupposes a non-interlaced image as an input image, a TV signal is a signal of an interlaced image, so it is suitable for an interlaced image. New ideas are needed. In interlaced image coding, interfield / interframe adaptive prediction is known. This is a field whose scanning phase matches the field of interest (an odd field if the field of interest is an odd field, and an even field if the field of interest is an even field), but a field that does not match but is close in time (for example, if the field of interest is In the case of an odd field, an even field adjacent to the odd field, and when the field of interest is an even field, an odd field adjacent to the even field) is switched as a prediction signal. In addition, recent studies have also examined interpolative prediction that averages motion-compensated signals for multiple fields (eg, F. Wang et al., "High-quality co
ding of the even fields based on the odd fields of
interlaced video sequences ", IEEE trans.CS).

However, even in the case of interlaced images, when performing predictive coding using past fields and future fields as in the coding of MPEG1,
It is desirable to incorporate a prediction method using even / odd fields suitable for interlaced images. In this case, when the motion vector is sent to each field, the amount of information of the motion vector increases, so it is necessary to reduce the amount of information of the motion vector without reducing efficiency as much as possible. That is,
It is required to improve the prediction accuracy for interlaced images to reduce the amount of information in the coding output of the prediction error, and to minimize the increase in motion vector information. Conventionally, it is effective to meet such requirements. Technology has not been proposed yet.

[0013]

As described above, in the prior art, when the pixel at the point where the pixel on the reference image does not exist is interpolated using the images of the two fields adjacent to the reference image, the reference image moves. Since the detection is necessary, there is a problem that the motion detection circuit is required and the hardware is complicated, and the motion cannot be detected when the adjacent three fields are not already coded.

Further, in the conventional technique, when the image to be encoded is a non-interlaced image, the reference image is limited to only one image which has already been encoded in the motion vector search.
There is a problem that accurate motion compensation cannot be performed for moving images in which there is a movement of 1/2 pixel unit between adjacent images, and the encoding efficiency is reduced. Furthermore, the encoding target image is an interlaced image. In this case, since the amount of calculation for the motion vector search is very large, there are problems that the motion vector search time becomes long and the hardware circuit scale increases.

Further, the conventional technique has a problem that the prediction accuracy for the interlaced image cannot be effectively improved and the amount of information of the motion vector sent to each field increases.

It is an object of the present invention to improve the prediction accuracy for an interlaced image to reduce the information amount of the coding output of the prediction error, and to suppress the increase of the motion vector information to the minimum. And to provide a moving picture decoding method.

[0017]

In order to achieve the above-mentioned object, the present invention provides a first reference screen from a first and second memory means for accumulating image signals of the first and second reference screens, respectively. A first reference image signal around the point specified by the first motion vector of the image signal and a point around the point specified by the second motion vector of the image signal of the second reference screen. The second reference image signal is read out, a plurality of prediction signal candidates are generated for the image signal of the coding target screen from these first and second reference image signals, and the prediction target image of the coding target screen is generated from these prediction signal candidates. The optimum prediction signal that gives the smallest prediction error with respect to the image signal is searched, the optimum set of the first and second motion vectors corresponding to this optimum prediction signal is detected, and the optimum prediction signal with respect to the image signal of the encoding target screen is detected. Error and optimal pair The information of the first and second motion vectors, characterized in that so as to encode.

[0018]

[0019]

[0020]

[0021]

[0022]

As described above, according to the present invention, the first reference image signal around the point designated by the first motion vector in the image signal of the first reference screen and the image signal of the second reference screen. A second around the point specified by the second motion vector of the
Generate a plurality of prediction signal candidates for the image signal of the encoding target screen from the reference image signal of, and search for the optimal prediction signal that gives the minimum prediction error to the image signal of the encoding target screen from these prediction signal candidates. Then, the optimum set of the first and second motion vectors corresponding to the optimum prediction signal is detected, and the error of the optimum prediction signal with respect to the image signal of the encoding target screen and the first and second sets of the optimum set are detected. By encoding motion vector information, it is possible to perform efficient and highly accurate prediction suitable for interlaced images, and obtain highly accurate prediction signals especially in the moving region of interlaced images. You can

[0023]

[0024]

[0025]

[0026]

[0027]

[0028]

BEST MODE FOR CARRYING OUT THE INVENTION Embodiments of the present invention will be described below. FIG. 1 is a block diagram of a moving picture coding apparatus according to the first embodiment of the present invention. The moving picture coding apparatus in FIG. 1 includes a coding unit 14, two field memories 15,
16, motion vector search circuit 17, interpolation value generation circuit 19
And the local decoding unit 25.

The encoding target image signal 11 is encoded by the encoding unit 14 using the reference image signal 12 output from the interpolation value generating circuit 19 and the optimum motion vector 13 output from the motion vector searching circuit 17. It Reference image signal 12
Is the interpolation value generation circuit from the image signal at the position designated by the motion vector candidate 18 output from the motion vector search circuit 17 among the coded image signals of the past two fields stored in the field memories 15 and 16. 1
Created by 9.

The motion vector search circuit 17 comprises a correlation calculation circuit 20, a motion vector candidate generation circuit 21, an optimum vector determination circuit 22 and a switch 23, and the motion vector candidate generation circuit 21 sequentially generates during the motion vector search operation. The motion vector candidate 24 is input to the field memories 15 and 16 by the switch 23, and the correlation calculation between the reference image signal 12 and the encoding target image signal 11 generated by the interpolation value generation circuit 19 based on this is performed. It is performed by the circuit 20. The optimum vector determination circuit 22 stores the motion vector that maximizes the correlation between the encoding target image signal 11 and the reference image signal 12, and the optimum motion vector 13 is output by the switch 23 at the end of the motion vector search operation. The optimum motion vector 13 and the interpolation value generation circuit 19
The encoding target image signal 11 is encoded by the encoding unit 14 based on the optimum reference image signal 12 from, and encoded data 26 is output.

The local decoding unit 25, based on the encoded data 26 output from the encoding unit 14, the locally decoded image signal 27.
To create. The locally decoded image signal 27 is input to either of the field memories 15 and 16 by the switch 28, and their outputs are passed through the switch 29 and the interpolation value generating circuit 1 is output.
9 is input. Here, the switchers 28 and 29 are used to create a predetermined reference image for the image to be encoded.
The image signal is switched so as to be input to the interpolation value generation circuit 19.

The interpolated value generating circuit 19 comprises an intra-field interpolating circuit 30, a multiplier 31, a multiplier 32 and an adder 33, and a signal generated by the intra-field interpolating circuit 30 from the output signal from the field memory 15. The output signal from the field memory 16 is mixed with the mixing ratio k: 1-k.
The reference image signal 12 is obtained by mixing in.

The motion vector candidate 18 output from the motion vector search circuit 17 is also input to the interpolation value generation circuit 19 and controls the parameter k which determines the mixing ratio of the output signals from the field memories 15 and 16. That is, when the vertical component of the motion vector candidate 18 is n + 1/2 lines (n is an integer) in the field, k = 1 is controlled, and the corresponding pixel value stored in the field memory 15 (here, the field memory 15 Will be output as the reference image signal 12 as it is.

If the vertical component of the motion vector candidate 18 is n lines in the field, the field memory 1
Interpolation values in FIG. 2 using the output signals from 5 and 16
Is interpolated. At this time, if the absolute value of the vertical component of the motion vector candidate 18 is larger than a certain threshold value, the motion in the reference image is also regarded as large, and the interpolation value Δ is adjacent to the interpolation value Δ in the field memory 15 of the same field. The parameter k is set to a large value because it is appropriate to mainly use the signal to be interpolated. On the contrary, when the absolute value of the vertical component of the motion vector candidate 18 is smaller than the threshold value, the motion in the reference image is also regarded as small, and the interpolation value Δ is mainly used for the signal adjacent to the interpolation value Δ in the field memory. Since it is appropriate to interpolate, the parameter k is made small.

It should be noted that as shown in FIG.
4 and the reference image 41 are adjacent to each other, it is effective to bring the parameter k close to 0 and use the signal from the field memory 16 as the interpolation value of the reference image 41.
It is almost limited to the case where the absolute value of the vertical component of the motion vector candidate 18 is 0. On the other hand, when the encoding order as shown in FIG. 3 is adopted, as shown in FIG.
3 and the reference image 51 may be relatively separated from each other. In such a case, it is effective to use the signal from the field memory 16 as the interpolation value of the reference image 51 by setting the parameter k close to 0 even when the absolute value of the vertical component of the motion vector is not 0. come.

FIG. 5 shows a second embodiment of the present invention.
Since the configuration is the same as that of FIG. 1 except for the configuration of the interpolation value generation circuit 19, its detailed description is omitted. The interpolated value generation circuit 19 is composed of two interpolated value generation circuits 34 and 35 and a switch 36 for selecting the output of these. The interpolation value generation circuits 34 and 35 are both the interpolation value generation circuit 1 shown in FIG.
9, the intra-field interpolation circuit 30 and the multiplier 31,
32 and an adder 33. FIG. 6 shows the relationship between the image signals in this embodiment.

The first interpolated value generation circuit 34 uses the reference image 6
When the amount of movement in 1 is large, an effective interpolation value is generated. That is, as shown in FIG. 6A, when the vertical component of the motion vector candidate 18 is n + 1/2 lines in the field (n is an integer), the corresponding pixel value ∘ stored in the field memory 15 (here Then, it is assumed that the content of the field memory 15 is an image close to the encoding target image 63) and is output as it is as the reference image signal (controlled to k = 1).

When the vertical component of the motion vector candidate 18 is n lines in the field (n is an integer), the first interpolation value generating circuit 34 stores the data in the field memory 15 adjacent to the pixel Δ to be interpolated. An interpolation value Δ is created by averaging two pixel values ◯ of the image signal 61.

The second interpolated value generation circuit 35 uses the reference image 6
When the amount of movement in 1 is small, an effective interpolation value is generated. That is, as shown in FIG. 6B, when the vertical component of the motion vector candidate 18 is n + 1/2 lines in the field (n is an integer), the corresponding pixel value ∘ stored in the field memory 15 (here, , Field memory 1
The description will be made assuming that the content of 5 is an image close to the encoding target image 63) is output as it is as a reference image signal (controlled to k = 1). For example, when n = 0, the reference image signal for the encoding target image signal 64 is the pixel value 65.
Becomes

If the vertical component of the motion vector candidate 18 is n lines in the field, the second interpolation value generation circuit 35 sets the pixel ⊚ to be interpolated as the signal ∘ in the adjacent field memory 16. For example, when n = 0, the interpolation value 68 of the reference image signal with respect to the encoding target image signal 64 is
Has a pixel value of 66.

When the vertical component of the motion vector candidate 18 is n / 2 + 1/4 lines in the field, the pixel value ◯ from the field memory 15 adjacent to the pixel Δ to be interpolated and the pixel value from the field memory 16 An interpolated value Δ is created by averaging with ○. For example, when n = 0,
The interpolation value 67 of the reference image signal with respect to the encoding target image signal 64 is the average value of the pixel value 65 and the pixel value 66.

As described above, the interpolation value generating circuit 35 can generate a reference image signal with an accuracy of a unit of 1/4 line in the field, and enables effective motion compensation for an image with little motion and high resolution. To do.

Here, when the absolute value of the vertical component of the motion vector candidate 18 output from the motion vector search circuit 17 is larger than a certain threshold value, the switch 36 selects the output of the interpolation value generation circuit 34 and sets the threshold value. Interpolation value circuit 3 if smaller
By selecting the output of 5, an appropriate reference image signal is generated for each. Also, as another method, the motion vector candidate 18 output from the motion vector search circuit 17
When the absolute value of the vertical component of is large, the output of the interpolation value circuit 34 is selected, and when it is small, both outputs of the interpolation value generating circuits 34 and 35 are used as reference image signals, and correlation calculation is performed for both. The method of selecting either one is also effective.

Next, a third embodiment of the present invention will be described. FIG. 7 is a block diagram of a moving picture coding apparatus according to the third embodiment of the present invention.

In FIG. 7, the image data input to the input terminal 001 is temporarily stored in the input buffer memory 100, and then, in accordance with the order of the image to be encoded, for each partial area composed of a plurality of pixels. It is read from the partial image data input buffer memory 100. The partial image data read from the input buffer memory 100 is input to the motion vector detection circuit 200. The motion vector detection circuit 200 obtains a partial image from which the input data can be efficiently coded from the reproduced images coded in the past, and the motion vector (address data) indicating the data of the region of the partial image and the position of the region. Is output.

The partial image data output from the input buffer memory 100 is also input to the local encoding circuit 300 together with the partial image data and the motion vector output from the motion vector detecting circuit 200. The local encoding circuit 300 encodes either the partial image data itself output from the input buffer memory 100 or the difference data from the partial image data designated by the motion vector. Here, the encoded data of the difference from the area designated by the motion vector also includes data obtained by variable-length encoding the motion vector.

The data coded by the local coding circuit 300 is input to the local decoding circuit 400 together with the partial image data output from the motion vector detection circuit 200 and decoded to obtain a reproduced image. When the encoded data is encoded using the motion vector, the decoding result is added to the partial image data output from the motion vector detection circuit 200 to obtain the reproduced image.
This reproduced image data is input to the motion vector detection circuit 200 and is temporarily stored for encoding the image data input next.

Next, a concrete operation example of the motion vector detection circuit 200, the local coding circuit 300 and the local decoding circuit 400 will be described.

First, in the motion vector detection circuit 200, the data input from the input buffer memory 100 is an image memory (any one of 211 to 214) in which image data unnecessary for the search of the motion vector is stored.
Are sequentially written by the write control circuit 222. The coded image data stored in the image memory (211 to 214) in this manner is sequentially read by the read control circuit 221 and the data switching circuit 231 from the image temporally close to the coded image for each area. , Difference circuit 241
The difference from the input data is calculated for each area. The evaluation circuit 242 sequentially compares the magnitudes of the total values of the differences for each area, controls the direction in which the read control circuit 221 searches in the image memory, and inputs the partial image rather than the previously detected partial image. Every time a partial area of an encoded image having a smaller difference from is detected, an address indicating the area of the partial image is stored in the vector register 243, and the partial area of the encoded image closest to the input partial image is stored. Ask for. The address data indicating the partial area of the encoded image having the smallest difference from the input partial image stored in the register 243 in this way is input to the read control circuit 233 and the switching circuit 232. The reproduced image of the encoded data for the partial area of the completed image is read from the reproduced image memory (215 to 218) and input to the local encoding circuit 300 together with the address data.

On the other hand, in the local encoding circuit 300,
In this embodiment, DCT (discrete cosine transform), which is one of orthogonal transforms, and quantization and variable length coding are used as a method of encoding a motion compensation error. Local encoding circuit 30
0, first, the partial image data output from the input buffer memory 100 is input to the difference circuit 311, and the partial image data output from the motion vector detection circuit 200 with respect to the partial image data is reproduced as the partial image data. Is calculated. The switching circuit 312 is the difference circuit 3
The difference image data input from 11 and the partial image data input from the input buffer memory 100 are input to the terminal 002.
The signals are sequentially switched and output according to the control signal input to.

The DCT circuit 320 sequentially frequency-converts and outputs the partial image data and the difference image data sequentially output from the switching circuit 312. The quantizer circuit 330
The frequency-converted data output from the CT circuit 320 is quantized with a preset quantization width and output. The entropy encoder 340 collectively encodes the data quantized by the quantization circuit 330, the quantization width information and the identification code of the partial image data and the difference data, and further encodes the difference image data by a vector. The motion vector for the partial image output from the register 243 is also variable-length coded and output using a Huffman code or the like according to the respective appearance probabilities. If one Huffman code is formed by combining the identification code and the motion vector, efficient coding is possible. In addition, in this encoding, for the input image data whose difference from the image data obtained by reproducing the encoded data of the area specified by the predetermined rule or the fixed data is the set value or less, If the number of consecutive partial images is variable-length coded, the coding efficiency is further improved.

The code amount evaluation circuit 351 determines the code amount when the difference between the partial image to be encoded and the area designated by the motion vector is encoded and when the input data is directly DCT encoded. The comparison is performed, and the coded data having the higher coding efficiency is output to the output buffer 360 and the local decoding circuit 400.

The output buffer 360 temporarily stores the coded data in order to adjust the output data rate, and the quantization width used in the quantization circuit 330 and the coding used in the entropy encoder 340. Control the table.

In the local decoding circuit 400, the partial image data output from the motion vector detection circuit 200 is temporarily stored in the data memory 441, and the encoded data output from the code amount evaluation circuit 351 is a variable length decoder. The motion vector including the identification code and the quantized data before encoding are input to 410 and decoded. The decoded quantized data is input to the inverse quantization circuit 420, converted into a representative value having a dynamic range before quantization (inverse quantization), and then input to the addition circuit 450. The data inversely quantized by the inverse quantization circuit 420 is the inverse DCT circuit 43.
0 is input, and partial image data or difference image data is reproduced. The gate circuit 442 passes the partial image data output from the data memory 441 when the reproduction data output from the inverse DCT circuit 430 is difference image data by the identification code decoded by the variable length decoder 410, If it is not a difference image, the output data is set to zero and output to the addition circuit 450.

When the image data subjected to the inverse DCT in this way is the encoded difference image, it is added to the partial image data output from the motion vector detection circuit 200, and when it is not the difference image, the motion vector detection is performed. Circuit 2
A reproduction image can be obtained from the adding circuit 450 without using the partial image data output from 00. This reproduced image data is input to the motion vector detection circuit 200 and is temporarily stored for encoding the image data input next.

FIG. 8 shows a fourth embodiment of the present invention, which is a variable length decoding circuit 410 included in the encoding circuit 400 of FIG.
Data memory 460 for storing quantized data instead of
The difference is that you used. In this case, DCT and quantized data of the difference image data between the partial image data output from the input buffer memory 100 and the reproduced image designated by the motion vector corresponding thereto is temporarily stored in the data memory 460. Then, the code amount evaluation circuit 35
The image data corresponding to the encoded data selected in 2 and output to the output buffer 360 is output to the inverse quantization circuit 420. When this image data is difference image data, a reproduction image is obtained by adding the partial image data output from the data memory 441 in the addition circuit 450, as in the example of FIG.

This embodiment has an advantage that the processing time is shorter than that in FIG. 1 because the calculation for decoding is unnecessary.

FIG. 9 shows a fifth embodiment of the present invention, which is an example in which a part of the encoding circuit 400 is used for a motion vector detecting circuit. Also in this embodiment, the motion vector detection circuit 200 reads out partial image data from the already encoded and reproduced image according to the read control circuit 224 through the switching circuit 232, and at the same time, the motion vector (address data) indicating the position of the area is read. ) Is output.

In FIG. 9, the image data input to the input terminal 001 is temporarily stored in the input buffer memory 100 as in FIGS. 7 and 8, and is then composed of a plurality of pixels in the order of the image to be encoded. The local encoding circuit 30 reads out from the input buffer memory 100 for each area
Input to 0. The partial image data output from the input buffer memory 100 is not different from the output data from the motion vector detecting circuit 200 input via the gate circuit 313 by the control signal input to the input terminal 002 first. DCT, quantization, and variable length coding are performed as in FIGS. 7 and 8. The quantized data is stored in the data memory 460, and the encoded data and the code amount are stored in the code amount evaluator 353. Next, input terminal 002
The control signal input to is changed, the difference from the partial image data output by the motion vector detection circuit 200 is calculated, and DCT, quantization, and variable length coding are performed as in FIGS. 7 and 8. .

The code amount evaluator 353 evaluates the encoded data from the entropy encoder 340 and controls the read control circuit 224 according to the evaluation result, so that the code amount evaluator 353 detects a region where the code amount can be further reduced. The encoded data is stored and the motion vector detection circuit 200
The partial image data output from the data memory 441 is stored in the data memory 441, and the data obtained by DCT and quantizing the difference image is stored in the data memory 460. In this way, the coded data with the smallest code amount is finally output to the output buffer 360. The quantized data corresponding to this coded data is converted by the local decoding circuit 400 in FIGS.
Will be played as well. The reproduction data is input to the motion vector detection circuit 200 and is temporarily stored for encoding the image data input next.

In the embodiments of FIGS. 7 and 8, a more accurate motion vector is found as the optimum motion vector, whereas in the embodiment of FIG. 9, a motion vector that maximizes the coding efficiency is found.

FIG. 10 shows an example of a circuit for reproducing the coded data in the embodiment shown in FIGS. The variable length decoder 510 decodes the encoded data input from the input terminal 004, and includes the quantization width information, the motion vector (differential image data with respect to the partial image designated by the motion vector, and an identification code indicating whether it is not). ), And the quantized data. The quantized data is the inverse quantization circuit 52.
0, reproduced through the inverse DCT circuit 530. If this reproduction data is the difference image data with the partial image specified by the motion vector, the read control circuit 521 reads the partial image data from the reproduction image memories 611 to 614 and outputs it from the motion vector detection circuit 600. Input to the decoding circuit 500. This partial image data is added to the difference image data by the addition circuit 550 via the gate circuit 540 to become reproduced image data. This reproduced image data is input to the motion vector detection circuit 600 and is temporarily stored in order to reproduce the encoded data to be input next. The reproduced image data is also input to the output buffer 560, returned in the original order of the images, and output.

Next, the motion vector searching operation performed in the evaluation circuit 242 and the read control circuit 221 of FIGS. 7 and 8 and the code amount evaluator 352 and the read control circuit 224 of FIG. 9 will be described.

11 to 16 show examples of motion vector search according to the present invention. 11 to 16
, S1, s2, ..., s6 are 1 frame or 1
Means an image of a field, 101, 102, ..., 12
0 means one pixel or a plurality of pixels in the horizontal direction or the vertical direction.

In the motion vector search example shown in FIG. 11, the entire encoded image s3 (10) which is temporally closest to the partial image to be encoded (eg, s4-104).
1-120), and the optimum motion vector obtained by the search, that is, the coding efficiency is high, or the more accurate motion vector (for example, s3-107) has been coded in the coding target image. The search range (area) in the encoded image s2 that is temporally distant from the image s3 is limited to (105 to 115), for example.

In the search in the coded image s2 which is distant in time, the optimum motion vector (for example, s02-109 or s03-107) including the previously calculated optimum motion vector (for example, s03-107) is included. ).

Then, the difference between the image of the area designated by the obtained optimum motion vector (for example, s2-107) and the partial image to be encoded (for example, s4-104), that is, the motion compensation error is obtained, and the difference is obtained. Encode the optimal motion vector and motion compensation error.

The motion vector search examples shown in FIGS. 12 to 14 are images (for example, s) that are temporally close to the encoding target image s4.
This is a suitable example when 3) is encoded using a motion vector between a temporally distant image (for example, s1). In this case, since it is possible to predict the motion vector between the partial image s4-104 to be encoded and the image s3 which is temporally close, the temporally close image s3 is predicted.
The search range is limited to (103 to 112), for example. Further, if a motion vector (for example, s3-107) having a high coding efficiency with the temporally close image is obtained by this, a partial region of the temporally close image designated by the motion vector (for example, s3-107). 107) using the motion vector (eg, s1-110) between the temporally distant image (eg, s1) used for 107) and the temporal separation of the partial image s4-104 of the target image s4. The area that is a candidate for the motion vector with respect to the image (for example, s2) can be limited to a narrower range, for example (107 to 110).

In the motion vector search example shown in FIG. 15, when the motion between images is very large and there is no candidate motion vector even in the image s3 which is close in time, or when the image s3 which is close in time is found as a candidate. This is an example of the case where the obtained motion vector (for example, s3-116) is very large, and it can be predicted that there is no motion vector with good coding efficiency in the temporally distant images s2.

In such a case, images s2 that are temporally separated
For, the motion vector search may not be performed, or the search range may be further limited, such as (116 to 120). This makes it possible to obtain a motion vector with high coding efficiency even if the amount of calculation required to search for the motion vector is small.

In the motion vector search example shown in FIG. 16, the image s3 that is temporally close to the partial image s4-104 to be coded is used.
This is an example of the case where the motion vector (for example, s3-107) obtained in step S1 is large to some extent, or an appropriate motion vector is not obtained. In these cases, the search for the motion vector in the temporally distant image s2 is not performed, and the search in the temporally distant image s2 is performed only when the motion vector between the temporally distant image s3 is small. The range is in the vicinity of the same position as the coding area of the coding target image s4 (for example, 103
Up to 105) and search for a motion vector.

When there is a large motion between images that are close in time, there is a "blur" due to the motion even in one image captured by a normal camera. It is difficult to make a difference in pixel units. That is, in such a case, even if the motion vector is obtained from images that are further apart in time, the improvement in coding efficiency is small despite the increase in the amount of calculation for searching. According to the example of FIG. 16, in such a case, since the motion vector of a temporally distant image is not coded in a large motion image, the number of types of coding is reduced, and the coding efficiency is further increased.

The encoding method in the present invention may be intra-frame, intra-field encoding, inter-frame or inter-field differential encoding, and may be combined with other encoding methods. Further, the motion vector search method according to the present invention similarly encodes when a motion vector is obtained for an image between them using a coded image previously encoded at an arbitrary number of image intervals as a reference image. The search can be performed before and after the target image.

Next, a sixth embodiment will be described.
FIG. 17 is a block diagram of a moving picture coding apparatus according to the sixth embodiment of the present invention. The present embodiment is an example in which the present invention is applied to an encoding method such as SM3 which is a simulation model of MPEG1, and an encoding algorithm basically adopts a motion compensation + DCT (discrete cosine transform) method. . However, the input image format is CCIR Rec. It is an interlaced format such as the image format defined in 601/525.
This image format is shown in FIG. In FIG. 18, Y is a luminance signal, Cr and Cb are color signals, and the number of pixels per field of each signal is as shown in the figure.

The coding unit is hierarchically structured like the SM3. That is, as shown in FIG. 19, blocks, macroblocks, slices, pictures, and a group of pictures and sequences, which are not shown in FIG. 8x blocks
It consists of 8 pixels, and DCT is performed in this block unit. A macro block is composed of two Y blocks and one Cr block and one Cb block, for a total of four blocks. Motion compensation and selection of each coding mode are performed in units of this macro block.

The group of pictures (GOP) is constructed as follows. Like SM3, the picture is roughly divided into I, P, and B pictures according to the type of mode for each macroblock allowed as a prediction mode. The modes include four modes of intra-field prediction (Intra), forward prediction (Inter: including motion compensation), backward prediction, and bidirectional interpolation prediction (details will be described later). Of these, the types of pictures are classified into three types, I, P, and B, as shown in Table 1, depending on which prediction mode can be used.

[0077]

[Table 1]

In this embodiment, unlike SM3, an interlaced format is adopted as a coded picture format, and even pictures of the same type have different prediction methods depending on their positions in the GOP, so that pictures are further classified. It FIG. 20 shows the structure of GOP and from which picture each picture is predicted. As shown in the figure, the GOP starts with a B ₀ picture that precedes an I picture that is periodically provided as an entry point for random access and trick play, and ends with P ₂ that precedes the next I picture. Is defined by the set of. I-pictures appear only in even fields.

Table 2 and FIG. 21 show how each picture is predicted from which picture.

[0080]

[Table 2]

There are two types of prediction methods: inter-field prediction in which only even fields are predicted, and inter-field / inter-frame adaptive prediction in which even / odd one field is adaptively predicted. In FIG. 21, an arrow indicates that inter-field prediction is performed, and a symbol in which two lines are integrated into one arrow indicates that inter-field / inter-frame adaptive prediction is performed. The coding order of each picture in one GOP is as shown in FIG.

Based on the above points, the moving picture coding apparatus shown in FIG. 17 will be described. In FIG. 17, the input terminal 70
An interlaced moving image signal is input to 0.
This input moving image signal is stored in the field memory 701 for eight consecutive fields. Field memory 70
The moving image signal in 1 is the first motion vector detection circuit 710.
The motion vector detection is performed with one pixel accuracy by a telescopic search (described later) using the moving image. This is the first stage process of motion compensation.

Next, as preprocessing in the second stage of motion compensation, the motion vector detecting circuit 7 is used by using the locally decoded signal stored in the field memory 708 in the local decoding loop.
The motion vector obtained using the original image in 10 is refined by searching the range of ± 1 around it.

Next, as the second stage of motion compensation, the field memory 708, the inter-field / inter-frame adaptive prediction circuit 709, and the second motion vector detection circuit 711.
In ½, motion vector detection with 1/2 pixel precision is performed using the locally decoded signal, and the prediction circuit 709 generates a prediction signal. This prediction signal is input to the subtractor 702, the difference from the moving image signal from the field memory 701 is calculated, and this difference is output as a prediction error signal.

This prediction error signal is discrete cosine transformed by the DCT circuit 703 to obtain DCT coefficient data. The DCT coefficient data is quantized by the quantizing circuit 704 and adaptively scanned, and then the two-dimensional variable length coding circuit 7
It is input to the multiplexer 714 via 10. The quantized DCT coefficient data is locally decoded through the inverse quantization circuit 705 and the inverse DCT circuit 706, and only I and P pictures are written in the field memory 708. The field memory 708 is prepared for four fields required for adaptive prediction.

The multiplexer 714 multiplexes the DCT coefficient data, the motion vector from the second motion vector detecting circuit 711, which will be described later, and the additional information such as the macroblock type from the coding control unit 717 and the step size. . The information multiplexed by the multiplexer 714 has a constant transmission rate via the buffer 715 and is output to a storage system (recording medium) such as a VTR.

In the encoding control unit 717, the buffer amount in the buffer 715 and the activity calculation circuit 71
Using the intra-macroblock activity (I picture) calculated in step 6 or the intra-macroblock activity (P, B picture) of the immediately preceding signal in the same mode before quantization, the quantization step size in the quantization circuit 704 is set. Have control.

Next, the configuration of the moving picture decoding apparatus corresponding to the moving picture coding apparatus of FIG. 17 will be described with reference to FIG. The signal read from the storage system is input to the input terminal 800 and is temporarily stored in the buffer 801. Buffer 801
The signal read from is input to the demultiplexer / variable length decoding circuit 801, and the multiplexer 71 of FIG.
The DCT coefficient data multiplexed in step 4, additional information such as motion vector and step size are separated and decoded.

That is, after the DCT coefficient data is two-dimensionally variable-length decoded and scan-converted, the inverse quantization circuit 8 is used as in the local decoding loop in the moving picture coding apparatus of FIG.
03 and the inverse DCT circuit 804, locally decoded, adder 805 and field memory 8 for 4 fields.
It is input to the adaptive prediction circuit 807 via 06. On the other hand, since the motion vector is sent in the form of a difference as will be described later, after the variable length decoding, it is returned to the original form and supplied to the adaptive prediction circuit 807. A prediction signal is generated in the adaptive prediction circuit 807, and this prediction signal and the locally decoded signal from the inverse DCT circuit 804 are added by the adder 805,
The original moving image signal is taken out via the field memory 806. The output of the field memory 806 is supplied to an image display unit (not shown).

However, regarding the display of images, the decoding order and the display order are different, and since B pictures are not used for prediction, they do not need to be stored in the field memory.
The I and P pictures are output from the field memory 806, and the B pictures are output as they are while being decoded.

Next, the motion compensation and motion vector detection operation in this embodiment will be described in detail. Motion compensation is performed in macroblock units as described above. The motion vector detection includes motion vector detection by the first motion vector detection circuit 710 by normal block matching with 1-pixel precision, and detection of a 1/2 pixel precision around the reference image specified by the motion vector with 1-pixel precision. The motion vector detection is performed by the second motion vector detection circuit 711 by searching the motion vector for each point where the adaptive spatiotemporal interpolation is performed on the pixel position. A specific method of space-time interpolation will be described later.

The motion vector detection in the first motion vector detection circuit 710 is a process of finding the optimum motion vector by a full search for each field with one pixel accuracy using each field image of the input moving image. Telescopic search (SM
3) is used. However, in the field image, a plurality of paths can be considered as search paths between fields. In this embodiment, the search route is determined according to the following rules.

1) Search between in-phase fields This is done using only in-phase fields. 2) Search between opposite phase fields Use fields with the same phase as much as possible.

Although it is necessary to include the search between the antiphase fields only once in the path, in this embodiment, as shown in the order of the telescopic search in FIG. 24, the fields of different phases are searched first. I have to. For example, when obtaining a motion vector of I → P ₂ , I → P _o → B ₁
→ B ₃ → P ₂ are searched in this order, and I → B ₀ → B ₂ → P ₁ →
Routes such as P ₂ do not pass. The range indicated by hatching in FIG. 24 is the search range. This telescopic search is performed separately for the forward direction and the backward direction.
The search range between adjacent fields is ± 15 horizontal.
Pixels, vertical ± 7 pixels.

Motion vector detection in the second motion vector detection circuit 711 is performed using the image stored in the field memory 708 in the local decoding loop as a reference image. First, as the pre-processing of this motion vector detection, the first
The motion vector is refined by fully searching the range of ± 1 pixel around the reference image specified by the motion vector obtained by the motion vector detection circuit 710 of FIG. Second
The main process of motion vector detection in the motion vector detection circuit 711 is a plurality of prediction signals generated by a method described later at a position of 1/2 pixel accuracy around the reference image specified by the motion vector obtained by the refinement. This is performed by selecting the most suitable prediction signal candidate by evaluating and comparing all prediction error powers of the candidates.

Motion vector detection is not performed for the color signal, and motion compensation is performed based on the motion vector obtained from the luminance signal.

Next, the processing of the inter-field / inter-frame adaptive prediction circuit 709 of FIG. 17 will be described. FIG. 23
9 is a block diagram showing a partial configuration of an inter-field / inter-frame adaptive prediction circuit 709. FIG.

As described above, the second stage of motion compensation is a search for a range of 1/2 pixel accuracy around the reference image designated by the motion vector obtained by the first motion vector detection circuit 710. This is shown in FIG. 25 (b). This inter-field / inter-frame adaptive prediction is based on P ₁ , P ₂ , B
In each picture, for example, a pair # 1 and # 2 of each preceding even-odd one field is used as a reference image (reference field) for the image to be encoded (coding field).

In the first stage of the motion compensation shown in FIG. 25A, the motion vector detection circuit 710 determines the optimum points (indicated by ●) in the reference fields # 1 and # 2, respectively. Suppose that it was obtained in. Figure 25
In the second stage of the motion compensation shown in (b), 1/2 of the circumference of the two optimum points designated by the motion vectors V1 and V2.
An inter-field / inter-frame adaptive prediction circuit 709 applies a spatio-temporal filter to a reference image in an area of pixel accuracy to obtain a plurality of prediction signal candidates, and based on the prediction signal candidates and the motion vector detected by the motion vector detection circuit 710, ,
The motion vector detection circuit 711 searches for the optimum motion vector. In this case, there are two modes of generating the prediction signal candidate, the field interpolation mode and the frame interpolation mode.

First, in the field interpolation mode, the prediction signal candidate is generated only by the spatial filter among the spatiotemporal filters. That is, the pixel values of the pixels A to C in FIG. 25B are created by A = (O + D) / 2 B = (O + D + E + F) / 4 C = (O + F) 2. In this field interpolation mode, there are 18 prediction signal candidate search points, 9 points in each of the even and odd fields.

On the other hand, in the frame interpolation mode, the prediction signal candidate is created by subjecting the signal subjected to motion compensation with one pixel precision in each field to the processing of the spatio-temporal filter. For example, the pixel values of the pixels A to C in FIG. 25B are created by A = G / 2 + (O + D) / 4 B = G / 2 + (O + D + E + F) / 8 C = G / 2 + (O + F) 1/4 It In this case, the field on the side that provides the pixel position data with 1/2 pixel precision is referred to as a reference field. Also in this frame interpolation mode, there are nine prediction signal candidates in each of the even and odd fields, but the prediction signals at the position of the pixel O match, so there are a total of 17 search points for prediction signal candidates.

At the second stage of motion compensation, the sum of the two is 3
The prediction signal candidates of 5 points are searched and the prediction signal candidate with the smallest prediction error is determined as the optimum prediction signal. However,
If the directions of the motion vectors pointing to both fields are largely deviated, the frame interpolation mode is not selected (details will be described later).

Information indicating which of the field interpolation mode and the frame interpolation mode is selected and information indicating which field is selected as the reference field used in the field interpolation mode or the reference field in the frame interpolation mode are 1-bit information. It is transmitted by a flag. Regarding the prediction by the field immediately before P ₀ and P _2, the prediction is performed only by the mode in which the field interpolation mode is applied to a single field. In this case, the mode selection flag is not transmitted.

The above description is for the P picture, but the same is true for the B picture. However, in the case of the B picture, only the field having the same phase as the encoded field is selected as the search field in the field interpolation mode and the reference field in the frame interpolation mode. Of course, in this case, the flag indicating which field is selected is not transmitted.

Next, with reference to FIG. 23, how the above-described principle is actually realized on hardware will be described. Cache memories 901a, 901b and 902
In a and 902b, of the image signals from the field memory 708 for four fields of the local decoding loop of FIG. 17, the portion designated by the motion vector obtained by the preprocessing of the second motion vector detection is stored. It Switching circuit 900
Distributes the outputs of the cache memories 901a and 901b to the temporal filter 903 and the spatial filter 905 according to the control signal from the second motion vector detection circuit 711,
Further, the outputs of the cache memories 902a and 902b are distributed to the temporal filter 904 and the spatial filter 906.

The selector 907 selects the field interpolation mode or the frame interpolation mode from the second motion vector detection circuit 711 according to a control signal indicating that the signal has passed only the spatial filter 905, the spatial filter 905 and the time. One of the signals that has passed through both filters 903 is selected. The same applies to the selector 908. For example, from the switching circuit 900 to the time filter 903.
25B, the signal of the pixel G of FIG. 25B is input, and the signal of the pixel B of FIG. 25B is output from the spatial filter 905. Then, the signals of the pixel G and the pixel B are output to the time filter 903. An averaged signal, that is, a signal subjected to spatiotemporal filtering is obtained. Therefore, the output of the spatial filter 905 may be selected in the field interpolation mode, and the output of the temporal filter 903 may be selected in the frame interpolation mode.

The outputs of the selectors 907 and 908 are directly input to the selector 911, added by the adder 909 and halved by the divider 910, and then input to the selector 911. The selector 911 uses these three inputs, that is, the signal predicted using the reference fields # 1 and # 2 from the selector 907, the signal predicted using the reference fields # 3 and # 4 from the selector 908, and the divider 91.
Signals predicted using reference fields # 1 to # 4 from 0 are selected and output to the second motion vector detection circuit 711 as predicted signal candidates. Motion vector detection circuit 71
1, the prediction signal candidate with the smallest prediction error is determined from the 35 prediction signal candidates as the optimum prediction signal as described above, and information indicating that is determined between the fields.
/ Returns to the inter-frame adaptive prediction circuit 709 . As a result, the inter-field / inter-frame adaptive prediction circuit 709 outputs the optimum prediction signal instructed by the motion vector detection circuit 711 to the subtractor and adder 707.

Next, the second motion vector detection circuit 711.
How to encode and send the motion vector from the above will be described. First, the motion vector in the field interpolation mode or the motion vector on the reference field side in the frame interpolation mode is coded by the variable length coding circuit 713 as a reference vector and sent to the multiplexer 714. This motion vector (reference vector) has 1/2 pixel precision. When the frame interpolation mode is selected, the motion vector of the non-reference field and the motion vector of the reference field (reference vector)
Is similarly encoded and sent. That is, the difference between the extension line of the motion vector in the reference field, the point closest to the intersection of the fields other than the reference field, and the motion vector is 1
It shall be sent with pixel accuracy. Except when the directions of these two motion vectors are close to each other, it is considered that the frame interpolation mode is not effective, and the value of this difference is in the range of a minute value or less.
Then, if it exceeds the range of ± 1, the frame interpolation mode is not selected . In other words, the difference value is within the range of ± 1.
Frame interpolation mode only.

[0109] Figure 26 shows a specific example of how to send this motion vector, the first reference field # 1 and code
Between the target field (encoded field in the figure)
First motion vector with 1/2 pixel accuracy (upper arrow in the figure
, And the second reference field # 2 and the encoding target frame.
The second motion vector with 1 pixel accuracy between the field and
(Indicated by the arrows on the middle and lower sides), and the second motion vector
Motion vectors that can be
Vector whose direction is closest to the first motion vector
The first motion vector and the second reference field
The vector of the point ● that is closest to the point where intersection # 2 intersects △
To the motion vector of (the arrow extending in the vertical direction in the figure)
The corresponding 1-pixel precision difference vector is obtained, and the first motion is calculated.
And sends the vector information and the difference vector information . In the example of FIG. 26, the difference is -1. Depending on this way, without lowering the prediction performance, it is possible to save the information amount of the motion vector.

Next, motion compensation of color signals will be described. As shown in FIG. 19, the luminance signal Y and the color signals Cr and Cb have the same number of pixels in the vertical direction in one macroblock, but the number of pixels of the color signal is half in the horizontal direction. Therefore, when the motion vector obtained from the luminance signal is applied to the color signal, the horizontal component of the motion vector is halved. The division by ½ is performed by rounding an integer or less toward 0. This is the same in the field interpolation mode and the frame interpolation mode.

27 (a) and 27 (b) show specific examples in the case of obtaining the motion vector of the color signal from the motion vector of the luminance signal in the field interpolation mode and the frame interpolation mode. Circles indicated by dotted lines in FIG. 27 are pixel positions where no color signal exists. The pixel position obtained in the first step is indicated by a circle in the center, and the point obtained in the second step is indicated by x. Further, in this example, in any case, the horizontal coordinate of the origin is set to be larger than the horizontal coordinate of the circle point in the center. In the case of the field interpolation mode of FIG. 27 (a), ×
When the motion vector of the luminance signal is obtained at the position, the 1/4 pixel precision of the color signal is rounded in the A direction to form the interpolated pixel Δ. This interpolation pixel Δ is created by Δ = 1/4 (A + B + C + D). Also for the reference field # 1 in the frame interpolation mode of FIG. 27B, the interpolation pixel Δ in the reference field # 1 is similarly created by Δ = 1/4 (E + F + G + H).

As for the interpolated pixel in the first reference field # 2, the pixel at the I position is used by rounding the 1/2 pixel precision of the color signal in the A direction. After all, in the case of the example in FIG. 27, the value of the interpolated pixel Δ is obtained by I × 1/2 + (E + F + G + H) × 1/8.

[0113]

As described above, according to the present invention, 2
It is possible to effectively use the image signals of two reference screens to perform efficient and highly accurate prediction suitable for interlaced images, and obtain highly accurate predicted signals especially in the moving region of interlaced images. be able to.

Further, according to the present invention, it is possible to perform accurate motion compensation and obtain high coding efficiency while reducing the amount of calculation required for motion vector search.

[0115]

[Brief description of drawings]

FIG. 1 is a block diagram showing a first embodiment.

FIG. 2 is a diagram showing a relationship between image signals of respective screens in the related art.

FIG. 3 is a diagram showing an example in which three adjacent fields are not already coded.

FIG. 4 is a diagram showing a relationship of image signals of each screen in the first embodiment.

FIG. 5 is a block diagram showing a second embodiment.

FIG. 6 is a diagram showing the relationship of image signals of each screen in the second embodiment.

FIG. 7 is a block diagram showing a third embodiment.

FIG. 8 is a block diagram showing a fourth embodiment.

FIG. 9 is a block diagram showing a fifth embodiment.

FIG. 10 is a block diagram of a video decoding device.

FIG. 11 is a diagram showing an example of motion vector search according to the present invention.

FIG. 12 is a diagram showing an example of motion vector search according to the present invention.

FIG. 13 is a diagram showing an example of motion vector search according to the present invention.

FIG. 14 is a diagram showing an example of motion vector search according to the present invention.

FIG. 15 is a diagram showing an example of motion vector search according to the present invention.

FIG. 16 is a diagram showing an example of motion vector search according to the present invention.

FIG. 17 is a block diagram of a moving picture coding apparatus according to a sixth embodiment of the present invention.

FIG. 18 is a diagram showing an input image format in the same embodiment.

FIG. 19 is a diagram showing a hierarchical structure of coding units in the embodiment.

FIG. 20 is a diagram showing a configuration of a group of pictures and an encoding order in the embodiment.

FIG. 21 is a diagram for explaining a prediction method of each picture in the same embodiment.

22 is a block diagram of a moving picture decoding apparatus corresponding to the moving picture coding apparatus of FIG.

23 is a block diagram of the inter-field / inter-frame adaptive prediction circuit in FIG.

FIG. 24 is a diagram showing the order of telescopic search in the same embodiment.

FIG. 25 is a diagram for explaining an inter-field / inter-frame adaptive prediction process in the same embodiment.

FIG. 26 is a diagram showing an example of how to send a motion vector in the embodiment.

FIG. 27 is a diagram showing a specific example of obtaining a motion vector of a color signal from a motion vector in the same embodiment.

[Explanation of symbols]

14 ... Encoding unit 17 ... Motion vector search circuit 19 ... Interpolation value generation circuit 20 ... Correlation calculation circuit 21 ... Motion vector candidate generation circuit 22 ... Optimal vector determination circuits 200, 600 ... Motion vector detection circuits 221, 223, 224, 621 Image data read control circuit 242, 351, 352, 353 ... Evaluation circuit 300 ... Local encoding circuit 400 ... Local decoding circuit 101 ... Field memory 103 ... DCT circuit 104 ... Quantization circuit 105 ... Inverse quantization circuit 106 ... Inverse DCT Circuit 108 ... Field memory 109 ... Adaptive prediction circuit 110 ... Motion vector detection circuit 111 ... Motion vector detection circuit 112 ... Variable length coding circuit 113 ... Variable length coding circuit 114 ... Multiplexer 115 ... Buffer 116 ... Activity calculation circuit 117 ... Code Control unit 700 ... Input terminal 701 ... No. Field memory 702 ... Subtractor 703 ... DCT circuit 704 ... Quantization circuit 705 ... Inverse quantization circuit 706 ... Inverse DCT circuit 707 ... Adder 708 ... Second field memory 709 ... Interfield / interframe adaptive prediction circuit 710 ... First motion vector detection circuit 711 ... Second motion vector detection circuit 712, 713 ... Variable length coding circuit 714 ... Multiplexer 715 ... Buffer 716 ... Activity calculation circuit 717 ... Encoding control unit 903, 904 ... Temporal filter 905 906 ... Spatial filter

   ─────────────────────────────────────────────────── ─── Continued front page    (72) Inventor Tadaaki Masuda               1 Komukaishiba-cho, Saiwai-ku, Kawasaki-shi, Kanagawa               Toshiba Research Institute, Ltd. (72) Inventor Hideyuki Ueno               1 Komukaishiba-cho, Saiwai-ku, Kawasaki-shi, Kanagawa               Toshiba Research Institute, Ltd. (72) Inventor Noboru Yamaguchi               1 Komukaishiba-cho, Saiwai-ku, Kawasaki-shi, Kanagawa               Toshiba Research Institute, Ltd. (72) Inventor Tomoo Yamakage               1 Komukaishiba-cho, Saiwai-ku, Kawasaki-shi, Kanagawa               Toshiba Research Institute, Ltd.                (56) References JP-A-56-143776 (JP, A)                 JP-A-55-158784 (JP, A)                 JP-A-2-33286 (JP, A)                 JP-A-2-224490 (JP, A)                 JP 3-4680 (JP, A)                 JP-A-61-283292 (JP, A)                 JP-A-3-117991 (JP, A)                 "A HIGH QUALITY V               IDEPHONE CODER US               ING HIERARCHICAL M               OTITION ESTIMATION A               ND STRUCTURE CODIN               GO OF THE PREDICTIO               N ERROR ”, Michael G               ilge, SPIE Vol. 1001 V               isal Communicatio               ns and Image Proce               ssing'88, pp. 864-874                 1991 IEICE Spring National University               Kai, 7-64, D-354, "Accumulating media               Frame-to-frame / feed suitable for video coding               Study on Motion Compensation between Ludos ”, Hirofumi Nishikawa et al. 2               Name

Claims (2)

(57) [Claims] 1. A first and second memory means for accumulating image signals of a first and a second reference screen, respectively, and an image signal of the first reference screen accumulated in the first memory means. Of the first reference image signal around the point specified by the first motion vector of the first reference vector and the second motion vector of the image signals of the second reference screen stored in the second memory means. Prediction signal candidate generation means for generating a plurality of prediction signal candidates for the image signal of the encoding target screen from the second reference image signal around the point to be encoded, and the encoding target screen from the prediction signal candidate Search for the optimum prediction signal that gives the smallest prediction error for the image signal of
Motion vector detection means for detecting an optimum set of the first and second motion vectors corresponding to the optimum prediction signal; and means for coding an error of the optimum prediction signal with respect to the image signal of the encoding target screen. And a means for encoding the information of the first and second motion vectors of the optimum set detected by the motion vector detecting means. 2. A first motion vector of the image signals of the first reference screen is designated by the first and second memory means for accumulating the image signals of the first and second reference screens, respectively. The first reference image signal around the point and the second reference image signal around the point specified by the second motion vector in the image signal of the second reference screen are read out, and the first and second A prediction signal candidate generating step of generating a plurality of prediction signal candidates for the image signal of the encoding target screen from the second reference image signal; and a minimum prediction error from the prediction signal candidate to the image signal of the encoding target screen. Search for the optimal prediction signal to give,
A motion vector detecting step of detecting an optimum set of the first and second motion vectors corresponding to the optimum prediction signal; and a step of encoding an error of the optimum prediction signal with respect to an image signal of the encoding target screen. Encoding the information of the first and second motion vectors of the optimum set detected by the motion vector detecting step.