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

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

作者： Yu, Lina Yu, Hongfeng Univ Nebraska Lincoln NE 68503 USA

ISBN: (纸本)9781509056590

We present a study of scientific visualization on heterogeneous processors using the Legion runtime system. We describe the main functions in our approach to conduct scientific visualization that can consist of multiple operations with different data requirements. Our approach can help users simplify programming on the data partition, data organization and data movement for distributed-memory heterogeneous architectures, thereby facilitating a simultaneous execution of multiple operations on modern and future supercomputers. We demonstrate the scalable performance and the easy usage of our approach by a hybrid data partitioning and distribution scheme for different data types using both CPUs and GPUs on a heterogeneous system.

关键词： Rendering (computer graphics) data visualization graphics processing units Indexes Runtime Image resolution data visualisation Runtime image resolution graphics Processing Unit data types MULTIPLE HEAD OPERATIONS PROCESSOR central processing units

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Orientation-Enhanced parallel Coordinate Plots

引用

ieee TRANSACTIONS ON visualization AND COMPUTER graphics 2016年第1期22卷 589-598页

作者： Raidou, Renata Georgia Eisemann, Martin Breeuwer, Marcel Eisemann, Elmar Vilanova, Anna Eindhoven Univ Technol NL-5600 MB Eindhoven Netherlands Delft Univ Technol NL-2600 AA Delft Netherlands TH Koln Cologne Germany Philips Healthcare Amsterdam Netherlands

parallel Coordinate Plots (PCPs) is one of the most powerful techniques for the visualization of multivariate data. However, for large datasets, the representation suffers from clutter due to overplotting. In this case, discerning the underlying data information and selecting specific interesting patterns can become difficult. We propose a new and simple technique to improve the display of PCPs by emphasizing the underlying data structure. Our Orientation-enhanced parallel Coordinate Plots (OPCPs) improve pattern and outlier discernibility by visually enhancing parts of each PCP polyline with respect to its slope. This enhancement also allows us to introduce a novel and efficient selection method, the Orientation-enhanced Brushing (O-Brushing). Our solution is particularly useful when multiple patterns are present or when the view on certain patterns is obstructed by noise. We present the results of our approach with several synthetic and real-world datasets. Finally, we conducted a user evaluation, which verifies the advantages of the OPCPs in terms of discernibility of information in complex data. It also confirms that O-Brushing eases the selection of data patterns in PCPs and reduces the amount of necessary user interactions compared to state-of-the-art brushing techniques.

关键词： parallel Coordinates Orientation-enhanced parallel Coordinates Brushing Orientation-enhanced Brushing data Readability data Selection

来源：评论

学校读者我要写书评

暂无评论

An Edge-Bundling Layout for Interactive parallel Coordinates

An Edge-Bundling Layout for Interactive Parallel Coordinates

引用

ieee Pacific visualization symposium (PacificVis)

作者： Palmas, Gregorio Bachynskyi, Myroslav Oulasvirta, Antti Seidel, Hans-Peter Weinkauf, Tino MPI Informat Saarbrucken Germany Univ Saarland MPI Informat D-66123 Saarbrucken Germany

ISBN: (纸本)9781479928736

parallel Coordinates is an often used visualization method for multidimensional data sets. Its main challenges for large data sets are visual clutter and overplotting which hamper the recognition of patterns in the data. We present an edge-bundling method using density-based clustering for each dimension. This reduces clutter and provides a faster overview of clusters and trends. Moreover, it allows rendering the clustered lines using polygons, decreasing rendering time remarkably. In addition, we design interactions to support multidimensional clustering with this method. A user study shows improvements over the classic parallel coordinates plot in two user tasks: correlation estimation and subset tracing.

关键词： I. 3.3 [Computer graphics]: Picture/Image Generation-Line and curve generation

来源：评论

学校读者我要写书评

暂无评论

parallel view-dependent isosurface extraction using multi-pass occlusion culling

Parallel view-dependent isosurface extraction using multi-pa...

引用

ieee symposium on parallel and large-data visualization and graphics

作者： Gao, JZ Shen, HW Ohio State Univ Dept Comp & Informat Sci Columbus OH 43210 USA

ISBN: (纸本)0780372239

This paper presents a parallel algorithm that can effectively extracts only the visible portion of isosurfaces. The main focus of our research is to devise a load-balanced and output-sensitive algorithm, that is, each processor will generate approximately the same amount of triangles, and cells that do not contain the visible isosurface will not be visited. A novel multi-pass algorithm is proposed in the paper to achieve these goals. In the algorithm, we first use an octree data structure to rapidly skip the empty cells. An image space visibility culling technique is then used to identify the visible isosurface cells in a progressive manner. To distribute the workload, we use a binary image space partitioning method to ensure that each processor will generate approximately the same amount of triangles. Isosurface extraction and visibility update are performed in parallel to reduce the total computation time. In addition to reducing the size of output geometry and accelerating the process of isosurface extraction, the multi-pass nature of our algorithm can also be used to perform time-critical computation.

关键词： view-dependent occlusion culling isosurface extraction multi-pass algorithm hierarchical data structures

来源：评论

学校读者我要写书评

暂无评论

A Visual Analytics Approach for Categorical Joint Distribution Reconstruction from Marginal Projections

引用

ieee TRANSACTIONS ON visualization AND COMPUTER graphics 2017年第1期23卷 51-60页

作者： Xie, Cong Zhong, Wen Mueller, Klaus SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA

Oftentimes multivariate data are not available as sets of equally multivariate tuples, but only as sets of projections into subspaces spanned by subsets of these attributes. For example, one may find data with five attributes stored in six tables of two attributes each, instead of a single table of five attributes. This prohibits the visualization of these data with standard high-dimensional methods, such as parallel coordinates or MDS, and there is hence the need to reconstruct the full multivariate (joint) distribution from these marginal ones. Most of the existing methods designed for this purpose use an iterative procedure to estimate the joint distribution. With insufficient marginal distributions and domain knowledge, they lead to results whose joint errors can be large. Moreover, enforcing smoothness for regularizations in the joint space is not applicable if the attributes are not numerical but categorical. We propose a visual analytics approach that integrates both anecdotal data and human experts to iteratively narrow down a large set of plausible solutions. The solution space is populated using a Monte Carlo procedure which uniformly samples the solution space. A level-of-detail high dimensional visualization system helps the user understand the patterns and the uncertainties. Constraints that narrow the solution space can then be added by the user interactively during the iterative exploration, and eventually a subset of solutions with narrow uncertainty intervals emerges.

关键词： Joint Distribution Reconstruction Solution Space High-dimensional data Multivariate data parallel Coordinates

来源：评论

学校读者我要写书评

暂无评论

Sort-first, distributed memory parallel visualization and rendering 03

Sort-first, distributed memory parallel visualization and re...

引用

ieee symposium on parallel and large-data visualization and graphics

作者： Bethel, EW Humphreys, G Paul, B Brederson, JD R3vis Corp Novato CA 94948 USA

ISBN: (纸本)078038122X

While commodity computing and graphics hardware has increased in capacity and dropped in cost, it is still quite difficult to make effective use of such systems for general-purpose parallel visualization and graphics. We describe the results of a recent project that provides a software infrastructure suitable for general-purpose use by parallel visualization and graphics applications. Our work combines and extends two technologies: Chromium, a stream-oriented framework that implements the OpenGL programming interface;and OpenRM Scene Graph, a pipelined-parallel scene graph interface for graphics data management, Using this combination we implement a sort-first, distributed memory, parallel volume rendering application. We describe the performance characteristics in terms of bandwidth requirements and highlight key algorithmic considerations needed to implement the sort-first system. We characterize system performance using a distributed memory parallel volume rendering application, and present performance gains realized by using scene specific knowledge to accelerate rendering by reducing network traffic. The contribution of this work is an exploration of general-purpose, sort-first architecture performance characteristics as applied to distributed memory, commodity hardware, along with a description of the algorithmic support needed to realize parallel, sort-first implementations.

关键词： distributed memory visualization parallel visualization parallel scene graph

来源：评论

学校读者我要写书评

暂无评论

Visual clustering in parallel coordinates

引用

COMPUTER graphics FORUM 2008年第3期27卷 1047-1054页

作者： Zhou, Hong Yuan, Xiaoru Qu, Huamin Cui, Weiwei Chen, Baoquan Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China Peking Univ Sch EECS Beijing Peoples R China Peking Univ Key Lab Machine Percept Minist Educ Beijing Peoples R China Chinese Acad Sci Shenzhen Inst Adv Technol Beijing 100864 Peoples R China

parallel coordinates have been widely applied to visualize high-dimensional and multivariate data, discerning patterns within the data through visual clustering. However, the effectiveness of this technique on large data is reduced by edge clutter In this paper, we present a novel framework to reduce edge clutter, consequently improving the effectiveness of visual clustering. We exploit curved edges and optimize the arrangement of these curved edges by minimizing their curvature and maximizing the parallelism of adjacent edges. The overall visual clustering is improved by adjusting the shape of the edges while keeping their relative order The experiments on several representative datasets demonstrate the effectiveness of our approach.

关键词： parallel coordinates visual clustering multi-variate data visualization clutter reduction

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Maximal Clique Enumeration with data-parallel Primitives 7

Maximal Clique Enumeration with Data-Parallel Primitives

引用

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

作者： Lessley, Brenton Perciano, Talita Mathai, Manish Childs, Hank Bethel, E. Wes Univ Oregon Eugene OR 97403 USA Lawrence Berkeley Natl Lab Berkeley CA USA

ISBN: (纸本)9781538606179

The enumeration of all maximal cliques in an undirected graph is a fundamental problem arising in several research areas. We consider maximal clique enumeration on shared-memory, multi-core architectures and introduce an approach consisting entirely of data-parallel operations, in an effort to achieve efficient and portable performance across different architectures. We study the performance of the algorithm via experiments varying over benchmark graphs and architectures. Overall, we observe that our algorithm achieves up to a 33-time speedup and 9-time speedup over state-of-the-art distributed and serial algorithms, respectively, for graphs with higher ratios of maximal cliques to total cliques. Further, we attain additional speedups on a GPU architecture, demonstrating the portable performance of our data-parallel design.

关键词： Arrays Algorithm design and analysis Vegetation data visualization graphics processing units

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：