Patent US5335299A successfully refreshed from Google Patents.
US5335299A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Video compression algorithm
Assignee: Apple Inc
•
Filing: 1991-05-02
•
Granted: 1994-08-02
•
Expires: 2011-05-02
Abstract
Abstract A method for encoding compressed graphics video information and decoding such information. The method consists of enriching the video information in zeros through shifting and Exclusive ORing video image with itself. A number of methods are attempted in the shifting and Exclusive ORing process in order to determine the method which yields the optimum zero enriched image. The zero enriched image is then encoded and the encoded information stored. Upon retrieval, the information is decoded and an Exclusive OR and shifting process is done to obtain the original video information.
Inventors
- 👤 William Atkinson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 05:13
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/41; H04N1/411; H04N1/413; H03; H03M; H03M7/00; H03M7/30
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
136 words
A method of compressing information comprising the steps of: (a) enriching a bit-map of said information in a first binary state by: (i) copying a first row of said bit-map; (ii) shifting said copy of said first row a predetermined number of bits in a first direction; (iii) performing a logical operation using as input said first row of data and said copy of said first row of data yielding a second row of data; (iv) determining the number of bits of data in said second row of data which are in said first binary state; (v) if said number of bits in said binary state is greater than a first value, storing said number of bits as said first value and storing said predetermined number as a second value; and (b) encoding said enriched bit-map.
Claim 2
Independent Claim
136 words
A method of compressing information comprising the steps of: (a) enriching a bit-map of said information in a first binary state by: (i) copying a first row of said bit-map; (ii) shifting said copy of said first row a predetermined number of bits in a first direction; (iii) performing a logical operation using as input said first row of data and said copy of said first row of data yielding a second row of data; (iv) determining the number of bits of data in said second row of data which are in said first binary state; (v) if said number of bits in said binary state is greater than a first value, storing said number of bits as said first value and storing said predetermined number as a second value; and (b) encoding said enriched bit-map.
Claim 3
Dependent Claim
53 words
The method, as recited by claim 1, wherein said encoding of said enriched bit-map comprises the steps of: determining whether a first row of said bit-map meets one of a predetermined set of conditions; if one of said predetermined set of conditions is met, storing one of a first set of predetermined codes.
Claim 4
Dependent Claim
65 words
The method, as recited by claim 2, wherein said predetermined set of conditions comprises: determining if said first row is all in said first binary state; determining if said first row is all in a second binary state; determining if a first group of bits repeats in said first row; and determining if said first row is identical to a second row of said bit-map.
Claim 5
Dependent Claim
16 words
The method, as recited by claim 1, further comprising the step of decoding said encoded information.
Claim 6
Dependent Claim
68 words
The method, as recited by claim 4, wherein said decoding of said encoded information comprises the steps of: (a) reading an operation code; (b) determining from said operation code whether the operation code indicates the beginning of a first row of data; (c) if said operation code indicates the beginning of said first row of data, processing said operation code; (d) otherwise, unpacking said first row of data.
Claim 7
Dependent Claim
149 words
The method, as recited in claim 5, wherein said processing a beginning of row operation code comprises the steps of: (a) if said operation code indicates the data is not compressed, copying the uncompressed data; (b) if said operation code indicates said first row is comprised of bits all of a first binary state, filling said first row with bits of said first binary state; (c) if said operation code indicates said first row is comprised of bits all of a second binary state, filling said first row with bits of said second binary state; (d) if said operation code indicates the data repeats a block of data, filling said first row with duplicates of said block of data; (e) if said operation code indicates said first row is the same as a second row offset a predetermined number of rows from said first row, copying said second row.
Claim 8
Dependent Claim
27 words
The method, as recited in claim 6, wherein said unpacking of said data comprises the step of using a table having predetermined values to unpack said data.
Claim 9
Dependent Claim
41 words
The method, as recited by claim 1, wherein said encoding said enriched bit-map comprises the step of representing said enriched bit-map with codes representing runs of bits in said first binary state and runs of bits in a second binary state.
Claim 10
Dependent Claim
16 words
The method, as recited by claim 1, wherein said first binary state is a low state.
Claim 11
Dependent Claim
23 words
The method as recited by claim 1 wherein steps (i) through (v) are repeated for each of a first set of predetermined numbers.
Claim 12
Dependent Claim
16 words
The method as recited by claim 1 wherein said logical function is an Exclusive OR function.
Claim 13
Independent Claim
138 words
A method of compressing and redisplaying video information from a bit-mapped display device comprising the steps of: determining whether one of a first set of predetermined conditions is satisfied by a first row of data; if one of said first set of predetermined conditions is satisfied storing one of a first set of codes; enriching said bit-map of said information in a first binary state by shifting a copy of said bit map and performing an Exclusive OR function using said bit map and said shifted copy of said bit map as inputs to said Exclusive OR function; encoding said enriched bit-map by representing said bit-map as runs of said first binary state and runs of a second binary state; decoding said information by reading a plurality of operations codes and reconstructing said bit-map from said operation codes.
Claim 14
Independent Claim
138 words
A method of compressing and redisplaying video information from a bit-mapped display device comprising the steps of: determining whether one of a first set of predetermined conditions is satisfied by a first row of data; if one of said first set of predetermined conditions is satisfied storing one of a first set of codes; enriching said bit-map of said information in a first binary state by shifting a copy of said bit map and performing an Exclusive OR function using said bit map and said shifted copy of said bit map as inputs to said Exclusive OR function; encoding said enriched bit-map by representing said bit-map as runs of said first binary state and runs of a second binary state; decoding said information by reading a plurality of operations codes and reconstructing said bit-map from said operation codes.
Claim 15
Dependent Claim
76 words
The method, as recited by claim 12, wherein said first set of predetermined conditions comprises: determining if all bits in said first row of said information are in said first binary state; determining if all bits of said first row of said information are in said second binary state; determining if a first group of bits repeats in said first row; and determining if said first row is identical to a second row of said bit-map.
Claim 16
Dependent Claim
16 words
The method, as recited by claim 13, wherein said first binary state is a low state.
Claim 17
Dependent Claim
16 words
The method, as recited by claim 14, wherein said second binary state is a high state.
Claim 18
Dependent Claim
28 words
The method, as recited by claim 12, wherein said unpacking of said data comprises the step of using a translation table having predetermined values to unpack said data.
References Cited (Backward Citations)
US5033105A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-08-01 | 1998-01-31 | 1998-08-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-08-01 | 2002-01-31 | 2002-08-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-08-01 | 2006-01-31 | 2006-08-02 | $7700.00 | Window Closed / Lapsed |