Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Edward Grundy

dblp:51/7294 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 5 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
2 papers
Visualization and visual analytics · 100%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Computational science and engineering · 60% Bioinformatics and computational biology · 40%

Topics — the 5 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Visualization and visual analytics › scientific visualization › field visualization
vector field visualization
0.112012
Mesh-Driven Vector Field Clustering and Visualization: An Image-Based Approach · IEEE Trans. Vis. Comput. Graph. 2012
Visualization and visual analytics › graph visualization
edge bundling
0.112009
Smooth Graphs for Visual Exploration of Higher-Order State Transitions · IEEE Trans. Vis. Comput. Graph. 2009
Visualization and visual analytics
graph visualization
0.112009
Smooth Graphs for Visual Exploration of Higher-Order State Transitions · IEEE Trans. Vis. Comput. Graph. 2009
Visualization and visual analytics
time series visualization
0.112009
Smooth Graphs for Visual Exploration of Higher-Order State Transitions · IEEE Trans. Vis. Comput. Graph. 2009
Computational science and engineering
computational fluid dynamics
0.012012
Mesh-Driven Vector Field Clustering and Visualization: An Image-Based Approach · IEEE Trans. Vis. Comput. Graph. 2012

Methods — techniques the papers use, named apart from their topics

hierarchical clustering · 0.3error-driven representation · 0.3incremental selection algorithm · 0.2
YearPublicationVenuePosition
2012 State of the Art Report on Video-Based Graphics and Video Visualization
abstract
Abstract In recent years, a collection of new techniques which deal with video as input data, emerged in computer graphics and visualization. In this survey, we report the state of the art in video‐based graphics and video visualization. We provide a review of techniques for making photo‐realistic or artistic computer‐generated imagery from videos, as well as methods for creating summary and/or abstract visual representations to reveal important features and events in videos. We provide a new taxonomy to categorize the concepts and techniques in this newly emerged body of knowledge. To support this review, we also give a concise overview of the major advances in automated video analysis, as some techniques in this field (e.g. feature extraction, detection, tracking and so on) have been featured in video‐based modelling and rendering pipelines for graphics and visualization.
Rita Borgo, Min Chen 0001, Ben Daubney, Edward Grundy, Gunther Heidemann, Benjamin Höferlin, Markus Höferlin, Heike Leitte, Daniel Weiskopf, Xianghua Xie
Comput. Graph. Forum4
2012 Mesh-Driven Vector Field Clustering and Visualization: An Image-Based Approach
abstract
Vector field visualization techniques have evolved very rapidly over the last two decades, however, visualizing vector fields on complex boundary surfaces from computational flow dynamics (CFD) still remains a challenging task. In part, this is due to the large, unstructured, adaptive resolution characteristics of the meshes used in the modeling and simulation process. Out of the wide variety of existing flow field visualization techniques, vector field clustering algorithms offer the advantage of capturing a detailed picture of important areas of the domain while presenting a simplified view of areas of less importance. This paper presents a novel, robust, automatic vector field clustering algorithm that produces intuitive and insightful images of vector fields on large, unstructured, adaptive resolution boundary meshes from CFD. Our bottom-up, hierarchical approach is the first to combine the properties of the underlying vector field and mesh into a unified error-driven representation. The motivation behind the approach is the fact that CFD engineers may increase the resolution of model meshes according to importance. The algorithm has several advantages. Clusters are generated automatically, no surface parameterization is required, and large meshes are processed efficiently. The most suggestive and important information contained in the meshes and vector fields is preserved while less important areas are simplified in the visualization. Users can interactively control the level of detail by adjusting a range of clustering distance measure parameters. We describe two data structures to accelerate the clustering process. We also introduce novel visualizations of clusters inspired by statistical methods. We apply our method to a series of synthetic and complex, real-world CFD meshes to demonstrate the clustering algorithm results.
Zhenmin Peng, Edward Grundy, Robert S. Laramee, Guoning Chen, Nick Croft
IEEE Trans. Vis. Comput. Graph.2
2010 Video Visualization for Snooker Skill Training
abstract
Abstract We present a feasibility study on using video visualization to aid snooker skill training. By involving the coaches and players in the loop of intelligent reasoning, our approach addresses the difficulties of automated semantic reasoning, while benefiting from mature video processing techniques. This work was conducted in conjunction with a snooker club and a sports scientist. In particular, we utilized the principal design of the VideoPerpetuoGram (VPG) to convey spatiotemporal information to the viewers through static visualization, removing the burden of repeated video viewing. We extended the VPG design to accommodate the need for depicting multiple video streams and respective temporal attribute fields, including silhouette extrusion, spatial attributes, and non‐spatial attributes. Our results and evaluation have shown that video visualization can provide snooker coaching with visually quantifiable and comparable summary records, and is thus a cost‐effective means for assessing skill levels and monitoring progress objectively and consistently.
Markus Höferlin, Edward Grundy, Rita Borgo, Daniel Weiskopf, Min Chen 0001, Iwan W. Griffiths, W. Griffiths
Comput. Graph. Forum2
2009 Visualisation of Sensor Data from Animal Movement
abstract
Abstract A new area of biological research is identifying and grouping patterns of behaviour in wild animals by analysing data obtained through the attachment of tri‐axial accelerometers. As these recording devices become smaller and less expensive their use has increased. Currently acceleration data are visualised as 2D time series plots, and analyses are based on summary statistics and the application of Fourier transforms. We develop alternate visualisations of this data so as to analyse, explore and present new patterns of animal behaviour. Our visualisations include interactive spherical scatterplots, spherical histograms, clustering methods, and feature‐based state diagrams of the data. We study the application of these visualisation methods to accelerometry data from animal movement. The reaction of biologists to these visualisations is also reported.
Edward Grundy, Mark W. Jones 0001, Robert S. Laramee, Rory P. Wilson, Emily L. C. Shepard
Comput. Graph. Forum1
2009 Smooth Graphs for Visual Exploration of Higher-Order State Transitions
abstract
In this paper, we present a new visual way of exploring state sequences in large observational time-series. A key advantage of our method is that it can directly visualize higher-order state transitions. A standard first order state transition is a sequence of two states that are linked by a transition. A higher-order state transition is a sequence of three or more states where the sequence of participating states are linked together by consecutive first order state transitions. Our method extends the current state-graph exploration methods by employing a two dimensional graph, in which higher-order state transitions are visualized as curved lines. All transitions are bundled into thick splines, so that the thickness of an edge represents the frequency of instances. The bundling between two states takes into account the state transitions before and after the transition. This is done in such a way that it forms a continuous representation in which any subsequence of the time series is represented by a continuous smooth line. The edge bundles in these graphs can be explored interactively through our incremental selection algorithm.We demonstrate our method with an application in exploring labeled time-series data from a biological survey, where a clustering has assigned a single label to the data at each time-point. In these sequences, a large number of cyclic patterns occur, which in turn are linked to specific activities. We demonstrate how our method helps to find these cycles, and how the interactive selection process helps to find and investigate activities.
Jorik Blaas, Charl P. Botha, Edward Grundy, Mark W. Jones 0001, Robert S. Laramee, Frits H. Post
IEEE Trans. Vis. Comput. Graph.3