EP0149124A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Method for encoding and decoding a digital image
Assignee: International Business Machines Corp
•
Filing: 1984-12-11
•
Granted: —
•
Expires: 2004-12-11
Abstract
Abstract A method for encoding and decoding digital image data, includes the steps of testing the data for a vertical relationship between adjacent lines of the image, generating directly a reference code word representative of the vertical relationship for each successful test, generating by table lookup a run code word for a stream of data bits of common value for each unsuccessful test, wherein a data element representing a number of bits in a code word is stored at a predetermined offset from a table entry for the code word, merging the vertical reference code words and the run code words generated by the above steps to form an encoded data stream, testing an encoded data stream for a reference code, decoding directly the vertical relationship from the reference code for each successful test: decoding by table lookup a run of bits of common value by serial examination of said encoded data stream for each unsuccessful test and storing data decoded by the above steps in a predetermined relationship
Inventors
- 👤 Karen Louise Anderson
- 👤 Joan La Verne Mitchell
- 👤 Gerald Goertzel (Nmn)
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-07 20:37
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/41; H04N1/411; H04N1/413; H04N1/417; H04N1/4175; G; G06; G06T; G06T9/00; G06T9/005
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
169 words
A method for encoding and decoding digital data, wherein parameters are initialized, comprising the steps of: testing said data for a predetermined relationship between adjacent lines of said data; generating directly a reference code word representative of said predetermined relationship for each successful test; generating by table lookup a run code word for a stream of data bits of common value for each unsuccessful test, wherein a data element representing a number of bits in a code word is stored at a predetermined offset from a table entry representing said code word; merging said reference code words and said run code words generated by the above steps to form an encoded data stream; testing an encoded data stream for a reference code; decoding directly said predetermined relationship from said reference code for each successful test; decoding by table lookup a run of bits of common value by serial examination of said encoded data stream for each unsuccessful test storing data decoded by the above steps in a predetermined relationship.
Claim 2
Independent Claim
169 words
A method for encoding and decoding digital data, wherein parameters are initialized, comprising the steps of: testing said data for a predetermined relationship between adjacent lines of said data; generating directly a reference code word representative of said predetermined relationship for each successful test; generating by table lookup a run code word for a stream of data bits of common value for each unsuccessful test, wherein a data element representing a number of bits in a code word is stored at a predetermined offset from a table entry representing said code word; merging said reference code words and said run code words generated by the above steps to form an encoded data stream; testing an encoded data stream for a reference code; decoding directly said predetermined relationship from said reference code for each successful test; decoding by table lookup a run of bits of common value by serial examination of said encoded data stream for each unsuccessful test storing data decoded by the above steps in a predetermined relationship.
Claim 3
Independent Claim
111 words
A method for encoding digital data, wherein parameters are initialized, comprising the steps of: testing said data for a predetermined relationship between adjacent lines of said data; generating directly a reference code word representative of said predetermined relationship for each successful test; generating by table lookup a run code word for a stream of data bits of common value for each unsuccessful test, wherein a data element representing a number of bits in a code word is stored at a predetermined offset from a table entry representing said code word; merging said reference code words and said run code words generated by the above steps to form an encoded data stream.
Claim 4
Independent Claim
111 words
A method for encoding digital data, wherein parameters are initialized, comprising the steps of: testing said data for a predetermined relationship between adjacent lines of said data; generating directly a reference code word representative of said predetermined relationship for each successful test; generating by table lookup a run code word for a stream of data bits of common value for each unsuccessful test, wherein a data element representing a number of bits in a code word is stored at a predetermined offset from a table entry representing said code word; merging said reference code words and said run code words generated by the above steps to form an encoded data stream.
Claim 5
Independent Claim
21 words
A method according to claims 1 or 2, further comprising the step of encoding pad lines as specified by operator control.
Claim 6
Independent Claim
21 words
A method according to claims 1 or 2, further comprising the step of skipping image lines as specified by operator control.
Claim 7
Independent Claim
26 words
A method according to claims 1 or 2, further comprising the step of changing a vertical scale of an encoded image as specified by operator control.
Claim 8
Independent Claim
70 words
A method for decoding digital data, wherein parameters are initialized, comprising the steps of: testing an encoded data stream for a reference code; decoding directly said predetermined relationship from said reference code for each successful test; decoding by table lookup a run of bits of common value by serial examination of said encoded data stream for each unsuccessful test storing data decoded by the above steps in a predetermined relationship.
Claim 9
Independent Claim
70 words
A method for decoding digital data, wherein parameters are initialized, comprising the steps of: testing an encoded data stream for a reference code; decoding directly said predetermined relationship from said reference code for each successful test; decoding by table lookup a run of bits of common value by serial examination of said encoded data stream for each unsuccessful test storing data decoded by the above steps in a predetermined relationship.
Claim 10
Independent Claim
16 words
A method according to claims 1 or 6, further comprising the step of decoding pad lines.
Claim 11
Independent Claim
17 words
A method according to claims 1 or 6, further comprising the step of decoding skipped image lines.
Claim 12
Independent Claim
23 words
A method according to claims 1 or 6, further comprising the step of decoding a change in a vertical scale of encoded data.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.