← Back to Patent Explorer
US5054103A Expired / Lapsed US ⏱️ 0.0 years remaining

Picture encoding system

Assignee: Panasonic Electric Works Co Ltd
•
Filing: 1988-09-22
•
Granted: 1991-10-01
•
Expires: 2008-09-22
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A picture encoding system which performs a prediction of picture element values within a block having a plurality of picture elements into which an original picture is divided, a discrete sine transform with respect to prediction error signals for obtaining a transform coefficient, a quantization of the transform coefficient for encoding quantized indexes, an inverse quantization of the quantized indexes for reproduction of the transform coefficient, an inverse discrete sine transform of the reproduced coefficient to reproduce the prediction error signal, and an addition thereto of the predicted picture element value for reproducing the picture element values within the block to employ them in predicting a next stage block to be encoded, whereby the block can be minimized in size while simplifying required transform operation.

Inventors

  • 👤 Akira Yasuda
  • 👤 Hiroyoshi Yuasa
  • 👤 Satoshi Furukawa
  • 👤 Nobuo Matsuo
  • 👤 Hisataka Fujii
  • 👤 Masami Hisada
  • 👤 Yoshihiko Tokunaga
  • 👤 Tadashi Satake
  • 👤 Hiroshi Hamada
  • 👤 Yoshitaka Morikawa
  • 👤 Nobumoto Yamane

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 22:24
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/42; H04N19/423; H04N19/10; H04N19/134; H04N19/146; H04N19/152; H04N19/60; H04N19/61; H04N19/50

Claims Analysis

Total Claims: 19
Claim 1
Independent Claim 188 words
A picture encoding system wherein the picture is divided into blocks, having a plurality of picture elements, comprising: a prediction means for predicting picture element values within the blocks, obtaining predicted values, and thereafter obtaining prediction error signals based on differences between the predicted values and true values; a discrete sine transform means for carrying out a discrete sine transform with the obtained prediction error signals to obtain transform coefficients; a quantization means for quantizing the obtained transform coefficients and obtaining quantized indexes; an encoding means for encoding the obtained quantized indexes; an inverse quantization means for inversely quantizing the quantized indexes to reproduce the transform coefficients; an inverse discrete sine transform means for carrying out an inverse discrete sine transform with the reproduced transform coefficients to reproduce the transform coefficients; a reproduction means for reproducing the picture element values within the block by adding the reproduced prediction error signals to the predicted values; said prediction means obtaining, through extrapolation prediction, predicted element values for each block to be encoded by employing part of the reproduced picture element values of blocks adjacent to the blocks to be encoded.
Claim 2
Dependent Claim 188 words
A picture encoding system wherein the picture is divided into blocks, having a plurality of picture elements, comprising: a prediction means for predicting picture element values within the blocks, obtaining predicted values, and thereafter obtaining prediction error signals based on differences between the predicted values and true values; a discrete sine transform means for carrying out a discrete sine transform with the obtained prediction error signals to obtain transform coefficients; a quantization means for quantizing the obtained transform coefficients and obtaining quantized indexes; an encoding means for encoding the obtained quantized indexes; an inverse quantization means for inversely quantizing the quantized indexes to reproduce the transform coefficients; an inverse discrete sine transform means for carrying out an inverse discrete sine transform with the reproduced transform coefficients to reproduce the transform coefficients; a reproduction means for reproducing the picture element values within the block by adding the reproduced prediction error signals to the predicted values; said prediction means obtaining, through extrapolation prediction, predicted element values for each block to be encoded by employing part of the reproduced picture element values of blocks adjacent to the blocks to be encoded.
Claim 3
Dependent Claim 37 words
A system according to claim 1, wherein said quantization means is formed to have an input signal of a complementary representation of "2" and an ouput signal carrying an absolute value representation of data to be quantized.
Claim 4
Dependent Claim 41 words
A system according to claim 1, wherein said prediction means employs said picture element values of adjacent blocks which have been previously encoded and reproduced, as initial values for said prediction, when encoding top edge and left side edge positioned blocks.
Claim 5
Dependent Claim 33 words
A system according to claim 1, wherein said discrete sine transform means and inverse discrete sine transform means carry out said discrete sine transform and inverse discrete sine transform in two dimensional manner.
Claim 6
Dependent Claim 129 words
A system according to claim 4, wherein said discrete sine transform means includes a memory for storing said prediction error signals in respect of one of said blocks, a row transformer including accumulative adders corresponding in number to rows of a transforming matrix and capable of obtaining a one dimensional transform corresponding to one wave number which is a change-over of the row in the matrix, and a column transformer including accumulative adders corresponding in number to columns of said matrix and having different row components; said two dimensional discrete sine transform is carried out by reading prediction error signals out of said memory sequentially corresponding times to the number of columns in the block and changing over every time the row in the matrix of the row tramsformer.
Claim 7
Dependent Claim 102 words
A system according to claim 4, wherein said discrete sine transform means and said inverse discrete sine transform means comprise respectively a plurality of over transformers for carrting out a one dimensional discrete sine transform, a plurality of column transformers of the same arrangement as said row transformers, and means for carrying out a row-column exchange by changing over accumulating direction in vertical and horizontal directions for every block so that said two dimensional discrete sine transform and said two dimensional inverse discrete sine transform will be performed by providing data on each row to said transformers in parallel and sequential manner.
Claim 8
Dependent Claim 42 words
A system according to claim 1, wherein said discrete sine transform means employs as said discrete sine transform an integer orthogonal transform which approximates the discrete sine transform with an orthogonal relationship maintained, and has an integer number of transform matrix components.
Claim 9
Dependent Claim 17 words
A system according to claim 7, wherein said integer orthogonal transform is of a transform matrix: ##EQU13##
Claim 10
Dependent Claim 53 words
A system according to claim 1, wherein said quantization means compares said transform coefficients with a predetermined threshold value, and quantizes the transform coefficients which are larger than said threshold value only as significant coefficients, while other transform coefficients smaller than the threshold value are rounded off to be zero as insignificant coefficients.
Claim 11
Dependent Claim 36 words
A system according to claim 9, said quantization means causes asid threshold value to vary in response to discrimination of said significant and insignificant coefficients for a plurality of said blocks adjacent said block being encoded.
Claim 12
Dependent Claim 47 words
A system according to claim 9, wherein said quantization means sets said threshold value to be lower for quantizing said transform coefficients corresponding to low frequency components in a train of the transform coefficients than that for the coefficients corresponding to high frequency components in said train.
Claim 13
Dependent Claim 47 words
A system according to claim 9, wherein said quantization means quantizes said transform coefficients corresponding to low frequency components in a train of the coefficients with a quantizing step width set to be smaller than that for the coefficients corresponding to high frequency components in said train.
Claim 14
Dependent Claim 27 words
A system according to claim 9, wherein said encoding means encodes said quantized indexes of said significant coefficients and positions in said block of the significant coefficients.
Claim 15
Dependent Claim 58 words
A system according to claim 13, wherein said encoding means carries out said encoding of said positions in said block of said significant coefficients by assigning a variable length code to the positions on the basis of tables corresponding to respective disposition patterns of said significant coefficients in each of said blocks in a one to one relationship.
Claim 16
Dependent Claim 39 words
A system according to claim 14, wherein said encoding means carries out said encoding by dividing each of said blocks at least into two zones, and dividing said disposition patterns of said significant coefficients into at least two groups.
Claim 17
Dependent Claim 43 words
A system according to claim 15, wherein said encoding means encodes said disposition patterns of said significant coefficients in a train of said transform coefficients within each of said divided zones by reference to a variable code table common to the respective zones.
Claim 18
Dependent Claim 40 words
A system according to claim 1, wherein said prediction, discrete sine transform, quantization, inverse quantization, inverse discrete sine transform and reproduction means are operated in a pipe-line arrangement, with said blocks scanned sequentially in diagonal direction for their pipe-line processing.
Claim 19
Dependent Claim 90 words
A system according to claim 1, wherein said prediction, discrete sine transform, quantization, inverse quantization, inverse discrete sine transform and reproduction means are arranged for pipe-line processing of said blocks, said pipe-line processing being carried out sequentially with respect to each of said blocks taken out of respective zones in said original picture, and being continued for the blocks in other zones until said picture element values in the blocks of one of the zones are reproduced and prediction of one of the blocks to be next encoded becomes possible.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1994-09-30 1995-04-01 1995-10-01 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1998-09-30 1999-04-01 1999-10-01 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2002-09-30 2003-04-01 2003-10-01 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag