A Comparison of Evolutionary Computing Techniques Used to Model Bi-Directional Reflectance Distribution Functions. Banks, E. R., Nunez, E., Agarwal, P., McBride, M., Liedel, R., & Owens, C. In Late breaking paper at Genetic and Evolutionary Computation Conference (GECCO'2006), Seattle, WA, USA, 8-12 July, 2006.
A Comparison of Evolutionary Computing Techniques Used to Model Bi-Directional Reflectance Distribution Functions [pdf]Paper  abstract   bibtex   
Bi-Directional Reflectance Distribution Functions are used in many fields including computer animation modelling, military defence (radar, lidar, etc.), and others. This paper explores a variety of approaches to modelling BRDFs using different evolutionary computing (EC) techniques. We concentrate on genetic programming (GP) and in hybrid GP approaches, obtaining very close correspondence between models and data. The problem of obtaining parameters that make particular BRDF models fit to laboratory-measured reflectance data is a classic symbolic regression problem. The goal of this approach is to discover the equations that model laboratory-measured data according to several criteria of fitness. These criteria involve closeness of fit, simplicity or complexity of the model (parsimony), form of the result, and speed of discovery. As expected, free form, unconstrained GP gave the best results in terms of minimising measurement errors. However, it also yielded the most complex model forms. Certain constrained approaches proved to be far superior in terms of speed of discovery. Furthermore, application of mild parsimony pressure resulted in not only simpler expressions, but also improved results by yielding small differences between the models and the corresponding laboratory measurements.

Downloads: 0