§
Luxuse
Patent Intelligence
Sign In
← Back to Patent Explorer
US5003299A Expired / Lapsed US ⏱️ 0.0 years remaining

Method for building a color look-up table

Assignee: Apple Inc
•
Filing: 1990-02-14
•
Granted: 1991-03-26
•
Expires: 2010-02-14
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for building an inverse color look-up table in a color graphics system. The inverse color look-up table accepts as an address input RGB color information and provides as a data output index information for indexing a color look-up table. The method initializes an array of data elements, each of said data elements for storing said index information, each of said data elements corresponding to a color position in RGB color space. A first index value is stored in the array, the first index value corresponding to an index for the color look-up table. The first index value is stored in a first of the data elements, the first data element corresponding to a color represented by the first index value in the color look-up table. An address of the first data element is also stored in a queue means. For a second of the data elements, it is determined whether the second data element has been assigned an index value. If the second data element has not been assigned an index value, second data element is assigned the first index value and an address is stored for the second data element in the queue means.

Inventors

  • 👤 James Batson
  • 👤 Ernie Beernink
  • 👤 David Fung
  • 👤 Michael Potel
  • 👤 Art Cabral
  • 👤 Cary Clark

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 06:41
CPC Classifications
G; G09; G09G; G09G5/00; G09G5/02

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 217 words
A method for building an inverse color look-up table in a color graphics system, said inverse color look-up table for accepting as an address input RGB color information and providing as a data output index information for indexing a color look-up table, said method comprising the steps of: initializing an array of data elements, each of said data elements for storing said index information, each of said data elements corresponding to a color position in RGB color space; storing a first index value in said array, said first index value corresponding to an index for said color look-up table, said first index value stored in a first of said data elements, said first data element corresponding to a color represented by said first index value in said color look-up table; storing an address of said first data element in a queue means for later processing; for a second of said data elements, said second of said data elements logically next to said first data element in RGB color space; (a) determining whether said second data element has been assigned an index value; (b) If said second data element has not been assigned an index value, assigning said second data element said first index value and storing an address for said second data element in said queue means.
Claim 2
Independent Claim 217 words
A method for building an inverse color look-up table in a color graphics system, said inverse color look-up table for accepting as an address input RGB color information and providing as a data output index information for indexing a color look-up table, said method comprising the steps of: initializing an array of data elements, each of said data elements for storing said index information, each of said data elements corresponding to a color position in RGB color space; storing a first index value in said array, said first index value corresponding to an index for said color look-up table, said first index value stored in a first of said data elements, said first data element corresponding to a color represented by said first index value in said color look-up table; storing an address of said first data element in a queue means for later processing; for a second of said data elements, said second of said data elements logically next to said first data element in RGB color space; (a) determining whether said second data element has been assigned an index value; (b) If said second data element has not been assigned an index value, assigning said second data element said first index value and storing an address for said second data element in said queue means.
Claim 3
Dependent Claim 54 words
The method as recited by claim 1, further comprising repeating steps (a) and (b) for a third, fourth, fifth, sixth and seventh data element, said second, third, fourth, fifth, sixth and seventh data elements being logically left, right, above, below, in front of and behind said first data element in said RGB color space.
Claim 4
Dependent Claim 34 words
The method as recited by claim 2, wherein an index value for each color in said color look-up table is stored in said array and said queue prior to processing said second data element.
Claim 5
Dependent Claim 20 words
The method as recited by claim 3, wherein steps (a) and (b) are repeated for each address in said queue.

References Cited (Backward Citations)

US4368463A Cited
US4598282A Cited
US4799053A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1994-03-25 1994-09-24 1995-03-26 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1998-03-25 1998-09-24 1999-03-26 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2002-03-25 2002-09-24 2003-03-26 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag