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

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

作者： Usher, Will Pascucci, Valerio Univ Utah SCI Inst Salt Lake City UT 84112 USA

ISBN: (纸本)9781728184685

Information visualization applications have become ubiquitous, in no small part thanks to the ease of wide distribution and deployment to users enabled by the web browser. Scientific visualization applications, relying on native code libraries and parallel processing, have been less suited to such widespread distribution, as browsers do not provide the required libraries or compute capabilities. In this paper, we revisit this gap in visualization technologies and explore how new web technologies, WebAssembly and WebGPU, can be used to deploy powerful visualization solutions for large-scale scientific data in the browser. In particular, we evaluate the programming effort required to bring scientific visualization applications to the browser through these technologies and assess their competitiveness against classic native solutions. As a main example, we present a new GPU-driven isosurface extraction method for block-compressed data sets, that is suitable for interactive isosurface computation on large volumes in resource-constrained environments, such as the browser. We conclude that web browsers are on the verge of becoming a competitive platform for even the most demanding scientific visualization tasks, such as interactive visualization of isosurfaces from a 1TB DNS simulation. We call on researchers and developers to consider investing in a community software stack to ease use of these upcoming browser features to bring accessible scientific visualization to the browser.

关键词： Web Applications parallel Isosurface Extraction

来源：评论

学校读者我要写书评

暂无评论

Enabling automatic clutter reduction in parallel coordinate plots

Enabling automatic clutter reduction in parallel coordinate ...

引用

ieee visualization Conference (Vis 2006)/ieee symposium on Information visualization (InfoVis 2006)

作者： Ellis, Geoffrey Dix, Alan Univ Lancaster Lancaster LA1 4YW England

We have previously shown that random sampling is an effective clutter reduction technique and that a sampling lens can facilitate focus+context viewing of particular regions. This demands an efficient method of estimating the overlap or occlusion of large numbers of intersecting lines in order to automatically adjust the sampling rate within the lens. This paper proposes several ways for measuring occlusion in parallel coordinate plots. An empirical study into the accuracy and efficiency of the occlusion measures show that a probabilistic approach combined with a 'binning' technique is very fast and yet approaches the accuracy of the more expensive 'true' complete measurement.

关键词： sampling random sampling lens clutter occlusion density reduction overplotting information visualisation parallel coordinates

来源：评论

学校读者我要写书评

暂无评论

visualization and Analysis for Near-Real-Time Decision Making in Distributed Workflows 30

Visualization and Analysis for Near-Real-Time Decision Makin...

引用

30th ieee International parallel and Distributed Processing symposium (IPDPS)

作者： Pugmire, David Kress, James Choi, Jong Klasky, Scott Kurc, Tahsin Churchill, Randy Michael Wolf, Matthew Eisenhauer, Greg Childs, Hank Wu, Kesheng Sim, Alexander Gu, Junmin Low, Jonathan Oak Ridge Natl Lab Oak Ridge TN 37830 USA Univ Oregon Eugene OR 97403 USA SUNY Stony Brook Stony Brook NY USA Princeton Plasma Phys Lab POB 451 Princeton NJ 08543 USA Georgia Inst Technol Atlanta GA 30332 USA Lawrence Berkeley Natl Lab Berkeley CA 94720 USA ASTAR Computat Resource Ctr Singapore Singapore

ISBN: (纸本)9781509036820

data driven science is becoming increasingly more common, complex, and is placing tremendous stresses on visualization and analysis frameworks. data sources producing 10GB per second (and more) are becoming increasingly commonplace in both simulation, sensor and experimental sciences. These data sources, which are often distributed around the world, must be analyzed by teams of scientists that are also distributed. Enabling scientists to view, query and interact with such large volumes of data in near-real-time requires a rich fusion of visualization and analysis techniques, middleware and workflow systems. This paper discusses initial research into visualization and analysis of distributed data workflows that enables scientists to make near-real-time decisions of large volumes of time varying data.

关键词： data visualization

来源：评论

学校读者我要写书评

暂无评论

parallel Peak Pruning for Scalable SMP Contour Tree Computation 6

Parallel Peak Pruning for Scalable SMP Contour Tree Computat...

引用

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

作者： Carr, Hamish A. Weber, Gunther H. Sewell, Christopher M. Ahrens, James P. Univ Leeds Leeds W Yorkshire England Univ Calif Davis Lawrence Berkeley Natl Lab Davis CA 95616 USA Los Alamos Natl Lab Los Alamos NM 87544 USA

ISBN: (纸本)9781509056590

As data sets grow to exascale, automated data analysis and visualisation are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. We report the first shared SMP algorithm for fully parallel contour tree computation, with formal guarantees of O(lgnlgt) parallel steps and O(nlgn) work, and implementations with up to 10x parallel speed up in OpenMP and up to 50x speed up in NVIDIA Thrust.

关键词： topological analysis contour tree merge tree data parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

GPU-based framework for interactive visualization of SAR data

GPU-based framework for interactive visualization of SAR dat...

引用

2007 ieee International Geoscience and Remote Sensing symposium, IGARSS 2007

作者： Lambers, Martin Kolb, Andreas Nies, Holger Kalkuhl, Marc Institute for Vision and Graphics University of Siegen University of Siegen Department of Simulation University of Siegen

ISBN: (纸本)1424412129

Synthetic Aperture Radar data presents specific problems for interactive visualization. The high amount of multiplicative speckle noise has to be reduced. The high dynamic range of the amplitude data must be mapped to the lower dynamic range of display devices in a way that makes image features appropriately visible. In addition to interactive navigation in the data, it is desirable to allow interactive selection of despeckling and dynamic range reduction methods and adjustment of their parameters. graphics processing units (GFUs) can be seen as ubiquitous parallel coprocessors with extreme computational power. In this paper, we propose a GPU-based framework for interactive visualization of SAR data. data management techniques are used to make full use of the GFU. We reworked well-known despeckling and dynamic range reduction techniques for the GPU programming model and implemented them in our framework. Both navigation in large data sets and adjustment of processing parameters are fully interactive. © 2007 ieee.

关键词： Remote sensing

来源：评论

学校读者我要写书评

暂无评论

parallel rendering of 3D AMR data on the SGI/Cray T3E 7

Parallel rendering of 3D AMR data on the SGI/Cray T3E

引用

7th symposium on the Frontiers of Massively parallel Computation (Frontiers 99)

作者： Ma, KL NASA Langley Res Ctr Inst Comp Applicat Sci & Engn Hampton VA 23681 USA

ISBN: (纸本)0769500870

This paper describes work-in-progress on developing parallel visualization strategies for 3D Adaptive Mesh Refinement (AMR) data. AMR is a simple and powerful tool for modeling many important scientific and engineering problems. However visualization tools for 3D AMR data are not generally available. Converting AMR data onto a uniform mesh would result in high storage requirements, and rendering the uniform-mesh data on an average graphics workstation can be painfully slow if not impossible. The adaptive nature of the embedded mesh demands sophisticated visualization calculations. In this work, we compare the performance and storage requirements of a parallel volume renderer for regular-mesh data with a new parallel renderer based on adaptive sampling. While both renderers can achieve interactive visualization, the new approach offers significant performance gains, as indicated by our experiments on the SGI/Cray T3E.

关键词： visualization

来源：评论

学校读者我要写书评

暂无评论

PC-Expo: A Metrics-Based Interactive Axes Reordering Method for parallel Coordinate Displays

引用

ieee Transactions on visualization and Computer graphics 2023年第1期29卷 712-722页

作者： Tyagi, Anjul Estro, Tyler Kuenning, Geoff Zadok, Erez Mueller, Klaus Stony Brook University Computer Science Department New York United States Harvey Mudd College Computer Science Department ClaremontCA United States

parallel coordinate plots (PCPs) have been widely used for high-dimensional (HD) data storytelling because they allow for presenting a large number of dimensions without distortions. The axes ordering in PCP presents a particular story from the data based on the user perception of PCP polylines. Existing works focus on directly optimizing for PCP axes ordering based on some common analysis tasks like clustering, neighborhood, and correlation. However, direct optimization for PCP axes based on these common properties is restrictive because it does not account for multiple properties occurring between the axes, and for local properties that occur in small regions in the data. Also, many of these techniques do not support the human-in-the-loop (HIL) paradigm, which is crucial (i) for explainability and (ii) in cases where no single reordering scheme fits the users' goals. To alleviate these problems, we present PC-Expo, a real-time visual analytics framework for all-in-one PCP line pattern detection and axes reordering. We studied the connection of line patterns in PCPs with different data analysis tasks and datasets. PC-Expo expands prior work on PCP axes reordering by developing real-time, local detection schemes for the 12 most common analysis tasks (properties). Users can choose the story they want to present with PCPs by optimizing directly over their choice of properties. These properties can be ranked, or combined using individual weights, creating a custom optimization scheme for axes reordering. Users can control the granularity at which they want to work with their detection scheme in the data, allowing exploration of local regions. PC-Expo also supports HIL axes reordering via local-property visualization, which shows the regions of granular activity for every axis pair. Local-property visualization is helpful for PCP axes reordering based on multiple properties, when no single reordering scheme fits the user goals. A comprehensive evaluation was done with r

关键词： data visualization

来源：评论

学校读者我要写书评

暂无评论

parallel visualization of large-scale aerodynamics calculations: A case study on the cray T3E

Parallel visualization of large-scale aerodynamics calculati...

引用

1999 ieee symposium on parallel visualization and graphics, PVGS 1999

作者： Ma, Kwan-Liu Crockett, Thomas W. University of California Department of Computer Science UC Davis One Shields Avenue DavisCA95616-8562 United States NASA Langley Research Center MS 132C HamptonVA23681-2199 United States

ISBN: (纸本)1581132379

This paper reports the performance of a parallel volume rendering algorithm for visualizing a large-scale unstructured-grid dataset produced by a three-dimensional aerodynamics simulation. This dataset, containing over 18 million tetrahedra, allows us to extend our performance results to a problem which is more than 30 times larger than the one we examined previously. This high resolution dataset also allows us to see fine, three-dimensional features in the flow field. All our tests were performed on the SGI/Cray T3E operated by NASA's Goddard Space Flight Center. Using 511 processors, a rendering rate of almost 9 million tetrahedra/second was achieved with a parallel overhead of 26%.

关键词： Volume rendering

来源：评论

学校读者我要写书评

暂无评论

A flexible Java GPU-enhanced visualization framework and its applications

A flexible Java GPU-enhanced visualization framework and its...

引用

25th International symposium on Computer-Based Medical Systems (CBMS)

作者： Cheng, Ruida Senseney, Justin Pandya, Nishith McCreedy, Evan McAuliffe, Matthew J. Bokinsky, Alexandra Natl Inst Hlth Imaging Sci Lab Ctr Informat Technol Bethesda MD 20892 USA Geometr Tools Inc Chapel Hill NC USA

ISBN: (纸本)9781467320511

A flexible biomedical visualization framework implemented with Java, OpenGL, and OpenCL performs efficient volume rendering with large, multi-modal datasets. The,framework takes advantage of the parallel processing power on modern graphics hardware with novel Open CL and GLSL shading language implementations. The Java and GPU environment provide portable advanced biomedical image visualization applications. Several applications built on top of the GPU framework are also presented to show the extensibility of the application. These include multi-surface rendering, stereoscopic rendering, image fusion, and diffusion tensor visualization.

关键词： graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

A rank-by-feature framework for unsupervised multidimensional data exploration using low dimensional projections

A rank-by-feature framework for unsupervised multidimensiona...

引用

10th Annual ieee symposium on Information visualization (InfoVis 2004)

作者： Seo, J Shneiderman, B Univ Maryland Dept Comp Sci College Pk MD 20742 USA

ISBN: (纸本)0780387791

Exploratory analysis of multidimensional data sets is challenging because of the difficulty in comprehending more than three dimensions. Two fundamental statistical principles for the exploratory analysis are (1) to examine each dimension first and then find relationships among dimensions, and (2) to try graphical displays first and then find numerical summaries [1]. We implement these principles in a novel conceptual framework called the rank-by-feature framework. In the framework, users can choose a ranking criterion interesting to them and sort I D or 2D axis-parallel projections according to the criterion. We introduce the rank-by-feature prism that is a color-coded lower-triangular matrix that guides users to desired features. Statistical graphs (histogram, boxplot, and scatterplot) and information visualization techniques (overview, coordination, and dynamic query) are combined to help users effectively traverse ID and 2D axis-parallel projections, and finally to help them interactively find interesting features.

关键词： information visualization exploratory data analysis dynamic query feature detection/selection statistical graphics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：