• Title/Summary/Keyword: Volume rendering technique

Search Result 68, Processing Time 0.022 seconds

Density Estimation Technique for Effective Representation of Light In-scattering (빛의 내부산란의 효과적인 표현을 위한 밀도 추정기법)

  • Min, Seung-Ki;Ihm, In-Sung
    • Journal of the Korea Computer Graphics Society
    • /
    • v.16 no.1
    • /
    • pp.9-20
    • /
    • 2010
  • In order to visualize participating media in 3D space, they usually calculate the incoming radiance by subdividing the ray path into small subintervals, and accumulating their respective light energy due to direct illumination, scattering, absorption, and emission. Among these light phenomena, scattering behaves in very complicated manner in 3D space, often requiring a great deal of simulation efforts. To effectively simulate the light scattering effect, several approximation techniques have been proposed. Volume photon mapping takes a simple approach where the light scattering phenomenon is represented in volume photon map through a stochastic simulation, and the stored information is explored in the rendering stage. While effective, this method has a problem that the number of necessary photons increases very fast when a higher variance reduction is needed. In an attempt to resolve such problem, we propose a different approach for rendering particle-based volume data where kernel smoothing, one of several density estimation methods, is explored to represent and reconstruct the light in-scattering effect. The effectiveness of the presented technique is demonstrated with several examples of volume data.

Real-Time Stereoscopic Visualization of Very Large Volume Data on CAVE (CAVE상에서의 방대한 볼륨 데이타의 실시간 입체 영상 가시화)

  • 임무진;이중연;조민수;이상산;임인성
    • 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.

Implementation of Parallel Volume Rendering Using the Sequential Shear-Warp Algorithm (순차 Shear-Warp 알고리즘을 이용한 병렬볼륨렌더링의 구현)

  • Kim, Eung-Kon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.6
    • /
    • pp.1620-1632
    • /
    • 1998
  • This paper presents a fast parallel algorithm for volume rendering and its implementation using C language and MPI MasPar Programming Language) on the 4,096 processor MasPar MP-2 machine. This parallel algorithm is a parallelization hased on the Lacroute' s sequential shear - warp algorithm currently acknowledged to be the fastest sequential volume rendering algorithm. This algorithm reduces communication overheads by using the sheared space partition scheme and the load balancing technique using load estimates from the previous iteration, and the number of voxels to be processed by using the run-length encoded volume data structure.Actual performance is 3 to 4 frames/second on the human hrain scan dataset of $128\times128\times128$ voxels. Because of the scalability of this algorithm, performance of ]2-16 frames/sc.'cond is expected on the 16,384 processor MasPar MP-2 machine. It is expected that implementation on more current SIMD or MIMD architectures would provide 3O~60 frames/second on large volumes.

  • PDF

Evaluation on usefulness of three dimensional reconstructive computed tomography images after pedicle screws fixation (척추경 나사못 고정술 시행 후 3차원 재구성CT영상의 유용성 평가)

  • Kim, Hyeon-Ju;Jang, Hyun-Chul;Cho, Jae-Hwan
    • Journal of Digital Contents Society
    • /
    • v.11 no.4
    • /
    • pp.553-559
    • /
    • 2010
  • By applying the various reformation techniques by using a circle raw data of after computed tomography image in the patient enforcing the spine screw fixation, this research tried to look into the various information including the exact location of the position of the screw spike and accuracy of an operation. In a clinical, by applying the or multi planar reformatting(MPR), that is the re-composition technique used mainly, maximum intensity projection (MIP), and volume rendering technique(VRT) and transformation removal from a register modifying VRT, video data were compared and were analyzed by the quantitative method and qualitative method. It is judged as the transformation volume rendering technique of the re-composition technique which is most useful in minimizing the artifact shadow by the exact location of the position of a screw and metal among the analysis and evaluation result computed tomography image reformation technique of the reformation image after the spine screw fixation.

Efficient Non-photorealistic Rendering Technique in Single Images and Video (영상 동영상에서의 효율적인 비사실적 렌더링)

  • Son, Tae-Il;Park, Kyoung-Ju
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.8
    • /
    • pp.977-985
    • /
    • 2012
  • The purpose of this study was to present a non-photorealistic rendering technique that is efficient in single images and moving images. In case of single images, they could be processed in a real-time base by realizing flow-based DoG filter and bilateral filter, which have been frequently used in the single image NPR technique recently, in the CUDA environment. In case of moving images, the investigator presented not the existing method of NPR moving images which generating images by applying the single image NPR technique to every frame, but the method of using the single image NPR technique in the first frame and stylizing it, and then of using the motion vector-based pixel mapping in the second frame on and copying the bright values of pixels that move on the frame into the location of next frame's motion vector, thus reducing unnecessary volume of calculation and maintaining the consistency between frames. In this study, the performance of this method was proved via an experiment.

Approximating 3D General Sweep Boundary using Graphics Hardware (그래픽스 하드웨어를 이용한 입체 스윕 경계 근사)

  • An, Jae-U;Kim, Myeong-Su;Hong, Seong-Je
    • Journal of the Korea Computer Graphics Society
    • /
    • v.8 no.3
    • /
    • pp.1-7
    • /
    • 2002
  • This paper presents a practical technique for approximating the boundary surface of the volume swept out by three-dimensional objects using the depth-buffer. Objects may change their geometries and orientations while sweeping. The sweep volume is approximated as a union of volume elements, which are just rendered inside appropriate viewing frusta of virtual cameras and mapped into screen viewports with depth-buffer. From the depth of each pixel in the screen space of each rendering, the corresponding point in the original world space can be computed. Appropriately connecting these points yields polygonal faces forming polygonal surface patches approximately covering some portion of the sweep volume. Each view frustum adds one or more surface patches in this way, and these presumably overlapped polygonal surface patches approximately enclose the whole sweep volume. These patches may further be processed to yield non-overlapped polygonal surfaces as an approximation to the boundary of the original 3D sweep volume.

  • PDF

Enhancement of MRI angiogram with modified MIP method

  • Lee, Dong-Hyuk;Kim, Jong-Hyo;Han, Man-Chung;Min, Byong-Goo
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1997 no.05
    • /
    • pp.72-74
    • /
    • 1997
  • We have developed a 3-D image processing and display technique that include image resampling, modification of MIP, and fusion of MIP image and volumetric rendered image. This technique facilitates the visualization of the three-dimensional spatial relationship between vasculature and surrounding organs by overlapping the MIP image on the volumetric rendered image of the organ. We applied this technique to a MR brain image data to produce an MRI angiogram that is overlapped with 3-D volume rendered image of brain. MIP technique was used to visualize the vasculature of brain, and volume rendering was used to visualize the other structures of brain. The two images are fused after adjustment of contrast and brightness levels of each image in such a way that both the vasculature and brain structure are well visualized either by selecting the maximum value of each image or by assigning different color table to each image. The resultant image with this technique visualizes both the brain structure and vasculature simultaneously, allowing the physicians to inspect their relationship more easily. The presented technique will be useful for surgical planning for neurosurgery.

  • PDF

3D Visualization System of Blood Flow Reconstructed using Curvature Estimation (곡률 추정을 이용하여 재건된 혈류의 3차원 가시화 시스템)

  • Kwon, Oh-Seo;Yoon, Joseph;Kim, Young-Bong
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.2
    • /
    • pp.224-232
    • /
    • 2016
  • The methodology to visualize the shape of blood vessel and its blood flow have been attracting as a very interesting problem to forecast and examinate a disease in thrombus precursor protein. May previous visualization researches have been appeared for designing the blood vessel and also modeling the blood flow using a doppler imaging technique which is one of nondestructive testing techniques. General visualization methods are to depict the blood flow obtained from doppler effects with fragmentary stream lines and also visualize the blood flow model using volume rendering. However, these visualizeation techniques have the disadvantage which a set of small line segments does not give the overall observation of blood flows. Therefore, we propose a visualization system which reconstruct the continuity of the blood flow obtained from doppler effects and also visualize the blood flow with the vector field of blood particles. This system will use doppler phase difference from medical equipments such as OCT with low penetration and reconstruct the blood flow by the curvature estimation from vector field of each blood particle.

Application of Image Based VR Technique for Volume Data Web Service (볼륨데이터의 웹 서비스를 위한 이미지 기반 가상현실의 적용)

  • Kim, Yeon-Ho;Park, Jong-Gu
    • The KIPS Transactions:PartB
    • /
    • v.9B no.2
    • /
    • pp.255-262
    • /
    • 2002
  • The Virtual Reality (VR) is an appealing subject which can be applied to various areas because of its merit - removal of time limits and space. Recently, as the technology of xDSL spreads widely, a concern of VR is on the on-line service of 3D model data in real time. But, the immensity of 3D model is an obstacle to achieve these endeavors. To solve these problems, the image based VR technique is applied. The proposed method in this paper is one of solutions on the immensity problem of 3D model data in the on-line services. This paper exploits the mixed technique of image based VR and surface rendering based on volume rendering. By using the proposed method, we can solve the immensity problem. Consequently, tole service user can explore virtual 2D volume model with almost equal to reality of 3D volume model. Furthermore, this paper explains a method to implement this service on general web environments. Of course, to fulfill these procedures, additional skills which reduce consuming time in data mining are also mentioned. The contribution of this paper is to provide a practical method for handling of large volume data web service in real-time. illustrative examples are presented to show the effectiveness of the proposed method.

Efficient Computation of Isosurface Curvatures on GPUs Based on the de Boor Algorithm (드 부어 알고리즘을 이용한 GPU에서의 효율적인 등가면 곡률 계산)

  • Kim, Minho
    • Journal of the Korea Computer Graphics Society
    • /
    • v.23 no.3
    • /
    • pp.47-54
    • /
    • 2017
  • In this paper, we propose an improved curvature-based GPU (Graphics Processing Unit) isosurface ray-casting technique. Our method adopts the fast evaluation method proposed by Sigg et al. [1] to find the isosurface, but replaces the computation of the gradient and Hessian with the de Boor algorithm. In this way, we can reduce the number of additional texture fetches from 84 to 27 thus improving the performance by up to ${\approx}30%$, depending on the platforms.