Patent US6091850A successfully refreshed from Google Patents.
← Back to Patent Explorer
US6091850A Expired / Lapsed US ⏱️ 0.0 years remaining

Method of compressing and decompressing graphic images

Assignee: FMI TRANSITION LLC
•
Filing: 1998-09-24
•
Granted: 2000-07-18
•
Expires: 2018-09-24
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method of compressing and decompressing graphics images. The compression method operates on uncompressed bitmap image data to generate a compressed representation of the image. To compress an image, all 8 pixel by 8 pixel blocks of the image are individually processed in sequence. For each block, all distinct colors present in the block are identified and assigned an ordinal number. Two pixel colors are deemed distinct if the difference between the colors is greater than an epsilon value. The epsilon value is a function of the total brightness of the block. A data structure for the block is generated to store the number of distinct colors present in the block, the actual RGBA quadruplet for each distinct color, and a color ordinal number of each pixel in the block representing the distinct color of the pixel. To decompress the image, the RGBA quadruplets of all pixels within each block are reconstructed from the data structure for the block.

Inventors

  • 👤 Alex Ostrovsky

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 12:57
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/005

Claims Analysis

Total Claims: 19
Claim 1
Independent Claim 163 words
A computer-implemented method of compressing graphics image data into at least one compressed block comprising the steps of: (A) reading a block of graphics image data, the block having a plurality of pixels, each of the plurality of pixels having a color represented by red, green, blue, and intensity values; (B) computing an epsilon value for the block, the epsilon value for the block being based on an attribute of the block; (C) mapping a color ordinal number to each pixel in the block by identifying a distinct color of the pixel based on the epsilon value and assigning to the pixel a corresponding color ordinal number, each color ordinal number representing one of the distinct colors present in the pixels of the block; (D) storing the red, green, blue, and intensity values of each distinct color present in the block into the compressed block; and (E) storing the color ordinal number mapped to each pixel in the block into the compressed block.
Claim 2
Dependent Claim 163 words
A computer-implemented method of compressing graphics image data into at least one compressed block comprising the steps of: (A) reading a block of graphics image data, the block having a plurality of pixels, each of the plurality of pixels having a color represented by red, green, blue, and intensity values; (B) computing an epsilon value for the block, the epsilon value for the block being based on an attribute of the block; (C) mapping a color ordinal number to each pixel in the block by identifying a distinct color of the pixel based on the epsilon value and assigning to the pixel a corresponding color ordinal number, each color ordinal number representing one of the distinct colors present in the pixels of the block; (D) storing the red, green, blue, and intensity values of each distinct color present in the block into the compressed block; and (E) storing the color ordinal number mapped to each pixel in the block into the compressed block.
Claim 3
Dependent Claim 19 words
The computer-implemented method of claim 1, wherein the epsilon value is based on a total brightness of the block.
Claim 4
Dependent Claim 32 words
The computer-implemented method of claim 2, wherein, the total brightness of the block is based on an average of the red, green, and blue values of all the pixels in the block.
Claim 5
Dependent Claim 64 words
The computer-implemented method of claim 1, further comprising the steps of: (A) calculating a work bit value representing a number of significant bits for each red, green, blue, and intensity values; (B) calculating a quality level value representing a desired level of quality of graphics image data; and (C) further adjusting the epsilon value based on the work bit value and quality level value.
Claim 6
Dependent Claim 12 words
The computer-implemented method of claim 1, wherein the epsilon value equals zero.
Claim 7
Dependent Claim 21 words
The computer-implemented method of claim 1, further comprising the steps of: repeating steps (A)-(E) for all blocks of graphics image data.
Claim 8
Dependent Claim 27 words
The computer-implemented method of claim 1, further comprising the step of: storing a number representative of the distinct colors present in the block into the compressed block.
Claim 9
Dependent Claim 35 words
The computer-implemented method of claim 1, wherein the block of graphics image data has eight lines of pixels and eight columns of pixels, with the pixels located at the intersection of the rows and columns.
Claim 10
Dependent Claim 110 words
The computer-implemented method of claim 1, wherein two colors, a first color having a first red value, a first green value, a first blue value, and a first intensity value, and a second color having a second red value, a second green value, a second blue value, and a second intensity value, are distinct if after computing a sum of differences between the first red value and the second red value, the first green value and the second green value, the first blue value and the second blue value, and the first intensity value and the second intensity value, the sum of the differences is greater than the epsilon value.
Claim 11
Dependent Claim 47 words
The computer-implemented method of claim 1, wherein each red, green, blue, and intensity values are stored in the compressed block according to a work bit value, the work bit value determining a number of significant bits to be stored for each red, green, blue, and intensity values.
Claim 12
Dependent Claim 24 words
The computer-implemented method of claim 1, further comprising the step of: sequentially outputting each compressed block to a computer memory in a computer system.
Claim 13
Dependent Claim 165 words
In a computer system, an apparatus for compressing graphics image data into a compressed block, the graphics image data comprising a plurality of pixels, each of the plurality of pixels having a color represented by red, green, blue, and intensity values, the apparatus comprising: (A) means for computing an epsilon value for the block, the epsilon value for the block being based on an attribute of the block; (B) means for mapping a color ordinal number to each pixel in the block by identifying a distinct color of the pixel based on the epsilon value and assigning to the pixel a corresponding color ordinal number, each color ordinal number representing one of the distinct colors present in the pixels of the block; (C) means for storing the red, green, blue, and intensity values of each distinct color present in the block into the compressed block; and (D) means for storing the color ordinal number mapped to each pixel in the block into the compressed block.
Claim 14
Dependent Claim 165 words
In a computer system, an apparatus for compressing graphics image data into a compressed block, the graphics image data comprising a plurality of pixels, each of the plurality of pixels having a color represented by red, green, blue, and intensity values, the apparatus comprising: (A) means for computing an epsilon value for the block, the epsilon value for the block being based on an attribute of the block; (B) means for mapping a color ordinal number to each pixel in the block by identifying a distinct color of the pixel based on the epsilon value and assigning to the pixel a corresponding color ordinal number, each color ordinal number representing one of the distinct colors present in the pixels of the block; (C) means for storing the red, green, blue, and intensity values of each distinct color present in the block into the compressed block; and (D) means for storing the color ordinal number mapped to each pixel in the block into the compressed block.
Claim 15
Dependent Claim 164 words
A computer-implemented method of compressing graphics image data into at least one compressed block comprising the steps of: (A) reading a block of graphics image data, the block having a plurality of pixels, each of the plurality of pixels having a color represented by red, green, blue, and intensity values; (B) computing an epsilon value for the block, the epsilon value for the block being based on a total brightness of the block; (C) mapping a color ordinal number to each pixel in the block by identifying a distinct color of the pixel based on the epsilon value and assigning to the pixel a corresponding color ordinal number, each color ordinal number representing one of the distinct colors present in the pixels of the block; (D) storing the red, green, blue, and intensity values of each distinct color present in the block into the compressed block; and (E) storing the color ordinal number mapped to each pixel in the block into the compressed block.
Claim 16
Dependent Claim 164 words
A computer-implemented method of compressing graphics image data into at least one compressed block comprising the steps of: (A) reading a block of graphics image data, the block having a plurality of pixels, each of the plurality of pixels having a color represented by red, green, blue, and intensity values; (B) computing an epsilon value for the block, the epsilon value for the block being based on a total brightness of the block; (C) mapping a color ordinal number to each pixel in the block by identifying a distinct color of the pixel based on the epsilon value and assigning to the pixel a corresponding color ordinal number, each color ordinal number representing one of the distinct colors present in the pixels of the block; (D) storing the red, green, blue, and intensity values of each distinct color present in the block into the compressed block; and (E) storing the color ordinal number mapped to each pixel in the block into the compressed block.
Claim 17
Dependent Claim 32 words
The computer-implemented method of claim 13, wherein the total brightness of the block is based on an average of the red, green, and blue values of all the pixels in the block.
Claim 18
Dependent Claim 283 words
A computer-implemented method of compressing graphics image data into at least one compressed block comprising the steps of: (A) computing a work bit value representing a number of significant bits for each red, green, blue, and intensity values; (B) computing a quality level value representing a desired level of quality of graphics image data; (C) reading a block of graphics image data, the block having a plurality of pixels, each of the plurality of pixels having a color represented by red, green, blue, and intensity values; (D) computing a total brightness of the block, the total brightness of the block being based on an average of the red, green, and blue values of all the pixels in the block; (E) computing an epsilon value for the block, the epsilon value for the block being based on the total brightness of the block; (F) further adjusting the epsilon value based on the work bit value and quality level value; (G) mapping a color ordinal number to each pixel in the block by identifying a distinct color of the pixel based on the epsilon value and assigning to the pixel a corresponding color ordinal number, each color ordinal number representing one of the distinct colors present in the pixels of the block; (H) storing the red, green, blue, and intensity values of each distinct color present in the block based on the work bit value into the compressed block; (I) storing the color ordinal number mapped to each pixel in the block into the compressed block; (J) storing a number representative of the distinct colors present in the block, into the compressed block; and (K) repeating steps (C)-(J) for all blocks of graphics image data.
Claim 19
Dependent Claim 283 words
A computer-implemented method of compressing graphics image data into at least one compressed block comprising the steps of: (A) computing a work bit value representing a number of significant bits for each red, green, blue, and intensity values; (B) computing a quality level value representing a desired level of quality of graphics image data; (C) reading a block of graphics image data, the block having a plurality of pixels, each of the plurality of pixels having a color represented by red, green, blue, and intensity values; (D) computing a total brightness of the block, the total brightness of the block being based on an average of the red, green, and blue values of all the pixels in the block; (E) computing an epsilon value for the block, the epsilon value for the block being based on the total brightness of the block; (F) further adjusting the epsilon value based on the work bit value and quality level value; (G) mapping a color ordinal number to each pixel in the block by identifying a distinct color of the pixel based on the epsilon value and assigning to the pixel a corresponding color ordinal number, each color ordinal number representing one of the distinct colors present in the pixels of the block; (H) storing the red, green, blue, and intensity values of each distinct color present in the block based on the work bit value into the compressed block; (I) storing the color ordinal number mapped to each pixel in the block into the compressed block; (J) storing a number representative of the distinct colors present in the block, into the compressed block; and (K) repeating steps (C)-(J) for all blocks of graphics image data.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2003-07-18 2004-01-17 2004-07-18 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2007-07-18 2008-01-17 2008-07-18 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2011-07-18 2012-01-17 2012-07-18 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag