• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06b
• /
• pp.268-270
• /
• 2006

본 논문에서는 3차원 볼륨영상에서 객체를 빠르게 분할하고 동시에 대화식으로 분할과정을 가시화하기 위하여 그래픽 하드웨어를 사용한 레벨-셋 방법을 제안한다. 이를 위하여 첫째, GPU 내에서 효율적 연산을 수행하기 위해 메모리 관리방법을 제안한다. 이는 GPU 내 텍스쳐 메모리 형식에 적합하게 데이터를 패킹하고, CPU의 주메모리와 GPU의 텍스쳐 메모리를 관리하는 방법을 제시한다. 둘째, GPU 내에서 레벨-셋 값을 갱신하는 과정을 9가지 경우로 나누어 연산을 수행하게 함으로써 연산의 효율성을 높힌다. 셋째, front의 변화를 대화식으로 확인하고, 파라미터 변경에 따른 분할 과정을 효과적으로 측정하기 위하여 그래픽 하드웨어 기반 빠른 가시화 방법을 제안한다. 본 논문에서는 제안방법을 평가하기 위하여 3차원 폐 CT 영상데이터를 사용하여 육안평가를 수행하고, 기존 소프트웨어 기반 레벨-셋 방법과 수행시간 측면에서 비교 분석한다. 본 제안방법은 소프트웨어 기반 레벨-셋 방법보다 빠르게 영상을 분할하고 동시에 가시화함으로써 데이터 량이 많은 의료응용에 효율적으로 적용이 가능하다.

• The KIPS Transactions:PartA
• /
• v.13A no.3 s.100
• /
• pp.267-274
• /
• 2006

This paper describes a method to achieve different level of detail for the given volumetric data by assigning weight for the given data points. The relation between wavelet transformation and alpha shape was investigated to define the different level of resolution. Scattered data are defined as a collection of data that have little specified connectivity between data points. The quality of interpolant in volumetric trivariate space depends not only on the distribution of the data points in ${\Re}^3$, but also on the data value (intensity). We can improve the quality of an approximation by using wavelet coefficient as weight for the corresponding data points.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.11a
• /
• pp.402-407
• /
• 2004

Since the world wide web, simple and convenient tool, has proposed, the Internet became the most simple network resource which provide many informations of the world. Furthermore, various methodologies are developed to support the dynamic service such as 3D View web service. We will propose the volume rendering view program that interactively visualize the 3D data on the web. The 3D Data is obtained by stacking the 2D images along the z-direction. We also employ the COM based OCX control which is a kind of Active component. This web program will contribute the diagnosis of the diseases through the 3D visualization and image analysis functions at remote places.

• 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.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.235-244
• /
• 2000

This paper addresses a new method for constructing surface representation of 3D structures from a sequence of tomographic cross-sectional images, Firstly, we propose cell-boundary representation by transforming the cuberille space into cell space. A cell-boundary representation consists of a set of boundary cells with their 1-voxel configurations, and can compactly describe binary volumetric data. Secondly, to produce external surface from the cell-boundary representation, we define 19 modeling primitives (MP) including volumetric, planar and linear groups. Surface polygons are created from those modeling primitives using a simple table look-up operation. Comparing with previous method such as Marching Cube or PVP algorithm, our method is robust and does not make any crack in resulting surface model. Hardware implementation is expected to be easy because our algorithm is simple(scan-line), efficient and guarantees data locality in computation time.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.629-631
• /
• 2003

대부분의 상용 CIS 소프트웨어에서는 시공간분석 결과를 2 차원상에 가시화 하거나 해당 분석결과를 단순히 출력해 주는 형태이다. 3차원상의 질의 볼륨에 대한 3차원 공간분석 또한 이론 및 실험적으로 많은 연구가 이루어져 왔으나, 3 차원상의 공간분석 결과 가시화 기능을 통합한 시스템은 아직까지 미흡한 실정이다. 본 논문에서는 3 차원상의 공간연산 및 3 차원에 시간속성을 부가한 4 차원 시공간 연산을 처리할 있는 4 차원 CIS 시스템을 소개한다. 제안된 기법은 2차원 수치지도와 3 차원 부가속성을 가진 데이터베이스를 이용하여 2 차원, 3 차원, 미디어 데이터간의 상호연계 및 통합된 가시화 프레임워크를 제공한다. 또한 가상세계 매핑기법을 이용하여 수작업에 의존한 별도의 이미지 프로세싱 과정 없이도 비디오상의 특정 프레임의 건물에 대한 속성질의 및 2D/3D 간의 상호 연계 기능을 제공할 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.299-302
• /
• 2000

의료영상의 크기가 커짐에 따라 처리해야 할 데이터량이 많아졌다. 또한 점점 더 많은 사람들이 빠른 3차원 가시화 결과를 기대한다. 하지만 이전에 제시된 많은 방법들은 실시간 응답 결과를 기대하기는 힘들다. 본 논문은 하드웨어를 이용하여 의료영상을 빠른 속도로 3차원 가시화하는 방법과 그 구현 결과에 대해 기술한다. 구현에 있어 자바를 이용함으로써 플랫폼 독립적이며 OpenGL을 기반으로 한 자바 3D API를 사용함으로써 쉽고 빠르게 3차원 가시화 결과를 디스플레이할 수 있다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.3
• /
• pp.210-216
• /
• 2009

Several empty-space leaping methods have been proposed for CPU-based volume ray casting. When sample points are located in semi-transparent cells, however, previous leaping methods perform unnecessary resamplings even if the scalar values on those points are confined within transparent range. A semi-transparent cells leaping method for volume ray casting using the Marching Cubes algorithm is proposed to solve this problem in our previous work. When a ray reaches a semi-transparent cell, our method performs in-out test between current sample point and the bounding box enclosing the triangles generated by the Marching Cubes. If the sample point lies on outside of the bounding box, we estimate the point is regarded as transparent. In this case, the ray advances to the next sample point without performing a resampling operation. We can frequently refer the tables for neighboring voxels, however, when we exploit conventional data structures of the Marching Cubes. We propose modified Marching Cubes tables for solving this problem.

• Journal of the Korea Computer Graphics Society
• /
• v.7 no.2
• /
• pp.21-28
• /
• 2001

As a result of the recent explosive growth of scientific data, extremely large volume datasets have become increasingly commonplace. While several texture-based volume rendering algorithms have been proposed, most of them focused on volumes smaller than the hardware's available texture memory. This paper presents a new parallel volume rendering scheme for very large static and time-varying data on a multipipe system architecture. Our scheme subdivides large volumes dynamically into smaller bricks, and assigns them adaptively to graphics pipes to minimize the costs of texture swapping. With the new method, Phong shaded images can be easily created by computing the gradients on the fly and using the color matrix feature of OpenGL. We report experimental results on an SGI Onyx2 for the various large datasets.

• Journal of Biomedical Engineering Research
• /
• v.20 no.4
• /
• pp.409-417
• /
• 1999

Talairach atlas consists of three orthogonal sets of coronal, sagittal, and axial slices. This atlas has recently an important role as a standard brain atlas in diagnosing disease related with brain function and analyzing cause of brain disease. The 3D digital volume data set reconstructed from the atlas is widely applied to visualization and quantitative analysis of results processed in the digital computer. This paper represented application method of bi-linear interpolation technique, proposed tri-planar interpolation algorithm for 3D volume data reconstruction of Talairach atlas. And we implemented Talairach atlas editor and discussed problems in volume reconstruction of Talairach atlas. The bi-linear method was applied to only one set of the slices and considered the on intensity value in the interpolation process. The tri-planar technique concurrently uses three orthogonal sets of slices with the same information of brain structures. Talairach atlas editor visualized three sets. of atlas slices on the same coordinate and had editing function. Using the atlas editor, we represented problems in volume reconstruction by showing inconsistency of brain structures among three sets of atlas slices.