• Title/Summary/Keyword: 볼륨 가시화

Search Result 111, Processing Time 0.024 seconds

Multi GPU Based Image Registration for Cerebrovascular Extraction and Interactive Visualization (뇌혈관 추출과 대화형 가시화를 위한 다중 GPU기반 영상정합)

  • Park, Seong-Jin;Shin, Yeong-Gil
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.6
    • /
    • pp.445-449
    • /
    • 2009
  • In this paper, we propose a computationally efficient multi GPU accelerated image registration technique to correct the motion difference between the pre-contrast CT image and post-contrast CTA image. Our method consists of two steps: multi GPU based image registration and a cerebrovascular visualization. At first, it computes a similarity measure considering the parallelism between both GPUs as well as the parallelism inside GPU for performing the voxel-based registration. Then, it subtracts a CT image transformed by optimal transformation matrix from CTA image, and visualizes the subtracted volume using GPU based volume rendering technique. In this paper, we compare our proposed method with existing methods using 5 pairs of pre-contrast brain CT image and post-contrast brain CTA image in order to prove the superiority of our method in regard to visual quality and computational time. Experimental results show that our method well visualizes a brain vessel, so it well diagnose a vessel disease. Our multi GPU based approach is 11.6 times faster than CPU based approach and 1.4 times faster than single GPU based approach for total processing.

Interactive Visualization Technique for Adaptive Mesh Refinement Data Using Hierarchical Data Structures and Graphics Hardware (계층적 자료구조와 그래픽스 하드웨어를 이용한 적응적 메쉬 세분화 데이타의 대화식 가시화)

  • ;Chandrajit Bajaj
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.5_6
    • /
    • pp.360-370
    • /
    • 2004
  • Adaptive mesh refinement(AMR) is one of the popular computational simulation techniques used in various scientific and engineering fields. Although AMR data is organized in a hierarchical multi-resolution data structure, traditional volume visualization algorithms such as ray-casting and splatting cannot handle the form without converting it to a sophisticated data structure. In this paper, we present a hierarchical multi-resolution splatting technique using k-d trees and octrees for AMR data that is suitable for implementation on the latest consumer PC graphics hardware. We describe a graphical user interface to set transfer function and viewing / rendering parameters interactively. Experimental results obtained on a general purpose PC equipped with an nVIDIA GeForce3 card are presented to demonstrate that the proposed techniques can interactively render AMR data(over 20 frames per second). Our scheme can easily be applied to parallel rendering of time-varying AMR data.

Transfer Function Optimization Using Crowd Sourcing (크라우드 소싱을 이용한 변환함수 최적화)

  • Nam, Jinhyun;Nam, Doohee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.4
    • /
    • pp.107-112
    • /
    • 2014
  • This Study is Transfer function optimization plan of volume rendering of multi user environment. Each volume data, for appropriate transfer function, they should be adjusted parameter many times. To prevent this, we propose transfer function optimization plan using crowd sourcing. In multi user environment, we use weight value for reliability level for each user. Because transfer function parameter used previous users is provided next users, they can be used effectively optimized transfer function and can reduce attempts.

Indirect Volume Rendering of Hepatobiliary System from CT and MRI Images (CT와 MRI 영상을 이용한 간담도계 간접볼륨렌더링)

  • Jin, Gye-Hwan;Lee, Tae-Soo
    • Journal of the Korean Society of Radiology
    • /
    • v.1 no.2
    • /
    • pp.23-30
    • /
    • 2007
  • This paper presents a method of generating 3-dimensional images by preprocessing 2-dimensional abdominal images obtained using CT (computed tomography) and MRI (magnetic resonance imaging) through segmentation, threshold technique, etc. and apply the method to virtual endoscopy. Three-dimensional images were visualized using indirect volume rendering, which can render at high speed using a general-purpose graphic accelerator used in personal computers. The algorithm used in the rendering is Marching Cubes, which has only a small volume of calculation. In addition, we suggested a method of producing 3-dimensional images in VRML (virtual reality modeling language) running on the Web browser without a workstation or an exclusive program. The number of nodes, the number of triangles and the size of a 3-dimensional image file from CT were 85,367, 174,150 and 10,124, respectively, and those from MRI were 34,029, 67,824 and 3,804, respectively.

  • PDF

Real-time Flow Animation Techniques Using Computational Fluid Dynamics (전산유체역학을 이용한 실시간 유체 애니메이션 기술)

  • Kang Moon Koo
    • Journal of the Korean Society of Visualization
    • /
    • v.2 no.2
    • /
    • pp.8-15
    • /
    • 2004
  • With all the recent progresses in computer hardware and software technology, the animation of fluids in real-time is still among the most challenging issues of computer graphics. The fluid animation is carried out in two steps - the physical simulation of fluids immediately followed by the visual rendering. The physical simulation is usually accomplished by numerical methods utilizing the particle dynamics equations as well as the fluid mechanics based on the Navier-Stokes equations. Particle dynamics method is usually fast in calculation, but the resulting fluid motion is conditionally unrealistic. The methods using Navier-Stokes equation, on the contrary, yield lifelike fluid motion when properly conditioned, yet the complexity of calculation restrains this method from being used in real-time applications. This article presents a rapid fluid animation method by using the continuum-based fluid mechanics and the enhanced particle dynamics equations. For real-time rendering, pre-integrated volume rendering technique was employed. The proposed method can create realistic fluid effects that can interact with the viewer in action, to be used in computer games, performances, installation arts, virtual reality and many similar multimedia applications.

  • PDF

Nonuniformity Correction Scheme Based on 3-dimensional Visualization of MRI Images (MRI 영상의 3차원 가시화를 통한 영상 불균일성 보정 기법)

  • Kim, Hyoung-Jin;Seo, Kwang-Deok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.4
    • /
    • pp.948-958
    • /
    • 2010
  • Human body signals collected by the MRI system are very weak, such that they may be easily affected by either external noise or system instability while being imaged. Therefore, this paper analyzes the nonuniformity caused by a design of the RF receiving coil in a low-magnetic-field MRI system, and proposes an efficient method to improve the image uniformity. In this paper, a method for acquiring 3D bias volume data by using phantom data among various methods for correcting such nonuniformity in MRI image is proposed, such that it is possible to correct various-sized images. It is shown by simulations that images obtained by various imaging methods can be effectively corrected using single bias data.

Mesh Simplification for Volume and Boundary Preservation (볼륨과 경계보존을 고려한 메쉬 간략화)

  • 조진화;김성수;김영택
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10b
    • /
    • pp.583-585
    • /
    • 1999
  • 대부분의 3차원 모델을 가시화해주기 위한 시스템들은 삼각 메쉬를 기반으로 한 모델 표현법을 사용하고 있다. 이러한 시스템들은 복잡한 3차원 모델을 원격 엑세스할 때에는 모델을 가공하지 않으면 전송 및 랜더링시에 많은 제약이 따른다. 이러한 전송 시간과 랜더링 시간, 저장공간을 줄이기 위해 모델을 간략화하거나 압축하는 많은 기법들이 소개되어져 왔다. 본 논문에서는 메쉬 간략화를 위해 소개되어진 많은 다른 방법에서 사용한 에지 축약(Edge Collapse) 기반의 간략화 알고리즘을 제시한다. 기본적인 접근 방법으로는 기하학적인 메쉬 구성요소들 중에서 에지의 특성에 따라 제거 기준을 설정한 후 간략화해 나간다. 에지 축약을 위한 우선순위와 축약 이후 새로운 정점의 위치는 원본 모델을 참조하지 않고 간략화 단계의 모델에서 삼각형의 연결성(connectivity)과 정점의 위치만을 이용하여 계산하였다. 실제 이 방법은 방대한 다각형 메쉬를 간략화할 경우 메모리를 효율적으로 이용할 수 있으며, 처리 속도를 개선할 수 있다. 또한, 간략화이후에도 원본 모델의 위상(topology)을 유지할 수 있는 기법을 제시하고 있다. 세가지 모델에 대한 실험 결과에서 기하학적 에러(geometric error)를 최소화하였고, Heckbert가 제안한 방법(QSlim V2.0)과의 비교에서는 처리 속도가 개선되었다.

  • PDF

Load Balanced Volume Rendering System for Concurrent Users in Multi-CPU Server Environment (다중 CPU 서버 환경에서 동시 사용자를 위한 부하조절 기반 볼륨 가시화 시스템)

  • Lee, Woongkyu;Kye, Heewon
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.5
    • /
    • pp.620-630
    • /
    • 2015
  • This research suggests a load balancing method for a volume rendering system which supports concurrent users. When concurrent users use a volume rendering server system, the computational resources are occupied by a particular user by turns because each process consumes the computational resources as much as possible. In this case, the previous method shows acceptable throughput but the latency is increased for each user. In this research, we suggest a method to improve the latency without performance degradation. Each process makes concessions for taking the resources according to the number of users connected to the system. And we propose a load balancing method in the dynamic situation in which the number of users can vary. Using our methods, we can improve the latency time for each user.

Fast Ambient Occlusion Volume Rendering using Local Statistics (지역적 통계량을 이용한 고속 환경-광 가림 볼륨 가시화)

  • Nam, Jinhyun;Kye, Heewon
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.2
    • /
    • pp.158-167
    • /
    • 2015
  • This study presents a new method to improve the speed of high quality volume rendering. We improve the speed of ambient occlusion which is one of the global illumination techniques used in traditional volume visualization. Calculating ambient occlusion takes much time because it determines an illumination value of a sample by integrating opacities of nearby samples. This study proposes an improved method for this by using local statistics such as averages and standard deviations. We calculate local statistics for each volume block, a set of nearby samples, in pre-processing time. In the rendering process, we efficiently determine the illumination value by assuming the density distribution as a normal distribution. As the results, we can generate high quality images that combine ambient occlusion illumination with local illumination in real time.

2D-3D Vessel Registration for Image-guided Surgery based on distance map (영상유도시술을 위한 거리지도기반 2D-3D 혈관영상 정합)

  • 송수민;최유주;김민정;김명희
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04a
    • /
    • pp.913-915
    • /
    • 2004
  • 시술 중 제공되는 2D영상은 실시간으로 환자와 시술도구의 상태정보를 제공해주지만 환부의 입체적ㆍ해부학적 파악이 어렵다. 따라서 긴 촬영시간으로 시술 전 획득되는 3D영상과 시술 중 얻어지는 2D영상간 정합영상은 영상 유도술에 있어서 유용한 정보를 제공한다. 이를 위해 본 논문에서는 볼륨영상으로부터 혈관모델을 추출하고 이를 평면으로 투영하였다. 두 2D영상에서 정차대상이 되는 혈관골격을 추출한 후 혈관의 분기특성을 고려 한 초기정합을 수행하였다. 크기와 초기 위치를 맞춘 혈관골격을 골격간 거리가 최소가 되도록 반복적으로 혈관을 기하변환시키고 최종 변환된 혈관골격을 시술 중 제공되는 2D영상에 겹쳐 가시화 하였다. 이로써 시술시간 경감과 시술성공률 향상을 유도할 수 있는 시술경로맵을 제시하고자 하였다.