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

LOD map - A visual interface for navigating multiresolution volume visualization

ieee TRANSACTIONS ON visualization AND COMPUTER graphics 2006年第5期12卷 1029-1036页

作者： Wang, Chaoli Shen, Han-Wei Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

In multiresolution volume visualization, a visual representation of level-of-detail (LOD) quality is important for us to examine, compare, and validate different LOD selection algorithms. While traditional methods rely on ultimate images for quality measurement, we introduce the LOD map - an alternative representation of LOD quality and a visual interface for navigating multiresolution data exploration. Our measure for LOD quality is based on the formulation of entropy from information theory. The measure takes into account the distortion and contribution of multiresolution data blocks. A LOD map is generated through the mapping of key LOD ingredients to a treemap representation. The ordered treemap layout is used for relative stable update of the LOD map when the view or LOD changes. This visual interface not only indicates the quality of LODs in an intuitive way, but also provides immediate suggestions for possible LOD improvement through visually-striking features. It also allows us to compare different views and perform rendering budget control. A set of interactive techniques is proposed to make the LOD adjustment a simple and easy task. We demonstrate the effectiveness and efficiency of our approach on large scientific and medical data sets.

关键词： LOD map knowledge representation perceptual reasoning multiresolution rendering large volume visualization

来源：评论

学校读者我要写书评

暂无评论

GPU Optimization for High-Quality Kinetic Fluid Simulation

引用

ieee TRANSACTIONS ON visualization AND COMPUTER graphics 2022年第9期28卷 3235-3251页

作者： Chen, Yixin Li, Wei Fan, Rui Liu, Xiaopei ShanghaiTech Univ Shanghai Engn Res Ctr Intelligent Vis & Imaging Sch Informat Sci & Technol Shanghai 201210 Peoples R China

Fluid simulations are often performed using the incompressible Navier-Stokes equations (INSE), leading to sparse linear systems which are difficult to solve efficiently in parallel. Recently, kinetic methods based on the adaptive-central-moment multiple-relaxation-time (ACM-MRT) model [1], [2] have demonstrated impressive capabilities to simulate both laminar and turbulent flows, with quality matching or surpassing that of state-of-the-art INSE solvers. Furthermore, due to its local formulation, this method presents the opportunity for highly scalable implementations on parallel systems such as GPUs. However, an efficient ACM-MRT-based kinetic solver needs to overcome a number of computational challenges, especially when dealing with complex solids inside the fluid domain. In this article, we present multiple novel GPU optimization techniques to efficiently implement high-quality ACM-MRT-based kinetic fluid simulations in domains containing complex solids. Our techniques include a new communication-efficient data layout, a load-balanced immersed-boundary method, a multi-kernel launch method using a simplified formulation of ACM-MRT calculations to enable greater parallelism, and the integration of these techniques into a parametric cost model to enable automated prameter search to achieve optimal execution performance. We also extended our method to multi-GPU systems to enable large-scale simulations. To demonstrate the state-of-the-art performance and high visual quality of our solver, we present extensive experimental results and comparisons to other solvers.

关键词： Kinetic theory Mathematical model graphics processing units Computational modeling Solids Optimization Adaptation models GPU optimization parallel computing fluid simulation lattice Boltzmann method immersed boundary method

来源：评论

学校读者我要写书评

暂无评论

Incremental, approximate database queries and uncertainty for exploratory visualization

Incremental, approximate database queries and uncertainty fo...

引用

1st ieee symposium on large-Scale data Analysis and visualization 2011, LDAV 2011

作者： Fisher, Danyel Microsoft Research 1 Microsoft Way Redmond WA 98052 United States

ISBN: (纸本)9781467301541

Exploratory data visualization calls for iterative analyses, but very large databases are often far too slow to allow interactive exploration. Incremental, approximate database queries exchange precision for speed: by sampling from the full database, the system can resolve queries rapidly. As the sample gets broader, the precision increases at the cost of time. As the precision of the sample value can be estimated, we can represent the range of possible values. This range may be visually represented using uncertainty visualization techniques. This paper outlines the current literature in both incremental approximate queries and in uncertainty visualization. The two fields mesh well: incremental techniques can collect data in interactive time, and uncertainty techniques can show bounded error. © 2011 ieee.

关键词： visualization

来源：评论

学校读者我要写书评

暂无评论

Adaptive sampling in three dimensions for volume rendering on GPUs

Adaptive sampling in three dimensions for volume rendering o...

引用

Asia/Pacific symposium on Visualisation 2007

作者： Kraus, Martin Strengert, Magnus Klein, Thomas Ertl, Thomas Univ Stuttgart Visualizat & Interact Syst Grp D-7000 Stuttgart Germany

ISBN: (纸本)9781424408085

Direct volume rendering of large volumetric data sets on programmable graphics hardware is often limited by the amount of available graphics memory and the bandwidth from main memory to graphics memory. Therefore, several approaches to volume rendering from compact representations of volumetric data have been published that avoid most of the data transfer between main memory and the graphics programming unit (GPU) at the cost of additional data decompression by the GPIJ. To reduce this performance cost, adaptive sampling techniques were proposed;which are, however, usually restricted to the sampling in view direction. In this work, we present a GPU-based volume rendering algorithm with adaptive sampling in all three spatial directions;i.e., not only in view direction but also in the two perpendicular directions of the image plane. This approach allows us to reduce the number of samples dramatically without compromising image quality;thus, it is particularly well suited for many compressed representations of volumetric data that require a computational expensive GPU-based sampling of data.

关键词： scientific visualisation visualisation of large data sets volume visualization direct volume rendering

来源：评论

学校读者我要写书评

暂无评论

EGPGV 2021 - 21st Eurographics symposium on parallel graphics and visualization

EGPGV 2021 - 21st Eurographics Symposium on Parallel Graphic...

引用

21st Eurographics symposium on parallel graphics and visualization, EGPGV 2021

ISBN: (纸本)9783038681380

The proceedings contain 8 papers. The topics discussed include: HyLiPoD: parallel particle advection via a hybrid of lifeline scheduling and parallelization-over-data;machine learning-based autotuning for parallel particle advection;scalable in situ computation of Lagrangian representations via local flow maps;evaluation of PyTorch as a data-parallel programming API for GPU volume rendering;faster RTX-accelerated empty space skipping using triangulated active region boundary geometry;performance tradeoffs in shared-memory platform portable implementations of a stencil kernel;UnityPIC: unity point-cloud interactive core;and interactive selection on calculated attributes of large-scale particle data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel Marching Blocks: A Practical Isosurfacing Algorithm for large data on Many-Core Architectures

引用

COMPUTER graphics FORUM 2016年第3期35卷 211-220页

作者： Liu, Baoquan Clapworthy, Gordon J. Dong, Feng Wu, Enhua Univ Bedfordshire Luton Beds England Chinese Acad Sci SKLCS IOS Beijing Peoples R China Univ Macau Zhuhai Peoples R China

Interactive isosurface visualisation has been made possible by mapping algorithms to GPU architectures. However, current state-of-the-art isosurfacing algorithms usually consume large amounts of GPU memory owing to the additional acceleration structures they require. As a result, the continued limitations on available GPU memory mean that they are unable to deal with the larger datasets that are now increasingly becoming prevalent. This paper proposes a new parallel isosurface-extraction algorithm that exploits the blocked organisation of the parallel threads found in modern many-core platforms to achieve fast isosurface extraction and reduce the associated memory requirements. This is achieved by optimising thread co-operation within thread-blocks and reducing redundant computation;ultimately, an indexed triangular mesh can be produced. Experiments have shown that the proposed algorithm is much faster (up to 10x) than state-of-the-art GPU algorithms and has a much smaller memory footprint, enabling it to handle much larger datasets (up to 64x) on the same GPU.

关键词： Categories and Subject Descriptors (according to ACM CCS) I.3.3 [Computer graphics]: Picture/Image Generation&mdash Viewing Algorithms

来源：评论

学校读者我要写书评

暂无评论

Homogeneity Guided Probabilistic data Summaries for Analysis and visualization of large-Scale data Sets 10

Homogeneity Guided Probabilistic Data Summaries for Analysis...

引用

ieee Pacific visualization symposium (ieee PacificVis)

作者： Dutta, Soumya Woodring, Jonathan Shen, Han-Wei Chen, Jen-Ping Ahrens, James Ohio State Univ Columbus OH 43210 USA Los Alamos Natl Lab Los Alamos NM USA

ISBN: (纸本)9781509057382

High-resolution simulation data sets provide plethora of information, which needs to be explored by application scientists to gain enhanced understanding about various phenomena. Visual-analytics techniques using raw data sets are often expensive due to the data sets' extreme sizes. But, interactive analysis and visualization is crucial for big data analytics, because scientists can then focus on the important data and make critical decisions quickly. To assist efficient exploration and visualization, we propose a new region-based statistical data summarization scheme. Our method is superior in quality, as compared to the existing statistical summarization techniques, with a more compact representation, reducing the overall storage cost. The quantitative and visual efficacy of our proposed method is demonstrated using several data sets along with an in situ application study for an extreme-scale flow simulation.

关键词： I.3 [COMPUTER graphics]: Picture/Image Generation-Display algorithms G.3 [PROBABILITY AND STATISTICS]: Distribution functions-Statistical computing

来源：评论

学校读者我要写书评

暂无评论

Explainable visualization of Collaborative Vandal Behaviors in Wikipedia

Explainable Visualization of Collaborative Vandal Behaviors ...

引用

ieee symposium on visualization for Cyber Security (VizSec)

作者： Subramanian, Siva Sandeep Pushparaj, Parab Liu, Zerong Lu, Aidong Univ N Carolina Dept Comp Sci Charlotte NC 28223 USA

ISBN: (纸本)9781728138763

Online social networks are prone to be targeted by various frauds and attacks, which are difficult to detect due to their complexity and variations. The challenge is to make sense of all information with suitable exploration tools for different groups of users. This project focuses on an explainable visualization approach to study collaborative behaviors of vandal users on Wikipedia. Our approach creates visualization with commonly used techniques from cartography and statistical graphics that are familiar to the general public for effectiveness and explainability. We have built a large-scale visualization system which supports an illustrative interface with multiple data query, filtering, analysis, and interactive exploration functions. Examples and case studies are provided to demonstrate that our approach can be used effectively for a set of Wikipedia behavior analysis tasks.

关键词： Human-centered computing-visualization-visualization techniques Human-centered computing-visualization-visualization design and evaluation methods

来源：评论

学校读者我要写书评

暂无评论

Fast Approximation of Persistence Diagrams with Guarantees 11

Fast Approximation of Persistence Diagrams with Guarantees

引用

ieee 11th symposium on large data Analysis and visualization (LDAV)

作者： Vidal, Jules Tierny, Julien Sorbonne Univ CNRS Paris France

ISBN: (纸本)9781665432832

This paper presents an algorithm for the efficient approximation of the saddle-extremum persistence diagram of a scalar field. Vidal et al. introduced recently a fast algorithm for such an approximation (by interrupting a progressive computation framework [78]). However, no theoretical guarantee was provided regarding its approximation quality. In this work, we revisit the progressive framework of Vidal et al. [78] and we introduce in contrast a novel approximation algorithm, with a user controlled approximation error, specifically, on the Bottleneck distance to the exact solution. Our approach is based on a hierarchical representation of the input data, and relies on local simplifications of the scalar field to accelerate the computation, while maintaining a controlled bound on the output error. The locality of our approach enables further speedups thanks to shared memory parallelism. Experiments conducted on real life datasets show that for a mild error tolerance (5% relative Bottleneck distance), our approach improves runtime performance by 18% on average (and up to 48% on large, noisy datasets) in comparison to standard, exact, publicly available implementations. In addition to the strong guarantees on its approximation error, we show that our algorithm also provides in practice outputs which are on average 5 times more accurate (in terms of the L-2-Wasserstein distance) than a naive approximation baseline. We illustrate the utility of our approach for interactive data exploration and we document visualization strategies for conveying the uncertainty related to our approximations.

关键词： data analysis Uncertainty Runtime data visualization parallel processing Approximation algorithms Approximation error

来源：评论

学校读者我要写书评

暂无评论

Eurographics symposium on parallel graphics and visualization, EGPGV 2009

Eurographics Symposium on Parallel Graphics and Visualizatio...

引用

9th Eurographics symposium on parallel graphics and visualization, EGPGV 2009

ISBN: (纸本)9783905674156

The proceedings contain 14 papers. The topics discussed include: time-constrained high-fidelity rendering on local desktop grids;interactive physical simulation on multicore architectures;dynamic grid refinement for fluid simulations on parallel graphics architectures;simulation of radio wave propagation by beam tracing;parallelized matrix factorization for fast BTF compression;parallelized matrix factorization for fast BTF compression;fast parallel unbiased diffeomorphic atlas construction on multi-graphics processing units;a flexible adaptation service for distributed rendering;wait-free shared-memory irradiance cache;data-parallel hierarchical link creation for radiosity;and a decomposition approach for optimizing large-scale parallel image composition on multi-core MPP systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：