• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.5
• /
• pp.286-299
• /
• 2006

Due to the continuing technical progress in the capabilities of modeling, simulation, and sensor devices, huge volume data with very high resolution are common. In scientific visualization, various interactive real-time techniques on high performance parallel computers to effectively render such large scale volume data sets have been proposed. In this paper, we present a mobile volume visualization system that consists of mobile clients, gateways, and parallel rendering servers. The mobile clients allow to explore the regions of interests adaptively in higher resolution level as well as specify rendering / viewing parameters interactively which are sent to parallel rendering server. The gateways play a role in managing requests / responses between mobile clients and parallel rendering servers for stable services. The parallel rendering servers visualize the specified sub-volume with rendering contexts from clients and then transfer the high quality final images back. This proposed system lets multi-users with PDA simultaneously share commonly interesting parts of huge volume, rendering contexts, and final images through CSCW(Computer Supported Cooperative Work) mode.

• Journal of the Korea Computer Graphics Society
• /
• v.21 no.3
• /
• pp.27-35
• /
• 2015

This study presents a volume rendering method using ambient occlusion which is one of global illumination methods. By considering the volume density distribution as normal distribution, ambient occlusion can be calculated at real-time speed regardless of modification of opacity transfer function. We calculate and store the averages and standard deviations of densities in a block centered at each voxel in pre-processing time. In rendering process, we determine the illumination value by estimating the nearby opacity. We generalized theoretical model and generated better quality images improving our previous research. In detail, various shapes of transfer function can be used due to the proposed equation model. Moreover, we introduced a multi-range model to give nearer objects more weight. As the result, more realistic volume rendering image can be generated at real-time speed by mixing local and ambient occlusion shading.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.673-675
• /
• 2005

본 논문은 3차원 텍스쳐 기반의 볼륨 가시화를 위한 GPU 대역폭에 효과적인 렌더링 기법을 제안한다. 전처리 과정에서 옥트리를 이용하여 원본 볼륨 데이터를 계층적으로 균일한 크기로 분할하여 실제 영역만을 효과적으로 검출하게 되고, 렌더링 시에는 가시순서에 따라 옥트리를 탐색하며 리프 노드의 각 부볼륨을 텍스쳐 매핑 유닛에서 처리하고 블렌딩 유닛에서 이를 합성한다. 작은 크기($16^3$ 또는 $32^3$)의 부볼륨 처리는 텍스쳐와 픽셀 캐시의 이용율을 높이고 공백 공간 생략을 가용하게 하여 GPU의 메모리 대역폭을 크게 줄여 렌더링을 가속할 수 있다. 제안하는 기법의 캐시 효율, 메모리 트래픽, 렌더링 시간 등 다양한 실험 결과와 성능분석이 제공된다. 실험 결과는 제안하는 기 법이 전통적인 렌더링 방법에 비해 평균 11배의 대역폭 감소와 3배 빠른 렌더링을 가능하게 하여 GPU를 이용한 볼륨 렌더링에 효과적인 방법임을 보여주었다.

• Journal of Biomedical Engineering Research
• /
• v.21 no.5
• /
• pp.519-526
• /
• 2000

볼륨 렌더링은 3D 의료영상 데이터를 가시화하는 중용한 기법 중 하나이다. 그러나 볼륨 렌더링을 실시간으로 이룰 때, 많은 계산량을 필요로하는 것이 볼률 렌더링을 사용하는데 걸림돌이 되고 있다. 이 논문에서는 Superscalar와 VLIM(Very Long Instruction Word)의 구조를 가지고 있어 동시에 8개의 명령어 수행이 가능한 TI사의 TMS320C6201 DSP를 이용하여 3D 초음파 영상의 쉬어-웝 볼륨 렌더링을 구현하였다. 쉬어-웝 방법을 DSP 상에서 최적으로 구현하기 위하여 ray map 방법, one-to-four ray casting, ？디 skipping 방법을 제안하였다. 제안한 방법들을 이용한 볼륨 렌더링과 적용하지 않은 기존의 알고리즘을 DSP에 구현하여 PSNR과 렌더링 시간의 비교·평가를 통해 만족할 만한 영상 화질에 빠른 렌더링 성능을 얻을 수 있음을 보여주었다.

• Journal of Korea Multimedia Society
• /
• v.15 no.5
• /
• pp.624-631
• /
• 2012

For many medical imaging systems, volume datasets are stored as a compressed form, so that the dataset has to be decompressed before it is visualized. Since the decompression process takes quite a long time, we present an acceleration method for medical volume decompression using GPU. Our method supports that both lossy and lossless compression and progressive refinement is possible to satisfy variable user requirements. Moreover, our decompression method is well parallelized for GPU so that the decompression takes a very short time. Finally, we designed that the decompression and volume rendering work in one framework so that the selective decompression is available. As a result, we gained additional improvement in volume decompression.

• Journal of the Korea Computer Graphics Society
• /
• v.8 no.1
• /
• pp.1-11
• /
• 2002

In order to widely use volume rendering technology in practical fields, a user should be able to control the classification parameter interactively and extract a meaningful information easily from the 3D data as fast as it can be. Previous work on an accelerating volume rendering reconstructs an isotropic volume from an anisotropic one and classifies in pre-processing time and then renders the classified volume rapidly in run time. But, this traditional step may result in long pre-processing time and no real-time feedback. In this paper, we present an efficient classification and rendering method that allows a user to set the opacity transfer function interactively at rendering time on a personal computer without special-purpose hardware.

• Journal of the Korea Computer Graphics Society
• /
• v.23 no.3
• /
• pp.87-94
• /
• 2017

Due to improvements in the capabilities of commercial game engines, there are increasing instances of applying game engines to scientific visualization applications. This study describes a case of creating a virtual reality application that visualizes medical volume data based on the Unity3D game engine. When using a game engine, there is an advantage that various functions required for an application are basically provided, such as depth sorting of translucent objects or virtual reality hardware support. On the other hand, there is a restriction that the structure of the application program should be modified to suit the characteristics of the game engine. This paper describes a method for visualizing medical volume data using the structure of a game engine. As a result, we were able to create a virtual reality scene that consisted of surface data and medical volume data fragments together. And we confirmed the possibility of game engine as a future medical simulation production tool.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.6
• /
• pp.646-661
• /
• 2003

It is not easy that we visualize the large volume data stored in the every client computers of the web environment. One solution is as follows. First we compress volume data, second store that in the database server, third transfer that to client computer, fourth visualize that with direct-volume-rendering in the client computer. In this case, we usually use wavelet transform for compressing large data. This paper reports the experiments for acquiring the wavelet bases and the compression ratios fit for the above processing paradigm. In this experiments, we compress the volume data Engine, CThead, Bentum into 50%, 10%, 5%, 1%, 0.1%, 0.03% of the total data respectively using Harr, Daubechies4, Daubechies12 and Daubechies20 wavelets, then visualize that with direct-volume-rendering, afterwards evaluate the images with eyes and image comparison metrics. When compression ratio being low the performance of Harr wavelet is better than the performance of the other wavelets, when compression ratio being high the performance of Daubechies4 and Daubechies12 is better than the performance of the other wavelets. When measuring with eyes the good compression ratio is about 1% of all the data, when measuring with image comparison metrics, the good compression ratio is about 5-10% of all the data.

• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.2
• /
• pp.23-31
• /
• 2004

This paper focuses on a boundary surface based ray casting. In general the boundary surface based ray casting is processed in two stages. The first stage finds boundary surfaces and stores them into buffers. The second stage calculates a distance from a viewpoint to the voxels of the interested area by projecting boundary surfaces on the view plane, and then starts to traverse a volume data space with the distance. Our approach differs from the general boundary surface based ray casting in processing the first stage of it. Contrast to the typical boundary surface based ray casting where all boundary surfaces of volume data are stored into buffers, they are projected on the planes aligned to the axis of volume data coordinates and these projected data are stored into 6 buffers. Such maneuver shortens time for ray casting, and reduces memory usage because it can be carried out independently from the amount of the volume data.

• The KIPS Transactions:PartA
• /
• v.9A no.1
• /
• pp.83-92
• /
• 2002

The segmentation of target objects from three dimensional volume images is an essential step for visualization and volume measurement. In this paper, we present a method to detect the surface of objects by improving the widely used levoy filtering for volume visualization. Using morphological operators we generate completely closed surfaces and selectively segment objects using the volume growing algorithm. The presented method was applied to 3-D artificial sphere images and angiocardiograms. We quantitatively compared this method with the conventional levoy filtering using artificial sphereimages, and the results showed that our method is better in the aspect of voxel errors. The results of visual comparison using angiocardiograms also showed that our method is more accurate. The presented method in this paper is very effective for segmentation of volume data because segmentation, visualization and measurement are frequently used together for 3-D image processing and they can be easily related in our method.