The search functionality is under construction.

Author Search Result

[Author] Henry JOHAN(2hit)

1-2hit
  • 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.

  • Interactive Region Matching for 2D Animation Coloring Based on Feature's Variation

    Pablo GARCIA TRIGO  Henry JOHAN  Takashi IMAGIRE  Tomoyuki NISHITA  

     
    PAPER-Image Recognition, Computer Vision

      Vol:
    E92-D No:6
      Page(s):
    1289-1295

    We propose an interactive method for assisting the coloring process of 2D hand-drawn animated cartoons. It segments input frames (each hand-drawn drawing of the cartoon) into regions (areas surrounded by closed lines. E.g. the head, the hands) extracts their features, and then matches the regions between frames, allowing the user to fix coloring mistakes interactively. Its main contribution consists in storing matched regions in lists called "chains" for tracking how the region features vary along the animation. Consequently, the matching rate is improved and the matching mistakes are reduced, thus reducing the total effort needed until having a correctly colored cartoon.