• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.2
• /
• pp.30-35
• /
• 2022

Rendering is widely used for visual effects in animations and movies. Although rendering is computing-intensive, we observe that it accompanies heavy I/O because of large input data. This becomes technical hurdles for multi-node rendering performed on public cloud nodes. To reduce the overhead of data transmission in multi-node rendering, this paper analyzes the characteristics of rendering workloads, and presents the cooperative caching scheme for multi-node rendering. Our caching scheme has the function of synchronization between original data in local storage and cached data in rendering nodes, and the cached data are shared between multiple rendering nodes. We perform measurement experiments in real system environments and show that the proposed cooperative caching scheme improves the conventional caching scheme used in the network file system by 27% on average.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.7
• /
• pp.629-638
• /
• 2000

The main difference between mono-volume rendering and multi-volume rendering is data intermixing. In this paper, we first propose a selective rendering method for fast visualizing specific volume according to the surface level and then present data intermixing method for multiple volumes. The selective rendering method is to generate distance transformed volume using a distance transform to determine the minimum distance to the nearest interesting part and then render it. The data intermixing method for multiple volumes is to combine several volumes using intensity weighted intermixing method, opacity weighted intermixing method, opacity weighted intermixing method with depth information and then render it. We show the results of selective rendering of left ventricle and right ventricle generated from EBCT cardiac images and of data intermixing for combining original volume and left ventricular volume or right ventricular volume. Our method offers a visualization technique of specific volume according to the surface level and an acceleration technique using a distance transformed volume and the effective visual output and relation of multiple images using three different intermixing methods in three-dimensional space.

• Journal of Korea Game Society
• /
• v.9 no.6
• /
• pp.171-178
• /
• 2009

Multiple layer displacement mapping methods are able to represent more complex and general geometries which cannot be presented by single layer displacement mapping methods, and provide a realistic scene to digital contents such as 3D games and movies with relatively low costs. However, as we use more layers for details, data space is wasted more because lower layers have less displacement data than higher layers. In this paper, we suggest a lossless compression and rendering method of a multiple layer displacement map. Since we compress the map without data loss, the proposed method provides the same quality as the rendering result that uses an original multiple layer displacement map.

• Journal of the HCI Society of Korea
• /
• v.4 no.2
• /
• pp.9-16
• /
• 2009

3D stereo display systems gain more interests recently. Multiple-view autostereoscopic display system enables observers to watch stereo image from multiple viewpoints not wearing specific devices such as shutter glasses or HMD. Therefore, the Multiple-view autostereoscopic display is being spotlighted in the field of virtual reality, mobile, 3D TV and so on. However, one of the critical disadvantages of the system is that observer can enjoy the system only in a small designated area where the system is designed to work properly. This research provides an effective way of GPU based rendering technique to present seamless 3D stereo experiences from an arbitrary observer's view position.

• Journal of Computational Design and Engineering
• /
• v.2 no.1
• /
• pp.1-15
• /
• 2015

Measured bidirectional reflectance distribution function (BRDF) data have been used to represent complex interaction between lights and surface materials for photorealistic rendering. However, their massive size makes it hard to adopt them in practical rendering applications. In this paper, we propose an adaptive method for B-spline volume representation of measured BRDF data. It basically performs approximate B-spline volume lofting, which decomposes the problem into three sub-problems of multiple B-spline curve fitting along u-, v-, and w-parametric directions. Especially, it makes the efficient use of knots in the multiple B-spline curve fitting and thereby accomplishes adaptive knot placement along each parametric direction of a resulting B-spline volume. The proposed method is quite useful to realize efficient data reduction while smoothing out the noises and keeping the overall features of BRDF data well. By applying the B-spline volume models of real materials for rendering, we show that the B-spline volume models are effective in preserving the features of material appearance and are suitable for representing BRDF data.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1655-1658
• /
• 2004

Current rendering processors are organized mainly to process a triangle as fast as possible and recently parallel 3D rendering processors, which can process multiple triangles in parallel with multiple rasterizers, begin to appear. For high performance in processing triangles, it is desirable for each rasterizer have its own local pixel cache. However, the consistency problem may occur in accessing the data at the same address simultaneously by more than one rasterizer. In this paper, we propose a parallel rendering processor architecture, called DAVID II, resolving such consistency problem effectively. Moreover, the proposed architecture reduces the latency due to a pixel cache miss significantly. The experimental results show that DAVID II achieves almost linear speedup at best case even in sixteen rasterizers.

• International Journal of Contents
• /
• v.5 no.4
• /
• pp.30-34
• /
• 2009

Many studies have been done on the integral imaging pickup whose objective is to get efficiently elemental images from a lens array with respect to three-dimensional (3D) objects. In the integral imaging pickup process, it is necessary to render an elemental image from each elemental lens in a lens array for 3D objects, and then to combine them into one total image. The multiple viewpoint rendering (MVR) is one of various methods for integral imaging pickup. This method, however, has the computing and rendering time problem for obtaining element images from a lot of elemental lens. In order to solve the problems, in this paper, we propose a parallel MVR (PMVR) method to generate elemental images in a parallel through distribution of elemental lenses into multiple threads simultaneously. As a result, the computation time of integral imaging using PMVR is reduced significantly rather than a sequential approach and then we showed that the PMVR is very useful.

• Journal of Korea Game Society
• /
• v.5 no.3
• /
• pp.39-47
• /
• 2005

Current rendering processors are organized mainly to process a triangle as fast as possible and recently parallel 3D rendering processors, which can process multiple triangles in parallel with multiple rasterizers, begin to appear. For high performance in processing triangles, it is desirable for each rasterizer have its own local pixel cache. However, the consistency problem may occur in accessing the data at the same address simulaneously by more than one rasterizer. In this paper, we propose a parallel rendering processor architecture resolving such consistency problem effectively. Moreover, the proposed architecture reduces the latency due to a pixel cache miss significantly. The experimental results show that proposed architecture achieves almost linear speedup at best case even in sixteen rasterizer

• The KIPS Transactions:PartA
• /
• v.13A no.4 s.101
• /
• pp.305-316
• /
• 2006

Current rendering processors are organized mainly to process a triangle as fast as possible and recently parallel 3D rendering processors, which can process multiple triangles in parallel with multiple rasterizers, begin to appear. For high performance in processing triangles, it is desirable for each rasterizer have its own local pixel cache. However, the consistency problem may occur in accessing the data at the same address simultaneously by more than one rasterizer. In this paper, we propose a parallel rendering processor architecture resolving such consistency problem effectively. Moreover, the proposed architecture reduces the latency due to a pixel cache miss significantly. For the above two goals, effective memory organizations including a new pixel cache architecture are presented. The experimental results show that the proposed architecture achieves almost linear speedup at best case even in sixteen rasterizers.

• Journal of the Korea Computer Graphics Society
• /
• v.8 no.2
• /
• pp.23-29
• /
• 2002

In this paper, we describe an implementation technique that extends the classification and shading capabilities offered by previously reported hardware-assisted volume rendering algorithms. In designing our rendering scheme, we exploited the programmable shader technology supported by the latest consumer PC graphics hardware. Our direct volume rendering technique enables to simultaneously display up to four materials, and to dynamically control gradient magnitude to emphasize or de-emphasize surface boundaries. It can easily create lighting effects such as light source attenuation, depth cueing, and multiple light sources that were often difficult to realize in previous hardware-assisted volume rendering.