Demo Data from SIGIR 2026 / reviewers in the wild / expert
Ian Masters
dblp:70/10542
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2013
0000-0001-7667-6670ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2
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
1 paper |
Visualization and visual analytics · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics
scientific visualization |
0.2 | 1 | 2013 | Similarity Measures for Enhancing Interactive Streamline Seeding · IEEE Trans. Vis. Comput. Graph. 2013 |
Visualization and visual analytics › scientific visualization › field visualization
vector field visualization |
0.2 | 1 | 2013 | Similarity Measures for Enhancing Interactive Streamline Seeding · IEEE Trans. Vis. Comput. Graph. 2013 |
Visualization and visual analytics
visual analytics |
0.0 | 1 | 2013 | Similarity Measures for Enhancing Interactive Streamline Seeding · IEEE Trans. Vis. Comput. Graph. 2013 |
Methods — techniques the papers use, named apart from their topics
similarity measure · 0.2hierarchical clustering · 0.2clustering · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Similarity Measures for Enhancing Interactive Streamline SeedingabstractStreamline seeding rakes are widely used in vector field visualization. We present new approaches for calculating similarity between integral curves (streamlines and pathlines). While others have used similarity distance measures, the computational expense involved with existing techniques is relatively high due to the vast number of euclidean distance tests, restricting interactivity and their use for streamline seeding rakes. We introduce the novel idea of computing streamline signatures based on a set of curve-based attributes. A signature produces a compact representation for describing a streamline. Similarity comparisons are performed by using a popular statistical measure on the derived signatures. We demonstrate that this novel scheme, including a hierarchical variant, produces good clustering results and is computed over two orders of magnitude faster than previous methods. Similarity-based clustering enables filtering of the streamlines to provide a nonuniform seeding distribution along the seeding object. We show that this method preserves the overall flow behavior while using only a small subset of the original streamline set. We apply focus + context rendering using the clusters which allows for faster and easier analysis in cases of high visual complexity and occlusion. The method provides a high level of interactivity and allows the user to easily fine tune the clustering results at runtime while avoiding any time-consuming recomputation. Our method maintains interactive rates even when hundreds of streamlines are used. Tony McLoughlin, Mark W. Jones 0001, Robert S. Laramee, Rami Malki, Ian Masters, Charles D. Hansen |
IEEE Trans. Vis. Comput. Graph. | 5 |
| 2012 | Automatic Stream Surface Seeding: A Feature Centered ApproachabstractAbstract The ability to capture and visualize information within the flow poses challenges for visualizing 3D flow fields. Stream surfaces are one of many useful integration based techniques for visualizing 3D flow. However seeding integral surfaces can be challenging. Previous research generally focuses on manual placement of stream surfaces. Little attention has been given to the problem of automatic stream surface seeding. This paper introduces a novel automatic stream surface seeding strategy based on vector field clustering. It is important that the user can define and target particular characteristics of the flow. Our framework provides this ability. The user is able to specify different vector clustering parameters enabling a range of abstraction for the density and placement of seeding curves and their associated stream surfaces. We demonstrate the effectiveness of this automatic stream surface approach on a range of flow simulations and incorporate illustrative visualization techniques. Domain expert evaluation of the results provides valuable insight into the users requirements and effectiveness of our approach. Matt Edmunds, Robert S. Laramee, Rami Malki, Ian Masters, Nick Croft, Guoning Chen, Eugene Zhang |
Comput. Graph. Forum | 4 |