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

5th ieee International symposium on Biomedical Imaging

作者： Kniss, Joe Michael Univ New Mexico Albuquerque NM 87131 USA

ISBN: (纸本)9781424420025

The principal goal of visualization is to create a visual representation of complex information and large datasets in order to gain insight and understanding. Our current research focuses on methods for handling uncertainty stemming from data acquisition and algorithmic sources. Most visualization methods, especially those applied to 3D data, implicitly use some form of classification or segmentation to eliminate unimportant regions and illuminate those of interest. The process of classification is inherently uncertain;in many cases the source data contains error and noise, data transformations such as filtering can further introduce and magnify the uncertainty. More advanced classification methods rely on some sort of model or statistical method to determine what is and is not a feature of interest. While these classification methods can model uncertainty or fuzzy probabilistic memberships, they typically only provide discrete, maximum a-posteriori memberships. It is vital that visualization methods provide the user access to uncertainty in classification or image generation if the results of the visualization are to be trusted.

关键词： scientific visualization uncertainty sensitivity data processing computer graphics

来源：评论

学校读者我要写书评

暂无评论

parallel construction of k-nearest neighbor graphs for point clouds

Parallel construction of k-nearest neighbor graphs for point...

引用

Joint ieee/EG 7th International symposium on Volume graphics, VG 2008 and 5th symposium on Point-Based graphics, PBG 2008

作者： Connor, M. Kumar, P. Department of Computer Science Florida State University United States

ISBN: (纸本)9783905674125

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 multi-core machines. (2) Less space usage. (3) Better cache efficiency. (4) Ability to handle large data sets. (5) Ease of parallelization and implementation. © The Eurographics Association 2008.

关键词： Motion compensation

来源：评论

学校读者我要写书评

暂无评论

ieee Pacific Visualisation symposium 2008, PacificVis - Proceedings

IEEE Pacific Visualisation Symposium 2008, PacificVis - Proc...

引用

2008 Pacific visualization symposium, PacificVis 2008

ISBN: (纸本)9781424419661

The proceedings contain 29 papers. The topics discussed include: capstone address: visualization of high dimensional data in brain and information sciences;second-order pre-integrated volume rendering;dynamic shader generation for flexible multi-volume visualization;interactive exploration of remote isosurfaces with point-based non-photorealistic rendering;crossing minimization meets simultaneous drawing;effects on crossing angles;visual statistics for collections of clustered graphs;energy-based hierarchical edge clustering of graphs;finite-time transport structures of flow fields;importance-driven particle techniques for flow visualization;illustrative streamline placement visualization;and optimizing parallel performance of streamline visualization for large distributed flow datasets.

关键词： Flow visualization

来源：评论

学校读者我要写书评

暂无评论

A parallelized surface extraction algorithm for large binary image data sets based on an adaptive 3D delaunay subdivision strategy

引用

ieee TRANSACTIONS ON visualization AND COMPUTER graphics 2008年第1期14卷 160-172页

作者： Ma, YingLiang Saetzler, Kurt Guys Hosp Univ London Kings Coll Div Imaging Sci London SE1 9RT England Univ Ulster Sch Biomed Sci Coleraine BT52 1SA Londonderry North Ireland

In this paper, we describe a novel 3D subdivision strategy to extract the surface of binary image data. This iterative approach generates a series of surface meshes that capture different levels of detail of the underlying structure. At the highest level of detail, the resulting surface mesh generated by our approach uses only about 10 percent of the triangles in comparison to the Marching Cube ( MC) algorithm, even in settings where almost no image noise is present. Our approach also eliminates the so-called "staircase effect," which voxel-based algorithms like the MC are likely to show, particularly if nonuniformly sampled images are processed. Finally, we show how the presented algorithm can be parallelized by subdividing 3D image space into rectilinear blocks of subimages. As the algorithm scales very well with an increasing number of processors in a multithreaded setting, this approach is suited to process large image data sets of several gigabytes. Although the presented work is still computationally more expensive than simple voxel-based algorithms, it produces fewer surface triangles while capturing the same level of detail, is more robust toward image noise, and eliminates the above-mentioned "staircase" effect in anisotropic settings. These properties make it particularly useful for biomedical applications, where these conditions are often encountered.

关键词： isosurface extraction adaptive mesh generation Delaunay triangulation parallel computing

来源：评论

学校读者我要写书评

暂无评论

A four-level focus plus context approach to interactive visual analysis of temporal features in large scientific data

引用

COMPUTER graphics FORUM 2008年第3期27卷 775-782页

作者： Muigg, Philipp Kehrer, Johannes Oeltze, Steffen Piringer, Harald Doleisch, Helmut Preim, Bernhard Hauser, Helwig VRVis Res Ctr Vienna Austria Univ Magdeburg Dept Simulat & Graph D-39106 Magdeburg Germany Univ Bergen Dept Informat N-5008 Bergen Norway

In this paper we present a new approach to the interactive visual analysis of time-dependent scientific data both from measurements as well as from computational simulation-by visualizing a scalar function. over time for each of tenthousands or even millions of sample points. In order to cope with overdrawing and cluttering, we introduce a new four-level method of focus+context visualization. Based on a setting of coordinated, multiple views (with linking and brushing), we integrate three different kinds of focus and also the context in every single view. Per data item we use three values (front the unit interval each) to represent to which degree the data item is part of the respective focus level. We present a color compositing scheme which is capable of expressing all three values in a meaningful way, taking semantics and their relations amongst each other (in the context of our multiple linked view setup) into account. Furthermore, we present additional image-based postprocessing methods to enhance the visualization of large sets of function graphs, including a texture-based technique based on line integral convolution (LIC). We also propose advanced brushing techniques which are specific to the time-dependent nature of the data (in order to brush patterns over time more efficiently). We demonstrate the usefulness of the new approach in the context of medical perfusion data.

关键词： Simulation methods & models Visual analytics Scalar field theory Information visualization Semantics Digital image processing Convolutions (Mathematics)

来源：评论

学校读者我要写书评

暂无评论

3D Approach to the visualization of parallel Applications and Grid Monitoring Information 08

3D Approach to the Visualization of Parallel Applications an...

引用

9th ieee/ACM International Conference on Grid Computing

作者： Schnorr, Lucas Mello Huard, Guillaume Alexandre Navaux, Philippe Olivier Univ Fed Rio Grande do Sul Inst Informat BR-91501970 Porto Alegre RS Brazil

ISBN: (纸本)9781424425785

parallel computing is increasingly used to provide more performance to applications that need tremendous computational power. The main characteristics of distributed parallel machines are heterogeneity, dynamism and size. They influence directly the way the application and platform monitoring tasks are performed, especially when analyzing a large quantity of information collected in a topologically complex machine. This paper describes our efforts to provide parallel programmers and Grid users a new way to visualize monitoring data. Using graphics in three dimensions and information visualization techniques, we aim at bringing rich topological information to the rendered scene. It results in an immersible and human readable representation of complex monitoring data, suited to Grid environments. We first review known techniques in information visualization context, especially those that address the case of hierarchical information, and we discuss about their use in our context. Then, we propose a new 3D approach that combines the classical space-time visualization of application traces with the representation of the application's communication pattern. Finally, we present experimental results obtained through the visualization of parallel applications in our prototype.

关键词： visualization

来源：评论

学校读者我要写书评

暂无评论

Optimizing parallel performance of streamline visualization for large distributed flow datasets

Optimizing parallel performance of streamline visualization ...

引用

ieee Pacific Visualisation symposium

作者： Chen, Li Fujishiro, Issei Tsinghua Univ Sch Software Inst Comp Graph & Comp Aided Design Beijing 100084 Peoples R China Tohoku Univ Inst Fluid Sci Sendai Miyagi 980 Japan

ISBN: (纸本)9781424419661

parallel performance has been a challenging topic in streamline visualization for large unstructured flow datasets on parallel distributed-memory computers. It depends strongly on domain partitions. Unsuitable partitions often lead to severe load imbalance and high frequent communications among the domain partitions. To address the problem, we present an approach to flow data partitioning taking account of flow directions and features. Multilevel spectral graph bisection method is employed to reduce communication and synchronization overhead among distributed domains. Edge weights in the corresponding adjacent matrix is defined based on an anisotropic local diffusion operator which assigns strong coupling along flow direction and weak coupling orthogonal to flow. Meanwhile, the distributions of seed points and flow features such as vortex structure are also considered in partitioning so as to obtain good load balance. The experimental results are given to show the feasibility and effectiveness of our method.

关键词： flow visualization parallel streamline graph partition load balance flow clustering

来源：评论

学校读者我要写书评

暂无评论

Volume and Point-Based graphics 2008 - Eurographics / ieee VGTC symposium Proceedings, 7th International symposium on Volume graphics, VG 2008 and 5th symposium on Point-Based graphics, PBG 2008

Volume and Point-Based Graphics 2008 - Eurographics / IEEE V...

引用

Joint ieee/EG 7th International symposium on Volume graphics, VG 2008 and 5th symposium on Point-Based graphics, PBG 2008

ISBN: (纸本)9783905674125

The proceedings contain 20 papers. The topics discussed include: a graph-based approach to symmetry detection;a survey of methods for moving least squares surfaces;parallel construction of k-nearest neighbor graphs for point clouds;harmonic colormaps for volume visualization;stroke-based transfer function design;on accuracy of marching isosurfacing methods;isosurface ambient occlusion and soft shadows with filterable occlusion maps;multiresolution interval volume meshes;stereo pseudo 3D rendering for web-based display of scientific volumetric data;layers for effective volume rendering;GPU-based particle systems for illustrative volume rendering;interactive global light propagation in direct volume rendering using local piecewise integration;obscurance-based volume rendering framework;decomposition and visualization of fourth-order elastic-plastic tensors;and pseudorandom noise for real-time volumetric rendering of fire in a production system.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Web-Based Distributed Simulations visualization and Control with HLA and Web Services 08

Web-Based Distributed Simulations Visualization and Control ...

引用

12th ieee/ACM International symposium on Distributed Simulation and Real Time Applications

作者： Boukerche, A. Iwasaki, F. M. Araujo, R. B. Pizzolato, E. B. Univ Ottawa SITE Paradise Lab Ottawa ON Canada Univ Fed Sao Carlos Dept Comp Sci Sao Carlos SP Brazil

ISBN: (纸本)9780769534251

Dynamic data Driven Application Systems (DDDAS), systems with online simulations models fed with sensorial data from the environment, are increasingly;being used for emergency, management strategic planning. This paper describes an approach to establish the communication and exchange information among the many subsystems composing a DDDAS using the High Level Architecture (HLA) infrastructure's services. We present the LAViE-3D, a framework that generates Web-based simulation front-ends using 3D graphics to manage and control HLA-compliant distributed simulations. The LAViE-3D framework uses open-source software and is designed to make it easier to implement and deploy visualization applications on different platforms with customizable interface for simulations runtime control and management.

关键词： distributed simulations X3D Web services HLA Dynamic data Driven Application Systems

来源：评论

学校读者我要写书评

暂无评论

Extensions of parallel coordinates for interactive exploration of large multi-timepoint data sets

Extensions of parallel coordinates for interactive explorati...

引用

作者： Blaas, Jorik Botha, Charl P. Post, Frits H. Data Visualization Group Delft University of Technology

parallel coordinate plots (PCPs) are commonly used in information visualization to provide insight into multi-variate data. These plots help to spot correlations between variables. PCPs have been successfully applied to unstructured datasets up to a few millions of points. In this paper, we present techniques to enhance the usability of PCPs for the exploration of large, multi-timepoint volumetric data sets, containing tens of millions of points per timestep. The main difficulties that arise when applying PCPs to large numbers of data points are visual clutter and slow performance, making interactive exploration infeasible. Moreover, the spatial context of the volumetric data is usually lost. We describe techniques for preprocessing using data quantization and compression, and for fast GPU-based rendering of PCPs using joint density distributions for each pair of consecutive variables, resulting in a smooth, continuous visualization. Also, fast brushing techniques are proposed for interactive data selection in multiple linked views, including a 3D spatial volume view. These techniques have been successfully applied to three large data sets: Hurricane Isabel (Vis'04 contest), the ionization front instability data set (Vis'08 design contest), and data from a large-eddy simulation of cumulus clouds. With these data, we show how PCPs can be extended to successfully visualize and interactively explore multi-timepoint volumetric datasets with an order of magnitude more data points. © 2008 ieee.

关键词： visualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：