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

IEEE International Symposium on Biomedical Imaging

作者： Wei Xu Klaus Mueller Center of Visual Computing Computer Science Department Stony Brook University USA

ISBN: (纸本)9781424439317

Iterative reconstruction algorithms augmented with regularization can produce high-quality reconstructions from few views and even in the presence of significant noise. In this paper we focus on the particularities associated with the GPU acceleration of these. First, we introduce the idea of using exhaustive benchmark tests to determine the optimal settings of various parameters in iterative algorithm, here OS-SIRT, which proofs decisive for obtaining optimal GPU performance. Then we introduce bilateral filtering as a viable and cost-effective means for regularization, and we show that GPU-acceleration reduces its overhead to very moderate levels.

关键词： Acceleration Hardware Computed tomography Image reconstruction Reconstruction algorithms Iterative algorithms Filters computer graphics computer science Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Optimal sampling lattices for high-fidelity CT reconstruction

Optimal sampling lattices for high-fidelity CT reconstructio...

引用

IEEE Symposium on Nuclear science (NSS/MIC)

作者： Klaus Mueller Fang Xu Center for Visual Computing Computer Science Department Stony Brook University NY USA

We show that the familiar Cartesian lattice, while convenient for signal processing and representation, is suboptimal when it comes to signal fidelity. We explore various applications of optimal sampling lattices, such as the Hexagonal and Body centered Cartesian (BCC) lattices for 3D Computed Tomographic (CT) Reconstruction, both in terms of the (2D) detector and the (3D) reconstructed object. We find that BCC lattices compare favorably with CC lattices for both CT data acquisition and reconstruction. For example they increase the recovery and detectability of small features, such as small tumors in the brain.

关键词： Sampling methods Lattices Computed tomography Signal sampling Signal processing Object detection Detectors Data acquisition computer vision Neoplasms

来源：评论

学校读者我要写书评

暂无评论

Harmonic colormaps for volume visualization

Harmonic colormaps for volume visualization

引用

Joint IEEE/EG 7th International Symposium on Volume Graphics, VG 2008 and 5th Symposium on Point-Based Graphics, PBG 2008

作者： Wang, Lujin Mueller, Klaus Center for Visual Computing and Computer Science Stony Brook University New York United States

ISBN: (纸本)9783905674125

Color design forms a crucial part in visual aesthetics, and it has been shown that a visually aesthetic visualization will be looked at more carefully. An important role plays here the choice of a colormap that is composed of harmonic colors. This paper presents an interface that allows users to choose harmonic colors in volume visualization applications. In addition, it describes mechanisms by which non-harmonic colormaps can be converted to harmonic ones, but keeping lightness constant to preserve the original contrast relationships. Finally, we also show how harmonic colors can be used for the highlighting of important volume features. © The Eurographics Association 2008.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Applications of Optimal Sampling Lattices for Volume Acquisition via 3D Computed Tomography 6

Applications of Optimal Sampling Lattices for Volume Acquisi...

引用

6th Eurographics / IEEE VGTC International Symposium on Volume Graphics, VG@Eurographics 2007

作者： Xu, Fang Mueller, Klaus Center of Visual Computing Computer Science Stony Brook University United States

ISBN: (纸本)9783905674033

There has been mounting evidence that the familiar Cartesian lattices, while convenient for signal processing and representation, are sub-optimal when it comes to signal fidelity. More suitable in this respect are optimal sampling lattices, such as the Hexagonal and Body centered Cartesian (BCC) lattice, and recent work has employed these in the areas of volume rendering and image processing. In this paper we explore various applications of these lattices within the context of 3D Computed Tomographic Reconstruction, both in terms of the (2D) detector and the (3D) reconstructed object, and a theoretical analysis is provided. We combine this analysis with a practical application, that is, the use of these lattices within a real-time GPU-accelerated 3D reconstruction platform, in which performance is also of an immediate concern. © The Eurographics Association 2007.

关键词： Volume rendering

来源：评论

学校读者我要写书评

暂无评论

Hardware acceleration vs. algorithmic acceleration: Can GPU-based processing beat complexity optimization for CT?

Hardware acceleration vs. algorithmic acceleration: Can GPU-...

引用

Medical Imaging 2007: Physics of Medical Imaging

作者： Neophytou, Neophytos Xu, Fang Mueller, Klaus Center for Visual Computing Computer Science Department Stony Brook University Stony Brook NY 11794-4400 United States

ISBN: (纸本)081946628X

Three-dimensional computed tomography (CT) is a compute-intensive process, due to the large amounts of source and destination data, and this limits the speed at which a reconstruction can be obtained. There are two main approaches to cope with this problem: (i) lowering the overall computational complexity via algorithmic means, and/or (ii) running CT on specialized high-performance hardware. Since the latter requires considerable capital investment into rather inflexible hardware, the former option is all one has typically available in a traditional CPU-based computing environment. However, the emergence of programmable commodity graphics hardware (GPUs) has changed this situation in a decisive way. In this paper, we show that GPUs represent a commodity high-performance parallel architecture that resonates very well with the computational structure and operations inherent to CT. Using formal arguments as well as experiments we demonstrate that GPU-based 'brute-force' CT (i.e., CT at regular complexity) can be significantly faster than CPU-based as well as GPU-based CT with optimal complexity, at least for practical data sizes. Therefore, the answer to the title question: "Can GPU-based processing beat complexity optimization for CT?" is "Absolutely!".

关键词： computerized tomography

来源：评论

学校读者我要写书评

暂无评论

Subdivision Volume Splatting

Subdivision Volume Splatting

引用

9th Joint Eurographics/IEEE VGTC Symposium on visualization, EuroVis 2007

作者： McDonnell, K.T. Neophytou, Neophytos Mueller, Klaus Qin, Hong Department of Mathematics and Computer Science Dowling College NY United States Center for Visual Computing Stony Brook University Stony BrookNY United States

ISBN: (纸本)9783905673456

Volumetric Subdivision (VS) is a powerful paradigm that enables volumetric sculpting and realistic volume deformations that give rise to the concept of "virtual clay". In VS, volumes are commonly represented as a space-filling set of deformed polyhedra, which can be further decomposed into a mesh of tetrahedra for rendering. Images can then be generated via tetrahedral projection or raycasting. A current shortcoming in VS-based operations is the need for a very high level of subdivision to represent fine detail in the mesh and to obtain a high-fidelity visualization. However, we have discovered that the subdivision process itself can be closely simulated with radial basis functions (RBFs), making it possible to replace the finer subdivision levels by a coarser aggregation of RBF kernels. This reduction to a simplified assembly of RBFs subsequently enables interactive rendering of volumetric subdivision shapes within a GPU-based volume splatting framework. © The Eurographics Association 2007.

关键词： Radial basis function networks

来源：评论

学校读者我要写书评

暂无评论

Automatic Shape Control of Triangular B-Splines of Arbitrary Topology

引用

Journal of computer science & Technology 2006年第2期21卷 232-237页

作者：贺英顾险峰秦洪 Center for Visual Computing (CVC) and Department of Computer Science Stony Brook University Stony Brook NY 11790-4400 U.S.A.

Triangular B-splines are powerful and flexible in modeling a broader class of geometric objects defined over arbitrary, non-rectangular domains. Despite their great potential and advantages in theory, practical techniques and computational tools with triangular B-splines are less-developed. This is mainly because users have to handle a large number of irregularly distributed control points over arbitrary triangulation. In this paper, an automatic and efficient method is proposed to generate visually pleasing, high-quality triangular B-splines of arbitrary topology. The experimental results on several real datasets show that triangular B-splines are powerful and effective in both theory and practice.

关键词： triangular B-splines arbitrary topology fairing algorithm

来源：评论

学校读者我要写书评

暂无评论

SIMD-Aware Ray-Casting 5

SIMD-Aware Ray-Casting

引用

5th Eurographics / IEEE VGTC International Workshop on Volume Graphics, VG@SIGGRAPH 2006

作者： Leung, Warren Neophytou, Neophytos Mueller, Klaus Center for Visual Computing Computer Science Stony Brook University United States

ISBN: (纸本)390567341X

With the addition of loop and branch capabilities into the GPU programming set, a more natural and free-flowing volume rendering pipeline execution mode recently emerged. While the execution of the looped fragment program is still SIMD, the numerical approximation of the volume integral is no longer broken up into multiple passes, as it was in previous approaches. Although this certainly is an improvement, due to the less tight control, the present framework lacks the capabilities to focus program flow on the relevant data. In fact, due to the GPU-native SIMD programming model, the slowest ray will now determine the rendering speed. Our paper seeks to provide solutions to enforce more control over the rendering process, with the special SIMD programming model in mind, while retaining this new and promising single-pass rendering paradigm. Our efforts were rewarded with speedups of up to 8. © The Eurographics Association 2006.

关键词： Volume rendering

来源：评论

学校读者我要写书评

暂无评论

GPU-Accelerated D2VR 5

GPU-Accelerated D2VR

引用

5th Eurographics / IEEE VGTC International Workshop on Volume Graphics, VG@SIGGRAPH 2006

作者： Xu, Fang Mueller, Klaus Center for Visual Computing Computer Science Stony Brook University United States

ISBN: (纸本)390567341X

Traditional volume rendering approaches rely on obtaining values of sampled points in volumetric space, typically on a cartesian grid. Often, this cartesian grid is not the original source of the data. For example, in tomographic imaging applications, such as used in diagnostic medical or industrial CT, the primary source of the data is the set of X-ray projections taken around the object. To enable visualization with established volume rendering methods, the volume must first be reconstructed from these projections. Since sampling is involved, this process introduces errors, adversely impacting image quality. Recently a new rendering technique was proposed, named D2VR, which skips the intermediate reconstruction step entirely and samples the projections directly. It was shown that doing so can improve image quality significantly. But despite its great promise, a shortcoming of the method was its comparatively slow rendering speed. Interactive or at least near-interactive speed, however, is critical for clinical deployment of a visualization framework. To address this shortcoming, our paper proposes a GPU-accelerated D2VR, with facilities for occlusion culling and empty space skipping to achieve further speedups. © The Eurographics Association 2006.

关键词： Image quality

来源：评论

学校读者我要写书评

暂无评论

GPU-Accelerated Volume Splatting with Elliptical RBFs

GPU-Accelerated Volume Splatting with Elliptical RBFs

引用

8th Joint Eurographics/IEEE VGTC Symposium on visualization, EuroVis 2006

作者： Neophytou, Neophytos Mueller, Klaus McDonnell, Kevin T. Hong, Wei Guan, Xin Qin, Hong Kaufman, Arie Center for Visual Computing Computer Science Stony Brook University United States Department of Mathematics and Computer Science Dowling College United States

ISBN: (纸本)3905673312

Radial Basis Functions (RBFs) have become a popular rendering primitive, both in surface and in volume rendering. This paper focuses on volume visualization, giving rise to 3D kernels. RBFs are especially convenient for the representation of scattered and irregularly distributed point samples, where the RBF kernel is used as a blending function for the space in between samples. Common representations employ radially symmetric RBFs, and various techniques have been introduced to render these, also with efficient implementations on programmable graphics hardware (GPUs). In this paper, we extend the existing work to more generalized, ellipsoidal RBF kernels, for the rendering of scattered volume data. We devise a post-shaded kernel-centric rendering approach, specifically designed to run efficiently on GPUs, and we demonstrate our renderer using datasets from subdivision volumes and computational science. © The Eurographics Association 2006.

关键词： Volume rendering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：