In computer graphics, a Bidirectional Reflection Distribution Function (BRDF) is one of the classic models used describe the appearance property of object surface in computer graphics [PH04]. These functions take in two parameters, θi and θo, describing the angle of incoming and outgoing light at the incident point on the material. The result of the function is the fraction of light that is reflected along the specified angles. In general, it is helpful to think of a BRDF as a vector in a high-dimensional space.
In the real world, the physical processes and aging effects that apply to an object vary between different materials, and often have non-linear properties. Thus, linearly blending two BRDFs may generate unnatural results. Physic-based simulations can generate plausible results, but are computationally intensive and require knowledge of underlying physical and biological principles [WTL+06].
Nonlinear dimensionality reduction techniques provide tools to discover underlying structure of the given data without knowing the function itself, making it possible to approximate a nonlinear appearance manifold from known spatially- and temporally-varying BRDF data.
Wang et al. [WTL+06] made the observation that the BRDF data is largely self-similar across a material. They conjectured that the BRDF data of a particular material will cluster in the high-dimensional space of all possible BRDFs, where all the BRDF vectors lie on an appearance manifold. They implemented a variant of Isomap [BST+02] to discover an appearence manifold for a material’s BRDF data.
Our goals for this project are the following:
We plan to meet the first two items by the milestone date (2010 May 11).
If time allows, we would like to further extend our project to include the following:
Because a highly accurate data set can be large in size (several gigabytes), running the machine learning algorithms could become a computationally expensive process. We are aware of the availability of running Matlab on the Computer Science department’s cluster, and hence are going to explore this option. The remaining code will be written in C#.
We will implement the variant of Isomap as proposed by, as well as at least one other nonlinear dimensionaly reduction technique, such as LLE or Manifold Sculpting. Both of these algorithms will run unsupervised.
We will use spatially-varying BRDF data available through the computer graphics lab. Additionally, we will contact [WTL+06] to see if we may use their data.
Period | Task | Resource |
Apr. 13 | Proposal & Presentation due | Jon, Jiawei |
Apr. 14 – Apr. 23 | BRDF data | Jon, Jiawei |
Apr. 14 – Apr. 30 | Implement [WTL+06] | Jon |
Apr. 26 – May 5 | Implement appearance manifold viz tool | Jiawei |
May 6 – May 10 | Buffer time, milestone presentation preparation | Jon, Jiawei |
May 11 | Milestone presentation | Jon, Jiawei |
May 12 – May 23 | Alternative algorithm implementation | Jon, Jiawei |
May 20 – May 23 | Algorithm / manifold comparison | Jon, Jiawei |
May 25 – May 30 | Buffer time, polishing result | Jiawei |
May 25 – May 30 | Buffer time, final report write up | Jon |
Jun. 1 | Final Report | Jon, Jiawei |
[BST+02] M. Balasubramanian, E.L. Schwartz, J.B. Tenenbaum, V. de Silva, and J.C. Langford. The isomap algorithm and topological stability. Science, 295(5552):7, 2002.
[GVM07] Mike Gashler, Dan Ventura, and Tony Martinez. Iterative non-linear dimensionality reduction by manifold sculpting. Advances in Neural Information Processing Systems, 19, 2007.
[PH04] Matt Pharr and Greg Humphreys. Physically Based Rendering: From Theory to Implementation. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2004.
[RS00] Sam T. Roweis and Lawrence K. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500):2323–2326, 2000.
[WTL+06] Jiaping Wang, Xin Tong, Stephen Lin, Minghao Pan, Chao Wang, Hujun Bao, Baining Guo, and Heung-Yeung Shum. Appearance manifolds for modeling time-variant appearance of materials. ACM Transactions on Graphics, 25(3):754–761, July 2006.