• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1081-1089
• /
• 1999

Volume data modeling is concerned with finding a mathematical function which represents the relationship implied by the 3D data. Modeling a volume data geometrically can visualize a volume data using surface graphics without voxelization. It has many merits in that it is fast and requires little memory. We proposes, a method based on wavelet transformation and tetrahedrization. we implement a prototype system based on the proposed method. Last, we evaluated the proposed method comparing it with marching cube algorithm. the evaluation results show that though the proposed method uses only 13% of the volume data, the images generated is as good as the images generated by the marching cubes algorithm.

• Annual Conference of KIPS
• /
• 2005.05a
• /
• pp.1623-1626
• /
• 2005

초음파 영상 기법은 장기, 연조직, 혈류를 검사하는데 쓰이는 영상 진단법이다. 초음파 장비를 통해 얻어진 초음파 볼륨 데이터는 장비 특성상 많은 잡음(speckle noise)을 포함하기 때문에, 깨끗한 영상을 얻기 위해서는 잡음 필터링(noise filtering)이 필요하다. 그런데, 볼륨 데이터 모든 영역에 대해 잡음 필터링을 적용할 경우 전처리 시간이 길어져 실시간으로 초음파 볼륨 데이터를 렌더링하기 어렵다. 본 논문에서는 실시간으로 입력되는 초음파 볼륨 데이터를 가시화 하기위하여 전처리 시간 없이 잡음을 제거하는 방법을 제안한다. 전처리 시간에 전체 볼륨 데이터에 대해 잡음 필터링을 적용하지 않고, 영상을 생성하는 동안 참조되는 복셀(voxel)에 대해서만 잡음 필터를 적용하여 얻은 값을 사용한다. 이때 필터링에 소요되는 시간을 최소화하기 위해 가장 단순한 평균화 필터를 사용한다. 그리고 복셀에 적용되는 3차원 필터를 3단계의 1차원 필터 연산 단계로 분할 한 후, 각 단계별 연산을 거친 복셀들에 대해서는 다시 연산을 하지 않도록 하여 중복을 피한다. 이를 통해 전처리 시간 없이 기존 방법과 동일한 화질을 유지하는 최종 영상을 만들어 낸다.

• The KIPS Transactions:PartA
• /
• v.10A no.2
• /
• pp.157-164
• /
• 2003

Volume graphics have received a lot of attention as a medical image analysis tool nowadays. In the visualization based on volume graphics, there is a process called voxelization which transforms the geometrically defined objects into the volumetric objects. It enables us to volume render the geometrically defined data with sampling data. This paper suggests a voxeliration method using the cutting surfaces of cubes, implements the method on a PC, and evaluates it with simple geometric modeling data to explore propriety of the method. This method features the ability of calculating the exact normal vector from a voxel, having no hole among voxels, having multi-resolution representation.

• 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 the Korea Society for Simulation
• /
• v.16 no.3
• /
• pp.57-63
• /
• 2007

In real time rendering of fetus the empty space leaping while traversing a ray is most frequently used accelerating technique. The main idea is to skip empty voxel samples which do not contribute the result image and it speeds up the rendering time by avoiding sampling data while traversing a ray in the empty region, saving a substantial number of interpolations. Calculating the distance from the nearest object boundary for every yokel can reduce the sampling operation. Among widely-well-known distance maps, those estimates the true distance, such as euclidean distance, takes a long time to compute because of the complicated floating-point operations, and others which uses approximated distance functions, such as city-block and chessboard, provides faster computation time but sampling error may can occur. In this paper, therefore, we analyze the characteristics of several distance maps and compare the number of samples and rendering time. And we aim to suggest the most appropriate distance map for rendering of fetus in ultrasound image.

• Journal of the Korea Computer Graphics Society
• /
• v.29 no.3
• /
• pp.105-115
• /
• 2023

In this paper, we describe the process and method of converting tens of TB of time-varying AMR (adaptive mesh refinement) volume data generated as a result of numerical model simulation into optimized data that can be used for various XR devices. AMR volume data is a useful data format for complex modeling and simulation, and it can efficiently express materials such as star clusters and gases that exist in the very wide outer space used in this study. we analyzes the metadata of AMR data, samples it at low resolution, optimizes information in important areas, and converts it into a data set that can be used even on relatively low performance XR devices. Finally, we introduces how the optimized data was utilized and visualized through the development of immersive XR content using the data set.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.5
• /
• pp.457-467
• /
• 2000

본 논문에서는 분산 메모리 구조를 갖는 병렬 컴퓨터 상에서 방대한 크기를 갖는 볼륨 데이터의 효과적인 가시화를 위한 병렬 광선 투사법을 제안한다. 데이터의 압축을 기반으로 하는 본 기법은 다른 프로세서의 메모리로부터 데이터를 읽기보다는 자신의 지역 메모리에 존재하는 압축된 데이터를 빠르게 복원함으로써 병렬 렌더링 성능을 향상시키는 것을 목표로 한다. 본 기법은 객체-순서와 영상-순서 탐색 알고리즘 모두의 정점을 이용하여 성능을 향상시켰다. 즉, 블록 단위의 최대-최소 팔진트리의 탐색과 각 픽셀의 불투명도 값을 동적으로 유지하는 실시간 사진트리를 응용함으로써 객체-공간과 영상-공간 각각의 응집성을 이용하였다. 본 논문에서 제안하는 압축 기반 병렬 볼륨 렌더링 방법은 렌더링 수행 중 발생하는 프로세서간의 통신을 최소화하도록 구현되었는데, 이러한 특징은 프로세서 사이의 상당히 높은 데이터 통신 비용을 감수하여야 하는 PC 및 워크스테이션의 클러스터와 같은 더욱 실용적인 분산 환경에서 매우 유용하다. 본 논문에서는 Cray T3E 병렬 컴퓨터 상에서 Visible Man 데이터를 이용하여 실험을 수행하였다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.01a
• /
• pp.361-364
• /
• 2023

볼륨 렌더링은 3D 밀도 데이터를 가시화 할 때 활용되는 기술로써 이 알고리즘에서 중요한 것은 렌더링 시간 단축이며, 본 논문에서는 이 계산시간을 효율적으로 개선시킬 수 있는 방법을 제시한다. 렌더링의 처리시간은 탐색하는 횟수에 따라 결과 차이가 발생하지만, 탐색 횟수가 적을 경우 렌더링의 품질이 저하되고 반대인 경우에는 화질의 표현력은 높으나 많은 처리시간이 소요된다. 따라서 화질이 떨어지지 않는 최소의 탐색 방법이 요구되므로 본 논문에서는 밀도의 탐색 최적화와 시간별 밀도가 존재하는 위치를 예측하여 계산을 효율적으로 처리 할 수 있는 PyCUDA 프레임워크에 대해서 소개한다.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.15 no.5
• /
• pp.75-83
• /
• 2019

Direct volume rendering is a widely used method for visualizing three-dimensional volume data such as medical images. This paper proposes a method for applying depth-of-field effects to volume ray-casting to enable more realistic depth-of-filed rendering in direct volume rendering. The proposed method exploits a camera model based on the human perceptual model and can obtain realistic images with a limited number of rays using jittered lens sampling. It also enables interactive exploration of volume data by on-the-fly calculating depth-of-field in the GPU pipeline without preprocessing. In the experiment with various data including medical images, we demonstrated that depth-of-field images with better depth perception were generated 2.6 to 4 times faster than the conventional method.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.225-231
• /
• 2009

This paper describes a new algorithm to compute and track the deformation of an isosurface component defined in a time-varying volumetric data. Isosurface visualization is one of the most common method for effective visualization of volumetric data. However, most isosurface visualization algorithms have been developed for static volumetric data. As imaging and simulation techniques are developed, large time-varying volumetric data are increasingly generated. Hence, development of time-varying isosurface visualization that utilizes dynamic properties of time-varying data becomes necessary. First, we define temporal correspondence between isosurface components of two consecutive timesteps. Based on the definition, we perform an algorithm that tracks the deformation of an isosurface component that can be selected using the Contour Tree. By repeating this process for entire timesteps, we can effectively visualize the time-varying data by displaying the dynamic deformation of the selected isosurface component.