Patent US5031038A successfully refreshed from Google Patents.
US5031038A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Process and device for the compression of image data by mathematical transformation effected at low cost, particularly for the transmission at a reduced rate of sequences of images
Assignee: Telediffusion de France ets Public de Diffusion
•
Filing: 1990-04-18
•
Granted: 1991-07-09
•
Expires: 2010-04-18
Abstract
Abstract Process and device for the compression of image data by a mathematical transformation implemented at low cost, particularly for the transmission at reduced speed of sequences of images. The objective is to provide an economical method in "silicon area - processing speed" cost to implement a mathematical transformation of the DCT type, on arrays of pixels, suitable for image compression. According to the invention, the method consists essentially of combining a permutation (1) of each block of pixels with a series of one dimensional FFT (211, 213). A series of variants is obtained by adding or not adding steps of matrix calculation (22) of reconstitution of a complex 2D-FET, of rotations (3) of reconstitution of the DCT, and/or of suppression of the imaginary coefficients.
Inventors
- 👤 Christine Guillemot
- 👤 Jean-Claude Carlac'h
- 👤 Pierre Duhamel
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 19:58
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/60; G; G06; G06F; G06F17/00; G06F17/10; G06F17/14; G06F17/147
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
160 words
Process of compression of data representative of an image signal, of the type consisting of decomposing the image into blocks forming arrays of pixels, of effecting a mathematical operation of transformation on each array of pixels according to a transform making it possible to obtain a resulting array of elements representative of the activity of the image, and of eliminating in each resulting array the elements of little psychovisual relevance by thresholding in relation to an array of reference thresholds, process characterized in that the said mathematical operation of transformation consists of the steps of: transposing the elements of the array of pixels by permutation of the indices of the said elements, so as to symmetrize the signal; applying an interlacing of two series of one dimensional real value FFT, bearing successively on each line of the permuted array of pixels, then on each of the columns of the intermediate array resulting from the first series of one dimensional FFT.
Claim 2
Dependent Claim
160 words
Process of compression of data representative of an image signal, of the type consisting of decomposing the image into blocks forming arrays of pixels, of effecting a mathematical operation of transformation on each array of pixels according to a transform making it possible to obtain a resulting array of elements representative of the activity of the image, and of eliminating in each resulting array the elements of little psychovisual relevance by thresholding in relation to an array of reference thresholds, process characterized in that the said mathematical operation of transformation consists of the steps of: transposing the elements of the array of pixels by permutation of the indices of the said elements, so as to symmetrize the signal; applying an interlacing of two series of one dimensional real value FFT, bearing successively on each line of the permuted array of pixels, then on each of the columns of the intermediate array resulting from the first series of one dimensional FFT.
Claim 3
Dependent Claim
34 words
Process according to claim 1 characterized in that at least part of the imaginary coefficients that are obtained after at least one of the two series of one dimensional real value FFT are cancelled.
Claim 4
Dependent Claim
28 words
Process according to claim 1 wherein said interlacing of two series of one dimensional real value FFT are replaced with a two dimensional real or complex value FFT.
Claim 5
Dependent Claim
29 words
Process according to the claim 1 characterized in that at least one of the two one dimensional FFT is followed by an operation of matrix transposition with bit reverse.
Claim 6
Dependent Claim
44 words
Process according to claim 4 characterized in that on the transformed array resulting from the two interlaced one dimensional FFT a matrix calculation is effected designed to reconstitute the array transformed by complex value FFT corresponding to the said initial transposed array of pixels.
Claim 7
Dependent Claim
44 words
Process according to the claim 5 characterized in that the said array transformed by complex value FFT is subjected to a treatment of rotations, so that a resulting array is obtained corresponding to the real value DCT transform of the initial array of pixels.
Claim 8
Dependent Claim
28 words
Process according to claim 5 wherein said interlacing of two series of one dimensional real value FFT are replaced with a two dimensional real or complex value FFT.
Claim 9
Dependent Claim
57 words
Process according to any of the claims 1 to 6 characterized in that the law of permutation of the indices of the elements of the array of pixels is combined with a scanning of the array being chosen in the group comprising a line to line scan of the array and a zigzag scan of the array.
Claim 10
Dependent Claim
30 words
Process according to claim 3 or 7 characterized in that at least part of the imaginary coefficients that are obtained after said two-dimensional real or complex value FFT are cancelled.
Claim 11
Dependent Claim
89 words
Device to implement the process according to any one of the claims 1 to 6, 3, 7 or 2 characterized in that it comprises two distinct memory units, the said memory units cooperating with a data path effecting in pipeline the interlaced operations of reading coefficients in the memories, the calculation operations on the said coefficients, and the interlaced writing operations of the resulting coefficients in the memory units, so as to effect the steps of the process by successive passages of the coefficients in the said data path.
References Cited (Backward Citations)
US4302775A
Cited
US4708761A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-07-08 | 1995-01-07 | 1995-07-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-07-08 | 1999-01-07 | 1999-07-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-07-08 | 2003-01-07 | 2003-07-09 | $7700.00 | Window Closed / Lapsed |