检索结果-内蒙古大学图书馆

SPIE Conference on Visualization and Data Analysis (VDA)

作者： Wischgoll, Thomas Wright State Univ Dayton OH 45431 USA

ISBN: (纸本)9780819494276

In order to learn more about the cause of coronary heart diseases and develop diagnostic tools, the extraction and visualization of vascular structures from volumetric scans for further analysis is an important step. By determining a geometric representation of the vasculature, the geometry can be inspected and additional quantitative data calculated and incorporated into the visualization of the vasculature. To provide a more user-friendly visualization tool, virtual environment paradigms can be utilized. This paper describes techniques for interactive rendering of large-scale vascular structures within virtual environments. This can be applied to almost any virtual environment configuration, such as CAVE-type displays. Specifically, the tools presented in this paper were tested on a Barco I-Space and a large 62x108 inch passive projection screen with a Kinect sensor for user tracking.

关键词： Vascular structures virtual environments passive 3D stereo Kinect billboarding GLSL programmable graphics hardware

来源：评论

学校读者我要写书评

暂无评论

GPU-Based Multilevel Clustering

引用

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER graphics 2011年第2期17卷 132-145页

作者： Chiosa, Iurie Kolb, Andreas Univ Siegen Inst Vis & Graph Comp Graph & Multimedia Syst Grp D-57076 Siegen Germany

The processing power of parallel coprocessors like the graphics Processing Unit (GPU) is dramatically increasing. However, until now only a few approaches have been presented to utilize this kind of hardware for mesh clustering purposes. In this paper, we introduce a Multilevel clustering technique designed as a parallel algorithm and solely implemented on the GPU. Our formulation uses the spatial coherence present in the cluster optimization and hierarchical cluster merging to significantly reduce the number of comparisons in both parts. Our approach provides a fast, high-quality, and complete clustering analysis. Furthermore, based on the original concept, we present a generalization of the method to data clustering. All advantages of the mesh-based techniques smoothly carry over to the generalized clustering approach. Additionally, this approach solves the problem of the missing topological information inherent to general data clustering and leads to a Local Neighbors k-means algorithm. We evaluate both techniques by applying them to Centroidal Voronoi Diagram (CVD)-based clustering. Compared to classical approaches, our techniques generate results with at least the same clustering quality. Our technique proves to scale very well, currently being limited only by the available amount of graphics memory.

关键词： Computer graphics parallel processing clustering methods hierarchical methods programmable graphics hardware

来源：评论

学校读者我要写书评

暂无评论

Reconstruction and visualization of model-based volume representations

Reconstruction and visualization of model-based volume repre...

引用

Conference on Medical Imaging 2010 - Visualization, Image-Guided Procedures, and Modeling

作者： Zheng, Ziyi Mueller, Klaus SUNY Stony Brook Dept Comp Sci Ctr Visual Comp Stony Brook NY 11794 USA

ISBN: (纸本)9780819480262

In modern medical CT, the primary source of data is a set of X-ray projections acquired around the object, which are then used to reconstruct a discrete regular grid of sample points. Conventional volume rendering methods use this reconstructed regular grid to estimate unknown off-grid values via interpolation. However, these interpolated values may not match the values that would have been generated had they been reconstructed directly with CT. The consequence can be simple blurring, but also the omission of fine object detail which usually contains precious information. To avoid these problems, in the method we propose, instead of reconstructing a lattice of volume sample points, we derive a high-fidelity object model directly from the reconstruction process, fitting a localized object model to the acquired raw data within tight tolerances. This model can then be easily evaluated both for slice-based viewing as well as in GPU 3D volume rendering, offering excellent detail preservation in zooming operations. Furthermore, the model-driven representation also supports high-precision analytical ray casting.

关键词： 3D reconstruction computed tomography CT filtered-backprojection inverse Radon transform programmable graphics hardware GPU fitting

来源：评论

学校读者我要写书评

暂无评论

Fast Motion Estimation on graphics hardware for H.264 Video Encoding

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2009年第1期11卷 1-10页

作者： Schwalb, Martin Ewerth, Ralph Freisleben, Bernd Univ Marburg Dept Math & Comp Sci D-35032 Marburg Germany

The video coding standard H.264 supports video compression with a higher coding efficiency than previous standards. However, this comes at the expense of an increased encoding complexity, in particular for motion estimation which becomes a very time consuming task even for today's central processing units (CPU). On the other hand, modern graphics hardware includes a powerful graphics processing unit (GPU) whose computing power remains idle most of the time. In this paper, we present a GPU based approach to motion estimation for the purpose of H.264 video encoding. A small diamond search is adapted to the programming model of modern GPUs to exploit their available parallel computing power and memory bandwidth. Experimental results demonstrate a significant reduction of computation time and a competitive encoding quality compared to a CPU UMHexagonS implementation while enabling the CPU to process other encoding tasks in parallel.

关键词： Parallel motion estimation H.264 GPGPU (general purpose computation on GPU) programmable graphics hardware MPEG-4 part 10/AVC

来源：评论

学校读者我要写书评

暂无评论

Real-time multi-band synthesis of ocean water with new iterative up-sampling technique

引用

VISUAL COMPUTER 2009年第5-7期25卷 697-705页

作者： Miandji, E. Moghadam, M. H. Sargazi Samavati, Faramarz F. Emadi, M. Sharif Univ Technol VR Lab Tehran Iran Univ Calgary Dept Comp Sci Calgary AB T2N 1N4 Canada

Adapting natural phenomena rendering for real-time applications has become a common practice in computer graphics. We propose a GPU-based multi-band method for optimized synthesis of "far from coast" ocean waves using an empirical Fourier domain model. Instead of performing two independent syntheses for low- and high-band frequencies of ocean waves, we perform only low-band synthesis and employ results to reproduce high frequency details of ocean surface by an optimized iterative up-sampling stage. Our experimental results show that this approach greatly improves the performance of original multi-band synthesis while maintaining image quality.

关键词： Real-time rendering Wave synthesis Image up-sampling programmable graphics hardware

来源：评论

学校读者我要写书评

暂无评论

Optimizing the parallel computation of linear recurrences using compact matrix representations

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2009年第4期69卷 373-381页

作者： Nistor, Adrian Chin, Wei-Ngan Tan, Tiow-Seng Tapus, Nicolae Natl Univ Singapore Dept Comp Sci Singapore 117548 Singapore Univ Politehn Bucuresti Dept Comp Sci Bucharest Romania

This paper presents a novel method for optimizing the parallel computation of linear recurrences. Our method can help reduce the resource requirements for both memory and computation. A unique feature of our technique is its formulation of linear recurrences as matrix computations, before exploiting their mathematical properties for more compact representations. Based on a general notion of closure for matrix multiplication, we present two classes of matrices that have compact representations. These classes are permutation matrices and matrices whose elements are linearly related to each other. To validate the proposed method, we experiment with solving recurrences whose matrices have compact representations using CUDA on nVidia GeForce 8800 GTX GPU. The advantages of our technique are that it enables the computation of larger recurrences in parallel and it provides good speedups of up to eleven times over the un-optimized parallel computations. Also, the memory usage can be as much as nine times lower than that of the un-optimized parallel computations. Our result confirms a promising approach for the adoption of more advanced parallelization techniques. (C) 2009 Elsevier Inc. All rights reserved.

关键词： Memory optimization Recursion Matrix multiplication programmable graphics hardware

来源：评论

学校读者我要写书评

暂无评论

Direct Trimming of NURBS Surfaces on the GPU

引用

ACM TRANSACTIONS ON graphics 2009年第3期28卷 1-9页

作者： Schollmeyer, Andre Froehlich, Bernd Bauhaus Univ Weimar Weimar Germany

This paper presents a highly efficient direct trimming technique for NURBS surfaces, which is applicable to tessellation-based rendering as well as ray tracing systems. The central idea is to split the trim curves into monotonic segments with respect to the two parameter dimensions of the surface patches. We use an optimized bisection method to classify a point with respect to each monotonic trim curve segment without performing an actual intersection test. Our hierarchical acceleration structure allows the use of a large number of such curve segments and performs the bisection method only for points contained in the bounding boxes of the curve segments. We have integrated our novel point classification scheme into a GPU-based NURBS ray casting system and implemented the entire trimmed NURBS rendering algorithm in a single OpenGL GLSL shader. The shader can handle surfaces and trim curves of arbitrary degrees, which allows the use of original CAD data without incorporating any approximations. Performance data confirms that our trimming approach can deal with hundreds of thousands of trim curves at interactive rates. Our point classification scheme can be applied to other application domains dealing with complex curved regions including flood fills, font rendering and vector graphics mapped on arbitrary surfaces.

关键词： parametric surfaces trimmed NURBS point classification ray casting root finding programmable graphics hardware

来源：评论

学校读者我要写书评

暂无评论

GPU Supported Patch-based Tessellation for Dual Subdivision

GPU Supported Patch-based Tessellation for Dual Subdivision

引用

6th International Conference on Computer graphics, Imaging and Visualization (CGIV 2009)

作者： Fan, Fengtao Cheng, Fuhua (Frank) Univ Kentucky Dept Comp Sci Lexington KY 40506 USA

ISBN: (纸本)9780769537894

A novel patch-based tessellation method for a dual subdivision scheme, the Doo-Sabin subdivision, is presented. Patch-based refinement for face-split subdivision schemes such as Catmull-Clark subdivision or Loop subdivision has been widely studied. But there is no patch-based tessellation algorithm for dual subdivision scheme [1] yet. The method presented in this paper is the first attempt to fill up that gap. The new method uses an 1D array to hold vertices;it creates a patch corresponding to a vertex in the original mesh and does not have any numerical roundoff gaps on patch boundaries. These characteristics are different from those of patch-based refinements for face-split subdivision schemes. Experimental results show that our algorithm achieves real time tessellation performance for moderate meshes.

关键词： subdivision surfaces programmable graphics hardware patch-based refinement

来源：评论

学校读者我要写书评

暂无评论

Near-Real-Time Image Matting with Known Background

Near-Real-Time Image Matting with Known Background

引用

6th Canadian Conference on Computer and Robot Vision

作者： Gong, Minglun Yang, Yee-Hong Mem Univ Newfoundland St John NF A1C 5S7 Canada Univ Alberta Edmonton AB Canada

ISBN: (纸本)9781424442119

This paper presents a novel matting algorithm for handling cases where foreground objects are in front of complex (non-smooth) but known background. The algorithm is based on a Poisson equation that takes the gradient of the known background into consideration. The quantitative evaluation based on ground truth shows that the matting results obtained using the proposed algorithm is more accurate than the ones generated by the global Poisson matting [9]. The proposed algorithm is also optimized for parallel processing and runs in near-real-time on programmable graphics hardware.

关键词： Image matting Poisson equation programmable graphics hardware

来源：评论

学校读者我要写书评

暂无评论

Direct Trimming of NURBS Surfaces on the GPU

Direct Trimming of NURBS Surfaces on the GPU

引用

ACM SIGGRAPH Conference 2009

作者： Schollmeyer, Andre Froehlich, Bernd Bauhaus Univ Weimar Weimar Germany

关键词： parametric surfaces trimmed NURBS point classification ray casting root finding programmable graphics hardware

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：