## Abstract

Measured materials are rapidly becoming a core component in the photo-realistic image synthesis pipeline. The reason is that data-driven models can easily capture the underlying, fine details that represent the visual appearance of materials, which can be difficult or even impossible to model by hand. There are, however, a number of key challenges that need to be solved in order to enable efficient capture, representation and interaction with real materials. This paper presents two new data-driven BRDF models specifically designed for 1D separability. The proposed 3D and 2D BRDF representations can be factored into three or two 1D factors, respectively, while accurately representing the underlying BRDF data with only small approximation error. We evaluate the models using different parameterizations with different characteristics and show that both the BRDF data itself and the resulting renderings yield more accurate results in terms of both numerical errors and visual results compared to previous approaches. To demonstrate the benefit of the proposed factored models, we present a new Monte Carlo importance sampling scheme and give examples of how they can be used for efficient BRDF capture and intuitive editing of measured materials.

## 1 Introduction

Over the last decade, we have seen the development of computer graphics algorithms and techniques which enable the quality and accuracy needed to make rendered images truly comparable to photographs of the same scene. The accuracy in the simulation of scattering at surfaces and computation of the light transport in a scene is determined by the way the material properties such as color and reflectance, modeled by the Bidirectional Reflectance Distribution Function (BRDF) [30], are measured and represented. This has led to the development of both accurate parametric models [3, 8, 11, 16, 24, 35, 47], and advanced data-driven methods [20, 26, 29] for describing, measuring and analyzing for virtually all classes of materials.

Recently, measured materials and appearance capture techniques have gained significant popularity, for an overview see [14, 23]. The advantage of data-driven approaches is that carefully measured BRDFs automatically bring the detailed appearance of real-world materials into rendering pipeline. There are, however, still a number of important challenges that need to be solved in order to make data-driven models flexible and easy to use in practice. First, although significant progress has been made, [1, 31], accurate BRDF and SvBRDF measurements are still challenging due to mechanical and computational complexity. Second, measured data are difficult to edit, analyze, and in other ways interact with. It is, therefore, necessary to further develop compact representations which allow for detailed representations of the reflectance distributions with minimal approximation errors.

In this paper, we set out to address these challenges by developing a new class of separable data-driven BRDF models which allow for compact representations of BRDFs in a low-dimensional space. We focus on isotropic BRDFs and propose a new separable BRDF representation inspired by the projected deviation vector (PDV) parameterization described by Löw et al. [24]. The result is a compact and intuitive data-driven model, in which BRDFs can be described using independent one-dimensional (1D) strictly nonnegative factors, with a smaller error than previous factored representations. The independent 1D factors also enable efficient importance sampling, which is important to Monte Carlo rendering algorithms. In contrast to previous BRDF factorization methods, see for example [7, 38], our separable BRDF model is described by intuitive factors which enable detailed user control for analysis or editing. The main contributions of this paper are:

A study of the separability of existing data-driven BRDF models.

Two new BRDF models specifically designed for efficient 3D and 2D representation with 1D separability.

A novel importance sampling strategy for data-driven BRDFs of PDV parameterization.

PDV basis measurement and intuitive BRDF editing from mixture of PDV factors.

We evaluate and compare our models to current state-of-the-art using the measured BRDF data from the MERL database [26], and show that the proposed BRDF models lead to very small approximation errors and produce visually plausible results in renderings. To demonstrate the benefit of our approach, we discuss how the separable representations can be used for applications such as BRDF capture, compact and accurate representations, efficient important sampling of measured BRDFs, and artistic editing of measured materials.

## 2 Background

The analysis and new BRDF models presented in this paper build upon a large body of previous work in appearance measurement and modeling. The following subsections describe how our work relates to data-driven BRDF models, existing BRDF parameterizations, and previous approaches for BRDF factorization.

**Data-Driven BRDF Models** The way in which light interacts with matter is, in computer graphics, described using the rendering equation [17]. In the rendering equation, the scattering at each surface point in a scene is modeled by the BRDF [30]. Accurate and efficient BRDF models are essential components in the rendering of complex synthetic scenes for photo-realistic rendering. Measured BRDF data are commonly stored using the *standard parameterization* which expresses the BRDF directly in spherical coordinates, \((\omega _i, \omega _o)\). Reparameterization of BRDFs has been studied extensively for decades in order to find more efficient and compact representations. A good representation should ideally lead to reducing storage requirement (i.e., provides compactness), an intuitive representation for user editing purposes, and enable efficient importance sampling. Previous works have explored factorization methods in order to find compact representations directly in the standard parameterization [27, 44]. However, other parameterizations such as the *Half-Diff* parameterization [39] and the *Half-Out* parameterization [21] have also been proposed for obtaining more compact representations [7, 32, 38] and efficient importance sampling procedure [21]. However, previous works have not proposed both compact and intuitive representations of BRDF data, allowing for intuitive user edits, flexible and practical measurement setups, and efficient importance sampling.

In this work, we focus on reparameterization of isotropic BRDFs. Our work is inspired by the parametric ABC BRDF model [24], and we compare their projected deviation vector (PDV) parameterization to the more commonly used parameterizations used by Rusinkiewicz [39] and Lawrence et al. [21]. The main contributions of this paper are that the resulting BRDF parameterization enables us to represent measured BRDF data with as little as only two 1D factors for adequate representation, and we introduce a new representation of the deviation vector. In contrast to previous data-driven BRDF models, the proposed BRDF parameterization also induces a clear separability in both 2D and 3D representations. Moreover, we investigate factorization methods based on both 2D and 3D representations in order to show that the separability of our parameterization leads to very compact BRDF representations, well approximated with a rank-1 tensor approximation with nonnegative factors intuitive for BRDF editing.

In many applications, it is useful to represent isotropic 3D BRDFs with 2D approximations. 2D BRDF representations have shown to be useful both for efficient storage, in acquisition systems and other computer vision problems [13, 37]. Romeiro et al. [37] proposed a simple transformation from 3D to 2D for measured BRDFs stored in the Half-Diff parameterization. In the Half-Diff parameterization, the parameters \((\theta _h, \theta _d, \phi _d)\) are reduced to \((\theta _h, \theta _d)\) by taking the average over \(\phi _d\). Stark et al. [43] presented mathematical relations of \((\omega _i, \omega _o)\) on Barycentric coordinates and proposed three 2D parameterizations. However, these parameterizations are based on unintuitive and complex mathematical functions which limit user intuition. Barla et al. [5] proposed a parameterization which is similar to the PDV; however, there is not, to our knowledge, any BRDF model support for their parameterization. Thus, it would limit the use of its parameterization and importance sampling strategy.

**BRDF Factorization** In previous work, it has been shown that measured BRDFs can be factored into basis representations to enable compact representations for efficient rendering and editing. Kautz and McCool [18] proposed the normalized decomposition (ND) method for interactive rendering. In their work, they used a modified Half-Diff parameterization to avoid numerical instability. McCool et al. [27] developed homomorphic factorization on the standard parameterization. The homomorphic factorization is applied on logarithmically transformed data to ensure that the factorized results do not contain negative values. Lawrence et al. [21] proposed the double factorization method on the Half-Out parameterization for material editing applications. The method uses nonnegative matrix Factorization (NMF) [22] on 4D BRDF data. They rearranged 4D BRDFs into 2D BRDFs so that the double factorization could be applied. However, accurate results required a high number of terms in the factorization. Bagher et al. [4] proposed factored BRDF models based on the microfacet BRDF model [11] by using specific weighting functions in optimization process. The resulting models are efficient representations; however, the importance sampling is still an issue on their models; thus, their models require complicated sampling method such as multiple importance sampling (MIS)[40, 41, 46] or precomputed sampling scheme [25]. Ben-Artzi et al.[6] proposed factored BRDF models in the form of linear combinations of wavelet bases to enable real-time BRDF editing and rendering. Their method supports both parametric and analytical BRDF models. An interesting venue for future work is to investigate how our models can be incorporated with their system for editing and rendering.

Tensor factorization methods have also been applied to BRDFs. Sun et al. [44] applied Tucker factorization on the standard parameterization for interactive relighting. Schwenk et al. [42] used CANDECOMP/PARAFAC Decomposition (CPD) method [9, 15] on the standard parameterization with an additional dimension which is for wavelength information. The method iteratively applies the rank-1 approximation of the CPD method with repetition of residual factorization. They found that in standard spherical coordinates, the CPD method works better on diffuse and moderately glossy materials; while using the Half-Diff parameterization, CPD works well with glossy materials. A problem, however, is that the method needs at least four factor packs, i.e., the number of iterations on residual factorization, to accurately approximate BRDFs. Later, Ruiters and Klein [38] presented a way to improve optimization of tensor factorizations. They used the Half-Diff parameterization and applied the CPD method on BRDFs transformed to the \(\log \)-domain using the square of the relative error as the error metric in the optimization. This error metric can provide better approximation compared to using the more common \(L_2\) error metric. However, the output needs up to eight components, i.e., rank-8 approximation, to get accurate results. Bilgili et al. [7] employed the Tucker factorization on 4D BRDFs to represent both isotropic and anisotropic materials in the \(\log \)-domain. In their work, they simplified the three color channels into one luminance channel and factorized the luminance data. To get RGB BRDF data, a linear regression model is fitted to each of color channels. It is reported that measured materials [26] need up to 13-15 iterations of rank-1 approximations to get accurate results. In contrast to previous work, we show our proposed models can accurately describe BRDFs as a single term rank-1 nonnegative approximation, which allows for both compact and intuitive BRDF models.

## 3 BRDF parameterization

The first step in creating a separable BRDF representation is to select a suitable parameterization. In this section, we give an overview of the BRDF parameterizations introduced by Rusinkiewicz [39], Lawrence et al. [7, 21], and Löw et al. [24] and analyze their behavior with respect to separability and factorization. We show that they are all good choices for going from 3D to 2D and that the characteristics of the projected deviation vector parameterization[24] make it a particularly good choice for separable BRDF models. This analysis then forms the basis for the new models proposed in this paper.

The values of a BRDF typically exhibit a very high dynamic range [31]. To avoid computational problems in such as factorizations and basis representations, it is therefore common to transform the BRDF values to the \(\log \)-domain. To represent BRDFs efficiently for factorization, we transform the data values using \(\rho _t = log(\rho + 1)\).

**The Half-Difference vector parameterization (Half-Diff)** was introduced by Rusinkiewicz [39], who showed that the specular and retroreflective lobes are aligned with the proposed Half-Diff parameterization. This results in a reduced number of basis coefficients required to accurately represent measured BRDF data and lower memory storage of isotropic BRDFs compared to anisotropic BRDFs. This parameterization has seen widespread use for storing isotropic BRDFs from measured data [26]. Figure 1a illustrates the formation of the vectors and the notations used for the Half-Diff parameterization. The parameterization is formed by two vectors, defined in spherical coordinates, the *half vector*\((\theta _h, \phi _h)\) and the *difference vector*\((\theta _d, \phi _d)\). The half vector, \(\omega _h\), is the normalized vector sum of \(\omega _i\) and \(\omega _o\), given in Eq. 1. The difference vector, \(\omega _d\), represents the \(\omega _i\) vector in the transformed space. The transformed space is obtained by rotating the hemispherical space so that the half vector is the normal of the transformed space, see Eq. 1.

where \(rot_{\mathbf {x},a}\mathbf {Y}\) denotes the rotation of \(\mathbf {Y}\) around \(\mathbf {x}\) by \(a^\circ \). Moreover, \(\mathbf {n}\) and \(\mathbf {b}\) are the normal and binormal vectors to the plane, respectively.

The Half-Diff parameterization has four parameters which are \((\theta _h, \phi _h, \theta _d, \phi _d)\). To represent isotropic BRDFs, \(\phi _h\) can be ignored because isotropic BRDFs are independent of \(\phi _h\) due to symmetry.

**The Half-Outgoing vector parameterization (Half-Out)** has been used for BRDF factorization in several previous studies [7, 21]. The Half-Out parameterization is formed by \((\omega _h, \omega _o)\), the half vector, and the outgoing vector. Figure 1b illustrates the vectors and their notations. When \(\omega _o\) is fixed, changing \(\omega _h\) results in moving \(\omega _i\). Here, the half vector is similar to the Half-Diff parameterization defined by the normalized sum of \(\omega _i\) and \(\omega _o\), given in Eq. 1.

For isotropic materials, the 4D BRDFs can thus be reduced to 3D BRDFs representations where the BRDFs can be parameterized by either \((\theta _o, \theta _h, \phi _h)\) or \((\theta _h, \theta _o, \phi _o)\). In Sect. 3.1, we show illustrations of the Half-Out coordinates and its characteristics.

**The projected deviation vector parameterization (PDV)** was used in the parametric ABC BRDF model proposed by Löw et al. [24]. The generalized version of the PDV parameterization can be defined by \((\omega _r, D_p)\) where \(\omega _r\) is represented by spherical parameters \((\theta _r, \phi _r)\) and \((d_p, \phi _p)\) denote the \(D_p\) vector. Additionally, \(\omega _r\) is the perfect reflection vector of \(\omega _o\). The \(D_p\) vector is formed by the deviation vector between the projections of \(\omega _r\) and \(\omega _i\) on the plane. Figure 1c illustrates the parameter formations and notations used in the PDV parameterization. For isotropic BRDFs, the PDV parameterization has three parameters \((\theta _r, d_p, \phi _p)\), where \(\theta _r\) is the zenith angle of the perfect reflection vector from the normal and \(d_p\) is the length of the \(D_p\) vector. Its values are [0, 2). Lastly, \(\phi _p\) represents the azimuthal angle of the \(D_p\) vector in the projection plane. Algorithms 1 and 2 show how the conversions from standard coordinates to the PDV parameterization and vice versa are carried out.

Since \(d_p\) describes the shape of the BDRF lobe, the quantization over its [0, 2) domain will affect the accuracy. To accurately represent a sharp lobe, very high resolution is required in the quantization. Figure 2 shows plots of two BRDFs demonstrating that most of the variation in the lobes can be found around small \(d_p\) parameter values, and that most of the remaining parts are slowly varying and even flat. Based on these observations, we use an adaptive quantization. To find a good quantization that works in the general case, we compute the mean BRDF over a large collection of real materials and compute the nonlinear adapted step length in the quantization using the inversion method, for an overview, see the textbook by Pharr and Humphreys [34]. The resulting quantization with 90 nonlinear quantization steps, used in our experiments, is shown in Fig. 3. For the experiments in this paper, we used the MERL BRDF database [26]. Although we used all BRDFs in the MERL database, it should be noted that it may be beneficial to group them into classes and use different quantizations for different types of materials. Such analysis, however, is beyond the scope of this paper and left for future work.

### 3.1 Analysis of parameterizations

The different parameterizations described above can all accurately describe isotropic BRDFs using their inherent 3D representation. Since our goal is to reduce the dimensionality of the models required to accurately represent BRDF data, we analyze how well the 3D representation can be represented in 2D. To do this, we first, in Fig. 4, plot the projection of the 3D coordinates on the hemisphere onto the unit disk for regular points in the parameter spaces. The top row shows the Half-Diff parameterization, with parameters \((\theta _h, \theta _d, \phi _d)\), for a fixed \(\theta _h = 30^\circ , 70^\circ \). The plots show how \(\omega _o\) moves on the hemisphere and in the projection plane when \(\omega _d\) is varied. The middle row shows the Half-Out parameterization, with parameters \((\theta _o, \theta _h, \phi _h)\), and a fixed \(\theta _o = 30^\circ , 70^\circ \). The plots show how \(\omega _i\) changes as a function of \(\omega _h\). Finally, the bottom row shows the same plots for the PDV parameterization, with parameters \((\theta _r, d_p, \phi _p)\). By varying \(d_p\) and \(\phi _p\) with a fixed angle of \(\omega _r = 30^\circ , 70^\circ \), only \(\omega _o\) is changed and forms circles in the projection plane. In fact, for smooth surfaces Löw et al. [24] observed that these circles closely model the iso-contours on the BRDF lobe. This means that the BRDF values along each circle are close to constant.

Further conclusions can be drawn from visualizing real BRDF data. Figure 5 illustrates an example from our investigation where the alum-bronze BRDF is plotted in each of the parameterizations, respectively. The three leftmost columns demonstrate how the 2D slices in the 3D representation vary along the third dimension of each parameterization. Figure 5a–d illustrates the BRDF data in the Half-Diff parameterization along the \(\phi _d\), Fig. 5e–h illustrates the BRDF data in the Half-Out parameterization along the \(\phi _h\) dimension, and Fig. 5i–l illustrates the BRDF data in the PDV parameterization along the \(\phi _p\) dimension. The right column shows the corresponding 2D representation computed as the mean over all slices in the third parameter dimension for each parameterization. The plots illustrate that for all three parameterizations, the BRDF values are stable along the third dimension, which supports the conclusion that they are suitable choices for going from a 3D to a 2D representation. Visual inspection of the BRDFs in the MERL database also shows that data represented in the PDV parameterization is better aligned (horizontally and vertically) in the 2D plane compared to the Half-Diff and Half-Out parameterizations. As we show in the next section, this structure makes it possible to accurately factorize the 2D representation into a 1D + 1D factored BRDF model.

## 4 BRDF factorization

Accurate factorization requires both a representation which enables separability and a suitable factorization technique adhering to the requirements put by the application. The choice of parameterization, such as the PDV parameterization presented in the previous section, is thus a key for an efficient low-rank approximation as unstructured data or diagonally structured data results in high rank factorizations [33]. It is highly desirable that the BRDF data can be approximated using nonnegative rank-1 approximations so that the data can be represented as nonnegative univariate functions which lead to intuitive representations for applications such as BRDF capture and editing.

Data factorization can be carried out in several ways. In previous work, nonnegative matrix factorization (NMF) [22] has been a popular choice for factorization of BRDF data, see for example the paper by Lawrence et al. [21]. Another commonly used technique is Tucker decomposition [45], which decomposes a tensor into several factors. For 3D data, the approximated data can be computed by a sum of factor products and a core tensor. For the models presented in this paper, we employ a tensor factorization technique called CANDECOMP/PARAFAC Decomposition, Canonical Polyadic Decomposition (CPD) [9, 15] with the nonnegativity constraint. Compared to the Tucker decomposition, the CPD method is less expensive to compute for random access. Moreover, the Tucker decomposition has a core tensor, [10], which grows exponentially in size if the approximation rank is high. A large tensor core thus leads to higher storage requirements for factorized BRDFs compared to CPD.

For rank-1 approximations, the three techniques are comparable in terms of approximation error. Figure 6 shows a comparison of Tucker decomposition and CPD applied to BRDF data from the MERL database [26] represented using the PDV, Half-Out, and Half-Diff parameterizations for 3D data described in the previous section. Figure 7 shows similar plots but compares NMF and CPD for factorization of 2D data as described in the previous section. Table 1 and 2 show the errors from Figures 6 and 7 in numerical form showing that the PDV parameterization exhibits the smallest mean error and low variance as compared to the Half-Diff and Half-Out parameterizations. Although the error varies between the different factorization models, the approximation accuracy is more or less the same for all three factorization techniques. Given advantages such as a lower computational complexity and efficient random access, we use the CPD method for both 3D and 2D data.

**Rank-1 iterative factorization** In some cases, it is desirable to trade the single factor representation for achieving a higher accuracy in the factorization. This can be done using iterative factorization such that the residual is represented using a higher number of factors for the parameter dimensions, for an overview see [7, 19, 42]. In our models, we have the option of using an iterative method for residual factorization. Since the intuitiveness inherent to the single factor representation is lost, we do not enforce the nonnegative constraint for the residual factorization as this has the tendency to lead to a smaller error. Starting from the original tensor, we constraint the first factorization with the nonnegativity in order to preserve the physical meaning within the BRDFs. For the residual parts, we iteratively factorize the residuals without any constraint, allowing negative values.

## 5 New BRDF models

This section presents two new separable BRDF models, in 3D and in 2D, which are based on the above analysis of the PDV parameterization and factorization techniques. The separable models are designed to enable factorization into three or two 1D factors, respectively.

**3D separable BRDF model ** The first model describes BRDFs using the 3D PDV representation and can be expressed as:

where \(\rho _t = log(\rho + 1)\). \(F_{1,l}, F_{2,l}, F_{3,l}\) are the 1D factored functions from the rank-1 iterative CPD method applied to the 3D BRDF representation, and *L* is the number of iterative terms. As mentioned above, the BRDF can be accurately represented using single factors or a higher number of factors without the nonnegativity constraint to further reduce the approximation error.

**2D separable BRDF model** Assuming that the BRDF values are constant over the \(\phi _p\) parameter in the PDV parameterization, our 2D representation can be computed by either averaging over the \(\phi _p\) dimension or by selecting a single slice from the BRDF. Our proposed 2D separable BRDF model is applied on top of the 2D BRDF representation by using the rank-1 CPD method. This can be formulated as:

where \(G_1, G_2\) are the 1D factored functions from the rank-1 CPD method on 2D BRDF representation.

### 5.1 Importance sampling

Efficient BRDF sampling is a key building block in modern Monte Carlo algorithms. For a given BRDF, importance sampling relies on deriving a distribution, or probability density function (PDF) from which samples are drawn during rendering. If the PDF is proportional to the underlying BRDF, the variance of the Monte Carlo estimator is reduced. In this section, we describe how to compute PDF from the PDV factorization.

The goal of computing the PDF is to find the conditional probability, \(p(d_p, \phi _p | \theta _o)\), so that, for a given viewing direction defined by \(\theta _o\), we can draw optimal directions in which to sample the lighting environment. Through the mirroring of \(\omega _o\), \(\theta _o\) and \(\theta _r\) can be interchanged. We can thus rewrite the conditional probability as: \(p(d_p, \phi _p | \theta _r)\). Since the \(\phi _p\) factor is constant up to the truncation of the unit circle, the conditional probability can be factored into the multiplication of two PDFs, \(p(d_p | \theta _r) p_\phi (\phi _p)\), where \(p_\phi (\phi _p)\) is a uniform PDF. The PDV probability density used for importance sampling can thus be expressed as:

where \(N_{d_p}\) is the resolution of the \(d_p\) quantization, in our case 90, and \(\varDelta d_{p_j}\) is the \(d_p\) step size. Note that the \(d_p\) step size is nonlinear due to the quantization described in Sect. 3. The term \(\rho (\theta _r, d_p, \phi _p)\) can be computed by using Eq. 2 when \(L = 1\).

To choose the directions, we compute the cumulative distribution function (CDF) as:

During rendering, we would like to draw sample directions based on a given probability. One of the simplest ways to achieve this is to generate a uniform random variable in range [0,1] and apply the inversion method on the computed CDF. In this case, we generate two uniform random variables \((\xi _1,\xi _2)\) to sample from \(p_\phi (\phi _p)\) and \(p(d_p | \theta _r)\). The \(\phi _p\) direction can be computed as:

where \(\xi _1\) is the uniform random variable. The magnitude \(d_p = |D_p|\) of the \(D_p\) vector can be found from the CDF using the inversion method as:

where \(\xi _2\) is the second uniform random variable.

It is unavoidable to sometimes choose \((d_p, \phi _p)\) pairs that result in invalid \(\omega _i\) directions, i.e., falls outside the domain of the parameters. However, when such a \((d_p, \phi _p)\) pair is chosen, it is straightforward to reject such samples without introducing inaccuracy using rejection sampling, for an overview see the book by Pharr and Humphreys [34].

For clarity, the importance sampling above was described in PDV space. The PDF must thus be transformed to conform to the Monte Carlo estimator in the standard parameterization using the Jacobian of the mapping:

where \(|J_T|\) is the absolute value of the Jacobian of the transformation. We have \(p_\phi (\phi _p) = \frac{1}{2\pi }\) because it is uniform random over the \(\phi _p\) parameter. The Jacobian of the mapping is expressed as:

where \((\theta _i,\phi _i)\) is the light direction and \((\theta _o,\phi _o)\) is the viewing direction.

Unfortunately, the \(sin(\theta _i)\) factor in the numerator introduces a valley in the Jacobian surface, see Fig. 8, along which it drops to zeros and exhibits numerical instabilities leading to noise in the renderings. Hence, we propose a smooth version of \(J_T\), where the \(sin(\theta _i)\) factor is omitted:

We have found that removing \(sin(\theta _i)\) does not change the efficiency of the importance sampling significantly and that this approximation leads to high quality rendering results. The effect of the importance sampling is evaluated in the next section.

## 6 Results and evaluation

This section presents an evaluation of the new separable BRDF models described in Sect. 5, the different parameterizations described in Sect. 3 with respect to their ability to go from 3D to 2D representations, and the effect of the factorization techniques described in Sect. 4 in computing factored models using the different parameterizations. We also show examples of how the models presented in this paper can be used in applications such as storage, efficient BRDF capture and editing.

To measure the error introduced by the models, we use the relative root mean square error (RMS) over all the 100 BRDFs in the MERL database [26]. For each combination of BRDF model, parameterization and factorization, we compute the error over the entire hemisphere. In order to generate the same set of sample points and avoid unnecessary interpolation, we first use a random cosine sampling scheme in standard spherical coordinates [34] and then transform each sample into the parameter space of the parameterization where the error is measured. Both the PDV and Half-Diff models are represented at a resolution of \(90 \times 90 \times 360\) elements for the \((\theta _h, \theta _d, \phi _d)\) and \((\theta _r, d_p, \phi _p)\) parameter dimensions, respectively. We parameterized the Half-Out parameterization using \((\theta _o, \theta _h, \phi _h)\) and found that the \(\theta _h\) resolution needs to be higher than 90 for high fidelity renderings. Therefore, for the Half-Out, we used a resolution of \(45 \times 200 \times 360\) elements in order to ensure a fair comparison. The supplementary material includes both interactive examples for visual inspection of the proposed models and rendered examples of all BRDFs in the MERL database.

The CPD3D and CPD2D methods were implemented using the N-way Toolbox for MATLAB [2] with a nonnegativity constraint for the first iteration, \(L=1\). For the experiments, we used the MERL database (including all measured angles). For CPD3D, we used the PDV parameterization at a resolution of \(90 \times 90 \times 180\). All the rendering results were produced by using PBRT [34]. The fitting time comparison in Table 3 was carried out using an Intel(R) Xeon(R) W-2123 3.60GHz computer with 32 GB memory.

**Single factor models in 3D and 2D** To evaluate the accuracy introduced using the different parameterizations for the single iteration factorization, we examine the separable 3D and 2D models described in Sect. 5 using the PDV, Half-Out, and Half-Diff parameterizations. Figure 6 shows that, in the separable 3D model described in Eq. 2, the PDV parameterization (blue plot) on average leads to a smaller error compared to both Half-Out and Half-Diff for both the Tucker and CPD factorization schemes. The RMS is computed as the error between each 3D representation and its corresponding factored model. Visual inspection of the rendered BRDFs reveals that the PDV parameterization produces significantly better results compared to the other parameterizations, but the Half-Diff parameterization has a tendency to produce better results for diffuse materials. An example of this is shown in the second columns (CPD3D-Iteration-1) in Fig. 10, where renderings of the chrome and special-walnut-224 BRDFs are visualized for different combinations of parameterizations, model dimensionality and number of iterations. Figure 7 shows the errors introduced when going from the 3D representations of the PDV, Half-Out, and Half-Diff parameterizations to the corresponding factored models in 2D described in Eq. 3. Similarly to the factored 3D models, it is evident that the PDV parameterization on average leads to a smaller error compared to Half-Out, and Half-Diff. Visual inspection, see the sixth columns (CPD2D) in Fig. 10, shows that the PDV parameterization, also in the 2D case, tends to handle glossy materials with small errors and that the Half-Diff parameterization is better at diffuse materials. In summary, the evaluations and the renderings show that the proposed factored 3D and 2D models produce both small numerical errors and visually plausible rendering results using only a single factor rank-1 approximation, and that PDV and Half-Diff are suitable parameterizations for glossy and diffuse materials, respectively.

**Iterative factor 3D model** It is sometimes desirable to trade storage requirements and intuitive control over the BRDF factors for higher accuracy. As described in Sect. 4, this can be carried out using iterative factorization of the residual error so that each factor is represented using *L* basis vectors. Comparing the error plots in Fig. 6b using \(L=1\) iteration to that in Fig. 9 using \(L=10\) iterations shows that both the maximum and mean errors are reduced significantly for all parameterizations, please see Table 4. It is also evident that the different parameterization on average starts to perform on par with each other in terms of numerical error. This is likely due to that the increased expressive power of the higher-order models can compensate better for the residual errors. The fourth column (CPD3D-Iteration-10) in Fig. 10 reveals similar behavior for the different parameterizations as for the \(L=1\) iteration renderings in the second column. Finally, Fig. 11 shows examples of how the accuracy varies with an increasing number of \(L=10,15\), and 20 iterations. Comparing to the models introduced by Lawrence et al. [21] and Bilgili et al. [7], the color-coded insets and the peak signal-to-noise ratio (PSNR) [36] measures show that our iterative model produces state-of-the-art results. The different models lead to different storage requirements. Table 5 compares the storage requirements for each of the models used in Fig. 11 as well as the reference measured BRDF data.

Table 6 and Figure 12 compare the proposed 3D models to the Naive model proposed by Bagher et al. [4]. The blue curve in Figure 12 shows the error plot of Naive model sorted in ascending order. We chose the Naive model as a representative method from Bagher et al. since it is the simplest method among their models and due to the fact that Bagher et al. models perform similarly to each other. Our 3D model with \(L=15\) performs on par with the Naive model. When *L* is increased, our model performs overall better than to the Naive model. Table 6 summarizes the mean, minimum and maximum errors computed over all BRDFs in the MERL database comparing our 3D models to Bagher et al. for different numbers of iterations, *L*.

**Importance sampling** Figure 13 compares the importance sampling technique developed for our factored models described in Sect. 5.1 to the techniques presented by Lawrence et al. [21], Edwards et al. [12], and Bilgili et al. [7]. The Figure shows renderings of the Princeton scene generated using the PBRT rendering system, described in the book by Pharr and Humphreys [34], with 256 path samples per pixel. The scene consists of Nickel, Yellow-matte-plastic, and Blue-metallic-paint materials. The rendered images show that our importance sampling technique performs better than Lawrence et al. [21] and Edwards et al. [12] techniques numerically, but our technique gives numerically worse performance than Bilgili et al. [7] technique. A natural next step, however, would be to derive a more accurate approximation of the Jacobian which potentially would lead to even better results. The color shift on and near the teapot in Fig. 13c is due to Bilgili et al.’s representation inaccuracy. Because this representation factorizes intensity channel and then estimates color values linearly as a sub-procedure by a few linear coefficients. Table 7 shows the rendering time for the images in Fig. 11 (in seconds). Even with our higher accurate models (\(L>15\)), our factored models have comparable computational cost compared to Edwards et al. [12], better computational cost compared to the technique presented by Bilgili et al. [7], but a higher computational cost compared to the technique presented by Lawrence et al. [21]. Note that our factored models compute probabilities on the fly and do not rely on precomputed lookup tables for importance sampling, but many previous BRDF representations (i.e., Bilgili et al. [7] and Lawrence et al. [21]) rely on precomputed lookup tables for importance sampling.

Figure 14 shows the importance sampling efficiency evaluated using the logarithmic MSE (mean squared error) from a sphere rendered in a diffuse (constant) white environment. The results show importance sampling efficiency of various techniques, which are similar to the results demonstrated in Fig. 13.

**Limitations** Our approach is dependent on the quantization of the \(D_p\) vector. In the experiments presented here, we computed the \(d_p\) step length based on the average of all materials in the MERL database. We have noticed that this results in unsuitable quantization for some materials, see special-walnut-224 in Fig. 10. This could be alleviated by computing different nonlinear quantizations for different material classes. Additionally, in order to make a comparison with Bagher et al. [4], we included all angles of the materials in the MERL database. Previous studies (e.g., Ngan et al. [28] and Löw et al. [24]) have pointed out that the measured values in the MERL database are increasingly unreliable toward grazing angles. It would therefore be interesting to evaluate the accuracy of the models within a restricted range of angles. Moreover, the Jacobian term used in the importance sampling is an approximation to the exact solution due to numerical instabilities. This could be improved by deriving a better approximation.

### 6.1 Applications

This section shows examples of how the PDV factored models can be used for efficient measurement of isotropic BRDFs and editing of measured BRDF through the individual PDV factors.

**BRDF reconstruction from factor measurements** Using the factored 2D model described in Eq. 3, it is possible to capture a full isotropic BRDF by measuring the scaling of the lobe described by \(G_1(\theta _r)\) and the shape of the lobe described by \(G_2(d_p)\) in a planar slice of the BRDF. In the illustration of the 2D PDV parameterization in Fig. 5l, this would correspond to measure the 1D \(G_2(d_p)\) factor representing the vertical direction and the 1D \(G_1(\theta _r)\) factor representing the horizontal direction in the 2D matrix. As illustrated in Fig. 15 (left), the horizontal factor \(G_1(\theta _r)\) can be measured by moving a sensor and a calibrated light source in opposite directions with respect to the normal and capture the response in the mirror direction. The shape of the lobe described by \(G_2(d_p)\) can be measured by fixing the light source at a specific angle to the normal and move the sensor along the arc as illustrated in Fig. 15 (right). Please note that the \(G_2(d_p)\) factor needs to be normalized before it can be modulated with \(G_1(\theta _r)\) to form the full 2D matrix describing the BRDF. Figure 16 shows the reconstruction errors (red plot) obtained by simulating capture and reconstruction as described above for all BRDFs in the MERL database, and as a reference the error introduced by direct representation using our factored 3D model with \(L=1\) iteration. To simulate the capture of the \(G_2(d_p)\) factor, the light source was fixed at a \(70^\circ \) angle to the normal. Figure 17 shows example renderings of three reconstructed BRDFs.

**Editing of measured BRDFs** The single iteration (\(L=1\)) nonnegative factor models in 2D and 3D enable intuitive editing. For example, in the 2D model described in Equation 3, \(G_2(d_p)\) can be edited to change the shape of the lobe, and the \(G_1(\theta _r)\) can be edited to change effects such as grazing angle behavior. Figure 18 shows a number of editing examples demonstrating how the characteristics of different measured materials can be mixed to create a new appearance. The images show how the \(G_1(\theta _r)\) factor from the materials in the left column is combined with the \(G_2(d_p)\) factor describing the shape of the lobe of the BRDFs in the middle column to create the mixed materials in the right column.

## 7 Conclusions and future work

This paper presented a study of three different BRDF parameterizations and proposed two new factored BRDF models for 3D and 2D representations of isotropic BRDFs. The study showed that the Half-Diff [39], Half-Out [21], and PDV [24] parameterizations are all suitable for 2D representation of isotropic BRDFs with only small approximation errors. It also showed that the PDV parameterization structures the data in a way suitable for factorization. The evaluation demonstrated that the new models are flexible in terms of which parameterization is used and that they can represent measured BRDF with low numerical approximation errors, and produce visually plausible renderings. For efficient rendering, the paper also presented a new Monte Carlo importance sampling scheme based on the factored models.

The evaluation and the results point toward a number of interesting venues for future work. One interesting area is to further study how the choice of parameter quantization affects the accuracy of the factorization. Another important direction is to investigate how low-dimensional factored models can be adapted for accurate representation of anisotropic BRDFs. Finally, we will use the factored models to develop efficient BRDF capture systems and investigate how they can be incorporated in computer vision applications where BRDFs are needed to be characterized in the wild.

## References

Aittala, M., Weyrich, T., Lehtinen, J.: Two-shot svbrdf capture for stationary materials. ACM Trans. Graph

**34**(4), 110:1–110:13 (2015)Andersson, C.A., Bro, R.: The n-way toolbox for matlab. Chemom. Intell. Lab. Syst.

**52**(1), 1–4 (2000). http://www.sciencedirect.com/science/article/B6TFP-40WDSNB-1/2/027b39594088d3d7974c32d6533a3670Ashikhmin, M., Shirley, P.: An anisotropic phong brdf model. J. Graph. Tools

**5**(2), 25–32 (2000)Bagher, M.M., Snyder, J., Nowrouzezahrai, D.: A non-parametric factor microfacet model for isotropic brdfs. ACM Trans. Graph.

**35**(5), 159:1–159:16 (2016)Barla, P., Belcour, L., Pacanowski, R.: In praise of an alternative brdf parametrization. In: Proceedings of the Third Workshop on Material Appearance Modeling: Issues and Acquisition, MAM ’15, pp. 9–13. Eurographics Association, Darmstadt, Germany (2015)

Ben-Artzi, A., Overbeck, R., Ramamoorthi, R.: Real-time brdf editing in complex lighting. ACM Trans. Graph.

**25**(3), 945–954 (2006). https://doi.org/10.1145/1141911.1141979Bilgili, A., Öztürk, A., Kurt, M.: A general brdf representation based on tensor decomposition. Comput. Graph. Forum

**30**(8), 2427–2439 (2011)Blinn, J.F.: Models of light reflection for computer synthesized pictures. SIGGRAPH Comput. Graph.

**11**(2), 192–198 (1977)Carroll, J.D., Chang, J.J.: Analysis of individual differences in multidimensional scaling via an n-way generalization of “eckart-young” decomposition. Psychometrika

**35**(3), 283–319 (1970)Cichocki, A., Zdunek, R., Phan, A.H., Amari, Si: Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation. Wiley, Hoboken (2009)

Cook, R.L., Torrance, K.E.: A reflectance model for computer graphics. ACM Trans. Graph.

**1**(1), 7–24 (1982)Edwards, D., Boulos, S., Johnson, J., Shirley, P., Ashikhmin, M., Stark, M., Wyman, C.: The halfway vector disk for brdf modeling. ACM Trans. Graph.

**25**(1), 1–18 (2006)Georgoulis, S., Vanweddingen, V., Proesmans, M., Gool, L.V.: A gaussian process latent variable model for brdf inference. In: 2015 IEEE International Conference on Computer Vision (ICCV), pp. 3559–3567 (2015)

Guarnera, D., Guarnera, G., Ghosh, A., Denk, C., Glencross, M.: Brdf representation and acquisition. Comput. Graph. Forum

**35**(2), 625–650 (2016). https://doi.org/10.1111/cgf.12867Harshman, R.: Foundations of the parafac procedure: models and conditions for an “explanatory” multi-modal factor analysis. UCLA Working Papers in Phonetics

**16**(1970)Holzschuch, N., Pacanowski, R.: A two-scale microfacet reflectance model combining reflection and diffraction. ACM Trans. Graph.

**36**(4), 66:1–66:12 (2017)Kajiya, J.T.: The rendering equation. In: Proceedings of the 13th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH ’86, pp. 143–150. ACM, New York, NY, USA (1986)

Kautz, J., McCool, M.D.: Interactive rendering with arbitrary brdfs using separable approximations. In: Proceedings of the 10th Eurographics Conference on Rendering, EGWR’99, pp. 247–260. Eurographics Association, Aire-la-Ville, Switzerland, Switzerland (1999)

Kurt, M., Öztürk, A., Peers, P.: A compact tucker-based factorization model for heterogeneous subsurface scattering. In: S. Czanner, W. Tang (eds.) Proceedings of the 11th Theory and Practice of Computer Graphics, TPCG ’13, pp. 85–92. Eurographics Association, Bath, United Kingdom (2013)

Lawrence, J., Ben-Artzi, A., DeCoro, C., Matusik, W., Pfister, H., Ramamoorthi, R., Rusinkiewicz, S.: Inverse shade trees for non-parametric material representation and editing. ACM Trans. Graph.

**25**(3), 735–745 (2006)Lawrence, J., Rusinkiewicz, S., Ramamoorthi, R.: Efficient brdf importance sampling using a factored representation. ACM Trans. Graph.

**23**(3), 496–505 (2004)Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: In NIPS, pp. 556–562. MIT Press (2000)

Lensch, H.P.A., Goesele, M., Chuang, Y.Y., Hawkins, T., Marschner, S., Matusik, W., Mueller, G.: Realistic materials in computer graphics. In: ACM SIGGRAPH 2005 Courses. ACM (2005)

Löw, J., Kronander, J., Ynnerman, A., Unger, J.: Brdf models for accurate and efficient rendering of glossy surfaces. ACM Trans. Graph.

**31**(1), 9:1–9:14 (2012)Luksch, C., Tobler, R.F., Mühlbacher, T., Schwärzler, M., Wimmer, M.: Real-time rendering of glossy materials with regular sampling. Vis. Comput.

**30**(6), 717–727 (2014). https://doi.org/10.1007/s00371-014-0958-xMatusik, W., Pfister, H., Brand, M., McMillan, L.: A data-driven reflectance model. ACM Trans. Graph.

**22**(3), 759–769 (2003)McCool, M.D., Ang, J., Ahmad, A.: Homomorphic factorization of brdfs for high-performance rendering. In: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH ’01, pp. 171–178. ACM, New York, NY, USA (2001)

Ngan, A., Durand, F., Matusik, W.: Experimental validation of analytical brdf models. In: ACM SIGGRAPH 2004 Sketches, SIGGRAPH ’04, pp. 90–. ACM, New York, NY, USA (2004)

Ngan, A., Durand, F., Matusik, W.: Experimental analysis of brdf models. In: Proceedings of the Sixteenth Eurographics Conference on Rendering Techniques, EGSR ’05, pp. 117–126. Eurographics Association, Aire-la-Ville, Switzerland, Switzerland (2005)

Nicodemus, F., Richmond, J., Hsia, J., Ginsberg, W., Limperis, T.: Geometrical considerations and nomenclature for reflectance. Appl. Op.

**9**, 1474–1475 (1977)Nielsen, J.B., Jensen, H.W., Ramamoorthi, R.: On optimal, minimal brdf sampling for reflectance acquisition. ACM Trans. Graph.

**34**, 186:1–186:11 (2015)Pacanowski, R., Celis, O.S., Schlick, C., Granier, X., Poulin, P., Cuyt, A.: Rational brdf. IEEE Trans. Vis. Comput. Graph.

**18**(11), 1824–1835 (2012)Peers, P., vom Berge, K., Matusik, W., Ramamoorthi, R., Lawrence, J., Rusinkiewicz, S., Dutré, P.: A compact factored representation of heterogeneous subsurface scattering. ACM Trans. Graph.

**25**(3), 746–753 (2006)Pharr, M., Humphreys, G.: Physically Based Rendering, Second Edition: From Theory To Implementation, 2nd edn. Morgan Kaufmann Publishers Inc., San Francisco (2010)

Phong, B.T.: Illumination for computer generated pictures. Commun. ACM

**18**(6), 311–317 (1975)Richardson, I.E.: Video Codec Design: Developing Image and Video Compression Systems. Wiley, New York (2002)

Romeiro, F., Vasilyev, Y., Zickler, T.: Passive reflectometry. In: Proceedings of the 10th European Conference on Computer Vision: Part IV, ECCV ’08, pp. 859–872. Springer-Verlag, Berlin, Heidelberg (2008)

Ruiters, R., Klein, R.: A compact and editable representation for measured brdfs. Tech. Rep. CG-2010-1, University of Bonn (2010)

Rusinkiewicz, S.: A new change of variables for efficient BRDF representation. In: Proceedings of Eurographics Workshop on Rendering, pp. 11–22 (1998)

Sbert, M., Havran, V.: Adaptive multiple importance sampling for general functions. Vis. Comput.

**33**(6), 845–855 (2017). https://doi.org/10.1007/s00371-017-1398-1Sbert, M., Havran, V., Szirmay-Kalos, L., Elvira, V.: Multiple importance sampling characterization by weighted mean invariance. Vis. Comput.

**34**(6), 843–852 (2018). https://doi.org/10.1007/s00371-018-1522-xSchwenk, K., Kuijper, A., Bockholt, U.: Modeling wavelength-dependent brdfs as factored tensors for real-time spectral rendering. In: GRAPP 2010 - Proceedings of the International Conference on Computer Graphics Theory and Applications, Angers, France, May 17-21, 2010, pp. 165–172 (2010)

Stark, M.M., Arvo, J., Smits, B.: Barycentric parameterizations for isotropic brdfs. IEEE Trans. Vis. Comput. Graph.

**11**(2), 126–138 (2005)Sun, X., Zhou, K., Chen, Y., Lin, S., Shi, J., Guo, B.: Interactive relighting with dynamic brdfs. ACM Trans. Graph.

**26**(3) (2007)Tucker, L.R.: Some mathematical notes on three-mode factor analysis. Psychometrika

**31**(3), 279–311 (1966)Veach, E.: Robust monte carlo methods for light transport simulation. Ph.D. thesis, Stanford, CA, USA (1998). AAI9837162

Ward, G.J.: Measuring and modeling anisotropic reflection. SIGGRAPH Comput. Graph.

**26**(2), 265–272 (1992)

## Acknowledgements

This work was supported by the Swedish Science Council through grant VR-2015-05180, the strategic research environment ELLIIT, the Scientific and Technical Research Council of Turkey (Project No: 115E203), and the Scientific Research Projects Directorate of Ege University (Project No: 2015/BİL/043).

## Author information

### Authors and Affiliations

### Corresponding author

## Ethics declarations

### Conflict of Interest

The authors declare that they have no competing interests.

## Additional information

### Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## Rights and permissions

**Open Access** This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

## About this article

### Cite this article

Tongbuasirilai, T., Unger, J., Kronander, J. *et al.* Compact and intuitive data-driven BRDF models.
*Vis Comput* **36**, 855–872 (2020). https://doi.org/10.1007/s00371-019-01664-z

Published:

Issue Date:

DOI: https://doi.org/10.1007/s00371-019-01664-z

### Keywords

- Reflectance modeling
- Rendering
- Computer graphics