• Journal of the Korea Computer Graphics Society
• /
• v.21 no.3
• /
• pp.17-26
• /
• 2015

In this paper, we explain a volume rendering system for client-server environment. A single GPU-equipped PC works as a server which is based on the ideas that only a few concurrent users use a volume rendering system in a small hospital. As the clients, we used Android mobile devices such as smart phones. User events are transformed to rendering requests by the client application. When the server receives a rendering request, it renders the volume using the GPU. The rendered image is compressed to JPEG or PNG format so that we can save network bandwidth and reduce transfer time. In addition, we perform an event pruning method while a user is dragging the touch to enhance latency. The server compensates the pruning by interpolating the touch positions. As the result, real-time volume rendering is possible for 5 concurrent users on single GPU-equipped commodity hardware.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.101-106
• /
• 2014

The era came that by having fastest internet and smart phone makes cloud computing really a big merit. This paper proposes architecture for medical image volume rendering in mobile environment using cloud computing. This architecture to replace expensive workstation server and storage it use one of the service of cloud computing IaaS(Infrastructure as a Service). And this paper propose to use webGL to get rid of restriction of mobile hardware. By this research, it is expected that medical image volume rendering service in mobile environment is more effective and can be a foundation work.

• Journal of Korea Multimedia Society
• /
• v.11 no.5
• /
• pp.623-632
• /
• 2008

In this paper, we used the color transfer function and the opacity transfer function for the internal 3D object visualization of an image volume data. In transfer function, creating values of between boundaries generally is ambiguous. We concentrated to extract boundary features for segmenting the visual volume rendering objects. Consequently we extracted an image gradient feature in spatial domain and created a multi-dimensional transfer function according to the GPU efficient improvement. Finally using these functions we obtained a good research result as an implementing object boundary visualization of the graphic hardware based 3D texture mapping.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.117-126
• /
• 2008

Recent advances in medical imaging technologies have enabled the high-resolution data acquisition. Therefore visualization of such large data set on standard graphics hardware became a popular research theme. Among many visualization techniques, we focused on bricking method which divided the entire volume into smaller bricks and rendered them in order. Since it switches bet\W8n bricks on main memory and bricks on GPU memory on the fly, to achieve better performance, the number of these memory swapping conditions has to be minimized. And, because the original bricking algorithm was designed for regular volume data such as CT and MR, when applying the algorithm to ultrasound volume data which is based on the toroidal coordinate space, it revealed some performance degradation. In some areas near bricks' boundaries, an orthogonal viewing ray intersects the single brick twice, and it consequently makes a single brick memory to be uploaded onto GPU twice in a single frame. To avoid this redundancy, we divided the volume into bricks allowing overlapping between the bricks. In this paper, we suggest the formula to determine an appropriate size of these shared area between the bricks. Using our formula, we could minimize the memory bandwidth. and, at the same time, we could achieve better rendering performance.

• 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 KIISE:Computer Systems and Theory
• /
• v.32 no.9
• /
• pp.457-464
• /
• 2005

In this paper a 3D memory system that allows 17 access types at an arbitrary position is introduced. The proposed memory system is based on two main functions: memory module assignment function and address assignment function. Based on them, the memory system supports 17 access types: 13 Lines, 3 Rectangles, and 1 Hexahedron. That is, the memory system allows simultaneous access to multiple data in any access types at an arbitrary position with a constant interval. In order to allow 17 access types the memory system consists of memory module selection circuitry, data routing circuitry for READ/WRITE, and address calculation/routing circuitry In the point of view of a developer and a programmer, the memory system proposed in this paper supports easy hardware extension according to the applications and both of them to deal with it as a logical three-dimensional away In addition, multiple data in various across types can be simultaneously accessed with a constant interval. Therefore, the memory system is suitable for building systems related to ,3D applications (e.g. volume rendering and volume clipping) and a frame buffer for multi-resolution.

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

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

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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.04a
• /
• pp.728-729
• /
• 2016

모바일 기기의 사용량 증가와 성능의 증가로 인해 컴퓨팅 파워가 필요한 많은 분야에서 모바일 기기를 활용 할 수 있게 되었고, 의료영상 분야에서도 활용도가 높아졌다. 특히 전문가가 아닌 일반인들의 건강정보와 인체의 구조에 대한 관심이 증가함에 따라 휴대 가능한 모바일 기기에서 의료영상을 가시화는 것은 중요한 연구주제가 되었다. 하지만, 모바일 기기는 하드웨어의 한계가 있기 때문에 비교적 데이터의 용량이 큰 의료영상 가시화에 많은 제약이 따른다. 본 논문에서는 유니티3D를 활용하여 볼륨렌더링 어플리케이션을 개발하고, 여기에 사실적인 컬러정보를 포함한 Visible Korean 데이터를 적용하여 일반인에 적합한 인체정보를 제공하는 모바일 기기용 인체영상 학습 어플리케이션을 제안한다. 제안한 어플리케이션을 사용하면 매우 사실적인 인체영상을 이용하여 일반인들이 쉽게 인체 구조를 학습할 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.69-72
• /
• 2015

계산 과학 분야에서 자원을 필요한 만큼 빌려 쓸 수 있는 클라우드 기술을 적용하여 과학 클라우드(Science Cloud)를 구축하는 연구가 활발해지고 있다. 특히 의료 분야에서는 3D 볼륨 렌더링과 갈은 고성능의 자원을 활용한 대규모 작업 계산 응용이 있다. 이러한 응용의 성공적인 작업 수행과 실시간으로 변화하는 자원 수요에 대처하여 클라우드 자원을 효율적으로 관리하기 위한 오토 스케일링 엔진 개발이 필요하다. 그러나 대부분의 오토 스케일링 엔진은 단순한 하드웨어의 성능을 기반으로 제공되고 있어 클라이언트에 따라 부하를 고려해야한다. 본 논문에는 클라이언트에 따라 가중치를 적용한 동적인 SLA 기반으로 자원 수요를 예측하고 클라우드 자원을 효율적으로 관리하는 오토 스케일링 엔진을 제안한다.