• 한국전산유체공학회:학술대회논문집
• /
• 1999.11a
• /
• pp.158-162
• /
• 1999

This thesis presents applications of three dimensional visualization technique based on shear-warp volume rendering to medical information. Volume rendering is compared to surface rendering and acceleration technique is also presented. The presented rendering techniques by using three-dimensional arrays of data are a widely used representation for computational fluid dynamics and geological structures as well as medical information.

• Journal of Korea Multimedia Society
• /
• v.9 no.8
• /
• pp.971-981
• /
• 2006

As shear-warp volume rendering is the fastest rendering method among the software based approaches, image quality is not good as that of other high-quality rendering methods. In this paper, we propose two methods to improve the image quality of shear-warp volume rendering without sacrificing computational efficiency. First, supersampling is performed in intermediate image space. We propose an efficient method to transform between volume and image coordinates at the arbitrary ratio. Second, we utilize pre-integrated rendering technique for shear-warp rendering. We propose new data structure called overlapped min-max map. Using this structure, empty space leaping can be performed so that we can maintain the rendering speed even though pre-integrated rendering is applied. Consequently, shear-warp rendering can generate high-qualify images comparable to those generated by the ray-casting without degrading speed.

• Journal of Biomedical Engineering Research
• /
• v.21 no.4
• /
• pp.433-439
• /
• 2000

Volume rendering is a powerful tool for visualizing sampled scalar values from 3D data without modeling geometric primitives to the data. The volume rendering can describe the surface-detail of a complex object. Owing to this characteristic. volume rendering has been used to visualize medical data. The size of volume data is usually too big to handle in real time. Recently, various volume rendering algorithms have been proposed in order to reduce the rendering time. However, most of the proposed algorithms are not proper for fast rendering of large non-coded volume data. In this paper, we propose a block-based fast volume rendering algorithm using a shear-warp factorization for non-coded volume data. The algorithm performs volume rendering by using the organ segmentation data as well as block-based 3D volume data, and increases the rendering speed for large non-coded volume data. The proposed algorithm is evaluated by rendering 3D X-ray CT body images and MR head images.

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

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.187-194
• /
• 2004

Shear-Warp volume rendering has many advantages such as good image Quality and fast rendering speed. However in the interactive classification environment it has low efficiency of memory access since preprocessed classification is unavailable. In this paper we present an algorithm using the spacial locality of memory access in the interactive classification environment. We propose an extension model appending a rotation matrix to the factorization of viewing transformation, it thus performs a scanline-based rendering in the object and image space. We also show causes and solutions of three problems of the proposed algorithm such as inaccurate front-to-back composition, existence of hole, increasing computational cost. This model is efficient due to the spacial locality of memory access.

• Journal of Korea Multimedia Society
• /
• v.12 no.4
• /
• pp.512-520
• /
• 2009

Maximum intensity projection (MIP) is a volume rendering method which extracts maximum values along the viewing direction through volume data. It visualizes high-density structures, such as angio-graphic datasets so that it is frequently used in medical imaging systems. We have proposed an efficient two-step MIP acceleration method that uses the recent CPUs. First, we exploited SIMD instructions to reduce conditional branch instructions which take up a considerable part of whole rendering process, so that we improved rendering speed. Second, we proposed a new method, which accesses volume and image data successively by modifying the shear-warp rendering. This method improves memory access patterns so that cache misses are reduced. Using the current CPUs, our method improved the rendering speed by a factor of 7 than that of the shear-warp rendering.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1285-1295
• /
• 1999

본 논문은 방대한 크기의 볼륨 데이타를 효율적으로 렌더링하기 위한 셀 기반 웨이브릿 압축 방법을 제시한다. 이 방법은 볼륨을 작은 크기의 셀로 나누고, 셀 단위로 웨이브릿 변환을 한 다음 복원 순서에 따른 런-길이(run-length) 인코딩을 수행하여 높은 압축율과 빠른 복원을 제공한다. 또한 최근 복원 정보를 캐쉬 자료 구조에 효율적으로 저장하여 복원 시간을 단축시키고, 에러 임계치의 정규화로 비정규화된 웨이브릿 압축보다 빠른 속도로 정규화된 압축과 같은 고화질의 이미지를 생성하였다. 본 연구의 성능을 평가하기 위하여 {{}} 해상도의 볼륨 데이타를 압축하여 쉬어-？ 분해(shear-warp factorization) 알고리즘에 적용한 결과, 손상이 거의 없는 상태로 약 27:1의 압축율이 얻어졌고, 약 3초의 렌더링 시간이 걸렸다.Abstract This paper presents an efficient cell-based wavelet compression method of large volume data. Volume data is divided into individual cell of {{}} voxels, and then wavelet transform is applied to each cell. The transformed cell is run-length encoded according to the reconstruction order resulting in a fairly good compression ratio and fast reconstruction. A cache structure is used to speed up the process of reconstruction and a threshold normalization scheme is presented to produce a higher quality rendered image. We have combined our compression method with shear-warp factorization, which is an accelerated volume rendering algorithm. Experimental results show the space requirement to be about 27:1 and the rendering time to be about 3 seconds for {{}} data sets while preserving the quality of an image as like as using original data.

• Journal of Biomedical Engineering Research
• /
• v.23 no.6
• /
• pp.491-498
• /
• 2002

In medical visualization fields, anisotropic volume data are more common than isotropic ones. In this paper, we propose an efficient rendering method for anisotropic volume data, which directly computes the intensity of intermediate samples by interpolating the intensity of two corresponding voxels on consecutive slices. Unlike conventional rendering method, it does not require a preprocessing step for generating intermediate slices or additional memory for storing them. In order to evaluate the validity and performance of our method, we applied the method to shear-warp rendering algorithm. Experimental results show that this method improves rendering speed without significantly sacrificing the image quality.

• Proceedings of the KOSOMBE Conference
• /
• v.1997 no.11
• /
• pp.197-200
• /
• 1997

In this paper, we present a 3D reconstruction method of color volume data or a computerized human atlas. Binary volume rendering which takes the advantages of shear-warp factorization and new normal vector calculation method visualizes 3D organs in real time. Various manipulations such as rotation, multiple object rendering, removal, and transparency effect improve the usefulness and comprehensiveness of the computerized atlas.

• Journal of Biomedical Engineering Research
• /
• v.21 no.5
• /
• pp.519-526
• /
• 2000

볼륨 렌더링은 3D 의료영상 데이터를 가시화하는 중용한 기법 중 하나이다. 그러나 볼륨 렌더링을 실시간으로 이룰 때, 많은 계산량을 필요로하는 것이 볼률 렌더링을 사용하는데 걸림돌이 되고 있다. 이 논문에서는 Superscalar와 VLIM(Very Long Instruction Word)의 구조를 가지고 있어 동시에 8개의 명령어 수행이 가능한 TI사의 TMS320C6201 DSP를 이용하여 3D 초음파 영상의 쉬어-웝 볼륨 렌더링을 구현하였다. 쉬어-웝 방법을 DSP 상에서 최적으로 구현하기 위하여 ray map 방법, one-to-four ray casting, ？디 skipping 방법을 제안하였다. 제안한 방법들을 이용한 볼륨 렌더링과 적용하지 않은 기존의 알고리즘을 DSP에 구현하여 PSNR과 렌더링 시간의 비교·평가를 통해 만족할 만한 영상 화질에 빠른 렌더링 성능을 얻을 수 있음을 보여주었다.