Patent US4943869A successfully refreshed from Google Patents.
US4943869A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Compression method for dot image data
Assignee: Fujifilm Holdings Corp
•
Filing: 1988-05-04
•
Granted: 1990-07-24
•
Expires: 2008-05-04
Abstract
Abstract This invention method performs data compression for dot image data by utilizing the redundancy based on spacial correlation of images and correlation of dot patterns. More particularly, a threshold matrix is rearranged in array according to a predetermined reference, the threshold matrix being used to convert input image data into dot data, so as to output the same logical values continuously from the top and/or from the end of dot data array, and simultaneously dot data are grouped in the unit of a predetermined bits so as to count the number of units having the same and continuous logical values from the top and/or from the end to thereby effectively compress data of dot images by a perfect reproduction system or a non-perfect reproduction system.
Inventors
- 👤 Hiroshi Horikawa
- 👤 Hitoshi Urabe
- 👤 Katsutoshi Yako
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 20:12
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/005; H; H04; H04N; H04N1/00; H04N1/41; H04N1/4105
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
199 words
A compression method for dot image data of the type wherein an image signal is comprised of a plurality of pixel density levels, each corresponding to a density level of a different pixel, said method comprising the steps of: providing a threshold matrix means having n (where n is an integer value) threshold matrix values associated with each pixel, said threshold matrix means for converting said image signal to digital dot data by comparing each said pixel density level to said n threshold matrix values associated with that pixel, to produce, for each pixel, n bits of digital dot data which are re-arranged for each respective said pixel in accordance with a predetermined reference obtained from threshold matrix values of the respective said pixel, compressing said digtial dot data by counting data having the same continuous logical values, from at least one of a top and an end of the dot data thus obtained, in increments of a predetermined unit so as to produce compression data corresponding to a number of units from the at least one of a top and end thereof, and leaving digital dot data which are not compressed in said compressing step in un-encoded form.
Claim 2
Dependent Claim
199 words
A compression method for dot image data of the type wherein an image signal is comprised of a plurality of pixel density levels, each corresponding to a density level of a different pixel, said method comprising the steps of: providing a threshold matrix means having n (where n is an integer value) threshold matrix values associated with each pixel, said threshold matrix means for converting said image signal to digital dot data by comparing each said pixel density level to said n threshold matrix values associated with that pixel, to produce, for each pixel, n bits of digital dot data which are re-arranged for each respective said pixel in accordance with a predetermined reference obtained from threshold matrix values of the respective said pixel, compressing said digtial dot data by counting data having the same continuous logical values, from at least one of a top and an end of the dot data thus obtained, in increments of a predetermined unit so as to produce compression data corresponding to a number of units from the at least one of a top and end thereof, and leaving digital dot data which are not compressed in said compressing step in un-encoded form.
Claim 3
Dependent Claim
35 words
A compression method for dot image data as claimed in claim 1 wherein said predetermined refernce is a mean value of said n threshold matrix values of the respective pixels of said threshold matrix means.
Claim 4
Dependent Claim
35 words
A compression method for dot image data as claimed in claim 1 wherein said predetermined reference is a maximum value of said n threshold matrix values of the respective pixels of said threshold matrix means.
Claim 5
Dependent Claim
34 words
A compression method for dot image data as claimed in claim 1 wherein said predetermined reference is a minimum of said n threshold matrix values of the respective pixels of said threshold matrix means.
Claim 6
Dependent Claim
74 words
A compression method for dot image data as claimed in claim 1 wherein said predetermined reference is in the order of a maximum value of said n threshold matrix values when a mean value of said n threshold matrix values of each pixel is greater than a reference value, and is in the order of a minimum value of said n threshold matrix values when the mean value is smaller than said reference value.
Claim 7
Dependent Claim
242 words
A compression method for dot image data of the type wherein an image signal is comprised of a plurality of pixel density levels, each corresponding to a density level of a different pixel, said method comprising the steps of: providing a threshold matrix means having n (where n is an integer value) threshold matrix values associated with each pixel, said threshold matrix means for converting said image signal to digital dot data by comparing each said pixel density level to said n threshold matrix values associated with that pixel, to produce, for each pixel, n bits of digital dot data which are re-arranged for each respective said pixel in accordance with a predetermined reference obtained from threshold matrix values of the respective said pixel, wherein different pluralities of said n bits of digital dot data obtained by said rearrangements are each grouped in a product unit of n multiplied with an integer; compressing said digital dot data by counting the number of groups of said product unit having the same logical values from first and second opposing ends of at least one of an opposing top/bottom and a left/right string of the digital dot data, wherein there are derived first and second group data and there is uncompressed intermediate digital dot data between the groups of said product unit used to obtain said first and second group data; and further compressing said intermediate digital dot data in accordance with a code table.
Claim 8
Dependent Claim
242 words
A compression method for dot image data of the type wherein an image signal is comprised of a plurality of pixel density levels, each corresponding to a density level of a different pixel, said method comprising the steps of: providing a threshold matrix means having n (where n is an integer value) threshold matrix values associated with each pixel, said threshold matrix means for converting said image signal to digital dot data by comparing each said pixel density level to said n threshold matrix values associated with that pixel, to produce, for each pixel, n bits of digital dot data which are re-arranged for each respective said pixel in accordance with a predetermined reference obtained from threshold matrix values of the respective said pixel, wherein different pluralities of said n bits of digital dot data obtained by said rearrangements are each grouped in a product unit of n multiplied with an integer; compressing said digital dot data by counting the number of groups of said product unit having the same logical values from first and second opposing ends of at least one of an opposing top/bottom and a left/right string of the digital dot data, wherein there are derived first and second group data and there is uncompressed intermediate digital dot data between the groups of said product unit used to obtain said first and second group data; and further compressing said intermediate digital dot data in accordance with a code table.
Claim 9
Dependent Claim
20 words
A compression method for dot image data as claimed in claim 6 wherein said code table is a look-up table.
Claim 10
Dependent Claim
186 words
A compression method for dot image data of the type wherein an image signal is comprised of a plurality of pixel density levels, each corresponding to a density level of a different pixel, said method comprising the steps of: providing a threshold matrix means havign n (where n is an integer value) threshold matrix values associated with each pixel, said threshold matrix means for converting said image signal to digital dot data by comparing each said pixel density level to said n threshold matrix values associated with that pixel, to produce, for each pixel, n bits of digital dot data which are re-arranged for each respective said pixel in accordance with a predetermined reference obtained from threshold matrix values of the respective said pixel, compressing said digital dot data by counting data from at least one of a top and an end of thus obtained digital dot data, and continuing said count until at least two bits of data having logical values opposite to those of previous counted bits are encountered, wherein previous counted bits which have been counted are treated as the same logical values.
Claim 11
Dependent Claim
186 words
A compression method for dot image data of the type wherein an image signal is comprised of a plurality of pixel density levels, each corresponding to a density level of a different pixel, said method comprising the steps of: providing a threshold matrix means havign n (where n is an integer value) threshold matrix values associated with each pixel, said threshold matrix means for converting said image signal to digital dot data by comparing each said pixel density level to said n threshold matrix values associated with that pixel, to produce, for each pixel, n bits of digital dot data which are re-arranged for each respective said pixel in accordance with a predetermined reference obtained from threshold matrix values of the respective said pixel, compressing said digital dot data by counting data from at least one of a top and an end of thus obtained digital dot data, and continuing said count until at least two bits of data having logical values opposite to those of previous counted bits are encountered, wherein previous counted bits which have been counted are treated as the same logical values.
Claim 12
Dependent Claim
34 words
A compression method for dot image as claimed in claim 8 wherein said predetermined reference is a mean value of said n threshold matrix values of the respective pixels of said threshold matrix means.
Claim 13
Dependent Claim
35 words
A compression method for dot image data as claimed in claim 8 wherein said predetermined reference is a maximum value of said n threshold matrix values of the respective pixels of said threshold matrix means.
Claim 14
Dependent Claim
34 words
A comression method for dot image data as claimed in claim 8 wherein said predetermined reference is a minimum of said n threshold matrix values of the respective pixels of said threshold matrix means.
Claim 15
Dependent Claim
74 words
A compression method for dot image data as claimed in claim 8 wherein said predetermined reference is in the order of a maximum value of said n threshold matrix values when a mean value of said n threshold matrix values of each pixel is greater than a reference value, and is in the order of a minimum value of said n threshold matrix values when the mean value is smaller than said reference value.
Claim 16
Dependent Claim
254 words
A compression method for dot image data of the type wherein an image signal is comprised of a plurality of pixel density levels, each corresponding to a density level of a different pixel, said method comprising the steps of: providing a threshold matrix means having n (where n is an integer value) threshold matrix values associated with each pixel, said threshold matrix means for converting said image signal to digital dot data by comparing each said pixel density level to said n threshold matrix values associated with that pixel, to produce, for each pixel, n bits of digital dot data which are re-arranged for each respective said pixel in accordance with a predetermined reference obtained from threshold matrix values of the respective said pixel, compressing said digital dot data by counting the number of data having the same logical values from first and second opposing ends of at least one of a top/bottom and a left/right string of the dot data and continuing count with respect to each of said first and second opposing ends until at least two bits of data having logical values opposite to those of previous counted bits are encountered, wherein previous counted bits which have been counted are treated as the same logical values and there are derived first and second group data and uncompressed intermediate digital dot data between the groups of said product unit used to obtain said first and second group data; and further compressing said intermediate digital dot data in accordance with a code table.
Claim 17
Dependent Claim
254 words
A compression method for dot image data of the type wherein an image signal is comprised of a plurality of pixel density levels, each corresponding to a density level of a different pixel, said method comprising the steps of: providing a threshold matrix means having n (where n is an integer value) threshold matrix values associated with each pixel, said threshold matrix means for converting said image signal to digital dot data by comparing each said pixel density level to said n threshold matrix values associated with that pixel, to produce, for each pixel, n bits of digital dot data which are re-arranged for each respective said pixel in accordance with a predetermined reference obtained from threshold matrix values of the respective said pixel, compressing said digital dot data by counting the number of data having the same logical values from first and second opposing ends of at least one of a top/bottom and a left/right string of the dot data and continuing count with respect to each of said first and second opposing ends until at least two bits of data having logical values opposite to those of previous counted bits are encountered, wherein previous counted bits which have been counted are treated as the same logical values and there are derived first and second group data and uncompressed intermediate digital dot data between the groups of said product unit used to obtain said first and second group data; and further compressing said intermediate digital dot data in accordance with a code table.
Claim 18
Dependent Claim
20 words
A compression method for dot image data as claimed in claim 13 wherein said code table is a look-up table.
References Cited (Backward Citations)
US4115815A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-07-23 | 1994-01-22 | 1994-07-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-07-23 | 1998-01-22 | 1998-07-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-07-23 | 2002-01-22 | 2002-07-24 | $7700.00 | Window Closed / Lapsed |