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

Hybrid coding process by transformation for the transmission of picture signals

Assignee: Individual
•
Filing: 1986-10-20
•
Granted: 1989-05-02
•
Expires: 2006-10-20
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Hybrid coding process by transformation for the transmission of images or pictures. The pictures are defined by a sequence of frames, each frame containing a set of matrix-organized blocks, each block containing a set of digital data organized in matrix form and representing part of the picture. The process successively comprises the stages of transforming each block in the frequency range, quantifying the transformed coefficients of each block, evaluating the data volume necessary for coding said transformed block by an intraframe mode statistical coding, evaluation of the data volume necessary for coding said transformed block by an interframe mode statistical coding, comparison of said data volumes and decision concerning the coding mode as a function of said date volumes and the maximum volume authorized by the flow rate on the transmission line and statistical coding of said block by a variable length code.

Inventors

  • 👤 Eude Gerard

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 08:45
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/50; H04N19/59; H04N19/10; H04N19/102; H04N19/103; H04N19/112; H04N19/124; H04N19/129; H04N19/134; H04N19/146; H04N19/152; H04N19/169; H04N19/17; H04N19/176; H04N19/18; H04N19/189; H04N19/192; H04N19/60; H04N19/61; H04N19/619; H04N19/80; H04N19/107

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 228 words
Process for hybrid coding by transformation for reducing the data volume necessary for representing pictures, in which the pictures are defined by a sequence of frames, each frame containing a set of matrix-organized blocks, each block containing a set of matrix-organized digital data representing part of the picture, characterized in that the process involves transforming each digital data block into a block transformed coefficients representing said block in the frequency range, quantifying the transformed coefficients of each block to obtain quantified transformed coefficients, each having a value taken from a limited set of predetermined values, scanning each block of quantified transformed coefficients to produce a sequence of quantified transformed coefficients and evaluating the data volume necessary for coding said sequence by statistical coding, calculating a block of difference coefficients by a difference between a block of quantified transformed coefficients and the corresponding block of the preceding frame, scanning the block of difference coefficients for producing a sequence of difference coefficients and evaluating the data volume necessary for coding said sequence of difference coefficients by said statistical coding, comparing of the data volumes necessary for coding a block and deciding on the coding mode as a function of said data volumes and the maximum volume authorised by the rate on the transmission lines and statistical coding of the block, in accordance with the decided mode, by said statistical code.
Claim 2
Dependent Claim 228 words
Process for hybrid coding by transformation for reducing the data volume necessary for representing pictures, in which the pictures are defined by a sequence of frames, each frame containing a set of matrix-organized blocks, each block containing a set of matrix-organized digital data representing part of the picture, characterized in that the process involves transforming each digital data block into a block transformed coefficients representing said block in the frequency range, quantifying the transformed coefficients of each block to obtain quantified transformed coefficients, each having a value taken from a limited set of predetermined values, scanning each block of quantified transformed coefficients to produce a sequence of quantified transformed coefficients and evaluating the data volume necessary for coding said sequence by statistical coding, calculating a block of difference coefficients by a difference between a block of quantified transformed coefficients and the corresponding block of the preceding frame, scanning the block of difference coefficients for producing a sequence of difference coefficients and evaluating the data volume necessary for coding said sequence of difference coefficients by said statistical coding, comparing of the data volumes necessary for coding a block and deciding on the coding mode as a function of said data volumes and the maximum volume authorised by the rate on the transmission lines and statistical coding of the block, in accordance with the decided mode, by said statistical code.
Claim 3
Dependent Claim 70 words
Process according to claim 1, characterized in that it comprises a supplementary movement detection stage performed after the transformation stage, said movement detection stage consisting of comparing a transformed block of the current frame with the corresponding transformed block of the preceding frame to obtain a difference and, in the case where said difference is below a predetermined threshold, transmitting on the transmission line a non-refreshing code for the block.
Claim 4
Dependent Claim 66 words
Process according to claim 1, characterized in that it comprises a supplementary movement detection stage, performed after the quantification stage, said movement detection stage consisting of comparing the transformed block of the current frame with the corresponding transformed block of the preceding frame and, in the case where said difference is below a predetermined threshold, transmitting on the transmission line a non-refreshing code for the block.
Claim 5
Dependent Claim 72 words
Process according to claim 1, characterized in that, for each scanning stage, several classes of blocks each corresponding to a given block frequency structure is defined, for each class is defined a scan adapted to said class and during each scanning stage, the best class for a block is determined by an energy criterion of the block and said block is scanned in accordance with the scan associated with said best class.
Claim 6
Dependent Claim 39 words
Process according to claim 4, characterized in that a definition takes place of a partition of the components of the block into several zones and in that each class is either a zone, or a combination of several zones.

References Cited (Backward Citations)

US4394774A Cited
US4281344A Cited
GB2102652A Cited
US4541012A Cited
US4546386A Cited
US4581638A Cited
US4704628A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-05-01 1992-10-31 1993-05-02 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-05-01 1996-10-31 1997-05-02 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-05-01 2000-10-31 2001-05-02 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag