Patent US5271071A successfully refreshed from Google Patents.
US5271071A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Digital nonalgorithmic method of compressing data which represents addresses and values
Assignee: IND-OPS Inc
•
Filing: 1991-06-21
•
Granted: 1993-12-14
•
Expires: 2011-06-21
Abstract
Abstract There is provided a digital, non-algorithmic method of compressing data. Data representing the addresses and values of pixels in an array are compressed. A first matrix is produced. The addresses of the first matrix are isomorphic with the range of possible pixel values, with one address corresponding to one pixel value. Same-valued pixels in the array are counted and each count is entered or tallied in the address of the first matrix corresponding to the value. One second matrix is generated for each pixel value actually present in the array. The addresses of the array and the second matrices are isomorphic. A binary "1" is placed in each address of each second matrix which corresponds to the address of the array having a pixel with the value to which the second matrix corresponds. The generated matrices represent very high data compression of 99% or higher. The first and second matrices may be transmitted, following which the array may be reconstructed therefrom. Because of the digital, non-algorithmic character of the foregoing, compression, transmission and decompression are essentially lossless and are conveniently subject to error correction. Residual mathematics is used to convert pixel values in the array to addresses in the first matrix and to convert the addresses of the transmitted first matrix to pixel values. Compression and decompression, including residual mathematical calculations may be effected by a general-purpose digital computer programmed in BASIC and/or by hardware which performs repetitive calculations.
Inventors
- 👤 John H. Waite
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 09:37
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/90; H04N19/98
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
296 words
A method of compressing data preparatory to transmission thereof, the data representing the addresses and the value of pixels in an array of pixels, the scaler form of each address and the magnitude of each value being expressed as a decimal number, the method comprising the steps of: (a) generating a first matrix the addresses of which are decimal numbers having a range which corresponds to the range of possible decimal pixel values, each address in the first matrix corresponding to one pixel value; (b) counting, for each pixel value represented in the array, the total number of pixels in the array which have the same value; (c) entering each total of same-valued pixels determined in step (b) in a location of the first matrix which has a decimal address congruent to the decimal value; (d) converting the total in each address of the first matrix into a binary number; (e) generating a plurality of second matrices, each second matrix having addresses which respectively coincide with the pixel addresses in the array, there being one second matrix corresponding to each pixel value represented as an address in the first matrix; (f) writing a binary "1" in each address of each second matrix when the pixel located at the coinciding address in the array has a value equal to the value to which the second matrix corresponds, and writing a binary "0" in all other addresses of the second matrices; (g) linking each of the second matrices to the first matrix for data transmission by associating each individual second matrix with a corresponding address in the first matrix, the corresponding address of the first matrix being the same as the pixel value which corresponds to the individual second matrix; and (h) transmitting at least the second matrices.
Claim 2
Independent Claim
296 words
A method of compressing data preparatory to transmission thereof, the data representing the addresses and the value of pixels in an array of pixels, the scaler form of each address and the magnitude of each value being expressed as a decimal number, the method comprising the steps of: (a) generating a first matrix the addresses of which are decimal numbers having a range which corresponds to the range of possible decimal pixel values, each address in the first matrix corresponding to one pixel value; (b) counting, for each pixel value represented in the array, the total number of pixels in the array which have the same value; (c) entering each total of same-valued pixels determined in step (b) in a location of the first matrix which has a decimal address congruent to the decimal value; (d) converting the total in each address of the first matrix into a binary number; (e) generating a plurality of second matrices, each second matrix having addresses which respectively coincide with the pixel addresses in the array, there being one second matrix corresponding to each pixel value represented as an address in the first matrix; (f) writing a binary "1" in each address of each second matrix when the pixel located at the coinciding address in the array has a value equal to the value to which the second matrix corresponds, and writing a binary "0" in all other addresses of the second matrices; (g) linking each of the second matrices to the first matrix for data transmission by associating each individual second matrix with a corresponding address in the first matrix, the corresponding address of the first matrix being the same as the pixel value which corresponds to the individual second matrix; and (h) transmitting at least the second matrices.
Claim 3
Dependent Claim
23 words
A method as in claim 1, which further comprises: truncating the first matrix by deleting therefrom all binary "0" values following step (d).
Claim 4
Dependent Claim
31 words
A method as in claim 1, wherein: the addresses in the array and in the first and second matrices are isomorphic with each other and with the range of pixel values.
Claim 5
Dependent Claim
21 words
A method as in claim 1, wherein: the addresses in the first matrix and the range of pixel values are isomorphic.
Claim 6
Dependent Claim
12 words
A method as in claim 4, wherein: the first matrix is square.
Claim 7
Dependent Claim
146 words
A method as in claim 5, wherein: the pixel values P and the addresses A of the first matrix have a decimal range of O to N, each address A in the first matrix in which there is entered the total count of pixels having the same value P being given by A=P=R(M)+C, where M is the number of addresses along a side of the first matrix, R is the row of the address in the first matrix and is the largest whole number by which M can be multiplied without exceeding P, C is the column of the address in the first matrix and is given by the difference P-R(M), the decimal values of R and C range from 0 to M-1, and wherein step (c) is performed by determining A for each address of the array and counting the A's having the same value.
Claim 8
Dependent Claim
26 words
A method as in claim 6, wherein, P, N and A range from 0 to 255, R and C range from 0-15, and M is 16.
Claim 9
Dependent Claim
30 words
A method as in claim 7, wherein: a plurality of arrays constitute a frame, the data of the frame being compressed by serially compressing the data in each array thereof.
Claim 10
Dependent Claim
44 words
A method as in claim 8, wherein: the frame is a 512 pixel 512 pixel grid made up of an 8 by 8 grid of blocks, each block being made up of a 4 by 4 grid of sub-blocks, each sub-block constituting an array.
Claim 11
Dependent Claim
34 words
A method as in claim 5, wherein a plurality of arrays together constitute a frame, the data representing the pixels of the frame being compressed by serially compressing the data in each array thereof.
Claim 12
Dependent Claim
34 words
A method as in claim 10, wherein: the frame includes groups of arrays, the number of arrays in each group being equal to the number M of addresses along any side of the arrays.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-12-13 | 1997-06-14 | 1997-12-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-12-13 | 2001-06-14 | 2001-12-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-12-13 | 2005-06-14 | 2005-12-14 | $7700.00 | Window Closed / Lapsed |