z-logo
open-access-imgOpen Access
Improved approximation of spatial light distribution
Author(s) -
David Kaljun,
Tiovak,
Janez Žerovnik
Publication year - 2017
Publication title -
plos one
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.99
H-Index - 332
ISSN - 1932-6203
DOI - 10.1371/journal.pone.0176252
Subject(s) - focus (optics) , computer science , reflector (photography) , lens (geology) , projector , work (physics) , industrial engineering , mathematical optimization , light source , optics , artificial intelligence , mathematics , mechanical engineering , engineering , physics
The rapid worldwide evolution of LEDs as light sources has brought new challenges, which means that new methods are needed and new algorithms have to be developed. Since the majority of LED luminaries are of the multi-source type, established methods for the design of light engines cannot be used in the design of LED light engines. This is because in the latter case what is involved is not just the design of a good reflector or projector lens, but the design of several lenses which have to work together in order to achieve satisfactory results. Since lenses can also be bought off the shelf from several manufacturers, it should be possible to combine together different off the shelf lenses in order to design a good light engine. However, with so many different lenses to choose from, it is almost impossible to find an optimal combination by hand, which means that some optimization algorithms need to be applied. In order for them to work properly, it is first necessary to describe the input data (i.e. spatial light distribution) in a functional form using as few as possible parameters. In this paper the focus is on the approximation of the input data, and the implementation of the well-known mathematical procedure for the separation of linear and nonlinear parameters, which can provide a substantial increase in performance.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here