Method of light spectrum replication
09635728 ยท 2017-04-25
Assignee
Inventors
- Dmitri Simonian (Sunnyvale, CA, US)
- Steven Paolini (Saratoga, CA, US)
- Richard Jui-chi Koo (Belmont, CA, US)
Cpc classification
H05B47/11
ELECTRICITY
Y02B20/40
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
International classification
Abstract
A method of utilizing a light replication luminaire to match the spectral characteristics of light that is output from the luminaire to the spectral characteristics of a target light spectrum is provided. In one example, the method permits the user to assign a weight to one or more characteristics of the target light spectrum to be replicated. A best approximation of the target light spectrum is then determined, taking into account the weight assigned to each characteristic. In another example, the target light spectrum is provided to the luminaire by the user through the specification of various characteristics of the target light spectrum.
Claims
1. A method of replication of light by a luminaire, the luminaire having a set of primary light sources, the method comprising: providing at least one characteristic of a target light spectrum to the luminaire; defining a light replication objective, the light replication objective being selected from the group consisting of accurate replication of a target spectral shape, accurate replication of a color point, maximization of a color rendering characteristic of the approximated light, maximized energy efficiency, maximized number of included primary light sources, and a combination of two or more of the aforesaid replication objectives; and setting driving conditions for each of the primary light sources.
2. The method according to claim 1, wherein the target light spectrum is specified by specifying three variable parameters, the three variable parameters spanning a range of three dimensional color space output by the luminaire.
3. The method according to claim 2, wherein the three variable parameters are selected from the group consisting of: a color point in a 2-dimensional color space and an intensity characteristic of output light; a correlated color temperature and the distance from a black body curve; and a color point in a 3-dimensional color space.
4. The method according to claim 1, wherein the at least one characteristic of the target light spectrum is a color point to be replicated by the luminaire.
5. The method according to claim 4, wherein the color point is specified by providing three variable parameters, the three variable parameters defining a point within a three dimensional color space.
6. The method according to claim 1, further comprising; forming a luminaire spectrum from the target light characteristic; and selecting light sources to include within the luminaire spectrum based on the proximity of the color point to a central region of the color space or the proximity of the color point to an edge of the color space.
7. A method of replication of light by a luminaire, the luminaire having a set of primary light sources, the method comprising: providing at least one characteristic of a target light spectrum to the luminaire by specifying three variable parameters, the three variable parameters spanning a range of three dimensional color space output by the luminaire; defining a light replication objective by selecting the light replication objective from the group consisting of maximization of a color rendering characteristic of the approximated light, maximization energy efficiency, maximization number of included primary light sources, and a combination of two or more of the aforesaid replication objectives; setting driving conditions for each of the primary light sources.
8. The method according to claim 7, wherein the three variable parameters are selected from the group consisting of: a color point in a 2-dimensional color space and an intensity characteristic of output light; a correlated color temperature and the distance from a black body curve; and a color point in a 3-dimensional color space.
9. The method according to claim 7, wherein the at least one characteristic of the target light spectrum is a color point to be replicated by the luminaire.
10. The method according to claim 9, wherein the color point is specified by providing three variable parameters, the three variable parameters defining a point within a three dimensional color space.
11. The method according to claim 7, further comprising; forming a luminaire spectrum from the target light characteristic; and selecting light sources to include within the luminaire spectrum based on the proximity of the color point to a central region of the color space or the proximity of the color point to an edge of the color space.
12. A method of replication of light by a luminaire, the luminaire having a set of primary light sources, the method comprising: providing at least one characteristic of a target light spectrum to the luminaire by providing data selected from the group consisting of: three variable parameters, the three variable parameters spanning a range of three dimensional color space output by the luminaire; and a color point to be replicated by the luminaire; defining a light replication objective; setting driving conditions for each of the primary light sources.
13. The method according to claim 12, wherein the three variable parameters are selected from the group consisting of: a color point in a 2-dimensional color space and an intensity characteristic of output light; a correlated color temperature and the distance from a black body curve; and a color point in a 3-dimensional color space.
14. The method according to claim 12, wherein the color point is specified by providing three variable parameters, the three variable parameters defining a point within a three dimensional color space.
15. The method according to claim 12, further comprising; forming a luminaire spectrum from the target light characteristic; and selecting light sources to include within the luminaire spectrum based on the proximity of the color point to a central region of the color space or the proximity of the color point to an edge of the color space.
Description
BRIEF DESCRIPTION OF THE DRAWINGS
(1)
(2)
(3)
(4)
(5)
(6)
(7) Like reference characters denote like elements throughout the drawings.
DETAILED DESCRIPTION
(8) Referring to the drawings, there is shown a method of optimizing the light output of a light replicating luminaire. An example of such a light replicating luminaire, invented by Steven Paolini, is disclosed in US 2009/0323321, which was published on Dec. 31, 2009, the disclosure of which is expressly incorporated by reference.
(9) In order to best understand the method of optimizing the light output of the light replicating luminaire, some understanding of the light replicating luminaire itself is helpful. An example of such a luminaire 10 is illustrated in
(10) The fixture controller 14 controls a programmable LED driver 26. The LED driver 26 individually controls the timing and intensity with which each of the LEDs 12-1 to 12-M (or each individual wavelength channel) are illuminated. The intensity of each of the light sources 12-1 to 12-M may be controlled either by controlling the amplitude of the drive current, and/or through pulse width modulation. During output of an approximation of the target light spectrum, the fixture controller 14 may utilize the temperature sensor 28 (or a plurality of temperature sensors which may in some examples measure the base temperature of each light source 12) and light sensor 30, in conjunction with the calibration data stored in storage section 24, to adjust the output of the light sources 12-1 to 12-M.
(11) Referring to
(12) Referring to
(13) Referring to
(14) The general steps of optimizing an approximation of a target light spectrum are illustrated in
(15) The user may specify the weight to assign to one or more characteristics of the target light spectrum to be reproduced at step 58. Examples of characteristics that may be optimized include the target spectral shape, the color point, the luminous flux, color rendering quality measured by CRI or CQS (color quality scale) and/or the energy efficiency of the luminaire. Energy efficiency can be maximized by minimizing the number of channels driven within the luminaire, and/or by utilizing the channels having the most efficient emitters. Some applications may require that the target spectral shape be reproduced with the highest level of accuracy, without regard to color point or luminous flux. Other applications may place a higher priority on color point and/or luminous flux. Each characteristic that may be optimized is assigned a weight by the user. Alternatively, the weights may be pre-programmed into the luminaire. These weights are taken into account by the optimization algorithm which is described below.
(16) The best approximation of the target light spectrum is determined at step 60 in
(17)
(18) Minimizing the difference between the color points of the target light spectra and the approximation may also be desired. This criterion is best understood with reference to the chromaticity diagram of
X=.sub.0.sup.I()x()d()
Y=.sub.0.sup.I()y()d()
Z=.sub.0.sup.I()z()d()
(19) If a user is defining the target light spectrum in terms of x, y, Y, then the tristimulus values X and Z are calculated based on the color point values as follows:
(20)
Other methods may be utilized to specify the target light spectrum, depending on the color space selected.
(21) With the tristimulus values calculated, minimizing the difference C.sub.2(k) between the color points of the target spectrum and the color points of the approximation can be accomplished by minimizing the following expression.
C.sub.2(k)=(X.sub.aX.sub.t).sup.2+(Y.sub.aY.sub.t).sup.2+(Z.sub.aZ.sub.t).sup.2
(22) As another alternative, it may be desirable to minimize the difference in the radiant fluxes C.sub.3(k) between the target spectrum P.sub.t and the approximation P.sub.a. The function to be minimized is therefore:
(23)
(24) Therefore, when the spectrum of the approximation is determined by taking into account the weights .sub.1, .sub.2, and .sub.3 for the importance of matching the spectral shape, color points, and luminous flux, respectively, the function C(k) to be minimized is therefore:
C(k)=.sub.1C.sub.1(k)+.sub.2C.sub.2(k)+.sub.3C.sub.3(k)
(25) From this function, it becomes obvious that assigning a higher weight to a given criterion increases the effect of that criterion on the approximation spectrum. In some examples, the weights .sub.1, .sub.2, and .sub.3 may be assigned any value between a minimum of 0 (no effect whatsoever on the approximation spectrum) and a maximum of 1 (maximum effect on the approximation spectrum). Cost functions may be normalized during the minimization process; for example, C.sub.1(k) may be divided by S.sub.t before calculations begin. Similarly, C.sub.2(k) may be divided by P.sub.t.sup.2.
(26) Having specified the cost function C(k), we now look for values of k (amplitude) which result in minimum values of C(k). Values of k are constrained between zero and the maximum amplitude with which a given wavelength channel may be driven. Various constrained minimization methods are known in the prior art, for example, gradient descent or other iterative minimization procedures. One example of a minimization method utilizing coordinate-wise descent follows.
(27) To minimize C(k), we look for an extremum of C(k) by taking its partial derivative and determining at which values of k this function equals zero. If we expand C(k) to include the components of C.sub.1(k), C.sub.2(k), and C.sub.3(k) from above, we have:
C(k)=.sub.1S.sub.aS.sub.t.sup.2+.sub.2[(X.sub.aX.sub.t).sup.2+(Y.sub.aY.sub.t).sup.2+(Z.sub.aZ.sub.t).sup.2]+.sub.3(P.sub.aP.sub.t).sup.2
(28) Next, we take the partial derivative of C(k):
(29)
(30) Looking at each of the three components of C(k) individually, the partial derivatives of C.sub.1(k), C.sub.2(k), and C.sub.3(k) are as follows.
(31)
(32) For compactness of the expressions below, the matrices F, C, and R, of size MM, will be introduced, along with vectors f, c, and r, of size M1. Each element within the matrices and vectors is calculated as follows:
f.sub.j=s.sub.jS.sub.t
F.sub.jm=s.sub.js.sub.m
c.sub.j=X.sub.jX.sub.t+Y.sub.jY.sub.t+Z.sub.jZ.sub.t
C.sub.jm=X.sub.jX.sub.m+Y.sub.jY.sub.m+Z.sub.jZ.sub.m
r.sub.j=P.sub.jP.sub.t
R.sub.jm=P.sub.jP.sub.m
(33) Making appropriate substitutions, the expression we will utilize to look for extrema of C(k) is:
(34)
(35) Expressed in matrix form:
k(.sub.1F+.sub.2C+.sub.3R)=.sub.1f+.sub.2c+.sub.3r
(36) To solve this equation, a procedure known as coordinate wise descent will be utilized. This procedure will be described with reference to
(37) The coordinate-wise descent process begins with an initial guess of the spectral shape of the closest approximation of the target spectrum given a preselected value of k, at step 68. For example, the value of k may be selected to be about one half the total amplitude available within each wavelength channel within the luminaire. In the example of a luminaire with a maximum amplitude of 64 for each channel, an example starting point would be a value of k equal to about 32. Given this initial guess, the matrices F, C, and R, as well as the vectors f, c, and r, are recalculated at step 70, because the spectral shape of the light sources is dependent on the amplitude k. Following this calculation, the initial value of the amplitude vector k is calculated at step 72 as follows.
k.sub.ini=(.sub.1f+.sub.2c+.sub.3r).Math.(.sub.1F+.sub.2C+.sub.3R).sup.1
(38) To evaluate the progress of the coordinate-wise descent, an initial value of the cost function C(k) is calculated at step 74. To control the following process, the number of iterations L and the specific element j of the amplitude vector k being evaluated are initialized at steps 76 and 78, respectively.
(39) Next, fix all values of the vector k to their initial value, but treat k.sub.0 as a variable (step 80), and solve the following equation to determine the new value of k.sub.0 at step 82.
(40)
(41) Once this is completed, k.sub.0 is fixed at its newly determined value, and the process is repeated, treating k.sub.1 as a variable, and solving for k.sub.1 (steps 84 and 86). This process is repeated for each value of k.sub.j, through k.sub.M-1. For the purpose of this description, the process of sequentially solving for all values within the vector k, from k.sub.0 to k.sub.M-1, is considered to be one iteration.
(42) It is possible that a mathematical solution to this equation will result in values within the vector of k which either exceed the maximum amplitude for each channel within the luminaire, or which are negative. As a practical matter, solutions capable of being implemented on the luminaire are constrained between zero and the maximum amplitude per channel (k.sub.max). Therefore, any values of k that fall outside of this range are constrained to either zero or k.sub.max (steps 88, 90, and 92). If the value of any element k.sub.j is clamped at zero or k.sub.max, and this value does not change in subsequent iterations, it may be possible to assign the clamped value of zero or k.sub.max to that element k.sub.j for all subsequent iterations, ignoring the clamped elements k.sub.j in subsequent calculations.
(43) Once an iteration is completed, the value of the function C(k) is calculated at step 94. Recall that a minimized value of C(k) indicates maximized accuracy with which the approximation duplicates the target spectrum. The current value of C(k) is compared to the previous value to determine the extent to which the iteration improved the correlation between the target spectrum and the approximation at step 96.
(44) Given unlimited computational time, it would be preferable to update the matrices F, C, and R after each iteration. However, accurately reproducing a dynamic lighting event, with the target spectrum changing over time, makes a faster computational time preferable. Therefore, the matrices F, C, and R are updated after a predetermined number of iterations, with one example being to update the matrices F, C, and R after about 10 iterations. This is illustrated at steps 98, 100, and 102 in the flowchart.
(45) At another predetermined number of iterations, which may in some examples be the same number of iterations as the number between each update of the matrices F, C, and R, an attempt is made to speed up the calculation by assuming that those coefficients which at the current iteration are found at the boundary (either zero or k.sub.max) will stay at the boundary in subsequent iterations, and no additional components will move to the boundary at subsequent iterations. With this assumption made, the contributions of those values of k.sub.j which have been clamped at zero or k.sub.max are removed from the target spectrum at step 104, resulting in a smaller amplitude vector k. Next, matrices F, C, and R, as well as vectors f, c, and r are constructed from the remaining values of k at step 106. Using these smaller matrices, the next values of k.sub.j are calculated by solving the unconstrained matrix equation shown below at step 108.
k.sub.next=(.sub.1f+.sub.2c+.sub.3r).Math.(.sub.1F+.sub.2C+.sub.3R).sup.1
We refer to this process as subspace minimization.
(46) As before, k.sub.next must only include values between zero and k.sub.max in order to be meaningful, so k.sub.next is clamped to this range at step 110. The variable components of k are replaced by the components of k at step 112, and the value of C(k) is calculated at step 114. If the new value of C(k) is lower than the previous value at step 116, then the vector k with its variable components replaced by the components of k is accepted as the next amplitude vector at step 118. Otherwise, the values of k are rejected at step 120. In either case, we continue to try to minimize C(k), either by continuing iterative minimization, or by finding a next k using subspace minimization a plurality of times.
(47) Coordinate wise descent continues until a predetermined criterion for stopping the procedure is reached. This criterion may be a value of C(k) below a predetermined maximum acceptable C(k). Alternatively, the predetermined level of accuracy may be defined in terms of an absolute or relative (C(k).sub.prevC(k)>C(k).sub.prev0.001) difference between the current value of C(k) in the previous value of C(k) falling below a predetermined value, indicating that diminished improvements in accuracy will be achieved by future iterations. This is the example shown in step 96. In some examples, a change in the value of C(k) below a specified value, for example, of about 0.001 or less, may be specified to indicate that subsequent iterations will not result in significantly greater accuracy. Some examples may place a limit on the number of iterations to be performed, with an example limit being 2000 iterations, and with a level of accuracy achievable with this number of iterations being acceptable. As another alternative, a relative change in the value of the calculated amplitudes k below a certain level may indicate that further iterations will not significantly improve accuracy. As another example, a specific value of an individual cost function component, such as C.sub.2(k), may be taken as a stopping criterion.
(48) Referring back to
(49) In some instances, the target light spectrum may be one that was previously recorded and encoded for playback. In other instances, it is possible for a user to specify the target light spectrum. In some examples, the target light is specified by the color point on a chromaticity diagram corresponding to the desired color (which in many instances will be a variation of white light). The color point is specified by its chromaticity coordinates x and y, as well as its intensity Y. Alternatively, the color point may be specified as a correlated color temperature and the distance from a black body curve in a 2-dimensional representation of the color space. As another alternative, a color point in a 3-dimensional color space may be specified. Although a color point specified in this manner is sufficient to specify the location of the target light spectrum within the chromaticity diagram, many different combinations of wavelengths can be used to achieve the selected color point. The specific combination of wavelengths present may be as determinative of whether the user's purpose is achieved as the appearance of the overall color. To maximize the likelihood of achieving the user's purpose while also simplifying the process of inputting the desired target light spectrum, some simplifying assumptions may be made. For many applications, natural sunlight, which contains a mixture of a wide variety of wavelengths, may be regarded as the gold standard for light. Therefore, in many applications, including as many wavelengths as possible may be desired.
(50) If a user selects a color point relatively close to a central region of the chromaticity diagram 32, it may safely be assumed that the user would like the approximation of the target light spectrum to include as many wavelengths of light as possible. In some applications, it may be assumed that if a target color point is relatively close to a central region of the chromaticity diagram 32, color rendering quality of the target light measured by, for example, CRI or CQS, should be maximized. Conversely, if the user selects a color point close to the edge of the chromaticity diagram 16, it may be assumed that the user would like wavelengths close to the selected color point to be heavily included, with other wavelengths being less desired. Therefore, the extent to which the desired color point is achieved utilizing a mix of most or all of available wavelengths, or with a smaller number of wavelengths from channels associated with points on the chromaticity diagram close to the selected color point, may be determined in proportion to their relative distance of the selected color point to the center, or to the edge, of the chromaticity diagram 16.
(51) The basic procedure is illustrated in
(52) The optimization method described herein may in some examples of the luminaire 10 be performed within the fixture controller 14. For other examples of the luminaire 10, at least a portion of the optimization method may be performed on a separate computer system, with the resulting light source driving conditions being communicated to the fixture controller 14.
(53) A method of optimizing the various components of an approximation of a target light spectrum that is output by a light replicating luminaire is therefore provided. The user of the luminaire may assign weights to various criteria, and the approximation is optimized based on the weights assigned to these criteria. Furthermore, a method of permitting a user to enter a target light spectrum by specifying a three-dimensional color point on a chromaticity diagram is provided.
(54) A variety of modifications to the above-described embodiments will be apparent to those skilled in the art from this disclosure. Thus, the invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The particular embodiments disclosed are meant to be illustrative only and not limiting as to the scope of the invention. The appended claims, rather than to the foregoing specification, should be referenced to indicate the scope of the invention.