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

Matching Visual Saliency to Confidence in Plots of Uncertain data

ieee TRANSACTIONS ON visualization AND COMPUTER graphics 2010年第6期16卷 980-989页

作者： Feng, David Kwock, Lester Lee, Yueh Taylor, Russell M., II Univ N Carolina Chapel Hill NC 27515 USA UNC Hosp Dept Radiol Chapel Hill NC USA

Conveying data uncertainty in visualizations is crucial for preventing viewers from drawing conclusions based on untrustworthy data points. This paper proposes a methodology for efficiently generating density plots of uncertain multivariate data sets that draws viewers to preattentively identify values of high certainty while not calling attention to uncertain values. We demonstrate how to augment scatter plots and parallel coordinates plots to incorporate statistically modeled uncertainty and show how to integrate them with existing multivariate analysis techniques, including outlier detection and interactive brushing. Computing high quality density plots can be expensive for large data sets, so we also describe a probabilistic plotting technique that summarizes the data without requiring explicit density plot computation. These techniques have been useful for identifying brain tumors in multivariate magnetic resonance spectroscopy data and we describe how to extend them to visualize ensemble data sets.

关键词： Uncertainty visualization brushing scatter plots parallel coordinates multivariate data

来源：评论

学校读者我要写书评

暂无评论

In Situ visualization for large-Scale Combustion Simulations

引用

ieee COMPUTER graphics AND APPLICATIONS 2010年第3期30卷 45-57页

作者： Yu, Hongfeng Wang, Chaoli Grout, Ray W. Chen, Jacqueline H. Ma, Kwan-Liu Sandia Natl Labs Livermore CA 94550 USA Michigan Technol Univ Houghton MI 49931 USA Univ Calif Davis Grad Grp Comp Sci Davis CA 95616 USA

The article focuses in situ visualization as a scalable way for scientists to view the data that their large-scale combustion simulations generate. The challenges of in situ visualization are discussed, such as parallel rendering which includes volume and particle rendering and the integration of the two. Also included are direct numerical simulation, simulation-time visualization, and parallel image compositing.

关键词： visualization SUPERCOMPUTERS parallel processing (Electronic computers) HIGH performance computing COMPUTERS

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Aggregation for Information visualization: Overview, Techniques, and Design Guidelines

引用

ieee TRANSACTIONS ON visualization AND COMPUTER graphics 2010年第3期16卷 439-454页

作者： Elmqvist, Niklas Fekete, Jean-Daniel Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA Univ Paris 11 LRI INRIA Saclay F-91405 Orsay France

We present a model for building, visualizing, and interacting with multiscale representations of information visualization techniques using hierarchical aggregation. The motivation for this work is to make visual representations more visually scalable and less cluttered. The model allows for augmenting existing techniques with multiscale functionality, as well as for designing new visualization and interaction techniques that conform to this new class of visual representations. We give some examples of how to use the model for standard information visualization techniques such as scatterplots, parallel coordinates, and node-link diagrams, and discuss existing techniques that are based on hierarchical aggregation. This yields a set of design guidelines for aggregated visualizations. We also present a basic vocabulary of interaction techniques suitable for navigating these multiscale visualizations.

关键词： Aggregation clustering clutter reduction massive data sets visual exploration visual analytics

来源：评论

学校读者我要写书评

暂无评论

Fast Construction of k-Nearest Neighbor Graphs for Point Clouds

引用

ieee TRANSACTIONS ON visualization AND COMPUTER graphics 2010年第4期16卷 599-608页

作者： Connor, Michael Kumar, Piyush Florida State Univ Dept Comp Sci LOV Tallahassee FL 32306 USA

We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existing methods: 1) faster construction of k-nearest neighbor graphs in practice on multicore machines, 2) less space usage, 3) better cache efficiency, 4) ability to handle large data sets, and 5) ease of parallelization and implementation. If the point set has a bounded expansion constant, our algorithm requires one-comparison-based parallel sort of points, according to Morton order plus near-linear additional steps to output the k-nearest neighbor graph.

关键词： Nearest neighbor searching point-based graphics k-nearest neighbor graphics Morton ordering parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel and Streaming Generation of Ghost data for Structured Grids

引用

ieee COMPUTER graphics AND APPLICATIONS 2010年第3期30卷 32-44页

作者： Isenburg, Martin Lindstrom, Peter Childs, Hank Lawrence Livermore Natl Lab Ctr Appl Sci Comp Livermore CA 94550 USA Lawrence Berkeley Natl Lab Berkeley CA USA

parallel simulations decompose large domains into many blocks. A fundamental requirement for subsequent parallel analysis and visualization is the presence of ghost data that supplements each block with a layer of adjacent data elements from neighboring blocks. The standard approach for generating ghost data requires all blocks to be in memory at once. This becomes impractical when fewer processors—and thus less aggregate memory—are available for analysis than for simulation. A proposed algorithm for generating ghost data for structured grids uses many fewer processors than previously possible. It stores as little as one block per processor in memory and can run on as few processors as are available (possibly just one). The basic approach first slightly changes the original blocks' size by declaring parts of them to be ghost data and then pads adjacent blocks with this data.

关键词： computer graphics ghost data graphics and multimedia isocontour extraction parallel algorithms streaming processing structured grids structured grids (mathematics) COMPUTER graphics data elements Memory Neighbor Blocks parallel algorithms PROCESSOR Grates STREAMS(PROCESS) grids Memory parallel Lines Streaming

来源：评论

学校读者我要写书评

暂无评论

Melange: Space Folding for Visual Exploration

引用

ieee TRANSACTIONS ON visualization AND COMPUTER graphics 2010年第3期16卷 468-483页

作者： Elmqvist, Niklas Riche, Yann Henry-Riche, Nathalie Fekete, Jean-Daniel Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA Microsoft Res Redmond WA 98052 USA Univ Paris 11 LRI INRIA Saclay F-91405 Orsay France

Navigating in large geometric spaces-such as maps, social networks, or long documents-typically requires a sequence of pan and zoom actions. However, this strategy is often ineffective and cumbersome, especially when trying to study and compare several distant objects. We propose a new distortion technique that folds the intervening space to guarantee visibility of multiple focus regions. The folds themselves show contextual information and support unfolding and paging interactions. We conducted a study comparing the space-folding technique to existing approaches and found that participants performed significantly better with the new technique. We also describe how to implement this distortion technique and give an in-depth case study on how to apply it to the visualization of large-scale 1D time-series data.

关键词： Interaction visualization navigation exploration folding split screen space distortion focus plus context

来源：评论

学校读者我要写书评

暂无评论

Volume graphics 2010 - 8th ieee/EG International symposium on Volume graphics

Volume Graphics 2010 - 8th IEEE/EG International Symposium o...

引用

8th ieee/EG International symposium on Volume graphics, Volume graphics 2010, Co-located with the Annual Conference of the European Association for Computer graphics, Eurographics 2010

ISBN: (纸本)9783905674217

The proceedings contain 16 papers. The topics discussed include: a new sampling scheme for slice based volume rendering;multi-layer volume ray casting on GPU;wavelet-based multi resolution isosurface rendering;split-voxel: a simple discontinuity-preserving voxel representation for volume rendering;real-time surface analysis and tagged material cleansing for virtual colonoscopy;slimming brick cache strategies for seismic horizon propagation algorithms;volumetric evaluation of meshless data from smoothed particle hydrodynamics simulations;concurrent volume visualization of real-time fMRI;fast volumetric data exploration with importance-based accumulated transparency modulation;multi-dimensional reduction and transfer function design using parallel coordinates;a survey of transfer functions suitable for volume rendering;feature-driven ambient occlusion for direct volume rendering;and GPU-supported lossless compression scheme for rendering time-varying volume data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

graphics Processing Unit-Based High Frame Rate Ultrasonic Tissue Motion visualization

Graphics Processing Unit-Based High Frame Rate Ultrasonic Ti...

引用

4th International Conference on Bioinformatics and Biomedical Engineering (iCBBE)

作者： Zhao, Anyuan Liu, Dong C. Sichuan Univ Coll Comp Sci Chengdu Peoples R China

ISBN: (纸本)9781424447138

Ultrasonic tissue motion can be visualized in three steps: the gray scale motion detection, the Unsteady Flow Line Integral Convolution (UFLIC) algorithm to trace the velocity field, and display techniques for both the global motion and the local radial/tangential velocity components. Because of the large amount of data and high computational requirement in UFLIC, it was difficult to meet real-time requirement on CPU. In this paper a parallel algorithm based on the graphics processing unit (GPU) was proposed to implement ultrasonic tissue motion visualization, and it represented both the direction and amplitude of the motion by texture and color. Furthermore, a method was proposed to calculate the local radial/tangential velocity components. Finally, we got a frame rate of about more than 300 fps with the vector field size of 260x260.

关键词： motion visualization UFLIC GPU High Frame Rate parallel processing ultrasound tissue motion

来源：评论

学校读者我要写书评

暂无评论

large Program Trace Analysis and Compression with ZDDs

Large Program Trace Analysis and Compression with ZDDs

引用

8th International symposium on Code Generation and Optimization

作者： Price, Graham Vachharajani, Manish Univ Colorado Dept Elect & Comp Engn Boulder CO 80309 USA

ISBN: (纸本)9781605586359

Prior work has shown that reduced, ordered, binary decision diagrams (BDDs) can be a powerful tool for program trace analysis and visualization. Unfortunately, it can take hours or days to encode large traces as BDDs. Further, techniques used to improve BDD performance are inapplicable to large dynamic program traces. This paper explores the use of ZDDs for compressing dynamic trace data. Prior work has show that ZDDs can represent sparse data sets with less memory compared to BDDs. This paper demonstrates that (1) ZDDs do indeed provide greater compression for sets of dynamic traces (25% smaller than BDDs on average), (2) with proper tuning, ZDDs encode sets of dynamic trace data over 9 x faster than BDDs, and (3) ZDDs can be used for

关键词： parallel programming trace compression

来源：评论

学校读者我要写书评

暂无评论

Efficient Characterizations of Composite Materials Electrical Properties Based on GPU Accelerated Finite Difference Method

Efficient Characterizations of Composite Materials Electrica...

引用

2010 ieee International symposium Antennas and Propagation/CNC-USNC/URSI Radio Science Meeting

作者： Wu, Dagang Chen, Ji Halliburton Houston TX 77032 USA Univ Houston Houston TX 77204 USA

ISBN: (纸本)9781424449682

In this paper, a GPU accelerated three-dimensional finite difference method is presented as an efficient approach of performing fast parallel simulations of composite materials. Using a NVIDIA GeForce 9800 series GPGPU and with an optimized CUDA implementation, a considerable speed-up (>20) was observed for simulations of large size problems. Further performance improvements could be achieved by further efficient data transfer and access between shared memory and global memory, using distributed computing with multiple video cards, , and etc.

关键词： GPU accelerated three-dimensional finite difference method NVIDIA GeForce 9800 series GPGPU composite material electrical properties composite materials computer graphic equipment coprocessors digital simulation distributed computing finite difference methods general purpose graphics processing unit platform multiple video cards optimized CUDA parallel processing periodic composite structures periodic structures permittivity physics computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：