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

가상 내시경 기법 중 하나 펼친 영상 가시화(unfold rendering) 기법은 장기 내부를 펼쳐서 본 영상을 제공함으로써 장기의 내부 구조와 병변의 유무를 쉽게 판단할 수 있도록 해준다. 가장 일반적으로 사용하는 원형 광선 투사법은 곡률이 급격하게 변하는 경우에 광선들이 교차하여 병변이 두 개로 나타나는 문제가 발생할 수 있다. 본 논문에서는 경로의 제어점을 따라 광선 템플릿을 적용하여 적은 비용으로 펼친 영상을 생성하는 방법을 제안한다. 우선 중심 경로의 제어점들에서 곡률을 계산하여 곡률에 해당하는 광선 템플릿을 적용하여 광선 원뿔(ray Cone)을 구한다. 그리고 생성된 광선 원뿔간의 교차 검사와 보정을 통해 이들이 서로 교차하지 않도록 조정한다. 제어점들 사이의 샘플점들은 앞서 구한 제어점에서의 광선 투사 위치로부터 다음 제어점에서의 투사 위치를 잇는 선분을 보간하여 광선 투사 방향을 결정하게 된다. 마지막으로 계산된 방향에 따라 광선을 투사하여 영상을 생성한다.

• Journal of the Korea Computer Graphics Society
• /
• v.10 no.1
• /
• pp.23-28
• /
• 2004

가상 내시경의 주된 목적은 체내 장기의 3차원적 구조를 가시화하여 광학 내시경을 모사하는데 있다. 가상 내시경 기법 중 펼친 영상 가시화 기법(unfold rendering)은 장기의 내부 구조와 병변의 유무를 쉽게 판단할 수 있도록 하는 장점이 있다. 가장 일반적으로 사용 하는 중심 경로 기반의 광선 투사법은 곡률이 급격하게 변하는 경우 광선들이 교차하여 병변이 두개로 나타나 문제가 발생할 수 있다. 이를 해결하기위해 광선들이 겹치지 않도록 보장하는 여러 기법들이 발표되었지만 계산량이 많은 단점을 가지고 있다. 본 논문에서는 경로의 제어점을 이용하여 적은 비용으로 펼친 영상을 재구성하는 방법을 제안한다. 우선 모든 중심 경로의 제어점에서 경로에 수직인 절단면을 찾는다. 이때 제어점으로부터 방사상으로 광션을 투사하여 절단면과 만나는 장기 내 벽의 위치를 파악한다. 절단면간의 교차 검사 및 보정을 통해 절단연들이 서로 교차하지 않도록 조정한다. 제어점들 사이의 샘플점들은 앞서 구한 임의의 제어점에서 광선이 투사된 위치로 부터 다음 제어점에서 투사된 위치를 잇는 선분을 보간하여 광선 투사 위치를 결정하게 된다. 마지막으로 계산된 방향 따라 광선을 투사하여 영상을 생성한다.

• Journal of Korea Game Society
• /
• v.9 no.4
• /
• pp.89-96
• /
• 2009

In general, the size of volume data is large since it has logical 3D structure so it takes long time to manipulate. Much work has been done to improve processing speed of volume data. In this paper, we propose a interlaced scanning volume rendering that reduce computation time by using temporal coherence with minimum loss of image quality. It renders a current frame by reusing information of previous frame. Conventional volume raycasting renders each frame by casting rays on every pixels. On the other hand, our methods divided an image into n-pixel blocks, then it casts a ray on a pixel of a block per each frames. Consequently, it generates an image by accumulating pixel values of previous n frames. The quality of rendered image of our method is better than that of simple screen space subsampling method since it uses afterimage effect of human cognitive system, and it is n-times faster that the previous one.

• Journal of Korea Game Society
• /
• v.12 no.2
• /
• pp.53-62
• /
• 2012

Visualizing a volume dataset with ray-casting which of visualization methods provides high quality image. However it spends too much time for rendering because the size of volume data are huge. Recently, various researches have been proposed to accelerate GPU-based volume rendering to solve these problems. In this paper, we propose an efficient GPU-based empty space skipping to accelerate volume ray-casting using octree traversal. This method creates min-max octree and searches empty space using vertex splitting. It minimizes the bounding polyhedron by eliminating empty space found in the octree traveral step. The rendering results of our method are identical to those of previous GPU-based volume ray-casting, with the advantage of faster run-time because of using minimized bounding polyhedron.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.686-689
• /
• 2003

Many technologies are applied to the measurement of elastohydrodynamic lubrication (EHL) film thickness. In particular, optical in-situ interferometric method has many advantages in making the actual contact behaviors realized with the experimental apparatus. Careful selection of incident lights greatly enhances the fringe resolution up to nanometer scale by using image processing technology. In this work, it is found that dichromatic incident light can provide much finer resolution of EHL film thickness than monochromatic incident light, because it has much more variables of color components to be discriminated among the wavelengths of colors according the variations of EHL film thickness. Some simulated interferometric images are shown how the film thickness is resolutionized in nanometer scale

• 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 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 Biomedical Engineering Research
• /
• v.25 no.2
• /
• pp.103-109
• /
• 2004

A virtual arthroscopy is a simulation of optical arthroscopy that reconstructs anatomical structures from tomographic images in joint region such as a knee, a shoulder and a wrist. In this paper, we propose a virtual arthroscopy based on isosurface raycasting, which is a kind of volume rendering methods for generating 3D images within a short time. Our method exploits a spatial data structure called min-max map to produce high-quality images in near real-time. Also we devise a physically-based camera control model using potential field. So a virtual camera can fly through in articular cavity without restriction. Using the high-speed rendering method and realistic camera control model, we developed a virtual arthroscopy system.

• Journal of Korea Game Society
• /
• v.11 no.6
• /
• pp.71-80
• /
• 2011

Recent terrain rendering applications such as 3D games and virtual reality, use GPU-based ray-casting method for rendering high-quality scenes in realtime. As the size of terrain dataset grows bigger, the rendering speed will be decreased by the increase of the number of texture samplings. To accelerate the conventional ray-casting, we propose an efficient ray casting method with subdivided bounding boxes which are based-on GPU quadtree traversal. The subdivision of the terrain's bounding box can reduce the empty spaces effectively. By performing the ray-casting with this compact bounding box, we can efficiently reduce computation with empty space skipping. Unlike the recent quadtree-based empty space skipping techniques which perform the tree traversal at each ray, our method traverses the tree only once per frame. Therefore, we can save much computational time.

• Journal of Biomedical Engineering Research
• /
• v.19 no.2
• /
• pp.189-198
• /
• 1998

3D medical image reconstruction techniques are useful to figure out complex 3D structures from the set of 2D sections. In the paper, 3D medical image reconstruction system is constructed under PC environment and programmed based on modular programming by using Visual C++ 4.2. The whole procedures are composed of data preparation, gradient estimation, classification, shading, transformation and ray-casting & compositing. Three speed optimization techniques are used for accelerating 3D medical image reconstruction technique. One is to reduce the rays when cast rays to reconstruct 3D medical image, another is to reduce the voxels to be calculated and the other is to apply early ray termination. To implement 3D medical image reconstruction system based on PC, speed optimization techniques are experimented and applied.