Patent US4360840A successfully refreshed from Google Patents.
US4360840A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Real time data compression/decompression scheme for facsimile transmission system
Assignee: Partek Oy AB
•
Filing: 1980-05-13
•
Granted: 1982-11-23
•
Expires: 2000-05-13
Abstract
Abstract A graphic image represented by a two-level pel-to-pel definition is compressed by one-dimensional redundancy reduction coding using an entropy preserving algorithm which allows for real time reduction of the pel-to-pel data without any loss in image resolution. The compressed data is concatenated for transmission and then separated and decoded back to a pel-to-pel format for defining a facsimile image.
Inventors
- 👤 Larry M. Wolfrum
- 👤 Frederick C. Barrett
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 16:12
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/41; H04N1/411; H04N1/413; H04N1/419; G; G06; G06T; G06T9/00; G06T9/005; H03; H03M; H03M7/00; H03M7/30; H03M7/46
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
226 words
A method of one-dimensional redundancy reduction coding, transmission and decoding of binary image data by use of an entropy preserving algorithm, the image data of the type including two-level pel representation of an image to be transmitted, comprising the steps of: (a) generating an image definition comprising a serial stream of binary data bits, each bit representing a single pel of either a first level or a second level; (b) assigning a predetermined binary code N having a number of data bits n representing a runlength of consecutive pels of a single level; (c) assigning a prefix P for defining with N a codeword representation of a runlength, the prefix P having a number of data bits p, whereby the total number of data bits representing each runlength of pels is defined by a codeword comprising a prefix P and a code N having (p+n) data bits; (d) concatenating consecutive codewords; (e) framing the concatenated codewords into output words W each having a fixed, predetermined number of data bits w; (f) transmitting the output words; and (g) receiving and decoding the transmitted output words for generating therefrom a serial stream of data bits, each bit representing a single pel of one of said levels, by searching in said output words for the prefix P associated with a codeword and identifying therefrom the (p+n) bits associated therewith.
Claim 2
Independent Claim
226 words
A method of one-dimensional redundancy reduction coding, transmission and decoding of binary image data by use of an entropy preserving algorithm, the image data of the type including two-level pel representation of an image to be transmitted, comprising the steps of: (a) generating an image definition comprising a serial stream of binary data bits, each bit representing a single pel of either a first level or a second level; (b) assigning a predetermined binary code N having a number of data bits n representing a runlength of consecutive pels of a single level; (c) assigning a prefix P for defining with N a codeword representation of a runlength, the prefix P having a number of data bits p, whereby the total number of data bits representing each runlength of pels is defined by a codeword comprising a prefix P and a code N having (p+n) data bits; (d) concatenating consecutive codewords; (e) framing the concatenated codewords into output words W each having a fixed, predetermined number of data bits w; (f) transmitting the output words; and (g) receiving and decoding the transmitted output words for generating therefrom a serial stream of data bits, each bit representing a single pel of one of said levels, by searching in said output words for the prefix P associated with a codeword and identifying therefrom the (p+n) bits associated therewith.
Claim 3
Dependent Claim
74 words
The method of claim 1, wherein the step of concatenating consecutive codewords comprises: (a) framing the first w bits of a first group of consecutive codewords to define an output word; (b) preserving any residue bits r in said first group of consecutive codewords in excess of the first w bits; and (c) framing said residue bits with the first (w-r) bits of a second group of consecutive codewords to define another output word.
Claim 4
Dependent Claim
53 words
The method of claim 2, wherein the step of decoding the transmitted output words comprises: (a) identifying a codeword comprising (p+n) bits in the output words; and (b) generating a corresponding serial stream of binary bits, each bit representing a single pel in a runlength of pels of one of said two levels.
Claim 5
Dependent Claim
69 words
The method of claim 3, wherein the steps of decoding the transmitted output words further comprises: (a) locating the prefix P associated with each codeword in said output words; (b) framing the (p+n) bits defined by the prefix P and associated with the corresponding codeword; and (c) generating the corresponding serial stream of binary data bits defined by the n bits identifying the code N in said (p+n) bits.
Claim 6
Dependent Claim
11 words
The method of claim 1, wherein w is an arbitrary number.
Claim 7
Dependent Claim
11 words
The method of claim 1, wherein p is proportional to n.
Claim 8
Dependent Claim
26 words
The method of claim 6 where n is an arbitrary number of from two to n bits and wherein p is equal to the quantity (n-2).
Claim 9
Dependent Claim
27 words
The method of claim 1 wherein the first runlength of each data image is arbitrarily defined as a runlength of a predetermined one of said pel levels.
Claim 10
Dependent Claim
17 words
The method of claim 8, wherein each code N represents runlengths of either of said pel levels.
Claim 11
Dependent Claim
71 words
The method of claim 9, including the steps of setting an arbitrary limit on the consecutive number of pels of one level in a runlength, defined by a single codeword and assigning a unique code to a runlength having a number of pels in excess of the limit for indicating that the runlength of pels is defined by a plurality of consecutive codewords defining consecutive runlengths of the same pel level.
Claim 12
Dependent Claim
27 words
The method of claim 1, wherein the binary image data is generated by a raster scan device adapted for optically scanning an image on a sheet document.
Claim 13
Dependent Claim
43 words
The method of claim 11, wherein the scanner defines the image as a plurality of pels for each line of scan and wherein the first runlength of each line is arbitrarily defined as a runlength of a predetermined one of said pel levels.
Claim 14
Dependent Claim
21 words
The method of claim 11, including the step of defining on the sheet document a predetermined image area to be scanned.
Claim 15
Independent Claim
285 words
An apparatus for one-dimensional redundancy reduction coding, transmitting and decoding binary data by use of an entropy preserving algorithm, the data representing an image in a plurality of two-level pels, comprising: (a) means for generating an image definition comprising a serial stream of binary data bits, each bit representing a single pel of either a first level or a second level; (b) means for defining the boundaries between runs of consecutive pels of the same level by using an entropy preserving algorithm, wherein there is further: (i) means for assigning a predetermined binary code N having a number of data bits n representing a runlength of consecutive pels of a single level; (ii) means for assigning a prefix P for defining with N a codeword representation of a runlength, the prefix P having a number of data bits p, whereby the total number of data bits representing each runlength of pels is defined by a codeword comprising a prefix P and a code N having (p+n) data bits; (c) means dependent on said boundaries for generating a binary codeword representing each of said runs; (d) means for concatenating the first w bits of a first group of consecutive codewords to define an output word; (e) means for separating and storing any residue bits r in the first group of codewords in excess of w bits; (f) means for defining another output word from the next subsequent group of codewords by concatenating the first (w-r) bits of said group with the residue bits r of the first group of codewords; (g) means for transmitting the output words; and (h) means for extracting the codewords from said output words for reformation of the image in pel-to-pel format.
Claim 16
Independent Claim
285 words
An apparatus for one-dimensional redundancy reduction coding, transmitting and decoding binary data by use of an entropy preserving algorithm, the data representing an image in a plurality of two-level pels, comprising: (a) means for generating an image definition comprising a serial stream of binary data bits, each bit representing a single pel of either a first level or a second level; (b) means for defining the boundaries between runs of consecutive pels of the same level by using an entropy preserving algorithm, wherein there is further: (i) means for assigning a predetermined binary code N having a number of data bits n representing a runlength of consecutive pels of a single level; (ii) means for assigning a prefix P for defining with N a codeword representation of a runlength, the prefix P having a number of data bits p, whereby the total number of data bits representing each runlength of pels is defined by a codeword comprising a prefix P and a code N having (p+n) data bits; (c) means dependent on said boundaries for generating a binary codeword representing each of said runs; (d) means for concatenating the first w bits of a first group of consecutive codewords to define an output word; (e) means for separating and storing any residue bits r in the first group of codewords in excess of w bits; (f) means for defining another output word from the next subsequent group of codewords by concatenating the first (w-r) bits of said group with the residue bits r of the first group of codewords; (g) means for transmitting the output words; and (h) means for extracting the codewords from said output words for reformation of the image in pel-to-pel format.
Claim 17
Dependent Claim
41 words
The apparatus of claim 14, wherein the output words include a predetermined, arbitrary number of data bits w, wherein the codewords contain from 2 to n bits, and wherein w is not required to be a whole number multiple of n.
Claim 18
Dependent Claim
83 words
The apparatus of claim 15, further including: (a) means for concatenating the first w bits of a first group of consecutive codewords to define an output word; (b) means for separating and storing any residue bits r in the first group of codewords in excess of w bits; and (c) means for defining another output word from the next subsequent group of codewords by concatenating the first (w-r) bits of said group with the residue bits r of the first group of codewords.
Claim 19
Dependent Claim
22 words
The apparatus of claim 15, the means for decoding further comprising means for extracting whole codewords from one or more output words.
Claim 20
Dependent Claim
26 words
The apparatus of claim 14 wherein the means for generating an image definition comprises a raster scanner for optically scanning an image on a sheet document.
References Cited (Backward Citations)
US3560639A
Cited
US3849592A
Cited
US4121259A
Cited
US4156880A
Cited
US4136363A
Cited
US4207599A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1985-11-22 | 1986-05-24 | 1986-11-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1989-11-22 | 1990-05-24 | 1990-11-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1993-11-22 | 1994-05-24 | 1994-11-23 | $7700.00 | Window Closed / Lapsed |