Patent EP0084270A2 successfully refreshed from Google Patents.
← Back to Patent Explorer
EP0084270A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Video bandwidth reduction system employing interframe block differencing and transform domain coding

Assignee: Compression Labs Inc
•
Filing: 1982-12-31
•
Granted: —
•
Expires: 2002-12-31
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Video type information signals are compressed for transmission and reproduction by comparing corresponding blocks of time domain information signals from successive fields, converting a block of the time domain information signals to a transform domain signal represented by discrete cosine transform coefficients when the difference between the corresponding blocks exceeds a block difference threshold, and encoding the transform domain coefficients for transmission to a decoding site. Corresponding blocks of time domain information signals from successive fields are compared by storing the successive fields in memory on a pixel by pixel basis, retrieving each block on a pixel by pixel basis, forming the difference between corresponding pixels from the successive blocks, squaring the resulting difference signal, summing the squares and dividing by the number of pixels per block. Successive fields are merged by weighted summing of corresponding pixels. Blocks are converted by first transforming individual samples along the horizontal direction, and then transforming the same block samples along the vertical direction, the transformed coefficients being stored in a diagonal memory unit along with a block address code and block averaged quadrature chrominance characters. Each converted block stored in the diagonal memory is encoded using a plurality of unique code tables. A dedicated block address code table is constructed using a unique algorithm; the remaining code tables are Huffman coded tables, one dedicated to the D.C. transform coefficient term, two other tables dedicated to the quadrature component characters, and the remaining tables (including the two chroma tables) being selected on a coefficient by coefficient basis using an algorithm based on the predictive mean value of the cosine coefficient terms. The cosine coefficient terms are also quantized prior to encoding by dividing the coefficient by a variable parametric value D k , which is a measure of the fullness of the transmission buffer, and which is changed in value after each block of codes is loaded into the buffer. The D k value is also used to adjust the value of the block difference threshold. The block codes are assembled in a transmission buffer in the order of generation and are transmitted to a decoding site along with initialization values for D k and a buffer fullness parameter B k . At the decoding site, the received code characters are decoded using an inverse processing resulting in recapture of the initial video signals. The luminance and chrominance components are initially processed by subsampling and averaging to produce further compression.

Inventors

  • 👤 Eric R. Hamilton
  • 👤 Stanley C. Fralick
  • 👤 Robert D. Widergren
  • 👤 Andrew G. Tescher

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-06 08:40
CPC Classifications
H; H04; H04N; H04N11/00; H04N11/04; H04N11/042; H04N11/044; H04N19/00; H04N19/10; H04N19/134; H04N19/146; H04N19/147; H04N19/154; H04N19/169; H04N19/17; H04N19/176; H04N19/50; H04N19/503; H04N19/507; H04N19/60; H04N19/102; H04N19/13; H04N19/90; H04N19/91

Claims Analysis

Total Claims: 15
Claim 1
Independent Claim 95 words
A method for processing time domain information signals having a successive field format to effect substantial compression of said signals, said method comprising the steps of: comparing corresponding blocks of time domain information signals from successive fields; converting a block of said time domain information signals to a transform domain signal represented by a D.C. coefficient representing the average intensity of a converted block and a plurality of discrete cosine transform coefficients when the difference between said corresponding blocks exceeds a first variable parametric value; and - encoding said transform domain coefficients for subsequent utilization.
Claim 2
Independent Claim 95 words
A method for processing time domain information signals having a successive field format to effect substantial compression of said signals, said method comprising the steps of: comparing corresponding blocks of time domain information signals from successive fields; converting a block of said time domain information signals to a transform domain signal represented by a D.C. coefficient representing the average intensity of a converted block and a plurality of discrete cosine transform coefficients when the difference between said corresponding blocks exceeds a first variable parametric value; and - encoding said transform domain coefficients for subsequent utilization.
Claim 3
Independent Claim 178 words
A method of encoding transform coefficients representing time domain information signals having a successive field format prior to transmission over a communication link in order to effect substantial compression of said signals, said transform coefficients being arranged in a plurality of groups, each group representing an N by N block of field information signals, said method comprising the steps of: (a) providing a plurality of code tables: (b) generating.a block address code from a first dedicated one of said code tables, said block address code representing the field address of the block represented by a group of said transform coefficients; (c) generating a DC coefficient code representing the average intensity of said block from a second dedicated one of said plurality of code tables; and (d) generating a succession of codes representing the remaining transform coefficients corresponding to said block by calculating the predictive value of each said remaining transform coefficient, selecting one of said plurality of code tables in accordance with said predictive value, and generating a code representing the corresponding transform coefficient from said selected table.
Claim 4
Independent Claim 178 words
A method of encoding transform coefficients representing time domain information signals having a successive field format prior to transmission over a communication link in order to effect substantial compression of said signals, said transform coefficients being arranged in a plurality of groups, each group representing an N by N block of field information signals, said method comprising the steps of: (a) providing a plurality of code tables: (b) generating.a block address code from a first dedicated one of said code tables, said block address code representing the field address of the block represented by a group of said transform coefficients; (c) generating a DC coefficient code representing the average intensity of said block from a second dedicated one of said plurality of code tables; and (d) generating a succession of codes representing the remaining transform coefficients corresponding to said block by calculating the predictive value of each said remaining transform coefficient, selecting one of said plurality of code tables in accordance with said predictive value, and generating a code representing the corresponding transform coefficient from said selected table.
Claim 5
Dependent Claim 61 words
The method of claim 2 wherein said step of calculating is performed in accordance with the formula PM K =1/4 C K +3/4 PM K-1 , where PM x is the predictive mean value of the K th coefficient, CKis the actual value of the K th coefficient and PM K-1 is the predictive mean value of the K-1 th coefficient.
Claim 6
Dependent Claim 65 words
4 . The method of claim 2 wherein said time domain information signals are color video signals having quadrature components, and wherein said method of encoding includes the steps of providing individual code tables for said quadrature components, calculating the average value of each quadrature component for said block, and selecting a cede value representing said average value from the corresponding individual quadrature component table.
Claim 7
Dependent Claim 46 words
The method of claim 2 wherein said method of encoding further includes the steps of comparing each said predictive value with a preselected threshold value, and generating a zero run length code specifying the total number of successive predictive values lying below said preselected threshold value.
Claim 8
Dependent Claim 98 words
The method of claim 5. wherein said codes are multi-bit binary codes, and wherein said method further includes the steps of transferring said codes to a buffer in the order of generation, monitoring the number of bits transferred to said buffer, and varying said variable parametric value in accordance with the following formula: where D K = Distortion parameter for block K D' K = Filtered distortion parameter where T = a constant (close to 1) K D = a constant B K = # of bits in buffer for block K N = Max. number of bits
Claim 9
Dependent Claim 33 words
The method-of claim 5 further including the step of generating an end of block code when the predictive values for successive remaining transform coefficients in said block lie below said preselected threshold value.
Claim 10
Dependent Claim 14 words
The method of claim 2 wherein said transform coefficients comprise discrete cosine transform coefficients.
Claim 11
Independent Claim 180 words
A method for processing time domain information signals for transmission over a communication link, said time domain information signals having a successive field format, said method comprising the steps of: (a) generating a frame sync code signal indicating the beginning of a frame;" (b) generating a first control code signal B k representative of the fullness of a transmission rate buffer at the beginning of said frame; (c) generating a second control code signal D k representative of a first variable parametric value at the beginning of said frame; and (d) generating a plurality of block replenishment code symbols each representative of the value of transform coefficients corresponding to individual sub-field blocks having interfield block differences greater than a second variable parametric value, each said block replenishment code symbol including a block address code specifying the field address of the corresponding block, a D C code term representative of the average intensity of the corresponding block, and a plurality of coefficient code terms represen- t a t ive of the value of discrete cosine transform coefficients for said corresponding block.
Claim 12
Independent Claim 180 words
A method for processing time domain information signals for transmission over a communication link, said time domain information signals having a successive field format, said method comprising the steps of: (a) generating a frame sync code signal indicating the beginning of a frame;" (b) generating a first control code signal B k representative of the fullness of a transmission rate buffer at the beginning of said frame; (c) generating a second control code signal D k representative of a first variable parametric value at the beginning of said frame; and (d) generating a plurality of block replenishment code symbols each representative of the value of transform coefficients corresponding to individual sub-field blocks having interfield block differences greater than a second variable parametric value, each said block replenishment code symbol including a block address code specifying the field address of the corresponding block, a D C code term representative of the average intensity of the corresponding block, and a plurality of coefficient code terms represen- t a t ive of the value of discrete cosine transform coefficients for said corresponding block.
Claim 13
Dependent Claim 72 words
t 0 . The method of claim 9 wherein said tine domain information signals are color video signals having quadrature components, and wherein said step (d) of generating includes the step of providing first and second color code terms in each of said plurality of said block replenishment code symbols representing the average value of each quadrature component for said corresponding block between said block address code and said DC code term.
Claim 14
Dependent Claim 43 words
The method of claim 9 wherein said step (d) of generating includes the step of providing a run length code term specifying the total number of successive transform coefficient zero values having a predictive mean value less than a preselected fixed threshold value.
Claim 15
Dependent Claim 43 words
\2.. The method of claim 9 wherein said step (d) of generating includes a step of providing an end of block code term when the predictive values for successive remaining transform coefficients in said corresponding block lie below a preselected fixed threshold value.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag