We study here the feasibility of a spectral daylight recovering algorithm using a linear model that takes advantage of the strong correlation among daylight curves. To test the algorithm we use the daylight eigenvectors obtained by a principal-value decomposition over 2600 daylight spectra recorded over a period of two years. A binary search, performed here, found the optimal spectral positions of a set of few narrow-band filters. We analyze, over the set of 2600 daylight curves, the algorithm accuracy when using three to six narrow filters, obtaining that such an daylight algorithm is not sufficiently accurate in comparison with similar linear models that recover objects spectral reflectances proposed in artificial-vision.
|