Patent US5869782A successfully refreshed from Google Patents.
Patent FR1587253A successfully refreshed from Google Patents.
Patent US6848819B1 successfully refreshed from Google Patents.
Patent US6758574B1 successfully refreshed from Google Patents.
US6758574B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Conversions between standard color spaces
Assignee: Canon Inc
•
Filing: 1999-10-29
•
Granted: 2004-07-06
•
Expires: 2019-10-29
Abstract
Abstract Disclose are various methods for optimising conversions between color spaces (FIG. 1 ). A set of atomic mathematical ((a)-(f)) functions are identified which, when performed in sequence, implement the conversions. Specific (first) sequences of the mathematical functions are then identified which when preformed convert colors between particular color spaces. A set of computational operations ((g)-(i)) are then established for evaluation using a computing device, the operations, when performed in (second) sequences cause the color conversions. A particular one of the first sequences required for converting from a first color space to a second color space is then identified and transformed into a (third) sequence of computational operations chosen from the computational operations ((g)-(i)) having substantially the same transformation effect as the particular sequence. Also disclosed is a method of sequentially combining a first color conversion list (FIG. 2 A) with a second color conversion list (FIG. 2 B) to form a single output conversion list (FIG. 2 C) having a corresponding conversion function, each conversion list traversing a chain of color spaces comprising at least a corresponding source color space and a corresponding terminal color space. Also disclosed is a method of determining a processing gamut for intermediate color spaces ( 304, 306 ) traversed in a color conversion chain ( 300 ) from a source color space ( 302 ) to a target color space ( 308 ).
Inventors
- 👤 Peter Malcolm Roberts
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 14:18
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/46; H04N1/56; H04N1/60; H04N1/6011; H04N1/64; H04N1/646
Claims Analysis
Total Claims: 63
Claim 1
Independent Claim
111 words
A method of optimising conversions between colour spaces, said method comprising the steps of: (i) identifying a set of mathematical functions which, when performed in sequence, implement said conversions between colour spaces; (ii) identifying a set of computational operations for evaluation using a computing device, said operations, when performed in (first) sequence cause said colour conversions; (iii) identifying at least one particular sequence of said mathematical functions which when performed converts colours between a first colour space and a second colour space; (iv) transforming said particular sequence into a (second) sequence of computational operations chosen from said set of computational operations having substantially the same transformation effect as said particular sequence.
Claim 2
Independent Claim
111 words
A method of optimising conversions between colour spaces, said method comprising the steps of: (i) identifying a set of mathematical functions which, when performed in sequence, implement said conversions between colour spaces; (ii) identifying a set of computational operations for evaluation using a computing device, said operations, when performed in (first) sequence cause said colour conversions; (iii) identifying at least one particular sequence of said mathematical functions which when performed converts colours between a first colour space and a second colour space; (iv) transforming said particular sequence into a (second) sequence of computational operations chosen from said set of computational operations having substantially the same transformation effect as said particular sequence.
Claim 3
Dependent Claim
24 words
A method according to claim 1 wherein steps (iii) and (iv) are performed at a time at which a colour conversion is requested (run-time).
Claim 4
Dependent Claim
71 words
A method according to claim 2 wherein said computational operations each have a corresponding (first) computational accuracy and an output of each said mathematical function has a corresponding (second) computational accuracy, and when said corresponding second computational accuracy is better than said corresponding first computational accuracy, said method comprises the further step of modifying said second sequence of operations to minimise an effect of the limited accuracy of the computational operation.
Claim 5
Dependent Claim
23 words
A method according to claim 3 wherein said modifying comprises combining a plurality of said computational operations into a single said computational operation.
Claim 6
Dependent Claim
36 words
A method according to claim 3 wherein said modifying utilises a state table related to said mathematical functions and a set of states each representing a particular relationship between the corresponding first and second computational accuracies.
Claim 7
Dependent Claim
31 words
A method according to claim 2 wherein said set of operations comprises functions selected from the group consisting of: a matrix multiplication; a one-dimensional look-up table; and a multi-dimensional look-up table.
Claim 8
Dependent Claim
48 words
A method according to claim 2 wherein said set of mathematical functions comprises functions selected from the group consisting of: a single variate function; a single variate function expressed as a look-up table; a multi-variate function; a multi-variate function expressed as a look-up table; and a matrix multiplication.
Claim 9
Dependent Claim
18 words
A method according to claim 2 wherein at least part of step (ii) is performed at said time.
Claim 10
Dependent Claim
16 words
A method according to claim 1 wherein said second colour space is said first colour space.
Claim 11
Independent Claim
116 words
A method of optimising a conversion between a first colour space and a second colour space, said conversion traversing a chain of colour spaces including said first and second colour spaces and at least one intermediate colour space between said first and second colour spaces, said method comprising the steps of: (i) identifying a first set of mathematical functions each defining a conversion between adjacent colour spaces within said chain; (ii) reducing said first set of mathematical functions to define a second set of computational functions, for converting between said first and second colour spaces; and (iii) performing a conversion from said first colour space to said second colour space using said second set of functions.
Claim 12
Independent Claim
116 words
A method of optimising a conversion between a first colour space and a second colour space, said conversion traversing a chain of colour spaces including said first and second colour spaces and at least one intermediate colour space between said first and second colour spaces, said method comprising the steps of: (i) identifying a first set of mathematical functions each defining a conversion between adjacent colour spaces within said chain; (ii) reducing said first set of mathematical functions to define a second set of computational functions, for converting between said first and second colour spaces; and (iii) performing a conversion from said first colour space to said second colour space using said second set of functions.
Claim 13
Dependent Claim
22 words
A method according to claim 10 wherein step (ii) is performed at a time at which a colour conversion is requested (run-time).
Claim 14
Dependent Claim
60 words
A method according claim 11 wherein said first set of mathematical functions is unbounded by computational accuracy, said method comprising the further step of establishing a level of computational accuracy for each conversion of step (i) between adjacent colour spaces in said chain, wherein said second set of computational functions are bounded by a corresponding established level of computational accuracy.
Claim 15
Dependent Claim
32 words
A method according to claim 12 wherein said second set of functions comprises functions selected from the group consisting of: a matrix multiplication; a one-dimensional look-up table; and a multi-variate look-up table.
Claim 16
Dependent Claim
37 words
A method according to claim 1 wherein step (iii) comprises sequentially combining at least two sequences of said mathematical functions to form a single sequence which has the same effect of said at least two when executed.
Claim 17
Dependent Claim
96 words
A method according to claim 14 , wherein said sequentially combining comprises the sub-steps of: (ii-a) comparing a last function of a first said sequence and a first function of a second said sequence; (ii-b) removing both said functions from said sequences if said functions are the mathematical inverse of one another; (ii-c) repeating steps (ii-a) and (ii-b) until the two said functions are not the mathematical inverse of one another; and (ii-d) combining the two sequences at a current last function of the first sequence and at a current first function of the second sequence.
Claim 18
Dependent Claim
130 words
A method according to claim 1 wherein step (iv) comprises determining a processing gamut for intermediate colour spaces traversed in a colour conversion chain from said first colour space to said second colour space, said determining comprising the substeps of: (iv-a) forward processing said chain to determine, based from a gamut of said first colour space, an input bounding box of values for each remaining colour space in said chain; (iv-b) reverse processing said chain to determine, based from a gamut of said second output colour space, an output bounding box for each preceding colour space in said chain; (iv-c) for each colour space in said chain, determining an intersection between the corresponding input and output bounding boxes to establish a processing gamut for said colour space in said conversion.
Claim 19
Dependent Claim
171 words
A method according to claim 16 of wherein steps (iv-a), (iv-b) and (iv-c) comprise: forming a first list of critical colours in said first colour space; for each intermediate colour space in said chain, forming a corresponding first list of said critical colours in said intermediate colour space; for each said intermediate colour space in said chain, forming a corresponding first bounding box enclosing the corresponding first list of critical colours; forming a second list of critical colours for said second colour space; for each said intermediate colour space in said chain, transforming said second list of critical colours into a corresponding second list of critical colours for said corresponding intermediate colour space; for each said intermediate colour space, forming a second bounding box enclosing the corresponding said second list of critical colours; and for each said intermediate colour space in said chain, reducing said corresponding first bounding box to form an intersection with said corresponding second bounding box, said intersection defining said processing gamut for the corresponding intermediate colour space.
Claim 20
Dependent Claim
135 words
A computer readable medium, having a program recorded thereon, where the program is configured to make a computer execute a procedure for optimising conversions between colour spaces, said program comprising: (i) code for identifying a set of mathematical functions which, when performed in sequence, implement said conversions between colour spaces; (ii) code for identifying a set of computational operations for evaluation using a computing device, said operations, when performed in (first) sequence cause said colour conversions; (iii) code for identifying at least one particular sequence of said mathematical functions which when performed converts colours between a first colour space and a second colour space; (iv) code for transforming said particular sequence into a (second) sequence of computational operations chosen from said set of computational operations having substantially the same transformation effect as said particular sequence.
Claim 21
Dependent Claim
135 words
A computer readable medium, having a program recorded thereon, where the program is configured to make a computer execute a procedure for optimising conversions between colour spaces, said program comprising: (i) code for identifying a set of mathematical functions which, when performed in sequence, implement said conversions between colour spaces; (ii) code for identifying a set of computational operations for evaluation using a computing device, said operations, when performed in (first) sequence cause said colour conversions; (iii) code for identifying at least one particular sequence of said mathematical functions which when performed converts colours between a first colour space and a second colour space; (iv) code for transforming said particular sequence into a (second) sequence of computational operations chosen from said set of computational operations having substantially the same transformation effect as said particular sequence.
Claim 22
Dependent Claim
73 words
A computer readable medium according to claim 18 wherein said computational operations each have a corresponding (first) computational accuracy and an output of each said mathematical function has a corresponding (second) computational accuracy, and when said corresponding second computational accuracy is better than said corresponding first computational accuracy, said method comprises the further step of modifying said second sequence of operations to minimise an effect of the limited accuracy of the computational operation.
Claim 23
Dependent Claim
25 words
A computer readable medium according to claim 19 wherein said modifying comprises combining a plurality of said computational operations into a single said computational operation.
Claim 24
Dependent Claim
38 words
A computer readable medium according to claim 19 wherein said modifying utilises a state table related to said mathematical functions and a set of states each representing a particular relationship between the corresponding first and second computational accuracies.
Claim 25
Dependent Claim
33 words
A computer readable medium according to claim 18 wherein said set of operations comprises functions selected from the group consisting of: a matrix multiplication; a one-dimensional look-up table; and a multi-dimensional look-up table.
Claim 26
Dependent Claim
50 words
A computer readable medium according to claim 18 wherein said set of mathematical functions comprises functions selected from the group consisting of: a single variate function; a single variate function expressed as a look-up table; a multi-variate function; a multi-variate function expressed as a look-up table; and a matrix multiplication.
Claim 27
Dependent Claim
26 words
A computer readable medium according to claim 18 wherein code (iii) and (iv) are performed at a time at which a colour conversion is requested (run-time).
Claim 28
Dependent Claim
20 words
A computer readable medium according to claim 24 wherein at least part of code (ii) is performed at said time.
Claim 29
Dependent Claim
18 words
A computer readable medium according to claim 18 wherein said second colour space is said first colour space.
Claim 30
Dependent Claim
138 words
A computer readable medium, having a program recorded thereon, where the program is configured to make a computer execute a procedure for optimising a conversion between a first colour space and a second colour space, said conversion traversing a chain of colour spaces including said first and second colour spaces and at least one intermediate colour space between said first and second colour spaces, said program comprising: (i) code for identifying a first set of mathematical functions each defining a conversion between adjacent colour spaces within said chain; (ii) code for reducing said first set of mathematical functions to define a second set of computational functions, for converting between said first and second colour spaces; and (iii) code for performing a conversion from said first colour space to said second colour space using said second set of functions.
Claim 31
Dependent Claim
138 words
A computer readable medium, having a program recorded thereon, where the program is configured to make a computer execute a procedure for optimising a conversion between a first colour space and a second colour space, said conversion traversing a chain of colour spaces including said first and second colour spaces and at least one intermediate colour space between said first and second colour spaces, said program comprising: (i) code for identifying a first set of mathematical functions each defining a conversion between adjacent colour spaces within said chain; (ii) code for reducing said first set of mathematical functions to define a second set of computational functions, for converting between said first and second colour spaces; and (iii) code for performing a conversion from said first colour space to said second colour space using said second set of functions.
Claim 32
Dependent Claim
62 words
A computer readable medium according claim 27 wherein said first set of mathematical function are unbounded by computational accuracy, said method comprising the further step of establishing a level of computational accuracy for each conversion of code (i) between adjacent colour spaces in said chain, wherein said second set of computational functions are bounded by a corresponding established level of computational accuracy.
Claim 33
Dependent Claim
34 words
A computer readable medium according to claim 28 wherein said second set of functions comprises functions selected from the group consisting of: a matrix multiplication; a one-dimensional look-up table; and a multi-variate look-up table.
Claim 34
Dependent Claim
41 words
A computer readable medium according to claim 18 wherein code (iii) comprises code for sequentially combining at least two sequences of said mathematical functions to form a single sequence which has the same effect of said at least two when executed.
Claim 35
Dependent Claim
97 words
A computer readable medium according to claim 30 , wherein said sequentially combining comprises code for: (ii-a) comparing a last function of a first said sequence and a first function of a second said sequence; (ii-b) removing both said functions from said sequences if said functions are the mathematical inverse of one another; (ii-c) repeating steps (ii-a) and (ii-b) until the two said functions are not the mathematical inverse of one another; and (ii-d) combining the two sequences at a current last function of the first sequence and at a current first function of the second sequence.
Claim 36
Dependent Claim
136 words
A computer readable medium according to claim 18 wherein said code (iv) comprises further code for determining a processing gamut for intermediate colour spaces traversed in a colour conversion chain from said first colour space to said second colour space, said further code comprising code for: (iv-a) forward processing said chain to determine, based from a gamut of said first colour space, an input bounding box of values for each remaining colour space in said chain; (iv-b) reverse processing said chain to determine, based from a gamut of said second output colour space, an output bounding box for each preceding colour space in said chain; (iv-c) for each colour space in said chain, determining an intersection between the corresponding input and output bounding boxes to establish a processing gamut for said colour space in said conversion.
Claim 37
Dependent Claim
176 words
A computer readable medium according to claim 32 of wherein further code (iv-a), (iv-b) and (iv-c) comprise code for: forming a first list of critical colours in said first colour space; for each intermediate colour space in said chain, forming a corresponding first list of said critical colours in said intermediate colour space; for each said intermediate colour space in said chain, forming a corresponding first bounding box enclosing the corresponding first list of critical colours; forming a second list of critical colours for said second colour space; for each said intermediate colour space in said chain, transforming said second list of critical colours into a corresponding second list of critical colours for said corresponding intermediate colour space; for each said intermediate colour space, forming a second bounding box enclosing the corresponding said second list of critical colours; and for each said intermediate colour space in said chain, reducing said corresponding first bounding box to form an intersection with said corresponding second bounding box, said intersection defining said processing gamut for the corresponding intermediate colour space.
Claim 38
Dependent Claim
128 words
Apparatus for optimising conversions between colour spaces, said apparatus comprising: first means for identifying a set of mathematical functions which, when performed in sequence, implement said conversions; second means for identifying (first) sequences of said mathematical functions which when preformed convert colours between said colour spaces; third means for identifying a set of computational operations for evaluation using a computing device, said operations, when performed in (second) sequences cause said colour conversions; fourth means for identifying a particular one of said first sequences required for converting from a first colour space to a second colour space; and fifth means for transforming said particular sequence into a (third) sequence of computational operations chosen from said set of computational operations having substantially the same transformation effect as said particular sequence.
Claim 39
Dependent Claim
128 words
Apparatus for optimising conversions between colour spaces, said apparatus comprising: first means for identifying a set of mathematical functions which, when performed in sequence, implement said conversions; second means for identifying (first) sequences of said mathematical functions which when preformed convert colours between said colour spaces; third means for identifying a set of computational operations for evaluation using a computing device, said operations, when performed in (second) sequences cause said colour conversions; fourth means for identifying a particular one of said first sequences required for converting from a first colour space to a second colour space; and fifth means for transforming said particular sequence into a (third) sequence of computational operations chosen from said set of computational operations having substantially the same transformation effect as said particular sequence.
Claim 40
Dependent Claim
70 words
Apparatus according to claim 34 wherein said computational operations each have a corresponding (first) computational accuracy and an output of each said mathematical function has a corresponding (second) computational accuracy, and when said corresponding second computational accuracy is better than said corresponding first computational accuracy, said method comprises the further step of modifying said second sequence of operations to minimise an effect of the limited accuracy of the computational operation.
Claim 41
Dependent Claim
22 words
Apparatus according to claim 35 wherein said modifying comprises combining a plurality of said computational operations into a single said computational operation.
Claim 42
Dependent Claim
35 words
Apparatus according to claim 35 wherein said modifying utilises a state table related to said mathematical functions and a set of states each representing a particular relationship between the corresponding first and second computational accuracies.
Claim 43
Dependent Claim
31 words
Apparatus according to claim 34 wherein said second set of operations comprises functions selected from the group consisting of: a matrix multiplication; a one-dimensional look-up table; and a multi-variate look-up table.
Claim 44
Dependent Claim
47 words
Apparatus according to claim 34 wherein said set of mathematical functions comprises functions selected from the group consisting of: a single variate function; a single variate function expressed as a look-up table; a multi-variate function; a multi-variate function expressed as a look-up table; and a matrix multiplication.
Claim 45
Independent Claim
128 words
A method of sequentially combining two sequences of colour conversion functions to form a single sequence for conversion between colour spaces, the single sequence having the same effect of said two sequences when executed, said method comprising the steps of: (a) comparing a last function of a first said sequence and a first function of a second said sequence; (b) removing both said functions from said sequences if said functions are an inverse of one another; (c) repeating steps (a) and (b) until the two said functions are not the inverse of one another; and (d) combining the two sequences at a current last function of the first sequence and at a current first function of the second sequence to obtain the single sequence of colour conversions functions.
Claim 46
Independent Claim
128 words
A method of sequentially combining two sequences of colour conversion functions to form a single sequence for conversion between colour spaces, the single sequence having the same effect of said two sequences when executed, said method comprising the steps of: (a) comparing a last function of a first said sequence and a first function of a second said sequence; (b) removing both said functions from said sequences if said functions are an inverse of one another; (c) repeating steps (a) and (b) until the two said functions are not the inverse of one another; and (d) combining the two sequences at a current last function of the first sequence and at a current first function of the second sequence to obtain the single sequence of colour conversions functions.
Claim 47
Dependent Claim
38 words
A method according to claim 40 wherein said two sequences of functions are drawn from a set of such sequences which define colour conversions from a base colour space to and from a set of required colour spaces.
Claim 48
Dependent Claim
17 words
A method according to claim 41 wherein said base colour space is the CIE XYZ colour space.
Claim 49
Dependent Claim
25 words
A method according to claim 40 wherein one of said colour spaces in at least two of said input sequencies comprises the XYZ colour space.
Claim 50
Dependent Claim
143 words
A method of combining a sequential plurality of colour conversion lists to form a single composite colour conversion list having a corresponding conversion function, each said conversion list traversing a chain of colour spaces comprising at least a corresponding source colour space and a corresponding terminal colour space, said method comprising the steps of: (i) identifying from said input lists an adjacent sequential pair of lists and designating the same as a first input list and a second input list respectively; (ii) performing the method of claim 40 on said designated first and second input lists to form a corresponding output list; (iii) substituting said output list into said sequence of said input lists in place of said first and second lists; and (iv) repeating steps (i) to (iii) until a single list remains and designating said single list as said composite list.
Claim 51
Dependent Claim
25 words
A method according to claim 44 wherein one of said colour spaces in at least two of said input lists comprises the XYZ colour space.
Claim 52
Dependent Claim
255 words
A computer readable medium, having a program recorded thereon, where the program is configured to make a computer execute a procedure for sequentially combining a first colour conversion list with a second colour conversion list to form a single output conversion list having a corresponding conversion function, each said conversion list traversing a chain of colour spaces comprising at least a corresponding source colour space and a corresponding terminal colour space, said program comprising: (a) code for comparing said terminal colour space of said first list with said source colour space of said second list; (b) code for terminating said combining where said terminal colour space of said first list does not correspond to said source colour space of said second list; (c) code for, where said terminal colour space of said first list corresponds to said source colour space of said second list: (ca) marking one of the compared said terminal or source colour spaces as an intermediate colour space and assigning in each said list a next adjacent colour space as the corresponding terminal colour space and source colour space respectively; (cb) comparing said assigned terminal colour space of said first list with said assigned source colour space of said second list; (cc) where said assigned colour spaces correspond, invoking a repeat of code (ca) on said assigned terminal and source colour spaces; and (cd) where said assigned colour spaces do not correspond, joining said lists between a current said intermediate colour space and said assigned colour space of the other said list.
Claim 53
Dependent Claim
255 words
A computer readable medium, having a program recorded thereon, where the program is configured to make a computer execute a procedure for sequentially combining a first colour conversion list with a second colour conversion list to form a single output conversion list having a corresponding conversion function, each said conversion list traversing a chain of colour spaces comprising at least a corresponding source colour space and a corresponding terminal colour space, said program comprising: (a) code for comparing said terminal colour space of said first list with said source colour space of said second list; (b) code for terminating said combining where said terminal colour space of said first list does not correspond to said source colour space of said second list; (c) code for, where said terminal colour space of said first list corresponds to said source colour space of said second list: (ca) marking one of the compared said terminal or source colour spaces as an intermediate colour space and assigning in each said list a next adjacent colour space as the corresponding terminal colour space and source colour space respectively; (cb) comparing said assigned terminal colour space of said first list with said assigned source colour space of said second list; (cc) where said assigned colour spaces correspond, invoking a repeat of code (ca) on said assigned terminal and source colour spaces; and (cd) where said assigned colour spaces do not correspond, joining said lists between a current said intermediate colour space and said assigned colour space of the other said list.
Claim 54
Dependent Claim
168 words
A computer readable medium, having a program recorded thereon, where the program is configured to make a computer execute a procedure for combining a sequential plurality of colour conversion lists to form a single composite colour conversion list having a corresponding conversion function, each said conversion list traversing a chain of colour spaces comprising at least a corresponding source colour space and a corresponding terminal colour space, said program comprising: (i) code for identifying from said input lists an adjacent sequential pair of lists and designating the same as a first input list and a second input list respectively; (ii) code for performing the method of claim 40 on said designated first and second input lists to form a corresponding output list; (iii) code for substituting said output list into said sequence of said input lists in place of said first and second lists; and (iv) code for repeatedly calling code (i) to (iii) until a single list remains and designating said single list as said composite list.
Claim 55
Dependent Claim
27 words
A computer readable medium according to claim 47 wherein one of said colour spaces in at least two of said input lists comprises the XYZ colour space.
Claim 56
Dependent Claim
149 words
A computer readable medium, having a program recorded thereon, where the program is configured to make a computer execute a procedure for sequentially combining two sequences of colour conversion functions to form a single sequence for conversion between colour spaces, the single sequence having the same effect of said two sequences when executed, said program comprising code for the steps of: (a) comparing a last function of a first said sequence and a first function of a second said sequence; (b) removing both said functions from said sequences if said functions are an inverse of one another; (c) repeating steps (a) and (b) until the two said functions are not an inverse of one another; and (d) combining the two sequences at a current last function of the first sequence and at a current first function of the second sequence to obtain the single sequence of colour conversion functions.
Claim 57
Dependent Claim
149 words
A computer readable medium, having a program recorded thereon, where the program is configured to make a computer execute a procedure for sequentially combining two sequences of colour conversion functions to form a single sequence for conversion between colour spaces, the single sequence having the same effect of said two sequences when executed, said program comprising code for the steps of: (a) comparing a last function of a first said sequence and a first function of a second said sequence; (b) removing both said functions from said sequences if said functions are an inverse of one another; (c) repeating steps (a) and (b) until the two said functions are not an inverse of one another; and (d) combining the two sequences at a current last function of the first sequence and at a current first function of the second sequence to obtain the single sequence of colour conversion functions.
Claim 58
Dependent Claim
40 words
A computer readable medium according to claim 49 wherein said two sequences of functions are drawn from a set of such sequences which define colour conversions from a base colour space to and from a set of required colour spaces.
Claim 59
Dependent Claim
19 words
A computer readable medium according to claim 50 wherein said base colour space is the CIE XYZ colour space.
Claim 60
Dependent Claim
236 words
Apparatus for sequentially combining a first colour conversion list with a second colour conversion list to form a single output conversion list having a corresponding conversion function, each said conversion list traversing a chain of colour spaces comprising at least a corresponding source colour space and a corresponding terminal colour space, said apparatus comprising the steps of: means for comparing said terminal colour space of said first list with said source colour space of said second list; means for determining where said terminal colour space of said first list does not correspond to said source colour space of said second list, and if so, terminating said combining; and where said terminal colour space of said first list corresponds to said source colour space of said second list, means for: (ca) marking one of the compared said terminal or source colour spaces as an intermediate colour space and assigning in each said list a next adjacent colour space as the corresponding terminal colour space and source colour space respectively; (cb) comparing said assigned terminal colour space of said first list with said assigned source colour space, of said second list; (cc) where said assigned colour spaces correspond, repeating (ca) on said assigned terminal and source colour spaces; and (cd) where said assigned colour spaces do not correspond, joining said lists between a current said intermediate colour space and said assigned colour space of the other said list.
Claim 61
Dependent Claim
236 words
Apparatus for sequentially combining a first colour conversion list with a second colour conversion list to form a single output conversion list having a corresponding conversion function, each said conversion list traversing a chain of colour spaces comprising at least a corresponding source colour space and a corresponding terminal colour space, said apparatus comprising the steps of: means for comparing said terminal colour space of said first list with said source colour space of said second list; means for determining where said terminal colour space of said first list does not correspond to said source colour space of said second list, and if so, terminating said combining; and where said terminal colour space of said first list corresponds to said source colour space of said second list, means for: (ca) marking one of the compared said terminal or source colour spaces as an intermediate colour space and assigning in each said list a next adjacent colour space as the corresponding terminal colour space and source colour space respectively; (cb) comparing said assigned terminal colour space of said first list with said assigned source colour space, of said second list; (cc) where said assigned colour spaces correspond, repeating (ca) on said assigned terminal and source colour spaces; and (cd) where said assigned colour spaces do not correspond, joining said lists between a current said intermediate colour space and said assigned colour space of the other said list.
Claim 62
Dependent Claim
153 words
Apparatus for combining a sequential plurality of colour conversion lists to form a single composite colour conversion list having a corresponding conversion function, each said conversion list traversing a chain of colour spaces comprising at least a corresponding source colour space and a corresponding terminal colour space, said apparatus comprising the steps o£ first means for identifying from said input lists an adjacent sequential pair of lists and designating the same as a first input list and a second input list respectively; second means for performing the method of claim 40 on said designated first and second input lists to form a corresponding output list; third means for substituting said output list into said sequence of said input lists in place of said first and second lists; and fourth means for repeatedly invoking said first second and third means until a single list remains and designating said single list as said composite list.
Claim 63
Dependent Claim
24 words
Apparatus according to claim 53 wherein one of said colour spaces in at least two of said input lists comprises the XYZ colour space.
References Cited (Backward Citations)
US5432906A
Cited
US5668890A
Cited
US5699489A
Cited
US5828470A
Cited
US6456293B1
Cited
US6546132B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2007-07-06 | 2008-01-05 | 2008-07-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2011-07-06 | 2012-01-05 | 2012-07-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2015-07-06 | 2016-01-05 | 2016-07-06 | $7700.00 | Window Closed / Lapsed |