Apparatuses and methods for moving picture coding and decoding

Abstract: The present invention discloses a method of coding image data with coefficients between fields by increasing the coefficients prior to coding. The method comprising the steps of: (1) detecting a motion vector in a reference field to a sample field to check whether the reference field is zoomed in or out relative to the sample field, data of the reference field being coded based on the sample field; (2) zooming out the reference field when the reference field is zoomed in relative to the sample field, and zooming in the reference field when the reference field is zoomed out relative to the sample field according to the motion vector; and (3) coding the reference field after the reference field has been zoomed according to the motion vector in the second step. In the second step, the reference field may be zoomed out by eliminating pixels that are not adjacent in one of a vertical direction and a horizontal direction.

Description: BACKGROUND OF THE INVENTION (1) Field of the Invention The present invention relates to an apparatus and method for coding and decoding moving pictures using coefficients between frames or fields, and more particularly, to a high-efficient apparatus and method for coding and decoding a sequence of moving pictures that contains zoomed images. (2) Description of the Related Arts In recent years, a variety of techniques have been developed in the field of image digitization. Because an image is converted into a massive amount of data, the image data must be compressed, or reduced in volume, to be recorded or transmitted efficiently. For example, a digital video tape recorder for a HDTV(High-Definition Television) is furnished with a function that codes and decodes an enormous amount of image data of moving pictures. FIG. 1A is a block diagram showing a structure of a conventional coding unit. More precisely, numeral 1000 is an image input unit used to input image data per frame that makes up moving pictures. Numerals 1001, 1002 are frame memories for temporarily storing image data of two continuous frames, for example, frames #0, #1, respectively. The frame referred herein is the data of one image that collectively makes up the moving pictures; in case of an interlace display, the frame is a field consisting of alternative scanning lines. Numeral 1003 is an adder for computing a total of image data pixel values in the frame memories 1001, 1002. Numeral 1004 is a subtracter for computing a balance between the image data pixel values in the frame memories 1001, 1002. Numeral 1005 is a selector for selecting an output from either the adder 1003 or subtracter 1004. Numeral 1006 is a discrete cosine transform(DCT) unit for dividing a frame formed on the output from the selector 1005 into a set of 8x8 pixel array blocks to analyze each block's frequency. Numeral 1007 is a quantization unit for quantizing the frequency into an array using a quantization table which specifies an adequate quantization method for each frequency. Numeral 1008 is a variable length coding (VLC) unit for outputting coded data by converting the quantization frequency array into variable length codes; this process is also known as "entropy coding". The above-described coding unit converts original image data into the coded data by the following steps of (1) dividing a frame formed on the total or balance of two continuous frames' image data into a set of 8x8 pixel array blocks; (2) computing coefficients between the two frames with an orthogonal transform; (3) quantizing the coefficients first, and then converting the quantization coefficients into variable length codes. FIG. 1B is a block diagram depicting a structure of a conventional decoding unit, which operates in a reversed manner to the above-described conventional coding unit, thereby decoding the coded data back into the original image data. More specifically, numeral 1109 is an input unit used to input the coded data. Numeral 1108 is a variable length decoding (VLD) unit for converting the coded data into the quantization frequency array. Numeral 1107 is a dequantization unit for dequantizing the quantization frequency array into the frequency using the quantization table. Numeral 1106 is an inverse DCT unit for converting the frequency to the two frame's image data, and subsequently computing the total and balance of the image data per 8x8 pixel array block with an inverse DCT. Numerals 1105, 1104 are frame memories for respectively storing the total and balance of the image data entering from the inverse DCT unit 1106. Numeral 1103 is an adder for adding the total and balance of the image data per pixel in the frame memories 1105, 1104. Numeral 1102 is a subtracter for subtracting the total and balance of the image data per pixel in the frame memories 1105, 1104. Note that the output from the adder 1103 and subtracter 1102 are the image data of the frames #0, #1, respectively. Numeral 1101 is a selector and shifter for shifting between the adder 1103 and subtracter 1102 to select their outputs in turn. The above-described decoding unit decodes the coded data back into the original image data by the following steps of (1) decoding the coded data into the quantization frequency array; (2) computing the total and balance of the two frames' image data with de-quantization and inverse DCT per 8x8 pixel array block; (3) storing the total and balance of the image data first, and then adding or subtracting the total and balance of the image data per pixel. The conventional coding apparatus, however, is not efficient when a sequence of pictures contains zoomed frames. This is because compression efficiency is directly proportional to the coefficients between the two frames (inversely proportional to the image data balance), and the coefficients become smaller when one of the images is zoomed. Also, the conventional coding unit has a problem in maintaining the image quality in a reproduced image. More precisely, the conventional coding unit is typically used for the digital VTRs or data transmission via a telephone line, where the coded data transmitted per time unit is limited. For example, assume that a VTR has a capacity of 50 Mbps and it records 30 frames of video per second, then the volume should be less than 1.67Mbit/frame. Therefore, when the volume exceeds that limit, the quantization unit 1007 reduces the volume before it transmits the image data to the VLC unit 1008. Thus, the decoded data contains less image data and an image is reproduced on the less image data, resulting in a degraded image quality. In other words, under the present conditions, the image data are compressed at the expense of the image quality. SUMMARY OF THE INVENTION Accordingly, the present invention has a first object to provide an apparatus and method for coding image data efficiently independently of the zoomed frames. The present invention has a second object to provide an apparatus and method for decoding the coded data generated by the coding apparatus and method of the present invention. The first object is fulfilled by a method of coding image data with coefficients between fields by increasing the coefficients prior to coding. The method comprises the steps of: (1) detecting a motion vector in a reference field to a sample field to check whether the reference field is zoomed in or out relative to the sample field, data of the reference field being coded based on the sample field; (2) zooming out the reference field when the reference field is zoomed in relative to the sample field, and zooming in the reference field when the reference field is zoomed out relative to the sample field according to the motion vector; and (3) coding the reference field after the reference field has been zoomed according to the motion vector in the second step. The sample and reference fields may comprise a set of alternative scan lines in case of an interlace display, and comprise one image's data otherwise. The first step may include the substep of checking a group consisting of a predetermined number of sequential fields to select a most zoomed-in field in the group as the sample field. The second step may include the substeps of: generating a second pixel address in a zoomed reference field according to the size and direction of the motion vector, the second pixel address mapping to a first pixel address in the reference field; and reading out pixel data at the first pixel address from the reference field to write the pixel data at the second pixel address. The first step may include the substeps of computing zoom coefficients of an approximate equation based on the motion vector, which represent a first pixel address in the reference field and a second pixel address in a zoomed reference field, and wherein the reference field is zoomed according to a direction and a size of the motion vector in the second step. The first step may further include the substep of checking whether the reference field is zoomed in or out relative to the sample field based on a direction of the motion vector. The second step may include the substeps of generating the first and second pixel addresses with the approximate equation; and reading out pixel data at the first pixel address from the reference field to write the pixel data at the second pixel address. The first object is also fulfilled by a coding apparatus for coding image data with coefficients between fields by increasing the coefficients prior to coding. The apparatus comprises: means for temporarily storing a sample field; means for temporarily storing a reference field which is to be coded based on the sample field; means for detecting a motion vector in the reference field to the sample field to determine whether the reference field is zoomed in or out relative to the sample field; means for zooming in the reference field when the reference field is zoomed out relative to the sample field, and for zooming out the reference field when the reference field is zoomed in relative to the sample field according to the motion vector; and means for coding the reference field after it has been zoomed according to the motion vector. The detecting means may include means for checking a group consisting of a predetermined number of sequential fields to select a most zoomed-in field in the group as the sample field. The zooming means may zoom out the reference field by eliminating pixels that are not adjacent in one of a horizontal direction and a vertical direction. The zooming means may eliminate pixels in one line and one of a vertically and horizontally adjacent line in zigzag. The zooming means may interpolate pixels by referring to neighboring pixel data when the zooming means zooms in the reference field. The zooming means may interpolate pixels by referring to corresponding pixel data in an adjacent field in the group. The zooming means may zoom in the reference field according to a direction and a size of the motion vector. The detecting means may further include means for checking whether the reference field is zoomed in or out relative to the sample field based on a direction of the motion vector. The apparatus may further include means for generating a second pixel address in a zoomed reference field according to the size and direction of the motion vector, the second pixel address mapping to a first pixel address in the reference field. The zooming means may include means for reading out pixel data at the first pixel address from the reference field storage means to write the pixel data at the second pixel address. The apparatus may further include means for computing zoom coefficients of an approximate equation based on the motion vector, which represent a first pixel address in the reference field and a second pixel address in a zoomed reference field, and wherein the zooming means zooms the reference field according to a direction and a size of the motion vector. The detecting means may further include means for checking whether the reference field is zoomed in or out relative to the sample field based on a direction of the motion vector. The apparatus may further include means for generating the first and second pixel addresses with the approximate equation. The zooming means may include means for reading out pixel data at the first pixel address from the reference field to write the pixel data at the second pixel address. The second object is fulfilled by a method of decoding coded data with zoom coefficients between fields when image data have been coded by a coding method which zooms out or in zoomed-in/out fields prior to coding. The method comprises the steps of: (1) decoding coded data into field data; (2) generating a first pixel address in a decoded field and a second pixel address mapping to the first pixel address in a zoomed decoded field with the zoom coefficients; (3) reading out pixel data at the first pixel address from the decoded field to write the pixel data at the second pixel address to zoom the decoded field; (4) generating a third pixel address at which pixel data are interpolated when the decoded field is zoomed in; and (5) interpolating the pixel data at the third pixel address. The second object is also fulfilled by an apparatus of decoding coded data with zoom coefficients between fields when image data have been coded by a coding method which zooms out or in zoomed-in/out fields prior to coding. The apparatus comprises: means for decoding coded data into field data; means for temporarily storing data of one decoded field; means for temporarily storing the zoom coefficients associated with the decoded field data in the decoded-field-data storage means; means for generating a first pixel address in the decoded field and a second pixel address with the zoom coefficients, the second pixel mapping to the first pixel address in a zoomed decoded field; means for reading out pixel data at the first pixel address from the decoded-field-data storage means to write the pixel data at the second pixel address to zoom the decoded field; means for generating a third pixel address at which pixel data are interpolated when the decoded field is zoomed in; and means for interpolating the pixel data at the third pixel address. BRIEF DESCRIPTION OF THE DRAWINGS These and other objects, advantages and features of the invention will become apparent from the following description thereof taken in conjunction with the accompanying drawings which illustrate a specific embodiment of the invention. In the drawings: FIG. 1A is a block diagram depicting a structure of a conventional coding unit; FIG. 1B is a block diagram depicting a structure of a conventional decoding unit; FIG. 2 is a block diagram depicting a structure of an image recording apparatus incorporating a coding unit and a decoding unit of the present invention; FIG. 3 is an illustration of a recording medium's record format; FIG. 4 is a block diagram depicting a pre-coding processing unit in the coding unit; FIG. 5 is a block diagram depicting a post-decoding processing unit in the decoding unit; FIG. 6 is an illustration of a field group; FIGS. 7A through 7F are the illustrations of motion vectors and linear functions approximating the motion vectors; FIG. 8A is a flowchart detailing the operation of a zoom coefficient computing unit; FIG. 8B is a view explaining sample points' motion vectors; FIG. 9 shows equations used for computing horizontal parameters and zoom coefficients; FIG. 10 shows equations used for computing vertical parameters and zoom coefficients; FIG. 11 is a block diagram depicting a zoom processing unit in the pre-coding processing unit; FIG. 12 is a flowchart detailing the operation of the pre-coding processing unit; FIGS. 13A through 13D are views explaining a principle of a zoom process with the zoom coefficients; FIGS. 14A through 14D are views explaining a zoom-out process of the pre-coding processing unit and a zoom-in process of the post-coding processing unit; FIG. 15 is a flowchart detailing a vertical zoom-out process of the pre-coding processing unit; FIG. 16 is a flowchart detailing a horizontal zoom-out process of the pre-coding processing unit; FIGS. 17A through 17D are views explaining a zoom-in operation of the pre-coding processing unit and a zoom-out process of the post-coding processing unit; FIG. 18 is a flowchart detailing a vertical zoom-in process of the pre-coding processing unit; FIG. 19 is a flowchart detailing a horizontal zoom-in process of the pre-coding processing unit; FIG. 20 is a flowchart detailing a zoom process of the post-decoding processing unit; FIG. 21 is a flowchart detailing a vertical zoom-in process of the post-decoding processing unit; FIG. 22 is a flowchart detailing a horizontal zoom-in process of the post-decoding processing unit; FIG. 23 is a flowchart detailing a zoom-out process of the post-decoding processing unit; FIG. 24 is a view explaining an alternative zoom-out process of the pre-coding processing unit; and FIG. 25 is a block diagram showing a structure of an alternative pre-coding processing unit. DESCRIPTION OF THE PREFERRED EMBODIMENT FIG. 2 is a block diagram showing a structure of an image forming apparatus incorporating a coding processing unit and a decoding processing unit of the present invention. For the use of convenience, assume that the image forming apparatus is a digital VTR and a frame consists of two fields in this embodiment. The image forming apparatus comprises a pre-coding processing unit 1, a coding unit 3, a writing unit 4, a recording medium 5, a readout unit 6, a decoding unit 7, and a post-decoding processing unit 2. The first three elements compose the coding processing unit for coding image data of original moving pictures per two frames(four fields), while the last three elements composing the decoding processing unit for decoding the coded data back into the original image data, and the recording medium 5 records and stores the coded image data. More precisely, the pre-coding processing unit 1 checks a field group consisting of a predetermined number of fields, which is four herein; the first field is referred to as a sample field. In other words, the pre-coding processing unit 1 checks whether or not a non-sample field in the field group is zoomed relative to the sample field. If so, the pre-coding processing unit 1 computes zooming coefficients, and resumes a zoomed reference field size to a sample field size; a zoomed-in non-sample field is zoomed out while a zoomed-out non-sample field is zoomed in. The coding unit 3 compresses the image data entering from the pre-coding processing unit 1 by coding the image data per field group in the same way as the conventional coding unit described in the related arts, and thus the explanation is omitted. The coded image data are simply referred to as code data hereinafter. The writing unit 4 writes the coded data and zoom coefficients entering respectively from the coding unit 3 and pre-coding processing unit 1 into the recording medium 5, which is a video tape herein. Thus, the writing unit 4 corresponds to a format unit that records the coded data into the video tape. However, if the image forming apparatus is a computer system and the recording medium 5 is a hard or optical disc, the writing unit 4 is a hard or optical disc controller. The recording medium 5, as has been stated above, is a video tape for a digital VTR and it records and stores the coded data. FIG. 3 is an illustration of a record format of the recording medium 5. The record format consists of a plurality of pairs of a header unit and a data unit; the former stores the zoom coefficients and other control information related to the coded data, and the latter stores the coded data up to four fields. The readout unit 6 reads out the coded data and zoom coefficients from the recording medium 5. In contrast to the writing unit 4, the readout unit 6 corresponds to a format unit that reproduces the coded data stored in the recording medium 5. If the recording medium is a hard or optical disc, the readout unit 6 is a hard or optical disc controller. The decoding unit 7 decodes the coded data back into the original image data in the same way as the conventional decoding unit explained in the related art, and thus the explanation is omitted. The post-decoding processing unit 2 zooms in a non-sample frame when it was zoomed out by the pre-coding processing unit 1, and zooms out when zoomed in using the zoom coefficients. The gist of the present invention, the pre-coding processing unit 1 and post-decoding processing unit 2, will be explained more in detail. PRE-CODING PROCESSING UNIT 1 The pre-coding processing unit 1, whose structure is shown in FIG. 4, resumes a non-sample field size to the sample field size before the non-sample field data are sent to the coding unit. The pre-coding processing unit 1 comprises an image input unit 100, a motion vector detecting unit 101, a zoom coefficient computing unit 102, a field memory 103, a zoom processing unit 104, a sample address control unit 105, a switch unit 106, and an output terminal 108. More precisely, the image input unit 100 is used to input field data, which are digitized video signals from a HDTV's receiver herein. FIG. 6 shows an example of the field data. The field data are the field group consisting of four fields, and the first field(#0) is referred to as the sample field, and other three fields(#1-3) are referred to as reference fields which are subject to coding based on the sample field. A plurality of the field groups are inputted per field into the input unit 100; note that each sample field is inputted with a sample field control signal. The motion vector detecting unit 101 detects motion vectors in the reference field. The motion vectors represent a mapping relation between the sample and reference fields. The motion vectors are detected in the same way as disclosed in Japanese Laid-open Patent Application No. 2-5689 which corresponds to EP-A-0 348 207, which will be explained briefly by referring to FIG. 7A through 7F. First, let a case be an example where the reference field #1 is zoomed in relative to the sample field #0 as shown in FIG. 7A, in which a circle indicates a center of zoom while arrows indicating the motion vectors in the reference field #1 relative to the sample field #0. Then, the motion vector detecting unit 101 divides the two fields into four squares having the center of the zoom as an intersection, and selects a sample point in each square on the reference field #1. Further, the motion vector detecting unit 101 checks the sample points' mapping points on a zoomed-out reference field relative to the sample field #0 to detect the motion vectors. The zoom coefficient computing unit 102 computes zoom coefficients, i.e., coefficients of linear functions, which approximate the horizontal and vertical motion vectors. FIG. 7B shows horizontal linear functions and horizontal zoom coefficients relative to FIG. 7A. Given the horizontal zoom coefficients (a h , b h ), a horizontal motion vector V h (x) located from x pixels away from the center of zoom is expressed as : V h (x) = a h ·x + b h Equation (1) explains that a pixel located at x on the reference field #1 maps to a pixel located at V h (x) in the zoomed-out reference field relative to the sample field #0. FIG. 7C shows the vertical linear function and zoom coefficients relative to FIG. 7A. Given the vertical zoom coefficients (a v , b v ), the horizontal vector V v (y) located from y pixels away from the center of zoom is expressed as : V v (y) = a v ·y + b v Equation (2) explains that a pixel located at y on the reference field #1 maps to a pixel located at V v (y) in the zoomed-out reference field relative to the sample field #0. Equations (1), (2) lead to the conclusion that the pixel located at (x, y) on the reference field #1 maps to the pixel located at (V h (x), V v (y)) in the zoomed-out reference field relative to the sample field #0. FIGS. 7D through 7F show a case where the reference field #1 is zoomed out, although the expiation is omitted. To be more specific, a method of computing the horizontal and vertical zoom coefficients will be explained by referring to FIGS. 8A through 10. FIG. 8A is a flowchart detailing the operation of the zoom coefficient computing unit 102. To begin with, the zoom coefficient computing unit 102 receives the four sample points' motion vectors from the motion vector detecting unit 101(Step 81). FIG. 8B shows the motion vectors in the blocks 0-3 : V(x 0 , y 0 ), V(x 1 , y 1 ), V(x 2 , y 2 ), V(x 3 , y 3 ), respectively; HPIX represents the number of pixels within one field in the horizontal direction while VLINE representing the number of pixels in the vertical direction, or the number of the scan lines. The zoom coefficient computing unit 102 computes parameters, HSx, HSx 2 , HSy, HSxy, which are used to compute the horizontal zoom coefficients using Equations (3)-(6) shown in FIG. 9, respectively(Step 82). HSx is a total of the horizontal coordinates within one field, HSx 2 is a total of squares of the horizontal coordinates within one field, HSy is a total of the horizontal motion vectors within one field, and HSxy is a product of the horizontal motion vectors and horizontal coordinates within one field; V(x 0 ), V(x 1 ), V(x 2 ), V(x 3 ) are elements of the horizontal motion vectors. Subsequently, the zoom coefficient computing unit 102 computes the horizontal zoom coefficients a h , b h using Equations (7), (8) shown in FIG. 9, respectively(Step 83). Further, the zoom coefficient computing unit 102 computes vertical parameters, VSy, VSy 2 , VSx, VSyx, in the same way as the vertical coefficients using Equations (9)-(12) shown in FIG. 10, respectively(Step 84). VSx is a total of the vertical coordinates within one field, VSx 2 is a total of squares of the vertical coordinates within one field, VSy is a total of the vertical motion vectors within one field, and VSxy is a product of the vertical motion vectors and vertical coordinates within one field; V(y 0 ), V(y 1 ), V(y 2 ), V(y 3 ) are elements of the vertical motion vectors. Subsequently, the zoom coefficient computing unit 102 computes the vertical zoom coefficients a v , b v in the same way as the horizontal zoom coefficients using Equations (13),(14) shown in FIG. 10, respectively(Step 85). The field memory 103 receives the image data of one field from the image input unit 100 to temporarily store them. The zoom processing unit 104 zooms in the a reference field when it is zoomed out related to the sample field, and zooms out otherwise in accordance with an address generated by the sample address generating unit 105. To be more specific, the zoom processor 104 maps the pixels in the reference field to their respective addresses designated by the sample address control unit 105, which are referred to as the sample address hereinafter and the definition will be given later. During the mapping, some pixels are eliminated while the reference field is zoomed out, and some are interpolated when zoomed in. In this way, the zoom processing unit 104 resumes the reference field size to the sample field size, keeping a correlation between the sample and reference fields when the latter is zoomed relative to the former. This process will be explained more in detail by referring to FIGS. 11 through 19. Fig. 11 is a block diagram depicting a structure of the zoom processing unit 104. The zoom processing unit 104 comprises a work memory 104a, an interpolation value computing unit 104b, and a reading/writing (R/W) control unit 104c. The work memory 104a has a memory capacity of one field and stores data necessary for the zoom process. The interpolation value computing unit 104b computes a pixel value to be interpolated by referring to neighboring pixels during the zoom-in process. The R/W control unit 104c reads out pixels from the field memory 103, and writes them into their respective sample addresses in either the field memory 103 or work memory 104a in two steps: vertically and horizontally. For example, the R/W control unit 104c reads out a pixel P located at (x, y) in the reference field, and stores the pixel P at its vertical sample address (x, [a v y+b v ]) in the work memory 104a or field memory 103 first, thus zooming the pixel P vertically. Note that a value in the brackets [ ] has only an integer like Gauss' notation: [1.245] will be 1, [2.899] will be 2, and [3.555] will be -4. Then, the R/W control unit 104c reads out the pixel P and stores the pixel P at its horizontal sample address ([a h +b h ], y) in the work memory 104a or field memory 103 again, thus zooming the pixel P horizontally this time. The R/W control unit 104c also stores an interpolation value computed by the interpolation computing unit 104b when the reference field is zoomed out. The R/W control unit 104c also interpolates pixel value for eliminated pixels when the reference field is zoomed out: it uses a value having a larger coefficient to the sample field, such as a pixel value on the adjacent line or a corresponding pixel value in the sample field. The sample address control unit 105 outputs a sample address to the zoom processor 104 in accordance with the zoom coefficients computed by the zoom coefficient computing unit 102 when the reference field is zoomed relative to the sample field. The sample address referred herein represents vertical and horizontal addresses that respectively map to (x, y) in the reference field, i.e., (x, V v (y)) and (V h (x), y). FIG. 12 is a flowchart detailing the operation of the zoom processing unit 104 and sample address control unit 105. The sample address control unit 105 receives the zoom coefficients from the zoom coefficient computing unit 102(Step 121), and determines whether the reference field is zoomed in or out relative to the sample field(Steps 122, 123). When the reference field is zoomed in relative to the sample field, the sample address control unit 105 activates the zoom processing unit 104 which accordingly zooms out the reference field vertically and horizontally by eliminating some pixels(Step 124). On the other hand, when the reference field is zoomed out relative to the sample field, the sample address control unit 105 activates the zoom processing unit 104 which accordingly zooms in the reference field vertically and horizontally by interpolating some pixels(Step 125). When the sample address control unit 105 receives a 0-zoom coefficient, the sample address control unit 105 does not activate the zoom processing unit 104 and ends the operation. Step 124, where the reference field is zoomed out, will be described more in detail by referring to FIGS. 13A, 13B, 14A, and 14B. FIGS. 13A, 13B explain a principle of how the reference field will be zoomed out with the vertical zoom coefficients. In FIG. 13A, y 1 , y 2 , y 3 , y 4 are vertical addresses, [a v (y 1 )+b v ], [a v (y 2 )+b v ], [a v (y 3 )+b v ], [a v (y 4 )+b v ] are their respective sample addresses as a result of the vertical zoom-out process. Since the sample addresses have only integers, some of them may have a same value. Assume that [a v (y 2 )+b v ], [a v (y 3 )+b v ] have a same value, then the pixels on a line at y 2 in the reference field are written into [a v (y 2 )+b v ], and the pixels on another line at y 3 are written into [a v (y 3 )+b v ]; the pixels on the y 3 lines are written onto those of the y 2 line, eliminating the pixels on the y 2 line. Thus, the reference field in FIG. 13A is zoomed out as shown in FIG. 13B. Since the ratio of elimination is directly proportional to the zoom coefficients, the reference field size is resumed to the sample field size as a result. The reference field is zoomed out with the horizontal zoom coefficients in the same way. However, the above-described process eliminates all the pixels on one line(pixels 10, 11, ..., 19), and for this reason, the edge of the image or a fine line may not be reproduced clearly, deteriorating image quality. To solve this problem, the above-described process is improved in this embodiment, which will be explained by referring to FIGS. 14A, 14B. In the improved process, the pixels are eliminated dependent on whether their addresses have even or odd numbers, so that they are eliminated in zig-zag as shown in FIG. 14A, where the eliminated pixels are shaded. Assume that [a v (y 2 )+b v ], [a v (y 3 )+b v ] have a same value, then the pixels on a line at y 2 in the reference field are written into [a v (y 2 )+b v ], but unlike the principle process, the pixels on another line at y 3 are written into [a v (y 3 )+b v ] only when their address numbers are odd, eliminating the pixels on two lines in zig-zag. Thus, the reference field in FIG. 14A is zoomed out as shown in FIG. 14B. The reference field is zoomed out with the horizontal zoom coefficients in the same way. The image quality in the reproduced image can be upgraded by the zig-zag pixel elimination. The above process will be detailed by the flowcharts in FIGS. 15, 16. The sample address control unit 105 initializes both the pixel addresses (x, y) in the reference field to 0(Steps 1501, 1052), and determines whether the horizontal address x has an even or odd number(Step 1503). When x has an odd number, the sample address control unit 105 computes a sample address in the zoomed-out reference field, (x, [a v y+b v ]), using the vertical coefficients received from the zoom coefficient computing unit 102. Then, the sample address control unit 105 sends the sample address thus computed and the original address (x, y) to the zoom processing unit 104(Step 1504). Accordingly, the zoom processing unit 104 reads out the pixel data at (x, y) from the field memory 103(Step 1505), and writes the pixel data at the sample address (x, [a v y+b v ]) in the field memory 103(Step 1506), notifying the sample address control unit 105 when the writing is completed. Subsequently, the sample address control unit 105 checks whether x is the last address on the line, indicated as HPIX-1 in FIG. 8B. If not, the sample address control unit 105 increments x to return to Step 1503. When x has an even number, the sample address control unit 105 checks whether the vertical sample address [a v y+b v ] matches with [a v (y-1)+b v ] which is the vertical sample address for a preceding line y-1. When they do not match, no pixels are eliminated(Step 1511), and the sample address control unit 105 proceeds to Steps 1512 through 1514, which respectively correspond to 1504 through 1506. On the other hand, when [a v y+b v ] and [a v (y-1)+b v ] match, the sample address control unit 105 skips Steps 1512 through 1514 and proceeds to Step 1507, so that the pixels are eliminated in zig-zag as shown in FIG. 14B. When x reaches the last address on the line(Step 1507), the sample address control unit 105 checks whether y is the last address indicated as VLINE-1 in FIG. 8B. If not, the sample address control unit 105 increments y to return to Step 1502; otherwise, it completes the vertical zoom-out process. Accordingly, the sample address control unit 105 and zoom processing unit 104 complete the horizontal zoom-out process in the same way as the vertical zoom-out process by proceeding to Steps 1515 through 1528. Further, the sample address control unit 105 interpolates the pixels for the pixel line eliminated as the result of the zoom-out process(Step 1529). For example, an adjacent pixel line or a corresponding pixel line on the sample field is interpolated to keep a correlation between the sample field and resulting zoomed-out reference field relative to the eliminated pixel line. Next, Step 125, where the reference field is zoomed in, will be described more in detail by referring to FIGS. 17A, 17B. In the drawing, y 1 , y 2 , y 3 , y 4 are vertical addresses in the reference field, and [a v (y 1 )+b v ], [a v (y 2 )+b v ], [a v (y 3 )+b v ], [a v (y 4 )+b v ] are their respective sample addresses as a result of the vertical zoom-in process. Since the sample addresses have integers only, they may not be sequential, and an address may be larger than its preceding address by more than two, causing the zoomed-in field to have blanks(missing pixels) on the vertical pixel line. Assume that [a v (y 2 )+b v ] is larger than [a v (y 1 )+b v ] by two, then the reference field shown in FIG. 17A is zoomed in as shown in FIG. 17B. Accordingly, the zoom processing unit 104 interpolates the pixels for the blanks. Since the ratio of interpolation is directly proportional to the zoom coefficients, the reference field size is resumed to the sample field size as a result. The reference field is zoomed in with the horizontal zoom coefficients in the same way. The above process will be detailed in the flowcharts in FIGS. 18, 19. The sample address control unit 105 initializes a vertical pixel address y in the reference field to 0(Step 1801), and checks whether its sample address [a v y+b v ]+1 matches with [a v (y-1)+b v ] which is a sample address of a preceding line (y-1)(Step 1802); it checks whether there is any blank on the pixel line in the zoomed-in reference field. When they match(no blanks checked), the sample address control unit 105 initializes the horizontal pixel address x to 0(Step 1803), and computes a vertical sample address, (x, [a v y+b v ]), using the vertical zoom coefficients. Then, the sample address control unit 105 outputs the sample address thus computed with (x, y) to the zoom processing unit 104(Step 1804). Accordingly, the zoom processing unit 104 reads out pixel data at (x, y) from the field memory 103(Step 1805), and writes the pixel data in the work memory 104a at the sample address(x, [a v y+b v ])(Step 1806), notifying the sample address control unit 105 when the writing is completed. Then, the sample address control unit 105 increments x and returns to Step 1804 if x is not the last address indicated as HPIX-1 in FIG. 8B(Step 1807). The sample address control unit 105 repeats Steps 1804 through 1806 until x reaches the last address, writing all the pixels on one line into the work memory 104a. On the other hand, when [a v y+b v ] and [a v (y-1)+b v +1] do not match(blanks checked), the sample address control unit 105 initializes the horizontal address x to 0(Step 1809), and computes a sample address, (x, [a v y+b v ]), using the vertical zoom coefficients. Then, the sample address control unit 105 outputs the sample address thus computed and (x, y) to the zoom processing unit 104(Step 1810). Accordingly, the zoom processing unit 104 reads out the pixel data at (x, y) from the field memory 103(Step 1811), and writes the pixel data at the sample address (x, [a v y+b v ]) in the work memory 104a(Step 1812), notifying the sample address control unit 105 when the writing is completed. Subsequently, the sample address control unit 105 outputs the address to be interpolated, (x, [a v y+b v ]-1), while sending an interpolation command to the interpolation value computing unit 104b(Step 1813). Accordingly, the interpolation value computing unit 104b computes the pixel data to be interpolated based on reference pixels(Step 1814); in this embodiment, two adjacent pixels, (x, [a v y+b v ]), (x, [a v y+b v ]-2), are the reference pixels and the interpolation value is the average of the reference pixels. Accordingly, the R/W control unit 104c writes the interpolation data thus computed into (x, [a v y+b v ]-1) designated by the sample address control unit 105(Step 1815). The sample address control unit 105 repeats Steps 1810 through 1817 until x reaches the last address, writing one pixel line and interpolating the preceding line into the work memory 104a. When x reaches the last address on the line(Step 1818), the sample address control unit 105 checks whether y reaches the last address indicated as VLINE-1 in FIG. 8(Step 1818). If not, the sample address control unit 105 increments y to return to Step 1802. When y reaches the last address, the sample address control unit 105 ends the vertical zoom-in process. Subsequently, the sample address control unit 105 and zoom processing unit 104 carry out the horizontal zoom-in process in the same way by proceeding to Steps 1820 through 1838. POST-DECODING PROCESSING UNIT 2 The post-decoding processing unit 2 zooms in the reference field when it was zoomed out in the pre-coding processing unit 2, and zooms out when zoomed in after their coded data have been decoded. Hereinafter, the decoded reference field is referred to simply as to the decoded field. As shown in FIG. 5, The post-decoding processing unit 2 comprises a decoded data input unit 200, a field memory 201, a zoom coefficient memory unit 202, a zoom processing unit 203, a sample address control unit 204, a switch unit 205, an output terminal 206, and a zoom coefficient input unit 207. The decoded data input unit 200 receives the field data decoded by the decoding unit 7 shown in FIG. 2. The zoom coefficient input unit 207 receives the zoom coefficients read out from the recording medium 5 by the readout unit 6. Note that the zoom coefficients are entered at the same timing when the corresponding decoded field data are entered in the decoded data input unit 200. The zoom coefficient memory unit 202 stores the zoom coefficients temporarily. The zoom processing unit 203 zooms in the decoded field when it was zoomed out in the pre-coding process, and zooms out when zoomed in based on the address generated by the sample address control unit 204. The zoom processing unit 203 comprises a work memory 203a, an interpolation value computing unit 203b, a R/W control unit 203c, which are not illustrated. The sample address control unit 204 determines whether the decoded field must be zoom in or out with the zoom coefficients from the zoom coefficient memory unit 202; if 0-zoom coefficients are entered for the decoded field data, no zoom process will be carried out. Further, the sample address control unit 204 outputs the sample address when the decoded field in the field memory 201 was zoomed during the pre-coding process based on the zoom coefficients stored in the zoom coefficient memory unit 202. The sample address referred herein represents vertical and horizontal addresses that respectively map to (x, y) in the decoded field as a result of the zoom process, i.e., (x, -a v (y)-b v ) and (-a h (x)-b v , y). FIG. 20 is a flowchart detailing the zoom process of the zoom processing unit 203 and sample address control unit 204. The sample address control unit 204 receives the zoom coefficients from the zoom coefficient memory unit 202(Step 2001), and checks whether the decoded field was zoomed in or out in the pre-coding process(Steps 2002, 2003). When the decoded field was zoomed out, the sample address control unit 204 activates the zoom processor 203 which accordingly zooms in the decoded field vertically and horizontally by interpolating some pixels(Step 2004). When the decoded field was zoomed in, the sample address control unit 204 activates the zoom processor 203 which accordingly zooms out the decoded field vertically and horizontally by eliminating some pixels(Step 2005). The sample address control unit 204 does not activate the zoom processor 203 when it has received a 0-zoom coefficient. Step 2004, where the decoded field is zoomed in, is explained more in detail by referring to FIGS. 13C, 13D, 14C, 14D. FIGS. 13C, 13D explain a principle of how the decoded field is zoomed in with the vertical zoom coefficients. In FIG. 13C, y 1 , y 2 , y 3 , y 4 are the vertical addresses, and [-a v (y 1 )-b v ], [-a v (y 2 )-b v ), [-a v (y 3 )-b v ], [-a v (y 4 )-b v ] are their respective vertical sample addresses as a result of the zoom-in process. Since the sample addresses have integers only, they may not be sequential, and an address may be larger than its preceding address more than two. Assume that [-a v (y 2 )-b v ] is larger than [-a v (y 1 )-b v ] by two. Then, the decoded field shown in FIG. 13C is zoomed in as shown in FIG. 13D, leaving one blank pixel line, and the blank pixel line is interpolated to complete the zoomed-in process. Since the zoom-in ratio is given by inverse functions relative to the linear functions in Equations (1), (2), the decoded field size is resumed to its original size, or the reference field size before it was zoomed out in the pre-coding process. The decoded field is zoomed in with the horizontal zoom coefficients in the same way. Like in the pre-coding process, the above zoom-in process is improved, which will be explained by referring to FIGS. 14C, 14D. Assume that [-a v (y 2 )-b v ] is larger than [-a v (y 1 )-b v ] by two. Then, the sample address control unit 204 outputs a sample address [-a v (y 2 -1)-b v ]+2 (=[-a v (y 1 )-b v ]+2) for the vertical address y 2 when x has an odd number, and a sample address [-a v (y 2 -1)-b v ]+1 (=[-a v (y 1 )-b v ]+1) when even number. Under these conditions, the zoom processing unit 203 writes the pixels on a line at y 2 into the above sample addresses into the work memory 203a depending on their address numbers. As a result, the pixels are written in zig-zag, ( 20 , 11 , 22 , 13 , ..., 28 , 19 ), as shown in FIG. 14D within circles. Further, the sample address control unit 204 outputs the pixel address for the zig-zag blanks, while outputting an interpolation command to the interpolation value computing unit 203b, so that it computes the interpolation value. Accordingly, the zoom processing unit 203 writes the interpolation value thus computed into the sample addresses for all the blanks in zig-zag, ( 10 , 21 , 12 , 23 , ···, 18 , 29 ) as shown in FIG. 14D in shade, completing the zoomed-in process. The above process will be detailed by flowcharts in FIGS. 21, 22. The sample address control unit 204 initializes the pixel addresses (x, y) in the decoded field to 0(Steps 2101, 2102), and checks whether x has an even or odd number. When x has an odd number, the sample address control unit 204 computes the sample address in the zoomed-in decoded field, (x, [-a v y-b v ]), with the vertical zoom coefficients. Then, the sample address control unit 204 outputs the sample address with (x, y) to the zoom processing unit 203(Step 2108). Accordingly, the zoom processing unit 203 reads out the pixel data at (x, y) from the field memory 201(Step 2109), and writes the pixel data in the sample address(x, [-a v y-b v ]) in the work memory 203a(Step 2110), notifying the sample address control unit 204 when the writing is completed. Accordingly, the sample address control unit 204 increments x to return to 2101 when x is not the last address indicated as HPIX-1 in FIG. 8B(Step 2112). When x has an even number, the sample address control unit 203 checks whether [-a v y-b v ] matches with [-a v (y-1)-b v +2] which is a value computed by adding two to a sample address in the zoomed-in decoded field for a preceding line (y-1)(Step 2104). When they match, the sample address control unit 204 computes a sample address for the preceding line (y-1) computed by adding one to (x, [-a v y-b v ]). Then, the sample address control unit 204 outputs to the sample address and (x, y) to the zoom processing unit 203(Step 2105). Accordingly, the zoom processing unit 203 reads out the pixel data at (x, y) from the field memory 201(Step 2106), and writes the pixel data at the sample address (x, [-a v y-b v ]) in the work memory 203a(Step 2107), leaving the zig-zag blanks in the zoomed-in decoded field. When [-a v y-b v ] and [-a v (y-1)-b v +2] do not match, the sample address control unit 204 skips Steps 2105 through 2107 to proceeds to Step 2108 through 2110 as was explained in the above. The sample address control unit 204 checks whether y reaches the last address on one line within the decoded field(Step 2111). If not, the sample address control unit 204 increments y and return to Step 2102; otherwise, the sample address control unit 204 checks whether x is the last address or not(Step 2113). If not, the sample address control unit 204 increment x to return to Step 2101 until x reaches the last address, leaving the zig-zag blanks in the vertical zoom-in field. Then, the sample address control unit 204 initializes (x,y) to 0(Steps 2115, 2116), and checks whether [-a v y-b v ] matches with [-a v (y-1)-b v ]+2 which is the value computed by adding two to the sample address of the preceding line (y-1) in the zoomed-in decoded field. When [-a v y-b v ] and [-a v (y-1)-b v ]+2 match, the sample address control unit 204 further checks whether horizontal addresses in the blanks have even or odd numbers(Step 2118). When x has an odd number, the sample address control unit 204 computes the sample address of the preceding line (y-1) in the zoomed-in decoded field, by adding one to (x, [-a v y-b v ]). Then, the sample address control unit 204 outputs the sample address to the zoom processing unit 203 while sending an interpolation command to the interpolation value computing unit 203b(Step 2119). Accordingly, the interpolation value computing unit 203b computes the pixel data to be interpolated by referring to the reference pixels(Step 2120): as has been explained, the interpolation data is the average of the two adjacent pixels(x, [a v y+b v ]), (x, [a v y+b v ]-2). The zoom processing unit 203 writes the interpolation value thus computed into the work memory 203a at the sample address (x, [-a v y-b v ]+1)(Step 2121). When x has an even number, the sample address control unit 204 proceeds to Steps 2124 through 2126 which correspond to Steps 2119 through 2126, respectively. However, the sample address control unit 204 outputs (x, [-a v y-b v ]+2) instead of (x, [-a v y-b v ]+1). When [-a v y-b v ] and [-a v (y-1)-b v ]+2 do not match, the sample address control unit 204 skips to Step 2122; for there is no blank to be interpolated. The sample address control unit 204 and zoom processing unit 203 repeats the above steps until both x, y reach their respective last addresses to write the interpolation value in all the zig-zag blanks, completing the vertical zoom-in process(Steps 2122, 2123, 2127, 2128). The horizontal zoom-out process, shown in FIG. 22, is carried out in the same way, and the explanation thereof is omitted. Step 2005, where the decoded field is zoomed out, will be explained more in detail by referring to FIGS. 17C, 17D. In FIG. 17C, y 1 , y 2 , y 3 , y 4 are vertical addresses, and [-a v (y1)-b v ], [-a v (y 2 )-b v ], [-a v (y 3 )-b v ], [-a v (y 4 )-b v ] are their respective sample addresses as a result of the vertical zoomed-in process. Since the sample addresses have integers only, some may have a same value. Assume that [-a v (y 2 )-b v ], [-a v (y 3 )-b v ] have the same value. Then, the pixels on line at y 2 are written into the sample address [-a v (y 2 )-b v ], and also the pixels on line at y 3 are written into the sample address [-a v (y 3 )-b v ]: the pixels on the y 3 line are written onto those on the y 2 line, eliminating the y 2 line. Since the ratio of elimination is directly proportional to the zoom coefficients, the reference field zoomed-in at the pre-coding process is zoomed out to its original size as shown in FIG. 17D. The above process will be detailed by a flowchart in FIG. 23. The sample address control unit 204 initializes (x, y) on the decoded field to 0(Steps 2301, 2302), and computes the vertical sample address (x, [-a v y-b v ]) using the vertical zoom coefficients stored in the zoom coefficient memory unit 202, outputting the sample address and (x, y) to the zoom processing unit 203(Step 2303). The zoom processing unit 203 reads out pixel data at (x, y) from the field memory 201(Step 2304), and writes the pixel data into the field memory 203a at the sample address (x, [-a v y-b v ](Step 2305), notifying the sample address control unit 204 when the writing is completed. Accordingly, the sample address control unit 204 increments x to return to Step 2303 when x is not the last address(Step 2307). When x is the last address, the sample address control unit 204 checks whether y is the last address(Step 2308), and returns to Step 2129 until y reaches the last address(Step 2309), completing the vertical zoom-out process. Subsequently, the sample address control unit 204 and zoom processing unit 203 carry out the horizontal zoom-out process in Step 2310 through 2317 in the same way. In the foregoing embodiment, the pixels are eliminated in zig-zag; however, other elimination methods are applicable on the condition that they do not eliminate vertically nor horizontally adjacent pixels. FIG. 24 shows an example of other methods, where three pixel lines make up a set and pixels that are not adjacent each other within the set are eliminated. In this case, a step where the vertical address is divided by 3 to check a reminder is added instead of Steps 1503, 1507 in FIG. 15. The field group does not necessarily comprise four fields as shown in FIG. 6, and it may comprise at least two fields. However, making the field group with four fields is most preferable when taking into account a hardware size, processing time, and coding efficiency in the pre-coding process. Any field in the field group may be the sample field; it is preferable to choose the most zoomed-in field in the field group. Because by so doing, the edge or finesse of the pixel line will be clearly reproduced. This is because the pre-coding processing unit 1 only has to zoom the reference field while interpolating pixel data, and the post-decoding processing unit 2 only has to zoom out the reference field, losing any image data along all the processes. FIG. 25 shows a structure of the pre-coding processing unit 1 in the above alternative case, which is identical with the one shown in FIG. 4 except that a sample field determining unit 301 determines the most zoomed out field in the field group whose four fields are respectively stored in field memories 303-306 as the sample field, and that the sample address control unit 105 is omitted. The sample address control unit 105 is omitted because no reference field will be zoomed out in the pre-coding process. Although the present invention has been fully described by way of example with reference to the accompanying drawings, it is to be noted that various changes and modification will be apparent to those skilled in the art. Therefore, unless otherwise such changes and modifications depart from the scope of the present invention, they should be construed as being included therein.

Claims: A method of coding image data with coefficients between fields by increasing the coefficients prior to coding, the method comprising the steps of: (1) detecting a motion vector in a reference field to a sample field to check whether the reference field is zoomed in or out relative to the sample field, data of the reference field being coded based on the sample field; (2) zooming out (S124) the reference field when the reference field is zoomed in relative to the sample field, and zooming in (S125) the reference field when the reference field is zoomed out relative to the sample field according to the motion vector; and (3) coding the reference field after the reference field has been zoomed according to the motion vector in the second step. The method of Claim 1, wherein both the sample and reference fields comprise a set of alternative scan lines in case of an interlace display, and comprise one image's data otherwise. The method of Claim 1, wherein the first step includes the substep of checking a group consisting of a predetermined number of sequential fields to select a most zoomed-in field in the group as the sample field. The method of Claim 3, wherein a first field in the group is the sample field. The method of Claim 3, wherein the predetermined number is 4. The method of Claim 1, wherein the reference field is zoomed out by eliminating pixels that are not adjacent in one of a vertical direction and a horizontal direction in the second step. The method of Claim 6, wherein pixels in one line and one of a vertically and a horizontally adjacent line are eliminated in zig-zag in the second step. The method of Claim 6, wherein pixels are interpolated with a reference to neighboring pixel data when the reference field is zoomed in in the second step. The method of Claim 6, wherein pixels are interpolated with a reference to corresponding pixel data in an adjacent field within the group in the second step. The method of Claim 1, wherein the reference field is zoomed according to a direction and a size of the motion vector in the second step. The method of Claim 10, wherein the first step further includes the substep of checking whether the reference field is zoomed in or out relative to the sample field based on a direction of the motion vector. The method of Claim 11, wherein the second step includes the substeps of: generating (S1504, S1512) a second pixel address in a zoomed reference field according to the size and direction of the motion vector, the second pixel address mapping to a first pixel address in the reference field; and reading out (S1505, S1513) pixel data at the first pixel address from the reference field to write (S1506, S1514) the pixel data at the second pixel address. The method of Claim 12, wherein the second pixel address is generated in such a way that vertically and horizontally adjacent pixels are not eliminated when the reference field is zoomed out in the pixel-address-generating substep. The method of Claim 13, wherein the second pixel address is generated in such a way that pixels are eliminated in zig-zag in one pixel line and one of a vertically and a horizontally adjacent pixel line. The method of Claim 12, wherein a third pixel address is generated (S1813, S1832) when the reference field is zoomed in in the pixel-address-generating substep, the third pixel address specifying an address where pixel data are to be interpolated, and wherein the pixel data are interpolated (S1815, S1834) at the third pixel address in the read/write substep. The method of Claim 15, wherein pixels are interpolated with a reference to neighboring pixel data when the reference field is zoomed in in the second step. The method of Claim 15, wherein pixels are interpolated with a reference to corresponding pixel data in an adjacent field within the group in the second step. The method of Claim 1, wherein the first step includes the substeps of: computing (S83, S85) zoom coefficients of an approximate equation based on the motion vector, which represent a first pixel address in the reference field and a second pixel address in a zoomed reference field, and wherein the reference field is zoomed according to a direction and a size of the motion vector in the second step. The method of Claim 18, wherein the first step further includes the substep of checking whether the reference field is zoomed in or out relative to the sample field based on a direction of the motion vector. The method of Claim 19, wherein the second step includes the substeps of generating (S1504, S1512) the first and second pixel addresses with the approximate equation; and reading out (S1505, S1513) pixel data at the first pixel address from the reference field to write (S1506, S1514) the pixel data at the second pixel address. The method of Claim 20, wherein the second pixel address is generated in such a way that vertically and horizontally adjacent pixels are not eliminated when the reference field is zoomed out in the pixel-address-generating substep. The method of Claim 21, wherein the second pixel address is generated in such a way that pixels are eliminated in zig-zag in one pixel line and one of a vertically and a horizontally adjacent pixel line. The method of Claim 22, wherein a third pixel address is generated (S1813, S1832) when the reference field is zoomed in in the pixel-address-generating substep, the third pixel address specifying an address where pixel data are to be interpolated, and wherein the pixel data are interpolated (S1815, S1834) at the third pixel address in the read/write substep. The method of Claim 23, wherein pixels are interpolated with a reference to neighboring pixel data when the reference field is zoomed in in the second step. The method of Claim 23, wherein pixels are interpolated with a reference to corresponding pixel data in an adjacent field within the group in the second step. The method of Claim 1, wherein the first step includes the substeps of: computing (S83, S85) zoom coefficients of an approximate equation based on the motion vector, which represent a first pixel address in the reference field and a second pixel address in a zoomed reference field; and generating (S1504, S1512) the first and second pixel addresses with the approximate equation; the second step includes the substeps of: reading out (S1505, S1513) pixel data at the first pixel address from the reference field to write the pixel data at the second pixel address; generating (S1813, S1832) a third pixel address when the reference field is zoomed in, the third pixel address specifying an address where pixel data are to be interpolated; interpolating (S1815, S1834) the pixel data at the third address; and the third step includes the substep of: coding image data generated by one of the substep of reading out and the substep of interpolating. A method of decoding coded data with zoom coefficients between fields when image data have been coded by a coding method which zooms out or in zoomed-in/out fields prior to coding, the method comprising the steps of: (1) decoding coded data into field data; (2) generating (S2105, S2108) a first pixel address in a decoded field and a second pixel address mapping to the first pixel address in a zoomed decoded field with the zoom coefficients; (3) reading out (S2106, S2109) pixel data at the first pixel address from the decoded field to write the pixel data at the second pixel address to zoom the decoded field; (4) generating (S2145, S2150) a third pixel address at which pixel data are interpolated when the decoded field is zoomed in; and (5) interpolating (S2147, S2152) the pixel data at the third pixel address. A coding apparatus for coding image data with coefficients between fields by increasing the coefficients prior to coding, the apparatus comprising: means (103) for temporarily storing a sample field; means (103) for temporarily storing a reference field which is to be coded based on the sample field; means (101) for detecting a motion vector in the reference field to the sample field to determine whether the reference field is zoomed in or out relative to the sample field; means (104) for zooming in the reference field when the reference field is zoomed out relative to the sample field, and for zooming out the reference field when the reference field is zoomed in relative to the sample field according to the motion vector; and means (108) for coding the reference field after it has been zoomed according to the motion vector. The apparatus of Claim 28, wherein both the sample and reference fields comprise a set of alternative scan lines in case of a interlace display, and comprise one image's data otherwise. The apparatus of Claim 29, wherein the detecting means (101) includes means for checking a group consisting of a predetermined number of sequential fields to select a most zoomed-in field in the group as the sample field. The apparatus of Claim 29, wherein a first field in the group is the sample field. The apparatus of Claim 30, wherein the predetermined number is 4. The apparatus of Claim 28, wherein the zooming means (104) zooms out the reference field by eliminating pixels that are not adjacent in one of a horizontal direction and a vertical direction. The apparatus of Claim 33, wherein the zooming means (104) eliminates pixels in one line and one of a vertically and horizontally adjacent line in zig-zag. The apparatus of Claim 33, wherein the zooming means (104) interpolates pixels by referring to neighboring pixel data when the zooming means (104) zooms in the reference field. The apparatus of Claim 33, wherein the zooming means (104) interpolates pixels by referring to corresponding pixel data in an adjacent field in the group. The apparatus of Claim 28, wherein the zooming means (104) zooms in the reference field according to a direction and a size of the motion vector. The apparatus of Claim 37, wherein the detecting means (101) further includes: means for checking whether the reference field is zoomed in or out relative to the sample field based on a direction of the motion vector. The apparatus of Claim 38, wherein the apparatus further includes: means (105) for generating a second pixel address in a zoomed reference field according to the size and direction of the motion vector, the second pixel address mapping to a first pixel address in the reference field; and the zooming means includes: means (104c) for reading out pixel data at the first pixel address from the reference field storage means to write the pixel data at the second pixel address. The apparatus of Claim 39, wherein the pixel-address-generating means (105) generates the second pixel address in such a way that vertically and horizontally adjacent pixels are not eliminated when the reference field is zoomed out. The apparatus of Claim 40, wherein the pixel-address-generating means (105) generates the second pixel address in such a way that pixels are eliminated in zig-zag in one pixel line and one of a vertically and a horizontally adjacent pixel line. The apparatus of Claim 39, wherein the pixel-address-generating means (105) generates a third pixel address when the reference field is zoomed in, the third pixel address specifying an address where pixel data are to be interpolated, and wherein the read/write means (104c) interpolates the pixel data at the third pixel address. The apparatus of Claim 42, wherein the read/write means (104c) interpolates pixels by referring to neighboring pixel data when the reference field is zoomed. The apparatus of Claim 42, wherein the read/write means (104c) interpolates pixels by referring to corresponding pixel data in an adjacent field within the group. The apparatus of Claim 28, wherein the apparatus further includes: means (102) for computing zoom coefficients of an approximate equation based on the motion vector, which represent a first pixel address in the reference field and a second pixel address in a zoomed reference field, and wherein the zooming means (104) zooms the reference field according to a direction and a size of the motion vector. The apparatus of Claim 45, wherein the detecting means (101) further includes: means for checking whether the reference field is zoomed in or out relative to the sample field based on a direction of the motion vector. The apparatus of Claim 46, wherein the apparatus further includes: means (105) for generating the first and second pixel addresses with the approximate equation; and the zooming means (104) includes: means (104c) for reading out pixel data at the first pixel address from the reference field to write the pixel data at the second pixel address. The apparatus of Claim 47, wherein the pixel-address-generating means (105) generates the second pixel address in such a way that vertically and horizontally adjacent pixels are not eliminated when the reference field is zoomed out. The apparatus of Claim 48, wherein the pixel-address-generating means (105) generates the second pixel address in such a way that pixels are eliminated in zig-zag in one pixel line and one of a vertically and a horizontally adjacent pixel line. The apparatus of Claim 49, wherein the pixel-address-generating means (105) generates a third pixel address when the reference field is zoomed in, the third pixel address specifying an address where pixel data are to be interpolated, and wherein the read/write means (104c) interpolates the pixel data at the third pixel address. The apparatus of Claim 50, wherein the read/write means (104c) interpolates pixels by referring to neighboring pixel data when the reference field is zoomed in. The apparatus of Claim 50, wherein the read/write means (104c) interpolates pixels by referring to corresponding pixel data in an adjacent field within the group. The apparatus of Claim 28, wherein the apparatus further comprises: means (102) for computing zoom coefficients of an approximate equation based on the motion vector, which represent a first pixel address in the reference field and a second pixel address in a zoomed reference field; means (105) for generating the first and second pixel addresses with the approximate equation; the zooming means (104) includes: means (104c) for reading out pixel data at the first pixel address from the reference field to write the pixel data at the second pixel address; means (104b) for generating a third pixel address when the reference field is zoomed in, the third pixel address specifying an address where pixel data are to be interpolated; means (104c) for interpolating the pixel data at the third address; and the coding means (108) codes image data generated by one of the read/write means (104c) and pixel-data-interpolating means (104c). An apparatus of decoding coded data with zoom coefficients between fields when image data have been coded by a coding method which zooms out or in zoomed-in/out fields prior to coding, the apparatus comprising: means (7) for decoding coded data into field data; means (201) for temporarily storing data of one decoded field; means (202) for temporarily storing the zoom coefficients associated with the decoded field data in the decoded-field-data storage means; means (204) for generating a first pixel address in the decoded field and a second pixel address with the zoom coefficients, the second pixel mapping to the first pixel address in a zoomed decoded field; means (203) for reading out pixel data at the first pixel address from the decoded-field-data storage means to write the pixel data at the second pixel address to zoom the decoded field; means (203) for generating a third pixel address at which pixel data are interpolated when the decoded field is zoomed in; and means (203) for interpolating the pixel data at the third pixel address.

Inventors: FUJIWARA YUJI, MATUDA TOYOHIKO, NISHINO MASAKAZU, YAMANE YASUHIKO, FUJIWARA, YUJI, MATUDA, TOYOHIKO, NISHINO, MASAKAZU, YAMANE, YASUHIKO
Applicants: MATSUSHITA ELECTRIC IND CO LTD, MATSUSHITA ELECTRIC INDUSTRIAL CO., LTD.
Application year: 1994
Main classification: H04N7
IPC codes: H04N7, G06T9