• 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 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 KIISE:Software and Applications
• /
• v.31 no.7
• /
• pp.922-928
• /
• 2004

We propose a new 3 dimensional labeling method based on slice information for the volume data. This method is named SIL (Slice Information based Labeling). Compare to the conventional algorithms, it has advantages that the use of memory is efficient and it Is possible to combine with a variety of 2 dimensional labeling algorithms for finding an appropriate labeling algorithm to its application. In this study, we applied SIL to confocal microscopy images of cervix cancer cell and compared the results of labeling. According to the measurement, we found that the speed of Sd combined with, CCCL (Contour based Connected Component Labeling) is almost 2 times higher than that of other methods. In conclusion, considering that the performance of labeling depends on a kind of image, we obtained that the proposed method provide better result for the confocal microscopy cell volume data.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.1_2
• /
• pp.1-14
• /
• 2006

Sort-last parallel rendering using a cluster of GPUs has been widely used as an efficient method for visualizing large- scale volume datasets. The performance of this method is constrained by load balancing when data parallelism is included. In previous works static partitioning could lead to self-balance when only task level parallelism is included. In this paper, we present a load balancing scheme that adapts to the characteristic of volume dataset when data parallelism is also employed. We effectively combine the hierarchical data structures (octree and BSP tree) in order to skip empty regions and distribute workload to corresponding rendering nodes. Moreover, we also exploit a 3D clustering method to determine visibility order and save the AGP bandwidths on each rendering node. Experimental results show that our scheme can achieve significant performance gains compared with traditional static load distribution schemes.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.6
• /
• pp.705-716
• /
• 2002

This paper proposes a method which visualizes MRI head data in 3 dimensions with direct volume rendering. Though surface rendering is usually used for MRI data visualization, it has some limits of displaying little speckles because it loses the information of the speckles in the surfaces while acquiring the information. Direct volume rendering has ability of displaying little speckles, but it doesn't treat MRI data because of the data features of MRI. In this paper, we try to visualize MRI head data in 3 dimensions as follows. First, we separate the brain region from the head region of MRI head data, next increase the pixel level of the brain region, then combine the brain region with the increased pixel level and the head region without brain region, last visualizes the combined MRI head data with direct volume rendering. We segment the brain region from head region based on histogram threshold, morphology operations and snakes algorithm. The proposed segmentation method shows 91~95% similarity with a hand segmentation. The method rather clearly visualizes the organs of the head in 3 dimensions.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.9
• /
• pp.457-464
• /
• 2005

In this paper a 3D memory system that allows 17 access types at an arbitrary position is introduced. The proposed memory system is based on two main functions: memory module assignment function and address assignment function. Based on them, the memory system supports 17 access types: 13 Lines, 3 Rectangles, and 1 Hexahedron. That is, the memory system allows simultaneous access to multiple data in any access types at an arbitrary position with a constant interval. In order to allow 17 access types the memory system consists of memory module selection circuitry, data routing circuitry for READ/WRITE, and address calculation/routing circuitry In the point of view of a developer and a programmer, the memory system proposed in this paper supports easy hardware extension according to the applications and both of them to deal with it as a logical three-dimensional away In addition, multiple data in various across types can be simultaneously accessed with a constant interval. Therefore, the memory system is suitable for building systems related to ,3D applications (e.g. volume rendering and volume clipping) and a frame buffer for multi-resolution.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.6
• /
• pp.679-691
• /
• 2002

Volume visualization is an important subarea of scientific visualization, and is concerned with techniques that are effectively used in generating meaningful and visual information from abstract and complex volume datasets, defined in three- or higher-dimensional space. It has been increasingly important in various fields including meteorology, medical science, and computational fluid dynamics, and so on. On the other hand, virtual reality is a research field focusing on various techniques that aid gaining experiences in virtual worlds with visual, auditory and tactile senses. In this paper, we have developed a visualization system for CAVE, an immersive 3D virtual environment system, which generates stereoscopic images from huge human volume datasets in real-time using an improved volume visualization technique. In order to complement the 3D texture-mapping based volume rendering methods, that easily slow down as data sizes increase, our system utilizes an image-based rendering technique to guarantee real-time performance. The system has been designed to offer a variety of user interface functionality for effective visualization. In this article, we present detailed description on our real-time stereoscopic visualization system, and show how the Visible Korean Human dataset is effectively visualized on CAVE.

• 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 KIISE:Software and Applications
• /
• v.32 no.1
• /
• pp.41-49
• /
• 2005

In this Paper, we Propose an automatic lung registration technique using local distance propagation for correcting the difference between two temporal images by a patient's movement in abdomen CT image obtained from the same patient to be taken at different time. The proposed method is composed of three steps. First, lung boundaries of two temporal volumes are extracted, and optimal bounding volumes including a lung are initially registered. Second, 3D distance map is generated from lung boundaries in the initially taken volume data by local distance propagation. Third, two images are registered where the distance between two surfaces is minimized by selective distance measure. In the experiment, we evaluate a speed and robustness using three patients' data by comparing chamfer-matching registration. Our proposed method shows that two volumes can be registered at optimal location rapidly. and robustly using selective distance measure on locally propagated 3D distance map.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.499-501
• /
• 2000

음함수 곡면 모델의 대표적인 구조 요소인 메타볼은 다양한 형태의 곡면을 모델링하는데 뛰어난 성능을 갖는다[1]. 그러나 복잡한 형태의 물체는 곡면 뿐 아니라 평면적인 요소를 포함하기 때문에 메타볼만으로 부정형 물체를 모델링하는 데에는 많은 어려움이 따른다. 메타큐브는 메타볼의 장점을 수용하면서 적은 수의 데이터로 평면 형태의 물체가지 모델링할 수 있는 메타볼의 확장 형태로서, 두 개의 매개변수만으로 구에서 정육면체까지 자유로운 확장이 가능하다[2]. 본 논문은 메타큐브를 이용하여 볼륨 데이터로부터 3차원 물체를 자동 모델링하는 방법을 제안한다. 제안 방법은 볼륨 데이터의 형태에 기반하여 분할된 볼륨 트리를 이용하여 비교적 빠른 시간에 볼륨 데이터로부터 비슷한 형태의 3차원 물체를 재구성하는 메타큐브 집합을 추출한다. 다양한 볼륨데이타에 대한 실험 결과를 제시함으로써 제안 방법의 효용성을 증명한다.