Patent US4858026A successfully refreshed from Google Patents.
US4858026A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Image display
Assignee: US Philips Corp
•
Filing: 1987-12-21
•
Granted: 1989-08-15
•
Expires: 2007-12-21
Abstract
Abstract Pixel information representing an image for display is coded using data compression. The data compression consists in obtaining the pixel information as a first matrix of high resolution pixel values, subtracting from this first matrix a second matrix composed of lower resolution pixel values, produced by low pass filtering the first matrix, to produce a third matrix of difference values, sub-sampling the second matrix to produce a fourth matrix of less density lower resolution pixel values and coding the third and fourth matrices. Complementary decoding consists in restituting the second matrix by interpolation filtering the decoded fourth matrix, and combining the restituted second matrix with the decoded third matrix. Loss of accuracy in the decoding method is reduced by coding and then decoding the fourth matrix during the coding method before it is interpolated to full pixel density to form the restituted second matrix which is subtracted from the first matrix to produce the third matrix of difference values. In this way, any sub-sampling and interpolation errors in the restituted fourth matrix occur in both the coding method and the decoding method and therefore cancel out.
Inventors
- 👤 Norman D. Richards
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 05:59
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/004; H; H04; H04N; H04N1/00; H04N1/21; H04N1/2166; H04N1/217; H04N1/41; H04N1/46; H04N1/64; H04N1/646
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
275 words
A method of image coding by which pixel information for at least one pixel component value of m by n pixels forming a rectangular image is coded into digital data, where m is an integer representing the number of pixels vertically and n is an integer representing the number of pixels horizontally in said image, comprising the steps of: (i) arranging said pixel information as a first matrix of m×n pixel component values, (ii) low-pass filtering these pixel component values of the first matrix to produce a second matrix of m×n pixel component values which are in respect of a lower resolution image compared with the pixel component values of the first matrix, (iii) sub-sampling said second matrix of pixel component values to produce a fourth matrix of m/a×n/b pixel component values of reduced density, where a and b are factors of m and n, respectively, and (iv) coding said fourth matrix of pixel component values into a second set of digital data utilizing a code relating the value of each pixel component in said fourth matrix to the component value of an adjoining pixel; said method being characterised by comprising the further steps of: (v) decoding the second set of digital data representing the pixel component values of reduced density to reconstitute the fourth matrix of pixel component values, (vi) interpolation filtering said fourth matrix of pixel component values to restitute said second matrix of pixel component values, (vii) subtracting the restituted second matrix from the first matrix pixel-by-pixel to produce a third matrix of m×n difference values, and (viii) coding said third matrix of difference values into a first set of digital data.
Claim 2
Independent Claim
275 words
A method of image coding by which pixel information for at least one pixel component value of m by n pixels forming a rectangular image is coded into digital data, where m is an integer representing the number of pixels vertically and n is an integer representing the number of pixels horizontally in said image, comprising the steps of: (i) arranging said pixel information as a first matrix of m×n pixel component values, (ii) low-pass filtering these pixel component values of the first matrix to produce a second matrix of m×n pixel component values which are in respect of a lower resolution image compared with the pixel component values of the first matrix, (iii) sub-sampling said second matrix of pixel component values to produce a fourth matrix of m/a×n/b pixel component values of reduced density, where a and b are factors of m and n, respectively, and (iv) coding said fourth matrix of pixel component values into a second set of digital data utilizing a code relating the value of each pixel component in said fourth matrix to the component value of an adjoining pixel; said method being characterised by comprising the further steps of: (v) decoding the second set of digital data representing the pixel component values of reduced density to reconstitute the fourth matrix of pixel component values, (vi) interpolation filtering said fourth matrix of pixel component values to restitute said second matrix of pixel component values, (vii) subtracting the restituted second matrix from the first matrix pixel-by-pixel to produce a third matrix of m×n difference values, and (viii) coding said third matrix of difference values into a first set of digital data.
Claim 3
Dependent Claim
42 words
A coding method as claimed in claim 1, including the further step (ix) of recording the first and second sets of digital data onto a storage medium in a manner that said data sets may thereafter be separately read from said medium.
Claim 4
Dependent Claim
30 words
A coding method as claimed in claim 1 or claim 2, wherein the sub-sampling of the pixel component values of the second matrix in step (iii) is such that a=b=2.
Claim 5
Dependent Claim
49 words
A coding method as claimed in claim 1 or claim 2, in which the coding of the difference values into the first set of digital data comprises quantizing these difference values into a smaller number of quantization levels, including zero, and coding the quantized values using a run-length code.
Claim 6
Dependent Claim
39 words
A coding method as claimed in claim 1 or claim 2, in which the coding of the pixel component values of the fourth matrix into the second set of digital data consists in delta coding these pixel component values.
Claim 7
Dependent Claim
22 words
An optical record carrier having stored thereon said first and second sets of digital data coded by the method of claim 2.
Claim 8
Dependent Claim
65 words
A method of cording as claimed in claim 1, wherein said pixel information comprises Y, U and V, Y being the luminance component of a pixel and U and V being the two chrominance components, wherein said steps (i) through (iv) are performed for these three pixel component values producing respective first, second and fourth matrices for each component, said fourth matrices being coded separately.
Claim 9
Dependent Claim
40 words
A method as claimed in claim 7, wherein the sub-sampling of the pixel component values of the second matrix in step (iii) is such that b, for each of the two chrominance components, is double b for the luminance component.
Claim 10
Dependent Claim
260 words
A coding apparatus by which pixel information for at least one pixel component value of m by n pixels forming a rectangular image is coded into digital data where m is an integer representing the number of pixels vertically and n is an integer representing the number of pixels horizontally in said image, comprising: means for arranging said pixel information as a first matrix of m×n pixel component values, means for low-pass filtering these pixel component values of the first matrix to produce a second matrix of m×n pixel component values, which are in respect of a lower resolution image compared with the pixel component values of the first matrix, means for sub-sampling said second matrix of pixel component values to produce a fourth matrix of m/a×n/b pixel component values of reduced density, where a and b are factors of m and n, respectively, means for coding said fourth matrix of pixel component values into a second set of digital data utilizing a code relating the value of each pixel component in said fourth matrix to the component value of an adjoining pixel, means for decoding the second set of digital data to reconstitute the fourth matrix of pixel component values, means for interpolation filtering said reconstituted fourth matrix of pixel component values to restitute said second matrix of pixel component values, means for subtracting the restituted second matrix from the first matrix pixel-by-pixel to produce a third matrix of m×n difference values, and means for coding said third matrix of difference values into a first set of digital data.
Claim 11
Dependent Claim
260 words
A coding apparatus by which pixel information for at least one pixel component value of m by n pixels forming a rectangular image is coded into digital data where m is an integer representing the number of pixels vertically and n is an integer representing the number of pixels horizontally in said image, comprising: means for arranging said pixel information as a first matrix of m×n pixel component values, means for low-pass filtering these pixel component values of the first matrix to produce a second matrix of m×n pixel component values, which are in respect of a lower resolution image compared with the pixel component values of the first matrix, means for sub-sampling said second matrix of pixel component values to produce a fourth matrix of m/a×n/b pixel component values of reduced density, where a and b are factors of m and n, respectively, means for coding said fourth matrix of pixel component values into a second set of digital data utilizing a code relating the value of each pixel component in said fourth matrix to the component value of an adjoining pixel, means for decoding the second set of digital data to reconstitute the fourth matrix of pixel component values, means for interpolation filtering said reconstituted fourth matrix of pixel component values to restitute said second matrix of pixel component values, means for subtracting the restituted second matrix from the first matrix pixel-by-pixel to produce a third matrix of m×n difference values, and means for coding said third matrix of difference values into a first set of digital data.
Claim 12
Dependent Claim
29 words
A coding apparatus as claimed in claim 9, wherein a=b=2 said low-pass filtering means and said sub-sampling means effect filtering by a factor of two both horizontally and vertically.
Claim 13
Dependent Claim
41 words
A coding apparatus as claimed in claim 9, in which the means for coding said matrix of difference values quantizes these difference values into a smaller number of quantization levels, including zero, and codes the quantized values using a run-length code.
Claim 14
Dependent Claim
31 words
A coding apparatus as claimed in claim 9, 10, or 11, in which the means for coding the pixel component values of the fourth matrix delta codes these pixel component values.
Claim 15
Dependent Claim
53 words
A coding apparatus as claimed in claim 9 including a storage medium and means responsive to said means for coding said third and fourth matrixes for recording said first and second sets of digital data on said storage medium in a manner that said data sets may be separately read from said medium.
Claim 16
Dependent Claim
27 words
A coding apparatus as claimed in claim 13, wherein said storage medium is an optical record carrier and said recording means is an associated optical write device.
Claim 17
Dependent Claim
45 words
A coding apparatus as claimed in claim 9, for use with YUV coding, where Y is the luminance component of a pixel and U and V are the two chrominance components, wherein all these pixel component values are coded separately starting with respective first matrices.
Claim 18
Dependent Claim
34 words
A coding apparatus as claimed in claim 15, wherein the first matrix of each of the two chrominance component values has half the horizontal resolution of the first matrix for the luminance component value.
Claim 19
Dependent Claim
58 words
A coding apparatus as claimed in claim 9, for use with YUV coding, where Y is the luminance component of a pixel and U and V are the two chrominance components, wherein only the luminance component value is said picture information and is coded, the two chrominance component values being available directly for storage on a storage medium.
References Cited (Backward Citations)
US3035121A
Cited
US4158837A
Cited
US4554670A
Cited
US4613894A
Cited
US4727497A
Cited
US4758831A
Cited
US4665436A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-08-14 | 1993-02-13 | 1993-08-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-08-14 | 1997-02-13 | 1997-08-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-08-14 | 2001-02-13 | 2001-08-15 | $7700.00 | Window Closed / Lapsed |