Adaptive variable-length coding and decoding methods for image data
Claim Score by NHIP
Abstract
An adaptive variable-length coding/decoding method performs an optimal variable-length coding and decoding depending on an intra mode/inter mode condition, quantization step size and a current zigzag scanning position, such that a plurality of variable-length coding tables having different patterns of a regular region and an escape region according to statistical characteristics of the run level data are set. One of the variable-length coding tables is selected according to mode, quantization step size and scanning position, and the orthogonal transform coefficients according to the selected variable-length coding table are variable-length-coded.

Term
Term ended
Expired 8 September 2026, 0 years ago.
- Priority
- Filed
- Granted
- Expired
- Today
10 claims: 2 independent, 8 dependent
- 1An adaptive variable-length coding method whereby quantized orthogonal transform coefficients are scanned in a zigzag pattern, are modified into run, level data and then are variable-length coded in a coding system for image data, said method comprising the steps of:setting a plurality of variable-length coding tables having different patterns of a regular region and an escape region according to statistical characteristics of said run, level data;selecting one of said plurality of variable-length coding tables according to intra/inter mode information of the currently processed block, zigzag scanning position and quantization step size;and variable-length coding the orthogonal transform coefficients according to said selected variable-length coding table, wherein said selecting step has the selecting range of a plurality of variable-length coding tables having different patterns of a regular region and an escape region according to said intra/inter mode information of the currently Processed block.
- 8Broadest claimClaim Score 48, average(NHIP)An adaptive variable- length decoding method for decoding image data encoded by an adaptive variable - length coding method, in which quantized orthogonal transform coefficients of the image data are scanned in a predetermined pattern and are encoded, the decoding method comprising:receiving intra/inter mode information;receiving the encoded quantized orthogonal transform coefficients;detecting scanning position information of the encoded coefficients;selecting one of a plurality of variable - length decoding tables according to the intra/inter mode information and the scanning position information, wherein the plurality of variable - length decoding tables comprise: a table selectable for an alternating - current ( AC ) component of an intra mode that is different from a table selectable for an inter mode, and a table selectable for a direct - current ( DC ) component of the intra mode;and variable - length decoding the encoded quantized orthogonal transform coefficients according to the selected variable - length decoding table.
Independent claims2
78 paragraphs in 4 sections, as filed
More than one reissue application has been filed for the reissue of U.S. Pat. No. <b>5</b>,<b>793</b>,<b>897</b>. This is a Divisional of U.S. application Ser. No. <b>11</b>/<b>017</b>,<b>698</b> filed Dec. <b>22</b>, <b>2004</b>, which is a Divisional of U.S. application Ser. No. <b>09</b>/<b>654</b>,<b>939</b> filed Dec. <b>22</b>, <b>2000</b>, which is a Divisional of U.S. application Ser. No. <b>09</b>/<b>638</b>,<b>796</b> filed Aug. <b>11</b>, <b>2000</b>, which is a reissue of U.S. Pat. No. <b>5</b>,<b>793</b>,<b>897</b>, issued Aug. <b>11</b>, <b>1998</b>. The above noted prior applications are all hereby incorporated by reference.
<i>More than one reissue application has been filed for the reissue of U.S. Pat. No. <b>5</b>,<b>793</b>,<b>897</b>. The reissue applications are application Ser. Nos. <b>09</b>/<b>638</b>,<b>796</b> filed Aug. <b>11</b>, <b>2000</b>, now U.S. Reissued Pat. No. RE<b>39</b>,<b>167</b>, <b>09</b>/<b>654</b>,<b>939</b> filed Aug. <b>31</b>, <b>2000</b>, <b>11</b>/<b>017</b>,<b>697</b> filed Dec. <b>22</b>, <b>2004</b>, <b>11</b>/<b>017</b>,<b>698</b> filed Dec. <b>22</b>, <b>2004</b>, <b>11</b>/<b>416</b>,<b>183</b> filed May <b>3</b>, <b>2006</b>, <b>11</b>/<b>416</b>,<b>312</b> filed May <b>3</b>, <b>2006</b>, which is the present application, <b>11</b>/<b>738</b>,<b>415</b> filed Apr. <b>20</b>, <b>2007</b>, <b>11</b>/<b>738</b>,<b>419</b> filed Apr. <b>20</b>, <b>2007</b>, <b>12</b>/<b>238</b>/<b>083</b> filed Sep. <b>25</b>, <b>2008</b>, <b>12</b>/<b>238</b>,<b>104</b> filed Sep. <b>25</b>, <b>2008</b>, and <b>12</b>/<b>238</b>,<b>120</b> filed Sep. <b>25</b>, <b>2008</b>. Application Ser. No. <b>09</b>/<b>638</b>,<b>796</b> is a reissue of U.S. Pat. No. <b>5</b>,<b>793</b>,<b>897</b>. Application Ser. No. <b>09</b>/<b>654</b>,<b>939</b> is a divisional application of U.S. Reissued Pat. No. RE<b>39</b>,<b>167</b>. Application Ser. No. <b>11</b>/<b>017</b>,<b>697</b> is a divisional application of Ser. No. <b>09</b>/<b>654</b>,<b>939</b>. Application Ser. No. <b>11</b>/<b>017</b>,<b>698</b> is a divisional application of Ser. No. <b>09</b>/<b>654</b>,<b>939</b>. Application Ser. No. <b>11</b>/<b>416</b>,<b>183</b> is a divisional application of Ser. No. <b>11</b>/<b>017</b>,<b>697</b>. Application Ser. No. <b>11</b>/<b>416</b>,<b>312</b>, which is the present application, is a divisional application of Ser. No. <b>11</b>/<b>017</b>,<b>698</b>. Application Ser. No. <b>11</b>/<b>738</b>,<b>415</b> is a divisional application of Ser. No. <b>09</b>/<b>654</b>,<b>939</b>. Application Ser. No. <b>11</b>/<b>738</b>,<b>419</b> is a divisional application of Ser. No. <b>09</b>/<b>654</b>,<b>939</b>. Application Ser. No. <b>12</b>/<b>238</b>,<b>083</b> is a divisional application of Ser. No. <b>11</b>/<b>017</b>,<b>698</b>. Application Ser. No. <b>12</b>/<b>238</b>,<b>104</b> is a divisional application of Ser. No. <b>11</b>/<b>017</b>,<b>698</b>. Application Ser. No. <b>12</b>/<b>238</b>,<b>120</b> is a divisional application of Ser. No. <b>11</b>/<b>017</b>,<b>698</b>. The entire disclosures of U.S. Pat. No. <b>5</b>,<b>793</b>,<b>897</b>, U.S. Reissued Pat. No. RE<b>39</b>,<b>167</b>. Application Ser. Nos. <b>09</b>/<b>654</b>,<b>939</b>, <b>11</b>/<b>017</b>,<b>697</b>, <b>11</b>/<b>017</b>,<b>698</b> and <b>11</b>/<b>416</b>,<b>183</b> are hereby incorporated by reference. </i>
TECHNICAL FIELD
The present invention relates to adaptive variablelength coding and decoding methods for digital image data, and more particularly, to adaptive variable-length coding and decoding methods which improve compression efficiency of transmission data by performing variable-length coding and decoding adaptively, according to statistical characteristics of image data.
BACKGROUND ART
Recently, in an apparatus for transmitting and receiving video and audio signals, a method by which the video and audio signals are coded to be digital signals to then be transmitted or stored in a memory and the digital signals are decoded to then be reproduced, has been widely adopted.
However, in the case of coding a video signal into digital data, the data quantity is large. Thus, in order to decrease the overall data quantity by removing redundant data contained in the digital video signal, discrete cosine transform (DCT) coding, differential pulse code modulation (DPCM), vector quantization, or variablelength coding (VLC) should be performed.
<figref idref="DRAWINGS">FIG. 1</figref> is a schematic block diagram of a general coding system for image data. The apparatus includes means <b>11</b> and <b>12</b> for performing a DCT function with respect to an N×N block and for quantizing DCT coefficients, means <b>13</b> and <b>14</b> for variable-length-coding the quantized data and for further compressing data quantity, and means <b>15</b>, <b>16</b>, <b>17</b>, <b>18</b>, <b>19</b>, A<b>1</b>, A<b>2</b>, SW<b>1</b> and SW<b>2</b> related to the inverse quantization and DCT operations with respect to the quantized data to then perform a motion compensation, which codes image data in an intra mode or inter mode.
<figref idref="DRAWINGS">FIG. 2</figref> is a schematic block diagram of a general decoding system for image data. The apparatus decodes and reproduces the image data coded by the coding system shown in FIG. <b>1</b>.
The operation of the coding and decoding system respectively shown in <figref idref="DRAWINGS">FIGS. 1 and 2</figref> will be briefly described.
In <figref idref="DRAWINGS">FIG. 1</figref>, the video signal input through an input port <b>10</b> becomes a signal of a frequency domain in the units of N×N blocks in DCT <b>11</b>, where although the magnitude of a block is generally N<sub>1</sub>×N<sub>2</sub>, it is assumed that N<sub>1</sub>=N<sub>2</sub>=N, for the sake of convenience. The energy of transform coefficients is chiefly concentrated is a low frequency domain. Data transforms for each block are performed by a discrete cosine transform. Walsh-Hadamard transform, discrete Fourier transform, or discrete sine transform method. Here, the transform coefficients are obtained by DCT operation.
Quantizer <b>12</b> changes the DCT coefficients into representative values of a constant level through a predetermined quantization process.
Variable-length encoder <b>13</b> variable-length-codes the representative values using their statistical characteristics, thereby further comprising the data.
Meanwhile, a quantization step size Q<sub>ss</sub>, which is varied depending on the state (a fullness) of a buffer <b>14</b> wherein the variable-length-coded data is stored, controls quantizer <b>12</b> to thereby adjust a transmission bit rate. The quantization step size Q<sub>ss </sub>is also transmitted to a receiver side, to be used in a decoding system.
Also, in general, there are many similar portions between consecutive screens. Therefore, in the case of a screen having motion, a motion vector MV is obtained by estimating the motion, and data is compensated using the motion vector MV. Then, a differential signal between adjacently positioned screens becomes very small, thereby allowing transmission data to be more compressed.
In order to perform such motion compensation, an inverse quantizer (Q<sup>−1</sup>) <b>15</b> shown in <figref idref="DRAWINGS">FIG. 1</figref> inverse-quantizes the quantized data output from quantizer <b>12</b>. Thereafter, the inverse-quantized data is inverse-DCT-operated in an inverse DCT means (DCT<sup>−1</sup>) <b>16</b> to then be a video signal of a spatial domain. The video signal output from inverse DCT means <b>16</b> is stored in a frame memory <b>17</b> in frame units. Motion estimator <b>18</b> searches a block having the most similar pattern to that of an N×N block of input port <b>10</b> among the frame data stored in frame memory <b>17</b> and estimates the motion between blocks to obtain a motion vector MV. The motion vector MV is transmitted to a receiver side to be used in a decoding system and is simultaneously transmitted to a motion compensator <b>19</b>.
Motion compensator <b>19</b> receives the motion vector MV from motion estimator <b>18</b> and reads out an N×N block corresponding to the motion vector MV from the previous frame data output from frame memory <b>17</b> to then supply the read N×N block to a subtractor A<b>1</b> connected with input port <b>10</b>. Then, subtractor A<b>1</b> obtains the difference between the N×N block supplied to input port <b>10</b> and the N×N block having the similar pattern thereto supplied from motion compensator <b>19</b>. The output data of subtractor A<b>1</b> is coded and then transmitted to the receiver side, as described above. That is to say, initially, the video signal of one screen (intraframe) is coded wholly to then be transmitted. For the video signal of the following screen (interframe), only the differential signal due to the motion is coded to then be transmitted.
Meanwhile, the data whose motion is compensated is motion compensator <b>19</b> is summed with the video signal output from inverse DCT means <b>16</b> in an adder A<b>2</b> and is thereafter stored in frame memory <b>17</b>.
Refresh switches SW<b>1</b> and SW<b>2</b> are turned off at a certain interval (here, the period is one group of pictures or a GOP period) by a control means (not shown), so that an input video signal is coded into a PCM mode to then be transmitted in the case of an intraframe mode and so that only the differential signal is coded to then be transmitted in the case of an interframe mode, thereby refreshing cumulative coding errors for a constant period (one GOP). Also, a refresh switch SW<b>3</b> allows the transmission errors on a channel to deviate from the receiver side within the constant time period (one GOP).
In this manner, the coded image data V<sub>c </sub>is transmitted to the receiver side to then be input to the decoding system shown in FIG. <b>2</b>. The coded image data Vc is decoded through the reverse process to the coding process in a variable-length decoder <b>21</b>. The data output from variable-length decoder <b>21</b> is inverse-quantized in an inverse quantizer <b>22</b>. At this time, inverse quantizer <b>22</b> adjusts the magnitude of the output DCT coefficients depending on the quantization step size Q<sub>ss </sub>supplied from the encoding system.
An inverse DCT means <b>23</b> inverse-DCT-operates the DCT coefficients of a frequency domain, supplied from inverse quantizer <b>22</b>, into the image data of a spatial domain.
Also, the motion vector MV transmitted from coding system shown in <figref idref="DRAWINGS">FIG. 1</figref> is supplied to a motion compensator <b>24</b> of decoding system. Motion compensator <b>24</b> reads out the N×N block corresponding to the motion vector MV from the previous frame data stored in a frame memory <b>25</b>, compensates the motion and then supplies the compensated N×N block to an adder A<b>3</b>. Then, adder A<b>3</b> adds the inverse-DCT-operated DPCM data to the N×N block data supplied from motion compensator <b>24</b> to then output to a display.
<figref idref="DRAWINGS">FIGS. 3A</figref>, <b>3</b>B and <b>3</b>C schematically show the process of coding image data. The sampling data of an N×N block shown in <figref idref="DRAWINGS">FIG. 3A</figref> is a DCT-operated to be DCT coefficients of a frequency domain by the DCT method, etc., as shown in FIG. <b>3</b>B. The DCT coefficients are quantized and are scanned in a zigzag pattern, to then be coded in the form of runlength and level-length, as shown in FIG. <b>3</b>C.
While the scanning is performed from a low frequency component to a high frequency component in scanning the N×N block, as shown in <figref idref="DRAWINGS">FIG. 3C</figref>, a “run” and “level” and set as a pair expressed as [run, level], and is then coded.
Here, the run represents the number of <b>0</b>'s present between coefficients not being “0” among the quantized coefficients of an N×N block, and the level corresponds to the absolute value of the coefficient not being “0”.
For example, in the case of an 8×8 block, the run is distributed from “0” to “63” and the level varies depending to the data value output from a quantizer. That is to say, if the quantized output value is indicated as an integer ranging from “−255” to “+255,” the level has a value ranging from “1” to “+255.” At this time, the positive or negative sign is expressed by an extra sign bit. In this manner, when a [run, level] pair is set as a symbol, if the run or level is large, the probability of the symbol is statistically very low.
Therefore, as shown in <figref idref="DRAWINGS">FIG. 4</figref>, the block is divided into a regular region and an escape region according to the probability of the symbol. For the regular region where the probability of the symbol is relatively high, a Huffman code is used in coding. For the escape region where the probability of the symbol is low, data of a predetermined fixed length is used in coding. Here, according to the Huffman code, the higher the probability of the symbol, the shorter the code is set, and vice versa.
Also, the escape sequence ESQ in which data of escape region is coded is composed of an escape code ESC, run, level and sign data S, each having a predetermined number of bits, as expressed in the following equation (1). <br />ESQ=ESC +RUN +L +S (1)
For example, as described above, if the quantized value is from “−255” to “+255” in an 8×8 block, the escape sequence has a constant data length of 21 bits in total since the escape code data ESC is six bits, run data RUN is six bits, level data L is eight bits, and sign data S is one bit.
In this manner, according to the conventional variable-length coding method, since various extra information is also transmitted together with code data and the escape sequence set by one variable-length coding table depending on the statistical characteristics of data has a constant fixed length, there is a limit in compressing data quantity by coding transmitted data.
Disclosure of the Invention
Therefore, it is an object of the present invention to provide an adaptive variable-length coding method which improves compression efficiency of data by selecting an optimal variable-length coding table among a plurality of variable-length coding tables according to the current scanning position and quantization step size while scanning in a zigzag pattern by block type, i.e., inter/intra mode.
It is another object of the present invention to provide a method for decoding data coded by the above adaptive variable-length coding method.
To accomplish the above object, there is provided an adaptive variable-length coding method according to the present invention whereby quantized orthogonal transform coefficients are scanned in a zigzag pattern, are DCT-operated to be [run, level] data and then are variable-length-coded in a coding system for image data, the method comprising the steps of: <ul id="ul0001" list-style="none"><li id="ul0001-0001" num="0000"><ul id="ul0002" list-style="none"><li id="ul0002-0001" num="0032">setting a plurality of variable-length coding tables having different patterns of a regular region and an escape region according to statistical characteristics of the [run, level] data;</li><li id="ul0002-0002" num="0033">selecting one of the plurality of variable-length coding tables according to intra/inter mode information of the currently processed block, zigzag scanning position and quantization step size; and</li><li id="ul0002-0003" num="0034">variable-length-coding the orthogonal transform coefficients according to the selected variable-length coding table.</li></ul></li></ul>
In a decoding system for image data, the adaptive variable-length decoding method according to the present invention for decoding data coded by the adaptive variable-length coding method, comprises the steps of: <ul id="ul0003" list-style="none"><li id="ul0003-0001" num="0000"><ul id="ul0004" list-style="none"><li id="ul0004-0001" num="0036">setting a plurality of variable-length decoding tables having different patterns of a regular region and an escape region according to statistical characteristics of the [run, level] data;</li><li id="ul0004-0002" num="0037">inputting intra/inter mode information transmitted from the coding system;</li><li id="ul0004-0003" num="0038">inputting quantization step size transmitted from the coding system;</li><li id="ul0004-0004" num="0039">detecting position information while zigzag-scanning by accumulating run values of [run, level] data;</li><li id="ul0004-0005" num="0040">selecting one of the plurality of variable-length decoding tables according to the intra/inter mode information, quantization step size and position information; and</li><li id="ul0004-0006" num="0041">variable-length-decoding the data received according to the selected variable-length decoding table.</li></ul></li></ul>
BRIEF DESCRIPTION OF THE DRAWINGS
<figref idref="DRAWINGS">FIG. 1</figref> is a block diagram of a general coding system for image data;
<figref idref="DRAWINGS">FIG. 2</figref> is a block diagram of a general decoding system for image data;
<figref idref="DRAWINGS">FIGS. 3A-3C</figref> are schematic diagrams for explaining steps of the data processing process according to the apparatus shown in <figref idref="DRAWINGS">FIG. 1</figref>;
<figref idref="DRAWINGS">FIG. 4</figref> shows a conventional variable-length coding and decoding table;
<figref idref="DRAWINGS">FIG. 5</figref> is a schematic block diagram of a variable-length encoder for implementing an adaptive variable-length coding method according to the present invention;
<figref idref="DRAWINGS">FIGS. 6A and 6B</figref> illustrate a method for selecting a variable-length coding table positioned by a predetermined number in the adaptive variable-length coding method according to the present invention, wherein <figref idref="DRAWINGS">FIG. 6A</figref> represents the intra mode and <figref idref="DRAWINGS">FIG. 6B</figref> represents the inter mode; and
<figref idref="DRAWINGS">FIGS. 7A</figref>, <b>7</b>B and <b>7</b>C are histograms [run, level] for each symbol at the first, second and Pth regions shown in FIGS. <b>6</b>A and <b>6</b>B.
BEST MODE FOR CARRYING OUT THE INVENTION
Hereinbelow, a preferred embodiment of the present invention will be described with reference to the accompanying drawings.
In the adaptive variable-length coding method according to the present invention, a plurality of variable-length coding tables are used. The table is selected in accordance with a block type, quantization step size and a current scanning position while scanning a block in a zigzag pattern. This selection is in accordance with the statistical characteristics of [run, level] data which vary depending on block type, i.e., intra mode/inter mode or luminance signal/color signal, quantization step size and a current zigzag scanning position, and which will be described in more detail.
The inter mode for coding the differential signal between the current block data and motion compensated block data generates most of the DCT coefficients as “0” but scarcely generates larger values, compared to the intra mode for coding input block image data sequentially. This is because the variation in a motion compensation estate error thereof is typically smaller than that of the original video signal.
Also, the statistical characteristics of color which depend on the decimation in the spatial domain and narrow bandwidth are different from those of luminance.
Therefore, in accordance with intra/inter mode and luminance/color information, there may be four block types, i.e., (intra, luminance), (intra, color), (inter, luminance) and (inter, color). However, for the block type is the present invention, the luminance/color information is excluded and only the intra/inter mode is considered, because the color statistics are dependent on the downsampling structure of the color signal.
Also, in the case of a large quantization step size, DCT coefficients are not high in the high frequency components and many are generated as “0's” while the quantizer scans in a zigzag pattern. That is to say, in order to utilize the human visual characteristics, the DCT coefficients are divided into primary weighting matrices. Since the weighting matrix for high frequency component is large, when the current scanning is a high frequency component, small values (including “0”) are often produced but large values are scarcely generated.
Therefore, the present invention proposes an adaptive variable-length coding/decoding method using a plurality of variable-length coding/decoding tables in which the block type (intra/inter mode), scanning position and quantization step size are combined, which is called a Huffman code book.
Also, the present invention is adopted for a general coding system shown in FIG. <b>1</b> and for a general decoding system shown in FIG. <b>2</b>.
<figref idref="DRAWINGS">FIG. 5</figref> is a schematic block diagram of a variable-length encoder for implementing the adaptive variable-length coding method according to the present invention.
According to <figref idref="DRAWINGS">FIG. 5</figref>, quantized DCT coefficients are scanned in a zigzag pattern by zigzag scanner <b>31</b>.
Variable-length coding table selector <b>32</b> outputs a control signal for selecting the corresponding first to Pth variable-length coding tables <b>33</b>.<b>1</b>, <b>33</b>.<b>2</b>, . . .. <b>33</b>.P according to the block type (intra/inter mode), quantization step size Qss, and scanning position SP.
The quantization DCT coefficients output from zigzag scanner <b>31</b> are variable-length-coded in accordance with the selected variable-length coding table, to then be transmitted to buffer <b>14</b> shown in FIG. <b>1</b>.
Variable-length decoder <b>21</b> of the decoding system shown in <figref idref="DRAWINGS">FIG. 2</figref> variable-length-decodes data coded in the reverse order to that of the variable-length coding process as shown in FIG. <b>5</b>.
Subsequently, the method for selecting a plurality of variable-length coding/decoding tables will be described in detail with reference to <figref idref="DRAWINGS">FIGS. 6A</figref>, <b>6</b>B and <b>7</b>A to <b>7</b>C.
<figref idref="DRAWINGS">FIG. 6A</figref> shows P variable-length coding tables T<sub>1</sub>, T<sub>2</sub>, . . . . T<sub>p </sub>selected in accordance with quantization step size Q<sub>ss </sub>and the current scanning position SP (during zigzag scanning) for the intra mode. <figref idref="DRAWINGS">FIG. 6B</figref> shows P variable-length coding tables T<sub>1</sub>, T<sub>2</sub>, . . ., T<sub>p </sub>selected in accordance with quantization step size Q<sub>ss </sub>and the current scanning position SP (during zigzag scanning) for the intra mode.
The “0” scanning position SP corresponds to the DC component, the “63” scanning position SP represents the last scanning position in the corresponding block, and quantization step size Q<sub>ss </sub>has values ranging from “0” to “62.”
First, in order to select one of P variable-length coding tables T<sub>1</sub>, T<sub>2</sub>, . . .. T<sub>p </sub>it is determined whether the currently process block mode is an inter mode or intra mode.
That is to say, as shown in <figref idref="DRAWINGS">FIGS. 6A and 6B</figref>, the blocks for selecting the variable-length coding tables T<sub>1</sub>, T<sub>2</sub>, . . .. T<sub>p </sub>are different depending on the mode. In other words, compared to the inter mode, the intra mode has larger selection blocks for the first and second variable-length coding tables T<sub>1 </sub>and T<sub>2 </sub>and a smaller selecting block for the Pth variable-length coding table T<sub>p</sub>.
In the determined mode, the first, the second or Pth variable-length coding table T<sub>1</sub>, T<sub>2 </sub>or T<sub>p </sub>are selected in accordance with quantization step size Q<sub>ss </sub>and scanning position SP.
Quantized DCT coefficients are variable-length-coded in accordance with the selected variable-length coding table.
Here, an example of P regions partitioned on a (SP, Q<sub>ss</sub>) plane in accordance with intra and inter modes shown in <figref idref="DRAWINGS">FIGS. 6A and 6B</figref> can be expressed as follows.
In the intra mode: <ul id="ul0005" list-style="none"><li id="ul0005-0001" num="0000"><ul id="ul0006" list-style="none"><li id="ul0006-0001" num="0071">region <b>1</b>: SP+Q<sub>ss</sub><K<sub>1</sub>;</li><li id="ul0006-0002" num="0072">region <b>2</b>: K<sub>1 </sub>≦SP +Q<sub>ss</sub><K<sub>2</sub>; and</li><li id="ul0006-0003" num="0073">region P: K<sub>p</sub>−1≦SP+Q<sub>ss</sub><K<sub>p</sub>In the inter mode;</li><li id="ul0006-0004" num="0074">region <b>1</b>: SP+Q<sub>ss</sub><L<sub>1</sub>;</li><li id="ul0006-0005" num="0075">region <b>2</b>: L<sub>1 </sub>≦SP+Q<sub>ss</sub><L<sub>2</sub>; and</li><li id="ul0006-0006" num="0076">region P: L<sub>p</sub>−1 ≦SP+Q<sub>ss</sub><L<sub>p </sub></li></ul></li></ul>
The proper partition as above can be sought empirically based on sufficient statistical analysis for various experimental states. These states include such factors as video sequence, bit rate, GOP and partitioning method.
<figref idref="DRAWINGS">FIGS. 7A</figref>, <b>7</b>B and <b>7</b>C show examples of the variable-length coding tables shown in <figref idref="DRAWINGS">FIGS. 6A and 6B</figref>.
The variable-length coding tables have a regular region and escape region which differ depending on the statistical characteristic of [run, level].
That is to say, the first, second, . . .. Pth tables T<sub>1</sub>, T<sub>2</sub>. . ., T<sub>p </sub>have the regular region and escape region having different patterns and the Pth tables T<sub>p </sub>has a smaller regular region than that of the first or second tables T<sub>1 </sub>or T<sub>2</sub>.
Meanwhile, the [run, level] symbol is likely to have a low probability thereof if the run and/or level lengths have a large value. As shown in <figref idref="DRAWINGS">FIG. 4</figref>, the respective symbols of the escape region has a fixed length of 21 bits obtained by adding a six-bit escape code, an eight-bit run, one-bit sign data.
However, in escape coding, since there is redundancy in the run and level fields, the data quantity may be reduced. That is to say, the bit number required for expressing run is dependent on the scanning position during zigzag scanning for two dimensional DCT coefficients and the bit number required for expressing level is dependent on the quantization step size. Also, quantization weighting matrices of intra-coded blocks and inter-coded blocks are different from each other.
The new escape sequence ESQ having a fixed length of 21 bits can be modified into that having a variable length using the aforementioned characteristics according to Equation (1) above, where ESQ is composed of six bits. RUN is composed of zero to six bits. L is composed of one to eight bits, S is composed of one bit, the run data is dependent upon scanning position, and their level is dependent upon quantizer.
Therefore, since the modified escape sequence has a variable length ranging from eight to 21 bits, compared to the fixed length of 21 bits, image data can be further compressed.
In decoding the new escape sequence, since the respective current scanning positions are automatically matched for the coding system and decoding system, the number of bits required for expressing the run value can be matched without transmitting extra information. Also, in the case of the level length, since the quantization step size is transmitted to the decoding system for inverse quantization, the transmitted quantization step size can be used in synchronizing the number of bits required for expressing level, which requires no extra information to be transmitted.
The above-described variable-length coding and decoding method which improve compression efficiency by adjusting the length of the escape sequence variably are disclosed in the U.S. pat. application Ser. No. 08/069,914 filed on Jun. 1, 1993 by the assignee of the present invention.
According to the present invention, a plurality of variable-length tables are provided for both the coding and decoding sides, which may be slightly more complex in hardware, compared to the case of using a conventional single table. However, the present invention is adopted for the case when a high data compression rate is necessary. Also, the corresponding mode, quantization step size and scanning position information generated in coding side is transmitted to the decoding side. The mode and quantization step size information is transmitted in a constant period of time or is transmitted whenever there is a change. The scanning position information is not transmitted separately but is obtained automatically by accumulating the run values after obtaining [run, level] values of the decoding side.
Therefore, although the information on the selected variable-length coding table is not transmitted separately with respect to the block data transmitted to the decoding side, the variable-length coding table selected during coding can be identified from the mode and quantization step size information transmitted from the coding side and the position information automatically calculated from the run value in the decoding side. Then, the same variable-length coding table as that adopted for coding is used for decoding the transmitted block data.
As described above, the method according to the present invention can increase data compression efficiency such that image data coded and decoded by selecting one of a plurality of variable-length coding tables having a regular region and an escape region, using mode, quantization step size and zigzag scanning position information.
Also, according to the present invention, no extra bit which expresses the variable-length coding table selected during coding is necessary to be transmitted for decoding. The transmission data can be further comprised by adjusting variably the run and level lengths of the data to be coded in the escape region of the selected variable-length coding table.
Industrial Applicability
An adaptive variable-length coding/decoding method according to the present invention can improve the compression efficiency of digitally transmitted data and is applicable to various technological fields including digital communication, multimedia and personal computer systems, and digital video apparatuses such as a high definition television or digital videocassette recorder.
Contents4
8 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| EP0447234A2 | Cites | European Patent Office (EPO) | Applicant |
| EP0469835A2 | Cites | European Patent Office (EPO) | Applicant |
| EP0536630A2 | Cites | European Patent Office (EPO) | Applicant |
| EP0542474A2 | Cites | European Patent Office (EPO) | Applicant |
| GB2267410A | Cites | United Kingdom | Applicant |
| US4908862A | Cites | United States of America | Applicant |
| US5329318A | Cites | United States of America | Applicant |
| US5377051A | Cites | United States of America | Applicant |
| US5402244A | Cites | United States of America | Applicant |
| US5559557A | Cites | United States of America | Applicant |
| US5982437A | Cites | United States of America | Applicant |
| EP447234A2 | Cites | European Patent Office (EPO) | Third party observation |
| EP469835 | Cites | European Patent Office (EPO) | Third party observation |
| EP536630 | Cites | European Patent Office (EPO) | Third party observation |
| EP542474 | Cites | European Patent Office (EPO) | Third party observation |
| GB2267410 | Cites | United Kingdom | Third party observation |
66 members in 7 offices
Priority claims18
| Document | Office | Kind | Date |
|---|---|---|---|
| 9328074 | Republic of Korea | – | |
| 930028074 | Republic of Korea | A | |
| 930028074 | Republic of Korea | A | |
| 19940034497 | Republic of Korea | A | |
| 19940034497 | Republic of Korea | A | |
| 9434497 | Republic of Korea | – | |
| 9400177 | Republic of Korea | W | |
| 9400177 | Republic of Korea | W | |
| 08495591 | – | – | – |
| 09638796 | – | – | – |
| 09654939 | – | – | – |
| 11017698 | – | – | – |
| 9328074 | – | – | – |
| 9434497 | – | – | – |
| KR19930028074 | – | – | – |
| KR19940034497 | – | – | – |
| PCTKR9400177 | – | – | – |
| WO1994KR00177 | – | – | – |
Members66
| Document | Office | Kind | |
|---|---|---|---|
| WO9517073A1 | World Intellectual Property Organization (WIPO) | A1 | |
| KR950022175A | Republic of Korea | A | |
| EP0685137A1 | European Patent Office (EPO) | A1 | |
| CN1117779A | China | A | |
| JPH08507191A | Japan | A | |
| US5793897A | United States of America | A | |
| KR0155784B1 | Republic of Korea | B1 | |
| JP2898757B2 | Japan | B2 | |
| EP0987899A2 | European Patent Office (EPO) | A2 | |
| EP0987900A2 | European Patent Office (EPO) | A2 | |
| EP0685137B1 | European Patent Office (EPO) | B1 | |
| DE69425047D1 | Germany | D1 | |
| DE69425047T2 | Germany | T2 | |
| CN1280421A | China | A | |
| EP0987899A3 | European Patent Office (EPO) | A3 | |
| EP0987900A3 | European Patent Office (EPO) | A3 | |
| CN1071526C | China | C | |
| EP1441536A2 | European Patent Office (EPO) | A2 | |
| EP1441536A3 | European Patent Office (EPO) | A3 | |
| EP1445962A1 | European Patent Office (EPO) | A1 | |
| EP1484926A2 | European Patent Office (EPO) | A2 | |
| EP1484926A3 | European Patent Office (EPO) | A3 | |
| EP1487218A1 | European Patent Office (EPO) | A1 | |
| EP1494484A1 | European Patent Office (EPO) | A1 | |
| EP0987899B1 | European Patent Office (EPO) | B1 | |
| CN1592410A | China | A | |
| CN1592411A | China | A | |
| CN1592412A | China | A | |
| CN1592413A | China | A | |
| EP1515568A1 | European Patent Office (EPO) | A1 | |
| DE69434271D1 | Germany | D1 | |
| EP0987900B1 | European Patent Office (EPO) | B1 | |
| DE69434369D1 | Germany | D1 | |
| CN1222110C | China | C | |
| DE69434369T2 | Germany | T2 | |
| DE69434271T2 | Germany | T2 | |
| EP1441536B1 | European Patent Office (EPO) | B1 | |
| EP1445962B1 | European Patent Office (EPO) | B1 | |
| DE69434667D1 | Germany | D1 | |
| DE69434668D1 | Germany | D1 | |
| USRE39167E | United States of America | E | |
| DE69434668T2 | Germany | T2 | |
| DE69434667T2 | Germany | T2 | |
| EP1863290A2 | European Patent Office (EPO) | A2 | |
| EP1863291A2 | European Patent Office (EPO) | A2 | |
| EP1863292A2 | European Patent Office (EPO) | A2 | |
| CN100355286C | China | C | |
| CN100355287C | China | C | |
| CN100355288C | China | C | |
| CN100355289C | China | C | |
| EP1914997A2 | European Patent Office (EPO) | A2 | |
| EP1863290A3 | European Patent Office (EPO) | A3 | |
| EP1863291A3 | European Patent Office (EPO) | A3 | |
| EP1863292A3 | European Patent Office (EPO) | A3 | |
| EP1914997A3 | European Patent Office (EPO) | A3 | |
| DE69434271T4 | Germany | T4 | |
| USRE40782E | United States of America | E | |
| USRE40783E | United States of America | E | |
| USRE40909EThis record | United States of America | E | |
| USRE40980E | United States of America | E | |
| USRE40981E | United States of America | E | |
| USRE41026E | United States of America | E | |
| USRE41124E | United States of America | E | |
| USRE41154E | United States of America | E | |
| USRE41435E | United States of America | E | |
| USRE41458E | United States of America | E |
48 transactions on the USPTO file
Allowed after 1 non-final rejection.
- Non-final rejections
- 1
- Final rejections
- 0
- RCEs
- 0
- Appeals
- 0
Over time
Point at a mark for the transactionTransactions
| Event | Code | |
|---|---|---|
| Recordation of Patent Grant MailedPGM/ | PGM/ | |
| Issue Notification MailedAllowedWPIR | WPIR | |
| Receipt into PubsR1021 | R1021 | |
| Dispatch to FDCD1935 | D1935 | |
| Application Is Considered Ready for IssuePILS | PILS | |
| Issue Fee Payment VerifiedN084 | N084 | |
| Issue Fee Payment VerifiedN084 | N084 | |
| Issue Fee Payment ReceivedIFEE | IFEE | |
| Paralegal or electronic terminal disclaimer approvedP574 | P574 | |
| Paralegal or electronic terminal disclaimer approvedP574 | P574 | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Terminal Disclaimer FiledDIST | DIST | |
| Terminal Disclaimer FiledDIST | DIST | |
| Mail Notification of Terminal Disclaimer - AcceptedMN574 | MN574 | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Paralegal or electronic terminal disclaimer approvedP574 | P574 | |
| Notification of Terminal Disclaimer - AcceptedN574 | N574 | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Terminal Disclaimer FiledDIST | DIST | |
| Miscellaneous Incoming LetterLET. | LET. | |
| Affidavit(s) (Rule 131 or 132) or Exhibit(s) ReceivedAF/D | AF/D | |
| Terminal Disclaimer FiledDIST | DIST | |
| Response after Non-Final ActionA... | A... | |
| Request for Extension of Time - GrantedXT/G | XT/G | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| IFW TSS Processing by Tech Center CompleteTSSCOMP | TSSCOMP | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Preliminary AmendmentA.PE | A.PE | |
| Notice of Reissue Published in Official GazetteNRE. | NRE. | |
| Cleared by OIPE CSRL194 | L194 | |
| Application Is Now CompleteCOMP | COMP | |
| Application Dispatched from OIPEOIPE | OIPE | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Additional Application Filing FeesADDFLFEE | ADDFLFEE | |
| The identification of one or more legal entities other than the inventor(s), each such legal entityASGMT | ASGMT | |
| Cleared by OIPE CSRL194 | L194 | |
| Cleared by OIPE CSRL194 | L194 | |
| Notice Mailed--Application Incomplete--Filing Date AssignedINCD | INCD | |
| Cleared by OIPE CSRL194 | L194 | |
| IFW Scan & PACR Auto Security ReviewSCAN | SCAN | |
| Reference capture on IDSRCAP | RCAP | |
| Information Disclosure Statement (IDS) FiledM844 | M844 | |
| Preliminary AmendmentA.PE | A.PE | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Initial Exam Team nnIEXX | IEXX |
1 legal event, as the office reported them to INPADOC
Events
| Event | Code | |
|---|---|---|
| Fee payment procedurePAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYFEPP | FEPP |
Numbers
- Publication
- RE040909
- Publication, DOCDB
- RE40909
- Publication, EPODOC
- USRE40909E
- Application
- 11416312
- Application, DOCDB
- 41631294
- Application, EPODOC
- US19940416312
Titles
- English
- Adaptive variable-length coding and decoding methods for image data
Classification
- CPC, 9
- G11B20/10527
- H03M7/30
- H03M7/42
- H04N19/13
- H04N19/157
- H04N19/159
- H04N19/60
- H04N19/61
- H04N19/91
- IPC, 21
- G06K9 36
- H04N5 92
- G06K9 46
- G06T9 00
- G11B20 10
- H03M7 42
- H04N19 13
- H04N19 134
- H04N19 157
- H04N19 167
- H04N19 176
- H04N19 186
- H04N19 46
- H04N19 503
- H04N19 51
- H04N19 60
- H04N19 61
- H04N19 625
- H04N19 70
- H04N19 91
- H04N19 93
- USPC, 2
- 382246000
- 382239000