• Journal of KIISE
• /
• v.43 no.3
• /
• pp.304-313
• /
• 2016

We present a novel memory-efficient parallel ray casting algorithm for unstructured grid volume rendering on multi-core CPUs. Our method is based on the Bunyk ray casting algorithm. To solve the high memory overhead problem of the Bunyk algorithm, we allocate a fixed size local buffer for each thread and the local buffers contain information of recently visited faces. The stored information is used by other rays or replaced by other face's information. To improve the utilization of local buffers, we propose an image-plane based ray grouping algorithm that makes ray groups have high coherency. The ray groups are then distributed to computing threads and each thread processes the given groups independently. We also propose a novel hash function that uses the index of faces as keys for calculating the buffer index each face will use to store the information. To see the benefits of our method, we applied it to three unstructured grid datasets with different sizes and measured the performance. We found that our method requires just 6% of the memory space compared with the Bunyk algorithm for storing face information. Also it shows compatible performance with the Bunyk algorithm even though it uses less memory. In addition, our method achieves up to 22% higher performance for a large-scale unstructured grid dataset with less memory than Bunyk algorithm. These results show the robustness and efficiency of our method and it demonstrates that our method is suitable to volume rendering for a large-scale unstructured grid dataset.

• Journal of Korea Society of Industrial Information Systems
• /
• v.25 no.5
• /
• pp.1-11
• /
• 2020

Image-based virtual try-on (VTON) is becoming popular for online apparel shopping, mainly because of not requiring 3D information for try-on clothes and target humans. However, existing 2D algorithms, even when utilizing advanced non-rigid deformation algorithms, cannot handle large spatial transformations for complex target human poses. In this study, we propose a 3D clothing reconstruction method using a 3D human body model. The resulting 3D models of try-on clothes can be more easily deformed when applied to rest posed standard human models. Then, the poses and shapes of 3D clothing models can be transferred to the target human models estimated from 2D images. Finally, the deformed clothing models can be rendered and blended with target human representations. Experimental results with the VITON dataset used in the previous works show that the shapes of reconstructed clothing are significantly more natural, compared to the 2D image-based deformation results when human poses and shapes are estimated accurately.

• Journal of Korea Game Society
• /
• v.9 no.5
• /
• pp.137-144
• /
• 2009

This paper predicts 6 facial regions that may have sharply different scattering properties, rendering the face more realistically based on their diffusion profiles. The scattering properties are acquired in the form of high dynamic range by photographing the pattern formed around an unit ray incident on facial skin. The acquired data are fitted to a 'linear combination of Gaussian functions', which well approximates the original diffusion profile of skin and has good characteristics as the filter. During the process, to prevent its solutions from converging into local minima, we take advantage of the genetic algorithm to set up the initial value. Each Gaussian term is applied to the irradiance map as a filter, expressing subsurface scattering effect. In this paper, to efficiently handle the maximum 12 Gaussian filterings, we make use of the parallel capacity of CUDA.

• Journal of Korea Multimedia Society
• /
• v.14 no.10
• /
• pp.1229-1237
• /
• 2011

The volume ray-casting method is one of the direct volume rendering methods that produces high-quality images as well as manipulates semi-transparent object. Although the volume ray-casting method produces high-quality image by sampling in the region of interest, its rendering speed is slow since the color acquisition process is complicated for repetitive memory reference and accumulation of sample values. Recently, the GPU-based acceleration techniques are introduced. However, they require pre-processing or additional memory. In this paper, we propose efficient point-primitive based method to overcome complicated computation of GPU ray-casting. It presents semi-transparent objects, however it does not require preprocessing and additional memory. Our method is fast since it generates point-primitives from volume dataset during sampling process and it projects the primitives onto the image plane. Also, our method can easily cope with OTF change because we can add or delete point-primitive in real-time.

• The Magazine of the IEIE
• /
• v.25 no.2
• /
• pp.40-47
• /
• 1998

본 원고에서 우리는 컴퓨터 그래픽스를 이용하여 가상세계 구축에 필요한 3차원 모델들을 제작하거나 애니메이션을 만드는 방법들 중에서, 사진이나 그림으로부터 비교적 손쉽게 모델을 구축하는 기술들을 분석하고 앞으로의 발전 방향에 대하여 전망하고자 한다. 이러한 기술들은 최근 들어 그 기술개발이 이루어지고 있는 분야이며 미술가가 모델링 작업에서 직접적인 역할을 담당할 수 있는 길을 열어가고 있다는 점에서 커다란 의미가 있다고 하겠다. 이러한 방법들의 핵심기술은 어떠한 것들인지를 분석해보기로 한다.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1640-1651
• /
• 2009

In this paper we introduce a new approach to stroke based rendering using brush stroke profile. Our proposed method, based on image retrieval method, is a simple but flexible and scalable method to create various painting styles, for which scalable database constructed with the collection of real stroke data is used. Input image is reproduced with combinations of brush stoke in the database, when a search process to determinate appropriate brush stroke and a judgment process to decide whether to draw the retrieved brush stroke on the canvas or not are presented. In addition, this paper suggests a new brush stroke model and a depiction technique in order to utilize effective height information which allows natural texture depiction, or good visual effect, without carrying out physical simulation. Our method is able to create diverse variations of painting by controling various user parameters. It also provides scalable framework that can produce various painting styles with different artistic media by changing the stroke combinations of stroke database.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.8
• /
• pp.1442-1449
• /
• 2007

Shadows are important elements for realistic rendering of the 3D scene. We cannot recognize the distance of objects in the 3D scene without shadows. Two methods, image-based medthods and object-based methods, are largely used for the rendering of shadows. Object based methods can generate accurate shadow boundaries. However, it cannot be used to generate the realtime shadows because the time complexity defends on the complexity of the 3D scene. Image based methods which are techniques to generate shadows are widely used because of fast calculation time. However, this algorithm has aliasing problems. PCF is a method to solve the aliasing problem. Using PCF technique, antialiased shadow boundaries can be generated. However, PCF with large filter size requires more time to calculate antialiased shadow boundaries. This paper proposes an improved PCF technique which generates antialiased shadow boundaries similar to that of PCF. Compared with PCF, this technique can generate antialiased shadows in less time.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1285-1295
• /
• 1999

본 논문은 방대한 크기의 볼륨 데이타를 효율적으로 렌더링하기 위한 셀 기반 웨이브릿 압축 방법을 제시한다. 이 방법은 볼륨을 작은 크기의 셀로 나누고, 셀 단위로 웨이브릿 변환을 한 다음 복원 순서에 따른 런-길이(run-length) 인코딩을 수행하여 높은 압축율과 빠른 복원을 제공한다. 또한 최근 복원 정보를 캐쉬 자료 구조에 효율적으로 저장하여 복원 시간을 단축시키고, 에러 임계치의 정규화로 비정규화된 웨이브릿 압축보다 빠른 속도로 정규화된 압축과 같은 고화질의 이미지를 생성하였다. 본 연구의 성능을 평가하기 위하여 {{}} 해상도의 볼륨 데이타를 압축하여 쉬어-？ 분해(shear-warp factorization) 알고리즘에 적용한 결과, 손상이 거의 없는 상태로 약 27:1의 압축율이 얻어졌고, 약 3초의 렌더링 시간이 걸렸다.Abstract This paper presents an efficient cell-based wavelet compression method of large volume data. Volume data is divided into individual cell of {{}} voxels, and then wavelet transform is applied to each cell. The transformed cell is run-length encoded according to the reconstruction order resulting in a fairly good compression ratio and fast reconstruction. A cache structure is used to speed up the process of reconstruction and a threshold normalization scheme is presented to produce a higher quality rendered image. We have combined our compression method with shear-warp factorization, which is an accelerated volume rendering algorithm. Experimental results show the space requirement to be about 27:1 and the rendering time to be about 3 seconds for {{}} data sets while preserving the quality of an image as like as using original data.

• Journal of the Korea Computer Graphics Society
• /
• v.6 no.4
• /
• pp.1-7
• /
• 2000

Traditionally, three dimension model s have been used for building virtual worlds, and a data structure called the "scene graph" is often employed to organize these 3D objects in the virtual space. On the other hand, image-based rendering has recently been suggested as a probable alternative VR platform for its photo-realism, however, due to limited interactivity. it has only been used for simple navigation systems. To combine the merits of these two approaches to object/scene representations, this paper proposes for a scene graph structure in which both 3D models and various image-based scenes/objects can be defined. traversed, and rendered together. In fact, as suggested by Shade et al. [1]. these different representations can be used as different LOD's for a given object. For in stance, an object might be rendered using a 3D model at close range, a billboard at an intermediate range. and as part of an environment map at far range. The ultimate objective of this mixed platform is to breath more interactivity into the image based rendered VE's by employing 3D models as well. There are several technical challenges in devising such a platform : designing scene graph nodes for various types of image based techniques, establishing criteria for LOD/representation selection. handling their transition s. implementing appropriate interaction schemes. and correctly rendering the overall scene. Currently, we have extended the scene graph structure of the Sense8's WorldToolKit. to accommodate new node types for environment maps. billboards, moving textures and sprites, "Tour-into-the-Picture" structure, and view interpolated objects. As for choosing the right LOD level, the usual viewing distance and image space criteria are used, however, the switching between the image and 3D model occurs at a distance from the user where the user starts to perceive the object's internal depth. Also. during interaction, regardless of the viewing distance. a 3D representation would be used, if it exists. Finally. we carried out experiments to verify the theoretical derivation of the switching rule and obtained positive results.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.3
• /
• pp.51-57
• /
• 2021

In this paper, we propose a method to find the DoF(Depth of field) that is blurred in an image by focusing and out-focusing the camera through a efficient convolutional neural network. Our approach uses the RGB channel-based cross-correlation filter to efficiently classify the DoF region from the image and build data for learning in the convolutional neural network. A data pair of the training data is established between the image and the DoF weighted map. Data used for learning uses DoF weight maps extracted by cross-correlation filters, and uses the result of applying the smoothing process to increase the convergence rate in the network learning stage. The DoF weighted image obtained as the test result stably finds the DoF region in the input image. As a result, the proposed method can be used in various places such as NPR(Non-photorealistic rendering) rendering and object detection by using the DoF area as the user's ROI(Region of interest).