JPH06177774A - Method and device for reproducing pictures - Google Patents

Method and device for reproducing pictures

Info

Publication number
JPH06177774A
JPH06177774A JP4325326A JP32532692A JPH06177774A JP H06177774 A JPH06177774 A JP H06177774A JP 4325326 A JP4325326 A JP 4325326A JP 32532692 A JP32532692 A JP 32532692A JP H06177774 A JPH06177774 A JP H06177774A
Authority
JP
Japan
Prior art keywords
scanning
order
code
dimensional code
image
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.)
Withdrawn
Application number
JP4325326A
Other languages
Japanese (ja)
Inventor
Sachihiro Noguchi
祥宏 野口
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Asahi Chemical Industry Co Ltd
Original Assignee
Asahi Chemical Industry Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Asahi Chemical Industry Co Ltd filed Critical Asahi Chemical Industry Co Ltd
Priority to JP4325326A priority Critical patent/JPH06177774A/en
Publication of JPH06177774A publication Critical patent/JPH06177774A/en
Withdrawn legal-status Critical Current

Links

Landscapes

  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Compression Of Band Width Or Redundancy In Fax (AREA)

Abstract

PURPOSE:To simply exchange the scanning order of two-step scanning and to reduce the load of hardware by performing a two dimensional code scanning in the order of scanning in reverse orthogonal transformation. CONSTITUTION:When a zigzag scanning is restored in a code allocation decoding section 5, the data input order of 1 2 3 ... 15 16 is changed to the order of that the scanning of the two dimensional code is performed in the order of scanning in the reverse orthogonal transformation by one processing as 1 7 2 6 10 16 11 15 3 13 5 8 4 14 9 12 by taking the arithmetic order change of a high-speed arithmetic algorithm in an information extraction decoding section 9 into account. Thus, the two blocks of buffers are conventionally required for the double intra-block order change but now one block of buffer can perform the processing of order change executed in two steps before once. Accordingly, the capacity of buffer memory to be used for the scanning order change can be halved.

Description

【発明の詳細な説明】Detailed Description of the Invention

【0001】[0001]

【産業上の利用分野】本発明は高能率符号化により圧縮
された画像信号を効率的に復号化して画像を再生する画
像再生方法および画像再生装置に関する。
BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an image reproducing method and an image reproducing apparatus for efficiently decoding an image signal compressed by high efficiency coding to reproduce an image.

【0002】[0002]

【従来の技術】圧縮画像情報伸長のための情報源復号器
の代表的な構成は、例えば図1に示すように、エントロ
ピー復号部1,FIFO(ファスト・イン・ファスト・
アウト)バッファ3,符号割当復号部5,逆量子化部7
および情報抽出復号部9からなる。エントロピー復号部
1では入力した可変長圧縮画像データのエントロピー符
号(ハフマン符号,ランレングス符号等)をエントロピ
ー符号化前の2次元符号に復号する。FIFOバッファ
3はエントロピー復号部1の非同期動作を符号割当復号
部5,逆量子化部7および情報抽出復号部9の同期動作
に合わせ込むためのメモリである。符号割当復号部5で
は2次元符号復号処理およびブロック内スキャン順序変
換等により量子化係数データを得る。逆量子化部7はこ
の量子化係数データを逆量子化により変換して非線形量
子化データを実現する。情報抽出復号部9では予測符号
復号処理およびアダマール変換処理等の逆直交変換を行
うことで、実画像データを得る。
2. Description of the Related Art A typical configuration of an information source decoder for decompressing compressed image information is, for example, as shown in FIG. 1, an entropy decoding unit 1 and a FIFO (fast in fast
Out) buffer 3, code assignment decoding unit 5, dequantization unit 7
And an information extraction / decoding unit 9. The entropy decoding unit 1 decodes the entropy code (Huffman code, run length code, etc.) of the input variable length compressed image data into a two-dimensional code before entropy coding. The FIFO buffer 3 is a memory for matching the asynchronous operation of the entropy decoding unit 1 with the synchronous operation of the code assignment decoding unit 5, the dequantization unit 7, and the information extraction decoding unit 9. The code assignment decoding unit 5 obtains quantized coefficient data by two-dimensional code decoding processing, intra-block scan order conversion, and the like. The inverse quantization unit 7 transforms this quantized coefficient data by inverse quantization to realize nonlinear quantized data. The information extraction / decoding unit 9 obtains actual image data by performing inverse orthogonal transformation such as prediction code decoding processing and Hadamard transformation processing.

【0003】以上のうち、符号割当復号部5において
は、1ブロックごとにジグザグ走査を行い、ゼロ・ラン
長と非ゼロ係数を組み合わせた符号(2次元事象)を復
号するため、情報抽出復号部9における直交変換係数を
低周波成分から高周波成分へと走査するジグザグ走査を
ブロック内の通常の2次元行列の走査方向に変換する必
要がある。
Of the above, the code assignment decoding unit 5 performs zigzag scanning for each block and decodes a code (two-dimensional event) in which a zero run length and a non-zero coefficient are combined. It is necessary to convert the zigzag scan for scanning the orthogonal transform coefficient in 9 from the low frequency component to the high frequency component in the scan direction of the normal two-dimensional matrix in the block.

【0004】また、情報抽出復号部9では一般に直交変
換が用いられることが多く、低周波成分から高周波成分
へと順序良く並んだ直交変換係数に対しここで用いる直
交変換の高速演算アルゴリズムの演算順序に合わせるた
め特殊なブロック内走査順序が用いられる。この走査順
序は高速演算アルゴリズムの内容(種類)に応じて変化
し、いろいろなパターンがある。
The information extraction / decoding unit 9 generally uses orthogonal transform in many cases, and the orthogonal transform coefficients arranged in order from the low-frequency component to the high-frequency component are arranged in order. A special intra-block scan order is used to match This scanning order changes according to the content (type) of the high speed operation algorithm, and there are various patterns.

【0005】これを4×4のブロックの例で具体的に説
明すると、従来の情報源復号器においては4×4=16
(画素)の入力データ順序が 1→2→3→4→5→6→7→8→9→10→11→1
2→13→14→15→16 とすると、まず符号割当復号部5においてジグザグ走査
を元に戻して、図2の(A)に示すように、 1→2→6→7→3→5→8→13→4→9→12→1
4→10→11→15→16 とし、さらに情報抽出復号部9において、高速演算アル
ゴリズムの演算順序に変換して、上記のデータ順序を図
2の(B)に示すように、 1→7→2→6→10→16→11→15→3→13→
5→8→4→14→9→12 とする。
This will be described in detail with an example of a 4 × 4 block. In the conventional information source decoder, 4 × 4 = 16.
The input data order of (pixel) is 1 → 2 → 3 → 4 → 5 → 6 → 7 → 8 → 9 → 10 → 11 → 1
2 → 13 → 14 → 15 → 16, first, the zigzag scanning is restored in the code allocation decoding unit 5, and as shown in FIG. 2A, 1 → 2 → 6 → 7 → 3 → 5 → 8 → 13 → 4 → 9 → 12 → 1
4 → 10 → 11 → 15 → 16, and further, in the information extraction / decoding unit 9, the data is converted into the operation order of the high speed operation algorithm, and the above data order is changed to 1 → 7 → as shown in FIG. 2 → 6 → 10 → 16 → 11 → 15 → 3 → 13 →
5 → 8 → 4 → 14 → 9 → 12.

【0006】[0006]

【発明が解決しようとする課題】このように、上述のよ
うな従来装置にあっては、符号割当復号部と情報抽出復
号部の2つの機能ブロックにおいてそれぞれ1ブロック
単位の走査順序変換が行われている。1ブロック内の走
査順序変換を行うためには、1ブロック分のデータをバ
ッファする必要があり、そのため1ブロック内の走査順
序変換を従来のように2回行うためには2ブロック分の
バッファ・メモリが必要となる。
As described above, in the conventional apparatus as described above, the scanning order conversion is performed in units of one block in each of the two functional blocks of the code assignment decoding unit and the information extraction decoding unit. ing. In order to perform the scan order conversion within one block, it is necessary to buffer the data for one block. Therefore, in order to perform the scan order conversion within one block twice as in the conventional case, a buffer for two blocks must be used. Requires memory.

【0007】従って、従来技術では2回の走査順序変換
の必要からハードウエアの負荷がかなり重いものとな
り、また処理速度の点からも好ましくなかった。
Therefore, in the prior art, the load on the hardware is considerably heavy due to the necessity of performing the scanning order conversion twice, and it is not preferable in terms of processing speed.

【0008】本発明の目的は、上述の点に鑑みて、2回
の走査順序変換を簡単にし、しかもハードウエアの負荷
を軽減できる走査順序変換方式の画像再生方法および画
像再生装置を提供することにある。
In view of the above points, an object of the present invention is to provide an image reproducing method and an image reproducing apparatus of a scanning order conversion system which can simplify the scanning order conversion twice and reduce the load of hardware. It is in.

【0009】[0009]

【課題を解決するための手段】上記目的を達成するた
め、本発明は、可変長符号を2次元符号に復号し、さら
に逆直交変換を行うことにより画像を再生する画像再生
方法において、前記2次元符号の走査を前記逆直交変換
における走査順序で行うことを特徴とする。
To achieve the above object, the present invention provides an image reproducing method for reproducing an image by decoding a variable length code into a two-dimensional code and further performing an inverse orthogonal transform. The scanning of the dimensional code is performed in the scanning order in the inverse orthogonal transform.

【0010】また、本発明は、可変長符号を2次元符号
に復号し、さらに逆直交変換を行うことにより画像を再
生する画像再生装置において、前記2次元符号の走査を
前記逆直交変換における走査順序で行う復号手段を有す
ることを特徴とする。
Further, according to the present invention, in an image reproducing apparatus for reproducing an image by decoding a variable length code into a two-dimensional code and further performing an inverse orthogonal transformation, the scanning of the two-dimensional code is performed in the inverse orthogonal transformation. It is characterized in that it has a decoding means for performing in order.

【0011】また、本発明は、可変長符号を2次元符号
に復号し、逆量子化の後、さらに逆直交変換を行うこと
により画像を再生する画像再生装置において、逆量子化
テーブルを前記逆直交変換の走査順序で形成する手段を
有することを特徴とすることができる。
Further, according to the present invention, in an image reproducing apparatus for reproducing an image by decoding a variable-length code into a two-dimensional code, performing inverse quantization, and further performing inverse orthogonal transformation, the inverse quantization table is used for the inverse quantization table. It can be characterized in that it has means for forming in a scanning order of orthogonal transformation.

【0012】[0012]

【作用】情報源復号器における符号割当復号部でのジグ
ザグスキャン/ラスタ・スキャン変換と、情報抽出復号
部での高速アダマール変換用の順序変換を本発明では、
符号割当復号部において1度にまとめて行う。すなわ
ち、2次元符号の走査を逆直交変換における走査順序で
行う。このように本発明では従来の2回のブロック内走
査順序変換を1度に行うので、必要なバッファメモリの
容量が削減でき、ハードウエアが軽減でき、ひいては処
理時間の短縮も得られる。
According to the present invention, the zigzag scan / raster scan conversion in the code allocation decoding unit in the information source decoder and the order conversion for high speed Hadamard conversion in the information extraction decoding unit are performed according to the present invention.
The code allocation decoding unit collectively performs the processing at once. That is, the scanning of the two-dimensional code is performed in the scanning order in the inverse orthogonal transform. As described above, in the present invention, the conventional intra-block scanning order conversion is performed twice, so that the required buffer memory capacity can be reduced, the hardware can be reduced, and the processing time can be shortened.

【0013】[0013]

【実施例】以下、図面を参照して本発明の実施例を詳細
に説明する。
Embodiments of the present invention will now be described in detail with reference to the drawings.

【0014】本発明の一実施例で用いる情報源復号器の
概略構成はほぼ図1と同様であるので、その詳細な説明
は省略する。ただし、従来、符号割当復号部5と情報抽
出復号部9の2つの機能ブロックで別々に行われていた
走査順序変換を、本発明実施例では以下に述べるように
符号割当復号部5において1度にまとめて行う。
The schematic structure of the information source decoder used in the embodiment of the present invention is almost the same as that shown in FIG. 1, and the detailed description thereof is omitted. However, in the embodiment of the present invention, the scan order conversion, which has conventionally been performed separately in the two functional blocks of the code assignment decoding unit 5 and the information extraction decoding unit 9, is performed once in the code assignment decoding unit 5 as described below. Will be done together.

【0015】すなわち、符号割当復号部5においてジグ
ザグ走査を元に戻すときに、情報抽出復号部9における
高速演算アルゴリズムの演算順序変換も考慮し、 1→2→3→4→5→6→7→8→9→10→11→1
2→13→14→15→16 のデータ入力順序を1度に、図3の(A)(図3の
(B)は(A)の順序のみ矢印線で示したもの)に示す
ように、 1→7→2→6→10→16→11→15→3→13→
5→8→4→14→9→12 と変換する。すなわち、2次元符号の走査を逆直交変換
における走査順序で行う。
That is, when the zigzag scanning is restored in the code allocation decoding unit 5, the operation order conversion of the high speed operation algorithm in the information extraction decoding unit 9 is also taken into consideration, and 1 → 2 → 3 → 4 → 5 → 6 → 7. → 8 → 9 → 10 → 11 → 1
The data input order of 2 → 13 → 14 → 15 → 16 at once is as shown in (A) of FIG. 3 ((B) of FIG. 3 shows only the order of (A) by an arrow line). 1 → 7 → 2 → 6 → 10 → 16 → 11 → 15 → 3 → 13 →
Converted as 5 → 8 → 4 → 14 → 9 → 12. That is, the scanning of the two-dimensional code is performed in the scanning order in the inverse orthogonal transform.

【0016】こうすることにより、上述した図2に示す
ような従来2回のブロック内順序変換のために2ブロッ
ク分のバッファが必要であったものが、1ブロック分の
バッファで実質2回分の順序変換が1度に行える。な
お、符号割当復号部5と情報抽出復号部9との間にある
逆量子化部7は各々のデータに対して独立の操作である
からデータの演算順序は自由にでき、その演算順序はハ
ードウエアの負荷には影響しない。
As a result, a buffer for two blocks is conventionally required for two intra-block order conversions as shown in FIG. 2 described above, but a buffer for one block is actually used for two times. The order conversion can be done at once. Since the dequantization unit 7 between the code assignment decoding unit 5 and the information extraction decoding unit 9 is an independent operation for each data, the operation order of the data can be freely set, and the operation order is hardware. It does not affect the wear load.

【0017】従って、本発明実施例によれば、走査順序
変換に用いるバッファメモリの容量も半減することがで
き、しかもその順序変換を実現するハードウエアの負荷
も軽減することができて、処理速度の高速化にも寄与す
る。
Therefore, according to the embodiment of the present invention, the capacity of the buffer memory used for the scanning order conversion can be reduced by half, and the load of the hardware for realizing the order conversion can be reduced, and the processing speed can be reduced. It also contributes to speeding up.

【0018】なお、本発明は上記図3に限定されず、そ
の走査順序は高速演算アルゴリズムの内容に応じて変化
し、いろいろなパターンが適用できることは勿論であ
る。
Note that the present invention is not limited to the above-mentioned FIG. 3, and the scanning order thereof can be changed according to the contents of the high speed operation algorithm, and various patterns can be applied.

【0019】また、上記の逆量子化部7における逆量子
化テーブルを逆直交変換の走査順序で形成しても同様の
効果が得られる。
The same effect can be obtained by forming the inverse quantization table in the inverse quantization section 7 in the scanning order of the inverse orthogonal transform.

【0020】[0020]

【発明の効果】以上説明したように、本発明によれば、
従来2回行っていた走査順序変換処理を1度にまとめて
行う、つまり2次元符号の走査を逆直交変換における走
査順序で行うようにしたので、バッファ・メモリの容量
を半減することができ、しかもその順序変換を実現する
ハードウエアの負荷も軽減し、処理スピードも向上する
という効果が得られる。
As described above, according to the present invention,
Since the scanning order conversion processing which has conventionally been performed twice is collectively performed at one time, that is, the scanning of the two-dimensional code is performed in the scanning order in the inverse orthogonal conversion, the capacity of the buffer memory can be halved. In addition, the load of the hardware for realizing the order conversion is reduced, and the processing speed is improved.

【図面の簡単な説明】[Brief description of drawings]

【図1】本発明が適用可能な画像再生装置の情報源復号
器の概略構成を示すブロック図である。
FIG. 1 is a block diagram showing a schematic configuration of an information source decoder of an image reproducing device to which the present invention can be applied.

【図2】従来の走査順序変換方式を示す図である。FIG. 2 is a diagram showing a conventional scan order conversion system.

【図3】本発明の一実施例の走査順序変換方式を示す図
である。
FIG. 3 is a diagram showing a scanning order conversion system according to an embodiment of the present invention.

【符号の説明】[Explanation of symbols]

1 エントロピー復号部 3 FIFOバッファ 5 符号割当復号部 7 逆量子化部 9 情報抽出復号部 1 Entropy Decoding Unit 3 FIFO Buffer 5 Code Assignment Decoding Unit 7 Inverse Quantization Unit 9 Information Extraction Decoding Unit

Claims (3)

【特許請求の範囲】[Claims] 【請求項1】 可変長符号を2次元符号に復号し、さら
に逆直交変換を行うことにより画像を再生する画像再生
方法において、 前記2次元符号の走査を前記逆直交変換における走査順
序で行うことを特徴とする画像再生方法。
1. An image reproducing method for reproducing an image by decoding a variable length code into a two-dimensional code and further performing an inverse orthogonal transform, wherein scanning of the two-dimensional code is performed in a scanning order in the inverse orthogonal transform. Image reproduction method characterized by.
【請求項2】 可変長符号を2次元符号に復号し、さら
に逆直交変換を行うことにより画像を再生する画像再生
装置において、 前記2次元符号の走査を前記逆直交変換における走査順
序で行う復号手段を有することを特徴とする画像再生装
置。
2. An image reproducing apparatus for reproducing an image by decoding a variable-length code into a two-dimensional code and further performing an inverse orthogonal transform, wherein the two-dimensional code is scanned in a scanning order in the inverse orthogonal transform. An image reproducing apparatus comprising means.
【請求項3】 可変長符号を2次元符号に復号し、逆量
子化の後、さらに逆直交変換を行うことにより画像を再
生する画像再生装置において、 逆量子化テーブルを前記逆直交変換の走査順序で形成す
る手段を有することを特徴とする画像再生装置。
3. An image reproducing apparatus for reproducing an image by decoding a variable-length code into a two-dimensional code, performing inverse quantization and then performing inverse orthogonal transformation, and scanning an inverse quantization table for the inverse orthogonal transformation. An image reproducing apparatus having means for forming in order.
JP4325326A 1992-12-04 1992-12-04 Method and device for reproducing pictures Withdrawn JPH06177774A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP4325326A JPH06177774A (en) 1992-12-04 1992-12-04 Method and device for reproducing pictures

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP4325326A JPH06177774A (en) 1992-12-04 1992-12-04 Method and device for reproducing pictures

Publications (1)

Publication Number Publication Date
JPH06177774A true JPH06177774A (en) 1994-06-24

Family

ID=18175571

Family Applications (1)

Application Number Title Priority Date Filing Date
JP4325326A Withdrawn JPH06177774A (en) 1992-12-04 1992-12-04 Method and device for reproducing pictures

Country Status (1)

Country Link
JP (1) JPH06177774A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2011125038A (en) * 2004-12-31 2011-06-23 Microsoft Corp Adaptive coefficient scan order

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2011125038A (en) * 2004-12-31 2011-06-23 Microsoft Corp Adaptive coefficient scan order
US8311119B2 (en) 2004-12-31 2012-11-13 Microsoft Corporation Adaptive coefficient scan order
US8824557B2 (en) 2004-12-31 2014-09-02 Microsoft Corporation Adaptive coefficient scan order

Similar Documents

Publication Publication Date Title
JP2837819B2 (en) Digital signal decoder system
JPH0377477A (en) Method and apparatus for variable length coding
CA2151023A1 (en) Method of coding/decoding of a data stream
KR970064260A (en) Method and apparatus for decoding digital image sequence
US6628717B1 (en) Lossless coding method and video compression coding device using the same
US20050125475A1 (en) Circuit sharing of MPEG and JPEG on IDCT
JP2004356850A (en) Expanding apparatus for compressed moving picture and image display apparatus employing the same
JP2004356851A (en) Compression apparatus for moving picture and imaging apparatus employing the same
KR20000034993A (en) Reduced-error processing of transformed digital data
JP2002112268A (en) Compressed image data decoding apparatus
JPH06177774A (en) Method and device for reproducing pictures
JP2829246B2 (en) Image expansion device
JPH02132972A (en) Method and device for picture compressing using discrete cosine transformation
US7043086B2 (en) JPEG packed block data structure for enhanced image processing
JPH02131671A (en) Picture data compression method
JP2841643B2 (en) Image processing device
JPH08242450A (en) Image coder and image decoder
KR100298456B1 (en) Device for decoding moving picture and method for the same
JPH11146397A (en) Moving image compression coding/decoding method, moving image compression coder/decoder, moving image coding transmission method/system, and recording medium for moving image compression coding/decoding program
JP2002209209A (en) Image companding system
JPH0377476A (en) Method and apparatus for variable length coding
JPH11239349A (en) Image compressor
KR20040073095A (en) A Device for Both Encoding and Decoding MPEG or JPEG Data
CN116614632A (en) Image compression method, system and device applied to LED display control system
JP3642530B2 (en) Video decoding device

Legal Events

Date Code Title Description
A300 Withdrawal of application because of no request for examination

Free format text: JAPANESE INTERMEDIATE CODE: A300

Effective date: 20000307