← Back to Patent Explorer
US4546385A Expired / Lapsed US ⏱️ 0.0 years remaining

Data compression method for graphics images

Assignee: International Business Machines Corp
•
Filing: 1983-06-30
•
Granted: 1985-10-08
•
Expires: 2003-06-30
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Graphic images are generally considered to be those images comprised of text and/or drawings. Data compression of graphics images is desired whenever a fast image transmission speed is desired in a limited band width channel. It is also used for storage of a large number of images in a limited capacity storage system. A high compression ratio is achieved by thresholding the graphics image to a bilevel black-white image at one bit per pixel and then employing a second data compression on the black-white image. At low resolution, bilevel images have poor quality at edges and a quality improvement is needed. The data compression apparatus and method disclosed separates the graphics image into at least first and second bit planes identifies edge pixels from the first bit plane indicating a black/white change, locates the edge pixels and generates at least a single bit for each edge pixel indicating whether the edge pixel has a maximum intensity value such as black or white or an intermediate gray intensity value. Intermediate values are not allowed except at edge pixels which enhances both quality and compressibility of the resulting graphics image.

Inventors

  • 👤 Dimitris Anastassiou

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 07:25
CPC Classifications
G; G06; G06T; G06T9/00

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 158 words
A method for compressing data representing a graphics image encoded in binary form having at least first and second bit planes respectively containing a most significant bit and at least significant bit for each pixel in the image indicating whether the pixel has an extreme intensity value or one of two intermediate intensity values, comprising the steps of: identifying edge pixels from the change in value of the binary state of successive bits in said first bit plane of said image; generating at least a single binary bit for each adjacent edge pixel so identified; comparing the bits in the first and second bit planes for each of said edge pixels to determine the binary state of each of said binary bits generated, for indicating by said state whether each edge pixel has an extreme intensity value or an intermediate intensity value; and replacing said second bit plane with said indicative binary bits to compress the image data.
Claim 2
Independent Claim 158 words
A method for compressing data representing a graphics image encoded in binary form having at least first and second bit planes respectively containing a most significant bit and at least significant bit for each pixel in the image indicating whether the pixel has an extreme intensity value or one of two intermediate intensity values, comprising the steps of: identifying edge pixels from the change in value of the binary state of successive bits in said first bit plane of said image; generating at least a single binary bit for each adjacent edge pixel so identified; comparing the bits in the first and second bit planes for each of said edge pixels to determine the binary state of each of said binary bits generated, for indicating by said state whether each edge pixel has an extreme intensity value or an intermediate intensity value; and replacing said second bit plane with said indicative binary bits to compress the image data.
Claim 3
Dependent Claim 32 words
A method according to claim 1, comprising the further step of inserting said indicative binary bits adjacent their respective edge pixel most significant bits for transmission with the first bit plane data.
Claim 4
Dependent Claim 40 words
A method according to claim 1, wherein said identifying and said generating are accomplished by the step of performing a logical exclusive OR on the most significant bits of the intensity values of a current pixel and an adjacent pixel.
Claim 5
Dependent Claim 38 words
A method according to claim 3, wherein said comparing step is accomplished by performing a logical exclusive OR on a most significant bit and a least significant bit of the intensity value of each of said edge pixels.
Claim 6
Dependent Claim 113 words
Apparatus for compressing binary data representing a graphics image having at least first and second bit planes respectively containing a most significant bit and a least significant bit for each pixel in the image, comprising: means for identifying edge pixels from the change in value of the binary state of successive bits in said first bit plane of said image; and means for comparing corresponding bits in said first and second bit planes for each said edge pixel and generating at least a single bit for each said edge pixel, indicating whether said edge pixel has a maximum intensity value or an intermediate inensity value, which single bits replace said second bit plane.
Claim 7
Dependent Claim 113 words
Apparatus for compressing binary data representing a graphics image having at least first and second bit planes respectively containing a most significant bit and a least significant bit for each pixel in the image, comprising: means for identifying edge pixels from the change in value of the binary state of successive bits in said first bit plane of said image; and means for comparing corresponding bits in said first and second bit planes for each said edge pixel and generating at least a single bit for each said edge pixel, indicating whether said edge pixel has a maximum intensity value or an intermediate inensity value, which single bits replace said second bit plane.
Claim 8
Dependent Claim 38 words
Apparatus according to claim 5, wherein said means for comparing and generating comprise means for performring a first logical exclusive OR on a most significant bit of an intensity value of a current pixel and an adjacent pixel.
Claim 9
Dependent Claim 42 words
Apparatus according to claim 6, wherein said means for comparing and generating further comprises means for performing a second logical exclusive OR on a most significant bit and a least significant bit of the intensity value of each of said edge pixels.
Claim 10
Dependent Claim 29 words
Apparatus according to claim 7, wherein said means for comparing and generating further comprises AND means for receiving the results of said first and second logical exclusive OR operations.

References Cited (Backward Citations)

US3670096A Cited
US4115816A Cited
US4006298A Cited
US4117470A Cited
US4210936A Cited
US4229768A Cited
US4266299A Cited
US4259694A Cited
US4280144A Cited
US4339774A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1988-10-07 1989-04-08 1989-10-08 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1992-10-07 1993-04-08 1993-10-08 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1996-10-07 1997-04-08 1997-10-08 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag