The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] relighting(4hit)

1-4hit
  • Dense Light Transport for Relighting Computation Using Orthogonal Illumination Based on Walsh-Hadamard Matrix

    Isao MIYAGAWA  Yukinobu TANIGUCHI  

     
    PAPER

      Pubricized:
    2016/01/28
      Vol:
    E99-D No:4
      Page(s):
    1038-1051

    We propose a practical method that acquires dense light transports from unknown 3D objects by employing orthogonal illumination based on a Walsh-Hadamard matrix for relighting computation. We assume the presence of color crosstalk, which represents color mixing between projector pixels and camera pixels, and then describe the light transport matrix by using sets of the orthogonal illumination and the corresponding camera response. Our method handles not only direct reflection light but also global light radiated from the entire environment. Tests of the proposed method using real images show that orthogonal illumination is an effective way of acquiring accurate light transports from various 3D objects. We demonstrate a relighting test based on acquired light transports and confirm that our method outputs excellent relighting images that compare favorably with the actual images observed by the system.

  • A New Face Relighting Method Based on Edge-Preserving Filter

    Lingyu LIANG  Lianwen JIN  

     
    LETTER-Computer Graphics

      Vol:
    E96-D No:12
      Page(s):
    2904-2907

    We propose a new face relighting method using an illuminance template generated from a single reference portrait. First, the reference is wrapped according to the shape of the target. Second, we employ a new spatially variant edge-preserving smoothing filter to remove the facial identity and texture details of the wrapped reference, and obtain the illumination template. Finally, we relight the target with the template in CIELAB color space. Experiments show the effectiveness of our method for both grayscale and color faces taken from different databases, and the comparisons with previous works demonstrate a better relighting effect produced by our method.

  • Clustering Environment Lights for an Efficient All-Frequency Relighting

    Henry JOHAN  Tomoyuki NISHITA  

     
    PAPER-Computer Graphics

      Vol:
    E89-D No:9
      Page(s):
    2562-2571

    We present a novel precomputed radiance transfer method for efficient relighting under all-frequency environment illumination. Environment illumination is represented as a set of environment lights. Each environment light comprises a direction and an intensity. In a preprocessing step, the environment lights are clustered into several clusters, taking into account only the light directions. By experiment, we confirmed that the environment lights can be clustered into a much smaller number of clusters than their original number. Given any environment illumination, sampled as an environment map, an efficient relighting is then achieved by computing the radiance using the precomputed clusters. The proposed method enables relighting under very high-resolution environment illumination. In addition, unlike previous approaches, the proposed method can efficiently perform relighting when some regions of the given environment illumination change.

  • A RLS Based PCA for Compressing Relighting Data Sets

    Chi-Sing LEUNG  Gary HO  Kwok-Hung CHOY  Tien-Tsin WONG  Ze WANG  

     
    PAPER-Image/Visual Signal Processing

      Vol:
    E87-A No:8
      Page(s):
    1871-1878

    In image-based relighting (IBR), users are allowed to control the illumination condition of a scene or an object. A relighting data set (RDS) contains a large number of reference images captured under various directional light sources. This paper proposes a principal component analysis (PCA) based compression scheme that effectively reduces the data volume. Since the size of images is very large, a tiling recursive least square PCA (RLS-PCA) is used. The output of RLS-PCA is a set of eigenimages and the corresponding eigen coefficients. To further compress the data, extracted eigenimages are compressed using transform coding while extracted eigen coefficients are compressed using uniform quantization with entropy coding. Our simulation shows that the proposed approach is superior to compressing reference images with JPEG and MPEG2.