JP2010193398A - Image encoding device, and image encoding method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To simplify a configuration which inserts image data of a predetermined block per macro block. <P>SOLUTION: An image encoding device for dividing each frame of an inputted moving image into arbitrary block sizes and encoding the image for each block includes: a binarization means for binarizing each encoding element of the block to generate binarized data; a code length adding means for adding a binarized data code length to the binarized data; and a data selecting means for selecting the binarized data generated by the binarization means according to the code length of the binarized data or selecting I_PCM data as dummy data, so that the binarized data can be selected according to the code length of the binarized data generated from each frame of the inputted moving image or the I_PCM data inserted as dummy data can be selected. Thus, it becomes possible to simplify the configuration for inserting the I_PCM data per macro block. <P>COPYRIGHT: (C)2010,JPO&INPIT

Description

  The present invention relates to an image encoding device and an image encoding method. The present invention relates to a technique suitable for use in a moving image encoding apparatus such as H.264 / MPEG-4 AVC.

  As one of the moving image coding standards, MPEG-1, MPEG-2 and MPEG-4, which are ISO / IEC international standards, are widely used. In recent years, ITU-T H.264 (or ISO / IEC MPEG-4 AVC) has been recommended as a standard having higher encoding efficiency, and its practical application is rapidly progressing. Hereinafter, a conventional example of an encoding apparatus compatible with the H.264 standard will be described with reference to FIG.

  In FIG. 7, reference numeral 700 denotes an image encoding device. An image memory 701 temporarily stores a frame to be encoded and a reference frame used for motion compensation. A motion detection unit 702 detects a motion vector in units of macroblocks. A deblocking filter 703 is used to reduce block noise in difference data between the encoding target image and the reference image. Reference numeral 704 denotes a motion compensation unit that obtains a difference between the encoding target image and the reference image according to the motion vector obtained by the motion detection unit 702. Reference numeral 705 denotes an integer conversion unit that converts data of a predetermined macroblock size into a frequency space. As the orthogonal transform method, discrete cosine transform was used up to the MPEG-4 standard. However, in the decoder, there is a problem that a conversion error at the time of inverse transform is accumulated by calculation with finite precision. there were. In order to solve this problem, in the H.264 standard, in principle, integer conversion that does not cause a conversion error is employed.

  A quantization unit 706 quantizes coefficient data obtained by the integer conversion performed by the integer conversion unit 705. Reference numeral 708 denotes an inverse quantization unit which performs an inverse quantization process for a local decoded image. Reference numeral 707 denotes an inverse integer conversion unit that performs an inverse integer conversion process.

  On the other hand, the coefficient data quantized by the quantization unit 706 is sent to an entropy encoding unit 710 called CABAC (Content Adaptive Binary Arithmetic Coding). As components of CABAC, a binarization unit 711 and an arithmetic encoding unit 712 are illustrated.

  The binarization unit 711 performs binarization processing on all coding elements (called syntax elements) such as quantized coefficient data, motion vectors, and various types of information attached to macroblocks. . For the binarization method, different variable length code tables are defined for each syntax element.

  The arithmetic encoding unit 712 encodes the data binarized by the binarizing unit 711 by sequential processing of one bit at a time. Therefore, the total processing time of the macroblock varies depending on the number of input binary data bits. In addition, it is a feedback type algorithm that adaptively improves the encoding efficiency by reflecting the processing result of each bit in the subsequent bit encoding process, so that it is difficult in principle to process a plurality of bits collectively. There are features.

  Reference numeral 709 denotes a quantization step control unit that performs code amount control in units of pictures. In order to perform quantization step control, the amount of code already generated for each macroblock is observed in the picture encoding process. Then, the quantization step control is realized by updating the quantization step as needed while observing the difference from the total generated code amount of the target picture.

  However, as described above, in the case of the conventional encoding device 700, the arithmetic encoding performed by the arithmetic encoding unit 712 varies depending on the number of bits of input (= binarized data). End up. For this reason, since it is difficult to estimate in advance the worst value of the processing time in units of macroblocks, there is a possibility that the total processing time of the entire picture may be broken. Also, the H.264 recommendation stipulates that if the maximum code length of one macroblock is 4: 2: 0 sampling, it must be within 3200 bits.

This is to prevent the arithmetic decoding processing load from becoming excessively high in the decoder and causing the decoding process to fail. Although this is a very rare case, when the macroblock code length after CABAC processing exceeds the above-mentioned 3200 bits, processing for replacing this with the image data itself is performed. The macroblock type in this case is called I_PCM. Specifically, the size of the macroblock in the I_PCM mode is 3072 bits (fixed) according to (Equation 1) below.
64 (pixel / block) x 6 (block) x 8 (bit) = 3072 bits (Equation 1)

  At this time, there is no particular restriction on the content of the image to be replaced, but it is desirable to use a local decoded image instead of the original image in consideration of parallel processing with intra-frame prediction processing of adjacent macroblocks. Therefore, in order to perform this processing, it is necessary to save all frames that have been encoded and are not used as reference frames for motion compensation for I_PCM data replacement.

  In order to protect the excess of the maximum code amount per macroblock using such a mechanism, a method is disclosed in which the code amount is determined based on a certain threshold value from information before entropy coding and replaced with I_PCM data. (For example, refer to Patent Document 1).

JP 2007-166039 A

  In Patent Document 1, the code length after arithmetic code processing for each macroblock is estimated from the transform coefficient, and when the estimated value exceeds a predetermined threshold, the I_PCM mode is unconditionally selected. ing.

  However, in CABAC processing, the arithmetic code processing time in units of macro blocks varies depending on the code length of the binarized data, so pipeline processing is performed in units of macro blocks and processing is guaranteed to be completed within a predetermined time. Difficult to do.

  In order to solve such a problem, as shown in FIG. 8, a method of accumulating binarized output for one frame (or one field) and delaying only arithmetic coding in units of frames can be considered. It is done.

  In the example of FIG. 8, a frame memory 801, a code processing unit (motion compensation / quantization unit) 802, a binarization unit 803, a binary buffer 804, a selector 805, and an arithmetic encoding unit 806 are provided. Then, binary data for one frame of frame n is buffered by the binary buffer 804, and arithmetic coding unit 806 collectively performs arithmetic coding during the period of frame (n + 1).

  In this way, even if the processing time is excessive for a specific macroblock, the processing time can be smoothed for the entire frame, so that processing of all macroblocks can be completed within the frame time. It becomes easy.

  At this time, as described above, when the arithmetic code amount in units of macroblocks exceeds a specific value (3200 bits in 4: 2: 0 subsampling), it must be replaced with the I_PCM mode. Since it is desirable that the I_PCM data in this case is a locally decoded image, the image of this frame is eventually stored in the frame memory 801 even if it is not used as a reference frame in the subsequent processing, and if necessary, Must be inserted as I_PCM. Therefore, this method also has a disadvantage that a redundant memory area must be secured.

  In addition, in the method of forcibly setting the I_PCM mode in advance by determining the distribution status of the transform coefficients and the binary code length, even if the arithmetic code amount does not actually exceed a specific value, the I_PCM mode is set. there is a possibility. For this reason, there has been a problem that the output code amount is not optimal.

  The present invention has been made in view of the above-described problems, and an object of the present invention is to simplify the configuration for inserting image data of a predetermined block in units of macroblocks.

  An image encoding apparatus according to the present invention is an image encoding apparatus that divides each frame of an input moving image into arbitrary block sizes and performs encoding for each block, and each encoding element of the block is divided into two. Binarizing means for binarizing and generating binarized data; code length adding means for adding the code length of the binarized data generated by the binarizing means to the binarized data; and the binary Data insertion means for adaptively inserting image data of a predetermined block according to the code length of the digitized data.

  The image coding method of the present invention is an image coding method in which each frame of an input moving image is divided into arbitrary block sizes and coding is performed for each block, and each coding element of the block is divided into two. A binarization step for binarizing and generating binarized data, a code length adding step for adding the code length of the binarized data generated in the binarization step to the binarized data, and the binarization And a data insertion step of adaptively inserting image data of a predetermined block according to the code length of the digitized data.

  A computer program according to the present invention is a computer program that causes a computer to execute an image encoding method for dividing each frame of an input moving image into arbitrary block sizes and performing encoding for each block. A binarization step for binarizing encoding elements to generate binarized data, and a code length adding step for adding the code length of the binarized data generated in the binarization step to the binarized data And a data insertion step of adaptively inserting a predetermined block of image data in accordance with the code length of the binarized data.

According to the present invention, the image data of the predetermined block is adaptively inserted according to the code length of the binarized data generated from each frame of the input moving image. It is possible to simplify the configuration for inserting in block units. As a result, even if arithmetic coding processing is performed with a delay through the buffer, it is not necessary to equip a frame memory for storing I_PCM.
In addition, according to another feature of the present invention, it is possible to further optimize the I_PCM mode determination, and ultimately to reduce a wasteful code amount.

It is a block diagram which shows the 1st Embodiment of this invention and shows the structural example until it binarizes an input image signal. It is a block diagram which shows the 1st Embodiment of this invention and shows the structural example which arithmetically encodes the binarized data and outputs it. It is a figure which shows the 1st Embodiment of this invention and shows the example of a binary code data sequence. It is a figure which shows the 1st Embodiment of this invention and shows the detailed example of a binary code data sequence. It is a flowchart which shows the 1st Embodiment of this invention and demonstrates the process sequence to a binarization process part. It is a flowchart which shows the 1st Embodiment of this invention and demonstrates the process sequence of an arithmetic code | symbol part. It is a block diagram explaining the structural example of the conventional image coding apparatus. It is a block diagram explaining the example which provided the binary data frame delay buffer. It is a figure which shows the 2nd Embodiment of this invention and shows the example at the time of forming a format different from a 1st format.

(First embodiment)
Hereinafter, a first embodiment of the present invention will be described with reference to the accompanying drawings.
FIG. 1 is a block diagram illustrating a configuration example of an image encoding device 100 according to the first embodiment of the present invention.
In FIG. 1, reference numeral 101 denotes an image memory, which temporarily stores a moving image frame to be encoded and a reference frame used for motion compensation. A motion detection unit 102 detects a motion vector in units of macroblocks. Reference numeral 103 denotes a deblocking filter, which is used to reduce block noise in the difference data between the encoding target image and the reference image.

  A motion compensation unit 104 obtains a difference between the encoding target image and the reference image in accordance with the motion vector obtained by the motion detection unit 102. An integer conversion unit 105 converts data of a predetermined macroblock size into a frequency space. As an orthogonal transform method, discrete cosine transform was used up to the MPEG-4 standard. However, the decoder has a problem that a conversion error at the time of inverse transform is accumulated by calculation with finite precision. It was. For this reason, in the H.264 standard, integer conversion that does not cause a conversion error in principle is employed.

  A quantization unit 106 quantizes coefficient data obtained by integer conversion in the integer conversion unit 105. Reference numeral 107 denotes an inverse quantization unit that performs inverse quantization processing for a local decoded image. Reference numeral 108 denotes an inverse integer conversion unit that performs an inverse integer conversion process. On the other hand, the coefficient data quantized by the quantization unit 106 is sent to the binarization unit 110. The binarization unit 110 binarizes each encoding element of the encoding target block to generate binarized data.

A code amount check unit 111 compares the code length of the binarized data with a predetermined value set in advance for each macroblock. The values to be compared will be described later. A byte aligner 112 adds a surplus bit as appropriate to binary data and performs byte alignment processing as binary data. The number of bits to be added is obtained by the following formula.
Number of additional bits = (binary data code length)% 8 (Expression 2)

  Reference numeral 113 denotes a header / footer adding unit that performs code length addition for adding binary data length and I_PCM addition presence / absence information to binarized data. Also, attribute information addition is performed to add attribute information indicating whether or not I_PCM data is inserted to each block. Reference numeral 115 denotes an I_PCM buffer, which stores I_PCM data for one macroblock subjected to local decoding processing in the course of encoding processing. Reference numeral 114 denotes a selector that performs an operation of adaptively inserting the I_PCM data stored in the I_PCM buffer 115 into the binary data to which the header / footer is added output from the header / footer adding unit 113. Reference numeral 116 denotes a binary buffer, which stores binary data for one frame like the binary buffer 804 shown in FIG.

FIG. 3 shows an example of the binary code data series of the present embodiment.
In FIG. 3, BLEN 301 is a binary code length in units of macroblocks, and BIN 302 is binary code data. F303 is an I_PCM flag for indicating whether or not I_PCM data is inserted after binary data. In I_PCM 304, pixel data for one macroblock is inserted.

FIG. 4 shows detailed data fields.
Reference numerals 401 and 402 denote BLEN fields, which indicate the BIN length with 16 bits. The code length of the macroblock is limited to 3200 bits. For this reason, it can be sufficiently expressed within 16 bits. 403 is BIN data, 404 is a stuffing bit, and an extra field is filled in byte units according to the above-described (Equation 2). In this embodiment, surplus data is appropriately added to the binarized data, and data alignment is performed so that the binarized data for each predetermined block is aligned in units of at least 8 bits.

  Reference numeral 405 denotes an I_PCM flag, which is set to “1” only when I_PCM data follows. In the case of FIG. 4, byte alignment processing is performed immediately before the I_PCM field by inserting 2 bits as stuffing bits. Reference numeral 406 denotes I_PCM data, which indicates that I_PCM data is inserted only in this macro block.

FIG. 2 shows the operation of the encoder after the binarization process in this embodiment.
Reference numeral 201 denotes a binary buffer, which corresponds to the binary buffer 116 in FIG. The binary code data read from the binary buffer 201 is sent to the header / footer detection unit (header / footer analyzer) 202, and the header / footer information added by the header / footer addition unit 113 in the previous stage is analyzed. Is done.

  In the header / footer detection unit 202, first, BLEN is acquired, and variable length coding processing is performed in the arithmetic coding unit 204 for each syntax element of the binary code according to the value (binary code length). Done. In this embodiment, encoding processing conforming to the ITU-T H.264 standard or the ISO / IEC 14496-10 (MPEG-4 Advanced Video Coding) standard is performed. The arithmetic code output output from the arithmetic encoding unit 204 is sequentially stored in the arithmetic code buffer 206. The output of the header / footer detection unit 202 is sent to the I_PCM extraction unit 203, and I_PCM is extracted.

  205 is a code amount checker for checking the binary code length, and checks whether the size of the total arithmetic code length output after the completion of the arithmetic code processing for one macroblock is 3200 bits or more. As a result of this check, if the size of the total arithmetic code length is 3200 bits or more, the selector 207 provided as the second data selection means selects the output of the I_PCM extraction unit 203. The subsequent I_PCM data is used as the final code output as it is, and the contents of the arithmetic code buffer 206 are discarded. Also, in this case, the prediction state of the arithmetic coding unit 204 (history information that has been adaptively learned in sequence according to the input) is all reset to the initial state in units of pictures.

  On the other hand, when the size of the output total arithmetic code length is 3200 bits or less, the selector 207 selects the content of the arithmetic code buffer 206 as the final output and checks the subsequent I_PCM flag. If “1” is detected as a result of this check, the subsequent I_PCM data is discarded. In this case, the I_PCM data is not actually read, and the buffer pointer may be advanced by a predetermined number of bytes (30: 2 in 4: 2: 0).

  Since the size of I_PCM is fixed as shown in (Equation 1) described above, it is not necessary to indicate the size in the binary data. Further, since the header / footer is byte-aligned, the header position of the next macroblock is easily searched. As described above, the data selected by the selector 207 is combined to generate the final code output data.

The above processing procedure will be described with reference to the flowcharts of FIGS.
FIG. 5 is a flowchart for explaining the processing procedure up to binary encoding.
When processing is started in step S501, binarization processing is performed in step S502. In step S503, the data binarized in step S502 is recorded in the binary buffer 116. Next, in step S504, a binary data code length (BLEN) is recorded as a header.

Next, in step S505, a code length comparison is performed to compare the binary data code length with a predetermined value (N) obtained experimentally in advance. Actually, the predetermined value N is calculated from the standard maximum value of 3200 bits and the coding efficiency of the arithmetic code. Through quantitative evaluation, the coding efficiency of arithmetic coding using a binary code as an input is measured to be about 70 to 80%. Therefore, if the predetermined value N gives a margin of + 10%,
N = 3200 / 0.9 ≒ 3500 bits (Formula 3)
It will be enough.

  As a result of the comparison in step S505, if the binary data size is smaller than a predetermined value N (for example, the maximum value according to the standard), the process proceeds to step S506, and the I_PCM flag is cleared. If the binary data size is larger than the predetermined value N as a result of the comparison in step S505, the process proceeds to step S507, and the I_PCM flag is set. Thereafter, the process proceeds to step S508, and in accordance with the setting of the I_PCM flag, I_PCM is written after the binary code data.

  When the process of step S506 or step S508 ends, the process proceeds to step S509. In step S509, it is determined whether or not processing has been completed up to the last macroblock in the picture. If the result of this determination is that the process has not ended up to the final macroblock, the process returns to step S502 and the above-described processing is performed. If it is determined in step S509 that the processing has been completed up to the final macroblock, the process proceeds to step S510 to perform end processing.

Next, an example of a processing procedure after arithmetic coding will be described with reference to the flowchart of FIG.
When the process is started in step S601, the binary code data length is read in the next step S602. Next, in step S603, arithmetic coding corresponding to each syntax element is performed for one macroblock.

  Next, in step S604, it is compared whether or not the arithmetic code length for one macroblock is smaller than 3200 bits. As a result of the comparison, if the code length exceeds 3200 bits, the process proceeds to step S606, and the arithmetic code data encoded in step S603 is discarded. Thereafter, in step S608, the I_PCM data subsequent to the binary data is adopted and recorded as a final bit stream.

  On the other hand, as a result of the comparison in step S604, if the code length is 3200 bits or less, the process proceeds to step S605, where the arithmetically encoded arithmetic code data is finally adopted and recorded as a bit stream. Next, in step S607, the presence / absence of the I_PCM flag is checked. If “1” indicating that image data is inserted is set, the process proceeds to step S609, and the I_PCM data following the binary code data is discarded.

  If “1” is not set as a result of the verification in step S607, the process proceeds to step S610. Also, when the process of step S608 or step S609 is completed, the process proceeds to step S610. In step S610, it is determined whether or not processing has been completed up to the last macroblock in the picture. If the result of this determination is that the process has not ended up to the final macroblock, the process returns to step S602 and the above-described processing is performed. If it is determined in step S610 that the processing has been completed up to the last macro block, the process proceeds to step S611 to perform end processing.

  By performing the process as described above, the I_PCM mode process can be easily executed even when the CABAC process is performed with a delay in units of frames. In addition, it is possible to prevent the inconvenience of generating a surplus code by setting a macroblock that does not correspond to the bit length restriction by the standard to the I_PCM mode.

(Second Embodiment)
Next, a second embodiment of the present invention will be described with reference to FIG.
The present embodiment is an example in which another format is formed using the same data as the binary code data shown in FIG. In FIG. 9, reference numerals 902 and 903 denote BLEN fields, which indicate the BIN length with 16 bits. 904 is BIN data, and 905 is a stuffing bit. Reference numeral 906 denotes I_PCM data, which indicates that I_PCM data is inserted only in this macro block.

  In such a format, the values of BLEN 902 and 903 actually fit in 12 bits (<4095). Therefore, in this embodiment, the MSB of the BLEN field 902 is used as the I_PCM flag 901. In this format, the macroblock MB (n + 1) eliminates the need for byte alignment because one bit of the footer is lost. Thus, the BLEN and I_PCM flags can be configured in any arrangement.

(Other embodiments according to the present invention)
Each means constituting the image coding apparatus according to the above-described embodiment of the present invention can be realized by operating a program stored in a RAM or ROM of a computer. This program and a computer-readable recording medium recording the program are included in the present invention.

  In addition, the present invention can be implemented as, for example, a system, apparatus, method, program, storage medium, or the like. Specifically, the present invention may be applied to a system including a plurality of devices. The present invention may be applied to an apparatus composed of a single device.

  In the present invention, a software program (in the embodiment, a program corresponding to the flowcharts shown in FIGS. 5 and 6) for executing each step in the above-described image encoding method is directly or remotely supplied to the system or apparatus. To do. And the case where it is achieved also by reading and executing the supplied program code by the computer of the system or apparatus is included.

  Therefore, since the functions of the present invention are implemented by computer, the program code installed in the computer also implements the present invention. In other words, the present invention includes a computer program itself for realizing the functional processing of the present invention.

  In that case, as long as it has the function of a program, it may be in the form of object code, a program executed by an interpreter, script data supplied to the OS, and the like.

  Various recording media can be used as a recording medium for supplying the program. For example, floppy (registered trademark) disk, hard disk, optical disk, magneto-optical disk, MO, CD-ROM, CD-R, CD-RW, magnetic tape, nonvolatile memory card, ROM, DVD (DVD-ROM, DVD- R).

  As another program supply method, a browser on a client computer is used to connect to an Internet home page. It can also be supplied by downloading the computer program itself of the present invention or a compressed file including an automatic installation function from a homepage to a recording medium such as a hard disk.

  It can also be realized by dividing the program code constituting the program of the present invention into a plurality of files and downloading each file from a different homepage. That is, the present invention includes a WWW server that allows a plurality of users to download a program file for realizing the functional processing of the present invention on a computer.

  In addition, the program of the present invention is encrypted, stored in a storage medium such as a CD-ROM, distributed to users, and key information for decryption is downloaded from a homepage via the Internet to users who have cleared predetermined conditions. Let It is also possible to execute the encrypted program by using the key information and install the program on a computer.

  In addition to the functions of the above-described embodiments being realized by the computer executing the read program, the OS running on the computer may perform part or all of the actual processing. The functions of the above-described embodiments can be realized.

  Further, the program read from the recording medium is written in a memory provided in a function expansion board inserted into the computer or a function expansion unit connected to the computer. Thereafter, the CPU of the function expansion board or function expansion unit performs part or all of the actual processing based on the instructions of the program, and the functions of the above-described embodiments are realized by the processing.

DESCRIPTION OF SYMBOLS 100 Image coding apparatus 101 Image memory 102 Motion detection part 103 Deblocking filter 104 Motion compensation part 105 Integer transformation part 106 Quantization part 107 Inverse quantization part 108 Inverse integer transformation part 109 Quantization step control part 110 Binarization part 111 Code amount check unit 112 Byte aligner 113 Header / footer addition unit 114 Selector 115 I_PCM buffer 116 Binary buffer 201 Binary buffer 202 Header / footer detection unit 203 I_PCM detection unit 204 Arithmetic encoding unit 205 Code amount checker 206 Arithmetic code buffer 207 selector

Claims (9)

An image encoding device that divides each frame of an input moving image into arbitrary block sizes and performs encoding for each block,
Binarization means for binarizing each coding element of the block to generate binarized data;
Code length adding means for adding the code length of the binarized data generated by the binarizing means to the binarized data;
An image coding apparatus comprising: data insertion means for adaptively inserting image data of a predetermined block according to the code length of the binarized data.   If the code length of the binarized data is smaller than a predetermined value set in advance, the binarized data generated by the binarization means is selected, and the code length of the binarized data is set in advance 2. The image coding apparatus according to claim 1, further comprising data selection means for selecting image data of the predetermined block when the predetermined value is larger than the predetermined value.   It further comprises data alignment means for appropriately adding surplus data to the binarized data generated by the binarization means and aligning the binarized data for each arbitrary block in units of at least 8 bits. The image encoding device according to claim 2.   4. The image encoding apparatus according to claim 2, further comprising attribute information adding means for adding attribute information indicating whether or not image data of the predetermined block is inserted to each block. Variable length encoding means for variable length encoding the binarized data output from the data insertion means;
Code length comparison means for comparing the code length of the code data variable length encoded by the variable length encoding means with a predetermined value;
The data selection means discards the variable-length encoded code data if the code length of the binarized data is larger than a predetermined value as a result of the comparison by the code length comparison means, When the image data of the predetermined block is selected and the code length of the binarized data is smaller than a predetermined value set in advance, the attribute information added by the attribute information adding means is inspected, and the attribute data When the information indicates that image data is inserted, the image data of the inserted predetermined block is discarded and code data subjected to variable length encoding is selected and output as final code output data. Item 5. The image encoding device according to Item 4. An I_PCM buffer that stores image data for one macroblock locally decoded in the process of encoding each block as I_PCM data;
6. The image encoding device according to claim 1, wherein the data insertion unit inserts I_PCM data stored in the I_PCM buffer as image data of the predetermined block. An image encoding method that divides each frame of an input moving image into arbitrary block sizes and performs encoding for each block,
A binarization step of binarizing each coding element of the block to generate binarized data;
A code length adding step of adding the code length of the binarized data generated in the binarizing step to the binarized data;
And a data insertion step of adaptively inserting image data of a predetermined block in accordance with the code length of the binarized data. A computer program that causes a computer to execute an image encoding method that divides each frame of an input moving image into arbitrary block sizes and performs encoding for each block,
A binarization step of binarizing each coding element of the block to generate binarized data;
A code length adding step of adding the code length of the binarized data generated in the binarizing step to the binarized data;
A computer program causing a computer to execute a data insertion step of adaptively inserting image data of a predetermined block in accordance with the code length of the binarized data.   A computer-readable storage medium storing the computer program according to claim 8.

Images