US5365252A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Color quantization apparatus and method for frame buffer display
Assignee: Ricoh Co Ltd
•
Filing: 1991-09-23
•
Granted: 1994-11-15
•
Expires: 2011-09-23
Abstract
Abstract A digital color image display system adapted to a frame buffer for displaying color images. The system includes apparatus for color quantization. The color distribution of a color image is stored in a memory device (HISTTABLE). The memory device has address format of r0g0b0r1g1b1. . . rnbnzn, where ri is ith bit in red color bits, gi is ith bit in green color bits, and bi is ith bit in blue color bits. Thus, each pixel can be mapped into one of the addresses of the memory device according to its three basic color bits (red, green and blue); and the three basic color bits form a color universe cell in a 3-dimensional space. To select 256 colors from a color image, the color universe cell is divided into 256 color cells according to the color distribution. Because the special address arrangement of the memory device, the division of the color universe cell can be easily accomplished by flipping one bit of the index to the memory device, thus increasing the speed to select 256 colors and reducing complexity of the hardware.
Inventors
- 👤 Dick W. Lo
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 22:42
CPC Classifications
G; G09; G09G; G09G5/00; G09G5/02; G09G5/06
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
255 words
In a digital color image display system wherein a color image is stored as an array of pixels, each pixel having an associated color represented by three, basic colors, each of said basic colors having n+1 bits where n is greater than zero, thus all color combinations of said three n+1 bits of the three basic colors form a color universe which includes all possible color combinations of the pixels, said digital color image display system comprising: (a) first memos- means for storing color distribution of the pixels in said color universe, said first memory means having a sequence of addresses whose whole range encompasses said color universe; and (b) first address means for mapping each pixel into one of said addresses of said first memory means according to the said three n+1 bits of the three basic colors associated to said each pixel: wherein said three n+1 bits of said three basic colors have a format r0 r1 r2 r3 . . . rn g0 g1 g2 g3 . . . gn b0 b1 b2 b3 . . . bn wherein said sequence of addresses of said first memory means has an address format r0 g0 b0 r1 g1 b1 r2 g2 b2 . . . rn gn bn, and wherein said first address means forms said address format for said first memory means by converting said three n+1 bits of said three basic colors into said address format r0 g0 b0 r1 g1 b1 r2 g2 b2 . . . rn gn bn.
Claim 2
Dependent Claim
255 words
In a digital color image display system wherein a color image is stored as an array of pixels, each pixel having an associated color represented by three, basic colors, each of said basic colors having n+1 bits where n is greater than zero, thus all color combinations of said three n+1 bits of the three basic colors form a color universe which includes all possible color combinations of the pixels, said digital color image display system comprising: (a) first memos- means for storing color distribution of the pixels in said color universe, said first memory means having a sequence of addresses whose whole range encompasses said color universe; and (b) first address means for mapping each pixel into one of said addresses of said first memory means according to the said three n+1 bits of the three basic colors associated to said each pixel: wherein said three n+1 bits of said three basic colors have a format r0 r1 r2 r3 . . . rn g0 g1 g2 g3 . . . gn b0 b1 b2 b3 . . . bn wherein said sequence of addresses of said first memory means has an address format r0 g0 b0 r1 g1 b1 r2 g2 b2 . . . rn gn bn, and wherein said first address means forms said address format for said first memory means by converting said three n+1 bits of said three basic colors into said address format r0 g0 b0 r1 g1 b1 r2 g2 b2 . . . rn gn bn.
Claim 3
Dependent Claim
36 words
The digital color image display system of claim 1, further comprising: first counting means for generating said color distribution in said color universe by adding a number in an address converted by said first address means.
Claim 4
Dependent Claim
96 words
The digital color image display system of claim 1, further comprising: (c) dividing means for splitting said color universe into a plurality of split color cells according to said color distribution, each of said split color cells corresponding to a section of said sequence of addresses of said first memory means; and (d) second memory, means for forming an index to said first memory means by recording a plurality of address boundaries in said sequence of addresses in said first memory, means said plurality of address boundaries corresponding to said plurality of split color cells respectively.
Claim 5
Dependent Claim
99 words
The digital color image display system of claim 3, wherein said second memory means further comprises: means for storing heads for said plurality of split color cells, each of said heads recording a beginning address in said first memory means; and means for storing tails for said plurality of split color cells, each of said tails recording an ending address in said first memory means; wherein a head and a corresponding tail indicate a section of said sequence of addresses in said first memory means, said section corresponding to a respective one of said plurality of split color cells.
Claim 6
Dependent Claim
41 words
The digital color image display system of claim 4, further comprising: second counting means for generating weights for said plurality of split color cells according to said address boundaries indicated by said heads and tails stored in said second memory means.
Claim 7
Dependent Claim
64 words
The digital color image system of claim 4, wherein said heads and tails have an address format r0 g0 b0 r1 g1 b1 r2 g2 b2 . . . rn gn bn, and wherein said dividing means splits said color universe by flipping one bit in a chosen one of said heads and flipping a corresponding bit in a chosen one of said tails.
Claim 8
Dependent Claim
27 words
The digital color image system of claim 3, further comprising: color means for generating a plurality of colors for said pixels based on said split color cells.
Claim 9
Dependent Claim
26 words
The digital color image system of claim 7, wherein said color means generates said plurality of colors based on arithmetic means of said heads and tails.
Claim 10
Dependent Claim
22 words
The digital color image display system of claim 8, wherein said arithmetic mean is obtained by flipping one bit in said heads.
Claim 11
Dependent Claim
43 words
The digital color image display system of claim 7, further comprising a third memory means for storing said plurality of colors, said each of said plurality of colors is stored in a memory cell associated with an address of said third memory means.
Claim 12
Dependent Claim
82 words
The digital color image display system of claim 10, further comprising: a fourth memory means for storing addresses of said third memory means where said generated colors are stored, said fourth memory means having a sequence of addresses that encompasses said color universe, wherein a section of said sequence of addresses indicated by a corresponding head and tail in said second memory means is filled with a third memory address for storing one generated color based on said corresponding head and tail.
Claim 13
Dependent Claim
84 words
The digital color image display system of claim 11, wherein said sequence of addresses of said fourth memory means has an address format r0 g0 b0 r1 g1 b1 r2 g2 b2 . . . rn gn bn, and wherein said first address means forms said address format for said fourth memory by means by converting said three n+1 bits of the three basic colors into said address format r0 g0 b0 r1 g1 b1 r2 g2 b2 . . . rn gn bn.
Claim 14
Dependent Claim
130 words
The digital color image system of claim 12, further comprising: a storage device for storing said pixels; fifth memory means for storing an index to said third memory means for said pixels, wherein each of said pixels has position information indicating its position in said fifth memory means, wherein each of said pixels stored in said storage device has a corresponding address in said fifth memory means; a second address means for mapping each pixel into one of said addresses of said fourth memory means according to the three n+1 bits of the three basic colors associated to said each pixel; and loading means, in response to an address generated by said second address means for loading a color address in said fourth memory means to said fifth memory means.
Claim 15
Dependent Claim
48 words
The digital color image display system of claim 13, wherein said second address means forms an address format by converting said three n+1 bits of said three basic colors into said address format r0 g0 b0 r1 g1 b1 r2 g2 b2 . . . rn gn bn.
Claim 16
Dependent Claim
27 words
The digital color image display system of claim 1, further comprising: color means for generating a plurality of colors for said pixels based on said color distribution.
Claim 17
Dependent Claim
24 words
The digital color image display system of claim 1, wherein said color distribution representing a histogram distribution of said pixels m said color universe.
Claim 18
Dependent Claim
243 words
For use with a digital color image display system wherein a color image is stored as an array of pixels, each pixel having an associated color represented by three basic colors, each of said basic colors having n+1 bits where in is greater than zero, thus all color combinations of said three n+1 bits of the three basic colors form a color universe which includes all possible color combinations of the pixels, a method for processing color quantization comprising the steps of: (a) storing color distribution of the pixels in said color universe in a first memory means having a sequence of addresses, whose whole range encompasses said color universe; and (b) mapping each pixel into one of said addresses of said first memory means according to said three n+1 bits of the three basic colors associated to said each pixel; wherein said three n+1 bits of said three basic colors have a format r0 r1 r2 r3 . . . rn b0 b1 b2 b3 . . . bn wherein said sequence of addresses of said first memory means has an address format r0 g0 b0 r1 g1 b1 r2 g2 b2 . . . rn gn bn, and wherein said step (b) forms said address format for said first memory means by converting said three n+1 bits of said three basic colors into said address format r0 g0 b0 r1 g1 b1 r2 g2 b2 . . . rn gn bn.
Claim 19
Dependent Claim
243 words
For use with a digital color image display system wherein a color image is stored as an array of pixels, each pixel having an associated color represented by three basic colors, each of said basic colors having n+1 bits where in is greater than zero, thus all color combinations of said three n+1 bits of the three basic colors form a color universe which includes all possible color combinations of the pixels, a method for processing color quantization comprising the steps of: (a) storing color distribution of the pixels in said color universe in a first memory means having a sequence of addresses, whose whole range encompasses said color universe; and (b) mapping each pixel into one of said addresses of said first memory means according to said three n+1 bits of the three basic colors associated to said each pixel; wherein said three n+1 bits of said three basic colors have a format r0 r1 r2 r3 . . . rn b0 b1 b2 b3 . . . bn wherein said sequence of addresses of said first memory means has an address format r0 g0 b0 r1 g1 b1 r2 g2 b2 . . . rn gn bn, and wherein said step (b) forms said address format for said first memory means by converting said three n+1 bits of said three basic colors into said address format r0 g0 b0 r1 g1 b1 r2 g2 b2 . . . rn gn bn.
Claim 20
Dependent Claim
89 words
The method of claim 17 further comprising the steps of: (c) splitting said color universe into a plurality of split color cells according to said color distribution, each of said split color cells corresponding to a section of said sequence of addresses of said first memory means; and (d) forming an index to said first memory means by recording a plurality of address boundaries in said sequence of addresses in said first memory means, said plurality of said address boundaries corresponding to said plurality of split color cells respectively.
Claim 21
Dependent Claim
93 words
The method of claim 18, wherein said step (d) further comprises the steps of: storing heads for said plurality of split color cells, each of said heads recording a beginning address in said first memory means; and storing tails for said plurality of split color cells, each of said tails recording an ending address in said first memory means; wherein a head and a corresponding tail indicate a section of said sequence of addresses in said first memory means, said section corresponding to a respective one of said plurality of split color cells.
Claim 22
Dependent Claim
59 words
The method of claim 19, wherein said heads and tails have a format r0 g0 b0 r1 g1 b1 r2 g2 b2 . . . rn gn bn, and wherein said step (c) splits said color universe by flipping one bit in a chosen one of said heads and flipping corresponding bit in a chosen one of said tails.
Claim 23
Dependent Claim
20 words
The method of claim 17, wherein said color distribution representing a histogram distribution of said pixels in said color universe.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-11-14 | 1998-05-16 | 1998-11-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-11-14 | 2002-05-16 | 2002-11-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-11-14 | 2006-05-16 | 2006-11-15 | $7700.00 | Window Closed / Lapsed |