z-logo
Premium
Coherence aware GPU‐based ray casting for virtual colonoscopy
Author(s) -
Lee Taek Hee,
Shin Yeoung Gil
Publication year - 2009
Publication title -
computer animation and virtual worlds
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.225
H-Index - 49
eISSN - 1546-427X
pISSN - 1546-4261
DOI - 10.1002/cav.273
Subject(s) - computer science , shader , ray casting , computer graphics (images) , rendering (computer graphics) , vertex (graph theory) , volume rendering , computer vision , triangle mesh , general purpose computing on graphics processing units , virtual colonoscopy , artificial intelligence , frame rate , coherence (philosophical gambling strategy) , polygon mesh , graphics , theoretical computer science , colonoscopy , medicine , graph , colorectal cancer , cancer , physics , quantum mechanics
Abstract In this paper, we propose a GPU‐based volume ray casting for virtual colonoscopy to generate high‐quality rendering images with a large screen size. Using the temporal coherence for ray casting, the empty space leaping can be efficiently done by reprojecting first‐hit points of the previous frame; however, these approaches could produce artifacts such as holes or illegal starting positions due to the insufficient resolution of first‐hit points. To eliminate these artifacts, we use a triangle mesh of first‐hit points and check the intersection of each triangle with the corresponding real surface. Illegal starting positions can be avoided by replacing a false triangle cutting the real surface with five newly generated triangles. The proposed algorithm is best fit to the recent GPU architecture with Shader Model 4.0 which supports not only fast rasterization of a triangle mesh but also many flexible vertex operations. Experimental results on ATI 2900 with DirectX10 show perspective volume renderings of over 24fps on 1024 × 1024 screen size without any loss of image quality. Copyright © 2008 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here