Search Results

Now showing 1 - 10 of 16
  • Item
    Spatial Directional Radiance Caching
    (The Eurographics Association and Blackwell Publishing Ltd, 2009) Gassenbauer, Vaclav; Krivanek, Jaroslav; Bouatouch, Kadi
    We present a new approach for accelerated global illumination computation in scenes with glossy surfaces. Our algorithm combines sparse illumination computation used in the radiance caching algorithm with BRDF importance sampling. To make this approach feasible, we extend the idea of lazy illumination evaluation, used in the caching approaches, from the spatial to the directional domain. Using importance sampling allows us to apply caching not only on low-gloss but also on shiny materials with high-frequency BRDFs, for which the radiance caching algorithm breaks down.
  • Item
    An adaptive Discretization Method For Radiosity
    (Blackwell Science Ltd and the Eurographics Association, 1992) Languenou, Eric; Bouatouch, Kadi; Tellier, Pierre
    When using radiosiiy, the visual quality of the rendered images strongly depends on the method employed for discretizing the scene into patches. A too fine discretization may give rise to artifacts, while with a coarse discretization areas with high radiosity gradient may appear. To overcome these problems, the discretization must adapt to the scene. That is, the interaction between two patches must account for the distance between them as well as their surface area. In other words, surfaces far away are discretized less finely than nearby surfaces. These aspects are considered by the new adaptive discretiration method described in this paper. It performs both discretization and system resolution at each iteration of the shooting process, allowing then interactivity.
  • Item
    A Progressive Algorithm for Three Point Transport
    (Blackwell Publishers Ltd and the Eurographics Association, 1999) Dumont, Reynald; Bouatouch, Kadi; Gosselin, Philippe
    When computing global illumination in environments made up of surfaces with general Bidirectional Reflection Distribution Functions, a three point formulation of the rendering equation can be used. Brute-force algorithms can lead to a linear system of equations whose matrix is cubic, which is expensive in time and space. The hierarchical approach is more efficient. Aupperle et al. proposed a hierarchical three point algorithm to compute global illumination in the presence of glossy reflection. We present in this paper some improvements we brought to this method: shooting, "lazy" push-pull, photometric subdivision criterion, etc. Then we will show how our new method takes into account non-planar surfaces in the hierarchical resolution process.
  • Item
    Improving Performance and Accuracy of Local PCA
    (The Eurographics Association and Blackwell Publishing Ltd., 2011) Gassenbauer, Václav; Krivánek, Jaroslav; Bouatouch, Kadi; Bouville, Christian; Ribardière, Mickaël; Bing-Yu Chen, Jan Kautz, Tong-Yee Lee, and Ming C. Lin
    Local Principal Component Analysis (LPCA) is one of the popular techniques for dimensionality reduction and data compression of large data sets encountered in computer graphics. The LPCA algorithm is a variant of kmeans clustering where the repetitive classification of high dimensional data points to their nearest cluster leads to long execution times. The focus of this paper is on improving the efficiency and accuracy of LPCA. We propose a novel SortCluster LPCA algorithm that significantly reduces the cost of the point-cluster classification stage, achieving a speed-up of up to 20. To improve the approximation accuracy, we investigate different initialization schemes for LPCA and find that the k-means++ algorithm [AV07] yields best results, however at a high computation cost. We show that similar ideas that lead to the efficiency of our SortCluster LPCA algorithm can be used to accelerate k-means++. The resulting initialization algorithm is faster than purely random seeding while producing substantially more accurate data approximation.
  • Item
    Experimenting with a Parallel Ray-Tracing Algorithm on a Hypercube Machine
    (Eurographics Association, 1988) Priol, Thierry; Bouatouch, Kadi
    A parallel space tracing algorithm is presented. It subdivides the scene into regions. These latter are distributed among the processors of an iPSC hypercube machine designed by Intel company. Each processor subdivides its own region into cells to accelerate the ray tracing algorithm. Processors communicate by means of messages. The pyramidal shape of the regions allows the deletion of the primary ray messages. A method of performing a roughly uniform load distribution is proposed.
  • Item
    Example‐Based Colour Transfer for 3D Point Clouds
    (© 2021 Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd, 2021) Goudé, Ific; Cozot, Rémi; Le Meur, Olivier; Bouatouch, Kadi; Benes, Bedrich and Hauser, Helwig
    Example‐based colour transfer between images, which has raised a lot of interest in the past decades, consists of transferring the colour of an image to another one. Many methods based on colour distributions have been proposed, and more recently, the efficiency of neural networks has been demonstrated again for colour transfer problems. In this paper, we propose a new pipeline with methods adapted from the image domain to automatically transfer the colour from a target point cloud to an input point cloud. These colour transfer methods are based on colour distributions and account for the geometry of the point clouds to produce a coherent result. The proposed methods rely on simple statistical analysis, are effective, and succeed in transferring the colour style from one point cloud to another. The qualitative results of the colour transfers are evaluated and compared with existing methods.
  • Item
    A VLSI Chip for Ray Tracing Bicubic Patches
    (Eurographics Association, 1989) Bouatouch, Kadi; Saouter, Yannick; Candela, Jean Charles
    This paper deals with the integration of a VLSI chip dedicated to ray tracing bicubic patches. A recursive subdivision algorithm is embedded in this chip. The recursion stops when the termination conditions are met. A software implementation allowed for the determination of key parameters which influenced the choice of the proposed chip' architecture. Only some modules of the chip are, at the present time, simulated and laid out, the rest is being implemented. A detailed description of the chip' modules is given.
  • Item
    Computation of Higher Order Illumination with a Non-Deterministic Approach
    (Blackwell Science Ltd and the Eurographics Association, 1996) Bouatouch, Kadi; Pattanaik, S. N.; Zeghers, Eric
    In spite of the number of efforts made by the computer graphics researchers, till today the computation of view-independent global illumination in an environment containing non-diffusely reflecting objects is a non-resolved problem. In general, non-deterministic techniques seem to be capable of solving this problem. In this article we propose one such non-deterministic method which will permit such calculation by using a combined technique of higher order function approximation and particle tracing. We have used multi-wavelets as basis functions and have calculated the illumination function approximation coefficients by exploiting the adjointness between the radiance equation and the potential equation.
  • Item
    Theoretical Developments on Polygonal Approximation of Parametric Surfaces for Ray Tracing
    (Blackwell Publishing Ltd and the Eurographics Association, 1988) Bouatouch, Kadi
    Some theoretical extensions are brought to Koparkar and Mudur s method which deals with a polygonal approximation of parametric surfaces using potential extrema. The proposed extensions allow the determination of both the existence and the equation of a curve solution of potential extrema. Solutions are given to solve the crack problem and to avoid the artificats due to an inexact ray-surface intersection point near the silhouette or on the higher curvature regions. Moreover, two methods of ray tracing surfaces are proposed.
  • Item
    Low Sampling Densities using a psychovisual approach
    (Eurographics Association, 1991) Bouville, Christian; Tellier, Pierre; Bouatouch, Kadi
    It has long been observed that the keenness of sight is lower for diagonal directions than for horizontal or vertical ones. This anisotropy of the human eye response can be exploited by using a non-orthogonal sampling pattern with a reduced sampling density. After an introduction to the two-dimensional sampling theory, it is shown that quincunx sampling is well suited to this characteristic. Then a sampling scheme based on this approach is described. This effectively leads to halving the sampling density and thereby the computing time of ray-traced pictures.