US5033105A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Video compression algorithm
Assignee: Apple Inc
•
Filing: 1989-11-22
•
Granted: 1991-07-16
•
Expires: 2009-11-22
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 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-07 19:56
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/41; H04N1/411; H04N1/413; H03; H03M; H03M7/00; H03M7/30
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
242 words
A method of compressing information comprising the step of 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 words of data in said second row of data which are in said first binary state; (v) if said number of words in said binary state is greater than a first value, storing said number of words as said first value and storing said predetermined number as a second value; (vi) performing a logical operation using as input said first row of data and a third row of data, said third row of data offset a predetermined number of rows from said first row of data, yielding a fourth row of data; (vii) determining the number of words of data in said fourth row of data which are in said first binary state; (viii) if said number of words in said first binary state are greater than a third value, storing said number of words as said third value and storing said predetermined number as a fourth value; (ix) repeating steps (vi) through (viii) for each of a second set of predetermined numbers.
Claim 2
Independent Claim
242 words
A method of compressing information comprising the step of 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 words of data in said second row of data which are in said first binary state; (v) if said number of words in said binary state is greater than a first value, storing said number of words as said first value and storing said predetermined number as a second value; (vi) performing a logical operation using as input said first row of data and a third row of data, said third row of data offset a predetermined number of rows from said first row of data, yielding a fourth row of data; (vii) determining the number of words of data in said fourth row of data which are in said first binary state; (viii) if said number of words in said first binary state are greater than a third value, storing said number of words as said third value and storing said predetermined number as a fourth value; (ix) repeating steps (vi) through (viii) for each of a second set of predetermined numbers.
Claim 3
Dependent Claim
19 words
The method as recited by claim 1 wherein said second set of predetermined numbers comprises zero, one and two.
Claim 4
Independent Claim
252 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 an Exclusive OR 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 words of data in said second row of data which are in said first binary state; (v) if said number of words in said binary state is greater than a first value, storing said number of words as said first value and storing said predetermined number as a second value; (b) encoding said enriched bit-map; (c) performing an Exclusive OR function using as input said first row of data and a third row of data, said third row of data offset a predetermined number of rows from said first row of data, yielding a fourth row of data; (d) determining the number of words of data in said fourth row of data which are in the said first binary state; (e) if said number of words in said first binary state are greater than a third value, storing said number of words as said third value and storing said predetermined number as a fourth value; and (f) repeating steps (c) through (e) for each of a second set of predetermined numbers.
Claim 5
Independent Claim
252 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 an Exclusive OR 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 words of data in said second row of data which are in said first binary state; (v) if said number of words in said binary state is greater than a first value, storing said number of words as said first value and storing said predetermined number as a second value; (b) encoding said enriched bit-map; (c) performing an Exclusive OR function using as input said first row of data and a third row of data, said third row of data offset a predetermined number of rows from said first row of data, yielding a fourth row of data; (d) determining the number of words of data in said fourth row of data which are in the said first binary state; (e) if said number of words in said first binary state are greater than a third value, storing said number of words as said third value and storing said predetermined number as a fourth value; and (f) repeating steps (c) through (e) for each of a second set of predetermined numbers.
Claim 6
Dependent Claim
19 words
The method, as recited by claim 3, wherein said second set of predetermined numbers comprises zero, one and two.
Claim 7
Dependent Claim
199 words
The method, as recited by claim 3, further comprising the step of decoding said encoded information by (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 indicates the beginning of said first row of data, processing said operation code by the steps of: (i) if said operation code indicates the data is not compressed, copying the uncompressed data; (ii) 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; (iii) 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; (iv) if said operation code indicates the data repeats a block of data, filling said first row with duplicates of said block of data; (v) 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. (d) otherwise, unpacking said first row of data.
Claim 8
Dependent Claim
27 words
The method, as recited in claim 5, wherein said unpacking of said data comprises the step of using a table having predetermined values to unpack said data.
References Cited (Backward Citations)
US3882454A
Cited
GB1481226A
Cited
US4021778A
Cited
GB1572121A
Cited
GB1539858A
Cited
US4441205A
Cited
US4729127A
Cited
US4743973A
Cited
US4622545A
Cited
US4736437A
Cited
EP0130415A2
Cited
EP0149124A2
Cited
US4646356A
Cited
US4631521A
Cited
US4837848A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-07-15 | 1995-01-14 | 1995-07-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-07-15 | 1999-01-14 | 1999-07-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-07-15 | 2003-01-14 | 2003-07-16 | $7700.00 | Window Closed / Lapsed |