Roland Ruiters
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
- i.4.1 [image processing and computer vision]: digitization and image capture—reflectance
- and texture i.4.8 [image processing and computer vision]: scene analysis—shape
- i.3.7 [computer graphics]: three-dimensional graphics and realism—color
- i.3.7 [computer graphics]: three‐dimensional graphics and realism—color
- shadowing
Roland Ruiters has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
Reinhard Klein
Institute for Computer Science II, University of Bonn
3 shared publications- Christopher Schwartz
Institute for Computer Science II, University of Bonn
2 shared publications - Reinhard Klein
University of Bonn Germany
2 shared publications - Ruwen Schnabel
Institut für Informatik II, Universität Bonn, Germany
1 shared publication
Latest Publications
- 6 May 2013
- Published by Wiley in Computer Graphics Forum
- Vol. 32 (2pt3) , 361-370
Example‐based Interpolation and Synthesis of Bidirectional Texture Functions
Bidirectional Texture Functions (BTF) have proven to be a well‐suited representation for the reproduction of measured real‐world surface appearance and provide a high degree of realism. We present an approach for designing novel materials by interpolating between several measured BTFs. For this purpose, we transfer concepts from existing texture interpolation methods to the much more complex case of material interpolation. We employ a separation of the BTF into a heightmap and a parallax compensated BTF to cope with problems induced by parallax, masking and shadowing within the material. By working only on the factorized representation of the parallax compensated BTF and the heightmap, it is possible to efficiently perform the material interpolation. By this novel method to mix existing BTFs, we are able to design plausible and realistic intermediate materials for a large range of different opaque material classes. Furthermore, it allows for the synthesis of tileable and seamless BTFs and finally even the generation of gradually changing materials following user specified material distribution maps.
- 6 May 2013
- Published by Wiley in Computer Graphics Forum
- Vol. 32 (2pt3) , 361-370
Example‐based Interpolation and Synthesis of Bidirectional Texture Functions
Bidirectional Texture Functions (BTF) have proven to be a well‐suited representation for the reproduction of measured real‐world surface appearance and provide a high degree of realism. We present an approach for designing novel materials by interpolating between several measured BTFs. For this purpose, we transfer concepts from existing texture interpolation methods to the much more complex case of material interpolation. We employ a separation of the BTF into a heightmap and a parallax compensated BTF to cope with problems induced by parallax, masking and shadowing within the material. By working only on the factorized representation of the parallax compensated BTF and the heightmap, it is possible to efficiently perform the material interpolation. By this novel method to mix existing BTFs, we are able to design plausible and realistic intermediate materials for a large range of different opaque material classes. Furthermore, it allows for the synthesis of tileable and seamless BTFs and finally even the generation of gradually changing materials following user specified material distribution maps.
- 1 May 2012
- Published by Wiley in Computer Graphics Forum
- Vol. 31 (2pt1) , 315-324
Data Driven Surface Reflectance from Sparse and Irregular Samples
In recent years, measuring surface reflectance has become an established method for high quality renderings. In this context, especially non‐parametric representations got a lot of attention as they allow for a very accurate representation of complex reflectance behavior. However, the acquisition of this data is a challenging task especially if complex object geometry is involved. Capturing images of the object under varying illumination and view conditions results in irregular angular samplings of the reflectance function with a limited angular resolution. Classical data‐driven techniques, like tensor factorization, are not well suited for such data sets as they require a resampling of the high dimensional measurement data to a regular grid. This grid has to be on a much higher angular resolution to avoid resampling artifacts which in turn would lead to data sets of enormous size. To overcome these problems we introduce a novel, compact data‐driven representation of reflectance functions based on a sum of separable functions which are fitted directly to the irregular set of data without any further resampling. The representation allows for efficient rendering and is also well suited for GPU applications. By exploiting spatial coherence of the reflectance function over the object a very precise reconstruction even of specular materials becomes possible already with a sparse input sampling. This would be impossible using standard data interpolation techniques. Since our algorithm exclusively operates on the compressed representation, it is both efficient in terms of memory use and computational complexity, depending only sub‐linearly on the size of the fully tabulated data. The quality of the reflectance function is evaluated on synthetic data sets as ground truth as well as on real world measurements.
- 1 May 2012
- Published by Wiley in Computer Graphics Forum
- Vol. 31 (2pt1) , 315-324
Data Driven Surface Reflectance from Sparse and Irregular Samples
In recent years, measuring surface reflectance has become an established method for high quality renderings. In this context, especially non‐parametric representations got a lot of attention as they allow for a very accurate representation of complex reflectance behavior. However, the acquisition of this data is a challenging task especially if complex object geometry is involved. Capturing images of the object under varying illumination and view conditions results in irregular angular samplings of the reflectance function with a limited angular resolution. Classical data‐driven techniques, like tensor factorization, are not well suited for such data sets as they require a resampling of the high dimensional measurement data to a regular grid. This grid has to be on a much higher angular resolution to avoid resampling artifacts which in turn would lead to data sets of enormous size. To overcome these problems we introduce a novel, compact data‐driven representation of reflectance functions based on a sum of separable functions which are fitted directly to the irregular set of data without any further resampling. The representation allows for efficient rendering and is also well suited for GPU applications. By exploiting spatial coherence of the reflectance function over the object a very precise reconstruction even of specular materials becomes possible already with a sparse input sampling. This would be impossible using standard data interpolation techniques. Since our algorithm exclusively operates on the compressed representation, it is both efficient in terms of memory use and computational complexity, depending only sub‐linearly on the size of the fully tabulated data. The quality of the reflectance function is evaluated on synthetic data sets as ground truth as well as on real world measurements.
- 1 June 2010
- Published by Wiley in Computer Graphics Forum
- Vol. 29 (4) , 1421-1429
Patch‐based Texture Interpolation
In this paper, we present a novel exemplar‐based technique for the interpolation between two textures that combines patch‐based and statistical approaches. Motivated by the notion of texture as a largely local phenomenon, we warp and blend small image neighborhoods prior to patch‐based texture synthesis. In addition, interpolating and enforcing characteristic image statistics faithfully handles high frequency detail. We are able to create both intermediate textures as well as continuous transitions. In contrast to previous techniques computing a global morphing transformation on the entire input exemplar images, our localized and patch‐based approach allows us to successfully interpolate between textures with considerable differences in feature topology for which no smooth global warping field exists.
- 1 June 2010
- Published by Wiley in Computer Graphics Forum
- Vol. 29 (4) , 1421-1429
Patch‐based Texture Interpolation
In this paper, we present a novel exemplar‐based technique for the interpolation between two textures that combines patch‐based and statistical approaches. Motivated by the notion of texture as a largely local phenomenon, we warp and blend small image neighborhoods prior to patch‐based texture synthesis. In addition, interpolating and enforcing characteristic image statistics faithfully handles high frequency detail. We are able to create both intermediate textures as well as continuous transitions. In contrast to previous techniques computing a global morphing transformation on the entire input exemplar images, our localized and patch‐based approach allows us to successfully interpolate between textures with considerable differences in feature topology for which no smooth global warping field exists.
- 1 June 2009
- Published by Wiley in Computer Graphics Forum
- Vol. 28 (4) , 1181-1188
BTF Compression via Sparse Tensor Decomposition
In this paper, we present a novel compression technique for Bidirectional Texture Functions based on a sparse tensor decomposition. We apply the K‐SVD algorithm along two different modes of a tensor to decompose it into a small dictionary and two sparse tensors. This representation is very compact, allowing for considerably better compression ratios at the same RMS error than possible with current compression techniques like PCA, N‐mode SVD and Per Cluster Factorization. In contrast to other tensor decomposition based techniques, the use of a sparse representation achieves a rendering performance that is at high compression ratios similar to PCA based methods.
- 1 June 2009
- Published by Wiley in Computer Graphics Forum
- Vol. 28 (4) , 1181-1188
BTF Compression via Sparse Tensor Decomposition
In this paper, we present a novel compression technique for Bidirectional Texture Functions based on a sparse tensor decomposition. We apply the K‐SVD algorithm along two different modes of a tensor to decompose it into a small dictionary and two sparse tensors. This representation is very compact, allowing for considerably better compression ratios at the same RMS error than possible with current compression techniques like PCA, N‐mode SVD and Per Cluster Factorization. In contrast to other tensor decomposition based techniques, the use of a sparse representation achieves a rendering performance that is at high compression ratios similar to PCA based methods.
- 27 March 2009
- Published by Wiley in Computer Graphics Forum
- Vol. 28 (2) , 513-522
Heightfield and spatially varying BRDF Reconstruction for Materials with Interreflections
Photo‐realistic reproduction of material appearance from images has widespread use in applications ranging from movies over advertising to virtual prototyping. A common approach to this task is to reconstruct the small scale geometry of the sample and to capture the reflectance properties using spatially varying BRDFs. For this, multi‐view and photometric stereo reconstruction can be used, both of which are limited regarding the amount of either view or light directions and suffer from either low‐ or high‐frequency artifacts, respectively. In this paper, we propose a new algorithm combining both techniques to recover heightfields and spatially varying BRDFs while at the same time overcoming the above mentioned drawbacks. Our main contribution is a novel objective function which allows for the reconstruction of a heightfield and high quality SVBRDF including view dependent effects. Thereby, our method also avoids both low and high frequency artifacts. Additionally, our algorithm takes inter‐reflections into account allowing for the reconstruction of undisturbed representations of the underlying material. In our experiments, including synthetic and real‐world data, we show that our approach is superior to state‐of‐the‐art methods regarding reconstruction error as well as visual impression. Both the reconstructed geometry and the recovered SVBRDF are highly accurate, resulting in a faithful reproduction of the materials characteristic appearance, which is of paramount importance in the context of material rendering.
- 27 March 2009
- Published by Wiley in Computer Graphics Forum
- Vol. 28 (2) , 513-522
Heightfield and spatially varying BRDF Reconstruction for Materials with Interreflections
Photo‐realistic reproduction of material appearance from images has widespread use in applications ranging from movies over advertising to virtual prototyping. A common approach to this task is to reconstruct the small scale geometry of the sample and to capture the reflectance properties using spatially varying BRDFs. For this, multi‐view and photometric stereo reconstruction can be used, both of which are limited regarding the amount of either view or light directions and suffer from either low‐ or high‐frequency artifacts, respectively. In this paper, we propose a new algorithm combining both techniques to recover heightfields and spatially varying BRDFs while at the same time overcoming the above mentioned drawbacks. Our main contribution is a novel objective function which allows for the reconstruction of a heightfield and high quality SVBRDF including view dependent effects. Thereby, our method also avoids both low and high frequency artifacts. Additionally, our algorithm takes inter‐reflections into account allowing for the reconstruction of undisturbed representations of the underlying material. In our experiments, including synthetic and real‐world data, we show that our approach is superior to state‐of‐the‐art methods regarding reconstruction error as well as visual impression. Both the reconstructed geometry and the recovered SVBRDF are highly accurate, resulting in a faithful reproduction of the materials characteristic appearance, which is of paramount importance in the context of material rendering.