JP2846004B2 - Decoding method - Google Patents
Decoding methodInfo
- Publication number
- JP2846004B2 JP2846004B2 JP30461389A JP30461389A JP2846004B2 JP 2846004 B2 JP2846004 B2 JP 2846004B2 JP 30461389 A JP30461389 A JP 30461389A JP 30461389 A JP30461389 A JP 30461389A JP 2846004 B2 JP2846004 B2 JP 2846004B2
- Authority
- JP
- Japan
- Prior art keywords
- transform
- matrix
- inverse
- dimensional
- discrete cosine
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Transmission Systems Not Characterized By The Medium Used For Transmission (AREA)
- Reduction Or Emphasis Of Bandwidth Of Signals (AREA)
- Complex Calculations (AREA)
Description
【発明の詳細な説明】 〔産業上の利用分野〕 本発明は、直交変換を利用した画像の高能率符号化復
号化における、逆直交変換の方式に関する。Description: BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method of inverse orthogonal transform in high-efficiency encoding / decoding of an image using orthogonal transform.
従来、テレビ信号の高能率符号化復号化装置では、そ
の情報圧縮伸長方式として、アイ・イー・イー・イー，
トランザクシヨン オン コンピユーターズ,1974年第9
0頁から93頁（IEEETRANSACTION ON COMPUTERS,1974,pp9
0−pp93）に論じられているDCT（離散コサイン変換）に
代表される直交変換がある。一般に、テレビ信号の圧縮
伸張に直交変換を利用する場合には、１画面をＮ画素×
Ｎ画素のブロツクで分割し、２次元の直交変換を行う。
ここで、Ｎ画素×Ｎ画素の１ブロツクを［Dij］とし、
２次元のDCTを例に簡単に述べる。2. Description of the Related Art Conventionally, a high-efficiency encoding / decoding device for a television signal uses an IEE,
Transactions on Computers, 9th of 1974
Pages 0 to 93 (IEEETRANSACTION ON COMPUTERS, 1974, pp9
0-pp93), there is an orthogonal transform represented by DCT (discrete cosine transform). Generally, when orthogonal transform is used for compression / expansion of a television signal, one screen is composed of N pixels ×
The image is divided by blocks of N pixels, and two-dimensional orthogonal transformation is performed.
Here, one block of N pixels × N pixels is [Dij],
A two-dimensional DCT will be briefly described as an example.
DCTの変換行列を［Tij］とすると、２次元のDCTは次
式の行列演算により実行され、変換係数［Cij］が得ら
れる。Assuming that the transform matrix of the DCT is [Tij], the two-dimensional DCT is executed by the matrix operation of the following equation, and a transform coefficient [Cij] is obtained.
DCTは、信号を相関の無い周波数軸上へ変換する、一
種の周波数変換であり、画像信号に適用すると低い周波
数成分に有効な変換係数が集中することから、画像信号
の圧縮方式として利用されている。 DCT is a kind of frequency transformation that transforms a signal onto a frequency axis that has no correlation.When applied to an image signal, effective transform coefficients concentrate on low frequency components. I have.
さらに、一般的にこの変換係数を伝送する場合には、
変換係数を低い周波数成分からC00,C01,C20,C11,C02,…
CN−1N−１とジグザグにスキヤンして、有効な変換係数
が現れる周波数成分まで伝送し、それ以上の成分につい
ては伝送を省略することにより伝送ビツト数を削減して
いる。例えば、C20まで有効な変換係数があつたとする
と、伝送はC00,C01,C10,C20、まで行なつた後、ブロツ
クの変換係数の終了を示すEOB（End of Block）を伝送
するような方式で採られている。Furthermore, generally, when transmitting this transform coefficient,
Conversion coefficients are converted from low frequency components to C00, C01, C20, C11, C02, ...
The scan is performed in a zigzag manner with CN-1N-1 to transmit up to the frequency component at which an effective transform coefficient appears, and the number of transmission bits is reduced by omitting the transmission of components beyond that. For example, if there are valid conversion coefficients up to C20, transmission is performed to C00, C01, C10, and C20, and then an EOB (End of Block) indicating the end of the block's conversion coefficients is transmitted. Has been adopted.
また、受信側では、変換係数［Cij］を次式により逆D
CTすることにより画像データ［Dij］を得る。On the receiving side, the transform coefficient [Cij] is calculated by the following equation.
Image data [Dij] is obtained by performing CT.
［Dij］＝［Tij］-1［Cij］（［Tij］-1）ｔ…（３） ただし［Tij］は正規直交行列（［Tij］-1＝［Tij］
ｔ）のため ［Dij］＝［Tij］ｔ［Cij］［Tij］ …（４） となる。[Dij] = [Tij] −1 [Cij] ([Tij] −1 ) t (3) where [Tij] is an orthonormal matrix ([Tij] −1 = [Tij]
Since t ), [Dij] = [Tij] t [Cij] [Tij] (4)
すなわち受信側では、ジズザグスキヤンされて送られ
てきた変換係数を、行列［Cij］に適した配置に並び変
え、（４）の逆DCTの行列演算を行い画像データを得て
いる。That is, the receiving side rearranges the transform coefficients transmitted in a zigzag scan into an arrangement suitable for the matrix [Cij], and performs the inverse DCT matrix operation of (4) to obtain image data.
また、２次元のDCTは、容易に１次元の縮退されるこ
とが知られている。即ち式（４）の２次元の逆DCTは、N
2×N2の変換行列を使用して次式のように１次元に縮退
される。It is also known that two-dimensional DCT is easily reduced to one-dimensional. That is, the two-dimensional inverse DCT of equation (4) is N
Using a 2 × N 2 transformation matrix, it is reduced to one dimension as in the following equation.
［Gx］＝2/N・［Hxy］［Ky］ …（５） ただし Kx＝Cij y＝8u＋ｖ（v,v＝０…Ｎ−1:y＝０…N2−１） x＝8i＋ｊ（i,j＝０…Ｎ−1:x＝０…N2−１） ここで［Kx］は変換係数の列ベクトルである。［Gx］
は画像データの列ベクトルである。[Gx] = 2 / N · [Hxy] [Ky] (5) Kx = Cij y = 8u + v (v, v = 0... N−1: y = 0... N 2 −1) x = 8i + j (i, j = 0... N−1: x = 0... N 2 −1) Here, [Kx] is a column vector of the transform coefficient. [Gx]
Is a column vector of image data.
上記従来技術では、ジグザグスキヤンされて伝送され
た変換係数を、行列［Cij］に適した配置に並び変える
必要があつた。また、変換係数が高次の周波数では零と
なる直交変換（DCT）の性質を利用しておらず、無駄な
演算時間があつた。In the above prior art, it is necessary to rearrange the zigzag scanned and transmitted transform coefficients into an arrangement suitable for the matrix [Cij]. In addition, the method does not use the property of the orthogonal transform (DCT) in which the transform coefficient becomes zero at a higher-order frequency, and thus wastes computation time.
本発明の目的は、受信側でのジグザグスキヤンの並び
変えをなくし、また高次の周波数成分で変換係数が零と
なる性質を利用し、逆直交変換を高速に行うことにあ
る。SUMMARY OF THE INVENTION It is an object of the present invention to eliminate the rearrangement of zigzag scans on the receiving side and to perform inverse orthogonal transform at high speed by utilizing the property that a transform coefficient becomes zero in a high-order frequency component.
上記の目的を達成するために、本発明においては、逆
直交変換行列の列ベクトルの順番を、ジグザグスキヤン
されて伝送されてくる変換係数の順番に並び換える。さ
らに伝送されてきた変換係数の数により、逆直交変換の
行列演算の回数を制御する。In order to achieve the above object, in the present invention, the order of the column vectors of the inverse orthogonal transform matrix is rearranged to the order of the transform coefficients transmitted in a zigzag scan. Further, the number of matrix operations of inverse orthogonal transform is controlled by the number of transmitted transform coefficients.
本発明の構成によれば、逆直交変換において、逆変換
行列の列ベクトルを伝送されてくる変換係数の順番に並
び換えた行列を使用するため、変換係数を並び変える必
要が無い。また、伝送されてきた有効な変換係数の数に
より、行列演算を制御するために無駄な演算時間を無く
なり、伝送符号量に応じた逆直交変換の処理が可能とな
る。According to the configuration of the present invention, in the inverse orthogonal transform, since the matrix in which the column vectors of the inverse transform matrix are rearranged in the order of the transmitted transform coefficients is used, there is no need to rearrange the transform coefficients. In addition, the number of valid transform coefficients transmitted eliminates useless computation time for controlling the matrix computation, and enables inverse orthogonal transform processing according to the transmission code amount.
以下図面を参照して、本発明の実施例を説明する。 Hereinafter, embodiments of the present invention will be described with reference to the drawings.
第１図は本発明の復号器の一実施例であり、点線で囲
つたブロツクが本実施例に係る部分である。本発明の詳
細について説明する前に、従来の一般的なDCT符号化複
号化について、第２図を用いて簡単に説明する。FIG. 1 shows an embodiment of a decoder according to the present invention. Blocks surrounded by dotted lines relate to the embodiment. Prior to describing the details of the present invention, conventional general DCT coding and decoding will be briefly described with reference to FIG.
ポート１に入力されたテレビ信号は、A/D変換器２に
よりデイジタル信号とされフレームメモリ３に取り込ま
れる。このフレームメモリから、８画素×８画素のブロ
ツクとして画素データを読みだし2DDCT4により２次元の
DCTを行う。８×８の画素のブロツクに２次元のDCTを行
うと、第３図に示すような２次元の周波数成分に分解さ
れる。符号器５は、この２次元の周波数成分係数を並び
変える必要が無い。また、伝送されてきた有効な変換係
数の数により、行列演算を制御するために無駄な演算時
間を無くなり、伝送符号量に応じた逆直交変換の処理が
可能となる。The television signal input to the port 1 is converted into a digital signal by the A / D converter 2 and taken into the frame memory 3. From this frame memory, pixel data is read out as a block of 8 pixels × 8 pixels, and two-dimensional data is read by 2DDCT4.
Perform DCT. When a two-dimensional DCT is performed on a block of 8.times.8 pixels, the block is decomposed into two-dimensional frequency components as shown in FIG. The encoder 5 does not need to rearrange the two-dimensional frequency component coefficients. In addition, the number of valid transform coefficients transmitted eliminates useless computation time for controlling the matrix computation, and enables inverse orthogonal transform processing according to the transmission code amount.
以下図面を参照して、本発明の実施例を説明する。 Hereinafter, embodiments of the present invention will be described with reference to the drawings.
第１図は本発明の復号器の一実施例であり、点線で囲
つたブロツクが本実施例に係る部分である。本発明の詳
細について説明する前に、従来の一般的なDCT符号化復
号化について、第２図を用いて簡単に説明する。FIG. 1 shows an embodiment of a decoder according to the present invention. Blocks surrounded by dotted lines relate to the embodiment. Before describing the details of the present invention, conventional general DCT coding / decoding will be briefly described with reference to FIG.
ポート１に入力されたテレビ信号は、A/D変換器２に
よりデイジタル信号とされフレームメモリ３に取り込ま
れる。このフレームメモリから、８画素×８画素のブロ
ツクとして画素データを読みだし2DDCT4により２次元の
DCTを行う。８×８の画素のブロツクに２次元のDCTを行
うと、第３図に示すような２次元の周波数成分に分解さ
れる。符号器５は、この２次元の周波数成分を第３図に
示すように、低い周波数成分からジグザグスキヤンして
読みだし符号化を行う。また符号器５は、第３図に示す
ように、ある周波数成分以上に有効な変換係数が存在し
ない場合、その周波数成分で符号化を打ち切り、ブロツ
クの処理の終わりを示す符号（EOB）を送出する。符号
器５で生成された符号は、伝送器６を介して伝送路８に
流される。The television signal input to the port 1 is converted into a digital signal by the A / D converter 2 and taken into the frame memory 3. From this frame memory, pixel data is read out as a block of 8 pixels × 8 pixels, and two-dimensional data is read by 2DDCT4.
Perform DCT. When a two-dimensional DCT is performed on a block of 8.times.8 pixels, the block is decomposed into two-dimensional frequency components as shown in FIG. The encoder 5 reads and encodes the two-dimensional frequency components by zigzag scanning from low frequency components as shown in FIG. As shown in FIG. 3, when there is no effective transform coefficient beyond a certain frequency component, the encoder 5 terminates the encoding at that frequency component and sends a code (EOB) indicating the end of the block processing. I do. The code generated by the encoder 5 is sent to the transmission line 8 via the transmitter 6.
次に受信側について説明する。伝送路８からの符号
は、受信器10を介して復号器11に読み込まれる。復号器
により復号された変換係数は、2DIDCT12により逆DCTさ
れ、元の画像信号に復元されフレームメモリ13に書き込
まれる。フレームメモリの画像信号は、D/A変換器14を
通してアナログ信号とし、出力ポート15に出力される。Next, the receiving side will be described. The code from the transmission line 8 is read into the decoder 11 via the receiver 10. The transform coefficient decoded by the decoder is subjected to inverse DCT by the 2D IDCT 12, restored to the original image signal, and written to the frame memory 13. The image signal of the frame memory is converted into an analog signal through the D / A converter 14, and is output to the output port 15.
本発明はこの中で、受信側の逆直交変換（逆DCT）に
関わる。そこで比較のために、第４図に従来の逆直交変
換器の１例を示し、その問題点の説明をする。変換係数
は、前述したようにジグザグスキヤンされた順番に符号
化され伝送されてくる。復号器11は、この符号を解読し
変換係数とする。この変換係数は逆ジグザグスキヤン12
gにより第５図に示すように並び換えられる。並び換え
られた変換係数は、順次読み出された式（４）あるいは
式（５）に基づいた変換行列12bと行列演算（積和演
算）が行われ逆変換される。たとえば、第６図に式
（５）を使用し、伝送されてきた変換係数が４係数の場
合の例を示す。この図から以下の２点の問題点が指摘さ
れる。The present invention relates to the inverse orthogonal transform (inverse DCT) on the receiving side. Therefore, for comparison, FIG. 4 shows an example of a conventional inverse orthogonal transformer, and its problems will be described. The transform coefficients are encoded and transmitted in the zigzag scan order as described above. The decoder 11 decodes this code and sets it as a transform coefficient. This conversion coefficient is inverse zigzag scan 12
Rearranged as shown in FIG. 5 by g. The rearranged transform coefficients are inversely transformed by performing a matrix operation (product-sum operation) with the transform matrix 12b based on the sequentially read equation (4) or (5). For example, FIG. 6 shows an example in which equation (5) is used and the transmitted transform coefficients are four coefficients. From this figure, the following two problems are pointed out.
（１）伝送されてきた変換係数の順番を、入れ換える必
要がある。このため、逆ジグザグスキヤン12gが必要で
ある。(1) It is necessary to change the order of the transmitted transform coefficients. Therefore, 12 g of reverse zigzag scan is required.
（２）第５図中の点線の部分は、零であるにもかかわら
ず行列演算を行うため、演算速度が遅くなる。(2) The dotted line in FIG. 5 performs a matrix operation even though it is zero, so that the operation speed is reduced.
次に本発明の詳細について説明する。本発明は、従来
の問題点（１），（２）を第１図のような構成をとるこ
とにより解決するものである。それぞれの解決法につい
て図を参照しながら説明する。Next, details of the present invention will be described. The present invention solves the conventional problems (1) and (2) by adopting a configuration as shown in FIG. Each solution will be described with reference to the drawings.
（１）変換係数を逆ジグザグスキヤンする代わりに、ア
ドレス発生器12dの後に、アドレス変換器12cを設け、逆
変換行列の列ベクトルを第７図に示すように入れ換え
る。これにより、逆直交変換の演算を、伝送されてくる
変換係数の順番に行うことが可能となる。(1) Instead of inverse zigzag scanning of the conversion coefficients, an address converter 12c is provided after the address generator 12d, and the column vectors of the inverse conversion matrix are exchanged as shown in FIG. This makes it possible to perform the inverse orthogonal transform in the order of the transmitted transform coefficients.
（２）伝送されてきた変換係数の数を計測する、有効係
数カウンタ12aを設け、その数により行列演算の積和の
回数を制御する。たとえば第７図に示すように、変換係
数が４つまでしか有効な係数がない場合には、 のように４回の積和で打ち切る。(2) An effective coefficient counter 12a for measuring the number of transmitted transform coefficients is provided, and the number of product-sum operations of matrix operation is controlled by the number. For example, as shown in FIG. 7, when there are only four effective conversion coefficients, It is cut off by four sums of products like.
以上実施例として、８画素×８画素を１ブロツクとす
る２次元のDCTで、変換係数をジグザグスキヤンして伝
送する場合を説明した。しかし、これは１例であり本発
明は、（１）このブロツクサイズが異なつても、（２）
また変換係数の伝送順番がジグザグスキヤン以外でも、
実行できることは明白である。さらに、（３）本実施例
の第１図の機能は、ハードウエアによる実行も可能であ
るし、DSP（Digital Signal prosessor），マイコン等
を用いて、ソフトウエアによる実現も可能であることは
明白である。また、（４）上記実施例では２次元DCTの
例を説明したが、アダマール変換やデイスクリートルジ
ヤンドル変換等任意の直交変換に対して本発明は適応で
きる。また、逆量子化行列［Qxy］やブロツク内のフイ
ルタ［Fxy］を提案の逆行列に演算し、その結果を逆変
換行列［Hxy］として利用することにより、逆量子化や
フイルタの機能も逆変換の処理の中でできることは明白
である。As described above, the case where the transform coefficients are zigzag-scanned and transmitted in a two-dimensional DCT in which 8 pixels × 8 pixels constitute one block has been described. However, this is only an example, and the present invention provides (1) even if the block size is different, (2)
Also, even if the transmission order of the transform coefficients is other than zigzag scan,
Clearly what can be done. Further, (3) it is clear that the function of FIG. 1 of this embodiment can be executed by hardware, and can be realized by software using a DSP (Digital Signal Processor), a microcomputer, or the like. It is. (4) In the above embodiment, an example of a two-dimensional DCT has been described. However, the present invention can be applied to any orthogonal transform such as Hadamard transform and Discrete-Jandle transform. In addition, the inverse quantization matrix [Qxy] and the filter [Fxy] in the block are calculated into the proposed inverse matrix, and the result is used as the inverse transform matrix [Hxy]. Obviously what can be done during the conversion process.
（１）逆直交変換行列として、伝送されてくる変換係数
の順番に列ベクトルを並び換えた行列を利用することに
より、変換係数の並び換えが必要ない。これにより回路
規模の削減、ないしはソフトウエア処理の高速化が図れ
る。(1) By using a matrix obtained by rearranging column vectors in the order of transmitted transform coefficients as an inverse orthogonal transform matrix, there is no need to rearrange the transform coefficients. This can reduce the circuit scale or speed up the software processing.
（２）伝送されてくる変換係数の数により、行列演算の
打ち切り制御の行うことにより、無駄な演算時間が減少
し、伝送されてくる変換係数の数に応じた演算時間を実
現することが可能となる。(2) By performing the truncation control of the matrix operation based on the number of transmitted conversion coefficients, useless operation time is reduced, and the operation time according to the number of transmitted conversion coefficients can be realized. Becomes
第１図は本発明の一実施例の復号化装置の構成を示すブ
ロツク図、第２図は従来例の一般的な符号化復号化装置
の構成を示すブロツク図、第３図は２次元のDCTの説明
図、第４図は従来の逆直交変換装置のブロツク図、第５
図，第６図は従来の逆DCTの説明図、第７図は本発明の
一実施例の演算方式の説明図である。 １……入力ポート、２……アナログ／デイジタル変換
器、３……フレームメモリ、４……２次元のDCT演算
器、５……符号器、６……伝送器、７……伝送ポート、
８……伝送路、９……受信ポート、10……受信器、11…
…復号器、12……２次元の逆DCT演算器、13……フレー
ムメモリ、14……デイジタル／アナログ変換器、15……
出力ポート、12a……有効係数カウンタ、12b……変換行
列、12c……アドレス変換器、12d……アドレス発生器、
12e……乗算器、12f……加算器、12g……逆ジグザグス
キヤン器。FIG. 1 is a block diagram showing a configuration of a decoding apparatus according to one embodiment of the present invention, FIG. 2 is a block diagram showing a configuration of a general encoding / decoding apparatus of a conventional example, and FIG. FIG. 4 is a block diagram of a conventional inverse orthogonal transformer, and FIG.
FIG. 6 is an explanatory diagram of a conventional inverse DCT, and FIG. 7 is an explanatory diagram of a calculation method according to an embodiment of the present invention. 1 ... input port, 2 ... analog / digital converter, 3 ... frame memory, 4 ... two-dimensional DCT calculator, 5 ... encoder, 6 ... transmitter, 7 ... transmission port,
8 transmission line, 9 reception port, 10 receiver, 11
… Decoder, 12… 2D inverse DCT calculator, 13… Frame memory, 14… Digital / analog converter, 15…
Output port, 12a: Effective coefficient counter, 12b: Conversion matrix, 12c: Address converter, 12d: Address generator,
12e: Multiplier, 12f: Adder, 12g: Inverted zigzag scanning device.
───────────────────────────────────────────────────── フロントページの続き (58)調査した分野(Int.Cl.6，ＤＢ名) H04N 7/24 - 7/68 H04N 1/41 - 1/419 G06F 17/00 - 17/28──────────────────────────────────────────────────続 き Continued on the front page (58) Field surveyed (Int.Cl. 6 , DB name) H04N 7/24-7/68 H04N 1/41-1/419 G06F 17/00-17/28
Claims (2)
コサイン変換することにより２次元の周波数成分に分解
して該２次元の周波数成分である行列の変換係数が低い
周波数成分からジグザクスキャンされて符号化され所定
の順番で伝送された変換係数を復号化の２次元逆離散コ
サイン変換することにより画像信号を復元する復号化方
式であって、 上記復号化の上記２次元逆離散コサイン変換に際して、
上記伝送された上記変換係数の順番を入れ換えて上記２
次元逆離散コサイン変換の逆変換行列との逆直交直交変
換の演算を行うを逆ジグザクスキャンするかわりに、上
記逆変換行列をアクセスするアドレス発生器の出力にア
ドレス変換器を設けることにより、上記伝送された上記
変換係数の順番を入れ換えることなく上記伝送された上
記変換係数の順番に対応する如く上記２次元逆離散コサ
イン変換の上記逆変換行列の行列を入れ換え、この入れ
換えた２次元逆離散コサイン変換の逆変換行列の行列を
用いて逆直交変換の演算を行い、上記２次元逆離散コサ
イン変換の行列演算を上記符号化により伝送される変換
係数の順番で行うことを可能としたことを特徴とする復
号化方式。An image data including a plurality of pixels is subjected to a two-dimensional discrete cosine transform so as to be decomposed into two-dimensional frequency components, and zigzag scanning is performed from a frequency component having a low conversion coefficient of a matrix which is the two-dimensional frequency component. A decoding method for restoring an image signal by performing a two-dimensional inverse discrete cosine transform for decoding of transform coefficients that have been encoded and transmitted in a predetermined order. ,
By changing the order of the transmitted transform coefficients,
By performing an inverse orthogonal orthogonal transform operation with an inverse transform matrix of a dimensional inverse discrete cosine transform, instead of performing an inverse zigzag scan, by providing an address converter at the output of an address generator that accesses the inverse transform matrix, the above-described transmission is achieved. Without changing the order of the transformed coefficients, the matrix of the inverse transform matrix of the two-dimensional inverse discrete cosine transform is exchanged so as to correspond to the order of the transmitted transform coefficients, and the exchanged two-dimensional inverse discrete cosine transform is performed. The inverse orthogonal transform is performed using the matrix of the inverse transform matrix of the above, and the matrix operation of the two-dimensional inverse discrete cosine transform can be performed in the order of the transform coefficients transmitted by the encoding. The decoding method to use.
である行列の変換係数を計測する有効係数カウンタを設
け、該有効係数カウンタの出力により上記２次元逆離散
コサイン変換の上記行列演算の回数を制限することを特
徴とする請求項１記載の復号化方式。2. An effective coefficient counter for measuring a transform coefficient of a matrix which is the encoded two-dimensional frequency component is provided, and an output of the effective coefficient counter is used to execute the matrix operation of the two-dimensional inverse discrete cosine transform. 2. The decoding method according to claim 1, wherein the number of times is limited.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP30461389A JP2846004B2 (en) | 1989-11-27 | 1989-11-27 | Decoding method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP30461389A JP2846004B2 (en) | 1989-11-27 | 1989-11-27 | Decoding method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| JPH03166824A JPH03166824A (en) | 1991-07-18 |
| JP2846004B2 true JP2846004B2 (en) | 1999-01-13 |
Family
ID=17935121
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP30461389A Expired - Fee Related JP2846004B2 (en) | 1989-11-27 | 1989-11-27 | Decoding method |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JP2846004B2 (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2845098B2 (en) * | 1992-08-26 | 1999-01-13 | 国際電信電話株式会社 | Decoding method and apparatus for multi-level image compression code |
| AU2977497A (en) * | 1997-05-30 | 1998-12-30 | Kubota Systems Inc. | Data compressing device by permutation encoding and decompressing device |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS617976A (en) * | 1984-06-22 | 1986-01-14 | Mitsubishi Electric Corp | Vector operation processor |
| JPS622721A (en) * | 1985-06-28 | 1987-01-08 | Nec Corp | Coding and decoding device for picture signal |
| JPS62219887A (en) * | 1986-03-20 | 1987-09-28 | Fujitsu Ltd | Encoding device between movement compensation frame |
| JPS6441970A (en) * | 1987-08-08 | 1989-02-14 | Nec Corp | Vector arithmetic unit |
-
1989
- 1989-11-27 JP JP30461389A patent/JP2846004B2/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| JPH03166824A (en) | 1991-07-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR100510756B1 (en) | Image decoding apparatus and method and image reproducing apparatus | |
| JPH06237386A (en) | Picture processing unit | |
| JP4688988B2 (en) | Video data compression method and apparatus, and decompression method and apparatus | |
| US7050656B2 (en) | Image scaling in the compressed domain | |
| JP2000341689A (en) | Wavelet inverse converting device and its method and wavelet decoding device and its method | |
| JPH09200757A (en) | Encoder, decoder and data transmitter | |
| JP2846004B2 (en) | Decoding method | |
| JPH0787491A (en) | Quantization device, inverse quantization device, picture processing unit and quantization method, reversed quantization method and picture processing method | |
| JPH07143488A (en) | Method and device for decoding image data | |
| JPH06334986A (en) | Weighted cosine transform method | |
| JPS6041915B2 (en) | Image signal encoding processing method | |
| Chokchaitam et al. | A new unified lossless/lossy image compression based on a new Integer DCT | |
| JP2858774B2 (en) | Encoding / decoding device | |
| JP4680377B2 (en) | How to improve the speed and efficiency of electronic data decompression | |
| JPH02122767A (en) | Encoding/decoding system for picture signal | |
| JPH07114533A (en) | Inverse discrete cosine converter | |
| JP3233249B2 (en) | Decoding device and method | |
| JPH08180194A (en) | Method and device for coding | |
| JP3363536B2 (en) | Color image processing apparatus and color image processing method | |
| JP2839944B2 (en) | Image data processing method | |
| JPH02154571A (en) | Still picture decoding system and its device | |
| JPH0795415A (en) | Method and device for picture communication | |
| EP0917105A2 (en) | Real time decoding of reduced digital video | |
| JPH06233276A (en) | Picture encoder | |
| JPH04266282A (en) | Picture decoder |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| LAPS | Cancellation because of no payment of annual fees |