Conference,Year,Title,DOI,Link,FirstPage,LastPage,PaperType,Abstract,AuthorNames-Deduped,AuthorNames,AuthorAffiliation,InternalReferences,AuthorKeywords,AminerCitationCount_04-2020,XploreCitationCount - 2021-02,PubsCited,Award
InfoVis,2011,D³ Data-Driven Documents,10.1109/TVCG.2011.185,http://dx.doi.org/10.1109/TVCG.2011.185,2301,2309,J,"Data-Driven Documents (D3) is a novel representation-transparent approach to visualization for the web. Rather than hide the underlying scenegraph within a toolkit-specific abstraction, D3 enables direct inspection and manipulation of a native representation: the standard document object model (DOM). With D3, designers selectively bind input data to arbitrary document elements, applying dynamic transforms to both generate and modify content. We show how representational transparency improves expressiveness and better integrates with developer tools than prior approaches, while offering comparable notational efficiency and retaining powerful declarative components. Immediate evaluation of operators further simplifies debugging and allows iterative development. Additionally, we demonstrate how D3 transforms naturally enable animation and interaction with dramatic performance improvements over intermediate representations.",Michael Bostock;Vadim Ogievetsky;Jeffrey Heer,Michael Bostock;Vadim Ogievetsky;Jeffrey Heer,,10.1109/INFVIS.2000.885091;10.1109/INFVIS.2000.885098;10.1109/TVCG.2010.144;10.1109/TVCG.2009.174;10.1109/INFVIS.2004.12;10.1109/TVCG.2006.178;10.1109/INFVIS.2005.1532122;10.1109/TVCG.2008.166;10.1109/INFVIS.2004.64;10.1109/TVCG.2007.70539,"Information visualization, user interfaces, toolkits, 2D graphics",1537,1197,41,
Vis,1991,Tree-maps: a space-filling approach to the visualization of hierarchical information structures,10.1109/VISUAL.1991.175815,http://dx.doi.org/10.1109/VISUAL.1991.175815,284,291,C,"A method for visualizing hierarchically structured information is described. The tree-map visualization technique makes 100% use of the available display space, mapping the full hierarchy onto a rectangular region in a space-filling manner. This efficient use of space allows very large hierarchies to be displayed in their entirety and facilitates the presentation of semantic information. Tree-maps can depict both the structure and content of the hierarchy. However, the approach is best suited to hierarchies in which the content of the leaf nodes and the structure of the hierarchy are of primary importance, and the content information associated with internal nodes is largely derived from their children.<<ETX>>",Brian Johnson;Ben Shneiderman,B. Johnson;B. Shneiderman,"Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA;Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA",,,1132,423,23,
Vis,1990,Parallel coordinates: a tool for visualizing multi-dimensional geometry,10.1109/VISUAL.1990.146402,http://dx.doi.org/10.1109/VISUAL.1990.146402,361,378,C,"A methodology for visualizing analytic and synthetic geometry in R/sup N/ is presented. It is based on a system of parallel coordinates which induces a nonprojective mapping between N-dimensional and two-dimensional sets. Hypersurfaces are represented by their planar images which have some geometrical properties analogous to the properties of the hypersurface that they represent. A point from to line duality when N=2 generalizes to lines and hyperplanes enabling the representation of polyhedra in R/sup N/. The representation of a class of convex and non-convex hypersurfaces is discussed, together with an algorithm for constructing and displaying any interior point. The display shows some local properties of the hypersurface and provides information on the point's proximity to the boundary. Applications are discussed.<<ETX>>",Alfred Inselberg;Bernard Dimsdale,A. Inselberg;B. Dimsdale,"IBM Sci. Center, Los Angeles, CA, USA;IBM Sci. Center, Los Angeles, CA, USA",,,963,373,47,
InfoVis,2006,Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data,10.1109/TVCG.2006.147,http://dx.doi.org/10.1109/TVCG.2006.147,741,748,J,"A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., non-hierarchical edges, together. We realize this as follows. We assume that the hierarchy is shown via a standard tree visualization method. Next, we bend each adjacency edge, modeled as a B-spline curve, toward the polyline defined by the path via the inclusion edges from one node to another. This hierarchical bundling reduces visual clutter and also visualizes implicit adjacency edges between parent nodes that are the result of explicit adjacency edges between their respective child nodes. Furthermore, hierarchical edge bundling is a generic method which can be used in conjunction with existing tree visualization techniques. We illustrate our technique by providing example visualizations and discuss the results based on an informal evaluation provided by potential users of such visualizations",Danny Holten,Danny Holten,,10.1109/INFVIS.2004.1;10.1109/INFVIS.2003.1249008;10.1109/INFVIS.2005.1532150;10.1109/INFVIS.2003.1249030;10.1109/INFVIS.2005.1532129;10.1109/INFVIS.1997.636718;10.1109/INFVIS.2002.1173152,"Network visualization, edge bundling, edge aggregation, edge concentration, curves, graph visualization, tree visualization, node-link diagrams, hierarchies, treemaps",700,507,33,TT;BP
Vis,1997,ROAMing terrain: Real-time Optimally Adapting Meshes,10.1109/VISUAL.1997.663860,http://dx.doi.org/10.1109/VISUAL.1997.663860,81,88,C,"Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and ground-based aircraft testing using synthetic sensor simulation. On current graphics hardware, the problem is to maintain dynamic, view-dependent triangle meshes and texture maps that produce good images at the required frame rate. We present an algorithm for constructing triangle meshes that optimizes flexible view-dependent error metrics, produces guaranteed error bounds, achieves specified triangle counts directly and uses frame-to-frame coherence to operate at high frame rates for thousands of triangles per frame. Our method, dubbed Real-time Optimally Adapting Meshes (ROAM), uses two priority queues to drive split and merge operations that maintain continuous triangulations built from pre-processed bintree triangles. We introduce two additional performance optimizations: incremental triangle stripping and priority-computation deferral lists. ROAM's execution time is proportional to the number of triangle changes per frame, which is typically a few percent of the output mesh size; hence ROAM's performance is insensitive to the resolution and extent of the input terrain. Dynamic terrain and simple vertex morphing are supported.",Mark A. Duchaineau;Murray Wolinsky;David E. Sigeti;Mark C. Miller;Charles Aldrich;Mark B. Mineev-Weinstein,M. Duchaineau;M. Wolinsky;D.E. Sigeti;M.C. Miller;C. Aldrich;M.B. Mineev-Weinstein,"Los Alamos Nat. Lab., NM, USA",10.1109/VISUAL.1996.567600;10.1109/VISUAL.1996.568126;10.1109/VISUAL.1996.568125;10.1109/VISUAL.1995.480813;10.1109/VISUAL.1995.480805,"triangle bintree, view-dependent mesh, frame-to-frame coherence, greedy algorithms",615,207,19,
Vis,2003,Acceleration techniques for GPU-based volume rendering,10.1109/VISUAL.2003.1250384,http://dx.doi.org/10.1109/VISUAL.2003.1250384,287,292,C,"Nowadays, direct volume rendering via 3D textures has positioned itself as an efficient tool for the display and visual analysis of volumetric scalar fields. It is commonly accepted, that for reasonably sized data sets appropriate quality at interactive rates can be achieved by means of this technique. However, despite these benefits one important issue has received little attention throughout the ongoing discussion of texture based volume rendering: the integration of acceleration techniques to reduce per-fragment operations. In this paper, we address the integration of early ray termination and empty-space skipping into texture based volume rendering on graphical processing units (GPU). Therefore, we describe volume ray-casting on programmable graphics hardware as an alternative to object-order approaches. We exploit the early z-test to terminate fragment processing once sufficient opacity has been accumulated, and to skip empty space along the rays of sight. We demonstrate performance gains up to a factor of 3 for typical renditions of volumetric data sets on the ATI 9700 graphics card.",Jens H. Krüger;Rüdiger Westermann,J. Kruger;R. Westermann,"Comput. Graphics & Visualization Group, Tech. Univ. Munich, Germany;Comput. Graphics & Visualization Group, Tech. Univ. Munich, Germany",10.1109/VISUAL.1999.809889;10.1109/VISUAL.1997.663880;10.1109/VISUAL.1993.398852;10.1109/VISUAL.2002.1183764,"Volume Rendering, Programmable Graphics Hardware, Ray-Casting",606,247,16,TT
Vis,2002,Efficient simplification of point-sampled surfaces,10.1109/VISUAL.2002.1183771,http://dx.doi.org/10.1109/VISUAL.2002.1183771,163,170,C,"We introduce, analyze and quantitatively compare a number of surface simplification methods for point-sampled geometry. We have implemented incremental and hierarchical clustering, iterative simplification, and particle simulation algorithms to create approximations of point-based models with lower sampling density. All these methods work directly on the point cloud, requiring no intermediate tesselation. We show how local variation estimation and quadric error metrics can be employed to diminish the approximation error and concentrate more samples in regions of high curvature. To compare the quality of the simplified surfaces, we have designed a new method for computing numerical and visual error estimates for point-sampled surfaces. Our algorithms are fast, easy to implement, and create high-quality surface approximations, clearly demonstrating the effectiveness of point-based surface simplification.",Mark Pauly;Markus H. Gross;Leif Kobbelt,M. Pauly;M. Gross;L.P. Kobbelt,"Eidgenossische Tech. Hochschule, Zurich, Switzerland;Eidgenossische Tech. Hochschule, Zurich, Switzerland",10.1109/VISUAL.2001.964503;10.1109/VISUAL.1999.809896;10.1109/VISUAL.2001.964502;10.1109/VISUAL.2001.964489;10.1109/VISUAL.2000.885722,,594,295,32,
InfoVis,2005,Vizster: visualizing online social networks,10.1109/INFVIS.2005.1532126,http://dx.doi.org/10.1109/INFVIS.2005.1532126,32,39,C,"Recent years have witnessed the dramatic popularity of online social networking services, in which millions of members publicly articulate mutual ""friendship"" relations. Guided by ethnographic research of these online communities, we have designed and implemented a visualization system for playful end-user exploration and navigation of large scale online social networks. Our design builds upon familiar node link network layouts to contribute customized techniques for exploring connectivity in large graph structures, supporting visual search and analysis, and automatically identifying and visualizing community structures. Both public installation and controlled studies of the system provide evidence of the system's usability, capacity for facilitating discovery, and potential for fun and engaged social activity",Jeffrey Heer;Danah Boyd,J. Heer;D. Boyd,,10.1109/INFVIS.2004.1,"social networks, visualization, graphs, community,data mining, exploration, play",592,97,21,
Vis,2001,Point set surfaces,10.1109/VISUAL.2001.964489,http://dx.doi.org/10.1109/VISUAL.2001.964489,21,28,C,"We advocate the use of point sets to represent shapes. We provide a definition of a smooth manifold surface from a set of points close to the original surface. The definition is based on local maps from differential geometry, which are approximated by the method of moving least squares (MLS). We present tools to increase or decrease the density of the points, thus, allowing an adjustment of the spacing among the points to control the fidelity of the representation. To display the point set surface, we introduce a novel point rendering technique. The idea is to evaluate the local maps according to the image resolution. This results in high quality shading effects and smooth silhouettes at interactive frame rates.",Marc Alexa;Johannes Behr;Daniel Cohen-Or;Shachar Fleishman;David Levin;Cláudio T. Silva,M. Alexa;J. Behr;D. Cohen-Or;S. Fleishman;D. Levin;C.T. Silva,"Technische Hochschule Darmstadt, Germany",10.1109/VISUAL.1997.663930;10.1109/VISUAL.1998.745327,"surface representation and reconstruction, moving least squares, point sample rendering, 3D acquisition",579,232,46,
InfoVis,2007,ManyEyes: a Site for Visualization at Internet Scale,10.1109/TVCG.2007.70577,http://dx.doi.org/10.1109/TVCG.2007.70577,1121,1128,J,"We describe the design and deployment of Many Eyes, a public Web site where users may upload data, create interactive visualizations, and carry on discussions. The goal of the site is to support collaboration around visualizations at a large scale by fostering a social style of data analysis in which visualizations not only serve as a discovery tool for individuals but also as a medium to spur discussion among users. To support this goal, the site includes novel mechanisms for end-user creation of visualizations and asynchronous collaboration around those visualizations. In addition to describing these technologies, we provide a preliminary report on the activity of our users.",Fernanda B. Viégas;Martin Wattenberg;Frank van Ham;Jesse Kriss;Matthew M. McKeon,Fernanda B. Viegas;Martin Wattenberg;Frank van Ham;Jesse Kriss;Matt McKeon,IEEE Computer Society;IEEE Computer Society,10.1109/INFVIS.2005.1532122;10.1109/VISUAL.1991.175820;10.1109/INFVIS.2003.1249007,"Visualization, World Wide Web, Social Software, Social Data Analysis, Communication-Minded Visualization",565,305,30,TT
InfoVis,1995,Visualizing the non-visual: spatial analysis and interaction with information from text documents,10.1109/INFVIS.1995.528686,http://dx.doi.org/10.1109/INFVIS.1995.528686,51,58,C,"The paper describes an approach to IV that involves spatializing text content for enhanced visual browsing and analysis. The application arena is large text document corpora such as digital libraries, regulations and procedures, archived reports, etc. The basic idea is that text content from these sources may be transformed to a spatial representation that preserves informational characteristics from the documents. The spatial representation may then be visually browsed and analyzed in ways that avoid language processing and that reduce the analysts mental workload. The result is an interaction with text that more nearly resembles perception and action with the natural world than with the abstractions of written language.",James A. Wise;James J. Thomas;Kelly Pennock;D. Lantrip;M. Pottier;Anne Schur;V. Crow,J.A. Wise;J.J. Thomas;K. Pennock;D. Lantrip;M. Pottier;A. Schur;V. Crow,"Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA;Pacific Northwest Lab., Richland, WA, USA",10.1109/VISUAL.1993.398863,,563,213,11,TT
InfoVis,2007,Toward a Deeper Understanding of the Role of Interaction in Information Visualization,10.1109/TVCG.2007.70515,http://dx.doi.org/10.1109/TVCG.2007.70515,1224,1231,J,"Even though interaction is an important part of information visualization (Infovis), it has garnered a relatively low level of attention from the Infovis community. A few frameworks and taxonomies of Infovis interaction techniques exist, but they typically focus on low-level operations and do not address the variety of benefits interaction provides. After conducting an extensive review of Infovis systems and their interactive capabilities, we propose seven general categories of interaction techniques widely used in Infovis: 1) Select, 2) Explore, 3) Reconfigure, 4) Encode, 5) Abstract/Elaborate, 6) Filter, and 7) Connect. These categories are organized around a user's intent while interacting with a system rather than the low-level interaction techniques provided by a system. The categories can act as a framework to help discuss and evaluate interaction techniques and hopefully lay an initial foundation toward a deeper understanding and a science of interaction.",Ji Soo Yi;Youn ah Kang;John T. Stasko;Julie A. Jacko,Ji Soo Yi;Youn ah Kang;John Stasko,"Health Systems Institute & H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology;School of Interactive Computing & GVU Center, Georgia Institute of Technology;School of Interactive Computing & GVU Center, Georgia Institute of Technology",10.1109/VISUAL.1994.346302;10.1109/INFVIS.2005.1532136;10.1109/INFVIS.1996.559213;10.1109/VISUAL.1991.175794;10.1109/INFVIS.2005.1532126;10.1109/INFVIS.2000.885091;10.1109/INFVIS.1999.801860;10.1109/INFVIS.2000.885086,"Information visualization, interaction, interaction techniques, taxonomy, visual analytics",526,387,56,
InfoVis,2000,"Polaris: a system for query, analysis and visualization of multi-dimensional relational databases",10.1109/INFVIS.2000.885086,http://dx.doi.org/10.1109/INFVIS.2000.885086,5,14,C,"In the last several years, large multi-dimensional databases have become common in a variety of applications such as data warehousing and scientific computing. Analysis and exploration tasks place significant demands on the interfaces to these databases. Because of the size of the data sets, dense graphical representations are more effective for exploration than spreadsheets and charts. Furthermore, because of the exploratory nature of the analysis, it must be possible for the analysts to change visualizations rapidly as they pursue a cycle involving first hypothesis and then experimentation. The authors present Polaris, an interface for exploring large multi-dimensional databases that extends the well-known Pivot Table interface. The novel features of Polaris include an interface for constructing visual specifications of table based graphical displays and the ability to generate a precise set of relational queries from the visual specifications. The visual specifications can be rapidly and incrementally developed, giving the analyst visual feedback as they construct complex queries and visualizations.",Chris Stolte;Pat Hanrahan,C. Stolte;P. Hanrahan,"Dept. of Comput. Sci., Stanford Univ., CA, USA",10.1109/INFVIS.1996.559210,,476,18,29,TT
Vis,1998,Smooth view-dependent level-of-detail control and its application to terrain rendering,10.1109/VISUAL.1998.745282,http://dx.doi.org/10.1109/VISUAL.1998.745282,35,42,C,"The key to real-time rendering of large-scale surfaces is to locally adapt surface geometric complexity to changing view parameters. Several schemes have been developed to address this problem of view-dependent level-of-detail control. Among these, the view-dependent progressive mesh (VDPM) framework represents an arbitrary triangle mesh as a hierarchy of geometrically optimized refinement transformations, from which accurate approximating meshes can be efficiently retrieved. In this paper we extend the general VDPM framework to provide temporal coherence through the run-time creation of geomorphs. These geomorphs eliminate ""popping"" artifacts by smoothly interpolating geometry. Their implementation requires new output-sensitive data structures, which have the added benefit of reducing memory use. We specialize the VDPM framework to the important case of terrain rendering. To handle huge terrain grids, we introduce a block-based simplification scheme that constructs a progressive mesh as a hierarchy of block refinements. We demonstrate the need for an accurate approximation metric during simplification. Our contributions are highlighted in a real-time flyover of a large, rugged terrain. Notably, the use of geomorphs results in visually smooth rendering even at 72 frames/sec on a graphics workstation.",Hugues Hoppe,H. Hoppe,"Microsoft Res., USA",10.1109/VISUAL.1997.663865;10.1109/VISUAL.1996.567600;10.1109/VISUAL.1996.568126;10.1109/VISUAL.1997.663860;10.1109/VISUAL.1997.663908,,456,186,23,
Vis,1991,The asymptotic decider: resolving the ambiguity in marching cubes,10.1109/VISUAL.1991.175782,http://dx.doi.org/10.1109/VISUAL.1991.175782,83,"91, 413",C,"A method for computing isovalue or contour surfaces of a trivariate function is discussed. The input data are values of the trivariate function, F/sub ijk/, at the cuberille grid points (x/sub i/, y/sub j/, z/sub k/), and the output of a collection of triangles representing the surface consisting of all points where F(x,y,z) is a constant value. The method is a modification that is intended to correct a problem with a previous method.<<ETX>>",Gregory M. Nielson;Bernd Hamann,G.M. Nielson;B. Hamann,"Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA;Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA",10.1109/VISUAL.1990.146363,,405,181,16,
InfoVis,2010,Narrative Visualization: Telling Stories with Data,10.1109/TVCG.2010.179,http://dx.doi.org/10.1109/TVCG.2010.179,1139,1148,J,"Data visualization is regularly promoted for its ability to reveal stories within data, yet these “data stories” differ in important ways from traditional forms of storytelling. Storytellers, especially online journalists, have increasingly been integrating visualizations into their narratives, in some cases allowing the visualization to function in place of a written story. In this paper, we systematically review the design space of this emerging class of visualizations. Drawing on case studies from news media to visualization research, we identify distinct genres of narrative visualization. We characterize these design differences, together with interactivity and messaging, in terms of the balance between the narrative flow intended by the author (imposed by graphical elements and the interface) and story discovery on the part of the reader (often through interactive exploration). Our framework suggests design strategies for narrative visualization, including promising under-explored approaches to journalistic storytelling and educational media.",Edward Segel;Jeffrey Heer,Edward Segel;Jeffrey Heer,Stanford University;Stanford University,10.1109/TVCG.2007.70577;10.1109/TVCG.2007.70539;10.1109/TVCG.2008.137;10.1109/VAST.2007.4388992,"Narrative visualization, storytelling, design methods, case study, journalism, social data analysis",404,319,27,TT
Vis,1998,Simplifying surfaces with color and texture using quadric error metrics,10.1109/VISUAL.1998.745312,http://dx.doi.org/10.1109/VISUAL.1998.745312,263,269,C,"There are a variety of application areas in which there is a need for simplifying complex polygonal surface models. These models often have material properties such as colors, textures, and surface normals. Our surface simplification algorithm, based on iterative edge contraction and quadric error metrics, can rapidly produce high quality approximations of such models. We present a natural extension of our original error metric that can account for a wide range of vertex attributes.",Michael Garland;Paul S. Heckbert,M. Garland;P.S. Heckbert,"Carnegie Mellon Univ., Pittsburgh, PA, USA",10.1109/VISUAL.1997.663908,"surface simplification, multiresolution modeling, level of detail, quadric error metric, edge contraction, surface properties, discontinuity preservation",386,161,19,
InfoVis,2009,A Nested Model for Visualization Design and Validation,10.1109/TVCG.2009.111,http://dx.doi.org/10.1109/TVCG.2009.111,921,928,J,"We present a nested model for the visualization design and validation with four layers: characterize the task and data in the vocabulary of the problem domain, abstract into operations and data types, design visual encoding and interaction techniques, and create algorithms to execute techniques efficiently. The output from a level above is input to the level below, bringing attention to the design challenge that an upstream error inevitably cascades to all downstream levels. This model provides prescriptive guidance for determining appropriate evaluation approaches by identifying threats to validity unique to each level. We also provide three recommendations motivated by this model: authors should distinguish between these levels when claiming contributions at more than one of them, authors should explicitly state upstream assumptions at levels above the focus of a paper, and visualization venues should accept more papers on domain characterization.",Tamara Munzner,Tamara Munzner,University of British Columbia,10.1109/VAST.2007.4389008;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2008.117;10.1109/TVCG.2006.160;10.1109/VISUAL.1998.745289;10.1109/TVCG.2007.70515;10.1109/TVCG.2008.109;10.1109/VISUAL.1992.235203;10.1109/INFVIS.2004.59;10.1109/INFVIS.2005.1532124;10.1109/INFVIS.1998.729560;10.1109/INFVIS.2004.10;10.1109/TVCG.2008.125;10.1109/INFVIS.1997.636792;10.1109/INFVIS.2005.1532150;10.1109/VISUAL.1990.146375,"Models, frameworks, design, evaluation",382,345,53,TT
Vis,1994,XmdvTool: integrating multiple methods for visualizing multivariate data,10.1109/VISUAL.1994.346302,http://dx.doi.org/10.1109/VISUAL.1994.346302,326,333,C,"Much of the attention in visualization research has focussed on data rooted in physical phenomena, which is generally limited to three or four dimensions. However, many sources of data do not share this dimensional restriction. A critical problem in the analysis of such data is providing researchers with tools to gain insights into characteristics of the data, such as anomalies and patterns. Several visualization methods have been developed to address this problem, and each has its strengths and weaknesses. This paper describes a system named XmdvTool which integrates several of the most common methods for projecting multivariate data onto a two-dimensional screen. This integration allows users to explore their data in a variety of formats with ease. A view enhancement mechanism called an N-dimensional brush is also described. The brush allows users to gain insights into spatial relationships over N dimensions by highlighting data which falls within a user-specified subspace.<<ETX>>",Matthew O. Ward,M.O. Ward,"Dept. of Comput. Sci., Worcester Polytech. Inst., MA, USA",10.1109/VISUAL.1990.146386;10.1109/VISUAL.1990.146387;10.1109/VISUAL.1990.146402,,379,171,16,
InfoVis,2000,A taxonomy of visualization techniques using the data state reference model,10.1109/INFVIS.2000.885092,http://dx.doi.org/10.1109/INFVIS.2000.885092,69,75,C,"In previous work, researchers have attempted to construct taxonomies of information visualization techniques by examining the data domains that are compatible with these techniques. This is useful because implementers can quickly identify various techniques that can be applied to their domain of interest. However, these taxonomies do not help the implementers understand how to apply and implement these techniques. The author extends and proposes a new way to taxonomize information visualization techniques by using the Data State Model (E.H. Chi and J.T. Reidl, 1998). In fact, as the taxonomic analysis in the paper will show, many of the techniques share similar operating steps that can easily be reused. The paper shows that the Data State Model not only helps researchers understand the space of design, but also helps implementers understand how information visualization techniques can be applied more broadly.",Ed H. Chi,E.H. Chi,"Xerox Palo Alto Res. Center, CA, USA",10.1109/INFVIS.1997.636761;10.1109/INFVIS.1997.636792;10.1109/INFVIS.1998.729560,"Information Visualization, Data State Model,Reference Model, Taxonomy, Techniques, Operators",371,177,8,
InfoVis,2007,NodeTrix: a Hybrid Visualization of Social Networks,10.1109/TVCG.2007.70582,http://dx.doi.org/10.1109/TVCG.2007.70582,1302,1309,J,"The need to visualize large social networks is growing as hardware capabilities make analyzing large networks feasible and many new data sets become available. Unfortunately, the visualizations in existing systems do not satisfactorily resolve the basic dilemma of being readable both for the global structure of the network and also for detailed analysis of local communities. To address this problem, we present NodeTrix, a hybrid representation for networks that combines the advantages of two traditional representations: node-link diagrams are used to show the global structure of a network, while arbitrary portions of the network can be shown as adjacency matrices to better support the analysis of communities. A key contribution is a set of interaction techniques. These allow analysts to create a NodeTrix visualization by dragging selections to and from node-link and matrix forms, and to flexibly manipulate the NodeTrix representation to explore the dataset and create meaningful summary visualizations of their findings. Finally, we present a case study applying NodeTrix to the analysis of the InfoVis 2004 coauthorship dataset to illustrate the capabilities of NodeTrix as both an exploration tool and an effective means of communicating results.",Nathalie Henry Riche;Jean-Daniel Fekete;Michael J. McGuffin,Nathalie Henry;Jean-Daniel Fekete;Michael J. McGuffin,"INRIA Futurs/University Paris-Sud, France and University of Sydney, Australia;INRIA Futurs, France;Ontario Cancer Institute and University of Toronto, Canada",10.1109/TVCG.2006.160;10.1109/VAST.2006.261426;10.1109/INFVIS.2005.1532126;10.1109/INFVIS.2004.46;10.1109/TVCG.2006.193;10.1109/INFVIS.2005.1532129;10.1109/TVCG.2006.166;10.1109/TVCG.2006.147;10.1109/INFVIS.2004.64;10.1109/INFVIS.2003.1249011,"Network visualization, Matrix visualization, Hybrid visualization, Aggregation, Interaction",344,267,35,
Vis,1999,Hierarchical parallel coordinates for exploration of large datasets,10.1109/VISUAL.1999.809866,http://dx.doi.org/10.1109/VISUAL.1999.809866,43,508,C,"Our ability to accumulate large, complex (multivariate) data sets has far exceeded our ability to effectively process them in searching for patterns, anomalies and other interesting features. Conventional multivariate visualization techniques generally do not scale well with respect to the size of the data set. The focus of this paper is on the interactive visualization of large multivariate data sets based on a number of novel extensions to the parallel coordinates display technique. We develop a multi-resolution view of the data via hierarchical clustering, and use a variation of parallel coordinates to convey aggregation information for the resulting clusters. Users can then navigate the resulting structure until the desired focus region and level of detail is reached, using our suite of navigational and filtering tools. We describe the design and implementation of our hierarchical parallel coordinates system which is based on extending the XmdvTool system. Lastly, we show examples of the tools and techniques applied to large (hundreds of thousands of records) multivariate data sets.",Ying-Huey Fua;Matthew O. Ward;Elke A. Rundensteiner,Ying-Huey Fua;M.O. Ward;E.A. Rundensteiner,"Dept. of Comput. Sci., Worcester Polytech. Inst., MA, USA",10.1109/VISUAL.1994.346302;10.1109/INFVIS.1999.801858;10.1109/VISUAL.1996.567800;10.1109/VISUAL.1995.485140;10.1109/VISUAL.1990.146386;10.1109/VISUAL.1990.146402;10.1109/INFVIS.1998.729556;10.1109/VISUAL.1995.485139,"Large-scale multivariate data visualization, hierarchical data exploration, parallel coordinates",341,59,32,
VAST,2007,Jigsaw: Supporting Investigative Analysis through Interactive Visualization,10.1109/VAST.2007.4389006,http://dx.doi.org/10.1109/VAST.2007.4389006,131,138,C,"Investigative analysts who work with collections of text documents connect embedded threads of evidence in order to formulate hypotheses about plans and activities of potential interest. As the number of documents and the corresponding number of concepts and entities within the documents grow larger, sense-making processes become more and more difficult for the analysts. We have developed a visual analytic system called Jigsaw that represents documents and their entities visually in order to help analysts examine reports more efficiently and develop theories about potential actions more quickly. Jigsaw provides multiple coordinated views of document entities with a special emphasis on visually illustrating connections between entities across the different documents.",John T. Stasko;Carsten Görg;Zhicheng Liu;Kanupriya Singhal,John Stasko;Carsten Gorg;Zhicheng Liu;Kanupriya Singhal,"School of Interactive Computing & GVU Center, Georgia Institute of Technology. e-mail: stasko@cc.gatech.edu;School of Interactive Computing & GVU Center, Georgia Institute of Technology. e-mail: goerg@cc.gatech.edu;School of Interactive Computing & GVU Center, Georgia Institute of Technology. e-mail: zcliu@cc.gatech.edu;School of Interactive Computing & GVU Center, Georgia Institute of Technology. e-mail: ksinghal@cc.gatech.edu",10.1109/INFVIS.1995.528686;10.1109/INFVIS.2004.27;10.1109/VAST.2006.261432,"Visual analytics, investigative analysis, intelligence analysis, information visualization, multiple views",340,68,24,TT
Vis,2001,Interactive volume rendering using multi-dimensional transfer functions and direct manipulation widgets,10.1109/VISUAL.2001.964519,http://dx.doi.org/10.1109/VISUAL.2001.964519,255,262,C,"Most direct volume renderings produced today employ one-dimensional transfer functions, which assign color and opacity to the volume based solely on the single scalar quantity which comprises the dataset. Though they have not received widespread attention, multi-dimensional transfer functions are a very effective way to extract specific material boundaries and convey subtle surface properties. However, identifying good transfer functions is difficult enough in one dimension, let alone two or three dimensions. This paper demonstrates an important class of three-dimensional transfer functions for scalar data (based on data value, gradient magnitude, and a second directional derivative), and describes a set of direct manipulation widgets which make specifying such transfer functions intuitive and convenient. We also describe how to use modem graphics hardware to interactively render with multi-dimensional transfer functions. The transfer functions, widgets, and hardware combine to form a powerful system for interactive volume exploration.",Joe Michael Kniss;Gordon L. Kindlmann;Charles D. Hansen,J. Kniss;G. Kindlmann;C. Hansen,"Sch. of Comput., Utah Univ., Salt Lake City, UT, USA;Sch. of Comput., Utah Univ., Salt Lake City, UT, USA;Sch. of Comput., Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.1995.480803;10.1109/VISUAL.1999.809908;10.1109/VISUAL.1999.809889;10.1109/VISUAL.1996.568113;10.1109/VISUAL.1997.663875,"volume visualization, direct volume rendering, multi-dimensional transfer functions, direct manipulation widgets, graphics hardware",338,142,34,BP
InfoVis,2014,UpSet: Visualization of Intersecting Sets,10.1109/TVCG.2014.2346248,http://dx.doi.org/10.1109/TVCG.2014.2346248,1983,1992,J,"Understanding relationships between sets is an important analysis task that has received widespread attention in the visualization community. The major challenge in this context is the combinatorial explosion of the number of set intersections if the number of sets exceeds a trivial threshold. In this paper we introduce UpSet, a novel visualization technique for the quantitative analysis of sets, their intersections, and aggregates of intersections. UpSet is focused on creating task-driven aggregates, communicating the size and properties of aggregates and intersections, and a duality between the visualization of the elements in a dataset and their set membership. UpSet visualizes set intersections in a matrix layout and introduces aggregates based on groupings and queries. The matrix layout enables the effective representation of associated data, such as the number of elements in the aggregates and intersections, as well as additional summary statistics derived from subset or element attributes. Sorting according to various measures enables a task-driven analysis of relevant intersections and aggregates. The elements represented in the sets and their associated attributes are visualized in a separate view. Queries based on containment in specific intersections, aggregates or driven by attribute filters are propagated between both views. We also introduce several advanced visual encodings and interaction methods to overcome the problems of varying scales and to address scalability. UpSet is web-based and open source. We demonstrate its general utility in multiple use cases from various domains.",Alexander Lex;Nils Gehlenborg;Hendrik Strobelt;Romain Vuillemot;Hanspeter Pfister,Alexander Lex;Nils Gehlenborg;Hendrik Strobelt;Romain Vuillemot;Hanspeter Pfister,Hendrik Strobelt and Hanspeter Pfister are with Harvard University.;Harvard Medical School;Hendrik Strobelt and Hanspeter Pfister are with Harvard University.;Romain Vuillemot is with Harvard University;Hendrik Strobelt and Hanspeter Pfister are with Harvard University.,10.1109/TVCG.2008.144;10.1109/TVCG.2013.184;10.1109/TVCG.2011.186;10.1109/TVCG.2010.210;10.1109/TVCG.2009.122;10.1109/TVCG.2011.185;10.1109/TVCG.2011.183,"Sets, set visualization, sets intersections, set attributes, set relationships, multidimensional data",335,537,29,
InfoVis,2005,Low-level components of analytic activity in information visualization,10.1109/INFVIS.2005.1532136,http://dx.doi.org/10.1109/INFVIS.2005.1532136,111,117,C,"Existing system level taxonomies of visualization tasks are geared more towards the design of particular representations than the facilitation of user analytic activity. We present a set of ten low level analysis tasks that largely capture people's activities while employing information visualization tools for understanding data. To help develop these tasks, we collected nearly 200 sample questions from students about how they would analyze five particular data sets from different domains. The questions, while not being totally comprehensive, illustrated the sheer variety of analytic questions typically posed by users when employing information visualization systems. We hope that the presented set of tasks is useful for information visualization system designers as a kind of common substrate to discuss the relative analytic capabilities of the systems. Further, the tasks may provide a form of checklist for system designers.",Robert A. Amar;James R. Eagan;John T. Stasko,R. Amar;J. Eagan;J. Stasko,"Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA",10.1109/VISUAL.1990.146375;10.1109/INFVIS.1998.729560;10.1109/INFVIS.2000.885092;10.1109/INFVIS.2004.5;10.1109/INFVIS.2001.963289,"Analytic activity, taxonomy, knowledge discovery, design, evaluation",332,97,15,
InfoVis,2000,ThemeRiver: visualizing theme changes over time,10.1109/INFVIS.2000.885098,http://dx.doi.org/10.1109/INFVIS.2000.885098,115,123,C,"ThemeRiver/sup TM/ is a prototype system that visualizes thematic variations over time within a large collection of documents. The ""river"" flows from left to right through time, changing width to depict changes in thematic strength of temporally associated documents. Colored ""currents"" flowing within the river narrow or widen to indicate decreases or increases in the strength of an individual topic or a group of topics in the associated documents. The river is shown within the context of a timeline and a corresponding textual presentation of external events.",Susan L. Havre;Elizabeth G. Hetzler;Lucy T. Nowell,S. Havre;B. Hetzler;L. Nowell,"Battelle Pacific Northwest Lab., Richland, WA, USA",10.1109/INFVIS.1995.528686;10.1109/INFVIS.1997.636789;10.1109/INFVIS.1998.729570,,323,171,18,
Vis,2003,Curvature-based transfer functions for direct volume rendering: methods and applications,10.1109/VISUAL.2003.1250414,http://dx.doi.org/10.1109/VISUAL.2003.1250414,513,520,C,"Direct volume rendering of scalar fields uses a transfer function to map locally measured data properties to opacities and colors. The domain of the transfer function is typically the one-dimensional space of scalar data values. This paper advances the use of curvature information in multi-dimensional transfer functions, with a methodology for computing high-quality curvature measurements. The proposed methodology combines an implicit formulation of curvature with convolution-based reconstruction of the field. We give concrete guidelines for implementing the methodology, and illustrate the importance of choosing accurate filters for computing derivatives with convolution. Curvature-based transfer functions are shown to extend the expressivity and utility of volume rendering through contributions in three different application areas: nonphotorealistic volume rendering, surface smoothing via anisotropic diffusion, and visualization of isosurface uncertainty.",Gordon L. Kindlmann;Ross T. Whitaker;Tolga Tasdizen;Torsten Möller,G. Kindlmann;R. Whitaker;T. Tasdizen;T. Moller,"Inst. of Sci. Comput. & Imaging, Utah Univ., Salt Lake, UT, USA;Inst. of Sci. Comput. & Imaging, Utah Univ., Salt Lake, UT, USA;Inst. of Sci. Comput. & Imaging, Utah Univ., Salt Lake, UT, USA",10.1109/VISUAL.2000.885696;10.1109/VISUAL.2002.1183766;10.1109/VISUAL.1995.480795;10.1109/VISUAL.2000.885694;10.1109/VISUAL.1994.346331;10.1109/VISUAL.2002.1183777,"volume rendering, implicit surface curvature, convolution-based differentiation, non-photorealistic rendering, surface processing, uncertainty visualization, flowline curvature",321,145,36,
InfoVis,2000,"Focus+context display and navigation techniques for enhancing radial, space-filling hierarchy visualizations",10.1109/INFVIS.2000.885091,http://dx.doi.org/10.1109/INFVIS.2000.885091,57,65,C,"Radial, space-filling visualizations can be useful for depicting information hierarchies, but they suffer from one major problem. As the hierarchy grows in size, many items become small, peripheral slices that are difficult to distinguish. We have developed three visualization/interaction techniques that provide flexible browsing of the display. The techniques allow viewers to examine the small items in detail while providing context within the entire information hierarchy. Additionally, smooth transitions between views help users maintain orientation within the complete information space.",John T. Stasko;Eugene Zhang,J. Stasko;E. Zhang,"GVU Center, Georgia Inst. of Technol., Atlanta, GA, USA",10.1109/INFVIS.1999.801860;10.1109/VISUAL.1992.235217;10.1109/INFVIS.1998.729557;10.1109/VISUAL.1991.175815,,320,157,15,
InfoVis,1999,Cluster and calendar based visualization of time series data,10.1109/INFVIS.1999.801851,http://dx.doi.org/10.1109/INFVIS.1999.801851,4,"9, 140",C,"A new method is presented to get an insight into univariate time series data. The problem addressed is how to identify patterns and trends on multiple time scales (days, weeks, seasons) simultaneously. The solution presented is to cluster similar daily data patterns, and to visualize the average patterns as graphs and the corresponding days on a calendar. This presentation provides a quick insight into both standard and exceptional patterns. Furthermore, it is well suited to interactive exploration. Two applications, numbers of employees present and energy consumption, are presented.",Jarke J. van Wijk;Edward R. van Selow,J.J. Van Wijk;E.R. Van Selow,"Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands",,,319,130,7,TT
Vis,1999,New quadric metric for simplifying meshes with appearance attributes,10.1109/VISUAL.1999.809869,http://dx.doi.org/10.1109/VISUAL.1999.809869,59,510,C,"Complex triangle meshes arise naturally in many areas of computer graphics and visualization. Previous work has shown that a quadric error metric allows fast and accurate geometric simplification of meshes. This quadric approach was recently generalized to handle meshes with appearance attributes. In this paper we present an improved quadric error metric for simplifying meshes with attributes. The new metric, based on geometric correspondence in 3D, requires less storage, evaluates more quickly, and results in more accurate simplified meshes. Meshes often have attribute discontinuities, such as surface creases and material boundaries, which require multiple attribute vectors per vertex. We show that a wedge-based mesh data structure captures such discontinuities efficiently and permits simultaneous optimization of these multiple attribute vectors. In addition to the new quadric metric, we experiment with two techniques proposed in geometric simplification, memoryless simplification and volume preservation, and show that both of these are beneficial within the quadric framework. The new scheme is demonstrated on a variety of meshes with colors and normals.",Hugues Hoppe,H. Hoppe,,10.1109/VISUAL.1998.745312;10.1109/VISUAL.1998.745285;10.1109/VISUAL.1998.745314;10.1109/VISUAL.1997.663908,"level of detail, mesh decimation, multiresolution",315,125,18,
Vis,1999,Multi-projector displays using camera-based registration,10.1109/VISUAL.1999.809883,http://dx.doi.org/10.1109/VISUAL.1999.809883,161,522,C,"Conventional projector-based display systems are typically designed around precise and regular configurations of projectors and display surfaces. While this results in rendering simplicity and speed, it also means painstaking construction and ongoing maintenance. In previously published work, we introduced a vision of projector-based displays constructed from a collection of casually-arranged projectors and display surfaces. In this paper, we present flexible yet practical methods for realizing this vision, enabling low-cost mega-pixel display systems with large physical dimensions, higher resolution, or both. The techniques afford new opportunities to build personal 3D visualization systems in offices, conference rooms, theaters, or even your living room. As a demonstration of the simplicity and effectiveness of the methods that we continue to perfect, we show in the included video that a 10-year old child can construct and calibrate a two-camera, two-projector, head-tracked display system, all in about 15 minutes.",Ramesh Raskar;Michael S. Brown;Ruigang Yang;Wei-Chao Chen;Greg Welch;Herman Towles;W. Brent Seales;Henry Fuchs,R. Raskar;M.S. Brown;Ruigang Yang;Wei-Chao Chen;G. Welch;H. Towles;B. Scales;H. Fuchs,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",,"display, projection, spatially immersive display, panoramic image display, virtual environments, intensity blending, image-based modeling, depth, calibration, auto-calibration, structured light, camera-based registration",308,145,21,
Vis,1996,A haptic interaction method for volume visualization,10.1109/VISUAL.1996.568108,http://dx.doi.org/10.1109/VISUAL.1996.568108,197,204,C,"Volume visualization techniques typically provide support for visual exploration of data, however additional information can be conveyed by allowing a user to see as well as feel virtual objects. We present a haptic interaction method that is suitable for both volume visualization and modeling applications. Point contact forces are computed directly from the volume data and are consistent with the isosurface and volume rendering methods, providing a strong correspondence between visual and haptic feedback. Virtual tools are simulated by applying three-dimensional filters to some properties of the data within the extent of the tool, and interactive visual feedback rates are obtained by using an accelerated ray casting method. This haptic interaction method was implemented using a PHANToM haptic interface.",Ricardo S. Avila;Lisa M. Sobierajski,R.S. Avila;L.M. Sobierajski,"Gen. Electr. Corp. Res. & Dev. Center, Schenectady, NY, USA",10.1109/VISUAL.1995.480792,,295,106,17,
InfoVis,2002,"SpaceTree: supporting exploration in large node link tree, design evolution and empirical evaluation",10.1109/INFVIS.2002.1173148,http://dx.doi.org/10.1109/INFVIS.2002.1173148,57,64,C,"We present a novel tree browser that builds on the conventional node link tree diagrams. It adds dynamic rescaling of branches of the tree to best fit the available screen space, optimized camera movement, and the use of preview icons summarizing the topology of the branches that cannot be expanded. In addition, it includes integrated search and filter functions. This paper reflects on the evolution of the design and highlights the principles that emerged from it. A controlled experiment showed benefits for navigation to already previously visited nodes and estimation of overall tree topology.",Catherine Plaisant;Jesse Grosjean;Benjamin B. Bederson,C. Plaisant;J. Grosjean;B.B. Bederson,"Human-Comput. Interaction Lab., Maryland Univ., MD, USA;Human-Comput. Interaction Lab., Maryland Univ., MD, USA;Human-Comput. Interaction Lab., Maryland Univ., MD, USA",10.1109/VISUAL.1996.567745,,287,100,23,
InfoVis,2007,Animated Transitions in Statistical Data Graphics,10.1109/TVCG.2007.70539,http://dx.doi.org/10.1109/TVCG.2007.70539,1240,1247,J,"In this paper we investigate the effectiveness of animated transitions between common statistical data graphics such as bar charts, pie charts, and scatter plots. We extend theoretical models of data graphics to include such transitions, introducing a taxonomy of transition types. We then propose design principles for creating effective transitions and illustrate the application of these principles in <i>DynaVis</i>, a visualization system featuring animated data graphics. Two controlled experiments were conducted to assess the efficacy of various transition types, finding that animated transitions can significantly improve graphical perception.",Jeffrey Heer;George G. Robertson,Jeffrey Heer;George Robertson,"Computer Science Division at the University of California, Berkeley;Microsoft Research",10.1109/INFVIS.1999.801854;10.1109/INFVIS.2001.963279;10.1109/INFVIS.2002.1173148,"Statistical data graphics, animation, transitions, information visualization, design, experiment",287,178,27,
InfoVis,2008,Rolling the Dice: Multidimensional Visual Exploration using Scatterplot Matrix Navigation,10.1109/TVCG.2008.153,http://dx.doi.org/10.1109/TVCG.2008.153,1141,1148,J,"Scatterplots remain one of the most popular and widely-used visual representations for multidimensional data due to their simplicity, familiarity and visual clarity, even if they lack some of the flexibility and visual expressiveness of newer multidimensional visualization techniques. This paper presents new interactive methods to explore multidimensional data using scatterplots. This exploration is performed using a matrix of scatterplots that gives an overview of the possible configurations, thumbnails of the scatterplots, and support for interactive navigation in the multidimensional space. Transitions between scatterplots are performed as animated rotations in 3D space, somewhat akin to rolling dice. Users can iteratively build queries using bounding volumes in the dataset, sculpting the query from different viewpoints to become more and more refined. Furthermore, the dimensions in the navigation space can be reordered, manually or automatically, to highlight salient correlations and differences among them. An example scenario presents the interaction techniques supporting smooth and effortless visual exploration of multidimensional datasets.",Niklas Elmqvist;Pierre Dragicevic;Jean-Daniel Fekete,Niklas Elmqvist;Pierre Dragicevic;Jean-Daniel Fekete,,10.1109/TVCG.2007.70515;10.1109/VAST.2007.4389013;10.1109/TVCG.2007.70577;10.1109/VISUAL.1990.146386;10.1109/VAST.2006.261452;10.1109/INFVIS.2005.1532136;10.1109/VISUAL.1994.346302;10.1109/INFVIS.1998.729559;10.1109/VISUAL.1995.485139;10.1109/INFVIS.2003.1249016;10.1109/INFVIS.2000.885086;10.1109/INFVIS.2004.3;10.1109/INFVIS.2004.64;10.1109/TVCG.2007.70539;10.1109/INFVIS.2004.15,"Visual exploration, visual queries, visual analytics, navigation, multivariate data, interaction",285,192,42,BP
Vis,1998,Large scale terrain visualization using the restricted quadtree triangulation,10.1109/VISUAL.1998.745280,http://dx.doi.org/10.1109/VISUAL.1998.745280,19,26,C,"Real-time rendering of triangulated surfaces has attracted growing interest in the last few years. However, interactive visualization of very large scale grid digital elevation models is still difficult. The graphics load must be controlled by adaptive surface triangulation and by taking advantage of different levels of detail. Furthermore, management of the visible scene requires efficient access to the terrain database. We describe an all-in-one visualization system which integrates adaptive triangulation, dynamic scene management and spatial data handling. The triangulation model is based on the restricted quadtree triangulation. Furthermore, we present new algorithms of restricted quadtree triangulation. These include among others exact error approximation, progressive meshing, performance enhancements and spatial access.",Renato Pajarola,R. Pajarola,"Inst. of Theor. Comput. Sci., Eidgenossische Tech. Hochschule, Zurich, Switzerland",10.1109/VISUAL.1997.663860;10.1109/VISUAL.1995.480800;10.1109/VISUAL.1995.480799,"algorithms, computer graphics, virtual reality, triangulated surfaces, terrain visualization, terascale visualization",281,105,17,
Vis,1996,Dynamic view-dependent simplification for polygonal models,10.1109/VISUAL.1996.568126,http://dx.doi.org/10.1109/VISUAL.1996.568126,327,334,C,"Presents an algorithm for performing view-dependent simplifications of a triangulated polygonal model in real-time. The simplifications are dependent on viewing direction, lighting and visibility, and are performed by taking advantage of image-space, object-space and frame-to-frame coherences. A continuous level-of-detail representation for an object is first constructed off-line. This representation is then used at run-time to guide the selection of appropriate triangles for display. The list of displayed triangles is updated incrementally from one frame to the next. Our approach is more effective than the current level-of-detail-based rendering approaches for most scientific visualization applications where there are a limited number of highly complex objects that stay relatively close to the viewer.",Julie C. Xia;Amitabh Varshney,J.C. Xia;A. Varshney,"State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1993.398868;10.1109/VISUAL.1995.480805,,276,114,23,
Vis,2006,Ambient Occlusion and Edge Cueing for Enhancing Real Time Molecular Visualization,10.1109/TVCG.2006.115,http://dx.doi.org/10.1109/TVCG.2006.115,1237,1244,J,"The paper presents a set of combined techniques to enhance the real-time visualization of simple or complex molecules (up to order of 10<sup>6</sup> atoms) space fill mode. The proposed approach includes an innovative technique for efficient computation and storage of ambient occlusion terms, a small set of GPU accelerated procedural impostors for space-fill and ball-and-stick rendering, and novel edge-cueing techniques. As a result, the user's understanding of the three-dimensional structure under inspection is strongly increased (even for'still images), while the rendering still occurs in real time",Marco Tarini;Paolo Cignoni;Claudio Montani,Marco Tarini;Paolo Cignoni;Claudio Montani,IEEE Computer Society;IEEE Computer Society,10.1109/VISUAL.2000.885694;10.1109/VISUAL.2003.1250394,,275,249,32,
InfoVis,2012,Design Study Methodology: Reflections from the Trenches and the Stacks,10.1109/TVCG.2012.213,http://dx.doi.org/10.1109/TVCG.2012.213,2431,2440,J,"Design studies are an increasingly popular form of problem-driven visualization research, yet there is little guidance available about how to do them effectively. In this paper we reflect on our combined experience of conducting twenty-one design studies, as well as reading and reviewing many more, and on an extensive literature review of other field work methods and methodologies. Based on this foundation we provide definitions, propose a methodological framework, and provide practical guidance for conducting design studies. We define a design study as a project in which visualization researchers analyze a specific real-world problem faced by domain experts, design a visualization system that supports solving this problem, validate the design, and reflect about lessons learned in order to refine visualization design guidelines. We characterize two axes - a task clarity axis from fuzzy to crisp and an information location axis from the domain expert's head to the computer - and use these axes to reason about design study contributions, their suitability, and uniqueness from other approaches. The proposed methodological framework consists of 9 stages: learn, winnow, cast, discover, design, implement, deploy, reflect, and write. For each stage we provide practical guidance and outline potential pitfalls. We also conducted an extensive literature survey of related methodological approaches that involve a significant amount of qualitative field work, and compare design study methodology to that of ethnography, grounded theory, and action research.",Michael Sedlmair;Miriah D. Meyer;Tamara Munzner,Michael Sedlmair;Miriah Meyer;Tamara Munzner,University of British Columbia;University of Utah;University of British Columbia,10.1109/INFVIS.1999.801869;10.1109/INFVIS.1996.559226;10.1109/TVCG.2008.117;10.1109/TVCG.2009.152;10.1109/TVCG.2010.206;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2010.193;10.1109/VAST.2011.6102443;10.1109/TVCG.2011.174;10.1109/VAST.2007.4389008;10.1109/TVCG.2009.116;10.1109/TVCG.2011.192;10.1109/TVCG.2009.128;10.1109/INFVIS.2003.1249023;10.1109/TVCG.2009.167;10.1109/TVCG.2009.111;10.1109/TVCG.2011.209,"Design study, methodology, visualization, framework",267,266,95,HM
VAST,2013,Visual Exploration of Big Spatio-Temporal Urban Data: A Study of New York City Taxi Trips,10.1109/TVCG.2013.226,http://dx.doi.org/10.1109/TVCG.2013.226,2149,2158,J,"As increasing volumes of urban data are captured and become available, new opportunities arise for data-driven analysis that can lead to improvements in the lives of citizens through evidence-based decision making and policies. In this paper, we focus on a particularly important urban data set: taxi trips. Taxis are valuable sensors and information associated with taxi trips can provide unprecedented insight into many different aspects of city life, from economic activity and human behavior to mobility patterns. But analyzing these data presents many challenges. The data are complex, containing geographical and temporal components in addition to multiple variables associated with each trip. Consequently, it is hard to specify exploratory queries and to perform comparative analyses (e.g., compare different regions over time). This problem is compounded due to the size of the data-there are on average 500,000 taxi trips each day in NYC. We propose a new model that allows users to visually query taxi trips. Besides standard analytics queries, the model supports origin-destination queries that enable the study of mobility across the city. We show that this model is able to express a wide range of spatio-temporal queries, and it is also flexible in that not only can queries be composed but also different aggregations and visual representations can be applied, allowing users to explore and compare results. We have built a scalable system that implements this model which supports interactive response times; makes use of an adaptive level-of-detail rendering strategy to generate clutter-free visualization for large results; and shows hidden details to the users in a summary through the use of overlay heat maps. We present a series of case studies motivated by traffic engineers and economists that show how our model and system enable domain experts to perform tasks that were previously unattainable for them.",Nivan Ferreira;Jorge Poco;Huy T. Vo;Juliana Freire;Cláudio T. Silva,Nivan Ferreira;Jorge Poco;Huy T. Vo;Juliana Freire;Cláudio T. Silva,NYU Poly;NYU Poly;NYU CUSP;NYU Poly;NYU Poly and NYU CUSP,10.1109/INFVIS.2004.12;10.1109/VAST.2008.4677356;10.1109/VAST.2011.6102454;10.1109/TVCG.2007.70535;10.1109/VAST.2010.5652467;10.1109/INFVIS.2005.1532150;10.1109/VAST.2008.4677370;10.1109/INFVIS.2000.885086,"Spatio-temporal queries, urban data, taxi movement data, visual exploration",267,262,40,
Vis,1998,Interactive ray tracing for isosurface rendering,10.1109/VISUAL.1998.745713,http://dx.doi.org/10.1109/VISUAL.1998.745713,233,238,C,"We show that it is feasible to perform interactive isosurfacing of very large rectilinear datasets with brute-force ray tracing on a conventional (distributed) shared-memory multiprocessor machine. Rather than generate geometry representing the isosurface and render with a z-buffer, for each pixel we trace a ray through a volume and do an analytic isosurface intersection computation. Although this method has a high intrinsic computational cost, its simplicity and scalability make it ideal for large datasets on current high-end systems. Incorporating simple optimizations, such as volume bricking and a shallow hierarchy, enables interactive rendering (i.e. 10 frames per second) of the 1 GByte full resolution Visible Woman dataset on an SGI Reality Monster. The graphics capabilities of the Reality Monster are used only for display of the final color image.",Steven G. Parker;Peter Shirley;Yarden Livnat;Charles D. Hansen;Peter-Pike J. Sloan,S. Parker;P. Shirley;Y. Livnat;C. Hansen;P.-P. Sloan,"Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.1997.663888;10.1109/VISUAL.1994.346331;10.1109/VISUAL.1994.346320;10.1109/VISUAL.1995.485154;10.1109/VISUAL.1998.745300,,265,114,17,BP
InfoVis,2007,Show Me: Automatic Presentation for Visual Analysis,10.1109/TVCG.2007.70594,http://dx.doi.org/10.1109/TVCG.2007.70594,1137,1144,J,"This paper describes Show Me, an integrated set of user interface commands and defaults that incorporate automatic presentation into a commercial visual analysis system called Tableau. A key aspect of Tableau is VizQL, a language for specifying views, which is used by Show Me to extend automatic presentation to the generation of tables of views (commonly called small multiple displays). A key research issue for the commercial application of automatic presentation is the user experience, which must support the flow of visual analysis. User experience has not been the focus of previous research on automatic presentation. The Show Me user experience includes the automatic selection of mark types, a command to add a single field to a view, and a pair of commands to build views for multiple fields. Although the use of these defaults and commands is optional, user interface logs indicate that Show Me is used by commercial users.",Jock D. Mackinlay;Pat Hanrahan;Chris Stolte,Jock Mackinlay;Pat Hanrahan;Chris Stolte,,10.1109/INFVIS.2000.885086,"Automatic presentation, visual analysis, graphic design, best practices, data visualization, small multiples",263,177,12,
InfoVis,1997,H3: laying out large directed graphs in 3D hyperbolic space,10.1109/INFVIS.1997.636718,http://dx.doi.org/10.1109/INFVIS.1997.636718,2,10,C,"We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using traditional techniques for drawing general graphs because we assume a hierarchical nature of the data. We impose a hierarchy on the graph by using domain-specific knowledge to find an appropriate spanning tree. Links which are not part of the spanning tree do not influence the layout but can be selectively drawn by user request. The volume of hyperbolic 3-space increases exponentially, as opposed to the familiar geometric increase of euclidean 3-space. We exploit this exponential amount of room by computing the layout according to the hyperbolic metric. We optimize the cone tree layout algorithm for 3D hyperbolic space by placing children on a hemisphere around the cone mouth instead of on its perimeter. Hyperbolic navigation affords a Focus+Context view of the structure with minimal visual clutter. We have successfully laid out hierarchies of over 20,000 nodes. Our implementation accommodates navigation through graphs too large to be rendered interactively by allowing the user to explicitly prune or expand subtrees.",Tamara Munzner,T. Munzner,"Stanford Univ., CA, USA",10.1109/INFVIS.1995.528691;10.1109/INFVIS.1995.528689,,262,102,29,
Vis,2000,Anisotropic geometric diffusion in surface processing,10.1109/VISUAL.2000.885721,http://dx.doi.org/10.1109/VISUAL.2000.885721,397,405,C,"A new multiscale method in surface processing is presented which combines the image processing methodology based on nonlinear diffusion equations and the theory of geometric evolution problems. Its aim is to smooth discretized surfaces while simultaneously enhancing geometric features such as edges and corners. This is obtained by an anisotropic curvature evolution, where time is the multiscale parameter. Here, the diffusion tensor depends on the shape operator of the evolving surface. A spatial finite element discretization on arbitrary unstructured triangular meshes and a semi-implicit finite difference discretization in time are the building blocks of the easy to code algorithm presented. The systems of linear equations in each timestep are solved by appropriate, preconditioned iterative solvers. Different applications underline the efficiency and flexibility of the presented type of surface processing tool.",Ulrich Clarenz;Udo Diewald;Martin Rumpf,U. Clarenz;U. Diewald;M. Rumpf,"Inst. for Appl. Math., Bonn Univ., Germany",10.1109/VISUAL.1999.809904,"Image Processing, Geometric Modeling, Numerical Analysis",262,104,22,
InfoVis,1997,The structure of the information visualization design space,10.1109/INFVIS.1997.636792,http://dx.doi.org/10.1109/INFVIS.1997.636792,92,99,C,Research on information visualization has reached the point where a number of successful point designs have been proposed and a variety of techniques have been discovered. It is now appropriate to describe and analyze portions of the design space so as to understand the differences among designs and to suggest new possibilities. This paper proposes an organization of the information visualization literature and illustrates it with a series of examples. The result is a framework for designing new visualizations and augmenting existing designs.,Stuart K. Card;Jock D. Mackinlay,S.K. Card;J. Mackinlay,"Xerox Palo Alto Res. Center, CA, USA",10.1109/INFVIS.1996.559213;10.1109/VISUAL.1991.175815;10.1109/INFVIS.1995.528686;10.1109/INFVIS.1995.528684;10.1109/INFVIS.1995.528697,"information visualization, taxonomy, design space, morphological analysis",260,88,24,TT
Vis,1998,Fast and memory efficient polygonal simplification,10.1109/VISUAL.1998.745314,http://dx.doi.org/10.1109/VISUAL.1998.745314,279,286,C,"Conventional wisdom says that in order to produce high-quality simplified polygonal models, one must retain and use information about the original model during the simplification process. We demonstrate that excellent simplified models can be produced without the need to compare against information from the original geometry while performing local changes to the model. We use edge collapses to perform simplification, as do a number of other methods. We select the position of the new vertex so that the original volume of the model is maintained and we minimize the per-triangle change in volume of the tetrahedra swept out by those triangles that are moved. We also maintain surface area near boundaries and minimize the per-triangle area changes. Calculating the edge collapse priorities and the positions of the new vertices requires only the face connectivity and the the vertex locations in the intermediate model. This approach is memory efficient, allowing the simplification of very large polygonal models, and it is also fast. Moreover, simplified models created using this technique compare favorably to a number of other published simplification methods in terms of mean geometric error.",Peter Lindstrom;Greg Turk,P. Lindstrom;G. Turk,"Georgia Inst. of Technol., Atlanta, GA, USA",10.1109/VISUAL.1995.485142;10.1109/VISUAL.1997.663883;10.1109/VISUAL.1997.663908;10.1109/VISUAL.1997.663906,,259,112,22,
InfoVis,2009,Participatory Visualization with Wordle,10.1109/TVCG.2009.171,http://dx.doi.org/10.1109/TVCG.2009.171,1137,1144,J,"We discuss the design and usage of ldquoWordle,rdquo a Web-based tool for visualizing text. Wordle creates tag-cloud-like displays that give careful attention to typography, color, and composition. We describe the algorithms used to balance various aesthetic criteria and create the distinctive Wordle layouts. We then present the results of a study of Wordle usage, based both on spontaneous behaviour observed in the wild, and on a large-scale survey of Wordle users. The results suggest that Wordles have become a kind of medium of expression, and that a ldquoparticipatory culturerdquo has arisen around them.",Fernanda B. Viégas;Martin Wattenberg;Jonathan Feinberg,Fernanda B. Viegas;Martin Wattenberg;Jonathan Feinberg,IBM Research;IBM Research;IBM Research,10.1109/INFVIS.2005.1532122;10.1109/TVCG.2007.70577,"Visualization, text, tag cloud, participatory culture, memory, educational visualization, social data analysis",258,188,15,
InfoVis,2001,Visualizing time-series on spirals,10.1109/INFVIS.2001.963273,http://dx.doi.org/10.1109/INFVIS.2001.963273,7,13,C,,Marc Weber;Marc Alexa;Wolfgang Müller 0004,M. Weber;M. Alexa;W. Muller,Technische Universitat Darmstadt,10.1109/VISUAL.1991.175794;10.1109/INFVIS.2000.885098;10.1109/INFVIS.1995.528685,"Information Visualization, Graph Drawing, Visualization of Time-Series Data, Data Mining ",256,116,16,
InfoVis,2007,A Taxonomy of Clutter Reduction for Information Visualisation,10.1109/TVCG.2007.70535,http://dx.doi.org/10.1109/TVCG.2007.70535,1216,1223,J,"Information visualisation is about gaining insight into data through a visual representation. This data is often multivariate and increasingly, the datasets are very large. To help us explore all this data, numerous visualisation applications, both commercial and research prototypes, have been designed using a variety of techniques and algorithms. Whether they are dedicated to geo-spatial data or skewed hierarchical data, most of the visualisations need to adopt strategies for dealing with overcrowded displays, brought about by too much data to fit in too small a display space. This paper analyses a large number of these clutter reduction methods, classifying them both in terms of how they deal with clutter reduction and more importantly, in terms of the benefits and losses. The aim of the resulting taxonomy is to act as a guide to match techniques to problems where different criteria may have different importance, and more importantly as a means to critique and hence develop existing and new techniques.",Geoffrey P. Ellis;Alan J. Dix,Geoffrey Ellis;Alan Dix,,10.1109/INFVIS.2003.1249018;10.1109/INFVIS.2000.885092;10.1109/TVCG.2006.138;10.1109/VISUAL.2005.1532819;10.1109/INFVIS.2003.1249008;10.1109/VISUAL.1999.809866;10.1109/INFVIS.2000.885091;10.1109/VISUAL.1998.745301;10.1109/INFVIS.1997.636789;10.1109/INFVIS.2002.1173156;10.1109/INFVIS.2003.1249019;10.1109/INFVIS.1997.636792;10.1109/INFVIS.1995.528685;10.1109/INFVIS.2004.15;10.1109/TVCG.2006.170,"Clutter reduction, information visualisation, occlusion, large datasets, taxonomy",251,215,54,
InfoVis,2004,A Comparison of the Readability of Graphs Using Node-Link and Matrix-Based Representations,10.1109/INFVIS.2004.1,http://dx.doi.org/10.1109/INFVIS.2004.1,17,24,C,"In this paper, we describe a taxonomy of generic graph related tasks and an evaluation aiming at assessing the readability of two representations of graphs: matrix-based representations and node-link diagrams. This evaluation bears on seven generic tasks and leads to important recommendations with regard to the representation of graphs according to their size and density. For instance, we show that when graphs are bigger than twenty vertices, the matrix-based visualization performs better than node-link diagrams on most tasks. Only path finding is consistently in favor of node-link diagrams throughout the evaluation",Mohammad Ghoniem;Jean-Daniel Fekete;Philippe Castagliola,M. Ghoniem;J.-D. Fekete;P. Castagliola,Ecole des Mines de Nantes,10.1109/INFVIS.2003.1249030,"Visualization of graphs, adjacency matrices, node-link representation, readability, evaluation",245,148,14,
Vis,1997,The contour spectrum,10.1109/VISUAL.1997.663875,http://dx.doi.org/10.1109/VISUAL.1997.663875,167,173,C,"The authors introduce the contour spectrum, a user interface component that improves qualitative user interaction and provides real-time exact quantification in the visualization of isocontours. The contour spectrum is a signature consisting of a variety of scalar data and contour attributes, computed over the range of scalar values /spl omega//spl isin/R. They explore the use of surface, area, volume, and gradient integral of the contour that are shown to be univariate B-spline functions of the scalar value /spl omega/ for multi-dimensional unstructured triangular grids. These quantitative properties are calculated in real-time and presented to the user as a collection of signature graphs (plots of functions of /spl omega/) to assist in selecting relevant isovalues /spl omega//sub 0/ for informative visualization. For time-varying data, these quantitative properties can also be computed over time, and displayed using a 2D interface, giving the user an overview of the time-varying function, and allowing interaction in both isovalue and time step. The effectiveness of the current system and potential extensions are discussed.",Chandrajit L. Bajaj;Valerio Pascucci;Daniel Schikore,C.L. Bajaj;V. Pascucci;D.R. Schikore,"Shastra Lab., Purdue Univ., West Lafayette, IN, USA",10.1109/VISUAL.1996.568123;10.1109/VISUAL.1995.480803;10.1109/VISUAL.1996.568113,"Visualization, Scalar Data, User Interfaces, Real-time Quantitative Query",242,97,14,
Vis,2005,VisTrails: enabling interactive multiple-view visualizations,10.1109/VISUAL.2005.1532788,http://dx.doi.org/10.1109/VISUAL.2005.1532788,135,142,C,"VisTrails is a new system that enables interactive multiple-view visualizations by simplifying the creation and maintenance of visualization pipelines, and by optimizing their execution. It provides a general infrastructure that can be combined with existing visualization systems and libraries. A key component of VisTrails is the visualization trail (vistrail), a formal specification of a pipeline. Unlike existing dataflow-based systems, in VisTrails there is a clear separation between the specification of a pipeline and its execution instances. This separation enables powerful scripting capabilities and provides a scalable mechanism for generating a large number of visualizations. VisTrails also leverages the vistrail specification to identify and avoid redundant operations. This optimization is especially useful while exploring multiple visualizations. When variations of the same pipeline need to be executed, substantial speedups can be obtained by caching the results of overlapping subsequences of the pipelines. In this paper, we describe the design and implementation of VisTrails, and show its effectiveness in different application scenarios.",Louis Bavoil;Steven P. Callahan;Carlos Scheidegger;Huy T. Vo;Patricia Crossno;Cláudio T. Silva;Juliana Freire,L. Bavoil;S.P. Callahan;P.J. Crossno;J. Freire;C.E. Scheidegger;C.T. Silva;H.T. Vo,"Sci. Comput. & Imaging Inst., Utah Univ., Salt Lake City, UT, USA;Sci. Comput. & Imaging Inst., Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.1998.745299;10.1109/INFVIS.2004.2;10.1109/VISUAL.2004.112;10.1109/VISUAL.2002.1183791,"interrogative visualization, dataflow, caching, coordinated views",242,52,30,
InfoVis,2006,Network Visualization by Semantic Substrates,10.1109/TVCG.2006.166,http://dx.doi.org/10.1109/TVCG.2006.166,733,740,J,"Networks have remained a challenge for information visualization designers because of the complex issues of node and link layout coupled with the rich set of tasks that users present. This paper offers a strategy based on two principles: (1) layouts are based on user-defined semantic substrates, which are non-overlapping regions in which node placement is based on node attributes, (2) users interactively adjust sliders to control link visibility to limit clutter and thus ensure comprehensibility of source and destination. Scalability is further facilitated by user control of which nodes are visible. We illustrate our semantic substrates approach as implemented in NVSS 1.0 with legal precedent data for up to 1122 court cases in three regions with 7645 legal citations",Ben Shneiderman;Aleks Aris,Ben Shneiderman;Aleks Aris,"Professor with the Computer Science Department and the Human-Computer Interaction Laboratory at the University of Maryland, College Park;PhD Candidate with the Computer Science Department and the Human-Computer Interaction Laboratory at the University of Maryland, College Park",10.1109/INFVIS.2004.1;10.1109/INFVIS.2005.1532124;10.1109/INFVIS.2005.1532126,"Network visualization, semantic substrate, information visualization, graphical user interfaces",241,155,38,
InfoVis,2008,Stacked Graphs - Geometry & Aesthetics,10.1109/TVCG.2008.166,http://dx.doi.org/10.1109/TVCG.2008.166,1245,1252,J,"In February 2008, the New York Times published an unusual chart of box office revenues for 7500 movies over 21 years. The chart was based on a similar visualization, developed by the first author, that displayed trends in music listening. This paper describes the design decisions and algorithms behind these graphics, and discusses the reaction on the Web. We suggest that this type of complex layered graph is effective for displaying large data sets to a mass audience. We provide a mathematical analysis of how this layered graph relates to traditional stacked graphs and to techniques such as ThemeRiver, showing how each method is optimizing a different ldquoenergy functionrdquo. Finally, we discuss techniques for coloring and ordering the layers of such graphs. Throughout the paper, we emphasize the interplay between considerations of aesthetics and legibility.",Lee Byron;Martin Wattenberg,Lee Byron;Martin Wattenberg,The New York Times;Visual Communication Lab at IBM,10.1109/TVCG.2006.163;10.1109/INFVIS.2005.1532122;10.1109/TVCG.2007.70577;10.1109/INFVIS.2000.885098,"Streamgraph, ThemeRiver, listening history, lastfm, aesthetics, communication-minded visualization, time series",240,179,20,HM
Vis,1997,Application-controlled demand paging for out-of-core visualization,10.1109/VISUAL.1997.663888,http://dx.doi.org/10.1109/VISUAL.1997.663888,235,244,C,"In the area of scientific visualization, input data sets are often very large. In visualization of computational fluid dynamics (CFD) in particular, input data sets today can surpass 100 Gbytes, and are expected to scale with the ability of supercomputers to generate them. Some visualization tools already partition large data sets into segments, and load appropriate segments as they are needed. However, this does not remove the problem for two reasons: 1) there are data sets for which even the individual segments are too large for the largest graphics workstations, 2) many practitioners do not have access to workstations with the memory capacity required to load even a segment, especially since the state-of-the-art visualization tools tend to be developed by researchers with much more powerful machines. When the size of the data that must be accessed is larger than the size of memory, some form of virtual memory is simply required. This may be by segmentation, paging, or by paged segments. The authors demonstrate that complete reliance on operating system virtual memory for out-of-core visualization leads to egregious performance. They then describe a paged segment system that they have implemented, and explore the principles of memory management that can be employed by the application for out-of-core visualization. They show that application control over some of these can significantly improve performance. They show that sparse traversal can be exploited by loading only those data actually required.",Michael Cox;David Ellsworth,M. Cox;D. Ellsworth,"NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1994.346311;10.1109/VISUAL.1990.146360;10.1109/VISUAL.1993.398860,"computational fluid dynamics, visualization, out-of-core visualization",232,110,28,
Vis,1990,A problem-oriented classification of visualization techniques,10.1109/VISUAL.1990.146375,http://dx.doi.org/10.1109/VISUAL.1990.146375,139,"143, 469",C,"Progress in scientific visualization could be accelerated if workers could more readily find visualization techniques relevant to a given problem. The authors describe an approach to this problem, based on a classification of visualization techniques, that is independent of particular application domains. A user breaks up a problem into subproblems, describes these subproblems in terms of the objects to be represented and the operations to be supported by a representation, locates applicable visualization techniques in a catalog, and combines these representations into a composite representation for the original problem. The catalog and its underlying classification provide a way for workers in different application disciplines to share methods.<<ETX>>",Stephen Wehrend;Clayton Lewis,S. Wehrend;C. Lewis,"Colorado Univ., Boulder, CO, USA;Colorado Univ., Boulder, CO, USA",,,230,106,6,
InfoVis,2004,The InfoVis Toolkit,10.1109/INFVIS.2004.64,http://dx.doi.org/10.1109/INFVIS.2004.64,167,174,C,"This article presents the InfoVis toolkit, designed to support the creation, extension and integration of advanced 2D information visualization components into interactive Java swing applications. The InfoVis toolkit provides specific data structures to achieve a fast action/feedback loop required by dynamic queries. It comes with a large set of components such as range sliders and tailored control panels required to control and configure the visualizations. These components are integrated into a coherent framework that simplifies the management of rich data structures and the design and extension of visualizations. Supported data structures currently include tables, trees and graphs. Supported visualizations include scatter plots, time series, parallel coordinates, treemaps, icicle trees, node-link diagrams for trees and graphs and adjacency matrices for graphs. All visualizations can use fisheye lenses and dynamic labeling. The InfoVis toolkit supports hardware acceleration when available through Agile2D, an implementation of the Java graphics API based on OpenGL, achieving speedups of 10 to 200 times. The article also shows how new visualizations can be added and extended to become components, enriching visualizations as well as general applications",Jean-Daniel Fekete,J.-D. Fekete,INRIA Futurs/LRI,10.1109/INFVIS.2003.1249008;10.1109/INFVIS.2000.885086;10.1109/INFVIS.2002.1173156;10.1109/INFVIS.1995.528688;10.1109/INFVIS.2002.1173148,"Information Visualization, Toolkit, Graphics, Integration",228,99,27,
InfoVis,2007,Casual Information Visualization: Depictions of Data in Everyday Life,10.1109/TVCG.2007.70541,http://dx.doi.org/10.1109/TVCG.2007.70541,1145,1152,J,"Information visualization has often focused on providing deep insight for expert user populations and on techniques for amplifying cognition through complicated interactive visual models. This paper proposes a new subdomain for infovis research that complements the focus on analytic tasks and expert use. Instead of work-related and analytically driven infovis, we propose casual information visualization (or casual infovis) as a complement to more traditional infovis domains. Traditional infovis systems, techniques, and methods do not easily lend themselves to the broad range of user populations, from expert to novices, or from work tasks to more everyday situations. We propose definitions, perspectives, and research directions for further investigations of this emerging subfield. These perspectives build from ambient information visualization (Skog et al., 2003), social visualization, and also from artistic work that visualizes information (Viegas and Wattenberg, 2007). We seek to provide a perspective on infovis that integrates these research agendas under a coherent vocabulary and framework for design. We enumerate the following contributions. First, we demonstrate how blurry the boundary of infovis is by examining systems that exhibit many of the putative properties of infovis systems, but perhaps would not be considered so. Second, we explore the notion of insight and how, instead of a monolithic definition of insight, there may be multiple types, each with particular characteristics. Third, we discuss design challenges for systems intended for casual audiences. Finally we conclude with challenges for system evaluation in this emerging subfield.",Zachary Pousman;John T. Stasko;Michael Mateas,Zachary Pousman;John Stasko;Michael Mateas,"School of Interactive Computing and the GVU Center at the Georgia Institute of Technology;School of Interactive Computing and the GVU Center at the Georgia Institute of Technology;University of California, Santa Cruz",10.1109/INFVIS.2005.1532126;10.1109/INFVIS.2004.8;10.1109/INFVIS.2003.1249031;10.1109/INFVIS.2004.59;10.1109/VISUAL.1990.146375,"Casual information visualization, ambient infovis, social infovis, editorial, design, evaluation",225,145,45,
Vis,1994,An evaluation of reconstruction filters for volume rendering,10.1109/VISUAL.1994.346331,http://dx.doi.org/10.1109/VISUAL.1994.346331,100,"107, C10",C,"To render images from a three-dimensional array of sample values, it is necessary to interpolate between the samples. This paper is concerned with interpolation methods that are equivalent to convolving the samples with a reconstruction filter; this covers all commonly used schemes, including trilinear and cubic interpolation. We first outline the formal basis of interpolation in three-dimensional signal processing theory. We then propose numerical metrics that can be used to measure filter characteristics that are relevant to the appearance of images generated using that filter. We apply those metrics to several previously used filters and relate the results to isosurface images of the interpolations. We show that the choice of interpolation scheme can have a dramatic effect on image quality, and we discuss the cost/benefit tradeoff inherent in choosing a filter.<<ETX>>",Steve Marschner;Richard Lobb,S.R. Marschner;R.J. Lobb,"Program of Comput. Graphics, Cornell Univ., Ithaca, NY, USA;Program of Comput. Graphics, Cornell Univ., Ithaca, NY, USA",10.1109/VISUAL.1993.398851,,224,124,19,TT
VAST,2011,SensePlace2: GeoTwitter analytics support for situational awareness,10.1109/VAST.2011.6102456,http://dx.doi.org/10.1109/VAST.2011.6102456,181,190,C,"Geographically-grounded situational awareness (SA) is critical to crisis management and is essential in many other decision making domains that range from infectious disease monitoring, through regional planning, to political campaigning. Social media are becoming an important information input to support situational assessment (to produce awareness) in all domains. Here, we present a geovisual analytics approach to supporting SA for crisis events using one source of social media, Twitter. Specifically, we focus on leveraging explicit and implicit geographic information for tweets, on developing place-time-theme indexing schemes that support overview+detail methods and that scale analytical capabilities to relatively large tweet volumes, and on providing visual interface methods to enable understanding of place, time, and theme components of evolving situations. Our approach is user-centered, using scenario-based design methods that include formal scenarios to guide design and validate implementation as well as a systematic claims analysis to justify design choices and provide a framework for future testing. The work is informed by a structured survey of practitioners and the end product of Phase-I development is demonstrated / validated through implementation in SensePlace2, a map-based, web application initially focused on tweets but extensible to other media.",Alan M. MacEachren;Anuj R. Jaiswal;Anthony C. Robinson;Scott Pezanowski;Alexander Savelyev;Prasenjit Mitra;Xiao Zhang 0019;Justine I. Blanford,Alan M. MacEachren;Anuj Jaiswal;Anthony C. Robinson;Scott Pezanowski;Alexander Savelyev;Prasenjit Mitra;Xiao Zhang;Justine Blanford,"GeoVISTA Center, The Pennsylvania State University, USA;GeoVISTA Center, The Pennsylvania State University, USA;GeoVISTA Center, The Pennsylvania State University, USA;GeoVISTA Center, The Pennsylvania State University, USA;GeoVISTA Center, The Pennsylvania State University, USA;GeoVISTA Center, The Pennsylvania State University, USA;GeoVISTA Center, The Pennsylvania State University, USA;GeoVISTA Center, The Pennsylvania State University, USA",10.1109/VAST.2010.5652478;10.1109/VAST.2007.4388994;10.1109/TVCG.2010.129;10.1109/INFVIS.2005.1532134;10.1109/VAST.2010.5652922,"social media analytics, scenario-based design, geovisualization, situational awareness, text analytics, crisis management, spatio-temporal analysis ",224,166,37,
Vis,2005,The value of visualization,10.1109/VISUAL.2005.1532781,http://dx.doi.org/10.1109/VISUAL.2005.1532781,79,86,C,"The field of visualization is getting mature. Many problems have been solved, and new directions are sought for. In order to make good choices, an understanding of the purpose and meaning of visualization is needed. Especially, it would be nice if we could assess what a good visualization is. In this paper an attempt is made to determine the value of visualization. A technological viewpoint is adopted, where the value of visualization is measured based on effectiveness and efficiency. An economic model of visualization is presented, and benefits and costs are established. Next, consequences (brand limitations of visualization are discussed (including the use of alternative methods, high initial costs, subjective/less, and the role of interaction), as well as examples of the use of the model for the judgement of existing classes of methods and understanding why they are or are not used in practice. Furthermore, two alternative views on visualization are presented and discussed: viewing visualization as an art or as a scientific discipline. Implications and future directions are identified.",Jarke J. van Wijk,J.J. van Wijk,"Dept. of Math. & Comput. Sci., Technische Univ. Eindhoven, Netherlands",10.1109/VISUAL.1991.175815;10.1109/INFVIS.2004.70;10.1109/VISUAL.2001.964505;10.1109/VISUAL.2003.1250354;10.1109/INFVIS.2001.963285;10.1109/INFVIS.1999.801851,"Visualization, evaluation",223,57,30,BP;TT
InfoVis,2011,TextFlow: Towards Better Understanding of Evolving Topics in Text,10.1109/TVCG.2011.239,http://dx.doi.org/10.1109/TVCG.2011.239,2412,2421,J,"Understanding how topics evolve in text data is an important and challenging task. Although much work has been devoted to topic analysis, the study of topic evolution has largely been limited to individual topics. In this paper, we introduce TextFlow, a seamless integration of visualization and topic mining techniques, for analyzing various evolution patterns that emerge from multiple topics. We first extend an existing analysis technique to extract three-level features: the topic evolution trend, the critical event, and the keyword correlation. Then a coherent visualization that consists of three new visual components is designed to convey complex relationships between them. Through interaction, the topic mining model and visualization can communicate with each other to help users refine the analysis result and gain insights into the data progressively. Finally, two case studies are conducted to demonstrate the effectiveness and usefulness of TextFlow in helping users understand the major topic evolution patterns in time-varying text data.",Weiwei Cui;Shixia Liu;Li Tan;Conglei Shi;Yangqiu Song;Zekai Gao;Huamin Qu;Xin Tong,Weiwei Cui;Shixia Liu;Li Tan;Conglei Shi;Yangqiu Song;Zekai Gao;Huamin Qu;Xin Tong,Hong Kong University of Science and Technology ∕ Microsoft Research Asia;Microsoft Research Asia;Microsoft Research Asia;Hong Kong University of Science and Technology;Microsoft Research Asia;Zhejiang University ∕ Microsoft Research Asia;Hong Kong University of Science and Technology;Microsoft Research Asia,10.1109/VAST.2010.5652931;10.1109/VAST.2009.5333443;10.1109/TVCG.2006.156;10.1109/TVCG.2009.171;10.1109/TVCG.2008.166;10.1109/TVCG.2010.129;10.1109/VAST.2008.4677364;10.1109/INFVIS.2005.1532122;10.1109/VAST.2009.5333437;10.1109/INFVIS.2005.1532152,"Text visualization, Topic evolution, Hierarchical Dirichlet process, Critical event",223,185,35,
Vis,2000,Volume illustration: non-photorealistic rendering of volume models,10.1109/VISUAL.2000.885694,http://dx.doi.org/10.1109/VISUAL.2000.885694,195,202,C,"Accurately and automatically conveying the structure of a volume model is a problem that has not been fully solved by existing volume rendering approaches. Physics-based volume rendering approaches create images which may match the appearance of translucent materials in nature but may not embody important structural details. Transfer function approaches allow flexible design of the volume appearance but generally require substantial hand-tuning for each new data set in order to be effective. We introduce the volume illustration approach, combining the familiarity of a physics-based illumination model with the ability to enhance important features using non-photorealistic rendering techniques. Since the features to be enhanced are defined on the basis of local volume characteristics rather than volume sample values, the application of volume illustration techniques requires less manual tuning than the design of a good transfer function. Volume illustration provides a flexible unified framework for enhancing structural perception of volume models through the amplification of features and the addition of illumination effects.",David S. Ebert;Penny Rheingans,D. Ebert;P. Rheingans,"Dept. of Comput. Sci. & Electr. Eng., Maryland Univ., Baltimore, MD, USA",10.1109/VISUAL.1996.568111;10.1109/VISUAL.1998.745294;10.1109/VISUAL.1995.480795;10.1109/VISUAL.2000.885696;10.1109/VISUAL.1998.745319;10.1109/VISUAL.1999.809905;10.1109/VISUAL.1999.809932;10.1109/VISUAL.1990.146391,"Volume rendering, non-photorealistic rendering,illustration, lighting models, shading, visualization",221,68,30,BP
Vis,1991,Interactive data visualization using focusing and linking,10.1109/VISUAL.1991.175794,http://dx.doi.org/10.1109/VISUAL.1991.175794,156,"163, 419",C,"Two basic principles for interactive visualization of high-dimensional data-focusing and linking-are discussed. Focusing techniques may involve selecting subsets, dimension reduction, or some more general manipulation of the layout information on the page or screen. A consequent of focusing is that each view only conveys partial information about the data and needs to be linked so that the information contained in individual views can be integrated into a coherent image of the data as a whole. Examples are given of how graphical data analysis methods based on focusing and linking are used in applications including linguistics, geographic information systems, time series analysis, and the analysis of multi-channel images arising in radiology and remote sensing.<<ETX>>",Andreas Buja;John Alan McDonald;J. Michalak;Werner Stuetzle,A. Buja;J.A. McDonald;J. Michalak;W. Stuetzle,"Bellcore, Morristown, NJ, USA",,,220,95,34,
InfoVis,2004,Clutter Reduction in Multi-Dimensional Data Visualization Using Dimension Reordering,10.1109/INFVIS.2004.15,http://dx.doi.org/10.1109/INFVIS.2004.15,89,96,C,"Visual clutter denotes a disordered collection of graphical entities in information visualization. Clutter can obscure the structure present in the data. Even in a small dataset, clutter can make it hard for the viewer to find patterns, relationships and structure. In this paper, we define visual clutter as any aspect of the visualization that interferes with the viewer's understanding of the data, and present the concept of clutter-based dimension reordering. Dimension order is an attribute that can significantly affect a visualization's expressiveness. By varying the dimension order in a display, it is possible to reduce clutter without reducing information content or modifying the data in any way. Clutter reduction is a display-dependent task. In this paper, we follow a three-step procedure for four different visualization techniques. For each display technique, first, we determine what constitutes clutter in terms of display properties; then we design a metric to measure visual clutter in this display; finally we search for an order that minimizes the clutter in a display",Wei Peng;Matthew O. Ward;Elke A. Rundensteiner,Wei Peng;M.O. Ward;E.A. Rundensteiner,Worcester Polytechnic Institute,10.1109/INFVIS.2003.1249015;10.1109/VISUAL.1996.567800;10.1109/VISUAL.1990.146386;10.1109/INFVIS.1998.729559;10.1109/VISUAL.1999.809866;10.1109/INFVIS.1996.559215;10.1109/INFVIS.2000.885086,"Multidimensional visualization, dimension order, visual clutter, visual structure",218,99,27,
InfoVis,2008,Effectiveness of Animation in Trend Visualization,10.1109/TVCG.2008.125,http://dx.doi.org/10.1109/TVCG.2008.125,1325,1332,J,"Animation has been used to show trends in multi-dimensional data. This technique has recently gained new prominence for presentations, most notably with Gapminder Trendalyzer. In Trendalyzer, animation together with interesting data and an engaging presenter helps the audience understand the results of an analysis of the data. It is less clear whether trend animation is effective for analysis. This paper proposes two alternative trend visualizations that use static depictions of trends: one which shows traces of all trends overlaid simultaneously in one display and a second that uses a small multiples display to show the trend traces side-by-side. The paper evaluates the three visualizations for both analysis and presentation. Results indicate that trend animation can be challenging to use even for presentations; while it is the fastest technique for presentation and participants find it enjoyable and exciting, it does lead to many participant errors. Animation is the least effective form for analysis; both static depictions of trends are significantly faster than animation, and the small multiples display is more accurate.",George G. Robertson;Roland Fernandez;Danyel Fisher;Bongshin Lee;John T. Stasko,George Robertson;Roland Fernandez;Danyel Fisher;Bongshin Lee;John Stasko,Microsoft Research;Microsoft Research;Microsoft Research;Microsoft Research;Georgia Institute of Technology,10.1109/INFVIS.1999.801854;10.1109/TVCG.2007.70539,"Information visualization, animation, trends, design, experiment",218,167,21,TT
InfoVis,2009,Protovis: A Graphical Toolkit for Visualization,10.1109/TVCG.2009.174,http://dx.doi.org/10.1109/TVCG.2009.174,1121,1128,J,"Despite myriad tools for visualizing data, there remains a gap between the notational efficiency of high-level visualization systems and the expressiveness and accessibility of low-level graphical systems. Powerful visualization systems may be inflexible or impose abstractions foreign to visual thinking, while graphical systems such as rendering APIs and vector-based drawing programs are tedious for complex work. We argue that an easy-to-use graphical system tailored for visualization is needed. In response, we contribute Protovis, an extensible toolkit for constructing visualizations by composing simple graphical primitives. In Protovis, designers specify visualizations as a hierarchy of marks with visual properties defined as functions of data. This representation achieves a level of expressiveness comparable to low-level graphics systems, while improving efficiency - the effort required to specify a visualization - and accessibility - the effort required to learn and modify the representation. We substantiate this claim through a diverse collection of examples and comparative analysis with popular visualization tools.",Michael Bostock;Jeffrey Heer,Michael Bostock;Jeffrey Heer,Stanford University;Stanford University,10.1109/VISUAL.1999.809864;10.1109/INFVIS.2004.12;10.1109/TVCG.2006.178;10.1109/TVCG.2007.70577;10.1109/INFVIS.1998.729560;10.1109/VAST.2007.4389011;10.1109/TVCG.2008.166;10.1109/INFVIS.2004.64;10.1109/INFVIS.2000.885086;10.1109/VAST.2007.4388996,"Information visualization, user interfaces, toolkits, 2D graphics",215,149,38,
InfoVis,2013,A Multi-Level Typology of Abstract Visualization Tasks,10.1109/TVCG.2013.124,http://dx.doi.org/10.1109/TVCG.2013.124,2376,2385,J,"The considerable previous work characterizing visualization usage has focused on low-level tasks or interactions and high-level tasks, leaving a gap between them that is not addressed. This gap leads to a lack of distinction between the ends and means of a task, limiting the potential for rigorous analysis. We contribute a multi-level typology of visualization tasks to address this gap, distinguishing why and how a visualization task is performed, as well as what the task inputs and outputs are. Our typology allows complex tasks to be expressed as sequences of interdependent simpler tasks, resulting in concise and flexible descriptions for tasks of varying complexity and scope. It provides abstract rather than domain-specific descriptions of tasks, so that useful comparisons can be made between visualization systems targeted at different application domains. This descriptive power supports a level of analysis required for the generation of new designs, by guiding the translation of domain-specific problems into abstract tasks, and for the qualitative evaluation of visualization usage. We demonstrate the benefits of our approach in a detailed case study, comparing task descriptions from our typology to those derived from related work. We also discuss the similarities and differences between our typology and over two dozen extant classification systems and theoretical frameworks from the literatures of visualization, human-computer interaction, information retrieval, communications, and cartography.",Matthew Brehmer;Tamara Munzner,Matthew Brehmer;Tamara Munzner,University of British Columbia;University of British Columbia,10.1109/TVCG.2007.70541;10.1109/TVCG.2012.219;10.1109/INFVIS.1996.559213;10.1109/TVCG.2012.213;10.1109/TVCG.2012.273;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2010.177;10.1109/TVCG.2007.70539;10.1109/INFVIS.2002.1173148;10.1109/TVCG.2007.70515;10.1109/TVCG.2012.204;10.1109/TVCG.2009.111;10.1109/TVCG.2008.109;10.1109/VISUAL.1992.235203;10.1109/INFVIS.2004.59;10.1109/VAST.2008.4677365;10.1109/VAST.2011.6102438;10.1109/TVCG.2008.121;10.1109/TVCG.2008.137;10.1109/INFVIS.1998.729560;10.1109/INFVIS.2004.10;10.1109/TVCG.2012.252;10.1109/VISUAL.1990.146375,"Typology, visualization models, task and requirements analysis, qualitative evaluation",215,215,84,
Vis,1990,Exploring N-dimensional databases,10.1109/VISUAL.1990.146386,http://dx.doi.org/10.1109/VISUAL.1990.146386,230,237,C,"The authors present a tool for the display and analysis of N-dimensional data based on a technique called dimensional stacking. This technique is described. The primary goal is to create a tool that enables the user to project data of arbitrary dimensions onto a two-dimensional image. Of equal importance is the ability to control the viewing parameters, so that one can interactively adjust what ranges of values each dimension takes and the form in which the dimensions are displayed. This will allow an intuitive feel for the data to be developed as the database is explored. The system uses dimensional stacking, to collapse and N-dimension space down into a 2-D space and then render the values contained therein. Each value can then be represented as a pixel or rectangular region on a 2-D screen whose intensity corresponds to the data value at that point.<<ETX>>",Jeffrey LeBlanc;Matthew O. Ward;Norman Wittels,J. LeBlanc;M.O. Ward;N. Wittels,"Worcester Polytech. Inst., MA, USA;Worcester Polytech. Inst., MA, USA;Worcester Polytech. Inst., MA, USA",,,214,101,16,
Vis,2001,Visualization of large terrains made easy,10.1109/VISUAL.2001.964533,http://dx.doi.org/10.1109/VISUAL.2001.964533,363,370,C,"We present an elegant and simple to implement framework for performing out-of-core visualization and view-dependent refinement of large terrain surfaces. Contrary to the trend of increasingly elaborate algorithms for large-scale terrain visualization, our algorithms and data structures have been designed with the primary goal of simplicity and efficiency of implementation. Our approach to managing large terrain data also departs from more conventional strategies based on data tiling. Rather than emphasizing how to segment and efficiently bring data in and out of memory, we focus on the manner in which the data is laid out to achieve good memory coherency for data accesses made in a top-down (coarse-to-fine) refinement of the terrain. We present and compare the results of using several different data indexing schemes, and propose a simple to compute index that yields substantial improvements in locality and speed over more commonly used data layouts. Our second contribution is a new and simple, yet easy to generalize method for view-dependent refinement. Similar to several published methods in this area, we use longest edge bisection in a top-down traversal of the mesh hierarchy to produce a continuous surface with subdivision connectivity. In tandem with the refinement, we perform view frustum culling and triangle stripping. These three components are done together in a single pass over the mesh. We show how this framework supports virtually any error metric, while still being highly memory and compute efficient.",Peter Lindstrom;Valerio Pascucci,P. Lindstrom;V. Pascucci,"Center for Appl. Sci. Comput., Lawrence Livermore Nat. Lab., CA, USA;Center for Appl. Sci. Comput., Lawrence Livermore Nat. Lab., CA, USA",10.1109/VISUAL.1997.663860;10.1109/VISUAL.1997.663895;10.1109/VISUAL.1998.745280;10.1109/VISUAL.1997.663863;10.1109/VISUAL.1995.480805;10.1109/VISUAL.1997.663862;10.1109/VISUAL.2000.885699;10.1109/VISUAL.1998.745342;10.1109/VISUAL.1996.568125;10.1109/VISUAL.1998.745282,,214,78,26,
InfoVis,2008,Geometry-Based Edge Clustering for Graph Visualization,10.1109/TVCG.2008.135,http://dx.doi.org/10.1109/TVCG.2008.135,1277,1284,J,"Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings make the display visually cluttered and thus difficult to explore. In this paper, we propose a novel geometry-based edge-clustering framework that can group edges into bundles to reduce the overall edge crossings. Our method uses a control mesh to guide the edge-clustering process; edge bundles can be formed by forcing all edges to pass through some control points on the mesh. The control mesh can be generated at different levels of detail either manually or automatically based on underlying graph patterns. Users can further interact with the edge-clustering results through several advanced visualization techniques such as color and opacity enhancement. Compared with other edge-clustering methods, our approach is intuitive, flexible, and efficient. The experiments on some large graphs demonstrate the effectiveness of our method.",Weiwei Cui;Hong Zhou;Huamin Qu;Pak Chung Wong;Xiaoming Li,Weiwei Cui;Hong Zhou;Huamin Qu;Pak Chung Wong;Xiaoming Li,the Hong Kong University of Science and Technology;the Hong Kong University of Science and Technology;the Hong Kong University of Science and Technology;Pacific Northwest National Laboratory;Peking University,10.1109/TVCG.2007.70535;10.1109/TVCG.2007.70580;10.1109/INFVIS.2004.43;10.1109/INFVIS.2003.1249008;10.1109/INFVIS.2005.1532150;10.1109/INFVIS.2004.66;10.1109/INFVIS.2005.1532138;10.1109/TVCG.2006.147,"Graph visualization, visual clutter, mesh, edge clustering",212,154,23,
InfoVis,1999,Cushion treemaps: visualization of hierarchical information,10.1109/INFVIS.1999.801860,http://dx.doi.org/10.1109/INFVIS.1999.801860,73,"78, 147",C,"A new method is presented for the visualization of hierarchical information, such as directory structures and organization structures. Cushion treemaps inherit the elegance of standard treemaps: compact, space-filling displays of hierarchical information, based on recursive subdivision of a rectangular image space. Intuitive shading is used to provide insight in the hierarchical structure. During the subdivision, ridges are added per rectangle, which are rendered with a simple shading model. The result is a surface that consists of recursive cushions. The method is efficient, effective, easy to use and implement, and has a wide applicability.",Jarke J. van Wijk;Huub van de Wetering,J.J. Van Wijk;H. Van de Wetering,"Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands",10.1109/VISUAL.1991.175815,"Information Visualization, Tree Visualization, Treemaps",211,82,11,
InfoVis,2008,"The Word Tree, an Interactive Visual Concordance",10.1109/TVCG.2008.172,http://dx.doi.org/10.1109/TVCG.2008.172,1221,1228,J,"We introduce the Word Tree, a new visualization and information-retrieval technique aimed at text documents. A Word Tree is a graphical version of the traditional ""keyword-in-context"" method, and enables rapid querying and exploration of bodies of text. In this paper we describe the design of the technique, along with some of the technical issues that arise in its implementation. In addition, we discuss the results of several months of public deployment of word trees on Many Eyes, which provides a window onto the ways in which users obtain value from the visualization.",Martin Wattenberg;Fernanda B. Viégas,Martin Wattenberg;Fernanda B. Viégas,IBM Research;IBM Research,10.1109/INFVIS.2002.1173155;10.1109/VAST.2007.4389006;10.1109/TVCG.2007.70577;10.1109/INFVIS.2002.1173148,"Text visualization, document visualization, Many Eyes, case study, concordance, information retrieval, search",209,139,15,
Vis,1996,Optimizing triangle strips for fast rendering,10.1109/VISUAL.1996.568125,http://dx.doi.org/10.1109/VISUAL.1996.568125,319,326,C,"Almost all scientific visualization involving surfaces is currently done via triangles. The speed at which such triangulated surfaces can be displayed is crucial to interactive visualization and is bounded by the rate at which triangulated data can be sent to the graphics subsystem for rendering. Partitioning polygonal models into triangle strips can significantly reduce rendering times over transmitting each triangle individually. We present new and efficient algorithms for constructing triangle strips from partially triangulated models, and experimental results showing these strips are on average 15% better than those from previous codes. Further, we study the impact of larger buffer sizes and various queuing disciplines on the effectiveness of triangle strips.",Francine Evans;Steven Skiena;Amitabh Varshney,F. Evans;S. Skiena;A. Varshney,"State Univ. of New York, Stony Brook, NY, USA",,,208,75,13,
VAST,2007,Design Considerations for Collaborative Visual Analytics,10.1109/VAST.2007.4389011,http://dx.doi.org/10.1109/VAST.2007.4389011,171,178,C,"Information visualization leverages the human visual system to support the process of sensemaking, in which information is collected, organized, and analyzed to generate knowledge and inform action. Though most research to date assumes a single-user focus on perceptual and cognitive processes, in practice, sensemaking is often a social process involving parallelization of effort, discussion, and consensus building. This suggests that to fully support sensemaking, interactive visualization should also support social interaction. However, the most appropriate collaboration mechanisms for supporting this interaction are not immediately clear. In this article, we present design considerations for asynchronous collaboration in visual analysis environments, highlighting issues of work parallelization, communication, and social organization. These considerations provide a guide for the design and evaluation of collaborative visualization systems.",Jeffrey Heer;Maneesh Agrawala,Jeffrey Heer;Maneesh Agrawala,"University of California, Soda Hall, UC Berkeley, Berkeley, CA 94720-1776. E-Mail: jheer@cs.berkeley.edu;University of California, Soda Hall, UC Berkeley, Berkeley, CA 94720-1776. E-Mail: maneesh@cs.berkeley.edu",10.1109/VISUAL.1991.175820;10.1109/TVCG.2006.178;10.1109/TVCG.2006.202;10.1109/VAST.2006.261439,"visualization, analysis, collaboration, design, computer-supported cooperative work",205,25,53,
Vis,1995,High Dimensional Brushing for Interactive Exploration of Multivariate Data,10.1109/VISUAL.1995.485139,http://dx.doi.org/10.1109/VISUAL.1995.485139,271,,C,,Allen R. Martin;Matthew O. Ward,A.R. Martin;M.O. Ward,,10.1109/VISUAL.1990.146386;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1994.346302,,203,79,9,TT
InfoVis,1998,Similarity clustering of dimensions for an enhanced visualization of multidimensional data,10.1109/INFVIS.1998.729559,http://dx.doi.org/10.1109/INFVIS.1998.729559,52,"60, 153",C,"The order and arrangement of dimensions (variates) is crucial for the effectiveness of a large number of visualization techniques such as parallel coordinates, scatterplots, recursive pattern, and many others. We describe a systematic approach to arrange the dimensions according to their similarity. The basic idea is to rearrange the data dimensions such that dimensions showing a similar behavior are positioned next to each other. For the similarity clustering of dimensions, we need to define similarity measures which determine the partial or global similarity of dimensions. We then consider the problem of finding an optimal one- or two-dimensional arrangement of the dimensions based on their similarity. Theoretical considerations show that both, the one- and the two-dimensional arrangement problem are surprisingly hard problems, i.e. they are NP complete. Our solution of the problem is therefore based on heuristic algorithms. An empirical evaluation using a number of different visualization techniques shows the high impact of our similarity clustering of dimensions on the visualization results.",Mihael Ankerst;Stefan Berchtold;Daniel A. Keim,M. Ankerst;S. Berchtold;D.A. Keim,"Munich Univ., Germany",10.1109/VISUAL.1990.146402;10.1109/VISUAL.1994.346302;10.1109/VISUAL.1995.485140,,203,120,30,
InfoVis,2001,Animated exploration of dynamic graphs with radial layout,10.1109/INFVIS.2001.963279,http://dx.doi.org/10.1109/INFVIS.2001.963279,43,50,C,,Ka-Ping Yee;Danyel Fisher;Rachna Dhamija;Marti A. Hearst,Ka-Ping Yee;D. Fisher;R. Dhamija;M. Hearst,University of California,10.1109/INFVIS.1997.636718,"graph drawing, animation, interaction",203,25,22,
InfoVis,2005,Flow map layout,10.1109/INFVIS.2005.1532150,http://dx.doi.org/10.1109/INFVIS.2005.1532150,219,224,C,"Cartographers have long used flow maps to show the movement of objects from one location to another, such as the number of people in a migration, the amount of goods being traded, or the number of packets in a network. The advantage of flow maps is that they reduce visual clutter by merging edges. Most flow maps are drawn by hand and there are few computer algorithms available. We present a method for generating flow maps using hierarchical clustering given a set of nodes, positions, and flow data between the nodes. Our techniques are inspired by graph layout algorithms that minimize edge crossings and distort node positions while maintaining their relative position to one another. We demonstrate our technique by producing flow maps for network traffic, census data, and trade data.",Doantam Phan;Ling Xiao;Ron B. Yeh;Pat Hanrahan;Terry Winograd,Doantam Phan;Ling Xiao;R. Yeh;P. Hanrahan,"Stanford Univ., CA, USA;Stanford Univ., CA, USA;Stanford Univ., CA, USA;Stanford Univ., CA, USA",10.1109/INFVIS.1995.528697;10.1109/INFVIS.1996.559226,"flow maps, GIS, hierarchical clustering",203,46,21,
Vis,2002,Geometric surface smoothing via anisotropic diffusion of normals,10.1109/VISUAL.2002.1183766,http://dx.doi.org/10.1109/VISUAL.2002.1183766,125,132,C,"This paper introduces a method for smoothing complex, noisy surfaces, while preserving (and enhancing) sharp, geometric features. It has two main advantages over previous approaches to feature preserving surface smoothing. First is the use of level set surface models, which allows us to process very complex shapes of arbitrary and changing topology. This generality makes it well suited for processing surfaces that are derived directly from measured data. The second advantage is that the proposed method derives from a well-founded formulation, which is a natural generalization of anisotropic diffusion, as used in image processing. This formulation is based on the proposition that the generalization of image filtering entails filtering the normals of the surface, rather than processing the positions of points on a mesh.",Tolga Tasdizen;Ross T. Whitaker;Paul Burchard;Stanley J. Osher,T. Tasdizen;R. Whitaker;P. Burchard;S. Osher,"Sch. of Comput., Utah Univ., Salt Lake City, UT, USA",,"anisotropic diffusion, surface fairing, geometric surface processing, intrinsic Laplacian of curvature, level sets",202,87,32,
Vis,1995,Recursive pattern: a technique for visualizing very large amounts of data,10.1109/VISUAL.1995.485140,http://dx.doi.org/10.1109/VISUAL.1995.485140,279,"286, 463",C,"An important goal of visualization technology is to support the exploration and analysis of very large amounts of data. In this paper, we propose a new visualization technique called a 'recursive pattern', which has been developed for visualizing large amounts of multidimensional data. The technique is based on a generic recursive scheme which generalizes a wide range of pixel-oriented arrangements for displaying large data sets. By instantiating the technique with adequate data- and application-dependent parameters, the user may greatly influence the structure of the resulting visualizations. Since the technique uses one pixel for presenting each data value, the amount of data which can be displayed is only limited by the resolution of current display technology and by the limitations of human perceptibility. Beside describing the basic idea of the 'recursive pattern' technique, we provide several examples of useful parameter settings for the various recursion levels. We further show that our 'recursive pattern' technique is particularly advantageous for the large class of data sets which have a natural order according to one dimension (e.g. time series data). We demonstrate the usefulness of our technique by using a stock market application.",Daniel A. Keim;Mihael Ankerst;Hans-Peter Kriegel,D.A. Keim;H.-P. Kriegel;M. Ankerst,"Inst. for Comput. Sci., Munchen Univ., Germany;Inst. for Comput. Sci., Munchen Univ., Germany;Inst. for Comput. Sci., Munchen Univ., Germany",10.1109/VISUAL.1990.146402;10.1109/INFVIS.1995.528688;10.1109/VISUAL.1991.175809;10.1109/VISUAL.1990.146386;10.1109/VISUAL.1990.146387;10.1109/VISUAL.1990.146389,"Visualizing Large Data Sets, Visualizing Multidimensional and Multivariate Data, Visualizing Large Sequential Data Sets, Recursive Visualization Techniques, Interfaces to Databases",201,79,30,
Vis,1999,Multiresolution Techniques for Interactive Texture-based Volume Visualization,10.1109/VISUAL.1999.809908,http://doi.ieeecomputersociety.org/10.1109/VISUAL.1999.809908,355,,C,"We present a multiresolution technique for interactive texture-based volume visualization of very large data sets. This method uses an adaptive scheme that renders the volume in a region-of-interest at a high resolution and the volume away from this region at progressively lower resolutions. The algorithm is based on the segmentation of texture space into an octree, where the leaves of the tree define the original data and the internal nodes define lower-resolution versions. Rendering is done adaptively by selecting high-resolution cells close to a center of attention and low-resolution cells away from this area. We limit the artifacts introduced by this method by modifying the transfer functions in the lower-resolution data sets and utilizing spherical shells as a proxy geometry. It is possible to use this technique to produce viewpoint-dependent renderings of very large data sets.",Eric LaMar;Bernd Hamann;Kenneth I. Joy,E. LaMar;B. Hamann;K.I. Joy,"Center for Image Process. & Integrated Comput., California Univ., Davis, CA, USA",,"multiresolution rendering, volume visualization, hardware texture",200,52,0,
InfoVis,1996,Techniques for non-linear magnification transformations,10.1109/INFVIS.1996.559214,http://dx.doi.org/10.1109/INFVIS.1996.559214,38,45,C,"This paper presents efficient methods for implementing general non-linear magnification transformations. Techniques are provided for: combining linear and non-linear magnifications, constraining the domain of magnifications, combining multiple transformations, and smoothly interpolating between magnified and normal views. In addition, piecewise linear methods are introduced which allow greater efficiency and expressiveness than their continuous counterparts.",Alan Keahey;Edward L. Robertson,T.A. Keahey;E.L. Robertson,"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA",,,199,47,17,
Vis,1991,A tool for visualizing the topology of three-dimensional vector fields,10.1109/VISUAL.1991.175773,http://dx.doi.org/10.1109/VISUAL.1991.175773,33,"40, 408",C,"A description is given of a software system, TOPO, that numerically analyzes and graphically displays topological aspects of a three-dimensional vector field, v, to produce a single, relatively simple picture that characterizes v. The topology of v considered consists of its critical points (where v=0), their invariant manifolds, and the integral curves connecting these invariant manifolds. The field in the neighborhood of each critical point is approximated by the Taylor expansion. The coefficients of the first nonzero term of the Taylor expansion around a critical point are the 3*3 matrix Delta v. Critical points are classified by examining Delta v's eigenvalues. The eigenvectors of Delta v span the invariant manifolds of the linearized field around a critical point. Curves integrated from initial points on the eigenvectors a small distance from a critical point connect with other critical points (or the boundary) to complete the topology. One class of critical surfaces that is important in computational fluid dynamics is analyzed.<<ETX>>",Al Globus;Creon Levit;T. Lasinski,A. Globus;C. Levit;T. Lasinski,,10.1109/VISUAL.1990.146360;10.1109/VISUAL.1990.146359,,198,120,44,
Vis,1997,DNA visual and analytic data mining,10.1109/VISUAL.1997.663916,http://dx.doi.org/10.1109/VISUAL.1997.663916,437,441,C,"Describes data exploration techniques designed to classify DNA sequences. Several visualization and data mining techniques were used to validate and attempt to discover new methods for distinguishing coding DNA sequences (exons) from non-coding DNA sequences (introns). The goal of the data mining was to see whether some other, possibly non-linear combination of the fundamental position-dependent DNA nucleotide frequency values could be a better predictor than the AMI (average mutual information). We tried many different classification techniques including rule-based classifiers and neural networks. We also used visualization of both the original data and the results of the data mining to help verify patterns and to understand the distinction between the different types of data and classifications. In particular, the visualization helped us develop refinements to neural network classifiers, which have accuracies as high as any known method. Finally, we discuss the interactions between visualization and data mining and suggest an integrated approach.",Patrick Hoffman;Georges G. Grinstein;Kenneth A. Marx;Ivo Grosse;Eugene Stanley,P. Hoffman;G. Grinstein;K. Marx;I. Grosse;E. Stanley,"Inst. for Visualization & Perception Res., Massachusetts Univ., Lowell, MA, USA",10.1109/VISUAL.1995.485139,,198,101,17,
Vis,2006,Fast and Efficient Compression of Floating-Point Data,10.1109/TVCG.2006.143,http://dx.doi.org/10.1109/TVCG.2006.143,1245,1250,J,"Large scale scientific simulation codes typically run on a cluster of CPUs that write/read time steps to/from a single file system. As data sets are constantly growing in size, this increasingly leads to I/O bottlenecks. When the rate at which data is produced exceeds the available I/O bandwidth, the simulation stalls and the CPUs are idle. Data compression can alleviate this problem by using some CPU cycles to reduce the amount of data needed to be transfered. Most compression schemes, however, are designed to operate offline and seek to maximize compression, not throughput. Furthermore, they often require quantizing floating-point values onto a uniform integer grid, which disqualifies their use in applications where exact values must be retained. We propose a simple scheme for lossless, online compression of floating-point data that transparently integrates into the I/O of many applications. A plug-in scheme for data-dependent prediction makes our scheme applicable to a wide variety of data used in visualization, such as unstructured meshes, point sets, images, and voxel grids. We achieve state-of-the-art compression rates and speeds, the latter in part due to an improved entropy coder. We demonstrate that this significantly accelerates I/O throughput in real simulation runs. Unlike previous schemes, our method also adapts well to variable-precision floating-point and integer data",Peter Lindstrom;Martin Isenburg,Peter Lindstrom;Martin Isenburg,"Lawrence Livermore National Laboratory;University of California, Berkeley",10.1109/VISUAL.1999.809868;10.1109/VISUAL.2000.885711;10.1109/VISUAL.2002.1183768;10.1109/VISUAL.1996.568138,"High throughput, lossless compression, file compaction for I/O efficiency, fast entropy coding, range coder, predictive coding, large scale simulation and visualization",197,170,31,
Vis,1997,Optimized geometry compression for real-time rendering,10.1109/VISUAL.1997.663902,http://dx.doi.org/10.1109/VISUAL.1997.663902,347,354,C,"Most existing visualization applications use 3D geometry as their basic rendering primitive. As users demand more complex data sets, the memory requirements for retrieving and storing large 3D models are becoming excessive. In addition, the current 3D rendering hardware is facing a large memory bus bandwidth bottleneck at the processor to graphics pipeline interface. Rendering 1 million triangles with 24 bytes per triangle at 30 Hz requires as much as 720 MB/sec memory bus bandwidth. This transfer rate is well beyond the current low-cost graphics systems. A solution is to compress the static 3D geometry as an off-line pre-process. Then, only the compressed geometry needs to be stored in main memory and sent down to the graphics pipeline for real-time decompression and rendering. The author presents several new techniques for compression of 3D geometry that produce 2 to 3 times better compression ratios than existing methods. They first introduce several algorithms for the efficient encoding of the original geometry as generalized triangle meshes. This encoding allows most of the mesh vertices to be reused when forming new triangles. Their second contribution allows various parts of a geometric model to be compressed with different precision depending on the level of details present. Together, the meshifying algorithms and the variable compression method achieve compression ratios of 30 and 37 to one over ASCII encoded formats and 10 and 15 to one over binary encoded triangle strips. The experimental results show a dramatically lowered memory bandwidth required for real-time visualization of complex data sets.",Mike M. Chow,M.M. Chow,"MIT, Cambridge, MA, USA",10.1109/VISUAL.1996.568125,,196,61,11,
InfoVis,2006,ASK-graphView: a large scale graph visualization system,10.1109/TVCG.2006.120,http://dx.doi.org/10.1109/TVCG.2006.120,669,676,J,"We describe ASK-GraphView, a node-link-based graph visualization system that allows clustering and interactive navigation of large graphs, ranging in size up to 16 million edges. The system uses a scalable architecture and a series of increasingly sophisticated clustering algorithms to construct a hierarchy on an arbitrary, weighted undirected input graph. By lowering the interactivity requirements we can scale to substantially bigger graphs. The user is allowed to navigate this hierarchy in a top down manner by interactively expanding individual clusters. ASK-GraphView also provides facilities for filtering and coloring, annotation and cluster labeling",James Abello;Frank van Ham;Neeraj Krishnan,James Abello;Frank Van Ham;Neeraj Krishnan,"Ask.com and DIMACS, Rutgers University;IBM, but this work was performed while consulting for Ask.com in 2005;Ask.com",10.1109/INFVIS.2004.46;10.1109/INFVIS.2005.1532127;10.1109/INFVIS.2004.66;10.1109/INFVIS.1997.636718;10.1109/INFVIS.2004.43,"Information visualization, graph visualization, graph clustering",196,140,25,
InfoVis,2006,MatrixExplorer: a Dual-Representation System to Explore Social Networks,10.1109/TVCG.2006.160,http://dx.doi.org/10.1109/TVCG.2006.160,677,684,J,"MatrixExplorer is a network visualization system that uses two representations: node-link diagrams and matrices. Its design comes from a list of requirements formalized after several interviews and a participatory design session conducted with social science researchers. Although matrices are commonly used in social networks analysis, very few systems support the matrix-based representations to visualize and analyze networks. MatrixExplorer provides several novel features to support the exploration of social networks with a matrix-based representation, in addition to the standard interactive filtering and clustering functions. It provides tools to reorder (layout) matrices, to annotate and compare findings across different layouts and find consensus among several clusterings. MatrixExplorer also supports node-link diagram views which are familiar to most users and remain a convenient way to publish or communicate exploration results. Matrix and node-link representations are kept synchronized at all stages of the exploration process",Nathalie Henry Riche;Jean-Daniel Fekete,Nathalie Henry;Jean-daniel Fekete,IEEE Computer Society;IEEE Computer Society,10.1109/INFVIS.2004.64,"social networks visualization, node-link diagrams, matrix-based representations, exploratory process, matrix ordering, interactive clustering, consensus",194,136,35,
InfoVis,2002,Interactive information visualization of a million items,10.1109/INFVIS.2002.1173156,http://dx.doi.org/10.1109/INFVIS.2002.1173156,117,124,C,"Existing information visualization techniques are usually limited to the display of a few thousand items. This article describes new interactive techniques capable of handling a million items (effectively visible and manageable on screen). We evaluate the use of hardware-based techniques available with newer graphics cards, as well as new animation techniques and non-standard graphical features such as stereovision and overlap count. These techniques have been applied to two popular information visualizations: treemaps and scatter plot diagrams; but are generic enough to be applied to other 2D representations as well.",Jean-Daniel Fekete;Catherine Plaisant,J.-D. Fekete;C. Plaisant,"Human Comput. Interaction Lab., Maryland Univ., Baltimore, MD, USA;Human Comput. Interaction Lab., Maryland Univ., Baltimore, MD, USA",10.1109/INFVIS.2001.963274;10.1109/VISUAL.1991.175815;10.1109/INFVIS.2001.963279;10.1109/INFVIS.1995.528685;10.1109/VISUAL.1996.567774,,193,91,25,
Vis,1996,Octree-based decimation of marching cubes surfaces,10.1109/VISUAL.1996.568127,http://dx.doi.org/10.1109/VISUAL.1996.568127,335,342,C,"The marching cubes (MC) algorithm is a method for generating isosurfaces. It also generates an excessively large number of triangles to represent an isosurface; this increases the rendering time. This paper presents a decimation method to reduce the number of triangles generated. Decimation is carried out before creating a large number of triangles. Four major steps comprise the algorithm: surface tracking, merging, crack patching and triangulation. Surface tracking is an enhanced implementation of the MC algorithm. Starting from a seed point, the surface tracker visits only those cells likely to compose part of the desired isosurface. The cells making up the extracted surface are stored in an octree that is further processed. A bottom-up approach is taken in merging the cells containing a relatively flat approximating surface. The finer surface details are maintained. Cells are merged as long as the error due to such an operation is within a user-specified error parameter, or a cell acquires more than one connected surface component in it. A crack patching method is described that forces edges of smaller cells to lie along those of the larger neighboring cells. The overall saving in the number of triangles depends both on the specified error value and the nature of the data. Use of the hierarchical octree data structure also presents the potential of incremental representation of surfaces. We can generate a highly smoothed surface representation which can be progressively refined as the user-specified error value is decreased.",Raj Shekhar;Elias Fayyad;Roni Yagel;J. Fredrick Cornhill,R. Shekhar;E. Fayyad;R. Yagel;J.F. Cornhill,"Biomed. Eng. Center, Ohio State Univ., Columbus, OH, USA",10.1109/VISUAL.1994.346308,,192,73,7,
InfoVis,2008,"Graphical Histories for Visualization: Supporting Analysis, Communication, and Evaluation",10.1109/TVCG.2008.137,http://dx.doi.org/10.1109/TVCG.2008.137,1189,1196,J,"Interactive history tools, ranging from basic undo and redo to branching timelines of user actions, facilitate iterative forms of interaction. In this paper, we investigate the design of history mechanisms for information visualization. We present a design space analysis of both architectural and interface issues, identifying design decisions and associated trade-offs. Based on this analysis, we contribute a design study of graphical history tools for Tableau, a database visualization system. These tools record and visualize interaction histories, support data analysis and communication of findings, and contribute novel mechanisms for presenting, managing, and exporting histories. Furthermore, we have analyzed aggregated collections of history sessions to evaluate Tableau usage. We describe additional tools for analyzing userspsila history logs and how they have been applied to study usage patterns in Tableau.",Jeffrey Heer;Jock D. Mackinlay;Chris Stolte;Maneesh Agrawala,Jeffrey Heer;Jock Mackinlay;Chris Stolte;Maneesh Agrawala,"University of California at Berkeley;Tableau Software, Inc.;Tableau Software, Inc.;University of California at Berkeley",10.1109/INFVIS.2000.885086;10.1109/VISUAL.1993.398857;10.1109/VISUAL.1999.809871;10.1109/INFVIS.2004.2;10.1109/VISUAL.1995.480801;10.1109/TVCG.2007.70594;10.1109/VAST.2007.4388992,"Visualization, history, undo, analysis, presentation, evaluation",192,127,31,
Vis,1996,Generation of Transfer Functions with Stochastic Search Technique,10.1109/VISUAL.1996.568113,http://dx.doi.org/10.1109/VISUAL.1996.568113,227,234,C,"This paper presents a novel approach to assist the user in exploring appropriate transfer functions for the visualization of volumetric datasets. The search for a transfer function is treated as a parameter optimization problem and addressed with stochastic search techniques. Starting from an initial population of (random or pre-defined) transfer functions, the evolution of the stochastic algorithms is controlled by either direct user selection of intermediate images or automatic fitness evaluation using user-specified objective functions. This approach essentially shields the user from the complex and tedious ""trial and error"" approach, and demonstrates effective and convenient generation of transfer functions.",Taosong He;Lichan Hong;Arie E. Kaufman;Hanspeter Pfister,Taosong He;Lichan Hong;A. Kaufman;H. Pfister,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",,,191,0,0,
InfoVis,2009,Bubble Sets: Revealing Set Relations with Isocontours over Existing Visualizations,10.1109/TVCG.2009.122,http://dx.doi.org/10.1109/TVCG.2009.122,1009,1016,J,"While many data sets contain multiple relationships, depicting more than one data relationship within a single visualization is challenging. We introduce Bubble Sets as a visualization technique for data that has both a primary data relation with a semantically significant spatial organization and a significant set membership relation in which members of the same set are not necessarily adjacent in the primary layout. In order to maintain the spatial rights of the primary data relation, we avoid layout adjustment techniques that improve set cluster continuity and density. Instead, we use a continuous, possibly concave, isocontour to delineate set membership, without disrupting the primary layout. Optimizations minimize cluster overlap and provide for calculation of the isocontours at interactive speeds. Case studies show how this technique can be used to indicate multiple sets on a variety of common visualizations.",Christopher Collins 0001;Gerald Penn;Sheelagh Carpendale,Christopher Collins;Gerald Penn;Sheelagh Carpendale,University of Toronto;University of Toronto;University of Calgary,10.1109/TVCG.2006.122;10.1109/INFVIS.2005.1532150;10.1109/TVCG.2008.130;10.1109/TVCG.2008.144;10.1109/INFVIS.2005.1532126;10.1109/TVCG.2007.70521;10.1109/TVCG.2008.153,"clustering, spatial layout, graph visualization, tree visualization",191,149,23,
Vis,1999,Tensorlines: Advection-Diffusion based Propagation through Diffusion Tensor Fields,10.1109/VISUAL.1999.809894,http://dx.doi.org/10.1109/VISUAL.1999.809894,249,253,C,"Tracking linear features through tensor field datasets is an open research problem with widespread utility in medical and engineering disciplines. Existing tracking methods, which consider only the preferred local diffusion direction as they propagate, fail to accurately follow features as they enter regions of local complexity. This shortcoming is a result of partial voluming; that is, voxels in these regions often contain contributions from multiple features. These combined contributions result in ambiguities when deciding local primary feature orientation based solely on the preferred diffusion direction. We introduce a novel feature extraction method which we term tensorline propagation. Our method resolves the above ambiguity by incorporating information about the nearby orientation of the feature, as well as the anisotropic classification of the local tensor. The nearby orientation information is added in the spirit of an advection term in a standard diffusion based propagation technique, and has the effect of stabilizing the tracking. To demonstrate the efficacy of tensorlines, we apply this method to the neuroscience problem of tracking white-matter bundles within the brain.",David M. Weinstein;Gordon L. Kindlmann;Eric C. Lundberg,D. Weinstein;G. Kindlmann;E. Lundberg,"Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.1993.398849;10.1109/VISUAL.1991.175789;10.1109/VISUAL.1992.235193;10.1109/VISUAL.1995.485141;10.1109/VISUAL.1998.745294;10.1109/VISUAL.1999.809886,,189,32,0,
Vis,1996,The Design and Implementation of an Object-Oriented Toolkit for 3D Graphics and Visualization,10.1109/VISUAL.1996.567752,http://doi.ieeecomputersociety.org/10.1109/VISUAL.1996.567752,93,100,C,"The Visualization Toolkit (vtk) is a freely available C++ class library for 3D graphics and visualization. We describe core characteristics of the toolkit. This includes a description of object oriented models for graphics and visualization; methods for synchronizing system execution; a summary of data representation schemes; the role of C++; issues in portability across PC and Unix systems; and how we automatically wrap the C++ class library with interpreted languages such as Java and Tcl. We also demonstrate the capabilities of the system for scalar, vector, tensor, and other visualization techniques.",William J. Schroeder;Ken Martin;William E. Lorensen,W.J. Schroeder;K.M. Martin;W.E. Lorensen,"GE Corp. Res. & Dev., USA",10.1109/VISUAL.1993.398878;10.1109/VISUAL.1994.346303;10.1109/VISUAL.1992.235205;10.1109/VISUAL.1995.480821,,187,43,0,
Vis,1996,Mesh reduction with error control,10.1109/VISUAL.1996.568124,http://dx.doi.org/10.1109/VISUAL.1996.568124,311,318,C,"In many cases the surfaces of geometric models consist of a large number of triangles. Several algorithms were developed to reduce the number of triangles required to approximate such objects. Algorithms that measure the deviation between the approximated object and the original object are only available for special cases. We use the Hausdorff distance between the original and the simplified mesh as a geometrically meaningful error value which can be applied to arbitrary triangle meshes. We present a new algorithm to reduce the number of triangles of a mesh without exceeding a user defined Hausdorff distance between the original and simplified mesh. As this distance is parameterization independent, its use as error measure is superior to the use of the L/sup /spl infin//-Norm between parameterized surfaces. Furthermore the Hausdorff distance is always less than the distance induced by the L/sup /spl infin//-Norm. This results in higher reduction rates. Excellent results were achieved by the new decimation algorithm for triangle meshes that has been used in different application areas such as volume rendering, terrain modeling and the approximations of parameterized surfaces. The key advantages of the new algorithm are: it guarantees a user defined position dependent approximation error; it allows one to generate a hierarchical geometric representation in a canonical way; it automatically preserves sharp edges.",Reinhard Klein;Gunther Liebich;Wolfgang Straßer,R. Klein;G. Liebich;W. Strasser,"Wilhelm-Schickard-Inst. fur Inf., Tubingen Univ., Germany",10.1109/VISUAL.1994.346308,"hierarchical approximation, model simplification, levels-of-detail generation, shape approximation",185,61,13,
VAST,2012,Enterprise Data Analysis and Visualization: An Interview Study,10.1109/TVCG.2012.219,http://dx.doi.org/10.1109/TVCG.2012.219,2917,2926,J,"Organizations rely on data analysts to model customer engagement, streamline operations, improve production, inform business decisions, and combat fraud. Though numerous analysis and visualization tools have been built to improve the scale and efficiency at which analysts can work, there has been little research on how analysis takes place within the social and organizational context of companies. To better understand the enterprise analysts' ecosystem, we conducted semi-structured interviews with 35 data analysts from 25 organizations across a variety of sectors, including healthcare, retail, marketing and finance. Based on our interview data, we characterize the process of industrial data analysis and document how organizational features of an enterprise impact it. We describe recurring pain points, outstanding challenges, and barriers to adoption for visual analytic tools. Finally, we discuss design implications and opportunities for visual analysis research.",Sean Kandel;Andreas Paepcke;Joseph M. Hellerstein;Jeffrey Heer,Sean Kandel;Andreas Paepcke;Joseph M. Hellerstein;Jeffrey Heer,"Stanford University;Stanford University;University of California, Berkeley;Stanford University",10.1109/TVCG.2008.137;10.1109/VAST.2008.4677365;10.1109/VAST.2011.6102438;10.1109/INFVIS.2005.1532136;10.1109/VAST.2010.5652880;10.1109/VAST.2009.5333878;10.1109/VAST.2007.4389011;10.1109/VAST.2011.6102435,"Data, analysis, visualization, enterprise",185,131,37,HM
Vis,1992,Constructing stream surfaces in steady 3D vector fields,10.1109/VISUAL.1992.235211,http://dx.doi.org/10.1109/VISUAL.1992.235211,171,178,C,"Maintenance of a front of particles, an efficient method of generating a set of sample points over a two-dimensional stream surface, is described. The particles are repeatedly advanced a short distance through the flow field. New polygons are appended to the downstream edge of the surface. The spacing of the particles is adjusted to maintain an adequate sampling across the width of the growing surface. Curve and ribbon methods of vector field visualization are reviewed.<<ETX>>",Jeff P. Hultquist,J.P.M. Hultquist,"NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1990.146359;10.1109/VISUAL.1991.175837;10.1109/VISUAL.1990.146373;10.1109/VISUAL.1992.235202;10.1109/VISUAL.1991.175789,,184,97,14,
Vis,1996,Choosing effective colours for data visualization,10.1109/VISUAL.1996.568118,http://dx.doi.org/10.1109/VISUAL.1996.568118,263,270,C,"We describe a technique for choosing multiple colours for use during data visualization. Our goal is a systematic method for maximizing the total number of colours available for use, while still allowing an observer to rapidly and accurately search a display for any one of the given colours. Previous research suggests that we need to consider three separate effects during colour selection: colour distance, linear separation, and colour category. We describe a simple method for measuring and controlling all of these effects. Our method was tested by performing a set of target identification studies; we analysed the ability of thirty eight observers to find a colour target in displays that contained differently coloured background elements. Results showed our method can be used to select a group of colours that will provide good differentiation between data elements during data visualization.",Christopher G. Healey,C.G. Healey,"Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada",10.1109/VISUAL.1995.480803;10.1109/VISUAL.1993.398874,,184,80,22,
Vis,2005,Evolutionary morphing,10.1109/VISUAL.2005.1532826,http://dx.doi.org/10.1109/VISUAL.2005.1532826,431,438,C,"We introduce a technique to visualize the gradual evolutionary change of the shapes of living things as a morph between known three-dimensional shapes. Given geometric computer models of anatomical shapes for some collection of specimens - here the skulls of the some of the extant members of a family of monkeys - an evolutionary tree for the group implies a hypothesis about the way in which the shape changed through time. We use a statistical model which expresses the value of some continuous variable at an internal point in the tree as a weighted average of the values at the leaves. The framework of geometric morphometrics can then be used to define a shape-space, based on the correspondences of landmark points on the surfaces, within which these weighted averages can be realized as actual surfaces. Our software provides tools for performing and visualizing such an analysis in three dimensions. Beginning with laser range scans of crania, we use our landmark editor to interactively place landmark points on the surface. We use these to compute a ""tree-morph"" that smoothly interpolates the shapes across the tree. Each intermediate shape in the morph is a linear combination of all of the input surfaces. We create a surface model for an intermediate shape by warping all the input meshes towards the correct shape and then blending them together. To do the blending, we compute a weighted average of their associated trivariate distance functions and then extract a surface from the resulting function. We implement this idea using the squared distance function, rather than the usual signed distance function, in a novel way.",David F. Wiley;Nina Amenta;Dan A. Alcantara;Deboshmita Ghosh;Yong Joo Kil;Eric Delson;Will Harcourt-Smith;Katherine St. John;F. James Rohlf;Bernd Hamann,D.F. Wiley;N. Amenta;D.A. Alcantara;D. Ghosh;Y.J. Kil;E. Delson;W. Harcourt-Smith;F.J. Rohlf;K. St John;B. Hamann,"Dept. of Comput. Sci., California Univ., Davis, CA, USA;Dept. of Comput. Sci., California Univ., Davis, CA, USA;Dept. of Comput. Sci., California Univ., Davis, CA, USA;Dept. of Comput. Sci., California Univ., Davis, CA, USA;Dept. of Comput. Sci., California Univ., Davis, CA, USA",,"morphometrics, morphing, surface blending, merging, warping, distance fields, extremal surface",182,55,27,
InfoVis,2002,Arc diagrams: visualizing structure in strings,10.1109/INFVIS.2002.1173155,http://dx.doi.org/10.1109/INFVIS.2002.1173155,110,116,C,"This paper introduces a new visualization method, the arc diagram, which is capable of representing complex patterns of repetition in string data. Arc diagrams improve over previous methods such as dotplots because they scale efficiently for strings that contain many instances of the same subsequence. This paper describes design and implementation issues related to arc diagrams and shows how they may be applied to visualize such diverse data as music, text, and compiled code.",Martin Wattenberg,M. Wattenberg,"IBM Res., Cambridge, MA, USA",10.1109/INFVIS.1995.528685;10.1109/VISUAL.1993.398883,"string, sequence, visualization, arc diagram, music, text, code",180,87,11,
InfoVis,2001,Ordered treemap layouts,10.1109/INFVIS.2001.963283,http://dx.doi.org/10.1109/INFVIS.2001.963283,73,78,C,,Ben Shneiderman;Martin Wattenberg,B. Shneiderman;M. Wattenberg,University of Maryland,10.1109/VISUAL.1992.235217;10.1109/VISUAL.1991.175815,"treemaps, ordered treemaps, trees, hierarchies, information visualization ",177,89,11,
InfoVis,1995,IVEE: an Information Visualization and Exploration Environment,10.1109/INFVIS.1995.528688,http://dx.doi.org/10.1109/INFVIS.1995.528688,66,73,C,"The Information Visualization and Exploration Environment (NEE) is a system for automatic creation of dynamic queries applications. IVEE imports database relations and automatically creates environments holding visualizations and query devices. IVEE offers multiple visualizations such as maps and starfields, and multiple query devices, such as sliders, alphasliders, and toggles. Arbitrary graphical objects can be attached to database objects in visualizations. Multiple visualizations may be active simultaneously. Users can interactively lay out and change between types of query devices. Users may retrieve details-on-demand by clicking on visualization objects. An HTML file may be provided along with the database, specifying how details-on-demand information should be presented, allowing for presentation of multimedia information in database objects. Finally, multiple IVEE clients running on separate workstations on a network can communicate by letting one user's actions affect the visualization in an another IVEE client.",Christopher Ahlberg;Erik Wistrand,C. Ahlberg;E. Wistrand,"Dept. of Comput. Sci., Chalmers Univ. of Technol., Goteborg, Sweden;Dept. of Comput. Sci., Chalmers Univ. of Technol., Goteborg, Sweden",10.1109/VISUAL.1991.175815;10.1109/VISUAL.1993.398863,,176,56,28,
VAST,2009,Parallel Tag Clouds to explore and analyze faceted text corpora,10.1109/VAST.2009.5333443,http://dx.doi.org/10.1109/VAST.2009.5333443,91,98,C,"Do court cases differ from place to place? What kind of picture do we get by looking at a country's collection of law cases? We introduce parallel tag clouds: a new way to visualize differences amongst facets of very large metadata-rich text corpora. We have pointed parallel tag clouds at a collection of over 600,000 US Circuit Court decisions spanning a period of 50 years and have discovered regional as well as linguistic differences between courts. The visualization technique combines graphical elements from parallel coordinates and traditional tag clouds to provide rich overviews of a document collection while acting as an entry point for exploration of individual texts. We augment basic parallel tag clouds with a details-in-context display and an option to visualize changes over a second facet of the data, such as time. We also address text mining challenges such as selecting the best words to visualize, and how to do so in reasonable time periods to maintain interactivity.",Christopher Collins 0001;Fernanda B. Viégas;Martin Wattenberg,Christopher Collins;Fernanda B. Viegas;Martin Wattenberg,"University of Toronto, Canada;IBM Research, USA;IBM Research, USA",10.1109/INFVIS.1995.528686;10.1109/TVCG.2007.70589;10.1109/TVCG.2008.175;10.1109/TVCG.2008.172;10.1109/VAST.2007.4389006;10.1109/TVCG.2006.166,"Text visualization, corpus visualization, information retrieval, text mining, tag clouds",176,115,35,TT
InfoVis,1997,Multidimensional detective,10.1109/INFVIS.1997.636793,http://dx.doi.org/10.1109/INFVIS.1997.636793,100,107,C,"The display of multivariate datasets in parallel coordinates, transforms the search for relations among the variables into a 2-D pattern recognition problem. This is the basis for the application to visual data mining. The knowledge discovery process together with some general guidelines are illustrated on a dataset from the production of a VLSI chip. The special strength of parallel coordinates is in modeling relations. As an example, a simplified economic model is constructed with data from various economic sectors of a real country. The visual model shows the interelationship and dependencies between the sectors, circumstances where there is competition for the same resource, and feasible economic policies. Interactively, the model can be used to do trade-off analyses, discover sensitivities, do approximate optimization, monitor (as in a process) and provide decision support.",Alfred Inselberg,A. Inselberg,"Dept. of Comput. Sci., Tel Aviv Univ., Israel",10.1109/VISUAL.1990.146402;10.1109/VISUAL.1994.346302,,174,74,11,
Vis,2001,PixelFlex: a reconfigurable multi-projector display system,10.1109/VISUAL.2001.964508,http://dx.doi.org/10.1109/VISUAL.2001.964508,167,554,C,"This paper presents PixelFlex - a spatially reconfigurable multi-projector display system. The PixelFlex system is composed of ceiling-mounted projectors, each with computer-controlled pan, tilt, zoom and focus; and a camera for closed-loop calibration. Working collectively, these controllable projectors function as a single logical display capable of being easily modified into a variety of spatial formats of differing pixel density, size and shape. New layouts are automatically calibrated within minutes to generate the accurate warping and blending functions needed to produce seamless imagery across planar display surfaces, thus giving the user the flexibility to quickly create, save and restore multiple screen configurations. Overall, PixelFlex provides a new level of automatic reconfigurability and usage, departing from the static, one-size-fits-all design of traditional large-format displays. As a front-projection system, PixelFlex can be installed in most environments with space constraints and requires little or no post-installation mechanical maintenance because of the closed-loop calibration.",Ruigang Yang;David Gotz;Justin Hensley;Herman Towles;Michael S. Brown,Ruigang Yang;D. Gotz;J. Hensley;H. Towles;M.S. Brown,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.2000.885685;10.1109/VISUAL.1999.809890;10.1109/VISUAL.1999.809883;10.1109/VISUAL.2000.885712,"large-format projection display, camera-based registration and calibration",173,43,30,
InfoVis,2002,Angular brushing of extended parallel coordinates,10.1109/INFVIS.2002.1173157,http://dx.doi.org/10.1109/INFVIS.2002.1173157,127,130,C,"In this paper we present angular brushing for parallel coordinates (PC) as a new approach to highlighting rational data-properties, i.e., features which - in a non-separable way - depend on two data dimensions. We also demonstrate smooth brushing as an intuitive tool for specifying nonbinary degree-of-interest functions (for focus+context visualization). We also briefly describe our implementation as well as its application to the visualization of CFD data.",Helwig Hauser;Florian Ledermann;Helmut Doleisch,H. Hauser;F. Ledermann;H. Doleisch,"VRVis Res. Center, Vienna, Austria;VRVis Res. Center, Vienna, Austria;VRVis Res. Center, Vienna, Austria",10.1109/INFVIS.1996.559216;10.1109/VISUAL.2000.885739;10.1109/VISUAL.1994.346302;10.1109/VISUAL.1995.485139;10.1109/VISUAL.1990.146402,"information visualization, parallel coordinates, brushing, linear correlations, focus+context visualization",173,94,11,
Vis,2002,Interactive rendering of large volume data sets,10.1109/VISUAL.2002.1183757,http://dx.doi.org/10.1109/VISUAL.2002.1183757,53,60,C,"We present a new algorithm for rendering very large volume data sets at interactive frame rates on standard PC hardware. The algorithm accepts scalar data sampled on a regular grid as input. The input data is converted into a compressed hierarchical wavelet representation in a preprocessing step. During rendering, the wavelet representation is decompressed on-the-fly and rendered using hardware texture mapping. The level of detail used for rendering is adapted to the local frequency spectrum of the data and its position relative to the viewer. Using a prototype implementation of the algorithm we were able to perform an interactive walkthrough of large data sets such as the visible human on a single off-the-shelf PC.",Stefan Guthe;Michael Wand 0001;Julius Gonser;Wolfgang Straßer,S. Guthe;M. Wand;J. Gonser;W. Strasser,"WSI/GRIS, Tubingen Univ., Germany;WSI/GRIS, Tubingen Univ., Germany;WSI/GRIS, Tubingen Univ., Germany;WSI/GRIS, Tubingen Univ., Germany",10.1109/VISUAL.2001.964531;10.1109/VISUAL.1999.809908;10.1109/VISUAL.1999.809889;10.1109/VISUAL.1993.398845;10.1109/VISUAL.2001.964519,"Compression Algorithms, Level of Detail Algorithms, Scientific Visualization, Volume Rendering, Wavelets",173,77,36,
Vis,1997,Virtualized reality: constructing time-varying virtual worlds from real world events,10.1109/VISUAL.1997.663893,http://dx.doi.org/10.1109/VISUAL.1997.663893,277,283,C,"Virtualized reality is a modeling technique that constructs full 3D virtual representations of dynamic events from multiple video streams. Image-based stereo is used to compute a range image corresponding to each intensity image in each video stream. Each range and intensity image pair encodes the scene structure and appearance of the scene visible to the camera at that moment, and is therefore called a visible surface model (VSM). A single time instant of the dynamic event can be modeled as a collection of VSMs from different viewpoints, and the full event can be modeled as a sequence of static scenes-the 3D equivalent of video. Alternatively, the collection of VSMs at a single time can be fused into a global 3D surface model, thus creating a traditional virtual representation out of real world events. Global modeling has the added benefit of eliminating the need to hand-edit the range images to correct errors made in stereo, a drawback of previous techniques. Like image-based rendering models, these virtual representations can be used to synthesize nearly any view of the virtualized event. For this reason, the paper includes a detailed comparison of existing view synthesis techniques with the authors' own approach. In the virtualized representations, however, scene structure is explicitly represented and therefore easily manipulated, for example by adding virtual objects to (or removing virtualized objects from) the model without interfering with real event. Virtualized reality, then, is a platform not only for image-based rendering but also for 3D scene manipulation.",Peter Rander;P. J. Narayanan;Takeo Kanade,P. Rander;P.J. Narayanan;T. Kanade,"Robotics Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA",,"view synthesis, dynamic scene analysis, modeling from image sequences, computer vision and scene understanding, virtual worlds",172,44,26,
Vis,1999,Progressive Compression of Arbitrary Triangular Meshes,10.1109/VIS.1999.10000,http://doi.ieeecomputersociety.org/10.1109/VIS.1999.10000,67,72,C,,Daniel Cohen-Or;David Levin;Offir Remez,,,10.1109/VISUAL.1996.568125,"compression, streaming, progressive meshes, simplification",172,,,
InfoVis,2007,Scented Widgets: Improving Navigation Cues with Embedded Visualizations,10.1109/TVCG.2007.70589,http://dx.doi.org/10.1109/TVCG.2007.70589,1129,1136,J,"This paper presents scented widgets, graphical user interface controls enhanced with embedded visualizations that facilitate navigation in information spaces. We describe design guidelines for adding visual cues to common user interface widgets such as radio buttons, sliders, and combo boxes and contribute a general software framework for applying scented widgets within applications with minimal modifications to existing source code. We provide a number of example applications and describe a controlled experiment which finds that users exploring unfamiliar data make up to twice as many unique discoveries using widgets imbued with social navigation data. However, these differences equalize as familiarity with the data increases.",Wesley Willett;Jeffrey Heer;Maneesh Agrawala,Wesley Willett;Jeffrey Heer;Maneesh Agrawala,Computer Science Division at the University of California at Berkeley;Computer Science Division at the University of California at Berkeley;Computer Science Division at the University of California at Berkeley,10.1109/INFVIS.1999.801862,"Information visualization, user interface toolkits, information foraging, social navigation, social data analysis",172,118,22,
Vis,2002,Bounded-distortion piecewise mesh parameterization,10.1109/VISUAL.2002.1183795,http://dx.doi.org/10.1109/VISUAL.2002.1183795,355,362,C,"Many computer graphics operations, such as texture mapping, 3D painting, remeshing, mesh compression, and digital geometry processing, require finding a low-distortion parameterization for irregular connectivity triangulations of arbitrary genus 2-manifolds. This paper presents a simple and fast method for computing parameterizations with strictly bounded distortion. The new method operates by flattening the mesh onto a region of the 2D plane. To comply with the distortion bound, the mesh is automatically cut and partitioned on-the-fly. The method guarantees avoiding global and local self-intersections, while attempting to minimize the total length of the introduced seams. To our knowledge, this is the first method to compute the mesh partitioning and the parameterization simultaneously and entirely automatically, while providing guaranteed distortion bounds. Our results on a variety of objects demonstrate that the method is fast enough to work with large complex irregular meshes in interactive applications.",Olga Sorkine-Hornung;Daniel Cohen-Or;Rony Goldenthal;Dani Lischinski,O. Sorkine;D. Cohen-Or;R. Goldenthal;D. Lischinski,"Sch. of Comput. Sci., Tel Aviv Univ., Israel;Sch. of Comput. Sci., Tel Aviv Univ., Israel",,"atlas, mesh partitioning, parameterization, surface flattening, texture mapping, 3D painting",170,56,26,
InfoVis,2013,What Makes a Visualization Memorable?,10.1109/TVCG.2013.234,http://dx.doi.org/10.1109/TVCG.2013.234,2306,2315,J,"An ongoing debate in the Visualization community concerns the role that visualization types play in data understanding. In human cognition, understanding and memorability are intertwined. As a first step towards being able to ask questions about impact and effectiveness, here we ask: 'What makes a visualization memorable?' We ran the largest scale visualization study to date using 2,070 single-panel visualizations, categorized with visualization type (e.g., bar chart, line graph, etc.), collected from news media sites, government reports, scientific journals, and infographic sources. Each visualization was annotated with additional attributes, including ratings for data-ink ratios and visual densities. Using Amazon's Mechanical Turk, we collected memorability scores for hundreds of these visualizations, and discovered that observers are consistent in which visualizations they find memorable and forgettable. We find intuitive results (e.g., attributes like color and the inclusion of a human recognizable object enhance memorability) and less intuitive results (e.g., common graphs are less memorable than unique visualization types). Altogether our findings suggest that quantifying memorability is a general metric of the utility of information, an essential step towards determining how to design effective visualizations.",Michelle Borkin;Azalea A. Vo;Zoya Bylinskii;Phillip Isola;Shashank Sunkavalli;Aude Oliva;Hanspeter Pfister,Michelle A. Borkin;Azalea A. Vo;Zoya Bylinskii;Phillip Isola;Shashank Sunkavalli;Aude Oliva;Hanspeter Pfister,Harvard University;Harvard University;Massachusetts Institute of Technology;Massachusetts Institute of Technology;Harvard University;Massachusetts Institute of Technology;Harvard University,10.1109/TVCG.2012.221;10.1109/INFVIS.2004.59;10.1109/TVCG.2012.197;10.1109/TVCG.2012.245;10.1109/TVCG.2011.175,"Visualization taxonomy, information visualization, memorability",170,171,39,
Vis,2002,CPR - curved planar reformation,10.1109/VISUAL.2002.1183754,http://dx.doi.org/10.1109/VISUAL.2002.1183754,37,44,C,"Visualization of tubular structures such as blood vessels is an important topic in medical imaging. One way to display tubular structures for diagnostic purposes is to generate longitudinal cross-sections in order to show their lumen, wall, and surrounding tissue in a curved plane. This process is called curved planar reformation (CPR). We present three different methods to generate CPR images. A tube-phantom was scanned with computed tomography (CT) to illustrate the properties of the different CPR methods. Furthermore we introduce enhancements to these methods: thick-CPR, rotating-CPR and multi-path-CPR.",Armin Kanitsar;Dominik Fleischmann;Rainer Wegenkittl;Petr Felkel;M. Eduard Gröller,A. Kanitsar;D. Fleischmann;R. Wegenkittl;P. Felkel;E. Groller,"Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria",10.1109/VISUAL.2001.964555;10.1109/VISUAL.2001.964538,"computed tomography angiography, vessel analysis, curved planar reformation",168,63,14,
InfoVis,2003,Multiscale Visualization of Small World Networks,10.1109/INFVIS.2003.1249011,http://doi.ieeecomputersociety.org/10.1109/INFVIS.2003.1249011,75,84,C,"Many networks under study in information visualization are ""small world"" networks. These networks first appeared in the study of social networks and were shown to be relevant models in other application domains such as software reverse engineering and biology. Furthermore, many of these networks actually have a multiscale nature: they can be viewed as a network of groups that are themselves small world networks. We describe a metric that has been designed in order to identify the weakest edges in a small world network leading to an easy and low cost filtering procedure that breaks up a graph into smaller and highly connected components. We show how this metric can be exploited through an interactive navigation of the network based on semantic zooming. Once the network is decomposed into a hierarchy of sub-networks, a user can easily find groups and subgroups of actors and understand their dynamics.",David Auber;Yves Chiricota;Fabien Jourdan;Guy Melançon,D. Auber;Y. Chiricota;F. Jourdan;G. Melancon,"LaBRI, Bordeaux, France",,"Small world networks, multiscale graphs,clustering metric, semantic zooming",166,54,18,
InfoVis,2006,Balancing Systematic and Flexible Exploration of Social Networks,10.1109/TVCG.2006.122,http://dx.doi.org/10.1109/TVCG.2006.122,693,700,J,"Social network analysis (SNA) has emerged as a powerful method for understanding the importance of relationships in networks. However, interactive exploration of networks is currently challenging because: (1) it is difficult to find patterns and comprehend the structure of networks with many nodes and links, and (2) current systems are often a medley of statistical methods and overwhelming visual output which leaves many analysts uncertain about how to explore in an orderly manner. This results in exploration that is largely opportunistic. Our contributions are techniques to help structural analysts understand social networks more effectively. We present SocialAction, a system that uses attribute ranking and coordinated views to help users systematically examine numerous SNA measures. Users can (1) flexibly iterate through visualizations of measures to gain an overview, filter nodes, and find outliers, (2) aggregate networks using link structure, find cohesive subgroups, and focus on communities of interest, and (3) untangle networks by viewing different link types separately, or find patterns across different link types using a matrix overview. For each operation, a stable node layout is maintained in the network visualization so users can make comparisons. SocialAction offers analysts a strategy beyond opportunism, as it provides systematic, yet flexible, techniques for exploring social networks",Adam Perer;Ben Shneiderman,Adam Perer;Ben Shneiderman,"Department of Computer Science, University of Maryland, College Park, MD 20742;Department of Computer Science, University of Maryland, College Park, MD 20742",10.1109/INFVIS.2003.1249011;10.1109/INFVIS.2004.43;10.1109/INFVIS.2004.1;10.1109/VAST.2006.261426;10.1109/INFVIS.1997.636718;10.1109/INFVIS.2004.66;10.1109/INFVIS.2005.1532126,"Social networks, interactive graph visualization, attribute ranking, coordinated views, exploratory data analysis",166,115,34,
Vis,2006,Importance-Driven Focus of Attention,10.1109/TVCG.2006.152,http://dx.doi.org/10.1109/TVCG.2006.152,933,940,J,"This paper introduces a concept for automatic focusing on features within a volumetric data set. The user selects a focus, i.e., object of interest, from a set of pre-defined features. Our system automatically determines the most expressive view on this feature. A characteristic viewpoint is estimated by a novel information-theoretic framework which is based on the mutual information measure. Viewpoints change smoothly by switching the focus from one feature to another one. This mechanism is controlled by changes in the importance distribution among features in the volume. The highest importance is assigned to the feature in focus. Apart from viewpoint selection, the focusing mechanism also steers visual emphasis by assigning a visually more prominent representation. To allow a clear view on features that are normally occluded by other parts of the volume, the focusing for example incorporates cut-away views",Ivan Viola;Miquel Feixas;Mateu Sbert;M. Eduard Gröller,Ivan Viola;Miquel Feixas;Mateu Sbert;Meister Eduard Groller,"Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria;Institute of Informatics and Applications, University of Girona, Spain;Institute of Informatics and Applications, University of Girona, Spain;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria",10.1109/VISUAL.2005.1532856;10.1109/VISUAL.2005.1532834;10.1109/INFVIS.2001.963286;10.1109/VISUAL.2005.1532833,"Illustrative visualization, volume visualization, interacting with volumetric datasets, characteristic viewpoint estimation, focus+context techniques",166,105,15,
InfoVis,2007,Interactive Visual Exploration of a Large Spatio-temporal Dataset: Reflections on a Geovisualization Mashup.,10.1109/TVCG.2007.70570,http://dx.doi.org/10.1109/TVCG.2007.70570,1176,1183,J,"Exploratory visual analysis is useful for the preliminary investigation of large structured, multifaceted spatio-temporal datasets. This process requires the selection and aggregation of records by time, space and attribute, the ability to transform data and the flexibility to apply appropriate visual encodings and interactions. We propose an approach inspired by geographical 'mashups' in which freely-available functionality and data are loosely but flexibly combined using de facto exchange standards. Our case study combines MySQL, PHP and the LandSerf GIS to allow Google Earth to be used for visual synthesis and interaction with encodings described in KML. This approach is applied to the exploration of a log of 1.42 million requests made of a mobile directory service. Novel combinations of interaction and visual encoding are developed including spatial 'tag clouds', 'tag maps', 'data dials' and multi-scale density surfaces. Four aspects of the approach are informally evaluated: the visual encodings employed, their success in the visual exploration of the dataset, the specific tools used and the 'mashup' approach. Preliminary findings will be beneficial to others considering using mashups for visualization. The specific techniques developed may be more widely applied to offer insights into the structure of multifarious spatio-temporal data of the type explored here.",Jo Wood;Jason Dykes;Aidan Slingsby;Keith C. Clarke,Jo Wood;Jason Dykes;Aidan Slingsby;Keith Clarke,"giCentre, Department of Information Science, City University, London;giCentre, Department of Information Science, City University, London;giCentre, Department of Information Science, City University, London;Department of Geography, UC Santa Barbara",10.1109/INFVIS.1995.528686;10.1109/INFVIS.2004.12,"Large dataset visualization, text and document visualization, multiresolution visualization, geographic visualization, applications of infovis",166,117,40,
InfoVis,2005,Graph-theoretic scagnostics,10.1109/INFVIS.2005.1532142,http://dx.doi.org/10.1109/INFVIS.2005.1532142,157,164,C,We introduce Tukey and Tukey scagnostics and develop graph-theoretic methods for implementing their procedure on large datasets.,Leland Wilkinson;Anushka Anand;Robert L. Grossman,L. Wilkinson;A. Anand;R. Grossman,"SPSS Inc., Chicago, IL, USA",10.1109/INFVIS.2003.1249006;10.1109/INFVIS.2004.3;10.1109/INFVIS.2004.15,"visualization, statistical graphics",165,69,43,
Vis,1995,A rule-based tool for assisting colormap selection,10.1109/VISUAL.1995.480803,http://dx.doi.org/10.1109/VISUAL.1995.480803,118,"125, 444",C,"The paper presents an interactive approach for guiding the user's select of colormaps in visualization. PRAVDAColor, implemented as a module in the IBM Visualization Data Explorer, provides the user a selection of appropriate colormaps given the data type and spatial frequency, the user's task, and properties of the human perceptual system.",Lawrence D. Bergman;Bernice E. Rogowitz;Lloyd Treinish,L.D. Bergman;B.E. Rogowitz;L.A. Treinish,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.1995.480821;10.1109/VISUAL.1993.398874,,163,83,24,
Vis,2005,VolumeShop: an interactive system for direct volume illustration,10.1109/VISUAL.2005.1532856,http://dx.doi.org/10.1109/VISUAL.2005.1532856,671,678,C,"Illustrations play a major role in the education process. Whether used to teach a surgical or radiologic procedure, to illustrate normal or aberrant anatomy, or to explain the functioning of a technical device, illustration significantly impacts learning. Although many specimens are readily available as volumetric data sets, particularly in medicine, illustrations are commonly produced manually as static images in a time-consuming process. Our goal is to create a fully dynamic three-dimensional illustration environment which directly operates on volume data. Single images have the aesthetic appeal of traditional illustrations, but can be interactively altered and explored. In this paper we present methods to realize such a system which combines artistic visual styles and expressive visualization techniques. We introduce a novel concept for direct multi-object volume visualization which allows control of the appearance of inter-penetrating objects via two-dimensional transfer functions. Furthermore, a unifying approach to efficiently integrate many non-photorealistic rendering models is presented. We discuss several illustrative concepts which can be realized by combining cutaways, ghosting, and selective deformation. Finally, we also propose a simple interface to specify objects of interest through three-dimensional volumetric painting. All presented methods are integrated into VolumeShop, an interactive hardware-accelerated application for direct volume illustration.",Stefan Bruckner;M. Eduard Gröller,S. Bruckner;M.E. Groller,"Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria;Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria",10.1109/VISUAL.2000.885694;10.1109/VISUAL.2002.1183777;10.1109/VISUAL.2004.62;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2004.48;10.1109/VISUAL.2004.64,"illustrative visualization, volume rendering, focus+context techniques",163,49,27,
InfoVis,2004,Rethinking Visualization: A High-Level Taxonomy,10.1109/INFVIS.2004.59,http://dx.doi.org/10.1109/INFVIS.2004.59,151,158,C,"We present the novel high-level visualization taxonomy. Our taxonomy classifies visualization algorithms rather than data. Algorithms are categorized based on the assumptions they make about the data being visualized; we call this set of assumptions the design model. Because our taxonomy is based on design models, it is more flexible than existing taxonomies and considers the user's conceptual model, emphasizing the human aspect of visualization. Design models are classified according to whether they are discrete or continuous and by how much the algorithm designer chooses display attributes such as spatialization, timing, colour, and transparency. This novel approach provides an alternative view of the visualization field that helps explain how traditional divisions (e.g., information and scientific visualization) relates and overlap, and that may inspire research ideas in hybrid visualization areas",Melanie Tory;Torsten Möller,M. Tory;T. Moller,Simon Fraser University,10.1109/VISUAL.1990.146375;10.1109/INFVIS.2000.885092;10.1109/INFVIS.1997.636792;10.1109/INFVIS.1999.801856,"visualization, taxonomy, classification, design model, user model, conceptual model",162,88,22,
InfoVis,1998,An operator interaction framework for visualization systems,10.1109/INFVIS.1998.729560,http://dx.doi.org/10.1109/INFVIS.1998.729560,63,70,C,"Information visualization encounters a wide variety of different data domains. The visualization community has developed representation methods and interactive techniques. As a community, we have realized that the requirements in each domain are often dramatically different. In order to easily apply existing methods, researchers have developed a semiology of graphic representations. We have extended this research into a framework that includes operators and interactions in visualization systems, such as a visualization spreadsheet. We discuss properties of this framework and use it to characterize operations spanning a variety of different visualization techniques. The framework developed in the paper enables a new way of exploring and evaluating the design space of visualization operators, and helps end users in their analysis tasks.",Ed H. Chi;John Riedl,Ed Huai-Hsin Chi;J.T. Riedl,"Dept. of Comput. Sci. & Eng., Minnesota Univ., MN, USA",10.1109/VISUAL.1996.567796;10.1109/INFVIS.1996.559213;10.1109/INFVIS.1995.528686;10.1109/INFVIS.1997.636793;10.1109/INFVIS.1997.636792;10.1109/VISUAL.1991.175815;10.1109/VISUAL.1995.480801;10.1109/INFVIS.1997.636761,"information visualization, operators, user interactions, view/value, framework, spreadsheet, design, extensibility, visualization systems",161,29,36,TT
InfoVis,1999,Does animation help users build mental maps of spatial information?,10.1109/INFVIS.1999.801854,http://dx.doi.org/10.1109/INFVIS.1999.801854,28,35,C,"We examine how animating a viewpoint change in a spatial information system affects a user's ability to build a mental map of the information in the space. We found that animation improves users' ability to reconstruct the information space, with no penalty on task performance time. We believe that this study provides strong evidence for adding animated transitions in many applications with fixed spatial data where the user navigates around the data space.",Benjamin B. Bederson;Angela Boltman,B.B. Bederson;A. Boltman,"Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA",,"Evaluation, animation, real-time computer graphics, Zoomable User Interfaces (ZUIs), multiscale interfaces, Pad++",161,45,25,
InfoVis,1997,Nonlinear magnification fields,10.1109/INFVIS.1997.636786,http://dx.doi.org/10.1109/INFVIS.1997.636786,51,58,C,"We introduce nonlinear magnification fields as an abstract representation of nonlinear magnification, providing methods for converting transformation routines to magnification fields and vice-versa. This new representation provides ease of manipulation and power of expression. By removing the restrictions of explicit foci and allowing precise specification of magnification values, we can achieve magnification effects which were not previously possible. Of particular interest are techniques we introduce for expressing complex and subtle magnification effects through magnification brushing, and allowing intrinsic properties of the data being visualized to create data-driven magnifications.",Alan Keahey;Edward L. Robertson,T.A. Keahey;E.L. Robertson,"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA",10.1109/INFVIS.1996.559214,"information visualization, nonlinear magnification, data-driven magnification, fisheye views, magnification brushing, data-mining",160,25,20,
Vis,2004,Importance-driven volume rendering,10.1109/VISUAL.2004.48,http://dx.doi.org/10.1109/VISUAL.2004.48,139,145,C,"This work introduces importance-driven volume rendering as a novel technique for automatic focus and context display of volumetric data. Our technique is a generalization of cut-away views, which - depending on the viewpoint - remove or suppress less important parts of a scene to reveal more important underlying information. We automatize and apply this idea to volumetric data. Each part of the volumetric data is assigned an object importance, which encodes visibility priority. This property determines which structures should be readily discernible and which structures are less important. In those image regions, where an object occludes more important structures it is displayed more sparsely than in those areas where no occlusion occurs. Thus the objects of interest are clearly visible. For each object several representations, i.e., levels of sparseness, are specified. The display of an individual object may incorporate different levels of sparseness. The goal is to emphasize important structures and to maximize the information content in the final image. This work also discusses several possible schemes for level of sparseness specification and different ways how object importance can be composited to determine the final appearance of a particular object.",Ivan Viola;Armin Kanitsar;M. Eduard Gröller,I. Viola;A. Kanitsar;M.E. Groller,"Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria;Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria;Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria",10.1109/VISUAL.2003.1250406;10.1109/INFVIS.1996.559215;10.1109/VISUAL.1996.568110;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2001.964519;10.1109/VISUAL.2000.885697;10.1109/VISUAL.2000.885696,"view-dependent visualization, volume rendering, focus+context techniques, level-of-detail techniques, non-photorealistic techniques",160,57,29,
InfoVis,2010,A Visual Backchannel for Large-Scale Events,10.1109/TVCG.2010.129,http://dx.doi.org/10.1109/TVCG.2010.129,1129,1138,J,"We introduce the concept of a Visual Backchannel as a novel way of following and exploring online conversations about large-scale events. Microblogging communities, such as Twitter, are increasingly used as digital backchannels for timely exchange of brief comments and impressions during political speeches, sport competitions, natural disasters, and other large events. Currently, shared updates are typically displayed in the form of a simple list, making it difficult to get an overview of the fast-paced discussions as it happens in the moment and how it evolves over time. In contrast, our Visual Backchannel design provides an evolving, interactive, and multi-faceted visual overview of large-scale ongoing conversations on Twitter. To visualize a continuously updating information stream, we include visual saliency for what is happening now and what has just happened, set in the context of the evolving conversation. As part of a fully web-based coordinated-view system we introduce Topic Streams, a temporally adjustable stacked graph visualizing topics over time, a People Spiral representing participants and their activity, and an Image Cloud encoding the popularity of event photos by size. Together with a post listing, these mutually linked views support cross-filtering along topics, participants, and time ranges. We discuss our design considerations, in particular with respect to evolving visualizations of dynamically changing data. Initial feedback indicates significant interest and suggests several unanticipated uses.",Marian Dörk;Dan Gruen;Carey L. Williamson;Sheelagh Carpendale,Marian Dörk;Daniel Gruen;Carey Williamson;Sheelagh Carpendale,,10.1109/VAST.2009.5333443;10.1109/TVCG.2007.70541;10.1109/TVCG.2008.166;10.1109/TVCG.2008.175;10.1109/INFVIS.2005.1532133;10.1109/INFVIS.2003.1249028;10.1109/VAST.2008.4677364;10.1109/VAST.2009.5333437,"Backchannel, information visualization, events, multiple views, microblogging, information retrieval, World Wide Web",160,108,43,
Vis,1996,A linear iteration time layout algorithm for visualising high-dimensional data,10.1109/VISUAL.1996.567787,http://dx.doi.org/10.1109/VISUAL.1996.567787,127,131,C,"A technique is presented for the layout of high dimensional data in a low dimensional space. This technique builds upon the force based methods that have been used previously to make visualisations of various types of data such as bibliographies and sets of software modules. The canonical force based model, related to solutions of the N body problem, has a computational complexity of O(N/sup 2/) per iteration. The paper presents a stochastically based algorithm of linear complexity per iteration which produces good layouts, has low overhead, and is easy to implement. Its performance and accuracy are discussed, in particular with regard to the data to which it is applied. Experience with application to bibliographic and time series data, which may have a dimensionality in the tens of thousands, is described.",Matthew Chalmers,M. Chalmers,"Union Bank of Switzerland, Switzerland",10.1109/INFVIS.1995.528686;10.1109/VISUAL.1995.480814,"layout algorithms, visualization, high-dimensional data, spring models, stochastic algorithms, force-directed placement",159,79,20,
InfoVis,2004,Building Highly-Coordinated Visualizations in Improvise,10.1109/INFVIS.2004.12,http://dx.doi.org/10.1109/INFVIS.2004.12,159,166,C,"Improvise is a fully-implemented system in which users build and browse multiview visualizations interactively using a simple shared-object coordination mechanism coupled with a flexible, expression-based visual abstraction language. By coupling visual abstraction with coordination, users gain precise control over how navigation and selection in the visualization affects the appearance of data in individual views. As a result, it is practical to build visualizations with more views and richer coordination in Improvise than in other visualization systems. Building and browsing activities are integrated in a single, live user interface that lets users alter visualizations quickly and incrementally during data exploration",Chris Weaver,C. Weaver,University of Wisconsin-Madison,10.1109/INFVIS.2002.1173141;10.1109/INFVIS.2000.885086,"coordinated queries, coordination, exploratory visualization, multiple views, visual abstraction language",159,94,23,
Vis,1995,Virtual GIS: a real-time 3D geographic information system,10.1109/VISUAL.1995.480800,http://dx.doi.org/10.1109/VISUAL.1995.480800,94,"100, 443",C,"Advances in computer graphics hardware and algorithms, visualization, and interactive techniques for analysis offer the components for a highly integrated, efficient real-time 3D Geographic Information System. We have developed ""Virtual GIS"", a system with truly immersive capability for navigating and understanding complex and dynamic terrain-based databases. The system provides the means for visualizing terrain models consisting of elevation and imagery data, along with GIS raster layers, protruding features, buildings, vehicles, and other objects. We have implemented window-based and virtual reality versions and in both cases provide a direct manipulation, visual interface for accessing the GIS data. Unique terrain data structures and algorithms allow rendering of large, high resolution datasets at interactive rates.",David Koller;Peter Lindstrom;William Ribarsky;Larry F. Hodges;Nickolas Faust;Gregory A. Turner,D. Koller;P. Lindstrom;W. Ribarsky;L.F. Hodges;N. Faust;G. Turner,"Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA",,,157,35,19,
Vis,2002,Scalable alignment of large-format multi-projector displays using camera homography trees,10.1109/VISUAL.2002.1183793,http://dx.doi.org/10.1109/VISUAL.2002.1183793,339,346,C,"This paper presents a vision-based geometric alignment system for aligning the projectors in an arbitrarily large display wall. Existing algorithms typically rely on a single camera view and degrade in accuracy as the display resolution exceeds the camera resolution by several orders of magnitude. Naive approaches to integrating multiple zoomed camera views fail since small errors in aligning adjacent views propagate quickly over the display surface to create glaring discontinuities. Our algorithm builds and refines a camera homography tree to automatically register any number of uncalibrated camera images; the resulting system is both faster and significantly more accurate than competing approaches, reliably achieving alignment errors of 0.55 pixels on a 24-projector display in under 9 minutes. Detailed experiments compare our system to two recent display wall alignment algorithms, both on our 18 Megapixel display wall and in simulation. These results indicate that our approach achieves sub-pixel accuracy even on displays with hundreds of projectors.",Han Chen;Rahul Sukthankar;Grant Wallace;Kai Li 0001,Han Chen;R. Sukthankar;G. Wallace;Kai Li,"Comput. Sci., Princeton Univ., NJ, USA",10.1109/VISUAL.1999.809883;10.1109/VISUAL.2001.964508;10.1109/VISUAL.2000.885685,"large-format tiled projection display, display wall, camera-projector systems, camera-based registration and calibration, automatic alignment, scalability, simulation, evaluation",157,80,13,
VAST,2010,Diamonds in the rough: Social media visual analytics for journalistic inquiry,10.1109/VAST.2010.5652922,http://dx.doi.org/10.1109/VAST.2010.5652922,115,122,C,"Journalists increasingly turn to social media sources such as Facebook or Twitter to support their coverage of various news events. For large-scale events such as televised debates and speeches, the amount of content on social media can easily become overwhelming, yet still contain information that may aid and augment reporting via individual content items as well as via aggregate information from the crowd's response. In this work we present a visual analytic tool, Vox Civitas, designed to help journalists and media professionals extract news value from large-scale aggregations of social media content around broadcast events. We discuss the design of the tool, present the text analysis techniques used to enable the presentation, and provide details on the visual and interaction design. We provide an exploratory evaluation based on a user study in which journalists interacted with the system to explore and report on a dataset of over one hundred thousand twitter messages collected during the U.S. State of the Union presidential address in 2010.",Nicholas Diakopoulos;Mor Naaman;Funda Kivran-Swaine,Nicholas Diakopoulos;Mor Naaman;Funda Kivran-Swaine,"Rutgers University, School of Communication and Information;Rutgers University, School of Communication and Information;Rutgers University, School of Communication and Information",10.1109/VAST.2009.5333437;10.1109/VAST.2009.5333443;10.1109/VAST.2009.5333878;10.1109/VAST.2008.4677364,"Computational Journalism, Computer Assisted Reporting, Social Media, Sensemaking",157,95,27,
Vis,2010,Noodles: A Tool for Visualization of Numerical Weather Model Ensemble Uncertainty,10.1109/TVCG.2010.181,http://dx.doi.org/10.1109/TVCG.2010.181,1421,1430,J,"Numerical weather prediction ensembles are routinely used for operational weather forecasting. The members of these ensembles are individual simulations with either slightly perturbed initial conditions or different model parameterizations, or occasionally both. Multi-member ensemble output is usually large, multivariate, and challenging to interpret interactively. Forecast meteorologists are interested in understanding the uncertainties associated with numerical weather prediction; specifically variability between the ensemble members. Currently, visualization of ensemble members is mostly accomplished through spaghetti plots of a single midtroposphere pressure surface height contour. In order to explore new uncertainty visualization methods, the Weather Research and Forecasting (WRF) model was used to create a 48-hour, 18 member parameterization ensemble of the 13 March 1993 ""Superstorm"". A tool was designed to interactively explore the ensemble uncertainty of three important weather variables: water-vapor mixing ratio, perturbation potential temperature, and perturbation pressure. Uncertainty was quantified using individual ensemble member standard deviation, inter-quartile range, and the width of the 95% confidence interval. Bootstrapping was employed to overcome the dependence on normality in the uncertainty metrics. A coordinated view of ribbon and glyph-based uncertainty visualization, spaghetti plots, iso-pressure colormaps, and data transect plots was provided to two meteorologists for expert evaluation. They found it useful in assessing uncertainty in the data, especially in finding outliers in the ensemble run and therefore avoiding the WRF parameterizations that lead to these outliers. Additionally, the meteorologists could identify spatial regions where the uncertainty was significantly high, allowing for identification of poorly simulated storm environments and physical interpretation of these model issues.",Jibonananda Sanyal;Song Zhang 0004;Jamie L. Dyer;Andrew Mercer 0001;Philip Amburn;Robert J. Moorhead II,Jibonananda Sanyal;Song Zhang;Jamie Dyer;Andrew Mercer;Philip Amburn;Robert Moorhead,Mississippi State University;Mississippi State University;Mississippi State University;Mississippi State University;Mississippi State University;Mississippi State University,10.1109/TVCG.2009.114;10.1109/INFVIS.2002.1173145,"Uncertainty visualization, weather ensemble, geographic/geospatial visualization, glyph-based techniques, time-varying data, qualitative evaluation",157,135,58,
Vis,1996,Interactive visualization of 3D-vector fields using illuminated stream lines,10.1109/VISUAL.1996.567777,http://dx.doi.org/10.1109/VISUAL.1996.567777,107,113,C,"A new technique for interactive vector field visualization using large numbers of properly illuminated stream lines is presented. Taking into account ambient, diffuse, and specular reflection terms as well as transparency, we employ a realistic shading model which significantly increases quality and realism of the resulting images. While many graphics workstations offer hardware support for illuminating surface primitives, usually no means for an accurate shading of line primitives are provided. However, we show that proper illumination of lines can be implemented by exploiting the texture mapping capabilities of modern graphics hardware. In this way high rendering performance with interactive frame rates can be achieved. We apply the technique to render large numbers of integral curves in a vector field. The impression of the resulting images can be further improved by making the curves partially transparent. We also describe methods for controlling the distribution of stream lines in space. These methods enable us to use illuminated stream lines within an interactive visualization environment.",Malte Zöckler;Detlev Stalling;Hans-Christian Hege,M. Zockler;D. Stalling;H.-C. Hege,"Konrad-Zuse-Zentrum fur Informationstech., Berlin, Germany",10.1109/VISUAL.1993.398850;10.1109/VISUAL.1993.398849;10.1109/VISUAL.1994.346312;10.1109/VISUAL.1992.235226;10.1109/VISUAL.1995.485141;10.1109/VISUAL.1992.235227;10.1109/VISUAL.1994.346313;10.1109/VISUAL.1995.480817;10.1109/VISUAL.1993.398877,,156,65,15,BP
VAST,2013,Visual Traffic Jam Analysis Based on Trajectory Data,10.1109/TVCG.2013.228,http://dx.doi.org/10.1109/TVCG.2013.228,2159,2168,J,"In this work, we present an interactive system for visual analysis of urban traffic congestion based on GPS trajectories. For these trajectories we develop strategies to extract and derive traffic jam information. After cleaning the trajectories, they are matched to a road network. Subsequently, traffic speed on each road segment is computed and traffic jam events are automatically detected. Spatially and temporally related events are concatenated in, so-called, traffic jam propagation graphs. These graphs form a high-level description of a traffic jam and its propagation in time and space. Our system provides multiple views for visually exploring and analyzing the traffic condition of a large city as a whole, on the level of propagation graphs, and on road segment level. Case studies with 24 days of taxi GPS trajectories collected in Beijing demonstrate the effectiveness of our system.",Zuchao Wang;Min Lu;Xiaoru Yuan;Junping Zhang;Huub van de Wetering,Zuchao Wang;Min Lu;Xiaoru Yuan;Junping Zhang;Huub van de Wetering,"Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University;Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University, and Center for Computational Science and Engineering, Peking University;Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University, and Center for Computational Science and Engineering, Peking University;Shanghai Key Laboratory of Intelligent Information Processing, and School of Computer Science, Fudan University;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven",10.1109/VISUAL.1997.663866;10.1109/VAST.2011.6102454;10.1109/TVCG.2009.145;10.1109/VAST.2012.6400556;10.1109/INFVIS.2004.27;10.1109/VAST.2008.4677356;10.1109/TVCG.2011.202;10.1109/VAST.2012.6400553;10.1109/TVCG.2012.265;10.1109/TVCG.2011.181;10.1109/VAST.2009.5332593;10.1109/TVCG.2008.125;10.1109/VAST.2011.6102455,"Traffic visualization, traffic jam propagation",154,169,54,
InfoVis,2006,Software Design Patterns for Information Visualization,10.1109/TVCG.2006.178,http://dx.doi.org/10.1109/TVCG.2006.178,853,860,J,"Despite a diversity of software architectures supporting information visualization, it is often difficult to identify, evaluate, and re-apply the design solutions implemented within such frameworks. One popular and effective approach for addressing such difficulties is to capture successful solutions in design patterns, abstract descriptions of interacting software components that can be customized to solve design problems within a particular context. Based upon a review of existing frameworks and our own experiences building visualization software, we present a series of design patterns for the domain of information visualization. We discuss the structure, context of use, and interrelations of patterns spanning data representation, graphics, and interaction. By representing design knowledge in a reusable form, these patterns can be used to facilitate software design, implementation, and evaluation, and improve developer education and communication",Jeffrey Heer;Maneesh Agrawala,Jeffrey Heer;Maneesh Agrawala,"Computer Science Division of the University of California, Berkeley;Computer Science Division of the University of California, Berkeley",10.1109/INFVIS.1998.729560;10.1109/INFVIS.2002.1173141;10.1109/INFVIS.2003.1249007;10.1109/INFVIS.2000.885086;10.1109/INFVIS.2004.12;10.1109/INFVIS.2004.64,"Design patterns, information visualization, software engineering, object-oriented programming",153,89,23,
InfoVis,2009,"""Search, Show Context, Expand on Demand"": Supporting Large Graph Exploration with Degree-of-Interest",10.1109/TVCG.2009.108,http://dx.doi.org/10.1109/TVCG.2009.108,953,960,J,"A common goal in graph visualization research is the design of novel techniques for displaying an overview of an entire graph. However, there are many situations where such an overview is not relevant or practical for users, as analyzing the global structure may not be related to the main task of the users that have semi-specific information needs. Furthermore, users accessing large graph databases through an online connection or users running on less powerful (mobile) hardware simply do not have the resources needed to compute these overviews. In this paper, we advocate an interaction model that allows users to remotely browse the immediate context graph around a specific node of interest. We show how Furnas' original degree of interest function can be adapted from trees to graphs and how we can use this metric to extract useful contextual subgraphs, control the complexity of the generated visualization and direct users to interesting datapoints in the context. We demonstrate the effectiveness of our approach with an exploration of a dense online database containing over 3 million legal citations.",Frank van Ham;Adam Perer,Frank van Ham;Adam Perer,"IBM-ILOG Research in Gentilly, France;IBM Research in Haifa, Israel",10.1109/TVCG.2006.122;10.1109/INFVIS.2004.66;10.1109/INFVIS.2004.43;10.1109/TVCG.2006.166;10.1109/TVCG.2006.147,"Graph visualization, network visualization, degree of interest, legal citation networks, focus+context",153,106,24,
Vis,2006,Outlier-Preserving Focus+Context Visualization in Parallel Coordinates,10.1109/TVCG.2006.170,http://dx.doi.org/10.1109/TVCG.2006.170,893,900,J,"Focus+context visualization integrates a visually accentuated representation of selected data items in focus (more details, more opacity, etc.) with a visually deemphasized representation of the rest of the data, i.e., the context. The role of context visualization is to provide an overview of the data for improved user orientation and improved navigation. A good overview comprises the representation of both outliers and trends. Up to now, however, context visualization not really treated outliers sufficiently. In this paper we present a new approach to focus+context visualization in parallel coordinates which is truthful to outliers in the sense that small-scale features are detected before visualization and then treated specially during context visualization. Generally, we present a solution which enables context visualization at several levels of abstraction, both for the representation of outliers and trends. We introduce outlier detection and context generation to parallel coordinates on the basis of a binned data representation. This leads to an output-oriented visualization approach which means that only those parts of the visualization process are executed which actually affect the final rendering. Accordingly, the performance of this solution is much more dependent on the visualization size than on the data size which makes it especially interesting for large datasets. Previous approaches are outperformed, the new solution was successfully applied to datasets with up to 3 million data records and up to 50 dimensions",Matej Novotny;Helwig Hauser,Matej Novotny;Helwig Hauser,"Comenius University, Bratislava;VRVis Research Center, Vienna",10.1109/INFVIS.1997.636793;10.1109/VISUAL.1999.809866;10.1109/INFVIS.2002.1173156;10.1109/VISUAL.1996.567800;10.1109/INFVIS.2005.1532138;10.1109/VISUAL.1990.146402,"Parallel coordinates, focus+context visualization, outliers & trends, large data visualization",152,114,21,
Vis,1999,A distributed graphics system for large tiled displays,10.1109/VISUAL.1999.809890,http://dx.doi.org/10.1109/VISUAL.1999.809890,215,527,C,"Recent interest in large displays has led to renewed development of tiled displays, which are comprised of several individual displays arranged in an array and used as one large logical display. Stanford's ""Interactive Mural"" is an example of such a display, using an overlapping four by two array of projectors that back-project onto a diffuse screen to form a 6' by 2' display area with a resolution of over 60 dpi. Writing software to make effective use of the large display space is a challenge because normal window system interaction metaphors break down. One promising approach is to switch to immersive applications; another approach, the one we are investigating, is to emulate office, conference room or studio environments which use the space to display a collection of visual material to support group activities. We describe a virtual graphics system that is designed to support multiple simultaneous rendering streams from both local and remote sites. The system abstracts the physical number of computers, graphics subsystems and projectors used to create the display. We provide performance measurements to show that the system scales well and thus supports a variety of different hardware configurations. The system is also interesting because it uses transparent ""layers"", instead of windows, to manage the screen.",Greg Humphreys;Pat Hanrahan,G. Humphreys;P. Hanrahan,"Dept. of Comput. Sci., Stanford Univ., CA, USA",,,150,47,26,
InfoVis,2012,Stacking-Based Visualization of Trajectory Attribute Data,10.1109/TVCG.2012.265,http://dx.doi.org/10.1109/TVCG.2012.265,2565,2574,J,"Visualizing trajectory attribute data is challenging because it involves showing the trajectories in their spatio-temporal context as well as the attribute values associated with the individual points of trajectories. Previous work on trajectory visualization addresses selected aspects of this problem, but not all of them. We present a novel approach to visualizing trajectory attribute data. Our solution covers space, time, and attribute values. Based on an analysis of relevant visualization tasks, we designed the visualization solution around the principle of stacking trajectory bands. The core of our approach is a hybrid 2D/3D display. A 2D map serves as a reference for the spatial context, and the trajectories are visualized as stacked 3D trajectory bands along which attribute values are encoded by color. Time is integrated through appropriate ordering of bands and through a dynamic query mechanism that feeds temporally aggregated information to a circular time display. An additional 2D time graph shows temporal information in full detail by stacking 2D trajectory bands. Our solution is equipped with analytical and interactive mechanisms for selecting and ordering of trajectories, and adjusting the color mapping, as well as coordinated highlighting and dedicated 3D navigation. We demonstrate the usefulness of our novel visualization by three examples related to radiation surveillance, traffic analysis, and maritime navigation. User feedback obtained in a small experiment indicates that our hybrid 2D/3D solution can be operated quite well.",Christian Tominski;Heidrun Schumann;Gennady L. Andrienko;Natalia V. Andrienko,Christian Tominski;Heidrun Schumann;Gennady Andrienko;Natalia Andrienko,University of Rostock;University of Rostock;Fraunhofer Institute IAIS;Fraunhofer Institute IAIS,10.1109/TVCG.2010.197;10.1109/VAST.2011.6102455;10.1109/VAST.2009.5332593;10.1109/VISUAL.1995.480803;10.1109/INFVIS.2004.27;10.1109/INFVIS.2005.1532144;10.1109/VAST.2011.6102454,"Visualization, interaction, exploratory analysis, trajectory attribute data, spatio-temporal data",150,152,35,
Vis,1999,A fast volume rendering algorithm for time-varying fields using a time-space partitioning (TSP) tree,10.1109/VISUAL.1999.809910,http://dx.doi.org/10.1109/VISUAL.1999.809910,371,545,C,"We present a fast volume rendering algorithm for time-varying fields. We propose a new data structure, called time-space partitioning (TSP) tree, that can effectively capture both the spatial and the temporal coherence from a time-varying field. Using the proposed data structure, the rendering speed is substantially improved. In addition, our data structure helps to maintain the memory access locality and to provide the sparse data traversal so that our algorithm becomes suitable for large-scale out-of-core applications. Finally, our algorithm allows flexible error control for both the temporal and the spatial coherence so that a trade-off between image quality and rendering speed is possible. We demonstrate the utility and speed of our algorithm with data from several time-varying CFD simulations. Our rendering algorithm can achieve substantial speedup while the storage space overhead for the TSP tree is kept at a minimum.",Han-Wei Shen;Ling-Jan Chiang;Kwan-Liu Ma,H.-W. Shen;L.-J. Chiang;K.-L. Ma,"MRJ Technol. Solutions, NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1998.745713;10.1109/VISUAL.1997.663888;10.1109/VISUAL.1996.567609;10.1109/VISUAL.1998.745298;10.1109/VISUAL.1995.480809,"scalar field visualization, volume visualization, volume rendering, time-varying fields",149,67,15,
Vis,2005,A contract based system for large data visualization,10.1109/VISUAL.2005.1532795,http://dx.doi.org/10.1109/VISUAL.2005.1532795,191,198,C,"VisIt is a richly featured visualization tool that is used to visualize some of the largest simulations ever run. The scale of these simulations requires that optimizations are incorporated into every operation VisIt performs. But the set of applicable optimizations that VisIt can perform is dependent on the types of operations being done. Complicating the issue, VisIt has a plugin capability that allows new, unforeseen components to be added, making it even harder to determine which optimizations can be applied. We introduce the concept of a contract to the standard data flow network design. This contract enables each component of the data flow network to modify the set of optimizations used. In addition, the contract allows for new components to be accommodated gracefully within VisIt's data flow network system.",Hank Childs;Eric Brugger;Kathleen S. Bonnell;Jeremy S. Meredith;Mark C. Miller;Brad Whitlock;Nelson L. Max,H. Childs;E. Brugger;K. Bonnell;J. Meredith;M. Miller;B. Whitlock;N. Max,"California Univ., Davis, CA, USA",10.1109/VISUAL.1996.567752;10.1109/VISUAL.1990.146416;10.1109/VISUAL.1995.480821;10.1109/VISUAL.1991.175794;10.1109/VISUAL.1997.663895,"large data set visualization, data flow networks, contract-based system",149,43,13,
InfoVis,2007,VisLink: Revealing Relationships Amongst Visualizations,10.1109/TVCG.2007.70521,http://dx.doi.org/10.1109/TVCG.2007.70521,1192,1199,J,"We present VisLink, a method by which visualizations and the relationships between them can be interactively explored. VisLink readily generalizes to support multiple visualizations, empowers inter-representational queries, and enables the reuse of the spatial variables, thus supporting efficient information encoding and providing for powerful visualization bridging. Our approach uses multiple 2D layouts, drawing each one in its own plane. These planes can then be placed and re-positioned in 3D space: side by side, in parallel, or in chosen placements that provide favoured views. Relationships, connections, and patterns between visualizations can be revealed and explored using a variety of interaction techniques including spreading activation and search filters.",Christopher Collins 0001;Sheelagh Carpendale,Christopher Collins;Sheelagh Carpendale,PhD Candidate with the Computer Science Department at the Univeristy of Toronto;Professor with the Computer Science Department at the University of Calgary,10.1109/VISUAL.2003.1250400;10.1109/VISUAL.1990.146402;10.1109/TVCG.2006.166;10.1109/VISUAL.1991.175815;10.1109/INFVIS.2003.1249008;10.1109/INFVIS.2001.963279;10.1109/TVCG.2006.147,"Graph visualization, node-link diagrams, structural comparison, hierarchies, 3D visualization, edge aggregation",148,102,22,
VAST,2009,Interactive visual clustering of large collections of trajectories,10.1109/VAST.2009.5332584,http://dx.doi.org/10.1109/VAST.2009.5332584,3,10,C,"One of the most common operations in exploration and analysis of various kinds of data is clustering, i.e. discovery and interpretation of groups of objects having similar properties and/or behaviors. In clustering, objects are often treated as points in multi-dimensional space of properties. However, structurally complex objects, such as trajectories of moving entities and other kinds of spatio-temporal data, cannot be adequately represented in this manner. Such data require sophisticated and computationally intensive clustering algorithms, which are very hard to scale effectively to large datasets not fitting in the computer main memory. We propose an approach to extracting meaningful clusters from large databases by combining clustering and classification, which are driven by a human analyst through an interactive visual interface.",Gennady L. Andrienko;Natalia V. Andrienko;Salvatore Rinzivillo;Mirco Nanni;Dino Pedreschi;Fosca Giannotti,Gennady Andrienko;Natalia Andrienko;Salvatore Rinzivillo;Mirco Nanni;Dino Pedreschi;Fosca Giannotti,"Fraunhofer Institute IAIS (Intelligent Analysis and Information Systems), Sankt Augustin, Germany;Fraunhofer Institute IAIS (Intelligent Analysis and Information Systems), Sankt Augustin, Germany;KDD Lab ISTI CNR, Pisa, Italy;KDD Lab ISTI CNR, Pisa, Italy;University of Pisa, Italy;KDD Lab ISTI CNR, Pisa, Italy",10.1109/VAST.2008.4677356;10.1109/VAST.2007.4388999,"Spatio-temporal data, movement data, trajectories, clustering, classification, scalable visualization, geovisualization",148,111,26,
InfoVis,1996,Visage: a user interface environment for exploring information,10.1109/INFVIS.1996.559210,http://dx.doi.org/10.1109/INFVIS.1996.559210,3,"12, 116",C,"Visage is a prototype user interface environment for exploring and analyzing information. It represents an approach to coordinating multiple visualizations, analysis and presentation tools in data-intensive domains. Visage is based on an information-centric approach to user interface design which strives to eliminate impediments to direct user access to information objects across applications and visualizations. Visage consists of a set of data manipulation operations, an intelligent system for generating a wide variety of data visualizations (SAGE) and a briefing tool that supports the conversion of visual displays used during exploration into interactive presentation slides. This paper presents the user interface components and styles of interaction that are central to Visage's information-centric approach.",Steven F. Roth;Peter Lucas 0002;Jeffrey Senn;Cristina C. Gomberg;Michael B. Burks;Philip J. Stroffolino;John A. Kolojechick;Carolyn Dunmire,S.F. Roth;P. Lucas;J.A. Senn;C.C. Gomberg;M.B. Burks;P.J. Stroffolino;A.J. Kolojechick;C. Dunmire,"Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA",10.1109/VISUAL.1993.398870;10.1109/VISUAL.1991.175815,"Visualization, exploratory data analysis, graphics, user interface environment, human-computer interaction",147,39,13,TT
Vis,1999,"The ""Parallel Vectors"" operator-a vector field visualization primitive",10.1109/VISUAL.1999.809896,http://dx.doi.org/10.1109/VISUAL.1999.809896,263,532,C,"We propose an elementary operation on a pair of vector fields as a building block for defining and computing global line-type features of vector or scalar fields. While usual feature definitions often are procedural and therefore implicit, our operator allows precise mathematical definitions. It can serve as a basis for comparing feature definitions and for reuse of algorithms and implementations. Applications focus on vortex core methods.",Ronald Peikert;Martin Roth,R. Peikert;M. Roth,"Dept. of Comput. Sci., ETH Zurich, Switzerland",10.1109/VISUAL.1998.745290;10.1109/VISUAL.1996.568137;10.1109/VISUAL.1998.745296;10.1109/VISUAL.1995.480795;10.1109/VISUAL.1994.346327;10.1109/VISUAL.1997.663894;10.1109/VISUAL.1998.745297;10.1109/VISUAL.1996.567807,,147,90,29,
Vis,2000,Hardware-accelerated volume and isosurface rendering based on cell-projection,10.1109/VISUAL.2000.885683,http://dx.doi.org/10.1109/VISUAL.2000.885683,109,116,C,"We present two beneficial rendering extensions to the projected tetrahedra (PT) algorithm proposed by Shirley and Tuchman (1990). These extensions are compatible with any cell sorting technique, for example the BSP-XMPVO sorting algorithm for unstructured meshes. Using 3D texture mapping our first extension solves the longstanding problem of hardware-accelerated but accurate rendering of tetrahedral volume cells with arbitrary transfer functions. By employing 2D texture mapping our second extension realizes the hardware-accelerated rendering of multiple shaded isosurfaces within the PT algorithm without reconstructing the isosurfaces. Additionally, two methods are presented to combine projected tetrahedral volumes with isosurfaces. The time complexity of all our algorithms is linear in the number of tetrahedra and does neither depend on the number of isosurfaces nor on the employed transfer functions.",Stefan Röttger;Martin Kraus;Thomas Ertl,S. Rottger;M. Kraus;T. Ertl,"Visualization & Interactive Syst. Group, Stuttgart Univ., Germany",10.1109/VISUAL.1993.398846;10.1109/VISUAL.1994.346320;10.1109/VISUAL.1999.809887;10.1109/VISUAL.1994.346308;10.1109/VISUAL.2000.885688;10.1109/VISUAL.1994.346306;10.1109/VISUAL.1997.663853;10.1109/VISUAL.1999.809878;10.1109/VISUAL.1996.568127;10.1109/VISUAL.1995.480806;10.1109/VISUAL.1998.745300;10.1109/VISUAL.1996.568121;10.1109/VISUAL.1998.745713,"Volume Rendering, Isosurfaces, Unstructured Meshes, Cell Projection, Graphics Hardware, Texture Mapping, Compositing",147,57,35,
InfoVis,2004,Interactive Visualization of Small World Graphs,10.1109/INFVIS.2004.43,http://dx.doi.org/10.1109/INFVIS.2004.43,199,206,C,"Many real world graphs have small world characteristics, that is, they have a small diameter compared to the number of nodes and exhibit a local cluster structure. Examples are social networks, software structures, bibliographic references and biological neural nets. Their high connectivity makes both finding a pleasing layout and a suitable clustering hard. In this paper we present a method to create scalable, interactive visualizations of small world graphs, allowing the user to inspect local clusters while maintaining a global overview of the entire structure. The visualization method uses a combination of both semantical and geometrical distortions, while the layout is generated by a spring embedder algorithm using recently developed force model. We use a cross referenced database of 500 artists as a running example",Frank van Ham;Jarke J. van Wijk,F. van Ham;J.J. van Wijk,Technische Universiteit Eindhoven,10.1109/INFVIS.1997.636718;10.1109/INFVIS.1995.528686;10.1109/VISUAL.2000.885677;10.1109/INFVIS.2003.1249011,"Graph Visualization, Graph Drawing, Clustering, Small World Graphs",147,67,36,
Vis,2003,Using deformations for browsing volumetric data,10.1109/VISUAL.2003.1250400,http://dx.doi.org/10.1109/VISUAL.2003.1250400,401,408,C,"Many traditional techniques for ""looking inside"" volumetric data involve removing portions of the data, for example using various cutting tools, to reveal the interior. This allows the user to see hidden parts of the data, but has the disadvantage of removing potentially important surrounding contextual information. We explore an alternate strategy for browsing that uses deformations, where the user can cut into and open up, spread apart, or peel away parts of the volume in real time, making the interior visible while still retaining surrounding context. We consider various deformation strategies and present a number of interaction techniques based on different metaphors. Our designs pay special attention to the semantic layers that might compose a volume (e.g. the skin, muscle, bone in a scan of a human). Users can apply deformations to only selected layers, or apply a given deformation to a different degree to each layer, making browsing more flexible and facilitating the visualization of relationships between layers. Our interaction techniques are controlled with direct, ""in place"" manipulation, using pop-up menus and 3D widgets, to avoid the divided attention and awkwardness that would come with panels of traditional widgets. Initial user feedback indicates that our techniques are valuable, especially for showing portions of the data spatially situated in context with surrounding data.",Michael J. McGuffin;Liviu Tancau;Ravin Balakrishnan,M.J. McGuffin;L. Tancau;R. Balakrishnan,"Dept. of Comput. Sci., Univ. of Toronto, Ont., Canada;Dept. of Comput. Sci., Univ. of Toronto, Ont., Canada;Dept. of Comput. Sci., Univ. of Toronto, Ont., Canada",,"volumetric data, volume data, deformations, browsing, layers, interaction techniques, 3D widgets",146,71,21,
InfoVis,2009,Flow Mapping and Multivariate Visualization of Large Spatial Interaction Data,10.1109/TVCG.2009.143,http://dx.doi.org/10.1109/TVCG.2009.143,1041,1048,J,"Spatial interactions (or flows), such as population migration and disease spread, naturally form a weighted location-to-location network (graph). Such geographically embedded networks (graphs) are usually very large. For example, the county-to-county migration data in the U.S. has thousands of counties and about a million migration paths. Moreover, many variables are associated with each flow, such as the number of migrants for different age groups, income levels, and occupations. It is a challenging task to visualize such data and discover network structures, multivariate relations, and their geographic patterns simultaneously. This paper addresses these challenges by developing an integrated interactive visualization framework that consists three coupled components: (1) a spatially constrained graph partitioning method that can construct a hierarchy of geographical regions (communities), where there are more flows or connections within regions than across regions; (2) a multivariate clustering and visualization method to detect and present multivariate patterns in the aggregated region-to-region flows; and (3) a highly interactive flow mapping component to map both flow and multivariate patterns in the geographic space, at different hierarchical levels. The proposed approach can process relatively large data sets and effectively discover and visualize major flow structures and multivariate relations at the same time. User interactions are supported to facilitate the understanding of both an overview and detailed patterns.",Diansheng Guo,Diansheng Guo,"Department of Geography, University of South Carolina",10.1109/TVCG.2008.135;10.1109/TVCG.2006.147;10.1109/TVCG.2006.138;10.1109/INFVIS.2005.1532150,"hierarchical clustering, graph partitioning, flow mapping, spatial interaction, contiguity constraints, multidimensional visualization, coordinated views, data mining",145,114,43,
VAST,2012,Spatiotemporal social media analytics for abnormal event detection and examination using seasonal-trend decomposition,10.1109/VAST.2012.6400557,http://dx.doi.org/10.1109/VAST.2012.6400557,143,152,C,"Recent advances in technology have enabled social media services to support space-time indexed data, and internet users from all over the world have created a large volume of time-stamped, geo-located data. Such spatiotemporal data has immense value for increasing situational awareness of local events, providing insights for investigations and understanding the extent of incidents, their severity, and consequences, as well as their time-evolving nature. In analyzing social media data, researchers have mainly focused on finding temporal trends according to volume-based importance. Hence, a relatively small volume of relevant messages may easily be obscured by a huge data set indicating normal situations. In this paper, we present a visual analytics approach that provides users with scalable and interactive social media data analysis and visualization including the exploration and examination of abnormal topics and events within various social media data sources, such as Twitter, Flickr and YouTube. In order to find and understand abnormal events, the analyst can first extract major topics from a set of selected messages and rank them probabilistically using Latent Dirichlet Allocation. He can then apply seasonal trend decomposition together with traditional control chart methods to find unusual peaks and outliers within topic time series. Our case studies show that situational awareness can be improved by incorporating the anomaly and trend examination techniques into a highly interactive visual analysis process.",Junghoon Chae;Dennis Thom;Harald Bosch;Yun Jang;Ross Maciejewski;David S. Ebert;Thomas Ertl,Junghoon Chae;Dennis Thom;Harald Bosch;Yun Jang;Ross Maciejewski;David S. Ebert;Thomas Ertl,Purdue University;University of Stuttgart;University of Stuttgart;Sejong University;Arizona State University;Purdue University;University of Stuttgart,10.1109/VAST.2011.6102456;10.1109/VAST.2011.6102461;10.1109/TVCG.2008.175,,145,107,39,
InfoVis,1995,The information mural: a technique for displaying and navigating large information spaces,10.1109/INFVIS.1995.528685,http://dx.doi.org/10.1109/INFVIS.1995.528685,43,50,C,"Visualizations which depict entire information spaces provide context for navigation and browsing tasks; however, the limited size of the display screen makes creating effective global views difficult. We have developed a technique for displaying and navigating large information spaces. The key concept is the use of an information mural, a two-dimensional reduced representation of an entire information space that fits completely within a display window or screen. Information murals use grayscale shading and color along with anti-aliasing techniques to create a miniature version of the entire data set. By incorporating navigational capabilities, information murals become a tool that can be used as a global view along with more detailed informational displays. Information murals are utilized in our software visualization research to help depict the execution of object-oriented programs, and can also be used in more general information visualization applications.",Dean F. Jerding;John T. Stasko,D.F. Jerding;J.T. Stasko,"Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA",10.1109/VISUAL.1994.346322,,143,15,19,
InfoVis,2004,GeoTime Information Visualization,10.1109/INFVIS.2004.27,http://dx.doi.org/10.1109/INFVIS.2004.27,25,32,C,"Analyzing observations over time and geography is a common task but typically requires multiple, separate tools. The objective of our research has been to develop a method to visualize, and work with, the spatial interconnectedness of information over time and geography within a single, highly interactive 3D view. A novel visualization technique for displaying and tracking events, objects and activities within a combined temporal and geospatial display has been developed. This technique has been implemented as a demonstratable prototype called GeoTime in order to determine potential utility. Initial evaluations have been with military users. However, we believe the concept is applicable to a variety of government and business analysis tasks",Thomas Kapler;William Wright,T. Kapler;W. Wright,Oculus Info Inc.,10.1109/INFVIS.2003.1249006,"3-D visualization, spatiotemporal, geospatial, interactive visualization, visual data analysis, link analysis",143,67,22,
Vis,2005,Streaming meshes,10.1109/VISUAL.2005.1532800,http://dx.doi.org/10.1109/VISUAL.2005.1532800,231,238,C,"Recent years have seen an immense increase in the complexity of geometric data sets. Today's gigabyte-sized polygon models can no longer be completely loaded into the main memory of common desktop PCs. Unfortunately, current mesh formats, which were designed years ago when meshes were orders of magnitudes smaller, do not account for this. Using such formats to store large meshes is inefficient and complicates all subsequent processing. We describe a streaming format for polygon meshes that is simple enough to replace current offline mesh formats and is more suitable for representing large data sets. Furthermore, it is an ideal input and output format for I/O-efficient out-of-core algorithms that process meshes in a streaming, possibly pipelined, fashion. This paper chiefly concerns the underlying theory and the practical aspects of creating and working with this new representation. In particular, we describe desirable qualities for streaming meshes and methods for converting meshes from a traditional to a streaming format. A central theme of this paper is the issue of coherent and compatible layouts of the mesh vertices and polygons. We present metrics and diagrams that characterize the coherence of a mesh layout and suggest appropriate strategies for improving its ""streamability"". To this end, we outline several out-of-core algorithms for reordering meshes with poor coherence, and present results for a menagerie of well known and generally incoherent surface meshes.",Martin Isenburg;Peter Lindstrom,M. Isenburg;P. Lindstrom,"North Carolina Univ., Chapel Hill, NC, USA",10.1109/INFVIS.2002.1173159;10.1109/VISUAL.1997.663895;10.1109/VISUAL.2001.964532;10.1109/VISUAL.2003.1250408,,143,31,21,
InfoVis,2008,VisGets: Coordinated Visualizations for Web-based Information Exploration and Discovery,10.1109/TVCG.2008.175,http://dx.doi.org/10.1109/TVCG.2008.175,1205,1212,J,"In common Web-based search interfaces, it can be difficult to formulate queries that simultaneously combine temporal, spatial, and topical data filters. We investigate how coordinated visualizations can enhance search and exploration of information on the World Wide Web by easing the formulation of these types of queries. Drawing from visual information seeking and exploratory search, we introduce VisGets - interactive query visualizations of Web-based information that operate with online information within a Web browser. VisGets provide the information seeker with visual overviews of Web resources and offer a way to visually filter the data. Our goal is to facilitate the construction of dynamic search queries that combine filters from more than one data dimension. We present a prototype information exploration system featuring three linked VisGets (temporal, spatial, and topical), and used it to visually explore news items from online RSS feeds.",Marian Dörk;Sheelagh Carpendale;Christopher Collins 0001;Carey L. Williamson,Marian Dörk;Sheelagh Carpendale;Christopher Collins;Carey Williamson,University of Calgary;University of Calgary;University of Toronto;University of Calgary,10.1109/TVCG.2007.70570;10.1109/TVCG.2007.70589;10.1109/TVCG.2007.70577;10.1109/VISUAL.1993.398863;10.1109/INFVIS.2005.1532122;10.1109/VISUAL.1996.567610,"Information visualization, World Wide Web, information retrieval, exploratory search, visual information seeking",143,92,41,
InfoVis,2015,Voyager: Exploratory Analysis via Faceted Browsing of Visualization Recommendations,10.1109/TVCG.2015.2467191,http://dx.doi.org/10.1109/TVCG.2015.2467191,649,658,J,"General visualization tools typically require manual specification of views: analysts must select data variables and then choose which transformations and visual encodings to apply. These decisions often involve both domain and visualization design expertise, and may impose a tedious specification process that impedes exploration. In this paper, we seek to complement manual chart construction with interactive navigation of a gallery of automatically-generated visualizations. We contribute Voyager, a mixed-initiative system that supports faceted browsing of recommended charts chosen according to statistical and perceptual measures. We describe Voyager's architecture, motivating design principles, and methods for generating and interacting with visualization recommendations. In a study comparing Voyager to a manual visualization specification tool, we find that Voyager facilitates exploration of previously unseen data and leads to increased data variable coverage. We then distill design implications for visualization tools, in particular the need to balance rapid exploration and targeted question-answering.",Kanit Wongsuphasawat;Dominik Moritz;Anushka Anand;Jock D. Mackinlay;Bill Howe;Jeffrey Heer,Kanit Wongsuphasawat;Dominik Moritz;Anushka Anand;Jock Mackinlay;Bill Howe;Jeffrey Heer,University of Washington;Tableau Research;Tableau Research;Tableau Research;University of Washington;University of Washington,10.1109/TVCG.2014.2346297;10.1109/TVCG.2009.174;10.1109/TVCG.2011.185;10.1109/TVCG.2007.70594;10.1109/TVCG.2014.2346291;10.1109/INFVIS.2000.885086,"User interfaces, information visualization, exploratory analysis, visualization recommendation, mixed-initiative systems",143,116,48,
Vis,1991,The virtual windtunnel: An environment for the exploration of three-dimensional unsteady flows,10.1109/VISUAL.1991.175771,http://dx.doi.org/10.1109/VISUAL.1991.175771,17,"24, 407",C,"A recently completed implementation of a virtual environment for exploring numerically generated three-dimensional unsteady flowfields is described. A boom-mounted six-degree-of-freedom head-position-sensitive stereo CRT system is used for viewing. A hand-position-sensitive glove controller is used for injecting various tracers (e.g. smoke) into the virtual flowfield. A multiprocessor graphics workstation is used for computation and rendering. The techniques for visualizing unsteady flows are described, and the computer requirements for a variety of visualization techniques are discussed. These techniques generalize to visualization of other 3D vector fields.<<ETX>>",Steve Bryson;Creon Levit,S. Bryson;C. Levit,"NASA Ames Res. Center, Moffett Field, CA, USA;NASA Ames Res. Center, Moffett Field, CA, USA",,,142,53,11,BP
Vis,1994,Discretized Marching Cubes,10.1109/VISUAL.1994.346308,http://dx.doi.org/10.1109/VISUAL.1994.346308,281,"287, C32",C,"Since the introduction of standard techniques for isosurface extraction from volumetric datasets, one of the hardest problems has been to reduce the number of triangles (or polygons) generated. The paper presents an algorithm that considerably reduces the number of polygons generated by a Marching Cubes-like scheme (W. Lorensen and H. Cline, 1987) without excessively increasing the overall computational complexity. The algorithm assumes discretization of the dataset space and replaces cell edge interpolation by midpoint selection. Under these assumptions, the extracted surfaces are composed of polygons lying within a finite number of incidences, thus allowing simple merging of the output facets into large coplanar polygons. An experimental evaluation of the proposed approach on datasets related to biomedical imaging and chemical modelling is reported.<<ETX>>",Claudio Montani;Riccardo Scateni;Roberto Scopigno,C. Montani;R. Scateni;R. Scopigno,"CNR, Pisa, Italy",10.1109/VISUAL.1992.235223,,142,53,16,
Vis,1996,Isosurfacing in span space with utmost efficiency (ISSUE),10.1109/VISUAL.1996.568121,http://dx.doi.org/10.1109/VISUAL.1996.568121,287,294,C,"We present efficient sequential and parallel algorithms for isosurface extraction. Based on the Span Space data representation, new data subdivision and searching methods are described. We also present a parallel implementation with an emphasis on load balancing. The performance of our sequential algorithm to locate the cell elements intersected by isosurfaces is faster than the Kd tree searching method originally used for the Span Space algorithm. The parallel algorithm can achieve high load balancing for massively parallel machines with distributed memory architectures.",Han-Wei Shen;Charles D. Hansen;Yarden Livnat;Christopher R. Johnson 0001,Han-Wei Shen;C.D. Hansen;Y. Livnat;C.R. Johnson,"Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.1991.175780;10.1109/VISUAL.1995.480806;10.1109/VISUAL.1994.346334,,141,61,10,
InfoVis,2011,Visualization Rhetoric: Framing Effects in Narrative Visualization,10.1109/TVCG.2011.255,http://dx.doi.org/10.1109/TVCG.2011.255,2231,2240,J,"Narrative visualizations combine conventions of communicative and exploratory information visualization to convey an intended story. We demonstrate visualization rhetoric as an analytical framework for understanding how design techniques that prioritize particular interpretations in visualizations that ""tell a story"" can significantly affect end-user interpretation. We draw a parallel between narrative visualization interpretation and evidence from framing studies in political messaging, decision-making, and literary studies. Devices for understanding the rhetorical nature of narrative information visualizations are presented, informed by the rigorous application of concepts from critical theory, semiotics, journalism, and political theory. We draw attention to how design tactics represent additions or omissions of information at various levels-the data, visual representation, textual annotations, and interactivity-and how visualizations denote and connote phenomena with reference to unstated viewing conventions and codes. Classes of rhetorical techniques identified via a systematic analysis of recent narrative visualizations are presented, and characterized according to their rhetorical contribution to the visualization. We describe how designers and researchers can benefit from the potentially positive aspects of visualization rhetoric in designing engaging, layered narrative visualizations and how our framework can shed light on how a visualization design prioritizes specific interpretations. We identify areas where future inquiry into visualization rhetoric can improve understanding of visualization interpretation.",Jessica Hullman;Nicholas Diakopoulos,Jessica Hullman;Nick Diakopoulos,University of Michigan School of Information;Rutgers University School of Information and Communication,10.1109/TVCG.2010.179;10.1109/TVCG.2007.70577;10.1109/TVCG.2010.177;10.1109/TVCG.2009.111,"Rhetoric, narrative visualization, framing effects, semiotics, denotation, connotation ",141,118,56,
Vis,2003,High-quality two-level volume rendering of segmented data sets on consumer graphics hardware,10.1109/VISUAL.2003.1250386,http://dx.doi.org/10.1109/VISUAL.2003.1250386,301,308,C,"One of the most important goals in volume rendering is to be able to visually separate and selectively enable specific objects of interest contained in a single volumetric data set, which can be approached by using explicit segmentation information. We show how segmented data sets can be rendered interactively on current consumer graphics hardware with high image quality and pixel-resolution filtering of object boundaries. In order to enhance object perception, we employ different levels of object distinction. First, each object can be assigned an individual transfer function, multiple of which can be applied in a single rendering pass. Second, different rendering modes such as direct volume rendering, iso-surfacing, and non-photorealistic techniques can be selected for each object. A minimal number of rendering passes is achieved by processing sets of objects that share the same rendering mode in a single pass. Third, local compositing modes such as alpha blending and MIP can be selected for each object in addition to a single global mode, thus enabling high-quality two-level volume rendering on GPUs.",Markus Hadwiger;Christoph Berger;Helwig Hauser,M. Hadwiger;C. Berger;H. Hauser,"VRVis Res. Center, Austria;VRVis Res. Center, Austria;VRVis Res. Center, Austria",10.1109/VISUAL.1998.745311;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2002.1183777;10.1109/VISUAL.2000.885694,"volume rendering, segmentation, non-photorealistic rendering, consumer graphics hardware",140,56,22,
InfoVis,2010,Graphical Perception of Multiple Time Series,10.1109/TVCG.2010.162,http://dx.doi.org/10.1109/TVCG.2010.162,927,934,J,"Line graphs have been the visualization of choice for temporal data ever since the days of William Playfair (1759-1823), but realistic temporal analysis tasks often include multiple simultaneous time series. In this work, we explore user performance for comparison, slope, and discrimination tasks for different line graph techniques involving multiple time series. Our results show that techniques that create separate charts for each time series--such as small multiples and horizon graphs--are generally more efficient for comparisons across time series with a large visual span. On the other hand, shared-space techniques--like standard line graphs--are typically more efficient for comparisons over smaller visual spans where the impact of overlap and clutter is reduced.",Waqas Javed;Bryan McDonnel;Niklas Elmqvist,Waqas Javed;Bryan McDonnel;Niklas Elmqvist,Purdue University;Purdue University;Purdue University,10.1109/TVCG.2008.166;10.1109/TVCG.2007.70583;10.1109/TVCG.2007.70535;10.1109/INFVIS.1999.801851;10.1109/TVCG.2008.125;10.1109/INFVIS.2005.1532144,"Line graphs, braided graphs, horizon graphs, small multiples, stacked graphs, evaluation, design guidelines",139,105,29,
InfoVis,2013,Nanocubes for Real-Time Exploration of Spatiotemporal Datasets,10.1109/TVCG.2013.179,http://dx.doi.org/10.1109/TVCG.2013.179,2456,2465,J,"Consider real-time exploration of large multidimensional spatiotemporal datasets with billions of entries, each defined by a location, a time, and other attributes. Are certain attributes correlated spatially or temporally? Are there trends or outliers in the data? Answering these questions requires aggregation over arbitrary regions of the domain and attributes of the data. Many relational databases implement the well-known data cube aggregation operation, which in a sense precomputes every possible aggregate query over the database. Data cubes are sometimes assumed to take a prohibitively large amount of space, and to consequently require disk storage. In contrast, we show how to construct a data cube that fits in a modern laptop's main memory, even for billions of entries; we call this data structure a nanocube. We present algorithms to compute and query a nanocube, and show how it can be used to generate well-known visual encodings such as heatmaps, histograms, and parallel coordinate plots. When compared to exact visualizations created by scanning an entire dataset, nanocube plots have bounded screen error across a variety of scales, thanks to a hierarchical structure in space and time. We demonstrate the effectiveness of our technique on a variety of real-world datasets, and present memory, timing, and network bandwidth measurements. We find that the timings for the queries in our examples are dominated by network and user-interaction latencies.",Lauro Didier Lins;James T. Klosowski;Carlos Scheidegger,Lauro Lins;James T. Klosowski;Carlos Scheidegger,AT&T Research;AT&T Research;AT&T Research,10.1109/TVCG.2006.161;10.1109/INFVIS.2002.1173141;10.1109/TVCG.2009.191;10.1109/VAST.2008.4677357;10.1109/TVCG.2007.70594;10.1109/INFVIS.2002.1173156;10.1109/VISUAL.1990.146386;10.1109/TVCG.2011.185,"Data cube, Data structures, Interactive exploration",139,118,36,HM
VAST,2013,Temporal Event Sequence Simplification,10.1109/TVCG.2013.200,http://dx.doi.org/10.1109/TVCG.2013.200,2227,2236,J,"Electronic Health Records (EHRs) have emerged as a cost-effective data source for conducting medical research. The difficulty in using EHRs for research purposes, however, is that both patient selection and record analysis must be conducted across very large, and typically very noisy datasets. Our previous work introduced EventFlow, a visualization tool that transforms an entire dataset of temporal event records into an aggregated display, allowing researchers to analyze population-level patterns and trends. As datasets become larger and more varied, however, it becomes increasingly difficult to provide a succinct, summarizing display. This paper presents a series of user-driven data simplifications that allow researchers to pare event records down to their core elements. Furthermore, we present a novel metric for measuring visual complexity, and a language for codifying disjoint strategies into an overarching simplification framework. These simplifications were used by real-world researchers to gain new and valuable insights from initially overwhelming datasets.",Megan Monroe;Rongjian Lan;Hanseung Lee;Catherine Plaisant;Ben Shneiderman,Megan Monroe;Rongjian Lan;Hanseung Lee;Catherine Plaisant;Ben Shneiderman,"Department of Computer Science & Human-Computer Interaction Lab, University of Maryland;Department of Computer Science & Human-Computer Interaction Lab, University of Maryland;Department of Computer Science & Human-Computer Interaction Lab, University of Maryland;Department of Computer Science & Human-Computer Interaction Lab, University of Maryland;Department of Computer Science & Human-Computer Interaction Lab, University of Maryland",10.1109/TVCG.2009.117;10.1109/TVCG.2012.213;10.1109/VAST.2010.5652890,"Event sequences, simplification, electronic heath records, temporal query",139,125,33,HM
Vis,2004,Simplifying flexible isosurfaces using local geometric measures,10.1109/VISUAL.2004.96,http://dx.doi.org/10.1109/VISUAL.2004.96,497,504,C,"The contour tree, an abstraction of a scalar field that encodes the nesting relationships of isosurfaces, can be used to accelerate isosurface extraction, to identify important isovalues for volume-rendering transfer functions, and to guide exploratory visualization through a flexible isosurface interface. Many real-world data sets produce unmanageably large contour trees which require meaningful simplification. We define local geometric measures for individual contours, such as surface area and contained volume, and provide an algorithm to compute these measures in a contour tree. We then use these geometric measures to simplify the contour trees, suppressing minor topological features of the data. We combine this with a flexible isosurface interface to allow users to explore individual contours of a dataset interactively.",Hamish A. Carr;Jack Snoeyink;Michiel van de Panne,H. Carr;J. Snoeyink;M. van de Panne,"Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada",10.1109/VISUAL.2001.964499;10.1109/VISUAL.2002.1183774,"Isosurfaces, contourtrees, topological simplification",138,69,26,TT
InfoVis,2011,Quality Metrics in High-Dimensional Data Visualization: An Overview and Systematization,10.1109/TVCG.2011.229,http://dx.doi.org/10.1109/TVCG.2011.229,2203,2212,J,"In this paper, we present a systematization of techniques that use quality metrics to help in the visual exploration of meaningful patterns in high-dimensional data. In a number of recent papers, different quality metrics are proposed to automate the demanding search through large spaces of alternative visualizations (e.g., alternative projections or ordering), allowing the user to concentrate on the most promising visualizations suggested by the quality metrics. Over the last decade, this approach has witnessed a remarkable development but few reflections exist on how these methods are related to each other and how the approach can be developed further. For this purpose, we provide an overview of approaches that use quality metrics in high-dimensional data visualization and propose a systematization based on a thorough literature review. We carefully analyze the papers and derive a set of factors for discriminating the quality metrics, visualization techniques, and the process itself. The process is described through a reworked version of the well-known information visualization pipeline. We demonstrate the usefulness of our model by applying it to several existing approaches that use quality metrics, and we provide reflections on implications of our model for future research.",Enrico Bertini,Enrico Bertini;Andrada Tatu;Daniel Keim,University of Konstanz,10.1109/INFVIS.2005.1532145;10.1109/VAST.2010.5652433;10.1109/VAST.2006.261423;10.1109/TVCG.2010.184;10.1109/TVCG.2010.179;10.1109/INFVIS.2004.15;10.1109/TVCG.2006.161;10.1109/TVCG.2007.70515;10.1109/INFVIS.2005.1532142;10.1109/VISUAL.1990.146402;10.1109/INFVIS.2003.1249006;10.1109/VISUAL.1990.146386;10.1109/TVCG.2006.138;10.1109/INFVIS.2004.59;10.1109/VAST.2009.5332628;10.1109/INFVIS.2003.1249015;10.1109/VAST.2010.5652450;10.1109/TVCG.2007.70535;10.1109/INFVIS.1998.729559;10.1109/INFVIS.2000.885092;10.1109/INFVIS.2004.3;10.1109/TVCG.2009.153;10.1109/INFVIS.1997.636794,"Quality Metrics, High-Dimensional Data Visualization",138,133,60,
Vis,1993,InfoCrystal: A visual tool for information retrieval,10.1109/VISUAL.1993.398863,http://dx.doi.org/10.1109/VISUAL.1993.398863,150,157,C,"This paper introduces a novel representation, called the InfoCrystal, that can be used as a visualization tool as well as a visual query language to help users search for information. The InfoCrystal visualizes all the possible relationships among N concepts. Users can assign relevance weights to the concepts and use thresholding to select relationships of interest. The InfoCrystal allows users to specify Boolean as well as vector-space queries graphically. Arbitrarily complex queries can be created by using the InfoCrystals as building blocks and organizing them in a hierarchical structure. The InfoCrystal enables users to explore and filter information in a flexible, dynamic and interactive way.<<ETX>>",Anselm Spoerri,A. Spoerri,"Center for Educational Comput. Initiatives, MIT, Cambridge, MA, USA",,"information visualization, visual query language, information retrieval, graphical user interface, human factors",137,19,12,
Vis,2002,Interactive visualization of complex plant ecosystems,10.1109/VISUAL.2002.1183778,http://dx.doi.org/10.1109/VISUAL.2002.1183778,219,226,C,"We present a method for interactive rendering of large outdoor scenes. Complex polygonal plant models and whole plant populations are represented by relatively small sets of point and line primitives. This enables us to show landscapes faithfully using only a limited percentage of primitives. In addition, a hierarchical data structure allows us to smoothly reduce the geometrical representation to any desired number of primitives. The scene is hierarchically divided into local portions of geometry to achieve large reduction factors for distant regions. Additionally, the data reduction is adapted to the visual importance of geometric objects. This allows us to maintain the visual fidelity of the representation while reducing most of the geometry drastically. With our system, we are able to interactively render very complex landscapes with good visual quality.",Oliver Deussen;Carsten Colditz;Marc Stamminger;George Drettakis,O. Deussen;C. Colditz;M. Stamminger;G. Drettakis,"Fac. of Comput. Sci., Dresden Univ. of Technol., Germany;Fac. of Comput. Sci., Dresden Univ. of Technol., Germany",10.1109/VISUAL.1997.663860;10.1109/VISUAL.2001.964491;10.1109/VISUAL.2001.964492,"Synthetic Plants, Ecosystems, Point-based rendering, Level-of-detail Algorithms",137,34,24,
VAST,2008,Spatio-temporal aggregation for visual analysis of movements,10.1109/VAST.2008.4677356,http://dx.doi.org/10.1109/VAST.2008.4677356,51,58,C,"Data about movements of various objects are collected in growing amounts by means of current tracking technologies. Traditional approaches to visualization and interactive exploration of movement data cannot cope with data of such sizes. In this research paper we investigate the ways of using aggregation for visual analysis of movement data. We define aggregation methods suitable for movement data and find visualization and interaction techniques to represent results of aggregations and enable comprehensive exploration of the data. We consider two possible views of movement, traffic-oriented and trajectory-oriented. Each view requires different methods of analysis and of data aggregation. We illustrate our argument with example data resulting from tracking multiple cars in Milan and example analysis tasks from the domain of city traffic management.",Gennady L. Andrienko;Natalia V. Andrienko,Gennady Andrienko;Natalia Andrienko,"Fraunhofer Institute IAIS (Intelligent Analysis and Information Systems), Sankt Augustin, Germany;Fraunhofer Institute IAIS (Intelligent Analysis and Information Systems), Sankt Augustin, Germany",,"Movement data, spatio-temporal data, aggregation, scalable visualization, geovisualization",137,119,17,
Vis,2005,View selection for volume rendering,10.1109/VISUAL.2005.1532833,http://dx.doi.org/10.1109/VISUAL.2005.1532833,487,494,C,"In a visualization of a three-dimensional dataset, the insights gained are dependent on what is occluded and what is not. Suggestion of interesting viewpoints can improve both the speed and efficiency of data understanding. This paper presents a view selection method designed for volume rendering. It can be used to find informative views for a given scene, or to find a minimal set of representative views which capture the entire scene. It becomes particularly useful when the visualization process is non-interactive - for example, when visualizing large datasets or time-varying sequences. We introduce a viewpoint ""goodness"" measure based on the formulation of entropy from information theory. The measure takes into account the transfer function, the data distribution and the visibility of the voxels. Combined with viewpoint properties like view-likelihood and view-stability, this technique can be used as a guide, which suggests ""interesting"" viewpoints for further exploration. Domain knowledge is incorporated into the algorithm via an importance transfer function or volume. This allows users to obtain view selection behaviors tailored to their specific situations. We generate a view space partitioning, and select one representative view for each partition. Together, this set of views encapsulates the ""interesting"" and distinct views of the data. Viewpoints in this set can be used as starting points for interactive exploration of the data, thus reducing the human effort in visualization. In non-interactive situations, such a set can be used as a representative visualization of the dataset from all directions.",Udeepta Bordoloi;Han-Wei Shen,U.D. Bordoloi;H.-W. Shen,"Ohio State Univ., Columbus, OH, USA;Ohio State Univ., Columbus, OH, USA",10.1109/VISUAL.2000.885694;10.1109/VISUAL.2003.1250386;10.1109/VISUAL.2005.1532834;10.1109/VISUAL.2001.964516,"viewpoint selection, view space partitioning, volume rendering, entropy, visibility",136,47,22,
Vis,2001,Dynamic Shadow Removal from Front Projection Displays,10.1109/VISUAL.2001.964509,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2001.964509,175,182,C,"Front-projection display environments suffer from a fundamental problem: users and other objects in the environment can easily and inadvertently block projectors, creating shadows on the displayed image. We introduce a technique that detects and corrects transient shadows in a multi-projector display. Our approach is to minimize the difference between predicted (generated) and observed (camera) images by continuous modification of the projected image values for each display device. We speculate that the general predictive monitoring framework introduced here is capable of addressing more general radiometric consistency problems. Using an automatically-derived relative position of cameras and projectors in the display environment and a straightforward color correction scheme, the system renders an expected image for each camera location. Cameras observe the displayed image, which is compared with the expected image to detect shadowed regions. These regions are transformed to the appropriate projector frames, where corresponding pixel values are increased. In display regions where more than one projector contributes to the image, shadow regions are eliminated. We demonstrate an implementation of the technique in a multiprojector system.",Christopher O. Jaynes;Stephen B. Webb;R. Matt Steele;Michael S. Brown;W. Brent Seales,C. Jaynes;S. Webb;R.M. Steele;M. Brown;W.B. Seales,"Dept. of Comput. Sci., Kentucky Univ., Lexington, KY, USA;Dept. of Comput. Sci., Kentucky Univ., Lexington, KY, USA;Dept. of Comput. Sci., Kentucky Univ., Lexington, KY, USA;Dept. of Comput. Sci., Kentucky Univ., Lexington, KY, USA;Dept. of Comput. Sci., Kentucky Univ., Lexington, KY, USA",10.1109/VISUAL.1999.809883;10.1109/VISUAL.1999.809890;10.1109/VISUAL.2000.885684;10.1109/VISUAL.2000.885685;10.1109/VISUAL.2000.885712,"Large-scale display, shadow removal, immersive media, calibration",134,14,26,
InfoVis,2003,Thread Arcs: an email thread visualization,10.1109/INFVIS.2003.1249028,http://dx.doi.org/10.1109/INFVIS.2003.1249028,211,218,C,"This paper describes Thread Arcs, a novel interactive visualization technique designed to help people use threads found in email. Thread Arcs combine the chronology of messages with the branching tree structure of a conversational thread in a mixed-model visualization by Venolia and Neustaedter (2003) that is stable and compact. By quickly scanning and interacting with Thread Arcs, people can see various attributes of conversations and find relevant messages in them easily. We tested this technique against other visualization techniques with users' own email in a functional prototype email client. Thread Arcs proved an excellent match for the types of threads found in users' email for the qualities users wanted in small-scale visualizations.",Bernard Kerr,B. Kerr,,10.1109/INFVIS.2002.1173155;10.1109/INFVIS.2001.963290,"conversations, discussions, electronic mail, email, information visualization, threads, tree structures, user interfaces",134,36,11,
Vis,1999,Visualizing Multivalued Data from 2D Incompressible Flows Using Concepts from Painting,10.1109/VISUAL.1999.809905,http://dx.doi.org/10.1109/VISUAL.1999.809905,333,540,C,"We present a new visualization method for 2D flows which allows us to combine multiple data values in an image for simultaneous viewing. We utilize concepts from oil painting, art and design as introduced in (Laidlaw et al., 1998) to examine problems within fluid mechanics. We use a combination of discrete and continuous visual elements arranged in multiple layers to visually represent the data. The representations are inspired by the brush strokes artists apply in layers to create an oil painting. We display commonly visualized quantities such as velocity and vorticity together with three additional mathematically derived quantities: the rate of strain tensor, and the turbulent charge and turbulent current. We describe the motivation for simultaneously examining these quantities and use the motivation to guide our choice of visual representation for each particular quantity. We present visualizations of three flow examples and observations concerning some of the physical relationships made apparent by the simultaneous display technique that we employed.",Robert Michael Kirby;H. Marmanis;David H. Laidlaw,R.M. Kirby;H. Marmanis;D.H. Laidlaw,"Div. of Appl. Math., Brown Univ., Providence, RI, USA",10.1109/VISUAL.1998.745294,,133,32,31,
Vis,1998,TOPIC ISLANDS TM - a wavelet-based text visualization system,10.1109/VISUAL.1998.745302,http://dx.doi.org/10.1109/VISUAL.1998.745302,189,196,C,"We present a novel approach to visualize and explore unstructured text. The underlying technology, called TOPIC-O-GRAPHY/sup TM/, applies wavelet transforms to a custom digital signal constructed from words within a document. The resultant multiresolution wavelet energy is used to analyze the characteristics of the narrative flow in the frequency domain, such as theme changes, which is then related to the overall thematic content of the text document using statistical methods. The thematic characteristics of a document can be analyzed at varying degrees of detail, ranging from section-sized text partitions to partitions consisting of a few words. Using this technology, we are developing a visualization system prototype known as TOPIC ISLANDS to browse a document, generate fuzzy document outlines, summarize text by levels of detail and according to user interests, define meaningful subdocuments, query text content, and provide summaries of topic evolution.",Nancy E. Miller;Pak Chung Wong;Mary Brewster;Harlan Foote,N.E. Miller;P.C. Wong;M. Brewster;H. Foote,"Pacific Northwest Lab., Richland, WA, USA",10.1109/VISUAL.1997.663872;10.1109/INFVIS.1995.528686;10.1109/VISUAL.1996.567800;10.1109/VISUAL.1997.663871;10.1109/VISUAL.1995.480811;10.1109/VISUAL.1994.346333;10.1109/VISUAL.1994.346332;10.1109/VISUAL.1992.235206,"text visualization, information visualization,wavelet transform, information retrieval",132,31,24,
Vis,2007,Efficient Computation and Visualization of Coherent Structures in Fluid Flow Applications,10.1109/TVCG.2007.70551,http://dx.doi.org/10.1109/TVCG.2007.70551,1464,1471,J,"The recently introduced notion of Finite-Time Lyapunov Exponent to characterize Coherent Lagrangian Structures provides a powerful framework for the visualization and analysis of complex technical flows. Its definition is simple and intuitive, and it has a deep theoretical foundation. While the application of this approach seems straightforward in theory, the associated computational cost is essentially prohibitive. Due to the Lagrangian nature of this technique, a huge number of particle paths must be computed to fill the space-time flow domain. In this paper, we propose a novel scheme for the adaptive computation of FTLE fields in two and three dimensions that significantly reduces the number of required particle paths. Furthermore, for three-dimensional flows, we show on several examples that meaningful results can be obtained by restricting the analysis to a well-chosen plane intersecting the flow domain. Finally, we examine some of the visualization aspects of FTLE-based methods and introduce several new variations that help in the analysis of specific aspects of a flow.",Christoph Garth;Florian Gerhardt;Xavier Tricoche;Hans Hagen,Christoph Garth;Florian Gerhardt;Xavier Tricoche;Hagen Hans,"University of Kaiserslautern, Germany, and the Institute for Data Analysis and Visualization at University of California, Davis,;University of Kaiserslautern, Germany;SCI Institute, University of Utah, and Purdue University;University of Kaiserslautern, Germany",10.1109/VISUAL.2004.113,"flow visualization, feature detection, 3D vector field visualization",132,121,23,
Vis,2008,Size-based Transfer Functions: A New Volume Exploration Technique,10.1109/TVCG.2008.162,http://dx.doi.org/10.1109/TVCG.2008.162,1380,1387,J,"The visualization of complex 3D images remains a challenge, a fact that is magnified by the difficulty to classify or segment volume data. In this paper, we introduce size-based transfer functions, which map the local scale of features to color and opacity. Features in a data set with similar or identical scalar values can be classified based on their relative size. We achieve this with the use of scale fields, which are 3D fields that represent the relative size of the local feature at each voxel. We present a mechanism for obtaining these scale fields at interactive rates, through a continuous scale-space analysis and a set of detection filters. Through a number of examples, we show that size-based transfer functions can improve classification and enhance volume rendering techniques, such as maximum intensity projection. The ability to classify objects based on local size at interactive rates proves to be a powerful method for complex data exploration.",Carlos D. Correa;Kwan-Liu Ma,Carlos Correa;Kwan-Liu Ma,University of California at Davis;University of California at Davis,10.1109/VISUAL.2003.1250414;10.1109/VISUAL.1999.809932;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2001.964519;10.1109/VISUAL.2004.64;10.1109/VISUAL.2003.1250413;10.1109/VISUAL.1995.480812;10.1109/VISUAL.2003.1250369;10.1109/VISUAL.2005.1532817,"Transfer Functions, Interactive Visualization, Volume Rendering, Scale Space, GPU Techniques",132,110,33,
InfoVis,2010,How Information Visualization Novices Construct Visualizations,10.1109/TVCG.2010.164,http://dx.doi.org/10.1109/TVCG.2010.164,943,952,J,"It remains challenging for information visualization novices to rapidly construct visualizations during exploratory data analysis. We conducted an exploratory laboratory study in which information visualization novices explored fictitious sales data by communicating visualization specifications to a human mediator, who rapidly constructed the visualizations using commercial visualization software. We found that three activities were central to the iterative visualization construction process: data attribute selection, visual template selection, and visual mapping specification. The major barriers faced by the participants were translating questions into data attributes, designing visual mappings, and interpreting the visualizations. Partial specification was common, and the participants used simple heuristics and preferred visualizations they were already familiar with, such as bar, line and pie charts. We derived abstract models from our observations that describe barriers in the data exploration process and uncovered how information visualization novices think about visualization specifications. Our findings support the need for tools that suggest potential visualizations and support iterative refinement, that provide explanations and help with learning, and that are tightly integrated into tool support for the overall visual analytics process.",Lars Grammel;Melanie Tory;Margaret-Anne D. Storey,Lars Grammel;Melanie Tory;Margaret-Anne Storey,University of Victoria;University of Victoria;University of Victoria,10.1109/TVCG.2007.70515;10.1109/TVCG.2006.163;10.1109/TVCG.2007.70541;10.1109/VAST.2009.5333878;10.1109/TVCG.2008.109;10.1109/VAST.2006.261428;10.1109/TVCG.2007.70577;10.1109/VAST.2008.4677358;10.1109/VAST.2008.4677365;10.1109/TVCG.2007.70535;10.1109/INFVIS.2005.1532136;10.1109/INFVIS.1998.729560;10.1109/TVCG.2007.70594;10.1109/INFVIS.2000.885086;10.1109/INFVIS.2001.963289;10.1109/INFVIS.2000.885092;10.1109/TVCG.2008.137,"Empirical study, visualization, visualization construction, visual analytics, visual mapping, novices",132,80,40,
InfoVis,2004,Uncovering Clusters in Crowded Parallel Coordinates Visualizations,10.1109/INFVIS.2004.68,http://dx.doi.org/10.1109/INFVIS.2004.68,81,88,C,"The one-to-one strategy of mapping each single data item into a graphical marker adopted in many visualization techniques has limited usefulness when the number of records and/or the dimensionality of the data set are very high. In this situation, the strong overlapping of graphical markers severely hampers the user's ability to identify patterns in the data from its visual representation. We tackle this problem here with a strategy that computes frequency or density information from the data set, and uses such information in parallel coordinates visualizations to filter out the information to be presented to the user, thus reducing visual clutter and allowing the analyst to observe relevant patterns in the data. The algorithms to construct such visualizations, and the interaction mechanisms supported, inspired by traditional image processing techniques such as grayscale manipulation and thresholding are also presented. We also illustrate how such algorithms can assist users to effectively identify clusters in very noisy large data sets",Almir Olivette Artero;Maria Cristina Ferreira de Oliveira;Haim Levkowitz,A.O. Artero;M.C.F. de Oliveira;H. Levkowitz,University of São Paulo,10.1109/VISUAL.1994.346302,"information visualization, visual clustering, density-based visualization, visual data mining",130,70,17,
InfoVis,2003,"Interactive hierarchical dimension ordering, spacing and filtering for exploration of high dimensional datasets",10.1109/INFVIS.2003.1249015,http://dx.doi.org/10.1109/INFVIS.2003.1249015,105,112,C,"Large number of dimensions not only cause clutter in multi-dimensional visualizations, but also make it difficult for users to navigate the data space. Effective dimension management, such as dimension ordering, spacing and filtering, is critical for visual exploration of such datasets. Dimension ordering and spacing explicitly reveal dimension relationships in arrangement-sensitive multidimensional visualization techniques, such as parallel coordinates, star glyphs, and pixel-oriented techniques. They facilitate the visual discovery of patterns within the data. Dimension filtering hides some of the dimensions to reduce clutter while preserving the major information of the dataset. In this paper, we propose an interactive hierarchical dimension ordering, spacing and filtering approach, called DOSFA. DOSFA is based on dimension hierarchies derived from similarities among dimensions. It is scalable multi-resolution approach making dimensional management a tractable task. On the one hand, it automatically generates default settings for dimension ordering, spacing and filtering. On the other hand, it allows users to efficiently control all aspects of this dimension management process via visual interaction tools for dimension hierarchy manipulation. A case study visualizing a dataset containing over 200 dimensions reveals high dimensional visualization techniques.",Jing Yang 0001;Wei Peng;Matthew O. Ward;Elke A. Rundensteiner,Jing Yang;Wei Peng;M.O. Ward;E.A. Rundensteiner,"Dept. of comuter Sci., Worcester Polytech. Inst., MA, USA;Dept. of comuter Sci., Worcester Polytech. Inst., MA, USA;Dept. of comuter Sci., Worcester Polytech. Inst., MA, USA;Dept. of comuter Sci., Worcester Polytech. Inst., MA, USA",10.1109/VISUAL.1990.146386;10.1109/VISUAL.1990.146402;10.1109/INFVIS.1998.729559;10.1109/VISUAL.1994.346302;10.1109/INFVIS.2000.885086;10.1109/VISUAL.1995.485140;10.1109/INFVIS.2002.1173151,"Dimension ordering, dimension spacing, dimension filtering, multidimensional visualization, high dimensional datasets",128,20,24,
InfoVis,2010,SparkClouds: Visualizing Trends in Tag Clouds,10.1109/TVCG.2010.194,http://dx.doi.org/10.1109/TVCG.2010.194,1182,1189,J,"Tag clouds have proliferated over the web over the last decade. They provide a visual summary of a collection of texts by visually depicting the tag frequency by font size. In use, tag clouds can evolve as the associated data source changes over time. Interesting discussions around tag clouds often include a series of tag clouds and consider how they evolve over time. However, since tag clouds do not explicitly represent trends or support comparisons, the cognitive demands placed on the person for perceiving trends in multiple tag clouds are high. In this paper, we introduce SparkClouds, which integrate sparklines into a tag cloud to convey trends between multiple tag clouds. We present results from a controlled study that compares SparkClouds with two traditional trend visualizations-multiple line graphs and stacked bar charts-as well as Parallel Tag Clouds. Results show that SparkClouds' ability to show trends compares favourably to the alternative visualizations.",Bongshin Lee;Nathalie Henry Riche;Amy K. Karlson;Sheelagh Carpendale,Bongshin Lee;Nathalie Henry Riche;Amy K. Karlson;Sheelash Carpendale,Microsoft Research;Microsoft Research;Microsoft Research;University of Calgary,10.1109/TVCG.2009.171;10.1109/INFVIS.2005.1532122;10.1109/TVCG.2007.70589,"Tag clouds, trend visualization, multiple line graphs, stacked bar charts, evaluation",128,87,29,
SciVis,2013,A Systematic Review on the Practice of Evaluating Visualization,10.1109/TVCG.2013.126,http://dx.doi.org/10.1109/TVCG.2013.126,2818,2827,J,"We present an assessment of the state and historic development of evaluation practices as reported in papers published at the IEEE Visualization conference. Our goal is to reflect on a meta-level about evaluation in our community through a systematic understanding of the characteristics and goals of presented evaluations. For this purpose we conducted a systematic review of ten years of evaluations in the published papers using and extending a coding scheme previously established by Lam et al. [2012]. The results of our review include an overview of the most common evaluation goals in the community, how they evolved over time, and how they contrast or align to those of the IEEE Information Visualization conference. In particular, we found that evaluations specific to assessing resulting images and algorithm performance are the most prevalent (with consistently 80-90% of all papers since 1997). However, especially over the last six years there is a steady increase in evaluation methods that include participants, either by evaluating their performances and subjective feedback or by evaluating their work practices and their improved analysis and reasoning capabilities using visual tools. Up to 2010, this trend in the IEEE Visualization conference was much more pronounced than in the IEEE Information Visualization conference which only showed an increasing percentage of evaluation through user performance and experience testing. Since 2011, however, also papers in IEEE Information Visualization show such an increase of evaluations of work practices and analysis as well as reasoning using visual tools. Further, we found that generally the studies reporting requirements analyses and domain-specific work practices are too informally reported which hinders cross-comparison and lowers external validity.",Tobias Isenberg 0001;Petra Isenberg;Jian Chen;Michael Sedlmair;Torsten Möller,Tobias Isenberg;Petra Isenberg;Jian Chen;Michael Sedlmair;Torsten Möller,INRIA;INRIA;University of Maryland;University of Vienna;University of Vienna,10.1109/TVCG.2009.121;10.1109/VISUAL.2005.1532781;10.1109/TVCG.2006.143;10.1109/TVCG.2011.224;10.1109/TVCG.2010.199;10.1109/TVCG.2010.223;10.1109/TVCG.2012.213;10.1109/TVCG.2010.134;10.1109/TVCG.2009.194;10.1109/TVCG.2011.174;10.1109/TVCG.2009.111;10.1109/TVCG.2011.206;10.1109/TVCG.2012.234;10.1109/TVCG.2012.292;10.1109/TVCG.2008.128;10.1109/TVCG.2009.167;10.1109/TVCG.2012.223,"Evaluation, validation, systematic review, visualization, scientific visualization, information visualization",128,135,74,
Vis,1998,Visualizing diffusion tensor images of the mouse spinal cord,10.1109/VISUAL.1998.745294,http://dx.doi.org/10.1109/VISUAL.1998.745294,127,134,C,"Within biological systems, water molecules undergo continuous stochastic Brownian motion. The diffusion rate can give clues to the structure of the underlying tissues. In some tissues, the rate is anisotropic. Diffusion-rate images can be calculated from diffusion-weighted MRI. A 2D diffusion tensor image (DTI) and an associated anatomical scalar field define seven values at each spatial location. We present two new methods for visually representing DTIs. The first method displays an array of ellipsoids, where the shape of each ellipsoid represents one tensor value. The ellipsoids are all normalized to approximately the same size so that they can be displayed simultaneously in context. The second method uses concepts from oil painting to represent the seven-valued data with multiple layers of varying brush strokes. Both methods successfully display most or all of the information in DTIs and provide exploratory methods for understanding them. The ellipsoid method has a simpler interpretation and explanation than the painting-motivated method; the painting-motivated method displays more of the information and is easier to read quantatively. We demonstrate the methods on images of the mouse spinal cord. The visualizations show significant differences between spinal cords from mice suffering from experimental allergic encephalomyelitis and spinal cords from wild-type mice. The differences are consistent with differences shown histologically and suggest that our new non-invasive imaging methodology and visualization of the results could have early diagnostic value for neurodegenerative diseases.",David H. Laidlaw;Eric T. Ahrens;David Kremers;Matthew J. Avalos;Russell E. Jacobs;Carol Readhead,D.H. Laidlaw;E.T. Ahrens;D. Kremers;M.J. Avalos;R.E. Jacobs;C. Readhead,"California Inst. of Technol., Pasadena, CA, USA",10.1109/VISUAL.1992.235201,"multi-valued visualization, tensor field visualization,oil painting",127,64,26,
InfoVis,2013,LineUp: Visual Analysis of Multi-Attribute Rankings,10.1109/TVCG.2013.173,http://dx.doi.org/10.1109/TVCG.2013.173,2277,2286,J,"Rankings are a popular and universal approach to structuring otherwise unorganized collections of items by computing a rank for each item based on the value of one or more of its attributes. This allows us, for example, to prioritize tasks or to evaluate the performance of products relative to each other. While the visualization of a ranking itself is straightforward, its interpretation is not, because the rank of an item represents only a summary of a potentially complicated relationship between its attributes and those of the other items. It is also common that alternative rankings exist which need to be compared and analyzed to gain insight into how multiple heterogeneous attributes affect the rankings. Advanced visual exploration tools are needed to make this process efficient. In this paper we present a comprehensive analysis of requirements for the visualization of multi-attribute rankings. Based on these considerations, we propose LineUp - a novel and scalable visualization technique that uses bar charts. This interactive technique supports the ranking of items based on multiple heterogeneous attributes with different scales and semantics. It enables users to interactively combine attributes and flexibly refine parameters to explore the effect of changes in the attribute combination. This process can be employed to derive actionable insights as to which attributes of an item need to be modified in order for its rank to change. Additionally, through integration of slope graphs, LineUp can also be used to compare multiple alternative rankings on the same set of items, for example, over time or across different attribute combinations. We evaluate the effectiveness of the proposed multi-attribute visualization technique in a qualitative study. The study shows that users are able to successfully solve complex ranking tasks in a short period of time.",Samuel Gratzl;Alexander Lex;Nils Gehlenborg;Hanspeter Pfister;Marc Streit,Samuel Gratzl;Alexander Lex;Nils Gehlenborg;Hanspeter Pfister;Marc Streit,Johannes Kepler University Linz;Johannes Kepler University Linz;Harvard University;Harvard University;Harvard Medical School,10.1109/TVCG.2012.253;10.1109/TVCG.2008.166;10.1109/VISUAL.1996.568118;10.1109/TVCG.2008.181;10.1109/TVCG.2007.70539,"Ranking visualization, ranking, scoring, multi-attribute, multifactorial, multi-faceted, stacked bar charts",127,107,36,BP
VAST,2013,UTOPIAN: User-Driven Topic Modeling Based on Interactive Nonnegative Matrix Factorization,10.1109/TVCG.2013.212,http://dx.doi.org/10.1109/TVCG.2013.212,1992,2001,J,"Topic modeling has been widely used for analyzing text document collections. Recently, there have been significant advancements in various topic modeling techniques, particularly in the form of probabilistic graphical modeling. State-of-the-art techniques such as Latent Dirichlet Allocation (LDA) have been successfully applied in visual text analytics. However, most of the widely-used methods based on probabilistic modeling have drawbacks in terms of consistency from multiple runs and empirical convergence. Furthermore, due to the complicatedness in the formulation and the algorithm, LDA cannot easily incorporate various types of user feedback. To tackle this problem, we propose a reliable and flexible visual analytics system for topic modeling called UTOPIAN (User-driven Topic modeling based on Interactive Nonnegative Matrix Factorization). Centered around its semi-supervised formulation, UTOPIAN enables users to interact with the topic modeling method and steer the result in a user-driven manner. We demonstrate the capability of UTOPIAN via several usage scenarios with real-world document corpuses such as InfoVis/VAST paper data set and product review data sets.",Jaegul Choo;Changhyun Lee;Chandan K. Reddy;Haesun Park,Jaegul Choo;Changhyun Lee;Chandan K. Reddy;Haesun Park,Georgia Institute of Technology;Georgia Institute of Technology;Wayne State University;Georgia Institute of Technology,10.1109/TVCG.2012.258;10.1109/VAST.2009.5332629;10.1109/TVCG.2011.239;10.1109/VAST.2011.6102461;10.1109/VAST.2012.6400485;10.1109/VAST.2007.4388999;10.1109/VAST.2007.4389006;10.1109/TVCG.2008.138;10.1109/VAST.2010.5652443,"Latent Dirichlet allocation, nonnegative matrix factorization, topic modeling, visual analytics, interactive clustering, text analytics",126,116,36,
Vis,1998,Interactive out-of-core isosurface extraction,10.1109/VISUAL.1998.745299,http://dx.doi.org/10.1109/VISUAL.1998.745299,167,174,C,"We present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space requirements on the visualization workstation, while speeding up isosurface extraction queries. Our overall approach is a two-level indexing scheme. First, by our meta-cell technique, we partition the original dataset into clusters of cells, called meta-cells. Secondly, we produce meta-intervals associated with the meta-cells, and build an indexing data structure on the meta-intervals. We separate the cell information, kept only in meta-cells on disk, from the indexing structure, which is also on disk and only contains pointers to meta-cells. Our meta-cell technique is an I/O-efficient approach for computing a k-d-tree-like partition of the dataset. Our indexing data structure, the binary blocked I/O interval tree, is a new I/O-optimal data structure to perform stabbing queries that report from a set of meta-intervals (or intervals) those containing a query value q. Our tree is simpler to implement, and is also more space-efficient in practice than existing structures. To perform an isosurface query, we first query the indexing structure, and then use the reported meta-cell pointers to read from disk the active meta-cells intersected by the isosurface. The isosurface itself can then be generated from active meta-cells. Rather than being a single cost indexing approach, our technique exhibits a smooth trade-off between query time and disk space.",Yi-Jen Chiang;Cláudio T. Silva;William J. Schroeder,Y.-J. Chiang;C.T. Silva;W.J. Schroeder,,10.1109/VISUAL.1997.663888;10.1109/VISUAL.1997.663895;10.1109/VISUAL.1996.568121,"Isosurface Extraction, Marching Cubes, Out-Of-Core Computation, Interval Tree, Scientific Visualization",125,48,28,
InfoVis,1999,Visualizing association rules for text mining,10.1109/INFVIS.1999.801866,http://dx.doi.org/10.1109/INFVIS.1999.801866,120,"123, 152",C,"An association rule in data mining is an implication of the form X/spl rarr/Y where X is a set of antecedent items and Y is the consequent item. For years researchers have developed many tools to visualize association rules. However, few of these tools can handle more than dozens of rules, and none of them can effectively manage rules with multiple antecedents. Thus, it is extremely difficult to visualize and understand the association information of a large data set even when all the rules are available. This paper presents a novel visualization technique to tackle many of these problems. We apply the technology to a text mining study on large corpora. The results indicate that our design can easily handle hundreds of multiple antecedent association rules in a three-dimensional display with minimum human interaction, low occlusion percentage, and no screen swapping.",Pak Chung Wong;Paul Whitney;James J. Thomas,Pak Chung Wong;P. Whitney;J. Thomas,"Pacific Northwest Lab., Richland, WA, USA",10.1109/INFVIS.1998.729565;10.1109/VISUAL.1998.745302;10.1109/INFVIS.1998.729570;10.1109/INFVIS.1995.528686;10.1109/INFVIS.1997.636791,,125,26,18,
Vis,2003,Saddle connectors - an approach to visualizing the topological skeleton of complex 3D vector fields,10.1109/VISUAL.2003.1250376,http://dx.doi.org/10.1109/VISUAL.2003.1250376,225,232,C,"One of the reasons that topological methods have a limited popularity for the visualization of complex 3D flow fields is the fact that such topological structures contain a number of separating stream surfaces. Since these stream surfaces tend to hide each other as well as other topological features, for complex 3D topologies the visualizations become cluttered and hardly interpretable. This paper proposes to use particular stream lines called saddle connectors instead of separating stream surfaces and to depict single surfaces only on user demand. We discuss properties and computational issues of saddle connectors and apply these methods to complex flow data. We show that the use of saddle connectors makes topological skeletons available as a valuable visualization tool even for topologically complex 3D flow data.",Holger Theisel;Tino Weinkauf;Hans-Christian Hege;Hans-Peter Seidel,H. Theisel;T. Weinkauf;H.-C. Hege;H.-P. Seidel,"MPI Informatik Saarbrucken, Germany",10.1109/VISUAL.2000.885714;10.1109/VISUAL.1999.809874;10.1109/VISUAL.1998.745284;10.1109/VISUAL.1998.745291;10.1109/VISUAL.1999.809907;10.1109/VISUAL.1992.235211;10.1109/VISUAL.1993.398875;10.1109/VISUAL.2001.964506;10.1109/VISUAL.2000.885716;10.1109/VISUAL.2001.964507,"3D flow visualization, vector field topology, critical points, separatrices",125,59,37,
Vis,2003,Hardware-based ray casting for tetrahedral meshes,10.1109/VISUAL.2003.1250390,http://dx.doi.org/10.1109/VISUAL.2003.1250390,333,340,C,"We present the first implementation of a volume ray casting algorithm for tetrahedral meshes running on off-the-shelf programmable graphics hardware. Our implementation avoids the memory transfer bottleneck of the graphics bus since the complete mesh data is stored in the local memory of the graphics adapter and all computations, in particular ray traversal and ray integration, are performed by the graphics processing unit. Analogously to other ray casting algorithms, our algorithm does not require an expensive cell sorting. Provided that the graphics adapter offers enough texture memory, our implementation performs comparable to the fastest published volume rendering algorithms for unstructured meshes. Our approach works with cyclic and/or non-convex meshes and supports early ray termination. Accurate ray integration is guaranteed by applying pre-integrated volume rendering. In order to achieve almost interactive modifications of transfer functions, we propose a new method for computing three-dimensional pre-integration tables.",Manfred Weiler;Martin Kraus;Markus Merz;Thomas Ertl,M. Weiler;M. Kraus;M. Merz;T. Ertl,"Visualization & Interactive Syst. Group, Univ. of Stutgart, Germany;Visualization & Interactive Syst. Group, Univ. of Stutgart, Germany;Visualization & Interactive Syst. Group, Univ. of Stutgart, Germany;Visualization & Interactive Syst. Group, Univ. of Stutgart, Germany",10.1109/VISUAL.2000.885683,"ray casting, pixel shading, programmable graphics hardware, cell projection, tetrahedral meshes, unstructured meshes, volume visualization, pre-integrated volume rendering",125,48,14,
Vis,2005,Evaluation of fiber clustering methods for diffusion tensor imaging,10.1109/VISUAL.2005.1532779,http://dx.doi.org/10.1109/VISUAL.2005.1532779,65,72,C,"Fiber tracking is a standard approach for the visualization of the results of diffusion tensor imaging (DTI). If fibers are reconstructed and visualized individually through the complete white matter, the display gets easily cluttered making it difficult to get insight in the data. Various clustering techniques have been proposed to automatically obtain bundles that should represent anatomical structures, but it is unclear which clustering methods and parameter settings give the best results. We propose a framework to validate clustering methods for white-matter fibers. Clusters are compared with a manual classification which is used as a ground truth. For the quantitative evaluation of the methods, we developed a new measure to assess the difference between the ground truth and the clusterings. The measure was validated and calibrated by presenting different clusterings to physicians and asking them for their judgement. We found that the values of our new measure for different clusterings match well with the opinions of physicians. Using this framework, we have evaluated different clustering algorithms, including shared nearest neighbor clustering, which has not been used before for this purpose. We found that the use of hierarchical clustering using single-link and a fiber similarity measure based on the mean distance between fibers gave the best results.",Bart Moberts;Anna Vilanova;Jarke J. van Wijk,B. Moberts;A. Vilanova;J.J. van Wijk,"Dept. of Math. & Comput. Sci., Technische Univ. Eindhoven, Netherlands",10.1109/VISUAL.2001.964549,"Diffusion Tensor Imaging, Fiber tracking, Clustering,Clustering Validation, External Indices",125,54,16,
Vis,2000,Semi-regular mesh extraction from volumes,10.1109/VISUAL.2000.885705,http://dx.doi.org/10.1109/VISUAL.2000.885705,275,282,C,"We present a novel method to extract iso-surfaces from distance volumes. It generates high quality semi-regular multiresolution meshes of arbitrary topology. Our technique proceeds in two stages. First, a very coarse mesh with guaranteed topology is extracted. Subsequently an iterative multi-scale force-based solver refines the initial mesh into a semi-regular mesh with geometrically adaptive sampling rate and good aspect ratio triangles. The coarse mesh extraction is performed using a new approach we call surface wavefront propagation. A set of discrete iso-distance ribbons are rapidly built and connected while respecting the topology of the iso-surface implied by the data. Subsequent multi-scale refinement is driven by a simple force-based solver designed to combine good iso-surface fit and high quality sampling through reparameterization. In contrast to the Marching Cubes technique our output meshes adapt gracefully to the iso-surface geometry, have a natural multiresolution structure and good aspect ratio triangles, as demonstrated with a number of examples.",Zoë J. Wood;Peter Schröder;David E. Breen;Mathieu Desbrun,Z.J. Wood;M. Desbrun;P. Schroder;D. Breen,"California Inst. of Technol., Pasadena, CA, USA",10.1109/VISUAL.2000.885703,"Semi-regular meshes, subdivision, volumes, surface extraction, implicit functions, level set methods",124,51,55,
InfoVis,2005,Interactive Sankey diagrams,10.1109/INFVIS.2005.1532152,http://dx.doi.org/10.1109/INFVIS.2005.1532152,233,240,C,"We present a system that allows users to interactively explore complex flow scenarios represented as Sankey diagrams. Our system provides an overview of the flow graph and allows users to zoom in and explore details on demand. The support for quantitative flow tracing across the flow graph as well as representations at different levels of detail facilitate the understanding of complex flow situations. The energy flow in a city serves as a sample scenario for our system. Different forms of energy are distributed within the city and they are transformed into heat, electricity, or other forms of energy. These processes are visualized and interactively explored. In addition our system can be used as a planning tool for the exploration of alternative scenarios by interactively manipulating different parameters in the energy flow network.",Patrick Riehmann;Manfred Hanfler;Bernd Fröhlich 0001,P. Riehmann;M. Hanfler;B. Froehlich,"Fac. of Media, Bauhaus Univ. Weimar, Germany;Fac. of Media, Bauhaus Univ. Weimar, Germany;Fac. of Media, Bauhaus Univ. Weimar, Germany",10.1109/VISUAL.1993.398870;10.1109/INFVIS.1996.559226,"Sankey diagram, flow diagram",124,50,21,
Vis,2007,Efficient Visualization of Lagrangian Coherent Structures by filtered AMR Ridge Extraction,10.1109/TVCG.2007.70554,http://dx.doi.org/10.1109/TVCG.2007.70554,1456,1463,J,"This paper presents a method for filtered ridge extraction based on adaptive mesh refinement. It is applicable in situations where the underlying scalar field can be refined during ridge extraction. This requirement is met by the concept of Lagrangian coherent structures which is based on trajectories started at arbitrary sampling grids that are independent of the underlying vector field. The Lagrangian coherent structures are extracted as ridges in finite Lyapunov exponent fields computed from these grids of trajectories. The method is applied to several variants of finite Lyapunov exponents, one of which is newly introduced. High computation time due to the high number of required trajectories is a main drawback when computing Lyapunov exponents of 3-dimensional vector fields. The presented method allows a substantial speed-up by avoiding the seeding of trajectories in regions where no ridges are present or do not satisfy the prescribed filter criteria such as a minimum finite Lyapunov exponent.",Filip Sadlo;Ronald Peikert,Filip Sadlo;Ronald Peikert,"ETH Zurich, Switzerland;ETH Zurich, Switzerland",10.1109/VISUAL.1999.809896;10.1109/VISUAL.2004.99,"Ridge extraction, flow visualization, coherent structures, vector field topology, unsteady vector fields",124,106,30,
Vis,2008,A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality,10.1109/TVCG.2008.110,http://dx.doi.org/10.1109/TVCG.2008.110,1619,1626,J,"The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, efficient computation of the MS complex for large scale data remains a challenging problem. We describe a new algorithm and easily extensible framework for computing MS complexes for large scale data of any dimension where scalar values are given at the vertices of a closure-finite and weak topology (CW) complex, therefore enabling computation on a wide variety of meshes such as regular grids, simplicial meshes, and adaptive multiresolution (AMR) meshes. A new divide-and-conquer strategy allows for memory-efficient computation of the MS complex and simplification on-the-fly to control the size of the output. In addition to being able to handle various data formats, the framework supports implementation-specific optimizations, for example, for regular data. We present the complete characterization of critical point cancellations in all dimensions. This technique enables the topology based analysis of large data on off-the-shelf computers. In particular we demonstrate the first full computation of the MS complex for a 1 billion/1024<sup>3</sup>node grid on a laptop computer with 2 Gb memory.",Attila Gyulassy;Peer-Timo Bremer;Bernd Hamann;Valerio Pascucci,Attila Gyulassy;Peer-Timo Bremer;Bernd Hamann;Valerio Pascucci,"Attila Gyulassy is with UC Davis and Lawrence Livermore National Laboratory, E-mail: aggyulassy@ucdavis.edu.;Peer-Timo Bremer is with Lawrence Livermore National Laboratory, E-mail: ptbremer@acm.org.;Bernd Hamann is with University of California, Davis, E-mail: hamann@cs.ucdavis.edu.;Valerio Pascucci is with University of Utah, E-mail: pascucci@acm.org.",10.1109/VISUAL.2005.1532839;10.1109/VISUAL.1998.745329;10.1109/VISUAL.2004.96;10.1109/TVCG.2007.70552;10.1109/VISUAL.1998.745312;10.1109/VISUAL.2000.885680;10.1109/VISUAL.2000.885703;10.1109/TVCG.2006.186,"Topology-based analysis, Morse-Smale complex, large scale data",124,103,33,
Vis,1993,Geometric optimization,10.1109/VISUAL.1993.398868,http://dx.doi.org/10.1109/VISUAL.1993.398868,189,195,C,"An algorithm is presented which describes an application independent method for reducing the number of polygonal primitives required to faithfully represent an object. Reducing polygon count without a corresponding reduction in object detail is important for: achieving interactive frame rates in scientific visualization, reducing mass storage requirements, and facilitating the transmission of large, multi-timestep geometric data sets. This paper shows how coplanar and nearly coplanar polygons can be merged into larger complex polygons and re-triangulated into fewer simple polygons than originally required. The notable contributions of this paper are: (1) a method for quickly grouping polygons into nearly coplanar sets, (2) a fast approach for merging coplanar polygon sets and, (3) a simple, robust triangulation method for polygons created by 1 and 2. The central idea of the algorithm is the notion of treating polygonal data as a collection of segments and removing redundant segments to quickly form polygon hulls which represent the merged coplanar sets.&lt;&lt;ETX&gt;&gt;",Paul A. Hinker;Charles D. Hansen,P. Hinker;C. Hansen,"Los Alamos Nat. Lab., NM, USA;Los Alamos Nat. Lab., NM, USA",10.1109/VISUAL.1992.235223,,123,40,8,
InfoVis,2010,OpinionSeer: Interactive Visualization of Hotel Customer Feedback,10.1109/TVCG.2010.183,http://dx.doi.org/10.1109/TVCG.2010.183,1109,1118,J,"The rapid development of Web technology has resulted in an increasing number of hotel customers sharing their opinions on the hotel services. Effective visual analysis of online customer opinions is needed, as it has a significant impact on building a successful business. In this paper, we present OpinionSeer, an interactive visualization system that could visually analyze a large collection of online hotel customer reviews. The system is built on a new visualization-centric opinion mining technique that considers uncertainty for faithfully modeling and analyzing customer opinions. A new visual representation is developed to convey customer opinions by augmenting well-established scatterplots and radial visualization. To provide multiple-level exploration, we introduce subjective logic to handle and organize subjective opinions with degrees of uncertainty. Several case studies illustrate the effectiveness and usefulness of OpinionSeer on analyzing relationships among multiple data dimensions and comparing opinions of different groups. Aside from data on hotel customer feedback, OpinionSeer could also be applied to visually analyze customer opinions on other products or services.",Yingcai Wu;Furu Wei;Shixia Liu;Norman Au;Weiwei Cui;Hong Zhou;Huamin Qu,Yingcai Wu;Furu Wei;Shixia Liu;Norman Au;Weiwei Cui;Hong Zhou;Huamin Qu,,10.1109/VAST.2006.261431;10.1109/TVCG.2009.171;10.1109/VAST.2009.5332611;10.1109/TVCG.2008.187;10.1109/VAST.2009.5333919;10.1109/INFVIS.2002.1173151,"opinion visualization, radial visualization, uncertainty visualization",123,91,31,
VAST,2016,Towards Better Analysis of Deep Convolutional Neural Networks,10.1109/TVCG.2016.2598831,http://dx.doi.org/10.1109/TVCG.2016.2598831,91,100,J,"Deep convolutional neural networks (CNNs) have achieved breakthrough performance in many pattern recognition tasks such as image classification. However, the development of high-quality deep models typically relies on a substantial amount of trial-and-error, as there is still no clear understanding of when and why a deep model works. In this paper, we present a visual analytics approach for better understanding, diagnosing, and refining deep CNNs. We formulate a deep CNN as a directed acyclic graph. Based on this formulation, a hybrid visualization is developed to disclose the multiple facets of each neuron and the interactions between them. In particular, we introduce a hierarchical rectangle packing algorithm and a matrix reordering algorithm to show the derived features of a neuron cluster. We also propose a biclustering-based edge bundling method to reduce visual clutter caused by a large number of connections between neurons. We evaluated our method on a set of CNNs and the results are generally favorable.",Mengchen Liu;Jiaxin Shi;Zhen Li;Chongxuan Li;Jun Zhu 0001;Shixia Liu,Mengchen Liu;Jiaxin Shi;Zhen Li;Chongxuan Li;Jun Zhu;Shixia Liu,"School of Software and TNListTsinghua University;Dept. of Comp. Sci. &#x0026; Tech., State Key Lab of Intell. Tech. &#x0026; Sys.TNList LabCBICR Center;School of Software and TNListTsinghua University;Dept. of Comp. Sci. &#x0026; Tech., State Key Lab of Intell. Tech. &#x0026; Sys.TNList LabCBICR Center;School of Software and TNListTsinghua University;School of Software and TNListTsinghua University",10.1109/TVCG.2015.2468151;10.1109/TVCG.2015.2467554;10.1109/TVCG.2015.2467813;10.1109/TVCG.2010.132;10.1109/TVCG.2008.135;10.1109/TVCG.2014.2346919;10.1109/TVCG.2011.239;10.1109/VISUAL.1991.175815;10.1109/VISUAL.2005.1532820;10.1109/TVCG.2007.70582;10.1109/TVCG.2014.2346433,Deep convolutional neural networks;rectangle packing;matrix reordering;edge bundling;biclustering,122,151,60,
Vis,1992,An architecture for a scientific visualization system,10.1109/VISUAL.1992.235219,http://dx.doi.org/10.1109/VISUAL.1992.235219,107,114,C,"The architecture of the Data Explorer, a scientific visualization system, is described. Data Explorer supports the visualization of a wide variety of data by means of a flexible set of visualization modules. A single powerful data model common to all modules allows a wide range of data types to be imported and passed between modules. There is integral support for parallelism, affecting the data model and the execution model. The visualization modules are highly interoperable, due in part to the common data model, and exemplified by the renderer. An execution model facilitates parallelization of modules and incorporates optimizations such as caching. The two-process client-server system structure consists of a user interface that communicates with an executive via a dataflow language.&lt;&lt;ETX&gt;&gt;",Bruce Lucas;G. D. Abrams;Nancy S. Collins;D. A. Epstien;Donna L. Gresh;Kevin P. McAuliffe,B. Lucas;G.D. Abram;N.S. Collins;D.A. Epstein;D.L. Gresh;K.P. McAuliffe,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.1990.146397;10.1109/VISUAL.1992.235204;10.1109/VISUAL.1991.175818;10.1109/VISUAL.1991.175833,,121,61,8,
Vis,1997,Repairing CAD models,10.1109/VISUAL.1997.663904,http://dx.doi.org/10.1109/VISUAL.1997.663904,363,370,C,"We describe an algorithm for repairing polyhedral CAD models that have errors in their B-REP. Errors like cracks, degeneracies, duplication, holes and overlaps are usually introduced in solid models due to imprecise arithmetic, model transformations, designer errors, programming bugs, etc. Such errors often hamper further processing such as finite element analysis, radiosity computation and rapid prototyping. Our fault-repair algorithm converts an unordered collection of polygons to a shared-vertex representation to help eliminate errors. This is done by choosing, for each polygon edge, the most appropriate edge to unify it with. The two edges are then geometrically merged into one, by moving vertices. At the end of this process, each polygon edge is either coincident with another or is a boundary edge for a polygonal hole or a dangling wall and may be appropriately repaired. Finally, in order to allow user-inspection of the automatic corrections, we produce a visualization of the repair and let the user mark the corrections that conflict with the original design intent. A second iteration of the correction algorithm then produces a repair that is commensurate with the intent. This, by involving the users in a feedback loop, we are able to refine the correction to their satisfaction.",Gill Barequet;Subodh Kumar 0001,G. Barequet;S. Kumar,"Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA",,,121,36,17,
Vis,2006,ClearView: An Interactive Context Preserving Hotspot Visualization Technique,10.1109/TVCG.2006.124,http://dx.doi.org/10.1109/TVCG.2006.124,941,948,J,"Volume rendered imagery often includes a barrage of 3D information like shape, appearance and topology of complex structures, and it thus quickly overwhelms the user. In particular, when focusing on a specific region a user cannot observe the relationship between various structures unless he has a mental picture of the entire data. In this paper we present ClearView, a GPU-based, interactive framework for texture-based volume ray-casting that allows users which do not have the visualization skills for this mental exercise to quickly obtain a picture of the data in a very intuitive and user-friendly way. ClearView is designed to enable the user to focus on particular areas in the data while preserving context information without visual clutter. ClearView does not require additional feature volumes as it derives any features in the data from image information only. A simple point-and-click interface enables the user to interactively highlight structures in the data. ClearView provides an easy to use interface to complex volumetric data as it only uses transparency in combination with a few specific shaders to convey focus and context information",Jens H. Krüger;Jens Schneider;Rüdiger Westermann,Jens Kruger;Jens Schneider;Rudiger Westermann,,10.1109/VISUAL.2000.885694;10.1109/VISUAL.2003.1250400;10.1109/VISUAL.1996.568110;10.1109/VISUAL.2002.1183762;10.1109/VISUAL.2002.1183777;10.1109/VISUAL.1999.809882;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2004.48;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2005.1532856;10.1109/VISUAL.2005.1532818,"Focus & Context, GPU rendering, volume raycasting",121,92,37,
InfoVis,2012,"Exploring Flow, Factors, and Outcomes of Temporal Event Sequences with the Outflow Visualization",10.1109/TVCG.2012.225,http://dx.doi.org/10.1109/TVCG.2012.225,2659,2668,J,"Event sequence data is common in many domains, ranging from electronic medical records (EMRs) to sports events. Moreover, such sequences often result in measurable outcomes (e.g., life or death, win or loss). Collections of event sequences can be aggregated together to form event progression pathways. These pathways can then be connected with outcomes to model how alternative chains of events may lead to different results. This paper describes the Outflow visualization technique, designed to (1) aggregate multiple event sequences, (2) display the aggregate pathways through different event states with timing and cardinality, (3) summarize the pathways' corresponding outcomes, and (4) allow users to explore external factors that correlate with specific pathway state transitions. Results from a user study with twelve participants show that users were able to learn how to use Outflow easily with limited training and perform a range of tasks both accurately and rapidly.",Krist Wongsuphasawat;David Gotz,Krist Wongsuphasawat;David Gotz,University of Maryland;IBM,10.1109/TVCG.2009.181;10.1109/VAST.2011.6102453;10.1109/TVCG.2006.192;10.1109/INFVIS.2005.1532150;10.1109/VAST.2009.5332595;10.1109/TVCG.2009.117;10.1109/INFVIS.2005.1532152;10.1109/VAST.2006.261421,"Outflow, information visualization, temporal event sequences, state diagram, state transition",121,110,35,
InfoVis,2003,Edgelens: an interactive method for managing edge congestion in graphs,10.1109/INFVIS.2003.1249008,http://dx.doi.org/10.1109/INFVIS.2003.1249008,51,58,C,"An increasing number of tasks require people to explore, navigate and search extremely complex data sets visualized as graphs. Examples include electrical and telecommunication networks, Web structures, and airline routes. The problem is that graphs of these real world data sets have many interconnected nodes, ultimately leading to edge congestion: the density of edges is so great that they obscure nodes, individual edges, and even the visual information beneath the graph. To address this problem we developed an interactive technique called EdgeLens. An EdgeLens interactively curves graph edges away for a person's focus attention without changing the node positions. This opens up sufficient space to disambiguate node and edge relationships and to see underlying information while still preserving node layout. Initially two methods of creating this interaction were developed and compared in a user study. The results of this study were used in the selection of a basic approach and the subsequent development of the EdgeLens. We then improved the EdgeLens through use of transparency and colour and by allowing multiple lenses to appear on the graph.",Nelson Wong;Sheelagh Carpendale;Saul Greenberg,N. Wong;S. Carpendale;S. Greenberg,"Dept. of Comput. Sci., Calgary Univ., Alta., Canada;Dept. of Comput. Sci., Calgary Univ., Alta., Canada;Dept. of Comput. Sci., Calgary Univ., Alta., Canada",10.1109/INFVIS.1997.636786;10.1109/INFVIS.1996.559214," Navigation, graph layout, distortion lens, information visualization, edge congestion, interactive visualization",120,51,22,
Vis,1993,Navigating large networks with hierarchies,10.1109/VISUAL.1993.398870,http://dx.doi.org/10.1109/VISUAL.1993.398870,204,210,C,"This paper is aimed at the exploratory visualization of networks where there is a strength or weight associated with each link, and makes use of any hierarchy present on the nodes to aid the investigation of large networks. It describes a method of placing nodes on the plane that gives meaning to their relative positions. The paper discusses how linking and interaction principles aid the user in the exploration. Two examples are given; one of electronic mail communication over eight months within a department, another concerned with changes to a large section of a computer program.&lt;&lt;ETX&gt;&gt;",Stephen G. Eick;Graham J. Wills,S.G. Eick;G.J. Wills,"AT&T Bell Lab., USA;AT&T Bell Lab., USA",10.1109/VISUAL.1990.146369;10.1109/VISUAL.1991.175815,,118,47,13,
InfoVis,2003,Visualizing evolving networks: minimum spanning trees versus pathfinder networks,10.1109/INFVIS.2003.1249010,http://dx.doi.org/10.1109/INFVIS.2003.1249010,67,74,C,"Network evolution is an ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such as small-world networks and scale-free networks. In this article, we address a practical issue concerning the visualizations of co-citation networks of scientific publications derived by two widely known link reduction algorithms, namely minimum spanning trees (MSTs) and pathfinder networks (PFNETs). Our primary goal is to identify the strengths and weaknesses of the two methods in fulfilling the need for visualizing evolving networks. Two criteria are derived for assessing visualizations of evolving networks in terms of topological properties and dynamical properties. We examine the animated visualization models of the evolution of botulinum toxin research in terms of its co-citation structure across a 58-year span (1945-2002). The results suggest that although high-degree nodes dominate the structure of MST models, such structures can be inadequate in depicting the essence of how the network evolves because MST removes potentially significant links from high-order shortest paths. In contrast, PFNET models clearly demonstrate their superiority in maintaining the cohesiveness of some of the most pivotal paths, which in turn make the growth animation more predictable and interpretable. We suggest that the design of visualization and modeling tools for network evolution should take the cohesiveness of critical paths into account.",Chaomei Chen;Steven A. Morris,Chaomei Chen;S. Morris,"Coll. of Inf. Sci. & Technol., Drexel Univ., Philadelphia, PA, USA",10.1109/INFVIS.2001.963285;10.1109/INFVIS.2002.1173160;10.1109/VISUAL.1999.809927,"Network evolution, network visualization, co-citation networks, Pathfinder networks, minimum spanning trees",118,15,44,
Vis,2003,Planet-sized batched dynamic adaptive meshes (P-BDAM),10.1109/VISUAL.2003.1250366,http://dx.doi.org/10.1109/VISUAL.2003.1250366,147,154,C,"We describe an efficient technique for out-of-core management and interactive rendering of planet sized textured terrain surfaces. The technique, called planet-sized batched dynamic adaptive meshes (P-BDAM), extends the BDAM approach by using as basic primitive a general triangulation of points on a displaced triangle. The proposed framework introduces several advances with respect to the state of the art: thanks to a batched host-to-graphics communication model, we outperform current adaptive tessellation solutions in terms of rendering speed; we guarantee overall geometric continuity, exploiting programmable graphics hardware to cope with the accuracy issues introduced by single precision floating points; we exploit a compressed out of core representation and speculative prefetching for hiding disk latency during rendering of out-of-core data; we efficiently construct high quality simplified representations with a novel distributed out of core simplification algorithm working on a standard PC network.",Paolo Cignoni;Fabio Ganovelli;Enrico Gobbetti;Fabio Marton;Federico Ponchio;Roberto Scopigno,P. Cignoni;F. Ganovelli;E. Gobbetti;F. Marton;F. Ponchio;R. Scopigno,"ISTI - CNR, Pisa, Italy;ISTI - CNR, Pisa, Italy",10.1109/VISUAL.1997.663860;10.1109/VISUAL.2002.1183783;10.1109/VISUAL.1997.663902;10.1109/VISUAL.1998.745282;10.1109/VISUAL.2000.885699;10.1109/VISUAL.2002.1183800;10.1109/VISUAL.1996.567600;10.1109/VISUAL.1998.745280;10.1109/VISUAL.1999.809902;10.1109/VISUAL.1996.568126," Multiresolution, terrains, huge dataset",118,38,33,
InfoVis,2005,Voronoi treemaps,10.1109/INFVIS.2005.1532128,http://dx.doi.org/10.1109/INFVIS.2005.1532128,49,56,C,"Treemaps are a well known method for the visualization of attributed hierarchical data. Previously proposed treemap layout algorithms are limited to rectangular shapes, which cause problems with the aspect ratio of the rectangles as well as with identifying the visualized hierarchical structure. The approach of Voronoi treemaps presented in this paper eliminates these problems through enabling subdivisions of and in polygons. Additionally, this allows for creating treemap visualizations within areas of arbitrary shape, such as triangles and circles, thereby enabling a more flexible adaptation of treemaps for a wider range of applications.",Michael Balzer;Oliver Deussen,M. Balzer;O. Deussen,"Dept. of Comput. & Inf. Sci., Konstanz Univ., Germany;Dept. of Comput. & Inf. Sci., Konstanz Univ., Germany",10.1109/INFVIS.2004.19;10.1109/INFVIS.2001.963283;10.1109/VISUAL.1991.175815;10.1109/VISUAL.2004.13;10.1109/VISUAL.1992.235217;10.1109/INFVIS.1999.801860,"Voronoi Treemaps, Information Visualization, Hierarchies, Trees, Treemaps, Voronoi Tessellations",118,37,27,
InfoVis,2005,Revealing structure within clustered parallel coordinates displays,10.1109/INFVIS.2005.1532138,http://dx.doi.org/10.1109/INFVIS.2005.1532138,125,132,C,"In order to gain insight into multivariate data, complex structures must be analysed and understood. Parallel coordinates is an excellent tool for visualizing this type of data but has its limitations. This paper deals with one of its main limitations - how to visualize a large number of data items without hiding the inherent structure they constitute. We solve this problem by constructing clusters and using high precision textures to represent them. We also use transfer functions that operate on the high precision textures in order to highlight different aspects of the cluster characteristics. Providing predefined transfer functions as well as the support to draw customized transfer functions makes it possible to extract different aspects of the data. We also show how feature animation can be used as guidance when simultaneously analysing several clusters. This technique makes it possible to visually represent statistical information about clusters and thus guides the user, making the analysis process more efficient.",Jimmy Johansson;Patric Ljung;Mikael Jern;Matthew Cooper 0001,J. Johansson;P. Ljung;M. Jern;M. Cooper,"Norrkoping Visualization & Interaction Studio, Linkoping Univ., Sweden;Norrkoping Visualization & Interaction Studio, Linkoping Univ., Sweden;Norrkoping Visualization & Interaction Studio, Linkoping Univ., Sweden;Norrkoping Visualization & Interaction Studio, Linkoping Univ., Sweden",10.1109/VISUAL.1990.146402;10.1109/VISUAL.1999.809866;10.1109/INFVIS.2004.68,"Parallel coordinates, clustering, transfer function, feature animation",118,41,17,
InfoVis,2010,Mental Models; Visual Reasoning and Interaction in Information Visualization: A Top-down Perspective,10.1109/TVCG.2010.177,http://dx.doi.org/10.1109/TVCG.2010.177,999,1008,J,"Although previous research has suggested that examining the interplay between internal and external representations can benefit our understanding of the role of information visualization (InfoVis) in human cognitive activities, there has been little work detailing the nature of internal representations, the relationship between internal and external representations and how interaction is related to these representations. In this paper, we identify and illustrate a specific kind of internal representation, mental models, and outline the high-level relationships between mental models and external visualizations. We present a top-down perspective of reasoning as model construction and simulation, and discuss the role of visualization in model based reasoning. From this perspective, interaction can be understood as active modeling for three primary purposes: external anchoring, information foraging, and cognitive offloading. Finally we discuss the implications of our approach for design, evaluation and theory development.",Zhicheng Liu;John T. Stasko,Zhicheng Liu;John Stasko,Georgia Institute of Technology;Georgia Institute of Technology,10.1109/TVCG.2009.187;10.1109/TVCG.2008.155;10.1109/INFVIS.2001.963289;10.1109/TVCG.2009.109;10.1109/TVCG.2007.70515;10.1109/TVCG.2009.180;10.1109/TVCG.2008.109;10.1109/TVCG.2008.171;10.1109/TVCG.2008.121;10.1109/VAST.2008.4677365,"Mental model, model-based reasoning, distributed cognition, interaction, theory, information visualization",118,90,67,
Vis,1997,Constrained 3D navigation with 2D controllers,10.1109/VISUAL.1997.663876,http://dx.doi.org/10.1109/VISUAL.1997.663876,175,182,C,"Navigation through 3D spaces is required in many interactive graphics and virtual reality applications. The authors consider the subclass of situations in which a 2D device such as a mouse controls smooth movements among viewpoints for a ""through the screen"" display of a 3D world. Frequently, there is a poor match between the goal of such a navigation activity, the control device, and the skills of the average user. They propose a unified mathematical framework for incorporating context-dependent constraints into the generalized viewpoint generation problem. These designer-supplied constraint modes provide a middle ground between the triviality of a single camera animation path and the confusing excess freedom of common unconstrained control paradigms. They illustrate the approach with a variety of examples, including terrain models, interior architectural spaces, and complex molecules.",Andrew J. Hanson;Eric A. Wernert,A.J. Hanson;E.A. Wernert,"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA",10.1109/VISUAL.1995.480804,"Navigation, Constrained Navigation, Viewing Control, Camera Control",117,32,25,
Vis,1998,High quality rendering of attributed volume data,10.1109/VISUAL.1998.745311,http://dx.doi.org/10.1109/VISUAL.1998.745311,255,262,C,"For high quality rendering of objects segmented from tomographic volume data the precise location of the boundaries of adjacent objects in subvoxel resolution is required. We describe a new method that determines the membership of a given sample point to an object by reclassifying the sample point using interpolation of the original intensity values and searching for the best fitting object in the neighbourhood. Using a ray-casting approach we then compute the surface location between successive sample points along the viewing-ray by interpolation or bisection. The accurate calculation of the object boundary enables a much more precise computation of the gray-level-gradient yielding the surface normal. Our new approach significantly improves the quality of reconstructed and shaded surfaces and reduces aliasing artifacts for animations and magnified views. We illustrate the results on different cases including the Visible-Human-Data, where we achieve nearly photo-realistic images.",Ulf Tiede;Thomas Schiemann;Karl Heinz Höhne,U. Tiede;T. Schiemann;K.H. Hohne,"Inst. of Math. & Comput. Sci. in Med., Eppendorf Univ. Hosp., Hamburg, Germany",,"partial-volume-effect, ray-casting, tomographic data,Visible-Human-Project",117,42,15,
Vis,2002,Fast view-dependent level-of-detail rendering using cached geometry,10.1109/VISUAL.2002.1183783,http://dx.doi.org/10.1109/VISUAL.2002.1183783,259,265,C,"Level-of-detail rendering is essential for rendering very large, detailed worlds in real-time. Unfortunately, level-of-detail computations can be expensive, creating a bottleneck at the CPU. This paper presents the CABTT algorithm, an extension to existing binary-triangle-tree-based level-of-detail algorithms. Instead of manipulating triangles, the CABTT algorithm instead operates on clusters of geometry called aggregate triangles. This reduces CPU overhead, eliminating a bottleneck common to level-of-detail algorithms. Since aggregate triangles stay fixed over several frames, they may be cached on the video card. This further reduces CPU load and fully utilizes the hardware accelerated rendering pipeline on modern video cards. These improvements result in a fourfold increase in frame rate over ROAM at high detail levels. Our implementation renders an approximation of an 8 million triangle height field at 42 frames per second with an maximum error of 1 pixel on consumer hardware.",Joshua Levenberg,J. Levenberg,"California Univ., Berkeley, CA, USA",10.1109/VISUAL.1997.663860;10.1109/VISUAL.1996.567600;10.1109/VISUAL.1998.745280;10.1109/VISUAL.2001.964533;10.1109/VISUAL.1996.568126;10.1109/VISUAL.1998.745282,"view-dependent mesh, level of detail, height fields, terrain, binary triangle trees, triangle bintree, multiresolution meshes, displacement maps, frame-to-frame coherence",117,47,32,
VAST,2012,LeadLine: Interactive visual analysis of text data through event identification and exploration,10.1109/VAST.2012.6400485,http://dx.doi.org/10.1109/VAST.2012.6400485,93,102,C,"Text data such as online news and microblogs bear valuable insights regarding important events and responses to such events. Events are inherently temporal, evolving over time. Existing visual text analysis systems have provided temporal views of changes based on topical themes extracted from text data. But few have associated topical themes with events that cause the changes. In this paper, we propose an interactive visual analytics system, LeadLine, to automatically identify meaningful events in news and social media data and support exploration of the events. To characterize events, LeadLine integrates topic modeling, event detection, and named entity recognition techniques to automatically extract information regarding the investigative 4 Ws: who, what, when, and where for each event. To further support analysis of the text corpora through events, LeadLine allows users to interactively examine meaningful events using the 4 Ws to develop an understanding of how and why. Through representing large-scale text corpora in the form of meaningful events, LeadLine provides a concise summary of the corpora. LeadLine also supports the construction of simple narratives through the exploration of events. To demonstrate the efficacy of LeadLine in identifying events and supporting exploration, two case studies were conducted using news and social media data.",Wenwen Dou;Derek Xiaoyu Wang;Drew Skau;William Ribarsky;Michelle X. Zhou,Wenwen Dou;Xiaoyu Wang;Drew Skau;William Ribarsky;Michelle X. Zhou,University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte;IBM Almaden Research Center,10.1109/VAST.2011.6102456;10.1109/VAST.2010.5652931;10.1109/TVCG.2011.179;10.1109/TVCG.2011.239;10.1109/VAST.2011.6102461;10.1109/TVCG.2011.185;10.1109/TVCG.2010.179;10.1109/VAST.2007.4389006;10.1109/INFVIS.2000.885098,,117,84,43,
InfoVis,2014,The Effects of Interactive Latency on Exploratory Visual Analysis,10.1109/TVCG.2014.2346452,http://dx.doi.org/10.1109/TVCG.2014.2346452,2122,2131,J,"To support effective exploration, it is often stated that interactive visualizations should provide rapid response times. However, the effects of interactive latency on the process and outcomes of exploratory visual analysis have not been systematically studied. We present an experiment measuring user behavior and knowledge discovery with interactive visualizations under varying latency conditions. We observe that an additional delay of 500ms incurs significant costs, decreasing user activity and data set coverage. Analyzing verbal data from think-aloud protocols, we find that increased latency reduces the rate at which users make observations, draw generalizations and generate hypotheses. Moreover, we note interaction effects in which initial exposure to higher latencies leads to subsequently reduced performance in a low-latency setting. Overall, increased latency causes users to shift exploration strategy, in turn affecting performance. We discuss how these results can inform the design of interactive analysis tools.",Zhicheng Liu;Jeffrey Heer,Zhicheng Liu;Jeffrey Heer,Adobe Research;University of Washington,10.1109/TVCG.2010.177,"Interaction, latency, exploratory analysis, interactive visualization, scalability, user performance, verbal analysis",117,101,45,
Vis,1997,Collaborative visualization,10.1109/VISUAL.1997.663890,http://dx.doi.org/10.1109/VISUAL.1997.663890,253,259,C,"Current visualization systems are designed around a single user model, making it awkward for large research teams to collectively analyse large data sets. The paper shows how the popular data flow approach to visualization can be extended to allow multiple users to collaborate-each running their own visualization pipeline but with the opportunity to connect in data generated by a colleague, Thus collaborative visualizations are 'programmed' in exactly the same 'plug-and-play' style as is now customary for single-user mode. The paper describes a system architecture that can act as a basis for the collaborative extension of any data flow visualization system, and the ideas are demonstrated through a particular implementation in terms of IRIS Explorer.",Jason D. Wood;Helen Wright;Ken Brodlie,J. Wood;H. Wright;K. Brodie,"Sch. of Comput. Studies, Leeds Univ., UK",10.1109/VISUAL.1995.480821,,116,29,13,
Vis,2002,Interactive translucent volume rendering and procedural modeling,10.1109/VISUAL.2002.1183764,http://dx.doi.org/10.1109/VISUAL.2002.1183764,109,116,C,Direct volume rendering is a commonly used technique in visualization applications. Many of these applications require sophisticated shading models to capture subtle lighting effects and characteristics of volumetric data and materials. Many common objects and natural phenomena exhibit visual quality that cannot be captured using simple lighting models or cannot be solved at interactive rates using more sophisticated methods. We present a simple yet effective interactive shading model which captures volumetric light attenuation effects to produce volumetric shadows and the subtle appearance of translucency. We also present a technique for volume displacement or perturbation that allows realistic interactive modeling of high frequency detail for real and synthetic volumetric data.,Joe Michael Kniss;Simon Premoze;Charles D. Hansen;David S. Ebert,J. Kniss;S. Premoze;C. Hansen;D. Ebert,"Sci. Comput. & Imaging Inst., Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.1990.146391,"volume rendering, shading model, volume modeling, procedural modeling",116,40,38,
Vis,2005,A feature-driven approach to locating optimal viewpoints for volume visualization,10.1109/VISUAL.2005.1532834,http://dx.doi.org/10.1109/VISUAL.2005.1532834,495,502,C,"Optimal viewpoint selection is an important task because it considerably influences the amount of information contained in the 2D projected images of 3D objects, and thus dominates their first impressions from a psychological point of view. Although several methods have been proposed that calculate the optimal positions of viewpoints especially for 3D surface meshes, none has been done for solid objects such as volumes. This paper presents a new method of locating such optimal viewpoints when visualizing volumes using direct volume rendering. The major idea behind our method is to decompose an entire volume into a set of feature components, and then find a globally optimal viewpoint by finding a compromise between locally optimal viewpoints for the components. As the feature components, the method employs interval volumes and their combinations that characterize the topological transitions of isosurfaces according to the scalar field. Furthermore, opacity transfer functions are also utilized to assign different weights to the decomposed components so that users can emphasize features of specific interest in the volumes. Several examples of volume datasets together with their optimal positions of viewpoints are exhibited in order to demonstrate that the method can effectively guide naive users to find optimal projections of volumes.",Shigeo Takahashi;Issei Fujishiro;Yuriko Takeshima;Tomoyuki Nishita,S. Takahashi;I. Fujishiro;Y. Takeshima;T. Nishita,"Tokyo Univ., Japan",10.1109/VISUAL.1995.480789;10.1109/VISUAL.2004.96;10.1109/VISUAL.2002.1183774;10.1109/VISUAL.2005.1532833;10.1109/VISUAL.1997.663875;10.1109/VISUAL.2002.1183785,"viewpoint selection, viewpoint entropy, direct volume rendering, interval volumes, level-set graphs",116,29,34,
InfoVis,2012,Beyond Mouse and Keyboard: Expanding Design Considerations for Information Visualization Interactions,10.1109/TVCG.2012.204,http://dx.doi.org/10.1109/TVCG.2012.204,2689,2698,J,"The importance of interaction to Information Visualization (InfoVis) and, in particular, of the interplay between interactivity and cognition is widely recognized [12, 15, 32, 55, 70]. This interplay, combined with the demands from increasingly large and complex datasets, is driving the increased significance of interaction in InfoVis. In parallel, there have been rapid advances in many facets of interaction technologies. However, InfoVis interactions have yet to take full advantage of these new possibilities in interaction technologies, as they largely still employ the traditional desktop, mouse, and keyboard setup of WIMP (Windows, Icons, Menus, and a Pointer) interfaces. In this paper, we reflect more broadly about the role of more “natural” interactions for InfoVis and provide opportunities for future research. We discuss and relate general HCI interaction models to existing InfoVis interaction classifications by looking at interactions from a novel angle, taking into account the entire spectrum of interactions. Our discussion of InfoVis-specific interaction design considerations helps us identify a series of underexplored attributes of interaction that can lead to new, more “natural,” interaction techniques for InfoVis.",Bongshin Lee;Petra Isenberg;Nathalie Henry Riche;Sheelagh Carpendale,Bongshin Lee;Petra Isenberg;Nathalie Henry Riche;Sheelagh Carpendale,Microsoft Research;INRIA;Microsoft Research;University of Calgary,10.1109/TVCG.2010.164;10.1109/TVCG.2007.70515;10.1109/TVCG.2008.121;10.1109/TVCG.2009.162;10.1109/TVCG.2010.206;10.1109/TVCG.2007.70582;10.1109/INFVIS.2005.1532122;10.1109/INFVIS.1998.729560;10.1109/TVCG.2007.70568,"Design considerations, interaction, post-WIMP, NUI (Natural User Interface)",116,77,82,
InfoVis,2016,Vega-Lite: A Grammar of Interactive Graphics,10.1109/TVCG.2016.2599030,http://dx.doi.org/10.1109/TVCG.2016.2599030,341,350,J,"We present Vega-Lite, a high-level grammar that enables rapid specification of interactive data visualizations. Vega-Lite combines a traditional grammar of graphics, providing visual encoding rules and a composition algebra for layered and multi-view displays, with a novel grammar of interaction. Users specify interactive semantics by composing selections. In Vega-Lite, a selection is an abstraction that defines input event processing, points of interest, and a predicate function for inclusion testing. Selections parameterize visual encodings by serving as input data, defining scale extents, or by driving conditional logic. The Vega-Lite compiler automatically synthesizes requisite data flow and event handling logic, which users can override for further customization. In contrast to existing reactive specifications, Vega-Lite selections decompose an interaction design into concise, enumerable semantic units. We evaluate Vega-Lite through a range of examples, demonstrating succinct specification of both customized interaction methods and common techniques such as panning, zooming, and linked selection.",Arvind Satyanarayan;Dominik Moritz;Kanit Wongsuphasawat;Jeffrey Heer,Arvind Satyanarayan;Dominik Moritz;Kanit Wongsuphasawat;Jeffrey Heer,Stanford University;University of Washington;University of Washington;University of Washington,10.1109/TVCG.2015.2467091;10.1109/TVCG.2009.174;10.1109/TVCG.2015.2467191;10.1109/TVCG.2014.2346260;10.1109/INFVIS.2000.885086;10.1109/TVCG.2007.70515;10.1109/TVCG.2011.185,Information visualization;interaction;systems;toolkits;declarative specification,116,129,31,BP
Vis,1993,Accelerating volume animation by space-leaping,10.1109/VISUAL.1993.398852,http://dx.doi.org/10.1109/VISUAL.1993.398852,62,69,C,"In this work we present a method for speeding the process of volume animation. It exploits coherency between consecutive images to shorten the path rays take through the volume. Rays are provided with the information needed to leap over the empty space and commence volume traversal at the vicinity of meaningful data. The algorithm starts by projecting the volume onto a C-buffer (coordinates-buffer) which stores the object-space coordinates of the first non-empty voxel visible from a pixel. Following a change in the viewing parameters, the C-buffer is transformed accordingly. Next, coordinates that possibly became hidden are discarded. The remaining values serve as an estimate of the point where the new rays should start their volume traversal. This method does not require 3-D preprocessing and does not suffer from any image degradation. It can be combined with existing acceleration techniques and can support any ray traversal algorithm and material modeling scheme.&lt;&lt;ETX&gt;&gt;",Roni Yagel;Zhouhong Shi,R. Yagel;Z. Shi,"Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbbus, OH, USA;Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbbus, OH, USA",10.1109/VISUAL.1992.235231,,115,52,16,
Vis,1995,Enhancing transparent skin surfaces with ridge and valley lines,10.1109/VISUAL.1995.480795,http://dx.doi.org/10.1109/VISUAL.1995.480795,52,"59, 438",C,"There are many applications that can benefit from the simultaneous display of multiple layers of data. The objective in these cases is to render the layered surfaces in a such way that the outer structures can be seen and seen through at the same time. The paper focuses on the particular application of radiation therapy treatment planning, in which physicians need to understand the three dimensional distribution of radiation dose in the context of patient anatomy. We describe a promising technique for communicating the shape and position of the transparent skin surface while at the same time minimally occluding underlying isointensity dose surfaces and anatomical objects: adding a sparse, opaque texture comprised of a small set of carefully chosen lines. We explain the perceptual motivation for explicitly drawing ridge and valley curves on a transparent surface, describe straightforward mathematical techniques for detecting and rendering these lines, and propose a small number of reasonably effective methods for selectively emphasizing the most perceptually relevant lines in the display.",Victoria Interrante;Henry Fuchs;Stephen M. Pizer,V. Interrante;H. Fuchs;S. Pizer,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",,,115,62,19,
Vis,2000,A flow-guided streamline seeding strategy,10.1109/VISUAL.2000.885690,http://dx.doi.org/10.1109/VISUAL.2000.885690,163,170,C,"The paper presents a seed placement strategy for streamlines based on flow features in the dataset. The primary goal of our seeding strategy is to capture flow patterns in the vicinity of critical points in the flow field, even as the density of streamlines is reduced. Secondary goals are to place streamlines such that there is sufficient coverage in non-critical regions, and to vary the streamline placements and lengths so that the overall presentation is aesthetically pleasing (avoid clustering of streamlines, avoid sharp discontinuities across several streamlines, etc.). The procedure is straightforward and non-iterative. First, critical points are identified. Next, the flow field is segmented into regions, each containing a single critical point. The critical point in each region is then seeded with a template depending on the type of critical point. Finally, additional seed points are randomly distributed around the field using a Poisson disk distribution to minimize closely spaced seed points. The main advantage of this approach is that it does not miss the features around critical points. Since the strategy is not image-guided, and hence not view dependent, significant savings are possible when examining flow fields from different viewpoints, especially for 3D flow fields.",Vivek Verma;David L. Kao;Alex T. Pang,V. Verma;D. Kao;A. Pang,"Dept. of Comput. Sci., Univ. of Southern California, Los Angeles, CA, USA",10.1109/VISUAL.1990.146359;10.1109/VISUAL.1998.745291;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1994.346312;10.1109/VISUAL.1990.146360;10.1109/VISUAL.1995.480819;10.1109/VISUAL.1997.663899;10.1109/VISUAL.1998.745295;10.1109/VISUAL.1999.809906,"seed placement, streamline, critical point, Voronoi diagram, Poisson disk distribution",115,65,17,
VAST,2012,Visual Analytics Methodology for Eye Movement Studies,10.1109/TVCG.2012.276,http://dx.doi.org/10.1109/TVCG.2012.276,2889,2898,J,"Eye movement analysis is gaining popularity as a tool for evaluation of visual displays and interfaces. However, the existing methods and tools for analyzing eye movements and scanpaths are limited in terms of the tasks they can support and effectiveness for large data and data with high variation. We have performed an extensive empirical evaluation of a broad range of visual analytics methods used in analysis of geographic movement data. The methods have been tested for the applicability to eye tracking data and the capability to extract useful knowledge about users' viewing behaviors. This allowed us to select the suitable methods and match them to possible analysis tasks they can support. The paper describes how the methods work in application to eye tracking data and provides guidelines for method selection depending on the analysis tasks.",Gennady L. Andrienko;Natalia V. Andrienko;Michael Burch;Daniel Weiskopf,Gennady Andrienko;Natalia Andrienko;Michael Burch;Daniel Weiskopf,Fraunhofer Institute IAIS;Fraunhofer Institute IAIS;University of Stuttgart;University of Stuttgart,10.1109/VAST.2009.5332593;10.1109/TVCG.2011.193;10.1109/INFVIS.2005.1532150,"Visual analytics, eye tracking, movement data, trajectory analysis",115,93,33,BP
InfoVis,2001,Semantic depth of field,10.1109/INFVIS.2001.963286,http://dx.doi.org/10.1109/INFVIS.2001.963286,97,104,C,,Robert Kosara;Silvia Miksch;Helwig Hauser,R. Kosara;S. Miksch;H. Hauser,Vienna University of Technology,10.1109/VISUAL.2000.885698;10.1109/INFVIS.2000.885088,"Depth of Field, Focus and Context, Information Visualization",114,37,26,
Vis,2001,Multiresolution feature extraction for unstructured meshes,10.1109/VISUAL.2001.964523,http://dx.doi.org/10.1109/VISUAL.2001.964523,287,294,C,"We present a framework to extract mesh features from unstructured two-manifold surfaces. Our method computes a collection of piecewise linear curves describing the salient features of surfaces, such as edges and ridge lines. We extend these basic techniques to a multiresolution setting which improves the quality of the results and accelerates the extraction process. The extraction process is semi-automatic, that is, the user is required to input a few control parameters and to select the operators to be applied to the input surface. Our mesh feature extraction algorithm can be used as a preprocessor for a variety of applications in geometric modeling including mesh fairing, subdivision and simplification.",Andreas Hubeli;Markus H. Gross,A. Hubeli;M. Gross,"Dept. of Comput. Sci., Eidgenossische Tech. Hochschule, Zurich, Switzerland;Dept. of Comput. Sci., Eidgenossische Tech. Hochschule, Zurich, Switzerland",10.1109/VISUAL.2000.885721;10.1109/VISUAL.2000.885722,"Surface Representations, Geometric Modeling, Triangle Decimation, Multiresolution Models, Feature Extraction",114,36,21,
InfoVis,2002,InterRing: an interactive tool for visually navigating and manipulating hierarchical structures,10.1109/INFVIS.2002.1173151,http://dx.doi.org/10.1109/INFVIS.2002.1173151,77,84,C,"Radial, space-filling (RSF) techniques for hierarchy visualization have several advantages over traditional node-link diagrams, including the ability to efficiently use the display space while effectively conveying the hierarchy structure. Several RSF systems and tools have been developed to date, each with varying degrees of support for interactive operations such as selection and navigation. We describe what we believe to be a complete set of desirable operations on hierarchical structures. We then present InterRing, an RSF hierarchy visualization system that supports a significantly more extensive set of these operations than prior systems. In particular, InterRing supports multi-focus distortions, interactive hierarchy reconfiguration, and both semi-automated and manual selection. We show the power and utility of these and other operations, and describe our on-going efforts to evaluate their effectiveness and usability.",Jing Yang 0001;Matthew O. Ward;Elke A. Rundensteiner,Jing Yang;M.O. Ward;E.A. Rundensteiner,"Dept. of Comput. Sci., Worcester Polytech. Inst., MA, USA;Dept. of Comput. Sci., Worcester Polytech. Inst., MA, USA;Dept. of Comput. Sci., Worcester Polytech. Inst., MA, USA",10.1109/INFVIS.2001.963290;10.1109/INFVIS.2001.963285;10.1109/INFVIS.1997.636718;10.1109/INFVIS.1999.801858;10.1109/INFVIS.1995.528689;10.1109/INFVIS.2001.963283;10.1109/VISUAL.1991.175815;10.1109/INFVIS.2000.885091;10.1109/INFVIS.1999.801860;10.1109/INFVIS.2001.963284;10.1109/VISUAL.1999.809866;10.1109/INFVIS.2001.963281;10.1109/INFVIS.1998.729557,"radial space-filling hierarchy visualizations, multi-focus distortion, structure-based brushing",113,21,32,
InfoVis,2008,Spatially Ordered Treemaps,10.1109/TVCG.2008.165,http://dx.doi.org/10.1109/TVCG.2008.165,1348,1355,J,"Existing treemap layout algorithms suffer to some extent from poor or inconsistent mappings between data order and visual ordering in their representation, reducing their cognitive plausibility. While attempts have been made to quantify this mismatch, and algorithms proposed to minimize inconsistency, solutions provided tend to concentrate on one-dimensional ordering. We propose extensions to the existing squarified layout algorithm that exploit the two-dimensional arrangement of treemap nodes more effectively. Our proposed spatial squarified layout algorithm provides a more consistent arrangement of nodes while maintaining low aspect ratios. It is suitable for the arrangement of data with a geographic component and can be used to create tessellated cartograms for geovisualization. Locational consistency is measured and visualized and a number of layout algorithms are compared. CIELab color space and displacement vector overlays are used to assess and emphasize the spatial layout of treemap nodes. A case study involving locations of tagged photographs in the Flickr database is described.",Jo Wood;Jason Dykes,Jo Wood;Jason Dykes,"giCentre, City University London;giCentre, City University London",10.1109/INFVIS.2001.963283;10.1109/INFVIS.2001.963290;10.1109/TVCG.2007.70522;10.1109/TVCG.2007.70529,"Geovisualization, treemaps, cartograms, CIELab, geographic information, tree structures",113,84,32,
VAST,2014,Knowledge Generation Model for Visual Analytics,10.1109/TVCG.2014.2346481,http://dx.doi.org/10.1109/TVCG.2014.2346481,1604,1613,J,"Visual analytics enables us to analyze huge information spaces in order to support complex decision making and data exploration. Humans play a central role in generating knowledge from the snippets of evidence emerging from visual data analysis. Although prior research provides frameworks that generalize this process, their scope is often narrowly focused so they do not encompass different perspectives at different levels. This paper proposes a knowledge generation model for visual analytics that ties together these diverse frameworks, yet retains previously developed models (e.g., KDD process) to describe individual segments of the overall visual analytic processes. To test its utility, a real world visual analytics system is compared against the model, demonstrating that the knowledge generation process model provides a useful guideline when developing and evaluating such systems. The model is used to effectively compare different data analysis systems. Furthermore, the model provides a common language and description of visual analytic processes, which can be used for communication between researchers. At the end, our model reflects areas of research that future researchers can embark on.",Dominik Sacha;Andreas Stoffel;Florian Stoffel;Bum Chul Kwon;Geoffrey P. Ellis;Daniel A. Keim,Dominik Sacha;Andreas Stoffel;Florian Stoffel;Bum Chul Kwon;Geoffrey Ellis;Daniel A. Keim,"Data Analysis and Visualization Group, University of Konstanz;Data Analysis and Visualization Group, University of Konstanz;Data Analysis and Visualization Group, University of Konstanz;Data Analysis and Visualization Group, University of Konstanz;Data Analysis and Visualization Group, University of Konstanz;Data Analysis and Visualization Group, University of Konstanz",10.1109/VISUAL.2005.1532781;10.1109/TVCG.2013.124;10.1109/VAST.2009.5333023;10.1109/TVCG.2011.229;10.1109/TVCG.2008.109;10.1109/VAST.2008.4677361;10.1109/VAST.2008.4677365;10.1109/VAST.2010.5652879;10.1109/TVCG.2012.273;10.1109/VAST.2008.4677358;10.1109/TVCG.2008.121;10.1109/VAST.2007.4389006;10.1109/VAST.2011.6102435;10.1109/TVCG.2013.120,"Visual Analytics, Knowledge Generation, Reasoning, Visualization Taxonomies and Models, Interaction",113,125,43,
Vis,1999,Simplified representation of vector fields,10.1109/VISUAL.1999.809865,http://dx.doi.org/10.1109/VISUAL.1999.809865,35,507,C,"Vector field visualization remains a difficult task. Many local and global visualization methods for vector fields such as flow data exist, but they usually require extensive user experience on setting the visualization parameters in order to produce images communicating the desired insight. We present a visualization method that produces simplified but suggestive images of the vector field automatically, based on a hierarchical clustering of the input data. The resulting clusters are then visualized with straight or curved arrow icons. The presented method has a few parameters with which users can produce various simplified vector field visualizations that communicate different insights on the vector data.",Alexandru Telea;Jarke J. van Wijk,A. Telea;J.J. Van Wijk,"Eindhoven Univ. of Technol., Netherlands",10.1109/VISUAL.1995.480817;10.1109/VISUAL.1994.346327;10.1109/VISUAL.1991.175789,"Flow Visualization, Simplification, Clustering",112,66,14,
InfoVis,2009,Mapping Text with Phrase Nets,10.1109/TVCG.2009.165,http://dx.doi.org/10.1109/TVCG.2009.165,1169,1176,J,"We present a new technique, the phrase net, for generating visual overviews of unstructured text. A phrase net displays a graph whose nodes are words and whose edges indicate that two words are linked by a user-specified relation. These relations may be defined either at the syntactic or lexical level; different relations often produce very different perspectives on the same text. Taken together, these perspectives often provide an illuminating visual overview of the key concepts and relations in a document or set of documents.",Frank van Ham;Martin Wattenberg;Fernanda B. Viégas,Frank van Ham;Martin Wattenberg;Fernanda B. Viegas,IBM Research;IBM Research;IBM Research,10.1109/TVCG.2008.172;10.1109/VISUAL.2005.1532781;10.1109/TVCG.2007.70577,"Text visualization, tag cloud, natural language processing, semantic net",112,74,21,BP
InfoVis,2011,Local Affine Multidimensional Projection,10.1109/TVCG.2011.220,http://dx.doi.org/10.1109/TVCG.2011.220,2563,2571,J,"Multidimensional projection techniques have experienced many improvements lately, mainly regarding computational times and accuracy. However, existing methods do not yet provide flexible enough mechanisms for visualization-oriented fully interactive applications. This work presents a new multidimensional projection technique designed to be more flexible and versatile than other methods. This novel approach, called Local Affine Multidimensional Projection (LAMP), relies on orthogonal mapping theory to build accurate local transformations that can be dynamically modified according to user knowledge. The accuracy, flexibility and computational efficiency of LAMP is confirmed by a comprehensive set of comparisons. LAMP's versatility is exploited in an application which seeks to correlate data that, in principle, has no connection as well as in visual exploration of textual documents.",Paulo Joia;Danilo Barbosa Coimbra;José Alberto Cuminato;Fernando Vieira Paulovich;Luis Gustavo Nonato,Paulo Joia;Danilo Coimbra;Jose A. Cuminato;Fernando V. Paulovich;Luis G. Nonato,Universidade de S&#x0E3;o Paulo (USP);Universidade de S&#x0E3;o Paulo (USP);Universidade de S&#x0E3;o Paulo (USP);Universidade de S&#x0E3;o Paulo (USP);Universidade de S&#x0E3;o Paulo (USP),10.1109/VISUAL.1996.567787;10.1109/TVCG.2009.140;10.1109/TVCG.2007.70580;10.1109/INFVIS.2002.1173159;10.1109/TVCG.2010.207;10.1109/TVCG.2010.170;10.1109/INFVIS.2002.1173161,"Multidimensional Projection, High Dimensional Data, Visual Data Mining",111,113,36,HM
InfoVis,2011,Parallel Edge Splatting for Scalable Dynamic Graph Visualization,10.1109/TVCG.2011.226,http://dx.doi.org/10.1109/TVCG.2011.226,2344,2353,J,"We present a novel dynamic graph visualization technique based on node-link diagrams. The graphs are drawn side-byside from left to right as a sequence of narrow stripes that are placed perpendicular to the horizontal time line. The hierarchically organized vertices of the graphs are arranged on vertical, parallel lines that bound the stripes; directed edges connect these vertices from left to right. To address massive overplotting of edges in huge graphs, we employ a splatting approach that transforms the edges to a pixel-based scalar field. This field represents the edge densities in a scalable way and is depicted by non-linear color mapping. The visualization method is complemented by interaction techniques that support data exploration by aggregation, filtering, brushing, and selective data zooming. Furthermore, we formalize graph patterns so that they can be interactively highlighted on demand. A case study on software releases explores the evolution of call graphs extracted from the JUnit open source software project. In a second application, we demonstrate the scalability of our approach by applying it to a bibliography dataset containing more than 1.5 million paper titles from 60 years of research history producing a vast amount of relations between title words.",Michael Burch;Corinna Vehlow;Fabian Beck 0001;Stephan Diehl 0001;Daniel Weiskopf,Michael Burch;Corinna Vehlow;Fabian Beck;Stephan Diehl;Daniel Weiskopf,"VISUS, University of Stuttgart;VISUS, University of Stuttgart;University of Trier;University of Trier;VISUS, University of Stuttgart",10.1109/TVCG.2009.123;10.1109/TVCG.2008.131;10.1109/VISUAL.1990.146402;10.1109/TVCG.2010.176;10.1109/INFVIS.2005.1532138;10.1109/TVCG.2006.147;10.1109/TVCG.2009.131;10.1109/INFVIS.1999.801866;10.1109/INFVIS.2002.1173160;10.1109/INFVIS.2004.68,"Dynamic graph visualization, graph splatting, software visualization, software evolution",111,90,40,
InfoVis,2012,Visual Semiotics & Uncertainty Visualization: An Empirical Study,10.1109/TVCG.2012.279,http://dx.doi.org/10.1109/TVCG.2012.279,2496,2505,J,"This paper presents two linked empirical studies focused on uncertainty visualization. The experiments are framed from two conceptual perspectives. First, a typology of uncertainty is used to delineate kinds of uncertainty matched with space, time, and attribute components of data. Second, concepts from visual semiotics are applied to characterize the kind of visual signification that is appropriate for representing those different categories of uncertainty. This framework guided the two experiments reported here. The first addresses representation intuitiveness, considering both visual variables and iconicity of representation. The second addresses relative performance of the most intuitive abstract and iconic representations of uncertainty on a map reading task. Combined results suggest initial guidelines for representing uncertainty and discussion focuses on practical applicability of results.",Alan M. MacEachren;Robert E. Roth;James O'Brien;Bonan Li;Derek Swingley;Mark Gahegan,Alan M. MacEachren;Robert E. Roth;James O'Brien;Bonan Li;Derek Swingley;Mark Gahegan,Penn State University;University of Wisconsin;Macquarie University;ZillionInfo;Penn State University;University of Auckland,10.1109/VISUAL.1992.235199;10.1109/TVCG.2011.197;10.1109/TVCG.2009.114,"Uncertainty visualization, uncertainty categories, visual variables, semiotics",111,100,34,HM
Vis,1993,A probe for local flow field visualization,10.1109/VISUAL.1993.398849,http://dx.doi.org/10.1109/VISUAL.1993.398849,39,45,C,"A probe for the interactive visualization of flow fields is presented. The probe can be used to visualize many characteristics of the flow in detail for a small region in the data set. The velocity and the local change of velocity (the velocity gradient tensor) are visualized by a set of geometric primitives. To this end, the velocity gradient tensor is transformed to a local coordinate frame, and decomposed into components parallel with and perpendicular to the flow. These components are visualized as geometric objects with an intuitively meaningful interpretation. An implementation is presented which shows that this probe is a useful tool for flow visualization.&lt;&lt;ETX&gt;&gt;",Wim C. de Leeuw;Jarke J. van Wijk,W.C. de Leeuw;J.J. van Wijk,"Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands;Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands",10.1109/VISUAL.1992.235193;10.1109/VISUAL.1991.175789;10.1109/VISUAL.1992.235210,,110,54,12,
Vis,1995,Fast multiresolution surface meshing,10.1109/VISUAL.1995.480805,http://dx.doi.org/10.1109/VISUAL.1995.480805,135,"142, 446",C,"Presents a new method for adaptive surface meshing and triangulation which controls the local level-of-detail of the surface approximation by local spectral estimates. These estimates are determined by a wavelet representation of the surface data. The basic idea is to decompose the initial data set by means of an orthogonal or semi-orthogonal tensor product wavelet transform (WT) and to analyze the resulting coefficients. In surface regions where the partial energy of the resulting coefficients is low, the polygonal approximation of the surface can be performed with larger triangles without losing too much fine-grain detail. However, since the localization of the WT is bound by the Heisenberg principle, the meshing method has to be controlled by the detail signals rather than directly by the coefficients. The dyadic scaling of the WT stimulated us to build a hierarchical meshing algorithm which transforms the initially regular data grid into a quadtree representation by rejection of unimportant mesh vertices. The optimum triangulation of the resulting quadtree cells is carried out by selection from a look-up table. The tree grows recursively, as controlled by the detail signals, which are computed from a modified inverse WT. In order to control the local level-of-detail, we introduce a new class of wavelet space filters acting as ""magnifying glasses"" on the data.",Markus H. Gross;Roger Gatti;Oliver G. Staadt,M.H. Gross;R. Gatti;O. Staadt,"Dept. of Comput. Sci., Eidgenossische Tech. Hochschule, Zurich, Switzerland;Dept. of Comput. Sci., Eidgenossische Tech. Hochschule, Zurich, Switzerland;Dept. of Comput. Sci., Eidgenossische Tech. Hochschule, Zurich, Switzerland",10.1109/VISUAL.1994.346333,,110,39,19,
Vis,1995,Iconic techniques for feature visualization,10.1109/VISUAL.1995.485141,http://dx.doi.org/10.1109/VISUAL.1995.485141,288,"295, 464",C,"Presents a conceptual framework and a process model for feature extraction and iconic visualization. Feature extraction is viewed as a process of data abstraction, which can proceed in multiple stages, and corresponding data abstraction levels. The features are represented by attribute sets, which play a key role in the visualization process. Icons are symbolic parametric objects, designed as visual representations of features. The attributes are mapped to the parameters (or degrees of freedom) of an icon. We describe some generic techniques to generate attribute sets, such as volume integrals and medial axis transforms. A simple but powerful modeling language was developed to create icons, and to link the attributes to the icon parameters. We present illustrative examples of iconic visualization created with the techniques described, showing the effectiveness of this approach.",Frank J. Post;Theo van Walsum;Frits H. Post;Deborah Silver,F.J. Post;T. van Walsum;F.H. Post;D. Silver,"Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands;Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands;Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands",10.1109/VISUAL.1993.398849;10.1109/VISUAL.1991.175809;10.1109/VISUAL.1992.235174,"scientific visualization, feature extraction, iconic visualization, attribute calculation",110,59,25,
Vis,1998,Efficient implementation of multi-triangulations,10.1109/VISUAL.1998.745283,http://dx.doi.org/10.1109/VISUAL.1998.745283,43,50,C,"Multi-triangulation (MT) is a general framework for managing the level-of-detail in large triangle meshes, which we have introduced in our previous work. In this paper, we describe an efficient implementation of an MT based on vertex decimation. We present general techniques for querying an MT, which are independent of a specific application, and which can be applied for solving problems, such as selective refinement, windowing, point location, and other spatial interference queries. We describe alternative data structures for encoding an MT, which achieve different trade-offs between space and performance. Experimental results are discussed.",Leila De Floriani;Paola Magillo;Enrico Puppo,L. De Floriani;P. Magillo;E. Puppo,"Genoa Univ., Italy",10.1109/VISUAL.1997.663865;10.1109/VISUAL.1997.663860,,110,37,23,
Vis,2000,Six degree-of-freedom haptic display of polygonal models,10.1109/VISUAL.2000.885687,http://dx.doi.org/10.1109/VISUAL.2000.885687,139,146,C,"We present an algorithm for haptic display of moderately complex polygonal models with a six degree of freedom (DOF) force feedback device. We make use of incremental algorithms for contact determination between convex primitives. The resulting contact information is used for calculating the restoring forces and torques and thereby used to generate a sense of virtual touch. To speed up the computation, our approach exploits a combination of geometric locality, temporal coherence, and predictive methods to compute object-object contacts at kHz rates. The algorithm has been implemented and interfaced with a 6-DOF PHANToM Premium 1.5. We demonstrate its performance on force display of the mechanical interaction between moderately complex geometric structures that can be decomposed into convex primitives.",Arthur D. Gregory;Ajith Mascarenhas;Stephen A. Ehmann;Ming C. Lin;Dinesh Manocha,A. Gregory;A. Mascarenhas;S. Ehmann;Ming Lin;D. Manocha,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.1996.568108,"haptics, virtual reality, forcefeedback devices, interactive computer graphics",110,44,38,
InfoVis,2002,ACE: a fast multiscale eigenvectors computation for drawing huge graphs,10.1109/INFVIS.2002.1173159,http://dx.doi.org/10.1109/INFVIS.2002.1173159,137,144,C,"We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of something like two orders of magnitude over the fastest algorithms we are aware of; it draws graphs of millions of nodes in less than a minute. ACE finds an optimal drawing by minimizing a quadratic energy function. The minimization problem is expressed as a generalized eigenvalue problem, which is rapidly solved using a novel algebraic multigrid technique. The same generalized eigenvalue problem seems to come up also in other fields, hence ACE appears to be applicable outside of graph drawing too.",Yehuda Koren;Liran Carmel;David Harel,Yehuda Koren;L. Carmel;D. Harel,"Dept. of Comput. Sci. & Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel;Dept. of Comput. Sci. & Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel;Dept. of Comput. Sci. & Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel",,"algebraic multigrid, multiscale/multilevel optimization, graph drawing, generalized eigenvalue problem, Fiedler vector, force directed layout, the Hall energy",110,29,22,
Vis,1993,Volume sampled voxelization of geometric primitives,10.1109/VISUAL.1993.398854,http://dx.doi.org/10.1109/VISUAL.1993.398854,78,84,C,"We present a 3-D antialiasing algorithm for voxel-based geometric models. The technique band-limits the continuous object before sampling it at the desired 3-D raster resolution. By precomputing tables of filter values for different types and sizes of geometric objects, the algorithm is very efficient and has a complexity that is linear with the number of voxels generated. The algorithm not only creates voxel models which are free from object space aliasing, but it also incorporates the image space antialiasing information as part of the view independent voxel model. The resulting alias-free voxel models have been used to model synthetic scenes, for discrete ray tracing applications. The discrete ray-traced image is superior in quality to the image generated with a conventional surface-based ray tracer, since silhouettes of objects, shadows, and reflections appear smooth (jaggy-less). In addition, the alias-free models are also suitable for intermixing with sampled datasets, since they can be treated uniformly as one common data representation.&lt;&lt;ETX&gt;&gt;",Sidney W. Wang;Arie E. Kaufman,S.W. Wang;A.E. Kaufman,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1992.235190,"voxelization, volume sampling, discrete ray tracing, filtering",109,36,20,
InfoVis,2011,CloudLines: Compact Display of Event Episodes in Multiple Time-Series,10.1109/TVCG.2011.179,http://dx.doi.org/10.1109/TVCG.2011.179,2432,2439,J,"We propose incremental logarithmic time-series technique as a way to deal with time-based representations of large and dynamic event data sets in limited space. Modern data visualization problems in the domains of news analysis, network security and financial applications, require visual analysis of incremental data, which poses specific challenges that are normally not solved by static visualizations. The incremental nature of the data implies that visualizations have to necessarily change their content and still provide comprehensible representations. In particular, in this paper we deal with the need to keep an eye on recent events together with providing a context on the past and to make relevant patterns accessible at any scale. Our technique adapts to the incoming data by taking care of the rate at which data items occur and by using a decay function to let the items fade away according to their relevance. Since access to details is also important, we also provide a novel distortion magnifying lens technique which takes into account the distortions introduced by the logarithmic time scale to augment readability in selected areas of interest. We demonstrate the validity of our techniques by applying them on incremental data coming from online news streams in different time frames.",Milos Krstajic;Enrico Bertini;Daniel A. Keim,Milos Krstajic;Enrico Bertini;Daniel Keim,University of Konstanz;University of Konstanz;University of Konstanz,10.1109/TVCG.2010.193;10.1109/VAST.2006.261431;10.1109/INFVIS.2005.1532133;10.1109/INFVIS.2003.1249028;10.1109/TVCG.2007.70539,"Incremental Visualization, Event-based Data, Lens Distortion",109,85,30,
Vis,1994,Wavelet-based volume morphing,10.1109/VISUAL.1994.346333,http://dx.doi.org/10.1109/VISUAL.1994.346333,85,"92, C8",C,"This paper presents a technique for performing volume morphing between two volumetric datasets in the wavelet domain. The idea is to decompose the volumetric datasets into a set of frequency bands, apply smooth interpolation to each band, and reconstruct to form the morphed model. In addition, a technique for establishing a suitable correspondence among object voxels is presented. The combination of these two techniques results in a smooth transition between the two datasets and produces morphed volume with fewer high frequency distortions than those obtained from spatial domain volume morphing.&lt;&lt;ETX&gt;&gt;",Taosong He;Sidney W. Wang;Arie E. Kaufman,Taosong He;S. Wang;A. Kaufman,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1993.398854,,108,22,9,
InfoVis,2005,"Baby names, visualization, and social data analysis",10.1109/INFVIS.2005.1532122,http://dx.doi.org/10.1109/INFVIS.2005.1532122,1,7,C,"The Name Voyager, a Web based visualization of historical trends in baby naming, has proven remarkably popular. This paper discusses the interaction techniques it uses for smooth visual exploration of thousands of time series. We also describe design decisions behind the application and lessons learned in creating an application that makes do-it-yourself data mining popular. The prime lesson, it is hypothesized, is that an information visualization tool may be fruitfully viewed not as a tool but as part of an online social environment. In other words, to design a successful exploratory data analysis tool, one good strategy is to create a system that enables ""social"" data analysis",Martin Wattenberg,M. Wattenberg,,10.1109/INFVIS.2004.8;10.1109/INFVIS.2000.885098,"Design Study, Time-Varying Data Visualization, Human-Computer Interaction",108,38,14,
VAST,2008,Visual cluster analysis of trajectory data with interactive Kohonen Maps,10.1109/VAST.2008.4677350,http://dx.doi.org/10.1109/VAST.2008.4677350,3,10,C,"Visual-interactive cluster analysis provides valuable tools for effectively analyzing large and complex data sets. Due to desirable properties and an inherent predisposition for visualization, the Kohonen Feature Map (or self-organizing map, or SOM) algorithm is among the most popular and widely used visual clustering techniques. However, the unsupervised nature of the algorithm may be disadvantageous in certain applications. Depending on initialization and data characteristics, cluster maps (cluster layouts) may emerge that do not comply with user preferences, expectations, or the application context. Considering SOM-based analysis of trajectory data, we propose a comprehensive visual-interactive monitoring and control framework extending the basic SOM algorithm. The framework implements the general Visual Analytics idea to effectively combine automatic data analysis with human expert supervision. It provides simple, yet effective facilities for visually monitoring and interactively controlling the trajectory clustering process at arbitrary levels of detail. The approach allows the user to leverage existing domain knowledge and user preferences, arriving at improved cluster maps. We apply the framework on a trajectory clustering problem, demonstrating its potential in combining both unsupervised (machine) and supervised (human expert) processing, in producing appropriate cluster results.",Tobias Schreck;Jürgen Bernard;Tatiana von Landesberger;Jörn Kohlhammer,Tobias Schreck;Jurgen Bernard;Tatiana Tekusova;Jorn Kohlhammer,"Interactive Graphics Systems Group, TU Darmstadt, Germany;Interactive Graphics Systems Group, TU Darmstadt, Germany;Interactive Graphics Systems Group, TU Darmstadt, Germany;Fraunhofer Institute for Computer Graphics IGD, Darmstadt, Germany",10.1109/TVCG.2007.70621,,108,27,21,
VAST,2012,Dis-function: Learning distance functions interactively,10.1109/VAST.2012.6400486,http://dx.doi.org/10.1109/VAST.2012.6400486,83,92,C,"The world's corpora of data grow in size and complexity every day, making it increasingly difficult for experts to make sense out of their data. Although machine learning offers algorithms for finding patterns in data automatically, they often require algorithm-specific parameters, such as an appropriate distance function, which are outside the purview of a domain expert. We present a system that allows an expert to interact directly with a visual representation of the data to define an appropriate distance function, thus avoiding direct manipulation of obtuse model parameters. Adopting an iterative approach, our system first assumes a uniformly weighted Euclidean distance function and projects the data into a two-dimensional scatterplot view. The user can then move incorrectly-positioned data points to locations that reflect his or her understanding of the similarity of those data points relative to the other data points. Based on this input, the system performs an optimization to learn a new distance function and then re-projects the data to redraw the scatter-plot. We illustrate empirically that with only a few iterations of interaction and optimization, a user can achieve a scatterplot view and its corresponding distance function that reflect the user's knowledge of the data. In addition, we evaluate our system to assess scalability in data size and data dimension, and show that our system is computationally efficient and can provide an interactive or near-interactive user experience.",Eli T. Brown;Jingjing Liu;Carla E. Brodley;Remco Chang,Eli T. Brown;Jingjing Liu;Carla E. Brodley;Remco Chang,Department of Computer Science Tufts University;Department of Computer Science Tufts University;Department of Computer Science Tufts University;Department of Computer Science Tufts University,10.1109/VISUAL.1990.146402;10.1109/VAST.2011.6102449;10.1109/VAST.2007.4388999;10.1109/VAST.2009.5332584;10.1109/VAST.2011.6102448;10.1109/VAST.2008.4677352;10.1109/VAST.2010.5652443,,108,82,40,
Vis,1994,"The topology of symmetric, second-order tensor fields",10.1109/VISUAL.1994.346326,http://dx.doi.org/10.1109/VISUAL.1994.346326,140,"147, C15",C,"We study the topology of symmetric, second-order tensor fields. The goal is to represent their complex structure by a simple set of carefully chosen points and lines analogous to vector field topology. We extract topological skeletons of the eigenvector fields, and we track their evolution over time. We study tensor topological transitions and correlate tensor and vector data. The basic constituents of tensor topology are the degenerate points, or points where eigenvalues are equal to each other. Degenerate points play a similar role as critical points in vector fields. We identify two kinds of elementary degenerate points, which we call wedges and trisectors. They can combine to form more familiar singularities-such as saddles, nodes, centers, or foci. However, these are generally unstable structures in tensor fields. Finally, we show a topological rule that puts a constraint on the topology of tensor fields defined across surfaces, extending to tensor fields the Poincare-Hopf theorem for vector fields.&lt;&lt;ETX&gt;&gt;",Thierry Delmarcelle;Lambertus Hesselink,T. Delmarcelle;L. Hesselink,"Dept. of Appl. Phys., Stanford Univ., CA, USA",10.1109/VISUAL.1991.175773,,107,57,11,BP
Vis,1997,A topology modifying progressive decimation algorithm,10.1109/VISUAL.1997.663883,http://dx.doi.org/10.1109/VISUAL.1997.663883,205,212,C,"Triangle decimation techniques reduce the number of triangles in a mesh, typically to improve interactive rendering performance or reduce data storage and transmission requirements. Most of these algorithms are designed to preserve the original topology of the mesh. Unfortunately, this characteristic is a strong limiting factor in overall reduction capability, since objects with a large number of holes or other topological constraints cannot be effectively reduced. The author presents an algorithm that yields a guaranteed reduction level, modifying topology as necessary to achieve the desired result. In addition, the algorithm is based on a fast local decimation technique, and its operations can be encoded for progressive storage, transmission, and reconstruction. He describes the new progressive decimation algorithm, introduces mesh splitting operations and shows how they can be encoded as a progressive mesh. He also demonstrates the utility of the algorithm on models ranging in size from 1,132 to 1.68 million triangles and reduction ratios of up to 200:1.",William J. Schroeder,W.J. Schroeder,,10.1109/VISUAL.1995.485142;10.1109/VISUAL.1993.398868;10.1109/VISUAL.1996.568124,,107,42,12,
Vis,1997,Strategies for effectively visualizing 3D flow with volume LIC,10.1109/VISUAL.1997.663912,http://dx.doi.org/10.1109/VISUAL.1997.663912,421,424,C,"This paper discusses strategies for effectively portraying 3D flow using volume line integral convolution. Issues include defining an appropriate input texture, clarifying the distinct identities and relative depths of the advected texture elements, and selectively highlighting regions of interest in both the input and output volumes. Apart from offering insights into the greater potential of 3D LIC as a method for effectively representing flow in a volume, a principal contribution of this work is the suggestion of a technique for generating and rendering 3D visibility-impeding ""halos"" that can help to intuitively indicate the presence of depth discontinuities between contiguous elements in a projection and thereby clarify the 3D spatial organization of elements in the flow. The proposed techniques are applied to the visualization of a hot, supersonic, laminar jet exiting into a colder, subsonic coflow.",Victoria Interrante;Chester Grosch,V. Interrante;C. Grosch,,10.1109/VISUAL.1993.398877;10.1109/VISUAL.1996.567784;10.1109/VISUAL.1994.346313;10.1109/VISUAL.1996.567777;10.1109/VISUAL.1994.346312,,107,53,27,
Vis,2000,Achieving color uniformity across multi-projector displays,10.1109/VISUAL.2000.885684,http://dx.doi.org/10.1109/VISUAL.2000.885684,117,124,C,"Large area tiled displays are gaining popularity for use in collaborative immersive virtual environments and scientific visualization. While recent work has addressed the issues of geometric registration, rendering architectures, and human interfaces, there has been relatively little work on photometric calibration in general, and photometric non-uniformity in particular. For example, as a result of differences in the photometric characteristics of projectors, the color and intensity of a large area display varies from place to place. Further, the imagery typically appears brighter at the regions of overlap between adjacent projectors. We analyze and classify the causes of photometric non-uniformity in a tiled display. We then propose a methodology for determining corrections designed to achieve uniformity, that can correct for the photometric variations across a tiled projector display in real time using per channel color look-up-tables (LUT).",Aditi Majumder;Zhu He;Herman Towles;Greg Welch,A. Majumder;Zhu He;H. Towles;G. Welch,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.1999.809890,"large area display, tiled displays, projector graphics, color calibration",107,56,22,
Vis,2002,Seamster: inconspicuous low-distortion texture seam layout,10.1109/VISUAL.2002.1183787,http://dx.doi.org/10.1109/VISUAL.2002.1183787,291,298,C,"Surface texturing aids the visualization of polygonal meshes by providing additional surface orientation cues and feature annotations. Such texturing is usually implemented via texture mapping, which is easier and more effective when the distortion of the mapping from the surface to the texture map is kept small. We have previously shown that distortion occurs when areas of high surface curvature are flattened into the texture map. By cutting the surface in these areas one can reduce texture map distortion at the expense of additional seam artifacts. This paper describes a faster technique for guiding a texture map seam through high distortion regions, while restricting the seam to regions of low visibility. This results in distortion reducing seams that are less visually distracting and take less time to compute. We have also observed that visibility considerations improve the speed of a recent method that adds cuts to reduce a surface genus.",Alla Sheffer;John C. Hart,A. Sheffer;J.C. Hart,"Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel",10.1109/VISUAL.2000.885723,"Texture Mapping, Visibility Classification",107,27,24,
InfoVis,2009,FromDaDy: Spreading Aircraft Trajectories Across Views to Support Iterative Queries,10.1109/TVCG.2009.145,http://dx.doi.org/10.1109/TVCG.2009.145,1017,1024,J,"When displaying thousands of aircraft trajectories on a screen, the visualization is spoiled by a tangle of trails. The visual analysis is therefore difficult, especially if a specific class of trajectories in an erroneous dataset has to be studied. We designed FromDaDy, a trajectory visualization tool that tackles the difficulties of exploring the visualization of multiple trails. This multidimensional data exploration is based on scatterplots, brushing, pick and drop, juxtaposed views and rapid visual design. Users can organize the workspace composed of multiple juxtaposed views. They can define the visual configuration of the views by connecting data dimensions from the dataset to Bertin's visual variables. They can then brush trajectories, and with a pick and drop operation they can spread the brushed information across views. They can then repeat these interactions, until they extract a set of relevant data, thus formulating complex queries. Through two real-world scenarios, we show how FromDaDy supports iterative queries and the extraction of trajectories in a dataset that contains up to 5 million data.",Christophe Hurter;Benjamin Tissoires;Stéphane Conversy,Christophe Hurter;Benjamin Tissoires;Stéphane Conversy,"DSNA/DTI R&D, ENAC and IRIT/IHCS;DSNA/DTI R&D, ENAC and IRIT/IHCS;ENAC and IRIT/IHCS",10.1109/INFVIS.2000.885086;10.1109/VISUAL.1995.485139;10.1109/VISUAL.1994.346302;10.1109/TVCG.2008.153;10.1109/INFVIS.2004.64,"visualization, iterative exploration, direct manipulation, trajectories",107,77,20,
InfoVis,2009,Scattering Points in Parallel Coordinates,10.1109/TVCG.2009.179,http://dx.doi.org/10.1109/TVCG.2009.179,1001,1008,J,"In this paper, we present a novel parallel coordinates design integrated with points (scattering points in parallel coordinates, SPPC), by taking advantage of both parallel coordinates and scatterplots. Different from most multiple views visualization frameworks involving parallel coordinates where each visualization type occupies an individual window, we convert two selected neighboring coordinate axes into a scatterplot directly. Multidimensional scaling is adopted to allow converting multiple axes into a single subplot. The transition between two visual types is designed in a seamless way. In our work, a series of interaction tools has been developed. Uniform brushing functionality is implemented to allow the user to perform data selection on both points and parallel coordinate polylines without explicitly switching tools. A GPU accelerated dimensional incremental multidimensional scaling (DIMDS) has been developed to significantly improve the system performance. Our case study shows that our scheme is more efficient than traditional multi-view methods in performing visual analysis tasks.",Xiaoru Yuan;Peihong Guo;He Xiao;Hong Zhou;Huamin Qu,Xiaoru Yuan;Peihong Guo;He Xiao;Hong Zhou;Huamin Qu,,10.1109/TVCG.2008.119;10.1109/INFVIS.2005.1532139;10.1109/VISUAL.1997.663867;10.1109/VISUAL.1990.146402;10.1109/INFVIS.2005.1532141;10.1109/VISUAL.1997.663916;10.1109/TVCG.2006.138;10.1109/VISUAL.1997.663866;10.1109/VISUAL.1996.567800;10.1109/INFVIS.2005.1532138;10.1109/INFVIS.2003.1249015;10.1109/VISUAL.1996.567787;10.1109/INFVIS.1998.729559;10.1109/INFVIS.2003.1249008;10.1109/INFVIS.2002.1173157;10.1109/VISUAL.1999.809866;10.1109/INFVIS.2003.1249023;10.1109/TVCG.2006.170;10.1109/INFVIS.2004.68;10.1109/INFVIS.2004.15;10.1109/TVCG.2008.153,"Parallel Coordinates, Scatterplots, Information Visualization, Multidimensional Scaling",107,76,44,
InfoVis,2010,Untangling Euler Diagrams,10.1109/TVCG.2010.210,http://dx.doi.org/10.1109/TVCG.2010.210,1090,1099,J,"In many common data analysis scenarios the data elements are logically grouped into sets. Venn and Euler style diagrams are a common visual representation of such set membership where the data elements are represented by labels or glyphs and sets are indicated by boundaries surrounding their members. Generating such diagrams automatically such that set regions do not intersect unless the corresponding sets have a non-empty intersection is a difficult problem. Further, it may be impossible in some cases if regions are required to be continuous and convex. Several approaches exist to draw such set regions using more complex shapes, however, the resulting diagrams can be difficult to interpret. In this paper we present two novel approaches for simplifying a complex collection of intersecting sets into a strict hierarchy that can be more easily automatically arranged and drawn (Figure 1). In the first approach, we use compact rectangular shapes for drawing each set, attempting to improve the readability of the set intersections. In the second approach, we avoid drawing intersecting set regions by duplicating elements belonging to multiple sets. We compared both of our techniques to the traditional non-convex region technique using five readability tasks. Our results show that the compact rectangular shapes technique was often preferred by experimental subjects even though the use of duplications dramatically improves the accuracy and performance time for most of our tasks. In addition to general set representation our techniques are also applicable to visualization of networks with intersecting clusters of nodes.",Nathalie Henry Riche;Tim Dwyer,Nathalie Henry Riche;Tim Dwyer,Microsoft Research;Microsoft Corporation Microsoft Corporation,10.1109/TVCG.2008.144;10.1109/TVCG.2007.70582;10.1109/INFVIS.2005.1532126;10.1109/TVCG.2008.141;10.1109/TVCG.2009.122;10.1109/TVCG.2006.156;10.1109/TVCG.2006.120;10.1109/TVCG.2008.130;10.1109/TVCG.2006.166;10.1109/VISUAL.1993.398863;10.1109/TVCG.2008.153,"Information Visualization, Euler diagrams, Set Visualization, Graph Visualization",107,78,33,
InfoVis,2011,Skeleton-Based Edge Bundling for Graph Visualization,10.1109/TVCG.2011.233,http://dx.doi.org/10.1109/TVCG.2011.233,2364,2373,J,"In this paper, we present a novel approach for constructing bundled layouts of general graphs. As layout cues for bundles, we use medial axes, or skeletons, of edges which are similar in terms of position information. We combine edge clustering, distance fields, and 2D skeletonization to construct progressively bundled layouts for general graphs by iteratively attracting edges towards the centerlines of level sets of their distance fields. Apart from clustering, our entire pipeline is image-based with an efficient implementation in graphics hardware. Besides speed and implementation simplicity, our method allows explicit control of the emphasis on structure of the bundled layout, i.e. the creation of strongly branching (organic-like) or smooth bundles. We demonstrate our method on several large real-world graphs.",Ozan Ersoy;Christophe Hurter;Fernando Vieira Paulovich;Gabriel Cantareiro;Alexandru Telea,Ozan Ersoy;Christophe Hurter;Fernando Paulovich;Gabriel Cantareiro;Alex Telea,"University of Groningen, The Netherlands;DGAC/DSNA, Toulouse, France;University of S&#x0E3;o Paulo, S&#x0E3;o Carlos/SP, Brazil;University of S&#x0E3;o Paulo, S&#x0E3;o Carlos/SP, Brazil;University of Groningen, The Netherlands",10.1109/TVCG.2008.135;10.1109/TVCG.2006.147;10.1109/TVCG.2007.70535;10.1109/TVCG.2006.120;10.1109/INFVIS.2005.1532150;10.1109/INFVIS.2003.1249030,"Graph layouts, edge bundles, image-based information visualization",107,84,36,
InfoVis,1995,Research report. Interacting with huge hierarchies: beyond cone trees,10.1109/INFVIS.1995.528689,http://dx.doi.org/10.1109/INFVIS.1995.528689,74,81,C,"The paper describes an implementation of a tool for visualizing and interacting with huge information hierarchies, and some preliminary empirical evaluation of the tool's efficacy. Existing systems for visualizing huge hierarchies using cone trees ""break down"" once the hierarchy to be displayed exceeds roughly 1000 nodes, due to increasing visual clutter. The paper describes a system called fsviz which visualizes arbitrarily large hierarchies while retaining user control. This is accomplished by augmenting cone trees with several graphical and interaction techniques: usage-based filtering, animated zooming, hand-coupled rotation, fish-eye zooming, coalescing of distant nodes, texturing, effective use of colour for depth cueing, and the applications of dynamic queries. The fsviz system also improves upon earlier cone tree visualization systems through a more elaborate node layout algorithm. This algorithm enhances the usefulness of cone tree visualization for large hierarchies by all but eliminating clutter.",S. Jeromy Carrière;Rick Kazman,J. Carriere;R. Kazman,"Dept. of Comput. Sci., Waterloo Univ., Ont., Canada;Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",,,106,27,10,
Vis,1998,A higher-order method for finding vortex core lines,10.1109/VISUAL.1998.745296,http://dx.doi.org/10.1109/VISUAL.1998.745296,143,150,C,"This paper presents a novel method to extract vortical structures from 3D CFD (computational fluid dynamics) vector fields automatically. It discusses the underlying theory and some aspects of the implementation. Making use of higher-order derivatives, the method is able to locate bent vortices. In order to structure the recognition procedure, we distinguish locating the core line from calculating attributes of strength and quality. Results are presented on several flow fields from the field of turbomachinery.",Martin Roth;Ronald Peikert,M. Roth;R. Peikert,"Center for Sci. Comput., Eidgenossische Tech. Hochschule, Zurich, Switzerland",10.1109/VISUAL.1996.568137;10.1109/VISUAL.1997.663912;10.1109/VISUAL.1995.480817;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1997.663910;10.1109/VISUAL.1994.346327;10.1109/VISUAL.1996.567807;10.1109/VISUAL.1997.663857;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1997.663858,,106,51,26,
Vis,1998,Progressive tetrahedralizations,10.1109/VISUAL.1998.745329,http://dx.doi.org/10.1109/VISUAL.1998.745329,397,402,C,"The paper describes some fundamental issues for robust implementations of progressively refined tetrahedralizations generated through sequences of edge collapses. We address the definition of appropriate cost functions and explain on various tests which are necessary to preserve the consistency of the mesh when collapsing edges. Although considered a special case of progressive simplicial complexes (J. Popovic and H. Hoppe, 1997), the results of our method are of high practical importance and can be used in many different applications, such as finite element meshing, scattered data interpolation, or rendering of unstructured volume data.",Oliver G. Staadt;Markus H. Gross,O.G. Staadt;M.H. Gross,"Comput. Graphics Res. Group, Fed.. Inst. of Technol., Zurich, Switzerland",10.1109/VISUAL.1997.663907;10.1109/VISUAL.1997.663901;10.1109/VISUAL.1997.663883,"mesh simplification, multiresolution, level-of-detail, unstructured meshes, mesh generation",106,42,16,
Vis,2000,Geometric compression for interactive transmission,10.1109/VISUAL.2000.885711,http://dx.doi.org/10.1109/VISUAL.2000.885711,319,326,C,"The compression of geometric structures is a relatively new field of data compression. Since about 1995, several articles have dealt with the coding of meshes, using for most of them the following approach: the vertices of the mesh are coded in an order that partially contains the topology of the mesh. In the same time, some simple rules attempt to predict the position of each vertex from the positions of its neighbors that have been previously coded. We describe a compression algorithm whose principle is completely different: the coding order of the vertices is used to compress their coordinates, and then the topology of the mesh is reconstructed from the vertices. This algorithm achieves compression ratios that are slightly better than those of the currently available algorithms, and moreover, it allows progressive and interactive transmission of the meshes.",Olivier Devillers;Pierre-Marie Gandoin,O. Devillers;P.-M. Gandoin,"Inst. Nat. de Recherche en Inf. et Autom., Sophia Antipolis, France",10.1109/VISUAL.1997.663902;10.1109/VISUAL.1999.809902;10.1109/VIS.1999.10000,"geometry, compression, coding, interactivity, mesh, reconstruction, terrain models",106,54,18,
Vis,2001,Visualization and interaction techniques for the exploration of vascular structures,10.1109/VISUAL.2001.964538,http://dx.doi.org/10.1109/VISUAL.2001.964538,395,402,C,"We describe a pipeline of image processing steps for deriving symbolic models of vascular structures from radiological data which reflect the branching pattern and diameter of vessels. For the visualization of these symbolic models, concatenated truncated cones are smoothly blended at branching points. We put emphasis on the quality of the visualizations which is achieved by anti-aliasing operations in different stages of the visualization. The methods presented are referred to as HQVV (high quality vessel visualization). Scalable techniques are provided to explore vascular structures of different orders of magnitude. The hierarchy as well as the diameter of the branches of vascular systems are used to restrict visualizations to relevant subtrees and to emphasize parts of vascular systems. Our research is inspired by clear visualizations in textbooks and is targeted toward medical education and therapy planning. We describe the application of vessel visualization techniques for liver surgery planning. For this application it is crucial to recognize the morphology and branching pattern of vascular systems as well as the basic spatial relations between vessels and other anatomic structures.",Horst K. Hahn;Bernhard Preim;Dirk Selle;Heinz-Otto Peitgen,H.K. Hahn;B. Preim;D. Selle;H.-O. Peitgen,"MeVis-Center for Med. Diagnostic Syst., Bremen, Germany;MeVis-Center for Med. Diagnostic Syst., Bremen, Germany;MeVis-Center for Med. Diagnostic Syst., Bremen, Germany;MeVis-Center for Med. Diagnostic Syst., Bremen, Germany",10.1109/VISUAL.1997.663917,"vessel visualization, medical visualization, computer-assisted surgery",106,47,22,
VAST,2007,Stories in GeoTime,10.1109/VAST.2007.4388992,http://dx.doi.org/10.1109/VAST.2007.4388992,19,26,C,"A story is a powerful abstraction used by intelligence analysts to conceptualize threats and understand patterns as part of the analytical process. This paper demonstrates a system that detects geo-temporal patterns and integrates story narration to increase analytic sense-making cohesion in GeoTime. The GeoTime geo-temporal event visualization tool was augmented with a story system that uses narratives, hypertext linked visualizations, visual annotations, and pattern detection to create an environment for analytic exploration and communication, thereby assisting the analyst in identifying, extracting, arranging and presenting stories within the data The story system lets analysts operate at the story level with higher-level abstractions of data, such as behaviors and events, while staying connected to the evidence. The story system was developed and evaluated in collaboration with analysts.",Ryan Eccles;Thomas Kapler;Robert Harper 0002;William Wright,Ryan Eccles;Thomas Kapler;Robert Harper;William Wright,Oculus Info Inc. reccles@oculusinfo.com;Oculus Info Inc. tkapler@oculusinfo.com;Oculus Info Inc. rharper@oculusinfo.com;Oculus Info Inc. bwright@oculusinfo.com,10.1109/INFVIS.2004.27;10.1109/VAST.2006.261436,"human information interaction, visual analytics, sense-making, narrative, pattern detection, story making, story telling",106,36,19,
InfoVis,2011,"Design Study of LineSets, a Novel Set Visualization Technique",10.1109/TVCG.2011.186,http://dx.doi.org/10.1109/TVCG.2011.186,2259,2267,J,"Computing and visualizing sets of elements and their relationships is one of the most common tasks one performs when analyzing and organizing large amounts of data. Common representations of sets such as convex or concave geometries can become cluttered and difficult to parse when these sets overlap in multiple or complex ways, e.g., when multiple elements belong to multiple sets. In this paper, we present a design study of a novel set visual representation, LineSets, consisting of a curve connecting all of the set's elements. Our approach to design the visualization differs from traditional methodology used by the InfoVis community. We first explored the potential of the visualization concept by running a controlled experiment comparing our design sketches to results from the state-of-the-art technique. Our results demonstrated that LineSets are advantageous for certain tasks when compared to concave shapes. We discuss an implementation of LineSets based on simple heuristics and present a study demonstrating that our generated curves do as well as human-drawn ones. Finally, we present two applications of our technique in the context of search tasks on a map and community analysis tasks in social networks.",Basak Alper;Nathalie Henry Riche;Gonzalo A. Ramos;Mary Czerwinski,Basak Alper;Nathalie Riche;Gonzalo Ramos;Mary Czerwinski,"Microsoft Research, UC Santa Barbara;Microsoft Research;Microsoft Research;Microsoft Research",10.1109/TVCG.2008.144;10.1109/TVCG.2010.210;10.1109/TVCG.2009.122;10.1109/INFVIS.2005.1532126,"Set visualization, clustering, faceted data visualization, graph visualization",106,82,22,
Vis,1993,HyperSlice - Visualization of Scalar Functions of Many Variables,10.1109/VISUAL.1993.398859,http://dx.doi.org/10.1109/VISUAL.1993.398859,119,125,C,"HyperSlice is a new method for the visualization of scalar functions of many variables. With this method the multi-dimensional function is presented in a simple and easy to understand way in which all dimensions are treated identically. The central concept is the representation of a multi-dimensional function as a matrix of orthogonal two-dimensional slices. These two-dimensional slices lend themselves very well to interaction via direct manipulation, due to a one to one relation between screen space and variable space. Several interaction techniques, for navigation, the location of maxima, and the use of user-defined paths, are presented.&lt;&lt;ETX&gt;&gt;",Jarke J. van Wijk;Robert van Liere,J.J. van Wijk;R. van Liere,"Netherlands Energy Res. Foundation, Petten, Netherlands;Netherlands Energy Res. Foundation, Petten, Netherlands",10.1109/VISUAL.1990.146387;10.1109/VISUAL.1991.175809,,105,55,9,
Vis,2000,Automatic alignment of high-resolution multi-projector displays using an uncalibrated camera,10.1109/VISUAL.2000.885685,http://dx.doi.org/10.1109/VISUAL.2000.885685,125,130,C,"A scalable, high-resolution display may be constructed by tiling many projected images over a single display surface. One fundamental challenge for such a display is to avoid visible seams due to misalignment among the projectors. Traditional methods for avoiding seams involve sophisticated mechanical devices and expensive CRT projectors, coupled with extensive human effort for fine-tuning the projectors. The paper describes an automatic alignment method that relies on an inexpensive, uncalibrated camera to measure the relative mismatches between neighboring projectors, and then correct the projected imagery to avoid seams without significant human effort.",Yuqun Chen;Douglas W. Clark;Adam Finkelstein;Timothy C. Housel;Kai Li 0001,Yuqun Chen;D.W. Clark;A. Finkelstein;T.C. Housel;Kai Li,"Dept. of Comput. Sci., Princeton Univ., NJ, USA",10.1109/VISUAL.1999.809883,"seamless tiling, automatic alignment, projective mapping, simulated annealing ",105,16,19,
Vis,2001,Efficient Adaptive Simplification of Massive Meshes,10.1109/VISUAL.2001.964503,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2001.964503,127,134,C,"The growing availability of massive polygonal models, and the inability of most existing visualization tools to work with such data, has created a pressing need for memory-efficient methods capable of simplifying very large meshes. In this paper, we present a method for performing adaptive simplification of polygonal meshes that are too large to fit in-core. Our algorithm performs two passes over an input mesh. In the first pass, the model is quantized using a uniform grid, and surface information is accumulated in the form of quadrics and dual quadrics. This sampling is then used to construct a BSP-tree in which the partitioning planes are determined by the dual quadrics. In the final pass, the original vertices are clustered using the BSP-tree, yielding an adaptive approximation of the original mesh. The BSP-tree describes a natural simplification hierarchy, making it possible to generate a progressive transmission and construct level-of-detail representations. In this way, the algorithm provides some of the features associated with more expensive edge contraction methods while maintaining greater computational efficiency. In addition to performing adaptive simplification, our algorithm exhibits output-sensitive memory requirements and allows fine control over the size of the simplified mesh.",Eric Shaffer;Michael Garland,E. Shaffer;M. Garland,"Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA;Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA",10.1109/VISUAL.2001.964502;10.1109/VISUAL.1998.745282;10.1109/VISUAL.1998.745314,"surface simplification, massive meshes, quadric error metric, recursive partitioning, out-of-core simplification",105,38,24,
Vis,2005,The magic volume lens: an interactive focus+context technique for volume rendering,10.1109/VISUAL.2005.1532818,http://dx.doi.org/10.1109/VISUAL.2005.1532818,367,374,C,"The size and resolution of volume datasets in science and medicine are increasing at a rate much greater than the resolution of the screens used to view them. This limits the amount of data that can be viewed simultaneously, potentially leading to a loss of overall context of the data when the user views or zooms into a particular area of interest. We propose a focus+context framework that uses various standard and advanced magnification lens rendering techniques to magnify the features of interest, while compressing the remaining volume regions without clipping them away completely. Some of these lenses can be interactively configured by the user to specify the desired magnification patterns, while others are feature-adaptive. All our lenses are accelerated on the GPU. They allow the user to interactively manage the available screen area, dedicating more area to the more resolution-important features.",Lujin Wang;Ye Zhao;Klaus Mueller;Arie E. Kaufman,L. Wang;Y. Zhao;K. Mueller;A. Kaufman,"Center for Visual Comput., Comput. Sci., Stony Brook Univ., NY, USA;Center for Visual Comput., Comput. Sci., Stony Brook Univ., NY, USA;Center for Visual Comput., Comput. Sci., Stony Brook Univ., NY, USA;Center for Visual Comput., Comput. Sci., Stony Brook Univ., NY, USA",10.1109/INFVIS.1997.636786;10.1109/INFVIS.1996.559215;10.1109/INFVIS.1996.559214;10.1109/VISUAL.2001.964552;10.1109/VISUAL.2003.1250386;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2004.48;10.1109/VISUAL.2003.1250400;10.1109/VISUAL.2000.885697,"Focus+Context Techniques,Lens,Volume Rendering, Hardware-assisted Volume Rendering",105,30,25,
Vis,2006,Exploded Views for Volume Data,10.1109/TVCG.2006.140,http://dx.doi.org/10.1109/TVCG.2006.140,1077,1084,J,"Exploded views are an illustration technique where an object is partitioned into several segments. These segments are displaced to reveal otherwise hidden detail. In this paper we apply the concept of exploded views to volumetric data in order to solve the general problem of occlusion. In many cases an object of interest is occluded by other structures. While transparency or cutaways can be used to reveal a focus object, these techniques remove parts of the context information. Exploded views, on the other hand, do not suffer from this drawback. Our approach employs a force-based model: the volume is divided into a part configuration controlled by a number of forces and constraints. The focus object exerts an explosion force causing the parts to arrange according to the given constraints. We show that this novel and flexible approach allows for a wide variety of explosion-based visualizations including view-dependent explosions. Furthermore, we present a high-quality GPU-based volume ray casting algorithm for exploded views which allows rendering and interaction at several frames per second",Stefan Bruckner;M. Eduard Gröller,Stefan Bruckner;M. Eduard Groller,"Institute of Computer Graphics and Algorithms, Vienna University of Technology;Institute of Computer Graphics and Algorithms, Vienna University of Technology",10.1109/VISUAL.2003.1250400;10.1109/VISUAL.2005.1532783;10.1109/VISUAL.2005.1532856;10.1109/VISUAL.2005.1532807;10.1109/VISUAL.2003.1250384;10.1109/INFVIS.1996.559215;10.1109/VISUAL.2004.104;10.1109/VISUAL.2005.1532817,"Illustrative visualization, exploded views, volume rendering",105,72,35,
InfoVis,2009,MizBee: A Multiscale Synteny Browser,10.1109/TVCG.2009.167,http://dx.doi.org/10.1109/TVCG.2009.167,897,904,J,"In the field of comparative genomics, scientists seek to answer questions about evolution and genomic function by comparing the genomes of species to find regions of shared sequences. Conserve dsyntenic blocks are an important biological data abstraction for indicating regions of shared sequences. The goal of this work is to show multiple types of relationships at multiple scales in a way that is visually comprehensible in accordance with known perceptual principles. We present a task analysis for this domain where the fundamental questions asked by biologists can be understood by a characterization of relationships into the four types of proximity/location, size, orientation, and similarity/strength, and the four scales of genome, chromosome, block, and genomic feature. We also propose a new taxonomy of the design space for visually encoding conservation data. We present MizBee, a multiscale synteny browser with the unique property of providing interactive side-by-side views of the data across the range of scales supporting exploration of all of these relationship types. We conclude with case studies from two biologists who used MizBee to augment their previous automatic analysis work flow, providing anecdotal evidence about the efficacy of the system for the visualization of syntenic data, the analysis of conservation relationships, and the communication of scientific insights.",Miriah D. Meyer;Tamara Munzner;Hanspeter Pfister,Miriah Meyer;Tamara Munzner;Hanspeter Pfister,Harvard University;University of British Columbia;Harvard University,10.1109/INFVIS.2005.1532134;10.1109/TVCG.2006.147,"Information visualization, design study, bioinformatics, synteny",105,86,23,HM
Vis,1995,Voxel based object simplification,10.1109/VISUAL.1995.485142,http://dx.doi.org/10.1109/VISUAL.1995.485142,296,"303, 465",C,"Presents a simple, robust and practical method for object simplification for applications where gradual elimination of high-frequency details is desired. This is accomplished by sampling and low-pass filtering the object into multi-resolution volume buffers and applying the marching cubes algorithm to generate a multi-resolution triangle-mesh hierarchy. Our method simplifies the genus of objects and can also help existing object simplification algorithms achieve better results. At each level of detail, a multi-layered mesh can be used for an optional and efficient antialiased rendering.",Taosong He;Lichan Hong;Arie E. Kaufman;Amitabh Varshney;Sidney W. Wang,Taosong He;Lichan Hong;A. Kaufman;A. Varshney;S. Wang,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1992.235229,,104,20,18,
Vis,1999,Progressive compression and transmission of arbitrary triangular meshes,10.1109/VISUAL.1999.809902,http://dx.doi.org/10.1109/VISUAL.1999.809902,307,537,C,"The recent growth in the size and availability of large triangular surface models has generated interest in compact multi-resolution progressive representation and data transmission. An ongoing challenge is to design an efficient data structure that encompasses both compactness of geometric representations and visual quality of progressive representations. We introduce a topological layering based data structure and an encoding scheme to build a compact progressive representation of an arbitrary triangular mesh (a 2D simplicial complex in 3D) with attached attribute data. This compact representation is composed of multiple levels of detail that can be progressively transmitted and displayed. The global topology, which is the number of holes and connected components, can be flexibly changed among successive levels while still achieving guaranteed size of the coarsest level mesh for very complex models. The flexibility in our encoding scheme also allows topology preserving progressivity.",Chandrajit L. Bajaj;Valerio Pascucci;Guozhong Zhuang,C.L. Bajaj;V. Pascucci;G. Zhuang,"Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",10.1109/VISUAL.1998.745283;10.1109/VISUAL.1997.663883,,104,35,26,
Vis,2006,Understanding the Structure of the Turbulent Mixing Layer in Hydrodynamic Instabilities,10.1109/TVCG.2006.186,http://dx.doi.org/10.1109/TVCG.2006.186,1053,1060,J,"When a heavy fluid is placed above a light fluid, tiny vertical perturbations in the interface create a characteristic structure of rising bubbles and falling spikes known as Rayleigh-Taylor instability. Rayleigh-Taylor instabilities have received much attention over the past half-century because of their importance in understanding many natural and man-made phenomena, ranging from the rate of formation of heavy elements in supernovae to the design of capsules for Inertial Confinement Fusion. We present a new approach to analyze Rayleigh-Taylor instabilities in which we extract a hierarchical segmentation of the mixing envelope surface to identify bubbles and analyze analogous segmentations of fields on the original interface plane. We compute meaningful statistical information that reveals the evolution of topological features and corroborates the observations made by scientists. We also use geometric tracking to follow the evolution of single bubbles and highlight merge/split events leading to the formation of the large and complex structures characteristic of the later stages. In particular we (i) Provide a formal definition of a bubble; (ii) Segment the envelope surface to identify bubbles; (iii) Provide a multi-scale analysis technique to produce statistical measures of bubble growth; (iv) Correlate bubble measurements with analysis of fields on the interface plane; (v) Track the evolution of individual bubbles over time. Our approach is based on the rigorous mathematical foundations of Morse theory and can be applied to a more general class of applications",David E. Laney;Peer-Timo Bremer;Ajith Mascarenhas;Paul L. Miller;Valerio Pascucci,D. Laney;P.-t. Bremer;A. Mascarenhas;P. Miller;V. Pascucci,Lawrence Livermore National Laboratory. Corresponding author: Daniel Laney;Lawrence Livermore National Laboratory. Corresponding author: Daniel Laney;Lawrence Livermore National Laboratory. Corresponding author: Daniel Laney;Lawrence Livermore National Laboratory. Corresponding author: Daniel Laney;Lawrence Livermore National Laboratory. Corresponding author: Daniel Laney,10.1109/VISUAL.2003.1250376;10.1109/VISUAL.2002.1183772;10.1109/VISUAL.2005.1532842;10.1109/VISUAL.2000.885716;10.1109/VISUAL.2004.96;10.1109/VISUAL.2003.1250408;10.1109/VISUAL.2004.107;10.1109/VISUAL.1999.809907;10.1109/VISUAL.1998.745288;10.1109/VISUAL.2005.1532839,"topology, multi-resolution, Morse theory",104,89,33,BA
Vis,2007,Querying and Creating Visualizations by Analogy,10.1109/TVCG.2007.70584,http://dx.doi.org/10.1109/TVCG.2007.70584,1560,1567,J,"While there have been advances in visualization systems, particularly in multi-view visualizations and visual exploration, the process of building visualizations remains a major bottleneck in data exploration. We show that provenance metadata collected during the creation of pipelines can be reused to suggest similar content in related visualizations and guide semi-automated changes. We introduce the idea of query-by-example in the context of an ensemble of visualizations, and the use of analogies as first-class operations in a system to guide scalable interactions. We describe an implementation of these techniques in VisTrails, a publicly-available, open-source system.",Carlos Scheidegger;Huy T. Vo;David Koop;Juliana Freire;Cláudio T. Silva,Carlos Scheidegger;Huy Vo;David Koop;Juliana Freire;Claudio Silva,Scientific Computing and Imaging (SCI) Institute at the University of Utah;Scientific Computing and Imaging (SCI) Institute at the University of Utah;Scientific Computing and Imaging (SCI) Institute at the University of Utah;School of Computing at the University of Utah;Scientific Computing and Imaging (SCI) Institute at the University of Utah,10.1109/VISUAL.2005.1532781;10.1109/INFVIS.2004.2;10.1109/VISUAL.2004.112;10.1109/VISUAL.2005.1532788;10.1109/VISUAL.2005.1532795,"visualization systems, query-by-example, analogy",104,57,31,BP
Vis,2003,Compression domain volume rendering,10.1109/VISUAL.2003.1250385,http://dx.doi.org/10.1109/VISUAL.2003.1250385,293,300,C,"A survey of graphics developers on the issue of texture mapping hardware for volume rendering would most likely find that the vast majority of them view limited texture memory as one of the most serious drawbacks of an otherwise fine technology. In this paper, we propose a compression scheme for static and time-varying volumetric data sets based on vector quantization that allows us to circumvent this limitation. We describe a hierarchical quantization scheme that is based on a multiresolution covariance analysis of the original field. This allows for the efficient encoding of large-scale data sets, yet providing a mechanism to exploit temporal coherence in non-stationary fields. We show, that decoding and rendering the compressed data stream can be done on the graphics chip using programmable hardware. In this way, data transfer between the CPU and the graphics processing unit (GPU) can be minimized thus enabling flexible and memory efficient real-time rendering options. We demonstrate the effectiveness of our approach by demonstrating interactive renditions of Gigabyte data sets at reasonable fidelity on commodity graphics hardware.",Jens Schneider;Rüdiger Westermann,J. Schneider;R. Westermann,"Comput. Graphics & Visualization Group, Tech. Univ. Munich, Germany;Comput. Graphics & Visualization Group, Tech. Univ. Munich, Germany",10.1109/VISUAL.1999.809910;10.1109/VISUAL.2002.1183757;10.1109/VISUAL.2001.964520;10.1109/VISUAL.2002.1183771;10.1109/VISUAL.2002.1183764;10.1109/VISUAL.2001.964519,"Volume Rendering, Vector Quantization, Texture Compression, Graphics Hardware",103,35,41,
Vis,2008,Estimating Crossing fibers: A Tensor Decomposition Approach,10.1109/TVCG.2008.128,http://dx.doi.org/10.1109/TVCG.2008.128,1635,1642,J,"Diffusion weighted magnetic resonance imaging is a unique tool for non-invasive investigation of major nerve fiber tracts. Since the popular diffusion tensor (DT-MRI) model is limited to voxels with a single fiber direction, a number of high angular resolution techniques have been proposed to provide information about more diverse fiber distributions. Two such approaches are Q-Ball imaging and spherical deconvolution, which produce orientation distribution functions (ODFs) on the sphere. For analysis and visualization, the maxima of these functions have been used as principal directions, even though the results are known to be biased in case of crossing fiber tracts. In this paper, we present a more reliable technique for extracting discrete orientations from continuous ODFs, which is based on decomposing their higher-order tensor representation into an isotropic component, several rank-1 terms, and a small residual. Comparing to ground truth in synthetic data shows that the novel method reduces bias and reliably reconstructs crossing fibers which are not resolved as individual maxima in the ODF We present results on both Q-Ball and spherical deconvolution data and demonstrate that the estimated directions allow for plausible fiber tracking in a real data set.",Thomas Schultz 0001;Hans-Peter Seidel,Thomas Schultz;Hans-Peter Seidel,MPI Informatik;MPI Informatik,10.1109/VISUAL.2005.1532773,"DW-MRI, Q-Ball, spherical deconvolution, fiber tracking, higher-order tensor, tensor decomposition",103,83,42,
Vis,2008,Importance-Driven Time-Varying Data Visualization,10.1109/TVCG.2008.140,http://dx.doi.org/10.1109/TVCG.2008.140,1547,1554,J,"The ability to identify and present the most essential aspects of time-varying data is critically important in many areas of science and engineering. This paper introduces an importance-driven approach to time-varying volume data visualization for enhancing that ability. By conducting a block-wise analysis of the data in the joint feature-temporal space, we derive an importance curve for each data block based on the formulation of conditional entropy from information theory. Each curve characterizes the local temporal behavior of the respective block, and clustering the importance curves of all the volume blocks effectively classifies the underlying data. Based on different temporal trends exhibited by importance curves and their clustering results, we suggest several interesting and effective visualization techniques to reveal the important aspects of time-varying data.",Chaoli Wang 0001;Hongfeng Yu;Kwan-Liu Ma,Chaoli Wang;Hongfeng Yu;Kwan-Liu Ma,"University of California, Davis;University of California, Davis;University of California, Davis",10.1109/VISUAL.1995.480809;10.1109/VISUAL.2003.1250402;10.1109/TVCG.2007.70615;10.1109/TVCG.2006.152;10.1109/VISUAL.2001.964531;10.1109/VISUAL.1994.346321;10.1109/VISUAL.1999.809910;10.1109/VISUAL.2004.48,"Time-varying data, conditional entropy, joint feature-temporal space, clustering, highlighting, transfer function",103,96,18,
InfoVis,1997,A spreadsheet approach to information visualization,10.1109/INFVIS.1997.636761,http://dx.doi.org/10.1109/INFVIS.1997.636761,17,24,C,"In information visualization, as the volume and complexity of the data increases, researchers require more powerful visualization tools that enable them to more effectively explore multidimensional datasets. We discuss the general utility of a novel visualization spreadsheet framework. Just as a numerical spreadsheet enables exploration of numbers, a visualization spreadsheet enables exploration of visual forms of information. We show that the spreadsheet approach facilitates certain information visualization tasks that are more difficult using other approaches. Unlike traditional spreadsheets, which store only simple data elements and formulas in each cell, a visualization spreadsheet cell can hold an entire complex data set, selection criteria, viewing specifications, and other information needed for a full-fledged information visualization. Similarly, inter-cell operations are far more complex, stretching beyond simple arithmetic and string operations to encompass a range of domain-specific operators. We have built two prototype systems that illustrate some of these research issues. The underlying approach in our work allows domain experts to define new data types and data operations, and enables visualization experts to incorporate new visualizations, viewing parameters, and view operations.",Ed H. Chi;Phillip Barry;John Riedl;Joseph A. Konstan,E.H.-H. Chi;P. Barry;J. Riedl;J. Konstan,"Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA",10.1109/VISUAL.1996.567796;10.1109/VISUAL.1996.567752;10.1109/INFVIS.1995.528690;10.1109/VISUAL.1995.480794;10.1109/VISUAL.1993.398859,,102,17,35,
Vis,2003,Interactive deformation and visualization of level set surfaces using graphics hardware,10.1109/VISUAL.2003.1250357,http://dx.doi.org/10.1109/VISUAL.2003.1250357,75,82,C,"Deformable isosurfaces, implemented with level-set methods, have demonstrated a great potential in visualization for applications such as segmentation, surface processing, and surface reconstruction. Their usefulness has been limited, however, by their high computational cost and reliance on significant parameter tuning. This paper presents a solution to these challenges by describing graphics processor (GPU) based on algorithms for solving and visualizing level-set solutions at interactive rates. Our efficient GPU-based solution relies on packing the level-set isosurface data into a dynamic, sparse texture format. As the level set moves, this sparse data structure is updated via a novel GPU to CPU message passing scheme. When the level-set solver is integrated with a real-time volume renderer operating on the same packed format, a user can visualize and steer the deformable level-set surface as it evolves. In addition, the resulting isosurface can serve as a region-of-interest specifier for the volume renderer. This paper demonstrates the capabilities of this technology for interactive volume visualization and segmentation.",Aaron E. Lefohn;Joe Michael Kniss;Charles D. Hansen;Ross T. Whitaker,A.E. Lefohn;J.M. Kniss;C.D. Hansen;R.T. Whitaker,"Sch. of Comput. & Imaging Inst., Utah Univ., Salt Lake, UT, USA;Sch. of Comput. & Imaging Inst., Utah Univ., Salt Lake, UT, USA;Sch. of Comput. & Imaging Inst., Utah Univ., Salt Lake, UT, USA;Sch. of Comput. & Imaging Inst., Utah Univ., Salt Lake, UT, USA",10.1109/VISUAL.2002.1183766;10.1109/VISUAL.2003.1250412;10.1109/VISUAL.2003.1250369,"Deformable Models, Image Segmentation, Volume Visualization, GPU, Level Sets, Streaming Computation",102,36,36,
Vis,2003,Signed distance transform using graphics hardware,10.1109/VISUAL.2003.1250358,http://dx.doi.org/10.1109/VISUAL.2003.1250358,83,90,C,"This paper presents a signed distance transform algorithm using graphics hardware, which computes the scalar valued function of the Euclidean distance to a given manifold of co-dimension one. If the manifold is closed and orientable, the distance has a negative sign on one side of the manifold and a positive sign on the other. Triangle meshes are considered for the representation of a two-dimensional manifold and the distance function is sampled on a regular Cartesian grid. In order to achieve linear complexity in the number of grid points, to each primitive we assign a simple polyhedron enclosing its Voronoi cell. Voronoi cells are known to contain exactly all points that lay closest to its corresponding primitive. Thus, the distance to the primitive only has to be computed for grid points inside its polyhedron. Although Voronoi cells partition space, the polyhedrons enclosing these cells do overlap. In regions where these overlaps occur, the minimum of all computed distances is assigned to a grid point. In order to speed up computations, points inside each polyhedron are determined by scan conversion of grid slices using graphics hardware. For this task, a fragment program is used to perform the nonlinear interpolation and minimization of distance values.",Christian Sigg;Ronald Peikert;Markus H. Gross,C. Sigg;R. Peikert;M. Gross,"Dept. of Comput. Sci., ETH Zurich, Switzerland;Dept. of Comput. Sci., ETH Zurich, Switzerland;Dept. of Comput. Sci., ETH Zurich, Switzerland",10.1109/VISUAL.2001.964518;10.1109/VISUAL.2001.964517,"Distance field, distance transform, Voronoi diagram, fragment program, scan conversion",102,50,16,
InfoVis,2007,Interactive Tree Comparison for Co-located Collaborative Information Visualization,10.1109/TVCG.2007.70568,http://dx.doi.org/10.1109/TVCG.2007.70568,1232,1239,J,"In many domains, increased collaboration has lead to more innovation by fostering the sharing of knowledge, skills, and ideas. Shared analysis of information visualizations does not only lead to increased information processing power, but team members can also share, negotiate, and discuss their views and interpretations on a dataset and contribute unique perspectives on a given problem. Designing technologies to support collaboration around information visualizations poses special challenges and relatively few systems have been designed. We focus on supporting small groups collaborating around information visualizations in a co-located setting, using a shared interactive tabletop display. We introduce an analysis of challenges and requirements for the design of co-located collaborative information visualization systems. We then present a new system that facilitates hierarchical data comparison tasks for this type of collaborative work. Our system supports multi-user input, shared and individual views on the hierarchical data visualization, flexible use of representations, and flexible workspace organization to facilitate group work around visualizations.",Petra Isenberg;Sheelagh Carpendale,Petra Isenberg;Sheelagh Carpendale,,10.1109/INFVIS.2000.885091;10.1109/TVCG.2006.184,"Information visualization, collaboration, co-located work, hierarchical data comparison",102,62,41,
InfoVis,2012,PivotPaths: Strolling through Faceted Information Spaces,10.1109/TVCG.2012.252,http://dx.doi.org/10.1109/TVCG.2012.252,2709,2718,J,"We present PivotPaths, an interactive visualization for exploring faceted information resources. During both work and leisure, we increasingly interact with information spaces that contain multiple facets and relations, such as authors, keywords, and citations of academic publications, or actors and genres of movies. To navigate these interlinked resources today, one typically selects items from facet lists resulting in abrupt changes from one subset of data to another. While filtering is useful to retrieve results matching specific criteria, it can be difficult to see how facets and items relate and to comprehend the effect of filter operations. In contrast, the PivotPaths interface exposes faceted relations as visual paths in arrangements that invite the viewer to `take a stroll' through an information space. PivotPaths supports pivot operations as lightweight interaction techniques that trigger gradual transitions between views. We designed the interface to allow for casual traversal of large collections in an aesthetically pleasing manner that encourages exploration and serendipitous discoveries. This paper shares the findings from our iterative design-and-evaluation process that included semi-structured interviews and a two-week deployment of PivotPaths applied to a large database of academic publications.",Marian Dörk;Nathalie Henry Riche;Gonzalo A. Ramos;Susan T. Dumais,Marian Dörk;Nathalie Henry Riche;Gonzalo Ramos;Susan Dumais,University of Calgary;Microsoft;Microsoft;Microsoft,10.1109/VAST.2009.5333443;10.1109/TVCG.2010.154;10.1109/VAST.2006.261426;10.1109/VAST.2007.4389006;10.1109/VAST.2008.4677370;10.1109/TVCG.2007.70539;10.1109/TVCG.2008.175,"Information visualization, interactivity, node-link diagrams, animation, information seeking, exploratory search",102,83,24,
Vis,1993,Implicit stream surfaces,10.1109/VISUAL.1993.398875,http://dx.doi.org/10.1109/VISUAL.1993.398875,245,252,C,"Streamlines and stream surfaces are well known techniques for the visualization of fluid flow. For steady velocity fields, a streamline is the trace of a particle, and a stream surface is the trace of a curve. Here a new method is presented for the construction of stream surfaces. The central concept is the representation of a stream surface as an implicit surface f (x) = C. After the initial calculation of f a family of stream surfaces can be generated efficiently by varying C. The shapes of the originating curves are defined by the value of f at the boundary. Two techniques are presented for the calculation of f: one based on solving the convection equation, the other on backward tracing of the trajectories of grid points. The flow around objects is discussed separately. With this method irregular topologies of the originating curves and of the stream surfaces can be handled easily. Further, it can also be used for other visualization techniques, such as time surfaces and stream volumes. Finally, an effective method for the automatic placement of originating curves is presented.&lt;&lt;ETX&gt;&gt;",Jarke J. van Wijk,J.J. van Wijk,"Netherlands Energy Res. Foundation, Petten, Netherlands",10.1109/VISUAL.1992.235211;10.1109/VISUAL.1992.235225;10.1109/VISUAL.1990.146359,,101,49,13,
Vis,1997,Multiresolution tetrahedral framework for visualizing regular volume data,10.1109/VISUAL.1997.663869,http://dx.doi.org/10.1109/VISUAL.1997.663869,135,142,C,"The authors present a multiresolution framework, called Multi-Tetra framework, that approximates volume data with different levels-of-detail tetrahedra. The framework is generated through a recursive subdivision of the volume data and is represented by binary trees. Instead of using a certain level of the Multi-Tetra framework for approximation, an error-based model (EBM) is generated by recursively fusing a sequence of tetrahedra from different levels of the Multi-Tetra framework. The EBM significantly reduces the number of voxels required to model an object, while preserving the original topology. The approach provides continuous distribution of rendered intensity or generated isosurfaces along boundaries of different levels-of-detail thus solving the crack problem. The model supports typical rendering approaches, such as marching cubes, direct volume projection, and splatting. Experimental results demonstrate the strengths of the approach.",Yong Zhou 0001;Baoquan Chen;Arie E. Kaufman,Yong Zhou;Baoquan Chen;A. Kaufman,"Center for Visual Comput., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1996.568127,"volume visualization, multiresolution volume, level of detail, isosurface extraction, volume subdivision, polygon simplification",101,34,15,
InfoVis,2001,"2D vs 3D, implications on spatial memory",10.1109/INFVIS.2001.963291,http://dx.doi.org/10.1109/INFVIS.2001.963291,139,145,C,"Since the introduction of graphical user interfaces (GUI) and two-dimensional (2D) displays, the concept of space has entered the information technology (IT) domain. Interactions with computers were re-encoded in terms of fidelity to the interactions with real environment and consequently in terms of fitness to cognitive and spatial abilities. A further step in this direction was the creation of three-dimensional (3D) displays which have amplified the fidelity of digital representations. However, there are no systematic results evaluating the extent to which 3D displays better support cognitive spatial abilities. The aim of this research is to empirically investigate spatial memory performance across different instances of 2D and 3D displays. Two experiments were performed. The displays used in the experimental situation represented hierarchical information structures. The results of the test show that the 3D display does improve performances in the designed spatial memory task.",Monica Tavanti;Mats Lind,M. Tavanti;M. Lind,University Sweden,,,101,47,11,
Vis,2001,Fitting Subdivision Surfaces,10.1109/VISUAL.2001.964527,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2001.964527,319,324,C,"We introduce a new algorithm for fitting a Catmull-Clark subdivision surface to a given shape within a prescribed tolerance, based on the method of quasi-interpolation. The fitting algorithm is fast, local and scales well since it does not require the solution of linear systems. Its convergence rate is optimal for regular meshes and our experiments show that it behaves very well for irregular meshes. We demonstrate the power and versatility of our method with examples from interactive modeling, surface fitting, and scientific visualization.",Nathan Litke;Adi Levin;Peter Schröder,N. Litke;A. Levin;P. Schroder,,,"Animation, CAD, Curves & Surfaces, Geometric Modeling, Digital Geometry Processing, Subdivision Schemes, Approximation, Quasi-Interpolation, Catmull-Clark",101,18,18,
VAST,2006,A Visual Interface for Multivariate Temporal Data: Finding Patterns of Events across Multiple Histories,10.1109/VAST.2006.261421,http://dx.doi.org/10.1109/VAST.2006.261421,167,174,C,"Finding patterns of events over time is important in searching patient histories, Web logs, news stories, and criminal activities. This paper presents PatternFinder, an integrated interface for query and result-set visualization for search and discovery of temporal patterns within multivariate and categorical data sets. We define temporal patterns as sequences of events with inter-event time spans. PatternFinder allows users to specify the attributes of events and time spans to produce powerful pattern queries that are difficult to express with other formalisms. We characterize the range of queries PatternFinder supports as users vary the specificity at which events and time spans are defined. Pattern Finder's query capabilities together with coupled ball-and-chain and tabular visualizations enable users to effectively query, explore and analyze event patterns both within and across data entities (e.g. patient histories, terrorist groups, Web logs, etc.)",Jerry Alan Fails;Amy K. Karlson;Layla Shahamat;Ben Shneiderman,Jerry Alan Fails;Amy Karlson;Layla Shahamat;Ben Shneiderman,"Department of Computer Science & Human-Computer Interaction Lab, University of Maryland, A. V. Williams Building, College Park, Maryland 20742. fails@cs.umd.edu;Department of Computer Science & Human-Computer Interaction Lab, University of Maryland, A. V. Williams Building, College Park, Maryland 20742. akk@cs.umd.edu;Department of Computer Science & Human-Computer Interaction Lab, University of Maryland, A. V. Williams Building, College Park, Maryland 20742. laylas@cs.umd.edu;Department of Computer Science & Human-Computer Interaction Lab, University of Maryland, A. V. Williams Building, College Park, Maryland 20742. ben@cs.umd.edu",10.1109/INFVIS.2001.963273,"Temporal query, information visualization, user interface",101,60,27,TT
InfoVis,2007,Visualizing Changes of Hierarchical Data using Treemaps,10.1109/TVCG.2007.70529,http://dx.doi.org/10.1109/TVCG.2007.70529,1286,1293,J,"While the treemap is a popular method for visualizing hierarchical data, it is often difficult for users to track layout and attribute changes when the data evolve over time. When viewing the treemaps side by side or back and forth, there exist several problems that can prevent viewers from performing effective comparisons. Those problems include abrupt layout changes, a lack of prominent visual patterns to represent layouts, and a lack of direct contrast to highlight differences. In this paper, we present strategies to visualize changes of hierarchical data using treemaps. A new treemap layout algorithm is presented to reduce abrupt layout changes and produce consistent visual patterns. Techniques are proposed to effectively visualize the difference and contrast between two treemap snapshots in terms of the map items' colors, sizes, and positions. Experimental data show that our algorithm can achieve a good balance in maintaining a treemap's stability, continuity, readability, and average aspect ratio. A software tool is created to compare treemaps and generate the visualizations. User studies show that the users can better understand the changes in the hierarchy and layout, and more quickly notice the color and size differences using our method.",Ying Tu;Han-Wei Shen,Ying Tu;Han-Wei Shen,Computer Science and Engineering Department at the Ohio State University;Computer Science and Engineering Department at the Ohio State University,10.1109/INFVIS.1999.801860;10.1109/INFVIS.2005.1532145;10.1109/TVCG.2006.200;10.1109/VISUAL.1991.175815,"Treemap, tree comparison, visualize changes, treemap layout algorithm",101,69,14,
VAST,2014,Progressive Visual Analytics: User-Driven Visual Exploration of In-Progress Analytics,10.1109/TVCG.2014.2346574,http://dx.doi.org/10.1109/TVCG.2014.2346574,1653,1662,J,"As datasets grow and analytic algorithms become more complex, the typical workflow of analysts launching an analytic, waiting for it to complete, inspecting the results, and then re-Iaunching the computation with adjusted parameters is not realistic for many real-world tasks. This paper presents an alternative workflow, progressive visual analytics, which enables an analyst to inspect partial results of an algorithm as they become available and interact with the algorithm to prioritize subspaces of interest. Progressive visual analytics depends on adapting analytical algorithms to produce meaningful partial results and enable analyst intervention without sacrificing computational speed. The paradigm also depends on adapting information visualization techniques to incorporate the constantly refining results without overwhelming analysts and provide interactions to support an analyst directing the analytic. The contributions of this paper include: a description of the progressive visual analytics paradigm; design goals for both the algorithms and visualizations in progressive visual analytics systems; an example progressive visual analytics system (Progressive Insights) for analyzing common patterns in a collection of event sequences; and an evaluation of Progressive Insights and the progressive visual analytics paradigm by clinical researchers analyzing electronic medical records.",Charles D. Stolper;Adam Perer;David Gotz,Charles D. Stolper;Adam Perer;David Gotz,"School of Interactive Computing, Georgia Institute of Technology;IBM T.J. Watson Research Center;University of North Carolina at Chapel Hill",10.1109/VAST.2006.261421;10.1109/TVCG.2013.227;10.1109/TVCG.2009.187;10.1109/TVCG.2011.179;10.1109/INFVIS.2005.1532133;10.1109/TVCG.2012.225;10.1109/TVCG.2013.179;10.1109/INFVIS.2000.885097;10.1109/TVCG.2013.200,"Progressive visual analytics, information visualization, interactive machine learning, electronic medical records",101,85,43,
Vis,2000,A topology simplification method for 2D vector fields,10.1109/VISUAL.2000.885716,http://dx.doi.org/10.1109/VISUAL.2000.885716,359,366,C,"Topology analysis of plane, turbulent vector fields results in visual clutter caused by critical points indicating vortices of finer and finer scales. A simplification can be achieved by merging critical points within a prescribed radius into higher order critical points. After building clusters containing the singularities to merge, the method generates a piecewise linear representation of the vector field in each cluster containing only one (higher order) singularity. Any visualization method can be applied to the result after this process. Using different maximal distances for the critical points to be merged results in a hierarchy of simplified vector fields that can be used for analysis on different scales.",Xavier Tricoche;Gerik Scheuermann;Hans Hagen,X. Tricoche;G. Scheuermann;H. Hagen,"Dept. of Comput. Sci., Kaiserslautern Univ., Germany",10.1109/VISUAL.1999.809863;10.1109/VISUAL.1998.745318;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1999.809907;10.1109/VISUAL.1997.663858,"vector field topology, flow visualization, clustering,simplification",100,51,12,
Vis,2003,A novel interface for higher-dimensional classification of volume data,10.1109/VISUAL.2003.1250413,http://dx.doi.org/10.1109/VISUAL.2003.1250413,505,512,C,"In the traditional volume visualization paradigm, the user specifies a transfer function that assigns each scalar value to a color and opacity by defining an opacity and a color map function. The transfer function has two limitations. First, the user must define curves based on histogram and value rather than seeing and working with the volume itself. Second, the transfer function is inflexible in classifying regions of interest, where values at a voxel such as intensity and gradient are used to differentiate material, not talking into account additional properties such as texture and position. We describe an intuitive user interface for specifying the classification functions that consists of the users painting directly on sample slices of the volume. These painted regions are used to automatically define high-dimensional classification functions that can be implemented in hardware for interactive rendering. The classification of the volume is iteratively improved as the user paints samples, allowing intuitive and efficient viewing of materials of interest.",Fan-Yin Tzeng;Eric B. Lum;Kwan-Liu Ma,Fan-Yin Tzeng;E.B. Lum;Kwan-Liu Ma,"Dept. of Comput. Sci., California Univ., Davis, CA, USA;Dept. of Comput. Sci., California Univ., Davis, CA, USA;Dept. of Comput. Sci., California Univ., Davis, CA, USA",10.1109/VISUAL.1998.745319;10.1109/VISUAL.2001.964519;10.1109/VISUAL.1999.809932;10.1109/VISUAL.1997.663875;10.1109/VISUAL.1996.568113,"classification, graphics hardware, interactive visualization, multidimensional transfer function, neural network, user interface design, volume visualization",99,38,25,
InfoVis,2007,Hotmap: Looking at Geographic Attention,10.1109/TVCG.2007.70561,http://dx.doi.org/10.1109/TVCG.2007.70561,1184,1191,J,"Understanding how people use online maps allows data acquisition teams to concentrate their efforts on the portions of the map that are most seen by users. Online maps represent vast databases, and so it is insufficient to simply look at a list of the most-accessed URLs. Hotmap takes advantage of the design of a mapping system's imagery pyramid to superpose a heatmap of the log files over the original maps. Users' behavior within the system can be observed and interpreted. This paper discusses the imagery acquisition task that motivated Hotmap, and presents several examples of information that Hotmap makes visible. We discuss the design choices behind Hotmap, including logarithmic color schemes; low-saturation background images; and tuning images to explore both infrequently-viewed and frequently-viewed spaces.",Danyel Fisher,Danyel Fisher,,10.1109/INFVIS.2005.1532122;10.1109/TVCG.2006.179,"Geographical visualization, GIS, heatmap, server log analysis, online mapping systems, social navigation",99,71,24,
VAST,2009,Combining automated analysis and visualization techniques for effective exploration of high-dimensional data,10.1109/VAST.2009.5332628,http://dx.doi.org/10.1109/VAST.2009.5332628,59,66,C,"Visual exploration of multivariate data typically requires projection onto lower-dimensional representations. The number of possible representations grows rapidly with the number of dimensions, and manual exploration quickly becomes ineffective or even unfeasible. This paper proposes automatic analysis methods to extract potentially relevant visual structures from a set of candidate visualizations. Based on features, the visualizations are ranked in accordance with a specified user task. The user is provided with a manageable number of potentially useful candidate visualizations, which can be used as a starting point for interactive data analysis. This can effectively ease the task of finding truly useful visualizations and potentially speed up the data exploration task. In this paper, we present ranking measures for class-based as well as non class-based Scatterplots and Parallel Coordinates visualizations. The proposed analysis methods are evaluated on different datasets.",Andrada Tatu;Georgia Albuquerque;Martin Eisemann;Jörn Schneidewind;Holger Theisel;Marcus A. Magnor;Daniel A. Keim,Andrada Tatu;Georgia Albuquerque;Martin Eisemann;Jorn Schneidewind;Holger Theisel;Marcus Magnork;Daniel Keim,"University of Konstanz, Germany;TU Braunschweig, Germany;TU Braunschweig, Germany;Telefonica o2 Business, Intelligence Center, Germany;University of Magdeburg, Germany;TU Braunschweig, Germany;University of Konstanz, Germany",10.1109/INFVIS.2005.1532142;10.1109/INFVIS.1998.729559;10.1109/INFVIS.2003.1249017;10.1109/VISUAL.1994.346302;10.1109/VAST.2006.261423,,98,80,25,
SciVis,2014,Fixed-Rate Compressed Floating-Point Arrays,10.1109/TVCG.2014.2346458,http://dx.doi.org/10.1109/TVCG.2014.2346458,2674,2683,J,"Current compression schemes for floating-point data commonly take fixed-precision values and compress them to a variable-length bit stream, complicating memory management and random access. We present a fixed-rate, near-lossless compression scheme that maps small blocks of 4&lt;sup&gt;d&lt;/sup&gt; values in d dimensions to a fixed, user-specified number of bits per block, thereby allowing read and write random access to compressed floating-point data at block granularity. Our approach is inspired by fixed-rate texture compression methods widely adopted in graphics hardware, but has been tailored to the high dynamic range and precision demands of scientific applications. Our compressor is based on a new, lifted, orthogonal block transform and embedded coding, allowing each per-block bit stream to be truncated at any point if desired, thus facilitating bit rate selection using a single compression scheme. To avoid compression or decompression upon every data access, we employ a software write-back cache of uncompressed blocks. Our compressor has been designed with computational simplicity and speed in mind to allow for the possibility of a hardware implementation, and uses only a small number of fixed-point arithmetic operations per compressed value. We demonstrate the viability and benefits of lossy compression in several applications, including visualization, quantitative data analysis, and numerical simulation.",Peter Lindstrom,Peter Lindstrom,"Center for Applied Scientific Computing, Lawrence Livermore National Laboratory",10.1109/TVCG.2006.143;10.1109/VISUAL.2001.964531;10.1109/TVCG.2006.186;10.1109/VISUAL.2001.964520;10.1109/VISUAL.2003.1250385;10.1109/TVCG.2012.209;10.1109/TVCG.2007.70516;10.1109/TVCG.2012.194;10.1109/VISUAL.1996.568138,"Data compression, floating-point arrays, orthogonal block transform, embedded coding",98,136,50,
Vis,2000,Topology preserving and controlled topology simplifying multiresolution isosurface extraction,10.1109/VISUAL.2000.885703,http://dx.doi.org/10.1109/VISUAL.2000.885703,259,266,C,"Multiresolution methods are becoming increasingly important tools for the interactive visualization of very large data sets. Multiresolution isosurface visualization allows the user to explore volume data using simplified and coarse representations of the isosurface for overview images, and finer resolution in areas of high interest or when zooming into the data. Ideally, a coarse isosurface should have the same topological structure as the original. The topological genus of the isosurface is one important property which is often neglected in multiresolution algorithms. This results in uncontrolled topological changes which can occur whenever the level-of-detail is changed. The scope of this paper is to propose an efficient technique which allows preservation of topology as well as controlled topology simplification in multiresolution isosurface extraction.",Thomas Gerstner;Renato Pajarola,T. Gerstner;R. Pajarola,"Dept. of Appl. Math., Bonn Univ., Germany",10.1109/VISUAL.1996.568127;10.1109/VISUAL.1997.663907;10.1109/VISUAL.1997.663909;10.1109/VISUAL.1998.745300;10.1109/VISUAL.1994.346334;10.1109/VISUAL.1997.663869,"tetrahedral grid refinement, implicit surface approximation, level-of-detail, topological genus, critical points",97,38,24,
Vis,2003,Image based flow visualization for curved surfaces,10.1109/VISUAL.2003.1250363,http://dx.doi.org/10.1109/VISUAL.2003.1250363,123,130,C,"A new method for the synthesis of dense, vector-field aligned textures on curved surfaces is presented, called IBFVS. The method is based on image based flow visualization (IBFV). In IBFV two-dimensional animated textures are produced by defining each frame of a flow animation as a blend between a warped version of the previous image and a number of filtered white noise images. We produce flow aligned texture on arbitrary three-dimensional triangular meshes in the same spirit as the original method: texture is generated directly in image space. We show that IBFVS is efficient and effective. High performance (typically fifty frames or more per second) is achieved by exploiting graphics hardware. Also, IBFVS can easily be implemented and a variety of effects can be achieved. Applications are flow visualization and surface rendering. Specifically, we show how to visualize the wind field on the earth and how to render a dirty bronze bunny.",Jarke J. van Wijk,J.J. van Wijk,"Dept. of Math. & Comput. Sci., Technische Universiteit Eindhoven, Netherlands",10.1109/VISUAL.2002.1183805;10.1109/VISUAL.1995.480817;10.1109/VISUAL.2003.1250377;10.1109/VISUAL.2000.885689;10.1109/VISUAL.1999.809896;10.1109/VISUAL.2001.964493;10.1109/VISUAL.1995.480795,"Flow visualization, texture mapping, line integral convolution, surface rendering",97,42,37,
Vis,2006,High-Level User Interfaces for Transfer Function Design with Semantics,10.1109/TVCG.2006.148,http://dx.doi.org/10.1109/TVCG.2006.148,1021,1028,J,"Many sophisticated techniques for the visualization of volumetric data such as medical data have been published. While existing techniques are mature from a technical point of view, managing the complexity of visual parameters is still difficult for nonexpert users. To this end, this paper presents new ideas to facilitate the specification of optical properties for direct volume rendering. We introduce an additional level of abstraction for parametric models of transfer functions. The proposed framework allows visualization experts to design high-level transfer function models which can intuitively be used by non-expert users. The results are user interfaces which provide semantic information for specialized visualization problems. The proposed method is based on principal component analysis as well as on concepts borrowed from computer animation",Christof Rezk-Salama;Maik Keller;Peter Kohlmann,Christof Rezk Salama;Maik Keller;Peter Kohlmann,IEEE Computer Society,10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2003.1250413;10.1109/VISUAL.2002.1183764;10.1109/VISUAL.1998.745319;10.1109/VISUAL.2001.964519;10.1109/VISUAL.2003.1250412;10.1109/VISUAL.1996.568113;10.1109/VISUAL.1997.663875,"Volume rendering, transfer function design, semantic models",97,69,32,
Vis,2007,Uncertainty Visualization in Medical Volume Rendering Using Probabilistic Animation,10.1109/TVCG.2007.70518,http://dx.doi.org/10.1109/TVCG.2007.70518,1648,1655,J,"Direct volume rendering has proved to be an effective visualization method for medical data sets and has reached wide-spread clinical use. The diagnostic exploration, in essence, corresponds to a tissue classification task, which is often complex and time-consuming. Moreover, a major problem is the lack of information on the uncertainty of the classification, which can have dramatic consequences for the diagnosis. In this paper this problem is addressed by proposing animation methods to convey uncertainty in the rendering. The foundation is a probabilistic Transfer Function model which allows for direct user interaction with the classification. The rendering is animated by sampling the probability domain over time, which results in varying appearance for uncertain regions. A particularly promising application of this technique is a ""sensitivity lens"" applied to focus regions in the data set. The methods have been evaluated by radiologists in a study simulating the clinical task of stenosis assessment, in which the animation technique is shown to outperform traditional rendering in terms of assessment accuracy.",Claes Lundström;Patric Ljung;Anders Persson;Anders Ynnerman,Claes Lundström;Patric Ljung;Anders Persson;Anders Ynnerman,"Center for Medical Image Science and Visualization (CMIV), Link¨oping University, and Sectra-Imtec AB;Division for Visual Information Technology and Applications (VITA), Link¨oping University;Center for Medical Image Science and Visualization (CMIV), Link¨oping University;Division for Visual Information Technology and Applications (VITA), Link¨oping University",10.1109/VISUAL.2005.1532807;10.1109/VISUAL.1992.235199;10.1109/VISUAL.2003.1250414,"Uncertainty, probability, medical visualization, volume rendering, transfer function",97,77,18,
Vis,1992,Improving the visualization of hierarchies with treemaps: design issues and experimentation,10.1109/VISUAL.1992.235217,http://dx.doi.org/10.1109/VISUAL.1992.235217,124,131,C,"Controlled experiments with novice treemap users and real data highlight the strengths of treemaps and provide direction for improvement. Issues discussed include experimental results, layout algorithms, nesting offsets, labeling, animation, and small multiple displays. Treemaps prove to be a potent tool for hierarchy display. The principles discussed are applicable to many information visualization situations.&lt;&lt;ETX&gt;&gt;",David Turo;B. Johnson,D. Turo;B. Johnson,"Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA;Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA",10.1109/VISUAL.1991.175796;10.1109/VISUAL.1991.175791;10.1109/VISUAL.1991.175815;10.1109/VISUAL.1991.175794,,96,27,16,
InfoVis,2004,Topological Fisheye Views for Visualizing Large Graphs,10.1109/INFVIS.2004.66,http://dx.doi.org/10.1109/INFVIS.2004.66,175,182,C,"Graph drawing is a basic visualization tool. For graphs of up to hundreds of nodes and edges, there are many effective techniques available. At greater scale, data density and occlusion problems often negate its effectiveness. Conventional pan-and-zoom, and multiscale and geometric fisheye views are not fully satisfactory solutions to this problem. As an alternative, we describe a topological zooming method. It is based on the precomputation of a hierarchy of coarsened graphs, which are combined on the fly into renderings with the level of detail dependent on the distance from one or more foci. We also discuss a related distortion method that allows our technique to achieve constant information density displays",Emden R. Gansner;Yehuda Koren;Stephen C. North,E. Gansner;Y. Koren;S. North,AT&amp;T Labs,10.1109/INFVIS.1997.636718;10.1109/INFVIS.2003.1249011,"topological fisheye,large graph visualization",96,14,23,
InfoVis,2004,User Experiments with Tree Visualization Systems,10.1109/INFVIS.2004.70,http://dx.doi.org/10.1109/INFVIS.2004.70,9,16,C,"This paper describes a comparative experiment with five well-known tree visualization systems, and Windows Explorer as a baseline system. Subjects performed tasks relating to the structure of a directory hierarchy, and to attributes of files and directories. Task completion times, correctness and user satisfaction were measured, and video recordings of subjects' interaction with the systems were made. Significant system and task type effects and an interaction between system and task type were found. Qualitative analyses of the video recordings were thereupon conducted to determine reasons for the observed differences, resulting in several findings and design recommendations as well as implications for future experiments with tree visualization systems",Alfred Kobsa,A. Kobsa,University of California at Irvine,10.1109/VISUAL.1991.175815;10.1109/INFVIS.2002.1173148;10.1109/INFVIS.2001.963285;10.1109/INFVIS.1999.801860;10.1109/INFVIS.2001.963289;10.1109/INFVIS.2001.963290;10.1109/INFVIS.2002.1173153,"information visualization, experimental comparison, task performance, accuracy, user satisfaction, user interaction, design recommendations",96,44,26,
Vis,2002,Non-photorealistic volume rendering using stippling techniques,10.1109/VISUAL.2002.1183777,http://dx.doi.org/10.1109/VISUAL.2002.1183777,211,218,C,"Simulating hand-drawn illustration techniques can succinctly express information in a manner that is communicative and informative. We present a framework for an interactive direct volume illustration system that simulates traditional stipple drawing. By combining the principles of artistic and scientific illustration, we explore several feature enhancement techniques to create effective, interactive visualizations of scientific and medical datasets. We also introduce a rendering mechanism that generates appropriate point lists at all resolutions during an automatic preprocess, and modifies rendering styles through different combinations of these feature enhancements. The new system is an effective way to interactively preview large, complex volume datasets in a concise, meaningful, and illustrative manner. Volume stippling is effective for many applications and provides a quick and efficient method to investigate volume models.",Aidong Lu;Christopher J. Morris 0001;David S. Ebert;Penny Rheingans;Charles D. Hansen,Aidong Lu;C.J. Morris;D.S. Ebert;P. Rheingans;C. Hansen,"Purdue Univ., West Lafayette, IN, USA",10.1109/VISUAL.1997.663894;10.1109/VISUAL.2001.964492;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2001.964490;10.1109/VISUAL.2001.964522;10.1109/VISUAL.2000.885696,"non-photorealistic rendering, volume rendering, scientific visualization, medical imaging",95,28,34,BP
Vis,2003,Gaussian transfer functions for multi-field volume visualization,10.1109/VISUAL.2003.1250412,http://dx.doi.org/10.1109/VISUAL.2003.1250412,497,504,C,"Volume rendering is a flexible technique for visualizing dense 3D volumetric datasets. A central element of volume rendering is the conversion between data values and observable quantities such as color and opacity. This process is usually realized through the use of transfer functions that are precomputed and stored in lookup tables. For multidimensional transfer functions applied to multivariate data, these lookup tables become prohibitively large. We propose the direct evaluation of a particular type of transfer functions based on a sum of Gaussians. Because of their simple form (in terms of number of parameters), these functions and their analytic integrals along line segments can be evaluated efficiently on current graphics hardware, obviating the need for precomputed lookup tables. We have adopted these transfer functions because they are well suited for classification based on a unique combination of multiple data values that localize features in the transfer function domain. We apply this technique to the visualization of several multivariate datasets (CT, cryosection) that are difficult to classify and render accurately at interactive rates using traditional approaches.",Joe Michael Kniss;Simon Premoze;Milan Ikits;Aaron E. Lefohn;Charles D. Hansen;Emil Praun,J. Kniss;S. premoze;M. Ikits;A. Lefohn;C. Hansen;E. Praun,"Inst. of Sci. Comput. & Imaging, Utah Univ., Salt Lake, UT, USA",10.1109/VISUAL.1999.809889;10.1109/VISUAL.2000.885683;10.1109/VISUAL.2001.964521,"Volume Rendering, Transfer Functions, Multi-field visualization",95,40,29,
InfoVis,2004,A Rank-by-Feature Framework for Unsupervised Multidimensional Data Exploration Using Low Dimensional Projections,10.1109/INFVIS.2004.3,http://dx.doi.org/10.1109/INFVIS.2004.3,65,72,C,"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 (D.S. Moore, (1999). 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 1D 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 1D and 2D axis-parallel projections, and finally to help them interactively find interesting features",Jinwook Seo;Ben Shneiderman,Jinwook Seo;B. Shneiderman,University of Maryland at College Park,10.1109/VISUAL.1994.346302;10.1109/VISUAL.1990.146402;10.1109/INFVIS.2003.1249015;10.1109/INFVIS.1998.729559,"information visualization, exploratory data analysis, dynamic query, feature detection/selection, statistical graphics",95,24,17,
Vis,2008,Continuous Scatterplots,10.1109/TVCG.2008.119,http://dx.doi.org/10.1109/TVCG.2008.119,1428,1435,J,"Scatterplots are well established means of visualizing discrete data values with two data variables as a collection of discrete points. We aim at generalizing the concept of scatterplots to the visualization of spatially continuous input data by a continuous and dense plot. An example of a continuous input field is data defined on an n-D spatial grid with respective interpolation or reconstruction of in-between values. We propose a rigorous, accurate, and generic mathematical model of continuous scatterplots that considers an arbitrary density defined on an input field on an n-D domain and that maps this density to m-D scatterplots. Special cases are derived from this generic model and discussed in detail: scatterplots where the n-D spatial domain and the m-D data attribute domain have identical dimension, 1-D scatterplots as a way to define continuous histograms, and 2-D scatterplots of data on 3-D spatial grids. We show how continuous histograms are related to traditional discrete histograms and to the histograms of isosurface statistics. Based on the mathematical model of continuous scatterplots, respective visualization algorithms are derived, in particular for 2-D scatterplots of data from 3-D tetrahedral grids. For several visualization tasks, we show the applicability of continuous scatterplots. Since continuous scatterplots do not only sample data at grid points but interpolate data values within cells, a dense and complete visualization of the data set is achieved that scales well with increasing data set size. Especially for irregular grids with varying cell size, improved results are obtained when compared to conventional scatterplots. Therefore, continuous scatterplots are a suitable extension of a statistics visualization technique to be applied to typical data from scientific computation.",Sven Bachthaler;Daniel Weiskopf,Sven Bachthaler;Daniel Weiskopf,"VISUS (Visualization Research Center), Universität Stuttgart;VISUS (Visualization Research Center), Universität Stuttgart",10.1109/TVCG.2006.168;10.1109/TVCG.2008.160,"Scatterplot, histogram, continuous frequency plot, interpolation",95,86,15,
InfoVis,1998,The generalized detail in-context problem,10.1109/INFVIS.1998.729558,http://dx.doi.org/10.1109/INFVIS.1998.729558,44,"51, 152",C,"The paper describes a general formulation of the ""detail-in-context"" problem, which is a central issue of fundamental importance to a wide variety of nonlinear magnification systems. A number of tools are described for dealing with this problem effectively. These tools can be applied to any continuous nonlinear magnification system, and are not tied to specific implementation features of the system that produced the original transformation. Of particular interest is the development of ""seamless multi level views"", which allow multiple global views of an information space (each having different information content) to be integrated into a single view without discontinuity.",Alan Keahey,T.A. Keahey,"Los Alamos Nat. Lab., NM, USA",10.1109/INFVIS.1997.636786;10.1109/INFVIS.1997.636718;10.1109/INFVIS.1996.559214,,94,30,25,
Vis,2000,Toward a compelling sensation of telepresence: demonstrating a portal to a distant (static) office,10.1109/VISUAL.2000.885712,http://dx.doi.org/10.1109/VISUAL.2000.885712,327,333,C,"In 1998 we introduced the idea for a project we call the Office of the Future. Our long-term vision is to provide a better every-day working environment, with high-fidelity scene reconstruction for life-sized 3D tele-collaboration. In particular, we want a true sense of presence with our remote collaborator and their real surroundings. The challenges related to this vision are enormous and involve many technical tradeoffs. This is true in particular for scene reconstruction. Researchers have been striving to achieve real-time approaches, and while they have made respectable progress, the limitations of conventional technologies relegate them to relatively low resolution in a restricted volume. We present a significant step toward our ultimate goal, via a slightly different path. In lieu of low-fidelity dynamic scene modeling we present an exceedingly high fidelity reconstruction of a real but static office. By assembling the best of available hardware and software technologies in static scene acquisition, modeling algorithms, rendering, tracking and stereo projective display, we are able to demonstrate a portal to a real office, occupied today by a mannequin, and in the future by a real remote collaborator. We now have both a compelling sense of just how good it could be, and a framework into which we will later incorporate dynamic scene modeling, as we continue to head toward our ultimate goal of 3D collaborative telepresence.",Wei-Chao Chen;Herman Towles;Lars S. Nyland;Greg Welch;Henry Fuchs,Wei-Chao Wen;H. Towles;L. Nyland;G. Welch;H. Fuchs,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.1996.568125;10.1109/VISUAL.1997.663893,"telepresence, tele-immersion, virtual reality, collaborative visualization, immersive display, augmented reality, human-computer interface",94,0,27,
Vis,2001,Distance-field based skeletons for virtual navigation,10.1109/VISUAL.2001.964517,http://dx.doi.org/10.1109/VISUAL.2001.964517,239,246,C,"We present a generic method for rapid flight planning, virtual navigation and effective camera control in a volumetric environment. Directly derived from an accurate distance from boundary (DFB) field, our automatic path planning algorithm rapidly generates centered flight paths, a skeleton, in the navigable region of the virtual environment. Based on precomputed flight paths and the DFB field, our dual-mode physically based camera control model supports a smooth, safe, and sticking-free virtual navigation with six degrees of freedom. By using these techniques, combined with accelerated volume rendering, we have successfully developed a real-time virtual colonoscopy system on low-cost PCs and confirmed the high speed, high accuracy and robustness of our techniques on more than 40 patient datasets.",Ming Wan;Frank Dachille;Arie E. Kaufman,Ming Wan;F. Dachille;A. Kaufman,"Boeing Co., Seattle, WA, USA",10.1109/VISUAL.1997.663915;10.1109/VISUAL.2000.885675,"Distance fields, path planning, centerline, camera control, virtual navigation, volumetric environment, physically based modeling, virtual colonoscopy",94,12,27,
InfoVis,2006,FacetMap: A Scalable Search and Browse Visualization,10.1109/TVCG.2006.142,http://dx.doi.org/10.1109/TVCG.2006.142,797,804,J,"The dominant paradigm for searching and browsing large data stores is text-based: presenting a scrollable list of search results in response to textual search term input. While this works well for the Web, there is opportunity for improvement in the domain of personal information stores, which tend to have more heterogeneous data and richer metadata. In this paper, we introduce FacetMap, an interactive, query-driven visualization, generalizable to a wide range of metadata-rich data stores. FacetMap uses a visual metaphor for both input (selection of metadata facets as filters) and output. Results of a user study provide insight into tradeoffs between FacetMap's graphical approach and the traditional text-oriented approach",Greg Smith;Mary Czerwinski;Brian Meyers;Daniel C. Robbins;George G. Robertson;Desney S. Tan,Greg Smith;Mary Czerwinski;Brian Meyers;Daniel Robbins;George Robertson;Desney S. Tan,,10.1109/INFVIS.1998.729570;10.1109/INFVIS.2000.885086;10.1109/INFVIS.2002.1173156;10.1109/INFVIS.1995.528685;10.1109/VISUAL.1991.175815,"Graphical visualization, interactive information retrieval, faceted metadata",94,48,30,
Vis,2007,High-Quality Multimodal Volume Rendering for Preoperative Planning of Neurosurgical Interventions,10.1109/TVCG.2007.70560,http://dx.doi.org/10.1109/TVCG.2007.70560,1696,1703,J,"Surgical approaches tailored to an individual patient's anatomy and pathology have become standard in neurosurgery. Precise preoperative planning of these procedures, however, is necessary to achieve an optimal therapeutic effect. Therefore, multiple radiological imaging modalities are used prior to surgery to delineate the patient's anatomy, neurological function, and metabolic processes. Developing a three-dimensional perception of the surgical approach, however, is traditionally still done by mentally fusing multiple modalities. Concurrent 3D visualization of these datasets can, therefore, improve the planning process significantly. In this paper we introduce an application for planning of individual neurosurgical approaches with high-quality interactive multimodal volume rendering. The application consists of three main modules which allow to (1) plan the optimal skin incision and opening of the skull tailored to the underlying pathology; (2) visualize superficial brain anatomy, function and metabolism; and (3) plan the patient-specific approach for surgery of deep-seated lesions. The visualization is based on direct multi-volume raycasting on graphics hardware, where multiple volumes from different modalities can be displayed concurrently at interactive frame rates. Graphics memory limitations are avoided by performing raycasting on bricked volumes. For preprocessing tasks such as registration or segmentation, the visualization modules are integrated into a larger framework, thus supporting the entire workflow of preoperative planning.",Johanna Beyer;Markus Hadwiger;Stefan Wolfsberger;Katja Bühler,Johanna Beyer;Markus Hadwiger;Stefan Wolfsberger;Katja Bühler,,10.1109/VISUAL.2003.1250384;10.1109/VISUAL.1998.745311;10.1109/VISUAL.2003.1250386;10.1109/VISUAL.2004.98,"Multimodal Volume Rendering, Hardware Assisted Raycasting, Surgery Planning",94,68,28,BA
InfoVis,2008,EMDialog: Bringing Information Visualization into the Museum,10.1109/TVCG.2008.127,http://dx.doi.org/10.1109/TVCG.2008.127,1181,1188,J,"Digital information displays are becoming more common in public spaces such as museums, galleries, and libraries. However, the public nature of these locations requires special considerations concerning the design of information visualization in terms of visual representations and interaction techniques. We discuss the potential for, and challenges of, information visualization in the museum context based on our practical experience with EMDialog, an interactive information presentation that was part of the Emily Carr exhibition at the Glenbow Museum in Calgary. EMDialog visualizes the diverse and multi-faceted discourse about this Canadian artist with the goal to both inform and provoke discussion. It provides a visual exploration environment that offers interplay between two integrated visualizations, one for information access along temporal, and the other along contextual dimensions. We describe the results of an observational study we conducted at the museum that revealed the different ways visitors approached and interacted with EMDialog, as well as how they perceived this form of information presentation in the museum context. Our results include the need to present information in a manner sufficiently attractive to draw attention and the importance of rewarding passive observation as well as both short- and longer term information exploration.",Uta Hinrichs;Holly Schmidt;Sheelagh Carpendale,Uta Hinrichs;Holly Schmidt;Sheelagh Carpendale,"University of Calgary, Canada;University of Calgary, Canada",10.1109/TVCG.2007.70541;10.1109/INFVIS.2004.8;10.1109/INFVIS.2003.1249031;10.1109/INFVIS.2005.1532122;10.1109/TVCG.2007.70568,"artistic information visualization, interactive information visualization, walk-up-and-use interaction, public displays",94,49,28,
InfoVis,2009,"Temporal Summaries: Supporting Temporal Categorical Searching, Aggregation and Comparison",10.1109/TVCG.2009.187,http://dx.doi.org/10.1109/TVCG.2009.187,1049,1056,J,"When analyzing thousands of event histories, analysts often want to see the events as an aggregate to detect insights and generate new hypotheses about the data. An analysis tool must emphasize both the prevalence and the temporal ordering of these events. Additionally, the analysis tool must also support flexible comparisons to allow analysts to gather visual evidence. In a previous work, we introduced align, rank, and filter (ARF) to accentuate temporal ordering. In this paper, we present temporal summaries, an interactive visualization technique that highlights the prevalence of event occurrences. Temporal summaries dynamically aggregate events in multiple granularities (year, month, week, day, hour, etc.) for the purpose of spotting trends over time and comparing several groups of records. They provide affordances for analysts to perform temporal range filters. We demonstrate the applicability of this approach in two extensive case studies with analysts who applied temporal summaries to search, filter, and look for patterns in electronic health records and academic records.",Taowei David Wang;Catherine Plaisant;Ben Shneiderman;Neil Spring;David Roseman;Greg Marchand;Vikramjit Mukherjee;Mark S. Smith,Taowei David Wang;Catherine Plaisant;Ben Shneiderman;Neil Spring;David Roseman;Greg Marchand;Vikramjit Mukherjee;Mark Smith,"Human-Computer Interaction Lab and Dept. of Computer Science, University of Maryland at College Park;Human-Computer Interaction Lab and Dept. of Computer Science, University of Maryland at College Park;Human-Computer Interaction Lab and Dept. of Computer Science, University of Maryland at College Park;Dept. of Computer Science, University of Maryland at College Park;ER One Institute, Washington Hospital Center, Medstar Health;ER One Institute, Washington Hospital Center, Medstar Health;ER One Institute, Washington Hospital Center, Medstar Health;ER One Institute, Washington Hospital Center, Medstar Health",10.1109/INFVIS.2005.1532122;10.1109/VAST.2007.4389008,"Information Visualization, Interaction design, Human-computer interaction, temporal categorical data visualization",94,77,22,
InfoVis,1995,Case study. Visualising cyberspace: information visualisation in the Harmony Internet browser,10.1109/INFVIS.1995.528692,http://dx.doi.org/10.1109/INFVIS.1995.528692,97,104,C,"The explosive growth of information systems on the Internet has clearly demonstrated the need to organise, filter, and present information in ways which allow users to cope with the sheer quantities of information available. The scope for visualisation of Gopher and WWW spaces is restricted by the limitations of their respective data models. The far richer data model supported by the Hyper-G Internet information system is exploited by its Harmony client to provide a number of tightly-coupled, two- and three-dimensional visualisation and navigational facilities, which help provide location feedback and alleviate user disorientation.",K. Andrews,K. Andrews,"Inst. for Inf. Process. & Comput. Supported New Media, Graz Univ. of Technol., Austria",10.1109/VISUAL.1991.175815;10.1109/VISUAL.1992.235198,,93,21,27,
Vis,1997,Building and traversing a surface at variable resolution,10.1109/VISUAL.1997.663865,http://dx.doi.org/10.1109/VISUAL.1997.663865,103,110,C,"The authors consider the multi-triangulation, a general model for representing surfaces at variable resolution based on triangle meshes. They analyse characteristics of the model that make it effective for supporting basic operations such as extraction of a surface approximation, and point location. An interruptible algorithm for extracting a representation at a resolution variable over the surface is presented. Different heuristics for building the model are considered and compared. Results on both the construction and the extraction algorithm are presented.",Leila De Floriani;Paola Magillo;Enrico Puppo,L. De Fioriani;P. Magillo;E. Puppo,"Dipt. di Inf. e Sci. dell'Inf., Genoa Univ., Italy",,,93,27,21,
Vis,2005,Topology-based simplification for feature extraction from 3D scalar fields,10.1109/VISUAL.2005.1532839,http://dx.doi.org/10.1109/VISUAL.2005.1532839,535,542,C,"In this paper, we present a topological approach for simplifying continuous functions defined on volumetric domains. We introduce two atomic operations that remove pairs of critical points of the function and design a combinatorial algorithm that simplifies the Morse-Smale complex by repeated application of these operations. The Morse-Smale complex is a topological data structure that provides a compact representation of gradient flow between critical points of a function. Critical points paired by the Morse-Smale complex identify topological features and their importance. The simplification procedure leaves important critical points untouched, and is therefore useful for extracting desirable features. We also present a visualization of the simplified topology.",Attila Gyulassy;Vijay Natarajan;Valerio Pascucci;Peer-Timo Bremer;Bernd Hamann,A. Gyulassy;Vijay Natarajan,"Dept. of Comput. Sci., California Univ., Davis, CA, USA;Dept. of Comput. Sci., California Univ., Davis, CA, USA",10.1109/VISUAL.1999.809907;10.1109/VISUAL.2000.885680;10.1109/VISUAL.2004.96;10.1109/VISUAL.2001.964507,"Morse theory, Morse-Smale complexes, computational topology, multiresolution, simplification, feature detection, 3D scalar fields",93,22,22,
InfoVis,2010,FacetAtlas: Multifaceted Visualization for Rich Text Corpora,10.1109/TVCG.2010.154,http://dx.doi.org/10.1109/TVCG.2010.154,1172,1181,J,"Documents in rich text corpora usually contain multiple facets of information. For example, an article about a specific disease often consists of different facets such as symptom, treatment, cause, diagnosis, prognosis, and prevention. Thus, documents may have different relations based on different facets. Powerful search tools have been developed to help users locate lists of individual documents that are most related to specific keywords. However, there is a lack of effective analysis tools that reveal the multifaceted relations of documents within or cross the document clusters. In this paper, we present FacetAtlas, a multifaceted visualization technique for visually analyzing rich text corpora. FacetAtlas combines search technology with advanced visual analytical tools to convey both global and local patterns simultaneously. We describe several unique aspects of FacetAtlas, including (1) node cliques and multifaceted edges, (2) an optimized density map, and (3) automated opacity pattern enhancement for highlighting visual patterns, (4) interactive context switch between facets. In addition, we demonstrate the power of FacetAtlas through a case study that targets patient education in the health care domain. Our evaluation shows the benefits of this work, especially in support of complex multifaceted data analysis.",Nan Cao;Jimeng Sun;Yu-Ru Lin;David Gotz;Shixia Liu;Huamin Qu,Nan Cao;Jimeng Sun;Yu-Ru Lin;David Gotz;Shixia Liu;Huamin Qu,"IEEE, Member",10.1109/TVCG.2006.122;10.1109/VAST.2009.5333443;10.1109/INFVIS.2000.885098;10.1109/TVCG.2009.140;10.1109/TVCG.2008.135;10.1109/TVCG.2008.172;10.1109/TVCG.2009.139;10.1109/TVCG.2009.171;10.1109/INFVIS.2005.1532126;10.1109/TVCG.2006.142;10.1109/TVCG.2006.147;10.1109/VISUAL.1998.745302;10.1109/TVCG.2009.165;10.1109/INFVIS.1995.528686;10.1109/TVCG.2006.185,"Multi-facet visualization, Text visualization, Multi-relational Graph, Search UI",93,74,32,
Vis,1990,Shape coding of multidimensional data on a microcomputer display,10.1109/VISUAL.1990.146387,http://dx.doi.org/10.1109/VISUAL.1990.146387,238,"246, 478",C,"The author presents a simple and flexible method of sharp coding for higher dimensional data sets that allows the database operator or the scientist quick access to promising patterns within and among records or samples. The example used is a 13-parameter set of solar wind, magnetosphere, and ground observation data collected hourly for 21 days in 1976. The software system is a prototype developed to demonstrate the glyph approach to depicting higher-dimensional data sets. The experiment was to depict all parameters simultaneously, to see if any global or local patterns emerged. This experiment proves that much more complex data can be presented for visual pattern extraction than standard methods allow.&lt;&lt;ETX&gt;&gt;",Jeff Beddow,J. Beddow,"Microsimulations Res., Minneapolis, MN, USA",,,92,36,5,
Vis,1994,Implicit modeling of swept surfaces and volumes,10.1109/VISUAL.1994.346339,http://dx.doi.org/10.1109/VISUAL.1994.346339,40,"45, C4",C,"Swept surfaces and volumes are generated by moving a geometric model through space. Swept surfaces and volumes are important in many computer-aided design applications including geometric modeling, numerical cutter path generation, and spatial path planning. In this paper we describe a numerical algorithm to generate swept surfaces and volumes using implicit modeling techniques. The algorithm is applicable to any geometric representation for which a distance function can be computed. The algorithm also treats degenerate trajectories such as self-intersection and surface singularity. We show applications of this algorithm to maintainability design and robot path planning.&lt;&lt;ETX&gt;&gt;",William J. Schroeder;William E. Lorensen;Steve Linthicum,W.J. Schroeder;W.E. Lorensen;S. Linthicum,"Gen. Electr. Corp. Res. & Dev. Center, Schenectady, NY, USA;Gen. Electr. Corp. Res. & Dev. Center, Schenectady, NY, USA",,,92,35,17,
Vis,2001,Continuous topology simplification of planar vector fields,10.1109/VISUAL.2001.964507,http://dx.doi.org/10.1109/VISUAL.2001.964507,159,166,C,"Vector fields can present complex structural behavior, especially in turbulent computational fluid dynamics. The topological analysis of these data sets reduces the information, but one is usually still left with too many details for interpretation. In this paper, we present a simplification approach that removes pairs of critical points from the data set, based on relevance measures. In contrast to earlier methods, no grid changes are necessary, since the whole method uses small local changes of the vector values defining the vector field. An interpretation in terms of bifurcations underlines the continuous, natural flavor of the algorithm.",Xavier Tricoche;Gerik Scheuermann;Hans Hagen,X. Tricoche;G. Scheuermann;H. Hagen,"Dept. of Comput. Sci., Kaiserslautern Univ., Germany;Dept. of Comput. Sci., Kaiserslautern Univ., Germany;Dept. of Comput. Sci., Kaiserslautern Univ., Germany",10.1109/VISUAL.2000.885716;10.1109/VISUAL.1998.745318;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1999.809907,"vector field topology, flow visualization, unstructured grid, simplification",92,55,10,
InfoVis,2004,"Steerable, Progressive Multidimensional Scaling",10.1109/INFVIS.2004.60,http://dx.doi.org/10.1109/INFVIS.2004.60,57,64,C,"Current implementations of multidimensional scaling (MDS), an approach that attempts to best represent data point similarity in a low-dimensional representation, are not suited for many of today's large-scale datasets. We propose an extension to the spring model approach that allows the user to interactively explore datasets that are far beyond the scale of previous implementations of MDS. We present MDSteer, a steerable MDS computation engine and visualization tool that progressively computes an MDS layout and handles datasets of over one million points. Our technique employs hierarchical data structures and progressive layouts to allow the user to steer the computation of the algorithm to the interesting areas of the dataset. The algorithm iteratively alternates between a layout stage in which a subselection of points are added to the set of active points affected by the MDS iteration, and a binning stage which increases the depth of the bin hierarchy and organizes the currently unplaced points into separate spatial regions. This binning strategy allows the user to select onscreen regions of the layout to focus the MDS computation into the areas of the dataset that are assigned to the selected bins. We show both real and common synthetic benchmark datasets with dimensionalities ranging from 3 to 300 and cardinalities of over one million points",Matt Williams;Tamara Munzner,M. Williams;T. Munzner,University of British Columbia,10.1109/INFVIS.2002.1173150;10.1109/INFVIS.2003.1249013;10.1109/INFVIS.2001.963275;10.1109/INFVIS.2002.1173159;10.1109/INFVIS.2002.1173161;10.1109/VISUAL.1996.567787;10.1109/INFVIS.1995.528686;10.1109/INFVIS.2003.1249012,"dimensionality reduction, multidimensional scaling",92,44,19,
InfoVis,2011,Divided Edge Bundling for Directional Network Data,10.1109/TVCG.2011.190,http://dx.doi.org/10.1109/TVCG.2011.190,2354,2363,J,"The node-link diagram is an intuitive and venerable way to depict a graph. To reduce clutter and improve the readability of node-link views, Holten &amp;amp; van Wijk's force-directed edge bundling employs a physical simulation to spatially group graph edges. While both useful and aesthetic, this technique has shortcomings: it bundles spatially proximal edges regardless of direction, weight, or graph connectivity. As a result, high-level directional edge patterns are obscured. We present divided edge bundling to tackle these shortcomings. By modifying the forces in the physical simulation, directional lanes appear as an emergent property of edge direction. By considering graph topology, we only bundle edges related by graph structure. Finally, we aggregate edge weights in bundles to enable more accurate visualization of total bundle weights. We compare visualizations created using our technique to standard force-directed edge bundling, matrix diagrams, and clustered graphs; we find that divided edge bundling leads to visualizations that are easier to interpret and reveal both familiar and previously obscured patterns.",David Selassie;Brandon Heller;Jeffrey Heer,David Selassie;Brandon Heller;Jeffrey Heer,Stanford University;Stanford University;Stanford University,10.1109/INFVIS.2003.1249008;10.1109/TVCG.2008.135;10.1109/TVCG.2007.70582;10.1109/TVCG.2007.70535;10.1109/TVCG.2006.147,"Graph visualization, aggregation, node-link diagrams, edge bundling, physical simulation",92,69,19,
SciVis,2013,Contour Boxplots: A Method for Characterizing Uncertainty in Feature Sets from Simulation Ensembles,10.1109/TVCG.2013.143,http://dx.doi.org/10.1109/TVCG.2013.143,2713,2722,J,"Ensembles of numerical simulations are used in a variety of applications, such as meteorology or computational solid mechanics, in order to quantify the uncertainty or possible error in a model or simulation. Deriving robust statistics and visualizing the variability of an ensemble is a challenging task and is usually accomplished through direct visualization of ensemble members or by providing aggregate representations such as an average or pointwise probabilities. In many cases, the interesting quantities in a simulation are not dense fields, but are sets of features that are often represented as thresholds on physical or derived quantities. In this paper, we introduce a generalization of boxplots, called contour boxplots, for visualization and exploration of ensembles of contours or level sets of functions. Conventional boxplots have been widely used as an exploratory or communicative tool for data analysis, and they typically show the median, mean, confidence intervals, and outliers of a population. The proposed contour boxplots are a generalization of functional boxplots, which build on the notion of data depth. Data depth approximates the extent to which a particular sample is centrally located within its density function. This produces a center-outward ordering that gives rise to the statistical quantities that are essential to boxplots. Here we present a generalization of functional data depth to contours and demonstrate methods for displaying the resulting boxplots for two-dimensional simulation data in weather forecasting and computational fluid dynamics.",Ross T. Whitaker;Mahsa Mirzargar;Robert Michael Kirby,Ross T. Whitaker;Mahsa Mirzargar;Robert M. Kirby,"SCI Institute, University of Utah;University of Florida;University of Utah",10.1109/VISUAL.2002.1183769;10.1109/VISUAL.1996.568105;10.1109/VISUAL.2005.1532807;10.1109/TVCG.2010.181,"Uncertainty visualization, boxplots, band depth, ensemble visualization, order statistics",92,102,38,
InfoVis,1995,Case study. Narcissus: visualising information,10.1109/INFVIS.1995.528691,http://dx.doi.org/10.1109/INFVIS.1995.528691,90,96,C,"It is becoming increasingly important that support is provided for users who are dealing with complex information spaces. The need is driven by the growing number of domains where there is a requirement for users to understand, navigate and manipulate large sets of computer based data; by the increasing size and complexity of this information and by the pressures to use this information efficiently. The paradigmatic example is the World Wide Web, but other domains include software systems, information systems and concurrent engineering. One approach to providing this support is to provide sophisticated visualisation tools which lead the users to form an intuitive understanding of the structure and behaviour of their domain and which provide mechanisms which allow them to manipulate objects within their system. The paper describes such a tool and a number of visualisation techniques that it implements.",Robert J. Hendley;Nick S. Drew;Andrew Wood;Russell Beale,R.J. Hendley;N.S. Drew;A.M. Wood;R. Beale,"Sch. of Comput. Sci., Birmingham Univ., UK;Sch. of Comput. Sci., Birmingham Univ., UK;Sch. of Comput. Sci., Birmingham Univ., UK;Sch. of Comput. Sci., Birmingham Univ., UK",,,91,32,8,
Vis,2003,Fast volume segmentation with simultaneous visualization using programmable graphics hardware,10.1109/VISUAL.2003.1250369,http://dx.doi.org/10.1109/VISUAL.2003.1250369,171,176,C,"Segmentation of structures from measured volume data, such as anatomy in medical imaging, is a challenging data-dependent task. In this paper, we present a segmentation method that leverages the parallel processing capabilities of modern programmable graphics hardware in order to run significantly faster than previous methods. In addition, collocating the algorithm computation with the visualization on the graphics hardware circumvents the need to transfer data across the system bus, allowing for faster visualization and interaction. This algorithm is unique in that it utilizes sophisticated graphics hardware functionality (i.e., floating point precision, render to texture, computational masking, and fragment programs) to enable fast segmentation and interactive visualization.",Anthony J. Sherbondy;Michael Houston;Sandy Napel,A. Sherbondy;M. Houston;S. Napel,"Stanford Univ., CA, USA;Stanford Univ., CA, USA;Stanford Univ., CA, USA",10.1109/VISUAL.2003.1250357," region growing, diffusion, segmentation, graphics processor, streaming computation",91,33,26,
InfoVis,2005,Elastic hierarchies: combining treemaps and node-link diagrams,10.1109/INFVIS.2005.1532129,http://dx.doi.org/10.1109/INFVIS.2005.1532129,57,64,C,"We investigate the use of elastic hierarchies for representing trees, where a single graphical depiction uses a hybrid mixture, or ""interleaving"", of more basic forms at different nodes of the tree. In particular, we explore combinations of node link and treemap forms, to combine the space efficiency of treemaps with the structural clarity of node link diagrams. A taxonomy is developed to characterize the design space of such hybrid combinations. A software prototype is described, which we used to explore various techniques for visualizing, browsing and interacting with elastic hierarchies, such as side by side overview and detail views, highlighting and rubber banding across views, visualization of multiple foci, and smooth animations across transitions. The paper concludes with a discussion of the characteristics of elastic hierarchies and suggestions for research on their properties and uses.",Shengdong Zhao;Michael J. McGuffin;Mark H. Chignell,Shengdong Zhao;M.J. McGuffin;M.H. Chignell,"Toronto Univ., Ont., Canada;Toronto Univ., Ont., Canada;Toronto Univ., Ont., Canada",10.1109/INFVIS.2000.885091;10.1109/INFVIS.2002.1173148,"Elastic Hierarchies, Treemaps, node-link diagrams, hybrids, combinations, overview+detail, multiple views, trees, interaction techniques, interactive visualization",91,25,21,
Vis,1993,Flow volumes for interactive vector field visualization,10.1109/VISUAL.1993.398846,http://dx.doi.org/10.1109/VISUAL.1993.398846,19,24,C,"Flow volumes are the volumetric equivalent of stream lines. They provide more information about the vector field being visualized than do stream lines or ribbons. Presented is an efficient method for producing flow volumes, composed of transparently rendered tetrahedra, for use in an interactive system. The problems of rendering, subdivision, sorting, composing artifacts, and user interaction are dealt with. Efficiency comes from rendering only the volume of the smoke, and using hardware texturing and compositing.&lt;&lt;ETX&gt;&gt;",Nelson L. Max;Barry G. Becker;Roger Crawfis,N. Max;B. Becker;R. Crawfis,"Lawrence Livermore Nat. Lab., Livermore, CA, USA;Lawrence Livermore Nat. Lab., Livermore, CA, USA;Lawrence Livermore Nat. Lab., Livermore, CA, USA",10.1109/VISUAL.1992.235210;10.1109/VISUAL.1992.235211,,90,38,13,
Vis,1996,UFLOW: visualizing uncertainty in fluid flow,10.1109/VISUAL.1996.568116,http://dx.doi.org/10.1109/VISUAL.1996.568116,249,254,C,"Uncertainty or errors are introduced in fluid flow data as the data is acquired, transformed and rendered. Although researchers are aware of these uncertainties, little has been done to incorporate them in the existing visualization systems for fluid flow. In the absence of integrated presentation of data and its associated uncertainty, the analysis of the visualization is incomplete at best and may lead to inaccurate or incorrect conclusions. The article presents UFLOW-a system for visualizing uncertainty in fluid flow. Although there are several sources of uncertainties in fluid flow data, in this work, we focus on uncertainty arising from the use of different numerical algorithms for computing particle traces in a fluid flow. The techniques that we have employed to visualize uncertainty in fluid flow include uncertainty glyphs, flow envelopes, animations, priority sequences, twirling batons of trace viewpoints, and rakes. These techniques are effective in making the users aware of the effects of different integration methods and their sensitivity, especially near critical points in the flow field.",Suresh K. Lodha;Alex T. Pang;Robert E. Sheehan;Craig M. Wittenbrink,S.K. Lodha;A. Pang;R.E. Sheehan;C.M. Wittenbrink,"Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA",10.1109/VISUAL.1992.235199;10.1109/VISUAL.1996.568105;10.1109/VISUAL.1995.485141;10.1109/VISUAL.1994.346315,"flow visualization, uncertainty glyphs, streamlines, rakes, flow envelopes, animation",90,39,34,
Vis,1998,A general method for preserving attribute values on simplified meshes,10.1109/VISUAL.1998.745285,http://dx.doi.org/10.1109/VISUAL.1998.745285,59,66,C,"Many sophisticated solutions have been proposed to reduce the geometric complexity of 3D meshes. A problem studied less often is how to preserve on a simplified mesh the detail (e.g., color, high frequency shape detail, scalar fields, etc.) which is encoded in the original mesh. We present a general approach for preserving detail on simplified meshes. The detail (or high frequency information) lost after simplification is encoded through texture or bump maps. The original contribution is that preservation is performed after simplification, by building set of triangular texture patches that are then packed in a single texture map. Each simplified mesh face is sampled to build the associated triangular texture patch; a new method for storing this set of texture patches into a standard rectangular texture is presented and discussed. Our detail preserving approach makes no assumptions about the simplification process adopted to reduce mesh complexity and allows highly efficient rendering. The solution is very general, allowing preservation of any attribute value defined on the high resolution mesh. We also describe an alternative application: the conversion of 3D models with 3D static procedural textures into standard 3D models with 2D textures.",Paolo Cignoni;Claudio Montani;Roberto Scopigno;Claudio Rocchini,P. Cignoni;C. Montani;C. Rocchini;R. Scopigno,"Ist. di Elaborazione dell'Inf., Italy",10.1109/VISUAL.1993.398868,"surface simplification, detail preservation,texture mapping",90,22,29,
InfoVis,2004,An Evaluation of Microarray Visualization Tools for Biological Insight,10.1109/INFVIS.2004.5,http://dx.doi.org/10.1109/INFVIS.2004.5,1,8,C,"High-throughput experiments such as gene expression microarrays in the life sciences result in large datasets. In response, a wide variety of visualization tools have been created to facilitate data analysis. Biologists often face a dilemma in choosing the best tool for their situation. The tool that works best for one biologist may not work well for another due to differences in the type of insight they seek from their data. A primary purpose of a visualization tool is to provide domain-relevant insight into the data. Ideally, any user wants maximum information in the least possible time. In this paper we identify several distinct characteristics of insight that enable us to recognize and quantify it. Based on this, we empirically evaluate five popular microarray visualization tools. Our conclusions can guide biologists in selecting the best tool for their data, and computer scientists in developing and evaluating visualizations",Purvi Saraiya;Chris North 0001;Karen Duca,P. Saraiya;C. North;K. Duca,Virginia Polytechnic Institute and State University,10.1109/INFVIS.2001.963289,"Data visualization, empirical evaluation, insight, high throughput experiments, microarray data, bioinformatics",90,38,31,
Vis,2004,Dual marching cubes,10.1109/VISUAL.2004.28,http://dx.doi.org/10.1109/VISUAL.2004.28,489,496,C,"We present the definition and computational algorithms for a new class of surfaces which are dual to the isosurface produced by the widely used marching cubes (MC) algorithm. These new isosurfaces have the same separating properties as the MC surfaces but they are comprised of quad patches that tend to eliminate the common negative aspect of poorly shaped triangles of the MC isosurfaces. Based upon the concept of this new dual operator, we describe a simple, but rather effective iterative scheme for producing smooth separating surfaces for binary, enumerated volumes which are often produced by segmentation algorithms. Both the dual surface algorithm and the iterative smoothing scheme are easily implemented.",Gregory M. Nielson,G.M. Nielson,"Arizona Univ., Tucson, AZ, USA",10.1109/VISUAL.2002.1183807;10.1109/VISUAL.1991.175782,"Marching Cubes, isosurfaces, triangular mesh, dual graph, segmented data, smoothing",90,38,16,
InfoVis,2006,Visualizing Business Data with Generalized Treemaps,10.1109/TVCG.2006.200,http://dx.doi.org/10.1109/TVCG.2006.200,789,796,J,"Business data is often presented using simple business graphics. These familiar visualizations are effective for providing overviews, but fall short for the presentation of large amounts of detailed information. Treemaps can provide such detail, but are often not easy to understand. We present how standard treemap algorithms can be adapted such that the results mimic familiar business graphics. Specifically, we present the use of different layout algorithms per level, a number of variations of the squarified algorithm, the use of variable borders, and the use of non-rectangular shapes. The combined use of these leads to histograms, pie charts and a variety of other styles",Roel Vliegen;Jarke J. van Wijk;Erik-Jan van der Linden,Roel Vliegen;Jarke J. van Wijk;Erik-Jan van der Linden,MagnaView;Technische Universiteit Eindhoven;Magnaview,10.1109/VISUAL.2005.1532781;10.1109/INFVIS.2001.963290;10.1109/VISUAL.1991.175815;10.1109/INFVIS.2005.1532125;10.1109/INFVIS.1999.801859,"Information visualization, treemap, business graphics, hierarchical data",90,56,19,
InfoVis,2007,Multi-Level Graph Layout on the GPU,10.1109/TVCG.2007.70580,http://dx.doi.org/10.1109/TVCG.2007.70580,1310,1319,J,"This paper presents a new algorithm for force directed graph layout on the GPU. The algorithm, whose goal is to compute layouts accurately and quickly, has two contributions. The first contribution is proposing a general multi-level scheme, which is based on spectral partitioning. The second contribution is computing the layout on the GPU. Since the GPU requires a data parallel programming model, the challenge is devising a mapping of a naturally unstructured graph into a well-partitioned structured one. This is done by computing a balanced partitioning of a general graph. This algorithm provides a general multi-level scheme, which has the potential to be used not only for computation on the GPU, but also on emerging multi-core architectures. The algorithm manages to compute high quality layouts of large graphs in a fraction of the time required by existing algorithms of similar quality. An application for visualization of the topologies of ISP (Internet service provider) networks is presented.",Yaniv Frishman;Ayellet Tal,Yaniv Frishman;Ayellet Tal,"Technion, Israel Institute of Technology;Technion, Israel Institute of Technology",10.1109/INFVIS.2004.66,"Graph layout, GPU, graph partitioning",90,69,41,
Vis,2008,Color Design for Illustrative Visualization,10.1109/TVCG.2008.118,http://dx.doi.org/10.1109/TVCG.2008.118,1739,1754,J,"Professional designers and artists are quite cognizant of the rules that guide the design of effective color palettes, from both aesthetic and attention-guiding points of view. In the field of visualization, however, the use of systematic rules embracing these aspects has received less attention. The situation is further complicated by the fact that visualization often uses semi-transparencies to reveal occluded objects, in which case the resulting color mixing effects add additional constraints to the choice of the color palette. Color design forms a crucial part in visual aesthetics. Thus, the consideration of these issues can be of great value in the emerging field of illustrative visualization. We describe a knowledge-based system that captures established color design rules into a comprehensive interactive framework, aimed to aid users in the selection of colors for scene objects and incorporating individual preferences, importance functions, and overall scene composition. Our framework also offers new knowledge and solutions for the mixing, ordering and choice of colors in the rendering of semi-transparent layers and surfaces. All design rules are evaluated via user studies, for which we extend the method of conjoint analysis to task-based testing scenarios. Our framework's use of principles rooted in color design with application for the illustration of features in pre-classified data distinguishes it from existing systems which target the exploration of continuous-range density data via perceptual color maps.",Lujin Wang;Joachim Giesen;Kevin T. McDonnell;Peter Zolliker;Klaus Mueller,Lujin Wang;Joachim Giesen;Kevin T. McDonnell;Peter Zolliker;Klaus Mueller,Stony Brook University;Friedrich-Schiller-Universita¿t Jena;Dowling College;EMPA Du¿bendorf;Stony Brook University,10.1109/VISUAL.1993.398874;10.1109/VISUAL.1996.568118;10.1109/TVCG.2007.70542;10.1109/TVCG.2006.174;10.1109/VISUAL.2001.964510,"Color design, volume rendering, transparency, user study evaluation, conjoint analysis, illustrative visualization",90,65,37,
VAST,2009,Visual opinion analysis of customer feedback data,10.1109/VAST.2009.5333919,http://dx.doi.org/10.1109/VAST.2009.5333919,187,194,C,"Today, online stores collect a lot of customer feedback in the form of surveys, reviews, and comments. This feedback is categorized and in some cases responded to, but in general it is underutilized - even though customer satisfaction is essential to the success of their business. In this paper, we introduce several new techniques to interactively analyze customer comments and ratings to determine the positive and negative opinions expressed by the customers. First, we introduce a new discrimination-based technique to automatically extract the terms that are the subject of the positive or negative opinion (such as price or customer service) and that are frequently commented on. Second, we derive a Reverse-Distance-Weighting method to map the attributes to the related positive and negative opinions in the text. Third, the resulting high-dimensional feature vectors are visualized in a new summary representation that provides a quick overview. We also cluster the reviews according to the similarity of the comments. Special thumbnails are used to provide insight into the composition of the clusters and their relationship. In addition, an interactive circular correlation map is provided to allow analysts to detect the relationships of the comments to other important attributes and the scores. We have applied these techniques to customer comments from real-world online stores and product reviews from web sites to identify the strength and problems of different products and services, and show the potential of our technique.",Daniela Oelke;Ming C. Hao;Christian Rohrdantz;Daniel A. Keim;Umeshwar Dayal;Lars-Erik Haug;Halldór Janetzko,Daniela Oelke;Ming Hao;Christian Rohrdantz;Daniel A. Keim;Umeshwar Dayal;Lars-Erik Haug;Halldor Janetzko,"University of Konstanz, Germany;Hewlett Packard Laboratories, Palo Alto, CA, USA;University of Konstanz, Germany;University of Konstanz, Germany;Hewlett Packard Laboratories, Palo Alto, CA, USA;Hewlett Packard Laboratories, Palo Alto, CA, USA;University of Konstanz, Germany",,"Visual Opinion Analysis, Visual Sentiment Analysis, Visual Document Analysis, Attribute Extraction",90,36,19,
Vis,2009,Depth-Dependent Halos: Illustrative Rendering of Dense Line Data,10.1109/TVCG.2009.138,http://dx.doi.org/10.1109/TVCG.2009.138,1299,1306,J,"We present a technique for the illustrative rendering of 3D line data at interactive frame rates. We create depth-dependent halos around lines to emphasize tight line bundles while less structured lines are de-emphasized. Moreover, the depth-dependent halos combined with depth cueing via line width attenuation increase depth perception, extending techniques from sparse line rendering to the illustrative visualization of dense line data. We demonstrate how the technique can be used, in particular, for illustrating DTI fiber tracts but also show examples from gas and fluid flow simulations and mathematics as well as describe how the technique extends to point data. We report on an informal evaluation of the illustrative DTI fiber tract visualizations with domain experts in neurosurgery and tractography who commented positively about the results and suggested a number of directions for future work.",Maarten H. Everts;Henk Bekker;Jos B. T. M. Roerdink;Tobias Isenberg 0001,Maarten H. Everts;Henk Bekker;Jos B.T.M. Roerdink;Tobias Isenberg,University of Groningen;University of Groningen;University of Groningen;University of Groningen,10.1109/VISUAL.2000.885694;10.1109/TVCG.2007.70532;10.1109/TVCG.2006.172;10.1109/VISUAL.2000.885696;10.1109/VISUAL.2005.1532778;10.1109/TVCG.2006.115;10.1109/VISUAL.2005.1532859;10.1109/TVCG.2006.197;10.1109/VISUAL.2005.1532858;10.1109/TVCG.2007.70555;10.1109/VISUAL.1996.567777;10.1109/VISUAL.2004.48,"Illustrative rendering and visualization, NPR, dense line data, DTI, black-and-white rendering, GPU technique",90,71,44,BP
InfoVis,2012,Whisper: Tracing the Spatiotemporal Process of Information Diffusion in Real Time,10.1109/TVCG.2012.291,http://dx.doi.org/10.1109/TVCG.2012.291,2649,2658,J,"When and where is an idea dispersed? Social media, like Twitter, has been increasingly used for exchanging information, opinions and emotions about events that are happening across the world. Here we propose a novel visualization design, “Whisper”, for tracing the process of information diffusion in social media in real time. Our design highlights three major characteristics of diffusion processes in social media: the temporal trend, social-spatial extent, and community response of a topic of interest. Such social, spatiotemporal processes are conveyed based on a sunflower metaphor whose seeds are often dispersed far away. In Whisper, we summarize the collective responses of communities on a given topic based on how tweets were retweeted by groups of users, through representing the sentiments extracted from the tweets, and tracing the pathways of retweets on a spatial hierarchical layout. We use an efficient flux line-drawing algorithm to trace multiple pathways so the temporal and spatial patterns can be identified even for a bursty event. A focused diffusion series highlights key roles such as opinion leaders in the diffusion process. We demonstrate how our design facilitates the understanding of when and where a piece of information is dispersed and what are the social responses of the crowd, for large-scale events including political campaigns and natural disasters. Initial feedback from domain experts suggests promising use for today's information consumption and dispersion in the wild.",Nan Cao;Yu-Ru Lin;Xiaohua Sun;David Lazer;Shixia Liu;Huamin Qu,Nan Cao;Yu-Ru Lin;Xiaohua Sun;David Lazer;Shixia Liu;Huamin Qu,Hong Kong University of Science and Technology;Northeastern University;TongJi University;Northeastern University;Microsoft Research Asia;Hong Kong University of Science and Technology,10.1109/TVCG.2009.171;10.1109/TVCG.2006.147;10.1109/INFVIS.2000.885098;10.1109/TVCG.2006.202;10.1109/TVCG.2007.70535;10.1109/TVCG.2010.129;10.1109/TVCG.2008.125;10.1109/TVCG.2011.188,"Information visualization, Information diffusion, Contagion, Social media, Microblogging, Spatiotemporal patterns",90,80,54,
InfoVis,2013,StoryFlow: Tracking the Evolution of Stories,10.1109/TVCG.2013.196,http://dx.doi.org/10.1109/TVCG.2013.196,2436,2445,J,"Storyline visualizations, which are useful in many applications, aim to illustrate the dynamic relationships between entities in a story. However, the growing complexity and scalability of stories pose great challenges for existing approaches. In this paper, we propose an efficient optimization approach to generating an aesthetically appealing storyline visualization, which effectively handles the hierarchical relationships between entities over time. The approach formulates the storyline layout as a novel hybrid optimization approach that combines discrete and continuous optimization. The discrete method generates an initial layout through the ordering and alignment of entities, and the continuous method optimizes the initial layout to produce the optimal one. The efficient approach makes real-time interactions (e.g., bundling and straightening) possible, thus enabling users to better understand and track how the story evolves. Experiments and case studies are conducted to demonstrate the effectiveness and usefulness of the optimization approach.",Shixia Liu;Yingcai Wu;Enxun Wei;Mengchen Liu;Yang Liu 0014,Shixia Liu;Yingcai Wu;Enxun Wei;Mengchen Liu;Yang Liu,Microsoft Research Asia;Microsoft Research Asia;Shanghai Jiao Tong University;Tsinghua University;Microsoft Research Asia,10.1109/TVCG.2012.253;10.1109/TVCG.2011.255;10.1109/TVCG.2010.179;10.1109/TVCG.2011.226;10.1109/VAST.2008.4677364;10.1109/TVCG.2012.212;10.1109/TVCG.2013.221;10.1109/TVCG.2012.225;10.1109/VAST.2006.261421;10.1109/VAST.2009.5333437;10.1109/TVCG.2011.239,"Storylines, story-telling visualization, user interactions, level-of-detail, optimization",90,81,47,
Vis,1996,Anatomy-based facial tissue modeling using the finite element method,10.1109/VISUAL.1996.567595,http://dx.doi.org/10.1109/VISUAL.1996.567595,21,28,C,"Anatomy-based facial tissue modeling for surgical simulation is a field whose time has come. Real-time facial animation has been created in the last few years using models based on the anatomical structure of the human skin. Anatomy-based models are also under development in the field of medical visualization, with which facial surgery can be realistically simulated. In this article, we present an anatomy-based 3D finite element tissue model. Integrated into a computer-aided surgical planning system, this model allows the precise prediction of soft tissue changes resulting from the realignment of the underlying bone structure. The model has already been used in our Department of Oral and Maxillofacial Surgery and has improved craniofacial surgical planning procedures. The model is described in detail, and surgical simulation results are shown and discussed.",Erwin Keeve;Sabine Girod;Paula Pfeifle;Bernd Girod,E. Keeve;S. Girod;P. Pfeifle;B. Girod,"Telecommun. Inst., Erlangen-Nurnberg Univ., Germany",,"human facial modeling, finite element method, computer-aided surgery, surgery planning and simulation",89,34,12,
InfoVis,2001,Interactive visualization of multiple query results,10.1109/INFVIS.2001.963287,http://dx.doi.org/10.1109/INFVIS.2001.963287,105,112,C,,Susan L. Havre;Elizabeth G. Hetzler;Kenneth A. Perrine;Elizabeth Jurrus;Nancy Miller,S. Havre;E. Hetzler;K. Perrine;E. Jurrus;N. Miller,Battelle Pacific Northwest Division,10.1109/INFVIS.1998.729570;10.1109/VISUAL.1998.745302;10.1109/VISUAL.1993.398863,,89,31,15,
InfoVis,2001,A comparison of 2-D visualizations of hierarchies,10.1109/INFVIS.2001.963290,http://dx.doi.org/10.1109/INFVIS.2001.963290,131,138,C,,S. Todd Barlow;Padraic Neville,T. Barlow;P. Neville,SAS Institute Inc.,10.1109/INFVIS.1998.729557;10.1109/VISUAL.1992.235217,,89,45,8,
Vis,2005,Query-driven visualization of large data sets,10.1109/VISUAL.2005.1532792,http://dx.doi.org/10.1109/VISUAL.2005.1532792,167,174,C,"We present a practical and general-purpose approach to large and complex visual data analysis where visualization processing, rendering and subsequent human interpretation is constrained to the subset of data deemed interesting by the user. In many scientific data analysis applications, ""interesting"" data can be defined by compound Boolean range queries of the form (temperature&gt;1000) AND (70&lt;pressure&lt;90). As data sizes grow larger, a central challenge is to answer such queries as efficiently as possible. Prior work in the visualization community has focused on answering range queries for scalar fields within the context of accelerating the search phase of isosurface algorithms. In contrast, our work describes an approach that leverages state-of-the-art indexing technology from the scientific data management community called ""bitmap indexing"". Our implementation, which we call ""DEX"" (short for dextrous data explorer), uses bitmap indexing to efficiently answer multivariate, multidimensional data queries to provide input to a visualization pipeline. We present an analysis overview and benchmark results that show bitmap indexing offers significant storage and performance improvements when compared to previous approaches for accelerating the search phase of isosurface algorithms. More importantly, since bitmap indexing supports complex multidimensional, multivariate range queries, it is more generally applicable to scientific data visualization and analysis problems. In addition to benchmark performance and analysis, we apply DEX to a typical scientific visualization problem encountered in combustion simulation data analysis.",Kurt Stockinger;John Shalf;Kesheng Wu;E. Wes Bethel,K. Stockinger;J. Shalf;K. Wu;E.W. Bethel,"Computational Res. Div., Lawrence Berkeley Lab., CA, USA;Computational Res. Div., Lawrence Berkeley Lab., CA, USA;Computational Res. Div., Lawrence Berkeley Lab., CA, USA;Computational Res. Div., Lawrence Berkeley Lab., CA, USA",10.1109/VISUAL.1999.809864;10.1109/VISUAL.2004.95;10.1109/VISUAL.1998.745299;10.1109/VISUAL.1996.568121,"query-driven visualization, visual analytics, bitmap index, multivariate visualization, large data visualization, data analysis, scientific data management",89,23,37,
VAST,2008,Characterizing users' visual analytic activity for insight provenance,10.1109/VAST.2008.4677365,http://dx.doi.org/10.1109/VAST.2008.4677365,123,130,C,"Insight provenance - a historical record of the process and rationale by which an insight is derived - is an essential requirement in many visual analytics applications. While work in this area has relied on either manually recorded provenance (e.g., user notes) or automatically recorded event-based insight provenance (e.g., clicks, drags, and key-presses), both approaches have fundamental limitations. Our aim is to develop a new approach that combines the benefits of both approaches while avoiding their deficiencies. Toward this goal, we characterize userspsila visual analytic activity at multiple levels of granularity. Moreover, we identify a critical level of abstraction, Actions, that can be used to represent visual analytic activity with a set of general but semantically meaningful behavior types. In turn, the action types can be used as the semantic building blocks for insight provenance. We present a catalog of common actions identified through observations of several different visual analytic systems. In addition, we define a taxonomy to categorize actions into three major classes based on their semantic intent. The concept of actions has been integrated into our labpsilas prototype visual analytic system, HARVEST, as the basis for its insight provenance capabilities.",David Gotz;Michelle X. Zhou,David Gotz;Michelle X. Zhou,"IBM T.J. Watson Research Center, USA;IBM T.J. Watson Research Center, USA",10.1109/INFVIS.2004.2;10.1109/INFVIS.1996.559213;10.1109/TVCG.2007.70577;10.1109/VISUAL.2005.1532788;10.1109/VAST.2007.4388992;10.1109/INFVIS.2005.1532136;10.1109/INFVIS.1998.729560;10.1109/INFVIS.2004.10;10.1109/VAST.2006.261430;10.1109/INFVIS.2000.885092;10.1109/VISUAL.1990.146375;10.1109/VISUAL.2002.1183791,"Taxonomy, Information Visualization, Analytic Activity, Visual Analytics, Insight Provenance",89,36,29,
Vis,2009,A User Study to Compare Four Uncertainty Visualization Methods for 1D and 2D Datasets,10.1109/TVCG.2009.114,http://dx.doi.org/10.1109/TVCG.2009.114,1209,1218,J,"Many techniques have been proposed to show uncertainty in data visualizations. However, very little is known about their effectiveness in conveying meaningful information. In this paper, we present a user study that evaluates the perception of uncertainty amongst four of the most commonly used techniques for visualizing uncertainty in one-dimensional and two-dimensional data. The techniques evaluated are traditional errorbars, scaled size of glyphs, color-mapping on glyphs, and color-mapping of uncertainty on the data surface. The study uses generated data that was designed to represent the systematic and random uncertainty components. Twenty-seven users performed two types of search tasks and two types of counting tasks on 1D and 2D datasets. The search tasks involved finding data points that were least or most uncertain. The counting tasks involved counting data features or uncertainty features. A 4 times 4 full-factorial ANOVA indicated a significant interaction between the techniques used and the type of tasks assigned for both datasets indicating that differences in performance between the four techniques depended on the type of task performed. Several one-way ANOVAs were computed to explore the simple main effects. Bonferronni's correction was used to control for the family-wise error rate for alpha-inflation. Although we did not find a consistent order among the four techniques for all the tasks, there are several findings from the study that we think are useful for uncertainty visualization design. We found a significant difference in user performance between searching for locations of high and searching for locations of low uncertainty. Errorbars consistently underperformed throughout the experiment. Scaling the size of glyphs and color-mapping of the surface performed reasonably well. The efficiency of most of these techniques were highly dependent on the tasks performed. We believe that these findings can be used in future uncertainty visualization design. In addition, the framework developed in this user study presents a structured approach to evaluate uncertainty visualization techniques, as well as provides a basis for future research in uncertainty visualization.",Jibonananda Sanyal;Song Zhang 0004;Gargi Bhattacharya;Philip Amburn;Robert J. Moorhead II,Jibonananda Sanyal;Song Zhang;Gargi Bhattacharya;Phil Amburn;Robert Moorhead,Mississippi State University;Mississippi State University;Southern Illinois University;Mississippi State University;Mississippi State University,10.1109/TVCG.2007.70518;10.1109/VISUAL.1996.568105;10.1109/VISUAL.2000.885679;10.1109/INFVIS.2002.1173145;10.1109/INFVIS.2004.59;10.1109/TVCG.2007.70530,"User study, uncertainty visualization",89,71,42,
InfoVis,2012,Design Considerations for Optimizing Storyline Visualizations,10.1109/TVCG.2012.212,http://dx.doi.org/10.1109/TVCG.2012.212,2679,2688,J,"Storyline visualization is a technique used to depict the temporal dynamics of social interactions. This visualization technique was first introduced as a hand-drawn illustration in XKCD's “Movie Narrative Charts” [21]. If properly constructed, the visualization can convey both global trends and local interactions in the data. However, previous methods for automating storyline visualizations are overly simple, failing to achieve some of the essential principles practiced by professional illustrators. This paper presents a set of design considerations for generating aesthetically pleasing and legible storyline visualizations. Our layout algorithm is based on evolutionary computation, allowing us to effectively incorporate multiple objective functions. We show that the resulting visualizations have significantly improved aesthetics and legibility compared to existing techniques.",Yuzuru Tanahashi;Kwan-Liu Ma,Yuzuru Tanahashi;Kwan-Liu Ma,University of California Davis;University of California Davis,10.1109/TVCG.2008.166;10.1109/TVCG.2008.135;10.1109/TVCG.2011.190;10.1109/TVCG.2011.239;10.1109/TVCG.2006.193;10.1109/TVCG.2007.70535;10.1109/INFVIS.2003.1249008;10.1109/TVCG.2008.125;10.1109/INFVIS.2002.1173160,"Layout algorithm, timeline visualization, storyline visualization, design study",89,83,36,
InfoVis,1997,On integrating visualization techniques for effective software exploration,10.1109/INFVIS.1997.636784,http://dx.doi.org/10.1109/INFVIS.1997.636784,38,45,C,"This paper describes the SHriMP visualization technique for seamlessly exploring software structure and browsing source code, with a focus on effectively assisting hybrid program comprehension strategies. The technique integrates both pan+zoom and fisheye-view visualization approaches for exploring a nested graph view of software structure. The fisheye-view approach handles multiple focal points, which are necessary when examining several subsystems and their mutual interconnections. Source code is presented by embedding code fragments within the nodes of the nested graph. Finer connections among these fragments are represented by a network that is navigated using a hypertext link-following metaphor. SHriMP combines this hypertext metaphor with animated panning and zooming motions over the nested graph to provide continuous orientation and contextual cues for the user. The SHriMP tool is being evaluated in several user studies. Observations of users performing program understanding tasks with the tool are discussed.",Margaret-Anne D. Storey;Kenny Wong;F. David Fracchia;Hausi A. Müller,M.-A.D. Storey;K. Wong;F.D. Fracchia;H.A. Muller,"Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada",10.1109/VISUAL.1991.175815,"Nested graphs, pan and zoom, fisheye views, hypertext, mental map, software visualization, program understanding",88,27,31,
Vis,1998,View dependent isosurface extraction,10.1109/VISUAL.1998.745300,http://dx.doi.org/10.1109/VISUAL.1998.745300,175,180,C,"We propose a new approach to polygonal isosurface extraction that is based on extracting only the visible portion of the isosurface. The visibility tests are done in two phases. First, coarse visibility tests are performed in software to determine the visible cells. These tests are based on hierarchical tiles and shear-warp factorization. The second phase resolves the visible portions of the extracted triangles and is accomplished by the graphics hardware. While the latest isosurface extraction methods have effectively eliminated the search phase bottleneck, the cost of constructing and rendering the isosurface remains high. Many of today's large datasets contain very large and complex isosurfaces that can easily overwhelm even state-of-the-art graphics hardware. The proposed approach is output sensitive and is thus well suited for remote visualization applications where the extraction and rendering phases are done on a separate machines.",Yarden Livnat;Charles D. Hansen,Y. Livnat;C. Hansen,"Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.1995.480806;10.1109/VISUAL.1996.568121;10.1109/VISUAL.1996.568144;10.1109/VISUAL.1998.745713;10.1109/VISUAL.1994.346308;10.1109/VISUAL.1996.568123;10.1109/VISUAL.1996.568127;10.1109/VISUAL.1994.346307;10.1109/VISUAL.1991.175780;10.1109/VISUAL.1994.346334,,88,42,23,
Vis,2002,Oriented tensor reconstruction: tracing neural pathways from diffusion tensor MRI,10.1109/VISUAL.2002.1183799,http://dx.doi.org/10.1109/VISUAL.2002.1183799,387,394,C,"In this paper we develop a new technique for tracing anatomical fibers from 3D tensor fields. The technique extracts salient tensor features using a local regularization technique that allows the algorithm to cross noisy regions and bridge gaps in the data. We applied the method to human brain DT-MRI data and recovered identifiable anatomical structures that correspond to the white matter brain-fiber pathways. The images in this paper are derived from a dataset having 121/spl times/88/spl times/60 resolution. We were able to recover fibers with less than the voxel size resolution by applying the regularization technique, i.e., using a priori assumptions about fiber smoothness. The regularization procedure is done through a moving least squares filter directly incorporated in the tracing algorithm.",Leonid Zhukov;Alan H. Barr,L. Zhukov;A.H. Barr,"Dept. of Comput. Sci., California Inst. of Technol., Pasadena, CA, USA;Dept. of Comput. Sci., California Inst. of Technol., Pasadena, CA, USA",10.1109/VISUAL.1999.809886;10.1109/VISUAL.1992.235193;10.1109/VISUAL.1999.809894;10.1109/VISUAL.1998.745294;10.1109/VISUAL.1991.175771,"Diffusion tensors, adaptive filtering, moving least squares, streamlines, fiber tracing, pathways, salient features",88,45,23,
Vis,2003,Image space based visualization of unsteady flow on surfaces,10.1109/VISUAL.2003.1250364,http://dx.doi.org/10.1109/VISUAL.2003.1250364,131,138,C,"We present a technique for direct visualization of unsteady flow on surfaces from computational fluid dynamics. The method generates dense representations of time-dependent vector fields with high spatio-temporal correlation using both Lagrangian-Eulerian advection and image based flow visualization as its foundation. While the 3D vector fields are associated with arbitrary triangular surface meshes, the generation and advection of texture properties is confined to image space. Frame rates of up to 20 frames per second are realized by exploiting graphics card hardware. We apply this algorithm to unsteady flow on boundary surfaces of, large, complex meshes from computational fluid dynamics composed of more than 250,000 polygons, dynamic meshes with time-dependent geometry and topology, as well as medical data.",Robert S. Laramee;Bruno Jobard;Helwig Hauser,R.S. Laramee;B. Jobard;H. Hauser,"VRVis Res. Center, Graz, Austria",10.1109/VISUAL.2001.964493;10.1109/VISUAL.1994.346313;10.1109/VISUAL.1995.480817,"Unsteady flow visualization, computational fluid dynamics (CFD), surface representation, texture mapping",88,37,19,
Vis,2003,Large mesh simplification using processing sequences,10.1109/VISUAL.2003.1250408,http://dx.doi.org/10.1109/VISUAL.2003.1250408,465,472,C,"In this paper we show how out-of-core mesh processing techniques can be adapted to perform their computations based on the new processing sequence paradigm (Isenburg, et al., 2003), using mesh simplification as an example. We believe that this processing concept will also prove useful for other tasks, such a parameterization, remeshing, or smoothing, for which currently only in-core solutions exist. A processing sequence represents a mesh as a particular interleaved ordering of indexed triangles and vertices. This representation allows streaming very large meshes through main memory while maintaining information about the visitation status of edges and vertices. At any time, only a small portion of the mesh is kept in-core, with the bulk of the mesh data residing on disk. Mesh access is restricted to a fixed traversal order, but full connectivity and geometry information is available for the active elements of the traversal. This provides seamless and highly efficient out-of-core access to very large meshes for algorithms that can adapt their computations to this fixed ordering. The two abstractions that are naturally supported by this representation are boundary-based and buffer-based processing. We illustrate both abstractions by adapting two different simplification methods to perform their computation using a prototype of our mesh processing sequence API. Both algorithms benefit from using processing sequences in terms of improved quality, more efficient execution, and smaller memory footprints.",Martin Isenburg;Peter Lindstrom;Stefan Gumhold;Jack Snoeyink,M. Isenburg;P. Lindstrom;S. Gumhold;J. Snoeyink,"North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.2001.964502;10.1109/VISUAL.2001.964503;10.1109/VISUAL.1996.568125;10.1109/VISUAL.1998.745282;10.1109/VISUAL.2001.964532;10.1109/VISUAL.2002.1183765,"Out-of-core algorithms, processing sequences, mesh simplification, large meshes",88,37,25,
InfoVis,2008,Distributed Cognition as a Theoretical Framework for Information Visualization,10.1109/TVCG.2008.121,http://dx.doi.org/10.1109/TVCG.2008.121,1173,1180,J,"Even though information visualization (InfoVis) research has matured in recent years, it is generally acknowledged that the field still lacks supporting, encompassing theories. In this paper, we argue that the distributed cognition framework can be used to substantiate the theoretical foundation of InfoVis. We highlight fundamental assumptions and theoretical constructs of the distributed cognition approach, based on the cognitive science literature and a real life scenario. We then discuss how the distributed cognition framework can have an impact on the research directions and methodologies we take as InfoVis researchers. Our contributions are as follows. First, we highlight the view that cognition is more an emergent property of interaction than a property of the human mind. Second, we argue that a reductionist approach to study the abstract properties of isolated human minds may not be useful in informing InfoVis design. Finally we propose to make cognition an explicit research agenda, and discuss the implications on how we perform evaluation and theory building.",Zhicheng Liu;Nancy J. Nersessian;John T. Stasko,Zhicheng Liu;Nancy Nersessian;John Stasko,Georgia Institute of Technology;Georgia Institute of Technology;Georgia Institute of Technology,10.1109/TVCG.2007.70515;10.1109/TVCG.2007.70577;10.1109/VAST.2007.4389006;10.1109/INFVIS.2000.885092,"Information visualization, distributed cognition, interaction, representation, theory and methods",88,67,40,
InfoVis,2011,Composite Density Maps for Multivariate Trajectories,10.1109/TVCG.2011.181,http://dx.doi.org/10.1109/TVCG.2011.181,2518,2527,J,"We consider moving objects as multivariate time-series. By visually analyzing the attributes, patterns may appear that explain why certain movements have occurred. Density maps as proposed by Scheepens et al. [25] are a way to reveal these patterns by means of aggregations of filtered subsets of trajectories. Since filtering is often not sufficient for analysts to express their domain knowledge, we propose to use expressions instead. We present a flexible architecture for density maps to enable custom, versatile exploration using multiple density fields. The flexibility comes from a script, depicted in this paper as a block diagram, which defines an advanced computation of a density field. We define six different types of blocks to create, compose, and enhance trajectories or density fields. Blocks are customized by means of expressions that allow the analyst to model domain knowledge. The versatility of our architecture is demonstrated with several maritime use cases developed with domain experts. Our approach is expected to be useful for the analysis of objects in other domains.",Roeland Scheepens;Niels Willems;Huub van de Wetering;Gennady L. Andrienko;Natalia V. Andrienko;Jarke J. van Wijk,Roeland Scheepens;Niels Willems;Huub van de Wetering;Gennady Andrienko;Natalia Andrienko;Jarke J. van Wijk,TU Eindhoven;TU Eindhoven;TU Eindhoven;Fraunhofer Institute IAIS;Fraunhofer Institute IAIS;TU Eindhoven,10.1109/TVCG.2006.178;10.1109/VAST.2008.4677356;10.1109/TVCG.2007.70570;10.1109/VAST.2010.5652478;10.1109/VAST.2007.4388992;10.1109/VAST.2010.5652467;10.1109/VAST.2009.5332593,"Trajectories, Kernel Density Estimation, Multivariate Data, Geographical Information Systems, Raster Maps",88,85,34,
VAST,2011,Observation-level interaction with statistical models for visual analytics,10.1109/VAST.2011.6102449,http://dx.doi.org/10.1109/VAST.2011.6102449,121,130,C,"In visual analytics, sensemaking is facilitated through interactive visual exploration of data. Throughout this dynamic process, users combine their domain knowledge with the dataset to create insight. Therefore, visual analytic tools exist that aid sensemaking by providing various interaction techniques that focus on allowing users to change the visual representation through adjusting parameters of the underlying statistical model. However, we postulate that the process of sensemaking is not focused on a series of parameter adjustments, but instead, a series of perceived connections and patterns within the data. Thus, how can models for visual analytic tools be designed, so that users can express their reasoning on observations (the data), instead of directly on the model or tunable parameters? Observation level (and thus “observation”) in this paper refers to the data points within a visualization. In this paper, we explore two possible observation-level interactions, namely exploratory and expressive, within the context of three statistical methods, Probabilistic Principal Component Analysis (PPCA), Multidimensional Scaling (MDS), and Generative Topographic Mapping (GTM). We discuss the importance of these two types of observation level interactions, in terms of how they occur within the sensemaking process. Further, we present use cases for GTM, MDS, and PPCA, illustrating how observation level interaction can be incorporated into visual analytic tools.",Alex Endert;Chao Han;Dipayan Maiti;Leanna House;Scotland Leman;Chris North 0001,Alex Endert;Chao Han;Dipayan Maiti;Leanna House;Scotland Leman;Chris North,"Department of Computer Science, Virginia Tech, USA;Department of Statistics, Virginia Tech, USA;Department of Statistics, Virginia Tech, USA;Department of Statistics, Virginia Tech, USA;Department of Statistics, Virginia Tech, USA;Department of Computer Science, Virginia Tech, USA",,"observation-level interaction, visual analytics, statistical models",88,67,34,
VAST,2013,HierarchicalTopics: Visually Exploring Large Text Collections Using Topic Hierarchies,10.1109/TVCG.2013.162,http://dx.doi.org/10.1109/TVCG.2013.162,2002,2011,J,"Analyzing large textual collections has become increasingly challenging given the size of the data available and the rate that more data is being generated. Topic-based text summarization methods coupled with interactive visualizations have presented promising approaches to address the challenge of analyzing large text corpora. As the text corpora and vocabulary grow larger, more topics need to be generated in order to capture the meaningful latent themes and nuances in the corpora. However, it is difficult for most of current topic-based visualizations to represent large number of topics without being cluttered or illegible. To facilitate the representation and navigation of a large number of topics, we propose a visual analytics system - HierarchicalTopic (HT). HT integrates a computational algorithm, Topic Rose Tree, with an interactive visual interface. The Topic Rose Tree constructs a topic hierarchy based on a list of topics. The interactive visual interface is designed to present the topic content as well as temporal evolution of topics in a hierarchical fashion. User interactions are provided for users to make changes to the topic hierarchy based on their mental model of the topic space. To qualitatively evaluate HT, we present a case study that showcases how HierarchicalTopics aid expert users in making sense of a large number of topics and discovering interesting patterns of topic groups. We have also conducted a user study to quantitatively evaluate the effect of hierarchical topic structure. The study results reveal that the HT leads to faster identification of large number of relevant topics. We have also solicited user feedback during the experiments and incorporated some suggestions into the current version of HierarchicalTopics.",Wenwen Dou;Li Yu;Derek Xiaoyu Wang;Zhiqiang Ma 0004;William Ribarsky,Wenwen Dou;Li Yu;Xiaoyu Wang;Zhiqiang Ma;William Ribarsky,University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte,10.1109/VAST.2010.5652931;10.1109/VAST.2012.6400557;10.1109/TVCG.2011.239;10.1109/VAST.2011.6102461;10.1109/VAST.2012.6400485,"Hierarchical topic representation, topic modeling, visual analytics, rose tree",88,69,35,
Vis,1991,Color icons: merging color and texture perception for integrated visualization of multiple parameters,10.1109/VISUAL.1991.175795,http://dx.doi.org/10.1109/VISUAL.1991.175795,164,"170, 420",C,A technique that harnesses color and texture perception to create integrated displays of 2D image-like multiparameter distributions is presented. The power of the technique is demonstrated by an example of a synthesized dataset and compared with several other proposed techniques. The nature of studies that are required to measure objectively and accurately the effectiveness of such displays is discussed.&lt;&lt;ETX&gt;&gt;,Haim Levkowitz,H. Levkowitz,"Dept. of Comput. Sci., Lowell Univ., MA, USA",,,87,27,16,
Vis,1992,A characterization of the scientific data analysis process,10.1109/VISUAL.1992.235203,http://dx.doi.org/10.1109/VISUAL.1992.235203,235,242,C,"It is shown how data visualization fits into the broader process of scientific data analysis. Scientists from several disciplines were observed while they analyzed their own data. Examination of the observations exposed process elements outside conventional image viewing. For example, analysts queried for quantitative information, made a variety of comparisons, applied math, managed data, and kept records. The characterization of scientific data analysis reveals activity beyond that traditionally supported by computer. It offers an understanding which has the potential to be applied to many future designs, and suggests specific recommendations for improving the support of this important aspect of scientific computing.&lt;&lt;ETX&gt;&gt;",R. R. Springmeyer;Meera Blattner;Nelson L. Max,R.R. Springmeyer;M.M. Blattner;N.L. Max,"Lawrence Livermore Nat. Lab., CA, USA;Lawrence Livermore Nat. Lab., CA, USA;Lawrence Livermore Nat. Lab., CA, USA",10.1109/VISUAL.1990.146399,,87,40,15,
InfoVis,1998,Geographic visualization: designing manipulable maps for exploring temporally varying georeferenced statistics,10.1109/INFVIS.1998.729563,http://dx.doi.org/10.1109/INFVIS.1998.729563,87,"94, 156",C,"Geographic visualization, sometimes called cartographic visualization, is a form of information visualization in which principles from cartography, geographic information systems (GIS), exploratory data analysis (EDA), and information visualization more generally are integrated in the development and assessment of visual methods that facilitate the exploration, analysis, synthesis, and presentation of georeferenced information. The authors report on development and use of one component of a prototype GVis environment designed to facilitate exploration, by domain experts, of time series multivariate georeferenced health statistics. Emphasis is on how manipulable dynamic GVis tools may facilitate visual thinking, pattern noticing, and hypothesis generation. The prototype facilitates the highlighting of data extremes, examination of change in geographic patterns over time, and exploration of similarity among georeferenced variables. A qualitative exploratory analysis of verbal protocols and transaction logs is used to characterize system use. Evidence produced through the characterization highlights differences among experts in data analysis strategies (particularly in relation to the use of attribute ""focusing"" combined with time series animation) and corresponding differences in success at noticing spatiotemporal patterns.",Alan M. MacEachren;Francis P. Boscoe;Daniel Haug;Linda Pickle,A.M. MacEachren;F.P. Boscoe;D. Haug;L.W. Pickle,"Dept. of Geogr., Pennsylvania State Univ., University Park, PA, USA",10.1109/VISUAL.1991.175794;10.1109/VISUAL.1997.663874;10.1109/VISUAL.1992.235201,,87,29,41,
Vis,2003,Empty space skipping and occlusion clipping for texture-based volume rendering,10.1109/VISUAL.2003.1250388,http://dx.doi.org/10.1109/VISUAL.2003.1250388,317,324,C,"We propose methods to accelerate texture-based volume rendering by skipping invisible voxels. We partition the volume into sub-volumes, each containing voxels with similar properties. Sub-volumes composed of only voxels mapped to empty by the transfer function are skipped. To render the adaptively partitioned sub-volumes in visibility order, we reorganize them into an orthogonal BSP tree. We also present an algorithm that computes incrementally the intersection of the volume with the slicing planes, which avoids the overhead of the intersection and texture coordinates computation introduced by the partitioning. Rendering with empty space skipping is 2 to 5 times faster than without it. To skip occluded voxels, we introduce the concept of orthogonal opacity map, that simplifies the transformation between the volume coordinates and the opacity map coordinates, which is intensively used for occlusion detection. The map is updated efficiently by the GPU. The sub-volumes are then culled and clipped against the opacity map. We also present a method that adaptively adjusts the optimal number of the opacity map updates. With occlusion clipping, about 60% of non-empty voxels can be skipped and an additional 80% speedup on average is gained for iso-surface-like rendering.",Wei Li 0004;Klaus Mueller;Arie E. Kaufman,Wei Li;K. Mueller;A. Kaufman,"Dept. of Comput. Sci., Stony Brook Univ., NY, USA;Dept. of Comput. Sci., Stony Brook Univ., NY, USA;Dept. of Comput. Sci., Stony Brook Univ., NY, USA",10.1109/VISUAL.1992.235231;10.1109/VISUAL.2001.964519;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.1999.809908;10.1109/VISUAL.2002.1183776,"Graphics hardware, texture-based volume rendering, empty space skipping, occlusion clipping, orthogonal opacity map",87,18,25,
Vis,2003,Video visualization,10.1109/VISUAL.2003.1250401,http://dx.doi.org/10.1109/VISUAL.2003.1250401,409,416,C,"Video data, generated by the entertainment industry, security and traffic cameras, video conferencing systems, video emails, and so on, is perhaps most time-consuming to process by human beings. In this paper, we present a novel methodology for ""summarizing"" video sequences using volume visualization techniques. We outline a system pipeline for capturing videos, extracting features, volume rendering video and feature data, and creating video visualization. We discuss a collection of image comparison metrics, including the linear dependence detector, for constructing ""relative"" and ""absolute"" difference volumes that represent the magnitude of variation between video frames. We describe the use of a few volume visualization techniques, including volume scene graphs and spatial transfer functions, for creating video visualization. In particular, we present a stream-based technique for processing and directly rendering video data in real time. With the aid of several examples, we demonstrate the effectiveness of using video visualization to convey meaningful information contained in video sequences.",Gareth Daniel;Min Chen 0001,G. Daniel;Min Chen,"Univ. of Wales Swansea, UK;Univ. of Wales Swansea, UK",10.1109/VISUAL.2002.1183790," Video visualization, volume rendering, video surveillance, change detection, image-swept volume",87,39,25,
Vis,2004,Optimal global conformal surface parameterization,10.1109/VISUAL.2004.75,http://dx.doi.org/10.1109/VISUAL.2004.75,267,274,C,"All orientable metric surfaces are Riemann surfaces and admit global conformal parameterizations. Riemann surface structure is a fundamental structure and governs many natural physical phenomena, such as heat diffusion and electro-magnetic fields on the surface. A good parameterization is crucial for simulation and visualization. This paper provides an explicit method for finding optimal global conformal parameterizations of arbitrary surfaces. It relies on certain holomorphic differential forms and conformal mappings from differential geometry and Riemann surface theories. Algorithms are developed to modify topology, locate zero points, and determine cohomology types of differential forms. The implementation is based on a finite dimensional optimization method. The optimal parameterization is intrinsic to the geometry, preserves angular structure, and can play an important role in various applications including texture mapping, remeshing, morphing and simulation. The method is demonstrated by visualizing the Riemann surface structure of real surfaces represented as triangle meshes.",Miao Jin;Yalin Wang 0001;Shing-Tung Yau;Xianfeng Gu,M. Jin;Y. Wang;S.-T. Yau;X. Gu,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",,"Computational geometry and object modeling, Curve / surface / solid and object representations, Surface parameterization",87,48,28,
InfoVis,2010,Pargnostics: Screen-Space Metrics for Parallel Coordinates,10.1109/TVCG.2010.184,http://dx.doi.org/10.1109/TVCG.2010.184,1017,1026,J,"Interactive visualization requires the translation of data into a screen space of limited resolution. While currently ignored by most visualization models, this translation entails a loss of information and the introduction of a number of artifacts that can be useful, (e.g., aggregation, structures) or distracting (e.g., over-plotting, clutter) for the analysis. This phenomenon is observed in parallel coordinates, where overlapping lines between adjacent axes form distinct patterns, representing the relation between variables they connect. However, even for a small number of dimensions, the challenge is to effectively convey the relationships for all combinations of dimensions. The size of the dataset and a large number of dimensions only add to the complexity of this problem. To address these issues, we propose Pargnostics, parallel coordinates diagnostics, a model based on screen-space metrics that quantify the different visual structures. Pargnostics metrics are calculated for pairs of axes and take into account the resolution of the display as well as potential axis inversions. Metrics include the number of line crossings, crossing angles, convergence, overplotting, etc. To construct a visualization view, the user can pick from a ranked display showing pairs of coordinate axes and the structures between them, or examine all possible combinations of axes at once in a matrix display. Picking the best axes layout is an NP-complete problem in general, but we provide a way of automatically optimizing the display according to the user's preferences based on our metrics and model.",Aritra Dasgupta;Robert Kosara,Aritra Dasgupta;Robert Kosara,University of North Carolina at Charlotte;University of North Carolina at Charlotte,10.1109/INFVIS.2005.1532142;10.1109/TVCG.2006.138;10.1109/VISUAL.1990.146402;10.1109/VAST.2006.261423;10.1109/VAST.2009.5332628;10.1109/INFVIS.2005.1532136;10.1109/INFVIS.1998.729559;10.1109/INFVIS.1997.636793,"Parallel coordinates, metrics, display optimization, visualization models",87,76,32,
Vis,2010,An Information-theoretic Framework for Visualization,10.1109/TVCG.2010.132,http://dx.doi.org/10.1109/TVCG.2010.132,1206,1215,J,"In this paper, we examine whether or not information theory can be one of the theoretic frameworks for visualization. We formulate concepts and measurements for qualifying visual information. We illustrate these concepts with examples that manifest the intrinsic and implicit use of information theory in many existing visualization techniques. We outline the broad correlation between visualization and the major applications of information theory, while pointing out the difference in emphasis and some technical gaps. Our study provides compelling evidence that information theory can explain a significant number of phenomena or events in visualization, while no example has been found which is fundamentally in conflict with information theory. We also notice that the emphasis of some traditional applications of information theory, such as data compression or data communication, may not always suit visualization, as the former typically focuses on the efficient throughput of a communication channel, whilst the latter focuses on the effectiveness in aiding the perceptual and cognitive process for data understanding and knowledge discovery. These findings suggest that further theoretic developments are necessary for adopting and adapting information theory for visualization.",Min Chen 0001;Heike Leitte,Min Chen;Heike Jaenicke,Swansea University;Ruprecht-Karls-University Heidelberg,10.1109/TVCG.2007.70615;10.1109/VISUAL.2005.1532781;10.1109/TVCG.2006.152;10.1109/INFVIS.1996.559213;10.1109/VISUAL.2005.1532834;10.1109/INFVIS.2000.885096;10.1109/TVCG.2007.70515;10.1109/TVCG.2006.159;10.1109/INFVIS.2004.59;10.1109/TVCG.2007.70535;10.1109/TVCG.2008.140;10.1109/TVCG.2008.121;10.1109/INFVIS.1997.636792;10.1109/VISUAL.2005.1532833;10.1109/INFVIS.2000.885092;10.1109/VISUAL.1990.146375;10.1109/VISUAL.2002.1183785,"Information theory, theory of visualization, quantitative evaluation",87,84,56,
InfoVis,2011,Flow Map Layout via Spiral Trees,10.1109/TVCG.2011.202,http://dx.doi.org/10.1109/TVCG.2011.202,2536,2544,J,"Flow maps are thematic maps that visualize the movement of objects, such as people or goods, between geographic regions. One or more sources are connected to several targets by lines whose thickness corresponds to the amount of flow between a source and a target. Good flow maps reduce visual clutter by merging (bundling) lines smoothly and by avoiding self-intersections. Most flow maps are still drawn by hand and only few automated methods exist. Some of the known algorithms do not support edge-bundling and those that do, cannot guarantee crossing-free flows. We present a new algorithmic method that uses edge-bundling and computes crossing-free flows of high visual quality. Our method is based on so-called spiral trees, a novel type of Steiner tree which uses logarithmic spirals. Spiral trees naturally induce a clustering on the targets and smoothly bundle lines. Our flows can also avoid obstacles, such as map features, region outlines, or even the targets. We demonstrate our approach with extensive experiments.",Kevin Buchin;Bettina Speckmann;Kevin Verbeek,Kevin Buchin;Bettina Speckmann;Kevin Verbeek,TU Eindhoven;TU Eindhoven;TU Eindhoven,10.1109/TVCG.2009.143;10.1109/TVCG.2008.135;10.1109/INFVIS.2005.1532150;10.1109/INFVIS.1996.559226;10.1109/TVCG.2006.147,"Flow maps, Automated Cartography, Spiral Trees",87,73,23,
InfoVis,1996,On the semantics of interactive visualizations,10.1109/INFVIS.1996.559213,http://dx.doi.org/10.1109/INFVIS.1996.559213,29,36,C,"Interactive techniques are powerful tools for manipulating visualizations to analyze, communicate and acquire information. This is especially true for large data sets or complex 3D visualizations. Although many new types of interaction have been introduced recently, very little work has been done on understanding what their components are, how they are related and how they can be combined. This paper begins to address these issues with a framework for classifying interactive visualizations. Our goal is a framework that will enable us to develop toolkits for assembling visualization interfaces both interactively and automatically.",Mei C. Chuah;Steven F. Roth,M.C. Chuah;S.F. Roth,"Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA",10.1109/INFVIS.1995.528684;10.1109/INFVIS.1996.559210,"information visualization, interactive techniques, user interfaces, automatic presentation systems, graphics",86,41,10,
Vis,1998,Image-based transfer function design for data exploration in volume visualization,10.1109/VISUAL.1998.745319,http://dx.doi.org/10.1109/VISUAL.1998.745319,319,326,C,"Transfer function design is an integrated component in volume visualization and data exploration. The common trial-and-error approach for transfer function searching is a very difficult and time consuming process. A goal oriented and parameterized transfer function model is therefore crucial in guiding the transfer function searching process for better and more meaningful visualization results. The paper presents an image based transfer function model that integrates 3D image processing tools into the volume visualization pipeline to facilitate the search for an image based transfer function in volume data visualization and exploration. The model defines a transfer function as a sequence of 3D image processing procedures, and allows the users to adjust a set of qualitative and descriptive parameters to achieve their subjective visualization goals. 3D image enhancement and boundary detection tools, and their integration methods with volume visualization algorithms are described. The application of this approach for 3D microscopy data exploration and analysis is also discussed.",Shiaofen Fang;Tom Biddlecome;Mihran Tuceryan,Shiaofen Fang;T. Biddlecome;M. Tuceryan,"Dept. of Comput. & Inf. Sci., Indiana Univ., Indianapolis, IN, USA",10.1109/VISUAL.1996.567609;10.1109/VISUAL.1996.568113,"volume visualization, 3D image processing, transfer function, volume rendering, data exploration",86,28,16,
InfoVis,2005,Parallel sets: visual analysis of categorical data,10.1109/INFVIS.2005.1532139,http://dx.doi.org/10.1109/INFVIS.2005.1532139,133,140,C,"The discrete nature of categorical data makes it a particular challenge for visualization. Methods that work very well for continuous data are often hardly usable with categorical dimensions. Only few methods deal properly with such data, mostly because of the discrete nature of categorical data, which does not translate well into the continuous domains of space and color. Parallel sets is a new visualization method that adopts the layout of parallel coordinates, but substitutes the individual data points by a frequency based representation. This abstracted view, combined with a set of carefully designed interactions, supports visual data analysis of large and complex data sets. The technique allows efficient work with meta data, which is particularly important when dealing with categorical datasets. By creating new dimensions from existing ones, for example, the user can filter the data according to his or her current needs. We also present the results from an interactive analysis of CRM data using parallel sets. We demonstrate how the flexible layout eases the process of knowledge crystallization, especially when combined with a sophisticated interaction scheme.",Fabian Bendix;Robert Kosara;Helwig Hauser,F. Bendix;R. Kosara;H. Hauser,"VRVis Res. Center, Vienna, Austria",10.1109/VISUAL.1990.146386;10.1109/VISUAL.1990.146402;10.1109/INFVIS.2003.1249016;10.1109/INFVIS.2002.1173157," categorical data, meta information, interaction",86,23,24,
Vis,2005,Understanding visualization through spatial ability differences,10.1109/VISUAL.2005.1532836,http://dx.doi.org/10.1109/VISUAL.2005.1532836,511,518,C,"Little is known about the cognitive abilities which influence the comprehension of scientific and information visualizations and what properties of the visualization affect comprehension. Our goal in this paper is to understand what makes visualizations difficult. We address this goal by examining the spatial ability differences in a diverse population selected for spatial ability variance. For example, how is, spatial ability related to visualization comprehension? What makes a particular visualization difficult or time intensive for specific groups of subjects? In this paper, we present the results of an experiment designed to answer these questions. Fifty-six subjects were tested on a basic visualization task and given standard paper tests of spatial abilities. An equal number of males and females were recruited in this study in order to increase spatial ability variance. Our results show that high spatial ability is correlated with accuracy on our three-dimensional visualization test, but not with time. High spatial ability subjects also had less difficulty with object complexity and the hidden properties of an object.",Maria C. Velez;Deborah Silver;Marilyn Tremaine,M.C. Velez;D. Silver;M. Tremaine,"Center for Adv. Inf. Process., Rutgers State Univ., NJ, USA;Center for Adv. Inf. Process., Rutgers State Univ., NJ, USA;Center for Adv. Inf. Process., Rutgers State Univ., NJ, USA",10.1109/INFVIS.2003.1249022;10.1109/VISUAL.2003.1250396,"Gender differences, orthogonal projections, spatial ability, standardized testing",86,17,36,
Vis,2006,Diffusion Tensor Visualization with Glyph Packing,10.1109/TVCG.2006.134,http://dx.doi.org/10.1109/TVCG.2006.134,1329,1336,J,"A common goal of multivariate visualization is to enable data inspection at discrete points, while also illustrating larger-scale continuous structures. In diffusion tensor visualization, glyphs are typically used to meet the first goal, and methods such as texture synthesis or fiber tractography can address the second. We adapt particle systems originally developed for surface modeling and anisotropic mesh generation to enhance the utility of glyph-based tensor visualizations. By carefully distributing glyphs throughout the field (either on a slice, or in the volume) into a dense packing, using potential energy profiles shaped by the local tensor value, we remove undue visual emphasis of the regular sampling grid of the data, and the underlying continuous features become more apparent. The method is demonstrated on a DT-MRI scan of a patient with a brain tumor",Gordon L. Kindlmann;Carl-Fredrik Westin,Gordon Kindlmann;Carl-fredrik Westin,,10.1109/VISUAL.2004.25;10.1109/VISUAL.1998.745294;10.1109/VISUAL.2004.80;10.1109/VISUAL.2002.1183797;10.1109/VISUAL.1995.485141;10.1109/VISUAL.1999.809905;10.1109/VISUAL.2003.1250379,"Diffusion tensor, glyphs, particle systems, anisotropic sampling, fiber tractography",86,63,50,
Vis,2006,Saliency-guided Enhancement for Volume Visualization,10.1109/TVCG.2006.174,http://dx.doi.org/10.1109/TVCG.2006.174,925,932,J,"Recent research in visual saliency has established a computational measure of perceptual importance. In this paper we present a visual-saliency-based operator to enhance selected regions of a volume. We show how we use such an operator on a user-specified saliency field to compute an emphasis field. We further discuss how the emphasis field can be integrated into the visualization pipeline through its modifications of regional luminance and chrominance. Finally, we validate our work using an eye-tracking-based user study and show that our new saliency enhancement operator is more effective at eliciting viewer attention than the traditional Gaussian enhancement operator",Youngmin Kim;Amitabh Varshney,Youngmin Kim;Amitabh Varshney,"University of Maryland, College Park;University of Maryland, College Park",10.1109/VISUAL.2003.1250414;10.1109/VISUAL.2003.1250412;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2002.1183777;10.1109/VISUAL.2004.64;10.1109/VISUAL.2000.885696,"Saliency, visual attention, perceptual enhancement, volume rendering, non-photorealistic rendering",86,66,30,
InfoVis,2012,Assessing the Effect of Visualizations on Bayesian Reasoning through Crowdsourcing,10.1109/TVCG.2012.199,http://dx.doi.org/10.1109/TVCG.2012.199,2536,2545,J,"People have difficulty understanding statistical information and are unaware of their wrong judgments, particularly in Bayesian reasoning. Psychology studies suggest that the way Bayesian problems are represented can impact comprehension, but few visual designs have been evaluated and only populations with a specific background have been involved. In this study, a textual and six visual representations for three classic problems were compared using a diverse subject pool through crowdsourcing. Visualizations included area-proportional Euler diagrams, glyph representations, and hybrid diagrams combining both. Our study failed to replicate previous findings in that subjects' accuracy was remarkably lower and visualizations exhibited no measurable benefit. A second experiment confirmed that simply adding a visualization to a textual Bayesian problem is of little help, even when the text refers to the visualization, but suggests that visualizations are more effective when the text is given without numerical values. We discuss our findings and the need for more such experiments to be carried out on heterogeneous populations of non-experts.",Luana Micallef;Pierre Dragicevic;Jean-Daniel Fekete,Luana Micallef;Pierre Dragicevic;Jean-Daniel Fekete,INRIA;INRIA;INRIA,10.1109/TVCG.2010.210;10.1109/TVCG.2009.122,"Bayesian reasoning, base rate fallacy, probabilistic judgment, Euler diagrams, glyphs, crowdsourcing",86,75,58,HM
Vis,1995,An extended data-flow architecture for data analysis and visualization,10.1109/VISUAL.1995.480821,http://dx.doi.org/10.1109/VISUAL.1995.480821,263,"270, 461",C,"Modular visualization environments utilizing a data-flow execution model have become quite popular in recent years, especially those that incorporate visual programming tools. However, simplistic implementations of such an execution model are quite limited when applied to problems of realistic complexity, which negate the intuitive advantage of data-flow systems. This situation can be resolved by extending the execution model to incorporate a more complete and efficient programming infrastructure while still preserving the virtues of pure ""data-flow"". This approach has been used for the implementation of a general-purpose software package, IBM Visualization Data Explorer.",Greg Abram;Lloyd Treinish,G. Abram;L. Treinish,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.1994.346305;10.1109/VISUAL.1993.398860;10.1109/VISUAL.1991.175818;10.1109/VISUAL.1992.235219,,85,47,15,
Vis,1997,The multilevel finite element method for adaptive mesh optimization and visualization of volume data,10.1109/VISUAL.1997.663907,http://dx.doi.org/10.1109/VISUAL.1997.663907,387,394,C,"Multilevel representations and mesh reduction techniques have been used for accelerating the processing and the rendering of large datasets representing scalar- or vector-valued functions defined on complex 2D or 3D meshes. We present a method based on finite element approximations which combines these two approaches in a new and unique way that is conceptually simple and theoretically sound. The main idea is to consider mesh reduction as an approximation problem in appropriate finite element spaces. Starting with a very coarse triangulation of the functional domain, a hierarchy of highly non-uniform tetrahedral (or triangular in 2D) meshes is generated adaptively by local refinement. This process is driven by controlling the local error of the piecewise linear finite element approximation of the function on each mesh element. A reliable and efficient computation of the global approximation error and a multilevel preconditioned conjugate gradient solver are the key components of the implementation. In order to analyze the properties and advantages of the adaptively generated tetrahedral meshes, we implemented two volume visualization algorithms: an iso-surface extractor and a ray-caster. Both algorithms, while conceptually simple, show significant speedups over conventional methods delivering comparable rendering quality from adaptively compressed datasets.",Roberto Grosso;Christoph Lürig;Thomas Ertl,R. Grosso;C. Lurig;T. Ertl,"Comput. Graphics Group, Erlangen-Nurnberg Univ., Germany",10.1109/VISUAL.1996.568127;10.1109/VISUAL.1996.568124;10.1109/VISUAL.1995.480805;10.1109/VISUAL.1996.568121;10.1109/VISUAL.1993.398852;10.1109/VISUAL.1995.480806;10.1109/VISUAL.1996.567606,,85,41,32,
InfoVis,2003,Between aesthetics and utility: designing ambient information visualizations,10.1109/INFVIS.2003.1249031,http://dx.doi.org/10.1109/INFVIS.2003.1249031,233,240,C,"Unlike traditional information visualization, ambient information visualizations reside in the environment of the user rather than on the screen of a desktop computer. Currently, most dynamic information that is displayed in public places consists of text and numbers. We argue that information visualization can be employed to make such dynamic data more useful and appealing. However, visualizations intended for non-desktop spaces will have to both provide valuable information and present an attractive addition to the environment - they must strike a balance between aesthetical appeal and usefulness. To explore this, we designed a real-time visualization of bus departure times and deployed it in a public space, with about 300 potential users. To make the presentation more visually appealing, we took inspiration from a modern abstract artist. The visualization was designed in two passes. First, we did a preliminary version that was presented to and discussed with prospective users. Based on their input, we did a final design. We discuss the lessons learned in designing this and previous ambient information visualizations, including how visual art can be used as a design constraint, and how the choice of information and the placement of the display affect the visualization.",Tobias Skog;Sara Ljungblad;Lars Erik Holmquist,T. Skog;S. Ljungblad;L.E. Holmquist,"Future Applications Lab, Viktoria Inst., Goteborg, Sweden;Future Applications Lab, Viktoria Inst., Goteborg, Sweden;Future Applications Lab, Viktoria Inst., Goteborg, Sweden",,"Ambient information visualization, informative art, ambient displays, calm technology",85,36,20,
VAST,2007,"WireVis: Visualization of Categorical, Time-Varying Data From Financial Transactions",10.1109/VAST.2007.4389009,http://dx.doi.org/10.1109/VAST.2007.4389009,155,162,C,"Large financial institutions such as Bank of America handle hundreds of thousands of wire transactions per day. Although most transactions are legitimate, these institutions have legal and financial obligations in discovering those that are suspicious. With the methods of fraudulent activities ever changing, searching on predefined patterns is often insufficient in detecting previously undiscovered methods. In this paper, we present a set of coordinated visualizations based on identifying specific keywords within the wire transactions. The different views used in our system depict relationships among keywords and accounts over time. Furthermore, we introduce a search-by-example technique which extracts accounts that show similar transaction patterns. In collaboration with the Anti-Money Laundering division at Bank of America, we demonstrate that using our tool, investigators are able to detect accounts and transactions that exhibit suspicious behaviors.",Remco Chang;Mohammad Ghoniem;Robert Kosara;William Ribarsky;Jing Yang 0001;Evan A. Suma;Caroline Ziemkiewicz;Daniel A. Kern;Agus Sudjianto,Remco Chang;Mohammad Ghoniem;Robert Kosara;William Ribarsky;Jing Yang;Evan Suma;Caroline Ziemkiewicz;Daniel Kern;Agus Sudjianto,UNC Charlotte. e-mail: rchang@uncc.edu;UNC Charlotte. e-mail: mghoniem@uncc.edu;UNC Charlotte. e-mail: rkosara@uncc.edu;UNC Charlotte. e-mail: ribarsky@uncc.edu;UNC Charlotte. e-mail: jyang13@uncc.edu;UNC Charlotte. e-mail: easuma@uncc.edu;UNC Charlotte. e-mail: caziemki@uncc.edu;Bank of America. e-mail: daniel.c.kern@bankofamerica.com;Bank of America. e-mail: agus.sudjianto@bankofamerica.com,10.1109/INFVIS.1999.801851;10.1109/INFVIS.1995.528686;10.1109/TVCG.2006.160;10.1109/INFVIS.2004.46,"Fraud detection, financial data visualization, categorial and time-varying data",85,64,21,
Vis,2010,An Information-Theoretic Framework for Flow Visualization,10.1109/TVCG.2010.131,http://dx.doi.org/10.1109/TVCG.2010.131,1216,1224,J,"The process of visualization can be seen as a visual communication channel where the input to the channel is the raw data, and the output is the result of a visualization algorithm. From this point of view, we can evaluate the effectiveness of visualization by measuring how much information in the original data is being communicated through the visual communication channel. In this paper, we present an information-theoretic framework for flow visualization with a special focus on streamline generation. In our framework, a vector field is modeled as a distribution of directions from which Shannon's entropy is used to measure the information content in the field. The effectiveness of the streamlines displayed in visualization can be measured by first constructing a new distribution of vectors derived from the existing streamlines, and then comparing this distribution with that of the original data set using the conditional entropy. The conditional entropy between these two distributions indicates how much information in the original data remains hidden after the selected streamlines are displayed. The quality of the visualization can be improved by progressively introducing new streamlines until the conditional entropy converges to a small value. We describe the key components of our framework with detailed analysis, and show that the framework can effectively visualize 2D and 3D flow data.",Lijie Xu;Teng-Yok Lee;Han-Wei Shen,Lijie Xu;Teng-Yok Lee;Han-Wei Shen,The Ohio State University;The Ohio State University;The Ohio State University,10.1109/TVCG.2008.119;10.1109/TVCG.2007.70595;10.1109/TVCG.2007.70615;10.1109/TVCG.2006.152;10.1109/TVCG.2006.116;10.1109/VISUAL.2005.1532832;10.1109/VISUAL.2005.1532831;10.1109/TVCG.2008.140;10.1109/VISUAL.2000.885690;10.1109/VISUAL.2005.1532833;10.1109/TVCG.2007.70579;10.1109/VISUAL.2002.1183785,"Flow field visualization, information theory, streamline generation",85,73,31,
Vis,2011,Tuner: Principled Parameter finding for Image Segmentation Algorithms Using Visual Response Surface Exploration,10.1109/TVCG.2011.248,http://dx.doi.org/10.1109/TVCG.2011.248,1892,1901,J,"In this paper we address the difficult problem of parameter-finding in image segmentation. We replace a tedious manual process that is often based on guess-work and luck by a principled approach that systematically explores the parameter space. Our core idea is the following two-stage technique: We start with a sparse sampling of the parameter space and apply a statistical model to estimate the response of the segmentation algorithm. The statistical model incorporates a model of uncertainty of the estimation which we use in conjunction with the actual estimate in (visually) guiding the user towards areas that need refinement by placing additional sample points. In the second stage the user navigates through the parameter space in order to determine areas where the response value (goodness of segmentation) is high. In our exploration we rely on existing ground-truth images in order to evaluate the ""goodness"" of an image segmentation technique. We evaluate its usefulness by demonstrating this technique on two image segmentation algorithms: a three parameter model to detect microtubules in electron tomograms and an eight parameter model to identify functional regions in dynamic Positron Emission Tomography scans.",Thomas Torsney-Weir;Ahmed Saad;Torsten Möller;Hans-Christian Hege;Britta Weber;Jean-Marc Verbavatz,Thomas Torsney-Weir;Ahmed Saad;Torsten Moller;Hans-Christian Hege;Britta Weber;Jean-Marc Verbavatz;Steven Bergner,"Simon Fraser University;Simon Fraser University;Simon Fraser University;Zuse Institute Berlin;Zuse Institute Berlin;Max Planck Institute of Molecular Cell Biology and Genetics (MPI-CBG);GrUVi (Graphics, Usability, and Visualization Lab) at Simon Fraser University, Burnaby, Canada",10.1109/TVCG.2007.70584;10.1109/TVCG.2008.119;10.1109/TVCG.2010.223;10.1109/TVCG.2010.190;10.1109/VISUAL.1994.346302;10.1109/TVCG.2010.130;10.1109/VISUAL.1993.398859;10.1109/VISUAL.1999.809871;10.1109/TVCG.2011.253;10.1109/VISUAL.2000.885678,"Parameter exploration, Image segmentation, Gaussian Process Model",85,72,48,
Vis,1993,GRASPARC-A problem solving environment integrating computation and visualization,10.1109/VISUAL.1993.398857,http://dx.doi.org/10.1109/VISUAL.1993.398857,102,109,C,Visualization has proved an efficient tool in the understanding of large data sets in computational science and engineering. There is growing interest today in the development of problem solving environments which integrate both visualization and the computational process which generates the data. The GRASPARC project has looked at some of the issues involved in creating such an environment. An architecture is proposed in which tools for computation and visualization can be embedded in a framework which assists in the management of the problem solving process. This framework has an integral data management facility which allows an audit trail of the experiments to be recorded. This design therefore allows not only steering but also backtracking and more complicated problem solving strategies. A number of demonstrator case studies have been implemented.&lt;&lt;ETX&gt;&gt;,Ken Brodlie;Andrew Poon;Helen Wright;Lesley Brankin;Greg Banecki;Alan Gay,K. Brodlie;A. Poon;H. Wright;L. Brankin;G. Banecki;A. Gay,"Sch. of Comput. Studies, Leeds Univ., UK;Sch. of Comput. Studies, Leeds Univ., UK;Sch. of Comput. Studies, Leeds Univ., UK;Sch. of Comput. Studies, Leeds Univ., UK;Sch. of Comput. Studies, Leeds Univ., UK;Sch. of Comput. Studies, Leeds Univ., UK",10.1109/VISUAL.1992.235219;10.1109/VISUAL.1991.175818,,84,36,15,
Vis,1999,Automating transfer function design for comprehensible volume rendering based on 3D field topology analysis,10.1109/VISUAL.1999.809932,http://dx.doi.org/10.1109/VISUAL.1999.809932,467,563,C,"This paper describes initial results of a 3D field topology analysis for automating transfer function design aiming at comprehensible volume rendering. The conventional Reeb graph-based approach to describing topological features of 3D surfaces is extended to capture the topological skeleton of a volumetric field. Based on the analysis result, which is represented in the form of a hyper Reeb graph, a procedure is proposed for designing appropriate color/opacity transfer functions. Two analytic volume datasets are used to preliminarily prove the feasibility of the present design methodology.",Issei Fujishiro;Taeko Azuma;Yuriko Takeshima,I. Fujishiro;T. Azuma;Y. Takeshima,"Dept. of Inf. Sci., Ochanomizu Univ., Tokyo, Japan",10.1109/VISUAL.1996.568113,,84,52,14,
InfoVis,2004,Matrix Zoom: A Visual Interface to Semi-External Graphs,10.1109/INFVIS.2004.46,http://dx.doi.org/10.1109/INFVIS.2004.46,183,190,C,"In Web data, telecommunications traffic and in epidemiological studies, dense subgraphs correspond to subsets of subjects (i.e. users, patients) that share a collection of attributes values (i.e. accessed Web pages, email-calling patterns or disease diagnostic profiles). Visual and computational identification of these ""clusters"" becomes useful when domain experts desire to determine those factors of major influence in the formation of access and communication clusters or in the detection and contention of disease spread. With the current increases in graphic hardware capabilities and RAM sizes, it is more useful to relate graph sizes to the available screen real estate S and the amount of available RAM M, instead of the number of edges or nodes in the graph. We offer a visual interface that is parameterized by M and S and is particularly suited for navigation tasks that require the identification of subgraphs whose edge density is above certain threshold. This is achieved by providing a zoomable matrix view of the underlying data. This view is strongly coupled to a hierarchical view of the essential information elements present in the data domain. We illustrate the applicability of this work to the visual navigation of cancer incidence data and to an aggregated sample of phone call traffic",James Abello;Frank van Ham,J. Abello;F. van Ham,Rutgers University,10.1109/INFVIS.2003.1249030,"Graph Visualization, Hierarchy Trees, Clustering, External Memory Algorithms, Cancer Data, Phone Traffic",84,40,14,
InfoVis,2014,Visual Parameter Space Analysis: A Conceptual Framework,10.1109/TVCG.2014.2346321,http://dx.doi.org/10.1109/TVCG.2014.2346321,2161,2170,J,"Various case studies in different application domains have shown the great potential of visual parameter space analysis to support validating and using simulation models. In order to guide and systematize research endeavors in this area, we provide a conceptual framework for visual parameter space analysis problems. The framework is based on our own experience and a structured analysis of the visualization literature. It contains three major components: (1) a data flow model that helps to abstractly describe visual parameter space analysis problems independent of their application domain; (2) a set of four navigation strategies of how parameter space analysis can be supported by visualization tools; and (3) a characterization of six analysis tasks. Based on our framework, we analyze and classify the current body of literature, and identify three open research gaps in visual parameter space analysis. The framework and its discussion are meant to support visualization designers and researchers in characterizing parameter space analysis problems and to guide their design and evaluation processes.",Michael Sedlmair;Christoph Heinzl;Stefan Bruckner;Harald Piringer;Torsten Möller,Michael Sedlmair;Christoph Heinzl;Stefan Bruckner;Harald Piringer;Torsten Möller,University of Vienna;University of Applied Sciences Upper Austria;University of Bergen;VRVis;University of Vienna,10.1109/INFVIS.1995.528680;10.1109/TVCG.2010.177;10.1109/TVCG.2008.145;10.1109/TVCG.2012.219;10.1109/TVCG.2009.155;10.1109/TVCG.2010.223;10.1109/TVCG.2012.224;10.1109/TVCG.2012.213;10.1109/TVCG.2010.190;10.1109/INFVIS.2005.1532136;10.1109/VISUAL.1993.398859;10.1109/VAST.2009.5333431;10.1109/TVCG.2007.70581;10.1109/TVCG.2013.142;10.1109/VAST.2010.5652392;10.1109/INFVIS.2005.1532142;10.1109/TVCG.2013.130;10.1109/TVCG.2013.147;10.1109/TVCG.2013.124;10.1109/TVCG.2012.190;10.1109/TVCG.2009.111;10.1109/TVCG.2011.229;10.1109/TVCG.2013.157;10.1109/TVCG.2013.125;10.1109/VAST.2011.6102450;10.1109/VISUAL.2005.1532788;10.1109/TVCG.2013.126;10.1109/TVCG.2011.248;10.1109/TVCG.2010.214;10.1109/TVCG.2009.170;10.1109/VAST.2011.6102457;10.1109/TVCG.2013.120;10.1109/TVCG.2011.253,"Parameter space analysis, input-output model, simulation, task characterization, literature analysis",84,84,77,
Vis,1995,Enhanced spot noise for vector field visualization,10.1109/VISUAL.1995.480817,http://dx.doi.org/10.1109/VISUAL.1995.480817,233,"239, 457",C,"Spot noise is a technique for texture synthesis, which is very useful for vector field visualization. This paper describes improvements and extensions of the basic principle of spot noise. First, better visualization of highly curved vector fields with spot noise is achieved, by adapting the shape of the spots to the local velocity field. Second, filtering of spots is proposed to eliminate undesired low frequency components from the spot noise texture. Third, methods are described to utilize graphics hardware to generate the texture, and to produce variable viewpoint animations of spot noise on surfaces. Fourth, the synthesis of spot noise on grids with highly irregular cell sizes is described.",Wim C. de Leeuw;Jarke J. van Wijk,W.C. de Leeuw;J.J. van Wijk,"Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands",10.1109/VISUAL.1994.346312;10.1109/VISUAL.1994.346313;10.1109/VISUAL.1993.398877,,83,36,7,
Vis,1999,Hue-balls and lit-tensors for direct volume rendering of diffusion tensor fields,10.1109/VISUAL.1999.809886,http://dx.doi.org/10.1109/VISUAL.1999.809886,183,524,C,"With the development of magnetic resonance imaging techniques for acquiring diffusion tensor data from biological tissue, visualization of tensor data has become a new research focus. The diffusion tensor describes the directional dependence of water molecules' diffusion and can be represented by a three-by-three symmetric matrix. Visualization of second-order tensor fields is difficult because the data values have many degrees of freedom. Existing visualization techniques are best at portraying the tensor's properties over a two-dimensional field, or over a small subset of locations within a three-dimensional field. A means of visualizing the global structure in measured diffusion tensor data is needed. We propose the use of direct volume rendering, with novel approaches for the tensors' coloring, lighting, and opacity assignment. Hue-balls use a two-dimensional colormap on the unit sphere to illustrate the tensor's action as a linear operator. Lit-tensors provide a lighting model for tensors which includes as special cases both lit-lines (from streamline vector visualization) and standard Phong surface lighting. Together with an opacity assignment based on a novel two-dimensional barycentric space of anisotropy, these methods are shown to produce informative renderings of measured diffusion tensor data from the human brain.",Gordon L. Kindlmann;David M. Weinstein,G. Kindlmann;D. Weinstein,"Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.1990.146373;10.1109/VISUAL.1992.235193;10.1109/VISUAL.1996.567777;10.1109/VISUAL.1998.745294,,83,45,22,BP
Vis,1999,Enabling Classification and Shading for 3D Texture Mapping based Volume Rendering using OpenGL and Extensions,10.1109/VISUAL.1999.809889,http://dx.doi.org/10.1109/VISUAL.1999.809889,207,526,C,"We present a new technique which enables direct volume rendering based on 3D texture mapping hardware, enabling shading as well as classification of the interpolated data. Our technique supports accurate lighting for a one directional light source, semi-transparent classification, and correct blending. To circumvent the limitations of one general classification, we introduce multiple classification spaces which are very valuable to understand the visualized data, and even mandatory to comprehensively grasp the 3D relationship of different materials present in the volumetric data. Furthermore, we illustrate how multiple classification spaces can be realized using existing graphics hardware. In contrast to previously reported algorithms, our technique is capable of performing all the above mentioned tasks within the graphics pipeline. Therefore, it is very efficient: The three dimensional texture needs to be stored only once and no load is put onto the CPU. Besides using standard OpenGL functionality, we exploit advanced per pixel operations and make use of available OpenGL extensions.",Michael Meißner;Ulrich Hoffmann;Wolfgang Straßer,M. Meissner;U. Hoffmann;W. Strasser,"Comput. Graphics Lab., Tubingen Univ., Germany",,"Volume Rendering, 3D Texture Mapping, Rectilinear Grid, Shading, Classification, OpenGL",83,11,23,
Vis,1999,Collapsing Flow Topology Using Area Metrics,10.1109/VISUAL.1999.809907,http://doi.ieeecomputersociety.org/10.1109/VISUAL.1999.809907,349,354,C,"Visualization of topological information of a vector field can provide useful information on the structure of the field. However, in turbulent flows standard critical point visualization will result in a cluttered image which is difficult to interpret. This paper presents a technique for collapsing topologies. The governing idea is to classify the importance of the critical points in the topology. By only displaying the more important critical points, a simplified depiction of the topology can be provided. Flow consistency is maintained when collapsing the topology, resulting in a visualization which is consistent with the original topology. We apply the collapsing topology technique to a turbulent flow field.",Wim C. de Leeuw;Robert van Liere,W. De Leeuw;R. Van Liere,"Center for Math. & Comput. Sci., CWI, Amsterdam, Netherlands",10.1109/VISUAL.1991.175773,"multi-level visualization techniques, flow visualization, flow topology",83,27,0,
Vis,2000,Simplification of tetrahedral meshes with accurate error evaluation,10.1109/VISUAL.2000.885680,http://dx.doi.org/10.1109/VISUAL.2000.885680,85,92,C,"The techniques for reducing the size of a volume dataset by preserving both the geometrical/topological shape and the information encoded in an attached scalar field are attracting growing interest. Given the framework of incremental 3D mesh simplification based on edge collapse, we propose an approach for the integrated evaluation of the error introduced by both the modification of the domain and the approximation of the field of the original volume dataset. We present and compare various techniques to evaluate the approximation error or to produce a sound prediction. A flexible simplification tool has been implemented, which provides a different degree of accuracy and computational efficiency for the selection of the edge to be collapsed. Techniques for preventing a geometric or topological degeneration of the mesh are also presented.",Paolo Cignoni;D. Constanza;Claudio Montani;Claudio Rocchini;Roberto Scopigno,P. Cignoni;D. Costanza;C. Montani;C. Rocchini;R. Scopigno,"Ist. Sci. e Tecnol. dell'Inf., CNR, Pisa, Italy",10.1109/VISUAL.1998.745315;10.1109/VISUAL.1997.663907;10.1109/VISUAL.1998.745329;10.1109/VISUAL.1998.745312,"Simplicial Complexes, Mesh Simplification,Volume Visualization, Unstructured Grids",83,31,24,
Vis,2000,Texturing techniques for terrain visualization,10.1109/VISUAL.2000.885699,http://dx.doi.org/10.1109/VISUAL.2000.885699,227,234,C,"Presents a new rendering technique for processing multiple multi-resolution textures of LOD (level-of-detail) terrain models and describes its application to interactive, animated terrain content design. The approach is based on a multi-resolution model for terrain texture which cooperates with a multi-resolution model for terrain geometry. For each texture layer, an image pyramid and a texture tree are constructed. Multiple texture layers can be associated with one terrain model and can be combined in different ways, e.g. by blending and masking. The rendering algorithm simultaneously traverses the multi-resolution geometry model and the multi-resolution texture model, and takes into account geometric and texture approximation errors. It uses multi-pass rendering and exploits multi-texturing to achieve real-time performance. Applications include interactive texture lenses, texture animation and topographic textures. These techniques offer an enormous potential for developing new visualization applications for presenting, exploring and manipulating spatio-temporal data.",Jürgen Döllner;Konstantin Baumann;Klaus H. Hinrichs,J. Dollner;K. Baumann;K. Hinrichs,"Dept. of Comput. Sci., Munster Univ., Germany",10.1109/VISUAL.1998.745322;10.1109/VISUAL.1998.745285;10.1109/VISUAL.1999.809869;10.1109/VISUAL.1998.745283;10.1109/VISUAL.1998.745342;10.1109/VISUAL.1995.480805;10.1109/VISUAL.1999.809900;10.1109/VISUAL.1998.745280,"Terrain Rendering, Texture Mapping, Multiresolution, Level of Detail, 3D Maps",83,32,30,
InfoVis,2002,Visual unrolling of network evolution and the analysis of dynamic discourse,10.1109/INFVIS.2002.1173160,http://dx.doi.org/10.1109/INFVIS.2002.1173160,145,151,C,"A new method for visualizing the class of incrementally evolving networks is presented. In addition to the intermediate states of the network it conveys the nature of the change between them by unrolling the dynamics of the network. Each modification is shown in a separate layer of a three-dimensional representation, where the stack of layers corresponds to a time line of the evolution. We focus on discourse networks as the driving application, but our method extends to any type of network evolving in similar ways.",Ulrik Brandes;Steven R. Corman,U. Brandes;S.R. Corman,"Dept. of Comput. & Inf. Sci., Konstanz Univ., Germany",10.1109/INFVIS.2001.963279,,83,20,18,
InfoVis,2003,MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes,10.1109/INFVIS.2003.1249009,http://dx.doi.org/10.1109/INFVIS.2003.1249009,59,66,C,"Graph and tree visualization techniques enable interactive exploration of complex relations while communicating topology. However, most existing techniques have not been designed for situations where visual information such as images is also present at each node and must be displayed. This paper presents MoireGraphs to address this need. MoireGraphs combine a new focus+context radial graph layout with a suite of interaction techniques (focus strength changing, radial rotation, level highlighting, secondary foci, animated transitions and node information) to assist in the exploration of graphs with visual nodes. The method is scalable to hundreds of displayed visual nodes.",T. J. Jankun-Kelly;Kwan-Liu Ma,T.J. Jankun-Kelly;Kwan-Liu Ma,"Mississippi State Univ., Starkville, MS, USA",10.1109/INFVIS.2000.885091;10.1109/INFVIS.1997.636718;10.1109/INFVIS.1996.559214;10.1109/INFVIS.2001.963279;10.1109/INFVIS.2002.1173151,"information visualization, focus+context, radial graph layout, graph drawing",83,28,34,
Vis,2004,Interactive design of multi-perspective images for visualizing urban landscapes,10.1109/VISUAL.2004.50,http://dx.doi.org/10.1109/VISUAL.2004.50,537,544,C,"Multiperspective images are a useful way to visualize extended, roughly planar scenes such as landscapes or city blocks. However, constructing effective multiperspective images is something of an art. We describe an interactive system for creating multiperspective images composed of serially blended cross-slits images. Beginning with a sideways-looking video of the scene as might be captured from a moving vehicle, we allow the user to interactively specify a set of cross-slits cameras, possibly with gaps between them. In each camera, one of the slits is defined to be the camera path, which is typically horizontal, and the user is left to choose the second slit, which is typically vertical. The system then generates intermediate views between these cameras using a novel interpolation scheme, thereby producing a multiperspective image with no seams. The user can also choose the picture surface in space onto which viewing rays are projected, thereby establishing a parameterization for the image. We show how the choice of this surface can be used to create interesting visual effects. We demonstrate our system by constructing multiperspective images that summarize city blocks, including corners, blocks with deep plazas and other challenging urban situations.",Augusto Román;Gaurav Garg;Marc Levoy,A. Roman;G. Garg;M. Levoy,"Comput. Graphics Lab., Stanford Univ., CA, USA;Comput. Graphics Lab., Stanford Univ., CA, USA;Comput. Graphics Lab., Stanford Univ., CA, USA",,"cross-slits image, multi-perspective image, city block",83,30,17,
Vis,2005,Farthest point seeding for efficient placement of streamlines,10.1109/VISUAL.2005.1532832,http://dx.doi.org/10.1109/VISUAL.2005.1532832,479,486,C,"We propose a novel algorithm for placement of streamlines from two-dimensional steady vector or direction fields. Our method consists of placing one streamline at a time by numerical integration starting at the furthest away from all previously placed streamlines. Such a farthest point seeding strategy leads to high quality placements by favoring long streamlines, while retaining uniformity with the increasing density. Our greedy approach generates placements of comparable quality with respect to the optimization approach from Turk and Banks, while being 200 times faster. Simplicity, robustness as well as efficiency is achieved through the use of a Delaunay triangulation to model the streamlines, address proximity queries and determine the biggest voids by exploiting the empty circle property. Our method handles variable density and extends to multiresolution.",Abdelkrim Mebarki;Pierre Alliez;Olivier Devillers,A. Mebarki;P. Alliez;O. Devillers,"INRIA Sophia-Antipolis, France;INRIA Sophia-Antipolis, France;INRIA Sophia-Antipolis, France",10.1109/VISUAL.2000.885690,"Streamline placement, farthest point seeding, Delaunay triangulation, variable density, multiresolution",83,24,22,
InfoVis,2008,Cerebral: Visualizing Multiple Experimental Conditions on a Graph with Biological Context,10.1109/TVCG.2008.117,http://dx.doi.org/10.1109/TVCG.2008.117,1253,1260,J,"Systems biologists use interaction graphs to model the behavior of biological systems at the molecular level. In an iterative process, such biologists observe the reactions of living cells under various experimental conditions, view the results in the context of the interaction graph, and then propose changes to the graph model. These graphs serve as a form of dynamic knowledge representation of the biological system being studied and evolve as new insight is gained from the experimental data. While numerous graph layout and drawing packages are available, these tools did not fully meet the needs of our immunologist collaborators. In this paper, we describe the data information display needs of these immunologists and translate them into design decisions. These decisions led us to create Cerebral, a system that uses a biologically guided graph layout and incorporates experimental data directly into the graph display. Small multiple views of different experimental conditions and a data-driven parallel coordinates view enable correlations between experimental conditions to be analyzed at the same time that the data is viewed in the graph context. This combination of coordinated views allows the biologist to view the data from many different perspectives simultaneously. To illustrate the typical analysis tasks performed, we analyze two datasets using Cerebral. Based on feedback from our collaborators we conclude that Cerebral is a valuable tool for analyzing experimental data in the context of an interaction graph model.",Aaron Barsky;Tamara Munzner;Jennifer L. Gardy;Robert Kincaid,Aaron Barsky;Tamara Munzner;Jennifer Gardy;Robert Kincaid,"University of British Columbia;University of British Columbia;University of British Columbia;Agilent Labs, Agilent Technologies",10.1109/INFVIS.2005.1532151;10.1109/TVCG.2006.156;10.1109/TVCG.2006.166,"Graph layout, systems biology visualization, small multiples, design study",83,66,42,
Vis,2010,World Lines,10.1109/TVCG.2010.223,http://dx.doi.org/10.1109/TVCG.2010.223,1458,1467,J,"In this paper we present World Lines as a novel interactive visualization that provides complete control over multiple heterogeneous simulation runs. In many application areas, decisions can only be made by exploring alternative scenarios. The goal of the suggested approach is to support users in this decision making process. In this setting, the data domain is extended to a set of alternative worlds where only one outcome will actually happen. World Lines integrate simulation, visualization and computational steering into a single unified system that is capable of dealing with the extended solution space. World Lines represent simulation runs as causally connected tracks that share a common time axis. This setup enables users to interfere and add new information quickly. A World Line is introduced as a visual combination of user events and their effects in order to present a possible future. To quickly find the most attractive outcome, we suggest World Lines as the governing component in a system of multiple linked views and a simulation component. World Lines employ linking and brushing to enable comparative visual analysis of multiple simulations in linked views. Analysis results can be mapped to various visual variables that World Lines provide in order to highlight the most compelling solutions. To demonstrate this technique we present a flooding scenario and show the usefulness of the integrated approach to support informed decision making.",Jürgen Waser;Raphael Fuchs;Hrvoje Ribicic;Benjamin Schindler;Günter Blöschl;M. Eduard Gröller,Jurgen Waser;Raphael Fuchs;Hrvoje Ribicic;Benjamin Schindler;Gunther Bloschl;Eduard Groller,VRVis Vienna;ETH Z&#x0FC;rich;VRVis Vienna;ETH Z&#x0FC;rich;TU Vienna;TU Vienna,10.1109/INFVIS.2002.1173149;10.1109/INFVIS.2004.12;10.1109/VISUAL.1999.809871;10.1109/INFVIS.2005.1532143;10.1109/TVCG.2009.199;10.1109/VISUAL.1993.398857;10.1109/TVCG.2008.145;10.1109/TVCG.2007.70539;10.1109/VISUAL.1998.745289,"Problem solving environment, decision making, simulation steering, parallel worlds, CFD, smoothed particle hydrodynamics",83,66,45,HM
VAST,2013,ScatterBlogs2: Real-Time Monitoring of Microblog Messages through User-Guided filtering,10.1109/TVCG.2013.186,http://dx.doi.org/10.1109/TVCG.2013.186,2022,2031,J,"The number of microblog posts published daily has reached a level that hampers the effective retrieval of relevant messages, and the amount of information conveyed through services such as Twitter is still increasing. Analysts require new methods for monitoring their topic of interest, dealing with the data volume and its dynamic nature. It is of particular importance to provide situational awareness for decision making in time-critical tasks. Current tools for monitoring microblogs typically filter messages based on user-defined keyword queries and metadata restrictions. Used on their own, such methods can have drawbacks with respect to filter accuracy and adaptability to changes in trends and topic structure. We suggest ScatterBlogs2, a new approach to let analysts build task-tailored message filters in an interactive and visual manner based on recorded messages of well-understood previous events. These message filters include supervised classification and query creation backed by the statistical distribution of terms and their co-occurrences. The created filter methods can be orchestrated and adapted afterwards for interactive, visual real-time monitoring and analysis of microblog feeds. We demonstrate the feasibility of our approach for analyzing the Twitter stream in emergency management scenarios.",Harald Bosch;Dennis Thom;Florian Heimerl;Edwin Puttmann;Steffen Koch;Robert Krüger;Michael Wörner 0001;Thomas Ertl,Harald Bosch;Dennis Thom;Florian Heimerl;Edwin Püttmann;Steffen Koch;Robert Krüger;Michael Wörner;Thomas Ertl,"Visualization and Interactive Systems, University of Stuttgart;Visualization and Interactive Systems, University of Stuttgart;Visualization and Interactive Systems, University of Stuttgart;Visualization and Interactive Systems, University of Stuttgart;Visualization and Interactive Systems, University of Stuttgart;Visualization and Interactive Systems, University of Stuttgart;Visualization and Interactive Systems, University of Stuttgart;Visualization and Interactive Systems, University of Stuttgart",10.1109/VISUAL.2005.1532781;10.1109/VAST.2012.6400492;10.1109/VAST.2012.6400557;10.1109/TVCG.2012.291;10.1109/TVCG.2012.277;10.1109/VAST.2012.6400485;10.1109/VAST.2007.4389013;10.1109/VAST.2007.4389006;10.1109/VAST.2011.6102456;10.1109/TVCG.2008.175,"Microblog analysis, Twitter, text analytics, social media monitoring, live monitoring, visual analytics, information visualization, filter construction, query construction, text classification",83,70,35,
Vis,1991,The stream polygon: A technique for 3D vector field visualization,10.1109/VISUAL.1991.175789,http://dx.doi.org/10.1109/VISUAL.1991.175789,126,"132, 417",C,"A method is presented for the visualization of 3D vector fields. The stream polygon, which is a regular, n-sided polygon, oriented normal to the local vector, can present local deformations due to rigid body rotation and both normal and shear strain. The effect of translation and scalar functions can be represented by sweeping the stream polygon along the streamline, and by appropriately varying the radius and shading the surface of the resulting streamtube. A mathematical foundation for the stream is developed, and examples with application to velocity field visualization are provided.&lt;&lt;ETX&gt;&gt;",William J. Schroeder;Christopher R. Volpe;William E. Lorensen,W.J. Schroeder;C.R. Volpe;W.E. Lorensen,"General Electric Corp. Res. & Dev., Schenectady, NY, USA;General Electric Corp. Res. & Dev., Schenectady, NY, USA;General Electric Corp. Res. & Dev., Schenectady, NY, USA",,,82,43,10,
InfoVis,2001,Botanical visualization of huge hierarchies,10.1109/INFVIS.2001.963285,http://dx.doi.org/10.1109/INFVIS.2001.963285,87,94,C,,Ernst Kleiberg;Huub van de Wetering;Jarke J. van Wijk,E. Kleiberg;H. van de Wetering;J.J. van Wijk,Eindhoven University of Technology,10.1109/INFVIS.1995.528689;10.1109/INFVIS.1999.801860,"botanical tree, logical tree, huge hierarchy, strands, tree visualization, directory tree, phyllotaxis",82,36,14,
Vis,2001,Real-time decompression and visualization of animated volume data,10.1109/VISUAL.2001.964531,http://dx.doi.org/10.1109/VISUAL.2001.964531,349,356,C,"Interactive exploration of animated volume data is required by many application, but the huge amount of computational time and storage space needed for rendering does not yet allow the visualization of animated volumes. In this paper, we introduce an algorithm running at interactive frame rates using 3D wavelet transforms that allows for any wavelet, motion compensation techniques and various encoding schemes of the resulting wavelet coefficients to be used. We analyze different families and orders of wavelets for compression ratio and the introduced error. We use a quantization that has been optimized for the visual impression of the reconstructed volume, independent of the viewing algorithm. This enables us to achieve very high compression ratios while still being able to reconstruct the volume with as few visual artifacts as possible. A further improvement of the compression ratio has been achieved by applying a motion compensation scheme to exploit temporal coherency. Using these schemes, we are able to decompress each volume of our animation at interactive frame rates, while visualizing these decompressed volumes on a single PC. We also present a number of improved visualization algorithms for high-quality display using OpenGL hardware running at interactive frame rates on a standard PC.",Stefan Guthe;Wolfgang Straßer,S. Guthe;W. Strasser,"WSI/GRIS, Tubingen Univ., Germany;WSI/GRIS, Tubingen Univ., Germany",10.1109/VISUAL.1997.663878,"Time critical Visualization, Compression for Visualization, Volume Rendering",82,35,29,
Vis,2001,Nonlinear virtual colon unfolding,10.1109/VISUAL.2001.964540,http://dx.doi.org/10.1109/VISUAL.2001.964540,411,418,C,"The majority of virtual endoscopy techniques tries to simulate a real endoscopy. A real endoscopy does not always give the optimal information due to the physical limitations it is subject to. In this paper, we deal with the unfolding of the surface of the colon as a possible visualization technique for diagnosis and polyp detection. A new two-step technique is presented which deals with the problems of double appearance of polyps and nonuniform sampling that other colon unfolding techniques suffer from. In the first step, a distance map from a central path induces nonlinear rays for unambiguous parameterization of the surface. The second step compensates for locally varying distortions of the unfolded surface. A technique similar to magnification fields in information visualization is hereby applied. The technique produces a single view of a complete, virtually dissected colon.",Anna Vilanova;Rainer Wegenkittl;Andreas König 0002;M. Eduard Gröller,A.V. Vilanova Bartroli;R. Wegenkittl;A. Konig;E. Groller,"Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria",10.1109/INFVIS.1997.636786;10.1109/VISUAL.1999.809914,"Volume Rendering, Virtual Endoscopy",82,15,19,
InfoVis,2006,Visual Exploration of Complex Time-Varying Graphs,10.1109/TVCG.2006.193,http://dx.doi.org/10.1109/TVCG.2006.193,805,812,J,"Many graph drawing and visualization algorithms, such as force-directed layout and line-dot rendering, work very well on relatively small and sparse graphs. However, they often produce extremely tangled results and exhibit impractical running times for highly non-planar graphs with large edge density. And very few graph layout algorithms support dynamic time-varying graphs; applying them independently to each frame produces distracting temporally incoherent visualizations. We have developed a new visualization technique based on a novel approach to hierarchically structuring dense graphs via stratification. Using this structure, we formulate a hierarchical force-directed layout algorithm that is both efficient and produces quality graph layouts. The stratification of the graph also allows us to present views of the data that abstract away many small details of its structure. Rather than displaying all edges and nodes at once, resulting in a convoluted rendering, we present an interactive tool that filters edges and nodes using the graph hierarchy and allows users to drill down into the graph for details. Our layout algorithm also accommodates time-varying graphs in a natural way, producing a temporally coherent animation that can be used to analyze and extract trends from dynamic graph data. For example, we demonstrate the use of our method to explore financial correlation data for the U.S. stock market in the period from 1990 to 2005. The user can easily analyze the time-varying correlation graph of the market, uncovering information such as market sector trends, representative stocks for portfolio construction, and the interrelationship of stocks over time.",Gautam Kumar;Michael Garland,D. Auber;T. Munzner;D. Archambault;D. Auber;T. Munzner;D. Archambault,"British Columbia Univ., Vancouver, BC;British Columbia Univ., Vancouver, BC;British Columbia Univ., Vancouver, BC;British Columbia Univ., Vancouver, BC",10.1109/INFVIS.2004.43;10.1109/INFVIS.2004.66,"Graph and network visualization, financial data visualization, hierarchy visualization, time series data",82,60,25,
Vis,2007,Enhancing Depth-Perception with Flexible Volumetric Halos,10.1109/TVCG.2007.70555,http://dx.doi.org/10.1109/TVCG.2007.70555,1344,1351,J,"Volumetric data commonly has high depth complexity which makes it difficult to judge spatial relationships accurately. There are many different ways to enhance depth perception, such as shading, contours, and shadows. Artists and illustrators frequently employ halos for this purpose. In this technique, regions surrounding the edges of certain structures are darkened or brightened which makes it easier to judge occlusion. Based on this concept, we present a flexible method for enhancing and highlighting structures of interest using GPU-based direct volume rendering. Our approach uses an interactively defined halo transfer function to classify structures of interest based on data value, direction, and position. A feature-preserving spreading algorithm is applied to distribute seed values to neighboring locations, generating a controllably smooth field of halo intensities. These halo intensities are then mapped to colors and opacities using a halo profile function. Our method can be used to annotate features at interactive frame rates.",Stefan Bruckner;M. Eduard Gröller,Stefan Bruckner;Eduard Gröller,"Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria",10.1109/VISUAL.2003.1250414;10.1109/TVCG.2006.124;10.1109/VISUAL.2000.885694;10.1109/VISUAL.1997.663912;10.1109/VISUAL.2003.1250394;10.1109/TVCG.2006.172;10.1109/VISUAL.2004.64;10.1109/VISUAL.1991.175805;10.1109/TVCG.2006.139,"Volume rendering, illustrative visualization, halos",82,59,31,
InfoVis,2011,Flexible Linked Axes for Multivariate Data Visualization,10.1109/TVCG.2011.201,http://dx.doi.org/10.1109/TVCG.2011.201,2310,2316,J,"Multivariate data visualization is a classic topic, for which many solutions have been proposed, each with its own strengths and weaknesses. In standard solutions the structure of the visualization is fixed, we explore how to give the user more freedom to define visualizations. Our new approach is based on the usage of Flexible Linked Axes: The user is enabled to define a visualization by drawing and linking axes on a canvas. Each axis has an associated attribute and range, which can be adapted. Links between pairs of axes are used to show data in either scatter plot- or Parallel Coordinates Plot-style. Flexible Linked Axes enable users to define a wide variety of different visualizations. These include standard methods, such as scatter plot matrices, radar charts, and PCPs [11]; less well known approaches, such as Hyperboxes [1], TimeWheels [17], and many-to-many relational parallel coordinate displays [14]; and also custom visualizations, consisting of combinations of scatter plots and PCPs. Furthermore, our method allows users to define composite visualizations that automatically support brushing and linking. We have discussed our approach with ten prospective users, who found the concept easy to understand and highly promising.",Jarry H. T. Claessen;Jarke J. van Wijk,Jarry H.T. Claessen;Jarke J. van Wijk,Eindhoven University of Technology;Eindhoven University of Technology,10.1109/INFVIS.2005.1532142;10.1109/INFVIS.2005.1532136;10.1109/INFVIS.2002.1173157;10.1109/TVCG.2006.138;10.1109/TVCG.2010.205;10.1109/TVCG.2006.170;10.1109/TVCG.2007.70521;10.1109/VISUAL.1991.175790;10.1109/TVCG.2008.153,"Multivariate data, visualization, scatterplot, Parallel Coordinates Plot",82,68,21,
VAST,2011,BaobabView: Interactive construction and analysis of decision trees,10.1109/VAST.2011.6102453,http://dx.doi.org/10.1109/VAST.2011.6102453,151,160,C,"We present a system for the interactive construction and analysis of decision trees that enables domain experts to bring in domain specific knowledge. We identify different user tasks and corresponding requirements, and develop a system incorporating a tight integration of visualization, interaction and algorithmic support. Domain experts are supported in growing, pruning, optimizing and analysing decision trees. Furthermore, we present a scalable decision tree visualization optimized for exploration. We show the effectiveness of our approach by applying the methods to two use cases. The first case illustrates the advantages of interactive construction, the second case demonstrates the effectiveness of analysis of decision trees and exploration of the structure of the data.",Stef van den Elzen;Jarke J. van Wijk,Stef van den Elzen;Jarke J. van Wijk,"Eindhoven University of Technology, the Netherlands;Eindhoven University of Technology, the Netherlands",10.1109/TVCG.2008.166;10.1109/INFVIS.2001.963292;10.1109/INFVIS.2001.963290,,82,54,44,
VAST,2014,OpinionFlow: Visual Analysis of Opinion Diffusion on Social Media,10.1109/TVCG.2014.2346920,http://dx.doi.org/10.1109/TVCG.2014.2346920,1763,1772,J,"It is important for many different applications such as government and business intelligence to analyze and explore the diffusion of public opinions on social media. However, the rapid propagation and great diversity of public opinions on social media pose great challenges to effective analysis of opinion diffusion. In this paper, we introduce a visual analysis system called OpinionFlow to empower analysts to detect opinion propagation patterns and glean insights. Inspired by the information diffusion model and the theory of selective exposure, we develop an opinion diffusion model to approximate opinion propagation among Twitter users. Accordingly, we design an opinion flow visualization that combines a Sankey graph with a tailored density map in one view to visually convey diffusion of opinions among many users. A stacked tree is used to allow analysts to select topics of interest at different levels. The stacked tree is synchronized with the opinion flow visualization to help users examine and compare diffusion patterns across topics. Experiments and case studies on Twitter data demonstrate the effectiveness and usability of OpinionFlow.",Yingcai Wu;Shixia Liu;Kai Yan;Mengchen Liu;Fangzhao Wu,Yingcai Wu;Shixia Liu;Kai Yan;Mengchen Liu;Fangzhao Wu,Microsoft Research;Microsoft Research;Harbin Institute of Technology;Tsinghua University;Tsinghua University,10.1109/TVCG.2011.239;10.1109/TVCG.2013.162;10.1109/TVCG.2013.221;10.1109/TVCG.2014.2346433;10.1109/INFVIS.2005.1532152;10.1109/TVCG.2012.291;10.1109/VAST.2006.261431;10.1109/TVCG.2010.129;10.1109/TVCG.2013.196;10.1109/TVCG.2014.2346919;10.1109/TVCG.2010.183;10.1109/VAST.2009.5333919,"Opinion visualization, opinion diffusion, opinion flow, influence estimation, kernel density estimation, level-of-detail",82,86,48,
Vis,1990,Rendering and managing spherical data with sphere quadtrees,10.1109/VISUAL.1990.146380,http://dx.doi.org/10.1109/VISUAL.1990.146380,176,186,C,"The sphere quadtree (SQT), which is based on the recursive subdivision of spherical triangles obtained by projecting the faces of an icosahedron onto a sphere, is discussed. Most databases for spherically distributed data are not structured in a manner consistent with their geometry. As a result, such databases possess undesirable artifacts, including the introduction of tears in the data when they are mapped onto a flat file system. Furthermore, it is difficult to make queries about the topological relationship among the data components without performing real arithmetic. The SQT eliminates some of these problems. The SQT allows the representation of data at multiple levels and arbitrary resolution. Efficient search strategies can be implemented for the selection of data to be rendered or analyzed by a specific technique. Geometric and topological consistency with the data are maintained.&lt;&lt;ETX&gt;&gt;",Gyorgy Fekete,F. Gyorgy,"NASA, Goddard Space Flight Center, Greenbelt, MD, USA",,,81,4,13,
Vis,1994,UFAT-a particle tracer for time-dependent flow fields,10.1109/VISUAL.1994.346311,http://dx.doi.org/10.1109/VISUAL.1994.346311,257,"264, C29",C,"Time-dependent (unsteady) flow fields are commonly generated in computational fluid dynamics (CFD) simulations; however, there are very few flow visualization systems that generate particle traces in unsteady flow fields. Most existing systems generate particle traces in time-independent flow fields. A particle tracing system has been developed to generate particle traces in unsteady flow fields. The system was used to visualize several 3D unsteady flow fields from real-world problems, and it has provided useful insights into the time-varying phenomena in the flow fields. The design requirements and the architecture of the system are described. Some examples of particle traces computed by the system are also shown.&lt;&lt;ETX&gt;&gt;",David A. Lane,D.A. Lane,"NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1990.146360;10.1109/VISUAL.1993.398848;10.1109/VISUAL.1993.398850;10.1109/VISUAL.1993.398849;10.1109/VISUAL.1993.398846,,81,37,15,
Vis,2001,POP: A Hybrid Point and Polygon Rendering System for Large Data,10.1109/VISUAL.2001.964492,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2001.964492,45,52,C,"We introduce a simple but effective extension to the existing pure point rendering systems. Rather than using only points, we use both points and polygons to represent and render large mesh models. We start from triangles as leaf nodes and build up a hierarchical tree structure with intermediate nodes as points. During the rendering, the system determines whether to use a point (of a certain intermediate level node) or a triangle (of a leaf node) for display depending on the screen contribution of each node. While points are used to speedup the rendering of distant objects, triangles are used to ensure the quality of close objects. Our method can accelerate the rendering of large models, compromising little in image quality.",Baoquan Chen;Minh Xuan Nguye,Baoquan Chen;Minh Xuan Nguyen,"Dept. of Comput. Sci. & Eng., Minnesota Univ., Twin Cities, MN, USA;Dept. of Comput. Sci. & Eng., Minnesota Univ., Twin Cities, MN, USA",10.1109/VISUAL.1998.745282,"Rendering system, Spatial data structures, Level of detail algorithms, hybrid rendering systems",81,16,33,
InfoVis,2006,Worldmapper: The World as You've Never Seen it Before,10.1109/TVCG.2006.202,http://dx.doi.org/10.1109/TVCG.2006.202,757,764,J,"This paper describes the Worldmapper project, which makes use of novel visualization techniques to represent a broad variety of social and economic data about the countries of the world. The goal of the project is to use the map projections known as cartograms to depict comparisons and relations between different territories, and its execution raises many interesting design challenges that were not all apparent at the outset. We discuss the approaches taken towards these challenges, some of which may have considerably broad application. We conclude by commenting on the positive initial response to the Worldmapper images published on the Web, which we believe is due, at least in part, to the particular effectiveness of the cartogram as a tool for communicating quantitative geographic data",Danny Dorling;Anna Barford;Mark Newman,Danny Dorling;Anna Barford;Mark Newman,,,"Geographic Visualization, Computer Graphics, Worldmapper, Data Visualization, Social Visualization, Cartogram",81,56,6,
InfoVis,2013,A Design Space of Visualization Tasks,10.1109/TVCG.2013.120,http://dx.doi.org/10.1109/TVCG.2013.120,2366,2375,J,"Knowledge about visualization tasks plays an important role in choosing or building suitable visual representations to pursue them. Yet, tasks are a multi-faceted concept and it is thus not surprising that the many existing task taxonomies and models all describe different aspects of tasks, depending on what these task descriptions aim to capture. This results in a clear need to bring these different aspects together under the common hood of a general design space of visualization tasks, which we propose in this paper. Our design space consists of five design dimensions that characterize the main aspects of tasks and that have so far been distributed across different task descriptions. We exemplify its concrete use by applying our design space in the domain of climate impact research. To this end, we propose interfaces to our design space for different user roles (developers, authors, and end users) that allow users of different levels of expertise to work with it.",Hans-Jörg Schulz;Thomas Nocke;Magnus Heitzler;Heidrun Schumann,Hans-Jörg Schulz;Thomas Nocke;Magnus Heitzler;Heidrun Schumann,University of Rostock;Potsdam Institute for Climate Impact Research;Potsdam Institute for Climate Impact Research;University of Rostock,10.1109/INFVIS.1996.559213;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2007.70515;10.1109/VISUAL.1990.146372;10.1109/TVCG.2012.205;10.1109/VISUAL.1992.235203;10.1109/INFVIS.2004.59;10.1109/VAST.2008.4677365;10.1109/INFVIS.1996.559211;10.1109/INFVIS.2004.10;10.1109/INFVIS.1997.636792;10.1109/INFVIS.2000.885093;10.1109/INFVIS.2000.885092;10.1109/VISUAL.1990.146375,"Task taxonomy, design space, climate impact research, visualization recommendation",81,82,64,
Vis,1997,UFLIC: a line integral convolution algorithm for visualizing unsteady flows,10.1109/VISUAL.1997.663898,http://dx.doi.org/10.1109/VISUAL.1997.663898,317,322,C,"The paper presents an algorithm, UFLIC (Unsteady Flow LIC), to visualize vector data in unsteady flow fields. Using line integral convolution (LIC) as the underlying method, a new convolution algorithm is proposed that can effectively trace the flow's global features over time. The new algorithm consists of a time-accurate value depositing scheme and a successive feedforward method. The value depositing scheme accurately models the flow advection, and the successive feedforward method maintains the coherence between animation frames. The new algorithm can produce time-accurate, highly coherent flow animations to highlight global features in unsteady flow fields. CFD scientists, for the first time, are able to visualize unsteady surface flows using the algorithm.",Han-Wei Shen;David L. Kao,Han-Wei Shen;D.L. Kao,"NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1995.480817;10.1109/VISUAL.1993.398848;10.1109/VISUAL.1996.567784,"view synthesis, dynamic scene analysis, modeling from image sequences, computer vision and scene understanding, virtual worlds",80,22,10,
Vis,1998,Converting sets of polygons to manifold surfaces by cutting and stitching,10.1109/VISUAL.1998.745327,http://dx.doi.org/10.1109/VISUAL.1998.745327,383,390,C,"Many real world polygonal surfaces contain topological singularities that represent a challenge for processes such as simplification, compression, smoothing, etc. We present an algorithm for removing such singularities, thus converting non manifold sets of polygons to manifold polygonal surfaces (orientable if necessary). We identify singular vertices and edges, multiply singular vertices, and cut through singular edges. In an optional stitching phase, we join surface boundary edges that were cut, or whose endpoints are sufficiently close, while guaranteeing that the surface is a manifold. We study two different stitching strategies called ""edge pinching"" and ""edge snapping""; when snapping, special care is required to avoid re-creating singularities. The algorithm manipulates the polygon vertex indices (surface topology) and essentially ignores vertex coordinates (surface geometry). Except for the optional stitching, the algorithm has a linear complexity in the number of vertices edges and faces, and require no floating point operation.",André Guéziec;Gabriel Taubin;Francis Lazarus;William P. Horn,A. Gueziec;G. Taubin;F. Lazarus;W. Horn,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.1997.663904;10.1109/VISUAL.1995.480821,"Polygonal Surface, Manifold, Cutting, Stitching",80,15,28,
Vis,1999,Construction of vector field hierarchies,10.1109/VISUAL.1999.809863,http://dx.doi.org/10.1109/VISUAL.1999.809863,19,"25, 505",C,"Presents a method for the hierarchical representation of vector fields. Our approach is based on iterative refinement using clustering and principal component analysis. The input to our algorithm is a discrete set of points with associated vectors. The algorithm generates a top-down segmentation of the discrete field by splitting clusters of points. We measure the error of the various approximation levels by measuring the discrepancy between streamlines generated by the original discrete field and its approximations based on much smaller discrete data sets. Our method assumes no particular structure of the field, nor does it require any topological connectivity information. It is possible to generate multi-resolution representations of vector fields using this approach.",Bjørn Heckel;Gunther H. Weber;Bernd Hamann;Kenneth I. Joy,B. Heckel;G. Weber;B. Hamann;K.I. Joy,"Dept. of Comput. Sci., California Univ., Davis, CA, USA",10.1109/VISUAL.1997.663871;10.1109/VISUAL.1998.745318,"vector field visualization, Hardy's multiquadric method, binary-space partitioning, data simplification",80,50,15,
Vis,2001,Optimal regular volume sampling,10.1109/VISUAL.2001.964498,http://dx.doi.org/10.1109/VISUAL.2001.964498,91,98,C,"The classification of volumetric data sets as well as their rendering algorithms are typically based on the representation of the underlying grid. Grid structures based on a Cartesian lattice are the de-facto standard for regular representations of volumetric data. In this paper we introduce a more general concept of regular grids for the representation of volumetric data. We demonstrate that a specific type of regular lattice-the so-called body-centered cubic-is able to represent the same data set as a Cartesian grid to the same accuracy but with 29.3% fewer samples. This speeds up traditional volume rendering algorithms by the same ratio, which we demonstrate by adopting a splatting implementation for these new lattices. We investigate different filtering methods required for computing the normals on this lattice. The lattice representation results also in lossless compression ratios that are better than previously reported. Although other regular grid structures achieve the same sample efficiency, the body-centered cubic is particularly easy to use. The only assumption necessary is that the underlying volume is isotropic and band-limited-an assumption that is valid for most practical data sets.",Thomas Theußl;Torsten Möller;M. Eduard Gröller,T. Theussl;T. Moller;M.E. Groller,"Inst. of Comput. Graphics & Algorithms, Technische Univ. Wien, Vienna, Austria",10.1109/VISUAL.1994.346331,"volume data,Cartesiangrid,close packing,hexagonal sampling, body centered cubic",80,16,20,
InfoVis,2002,Beamtrees: compact visualization of large hierarchies,10.1109/INFVIS.2002.1173153,http://dx.doi.org/10.1109/INFVIS.2002.1173153,93,100,C,"Beamtrees are a new method for the visualization of large hierarchical data sets. Nodes are shown as stacked circular beams, such that both the hierarchical structure as well as the size of nodes are depicted. The dimensions of beams are calculated using a variation of the treemap algorithm. A small user study indicated that beamtrees are significantly more effective than nested treemaps and cushion treemaps for the extraction of global hierarchical information.",Frank van Ham;Jarke J. van Wijk,F. van Ham;J.J. van Wijk,"Dept. of Math. & Comput. Sci., Technische Universiteit Eindhoven, Netherlands;Dept. of Math. & Comput. Sci., Technische Universiteit Eindhoven, Netherlands",10.1109/INFVIS.2001.963283;10.1109/INFVIS.2001.963290;10.1109/INFVIS.1999.801860;10.1109/VISUAL.1991.175815,,80,23,10,
Vis,2002,QuadTIN: quadtree based triangulated irregular networks,10.1109/VISUAL.2002.1183800,http://dx.doi.org/10.1109/VISUAL.2002.1183800,395,402,C,"Interactive visualization of large digital elevation models is of continuing interest in scientific visualization, GIS, and virtual reality applications. Taking advantage of the regular structure of grid digital elevation models, efficient hierarchical multiresolution triangulation and adaptive level-of-detail (LOD) rendering algorithms have been developed for interactive terrain visualization. Despite the higher triangle count, these approaches generally outperform mesh simplification methods that produce irregular triangulated network (TIN) based LOD representations. In this project we combine the advantage of a TIN based mesh simplification preprocess with high-performance quadtree based LOD triangulation and rendering at run-time. This approach, called QuadTIN, generates an efficient quadtree triangulation hierarchy over any irregular point set that may originate from irregular terrain sampling or from reducing oversampling in high-resolution grid digital elevation models.",Renato Pajarola;Marc Antonijuan;Roberto Lario,R. Pajarola;M. Antonijuan;R. Lario,"Dept. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA",10.1109/VISUAL.1997.663860;10.1109/VISUAL.2001.964533;10.1109/VISUAL.1998.745282;10.1109/VISUAL.1998.745280,"multiresolution triangulation, real-time terrain visualization, triangulated irregular networks, level-of-detail",80,30,28,
InfoVis,2006,User Interaction with Scatterplots on Small Screens - A Comparative Evaluation of Geometric-Semantic Zoom and Fisheye Distortion,10.1109/TVCG.2006.187,http://dx.doi.org/10.1109/TVCG.2006.187,829,836,J,"Existing information-visualization techniques that target small screens are usually limited to exploring a few hundred items. In this article we present a scatterplot tool for Personal Digital Assistants that allows the handling of many thousands of items. The application's scalability is achieved by incorporating two alternative interaction techniques: a geometric-semantic zoom that provides smooth transition between overview and detail, and a fisheye distortion that displays the focus and context regions of the scatterplot in a single view. A user study with 24 participants was conducted to compare the usability and efficiency of both techniques when searching a book database containing 7500 items. The study was run on a pen-driven Wacom board simulating a PDA interface. While the results showed no significant difference in task-completion times, a clear majority of 20 users preferred the fisheye view over the zoom interaction. In addition, other dependent variables such as user satisfaction and subjective rating of orientation and navigation support revealed a preference for the fisheye distortion. These findings partly contradict related research and indicate that, when using a small screen, users place higher value on the ability to preserve navigational context than they do on the ease of use of a simplistic, metaphor-based interaction style.",Thorsten Büring;Jens Gerken;Harald Reiterer,Thorsten Buering;Jens Gerken;Harald Reiterer,University of Konstanz;University of Konstanz;University of Konstanz,10.1109/INFVIS.1999.801854;10.1109/INFVIS.2002.1173156,"Small screen, PDA, scatterplot, zoom, fisheye, focus+context",80,27,32,
VAST,2011,From movement tracks through events to places: Extracting and characterizing significant places from mobility data,10.1109/VAST.2011.6102454,http://dx.doi.org/10.1109/VAST.2011.6102454,161,170,C,"We propose a visual analytics procedure for analyzing movement data, i.e., recorded tracks of moving objects. It is oriented to a class of problems where it is required to determine significant places on the basis of certain types of events occurring repeatedly in movement data. The procedure consists of four major steps: (1) event extraction from trajectories; (2) event clustering and extraction of relevant places; (3) spatio-temporal aggregation of events or trajectories; (4) analysis of the aggregated data. All steps are scalable with respect to the amount of the data under analysis. We demonstrate the use of the procedure by example of two real-world problems requiring analysis at different spatial scales.",Gennady L. Andrienko;Natalia V. Andrienko;Christophe Hurter;Salvatore Rinzivillo;Stefan Wrobel,Gennady Andrienko;Natalia Andrienko;Christophe Hurter;Salvatore Rinzivillo;Stefan Wrobel,"Fraunhofer Institute IAIS (Intelligent Analysis and Information Systems) and University of Bonn, Germany;Fraunhofer Institute IAIS (Intelligent Analysis and Information Systems) and University of Bonn, Germany;DGAC/DTI R&amp;D, ENAC and the University of Toulouse, France;KDDLab, ISTI - CNR, Pisa, Italy;Fraunhofer Institute IAIS (Intelligent Analysis and Information Systems) and University of Bonn, Germany",10.1109/VAST.2009.5332593;10.1109/TVCG.2009.145,"movement, trajectories, spatio-temporal data, spatial events, spatial clustering, spatio-temporal clustering",80,58,31,BP
VAST,2016,Visualizing the Hidden Activity of Artificial Neural Networks,10.1109/TVCG.2016.2598838,http://dx.doi.org/10.1109/TVCG.2016.2598838,101,110,J,"In machine learning, pattern classification assigns high-dimensional vectors (observations) to classes based on generalization from examples. Artificial neural networks currently achieve state-of-the-art results in this task. Although such networks are typically used as black-boxes, they are also widely believed to learn (high-dimensional) higher-level representations of the original observations. In this paper, we propose using dimensionality reduction for two tasks: visualizing the relationships between learned representations of observations, and visualizing the relationships between artificial neurons. Through experiments conducted in three traditional image classification benchmark datasets, we show how visualization can provide highly valuable feedback for network designers. For instance, our discoveries in one of these datasets (SVHN) include the presence of interpretable clusters of learned representations, and the partitioning of artificial neurons into groups with apparently related discriminative roles.",Paulo E. Rauber;Samuel G. Fadel;Alexandre X. Falcão;Alexandru Telea,Paulo E. Rauber;Samuel G. Fadel;Alexandre X. Falcão;Alexandru C. Telea,University of GroningenUniversity of Campinas;University of São Paulo;University of Campinas;University of Groningen,10.1109/TVCG.2011.178;10.1109/TVCG.2011.220;10.1109/TVCG.2013.150;10.1109/TVCG.2014.2346578;10.1109/TVCG.2008.125;10.1109/TVCG.2015.2467553,Artificial neural networks;dimensionality reduction;algorithm understanding,80,99,50,
Vis,1992,Towards a comprehensive volume visualization system,10.1109/VISUAL.1992.235231,http://dx.doi.org/10.1109/VISUAL.1992.235231,13,20,C,"The VolVis system has been developed to satisfy the diverse requirements of the volume visualization community by comfortably housing numerous visualization algorithms and methods within a consistent and well organized framework. The VolVis system is supported by a generalized abstract model which provides for both geometric and volumetric constructs. VolVis contains several rendering algorithms that span the speed versus accuracy continuum. A fast volume rendering algorithm has been developed, which is capable of exploiting existing graphics hardware without placing any viewing restrictions or compromising accuracy. In addition, VolVis includes a volumetric navigation facility, key-frame animation generator, quantitative analysis tools, and a generalized protocol for communicating with 3D input devices.&lt;&lt;ETX&gt;&gt;",Ricardo S. Avila;Lisa M. Sobierajski;Arie E. Kaufman,R.S. Avila;L.M. Sobierajski;A.E. Kaufman,"State Univ. of New York, Stony Brook, NY, USA;State Univ. of New York, Stony Brook, NY, USA;State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1990.146362;10.1109/VISUAL.1990.146413;10.1109/VISUAL.1991.175805,,79,31,16,
InfoVis,2000,A scalable framework for information visualization,10.1109/INFVIS.2000.885088,http://dx.doi.org/10.1109/INFVIS.2000.885088,27,36,C,"The paper describes major concepts of a scalable information visualization framework. We assume that the exploration of heterogeneous information spaces at arbitrary levels of detail requires a suitable preprocessing of information quantities, the combination of different graphical interfaces and the illustration of the frame of reference of given information sets. The innovative features of our system include: dynamic hierarchy computation and user controlled refinement of those hierarchies for preprocessing unstructured information spaces; a new Focus+Context technique for visualizing complex hierarchy graphs; a new paradigm for visualizing information structures within their frame of reference; and a new graphical interface that utilizes textual similarities to arrange objects of high dimensional information space in 3-dimensional visualization space.",Matthias Kreuseler;Norma López;Heidrun Schumann,M. Kreuseler;N. Lopez;H. Schumann,"Dept. of Comput. Sci., Rostock Univ., Germany",10.1109/VISUAL.1990.146402;10.1109/INFVIS.1997.636759;10.1109/VISUAL.1996.567745;10.1109/VISUAL.1997.663916;10.1109/INFVIS.1995.528686;10.1109/INFVIS.1995.528691;10.1109/INFVIS.1998.729555;10.1109/VISUAL.1991.175815,,79,21,25,
Vis,2000,WEAVE: a system for visually linking 3-D and statistical visualizations applied to cardiac simulation and measurement data,10.1109/VISUAL.2000.885739,http://dx.doi.org/10.1109/VISUAL.2000.885739,489,492,C,"WEAVE (Workbench Environment for Analysis and Visual Exploration) is an environment for creating interactive visualization applications. WEAVE differs from previous systems in that it provides transparent linking between custom 3D visualizations and multidimensional statistical representations, and provides interactive color brushing between all visualizations. The authors demonstrate how WEAVE can be used to rapidly prototype a biomedical application, weaving together simulation data, measurement data, and 3D anatomical data concerning the propagation of excitation in the heart. These linked statistical and custom three-dimensional visualizations of the heart can allow scientists to more effectively study the correspondence of structure and behavior.",Donna L. Gresh;Bernice E. Rogowitz;Raimond L. Winslow;David F. Scollan;Christina K. Yung,D.L. Gresh;B.E. Rogowitz;R.L. Winslow;D.F. Scollan;C.K. Yung,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.1992.235219;10.1109/VISUAL.1999.809894;10.1109/INFVIS.1995.528688;10.1109/VISUAL.1991.175794;10.1109/INFVIS.1996.559210,"visualization, medical, heart, data synthesis",79,33,18,
Vis,2005,Opening the black box - data driven visualization of neural networks,10.1109/VISUAL.2005.1532820,http://dx.doi.org/10.1109/VISUAL.2005.1532820,383,390,C,"Artificial neural networks are computer software or hardware models inspired by the structure and behavior of neurons in the human nervous system. As a powerful learning tool, increasingly neural networks have been adopted by many large-scale information processing applications but there is no a set of well defined criteria for choosing a neural network. The user mostly treats a neural network as a black box and cannot explain how learning from input data was done nor how performance can be consistently ensured. We have experimented with several information visualization designs aiming to open the black box to possibly uncover underlying dependencies between the input data and the output data of a neural network. In this paper, we present our designs and show that the visualizations not only help us design more efficient neural networks, but also assist us in the process of using neural networks for problem solving such as performing a classification task.",Fan-Yin Tzeng;Kwan-Liu Ma,F.-Y. Tzeng;K.-L. Ma,"Dept. of Comput. Sci., California Univ., Davis, CA, USA;Dept. of Comput. Sci., California Univ., Davis, CA, USA",10.1109/INFVIS.2002.1173157;10.1109/VISUAL.1999.809866,"Artificial Neural Network, Information Visualization, Visualization Application, Classification, Machine Learning",79,16,31,
InfoVis,2006,Dynamic Map Labeling,10.1109/TVCG.2006.136,http://dx.doi.org/10.1109/TVCG.2006.136,773,780,J,"We address the problem of filtering, selecting and placing labels on a dynamic map, which is characterized by continuous zooming and panning capabilities. This consists of two interrelated issues. The first is to avoid label popping and other artifacts that cause confusion and interrupt navigation, and the second is to label at interactive speed. In most formulations the static map labeling problem is NP-hard, and a fast approximation might have O(n log n) complexity. Even this is too slow during interaction, when the number of labels shown can be several orders of magnitude less than the number in the map. In this paper we introduce a set of desiderata for ""consistent"" dynamic map labeling, which has qualities desirable for navigation. We develop a new framework for dynamic labeling that achieves the desiderata and allows for fast interactive display by moving all of the selection and placement decisions into the preprocessing phase. This framework is general enough to accommodate a variety of selection and placement algorithms. It does not appear possible to achieve our desiderata using previous frameworks. Prior to this paper, there were no formal models of dynamic maps or of dynamic labels; our paper introduces both. We formulate a general optimization problem for dynamic map labeling and give a solution to a simple version of the problem. The simple version is based on label priorities and a versatile and intuitive class of dynamic label placements we call ""invariant point placements"". Despite these restrictions, our approach gives a useful and practical solution. Our implementation is incorporated into the G-Vis system which is a full-detail dynamic map of the continental USA. This demo is available through any browser",Ken Been;Eli Daiches;Chee-Keng Yap,Ken Been;Eli Daiches;Chee Yap,Yeshiva University;Yeshiva University;New York University,,"Map labeling, dynamic maps, human-computer interface, label placement, label selection, label filtering, label consistency,computational cartography, GIS, HCI, realtime, preprocessing",79,59,32,
Vis,2006,Multifield-Graphs: An Approach to Visualizing Correlations in Multifield Scalar Data,10.1109/TVCG.2006.165,http://dx.doi.org/10.1109/TVCG.2006.165,917,924,J,"We present an approach to visualizing correlations in 3D multifield scalar data. The core of our approach is the computation of correlation fields, which are scalar fields containing the local correlations of subsets of the multiple fields. While the visualization of the correlation fields can be done using standard 3D volume visualization techniques, their huge number makes selection and handling a challenge. We introduce the multifield-graph to give an overview of which multiple fields correlate and to show the strength of their correlation. This information guides the selection of informative correlation fields for visualization. We use our approach to visually analyze a number of real and synthetic multifield datasets",Natascha Sauber;Holger Theisel;Hans-Peter Seidel,Natascha Sauber;Holger Theisel;Hans-peter Seidel,,10.1109/VISUAL.1999.809865;10.1109/VISUAL.2004.68;10.1109/VISUAL.2004.46;10.1109/VISUAL.1999.809905;10.1109/VISUAL.2003.1250362,"Visualization, multifield, correlation",79,73,28,
Vis,2007,Topological Landscapes: A Terrain Metaphor for Scientific Data,10.1109/TVCG.2007.70601,http://dx.doi.org/10.1109/TVCG.2007.70601,1416,1423,J,"Scientific visualization and illustration tools are designed to help people understand the structure and complexity of scientific data with images that are as informative and intuitive as possible. In this context the use of metaphors plays an important role since they make complex information easily accessible by using commonly known concepts. In this paper we propose a new metaphor, called ""topological landscapes,"" which facilitates understanding the topological structure of scalar functions. The basic idea is to construct a terrain with the same topology as a given dataset and to display the terrain as an easily understood representation of the actual input data. In this projection from an n-dimensional scalar function to a two-dimensional (2D) model we preserve function values of critical points, the persistence (function span) of topological features, and one possible additional metric property (in our examples volume). By displaying this topologically equivalent landscape together with the original data we harness the natural human proficiency in understanding terrain topography and make complex topological information easily accessible.",Gunther H. Weber;Peer-Timo Bremer;Valerio Pascucci,Gunther Weber;Peer-Timo Bremer;Valerio Pascucci,"Computational Research Division, Lawrence Berkeley National Laboratory, 1 Cyclotron Road, Berkeley, CA-94720;Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Box 808, L-551, Livermore, CA 94551;Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Box 808, L-551, Livermore, CA 94551",10.1109/VISUAL.2004.96;10.1109/VISUAL.1998.745303;10.1109/VISUAL.1992.235215;10.1109/VISUAL.1999.809932;10.1109/INFVIS.2004.57;10.1109/VISUAL.1997.663860;10.1109/VISUAL.1997.663875;10.1109/INFVIS.2002.1173159;10.1109/VISUAL.2002.1183772;10.1109/VISUAL.2005.1532839;10.1109/VISUAL.2003.1250376,"Feature Detection, User Interfaces, Visual Analytics, Contour Tree, Terrain, Topology, SOAR",79,63,49,
InfoVis,2008,A Framework of Interaction Costs in Information Visualization,10.1109/TVCG.2008.109,http://dx.doi.org/10.1109/TVCG.2008.109,1149,1156,J,"Interaction cost is an important but poorly understood factor in visualization design. We propose a framework of interaction costs inspired by Normanpsilas Seven Stages of Action to facilitate study. From 484 papers, we collected 61 interaction-related usability problems reported in 32 user studies and placed them into our framework of seven costs: (1) Decision costs to form goals; (2) system-power costs to form system operations; (3) Multiple input mode costs to form physical sequences; (4) Physical-motion costs to execute sequences; (5) Visual-cluttering costs to perceive state; (6) View-change costs to interpret perception; (7) State-change costs to evaluate interpretation. We also suggested ways to narrow the gulfs of execution (2-4) and evaluation (5-7) based on collected reports. Our framework suggests a need to consider decision costs (1) as the gulf of goal formation.",Heidi Lam,Heidi Lam,University of British Columbia,10.1109/INFVIS.2001.963289;10.1109/INFVIS.2003.1249020;10.1109/INFVIS.2005.1532151;10.1109/INFVIS.2004.21;10.1109/TVCG.2006.187;10.1109/INFVIS.2004.5;10.1109/TVCG.2007.70515;10.1109/TVCG.2006.120;10.1109/INFVIS.2005.1532133;10.1109/INFVIS.2004.19;10.1109/INFVIS.2005.1532126;10.1109/VAST.2006.261426;10.1109/VISUAL.1994.346302;10.1109/TVCG.2007.70589;10.1109/INFVIS.2005.1532132;10.1109/INFVIS.1998.729560;10.1109/TVCG.2007.70583,"Interaction, Information Visualization, Framework, Interface Evaluation",79,63,70,HM
Vis,2009,Continuous Parallel Coordinates,10.1109/TVCG.2009.131,http://dx.doi.org/10.1109/TVCG.2009.131,1531,1538,J,"Typical scientific data is represented on a grid with appropriate interpolation or approximation schemes,defined on a continuous domain. The visualization of such data in parallel coordinates may reveal patterns latently contained in the data and thus can improve the understanding of multidimensional relations. In this paper, we adopt the concept of continuous scatterplots for the visualization of spatially continuous input data to derive a density model for parallel coordinates. Based on the point-line duality between scatterplots and parallel coordinates, we propose a mathematical model that maps density from a continuous scatterplot to parallel coordinates and present different algorithms for both numerical and analytical computation of the resulting density field. In addition, we show how the 2-D model can be used to successively construct continuous parallel coordinates with an arbitrary number of dimensions. Since continuous parallel coordinates interpolate data values within grid cells, a scalable and dense visualization is achieved, which will be demonstrated for typical multi-variate scientific data.",Julian Heinrich;Daniel Weiskopf,Julian Heinrich;Daniel Weiskopf,Universit&#x0E4;t Stuttgart;Universit&#x0E4;t Stuttgart,10.1109/TVCG.2006.168;10.1109/TVCG.2008.119;10.1109/TVCG.2008.131;10.1109/INFVIS.2005.1532139;10.1109/TVCG.2009.179;10.1109/TVCG.2006.138;10.1109/VISUAL.1990.146402;10.1109/INFVIS.2005.1532138;10.1109/TVCG.2008.160;10.1109/INFVIS.2002.1173157;10.1109/VISUAL.1999.809866;10.1109/TVCG.2006.170;10.1109/INFVIS.2004.68,"Parallel coordinates, integrating spatial and non-spatial data visualization, multi-variate visualization, interpolation",79,64,28,
InfoVis,2011,"Evaluation of Traditional, Orthogonal, and Radial Tree Diagrams by an Eye Tracking Study",10.1109/TVCG.2011.193,http://dx.doi.org/10.1109/TVCG.2011.193,2440,2448,J,"Node-link diagrams are an effective and popular visualization approach for depicting hierarchical structures and for showing parent-child relationships. In this paper, we present the results of an eye tracking experiment investigating traditional, orthogonal, and radial node-link tree layouts as a piece of empirical basis for choosing between those layouts. Eye tracking was used to identify visual exploration behaviors of participants that were asked to solve a typical hierarchy exploration task by inspecting a static tree diagram: finding the least common ancestor of a given set of marked leaf nodes. To uncover exploration strategies, we examined fixation points, duration, and saccades of participants' gaze trajectories. For the non-radial diagrams, we additionally investigated the effect of diagram orientation by switching the position of the root node to each of the four main orientations. We also recorded and analyzed correctness of answers as well as completion times in addition to the eye movement data. We found out that traditional and orthogonal tree layouts significantly outperform radial tree layouts for the given task. Furthermore, by applying trajectory analysis techniques we uncovered that participants cross-checked their task solution more often in the radial than in the non-radial layouts.",Michael Burch;Natalia Konevtsova;Julian Heinrich;Markus Höferlin;Daniel Weiskopf,Michael Burch;Natalia Konevtsova;Julian Heinrich;Markus Hoeferlin;Daniel Weiskopf,"VISUS, University of Stuttgart;VISUS, University of Stuttgart;VISUS, University of Stuttgart;VISUS, University of Stuttgart;VISUS, University of Stuttgart",10.1109/TVCG.2010.209;10.1109/INFVIS.2004.70,"Hierarchy visualization, node-link layout, eye tracking, user study",79,64,24,
VAST,2012,Visual Classifier Training for Text Document Retrieval,10.1109/TVCG.2012.277,http://dx.doi.org/10.1109/TVCG.2012.277,2839,2848,J,"Performing exhaustive searches over a large number of text documents can be tedious, since it is very hard to formulate search queries or define filter criteria that capture an analyst's information need adequately. Classification through machine learning has the potential to improve search and filter tasks encompassing either complex or very specific information needs, individually. Unfortunately, analysts who are knowledgeable in their field are typically not machine learning specialists. Most classification methods, however, require a certain expertise regarding their parametrization to achieve good results. Supervised machine learning algorithms, in contrast, rely on labeled data, which can be provided by analysts. However, the effort for labeling can be very high, which shifts the problem from composing complex queries or defining accurate filters to another laborious task, in addition to the need for judging the trained classifier's quality. We therefore compare three approaches for interactive classifier training in a user study. All of the approaches are potential candidates for the integration into a larger retrieval system. They incorporate active learning to various degrees in order to reduce the labeling effort as well as to increase effectiveness. Two of them encompass interactive visualization for letting users explore the status of the classifier in context of the labeled documents, as well as for judging the quality of the classifier in iterative feedback loops. We see our work as a step towards introducing user controlled classification methods in addition to text search and filtering for increasing recall in analytics scenarios involving large corpora.",Florian Heimerl;Steffen Koch;Harald Bosch;Thomas Ertl,Florian Heimerl;Steffen Koch;Harald Bosch;Thomas Ertl,Universoty of Stuttgart;Universoty of Stuttgart;Universoty of Stuttgart;Universoty of Stuttgart,10.1109/VAST.2011.6102449;10.1109/VAST.2011.6102453;10.1109/VAST.2007.4389006;10.1109/VAST.2012.6400492,"Visual analytics, human computer interaction, information retrieval, active learning, classification, user evaluation",79,69,48,
InfoVis,2001,An empirical comparison of three commercial information visualization systems,10.1109/INFVIS.2001.963289,http://dx.doi.org/10.1109/INFVIS.2001.963289,123,130,C,"An empirical comparison of three commercial information visualization systems on three different databases is presented. The systems use different paradigms for visualizing data. Tasks were selected to be ""ecologically relevant"", i.e. meaningful and interesting in the respec- tive domains. Users of one system turned out to solve problems significantly faster than users of the other two, while users of another system would supply significantly more correct answers. Reasons for these results and general observations about the studied systems are discussed.",Alfred Kobsa,A. Kobsa,University of California,10.1109/INFVIS.1995.528688,,78,37,13,
Vis,2001,A memory insensitive technique for large model simplification,10.1109/VISUAL.2001.964502,http://dx.doi.org/10.1109/VISUAL.2001.964502,121,126,C,"The authors propose three simple, but significant improvements to the OoCS (Out-of-Core Simplification) algorithm of P. Lindstrom (2000) which increase the quality of approximations and extend the applicability of the algorithm to an even larger class of compute systems. The original OoCS algorithm has memory complexity that depends on the size of the output mesh, but no dependency on the size of the input mesh. That is, it can be used to simplify meshes of arbitrarily large size, but the complexity of the output mesh is limited by the amount of memory available. Our first contribution is a version of OoCS that removes the dependency of having enough memory to hold (even) the simplified mesh. With our new algorithm, the whole process is made essentially independent of the available memory on the host computer. Our new technique uses disk instead of main memory, but it is carefully designed to avoid costly random accesses. Our two other contributions improve the quality of the approximations generated by OoCS. We propose a scheme for preserving surface boundaries which does not use connectivity information, and a scheme for constraining the position of the ""representative vertex"" of a grid cell to an optimal position inside the cell.",Peter Lindstrom;Cláudio T. Silva,P. Lindstrom;C.T. Silva,"Center for Appl. Sci. Comput., Lawrence Livermore Nat. Lab., Berkeley, CA, USA",10.1109/VISUAL.2001.964503;10.1109/VISUAL.1999.809910;10.1109/VISUAL.1995.480813;10.1109/VISUAL.1997.663895;10.1109/VISUAL.1998.745299;10.1109/VISUAL.1997.663888;10.1109/VISUAL.1998.745314;10.1109/VISUAL.1998.745282,"polygonal surface simplification, large data, out-of-core algorithms, external sorting, quadric error metrics",78,42,32,
Vis,2001,Texture Hardware Assisted Rendering of Time-Varying Volume Data,10.1109/VISUAL.2001.964520,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2001.964520,263,270,C,"In this paper we present a hardware-assisted rendering technique coupled with a compression scheme for the interactive visual exploration of time-varying scalar volume data. A palette-based decoding technique and an adaptive bit allocation scheme are developed to fully utilize the texturing capability of a commodity 3-D graphics card. Using a single PC equipped with a modest amount of memory, a texture capable graphics card, and an inexpensive disk array, we are able to render hundreds of time steps of regularly gridded volume data (up to 45 millions voxels each time step) at interactive rates, permitting the visual exploration of large scientific data sets in both the temporal and spatial domain.",Eric B. Lum;Kwan-Liu Ma;John P. Clyne,E.B. Lum;Kwan-Liu Ma;J. Clyne,"Dept. of Comput. Sci., California Univ., Davis, CA, USA;Dept. of Comput. Sci., California Univ., Davis, CA, USA",10.1109/VISUAL.1999.809910;10.1109/VISUAL.1994.346321;10.1109/VISUAL.1995.480809;10.1109/VISUAL.1994.346341;10.1109/VISUAL.1999.809879,"Compression, high performance computing, out-of-core processing, PC, scientific visualization, texture hardware, time-varying data, transform encoding, volume rendering",78,27,23,
InfoVis,2003,Using multilevel call matrices in large software projects,10.1109/INFVIS.2003.1249030,http://dx.doi.org/10.1109/INFVIS.2003.1249030,227,232,C,"Traditionally, node link diagrams are the prime choice when it comes to visualizing software architectures. However, node link diagrams often fall short when used to visualize large graph structures. In this paper we investigate the use of call matrices as visual aids in the management of large software projects. We argue that call matrices have a number of advantages over traditional node link diagrams when the main object of interest is the link instead of the node. Matrix visualizations can provide stable and crisp layouts of large graphs and are inherently well suited for large multilevel visualizations because of their recursive structure. We discuss a number of visualization issues, using a very large software project currently under development at Philips Medical Systems as a running example.",Frank van Ham,F. van Ham,"Dept. of Math. & Comput. Sci., Technische Universiteit Eindhoven, Netherlands",10.1109/INFVIS.2002.1173141;10.1109/INFVIS.2003.1249004;10.1109/VISUAL.1991.175815,"software visualization, multilevel visualization, call matrix",78,35,14,
Vis,2008,An Efficient Naturalness-Preserving Image-Recoloring Method for Dichromats,10.1109/TVCG.2008.112,http://dx.doi.org/10.1109/TVCG.2008.112,1747,1754,J,"We present an efficient and automatic image-recoloring technique for dichromats that highlights important visual details that would otherwise be unnoticed by these individuals. While previous techniques approach this problem by potentially changing all colors of the original image, causing their results to look unnatural to color vision deficients, our approach preserves, as much as possible, the image's original colors. Our approach is about three orders of magnitude faster than previous ones. The results of a paired-comparison evaluation carried out with fourteen color-vision deficients (CVDs) indicated the preference of our technique over the state-of-the-art automatic recoloring technique for dichromats. When considering information visualization examples, the subjects tend to prefer our results over the original images. An extension of our technique that exaggerates color contrast tends to be preferred when CVDs compared pairs of scientific visualization images. These results provide valuable information for guiding the design of visualizations for color-vision deficients.",Giovane R. Kuhn;Manuel Menezes de Oliveira Neto;Leandro A. F. Fernandes,Giovane R. Kuhn;Manuel M. Oliveira;Leandro A. F. Fernandes,,,"Color-contrast enhancement, Color-vision deficiency, Recoloring algorithms, Information and Scientific Visualization",78,72,31,
InfoVis,2013,SketchStory: Telling More Engaging Stories with Data through Freeform Sketching,10.1109/TVCG.2013.191,http://dx.doi.org/10.1109/TVCG.2013.191,2416,2425,J,"Presenting and communicating insights to an audience-telling a story-is one of the main goals of data exploration. Even though visualization as a storytelling medium has recently begun to gain attention, storytelling is still underexplored in information visualization and little research has been done to help people tell their stories with data. To create a new, more engaging form of storytelling with data, we leverage and extend the narrative storytelling attributes of whiteboard animation with pen and touch interactions. We present SketchStory, a data-enabled digital whiteboard that facilitates the creation of personalized and expressive data charts quickly and easily. SketchStory recognizes a small set of sketch gestures for chart invocation, and automatically completes charts by synthesizing the visuals from the presenter-provided example icon and binding them to the underlying data. Furthermore, SketchStory allows the presenter to move and resize the completed data charts with touch, and filter the underlying data to facilitate interactive exploration. We conducted a controlled experiment for both audiences and presenters to compare SketchStory with a traditional presentation system, Microsoft PowerPoint. Results show that the audience is more engaged by presentations done with SketchStory than PowerPoint. Eighteen out of 24 audience participants preferred SketchStory to PowerPoint. Four out of five presenter participants also favored SketchStory despite the extra effort required for presentation.",Bongshin Lee;Rubaiat Habib Kazi;Greg Smith,Bongshin Lee;Rubaiat Habib Kazi;Greg Smith,Microsoft Research;National University of Singapore;Microsoft Research,10.1109/TVCG.2007.70577;10.1109/TVCG.2012.262;10.1109/TVCG.2010.179;10.1109/TVCG.2012.275;10.1109/TVCG.2008.137;10.1109/VAST.2007.4388992,"Storytelling, data presentation, sketch, pen and touch, interaction, visualization",78,41,51,
VAST,2013,Visual Analysis of Topic Competition on Social Media,10.1109/TVCG.2013.221,http://dx.doi.org/10.1109/TVCG.2013.221,2012,2021,J,"How do various topics compete for public attention when they are spreading on social media? What roles do opinion leaders play in the rise and fall of competitiveness of various topics? In this study, we propose an expanded topic competition model to characterize the competition for public attention on multiple topics promoted by various opinion leaders on social media. To allow an intuitive understanding of the estimated measures, we present a timeline visualization through a metaphoric interpretation of the results. The visual design features both topical and social aspects of the information diffusion process by compositing ThemeRiver with storyline style visualization. ThemeRiver shows the increase and decrease of competitiveness of each topic. Opinion leaders are drawn as threads that converge or diverge with regard to their roles in influencing the public agenda change over time. To validate the effectiveness of the visual analysis techniques, we report the insights gained on two collections of Tweets: the 2012 United States presidential election and the Occupy Wall Street movement.",Panpan Xu;Yingcai Wu;Enxun Wei;Tai-Quan Peng;Shixia Liu;Jonathan J. H. Zhu;Huamin Qu,Panpan Xu;Yingcai Wu;Enxun Wei;Tai-Quan Peng;Shixia Liu;Jonathan J.H. Zhu;Huamin Qu,Hong Kong University of Science and Technology;Microsoft Research Asia;Shanghai Jiao Tong University;Nanyang Technological University;Microsoft Research Asia;City University of Hong Kong;Hong Kong University of Science and Technology,10.1109/TVCG.2008.166;10.1109/TVCG.2011.239;10.1109/TVCG.2012.253;10.1109/TVCG.2012.225;10.1109/VAST.2009.5333437;10.1109/TVCG.2010.194;10.1109/TVCG.2012.291;10.1109/VAST.2010.5652931;10.1109/TVCG.2013.196;10.1109/INFVIS.2001.963273;10.1109/TVCG.2012.212;10.1109/VAST.2010.5652922;10.1109/TVCG.2010.129;10.1109/INFVIS.1999.801851,"Social media visuaization, topic competition, information diffusion, information propagation, agenda-setting",78,66,50,
VAST,2017,Visualizing Dataflow Graphs of Deep Learning Models in TensorFlow,10.1109/TVCG.2017.2744878,http://dx.doi.org/10.1109/TVCG.2017.2744878,1,12,J,"We present a design study of the TensorFlow Graph Visualizer, part of the TensorFlow machine intelligence platform. This tool helps users understand complex machine learning architectures by visualizing their underlying dataflow graphs. The tool works by applying a series of graph transformations that enable standard layout techniques to produce a legible interactive diagram. To declutter the graph, we decouple non-critical nodes from the layout. To provide an overview, we build a clustered graph using the hierarchical structure annotated in the source code. To support exploration of nested structure on demand, we perform edge bundling to enable stable and responsive cluster expansion. Finally, we detect and highlight repeated structures to emphasize a model's modular composition. To demonstrate the utility of the visualizer, we describe example usage scenarios and report user feedback. Overall, users find the visualizer useful for understanding, debugging, and sharing the structures of their models.",Kanit Wongsuphasawat;Daniel Smilkov;James Wexler;Jimbo Wilson;Dan Mané;Doug Fritz;Dilip Krishnan;Fernanda B. Viégas;Martin Wattenberg,Kanit Wongsuphasawat;Daniel Smilkov;James Wexler;Jimbo Wilson;Dandelion Mané;Doug Fritz;Dilip Krishnan;Fernanda B. Viégas;Martin Wattenberg,Paul G. Allen School of Computer Science & EngineeringUniversity of Washington;Google Research;Google Research;Google Research;Google Research;Google Research;Google Research;Google Research;Google Research,10.1109/INFVIS.2005.1532130;10.1109/TVCG.2006.156;10.1109/INFVIS.2004.66;10.1109/TVCG.2015.2467451;10.1109/TVCG.2016.2598831;10.1109/VISUAL.2005.1532820;10.1109/INFVIS.2004.43;10.1109/TVCG.2015.2467251,"Neural Network,Graph Visualization,Dataflow Graph,Clustered Graph",78,47,57,BP
Vis,1997,Simplifying polygonal models using successive mappings,10.1109/VISUAL.1997.663908,http://dx.doi.org/10.1109/VISUAL.1997.663908,395,402,C,"We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function for each simplification operation and use this function to measure deviation of the new surface from both the previous level of detail and from the original surface. In addition, we use the mapping function to compute appropriate texture coordinates if the original map has texture coordinates at its vertices. Our overall algorithm uses edge collapse operations. We present rigorous procedures for the generation of local planar projections as well as for the selection of a new vertex position for the edge collapse operation. As compared to earlier methods, our algorithm is able to compute tight error bounds on surface deviation and produce an entire continuum of levels of detail with mappings between them. We demonstrate the effectiveness of our algorithm on several models: a Ford Bronco consisting of over 300 parts and 70,000 triangles, a textured lion model consisting of 49 parts and 86,000 triangles, and a textured, wrinkled torus consisting of 79,000 triangles.",Jonathan D. Cohen 0001;Dinesh Manocha;Marc Olano,J. Cohen;D. Manocha;M. Olano,"North Carolina Univ., Chapel Hill, NC, USA",,"model simplification,levels-of-detail, surface approximation, projection, linear programming",77,38,24,
Vis,1999,Interactive exploration of volume line integral convolution based on 3D-texture mapping,10.1109/VISUAL.1999.809892,http://dx.doi.org/10.1109/VISUAL.1999.809892,233,528,C,"Line integral convolution (LIC) is an effective technique for visualizing vector fields. The application of LIC to 3D flow fields has yet been limited by difficulties to efficiently display and animate the resulting 3D-images. Texture-based volume rendering allows interactive visualization and manipulation of 3D-LIC textures. In order to ensure the comprehensive and convenient exploration of flow fields, we suggest interactive functionality including transfer functions and different clipping mechanisms. Thereby, we efficiently substitute the calculation of LIC based on sparse noise textures and show the convenient visual access of interior structures. Further on, we introduce two approaches for animating static 3D-flow fields without the computational expense and the immense memory requirements for pre-computed 3D-textures and without loss of interactivity. This is achieved by using a single 3D-LIC texture and a set of time surfaces as clipping geometries. In our first approach we use the clipping geometry to pre-compute a special 3D-LIC texture that can be animated by time-dependent color tables. Our second approach uses time volumes to actually clip the 3D-LIC volume interactively during rasterization. Additionally, several examples demonstrate the value of our strategy in practice.",Christof Rezk-Salama;Peter Hastreiter;Christian Teitzel;Thomas Ertl,C. Rezk-Salama;P. Hastreiter;C. Teitzel;T. Ertl,"Comput. Graphics Group, Erlangen-Nurnberg Univ., Germany",10.1109/VISUAL.1993.398877;10.1109/VISUAL.1993.398846;10.1109/VISUAL.1995.485141;10.1109/VISUAL.1994.346313;10.1109/VISUAL.1994.346314;10.1109/VISUAL.1990.146391;10.1109/VISUAL.1997.663898;10.1109/VISUAL.1997.663897;10.1109/VISUAL.1997.663899,"Flow Visualization, Animated LIC, Direct Volume Rendering, 3D-Textures Mapping, Interactive Volume Exploration",77,33,35,
InfoVis,2002,Multiscale visualization using data cubes,10.1109/INFVIS.2002.1173141,http://dx.doi.org/10.1109/INFVIS.2002.1173141,7,14,C,"Most analysts start with an overview of the data before gradually refining their view to be more focused and detailed. Multiscale pan-and-zoom systems are effective because they directly support this approach. However generating abstract overviews of large data sets is difficult, and most systems take advantage of only one type of abstraction: visual abstraction. Furthermore, these existing systems limit the analyst to a single zooming path on their data and thus a single set of abstract views. This paper presents: (1) a formalism for describing multiscale visualizations of data cubes with both data and visual abstraction, and (2) a method for independently zooming along one or more dimensions by traversing a zoom graph with nodes at different levels of detail. As an example of how to design multiscale visualizations using our system, we describe four design patterns using our formalism. These design patterns show the effectiveness of multiscale visualization of general relational databases.",Chris Stolte;Diane Tang;Pat Hanrahan,C. Stolte;D. Tang;P. Hanrahan,"Stanford Univ., CA, USA;Stanford Univ., CA, USA;Stanford Univ., CA, USA",10.1109/INFVIS.2000.885086,,77,14,21,BP
InfoVis,2003,Smooth and efficient zooming and panning,10.1109/INFVIS.2003.1249004,http://dx.doi.org/10.1109/INFVIS.2003.1249004,15,23,C,"Large 2D information spaces, such as maps, images, or abstract visualizations, require views at various level of detail: close ups to inspect details, overviews to maintain (literally) an overview. Users often switch between these views. We discuss how smooth animations from one view to another can be defined. To this end, a metric on the effect of simultaneous zooming and panning is defined, based on an estimate of the perceived velocity. Optimal is defined as smooth and efficient. Given the metric, these terms can be translated into a computational model, which is used to calculate an analytic solution for optimal animations. The model has two free parameters: animation speed and zoom/pan trade off. A user experiment to find good values for these is described.",Jarke J. van Wijk;Wim A. A. Nuij,J.J. van Wijk;W.A.A. Nuij,"Dept. of Math. & Comput. Sci., Technische Universiteit Eindvohen, Netherlands;Dept. of Math. & Comput. Sci., Technische Universiteit Eindvohen, Netherlands",10.1109/INFVIS.2003.1249030,"Navigation, zooming, panning, scrolling, scale space",77,32,11,BP
Vis,2003,Heart-muscle fiber reconstruction from diffusion tensor MRI,10.1109/VISUAL.2003.1250425,http://dx.doi.org/10.1109/VISUAL.2003.1250425,597,602,C,In this paper we use advanced tensor visualization techniques to study 3D diffusion tensor MRI data of a heart. We use scalar and tensor glyph visualization methods to investigate the data and apply a moving least squares (MLS) fiber tracing method to recover and visualize the helical structure and the orientation of the heart muscle fibers.,Leonid Zhukov;Alan H. Barr,L. Zhukov;A.H. Barr,"Dept. of Comput. Sci., California Inst. of Technol., USA;Dept. of Comput. Sci., California Inst. of Technol., USA",10.1109/VISUAL.2002.1183799;10.1109/VISUAL.1996.567777," Diffusion tensors, DT-MRI, fiber tracing, adaptive filtering, moving least squares, streamlines",77,22,17,
InfoVis,2004,Dynamic Drawing of Clustered Graphs,10.1109/INFVIS.2004.18,http://dx.doi.org/10.1109/INFVIS.2004.18,191,198,C,This paper presents an algorithm for drawing a sequence of graphs that contain an inherent grouping of their vertex set into clusters. It differs from previous work on dynamic graph drawing in the emphasis that is put on maintaining the clustered structure of the graph during incremental layout. The algorithm works online and allows arbitrary modifications to the graph. It is generic and can be implemented using a wide range of static force-directed graph layout tools. The paper introduces several metrics for measuring layout quality of dynamic clustered graphs. The performance of our algorithm is analyzed using these metrics. The algorithm has been successfully applied to visualizing mobile object software,Yaniv Frishman;Ayellet Tal,Y. Frishman;Ayellet Tal,Technion - Israel Institute of Technology,10.1109/INFVIS.1999.801859,"graph drawing, dynamic layout, mobile objects, software visualization",77,49,32,
Vis,2004,Lighting transfer functions using gradient aligned sampling,10.1109/VISUAL.2004.64,http://dx.doi.org/10.1109/VISUAL.2004.64,289,296,C,"An important task in volume rendering is the visualization of boundaries between materials. This is typically accomplished using transfer functions that increase opacity based on a voxel's value and gradient. Lighting also plays a crucial role in illustrating surfaces. In this paper we present a multi-dimensional transfer function method for enhancing surfaces, not through the variation of opacity, but through the modification of surface shading. The technique uses a lighting transfer function that takes into account the distribution of values along a material boundary and features a novel interface for visualizing and specifying these transfer functions. With our method, the user is given a means of visualizing boundaries without modifying opacity, allowing opacity to be used for illustrating the thickness of homogeneous materials through the absorption of light.",Eric B. Lum;Kwan-Liu Ma,E.B. Lum;K.-L. Ma,"California Univ., Davis, CA, USA;California Univ., Davis, CA, USA",10.1109/VISUAL.2001.964519;10.1109/VISUAL.2000.885697;10.1109/VISUAL.1990.146391;10.1109/VISUAL.1999.809886,"direct volume rendering, volume visualization, multi-dimensional transfer functions, shading, transfer functions",77,37,19,
Vis,2006,Feature Aligned Volume Manipulation for Illustration and Visualization,10.1109/TVCG.2006.144,http://dx.doi.org/10.1109/TVCG.2006.144,1069,1076,J,"In this paper we describe a GPU-based technique for creating illustrative visualization through interactive manipulation of volumetric models. It is partly inspired by medical illustrations, where it is common to depict cuts and deformation in order to provide a better understanding of anatomical and biological structures or surgical processes, and partly motivated by the need for a real-time solution that supports the specification and visualization of such illustrative manipulation. We propose two new feature aligned techniques, namely surface alignment and segment alignment, and compare them with the axis-aligned techniques which were reported in previous work on volume manipulation. We also present a mechanism for defining features using texture volumes, and methods for computing correct normals for the deformed volume in respect to different alignments. We describe a GPU-based implementation to achieve real-time performance of the techniques and a collection of manipulation operators including peelers, retractors, pliers and dilators which are adaptations of the metaphors and tools used in surgical procedures and medical illustrations. Our approach is directly applicable in medical and biological illustration, and we demonstrate how it works as an interactive tool for focus+context visualization, as well as a generic technique for volume graphics",Carlos D. Correa;Deborah Silver;Min Chen 0001,Carlos Correa;Deborah Silver;Min Chen,"Department of Electrical and Computer Engineering, Rutgers, The State University of New Jersey;Department of Electrical and Computer Engineering, Rutgers, The State University of New Jersey;Department of Computer Science, University of Wales, Swansea",10.1109/VISUAL.2003.1250400;10.1109/VISUAL.2000.885694,"Illustrative visualization, Illustrative manipulation, GPU computing, volume rendering, volume deformation, computerassisted medical illustration",77,55,25,
InfoVis,2008,The Shaping of Information by Visual Metaphors,10.1109/TVCG.2008.171,http://dx.doi.org/10.1109/TVCG.2008.171,1269,1276,J,"The nature of an information visualization can be considered to lie in the visual metaphors it uses to structure information. The process of understanding a visualization therefore involves an interaction between these external visual metaphors and the user's internal knowledge representations. To investigate this claim, we conducted an experiment to test the effects of visual metaphor and verbal metaphor on the understanding of tree visualizations. Participants answered simple data comprehension questions while viewing either a treemap or a node-link diagram. Questions were worded to reflect a verbal metaphor that was either compatible or incompatible with the visualization a participant was using. The results suggest that the visual metaphor indeed affects how a user derives information from a visualization. Additionally, we found that the degree to which a user is affected by the metaphor is strongly correlated with the user's ability to answer task questions correctly. These findings are a first step towards illuminating how visual metaphors shape user understanding, and have significant implications for the evaluation, application, and theory of visualization.",Caroline Ziemkiewicz;Robert Kosara,Caroline Ziemkiewicz;Robert Kosara,UNC Charlotte;UNC Charlotte,10.1109/INFVIS.2004.70;10.1109/INFVIS.2002.1173153;10.1109/INFVIS.2004.64;10.1109/INFVIS.2001.963290,"Cognition, visualization theory, metaphors, hierarchies, evaluation",77,56,21,HM
Vis,1994,"Vortex tubes in turbulent flows: identification, representation, reconstruction",10.1109/VISUAL.1994.346327,http://dx.doi.org/10.1109/VISUAL.1994.346327,132,"139, C14",C,"A new algorithm for identifying vortices in complex flows is presented. The scheme uses both the vorticity and pressure fields. A skeleton line along the center of a vortex is produced by a two-step predictor-corrector scheme. The technique uses the vector field to move in the direction of the skeleton line and the scalar field to correct the location in the plane perpendicular to the skeleton line. With an economical description of the vortex tube's cross-section, the skeleton compresses the representation of the flow by a factor of 4000 or more. We show how the reconstructed geometry of vortex tubes can be enhanced to help visualize helical motion.&lt;&lt;ETX&gt;&gt;",David C. Banks;Bart A. Singer,D.C. Banks;B.A. Singer,"Inst. for Comput. Applications in Sci. & Eng., NASA Langley Res. Center, Hampton, VA, USA",10.1109/VISUAL.1991.175773,,76,42,15,
InfoVis,1998,Multi-faceted insight through interoperable visual information analysis paradigms,10.1109/INFVIS.1998.729570,http://dx.doi.org/10.1109/INFVIS.1998.729570,137,"144, 161",C,"To gain insight and understanding of complex information collections, users must be able to visualize and explore many facets of the information. The paper presents several novel visual methods from an information analyst's perspective. The authors present a sample scenario, using the various methods to gain a variety of insights from a large information collection. They conclude that no single paradigm or visual method is sufficient for many analytical tasks. Often a suite of integrated methods offers a better analytic environment in today's emerging culture of information overload and rapidly changing issues. They also conclude that the interactions among these visual paradigms are equally as important as, if not more important than, the paradigms themselves.",Elizabeth G. Hetzler;Paul Whitney;Lou Martucci;James J. Thomas,B. Hetzler;P. Whitney;L. Martucci;J. Thomas,"Pacific Northwest Lab., Richland, WA, USA",10.1109/INFVIS.1997.636789;10.1109/INFVIS.1997.636793;10.1109/INFVIS.1995.528686;10.1109/INFVIS.1996.559228;10.1109/INFVIS.1997.636761,"information visualization, user scenario,information analysis, document analysis",76,27,19,
Vis,1999,Splatting without the blur,10.1109/VISUAL.1999.809909,http://dx.doi.org/10.1109/VISUAL.1999.809909,363,544,C,"Splatting is a volume rendering algorithm that combines efficient volume projection with a sparse data representation. Only voxels that have values inside the iso-range need to be considered, and these voxels can be projected via efficient rasterization schemes. In splatting, each projected voxel is represented as a radially symmetric interpolation kernel, equivalent to a fuzzy ball. Projecting such a basis function leaves a fuzzy impression, called a footprint or splat, on the screen. Splatting traditionally classifies and shades the voxels prior to projection, and thus each voxel footprint is weighted by the assigned voxel color and opacity. Projecting these fuzzy color balls provides a uniform screen image for homogeneous object regions, but leads to a blurry appearance of object edges. The latter is clearly undesirable, especially when the view is zoomed on the object. In this work, we manipulate the rendering pipeline of splatting by performing the classification and shading process after the voxels have been projected onto the screen. In this way volume contributions outside the iso-range never affect the image. Since shading requires gradients, we not only splat the density volume, using regular splats, but we also project the gradient volume, using gradient splats. However alternative to gradient splats, we can also compute the gradients on the projection plane using central differencing. This latter scheme cuts the number of footprint rasterization by a factor of four since only the voxel densities have to be projected.",Klaus Mueller;Torsten Möller;Roger Crawfis,K. Mueller;T. Moller;R. Crawlis,"Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA",10.1109/VISUAL.1998.745713;10.1109/VISUAL.1998.745311;10.1109/VISUAL.1996.567608;10.1109/VISUAL.1997.663848;10.1109/VISUAL.1998.745309;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1994.346340,,76,30,35,
InfoVis,2006,Enabling Automatic Clutter Reduction in Parallel Coordinate Plots,10.1109/TVCG.2006.138,http://dx.doi.org/10.1109/TVCG.2006.138,717,724,J,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,Geoffrey P. Ellis;Alan J. Dix,Geoffrey Ellis;Alan Dix,,10.1109/VISUAL.2004.5;10.1109/VISUAL.2005.1532819;10.1109/INFVIS.2004.64;10.1109/VISUAL.1999.809866;10.1109/INFVIS.2004.15,"Sampling, random sampling, lens, clutter, occlusion, density reduction, overplotting, information visualisation, parallel coordinates",76,62,16,
InfoVis,2006,IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs,10.1109/TVCG.2006.156,http://dx.doi.org/10.1109/TVCG.2006.156,821,828,J,"We extend the popular force-directed approach to network (or graph) layout to allow separation constraints, which enforce a minimum horizontal or vertical separation between selected pairs of nodes. This simple class of linear constraints is expressive enough to satisfy a wide variety of application-specific layout requirements, including: layout of directed graphs to better show flow; layout with non-overlapping node labels; and layout of graphs with grouped nodes (called clusters). In the stress majorization force-directed layout process, separation constraints can be treated as a quadratic programming problem. We give an incremental algorithm based on gradient projection for efficiently solving this problem. The algorithm is considerably faster than using generic constraint optimization techniques and is comparable in speed to unconstrained stress majorization. We demonstrate the utility of our technique with sample data from a number of practical applications including gene-activation networks, terrorist networks and visualization of high-dimensional data.",Tim Dwyer;Yehuda Koren;Kim Marriott,Tim Dwyer;Yehuda Koren;Kim Marriott,"Monash University, Australia;AT&T Labs — Research;Monash University, Australia",10.1109/INFVIS.2005.1532130,"Graph drawing, constraints, stress majorization, force directed algorithms,multidimensional scaling",76,62,22,
VAST,2009,A framework for uncertainty-aware visual analytics,10.1109/VAST.2009.5332611,http://dx.doi.org/10.1109/VAST.2009.5332611,51,58,C,"Visual analytics has become an important tool for gaining insight on large and complex collections of data. Numerous statistical tools and data transformations, such as projections, binning and clustering, have been coupled with visualization to help analysts understand data better and faster. However, data is inherently uncertain, due to error, noise or unreliable sources. When making decisions based on uncertain data, it is important to quantify and present to the analyst both the aggregated uncertainty of the results and the impact of the sources of that uncertainty. In this paper, we present a new framework to support uncertainty in the visual analytics process, through statistic methods such as uncertainty modeling, propagation and aggregation. We show that data transformations, such as regression, principal component analysis and k-means clustering, can be adapted to account for uncertainty. This framework leads to better visualizations that improve the decision-making process and help analysts gain insight on the analytic process itself.",Carlos D. Correa;Yu-Hsuan Chan;Kwan-Liu Ma,Carlos D. Correa;Yu-Hsuan Chan;Kwan-Liu Ma,"University of California at Davis, USA;University of California at Davis, USA;University of California at Davis, USA",10.1109/VAST.2008.4677368;10.1109/VAST.2007.4389000,"Uncertainty, Data Transformations, Principal Component Analysis, Model fitting",76,57,35,
Vis,2009,A Physiologically-based Model for Simulation of Color Vision Deficiency,10.1109/TVCG.2009.113,http://dx.doi.org/10.1109/TVCG.2009.113,1291,1298,J,"Color vision deficiency (CVD) affects approximately 200 million people worldwide, compromising the ability of these individuals to effectively perform color and visualization-related tasks. This has a significant impact on their private and professional lives. We present a physiologically-based model for simulating color vision. Our model is based on the stage theory of human color vision and is derived from data reported in electrophysiological studies. It is the first model to consistently handle normal color vision, anomalous trichromacy, and dichromacy in a unified way. We have validated the proposed model through an experimental evaluation involving groups of color vision deficient individuals and normal color vision ones. Our model can provide insights and feedback on how to improve visualization experiences for individuals with CVD. It also provides a framework for testing hypotheses about some aspects of the retinal photoreceptors in color vision deficient individuals.",Gustavo Mello Machado;Manuel Menezes de Oliveira Neto;Leandro A. F. Fernandes,Gustavo M. Machado;Manuel M. Oliveira;Leandro A. F. Fernandes,UFRGS;UFRGS;UFRGS,10.1109/VISUAL.1996.568118;10.1109/VISUAL.1995.480803;10.1109/TVCG.2008.112,"Models of Color Vision, Color Perception, Simulation of Color Vision Deficiency, Anomalous Trichromacy, Dichromacy",76,71,33,
Vis,2009,Structuring Feature Space: A Non-Parametric Method for Volumetric Transfer Function Generation,10.1109/TVCG.2009.185,http://dx.doi.org/10.1109/TVCG.2009.185,1473,1480,J,"The use of multi-dimensional transfer functions for direct volume rendering has been shown to be an effective means of extracting materials and their boundaries for both scalar and multivariate data. The most common multi-dimensional transfer function consists of a two-dimensional (2D) histogram with axes representing a subset of the feature space (e.g., value vs. value gradient magnitude), with each entry in the 2D histogram being the number of voxels at a given feature space pair. Users then assign color and opacity to the voxel distributions within the given feature space through the use of interactive widgets (e.g., box, circular, triangular selection). Unfortunately, such tools lead users through a trial-and-error approach as they assess which data values within the feature space map to a given area of interest within the volumetric space. In this work, we propose the addition of non-parametric clustering within the transfer function feature space in order to extract patterns and guide transfer function generation. We apply a non-parametric kernel density estimation to group voxels of similar features within the 2D histogram. These groups are then binned and colored based on their estimated density, and the user may interactively grow and shrink the binned regions to explore feature boundaries and extract regions of interest. We also extend this scheme to temporal volumetric data in which time steps of 2D histograms are composited into a histogram volume. A three-dimensional (3D) density estimation is then applied, and users can explore regions within the feature space across time without adjusting the transfer function at each time step. Our work enables users to effectively explore the structures found within a feature space of the volume and provide a context in which the user can understand how these structures relate to their volumetric data. We provide tools for enhanced exploration and manipulation of the transfer function, and we show that the initial transfer function generation serves as a reasonable base for volumetric rendering, reducing the trial-and-error overhead typically found in transfer function design.",Ross Maciejewski;Insoo Woo;Wei Chen 0001;David S. Ebert,Ross Maciejewski;Insoo Woo;Wei Chen;David Ebert,Purdue University;Purdue University;Zhejiang University;Purdue University,10.1109/TVCG.2008.119;10.1109/VISUAL.1998.745319;10.1109/VISUAL.2003.1250414;10.1109/VISUAL.2003.1250371;10.1109/VISUAL.2005.1532807;10.1109/TVCG.2008.162;10.1109/VISUAL.2001.964519;10.1109/VISUAL.2003.1250413;10.1109/VISUAL.2005.1532858;10.1109/TVCG.2006.148,"Volume rendering, kernel density estimation, transfer function design, temporal volume rendering",76,64,29,
InfoVis,2011,Evaluation of Artery Visualizations for Heart Disease Diagnosis,10.1109/TVCG.2011.192,http://dx.doi.org/10.1109/TVCG.2011.192,2479,2488,J,"Heart disease is the number one killer in the United States, and finding indicators of the disease at an early stage is critical for treatment and prevention. In this paper we evaluate visualization techniques that enable the diagnosis of coronary artery disease. A key physical quantity of medical interest is endothelial shear stress (ESS). Low ESS has been associated with sites of lesion formation and rapid progression of disease in the coronary arteries. Having effective visualizations of a patient's ESS data is vital for the quick and thorough non-invasive evaluation by a cardiologist. We present a task taxonomy for hemodynamics based on a formative user study with domain experts. Based on the results of this study we developed HemoVis, an interactive visualization application for heart disease diagnosis that uses a novel 2D tree diagram representation of coronary artery trees. We present the results of a formal quantitative user study with domain experts that evaluates the effect of 2D versus 3D artery representations and of color maps on identifying regions of low ESS. We show statistically significant results demonstrating that our 2D visualizations are more accurate and efficient than 3D representations, and that a perceptually appropriate color map leads to fewer diagnostic mistakes than a rainbow color map.",Michelle Borkin;Krzysztof Z. Gajos;Amanda Randles;Dimitrios Mitsouras;Simone Melchionna;Frank J. Rybicki;Charles L. Feldman;Hanspeter Pfister,Michelle Borkin;Krzysztof Gajos;Amanda Peters;Dimitrios Mitsouras;Simone Melchionna;Frank Rybicki;Charles Feldman;Hanspeter Pfister,"Harvard University;Harvard University;Harvard University;Brigham and Women's Hospital & Harvard Medical School;IPCF-CNR, Consiglio Nazionale delle Ricerche;Brigham and Women's Hospital & Harvard Medical School;Brigham and Women's Hospital & Harvard Medical School;Harvard University",10.1109/TVCG.2009.169;10.1109/VISUAL.2002.1183788;10.1109/VISUAL.2002.1183754;10.1109/VISUAL.2001.964510;10.1109/VISUAL.2004.104;10.1109/TVCG.2006.172;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2009.126;10.1109/VISUAL.2001.964538;10.1109/TVCG.2009.126;10.1109/VISUAL.1992.235201;10.1109/VISUAL.1996.568118;10.1109/VISUAL.2000.885731;10.1109/TVCG.2007.70550;10.1109/TVCG.2007.70596,"Quantitative evaluation, qualitative evaluation, biomedical and medical visualization",76,80,52,
VAST,2012,Visual analytics for the big data era---A comparative review of state-of-the-art commercial systems,10.1109/VAST.2012.6400554,http://dx.doi.org/10.1109/VAST.2012.6400554,173,182,C,"Visual analytics (VA) system development started in academic research institutions where novel visualization techniques and open source toolkits were developed. Simultaneously, small software companies, sometimes spin-offs from academic research institutions, built solutions for specific application domains. In recent years we observed the following trend: some small VA companies grew exponentially; at the same time some big software vendors such as IBM and SAP started to acquire successful VA companies and integrated the acquired VA components into their existing frameworks. Generally the application domains of VA systems have broadened substantially. This phenomenon is driven by the generation of more and more data of high volume and complexity, which leads to an increasing demand for VA solutions from many application domains. In this paper we survey a selection of state-of-the-art commercial VA frameworks, complementary to an existing survey on open source VA tools. From the survey results we identify several improvement opportunities as future research directions.",Leishi Zhang;Andreas Stoffel;Michael Behrisch 0001;Sebastian Mittelstädt;Tobias Schreck;René Pompl;Stefan Weber 0004;Holger Last;Daniel A. Keim,Leishi Zhang;Andreas Stoffel;Michael Behrisch;Sebastian Mittelstadt;Tobias Schreck;René Pompl;Stefan Weber;Holger Last;Daniel Keim,"University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;Siemens AG;Siemens AG;Siemens AG;University of Konstanz, Germany",10.1109/INFVIS.2004.12;10.1109/INFVIS.2004.64;10.1109/INFVIS.2000.885098,,76,61,29,
InfoVis,2013,Empirical Guidance on Scatterplot and Dimension Reduction Technique Choices,10.1109/TVCG.2013.153,http://dx.doi.org/10.1109/TVCG.2013.153,2634,2643,J,"To verify cluster separation in high-dimensional data, analysts often reduce the data with a dimension reduction (DR) technique, and then visualize it with 2D Scatterplots, interactive 3D Scatterplots, or Scatterplot Matrices (SPLOMs). With the goal of providing guidance between these visual encoding choices, we conducted an empirical data study in which two human coders manually inspected a broad set of 816 scatterplots derived from 75 datasets, 4 DR techniques, and the 3 previously mentioned scatterplot techniques. Each coder scored all color-coded classes in each scatterplot in terms of their separability from other classes. We analyze the resulting quantitative data with a heatmap approach, and qualitatively discuss interesting scatterplot examples. Our findings reveal that 2D scatterplots are often 'good enough', that is, neither SPLOM nor interactive 3D adds notably more cluster separability with the chosen DR technique. If 2D is not good enough, the most promising approach is to use an alternative DR technique in 2D. Beyond that, SPLOM occasionally adds additional value, and interactive 3D rarely helps but often hurts in terms of poorer class separation and usability. We summarize these results as a workflow model and implications for design. Our results offer guidance to analysts during the DR exploration process.",Michael Sedlmair;Tamara Munzner;Melanie Tory,Michael Sedlmair;Tamara Munzner;Melanie Tory,University of Vienna;University of British Columbia;University of Victoria,10.1109/TVCG.2009.127;10.1109/TVCG.2011.229;10.1109/TVCG.2007.70596;10.1109/INFVIS.2005.1532142;10.1109/INFVIS.1997.636793;10.1109/VAST.2010.5652392;10.1109/VAST.2012.6400490;10.1109/TVCG.2008.109;10.1109/VAST.2009.5332628,"Dimensionality reduction, scatterplots, quantitative study",76,74,0,
Vis,1995,Sweeping simplices: a fast iso-surface extraction algorithm for unstructured grids,10.1109/VISUAL.1995.480806,http://dx.doi.org/10.1109/VISUAL.1995.480806,143,"150, 447",C,"Presents an algorithm that accelerates the extraction of iso-surfaces from unstructured grids by avoiding the traversal of the entire set of cells in the volume. The algorithm consists of a sweep algorithm and a data decomposition scheme. The sweep algorithm incrementally locates intersected elements, and the data decomposition scheme restricts the algorithm's worst-case performance. For data sets consisting of hundreds of thousands of elements, our algorithm can reduce the cell traversal time by more than 90% over the naive iso-surface extraction algorithm, thus facilitating interactive probing of scalar fields for large-scale problems on unstructured three-dimensional grids.",Han-Wei Shen;Christopher R. Johnson 0001,Han-Wei Shen;C.R. Johnson,"Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA;Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.1991.175780,,75,31,6,
Vis,2002,Compressing polygon mesh geometry with parallelogram prediction,10.1109/VISUAL.2002.1183768,http://dx.doi.org/10.1109/VISUAL.2002.1183768,141,146,C,"We present a generalization of the geometry coder by Touma and Gotsman (1998) to polygon meshes. We let the polygon information dictate where to apply the parallelogram rule that they use to predict vertex positions. Since polygons tend to be fairly planar and fairly convex, it is beneficial to make predictions within a polygon rather than across polygons. This, for example, avoids poor predictions due to a crease angle between polygons. Up to 90 percent of the vertices can be predicted this way. Our strategy improves geometry compression by 10 to 40 percent depending on (a) how polygonal the mesh is and (b) on the quality (planarity/convexity) of the polygons.",Martin Isenburg;Pierre Alliez,M. Isenburg;P. Alliez,"North Carolina Univ., Chapel Hill, NC, USA",10.1109/VIS.1999.10000;10.1109/VISUAL.2000.885711;10.1109/VISUAL.1999.809902,"mesh compression, polygon meshes, geometric coding, linear prediction, parallelogram rule",75,34,37,
Vis,2002,Interactive view-dependent rendering of large isosurfaces,10.1109/VISUAL.2002.1183810,http://dx.doi.org/10.1109/VISUAL.2002.1183810,475,482,C,"We present an algorithm for interactively extracting and rendering isosurfaces of large volume datasets in a view-dependent fashion. A recursive tetrahedral mesh refinement scheme, based on longest edge bisection, is used to hierarchically decompose the data into a multiresolution structure. This data structure allows fast extraction of arbitrary isosurfaces to within user specified view-dependent error bounds. A data layout scheme based on hierarchical space filling curves provides access to the data in a cache coherent manner that follows the data access pattern indicated by the mesh refinement.",Benjamin F. Gregorski;Mark A. Duchaineau;Peter Lindstrom;Valerio Pascucci;Kenneth I. Joy,B. Gregorski;M. Duchaineau;P. Lindstrom;V. Pascucci;K.I. Joy,"Center for Appl. Sci. Comput., Lawrence Livermore Nat. Lab., CA, USA;Center for Appl. Sci. Comput., Lawrence Livermore Nat. Lab., CA, USA;Center for Appl. Sci. Comput., Lawrence Livermore Nat. Lab., CA, USA;Center for Appl. Sci. Comput., Lawrence Livermore Nat. Lab., CA, USA",10.1109/VISUAL.2000.885681;10.1109/VISUAL.2001.964533;10.1109/VISUAL.1999.809878;10.1109/VISUAL.2001.964502;10.1109/VISUAL.1997.663869;10.1109/VISUAL.2000.885705;10.1109/VISUAL.1998.745300;10.1109/VISUAL.1997.663860;10.1109/VISUAL.2001.964524;10.1109/VISUAL.2000.885703,"View-Dependent Rendering, Isosurfaces, Multiresolution Tetrahedal Meshes, Multiresolution Techniques",75,22,23,
VAST,2007,Literature Fingerprinting: A New Method for Visual Literary Analysis,10.1109/VAST.2007.4389004,http://dx.doi.org/10.1109/VAST.2007.4389004,115,122,C,"In computer-based literary analysis different types of features are used to characterize a text. Usually, only a single feature value or vector is calculated for the whole text. In this paper, we combine automatic literature analysis methods with an effective visualization technique to analyze the behavior of the feature values across the text. For an interactive visual analysis, we calculate a sequence of feature values per text and present them to the user as a characteristic fingerprint. The feature values may be calculated on different hierarchy levels, allowing the analysis to be done on different resolution levels. A case study shows several successful applications of our new method to known literature problems and demonstrates the advantage of our new visual literature fingerprinting.",Daniel A. Keim;Daniela Oelke,Daniel A. Keim;Daniela Oelke,University of Konstanz. e-mail: keim@inf.uni-konstanz.de;University of Konstanz. e-mail: oelke@inf.uni-konstanz.de,,"Visual literature analysis, visual analytics, literature fingerprinting",75,40,13,
InfoVis,2010,ManiWordle: Providing Flexible Control over Wordle,10.1109/TVCG.2010.175,http://dx.doi.org/10.1109/TVCG.2010.175,1190,1197,J,"Among the multifarious tag-clouding techniques, Wordle stands out to the community by providing an aesthetic layout, eliciting the emergence of the participatory culture and usage of tag-clouding in the artistic creations. In this paper, we introduce ManiWordle, a Wordle-based visualization tool that revamps interactions with the layout by supporting custom manipulations. ManiWordle allows people to manipulate typography, color, and composition not only for the layout as a whole, but also for the individual words, enabling them to have better control over the layout result. We first describe our design rationale along with the interaction techniques for tweaking the layout. We then present the results both from the preliminary usability study and from the comparative study between ManiWordle and Wordle. The results suggest that ManiWordle provides higher user satisfaction and an efficient method of creating the desired ""art work,"" harnessing the power behind the ever-increasing popularity of Wordle.",Kyle Koh;Bongshin Lee;Bo Hyoung Kim;Jinwook Seo,Kyle Koh;Bongshin Lee;Bohyoung Kim;Jinwook Seo,Seoul National University;Microsoft Research;Seoul National University;Seoul National University,10.1109/TVCG.2007.70541;10.1109/TVCG.2007.70515;10.1109/TVCG.2009.171;10.1109/VAST.2009.5333443;10.1109/INFVIS.2003.1249031,"Interaction design, direct manipulation, flexibilty-usability tradeoff, tag-cloud, participatory visualization, user study ",75,63,30,
VAST,2010,iVisClassifier: An interactive visual analytics system for classification based on supervised dimension reduction,10.1109/VAST.2010.5652443,http://dx.doi.org/10.1109/VAST.2010.5652443,27,34,C,"We present an interactive visual analytics system for classification, iVisClassifier, based on a supervised dimension reduction method, linear discriminant analysis (LDA). Given high-dimensional data and associated cluster labels, LDA gives their reduced dimensional representation, which provides a good overview about the cluster structure. Instead of a single two- or three-dimensional scatter plot, iVisClassifier fully interacts with all the reduced dimensions obtained by LDA through parallel coordinates and a scatter plot. Furthermore, it significantly improves the interactivity and interpretability of LDA. LDA enables users to understand each of the reduced dimensions and how they influence the data by reconstructing the basis vector into the original data domain. By using heat maps, iVisClassifier gives an overview about the cluster relationship in terms of pairwise distances between cluster centroids both in the original space and in the reduced dimensional space. Equipped with these functionalities, iVisClassifier supports users' classification tasks in an efficient way. Using several facial image data, we show how the above analysis is performed.",Jaegul Choo;Hanseung Lee;Jaeyeon Kihm;Haesun Park,Jaegul Choo;Hanseung Lee;Jaeyeon Kihm;Haesun Park,"School of Computational Science and Engineering, Georgia Institute of Technology;School of Electrical and Computer Engineering, Georgia Institute of Technology;School of Interactive, Computing, Georgia Institute of Technology;School of Computational Science and Engineering, Georgia Institute of Technology",10.1109/VAST.2009.5332629;10.1109/INFVIS.2003.1249015;10.1109/INFVIS.2004.60;10.1109/TVCG.2009.153,,75,66,29,TT
VAST,2010,An exploratory study of co-located collaborative visual analytics around a tabletop display,10.1109/VAST.2010.5652880,http://dx.doi.org/10.1109/VAST.2010.5652880,179,186,C,"Co-located collaboration can be extremely valuable during complex visual analytics tasks. This paper presents an exploratory study of a system designed to support collaborative visual analysis tasks on a digital tabletop display. Fifteen participant pairs employed Cam-biera, a visual analytics system, to solve a problem involving 240 digital documents. Our analysis, supported by observations, system logs, questionnaires, and interview data, explores how pairs approached the problem around the table. We contribute a unique, rich understanding of how users worked together around the table and identify eight types of collaboration styles that can be used to identify how closely people work together while problem solving. We show how the closeness of teams' collaboration influenced how well they performed on the task overall. We further discuss the role of the tabletop for visual analytics tasks and derive novel design implications for future co-located collaborative tabletop problem solving systems.",Petra Isenberg;Danyel Fisher;Meredith Ringel Morris;Kori Inkpen;Mary Czerwinski,Petra Isenberg;Danyel Fisher;Meredith Ringel Morris;Kori Inkpen;Mary Czerwinski,INRIA;Microsoft Research;Microsoft Research;Microsoft Research;Microsoft Research,10.1109/VAST.2006.261439;10.1109/VAST.2007.4389006;10.1109/VAST.2006.261415;10.1109/TVCG.2007.70577;10.1109/VAST.2008.4677358;10.1109/TVCG.2007.70568,,75,43,22,HM
Vis,2001,Hybrid simplification: combining multi-resolution polygon and point rendering,10.1109/VISUAL.2001.964491,http://dx.doi.org/10.1109/VISUAL.2001.964491,37,44,C,"Multi-resolution hierarchies of polygons and more recently of points are familiar and useful tools for achieving interactive rendering rates. We present an algorithm for tightly integrating the two into a single hierarchical data structure. The trade-off between rendering portions of a model with points or with polygons is made automatically. Our approach to this problem is to apply a bottom-up simplification process involving not only polygon simplification operations, but point replacement and point simplification operations as well. Given one or more surface meshes, our algorithm produces a hybrid hierarchy comprising both polygon and point primitives. This hierarchy may be optimized according to the relative performance characteristics of these primitive types on the intended rendering platform. We also provide a range of aggressiveness for performing point replacement operations. The most conservative approach produces a hierarchy that is better than a purely polygonal hierarchy in some places, and roughly equal in others. A less conservative approach can trade reduced complexity at the far viewing ranges for some increased complexity at the near viewing ranges. We demonstrate our approach on a number of input models, achieving primitive counts that are 1.3 to 4.7 times smaller than those of triangle-only simplification.",Jonathan D. Cohen 0001;Daniel G. Aliaga;Weiqiand Zhang,J.D. Cohen;D.G. Aliaga;Weiqiang Zhang,"Johns Hopkins Univ., Baltimore, MD, USA",10.1109/VISUAL.1997.663909;10.1109/VISUAL.1996.568124;10.1109/VISUAL.1998.745314;10.1109/VISUAL.1998.745283;10.1109/VISUAL.1997.663883;10.1109/VISUAL.1998.745312;10.1109/VISUAL.2001.964492;10.1109/VISUAL.1997.663908;10.1109/VISUAL.1997.663865,"rendering, simplification, multi-resolution, trianlge, points, hybrid",74,28,27,
Vis,2003,High dimensional direct rendering of time-varying volumetric data,10.1109/VISUAL.2003.1250402,http://dx.doi.org/10.1109/VISUAL.2003.1250402,417,424,C,"We present an alternative method for viewing time-varying volumetric data. We consider such data as a four-dimensional data field, rather than considering space and time as separate entities. If we treat the data in this manner, we can apply high dimensional slicing and projection techniques to generate an image hyperplane. The user is provided with an intuitive user interface to specify arbitrary hyperplanes in 4D, which can be displayed with standard volume rendering techniques. From the volume specification, we are able to extract arbitrary hyperslices, combine slices together into a hyperprojection volume, or apply a 4D raycasting method to generate the same results. In combination with appropriate integration operators and transfer functions, we are able to extract and present different space-time features to the user.",Jonathan Woodring;Chaoli Wang 0001;Han-Wei Shen,J. Woodring;Chaoli Wang;Han-Wei Shen,"Ohio State Univ., USA;Ohio State Univ., USA;Ohio State Univ., USA",10.1109/VISUAL.2001.964519;10.1109/VISUAL.1993.398869;10.1109/VISUAL.1992.235222,"time-varying data, hyperslice, hyperprojection, integration operator, transfer function, raycasting, volume rendering",74,36,18,
Vis,2005,Strategy for seeding 3D streamlines,10.1109/VISUAL.2005.1532831,http://dx.doi.org/10.1109/VISUAL.2005.1532831,471,478,C,"This paper presents a strategy for seeding streamlines in 3D flow fields. Its main goal is to capture the essential flow patterns and to provide sufficient coverage in the field while reducing clutter. First, critical points of the flow field are extracted to identify regions with important flow patterns that need to be presented. Different seeding templates are then used around the vicinity of the different critical points. Because there is significant variability in the flow pattern even for the same type of critical point, our template can change shape depending on how far the critical point is from transitioning into another type of critical point. To accomplish this, we introduce the /spl alpha/-/spl beta/ map of 3D critical points. Next, we use Poisson seeding to populate the empty regions. Finally, we filter the streamlines based on their geometric and spatial properties. Altogether, this multi-step strategy reduces clutter and yet captures the important 3D flow features.",Xiaohong Ye;David L. Kao;Alex T. Pang,Xiangong Ye;D. Kao;A. Pang,"Comput. Sci. Dept., UCSC, USA",10.1109/VISUAL.2000.885690;10.1109/VISUAL.1996.567777;10.1109/VISUAL.2000.885688;10.1109/VISUAL.1999.809865;10.1109/VISUAL.1991.175771;10.1109/VISUAL.2003.1250376,"streamlines, flow guided, feature based, filtering, critical points, variable templates",74,18,23,
InfoVis,2011,DICON: Interactive Visual Analysis of Multidimensional Clusters,10.1109/TVCG.2011.188,http://dx.doi.org/10.1109/TVCG.2011.188,2581,2590,J,"Clustering as a fundamental data analysis technique has been widely used in many analytic applications. However, it is often difficult for users to understand and evaluate multidimensional clustering results, especially the quality of clusters and their semantics. For large and complex data, high-level statistical information about the clusters is often needed for users to evaluate cluster quality while a detailed display of multidimensional attributes of the data is necessary to understand the meaning of clusters. In this paper, we introduce DICON, an icon-based cluster visualization that embeds statistical information into a multi-attribute display to facilitate cluster interpretation, evaluation, and comparison. We design a treemap-like icon to represent a multidimensional cluster, and the quality of the cluster can be conveniently evaluated with the embedded statistical information. We further develop a novel layout algorithm which can generate similar icons for similar clusters, making comparisons of clusters easier. User interaction and clutter reduction are integrated into the system to help users more effectively analyze and refine clustering results for large datasets. We demonstrate the power of DICON through a user study and a case study in the healthcare domain. Our evaluation shows the benefits of the technique, especially in support of complex multidimensional cluster analysis.",Nan Cao;David Gotz;Jimeng Sun;Huamin Qu,Nan Cao;David Gotz;Jimeng Sun;Huamin Qu,Hong Kong University of Science and Technology;IBM T.J. Watson Research Center;IBM T.J. Watson Research Center;Hong Kong University of Science and Technology,10.1109/INFVIS.2005.1532128;10.1109/TVCG.2006.147;10.1109/TVCG.2009.179;10.1109/VISUAL.1995.485141;10.1109/TVCG.2007.70582;10.1109/VISUAL.1990.146402;10.1109/VAST.2009.5332628;10.1109/INFVIS.2001.963283;10.1109/INFVIS.1998.729559;10.1109/TVCG.2010.216;10.1109/VISUAL.1999.809866;10.1109/TVCG.2008.153;10.1109/TVCG.2008.165;10.1109/TVCG.2009.153,"Visual Analysis, Clustering, Information Visualization",74,59,40,
VAST,2011,ParallelTopics: A probabilistic approach to exploring document collections,10.1109/VAST.2011.6102461,http://dx.doi.org/10.1109/VAST.2011.6102461,231,240,C,"Scalable and effective analysis of large text corpora remains a challenging problem as our ability to collect textual data continues to increase at an exponential rate. To help users make sense of large text corpora, we present a novel visual analytics system, Parallel-Topics, which integrates a state-of-the-art probabilistic topic model Latent Dirichlet Allocation (LDA) with interactive visualization. To describe a corpus of documents, ParallelTopics first extracts a set of semantically meaningful topics using LDA. Unlike most traditional clustering techniques in which a document is assigned to a specific cluster, the LDA model accounts for different topical aspects of each individual document. This permits effective full text analysis of larger documents that may contain multiple topics. To highlight this property of the model, ParallelTopics utilizes the parallel coordinate metaphor to present the probabilistic distribution of a document across topics. Such representation allows the users to discover single-topic vs. multi-topic documents and the relative importance of each topic to a document of interest. In addition, since most text corpora are inherently temporal, ParallelTopics also depicts the topic evolution over time. We have applied ParallelTopics to exploring and analyzing several text corpora, including the scientific proposals awarded by the National Science Foundation and the publications in the VAST community over the years. To demonstrate the efficacy of ParallelTopics, we conducted several expert evaluations, the results of which are reported in this paper.",Wenwen Dou;Derek Xiaoyu Wang;Remco Chang;William Ribarsky,Wenwen Dou;Xiaoyu Wang;Remco Chang;William Ribarsky,"UNC Charlotte, USA;UNC Charlotte, USA;Tufts University, USA;UNC Charlotte, USA",10.1109/VAST.2010.5652931;10.1109/VAST.2009.5333428;10.1109/TVCG.2010.184;10.1109/VAST.2010.5652940;10.1109/TVCG.2009.140;10.1109/INFVIS.2000.885098,,74,55,32,
Vis,1990,Interpreting a 3D object from a rough 2D line drawing,10.1109/VISUAL.1990.146365,http://dx.doi.org/10.1109/VISUAL.1990.146365,59,66,C,"Visualizing the third dimension while designing three-dimensional (3-D) objects is an awkward process in mechanical computer-aided-design (CAD) systems, given the current state of the art. The authors describe a computer system that automatically constructs the shape of a 3-D object from a single 2-D sketch. The method makes it convenient to create and manipulate 3-D objects, and is thus seen as an intelligent user interface for CAD and 3-D graphics applications. The proposed technique is built on well-known results in image analysis. These results are applied in conjunction with some perceptual rules to determine 3-D structure from a rough line drawing. The principles are illustrated by a computer implementation that works in a nontrivial object domain.&lt;&lt;ETX&gt;&gt;",Del Lamb;Amit Bandopadhay,D. Lamb;A. Bandopadhay,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",,,73,22,10,
Vis,1994,Visualizing flow over curvilinear grid surfaces using line integral convolution,10.1109/VISUAL.1994.346313,http://dx.doi.org/10.1109/VISUAL.1994.346313,240,"247, C27",C,"Line integral convolution (LIC), introduced by B. Cabral and C. Leedom (1993), is a powerful technique for imaging and animating vector fields. We extend the LIC paradigm in three ways: the existing technique is limited to vector fields over a regular Cartesian grid and we extend it to vector fields over parametric surfaces, specifically those found in curvilinear grids, used in computational fluid dynamics simulations; periodic motion filters can be used to animate the flow visualization, but when the flow lies on a parametric surface, the motion appears misleading, and we explain why this problem arises and show how to adjust the LIC algorithm to handle it; we introduce a technique to visualize vector magnitude as well as vector direction, which is based on varying the frequency of the filter function and we develop a different technique based on kernel phase shifts which we have found to show substantially better results. Implementation of these algorithms utilizes texture-mapping hardware to run in real time, which allows them to be included in interactive applications.&lt;&lt;ETX&gt;&gt;",Lisa K. Forssell,L.K. Forssell,"Comput. Sci. Corp., NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1992.235227;10.1109/VISUAL.1990.146360;10.1109/VISUAL.1991.175771;10.1109/VISUAL.1992.235210;10.1109/VISUAL.1990.146359;10.1109/VISUAL.1993.398846;10.1109/VISUAL.1993.398850;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1992.235226,,73,32,17,BP
InfoVis,2000,Lighthouse: showing the way to relevant information,10.1109/INFVIS.2000.885099,http://dx.doi.org/10.1109/INFVIS.2000.885099,125,129,C,"Lighthouse is an on-line interface for a Web-based information retrieval system. It accepts queries from a user, collects the retrieved documents from the search engine, organizes and presents them to the user. The system integrates two known presentations of the retrieved results, the ranked list and clustering visualization, in a novel and effective way. It accepts the user's input and adjusts the document visualization accordingly. We give a brief overview of the system.",Anton Leuski;James Allan,A. Leuski;J. Allan,"Center for Intelligent Inf. Retrieval, Massachusetts Univ., Amherst, MA, USA",,,73,19,10,
Vis,2000,Procedural annotation of uncertain information,10.1109/VISUAL.2000.885679,http://dx.doi.org/10.1109/VISUAL.2000.885679,77,84,C,"In many applications of scientific visualization, a large quantity of data is being processed and displayed in order to enable a viewer to make informed and effective decisions. Since little data is perfect, there is almost always some degree of associated uncertainty. This uncertainty is an important part of the data and should be taken into consideration when interpreting the data. Uncertainty, however, should not overshadow the data values. Many methods that address the problem of visualizing data with uncertainty can distort the data and emphasize areas with uncertain values. We have developed a method for showing the uncertainty information together with data with minimal distraction. This method uses procedurally generated annotations which are deformed according to the uncertainty information. As another possible technique we propose distorting glyphs according to the uncertainty information.",Andrej Cedilnik;Penny Rheingans,A. Cedilnik;P. Rheingans,"Maryland Univ., Baltimore, MD, USA",10.1109/VISUAL.1994.346317;10.1109/VISUAL.1996.568111;10.1109/VISUAL.1996.568109,"procedure generation, uncertainty, visualization, annotation, glyphs",73,29,12,
Vis,2004,Visualization in grid computing environments,10.1109/VISUAL.2004.112,http://dx.doi.org/10.1109/VISUAL.2004.112,155,162,C,"Grid computing provides a challenge for visualization system designers. In this research, we evolve the dataflow concept to allow parts of the visualization process to be executed remotely in a secure and seamless manner. We see dataflow at three levels: an abstract specification of the intent of the visualization; a binding of these abstract modules to a specific software system; and then a binding of software to processing and other resources. We develop an XML application capable of describing visualization at the three levels. To complement this, we have implemented an extension to a popular visualization system, IRIS Explorer, which allows modules in a dataflow pipeline to run on a set of grid resources. For computational steering applications, we have developed a library that allows a visualization system front-end to connect to a simulation running remotely on a grid resource. We demonstrate the work in two applications: the dispersion of a pollutant under different wind conditions; and the solution of a challenging numerical problem in elastohydrodynamic lubrication.",Ken Brodlie;David A. Duce;Julian R. Gallop;Musbah Shahop Sagar;J. P. R. B. Walton;Jason D. Wood,K. Brodlie;J. Duce;J. Gallop;M. Sagar;J. Walton;J. Wood,"Sch. of Comput., Leeds Univ., UK",10.1109/VISUAL.1997.663890,"grid computing, visualization systems, XML, computational steering, visualization reference models",73,37,19,
Vis,2004,Visualizing competitive behaviors in multi-user virtual environments,10.1109/VISUAL.2004.120,http://dx.doi.org/10.1109/VISUAL.2004.120,163,170,C,"We present a system for enhancing observation of user interactions in virtual environments. In particular, we focus on analyzing behavior patterns in the popular team-based first-person perspective game Return to Castle Wolfenstein: Enemy Territory. This game belongs to a genre characterized by two moderate-sized teams (usually 6 to 12 players each) competing over a set of objectives. Our system allows spectators to visualize global features such as large-scale behaviors and team strategies, as opposed to the limited, local view that traditional spectating modes provide. We also add overlay visualizations of semantic information related to the action that might be important to a spectator in order to reduce the information overload that plagues traditional overview visualizations. These overlays can visualize information about abstract concepts such as player distribution over time and areas of intense combat activity, and also highlight important features like player paths, fire coverage, etc. This added information allows spectators to identify important game events more easily and reveals large-scale player behaviors that might otherwise be overlooked.",Nate Hoobler;Greg Humphreys;Maneesh Agrawala,N. Hoobler;G. Humphreys;M. Agrawala,"Virginia Univ., Charlottesville, VA, USA;Virginia Univ., Charlottesville, VA, USA",,"Visualization, Games, Spectating",73,21,14,
Vis,2005,Statistically quantitative volume visualization,10.1109/VISUAL.2005.1532807,http://dx.doi.org/10.1109/VISUAL.2005.1532807,287,294,C,"Visualization users are increasingly in need of techniques for assessing quantitative uncertainty and error in the images produced. Statistical segmentation algorithms compute these quantitative results, yet volume rendering tools typically produce only qualitative imagery via transfer function-based classification. This paper presents a visualization technique that allows users to interactively explore the uncertainty, risk, and probabilistic decision of surface boundaries. Our approach makes it possible to directly visualize the combined ""fuzzy"" classification results from multiple segmentations by combining these data into a unified probabilistic data space. We represent this unified space, the combination of scalar volumes from numerous segmentations, using a novel graph-based dimensionality reduction scheme. The scheme both dramatically reduces the dataset size and is suitable for efficient, high quality, quantitative visualization. Lastly, we show that the statistical risk arising from overlapping segmentations is a robust measure for visualizing features and assigning optical properties.",Joe Michael Kniss;Robert L. Van Uitert Jr.;Abraham Stephens;Guo-Shi Li;Tolga Tasdizen;Charles D. Hansen,J.M. Kniss;R. Van Uitert;A. Stephens;G.-S. Li;T. Tasdizen;C. Hansen,"Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.2003.1250386;10.1109/VISUAL.1998.745311;10.1109/VISUAL.2004.48;10.1109/VISUAL.1997.663875,"volume visualization, uncertainty, classification, risk analysis",73,25,27,
Vis,2007,Multifield Visualization Using Local Statistical Complexity,10.1109/TVCG.2007.70615,http://dx.doi.org/10.1109/TVCG.2007.70615,1384,1391,J,"Modern unsteady (multi-)field visualizations require an effective reduction of the data to be displayed. From a huge amount of information the most informative parts have to be extracted. Instead of the fuzzy application dependent notion of feature, a new approach based on information theoretic concepts is introduced in this paper to detect important regions. This is accomplished by extending the concept of local statistical complexity from finite state cellular automata to discretized (multi-)fields. Thus, informative parts of the data can be highlighted in an application-independent, purely mathematical sense. The new measure can be applied to unsteady multifields on regular grids in any application domain. The ability to detect and visualize important parts is demonstrated using diffusion, flow, and weather simulations.",Heike Leitte;Alexander Wiebel;Gerik Scheuermann;Wolfgang Kollmann,Heike Janicke;Alexander Wiebel;Gerik Scheuermann;Wolfgang Kollmann,"University of Leipzig, Germany;University of Leipzig, Germany;University of Leipzig, Germany;University of California, Davis",10.1109/VISUAL.1999.809865;10.1109/VISUAL.2003.1250372;10.1109/TVCG.2006.165;10.1109/VISUAL.1999.809905;10.1109/TVCG.2006.183;10.1109/VISUAL.2003.1250383,"Local statistical complexity, multifield visualization, time-dependent, coherent structures, feature detection, information theroy, flow visualization",73,33,40,
Vis,2008,AD-Frustum: Adaptive Frustum Tracing for Interactive Sound Propagation,10.1109/TVCG.2008.111,http://dx.doi.org/10.1109/TVCG.2008.111,1707,1722,J,"We present an interactive algorithm to compute sound propagation paths for transmission, specular reflection and edge diffraction in complex scenes. Our formulation uses an adaptive frustum representation that is automatically sub-divided to accurately compute intersections with the scene primitives. We describe a simple and fast algorithm to approximate the visible surface for each frustum and generate new frusta based on specular reflection and edge diffraction. Our approach is applicable to all triangulated models and we demonstrate its performance on architectural and outdoor models with tens or hundreds of thousands of triangles and moving objects. In practice, our algorithm can perform geometric sound propagation in complex scenes at 4-20 frames per second on a multi-core PC.",Anish Chandak;Christian Lauterbach;Micah T. Taylor;Zhimin Ren;Dinesh Manocha,Anish Chandak;Christian Lauterbach;Micah Taylor;Zhimin Ren;Dinesh Manocha,UNC-Chapel Hill;UNC-Chapel Hill;UNC-Chapel Hill;UNC-Chapel Hill;UNC-Chapel Hill,10.1109/TVCG.2007.70575;10.1109/TVCG.2006.125;10.1109/VISUAL.2005.1532790,"Sound propagation, interactive system, auralization",73,40,43,
Vis,1991,A data model for scientific visualization with provisions for regular and irregular grids,10.1109/VISUAL.1991.175818,http://dx.doi.org/10.1109/VISUAL.1991.175818,298,305,C,"A mathematical data model for scientific visualization that is based on the mathematics of fiber bundles is presented. Previous results are extended to the case of piecewise field representations (associated with grid-based data representations), and a general mathematical model for piecewise representations of fields on irregular grids is presented. The various types of regularity that can be found in computational grids and techniques for compact field representation based on each form of regularity are discussed. These techniques can be combined to obtain efficient methods for representing fields on grids with various regular or partially regular structures.&lt;&lt;ETX&gt;&gt;",Robert B. Haber;Bruce Lucas;Nancy S. Collins,R.B. Haber;B. Lucas;N. Collins,"Dept. of Theor. & Appl. Mech., Illinois Univ., Urbana, IL, USA",,,72,33,8,
Vis,1996,Visualization over the World Wide Web and its application to environmental data,10.1109/VISUAL.1996.567610,http://dx.doi.org/10.1109/VISUAL.1996.567610,81,86,C,"Explores the way in which data visualization systems, in particular modular visualization environments, can be used over the World Wide Web. The conventional approach is for the publisher of the data also to be responsible for creating the visualization, and posting it as an image on the Web. This leaves the viewer in a passive role, with no opportunity to analyse the data in any way. We look at different scenarios that occur as we transfer more responsibility for the creation of the visualization to the viewer, allowing visualization to be used for analysis as well as presentation. We have implemented one particular scenario, where the publisher mounts the raw data on the Web, and the viewer accesses this data through a modular visualization environment-in this case, IRIS Explorer. The visualization system is hosted by the publisher, but its fine control is the responsibility of the viewer. The picture is returned to the viewer as VRML, for exploration via a VRML viewer such as Webspace. We have applied this to air quality data which is posted on the Web hourly: through our system, the viewer selects what data to look at (e.g. species of pollutant, location, time period) and how to look at it-at any time and from anywhere on the Web.",Jason D. Wood;Ken Brodlie;Helen Wright,J. Wood;K. Brodlie;H. Wright,"Leeds Univ., UK",10.1109/VISUAL.1994.346342,,72,32,14,
Vis,1999,Accelerating 3D convolution using graphics hardware,10.1109/VISUAL.1999.809934,http://dx.doi.org/10.1109/VISUAL.1999.809934,471,564,C,"Many volume filtering operations used for image enhancement, data processing or feature detection can be written in terms of three-dimensional convolutions. It is not possible to yield interactive frame rates on todays hardware when applying such convolutions on volume data using software filter routines. As modern graphics workstations have the ability to render two-dimensional convoluted images to the frame buffer, this feature can be used to accelerate the process significantly. This way generic 3D convolution can be added as a powerful tool in interactive volume visualization toolkits.",Matthias Hopf;Thomas Ertl,M. Hopf;T. Ertl,"Visualization & Interactive Syst. Group, Stuttgart Univ., Germany",10.1109/VISUAL.1998.745321;10.1109/VISUAL.1993.398877,,72,20,14,
Vis,2000,Multi-resolution dynamic meshes with arbitrary deformations,10.1109/VISUAL.2000.885724,http://dx.doi.org/10.1109/VISUAL.2000.885724,423,430,C,"Multi-resolution techniques and models have been shown to be effective for the display and transmission of large static geometric object. Dynamic environments with internally deforming models and scientific simulations using dynamic meshes pose greater challenges in terms of time and space, and need the development of similar solutions. We introduce the T-DAG, an adaptive multi-resolution representation for dynamic meshes with arbitrary deformations including attribute, position, connectivity and topology changes. T-DAG stands for time-dependent directed acyclic graph which defines the structure supporting this representation. We also provide an incremental algorithm (in time) for constructing the T-DAG representation of a given input mesh. This enables the traversal and use of the multi-resolution dynamic model for partial playback while still constructing new time-steps.",Ariel Shamir;Chandrajit L. Bajaj;Valerio Pascucci,A. Shamir;V. Pascucci;C. Bajaj,"Center for Comput. Visualization, Texas Univ., Austin, TX, USA",10.1109/VISUAL.1997.663865;10.1109/VISUAL.1999.809869;10.1109/VISUAL.1999.809910;10.1109/VISUAL.1999.809879;10.1109/VISUAL.1998.745329;10.1109/VISUAL.1996.568126;10.1109/VISUAL.1998.745282;10.1109/VISUAL.1997.663883,,72,24,25,
Vis,2001,EWA volume splatting,10.1109/VISUAL.2001.964490,http://dx.doi.org/10.1109/VISUAL.2001.964490,29,36,C,"In this paper we present a novel framework for direct volume rendering using a splatting approach based on elliptical Gaussian kernels. To avoid aliasing artifacts, we introduce the concept of a resampling filter combining a reconstruction with a low-pass kernel. Because of the similarity to Heckbert's EWA (elliptical weighted average) filter for texture mapping we call our technique EWA volume splatting. It provides high image quality without aliasing artifacts or excessive blurring even with non-spherical kernels. Hence it is suitable for regular, rectilinear, and irregular volume data sets. Moreover, our framework introduces a novel approach to compute the footprint function. It facilitates efficient perspective projection of arbitrary elliptical kernels at very little additional cost. Finally, we show that EWA volume reconstruction kernels can be reduced to surface reconstruction kernels. This makes our splat primitive universal in reconstructing surface and volume data.",Matthias Zwicker;Hanspeter Pfister;Jeroen van Baar;Markus H. Gross,M. Zwicker;H. Pfister;J. van Baar;M. Gross,"Eidgenossische Tech. Hochschule, Zurich, Switzerland",10.1109/VISUAL.1995.480796;10.1109/VISUAL.1997.663882;10.1109/VISUAL.1998.745309;10.1109/VISUAL.1996.567608;10.1109/VISUAL.1999.809909,"Volume Rendering, Splatting, Antialiasing",72,35,21,
InfoVis,2003,Mapping nominal values to numbers for effective visualization,10.1109/INFVIS.2003.1249016,http://dx.doi.org/10.1109/INFVIS.2003.1249016,113,120,C,"Data sets with a large number of nominal variables, some with high cardinality, are becoming increasingly common and need to be explored. Unfortunately, most existing visual exploration displays are designed to handle numeric variables only. When importing data sets with nominal values into such visualization tools, most solutions to date are rather simplistic. Often, techniques that map nominal values to numbers do not assign order or spacing among the values in a manner that conveys semantic relationships. Moreover, displays designed for nominal variables usually cannot handle high cardinality variables well. This paper addresses the problem of how to display nominal variables in general-purpose visual exploration tools designed for numeric variables. Specifically, we investigate (1) how to assign order and spacing among the nominal values, and (2) how to reduce the number of distinct values to display. We propose that nominal variables be pre-processed using a distance-quantification-classing (DQC) approach before being imported into a visual exploration tool. In the distance step, we identify a set of independent dimensions that can be used to calculate the distance between nominal values. In the quantification step, we use the independent dimensions and the distance information to assign order and spacing among the nominal values. In the classing step, we use results from the previous steps to determine which values within a variable are similar to each other and thus can be grouped together. Each step in the DQC approach can be accomplished by a variety of techniques. We extended the XmdvTool package to incorporate this approach. We evaluated our approach on several data sets using a variety of evaluation measures.",Geraldine E. Rosario;Elke A. Rundensteiner;David C. Brown;Matthew O. Ward,G.E. Rosario;E.A. Rundensteiner;D.C. Brown;M.O. Ward,"Dept. of Comput. Sci., Worcester Polytech. Inst., USA;Dept. of Comput. Sci., Worcester Polytech. Inst., USA;Dept. of Comput. Sci., Worcester Polytech. Inst., USA;Dept. of Comput. Sci., Worcester Polytech. Inst., USA",10.1109/VISUAL.1990.146386;10.1109/VISUAL.1990.146402;10.1109/INFVIS.1998.729559;10.1109/VISUAL.1994.346302," nominal data, visualization, dimension reduction, correspondence analysis, quantification, clustering, classing",72,7,21,
VAST,2007,DataMeadow: A Visual Canvas for Analysis of Large-Scale Multivariate Data,10.1109/VAST.2007.4389013,http://dx.doi.org/10.1109/VAST.2007.4389013,187,194,C,"Supporting visual analytics of multiple large-scale multidimensional datasets requires a high degree of interactivity and user control beyond the conventional challenges of visualizing such datasets. We present the DataMeadow, a visual canvas providing rich interaction for constructing visual queries using graphical set representations called DataRoses. A DataRose is essentially a starplot of selected columns in a dataset displayed as multivariate visualizations with dynamic query sliders integrated into each axis. The purpose of the DataMeadow is to allow users to create advanced visual queries by iteratively selecting and filtering into the multidimensional data. Furthermore, the canvas provides a clear history of the analysis that can be annotated to facilitate dissemination of analytical results to outsiders. Towards this end, the DataMeadow has a direct manipulation interface for selection, filtering, and creation of sets, subsets, and data dependencies using both simple and complex mouse gestures. We have evaluated our system using a qualitative expert review involving two researchers working in the area. Results from this review are favorable for our new method.",Niklas Elmqvist;John T. Stasko;Philippas Tsigas,Niklas Elmqvist;John Stasko;Philippas Tsigas,"INRIA/LRI, Univ. Paris-Sud. e-mail: elm@lri.fr;Georgia Institute of Technology. e-mail: stasko@cc.gatech.edu;Chalmers University of Technology. e-mail: tsigas@cs.chalmers.se",10.1109/INFVIS.2000.885086;10.1109/VISUAL.1990.146386;10.1109/VISUAL.1991.175815;10.1109/INFVIS.2003.1249026;10.1109/VAST.2006.261439;10.1109/INFVIS.2005.1532139;10.1109/VAST.2006.261424;10.1109/VAST.2006.261452;10.1109/INFVIS.2005.1532136;10.1109/INFVIS.1997.636793;10.1109/VAST.2006.261422;10.1109/VAST.2006.261430;10.1109/INFVIS.2003.1249016;10.1109/VISUAL.1999.809866;10.1109/VISUAL.1990.146375,"Multivariate data, visual analytics, parallel coordinates, dynamic queries, iterative analysis, starplot, small multiples",72,19,37,
Vis,2008,Texture-based Transfer Functions for Direct Volume Rendering,10.1109/TVCG.2008.169,http://dx.doi.org/10.1109/TVCG.2008.169,1364,1371,J,"Visualization of volumetric data faces the difficult task of finding effective parameters for the transfer functions. Those parameters can determine the effectiveness and accuracy of the visualization. Frequently, volumetric data includes multiple structures and features that need to be differentiated. However, if those features have the same intensity and gradient values, existing transfer functions are limited at effectively illustrating those similar features with different rendering properties. We introduce texture-based transfer functions for direct volume rendering. In our approach, the voxelpsilas resulting opacity and color are based on local textural properties rather than individual intensity values. For example, if the intensity values of the vessels are similar to those on the boundary of the lungs, our texture-based transfer function will analyze the textural properties in those regions and color them differently even though they have the same intensity values in the volume. The use of texture-based transfer functions has several benefits. First, structures and features with the same intensity and gradient values can be automatically visualized with different rendering properties. Second, segmentation or prior knowledge of the specific features within the volume is not required for classifying these features differently. Third, textural metrics can be combined and/or maximized to capture and better differentiate similar structures. We demonstrate our texture-based transfer function for direct volume rendering with synthetic and real-world medical data to show the strength of our technique.",Jesus J. Caban;Penny Rheingans,Jesus J. Caban;Penny Rheingans,,10.1109/VISUAL.2001.964519;10.1109/VISUAL.2003.1250413;10.1109/VISUAL.2003.1250414,"visualization, statistical analysis, volume rendering, data variability, medical imaging",72,56,21,
InfoVis,2009,Lark: Coordinating Co-located Collaboration with Information Visualization,10.1109/TVCG.2009.162,http://dx.doi.org/10.1109/TVCG.2009.162,1065,1072,J,"Large multi-touch displays are expanding the possibilities of multiple-coordinated views by allowing multiple people to interact with data in concert or independently. We present Lark, a system that facilitates the coordination of interactions with information visualizations on shared digital workspaces. We focus on supporting this coordination according to four main criteria: scoped interaction, temporal flexibility, spatial flexibility, and changing collaboration styles. These are achieved by integrating a representation of the information visualization pipeline into the shared workspace, thus explicitly indicating coordination points on data, representation, presentation, and view levels. This integrated meta-visualization supports both the awareness of how views are linked and the freedom to work in concert or independently. Lark incorporates these four main criteria into a coherent visualization collaboration interaction environment by providing direct visual and algorithmic support for the coordination of data analysis actions over shared large displays.",Matthew Tobiasz;Petra Isenberg;Sheelagh Carpendale,Matthew Tobiasz;Petra Isenberg;Sheelagh Carpendale,University of Calgary;University of Calgary;University of Calgary,10.1109/INFVIS.2004.12;10.1109/INFVIS.1998.729560;10.1109/VAST.2006.261415;10.1109/VAST.2007.4389011;10.1109/INFVIS.2005.1532143;10.1109/VAST.2006.261439;10.1109/TVCG.2007.70568,"Information visualization, Meta-visualization, Collaboration, Coordination, Co-located work, Workspace awareness",72,54,20,
Vis,2009,The Occlusion Spectrum for Volume Classification and Visualization,10.1109/TVCG.2009.189,http://dx.doi.org/10.1109/TVCG.2009.189,1465,1472,J,"Despite the ever-growing improvements on graphics processing units and computational power, classifying 3D volume data remains a challenge.In this paper, we present a new method for classifying volume data based on the ambient occlusion of voxels. This information stems from the observation that most volumes of a certain type, e.g., CT, MRI or flow simulation, contain occlusion patterns that reveal the spatial structure of their materials or features. Furthermore, these patterns appear to emerge consistently for different data sets of the same type. We call this collection of patterns the occlusion spectrum of a dataset. We show that using this occlusion spectrum leads to better two-dimensional transfer functions that can help classify complex data sets in terms of the spatial relationships among features. In general, the ambient occlusion of a voxel can be interpreted as a weighted average of the intensities in a spherical neighborhood around the voxel. Different weighting schemes determine the ability to separate structures of interest in the occlusion spectrum. We present a general methodology for finding such a weighting. We show results of our approach in 3D imaging for different applications, including brain and breast tumor detection and the visualization of turbulent flow.",Carlos D. Correa;Kwan-Liu Ma,Carlos Correa;Kwan-Liu Ma,University of California at Davis;University of California at Davis,10.1109/VISUAL.2003.1250414;10.1109/VISUAL.1999.809932;10.1109/TVCG.2008.162;10.1109/VISUAL.2001.964519;10.1109/VISUAL.2004.64;10.1109/VISUAL.2003.1250413;10.1109/TVCG.2006.115;10.1109/VISUAL.1997.663875;10.1109/TVCG.2006.148,"Transfer functions, Ambient Occlusion, Volume Rendering, Interactive Classification",72,64,35,
Vis,2010,Result-Driven Exploration of Simulation Parameter Spaces for Visual Effects Design,10.1109/TVCG.2010.190,http://dx.doi.org/10.1109/TVCG.2010.190,1468,1476,J,"Graphics artists commonly employ physically-based simulation for the generation of effects such as smoke, explosions, and similar phenomena. The task of finding the correct parameters for a desired result, however, is difficult and time-consuming as current tools provide little to no guidance. In this paper, we present a new approach for the visual exploration of such parameter spaces. Given a three-dimensional scene description, we utilize sampling and spatio-temporal clustering techniques to generate a concise overview of the achievable variations and their temporal evolution. Our visualization system then allows the user to explore the simulation space in a goal-oriented manner. Animation sequences with a set of desired characteristics can be composed using a novel search-by-example approach and interactive direct volume rendering is employed to provide instant visual feedback.",Stefan Bruckner;Torsten Möller,Stefan Bruckner;Torsten Moller,"Simon Fraser University, Canada;Simon Fraser University, Canada",10.1109/VISUAL.1992.235222;10.1109/VISUAL.1999.809871;10.1109/VISUAL.2003.1250401;10.1109/TVCG.2006.164;10.1109/VISUAL.2003.1250402;10.1109/INFVIS.1998.729559;10.1109/TVCG.2009.200;10.1109/VAST.2007.4389013;10.1109/VISUAL.1993.398859;10.1109/TVCG.2009.153;10.1109/TVCG.2007.70581;10.1109/VAST.2006.261421,"Visual exploration, visual effects, clustering, time-dependent volume data",72,64,41,
Vis,1990,Surface representations of two- and three-dimensional fluid flow topology,10.1109/VISUAL.1990.146359,http://dx.doi.org/10.1109/VISUAL.1990.146359,6,"13, 460",C,"The use of critical point analysis to generate representations of the vector field topology of numerical flow data sets is discussed. Critical points are located and characterized in a two-dimensional domain, which may be either a two-dimensional flow field or the tangential velocity field near a three-dimensional body. Tangent curves are then integrated out along the principal directions of certain classes of critical points. The points and curves are linked to form a skeleton representing the two-dimensional vector field topology. When generated from the tangential velocity field near a body in a three-dimensional flow, the skeleton includes the critical points and curves which provide a basis for analyzing the three-dimensional structure of the flow separation.&lt;&lt;ETX&gt;&gt;",James Helman;Lambertus Hesselink,J.L. Helman;L. Hesselink,"Stanford Univ., CA, USA;Stanford Univ., CA, USA",,,71,29,11,BP
Vis,1993,Enhancing reality in the operating room,10.1109/VISUAL.1993.398902,http://dx.doi.org/10.1109/VISUAL.1993.398902,410,415,C,Three dimensional computer models of the anatomy generated from volume acquisitions of computed tomography and magnetic resonance imaging are useful adjuncts to 2D images. This paper describes a system that merges the computer generated 3D models with live video to enhance the surgeon's understanding of the anatomy beneath the surface. The system can be used as a planning aid before the operation and provide additional information during an operation. The application of the system to a brain operation is described.&lt;&lt;ETX&gt;&gt;,William E. Lorensen;Harvey E. Cline;C. Nafis;David Altobelli;L. Gleason,W. Lorensen;H. Cline;C. Nafis;R. Kikinis;D. Altobelli;L. Gleason,"General Electric Co., Schenectady, NY, USA;General Electric Co., Schenectady, NY, USA;General Electric Co., Schenectady, NY, USA;General Electric Co., Schenectady, NY, USA;General Electric Co., Schenectady, NY, USA;General Electric Co., Schenectady, NY, USA",,,71,28,11,BCS
InfoVis,1999,Evaluating a visualisation of image similarity as a tool for image browsing,10.1109/INFVIS.1999.801855,http://dx.doi.org/10.1109/INFVIS.1999.801855,36,"43, 143",C,"A similarity metric based on the low-level content of images can be used to create a visualisation in which visually similar images are displayed close to each other. We are carrying out a series of experiments to evaluate the usefulness of this type of visualisation as an image browsing aid. The initial experiment, described, considered whether people would find a given photograph more quickly in a visualisation than in a randomly arranged grid of images. The results show that the subjects were faster with the visualisation, although in post-experiment interviews many of them said that they preferred the clarity and regularity of the grid. We describe an algorithm with which the best aspects of the two layout types can be combined.",Kerry Rodden;Wojciech Basalaj;David Sinclair;Kenneth R. Wood,K. Rodden;W. Basalaj;D. Sinclair;K. Wood,"Comput. Lab., Cambridge Univ., UK",,,71,32,17,
Vis,2000,Combining local and remote visualization techniques for interactive volume rendering in medical applications,10.1109/VISUAL.2000.885729,http://dx.doi.org/10.1109/VISUAL.2000.885729,449,452,C,"For a comprehensive understanding of tomographic image data in medicine, interactive and high-quality direct volume rendering is an essential prerequisite. This is provided by visualization using 3D texture mapping which is still limited to high-end graphics hardware. In order to make it available in a clinical environment, we present a system which uniquely combines local desktop computers and remote high-end graphics hardware. In this context, we exploit the standard visualization capabilities to a maximum which are available in the clinical environment. For 3D representations of high resolution and quality we access the remote specialized hardware. Various tools for 2D and 3D visualization are provided which meet the requirements of a medical diagnosis. This is demonstrated with examples from the field of neuroradiology which show the value of our strategy in practice.",Klaus Engel;Thomas Ertl;Peter Hastreiter;Bernd Tomandl;K. Eberhardt,K. Engel;P. Hastreiter;B. Tomandl;K. Eberhardt;T. Ertl,"Visualization & Interactive Syst. Group, Stuttgart Univ., Germany",10.1109/VISUAL.1996.568134,"medical data visualization, volume visualization, distributed systems, PC graphics hardware, remote rendering",71,22,14,
InfoVis,2002,Case study: visualizing sets of evolutionary trees,10.1109/INFVIS.2002.1173150,http://dx.doi.org/10.1109/INFVIS.2002.1173150,71,74,C,"We describe a visualization tool which allows a biologist to explore a large set of hypothetical evolutionary trees. Interacting with such a dataset allows the biologist to identify distinct hypotheses about how different species or organisms evolved, which would not have been clear from traditional analyses. Our system integrates a point-set visualization of the distribution of hypothetical trees with detail views of an individual tree, or of a consensus tree summarizing a subset of trees. Efficient algorithms were required for the key tasks of computing distances between trees, finding consensus trees, and laying out the point-set visualization.",Nina Amenta;Jeff Klingner,N. Amenta;J. Klingner,"Texas Univ., Austin, TX, USA;Texas Univ., Austin, TX, USA",10.1109/VISUAL.1996.567787;10.1109/VISUAL.1993.398870,,71,22,15,
Vis,2004,Surface reconstruction of noisy and defective data sets,10.1109/VISUAL.2004.101,http://dx.doi.org/10.1109/VISUAL.2004.101,259,266,C,"We present a novel surface reconstruction algorithm that can recover high-quality surfaces from noisy and defective data sets without any normal or orientation information. A set of new techniques is introduced to afford extra noise tolerability, robust orientation alignment, reliable outlier removal, and satisfactory feature recovery. In our algorithm, sample points are first organized by an octree. The points are then clustered into a set of monolithically singly-oriented groups. The inside/outside orientation of each group is determined through a robust voting algorithm. We locally fit an implicit quadric surface in each octree cell. The locally fitted implicit surfaces are then blended to produce a signed distance field using the modified Shepard's method. We develop sophisticated iterative fitting algorithms to afford improved noise tolerance both in topology recognition and geometry accuracy. Furthermore, this iterative fitting algorithm, coupled with a local model selection scheme, provides a reliable sharp feature recovery mechanism even in the presence of bad input.",Hui Xie 0001;Kevin T. McDonnell;Hong Qin,H. Xie;K.T. McDonnell;H. Qin,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.2003.1250359,"Computer Graphics, Surface Reconstruction, Surface Representation, MPU implicits, Modified Shepard's Method",71,30,27,
InfoVis,2006,The Perceptual Scalability of Visualization,10.1109/TVCG.2006.184,http://dx.doi.org/10.1109/TVCG.2006.184,837,844,J,"Larger, higher resolution displays can be used to increase the scalability of information visualizations. But just how much can scalability increase using larger displays before hitting human perceptual or cognitive limits? Are the same visualization techniques that are good on a single monitor also the techniques that are best when they are scaled up using large, high-resolution displays? To answer these questions we performed a controlled experiment on user performance time, accuracy, and subjective workload when scaling up data quantity with different space-time-attribute visualizations using a large, tiled display. Twelve college students used small multiples, embedded bar matrices, and embedded time-series graphs either on a 2 megapixel (Mp) display or with data scaled up using a 32 Mp tiled display. Participants performed various overview and detail tasks on geospatially-referenced multidimensional time-series data. Results showed that current designs are perceptually scalable because they result in a decrease in task completion time when normalized per number of data attributes along with no decrease in accuracy. It appears that, for the visualizations selected for this study, the relative comparison between designs is generally consistent between display sizes. However, results also suggest that encoding is more important on a smaller display while spatial grouping is more important on a larger display. Some suggestions for designers are provided based on our experience designing visualizations for large displays.",Beth Yost;Chris North 0001,Beth Yost;Chris North,Virginia Tech;Virginia Tech,10.1109/INFVIS.2002.1173156,"Information visualization, large displays, empirical evaluation",71,43,31,
VAST,2006,Visual Analysis of Conflicting Opinions,10.1109/VAST.2006.261431,http://dx.doi.org/10.1109/VAST.2006.261431,59,66,C,"Understanding the nature and dynamics of conflicting opinions is a profound and challenging issue. In this paper we address several aspects of the issue through a study of more than 3,000 Amazon customer reviews of the controversial bestseller The Da Vinci Code, including 1,738 positive and 918 negative reviews. The study is motivated by critical questions such as: what are the differences between positive and negative reviews? What is the origin of a particular opinion? How do these opinions change over time? To what extent can differentiating features be identified from unstructured text? How accurately can these features predict the category of a review? We first analyze terminology variations in these reviews in terms of syntactic, semantic, and statistic associations identified by TermWatch and use term variation patterns to depict underlying topics. We then select the most predictive terms based on log likelihood tests and demonstrate that this small set of terms classifies over 70% of the conflicting reviews correctly. This feature selection process reduces the dimensionality of the feature space from more than 20,000 dimensions to a couple of hundreds. We utilize automatically generated decision trees to facilitate the understanding of conflicting opinions in terms of these highly predictive terms. This study also uses a number of visualization and modeling tools to identify not only what positive and negative reviews have in common, but also they differ and evolve over time",Chaomei Chen;Fidelia Ibekwe-Sanjuan;Eric SanJuan;Chris Weaver,Chaomei Chen;Fidelia Ibekwe-SanJuan;Eric SanJuan;Chris Weaver,"Drexel University, USA. e-mail: chaomei.chen@cis.drexel.edu;Université de Lyon 3, France. e-mail: ibekwe@univ-lyon3.fr;Université d'Avignon, France. e-mail: eric.sanjuan@lia-univ-avignon.fr;Penn State University, USA. e-mail: cew15@psu.edu",10.1109/INFVIS.2002.1173155,"Visual Analytics, Intelligence analysis, Problemsolving environments, Visual Knowledge Discovery",71,40,21,
VAST,2007,Us vs. Them: Understanding Social Dynamics in Wikipedia with Revert Graph Visualizations,10.1109/VAST.2007.4389010,http://dx.doi.org/10.1109/VAST.2007.4389010,163,170,C,"Wikipedia is a wiki-based encyclopedia that has become one of the most popular collaborative on-line knowledge systems. As in any large collaborative system, as Wikipedia has grown, conflicts and coordination costs have increased dramatically. Visual analytic tools provide a mechanism for addressing these issues by enabling users to more quickly and effectively make sense of the status of a collaborative environment. In this paper we describe a model for identifying patterns of conflicts in Wikipedia articles. The model relies on users' editing history and the relationships between user edits, especially revisions that void previous edits, known as ""reverts"". Based on this model, we constructed Revert Graph, a tool that visualizes the overall conflict patterns between groups of users. It enables visual analysis of opinion groups and rapid interactive exploration of those relationships via detail drill- downs. We present user patterns and case studies that show the effectiveness of these techniques, and discuss how they could generalize to other systems.",Bongwon Suh;Ed H. Chi;Bryan A. Pendleton;Aniket Kittur,Bongwon Suh;Ed H. Chi;Bryan A. Pendleton;Aniket Kittur,"Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA 94304. Email: suh@parc.com;Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA 94304. Email: echi@parc.com;Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA 94304. Email: bp@parc.com;Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA 94304. Email: nkittur@ucla.edu",10.1109/TVCG.2006.122;10.1109/INFVIS.2005.1532126,"Wikipedia, wiki, revert, graph, collaboration, user model, visualization",71,25,47,
VAST,2008,Collaborative synthesis of visual analytic results,10.1109/VAST.2008.4677358,http://dx.doi.org/10.1109/VAST.2008.4677358,67,74,C,"Visual analytic tools allow analysts to generate large collections of useful analytical results. We anticipate that analysts in most real world situations will draw from these collections when working together to solve complicated problems. This indicates a need to understand how users synthesize multiple collections of results. This paper reports the results of collaborative synthesis experiments conducted with expert geographers and disease biologists. Ten participants were worked in pairs to complete a simulated real-world synthesis task using artifacts printed on cards on a large, paper-covered workspace. Experiment results indicate that groups use a number of different approaches to collaborative synthesis, and that they employ a variety of organizational metaphors to structure their information. It is further evident that establishing common ground and role assignment are critical aspects of collaborative synthesis. We conclude with a set of general design guidelines for collaborative synthesis support tools.",Anthony C. Robinson,Anthony C. Robinson,"GeoVISTA Center, Department of Geography, The Pennsylvania State University, USA",10.1109/VAST.2007.4389011;10.1109/TVCG.2007.70594;10.1109/TVCG.2007.70568,"Movement data, spatio-temporal data, aggregation, scalable visualization, geovisualization",71,44,17,
Vis,2008,VisComplete: Automating Suggestions for Visualization Pipelines,10.1109/TVCG.2008.174,http://dx.doi.org/10.1109/TVCG.2008.174,1691,1698,J,"Building visualization and analysis pipelines is a large hurdle in the adoption of visualization and workflow systems by domain scientists. In this paper, we propose techniques to help users construct pipelines by consensus-automatically suggesting completions based on a database of previously created pipelines. In particular, we compute correspondences between existing pipeline subgraphs from the database, and use these to predict sets of likely pipeline additions to a given partial pipeline. By presenting these predictions in a carefully designed interface, users can create visualizations and other data products more efficiently because they can augment their normal work patterns with the suggested completions. We present an implementation of our technique in a publicly-available, open-source scientific workflow system and demonstrate efficiency gains in real-world situations.",David Koop;Carlos Scheidegger;Steven P. Callahan;Juliana Freire;Cláudio T. Silva,D. Koop;C.E. Scheidegger;S.P. Callahan;J. Freire;C.T. Silva,"Sch. of Comput., Univ. of Utah, Salt Lake City, UT",10.1109/TVCG.2007.70584;10.1109/TVCG.2007.70577;10.1109/VISUAL.2005.1532834;10.1109/VISUAL.2005.1532833;10.1109/VISUAL.2005.1532788;10.1109/VISUAL.2005.1532795,"Scientific Workflows, Scientific Visualization, Auto Completion",71,46,39,
InfoVis,2011,Exploring Ambient and Artistic Visualization for Residential Energy Use Feedback,10.1109/TVCG.2011.196,http://dx.doi.org/10.1109/TVCG.2011.196,2489,2497,J,"Providing effective feedback on resource consumption in the home is a key challenge of environmental conservation efforts. One promising approach for providing feedback about residential energy consumption is the use of ambient and artistic visualizations. Pervasive computing technologies enable the integration of such feedback into the home in the form of distributed point-of-consumption feedback devices to support decision-making in everyday activities. However, introducing these devices into the home requires sensitivity to the domestic context. In this paper we describe three abstract visualizations and suggest four design requirements that this type of device must meet to be effective: pragmatic, aesthetic, ambient, and ecological. We report on the findings from a mixed methods user study that explores the viability of using ambient and artistic feedback in the home based on these requirements. Our findings suggest that this approach is a viable way to provide resource use feedback and that both the aesthetics of the representation and the context of use are important elements that must be considered in this design space.",Johnny Rodgers;Lyn Bartram,Johnny Rodgers;Lyn Bartram,School of Interactive Arts + Technology / Simon Fraser University;School of Interactive Arts + Technology / Simon Fraser University,10.1109/TVCG.2007.70541;10.1109/INFVIS.2003.1249031,"Ambient visualization, informative art, casual infovis, sustainability, distributed visualization",71,41,31,
InfoVis,2014,Error Bars Considered Harmful: Exploring Alternate Encodings for Mean and Error,10.1109/TVCG.2014.2346298,http://dx.doi.org/10.1109/TVCG.2014.2346298,2142,2151,J,"When making an inference or comparison with uncertain, noisy, or incomplete data, measurement error and confidence intervals can be as important for judgment as the actual mean values of different groups. These often misunderstood statistical quantities are frequently represented by bar charts with error bars. This paper investigates drawbacks with this standard encoding, and considers a set of alternatives designed to more effectively communicate the implications of mean and error data to a general audience, drawing from lessons learned from the use of visual statistics in the information visualization community. We present a series of crowd-sourced experiments that confirm that the encoding of mean and error significantly changes how viewers make decisions about uncertain data. Careful consideration of design tradeoffs in the visual presentation of data results in human reasoning that is more consistently aligned with statistical inferences. We suggest the use of gradient plots (which use transparency to encode uncertainty) and violin plots (which use width) as better alternatives for inferential tasks than bar charts with error bars.",Michael Correll;Michael Gleicher,Michael Correll;Michael Gleicher,"Department of Computer Sciences, University of Wisconsin-Madison;Department of Computer Sciences, University of Wisconsin-Madison",10.1109/TVCG.2012.220;10.1109/TVCG.2012.199;10.1109/TVCG.2012.262;10.1109/TVCG.2011.175;10.1109/TVCG.2012.279,"Visual statistics, information visualization, crowd-sourcing, empirical evaluation",71,72,35,
Vis,1997,A comparison of normal estimation schemes,10.1109/VISUAL.1997.663848,http://dx.doi.org/10.1109/VISUAL.1997.663848,19,26,C,"The task of reconstructing the derivative of a discrete function is essential for its shading and rendering as well as being widely used in image processing and analysis. We survey the possible methods for normal estimation in volume rendering and divide them into two classes based on the delivered numerical accuracy. The three members of the first class determine the normal in two steps by employing both interpolation and derivative filters. Among these is a new method which has never been realized. The members of the first class are all equally accurate. The second class has only one member and employs a continuous derivative filter obtained through the analytic derivation of an interpolation filter. We use the new method to analytically compare the accuracy of the first class with that of the second. As a result of our analysis we show that even inexpensive schemes can in fact be more accurate than high order methods. We describe the theoretical computational cost of applying the schemes in a volume rendering application and provide guidelines for helping one choose a scheme for estimating derivatives. In particular we find that the new method can be very inexpensive and can compete with the normal estimations which pre-shade and pre-classify the volume (M. Levoy, 1988).",Torsten Möller;Raghu Machiraju;Klaus Mueller;Roni Yagel,T. Moller;R. Machiraju;K. Mueller;R. Yagel,"Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA",10.1109/VISUAL.1994.346331,"interpolation filters, derivative filters, filter design, normal estimation, Taylor series expansion, efficient volume rendering",70,33,16,
InfoVis,1998,Dynamic aggregation with circular visual designs,10.1109/INFVIS.1998.729557,http://dx.doi.org/10.1109/INFVIS.1998.729557,35,"43, 151",C,"One very effective method for managing large data sets is aggregation or binning. We consider two aggregation methods that are tightly coupled with interactive manipulation and the visual representation of the data. Through this integration we hope to provide effective support for the aggregation process, specifically by enabling: 1) automatic aggregation, 2) continuous change and control of the aggregation level, 3) spatially based aggregates, 4) context maintenance across different aggregate levels, and 5) feedback on the level of aggregation.",Mei C. Chuah,M.C. Chuah,"Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA",10.1109/INFVIS.1997.636787;10.1109/VISUAL.1992.235206,,70,30,13,
Vis,1998,Automatic detection of open and closed separation and attachment lines,10.1109/VISUAL.1998.745297,http://dx.doi.org/10.1109/VISUAL.1998.745297,151,158,C,"A fully automatic feature detection algorithm is presented that locates and distinguishes lines of flow separation and attachment on surfaces in 3D numerical flow fields. The algorithm is based on concepts from 2D phase-plane analysis of linear vector fields. Unlike prior visualization techniques based on particle tracing or flow topology, the phase-plane algorithm detects separation using local analytic tests. The results show that it not only detects the standard closed separation lines but also the illusive open separation lines which are not captured by flow topology methods.",David N. Kenwright,D.N. Kenwright,"MRJ Technol Solutions, NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1994.346329;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1990.146359;10.1109/VISUAL.1995.480817,,70,31,19,
Vis,1999,Animating wrinkles on clothes,10.1109/VISUAL.1999.809885,http://dx.doi.org/10.1109/VISUAL.1999.809885,175,523,C,"This paper describes a method to simulate realistic wrinkles on clothes without fine mesh and large computational overheads. Cloth has very little in-plane deformations, as most of the deformations come from buckling. This can be looked at as area conservation property of cloth. The area conservation formulation of the method modulates the user defined wrinkle pattern, based on deformation of individual triangle. The methodology facilitates use of small in-plane deformation stiffnesses and a coarse mesh for the numerical simulation, this makes cloth simulation fast and robust. Moreover, the ability to design wrinkles (even on generalized deformable models) makes this method versatile for synthetic image generation. The method inspired from cloth wrinkling problem, being geometric in nature, can be extended to other wrinkling phenomena.",Sunil Hadap;Endre Bangerter;Pascal Volino;Nadia Magnenat-Thalmann,S. Hadap;E. Bongarter;P. Volino;N. Magnenat-Thalmann,"Geneva Univ., Switzerland",,"clothmodeling,wrinklemodeling,deformablemodels",70,28,14,
Vis,2002,Case study: Interactive visualization for Internet security,10.1109/VISUAL.2002.1183816,http://dx.doi.org/10.1109/VISUAL.2002.1183816,505,508,C,"Internet connectivity is defined by a set of routing protocols which let the routers that comprise the Internet backbone choose the best route for a packet to reach its destination. One way to improve the security and performance of Internet is to routinely examine the routing data. In this case study, we show how interactive visualization of Border Gateway Protocol (BGP) data helps characterize routing behavior, identify weaknesses in connectivity which could potentially cripple the Internet, as well as detect and explain actual anomalous events.",Soon Tee Teoh;Kwan-Liu Ma;Shyhtsun Felix Wu;Xiaoliang Zhao,Soon Tee Teoh;Kwan-Liu Ma;S.F. Wu;Xiaoliang Zhao,"Dept. of Comput. Sci., California Univ., Davis, CA, USA;Dept. of Comput. Sci., California Univ., Davis, CA, USA;Dept. of Comput. Sci., California Univ., Davis, CA, USA",,"anomaly detection, graph drawing, information visualization, network security",70,20,10,
Vis,2005,Curve-skeleton applications,10.1109/VISUAL.2005.1532783,http://dx.doi.org/10.1109/VISUAL.2005.1532783,95,102,C,"Curve-skeletons are a 1D subset of the medial surface of a 3D object and are useful for many visualization tasks including virtual navigation, reduced-model formulation, visualization improvement, mesh repair, animation, etc. There are many algorithms in the literature describing extraction methodologies for different applications; however, it is unclear how general and robust they are. In this paper, we provide an overview of many curve-skeleton applications and compile a set of desired properties of such representations. We also give a taxonomy of methods and analyze the advantages and drawbacks of each class of algorithms.",Nicu D. Cornea;Deborah Silver;Patrick Min,N.D. Cornea;D. Silver;P. Min,"Rutgers Univ., NJ, USA;Rutgers Univ., NJ, USA",10.1109/VISUAL.2004.34;10.1109/VISUAL.2004.104;10.1109/VISUAL.2002.1183754;10.1109/VISUAL.1994.346327;10.1109/VISUAL.1999.809912;10.1109/VISUAL.2003.1250353;10.1109/VISUAL.2001.964517,"skeleton, curve-skeleton",70,20,97,
Vis,2006,Real-Time Illustration of Vascular Structures,10.1109/TVCG.2006.172,http://dx.doi.org/10.1109/TVCG.2006.172,877,884,J,"We present real-time vascular visualization methods, which extend on illustrative rendering techniques to particularly accentuate spatial depth and to improve the perceptive separation of important vascular properties such as branching level and supply area. The resulting visualization can and has already been used for direct projection on a patient's organ in the operation theater where the varying absorption and reflection characteristics of the surface limit the use of color. The important contributions of our work are a GPU-based hatching algorithm for complex tubular structures that emphasizes shape and depth as well as GPU-accelerated shadow-like depth indicators, which enable reliable comparisons of depth distances in a static monoscopic 3D visualization. In addition, we verify the expressiveness of our illustration methods in a large, quantitative study with 160 subjects",Felix Ritter;Christian Hansen 0001;Volker Dicken;Olaf Konrad-Verse;Bernhard Preim;Heinz-Otto Peitgen,Felix Ritter;Christian Hansen;Volker Dicken;Olaf Konrad;Bernhard Preim;Heinz-otto Peitgen,,10.1109/VISUAL.2005.1532782;10.1109/VISUAL.2005.1532859;10.1109/VISUAL.2003.1250394;10.1109/VISUAL.2005.1532835;10.1109/VISUAL.2001.964538;10.1109/INFVIS.2003.1249022;10.1109/VISUAL.2005.1532855,"Vessel visualization, functional realism, illustrative rendering, spatial perception, evaluation",70,46,28,
Vis,2007,Topologically Clean Distance fields,10.1109/TVCG.2007.70603,http://dx.doi.org/10.1109/TVCG.2007.70603,1432,1439,J,"Analysis of the results obtained from material simulations is important in the physical sciences. Our research was motivated by the need to investigate the properties of a simulated porous solid as it is hit by a projectile. This paper describes two techniques for the generation of distance fields containing a minimal number of topological features, and we use them to identify features of the material. We focus on distance fields defined on a volumetric domain considering the distance to a given surface embedded within the domain. Topological features of the field are characterized by its critical points. Our first method begins with a distance field that is computed using a standard approach, and simplifies this field using ideas from Morse theory. We present a procedure for identifying and extracting a feature set through analysis of the MS complex, and apply it to find the invariants in the clean distance field. Our second method proceeds by advancing a front, beginning at the surface, and locally controlling the creation of new critical points. We demonstrate the value of topologically clean distance fields for the analysis of filament structures in porous solids. Our methods produce a curved skeleton representation of the filaments that helps material scientists to perform a detailed qualitative and quantitative analysis of pores, and hence infer important material properties. Furthermore, we provide a set of criteria for finding the ""difference"" between two skeletal structures, and use this to examine how the structure of the porous solid changes over several timesteps in the simulation of the particle impact.",Attila Gyulassy;Mark A. Duchaineau;Vijay Natarajan;Valerio Pascucci;Eduardo M. Bringa;Andrew Higginbotham;Bernd Hamann,Attila Gyulassy;Mark Duchaineau;Vijay Natarajan;Valerio Pascucci;Eduardo Bringa;Andrew Higginbotham;Bernd Hamann,"Institute for Data Analysis and Visualization, Dept. of Computer Science, University of California, Davis;Center for Applied Scientific Computing, Lawrence Livermore National Laboratory;Dept. of Computer Science and Automation, Supercomputer Education and Research Centre, Indian Institute of Science, Bangalore;Center for Applied Scientific Computing, Lawrence Livermore National Laboratory;Material Science and Technology Division, Lawrence Livermore National Laboratory;Department of Physics, Clarendon Laboratory, University of Oxford, Oxford;Institute for Data Analysis and Visualization, Dept. of Computer Science, University of California, Davis",10.1109/VISUAL.2005.1532839;10.1109/VISUAL.2005.1532783;10.1109/VISUAL.2003.1250356;10.1109/VISUAL.2004.96;10.1109/VISUAL.2000.885680;10.1109/VISUAL.2000.885703,"Morse theory, Morse-Smale complex, distance field, topological simplification, wavefront, critical point, porous solid, material science",70,60,31,
Vis,1994,Differential volume rendering: a fast volume visualization technique for flow animation,10.1109/VISUAL.1994.346321,http://dx.doi.org/10.1109/VISUAL.1994.346321,180,"187, C20",C,"We present a direct volume rendering algorithm to speed up volume animation for flow visualizations. Data coherency between consecutive simulation time steps is used to avoid casting rays from those pixels retaining color values assigned to the previous image. The algorithm calculates the differential information among a sequence of 3D volumetric simulation data. At each time step the differential information is used to compute the locations of pixels that need updating and a ray-casting method as utilized to produce the updated image. We illustrate the utility and speed of the differential volume rendering algorithm with simulation data from computational bioelectric and fluid dynamics applications. We can achieve considerable disk-space savings and nearly real-time rendering of 3D flows using low-cost, single processor workstations for models which contain hundreds of thousands of data points.&lt;&lt;ETX&gt;&gt;",Han-Wei Shen;Christopher R. Johnson 0001,Han-Wei Shen;C.R. Johnson,"Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA;Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.1993.398877;10.1109/VISUAL.1992.235227;10.1109/VISUAL.1992.235210;10.1109/VISUAL.1991.175772;10.1109/VISUAL.1993.398852;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1993.398846,,69,31,14,
InfoVis,1996,"Selection: 524,288 ways to say ""this is interesting""",10.1109/INFVIS.1996.559216,http://dx.doi.org/10.1109/INFVIS.1996.559216,54,"60, 120",C,"Visualization is a critical technology for understanding complex, data-rich systems. Effective visualizations make important features of the data immediately recognizable and enable the user to discover interesting and useful results by highlighting patterns. A key element of such systems is the ability to interact with displays of data by selecting a subset for further investigation. This operation is needed for use in linked-views systems and in drill-down analysis. It is a common manipulation in many other systems. It is as ubiquitous as selecting icons in a desktop GUI. It is therefore surprising to note that little research has been done on how selection can be implemented. This paper addresses this omission, presenting a taxonomy for selection mechanisms and discussing the interactions between branches of the taxonomy. Our suggestion of 524,288 possible systems [2/sup 16/ operation systems/spl times/2 (memory/memoryless)/spl times/2 (data-dependent/independent)/spl times/2 (brush/lasso)] is more in fun than serious, as within the taxonomy there are many different choices that can be made. This framework is the result of considering both the current state of the art and historical antecedents.",Graham J. Wills,G.J. Wills,"AT&T Bell Labs., Naperville, IL, USA",,,69,35,14,
Vis,1996,Visualization of Complex Models Using Dynamic Texture-based Simplification,10.1109/VISUAL.1996.567774,http://doi.ieeecomputersociety.org/10.1109/VISUAL.1996.567774,101,106,C,"We are investigating methods for simplifying complex models for interactive visualizations using texture based representations. The paper presents a simplification method which dynamically ""caches"" distant geometry into textures and trades off accurate rendering of the distant geometry for performance. Smooth transitions and continuous borders are defined between the geometry and textures thus the representations can be switched without sudden jumps (as is the case with many current texturing techniques). All the computations for the transitions can be done a priori without the need to change the textures each frame thereafter.",Daniel G. Aliaga,D.G. Aliaga,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",,,69,11,0,
Vis,1997,Visualizing the behaviour of higher dimensional dynamical systems,10.1109/VISUAL.1997.663867,http://dx.doi.org/10.1109/VISUAL.1997.663867,119,125,C,In recent years scientific visualization has been driven by the need to visualize high-dimensional data sets within high-dimensional spaces. However most visualization methods are designed to show only some statistical features of the data set. The paper deals with the visualization of trajectories of high-dimensional dynamical systems which form a L/sub n//sup n/ data set of a smooth n-dimensional flow. Three methods that are based on the idea of parallel coordinates are presented and discussed. Visualizations done with these new methods are shown and an interactive visualization tool for the exploration of high-dimensional dynamical systems is proposed.,Rainer Wegenkittl;Helwig Löffelmann;M. Eduard Gröller,R. Wegenkittl;H. Loffelmann;E. Groller,"Inst. of Comput. Graphics, Wien Univ. of Technol., Austria",10.1109/VISUAL.1990.146373;10.1109/VISUAL.1991.175796;10.1109/VISUAL.1993.398869;10.1109/VISUAL.1991.175795;10.1109/VISUAL.1990.146386;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1993.398849,,69,20,20,
InfoVis,2000,From metaphor to method: cartographic perspectives on information visualization,10.1109/INFVIS.2000.885095,http://dx.doi.org/10.1109/INFVIS.2000.885095,91,97,C,"By virtue of their spatio-cognitive abilities, humans are able to navigate through geographic space as well as meaningfully communicate geographic information represented in cartographic form. The current dominance of spatial metaphors in information visualization research is the result of the realization that those cognitive skills also have value in the exploration and analysis of non-geographic information. While mapping or landscape metaphors are routinely used in this field, there is a noticeable lack of consideration for existing cartographic expertise. This is especially apparent whenever problematic issues are encountered, such as graphic complexity or feature labeling. There are a number of areas in which a cartographic outlook could provide a valuable perspective. This paper discusses how geographic and cartographic notions may influence the design of visualizations for textual information spaces. Map projections, generalization, feature labeling and map design issues are discussed.",André Skupin,A. Skupin,"Dept. of Geogr., New Orleans Univ., LA, USA",10.1109/INFVIS.1995.528686;10.1109/VISUAL.1992.235198,,69,22,62,
InfoVis,2000,Collaborative geographic visualization: enabling shared understanding of environmental processes,10.1109/INFVIS.2000.885102,http://dx.doi.org/10.1109/INFVIS.2000.885102,137,141,C,"We describe a prototype same-time/different-place collaborative geovisualization environment. We outline an approach to understanding use and usability and present results of interviews with domain experts about the ways in which collaborative visualization might enable groups to work at a distance. One goal for our research is to design an effective and flexible system that can support group work on environmental science research mediated through dynamic geovisualization displays. We are addressing this goal using a four-step human-centered system design process, modeled on that proposed by (Gabbard et al., 1999) for development and evaluation of virtual environments. The steps they delineate are: user task analysis; expert guideline-based evaluation; formative user-centered evaluation; and summative comparative evaluation.",Isaac Brewer;Alan M. MacEachren;Hadi Abdo;Jack Gundrum;George Otto,I. Brewer;A.M. MacEachren;H. Abdo;J. Gundrum;G. Otto,"Dept. of Geogr., Penn State Univ., PA, USA",,,69,27,20,
Vis,2002,Maximum entropy light source placement,10.1109/VISUAL.2002.1183785,http://dx.doi.org/10.1109/VISUAL.2002.1183785,275,282,C,"Finding the ""best"" viewing parameters for a scene is a difficult but very important problem. Fully automatic procedures seem to be impossible as the notion of ""best"" strongly depends on human judgment as well as on the application. In this paper a solution to the sub-problem of placing light sources for given camera parameters is proposed. A light position is defined to be optimal, when the resulting illumination reveals more about the scene than illuminations from all other light positions, i.e. the light position maximizes information that is added to the image through the illumination. With the help of an experiment with several subjects we could adapt the information measure to the actually perceived information content. We present fast global optimization procedures and solutions for two and more light sources.",Stefan Gumhold,S. Gumhold,"WSI/GRIS, Tubingen Univ., Germany",,"Lighting Design, Visualization, Illumination, Maximum Entropy, Optimization, User Study",69,19,16,
Vis,2003,Conveying shape and features with image-based relighting,10.1109/VISUAL.2003.1250392,http://dx.doi.org/10.1109/VISUAL.2003.1250392,349,354,C,"Hand-crafted illustrations are often more effective than photographs for conveying the shape and important features of an object, but they require expertise and time to produce. We describe an image compositing system and user interface that allow an artist to quickly and easily create technical illustrations from a set of photographs of an object taken from the same point of view under variable lighting conditions. Our system uses a novel compositing process in which images are combined using spatially-varying light mattes, enabling the final lighting in each area of the composite to be manipulated independently. We describe an interface that provides for the painting of local lighting effects (e.g. shadows, highlights, and tangential lighting to reveal texture) directly onto the composite. We survey some of the techniques used in illustration and lighting design to convey the shape and features of objects and describe how our system can be used to apply these techniques.",David Akers;Frank Losasso;Jeff Klingner;Maneesh Agrawala;John Rick;Pat Hanrahan,D. Akers;F. Losasso;J. Klingner;M. Agrawala;J. Rick;P. Hanrahan,"Stanford Univ., USA;Stanford Univ., USA;Stanford Univ., USA",,"Visualization, Relighting, Image Composition, Scientfic Illustration, Technical Illustration, Photography, Lighting Design",69,27,33,
Vis,2003,Vicinity shading for enhanced perception of volumetric data,10.1109/VISUAL.2003.1250394,http://dx.doi.org/10.1109/VISUAL.2003.1250394,355,362,C,"This paper presents a shading model for volumetric data which enhances the perception of surfaces within the volume. The model incorporates uniform diffuse illumination, which arrives equally from all directions at each surface point in the volume. This illumination is attenuated by occlusions in the local vicinity of the surface point, resulting in shadows in depressions and crevices. Experiments by other authors have shown that perception of a surface is superior under uniform diffuse lighting, compared to illumination from point source lighting.",A. James Stewart,A.J. Stewart,"Sch. of Comput., Queen's Univ., Kingston, Ont., Canada",10.1109/VISUAL.2002.1183761;10.1109/VISUAL.2002.1183764,"volume rendering, shading model, diffuse illumination, perceptual cues",69,30,25,
Vis,2005,Effectively visualizing large networks through sampling,10.1109/VISUAL.2005.1532819,http://dx.doi.org/10.1109/VISUAL.2005.1532819,375,382,C,"We study the problem of visualizing large networks and develop techniques for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduction techniques are based on sampling, where only a sample instead of the full network is visualized. We propose a randomized notion of ""focus"" that specifies a part of the network and the degree to which it needs to be magnified. Visualizing a sample allows our method to overcome the scalability issues inherent in visualizing massive networks. We report some characteristics that frequently occur in large networks and the conditions under which they are preserved when sampling from a network. This can be useful in selecting a proper sampling scheme that yields a sample with similar characteristics as the original network. Our method is built on top of a relational database, thus it can be easily and efficiently implemented using any off-the-shelf database software. As a proof of concept, we implement our methods and report some of our experiments over the movie database and the connectivity graph of the Web.",Davood Rafiei;Stephen Curial,D. Rafiei,"Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada",10.1109/INFVIS.2001.963282;10.1109/INFVIS.2004.66;10.1109/INFVIS.2002.1173148;10.1109/INFVIS.2003.1249011,"visualizing the Web, large network visualization, network sampling",69,21,33,
InfoVis,2010,Perceptual Guidelines for Creating Rectangular Treemaps,10.1109/TVCG.2010.186,http://dx.doi.org/10.1109/TVCG.2010.186,990,998,J,"Treemaps are space-filling visualizations that make efficient use of limited display space to depict large amounts of hierarchical data. Creating perceptually effective treemaps requires carefully managing a number of design parameters including the aspect ratio and luminance of rectangles. Moreover, treemaps encode values using area, which has been found to be less accurate than judgments of other visual encodings, such as length. We conduct a series of controlled experiments aimed at producing a set of design guidelines for creating effective rectangular treemaps. We find no evidence that luminance affects area judgments, but observe that aspect ratio does have an effect. Specifically, we find that the accuracy of area comparisons suffers when the compared rectangles have extreme aspect ratios or when both are squares. Contrary to common assumptions, the optimal distribution of rectangle aspect ratios within a treemap should include non-squares, but should avoid extremes. We then compare treemaps with hierarchical bar chart displays to identify the data densities at which length-encoded bar charts become less effective than area-encoded treemaps. We report the transition points at which treemaps exhibit judgment accuracy on par with bar charts for both leaf and non-leaf tree nodes. We also find that even at relatively low data densities treemaps result in faster comparisons than bar charts. Based on these results, we present a set of guidelines for the effective use of treemaps and suggest alternate approaches for treemap layout.",Nicholas Kong;Jeffrey Heer;Maneesh Agrawala,Nicholas Kong;Jeffrey Heer;Maneesh Agrawala,"University of California, Berkeley;Stanford University;University of California, Berkeley",10.1109/INFVIS.2000.885091;10.1109/INFVIS.2005.1532145;10.1109/INFVIS.2004.70;10.1109/INFVIS.2005.1532144;10.1109/TVCG.2007.70583;10.1109/INFVIS.2001.963283;10.1109/INFVIS.2001.963290;10.1109/TVCG.2008.171;10.1109/INFVIS.1999.801860;10.1109/INFVIS.2002.1173153,"Graphical Perception, Visualization, Treemaps, Rectangular Area, Visual Encoding, Experiment, Mechanical Turk",69,46,45,HM
InfoVis,2010,Comparative Analysis of Multidimensional; Quantitative Data,10.1109/TVCG.2010.138,http://dx.doi.org/10.1109/TVCG.2010.138,1027,1035,J,"When analyzing multidimensional, quantitative data, the comparison of two or more groups of dimensions is a common task. Typical sources of such data are experiments in biology, physics or engineering, which are conducted in different configurations and use replicates to ensure statistically significant results. One common way to analyze this data is to filter it using statistical methods and then run clustering algorithms to group similar values. The clustering results can be visualized using heat maps, which show differences between groups as changes in color. However, in cases where groups of dimensions have an a priori meaning, it is not desirable to cluster all dimensions combined, since a clustering algorithm can fragment continuous blocks of records. Furthermore, identifying relevant elements in heat maps becomes more difficult as the number of dimensions increases. To aid in such situations, we have developed Matchmaker, a visualization technique that allows researchers to arbitrarily arrange and compare multiple groups of dimensions at the same time. We create separate groups of dimensions which can be clustered individually, and place them in an arrangement of heat maps reminiscent of parallel coordinates. To identify relations, we render bundled curves and ribbons between related records in different groups. We then allow interactive drill-downs using enlarged detail views of the data, which enable in-depth comparisons of clusters between groups. To reduce visual clutter, we minimize crossings between the views. This paper concludes with two case studies. The first demonstrates the value of our technique for the comparison of clustering algorithms. In the second, biologists use our system to investigate why certain strains of mice develop liver disease while others remain healthy, informally showing the efficacy of our system when analyzing multidimensional data containing distinct groups of dimensions.",Alexander Lex;Marc Streit;Christian Partl;Karl Kashofer;Dieter Schmalstieg,Alexander Lex;Marc Streit;Christian Partl;Karl Kashofer;Dieter Schmalstieg,,10.1109/VISUAL.1996.568118;10.1109/VISUAL.1990.146402;10.1109/TVCG.2006.147;10.1109/TVCG.2007.70556;10.1109/TVCG.2007.70529;10.1109/TVCG.2009.167;10.1109/INFVIS.2000.885086,"Multidimensional data, cluster comparison, bioinformatics visualization",69,48,33,
InfoVis,2012,Interactive Level-of-Detail Rendering of Large Graphs,10.1109/TVCG.2012.238,http://dx.doi.org/10.1109/TVCG.2012.238,2486,2495,J,"We propose a technique that allows straight-line graph drawings to be rendered interactively with adjustable level of detail. The approach consists of a novel combination of edge cumulation with density-based node aggregation and is designed to exploit common graphics hardware for speed. It operates directly on graph data and does not require precomputed hierarchies or meshes. As proof of concept, we present an implementation that scales to graphs with millions of nodes and edges, and discuss several example applications.",Michael Zinsmaier;Ulrik Brandes;Oliver Deussen;Hendrik Strobelt,Michael Zinsmaier;Ulrik Brandes;Oliver Deussen;Hendrik Strobelt,Uni Konstanz;Uni Konstanz;Uni Konstanz;Uni Konstanz,10.1109/INFVIS.2005.1532150;10.1109/TVCG.2006.120;10.1109/TVCG.2011.233;10.1109/TVCG.2008.135;10.1109/TVCG.2006.187;10.1109/TVCG.2006.147;10.1109/TVCG.2010.154;10.1109/INFVIS.2004.66,"Graph visualization, OpenGL, edge aggregation",69,59,28,
VAST,2012,Semantic Interaction for Sensemaking: Inferring Analytical Reasoning for Model Steering,10.1109/TVCG.2012.260,http://dx.doi.org/10.1109/TVCG.2012.260,2879,2888,J,"Visual analytic tools aim to support the cognitively demanding task of sensemaking. Their success often depends on the ability to leverage capabilities of mathematical models, visualization, and human intuition through flexible, usable, and expressive interactions. Spatially clustering data is one effective metaphor for users to explore similarity and relationships between information, adjusting the weighting of dimensions or characteristics of the dataset to observe the change in the spatial layout. Semantic interaction is an approach to user interaction in such spatializations that couples these parametric modifications of the clustering model with users' analytic operations on the data (e.g., direct document movement in the spatialization, highlighting text, search, etc.). In this paper, we present results of a user study exploring the ability of semantic interaction in a visual analytic prototype, ForceSPIRE, to support sensemaking. We found that semantic interaction captures the analytical reasoning of the user through keyword weighting, and aids the user in co-creating a spatialization based on the user's reasoning and intuition.",Alex Endert;Patrick Fiaux;Chris North 0001,Alex Endert;Patrick Fiaux;Chris North,Virginia Polytechnic Institute and State University;Virginia Polytechnic Institute and State University;Virginia Polytechnic Institute and State University,10.1109/INFVIS.1995.528686;10.1109/VAST.2012.6400559;10.1109/VAST.2011.6102449;10.1109/VAST.2011.6102438;10.1109/VAST.2007.4389006,"User Interaction, visualization, sensemaking, analytic reasoning, visual analytics",69,57,36,
VAST,2014,#FluxFlow: Visual Analysis of Anomalous Information Spreading on Social Media,10.1109/TVCG.2014.2346922,http://dx.doi.org/10.1109/TVCG.2014.2346922,1773,1782,J,"We present FluxFlow, an interactive visual analysis system for revealing and analyzing anomalous information spreading in social media. Everyday, millions of messages are created, commented, and shared by people on social media websites, such as Twitter and Facebook. This provides valuable data for researchers and practitioners in many application domains, such as marketing, to inform decision-making. Distilling valuable social signals from the huge crowd's messages, however, is challenging, due to the heterogeneous and dynamic crowd behaviors. The challenge is rooted in data analysts' capability of discerning the anomalous information behaviors, such as the spreading of rumors or misinformation, from the rest that are more conventional patterns, such as popular topics and newsworthy events, in a timely fashion. FluxFlow incorporates advanced machine learning algorithms to detect anomalies, and offers a set of novel visualization designs for presenting the detected threads for deeper analysis. We evaluated FluxFlow with real datasets containing the Twitter feeds captured during significant events such as Hurricane Sandy. Through quantitative measurements of the algorithmic performance and qualitative interviews with domain experts, the results show that the back-end anomaly detection model is effective in identifying anomalous retweeting threads, and its front-end interactive visualizations are intuitive and useful for analysts to discover insights in data and comprehend the underlying analytical model.",Jian Zhao 0010;Nan Cao;Zhen Wen;Yale Song;Yu-Ru Lin;Christopher Collins 0001,Jian Zhao;Nan Cao;Zhen Wen;Yale Song;Yu-Ru Lin;Christopher Collins,University of Toronto;MIT;MIT;IBM J. Watson Research Center;University of Pittsburgh;UOIT,10.1109/VAST.2011.6102456;10.1109/TVCG.2012.291;10.1109/VAST.2012.6400557;10.1109/TVCG.2011.179;10.1109/TVCG.2011.239;10.1109/TVCG.2012.226;10.1109/TVCG.2013.227;10.1109/VAST.2012.6400485;10.1109/VAST.2010.5652922;10.1109/TVCG.2010.129;10.1109/TVCG.2013.221;10.1109/TVCG.2013.162,"Retweeting threads, anomaly detection, social media, visual analytics, machine learning, information visualization",69,80,48,HM
VAST,2015,Characterizing Provenance in Visualization and Data Analysis: An Organizational Framework of Provenance Types and Purposes,10.1109/TVCG.2015.2467551,http://dx.doi.org/10.1109/TVCG.2015.2467551,31,40,J,"While the primary goal of visual analytics research is to improve the quality of insights and findings, a substantial amount of research in provenance has focused on the history of changes and advances throughout the analysis process. The term, provenance, has been used in a variety of ways to describe different types of records and histories related to visualization. The existing body of provenance research has grown to a point where the consolidation of design knowledge requires cross-referencing a variety of projects and studies spanning multiple domain areas. We present an organizational framework of the different types of provenance information and purposes for why they are desired in the field of visual analytics. Our organization is intended to serve as a framework to help researchers specify types of provenance and coordinate design knowledge across projects. We also discuss the relationships between these factors and the methods used to capture provenance information. In addition, our organization can be used to guide the selection of evaluation methodology and the comparison of study outcomes in provenance research.",Eric D. Ragan;Alex Endert;Jibonananda Sanyal;Jian Chen,Eric D. Ragan;Alex Endert;Jibonananda Sanyal;Jian Chen,"Texas A&M University;Georgia Tech;Oak Ridge National Laboratory;University of Maryland, Baltimore County",10.1109/INFVIS.2005.1532136;10.1109/VISUAL.2005.1532788;10.1109/TVCG.2013.155;10.1109/VISUAL.1993.398857;10.1109/VAST.2012.6400486;10.1109/TVCG.2014.2346575;10.1109/VAST.2010.5652932;10.1109/VAST.2008.4677365;10.1109/TVCG.2008.137;10.1109/TVCG.2013.126;10.1109/VAST.2009.5333020;10.1109/VAST.2010.5653598;10.1109/TVCG.2012.271;10.1109/TVCG.2014.2346573;10.1109/VAST.2008.4677366;10.1109/TVCG.2013.130;10.1109/TVCG.2010.181;10.1109/TVCG.2010.179;10.1109/VISUAL.1990.146375,"Provenance, Analytic provenance, Visual analytics, Framework, Visualization, Conceptual model",69,72,97,
Vis,1990,FAST: a multi-processed environment for visualization of computational fluid dynamics,10.1109/VISUAL.1990.146360,http://dx.doi.org/10.1109/VISUAL.1990.146360,14,"27, 461-2",C,"The authors discuss FAST (flow analysis software toolkit), an implementation of a software system for fluid mechanics analysis. Visualization of computational aerodynamics requires flexible, extensible, and adaptable software tools for performing analysis tasks. An overview of FAST is given, and its architecture is discussed. Interactive visualization control is addressed. The advantages and disadvantages of FAST are discussed.&lt;&lt;ETX&gt;&gt;",Gordon V. Bancroft;Fergus Merritt;Todd Plessel;Paul G. Kelaita;R. Kevin McCabe;Al Globus,G.V. Bancroft;F.J. Merritt;T.C. Plessel;P.G. Kelaita;R.K. McCabe;A. Globus,"Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA;Sterling Federal Syst. Inc., Palo Alto, CA, USA",,,68,29,20,
Vis,1990,The VIS-5D system for easy interactive visualization,10.1109/VISUAL.1990.146361,http://dx.doi.org/10.1109/VISUAL.1990.146361,28,"35, 462",C,"The VIS-5D system provides highly interactive visual access to five-dimensional data sets containing up to 50 million data points. VIS-5D runs on the Stardent ST-1000 and ST-2000 workstations and generates animated three-dimensional graphics from gridded data sets in real time. It provides a widget-based user interface and fast visual response which allows scientists to interactively explore their data sets. VIS-5D generates literal and intuitive depictions of data, has user controls that are data oriented rather than graphics oriented, and provides a WYSIWYG (what-you-see-is-what-you-get) response. The result is a system that enables scientists to produce and direct their own animations.&lt;&lt;ETX&gt;&gt;",William L. Hibbard;David A. Santek,B. Hibbard;D. Santek,"Space Sci. & Eng. Center, Wisconsin Univ., Madison, WI, USA;Space Sci. & Eng. Center, Wisconsin Univ., Madison, WI, USA",,,68,27,2,
Vis,1992,Approximation and rendering of volume data using wavelet transforms,10.1109/VISUAL.1992.235230,http://dx.doi.org/10.1109/VISUAL.1992.235230,21,28,C,"A method is presented to obtain a unique shape description of an object by using wavelet transforms. Wavelet transform is a signal analysis technique which decomposes a signal using a family of functions having a local property in both time and frequency domains. A multiresolution expression of 3D volume data was first obtained by applying 3D orthogonal wavelet transforms, with the shape then being approximated with a relatively small number of 3D orthogonal functions using only the significant functions. In addition, the resolution of the approximation can be varied point by point using the local property of the wavelets. The method is applied to real volume data, i.e. facial range data and MR images of a human head, and typical results are shown.&lt;&lt;ETX&gt;&gt;",Shigeru Muraki,S. Muraki,"Image Understanding Section, Electrotech. Lab., Tsukuba, Japan",,,68,32,17,
Vis,1999,Image graphs-a novel approach to visual data exploration,10.1109/VISUAL.1999.809871,http://dx.doi.org/10.1109/VISUAL.1999.809871,81,88,C,"For types of data visualization where the cost of producing images is high, and the relationship between the rendering parameters and the image produced is less than obvious, a visual representation of the exploration process can make the process more efficient and effective. Image graphs represent not only the results but also the process of data visualization. Each node in an image graph consists of an image and the corresponding visualization parameters used to produce it. Each edge in a graph shows the change in rendering parameters between the two nodes it connects. Image graphs are not just static representations; users can interact with a graph to review a previous visualization session or to perform new rendering. Operations which cause changes in rendering parameters can propagate through the graph. The user can take advantage of the information in image graphs to understand how certain parameter changes affect visualization results. Users can also share image graphs to streamline the process of collaborative visualization. We have implemented a volume visualization system using the image graph interface, and the examples presented come from this application.",Kwan-Liu Ma,Kwan-Liu Ma,"California Univ., Davis, CA, USA",10.1109/VISUAL.1995.480821;10.1109/VISUAL.1996.568113,"knowledge representations, scientific visualization, visualization systems, volume rendering",68,29,13,
Vis,2000,H-BLOB: a hierarchical visual clustering method using implicit surfaces,10.1109/VISUAL.2000.885677,http://dx.doi.org/10.1109/VISUAL.2000.885677,61,68,C,"We present a new hierarchical clustering and visualization algorithm called H-BLOB, which groups and visualizes cluster hierarchies at multiple levels-of-detail. Our method is fundamentally different to conventional clustering algorithms, such as C-means, K-means, or linkage methods that are primarily designed to partition a collection of objects into subsets sharing similar attributes. These approaches usually lack an efficient level-of-detail strategy that breaks down the visual complexity of very large datasets for visualization. In contrast, our method combines grouping and visualization in a two stage process constructing a hierarchical setting. In the first stage a cluster tree is computed making use of an edge contraction operator. Exploiting the inherent hierarchical structure of this tree, a second stage visualizes the clusters by computing a hierarchy of implicit surfaces. We believe that H-BLOB is especially suited for the visualization of very large datasets and for visual decision making in information visualization. The versatility of the algorithm is demonstrated using examples from visual data mining.",Thomas C. Sprenger;R. Brunella;Markus H. Gross,T.C. Sprenger;R. Brunella;M.H. Gross,"Dept. of Comput. Sci., Swiss Fed. Inst. of Technol., Zurich, Switzerland",10.1109/INFVIS.1997.636759;10.1109/INFVIS.1995.528691;10.1109/INFVIS.1998.729562,"clustering, categorization, partitioning, information visualization, non-linear dimensionality reduction, physics-based graph layout, cluster visualization, multidimensional information visualization",68,26,25,
Vis,2002,Volume clipping via per-fragment operations in texture-based volume visualization,10.1109/VISUAL.2002.1183762,http://dx.doi.org/10.1109/VISUAL.2002.1183762,93,100,C,"We propose new clipping methods that are capable of using complex geometries for volume clipping. The clipping tests exploit per-fragment operations on the graphics hardware to achieve high frame rates. In combination with texture-based volume rendering, these techniques enable the user to interactively select and explore regions of the data set. We present depth-based clipping techniques that analyze the depth structure of the boundary representation of the clip geometry to decide which parts of the volume have to be clipped. In another approach, a voxelized clip object is used to identify the clipped regions.",Daniel Weiskopf;Klaus Engel;Thomas Ertl,D. Weiskopf;K. Engel;T. Ertl,"Visualization & Interactive Syst. Group, Stuttgart Univ., Germany;Visualization & Interactive Syst. Group, Stuttgart Univ., Germany;Visualization & Interactive Syst. Group, Stuttgart Univ., Germany",10.1109/VISUAL.1999.809892;10.1109/VISUAL.2001.964519;10.1109/VISUAL.1999.809884,"volume rendering, clipping, hardware acceleration",68,17,17,
Vis,2006,Dynamic View Selection for Time-Varying Volumes,10.1109/TVCG.2006.137,http://dx.doi.org/10.1109/TVCG.2006.137,1109,1116,J,"Animation is an effective way to show how time-varying phenomena evolve over time. A key issue of generating a good animation is to select ideal views through which the user can perceive the maximum amount of information from the time-varying dataset. In this paper, we first propose an improved view selection method for static data. The method measures the quality of a static view by analyzing the opacity, color and curvature distributions of the corresponding volume rendering images from the given view. Our view selection metric prefers an even opacity distribution with a larger projection area, a larger area of salient features' colors with an even distribution among the salient features, and more perceived curvatures. We use this static view selection method and a dynamic programming approach to select time-varying views. The time-varying view selection maximizes the information perceived from the time-varying dataset based on the constraints that the time-varying view should show smooth changes of direction and near-constant speed. We also introduce a method that allows the user to generate a smooth transition between any two views in a given time step, with the perceived information maximized as well. By combining the static and dynamic view selection methods, the users are able to generate a time-varying view that shows the maximum amount of information from a time-varying data set",Guangfeng Ji;Han-Wei Shen,Guangfeng Ji;Han-wei Shen,,10.1109/VISUAL.2003.1250414;10.1109/VISUAL.1996.567807;10.1109/VISUAL.1999.809893;10.1109/INFVIS.2003.1249004;10.1109/VISUAL.2005.1532834;10.1109/VISUAL.2005.1532857;10.1109/VISUAL.2005.1532833;10.1109/VISUAL.2002.1183785;10.1109/VISUAL.2003.1250402,"Static view selection, image based method, dynamic view selection, information entropy, optimization",68,48,30,
Vis,2007,Visual Analysis of the Air Pollution Problem in Hong Kong,10.1109/TVCG.2007.70523,http://dx.doi.org/10.1109/TVCG.2007.70523,1408,1415,J,"We present a comprehensive system for weather data visualization. Weather data are multivariate and contain vector fields formed by wind speed and direction. Several well-established visualization techniques such as parallel coordinates and polar systems are integrated into our system. We also develop various novel methods, including circular pixel bar charts embedded into polar systems, enhanced parallel coordinates with S-shape axis, and weighted complete graphs. Our system was used to analyze the air pollution problem in Hong Kong and some interesting patterns have been found.",Huamin Qu;Wing-Yi Chan;Anbang Xu;Kai-Lun Chung;Alexis Kai-Hon Lau;Ping Guo 0002,Huamin Qu;Wing-Yi Chan;Anbang Xu;Kai-Lun Chung;Kai-Hon Lau;Ping Guo,Hong Kong University of Science and Technology;Beijing Normal University;Beijing Normal University;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Beijing Normal University;Beijing Normal University;Beijing Normal University;Beijing Normal University;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Beijing Normal University;Beijing Normal University,10.1109/VISUAL.2000.885745;10.1109/VISUAL.1990.146402;10.1109/VISUAL.2000.885736;10.1109/INFVIS.2003.1249015;10.1109/TVCG.2006.165,"Weather data visualization, polar system, parallel coordinates, air pollution, visual analytics",68,65,23,
Vis,2007,Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions,10.1109/TVCG.2007.70552,http://dx.doi.org/10.1109/TVCG.2007.70552,1440,1447,J,"The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and their importance. We present an algorithm that constructs the Morse-Smale complex in a series of sweeps through the data, identifying various components of the complex in a consistent manner. All components of the complex, both geometric and topological, are computed, providing a complete decomposition of the domain. Efficiency is maintained by representing the geometry of the complex in terms of point sets.",Attila Gyulassy;Vijay Natarajan;Valerio Pascucci;Bernd Hamann,Attila Gyulassy;Vijay Natarajan;Valerio Pascucci;Bernd Hamann,"Institute for Data Analysis and Visualization, Dept. of Computer Science, University of California, Davis;Dept. of Computer Science and Automation, Supercomputer Education and Research Centre, Indian Institute of Science, Bangalore;Center for Applied Scientific Computing, Lawrence Livermore National Laboratory;Institute for Data Analysis and Visualization, Dept. of Computer Science, University of California, Davis",10.1109/VISUAL.2004.96;10.1109/VISUAL.2000.885680;10.1109/VISUAL.1998.745329;10.1109/VISUAL.1998.745312;10.1109/VISUAL.2005.1532839;10.1109/VISUAL.2000.885703,"Morse theory, Morse-Smale complexes, computational topology, multiresolution, simplification, feature detection, 3D scalar fields",68,57,30,
Vis,2009,An interactive visualization tool for multi-channel confocal microscopy data in neurobiology research,10.1109/TVCG.2009.118,http://dx.doi.org/10.1109/TVCG.2009.118,1489,1496,J,"Confocal microscopy is widely used in neurobiology for studying the three-dimensional structure of the nervous system. Confocal image data are often multi-channel, with each channel resulting from a different fluorescent dye or fluorescent protein; one channel may have dense data, while another has sparse; and there are often structures at several spatial scales: subneuronal domains, neurons, and large groups of neurons (brain regions). Even qualitative analysis can therefore require visualization using techniques and parameters fine-tuned to a particular dataset. Despite the plethora of volume rendering techniques that have been available for many years, the techniques standardly used in neurobiological research are somewhat rudimentary, such as looking at image slices or maximal intensity projections. Thus there is a real demand from neurobiologists, and biologists in general, for a flexible visualization tool that allows interactive visualization of multi-channel confocal data, with rapid fine-tuning of parameters to reveal the three-dimensional relationships of structures of interest. Together with neurobiologists, we have designed such a tool, choosing visualization methods to suit the characteristics of confocal data and a typical biologist's workflow. We use interactive volume rendering with intuitive settings for multidimensional transfer functions, multiple render modes and multi-views for multi-channel volume data, and embedding of polygon data into volume data for rendering and editing. As an example, we apply this tool to visualize confocal microscopy datasets of the developing zebrafish visual system.",Yong Wan;Hideo Otsuna;Chi-Bin Chien;Charles D. Hansen,Yong Wan;Hideo Otsuna;Chi-Bin Chien;Charles Hansen,Scientific and Imaging Institute at University of Utah;Department of Neurobiology and Anatomy at University of Utah;Department of Neurobiology and Anatomy at University of Utah;Scientific and Imaging Institute at University of Utah,10.1109/VISUAL.1999.809887;10.1109/TVCG.2006.148,"Visualization, neurobiology, confocal microscopy, qualitative analysis, volume rendering",68,70,26,
Vis,2010,Computing Robustness and Persistence for Images,10.1109/TVCG.2010.139,http://dx.doi.org/10.1109/TVCG.2010.139,1251,1260,J,"We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to a continuous function, we study the robustness of homology classes in its level and interlevel sets, that is, the amount of perturbation needed to destroy these classes. The structure of the homology classes and their robustness, over all level and interlevel sets, can be visualized by a triangular diagram of dots obtained by computing the extended persistence of the function. We give a fast hierarchical algorithm using the dual complexes of oct-tree approximations of the function. In addition, we show that for balanced oct-trees, the dual complexes are geometrically realized in R&lt;sup&gt;3&lt;/sup&gt; and can thus be used to construct level and interlevel sets. We apply these tools to study 3-dimensional images of plant root systems.",Paul Bendich;Herbert Edelsbrunner;Michael Kerber,Paul Bendich;Herbert Edelsbrunner;Michael Kerber,,10.1109/VISUAL.1997.663875,"Voxel arrays, oct-trees, persistent homology, persistence diagrams, level sets, robustness, approximations, plant roots",68,48,20,
Vis,2010,Superquadric Glyphs for Symmetric Second-Order Tensors,10.1109/TVCG.2010.199,http://dx.doi.org/10.1109/TVCG.2010.199,1595,1604,J,"Symmetric second-order tensor fields play a central role in scientific and biomedical studies as well as in image analysis and feature-extraction methods. The utility of displaying tensor field samples has driven the development of visualization techniques that encode the tensor shape and orientation into the geometry of a tensor glyph. With some exceptions, these methods work only for positive-definite tensors (i.e. having positive eigenvalues, such as diffusion tensors). We expand the scope of tensor glyphs to all symmetric second-order tensors in two and three dimensions, gracefully and unambiguously depicting any combination of positive and negative eigenvalues. We generalize a previous method of superquadric glyphs for positive-definite tensors by drawing upon a larger portion of the superquadric shape space, supplemented with a coloring that indicates the tensor's quadratic form. We show that encoding arbitrary eigenvalue sign combinations requires design choices that differ fundamentally from those in previous work on traceless tensors (arising in the study of liquid crystals). Our method starts with a design of 2-D tensor glyphs guided by principles of symmetry and continuity, and creates 3-D glyphs that include the 2-D glyphs in their axis-aligned cross-sections. A key ingredient of our method is a novel way of mapping from the shape space of three-dimensional symmetric second-order tensors to the unit square. We apply our new glyphs to stress tensors from mechanics, geometry tensors and Hessians from image analysis, and rate-of-deformation tensors in computational fluid dynamics.",Thomas Schultz 0001;Gordon L. Kindlmann,Thomas Schultz;Gordon L. Kindlmann,"Computer Science Department and the Computation Institute, University of Chicago;Computer Science Department and the Computation Institute, University of Chicago",10.1109/VISUAL.1999.809905;10.1109/TVCG.2006.134;10.1109/VISUAL.1998.745294;10.1109/TVCG.2006.181;10.1109/VISUAL.1991.175773;10.1109/TVCG.2009.184;10.1109/TVCG.2006.182;10.1109/TVCG.2009.177;10.1109/TVCG.2010.166;10.1109/VISUAL.1993.398849;10.1109/VISUAL.2003.1250414;10.1109/VISUAL.1994.346326;10.1109/VISUAL.1997.663929;10.1109/VISUAL.2002.1183797;10.1109/VISUAL.2003.1250376;10.1109/VISUAL.2005.1532774;10.1109/VISUAL.2004.80;10.1109/TVCG.2006.115,"Tensor Glyphs, Stress Tensors, Rate-of-Deformation Tensors, Geometry Tensors, Glyph Design",68,70,61,
InfoVis,2013,SoccerStories: A Kick-off for Visual Soccer Analysis,10.1109/TVCG.2013.192,http://dx.doi.org/10.1109/TVCG.2013.192,2506,2515,J,"This article presents SoccerStories, a visualization interface to support analysts in exploring soccer data and communicating interesting insights. Currently, most analyses on such data relate to statistics on individual players or teams. However, soccer analysts we collaborated with consider that quantitative analysis alone does not convey the right picture of the game, as context, player positions and phases of player actions are the most relevant aspects. We designed SoccerStories to support the current practice of soccer analysts and to enrich it, both in the analysis and communication stages. Our system provides an overview+detail interface of game phases, and their aggregation into a series of connected visualizations, each visualization being tailored for actions such as a series of passes or a goal attempt. To evaluate our tool, we ran two qualitative user studies on recent games using SoccerStories with data from one of the world's leading live sports data providers. The first study resulted in a series of four articles on soccer tactics, by a tactics analyst, who said he would not have been able to write these otherwise. The second study consisted in an exploratory follow-up to investigate design alternatives for embedding soccer phases into word-sized graphics. For both experiments, we received a very enthusiastic feedback and participants consider further use of SoccerStories to enhance their current workflow.",Charles Perin;Romain Vuillemot;Jean-Daniel Fekete,Charles Perin;Romain Vuillemot;Jean-Daniel Fekete,INRIA and Universite Paris-Sud;INRIA;INRIA,10.1109/TVCG.2007.70582;10.1109/TVCG.2011.169;10.1109/TVCG.2011.185;10.1109/TVCG.2012.263,"Visual knowledge discovery, visual knowledge representation, sport analytics, visual aggregation",68,73,26,HM
VAST,2015,"The Role of Uncertainty, Awareness, and Trust in Visual Analytics",10.1109/TVCG.2015.2467591,http://dx.doi.org/10.1109/TVCG.2015.2467591,240,249,J,"Visual analytics supports humans in generating knowledge from large and often complex datasets. Evidence is collected, collated and cross-linked with our existing knowledge. In the process, a myriad of analytical and visualisation techniques are employed to generate a visual representation of the data. These often introduce their own uncertainties, in addition to the ones inherent in the data, and these propagated and compounded uncertainties can result in impaired decision making. The user's confidence or trust in the results depends on the extent of user's awareness of the underlying uncertainties generated on the system side. This paper unpacks the uncertainties that propagate through visual analytics systems, illustrates how human's perceptual and cognitive biases influence the user's awareness of such uncertainties, and how this affects the user's trust building. The knowledge generation model for visual analytics is used to provide a terminology and framework to discuss the consequences of these aspects in knowledge construction and though examples, machine uncertainty is compared to human trust measures with provenance. Furthermore, guidelines for the design of uncertainty-aware systems are presented that can aid the user in better decision making.",Dominik Sacha;Hansi Senaratne;Bum Chul Kwon;Geoffrey P. Ellis;Daniel A. Keim,Dominik Sacha;Hansi Senaratne;Bum Chul Kwon;Geoffrey Ellis;Daniel A. Keim,Data Analysis and Visualisation Group;Data Analysis and Visualisation Group;Data Analysis and Visualisation Group;Data Analysis and Visualisation Group;Data Analysis and Visualisation Group,10.1109/TVCG.2014.2346575;10.1109/VISUAL.2000.885679;10.1109/VAST.2008.4677385;10.1109/VAST.2009.5332611;10.1109/TVCG.2012.260;10.1109/VAST.2011.6102473;10.1109/VAST.2009.5333020;10.1109/VAST.2011.6102435;10.1109/TVCG.2012.279;10.1109/TVCG.2014.2346481;10.1109/VAST.2006.261416,"Visual Analytics, Knowledge Generation, Uncertainty Measures and Propagation, Trust Building, Human Factors",68,69,83,
VAST,2015,MobilityGraphs: Visual Analysis of Mass Mobility Dynamics via Spatio-Temporal Graphs and Clustering,10.1109/TVCG.2015.2468111,http://dx.doi.org/10.1109/TVCG.2015.2468111,11,20,J,"Learning more about people mobility is an important task for official decision makers and urban planners. Mobility data sets characterize the variation of the presence of people in different places over time as well as movements (or flows) of people between the places. The analysis of mobility data is challenging due to the need to analyze and compare spatial situations (i.e., presence and flows of people at certain time moments) and to gain an understanding of the spatio-temporal changes (variations of situations over time). Traditional flow visualizations usually fail due to massive clutter. Modern approaches offer limited support for investigating the complex variation of the movements over longer time periods. We propose a visual analytics methodology that solves these issues by combined spatial and temporal simplifications. We have developed a graph-based method, called MobilityGraphs, which reveals movement patterns that were occluded in flow maps. Our method enables the visual representation of the spatio-temporal variation of movements for long time series of spatial situations originally containing a large number of intersecting flows. The interactive system supports data exploration from various perspectives and at various levels of detail by interactive setting of clustering parameters. The feasibility our approach was tested on aggregated mobility data derived from a set of geolocated Twitter posts within the Greater London city area and mobile phone call data records in Abidjan, Ivory Coast. We could show that MobilityGraphs support the identification of regular daily and weekly movement patterns of resident population.",Tatiana von Landesberger;Felix Brodkorb;Philipp Roskosch;Natalia V. Andrienko;Gennady L. Andrienko;Andreas Kerren,Tatiana von Landesberger;Felix Brodkorb;Philipp Roskosch;Natalia Andrienko;Gennady Andrienko;Andreas Kerren,"Technical University of Darmstadt, Germany;Technical University of Darmstadt, Germany;Technical University of Darmstadt, Germany;Fraunhofer IAIS, Bonn, Germany;Fraunhofer IAIS, Bonn, Germany;Fraunhofer IAIS, Bonn, Germany",10.1109/TVCG.2011.202;10.1109/TVCG.2011.226;10.1109/TVCG.2011.233;10.1109/INFVIS.2004.18;10.1109/TVCG.2009.143;10.1109/TVCG.2014.2346271;10.1109/TVCG.2008.125;10.1109/TVCG.2014.2346441;10.1109/INFVIS.1999.801851;10.1109/VAST.2012.6400553;10.1109/VAST.2009.5333893;10.1109/INFVIS.2005.1532150,"Visual analytics, movement data, networks, graphs, temporal aggregation, spatial aggregation, flows, clustering",68,92,56,
VAST,2017,ActiVis: Visual Exploration of Industry-Scale Deep Neural Network Models,10.1109/TVCG.2017.2744718,http://dx.doi.org/10.1109/TVCG.2017.2744718,88,97,J,"While deep learning models have achieved state-of-the-art accuracies for many prediction tasks, understanding these models remains a challenge. Despite the recent interest in developing visual tools to help users interpret deep learning models, the complexity and wide variety of models deployed in industry, and the large-scale datasets that they used, pose unique design challenges that are inadequately addressed by existing work. Through participatory design sessions with over 15 researchers and engineers at Facebook, we have developed, deployed, and iteratively improved ActiVis, an interactive visualization system for interpreting large-scale deep learning models and results. By tightly integrating multiple coordinated views, such as a computation graph overview of the model architecture, and a neuron activation view for pattern discovery and comparison, users can explore complex deep neural network models at both the instance-and subset-level. ActiVis has been deployed on Facebook's machine learning platform. We present case studies with Facebook researchers and engineers, and usage scenarios of how ActiVis may work with different models.",Minsuk Kahng;Pierre Y. Andrews;Aditya Kalro;Duen Horng Chau,Minsuk Kahng;Pierre Y. Andrews;Aditya Kalro;Duen Horng (Polo) Chau,Georgia Institute of Technology;Facebook;Facebook;Georgia Institute of Technology,10.1109/VAST.2015.7347637;10.1109/VAST.2010.5652443;10.1109/TVCG.2013.157;10.1109/TVCG.2014.2346482;10.1109/TVCG.2015.2467622;10.1109/TVCG.2016.2598831;10.1109/TVCG.2016.2598838;10.1109/TVCG.2016.2598828;10.1109/VISUAL.2005.1532820;10.1109/VAST.2011.6102453,"Visual analytics,deep learning,machine learning,information visualization",68,51,38,
Vis,1993,Fast volume rendering of compressed data,10.1109/VISUAL.1993.398845,http://dx.doi.org/10.1109/VISUAL.1993.398845,11,18,C,"Volume rendering has been proposed as a useful tool for extracting information from large datasets, where non-visual analysis alone may not be feasible. The scale of these applications implies that data management is an important issue that needs to be addressed. Most volume rendering algorithms, however, process data in raw, uncompressed form. In previous work, we introduced a compressed volume format that may be volume rendered directly with minimal impact on rendering time. In this paper, we extend these ideas to a new volume format that not only reduces storage space and transmission time, but is designed for fast volume rendering as well. The volume dataset is represented as indices into a small codebook of representative blocks. With the data structure, volume shading calculations need only be performed on the codebook and image generation is accelerated by reusing precomputed block projections.&lt;&lt;ETX&gt;&gt;",Paul Ning;Lambertus Hesselink,P. Ning;L. Hesselink,"Dept. of Electr. Eng., Stanford Univ., CA, USA;Dept. of Electr. Eng., Stanford Univ., CA, USA",10.1109/VISUAL.1991.175778,,67,29,22,
Vis,1994,VolVis: a diversified volume visualization system,10.1109/VISUAL.1994.346340,http://dx.doi.org/10.1109/VISUAL.1994.346340,31,"38, C3",C,"VolVis is a diversified, easy to use, extensible, high performance, and portable volume visualization system for scientists and engineers as well as for visualization developers and researchers. VolVis accepts as input 3D scalar volumetric data as well as 3D volume-sampled and classical geometric models. Interaction with the data is controlled by a variety of 3D input devices in an input device-independent environment. VolVis output includes navigation preview, static images, and animation sequences. A variety of volume rendering algorithms are supported ranging from fast rough approximations, to compression-domain rendering, to accurate volumetric ray tracing and radiosity, and irregular grid rendering.&lt;&lt;ETX&gt;&gt;",Ricardo S. Avila;Taosong He;Lichan Hong;Arie E. Kaufman;Hanspeter Pfister;Cláudio T. Silva;Lisa M. Sobierajski;Sidney W. Wang,R. Avila;Taosong He;Lichan Hong;A. Kaufman;H. Pfister;C. Silva;L. Sobierajski;S. Wang,"Howard Hughes Med. Inst., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1992.235231;10.1109/VISUAL.1993.398862;10.1109/VISUAL.1993.398854;10.1109/VISUAL.1990.146391,,67,32,15,
Vis,1998,Visualization of scalar topology for structural enhancement,10.1109/VISUAL.1998.745284,http://dx.doi.org/10.1109/VISUAL.1998.745284,51,58,C,"Scalar fields arise in every scientific application. Existing scalar visualization techniques require that the user infers the global scalar structure from what is frequently an insufficient display of information. We present a visualization technique which numerically detects the structure at all scales, removing from the user the responsibility of extracting information implicit in the data, and presenting the structure explicitly for analysis. We further demonstrate how scalar topology detection proves useful for correct visualization and image processing applications such as image co-registration, isocontouring, and mesh compression.",Chandrajit L. Bajaj;Valerio Pascucci;Daniel Schikore,C.L. Bajaj;V. Pascucci;D.R. Schikore,"Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",10.1109/VISUAL.1992.235199;10.1109/VISUAL.1995.480803;10.1109/VISUAL.1991.175782;10.1109/VISUAL.1995.485154;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1997.663875;10.1109/VISUAL.1994.346334;10.1109/VISUAL.1995.480795,"Scientific Visualization, Scalar Fields, Curves and Surfaces, Vector Topology",67,21,31,
Vis,1998,Tracking scalar features in unstructured datasets,10.1109/VISUAL.1998.745288,http://dx.doi.org/10.1109/VISUAL.1998.745288,79,86,C,"3D time-varying unstructured and structured data sets are difficult to visualize and analyze because of the immense amount of data involved. These data sets contain many evolving amorphous regions, and standard visualization techniques provide no facilities to aid the scientist to follow regions of interest. In this paper, we present a basic framework for the visualization of time-varying data sets, and a new algorithm and data structure to track volume features in unstructured scalar data sets. The algorithm and data structure are general and can be used for structured, curvilinear, adaptive and hybrid grids as well. The features tracked can be any type of connected regions. Examples are shown from ongoing research.",Deborah Silver;Xin Wang,D. Silver;X. Wang,"Dept. of Electr. & Comput. Eng., Rutgers Univ., Piscataway, NJ, USA",10.1109/VISUAL.1996.567807;10.1109/VISUAL.1995.480809;10.1109/VISUAL.1995.480789;10.1109/VISUAL.1997.663886,"Scientific Visualization, Time-varying Visualization,Feature Tracking, Computer Vision, CFD",67,32,33,
Vis,2004,TexMol: interactive visual exploration of large flexible multi-component molecular complexes,10.1109/VISUAL.2004.103,http://dx.doi.org/10.1109/VISUAL.2004.103,243,250,C,"While molecular visualization software has advanced over the years, today, most tools still operate on individual molecular structures with limited facility to manipulate large multicomponent complexes. We approach this problem by extending 3D image-based rendering via programmable graphics units, resulting in an order of magnitude speedup over traditional triangle-based rendering. By incorporating a biochemically sensitive level-of-detail hierarchy into our molecular representation, we communicate appropriate volume occupancy and shape while dramatically reducing the visual clutter that normally inhibits higher-level spatial comprehension. Our hierarchical, image based rendering also allows dynamically computed physical properties data (e.g. electrostatics potential) to be mapped onto the molecular surface, tying molecular structure to molecular function. Finally, we present another approach to interactive molecular exploration using volumetric and structural rendering in tandem to discover molecular properties that neither rendering mode alone could reveal. These visualization techniques are realized in a high-performance, interactive molecular exploration tool we call TexMol, short for Texture Molecular viewer.",Chandrajit L. Bajaj;Peter Djeu;Vinay Siddavanahalli;Anthony Thane,Chandrajit Bajaj;P. Djeu;Vinay Siddavanahalli;A. Thane,"Center for Computational Visualization, Texas Univ., Austin, TX, USA;Center for Computational Visualization, Texas Univ., Austin, TX, USA;Center for Computational Visualization, Texas Univ., Austin, TX, USA;Center for Computational Visualization, Texas Univ., Austin, TX, USA",10.1109/VISUAL.1993.398882;10.1109/VISUAL.1998.745320,"molecular visualization, image-based rendering, texture-based rendering, imposter rendering, volume rendering, programmable graphics hardware, level-of-detail, hierarchy, multiresolution, synchronous view, computer graphics",67,16,31,
InfoVis,2005,Visual correlation for situational awareness,10.1109/INFVIS.2005.1532134,http://dx.doi.org/10.1109/INFVIS.2005.1532134,95,102,C,"We present a novel visual correlation paradigm for situational awareness (SA) and suggest its usage in a diverse set of applications that require a high level of SA. Our approach is based on a concise and scalable representation, which leads to a flexible visualization tool that is both clear and intuitive to use. Situational awareness is the continuous extraction of environmental information, its integration with previous knowledge to form a coherent mental picture, and the use of that picture in anticipating future events. In this paper we build on our previous work on visualization for network intrusion detection and show how that approach can be generalized to encompass a much broader class of SA systems. We first propose a generalization that is based on what we term, the w/sup 3/ premise, namely that each event must have at least the what, when and where attributes. We also present a second generalization, which increases flexibility and facilitates complex visual correlations. Finally, we demonstrate the generality of our approaches by applying our visualization paradigm in a collection of diverse SA areas.",Yarden Livnat;James Agutter;Shaun Moon;Stefano Foresti,Y. Livnat;J. Agutter;Shaun Moon;S. Foresti,"Sci. Comput. & Imaging Inst., Utah Univ., USA",10.1109/VISUAL.2003.1250415,"situation awareness, network intrusion, visualization",67,24,19,
InfoVis,2008,On the Visualization of Social and other Scale-Free Networks,10.1109/TVCG.2008.151,http://dx.doi.org/10.1109/TVCG.2008.151,1285,1292,J,"This paper proposes novel methods for visualizing specifically the large power-law graphs that arise in sociology and the sciences. In such cases a large portion of edges can be shown to be less important and removed while preserving component connectedness and other features (e.g. cliques) to more clearly reveal the networkpsilas underlying connection pathways. This simplification approach deterministically filters (instead of clustering) the graph to retain important node and edge semantics, and works both automatically and interactively. The improved graph filtering and layout is combined with a novel computer graphics anisotropic shading of the dense crisscrossing array of edges to yield a full social network and scale-free graph visualization system. Both quantitative analysis and visual results demonstrate the effectiveness of this approach.",Yuntao Jia;Jared Hoberock;Michael Garland;John C. Hart,Yuntao Jia;Jared Hoberock;Michael Garland;John Hart,UIUC;UIUC;NVIDIA;UIUC,10.1109/VISUAL.2005.1532819;10.1109/TVCG.2006.193;10.1109/INFVIS.2003.1249011,"Scale-free network, edge filtering, betweenness centrality, anisotropic shading",67,42,32,
InfoVis,2008,Perceptual Organization in User-Generated Graph Layouts,10.1109/TVCG.2008.155,http://dx.doi.org/10.1109/TVCG.2008.155,1333,1339,J,"Many graph layout algorithms optimize visual characteristics to achieve useful representations. Implicitly, their goal is to create visual representations that are more intuitive to human observers. In this paper, we asked users to explicitly manipulate nodes in a network diagram to create layouts that they felt best captured the relationships in the data. This allowed us to measure organizational behavior directly, allowing us to evaluate the perceptual importance of particular visual features, such as edge crossings and edge-lengths uniformity. We also manipulated the interior structure of the node relationships by designing data sets that contained clusters, that is, sets of nodes that are strongly interconnected. By varying the degree to which these clusters were ldquomaskedrdquo by extraneous edges we were able to measure observerspsila sensitivity to the existence of clusters and how they revealed them in the network diagram. Based on these measurements we found that observers are able to recover cluster structure, that the distance between clusters is inversely related to the strength of the clustering, and that users exhibit the tendency to use edges to visually delineate perceptual groups. These results demonstrate the role of perceptual organization in representing graph data and provide concrete recommendations for graph layout algorithms.",Frank van Ham;Bernice E. Rogowitz,Frank van Ham;Bernice Rogowitz,IBM Research;IBM Research,10.1109/INFVIS.2004.1;10.1109/TVCG.2007.70577,"Network layout visualization, perceptual organization, graph layout, user studies",67,48,22,
InfoVis,2009,A Comparison of User-Generated and Automatic Graph Layouts,10.1109/TVCG.2009.109,http://dx.doi.org/10.1109/TVCG.2009.109,961,968,J,"The research presented in this paper compares user-generated and automatic graph layouts. Following the methods suggested by van Ham et al. (2008), a group of users generated graph layouts using both multi-touch interaction on a tabletop display and mouse interaction on a desktop computer. Users were asked to optimize their layout for aesthetics and analytical tasks with a social network. We discuss characteristics of the user-generated layouts and interaction methods employed by users in this process. We then report on a web-based study to compare these layouts with the output of popular automatic layout algorithms. Our results demonstrate that the best of the user-generated layouts performed as well as or better than the physics-based layout. Orthogonal and circular automatic layouts were found to be considerably less effective than either the physics-based layout or the best of the user-generated layouts. We highlight several attributes of the various layouts that led to high accuracy and improved task completion time, as well as aspects in which traditional automatic layout methods were unsuccessful for our tasks.",Tim Dwyer;Bongshin Lee;Danyel Fisher;Kori Inkpen Quinn;Petra Isenberg;George G. Robertson;Chris North 0001,Tim Dwyer;Bongshin Lee;Danyel Fisher;Kori Inkpen Quinn;Petra Isenberg;George Robertson;Chris North,Microsoft Research;Microsoft Research;Microsoft Research;Microsoft Research;University of Calgary;Microsoft Research;Virginia Tech,10.1109/TVCG.2008.155,"Graph layout, network layout, automatic layout algorithms, user-generated layout, graph-drawing aesthetics",67,49,19,
VAST,2013,A Partition-Based Framework for Building and Validating Regression Models,10.1109/TVCG.2013.125,http://dx.doi.org/10.1109/TVCG.2013.125,1962,1971,J,"Regression models play a key role in many application domains for analyzing or predicting a quantitative dependent variable based on one or more independent variables. Automated approaches for building regression models are typically limited with respect to incorporating domain knowledge in the process of selecting input variables (also known as feature subset selection). Other limitations include the identification of local structures, transformations, and interactions between variables. The contribution of this paper is a framework for building regression models addressing these limitations. The framework combines a qualitative analysis of relationship structures by visualization and a quantification of relevance for ranking any number of features and pairs of features which may be categorical or continuous. A central aspect is the local approximation of the conditional target distribution by partitioning 1D and 2D feature domains into disjoint regions. This enables a visual investigation of local patterns and largely avoids structural assumptions for the quantitative ranking. We describe how the framework supports different tasks in model building (e.g., validation and comparison), and we present an interactive workflow for feature subset selection. A real-world case study illustrates the step-wise identification of a five-dimensional model for natural gas consumption. We also report feedback from domain experts after two months of deployment in the energy sector, indicating a significant effort reduction for building and improving regression models.",Thomas Mühlbacher;Harald Piringer,Thomas Mühlbacher;Harald Piringer,VRVis Research Center;VRVis Research Center,10.1109/TVCG.2012.219;10.1109/TVCG.2009.128;10.1109/VISUAL.1993.398859;10.1109/VAST.2012.6400486;10.1109/VAST.2011.6102453;10.1109/VAST.2009.5333431;10.1109/TVCG.2010.213;10.1109/TVCG.2012.205;10.1109/VAST.2009.5332628;10.1109/VISUAL.1990.146402;10.1109/VAST.2011.6102450;10.1109/VAST.2008.4677368;10.1109/VAST.2010.5652460;10.1109/TVCG.2011.248;10.1109/INFVIS.2005.1532142;10.1109/VAST.2007.4388999;10.1109/INFVIS.2004.10;10.1109/TVCG.2009.110;10.1109/VAST.2011.6102448;10.1109/INFVIS.2004.3,"Regression, model building, visual knowledge discovery, feature selection, data partitioning, guided visualization",67,62,50,BP
InfoVis,2014,Ranking Visualizations of Correlation Using Weber's Law,10.1109/TVCG.2014.2346979,http://dx.doi.org/10.1109/TVCG.2014.2346979,1943,1952,J,"Despite years of research yielding systems and guidelines to aid visualization design, practitioners still face the challenge of identifying the best visualization for a given dataset and task. One promising approach to circumvent this problem is to leverage perceptual laws to quantitatively evaluate the effectiveness of a visualization design. Following previously established methodologies, we conduct a large scale (n = 1687) crowdsourced experiment to investigate whether the perception of correlation in nine commonly used visualizations can be modeled using Weber's law. The results of this experiment contribute to our understanding of information visualization by establishing that: (1) for all tested visualizations, the precision of correlation judgment could be modeled by Weber's law, (2) correlation judgment precision showed striking variation between negatively and positively correlated data, and (3) Weber models provide a concise means to quantify, compare, and rank the perceptual precision afforded by a visualization.",Lane Harrison;Fumeng Yang;Steven Franconeri;Remco Chang,Lane Harrison;Fumeng Yang;Steven Franconeri;Remco Chang,Tufts University;Tufts University;Northwestern University;Tufts University,10.1109/TVCG.2013.187;10.1109/TVCG.2009.111;10.1109/TVCG.2007.70594,"Perception, Visualization, Evaluation",67,66,24,
VAST,2014,DecisionFlow: Visual Analytics for High-Dimensional Temporal Event Sequence Data,10.1109/TVCG.2014.2346682,http://dx.doi.org/10.1109/TVCG.2014.2346682,1783,1792,J,"Temporal event sequence data is increasingly commonplace, with applications ranging from electronic medical records to financial transactions to social media activity. Previously developed techniques have focused on low-dimensional datasets (e.g., with less than 20 distinct event types). Real-world datasets are often far more complex. This paper describes DecisionFlow, a visual analysis technique designed to support the analysis of high-dimensional temporal event sequence data (e.g., thousands of event types). DecisionFlow combines a scalable and dynamic temporal event data structure with interactive multi-view visualizations and ad hoc statistical analytics. We provide a detailed review of our methods, and present the results from a 12-person user study. The study results demonstrate that DecisionFlow enables the quick and accurate completion of a range of sequence analysis tasks for datasets containing thousands of event types and millions of individual events.",David Gotz;Harry Stavropoulos,David Gotz;Harry Stavropoulos,University of North Carolina at Chapel Hill;IBM T.J. Watson Research Center,10.1109/TVCG.2013.206;10.1109/TVCG.2012.225;10.1109/TVCG.2011.179;10.1109/INFVIS.2000.885097;10.1109/VAST.2009.5332595;10.1109/VAST.2010.5652890;10.1109/TVCG.2009.117;10.1109/VAST.2006.261421;10.1109/TVCG.2013.200,"Information Visualization, Temporal Event Sequences, Visual Analytics, Flow Diagrams, Medical Informatics",67,74,34,
InfoVis,1999,Navigating hierarchies with structure-based brushes,10.1109/INFVIS.1999.801858,http://dx.doi.org/10.1109/INFVIS.1999.801858,58,"64, 146",C,"Interactive selection is a critical component in exploratory visualization, allowing users to isolate subsets of the displayed information for highlighting, deleting, analysis, or focussed investigation. Brushing, a popular method for implementing the selection process, has traditionally been performed in either screen space or data space. We introduce the concept of a structure-based brush, which can be used to perform selection in hierarchically structured data sets. Our structure-based brush allows users to navigate hierarchies by specifying focal extents and level-of-detail on a visual representation of the structure. Proximity-based coloring, which maps similar colors to data that are closely related within the structure, helps convey both structural relationships and anomalies. We describe the design and implementation of our structure-based brushing tool. We also validate its usefulness using two distinct hierarchical visualization techniques, namely hierarchical parallel coordinates and tree-maps.",Ying-Huey Fua;Matthew O. Ward;Elke A. Rundensteiner,Ying-Huey Fua;M.O. Ward;E.A. Rundensteiner,"Dept. of Comput. Sci., Worcester Polytech. Inst., MA, USA",10.1109/VISUAL.1990.146402;10.1109/INFVIS.1996.559216;10.1109/VISUAL.1995.485139;10.1109/VISUAL.1994.346302;10.1109/VISUAL.1999.809866;10.1109/VISUAL.1996.567800;10.1109/VISUAL.1991.175815;10.1109/INFVIS.1998.729555,"Brushing, hierarchical representation, interactive selection, exploratory data analysis",66,12,17,
Vis,1999,Isosurface extraction in time-varying fields using a Temporal Branch-on-Need Tree (T-BON),10.1109/VISUAL.1999.809879,http://dx.doi.org/10.1109/VISUAL.1999.809879,147,520,C,"The Temporal Branch-on-Need Tree (T-BON) extends the three dimensional branch-on-need octree for time-varying isosurface extraction. At each time step, only those portions of the tree and data necessary to construct the current isosurface are read from disk. This algorithm can thus exploit the temporal locality of the isosurface and, as a geometric technique, spatial locality between cells in order to improve performance. Experimental results demonstrate the performance gained and memory overhead saved using this technique.",Philip M. Sutton;Charles D. Hansen,P. Sutton;C.D. Hansen,"Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.1998.745343;10.1109/VISUAL.1996.568121;10.1109/VISUAL.1998.745299;10.1109/VISUAL.1998.745298;10.1109/VISUAL.1997.663895;10.1109/VISUAL.1997.663888;10.1109/VISUAL.1996.568133;10.1109/VISUAL.1996.568123;10.1109/VISUAL.1998.745350;10.1109/VISUAL.1998.745311;10.1109/VISUAL.1995.485154;10.1109/VISUAL.1997.663913,"isosurface, time-dependent scalar field visualization, multiresolution methods, octree",66,30,22,
InfoVis,2002,Visualizing data with bounded uncertainty,10.1109/INFVIS.2002.1173145,http://dx.doi.org/10.1109/INFVIS.2002.1173145,37,40,C,"Visualization is a powerful way to facilitate data analysis, but it is crucial that visualization systems explicitly convey the presence, nature, and degree of uncertainty to users. Otherwise, there is a danger that data will be falsely interpreted, potentially leading to inaccurate conclusions. A common method for denoting uncertainty is to use error bars or similar techniques designed to convey the degree of statistical uncertainty. While uncertainty can often be modeled statistically, a second form of uncertainty, bounded uncertainty, can also arise that has very different properties than statistical uncertainty. Error bars should not be used for bounded uncertainty because they do not convey the correct properties, so a different technique should be used instead. We describe a technique for conveying bounded uncertainty in visualizations and show how it can be applied systematically to common displays of abstract charts and graphs. Interestingly, it is not always possible to show the exact degree of uncertainty, and in some cases it can only be displayed approximately.",Christopher Olston;Jock D. Mackinlay,C. Olston;J.D. Mackinlay,"Stanford Univ., CA, USA",10.1109/VISUAL.1994.346317;10.1109/VISUAL.2000.885679;10.1109/INFVIS.1999.801858,"uncertainty visualization, bounded uncertainty",66,29,17,
InfoVis,2004,RecMap: Rectangular Map Approximations,10.1109/INFVIS.2004.57,http://dx.doi.org/10.1109/INFVIS.2004.57,33,40,C,"In many application domains, data is collected and referenced by its geospatial location. Nowadays, different kinds of maps are used to emphasize the spatial distribution of one or more geospatial attributes. The nature of geospatial statistical data is the highly nonuniform distribution in the real world data sets. This has several impacts on the resulting map visualizations. Classical area maps tend to highlight patterns in large areas, which may, however, be of low importance. Cartographers and geographers used cartograms or value-by-area maps to address this problem long before computers were available. Although many automatic techniques have been developed, most of the value-by-area cartograms are generated manually via human interaction. In this paper, we propose a novel visualization technique for geospatial data sets called RecMap. Our technique approximates a rectangular partition of the (rectangular) display area into a number of map regions preserving important geospatial constraints. It is a fully automatic technique with explicit user control over all exploration constraints within the exploration process. Experiments show that our technique produces visualizations of geospatial data sets, which enhance the discovery of global and local correlations, and demonstrate its performance in a variety of applications",Roland Heilmann;Daniel A. Keim;Christian Panse;Mike Sips,R. Heilmann;D.A. Keim;C. Panse;M. Sips,Bayer Technology,10.1109/VISUAL.1998.745303;10.1109/VISUAL.1991.175815;10.1109/INFVIS.2002.1173144,"Geographic Visualization, Information Visualization, Database and Data Mining Visualization",66,29,13,
Vis,2004,Quick-VDR: interactive view-dependent rendering of massive models,10.1109/VISUAL.2004.86,http://dx.doi.org/10.1109/VISUAL.2004.86,131,138,C,"We present a novel approach for interactive view-dependent rendering of massive models. Our algorithm combines view-dependent simplification, occlusion culling, and out-of-core rendering. We represent the model as a clustered hierarchy of progressive meshes (CHPM). We use the cluster hierarchy for coarse-grained selective refinement and progressive meshes for fine-grained local refinement. We present an out-of-core algorithm for computation of a CHPM that includes cluster decomposition, hierarchy generation, and simplification. We make use of novel cluster dependencies in preprocess to generate crack-free, drastic simplifications at runtime. The clusters are used for occlusion culling and out-of-core rendering. We add a frame of latency to the rendering pipeline to fetch newly visible clusters from the disk and to avoid stalls. The CHPM reduces the refinement cost for view-dependent rendering by more than an order of magnitude as compared to a vertex hierarchy. We have implemented our algorithm on a desktop PC. We can render massive CAD, isosurface, and scanned models, consisting of tens or a few hundreds of millions of triangles at 10-35 frames per second with little loss in image quality.",Sung-Eui Yoon;Brian Salomon;Russell Gayle;Dinesh Manocha,Sung-Eui Yoon;B. Salomon;R. Gayle;D. Manocha,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.2002.1183760;10.1109/VISUAL.2003.1250366;10.1109/VISUAL.2001.964503;10.1109/VISUAL.2002.1183796;10.1109/VISUAL.1998.745282;10.1109/VISUAL.2001.964534;10.1109/VISUAL.2003.1250368;10.1109/VISUAL.2001.964502,"Interactive display, view-dependent rendering, occlusion culling, external-memory algorithm, levels-of-detail",66,15,37,
Vis,2004,Real-time motion estimation and visualization on graphics cards,10.1109/VISUAL.2004.88,http://dx.doi.org/10.1109/VISUAL.2004.88,545,552,C,"We present a tool for real-time visualization of motion features in 2D image sequences. The motion is estimated through an eigenvector analysis of the spatio-temporal structure tensor at every pixel location. This approach is computationally demanding but allows reliable velocity estimates as well as quality indicators for the obtained results. We use a 2D color map and a region of interest selector for the visualization of the velocities. On the selected velocities we apply a hierarchical smoothing scheme which allows the choice of the desired scale of the motion field. We demonstrate several examples of test sequences in which some persons are moving with different velocities than others. These persons are visually marked in the real-time display of the image sequence. The tool is also applied to angiography sequences to emphasize the blood flow and its distribution. An efficient processing of the data streams is achieved by mapping the operations onto the stream architecture of standard graphics cards. The card receives the images and performs both the motion estimation and visualization, taking advantage of the parallelism in the graphics processor and the superior memory bandwidth. The integration of data processing and visualization also saves on unnecessary data transfers and thus allows the real-time analysis of 320/spl times/240 images. We expect that on the newest generation of graphics hardware our tool could run in real time for the standard VGA format.",Robert Strzodka;Christoph S. Garbe,R. Strzodka;C. Garbe,"Caesar Res. Center, Bonn, Germany",10.1109/VISUAL.1999.809934;10.1109/VISUAL.2003.1250361;10.1109/VISUAL.2003.1250401;10.1109/VISUAL.2003.1250357,"motion estimation, motion visualization, structure tensor, eigenvector analysis, real-time processing, graphics hardware",66,28,44,
Vis,2005,Batched multi triangulation,10.1109/VISUAL.2005.1532797,http://dx.doi.org/10.1109/VISUAL.2005.1532797,207,214,C,"The multi triangulation framework (MT) is a very general approach for managing adaptive resolution in triangle meshes. The key idea is arranging mesh fragments at different resolution in a directed acyclic graph (DAG) which encodes the dependencies between fragments, thereby encompassing a wide class of multiresolution approaches that use hierarchies or DAGs with predefined topology. On current architectures, the classic MT is however unfit for real-time rendering, since DAG traversal costs vastly dominate raw rendering costs. In this paper, we redesign the MT framework in a GPU friendly fashion, moving its granularity from triangles to precomputed optimized triangle patches. The patches can be conveniently tri-stripped and stored in secondary memory to be loaded on demand, ready to be sent to the GPU using preferential paths. In this manner, central memory only contains the DAG structure and CPU workload becomes negligible. The major contributions of this work are: a new out-of-core multiresolution framework, that, just like the MT, encompasses a wide class of multiresolution structures; a robust and elegant way to build a well conditioned MT DAG by introducing the concept of V-partitions, that can encompass various state of the art multiresolution algorithms; an efficient multithreaded rendering engine and a general subsystem for the external memory processing and simplification of huge meshes.",Paolo Cignoni;Fabio Ganovelli;Enrico Gobbetti;Fabio Marton;Federico Ponchio;Roberto Scopigno,P. Cignoni;F. Ganovelli;E. Gobbetti;F. Marton;F. Ponchio;R. Scopigno,"ISTI, CNR, Italy;ISTI, CNR, Italy;ISTI, CNR, Italy;ISTI, CNR, Italy;ISTI, CNR, Italy;ISTI, CNR, Italy",10.1109/VISUAL.1997.663860;10.1109/VISUAL.2002.1183783;10.1109/VISUAL.1998.745282;10.1109/VISUAL.1996.567600;10.1109/VISUAL.2002.1183796;10.1109/VISUAL.2004.86,,66,10,25,
InfoVis,2009,Document Cards: A Top Trumps Visualization for Documents,10.1109/TVCG.2009.139,http://dx.doi.org/10.1109/TVCG.2009.139,1145,1152,J,"Finding suitable, less space consuming views for a document's main content is crucial to provide convenient access to large document collections on display devices of different size. We present a novel compact visualization which represents the document's key semantic as a mixture of images and important key terms, similar to cards in a top trumps game. The key terms are extracted using an advanced text mining approach based on a fully automatic document structure extraction. The images and their captions are extracted using a graphical heuristic and the captions are used for a semi-semantic image weighting. Furthermore, we use the image color histogram for classification and show at least one representative from each non-empty image class. The approach is demonstrated for the IEEE InfoVis publications of a complete year. The method can easily be applied to other publication collections and sets of documents which contain images.",Hendrik Strobelt;Daniela Oelke;Christian Rohrdantz;Andreas Stoffel;Daniel A. Keim;Oliver Deussen,Hendrik Strobelt;Daniela Oelke;Christian Rohrdantz;Andreas Stoffel;Daniel A. Keim;Oliver Deussen,University of Konstanz;University of Konstanz;University of Konstanz;University of Konstanz;University of Konstanz;University of Konstanz,,"document visualization, visual summary, content extraction, document collection browsing",66,47,37,
VAST,2009,Finding comparable temporal categorical records: A similarity measure with an interactive visualization,10.1109/VAST.2009.5332595,http://dx.doi.org/10.1109/VAST.2009.5332595,27,34,C,"An increasing number of temporal categorical databases are being collected: Electronic Health Records in healthcare organizations, traffic incident logs in transportation systems, or student records in universities. Finding similar records within these large databases requires effective similarity measures that capture the searcher's intent. Many similarity measures exist for numerical time series, but temporal categorical records are different. We propose a temporal categorical similarity measure, the M&amp;M (Match &amp; Mismatch) measure, which is based on the concept of aligning records by sentinel events, then matching events between the target and the compared records. The M&amp;M measure combines the time differences between pairs of events and the number of mismatches. To accom-modate customization of parameters in the M&amp;M measure and results interpretation, we implemented Similan, an interactive search and visualization tool for temporal categorical records. A usability study with 8 participants demonstrated that Similan was easy to learn and enabled them to find similar records, but users had difficulty understanding the M&amp;M measure. The usability study feedback, led to an improved version with a continuous timeline, which was tested in a pilot study with 5 participants.",Krist Wongsuphasawat;Ben Shneiderman,Krist Wongsuphasawat;Ben Shneiderman,"Department of Computer Science & Human-Computer Interaction Lab, University of Maryland, College Park, 20742, USA;Department of Computer Science & Human-Computer Interaction Lab, University of Maryland, College Park, 20742, USA",10.1109/VAST.2006.261421,"Similan, M&M Measure, Similarity Search, Temporal Categorical Records",66,45,27,
InfoVis,2010,Declarative Language Design for Interactive Visualization,10.1109/TVCG.2010.144,http://dx.doi.org/10.1109/TVCG.2010.144,1149,1156,J,"We investigate the design of declarative, domain-specific languages for constructing interactive visualizations. By separating specification from execution, declarative languages can simplify development, enable unobtrusive optimization, and support retargeting across platforms. We describe the design of the Protovis specification language and its implementation within an object-oriented, statically-typed programming language (Java). We demonstrate how to support rich visualizations without requiring a toolkit-specific data model and extend Protovis to enable declarative specification of animated transitions. To support cross-platform deployment, we introduce rendering and event-handling infrastructures decoupled from the runtime platform, letting designers retarget visualization specifications (e.g., from desktop to mobile phone) with reduced effort. We also explore optimizations such as runtime compilation of visualization specifications, parallelized execution, and hardware-accelerated rendering. We present benchmark studies measuring the performance gains provided by these optimizations and compare performance to existing Java-based visualization tools, demonstrating scalability improvements exceeding an order of magnitude.",Jeffrey Heer;Michael Bostock,Jeffrey Heer;Michael Bostock,,10.1109/TVCG.2009.174;10.1109/TVCG.2006.178;10.1109/INFVIS.2004.12;10.1109/TVCG.2007.70577;10.1109/TVCG.2009.128;10.1109/VISUAL.1992.235219;10.1109/TVCG.2009.191;10.1109/TVCG.2009.110;10.1109/TVCG.2007.70539;10.1109/INFVIS.2004.64;10.1109/INFVIS.2000.885086,"Information visualization, user interfaces, toolkits, domain specific languages, declarative languages, optimization",66,48,25,HM
InfoVis,2010,The FlowVizMenu and Parallel Scatterplot Matrix: Hybrid Multidimensional Visualizations for Network Exploration,10.1109/TVCG.2010.205,http://dx.doi.org/10.1109/TVCG.2010.205,1100,1108,J,"A standard approach for visualizing multivariate networks is to use one or more multidimensional views (for example, scatterplots) for selecting nodes by various metrics, possibly coordinated with a node-link view of the network. In this paper, we present three novel approaches for achieving a tighter integration of these views through hybrid techniques for multidimensional visualization, graph selection and layout. First, we present the FlowVizMenu, a radial menu containing a scatterplot that can be popped up transiently and manipulated with rapid, fluid gestures to select and modify the axes of its scatterplot. Second, the FlowVizMenu can be used to steer an attribute-driven layout of the network, causing certain nodes of a node-link diagram to move toward their corresponding positions in a scatterplot while others can be positioned manually or by force-directed layout. Third, we describe a novel hybrid approach that combines a scatterplot matrix (SPLOM) and parallel coordinates called the Parallel Scatterplot Matrix (P-SPLOM), which can be used to visualize and select features within the network. We also describe a novel arrangement of scatterplots called the Scatterplot Staircase (SPLOS) that requires less space than a traditional scatterplot matrix. Initial user feedback is reported.",Christophe Viau;Michael J. McGuffin;Yves Chiricota;Igor Jurisica,Christophe Viau;Michael J. McGuffin;Yves Chiricota;Igor Jurisica,&#x0C9;cole de technologie sup&#x0E9;rieure;&#x0C9;cole de technologie sup&#x0E9;rieure;Universit&#x0E9; du Qu&#x0E9;bec &#x0E0; Chicoutimi;Ontario Cancer Institute,10.1109/TVCG.2009.151;10.1109/INFVIS.2005.1532142;10.1109/TVCG.2007.70523;10.1109/TVCG.2009.179;10.1109/VAST.2009.5332586;10.1109/INFVIS.2005.1532141;10.1109/TVCG.2006.187;10.1109/INFVIS.2004.47;10.1109/TVCG.2007.70521;10.1109/INFVIS.2003.1249011;10.1109/TVCG.2008.153,"Interactive graph drawing, network layout, attribute-driven layout, parallel coordinates, scatterplot matrix, radial menu",66,43,39,
InfoVis,2012,Evaluating Sketchiness as a Visual Variable for the Depiction of Qualitative Uncertainty,10.1109/TVCG.2012.220,http://dx.doi.org/10.1109/TVCG.2012.220,2769,2778,J,"We report on results of a series of user studies on the perception of four visual variables that are commonly used in the literature to depict uncertainty. To the best of our knowledge, we provide the first formal evaluation of the use of these variables to facilitate an easier reading of uncertainty in visualizations that rely on line graphical primitives. In addition to blur, dashing and grayscale, we investigate the use of `sketchiness' as a visual variable because it conveys visual impreciseness that may be associated with data quality. Inspired by work in non-photorealistic rendering and by the features of hand-drawn lines, we generate line trajectories that resemble hand-drawn strokes of various levels of proficiency-ranging from child to adult strokes-where the amount of perturbations in the line corresponds to the level of uncertainty in the data. Our results show that sketchiness is a viable alternative for the visualization of uncertainty in lines and is as intuitive as blur; although people subjectively prefer dashing style over blur, grayscale and sketchiness. We discuss advantages and limitations of each technique and conclude with design considerations on how to deploy these visual variables to effectively depict various levels of uncertainty for line marks.",Nadia Boukhelifa;Anastasia Bezerianos;Tobias Isenberg 0001;Jean-Daniel Fekete,Nadia Boukhelifa;Anastasia Bezerianos;Tobias Isenberg;Jean-Daniel Fekete,INRIA;LRI;DIGITEO/CNRS/INRIA;INRIA,10.1109/VISUAL.2005.1532853;10.1109/VISUAL.1992.235199;10.1109/TVCG.2007.70530;10.1109/TVCG.2009.114;10.1109/VAST.2009.5332611;10.1109/VAST.2006.261424;10.1109/TVCG.2012.262;10.1109/TVCG.2007.70589;10.1109/VISUAL.2000.885679,"Uncertainty visualization, qualitative evaluation, quantitative evaluation, perception",66,50,57,
InfoVis,2013,An Empirically-Derived Taxonomy of Interaction Primitives for Interactive Cartography and Geovisualization,10.1109/TVCG.2013.130,http://dx.doi.org/10.1109/TVCG.2013.130,2356,2365,J,"Proposals to establish a 'science of interaction' have been forwarded from Information Visualization and Visual Analytics, as well as Cartography, Geovisualization, and GIScience. This paper reports on two studies to contribute to this call for an interaction science, with the goal of developing a functional taxonomy of interaction primitives for map-based visualization. A semi-structured interview study first was conducted with 21 expert interactive map users to understand the way in which map-based visualizations currently are employed. The interviews were transcribed and coded to identify statements representative of either the task the user wished to accomplish (i.e., objective primitives) or the interactive functionality included in the visualization to achieve this task (i.e., operator primitives). A card sorting study then was conducted with 15 expert interactive map designers to organize these example statements into logical structures based on their experience translating client requests into interaction designs. Example statements were supplemented with primitive definitions in the literature and were separated into two sorting exercises: objectives and operators. The objective sort suggested five objectives that increase in cognitive sophistication (identify, compare, rank, associate, &amp; delineate), but exhibited a large amount of variation across participants due to consideration of broader user goals (procure, predict, &amp; prescribe) and interaction operands (space-alone, attributes-in-space, &amp; space-in-time; elementary &amp; general). The operator sort suggested five enabling operators (import, export, save, edit, &amp; annotate) and twelve work operators (reexpress, arrange, sequence, resymbolize, overlay, pan, zoom, reproject, search, filter, retrieve, &amp; calculate). This taxonomy offers an empirically-derived and ecologically-valid structure to inform future research and design on interaction.",Robert E. Roth,Robert E. Roth,University of Wisconsin-Madison,10.1109/INFVIS.1996.559213;10.1109/TVCG.2007.70515;10.1109/VISUAL.1990.146375;10.1109/INFVIS.1998.729560;10.1109/INFVIS.2005.1532136;10.1109/VAST.2010.5653599;10.1109/INFVIS.2000.885092,"Science of interaction, interaction primitives, interactive maps, geovisualization, interaction techniques",66,65,79,
InfoVis,2014,How Hierarchical Topics Evolve in Large Text Corpora,10.1109/TVCG.2014.2346433,http://dx.doi.org/10.1109/TVCG.2014.2346433,2281,2290,J,"Using a sequence of topic trees to organize documents is a popular way to represent hierarchical and evolving topics in text corpora. However, following evolving topics in the context of topic trees remains difficult for users. To address this issue, we present an interactive visual text analysis approach to allow users to progressively explore and analyze the complex evolutionary patterns of hierarchical topics. The key idea behind our approach is to exploit a tree cut to approximate each tree and allow users to interactively modify the tree cuts based on their interests. In particular, we propose an incremental evolutionary tree cut algorithm with the goal of balancing 1) the fitness of each tree cut and the smoothness between adjacent tree cuts; 2) the historical and new information related to user interests. A time-based visualization is designed to illustrate the evolving topics over time. To preserve the mental map, we develop a stable layout algorithm. As a result, our approach can quickly guide users to progressively gain profound insights into evolving hierarchical topics. We evaluate the effectiveness of the proposed method on Amazon's Mechanical Turk and real-world news data. The results show that users are able to successfully analyze evolving topics in text data.",Weiwei Cui;Shixia Liu;Zhuofeng Wu 0002;Hao Wei,Weiwei Cui;Shixia Liu;Zhuofeng Wu;Hao Wei,Microsoft Research;Microsoft Research;Nankai University;Zhejiang University,10.1109/TVCG.2013.196;10.1109/TVCG.2009.108;10.1109/VAST.2014.7042494;10.1109/TVCG.2009.111;10.1109/TVCG.2011.239;10.1109/TVCG.2014.2346920;10.1109/TVCG.2012.212;10.1109/TVCG.2013.221;10.1109/TVCG.2012.225;10.1109/TVCG.2013.162;10.1109/TVCG.2013.200,"Hierarchical topic visualization, evolutionary tree clustering, data transformation",66,66,43,
InfoVis,2015,Beyond Memorability: Visualization Recognition and Recall,10.1109/TVCG.2015.2467732,http://dx.doi.org/10.1109/TVCG.2015.2467732,519,528,J,"In this paper we move beyond memorability and investigate how visualizations are recognized and recalled. For this study we labeled a dataset of 393 visualizations and analyzed the eye movements of 33 participants as well as thousands of participant-generated text descriptions of the visualizations. This allowed us to determine what components of a visualization attract people's attention, and what information is encoded into memory. Our findings quantitatively support many conventional qualitative design guidelines, including that (1) titles and supporting text should convey the message of a visualization, (2) if used appropriately, pictograms do not interfere with understanding and can improve recognition, and (3) redundancy helps effectively communicate the message. Importantly, we show that visualizations memorable “at-a-glance” are also capable of effectively conveying the message of the visualization. Thus, a memorable visualization is often also an effective one.",Michelle Borkin;Zoya Bylinskii;Nam Wook Kim;Constance May Bainbridge;Chelsea S. Yeh;Daniel Borkin;Hanspeter Pfister;Aude Oliva,Michelle A. Borkin;Zoya Bylinskii;Nam Wook Kim;Constance May Bainbridge;Chelsea S. Yeh;Daniel Borkin;Hanspeter Pfister;Aude Oliva,"University of British Columbia;Computer Science and Artificial Intelligence Laboratory (CSAIL), Massachusetts Institute of Technology (MIT);School of Engineering & Applied Sciences, Harvard University;Computer Science and Artificial Intelligence Laboratory (CSAIL), Massachusetts Institute of Technology (MIT);School of Engineering & Applied Sciences, Harvard University;University of Michigan;School of Engineering & Applied Sciences, Harvard University;Computer Science and Artificial Intelligence Laboratory (CSAIL), Massachusetts Institute of Technology (MIT)",10.1109/TVCG.2012.197;10.1109/TVCG.2013.234;10.1109/TVCG.2011.193;10.1109/TVCG.2012.233;10.1109/TVCG.2011.175;10.1109/TVCG.2013.234;10.1109/TVCG.2012.215;10.1109/VAST.2010.5653598;10.1109/TVCG.2012.245;10.1109/TVCG.2012.221,"Information visualization, memorability, recognition, recall, eye-tracking study",66,72,48,
Vis,1996,Temporal continuity of levels of detail in Delaunay triangulated terrain,10.1109/VISUAL.1996.567600,http://dx.doi.org/10.1109/VISUAL.1996.567600,37,42,C,"The representation of a scene at different levels of detail is necessary to achieve real-time rendering. In aerial views, only the part of the scene that is close to the viewing point needs to be displayed with a high level of detail, while more distant parts can be displayed with a low level of detail. However, when a sequence of images is generated and displayed in real-time, the transition between different levels of detail causes noticeable temporal aliasing. In this paper, we propose a method, based on object blending, that visually softens the transition between two levels of Delaunay triangulation. We present an algorithm that establishes, in an off-line process, a correspondence between two given polygonal objects. The correspondence enables on-line blending between two representations of an object, so that one representation (level of detail) progressively evolves into the other.",Daniel Cohen-Or;Yishay Levanoni,D. Cohen-Or;Y. Levanoni,"Sch. of Math. Sci., Tel Aviv Univ., Israel",,,65,26,18,
Vis,1996,Volume tracking,10.1109/VISUAL.1996.567807,http://dx.doi.org/10.1109/VISUAL.1996.567807,157,164,C,"3D time varying datasets are difficult to visualize and analyze because of the immense amount of data involved. This is especially true when the datasets are turbulent with many evolving amorphous regions, as it is difficult to observe patterns and follow regions of interest. We present our volume based feature tracking algorithm and discuss how it can be used to help visualize and analyze large time varying datasets. We also address efficiency issues in dealing with massive time varying datasets.",Deborah Silver;Xin Wang,D. Silver;X. Wang,"Dept. of Electr. & Comput. Eng., Rutgers Univ., Piscataway, NJ, USA",10.1109/VISUAL.1995.485141;10.1109/VISUAL.1995.480789,"Scientific Visualization, Multi-dimensional Visualization, Feature Tracking, Computer Vision, CFD",65,33,34,
Vis,2000,Visual cues for imminent object contact in realistic virtual environment,10.1109/VISUAL.2000.885692,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2000.885692,179,185,C,"Distance judgments are difficult in current virtual environments, limiting their effectiveness in conveying spatial information. This problem is apparent when contact occurs while a user is manipulating objects. In particular, the computer graphics used to support current-generation immersive interfaces does a poor job of providing the visual cues necessary to perceive when contact between objects is about to occur. This perception of imminent contact is important in human motor control. Its absence prevents a sense of naturalness in interactive displays which allow for object manipulation. This paper reports results from an experiment evaluating the effectiveness of binocular disparity, cast shadows and diffuse inter-reflections in signaling imminent contact in a manipulation task.",Helen H. Hu;Amy Ashurst Gooch;William B. Thompson;Brian E. Smits;John J. Rieser;Peter Shirley,H.H. Hu;A.A. Gooch;W.B. Thompson;B.E. Smits;J.J. Rieser;P. Shirley,"Sch. of Comput., Utah Univ., Salt Lake City, UT, USA",,"virtual reality, head mounted displays, human visual perception",65,15,0,
InfoVis,2001,Cluster stability and the use of noise in interpretation of clustering,10.1109/INFVIS.2001.963275,http://dx.doi.org/10.1109/INFVIS.2001.963275,23,30,C,,George S. Davidson;Brian N. Wylie;Kevin W. Boyack,G.S. Davidson;B.N. Wylie;K.W. Boyack,Sandia National Laboratories,10.1109/INFVIS.1995.528686,,65,16,19,
Vis,2006,Full Body Virtual Autopsies using a State-of-the-art Volume Rendering Pipeline,10.1109/TVCG.2006.146,http://dx.doi.org/10.1109/TVCG.2006.146,869,876,J,"This paper presents a procedure for virtual autopsies based on interactive 3D visualizations of large scale, high resolution data from CT-scans of human cadavers. The procedure is described using examples from forensic medicine and the added value and future potential of virtual autopsies is shown from a medical and forensic perspective. Based on the technical demands of the procedure state-of-the-art volume rendering techniques are applied and refined to enable real-time, full body virtual autopsies involving gigabyte sized data on standard GPUs. The techniques applied include transfer function based data reduction using level-of-detail selection and multi-resolution rendering techniques. The paper also describes a data management component for large, out-of-core data sets and an extension to the GPU-based raycaster for efficient dual TF rendering. Detailed benchmarks of the pipeline are presented using data sets from forensic cases",Patric Ljung;Calle Winskog;Anders Persson;Claes Lundström;Anders Ynnerman,Patric Ljung;Calle Winskog;Anders Persson;Claes Lundstrom;Anders Ynnerman,"Division for Visual Information Technology and Applications (VITA), Link¨oping University, Sweden;National Board of Forensic Medicine, Department of Forensic Medicine, Link¨oping, Sweden;Center for Medical Image Science and Visualization (CMIV), Link¨oping University, Sweden;Center for Medical Image Science and Visualization (CMIV), Link¨oping University, and Sectra-Imtec AB, Sweden;Division for Visual Information Technology and Applications (VITA), Link¨oping University, Sweden",10.1109/VISUAL.2002.1183757;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2005.1532794;10.1109/VISUAL.2003.1250391;10.1109/VISUAL.2005.1532799;10.1109/VISUAL.1999.809908,"Forensics, autopsies, medical visualization, volume rendering, large scale data",65,55,33,
Vis,2007,Segmentation of Three-dimensional Retinal Image Data,10.1109/TVCG.2007.70590,http://dx.doi.org/10.1109/TVCG.2007.70590,1719,1726,J,"We have combined methods from volume visualization and data analysis to support better diagnosis and treatment of human retinal diseases. Many diseases can be identified by abnormalities in the thicknesses of various retinal layers captured using optical coherence tomography (OCT). We used a support vector machine (SVM) to perform semi-automatic segmentation of retinal layers for subsequent analysis including a comparison of layer thicknesses to known healthy parameters. We have extended and generalized an older SVM approach to support better performance in a clinical setting through performance enhancements and graceful handling of inherent noise in OCT data by considering statistical characteristics at multiple levels of resolution. The addition of the multi-resolution hierarchy extends the SVM to have ""global awareness"". A feature, such as a retinal layer, can therefore be modeled within the SVM as a combination of statistical characteristics across all levels; thus capturing high- and low-frequency information. We have compared our semi-automatically generated segmentations to manually segmented layers for verification purposes. Our main goals were to provide a tool that could (i) be used in a clinical setting; (ii) operate on noisy OCT data; and (iii) isolate individual or multiple retinal layers in both healthy and disease cases that contain structural deformities.",Alfred R. Fuller;Robert Zawadzki;Stacey Choi;David F. Wiley;John S. Werner;Bernd Hamann,Alfred Fuller;Robert Zawadzki;Stacey Choi;David Wiley;John Werner;Bernd Hamann,,10.1109/VISUAL.2001.964519;10.1109/VISUAL.2003.1250413,"support vector machine, segmentation, image analysis, retinal, optical coherence tomography, volume visualization, image processing",65,53,26,
Vis,2009,Interactive Visualization of Molecular Surface Dynamics,10.1109/TVCG.2009.157,http://dx.doi.org/10.1109/TVCG.2009.157,1391,1398,J,"Molecular dynamics simulations of proteins play a growing role in various fields such as pharmaceutical, biochemical and medical research. Accordingly, the need for high quality visualization of these protein systems raises. Highly interactive visualization techniques are especially needed for the analysis of time-dependent molecular simulations. Beside various other molecular representations the surface representations are of high importance for these applications. So far, users had to accept a trade-off between rendering quality and performance - particularly when visualizing trajectories of time-dependent protein data. We present a new approach for visualizing the solvent excluded surface of proteins using a GPU ray casting technique and thus achieving interactive frame rates even for long protein trajectories where conventional methods based on precomputation are not applicable. Furthermore, we propose a semantic simplification of the raw protein data to reduce the visual complexity of the surface and thereby accelerate the rendering without impeding perception of the protein's basic shape. We also demonstrate the application of our solvent excluded surface method to visualize the spatial probability density for the protein atoms over the whole period of the trajectory in one frame, providing a qualitative analysis of the protein flexibility.",Michael Krone;Katrin Bidmon;Thomas Ertl,Michael Krone;Katrin Bidmon;Thomas Ertl,"VISUS, Universit&#x0E4;t Stuttgart;VISUS, Universit&#x0E4;t Stuttgart;VISUS, Universit&#x0E4;t Stuttgart",10.1109/VISUAL.2004.103;10.1109/TVCG.2006.115,"Point-based Data, Time-varying Data, GPU, Ray Casting, Molecular Visualization, Surface Extraction, Isosurfaces",65,59,42,HM
InfoVis,2014,Multivariate Network Exploration and Presentation: From Detail to Overview via Selections and Aggregations,10.1109/TVCG.2014.2346441,http://dx.doi.org/10.1109/TVCG.2014.2346441,2310,2319,J,"Network data is ubiquitous; e-mail traffic between persons, telecommunication, transport and financial networks are some examples. Often these networks are large and multivariate, besides the topological structure of the network, multivariate data on the nodes and links is available. Currently, exploration and analysis methods are focused on a single aspect; the network topology or the multivariate data. In addition, tools and techniques are highly domain specific and require expert knowledge. We focus on the non-expert user and propose a novel solution for multivariate network exploration and analysis that tightly couples structural and multivariate analysis. In short, we go from Detail to Overview via Selections and Aggregations (DOSA): users are enabled to gain insights through the creation of selections of interest (manually or automatically), and producing high-level, infographic-style overviews simultaneously. Finally, we present example explorations on real-world datasets that demonstrate the effectiveness of our method for the exploration and understanding of multivariate networks where presentation of findings comes for free.",Stef van den Elzen;Jarke J. van Wijk,Stef van den Elzen;Jarke J. van Wijk,"Department of Mathematic and Computer Science, Eindhoven University of Technology, The Netherlands;Department of Mathematic and Computer Science, Eindhoven University of Technology, The Netherlands",10.1109/VISUAL.1995.485139;10.1109/INFVIS.2003.1249008;10.1109/TVCG.2006.122;10.1109/TVCG.2009.145;10.1109/TVCG.2013.223;10.1109/VAST.2007.4389013;10.1109/VISUAL.1994.346302;10.1109/TVCG.2007.70589;10.1109/TVCG.2008.153;10.1109/TVCG.2009.108;10.1109/TVCG.2006.166;10.1109/TVCG.2006.147,"Multivariate Networks, Selections of Interest, Interaction, Direct Manipulation",65,61,47,BP
SciVis,2014,Curve Boxplot: Generalization of Boxplot for Ensembles of Curves,10.1109/TVCG.2014.2346455,http://dx.doi.org/10.1109/TVCG.2014.2346455,2654,2663,J,"In simulation science, computational scientists often study the behavior of their simulations by repeated solutions with variations in parameters and/or boundary values or initial conditions. Through such simulation ensembles, one can try to understand or quantify the variability or uncertainty in a solution as a function of the various inputs or model assumptions. In response to a growing interest in simulation ensembles, the visualization community has developed a suite of methods for allowing users to observe and understand the properties of these ensembles in an efficient and effective manner. An important aspect of visualizing simulations is the analysis of derived features, often represented as points, surfaces, or curves. In this paper, we present a novel, nonparametric method for summarizing ensembles of 2D and 3D curves. We propose an extension of a method from descriptive statistics, data depth, to curves. We also demonstrate a set of rendering and visualization strategies for showing rank statistics of an ensemble of curves, which is a generalization of traditional whisker plots or boxplots to multidimensional curves. Results are presented for applications in neuroimaging, hurricane forecasting and fluid dynamics.",Mahsa Mirzargar;Ross T. Whitaker;Robert Michael Kirby,Mahsa Mirzargar;Ross T. Whitaker;Robert M. Kirby,"Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, UT;Scientific Computing and Imaging Institute, Salt Lake City, UT;Scientific Computing and Imaging Institute, Salt Lake City, UT",10.1109/TVCG.2013.143;10.1109/VISUAL.2002.1183769;10.1109/VISUAL.1996.568116;10.1109/VISUAL.1996.568105;10.1109/TVCG.2013.141;10.1109/TVCG.2010.212;10.1109/TVCG.2013.126;10.1109/TVCG.2010.181,"Uncertainty visualization, boxplots, ensemble visualization, order statistics, data depth, nonparametric statistic, functional data, parametric curves",65,80,62,
VAST,2015,Reducing Snapshots to Points: A Visual Analytics Approach to Dynamic Network Exploration,10.1109/TVCG.2015.2468078,http://dx.doi.org/10.1109/TVCG.2015.2468078,1,10,J,"We propose a visual analytics approach for the exploration and analysis of dynamic networks. We consider snapshots of the network as points in high-dimensional space and project these to two dimensions for visualization and interaction using two juxtaposed views: one for showing a snapshot and one for showing the evolution of the network. With this approach users are enabled to detect stable states, recurring states, outlier topologies, and gain knowledge about the transitions between states and the network evolution in general. The components of our approach are discretization, vectorization and normalization, dimensionality reduction, and visualization and interaction, which are discussed in detail. The effectiveness of the approach is shown by applying it to artificial and real-world dynamic networks.",Stef van den Elzen;Danny Holten;Jorik Blaas;Jarke J. van Wijk,Stef van den Elzen;Danny Holten;Jorik Blaas;Jarke J. van Wijk,Eindhoven University of Technology;SynerScope B. V.;SynerScope B. V.;Eindhoven University of Technology,10.1109/TVCG.2011.226;10.1109/INFVIS.2004.18;10.1109/TVCG.2013.198;10.1109/TVCG.2006.147;10.1109/TVCG.2006.193;10.1109/TVCG.2008.125;10.1109/TVCG.2011.178;10.1109/INFVIS.1999.801851,"Dynamic Networks, Exploration, Dimensionality Reduction",65,68,63,BP
Vis,1991,Fast rotation of volume data on parallel architectures,10.1109/VISUAL.1991.175777,http://dx.doi.org/10.1109/VISUAL.1991.175777,50,"57, 409",C,"An algorithm for rendering of orthographic views of volume data on data-parallel computer architectures is described. In particular, the problem or rotating the volume in regard to the communication overhead associated with finely distributed memory is analyzed. An earlier technique (shear decomposition) is extended to 3D, and it is shown how this can be mapped onto a data-parallel architecture using only grid communication during the resampling associated with the rotation. The rendering uses efficient parallel computation constructs that allow one to use sophisticated shading models and still maintain high-speed throughout. This algorithm has been implemented on the connection machine and is used in an interactive volume-rendering application, with multiple frames-per-second performance.&lt;&lt;ETX&gt;&gt;",Peter Schröder;James B. Salem,P. Schroder;J.B. Salem,"Thinking Machines Corp., Cambridge, MA, USA;Thinking Machines Corp., Cambridge, MA, USA",,,64,26,24,
InfoVis,1996,Visualizing the global topology of the MBone,10.1109/INFVIS.1996.559226,http://dx.doi.org/10.1109/INFVIS.1996.559226,85,"92, 129",C,"We present a case study of visualizing the global topology of the Internet MBone. The MBone is the Internet's multicast backbone. Multicast is the most efficient way of distributing data from one sender to multiple receivers with minimal packet duplication. Developed and initially deployed by researchers within the Internet community, the MBone has been extremely popular for efficient transmission across the Internet of real-time video and audio streams such as conferences, meetings, congressional sessions, and NASA shuttle launches. The MBone, like the Internet itself grew exponentially with no central authority. The resulting suboptimal topology is of growing concern to network providers and the multicast research community. We create a geographic representation of the tunnel structure as arcs on a globe by resolving the latitude and longitude of MBone routers. The interactive 3D maps permit an immediate understanding of the global structure unavailable from the data in its original form as lines of text with only hostnames and IP addresses. Data visualization techniques such as grouping and thresholding allow further analysis of specific aspects of the MBone topology. We distribute the interactive 3D maps through the World-Wide Web using the VRML file format thus allowing network maintainers throughout the world to analyze the structure move effectively than would be possible with still pictures or pre-made videos.",Tamara Munzner;Eric Hoffman;Kimberly C. Claffy;Bill Fenner,T. Munzner;E. Hoffman;K. Claffy;B. Fenner,"Stanford Univ., CA, USA",10.1109/INFVIS.1995.528697,,64,32,12,
Vis,2000,Pen-and-ink rendering in volume visualisation,10.1109/VISUAL.2000.885696,http://dx.doi.org/10.1109/VISUAL.2000.885696,203,210,C,"Concerns the development of non-photorealistic rendering techniques for volume visualisation. In particular, we present two pen-and-ink rendering methods, a 3D method based on non-photorealistic solid textures, and a 2/sup +/D method that involves two rendering phases in the object space and the image space respectively. As both techniques utilize volume- and image-based data representations, they can be built upon a traditional volume rendering pipeline, and can be integrated with the photorealistic methods available in such a pipeline. We demonstrate that such an integration facilitates an effective mechanism for enhancing visualisation and its interpretation.",Steve M. F. Treavett;Min Chen 0001,S.M.F. Treavett;M. Chen,"Dept. of Comput. Sci., Univ. of Wales, Swansea, UK",10.1109/VISUAL.1996.568110,"Volume rendering, non-photorealistic rendering, pen-and-ink rendering, 3D texture mapping",64,24,35,
Vis,2000,Isosurfacing in higher dimensions,10.1109/VISUAL.2000.885704,http://dx.doi.org/10.1109/VISUAL.2000.885704,267,273,C,"Visualization algorithms have seen substantial improvements in the past several years. However, very few algorithms have been developed for directly studying data in dimensions higher than three. Most algorithms require a sampling in three-dimensions before applying any visualization algorithms. This sampling typically ignores vital features that may be present when examined in oblique cross-sections, and places an undo burden on system resources when animation through additional dimensions is desired. For time-varying data of large data sets, smooth animation is desired at interactive rates. We provide a fast Marching Cubes like algorithm for hypercubes of any dimension. To support this, we have developed a new algorithm to automatically generate the isosurface and triangulation tables for any dimension. This allows the efficient calculation of 4D isosurfaces, which can be interactively sliced to provide smooth animation or slicing through oblique hyperplanes. The former allows for smooth animation in a very compressed format. The latter provide better tools to study time-evolving features as they move downstream. We also provide examples in using this technique to show interval volumes or the sensitivity of a particular isovalue threshold.",Praveen Bhaniramka;Rephael Wenger;Roger Crawfis,P. Bhaniramka;R. Wenger;R. Crawfis,"Silicon Graphics Comput. Syst., Mountain View, CA, USA",10.1109/VISUAL.1992.235222;10.1109/VISUAL.1998.745315;10.1109/VISUAL.1993.398869;10.1109/VISUAL.1997.663885;10.1109/VISUAL.1999.809879;10.1109/VISUAL.1996.568103;10.1109/VISUAL.1997.663886;10.1109/VISUAL.1991.175821;10.1109/VISUAL.1991.175782;10.1109/VISUAL.1998.745298,,64,34,22,
Vis,2001,Fast detection of meaningful isosurfaces for volume data visualization,10.1109/VISUAL.2001.964515,http://dx.doi.org/10.1109/VISUAL.2001.964515,223,230,C,"Automatic detection of meaningful isosurfaces is important for producing informative visualizations of volume data, especially when no information about the data origin and imaging protocol is available. We propose a computationally efficient method for the automated detection of intensity transitions in volume data. In this approach, the dominant transitions correspond to clear maxima in cumulative Laplacian-weighted gray value histograms. Only one pass through the data volume is required to compute the histogram. Several other features which may be useful for exploration of data of unknown origin can be efficiently computed in a similar manner. The detected intensity transitions can be used for setting of visualization parameters for surface rendering, as well as for direct volume rendering of 3D datasets. When using surface rendering, the detected dominant intensity transition values correspond to the optimal surface isovalues for extraction of boundaries of the objects of interest. In direct volume rendering, such transitions are important for generation of the transfer functions, which are used to assign visualization properties to data voxels and determine the appearance of the rendered image. The proposed method is illustrated by examples with synthetic data as well as real biomedical datasets.",Vladimir Pekar;Rafael Wiemker;Daniel Bystrov,V. Pekar;R. Wiemker;D. Hempel,"Philips Res. Lab., Hamburg, Germany;Philips Res. Lab., Hamburg, Germany;Philips Res. Lab., Hamburg, Germany",10.1109/VISUAL.1995.480803;10.1109/VISUAL.1997.663875;10.1109/VISUAL.1996.568113,"Volume data visualization, surface rendering, volume rendering, isosurfaces, divergence theorem",64,28,13,
Vis,2001,An immersive virtual environment for DT-MRI volume visualization applications: a case study,10.1109/VISUAL.2001.964545,http://dx.doi.org/10.1109/VISUAL.2001.964545,437,440,C,"We describe a virtual reality environment for visualizing tensor-valued volumetric datasets acquired with diffusion tensor magnetic resonance imaging (DT-MRI). We have prototyped a virtual environment that displays geometric representations of the volumetric second-order diffusion tensor data and are developing interaction and visualization techniques for two application areas: studying changes in white-matter structures after gamma-knife capsulotomy and pre-operative planning for brain tumor surgery. Our feedback shows that compared to desktop displays, our system helps the user better interpret the large and complex geometric models, and facilitates communication among a group of users.",Song Zhang 0004;Çagatay Demiralp;Daniel F. Keefe;M. DaSilva;David H. Laidlaw;Benjamin D. Greenberg;Peter J. Basser;Carlo Pierpaoli;E. A. Chiocca;Thomas S. Deisboeck,S. Zhang;C. Demiralp;D.F. Keefe;M. DaSilva;D.H. Laidlaw;B.D. Greenberg;P.J. Basser;C. Pierpaoli;E.A. Chiocca;T.S. Deisboeck,,10.1109/VISUAL.1999.809894;10.1109/VISUAL.2000.885731;10.1109/VISUAL.1998.745336;10.1109/VISUAL.1999.809886,"Scientific Visualization, DT-MRI, Diffusion, Medical Imaging, Virtual Reality",64,36,14,
Vis,2002,Simulating fire with texture splats,10.1109/VISUAL.2002.1183779,http://dx.doi.org/10.1109/VISUAL.2002.1183779,227,234,C,"We propose the use of textured splats as the basic display primitives for an open surface fire model. The high-detail textures help to achieve a smooth boundary of the fire and gain the small-scale turbulence appearance. We utilize the Lattice Boltzmann Model (LBM) to simulate physically-based equations describing the fire evolution and its interaction with the environment (e.g., obstacles, wind and temperature). The property of fuel and non-burning objects are defined on the lattice of the computation domain. A temperature field is also incorporated to model the generation of smoke from the fire due to incomplete combustion. The linear and local characteristics of the LBM enable us to accelerate the computation with graphics hardware to reach real-time simulation speed, while the texture splat primitives enable interactive rendering frame rates.",Xiaoming Wei;Wei Li 0004;Klaus Mueller;Arie E. Kaufman,Xiaoming Wei;Wei Li;K. Mueller;A. Kaufman,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1993.398877,"Fire Modeling, Textured Splatting, Lattice Boltzmann Model, Graphics Hardware",64,9,23,
Vis,2005,Teniae coli guided navigation and registration for virtual colonoscopy,10.1109/VISUAL.2005.1532806,http://dx.doi.org/10.1109/VISUAL.2005.1532806,279,285,C,"We present a new method for guiding virtual colonoscopic navigation and registration by using teniae coli as anatomical landmarks. As most existing protocols require a patient to be scanned in both supine and prone positions to increase sensitivity in detecting colonic polyps, reference and registration between scans are necessary. However, the conventional centerline approach, generating only the longitudinal distance along the colon, lacks the necessary orientation information to synchronize the virtual navigation cameras in both scanned positions. In this paper we describe a semi-automatic method to detect teniae coli from a colonic surface model reconstructed from CT colonography. Teniae coli are three bands of longitudinal smooth muscle on the surface of the colon. They form a triple helix structure from the appendix to the sigmoid colon and are ideal references for virtual navigation. Our method was applied to 3 patients resulting in 6 data sets (supine and prone scans). The detected teniae coli matched well with our visual inspection. In addition, we demonstrate that polyps visible on both scans can be located and matched more efficiently with the aid of a teniae coli guided navigation implementation.",Adam Huang;Dave Roy;Marek Franaszek;Ronald M. Summers,A. Huang;D. Roy;M. Franaszek;R.M. Summers,"Diagnostic Radiol. Dept., Nat. Inst. of Health, Bethesda, MD, USA;Diagnostic Radiol. Dept., Nat. Inst. of Health, Bethesda, MD, USA;Diagnostic Radiol. Dept., Nat. Inst. of Health, Bethesda, MD, USA;Diagnostic Radiol. Dept., Nat. Inst. of Health, Bethesda, MD, USA",10.1109/VISUAL.2002.1183808;10.1109/VISUAL.2001.964540,"virtual colonoscopy, CT colonography, virtual endoscopy, camera control, computer-aided diagnosis, colon flattening, parameterization",64,6,20,
InfoVis,2006,Measuring Data Abstraction Quality in Multiresolution Visualizations,10.1109/TVCG.2006.161,http://dx.doi.org/10.1109/TVCG.2006.161,709,716,J,"Data abstraction techniques are widely used in multiresolution visualization systems to reduce visual clutter and facilitate analysis from overview to detail. However, analysts are usually unaware of how well the abstracted data represent the original dataset, which can impact the reliability of results gleaned from the abstractions. In this paper, we define two data abstraction quality measures for computing the degree to which the abstraction conveys the original dataset: the histogram difference measure and the nearest neighbor measure. They have been integrated within XmdvTool, a public-domain multiresolution visualization system for multivariate data analysis that supports sampling as well as clustering to simplify data. Several interactive operations are provided, including adjusting the data abstraction level, changing selected regions, and setting the acceptable data abstraction quality level. Conducting these operations, analysts can select an optimal data abstraction level. Also, analysts can compare different abstraction methods using the measures to see how well relative data density and outliers are maintained, and then select an abstraction method that meets the requirement of their analytic tasks",Qingguang Cui;Matthew O. Ward;Elke A. Rundensteiner;Jing Yang 0001,Qingguang Cui;Matthew Ward;Elke Rundensteiner;Jing Yang,"Worcester Polytechnic Institute, 100 Institute Road, Worcester, MA 01609;Worcester Polytechnic Institute, 100 Institute Road, Worcester, MA 01609;Worcester Polytechnic Institute, 100 Institute Road, Worcester, MA 01609;University of North Carolina at Charlotte, 9201 University City Blvd, Charlotte, NC 28223",10.1109/INFVIS.2004.19;10.1109/VISUAL.2005.1532819;10.1109/INFVIS.2004.15;10.1109/VISUAL.1995.485139;10.1109/INFVIS.2000.885088,"Metrics, Clustering, Sampling, Multiresolution Visualization",64,51,28,
Vis,2007,Semantic Layers for Illustrative Volume Rendering,10.1109/TVCG.2007.70591,http://dx.doi.org/10.1109/TVCG.2007.70591,1336,1343,J,"Direct volume rendering techniques map volumetric attributes (e.g., density, gradient magnitude, etc.) to visual styles. Commonly this mapping is specified by a transfer function. The specification of transfer functions is a complex task and requires expert knowledge about the underlying rendering technique. In the case of multiple volumetric attributes and multiple visual styles the specification of the multi-dimensional transfer function becomes more challenging and non-intuitive. We present a novel methodology for the specification of a mapping from several volumetric attributes to multiple illustrative visual styles. We introduce semantic layers that allow a domain expert to specify the mapping in the natural language of the domain. A semantic layer defines the mapping of volumetric attributes to one visual style. Volumetric attributes and visual styles are represented as fuzzy sets. The mapping is specified by rules that are evaluated with fuzzy logic arithmetics. The user specifies the fuzzy sets and the rules without special knowledge about the underlying rendering technique. Semantic layers allow for a linguistic specification of the mapping from attributes to visual styles replacing the traditional transfer function specification.",Peter Rautek;Stefan Bruckner;M. Eduard Gröller,Peter Rautek;Stefan Bruckner;Eduard Groller,"Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria",10.1109/VISUAL.2004.95;10.1109/VISUAL.2005.1532792;10.1109/VISUAL.2005.1532807;10.1109/VISUAL.2003.1250414;10.1109/VISUAL.2004.64;10.1109/VISUAL.2005.1532856;10.1109/TVCG.2006.164;10.1109/TVCG.2006.148,"Illustrative Visualization, Focus+Context Techniques, Volume Visualization",64,44,24,
Vis,2010,FI3D: Direct-Touch Interaction for the Exploration of 3D Scientific Visualization Spaces,10.1109/TVCG.2010.157,http://dx.doi.org/10.1109/TVCG.2010.157,1613,1622,J,"We present the design and evaluation of FI3D, a direct-touch data exploration technique for 3D visualization spaces. The exploration of three-dimensional data is core to many tasks and domains involving scientific visualizations. Thus, effective data navigation techniques are essential to enable comprehension, understanding, and analysis of the information space. While evidence exists that touch can provide higher-bandwidth input, somesthetic information that is valuable when interacting with virtual worlds, and awareness when working in collaboration, scientific data exploration in 3D poses unique challenges to the development of effective data manipulations. We present a technique that provides touch interaction with 3D scientific data spaces in 7 DOF. This interaction does not require the presence of dedicated objects to constrain the mapping, a design decision important for many scientific datasets such as particle simulations in astronomy or physics. We report on an evaluation that compares the technique to conventional mouse-based interaction. Our results show that touch interaction is competitive in interaction speed for translation and integrated interaction, is easy to learn and use, and is preferred for exploration and wayfinding tasks. To further explore the applicability of our basic technique for other types of scientific visualizations we present a second case study, adjusting the interaction to the illustrative visualization of fiber tracts of the brain and the manipulation of cutting planes in this context.",Lingyun Yu;Pjotr Svetachov;Petra Isenberg;Maarten H. Everts;Tobias Isenberg 0001,Lingyun Yu;Pjotr Svetachov;Petra Isenberg;Maarten H. Everts;Tobias Isenberg,University of Groningen;University of Groningen;INRIA;University of Groningen;University of Groningen,10.1109/VISUAL.2005.1532778;10.1109/TVCG.2007.70515;10.1109/VISUAL.2004.30,"Direct-touch interaction, wall displays, 3D navigation and exploration, evaluation, illustrative visualization",64,34,55,
Vis,2010,Two-Phase Mapping for Projecting Massive Data Sets,10.1109/TVCG.2010.207,http://dx.doi.org/10.1109/TVCG.2010.207,1281,1290,J,"Most multidimensional projection techniques rely on distance (dissimilarity) information between data instances to embed high-dimensional data into a visual space. When data are endowed with Cartesian coordinates, an extra computational effort is necessary to compute the needed distances, making multidimensional projection prohibitive in applications dealing with interactivity and massive data. The novel multidimensional projection technique proposed in this work, called Part-Linear Multidimensional Projection (PLMP), has been tailored to handle multivariate data represented in Cartesian high-dimensional spaces, requiring only distance information between pairs of representative samples. This characteristic renders PLMP faster than previous methods when processing large data sets while still being competitive in terms of precision. Moreover, knowing the range of variation for data instances in the high-dimensional space, we can make PLMP a truly streaming data projection technique, a trait absent in previous methods.",Fernando Vieira Paulovich;Cláudio T. Silva;Luis Gustavo Nonato,Fernando V. Paulovich;Claudio T. Silva;Luis G. Nonato,Universidade de S&#x0E3;o Paulo (USP);University of Utah;Universidade de S&#x0E3;o Paulo (USP),10.1109/INFVIS.2002.1173159;10.1109/VISUAL.1996.567787;10.1109/TVCG.2008.138;10.1109/TVCG.2009.131;10.1109/INFVIS.2004.60;10.1109/TVCG.2007.70580;10.1109/TVCG.2008.153;10.1109/INFVIS.2002.1173161,"Dimensionality Reduction,Projection Methods,Visual Data Mining,Streaming Technique",64,53,39,
Vis,2010,Visual Exploration of High Dimensional Scalar Functions,10.1109/TVCG.2010.213,http://dx.doi.org/10.1109/TVCG.2010.213,1271,1280,J,"An important goal of scientific data analysis is to understand the behavior of a system or process based on a sample of the system. In many instances it is possible to observe both input parameters and system outputs, and characterize the system as a high-dimensional function. Such data sets arise, for instance, in large numerical simulations, as energy landscapes in optimization problems, or in the analysis of image data relating to biological or medical parameters. This paper proposes an approach to analyze and visualizing such data sets. The proposed method combines topological and geometric techniques to provide interactive visualizations of discretely sampled high-dimensional scalar fields. The method relies on a segmentation of the parameter space using an approximate Morse-Smale complex on the cloud of point samples. For each crystal of the Morse-Smale complex, a regression of the system parameters with respect to the output yields a curve in the parameter space. The result is a simplified geometric representation of the Morse-Smale complex in the high dimensional input domain. Finally, the geometric representation is embedded in 2D, using dimension reduction, to provide a visualization platform. The geometric properties of the regression curves enable the visualization of additional information about each crystal such as local and global shape, width, length, and sampling densities. The method is illustrated on several synthetic examples of two dimensional functions. Two use cases, using data sets from the UCI machine learning repository, demonstrate the utility of the proposed approach on real data. Finally, in collaboration with domain experts the proposed method is applied to two scientific challenges. The analysis of parameters of climate simulations and their relationship to predicted global energy flux and the concentrations of chemical species in a combustion simulation and their integration with temperature.",Samuel Gerber;Peer-Timo Bremer;Valerio Pascucci;Ross T. Whitaker,Samuel Gerber;Peer-Timo Bremer;Valerio Pascucci;Ross Whitaker,University of Utah;Lawrence Livermore National Laboratory;University of Utah;University of Utah,10.1109/VISUAL.2004.96;10.1109/TVCG.2007.70603;10.1109/TVCG.2006.186;10.1109/TVCG.2007.70552;10.1109/TVCG.2007.70601;10.1109/VISUAL.2005.1532839,"Morse theory, High-dimensional visualization, Morse-Smale complex",64,48,60,
VAST,2016,Visual Interaction with Dimensionality Reduction: A Structured Literature Analysis,10.1109/TVCG.2016.2598495,http://dx.doi.org/10.1109/TVCG.2016.2598495,241,250,J,"Dimensionality Reduction (DR) is a core building block in visualizing multidimensional data. For DR techniques to be useful in exploratory data analysis, they need to be adapted to human needs and domain-specific problems, ideally, interactively, and on-the-fly. Many visual analytics systems have already demonstrated the benefits of tightly integrating DR with interactive visualizations. Nevertheless, a general, structured understanding of this integration is missing. To address this, we systematically studied the visual analytics and visualization literature to investigate how analysts interact with automatic DR techniques. The results reveal seven common interaction scenarios that are amenable to interactive control such as specifying algorithmic constraints, selecting relevant features, or choosing among several DR algorithms. We investigate specific implementations of visual analysis systems integrating DR, and analyze ways that other machine learning methods have been combined with DR. Summarizing the results in a “human in the loop” process model provides a general lens for the evaluation of visual interactive DR systems. We apply the proposed model to study and classify several systems previously described in the literature, and to derive future research opportunities.",Dominik Sacha;Leishi Zhang;Michael Sedlmair;John A. Lee;Jaakko Peltonen;Daniel Weiskopf;Stephen C. North;Daniel A. Keim,Dominik Sacha;Leishi Zhang;Michael Sedlmair;John A. Lee;Jaakko Peltonen;Daniel Weiskopf;Stephen C. North;Daniel A. Keim,"University of Konstanz, Germany;Middlesex University, UK;University of Vienna, Austria;SSS, IREC, MIRO, Université catholique de LouvainUCLBelgian F.R.S.-FNRS.;Helsinki Institute for Information Technology HIIT, Aalto University, University of Tampere, Finland;University of Konstanz, Germany;Infovisible LLC, Oldwick, U.S.A.;VISUS, University of Stuttgart, Germany",10.1109/TVCG.2012.195;10.1109/TVCG.2009.153;10.1109/VAST.2012.6400486;10.1109/TVCG.2014.2346481;10.1109/VAST.2011.6102449;10.1109/TVCG.2007.70515;10.1109/VAST.2008.4677350;10.1109/VAST.2009.5332629;10.1109/VAST.2010.5652443;10.1109/VAST.2014.7042492;10.1109/TVCG.2015.2467132;10.1109/TVCG.2015.2467553;10.1109/TVCG.2014.2346321;10.1109/TVCG.2013.153;10.1109/VAST.2010.5652484;10.1109/TVCG.2006.156;10.1109/TVCG.2015.2467717;10.1109/TVCG.2011.229;10.1109/TVCG.2013.124;10.1109/VAST.2010.5652392;10.1109/TVCG.2013.126,Interactive visualization;machine learning;visual analytics;dimensionality reduction,64,85,59,
Vis,1996,Real-time incremental visualization of dynamic ultrasound volumes using parallel BSP trees,10.1109/VISUAL.1996.568114,http://dx.doi.org/10.1109/VISUAL.1996.568114,235,240,C,"We present a method for producing real-time volume visualizations of continuously captured, arbitrarily-oriented 2D arrays (slices) of data. Our system constructs a 3D representation on-the-fly from incoming 2D ultrasound slices by modeling and rendering the slices as planar polygons with translucent surface textures. We use binary space partition (BSP) tree data structures to provide non-intersecting, visibility-ordered primitives for accurate opacity accumulation images. New in our system is a method of using parallel, time-shifted BSP trees to efficiently manage the continuously captured ultrasound data and to decrease the variability in image generation time between output frames. This technique is employed in a functioning real-time augmented reality system that a physician has used to examine human patients prior to breast biopsy procedures. We expect the technique can be used for real-time visualization of any 2D data being collected from a tracked sensor moving along an arbitrary path.",William F. Garrett;Henry Fuchs;Mary C. Whitton;Andrei State,W.F. Garrett;H. Fuchs;M.C. Whitton;A. State,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.1991.175802;10.1109/VISUAL.1994.346295,"Augmented reality, ultrasound echography, 3D medical imaging, BSP tree",63,11,24,
Vis,1999,Skip Strips: maintaining triangle strips for view-dependent rendering,10.1109/VISUAL.1999.809877,http://dx.doi.org/10.1109/VISUAL.1999.809877,131,518,C,"View-dependent simplification has emerged as a powerful tool for graphics acceleration in visualization of complex environments. However, view-dependent simplification techniques have not been able to take full advantage of the underlying graphics hardware. Specifically, triangle strips are a widely used hardware-supported mechanism to compactly represent and efficiently render static triangle meshes. However, in a view-dependent framework, the triangle mesh connectivity changes at every frame, making it difficult to use triangle strips. We present a novel data structure, Skip Strip, that efficiently maintains triangle strips during such view-dependent changes. A Skip Strip stores the vertex hierarchy nodes in a skip-list-like manner with path compression. We anticipate that Skip Strips will provide a road map to combine rendering acceleration techniques for static datasets, typical of retained-mode graphics applications, with those for dynamic datasets found in immediate-mode applications.",Jihad El-Sana;Elvir Azanli;Amitabh Varshney,J. El-Sana;E. Azanli;A. Varshney,"Dept. of Math. & Comput. Sci., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel",10.1109/VISUAL.1996.568125;10.1109/VISUAL.1998.745314;10.1109/VISUAL.1997.663902;10.1109/VISUAL.1998.745283;10.1109/VISUAL.1995.480805,,63,22,20,
Vis,1999,Exploring geo-scientific data in virtual environments,10.1109/VISUAL.1999.809884,http://dx.doi.org/10.1109/VISUAL.1999.809884,169,173,C,"This paper describes tools and techniques for the exploration of gee-scientific data from the oil and gas domain in stereoscopic virtual environments. The two main sources of data in the exploration task are seismic volumes and multivariate well logs of physical properties down a bore hole. We have developed a props-based interaction device called the cubic mouse to allow more direct and intuitive interaction with a cubic seismic volume. This device effectively places the seismic cube in the user's hand. Geologists who have tried this device have been enthusiastic about the ease of use, and were adept only a few moments after picking it up. We have also developed a multi-modal, visualisation and sonification technique for the dense, multivariate well log data. The visualisation can show two well log variables mapped along the well geometry in a bivariate colour scheme, and another variable on a sliding lens. A sonification probe is attached to the lens so that other variables can be heard. The sonification is based on a Geiger-counter metaphor that is widely understood and which makes it easy to explain. The data is sonified at higher or lower resolutions depending on the speed of the lens. Sweeps can be made at slower rates and over smaller intervals to home in on peaks, boundaries or other features in the full resolution data set.",Bernd Fröhlich 0001;Stephen Barrass;Björn Zehner;John Plate;Martin Göbel,B. Frohlich;S. Barrass;B. Zehner;J. Plate;M. Gobel,"GMD German Nat. Res. Center for Inf. Technol., Germany",10.1109/VISUAL.1998.745317;10.1109/VISUAL.1991.175771,,63,15,16,
InfoVis,2001,Change blindness in information visualization: a case study,10.1109/INFVIS.2001.963274,http://dx.doi.org/10.1109/INFVIS.2001.963274,15,22,C,,Lucy T. Nowell;Elizabeth G. Hetzler;Ted Tanasse,L. Nowell;E. Hetzler;T. Tanasse,Pacific Northwest National Laboratory,10.1109/INFVIS.1997.636789;10.1109/INFVIS.2000.885099;10.1109/INFVIS.1995.528692;10.1109/INFVIS.1995.528686;10.1109/INFVIS.1995.528691,,63,35,35,
Vis,2001,A simple algorithm for surface denoising,10.1109/VISUAL.2001.964500,http://dx.doi.org/10.1109/VISUAL.2001.964500,107,112,C,"We present a simple denoising technique for geometric data represented as a semiregular mesh, based on locally adaptive Wiener filtering. The degree of denoising is controlled by a single parameter (an estimate of the relative noise level) and the time required for denoising is independent of the magnitude of the estimate. The performance of the algorithm is sufficiently fast to allow interactive local denoising.",Jianbo Peng;Vasily Strela;Denis Zorin,Jianbo Peng;V. Strela;D. Zorin,"New York Univ., NY, USA;New York Univ., NY, USA;New York Univ., NY, USA",10.1109/VISUAL.2000.885721,"Meshes, multiresolution surfaces, Gaussian scale mixture model, denoising",63,9,26,
Vis,2004,Tracking of vector field singularities in unstructured 3D time-dependent datasets,10.1109/VISUAL.2004.107,http://dx.doi.org/10.1109/VISUAL.2004.107,329,336,C,"We present an approach for monitoring the positions of vector field singularities and related structural changes in time-dependent datasets. The concept of singularity index is discussed and extended from the well-understood planar case to the more intricate three-dimensional setting. Assuming a tetrahedral grid with linear interpolation in space and time, vector field singularities obey rules imposed by fundamental invariants (Poincare index), which we use as a basis for an efficient tracking algorithm. We apply the presented algorithm to CFD datasets to illustrate its purpose. We examine structures that exhibit topological variations with time and describe some of the insight gained with our method. Examples are given that show a correlation in the evolution of physical quantities that play a role in vortex breakdown.",Christoph Garth;Xavier Tricoche;Gerik Scheuermann,C. Garth;X. Tricoche;G. Scheuermann,"Dept. of Comput. Sci., Kaiserslautern Univ., Germany",10.1109/VISUAL.2003.1250376;10.1109/VISUAL.2002.1183786;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1997.663910,"flow visualization, topology tracking, time-dependent datasets, vortex breakdown",63,36,16,
VAST,2006,D-Dupe: An Interactive Tool for Entity Resolution in Social Networks,10.1109/VAST.2006.261429,http://dx.doi.org/10.1109/VAST.2006.261429,43,50,C,"Visualizing and analyzing social networks is a challenging problem that has been receiving growing attention. An important first step, before analysis can begin, is ensuring that the data is accurate. A common data quality problem is that the data may inadvertently contain several distinct references to the same underlying entity; the process of reconciling these references is called entity-resolution. D-Dupe is an interactive tool that combines data mining algorithms for entity resolution with a task-specific network visualization. Users cope with complexity of cleaning large networks by focusing on a small subnetwork containing a potential duplicate pair. The subnetwork highlights relationships in the social network, making the common relationships easy to visually identify. D-Dupe users resolve ambiguities either by merging nodes or by marking them distinct. The entity resolution process is iterative: as pairs of nodes are resolved, additional duplicates may be revealed; therefore, resolution decisions are often chained together. We give examples of how users can flexibly apply sequences of actions to produce a high quality entity resolution result. We illustrate and evaluate the benefits of D-Dupe on three bibliographic collections. Two of the datasets had already been cleaned, and therefore should not have contained duplicates; despite this fact, many duplicates were rapidly identified using D-Dupe's unique combination of entity resolution algorithms within a task-specific visual interface",Mustafa Bilgic 0001;Louis Licamele;Lise Getoor;Ben Shneiderman,Mustafa Bilgic;Louis Licamele;Lise Getoor;Ben Shneiderman,"University of Maryland, College Park, MD. mbilgic@cs.umd.edu;University of Maryland, College Park, MD. licamele@cs.umd.edu;University of Maryland, College Park, MD. getoor@cs.umd.edu;University of Maryland, College Park, MD. ben@cs.umd.edu",,"Data cleaning and integration, user interfaces, visual analytics, visual data mining",63,32,28,
VAST,2007,Visual Analysis of Controversy in User-generated Encyclopedias,10.1109/VAST.2007.4389012,http://dx.doi.org/10.1109/VAST.2007.4389012,179,186,C,"Wikipedia is a large and rapidly growing Web-based collaborative authoring environment, where anyone on the Internet can create, modify, and delete pages about encyclopedic topics. A remarkable property of some Wikipedia pages is that they are written by up to thousands of authors who may have contradicting opinions. In this paper we show that a visual analysis of the ""who revises whom""- network gives deep insight into controversies. We propose a set of analysis and visualization techniques that reveal the dominant authors of a page, the roles they play, and the alters they confront. Thereby we provide tools to understand how Wikipedia authors collaborate in the presence of controversy.",Ulrik Brandes;Jürgen Lerner,Ulrik Brandes;Jurgen Lerner,"Department of Computer & Information Science, University of Konstanz. e-mail: Ulrik.Brandes@uni-konstanz.de;Department of Computer & Information Science, University of Konstanz. e-mail: lerner@inf.uni-konstanz.de",10.1109/VAST.2006.261431,"Wikipedia, social network analysis, controversy",63,6,23,
Vis,2008,Particle-based Sampling and Meshing of Surfaces in Multimaterial Volumes,10.1109/TVCG.2008.154,http://dx.doi.org/10.1109/TVCG.2008.154,1539,1546,J,"Methods that faithfully and robustly capture the geometry of complex material interfaces in labeled volume data are important for generating realistic and accurate visualizations and simulations of real-world objects. The generation of such multimaterial models from measured data poses two unique challenges: first, the surfaces must be well-sampled with regular, efficient tessellations that are consistent across material boundaries; and second, the resulting meshes must respect the nonmanifold geometry of the multimaterial interfaces. This paper proposes a strategy for sampling and meshing multimaterial volumes using dynamic particle systems, including a novel, differentiable representation of the material junctions that allows the particle system to explicitly sample corners, edges, and surfaces of material intersections. The distributions of particles are controlled by fundamental sampling constraints, allowing Delaunay-based meshing algorithms to reliably extract watertight meshes of consistently high-quality.",Miriah D. Meyer;Ross T. Whitaker;Robert Michael Kirby;Christian Ledergerber;Hanspeter Pfister,Miriah Meyer;Ross Whitaker;Robert M. Kirby;Christian Ledergerber;Hanspeter Pfister,,10.1109/VISUAL.2002.1183808;10.1109/TVCG.2007.70604;10.1109/VISUAL.1997.663930;10.1109/TVCG.2007.70572;10.1109/TVCG.2007.70543;10.1109/TVCG.2006.149;10.1109/VISUAL.1997.663887,"Sampling, meshing, visualizations",63,39,49,
Vis,2009,Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees,10.1109/TVCG.2009.163,http://dx.doi.org/10.1109/TVCG.2009.163,1177,1184,J,"This paper introduces an efficient algorithm for computing the Reeb graph of a scalar function f defined on a volumetric mesh M in Ropf&lt;sup&gt;3&lt;/sup&gt;. We introduce a procedure called ""loop surgery"" that transforms M into a mesh M' by a sequence of cuts and guarantees the Reeb graph of f(M') to be loop free. Therefore, loop surgery reduces Reeb graph computation to the simpler problem of computing a contour tree, for which well-known algorithms exist that are theoretically efficient (O(n log n)) and fast in practice. Inverse cuts reconstruct the loops removed at the beginning. The time complexity of our algorithm is that of a contour tree computation plus a loop surgery overhead, which depends on the number of handles of the mesh. Our systematic experiments confirm that for real-life data, this overhead is comparable to the computation of the contour tree, demonstrating virtually linear scalability on meshes ranging from 70 thousand to 3.5 million tetrahedra. Performance numbers show that our algorithm, although restricted to volumetric data, has an average speedup factor of 6,500 over the previous fastest techniques, handling larger and more complex data-sets. We demonstrate the verstility of our approach by extending fast topologically clean isosurface extraction to non simply-connected domains. We apply this technique in the context of pressure analysis for mechanical design. In this case, our technique produces results in matter of seconds even for the largest meshes. For the same models, previous Reeb graph techniques do not produce a result.",Julien Tierny;Attila Gyulassy;Eddie Simon;Valerio Pascucci,Julien Tierny;Attila Gyulassy;Eddie Simon;Valerio Pascucci,"Scientific Computing and Imaging Institute, University of Utah;Scientific Computing and Imaging Institute, University of Utah;Dassault Systemes;Scientific Computing and Imaging Institute, University of Utah",10.1109/VISUAL.2004.96;10.1109/TVCG.2007.70601;10.1109/VISUAL.1997.663875,"Reeb graph, scalar field topology, isosurfaces, topological simplification",63,45,29,
InfoVis,2013,An Interaction Model for Visualizations Beyond The Desktop,10.1109/TVCG.2013.134,http://dx.doi.org/10.1109/TVCG.2013.134,2396,2405,J,"We present an interaction model for beyond-desktop visualizations that combines the visualization reference model with the instrumental interaction paradigm. Beyond-desktop visualizations involve a wide range of emerging technologies such as wall-sized displays, 3D and shape-changing displays, touch and tangible input, and physical information visualizations. While these technologies allow for new forms of interaction, they are often studied in isolation. New conceptual models are needed to build a coherent picture of what has been done and what is possible. We describe a modified pipeline model where raw data is processed into a visualization and then rendered into the physical world. Users can explore or change data by directly manipulating visualizations or through the use of instruments. Interactions can also take place in the physical world outside the visualization system, such as when using locomotion to inspect a large scale visualization. Through case studies we illustrate how this model can be used to describe both conventional and unconventional interactive visualization systems, and compare different design alternatives.",Yvonne Jansen;Pierre Dragicevic,Yvonne Jansen;Pierre Dragicevic,Inria and Universite Paris Sud;Inria,10.1109/TVCG.2010.177;10.1109/VISUAL.2005.1532781;10.1109/TVCG.2007.70577;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2012.251;10.1109/TVCG.2007.70515;10.1109/TVCG.2012.204;10.1109/TVCG.2006.178;10.1109/TVCG.2009.162;10.1109/INFVIS.2003.1249008;10.1109/INFVIS.1998.729560;10.1109/VISUAL.1990.146375,"Information visualization, interaction model, notational system, physical visualization",63,45,65,
VAST,2015,TrajGraph: A Graph-Based Visual Analytics Approach to Studying Urban Network Centralities Using Taxi Trajectory Data,10.1109/TVCG.2015.2467771,http://dx.doi.org/10.1109/TVCG.2015.2467771,160,169,J,"We propose TrajGraph, a new visual analytics method, for studying urban mobility patterns by integrating graph modeling and visual analysis with taxi trajectory data. A special graph is created to store and manifest real traffic information recorded by taxi trajectories over city streets. It conveys urban transportation dynamics which can be discovered by applying graph analysis algorithms. To support interactive, multiscale visual analytics, a graph partitioning algorithm is applied to create region-level graphs which have smaller size than the original street-level graph. Graph centralities, including Pagerank and betweenness, are computed to characterize the time-varying importance of different urban regions. The centralities are visualized by three coordinated views including a node-link graph view, a map view and a temporal information view. Users can interactively examine the importance of streets to discover and assess city traffic patterns. We have implemented a fully working prototype of this approach and evaluated it using massive taxi trajectories of Shenzhen, China. TrajGraph's capability in revealing the importance of city streets was evaluated by comparing the calculated centralities with the subjective evaluations from a group of drivers in Shenzhen. Feedback from a domain expert was collected. The effectiveness of the visual interface was evaluated through a formal user study. We also present several examples and a case study to demonstrate the usefulness of TrajGraph in urban transportation analysis.",Xiaoke Huang;Ye Zhao;Chao Ma;Jing Yang;Xinyue Ye;Chong Zhang,Xiaoke Huang;Ye Zhao;Chao Ma;Jing Yang;Xinyue Ye;Chong Zhang,"Department of Computer Science, Kent State University;Department of Computer Science, Kent State University;Department of Computer Science, Kent State University;Department of Computer Science, University of North Carolina at Charlotte;Department of Geography, Kent State University;Department of Computer Science, University of North Carolina at Charlotte",10.1109/VAST.2009.5332593;10.1109/TVCG.2013.226;10.1109/TVCG.2009.145;10.1109/VAST.2011.6102455;10.1109/TVCG.2006.122;10.1109/TVCG.2012.265;10.1109/TVCG.2013.228;10.1109/TVCG.2014.2346746,"Graph based visual analytics, Centrality, Taxi trajectories, Urban network, Transportation assessment",63,80,39,
InfoVis,2017,LSTMVis: A Tool for Visual Analysis of Hidden State Dynamics in Recurrent Neural Networks,10.1109/TVCG.2017.2744158,http://dx.doi.org/10.1109/TVCG.2017.2744158,667,676,J,"Recurrent neural networks, and in particular long short-term memory (LSTM) networks, are a remarkably effective tool for sequence modeling that learn a dense black-box hidden representation of their sequential input. Researchers interested in better understanding these models have studied the changes in hidden state representations over time and noticed some interpretable patterns but also significant noise. In this work, we present LSTMVis, a visual analysis tool for recurrent neural networks with a focus on understanding these hidden state dynamics. The tool allows users to select a hypothesis input range to focus on local state changes, to match these states changes to similar patterns in a large data set, and to align these results with structural annotations from their domain. We show several use cases of the tool for analyzing specific hidden state properties on dataset containing nesting, phrase structure, and chord progressions, and demonstrate how the tool can be used to isolate patterns for further statistical analysis. We characterize the domain, the different stakeholders, and their goals and tasks. Long-term usage data after putting the tool online revealed great interest in the machine learning community.",Hendrik Strobelt;Sebastian Gehrmann;Hanspeter Pfister;Alexander M. Rush,Hendrik Strobelt;Sebastian Gehrmann;Hanspeter Pfister;Alexander M. Rush,Harvard SEAS;Harvard SEAS;Harvard SEAS;Harvard SEAS,10.1109/TVCG.2016.2598831;10.1109/TVCG.2016.2598838;10.1109/VISUAL.2005.1532820,"Visualization,Machine Learning,Recurrent Neural Networks,LSTM",63,47,35,
Vis,1992,Visualization of second order tensor fields and matrix data,10.1109/VISUAL.1992.235193,http://dx.doi.org/10.1109/VISUAL.1992.235193,316,323,C,The visualization of 3-D second-order tensor fields and matrix data is studied. The general problem of visualizing unsymmetric real or complex Hermitian second-order tensor fields can be reduced to the simultaneous visualization of a real and symmetric second-order tensor field and a real vector field. The emphasis is on exploiting the mathematical properties of tensor fields in order to facilitate their visualization and to produce a continuous representation of the data. The focus is on interactively sensing and exploring real and symmetric second-order tensor data by generalizing the vector notion of streamline to the tensor concept of hyperstreamline. The importance of a structural analysis of the data field analogous to the techniques of vector field topology extraction in order to obtain a unique and objective representation of second-order tensor fields is stressed.&lt;&lt;ETX&gt;&gt;,Thierry Delmarcelle;Lambertus Hesselink,T. Delmarcelle;L. Hesselink,"Stanford Univ., CA, USA;Stanford Univ., CA, USA",10.1109/VISUAL.1990.146373;10.1109/VISUAL.1990.146359;10.1109/VISUAL.1991.175789;10.1109/VISUAL.1991.175773,,62,30,17,TT;BP
Vis,1992,Massively parallel isosurface extraction,10.1109/VISUAL.1992.235223,http://dx.doi.org/10.1109/VISUAL.1992.235223,77,83,C,"Experiences during the investigation of parallel methods for faster isosurface generation on SIMD (single instruction stream, multiple data stream) machines are described. A sequential version of a well-known isosurfacing algorithm is algorithmically enhanced for a particular type of SIMD architecture. The SIMD implementation takes full advantage of the data parallel nature of the algorithm, and experiments have proven the implementation to be highly scalable. A parallel tool, which can generate 170 K polygons/s, gives scientists the means to explore large 3D scalar or vector fields interactively.&lt;&lt;ETX&gt;&gt;",Charles D. Hansen;Paul A. Hinker,C.D. Hansen;P. Hinker,"Los Alamos Nat. Lab., NM, USA;Los Alamos Nat. Lab., NM, USA",10.1109/VISUAL.1991.175782,,62,32,7,
Vis,1996,Multi-frequency noise for LIC,10.1109/VISUAL.1996.567784,http://dx.doi.org/10.1109/VISUAL.1996.567784,121,126,C,"We present a way to visualize a flow field using Line Integral Convolution (LIC) with a multi frequency noise texture. A broad range of feature sizes can enhance a user's perception of the magnitudes and direction of the flow. In addition, the multiple scales of feature size help a user clarify the motion of the flow in an animation.",Ming-Hoe Kiu;David C. Banks,Ming-Hoe Kiu;D.C. Banks,"Dept. of Electr. Eng., Mississippi State Univ., MS, USA",10.1109/VISUAL.1994.346313,,62,17,7,
Vis,1997,Isosurface extraction using particle systems,10.1109/VISUAL.1997.663930,http://dx.doi.org/10.1109/VISUAL.1997.663930,495,498,C,"Presents a new approach to isosurface extraction from volume data using particle systems. Particle behavior is dynamic and can be based on laws of physics or artificial rules. For isosurface extraction, we program particles to be attracted towards a specific surface value while simultaneously repelling adjacent particles. The repulsive forces are based on the curvature of the surface at that location. A birth-death process results in a denser concentration of particles in areas of high curvature and sparser populations in areas of lower curvature. The overall level of detail is controlled through a scaling factor that increases or decreases the repulsive forces of the particles. Once particles reach equilibrium, their locations are used as vertices in generating a triangular mesh of the surface. The advantages of our approach include: vertex densities are based on surface features rather than on the sampling rate of the volume; a single scaling factor simplifies level-of-detail control; and meshing is efficient because it uses neighbor information that has already been generated during the force calculations.",Patricia Crossno;Edward Angel,P. Crossno;E. Angel,"Dept. of Comput. Sci., New Mexico Univ., Albuquerque, NM, USA",10.1109/VISUAL.1993.398880,,62,26,9,
Vis,1998,Surface reconstruction with anisotropic density-scaled alpha shapes,10.1109/VISUAL.1998.745286,http://dx.doi.org/10.1109/VISUAL.1998.745286,67,72,C,"Generation of a three-dimensional model from an unorganized set of points is an active area of research in computer graphics. Alpha shapes can be employed to construct a surface which most closely reflects the object described by the points. However, no /spl alpha/-shape, for any value of /spl alpha/, can properly detail discontinuous regions of a model. We introduce herein two methods of improving the results of reconstruction using /spl alpha/-shapes: density-scaling, which modulates the value of a depending on the density of points in a region; and anisotropic shaping, which modulates the form of the /spl alpha/-ball based on point normals. We give experimental results that show the successes and limitations of our method.",Marek Teichmann;Michael V. Capps,M. Teichmann;M. Capps,"Lab. for Comput. Sci., MIT, Cambridge, MA, USA",,,62,29,11,
Vis,1999,Tetrahedral Mesh Compression with the Cut-Border Machine,10.1109/VISUAL.1999.809868,http://doi.ieeecomputersociety.org/10.1109/VISUAL.1999.809868,51,58,C,"In recent years, substantial progress has been achieved in the area of volume visualization on irregular grids, which is mainly based on tetrahedral meshes. Even moderately fine tetrahedral meshes consume several mega-bytes of storage. For archivation and transmission compression algorithms are essential. In scientific applications lossless compression schemes are of primary interest. This paper introduces a new lossless compression scheme for the connectivity of tetrahedral meshes. Our technique can handle all tetrahedral meshes in three dimensional euclidean space even with non manifold border. We present compression and decompression algorithms which consume for reasonable meshes linear time in the number of tetrahedra. The connectivity is compressed to less than 2.4 bits per tetrahedron for all measured meshes. Thus a tetrahedral mesh can almost be reduced to the vertex coordinates, which consume in a common representation about one quarter of the total storage space. We complete our work with solutions for the compression of vertex coordinates and additional attributes, which might be attached to the mesh.",Stefan Gumhold;Stefan Guthe;Wolfgang Straßer,S. Gumhold;S. Guthe;W. Strasser,"Tubingen Univ., Germany",10.1109/VISUAL.1998.745329;10.1109/VISUAL.1997.663869,,62,17,0,
Vis,2002,Efficient computation of the topology of level sets,10.1109/VISUAL.2002.1183774,http://dx.doi.org/10.1109/VISUAL.2002.1183774,187,194,C,"This paper introduces two efficient algorithms that compute the Contour Tree of a 3D scalar field /spl Fscr/ and its augmented version with the Betti numbers of each isosurface. The Contour Tree is a fundamental data structure in scientific visualization that is used to preprocess the domain mesh to allow optimal computation of isosurfaces with minimal overhead storage. The Contour Tree can also be used to build user interfaces reporting the complete topological characterization of a scalar field. The first part of the paper presents a new scheme that augments the Contour Tree with the Betti numbers of each isocontour in linear time. We show how to extend the scheme with the Betti number computation without increasing its complexity. Thus, we improve on the time complexity from our previous approach from O(m log m) to O(n log n+m), where m is the number of tetrahedra and n is the number of vertices in the domain of /spl Fscr/. The second part of the paper introduces a new divide-and-conquer algorithm that computes the Augmented Contour Tree with improved efficiency. The central part of the scheme computes the output Contour Tree by merging two intermediate Contour Trees and is independent of the interpolant. In this way we confine any knowledge regarding a specific interpolant to an oracle that computes the tree for a single cell. We have implemented this oracle for the trilinear interpolant and plan to replace it with higher order interpolants when needed. The complexity of the scheme is O(n+t log n), where t is the number of critical points of /spl Fscr/. For the first time we can compute the Contour Tree in linear time in many practical cases when t=O(n/sup 1-/spl epsi//). Lastly, we report the running times for a parallel implementation of our algorithm, showing good scalability with the number of processors.",Valerio Pascucci;Kree Cole-McLaughlin,V. Pascucci;K. Cole-McLaughlin,"Center of Appl. Sci. Comput., Lawrence Livermore Nat. Lab., CA, USA;Center of Appl. Sci. Comput., Lawrence Livermore Nat. Lab., CA, USA",10.1109/VISUAL.1997.663875,"Isosurfaces, Level Set Topology, Betti Numbers",62,31,13,TT
Vis,2003,Advanced curved planar reformation: flattening of vascular structures,10.1109/VISUAL.2003.1250353,http://dx.doi.org/10.1109/VISUAL.2003.1250353,43,50,C,"Traditional volume visualization techniques may provide incomplete clinical information needed for applications in medical visualization. In the area of vascular visualization important features such as the lumen of a diseased vessel segment may not be visible. Curved planar reformation (CPR) has proven to be an acceptable practical solution. Existing CPR techniques, however, still have diagnostically relevant limitations. In this paper, we introduce two advances methods for efficient vessel visualization, based on the concept of CPR. Both methods benefit from relaxation of spatial coherence in favor of improved feature perception. We present a new technique to visualize the interior of a vessel in a single image. A vessel is resampled along a spiral around its central axis. The helical spiral depicts the vessel volume. Furthermore, a method to display an entire vascular tree without mutually occluding vessels is presented. Minimal rotations at the bifurcations avoid occlusions. For each viewing direction the entire vessel structure is visible.",Armin Kanitsar;Rainer Wegenkittl;Dominik Fleischmann;M. Eduard Gröller,A. Kanitsar;R. Wegenkittl;D. Fleischmann;M.E. Groller,"Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria",10.1109/VISUAL.2002.1183754;10.1109/VISUAL.2001.964555;10.1109/VISUAL.2001.964538,"computed tomography angiography, vessel analysis, curved planar reformation",62,19,11,
InfoVis,2004,Time-Varying Data Visualization Using Information Flocking Boids,10.1109/INFVIS.2004.65,http://dx.doi.org/10.1109/INFVIS.2004.65,97,104,C,"This research demonstrates how principles of self-organization and behavior simulation can be used to represent dynamic data evolutions by extending the concept of information flocking, originally introduced by Proctor &amp;amp; Winter (1998), to time-varying datasets. A rule-based behavior system continuously controls and updates the dynamic actions of individual, three-dimensional elements that represent the changing data values of reoccurring data objects. As a result, different distinguishable motion types emerge that are driven by local interactions between the spatial elements as well as the evolution of time-varying data values. Notably, this representation technique focuses on the representation of dynamic data alteration characteristics, or how reoccurring data objects change over time, instead of depicting the exact data values themselves. In addition, it demonstrates the potential of motion as a useful information visualization cue. The original information flocking approach is extended to incorporate time-varying datasets, live database querying, continuous data streaming, real-time data similarity evaluation, automatic shape generation and more stable flocking algorithms. Different experiments prove that information flocking is capable of representing short-term events as well as long-term temporal data evolutions of both individual and groups of time-dependent data objects. An historical stock market quote price dataset is used to demonstrate the algorithms and principles of time-varying information flocking",Andrew Vande Moere,A.V. Moere,University of Sydney,,"time-varying information visualization, artificial life, 3D information visualization, motion, boids",62,26,22,
InfoVis,2005,Two-tone pseudo coloring: compact visualization for one-dimensional data,10.1109/INFVIS.2005.1532144,http://dx.doi.org/10.1109/INFVIS.2005.1532144,173,180,C,"A new pseudo coloring technique for large scale one-dimensional datasets is proposed. For visualization of a large scale dataset, user interaction is indispensable for selecting focus areas in the dataset. However, excessive switching of the visualized image makes it difficult for the user to recognize overview/ detail and detail/ detail relationships. The goal of this research is to develop techniques for visualizing details as precisely as possible in overview display. In this paper, visualization of a one-dimensional but very large dataset is considered. The proposed method is based on pseudo coloring, however, each scalar value corresponds to two discrete colors. By painting with two colors at each value, users can read out the value precisely. This method has many advantages: it requires little image space for visualization; both the overview and details of the dataset are visible in one image without distortion; and implementation is very simple. Several application examples, such as meteorological observation data and train convenience evaluation data, show the effectiveness of the method.",Takafumi Saito;Hiroko Miyamura;Mitsuyoshi Yamamoto;Hiroki Saito;Yuka Hoshiya;Takumi Kaseda,T. Saito;H.N. Miyamura;M. Yamamoto;H. Saito;Y. Hoshiya;T. Kaseda,"Tokyo Univ. of Agric. & Technol., Japan;Tokyo Univ. of Agric. & Technol., Japan;Tokyo Univ. of Agric. & Technol., Japan;Tokyo Univ. of Agric. & Technol., Japan;Tokyo Univ. of Agric. & Technol., Japan;Tokyo Univ. of Agric. & Technol., Japan",,"pseudo color, overview, detail, focus+context, data density",62,24,11,
Vis,2006,An Advanced Evenly-Spaced Streamline Placement Algorithm,10.1109/TVCG.2006.116,http://dx.doi.org/10.1109/TVCG.2006.116,965,972,J,"This paper presents an advanced evenly-spaced streamline placement algorithm for fast, high-quality, and robust layout of flow lines. A fourth-order Runge-Kutta integrator with adaptive step size and error control is employed for rapid accurate streamline advection. Cubic Hermite polynomial interpolation with large sample-spacing is adopted to create fewer evenly-spaced samples along each streamline to reduce the amount of distance checking. We propose two methods to enhance placement quality. Double queues are used to prioritize topological seeding and to favor long streamlines to minimize discontinuities. Adaptive distance control based on the local flow variance is explored to reduce cavities. Furthermore, we propose a universal, effective, fast, and robust loop detection strategy to address closed and spiraling streamlines. Our algorithm is an order-of-magnitude faster than Jobard and Lefer's algorithm with better placement quality and over 5 times faster than Mebarki et al.'s algorithm with comparable placement quality, but with a more robust solution to loop detection",Zhanping Liu;Robert J. Moorhead II;Joe Groner,Zhanping Liu;Robert Moorhead;Joe Groner,"HPC2 / GRI / Visualization Analysis and Imaging Lab, PO Box 9627, Mississippi State University, MS 39762-9627;HPC2 / GRI / Visualization Analysis and Imaging Lab, PO Box 9627, Mississippi State University, MS 39762-9627;HPC2 / GRI / Visualization Analysis and Imaging Lab, PO Box 9627, Mississippi State University, MS 39762-9627",10.1109/VISUAL.2000.885690;10.1109/VISUAL.1998.745295;10.1109/VISUAL.2005.1532831;10.1109/VISUAL.2005.1532832,"Flow visualization, evenly-spaced streamlines, streamline placement, seeding strategy, closed streamlines",62,57,20,
Vis,2008,Generation of Accurate Integral Surfaces in Time-Dependent Vector fields,10.1109/TVCG.2008.133,http://dx.doi.org/10.1109/TVCG.2008.133,1404,1411,J,"We present a novel approach for the direct computation of integral surfaces in time-dependent vector fields. As opposed to previous work, which we analyze in detail, our approach is based on a separation of integral surface computation into two stages: surface approximation and generation of a graphical representation. This allows us to overcome several limitations of existing techniques. We first describe an algorithm for surface integration that approximates a series of time lines using iterative refinement and computes a skeleton of the integral surface. In a second step, we generate a well-conditioned triangulation. Our approach allows a highly accurate treatment of very large time-varying vector fields in an efficient, streaming fashion. We examine the properties of the presented methods on several example datasets and perform a numerical study of its correctness and accuracy. Finally, we investigate some visualization aspects of integral surfaces.",Christoph Garth;Han Krishnan;Xavier Tricoche;Tom Tricoche;Kenneth I. Joy,Christoph Garth;Han Krishnan;Xavier Tricoche;Tom Tricoche;Kenneth I. Joy,"University of California, Davis;University of California, Davis;Purdue University;University of Kaiserslauterns;University of California, Davis",10.1109/VISUAL.1993.398875;10.1109/VISUAL.2001.964506;10.1109/VISUAL.2004.28;10.1109/VISUAL.1992.235211;10.1109/VISUAL.1992.235226,"3D vector field visualization, flow visualization, time-varying and time-series visualization, surface extraction",62,45,18,
InfoVis,2009,code_swarm: A Design Study in Organic Software Visualization,10.1109/TVCG.2009.123,http://dx.doi.org/10.1109/TVCG.2009.123,1097,1104,J,"In May of 2008, we published online a series of software visualization videos using a method called code_swarm. Shortly thereafter, we made the code open source and its popularity took off. This paper is a study of our code swarm application, comprising its design, results and public response. We share our design methodology, including why we chose the organic information visualization technique, how we designed for both developers and a casual audience, and what lessons we learned from our experiment. We validate the results produced by code_swarm through a qualitative analysis and by gathering online user comments. Furthermore, we successfully released the code as open source, and the software community used it to visualize their own projects and shared their results as well. In the end, we believe code_swarm has positive implications for the future of organic information design and open source information visualization practice.",Michael Ogawa;Kwan-Liu Ma,Michael Ogawa;Kwan-Liu Ma,"University of California, Davis;University of California, Davis",10.1109/TVCG.2007.70541;10.1109/TVCG.2008.172;10.1109/INFVIS.2005.1532125;10.1109/INFVIS.2004.65;10.1109/INFVIS.2005.1532122,"Software visualization, organic information visualization, software development history and evolution",62,43,32,
VAST,2009,Evaluating visual analytics systems for investigative analysis: Deriving design principles from a case study,10.1109/VAST.2009.5333878,http://dx.doi.org/10.1109/VAST.2009.5333878,139,146,C,"Despite the growing number of systems providing visual analytic support for investigative analysis, few empirical studies of the potential benefits of such systems have been conducted, particularly controlled, comparative evaluations. Determining how such systems foster insight and sensemaking is important for their continued growth and study, however. Furthermore, studies that identify how people use such systems and why they benefit (or not) can help inform the design of new systems in this area. We conducted an evaluation of the visual analytics system Jigsaw employed in a small investigative sensemaking exercise, and we compared its use to three other more traditional methods of analysis. Sixteen participants performed a simulated intelligence analysis task under one of the four conditions. Experimental results suggest that Jigsaw assisted participants to analyze the data and identify an embedded threat. We describe different analysis strategies used by study participants and how computational support (or the lack thereof) influenced the strategies. We then illustrate several characteristics of the sensemaking process identified in the study and provide design implications for investigative analysis tools based thereon. We conclude with recommendations for metrics and techniques for evaluating other visual analytics investigative analysis tools.",Youn ah Kang;Carsten Görg;John T. Stasko,Youn-ah Kang;Carsten Gorg;John Stasko,"School of Interactive Computing & GVU Center, Georgia Institute of Technology, USA;School of Interactive Computing & GVU Center, Georgia Institute of Technology, USA;School of Interactive Computing & GVU Center, Georgia Institute of Technology, USA",10.1109/VAST.2008.4677362;10.1109/VAST.2008.4677360;10.1109/VAST.2006.261416;10.1109/VAST.2007.4389006;10.1109/VAST.2008.4677358,,62,36,17,
Vis,2009,"Mapping High-fidelity Volume Rendering for Medical Imaging to CPU, GPU and Many-Core Architectures",10.1109/TVCG.2009.164,http://dx.doi.org/10.1109/TVCG.2009.164,1563,1570,J,"Medical volumetric imaging requires high fidelity, high performance rendering algorithms. We motivate and analyze new volumetric rendering algorithms that are suited to modern parallel processing architectures. First, we describe the three major categories of volume rendering algorithms and confirm through an imaging scientist-guided evaluation that ray-casting is the most acceptable. We describe a thread- and data-parallel implementation of ray-casting that makes it amenable to key architectural trends of three modern commodity parallel architectures: multi-core, GPU, and an upcoming many-core Intel&lt;sup&gt;reg&lt;/sup&gt; architecture code-named Larrabee. We achieve more than an order of magnitude performance improvement on a number of large 3D medical datasets. We further describe a data compression scheme that significantly reduces data-transfer overhead. This allows our approach to scale well to large numbers of Larrabee cores.",Mikhail Smelyanskiy;David R. Holmes 0001;Jatin Chhugani;Alan Larson;Doug Carmean;Dennis P. Hanson;Pradeep Dubey;Kurt Augustine;Daehyun Kim 0001;Alan Kyker;Victor W. Lee;Anthony D. Nguyen;Larry Seiler;Richard A. Robb,Mikhail Smelyanskiy;Victor W. Lee;Anthony D. Nguyen;Larry Seiler;Richard Robb;David Holmes;Jatin Chhugani;Alan Larson;Douglas M. Carmean;Dennis Hanson;Pradeep Dubey;Kurt Augustine;Daehyun Kim;Alan Kyker,Intel Corporation;Intel Corporation;Intel Corporation;Intel Corporation;Mayo Clinic;Mayo Clinic;Intel Corporation;Mayo Clinic;Intel Corporation;Mayo Clinic;Intel Corporation;Mayo Clinic;Intel Corporation;Intel Corporation,10.1109/VISUAL.2003.1250384;10.1109/VISUAL.1998.745309,"Volume Compositing, Parallel Processing, Many-core Computing, Medical Imaging, Graphics Architecture, GPGPU",62,46,31,
InfoVis,2015,Reactive Vega: A Streaming Dataflow Architecture for Declarative Interactive Visualization,10.1109/TVCG.2015.2467091,http://dx.doi.org/10.1109/TVCG.2015.2467091,659,668,J,"We present Reactive Vega, a system architecture that provides the first robust and comprehensive treatment of declarative visual and interaction design for data visualization. Starting from a single declarative specification, Reactive Vega constructs a dataflow graph in which input data, scene graph elements, and interaction events are all treated as first-class streaming data sources. To support expressive interactive visualizations that may involve time-varying scalar, relational, or hierarchical data, Reactive Vega's dataflow graph can dynamically re-write itself at runtime by extending or pruning branches in a data-driven fashion. We discuss both compile- and run-time optimizations applied within Reactive Vega, and share the results of benchmark studies that indicate superior interactive performance to both D3 and the original, non-reactive Vega system.",Arvind Satyanarayan;Ryan Russell;Jane Hoffswell;Jeffrey Heer,Arvind Satyanarayan;Ryan Russell;Jane Hoffswell;Jeffrey Heer,Stanford University;University of Washington;University of Washington;University of Washington,10.1109/VISUAL.1995.480821;10.1109/TVCG.2009.174;10.1109/TVCG.2011.185;10.1109/TVCG.2010.144;10.1109/TVCG.2014.2346250;10.1109/TVCG.2013.179;10.1109/TVCG.2010.177;10.1109/VISUAL.1996.567752;10.1109/INFVIS.2000.885086;10.1109/INFVIS.2004.12;10.1109/TVCG.2015.2467191;10.1109/TVCG.2007.70515,"Information visualization, systems, toolkits, declarative specification, optimization, interaction, streaming data",62,71,41,
Vis,1996,Multiresolution multidimensional wavelet brushing,10.1109/VISUAL.1996.567800,http://dx.doi.org/10.1109/VISUAL.1996.567800,141,148,C,Brushing is a data visualization technique that identifies and highlights data subsets. We introduce a form of brushing in which the brushed data is usually displayed at a different resolution than the non brushed data. The paper presents the rationale behind the multiresolution support of multivariate data visualization and describes the construction of multiresolution brushing using wavelet approximations. The idea is implemented in an enhanced version of XmdvTool. Real scientific data is used for demonstration and practical applications are suggested.,Pak Chung Wong;R. Daniel Bergeron,Pak Chung Wong;R.D. Bergeron,"Dept. of Comput. Sci., New Hampshire Univ., Durham, NH, USA",10.1109/VISUAL.1990.146386;10.1109/VISUAL.1993.398864;10.1109/VISUAL.1995.480811;10.1109/VISUAL.1994.346302;10.1109/VISUAL.1995.485139;10.1109/VISUAL.1990.146402,,61,24,18,
Vis,1997,Visualization of large terrains in resource-limited computing environments,10.1109/VISUAL.1997.663863,http://dx.doi.org/10.1109/VISUAL.1997.663863,95,102,C,"The authors describe a software system supporting interactive visualization of large terrains in a resource-limited environment, i.e. a low-end client computer accessing a large terrain database server through a low-bandwidth network. By ""large"", they mean that the size of the terrain database is orders of magnitude larger than the computer RAM. Superior performance is achieved by manipulating both geometric and texture data at a continuum of resolutions, and, at any given moment, using the best resolution dictated by the CPU and bandwidth constraints. The geometry is maintained as a Delaunay triangulation of a dynamic subset of the terrain data points, and the texture compressed by a progressive wavelet scheme. A careful blend of algorithmic techniques enables the system to achieve superior rendering performance on a low-end computer by optimizing the number of polygons and texture pixels sent to the graphics pipeline. It guarantees a frame rate depending only on the size and quality of the rendered image, independent of the viewing parameters and scene database size. An efficient paging scheme minimizes data I/O, thus enabling the use of the system in a low-bandwidth client/server data-streaming scenario, such as on the Internet.",Boris Rabinovich;Craig Gotsman,B. Rabinovich;C. Gotsman,"Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel",10.1109/VISUAL.1996.567600,"Terrain rendering, level-of-detail, interactive graphics",61,8,15,
Vis,1999,Mixing translucent polygons with volumes,10.1109/VISUAL.1999.809887,http://dx.doi.org/10.1109/VISUAL.1999.809887,191,525,C,"We present an algorithm which renders opaque and/or translucent polygons embedded within volumetric data. The processing occurs such that all objects are composited in the correct order, by rendering thin slabs of the translucent polygons between volume slices using slice-order volume rendering. We implemented our algorithm with OpenGL on current general-purpose graphics systems. We discuss our system implementation, speed and image quality, as well as the renderings of several mixed scenes.",Kevin Kreeger;Arie E. Kaufman,K.A. Kreeger;A.E. Kaufman,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1997.663853,"Mixing polygons and volumes, Translucent Polygon Rendering, Volume rendering, Ray casting, Voxelization",61,14,21,
Vis,1999,Volume rendering based interactive navigation within the human colon,10.1109/VISUAL.1999.809914,http://dx.doi.org/10.1109/VISUAL.1999.809914,397,549,C,"We present an interactive navigation system for virtual colonoscopy, which is based solely on high performance volume rendering. Previous colonic navigation systems have employed either a surface rendering or a Z-buffer-assisted volume rendering method that depends on the surface rendering results. Our method is a fast direct volume rendering technique that exploits distance information stored in the potential field of the camera control model, and is parallelized on a multiprocessor. Experiments have been conducted on both a simulated pipe and patients' data sets acquired with a CT scanner.",Ming Wan;Qingyu Tang;Arie E. Kaufman;Zhengrong Liang;Mark Wax,M. Wan;Q. Tang;A. Kaufman;Z. Liang;M. Wax,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1999.809911;10.1109/VISUAL.1997.663915;10.1109/VISUAL.1998.745713;10.1109/VISUAL.1993.398852,,61,24,17,
InfoVis,2003,Exploring high-D spaces with multiform matrices and small multiples,10.1109/INFVIS.2003.1249006,http://dx.doi.org/10.1109/INFVIS.2003.1249006,31,38,C,"We introduce an approach to visual analysis of multivariate data that integrates several methods from information visualization, exploratory data analysis (EDA), and geovisualization. The approach leverages the component-based architecture implemented in GeoVISTA Studio to construct a flexible, multiview, tightly (but generically) coordinated, EDA toolkit. This toolkit builds upon traditional ideas behind both small multiples and scatterplot matrices in three fundamental ways. First, we develop a general, multiform, bivariate matrix and a complementary multiform, bivariate small multiple plot in which different bivariate representation forms can be used in combination. We demonstrate the flexibility of this approach with matrices and small multiples that depict multivariate data through combinations of: scatterplots, bivariate maps, and space-filling displays. Second, we apply a measure of conditional entropy to (a) identify variables from a high-dimensional data set that are likely to display interesting relationships and (b) generate a default order of these variables in the matrix or small multiple display. Third, we add conditioning, a kind of dynamic query/filtering in which supplementary (undisplayed) variables are used to constrain the view onto variables that are displayed. Conditioning allows the effects of one or more well understood variables to be removed form the analysis, making relationships among remaining variables easier to explore. We illustrate the individual and combined functionality enabled by this approach through application to analysis of cancer diagnosis and mortality data and their associated covariates and risk factors.",Alan M. MacEachren;Xiping Dai;Frank Hardisty;Diansheng Guo;Eugene Lengerich,A. MacEachren;D. Xiping;F. Hardisty;Diansheng Guo;G. Lengerich,"Dept. of Geogr., Pennsylvania State Univ., University Park, VA, USA;Dept. of Geogr., Pennsylvania State Univ., University Park, VA, USA;Dept. of Geogr., Pennsylvania State Univ., University Park, VA, USA;Dept. of Geogr., Pennsylvania State Univ., University Park, VA, USA",10.1109/VISUAL.1991.175815;10.1109/INFVIS.1998.729559,"geovisualization, EDA, scatterplot matrix,bivariate map, space-filling visualization, conditional entropy, small multiples, conditioning, GeoVISTA Studio ",61,28,49,
Vis,2004,Investigating swirl and tumble flow with a comparison of visualization techniques,10.1109/VISUAL.2004.59,http://dx.doi.org/10.1109/VISUAL.2004.59,51,58,C,"We investigate two important, common fluid flow patterns from computational fluid dynamics (CFD) simulations, namely, swirl and tumble motion typical of automotive engines. We study and visualize swirl and tumble flow using three different flow visualization techniques: direct, geometric, and texture-based. When illustrating these methods side-by-side, we describe the relative strengths and weaknesses of each approach within a specific spatial dimension and across multiple spatial dimensions typical of an engineer's analysis. Our study is focused on steady-state flow. Based on this investigation we offer perspectives on where and when these techniques are best applied in order to visualize the behavior of swirl and tumble motion.",Robert S. Laramee;Daniel Weiskopf;Jürgen Schneider;Helwig Hauser,R.S. Laramee;D. Weiskopf;J. Schneider;H. Hauser,"VRV, Vienna, Austria",10.1109/VISUAL.1999.809918;10.1109/VISUAL.1999.809895;10.1109/VISUAL.2000.885690;10.1109/VISUAL.2003.1250363;10.1109/VISUAL.2003.1250377;10.1109/VISUAL.2003.1250361;10.1109/VISUAL.2003.1250364,"Flow visualization, computational fluid dynamics (CFD), swirl flow, tumble flow, visualization systems, engine simulation, in-cylinder flow",61,32,23,
VAST,2006,Beyond Usability: Evaluation Aspects of Visual Analytic Environments,10.1109/VAST.2006.261416,http://dx.doi.org/10.1109/VAST.2006.261416,145,150,C,"A new field of research, visual analytics, has been introduced. This has been defined as ""the science of analytical reasoning facilitated by interactive visual interfaces"" (Thomas and Cook, 2005). Visual analytic environments, therefore, support analytical reasoning using visual representations and interactions, with data representations and transformation capabilities, to support production, presentation, and dissemination. As researchers begin to develop visual analytic environments, it is advantageous to develop metrics and methodologies to help researchers measure the progress of their work and understand the impact their work has on the users who work in such environments. This paper presents five areas or aspects of visual analytic environments that should be considered as metrics and methodologies for evaluation are developed. Evaluation aspects need to include usability, but it is necessary to go beyond basic usability. The areas of situation awareness, collaboration, interaction, creativity, and utility are proposed as the five evaluation areas for initial consideration. The steps that need to be undertaken to develop systematic evaluation methodologies and metrics for visual analytic environments are outlined",Jean Scholtz,Jean Scholtz,Pacific Northwest National Laboratory. e-mail: jean.scholtz@pnl.gov,10.1109/VISUAL.1990.146375;10.1109/INFVIS.2004.10;10.1109/INFVIS.1997.636794,"visualization, analytic environments,metrics",61,30,26,
Vis,2006,"Multi-variate, Time Varying, and Comparative Visualization with Contextual Cues",10.1109/TVCG.2006.164,http://dx.doi.org/10.1109/TVCG.2006.164,909,916,J,"Time-varying, multi-variate, and comparative data sets are not easily visualized due to the amount of data that is presented to the user at once. By combining several volumes together with different operators into one visualized volume, the user is able to compare values from different data sets in space over time, run, or field without having to mentally switch between different renderings of individual data sets. In this paper, we propose using a volume shader where the user is given the ability to easily select and operate on many data volumes to create comparison relationships. The user specifies an expression with set and numerical operations and her data to see relationships between data fields. Furthermore, we render the contextual information of the volume shader by converting it to a volume tree. We visualize the different levels and nodes of the volume tree so that the user can see the results of suboperations. This gives the user a deeper understanding of the final visualization, by seeing how the parts of the whole are operationally constructed",Jonathan Woodring;Han-Wei Shen,Jonathan Woodring;Han-wei Shen,,10.1109/VISUAL.1993.398869;10.1109/VISUAL.2005.1532856;10.1109/VISUAL.2004.95;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2003.1250402;10.1109/VISUAL.1992.235222,"multi-variate, time-varying, comparative, focus + context",61,50,22,
VAST,2008,Visual analytics for complex concepts using a human cognition model,10.1109/VAST.2008.4677361,http://dx.doi.org/10.1109/VAST.2008.4677361,91,98,C,"As the information being visualized and the process of understanding that information both become increasingly complex, it is necessary to develop new visualization approaches that facilitate the flow of human reasoning. In this paper, we endeavor to push visualization design a step beyond current user models by discussing a modeling framework of human ldquohigher cognition.rdquo Based on this cognition model, we present design guidelines for the development of visual interfaces designed to maximize the complementary cognitive strengths of both human and computer. Some of these principles are already being reflected in the better visual analytics designs, while others have not yet been applied or fully applied. But none of the guidelines have explained the deeper rationale that the model provides. Lastly, we discuss and assess these visual analytics guidelines through the evaluation of several visualization examples.",Tera Marie Green;William Ribarsky;Brian D. Fisher,Tera Marie Green;William Ribarsky;Brian Fisher,"Charlotte Visualization Center, University of North Carolina, USA;Charlotte Visualization Center, University of North Carolina, USA;School of Interactive Arts and Technology, Simon Fraser University, Canada",10.1109/VISUAL.2005.1532781;10.1109/VAST.2006.261425;10.1109/TVCG.2007.70574;10.1109/VAST.2007.4389006;10.1109/VAST.2007.4389005;10.1109/VAST.2007.4389009;10.1109/INFVIS.1995.528686,"visual analytics, cognition and perception theory, embodied cognition, visualization taxonomies and models",61,45,34,
InfoVis,2011,Brushing Dimensions - A Dual Visual Analysis Model for High-Dimensional Data,10.1109/TVCG.2011.178,http://dx.doi.org/10.1109/TVCG.2011.178,2591,2599,J,"In many application fields, data analysts have to deal with datasets that contain many expressions per item. The effective analysis of such multivariate datasets is dependent on the user's ability to understand both the intrinsic dimensionality of the dataset as well as the distribution of the dependent values with respect to the dimensions. In this paper, we propose a visualization model that enables the joint interactive visual analysis of multivariate datasets with respect to their dimensions as well as with respect to the actual data values. We describe a dual setting of visualization and interaction in items space and in dimensions space. The visualization of items is linked to the visualization of dimensions with brushing and focus+context visualization. With this approach, the user is able to jointly study the structure of the dimensions space as well as the distribution of data items with respect to the dimensions. Even though the proposed visualization model is general, we demonstrate its application in the context of a DNA microarray data analysis.",Cagatay Turkay;Peter Filzmoser;Helwig Hauser,Cagatay Turkay;Peter Filzmoser;Helwig Hauser,University of Bergen;Vienna University of Technology;University of Bergen,10.1109/INFVIS.2000.885086;10.1109/VISUAL.1994.346302;10.1109/TVCG.2008.116;10.1109/TVCG.2009.199;10.1109/VISUAL.1995.485139;10.1109/VAST.2009.5332611;10.1109/INFVIS.2004.60;10.1109/INFVIS.2004.3;10.1109/VAST.2009.5333431,"Interactive visual analysis, High-dimensional data analysis",61,53,38,
VAST,2011,Visual analysis of route diversity,10.1109/VAST.2011.6102455,http://dx.doi.org/10.1109/VAST.2011.6102455,171,180,C,"Route suggestion is an important feature of GPS navigation systems. Recently, Microsoft T-drive has been enabled to suggest routes chosen by experienced taxi drivers for given source/destination pairs in given time periods, which often take less time than the routes calculated according to distance. However, in real environments, taxi drivers may use different routes to reach the same destination, which we call route diversity. In this paper we first propose a trajectory visualization method that examines the regions where the diversity exists and then develop several novel visualization techniques to display the high dimensional attributes and statistics associated with different routes to help users analyze diversity patterns. Our techniques have been applied to the real trajectory data of thousands of taxis and some interesting findings about route diversity have been obtained. We further demonstrate that our system can be used not only to suggest better routes for drivers but also to analyze traffic bottlenecks for transportation management.",He Liu;Yuan Gao;Lu Lu;Siyuan Liu;Huamin Qu;Lionel M. Ni,He Liu;Yuan Gao;Lu Lu;Siyuan Liu;Huamin Qu;Lionel M. Ni,"The Hong Kong University of Science and Technology, China;The Hong Kong University of Science and Technology, China;The Hong Kong University of Science and Technology, China;The Hong Kong University of Science and Technology, China;The Hong Kong University of Science and Technology, China;The Hong Kong University of Science and Technology, China",10.1109/INFVIS.2004.27;10.1109/VAST.2008.4677356;10.1109/TVCG.2008.149;10.1109/TVCG.2007.70570;10.1109/TVCG.2007.70574;10.1109/TVCG.2006.202;10.1109/VAST.2009.5332593;10.1109/TVCG.2007.70561;10.1109/TVCG.2009.145;10.1109/TVCG.2010.180,,61,59,30,
VAST,2014,Opening the Black Box: Strategies for Increased User Involvement in Existing Algorithm Implementations,10.1109/TVCG.2014.2346578,http://dx.doi.org/10.1109/TVCG.2014.2346578,1643,1652,J,"An increasing number of interactive visualization tools stress the integration with computational software like MATLAB and R to access a variety of proven algorithms. In many cases, however, the algorithms are used as black boxes that run to completion in isolation which contradicts the needs of interactive data exploration. This paper structures, formalizes, and discusses possibilities to enable user involvement in ongoing computations. Based on a structured characterization of needs regarding intermediate feedback and control, the main contribution is a formalization and comparison of strategies for achieving user involvement for algorithms with different characteristics. In the context of integration, we describe considerations for implementing these strategies either as part of the visualization tool or as part of the algorithm, and we identify requirements and guidelines for the design of algorithmic APIs. To assess the practical applicability, we provide a survey of frequently used algorithm implementations within R regarding the fulfillment of these guidelines. While echoing previous calls for analysis modules which support data exploration more directly, we conclude that a range of pragmatic options for enabling user involvement in ongoing computations exists on both the visualization and algorithm side and should be used.",Thomas Mühlbacher;Harald Piringer;Samuel Gratzl;Michael Sedlmair;Marc Streit,Thomas Mühlbacher;Harald Piringer;Samuel Gratzl;Michael Sedlmair;Marc Streit,"VRVis Research Center, Vienna, Austria;VRVis Research Center, Vienna, Austria;Johannes Kepler University, Linz, Austria;University of Vienna, Austria;Johannes Kepler University, Linz, Austria",10.1109/VAST.2012.6400486;10.1109/VAST.2007.4388999;10.1109/VAST.2011.6102449;10.1109/TVCG.2007.70515;10.1109/TVCG.2009.151;10.1109/TVCG.2014.2346321;10.1109/VAST.2008.4677350;10.1109/TVCG.2006.171;10.1109/TVCG.2013.212;10.1109/TVCG.2013.125;10.1109/INFVIS.2002.1173145;10.1109/TVCG.2009.110;10.1109/INFVIS.2004.60;10.1109/VAST.2011.6102453;10.1109/TVCG.2012.195;10.1109/INFVIS.2003.1249014;10.1109/TVCG.2011.229,"Visual analytics infrastructures, integration, interactive algorithms, user involvement, problem subdivision",61,60,52,
Vis,1994,Visualizing 3D velocity fields near contour surfaces,10.1109/VISUAL.1994.346312,http://dx.doi.org/10.1109/VISUAL.1994.346312,248,"255, C28",C,"Vector field rendering is difficult in 3D because the vector icons overlap and hide each other. We propose four different techniques for visualizing vector fields only near surfaces. The first uses motion blurred particles in a thickened region around the surface. The second uses a voxel grid to contain integral curves of the vector field. The third uses many antialiased lines through the surface, and the fourth uses hairs sprouting from the surface and then bending in the direction of the vector field. All the methods use the graphics pipeline, allowing real time rotation and interaction, and the first two methods can animate the texture to move in the flow determined by the velocity field.&lt;&lt;ETX&gt;&gt;",Nelson L. Max;Roger Crawfis;Charles Grant,N. Max;R. Crawfis;C. Grant,"Lawrence Livermore Nat. Lab., CA, USA;Lawrence Livermore Nat. Lab., CA, USA;Lawrence Livermore Nat. Lab., CA, USA",10.1109/VISUAL.1993.398877;10.1109/VISUAL.1994.346313,,60,37,10,
Vis,1995,Compression domain rendering of time-resolved volume data,10.1109/VISUAL.1995.480809,http://dx.doi.org/10.1109/VISUAL.1995.480809,168,"175, 450",C,"An important challenge in the visualization of three-dimensional volume data is the efficient processing and rendering of time-resolved sequences. Only the use of compression techniques, which allow the reconstruction of the original domain from the compressed one locally, makes it possible to evaluate these sequences in their entirety. In this paper, a new approach for the extraction and visualization of so-called time features from within time-resolved volume data is presented. Based on the asymptotic decay of multiscale representations of spatially localized time evolutions of the data, singular points can be discriminated. Also, the corresponding Lipschitz exponents, which describe the signals' local regularity, can be determined, and can be taken as a measure of the variation in time. The compression ratio and the comprehension of the underlying signal is improved if we first restore the extracted regions which contain the most important information.",Rüdiger Westermann,R. Westermann,"German Nat. Res. Center for Comput. Sci., St. Augustin, Germany",10.1109/VISUAL.1990.146391;10.1109/VISUAL.1992.235230,"volume rendering, wavelet transforms, singularities, Lipschitz exponents",60,29,21,
Vis,1996,Cheops: a compact explorer for complex hierarchies,10.1109/VISUAL.1996.567745,http://dx.doi.org/10.1109/VISUAL.1996.567745,87,92,C,"As the amount of electronic information explodes, hierarchies to handle this information become huge and complex. Visualizing and interacting with these hierarchies become daunting tasks. The problem is exacerbated if the visualization is to be done on mass-market personal computers, with limited processing power and visual resolution. Many of the current visualization techniques work effectively for hierarchies of 1000 nodes, but as the number of nodes increases toward 5000, these techniques tend to break down. Hierarchies above 5000 nodes usually require special modifications such as clustering, which can affect visual stability. This paper introduces Cheops, a novel approach to the representation, browsing and exploration of huge, complex information hierarchies such as the Dewey Decimal Classification system, which can contain between a million and a billion nodes. The Cheops approach maintains context within a huge hierarchy, while simultaneously providing easy access to details. This paper presents some preliminary results from usability tests performed on an 8-wide-by-9-deep classification hierarchy, which if fully populated would contain over 19 million nodes.",Luc Beaudoin;Marc-Antoine Parent;Louis C. Vroomen,L. Beaudoin;M.-A. Parent;L.C. Vroomen,"Centre de Recherche Inf. de Montreal, Que.,, Canada",10.1109/INFVIS.1995.528689,"Hierarchical representation, information visualization and exploration, focus+context techniques, graphical browser",60,18,10,
Vis,1997,Interactive volume rendering for virtual colonoscopy,10.1109/VISUAL.1997.663915,http://dx.doi.org/10.1109/VISUAL.1997.663915,433,436,C,"3D virtual colonoscopy has recently been proposed as a non-invasive alternative procedure for the visualization of the human colon. Surface rendering is sufficient for implementing such a procedure to obtain an overview of the interior surface of the colon at interactive rendering speeds. Unfortunately, physicians can not use it to explore tissues beneath the surface to differentiate between benign and malignant structures. In this paper, we present a direct volume rendering approach based on perspective ray casting, as a supplement to the surface navigation. To accelerate the rendering speed, surface-assistant techniques are used to adapt the resampling rates by skipping the empty space inside the colon. In addition, a parallel version of the algorithm has been implemented on a shared-memory multiprocessing architecture. Experiments have been conducted on both simulation and patient data sets.",Suya You;Lichan Hong;Ming Wan;Kittiboon Junyaprasert;Arie E. Kaufman;Shigeru Muraki;Yong Zhou 0001;Mark Wax;Zhengrong Liang,Suya You;Lichan Hong;Ming Wan;K. Junyaprasert;A. Kaufman;S. Muraki;Yong Zhou;M. Wax;Zhengrong Liang,"Center for Visual Comput., State Univ. of New York, Stony Brook, NY, USA",,"Virtual Colonoscopy,Endoscopy,Visibility,Interactive Navigation,Volume Rendering,Surface Rendering, Parallel Processing, Virtual Environment",60,2,11,
InfoVis,1998,WEBPATH-a three dimensional Web history,10.1109/INFVIS.1998.729553,http://dx.doi.org/10.1109/INFVIS.1998.729553,3,"10, 148",C,"A number of usability studies report that many users of the WWW cannot find pages already visited, additionally many users cannot visualise where they are, or where they have been browsing. Currently, readily available WWW browsers provide history mechanisms that offer little or no support in the presentation and manipulation of visited sites. Manipulation and presentation of usage data, such as a browse history has been used in a number of cases to aid users in searching for previously attained data, and to teach or assist other users in their browse or searching techniques. The paper presents a virtual reality (VR) based application to be used alongside traditional Web browsers, which provides them with a flexibly tailorable real time visualisation of their history.",Emmanuel Frécon;Gareth Smith,E. Frecon;G. Smith,"Swedish Inst. of Comput. Sci., Sweden",,"Virtual Environments, World-Wide-Web,Visualisation, Web Browsing",60,16,18,
Vis,2003,Clifford convolution and pattern matching on vector fields,10.1109/VISUAL.2003.1250372,http://dx.doi.org/10.1109/VISUAL.2003.1250372,193,200,C,"The goal of this paper is to define a convolution operation which transfers image processing and pattern matching to vector fields from flow visualization. For this, a multiplication of vectors is necessary. Clifford algebra provides such a multiplication of vectors. We define a Clifford convolution on vector fields with uniform grids. The Clifford convolution works with multivector filter masks. Scalar and vector masks can be easily converted to multivector fields. So, filter masks from image processing on scalar fields can be applied as well as vector and scalar masks. Furthermore, a method for pattern matching with Clifford convolution on vector fields is described. The method is independent of the direction of the structures. This provides an automatic approach to feature detection. The features can be visualized using any known method like glyphs, isosurfaces or streamlines. The features are defined by filter masks instead of analytical properties and thus the approach is more intuitive.",Julia Ebling;Gerik Scheuermann,J. Ebling;G. Scheuermann,"Kaiserslautern, Germany;Kaiserslautern, Germany",10.1109/VISUAL.2000.885716;10.1109/VISUAL.1997.663858," Flow Visualization, Convolution, Pattern Matching",60,29,13,
Vis,2006,High-Quality Extraction of Isosurfaces from Regular and Irregular Grids,10.1109/TVCG.2006.149,http://dx.doi.org/10.1109/TVCG.2006.149,1205,1212,J,"Isosurfaces are ubiquitous in many fields, including visualization, graphics, and vision. They are often the main computational component of important processing pipelines (e.g., surface reconstruction), and are heavily used in practice. The classical approach to compute isosurfaces is to apply the Marching Cubes algorithm, which although robust and simple to implement, generates surfaces that require additional processing steps to improve triangle quality and mesh size. An important issue is that in some cases, the surfaces generated by Marching Cubes are irreparably damaged, and important details are lost which can not be recovered by subsequent processing. The main motivation of this work is to develop a technique capable of constructing high-quality and high-fidelity isosurfaces. We propose a new advancing front technique that is capable of creating high-quality isosurfaces from regular and irregular volumetric datasets. Our work extends the guidance field framework of Schreiner et al. to implicit surfaces, and improves it in significant ways. In particular, we describe a set of sampling conditions that guarantee that surface features will be captured by the algorithm. We also describe an efficient technique to compute a minimal guidance field, which greatly improves performance. Our experimental results show that our technique can generate high-quality meshes from complex datasets",John M. Schreiner;Carlos Scheidegger;Cláudio T. Silva,John Schreiner;Carlos Scheidegger;Claudio Silva,SCI Institute at the University of Utah;SCI Institute at the University of Utah;SCI Institute at the University of Utah,10.1109/VISUAL.1991.175782;10.1109/VISUAL.2000.885705;10.1109/VISUAL.1997.663930;10.1109/VISUAL.2003.1250414;10.1109/VISUAL.2004.52,"Isosurface Extraction, Curvature, Advancing Front",60,49,51,
Vis,2008,Brushing of Attribute Clouds for the Visualization of Multivariate Data,10.1109/TVCG.2008.116,http://dx.doi.org/10.1109/TVCG.2008.116,1459,1466,J,"The visualization and exploration of multivariate data is still a challenging task. Methods either try to visualize all variables simultaneously at each position using glyph-based approaches or use linked views for the interaction between attribute space and physical domain such as brushing of scatterplots. Most visualizations of the attribute space are either difficult to understand or suffer from visual clutter. We propose a transformation of the high-dimensional data in attribute space to 2D that results in a point cloud, called attribute cloud, such that points with similar multivariate attributes are located close to each other. The transformation is based on ideas from multivariate density estimation and manifold learning. The resulting attribute cloud is an easy to understand visualization of multivariate data in two dimensions. We explain several techniques to incorporate additional information into the attribute cloud, that help the user get a better understanding of multivariate data. Using different examples from fluid dynamics and climate simulation, we show how brushing can be used to explore the attribute cloud and find interesting structures in physical space.",Heike Leitte;Michael Böttinger;Gerik Scheuermann,Heike Jänicke;Michael Böttinger;Gerik Scheuermann,University of Leipzig;German Climate Computing Centre (DKRZ);University of Leipzig,10.1109/INFVIS.2003.1249024;10.1109/INFVIS.2002.1173157;10.1109/VISUAL.1995.485139;10.1109/INFVIS.1999.801858;10.1109/VISUAL.1996.567800;10.1109/VISUAL.2004.113;10.1109/VISUAL.1998.745289,"Multivariate data, brushing, data transformation, manifold learning, linked views",60,50,25,
InfoVis,2011,Human-Centered Approaches in Geovisualization Design: Investigating Multiple Methods Through a Long-Term Case Study,10.1109/TVCG.2011.209,http://dx.doi.org/10.1109/TVCG.2011.209,2498,2507,J,"Working with three domain specialists we investigate human-centered approaches to geovisualization following an ISO13407 taxonomy covering context of use, requirements and early stages of design. Our case study, undertaken over three years, draws attention to repeating trends: that generic approaches fail to elicit adequate requirements for geovis application design; that the use of real data is key to understanding needs and possibilities; that trust and knowledge must be built and developed with collaborators. These processes take time but modified human-centred approaches can be effective. A scenario developed through contextual inquiry but supplemented with domain data and graphics is useful to geovis designers. Wireframe, paper and digital prototypes enable successful communication between specialist and geovis domains when incorporating real and interesting data, prompting exploratory behaviour and eliciting previously unconsidered requirements. Paper prototypes are particularly successful at eliciting suggestions, especially for novel visualization. Enabling specialists to explore their data freely with a digital prototype is as effective as using a structured task protocol and is easier to administer. Autoethnography has potential for framing the design process. We conclude that a common understanding of context of use, domain data and visualization possibilities are essential to successful geovis design and develop as this progresses. HC approaches can make a significant contribution here. However, modified approaches, applied with flexibility, are most promising. We advise early, collaborative engagement with data - through simple, transient visual artefacts supported by data sketches and existing designs - before moving to successively more sophisticated data wireframes and data prototypes.",David Lloyd 0002;Jason Dykes,David Lloyd;Jason Dykes,"giCentre, City University London;giCentre, City University London",10.1109/TVCG.2010.191;10.1109/TVCG.2009.174,"Evaluation, geovisualization, context of use, requirements, field study, prototypes, sketching, design",60,49,70,
Vis,2011,WYSIWYG (What You See is What You Get) Volume Visualization,10.1109/TVCG.2011.261,http://dx.doi.org/10.1109/TVCG.2011.261,2106,2114,J,"In this paper, we propose a volume visualization system that accepts direct manipulation through a sketch-based What You See Is What You Get (WYSIWYG) approach. Similar to the operations in painting applications for 2D images, in our system, a full set of tools have been developed to enable direct volume rendering manipulation of color, transparency, contrast, brightness, and other optical properties by brushing a few strokes on top of the rendered volume image. To be able to smartly identify the targeted features of the volume, our system matches the sparse sketching input with the clustered features both in image space and volume space. To achieve interactivity, both special algorithms to accelerate the input identification and feature matching have been developed and implemented in our system. Without resorting to tuning transfer function parameters, our proposed system accepts sparse stroke inputs and provides users with intuitive, flexible and effective interaction during volume data exploration and visualization.",Hanqi Guo 0001;Ningyu Mao;Xiaoru Yuan,Hanqi Guo;Ningyu Mao;Xiaoru Yuan,"Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University / Center for Computational Science and Engineering, Peking University, Beijing, P.R. China;Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University;Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University / Center for Computational Science and Engineering, Peking University, Beijing, P.R. China",10.1109/TVCG.2010.145;10.1109/VISUAL.1998.745319;10.1109/TVCG.2008.120;10.1109/VISUAL.2003.1250414;10.1109/TVCG.2007.70591;10.1109/VISUAL.1996.568113;10.1109/TVCG.2009.189;10.1109/TVCG.2008.162;10.1109/VISUAL.2003.1250386;10.1109/VISUAL.2003.1250413;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2005.1532856;10.1109/VISUAL.1997.663875;10.1109/TVCG.2006.148,"Volume rendering, Sketching input, Human-computer interaction, Transfer functions, Feature space",60,51,38,
VAST,2012,Subspace search and visualization to make sense of alternative clusterings in high-dimensional data,10.1109/VAST.2012.6400488,http://dx.doi.org/10.1109/VAST.2012.6400488,63,72,C,"In explorative data analysis, the data under consideration often resides in a high-dimensional (HD) data space. Currently many methods are available to analyze this type of data. So far, proposed automatic approaches include dimensionality reduction and cluster analysis, whereby visual-interactive methods aim to provide effective visual mappings to show, relate, and navigate HD data. Furthermore, almost all of these methods conduct the analysis from a singular perspective, meaning that they consider the data in either the original HD data space, or a reduced version thereof. Additionally, HD data spaces often consist of combined features that measure different properties, in which case the particular relationships between the various properties may not be clear to the analysts a priori since it can only be revealed if appropriate feature combinations (subspaces) of the data are taken into consideration. Considering just a single subspace is, however, often not sufficient since different subspaces may show complementary, conjointly, or contradicting relations between data items. Useful information may consequently remain embedded in sets of subspaces of a given HD input data space. Relying on the notion of subspaces, we propose a novel method for the visual analysis of HD data in which we employ an interestingness-guided subspace search algorithm to detect a candidate set of subspaces. Based on appropriately defined subspace similarity functions, we visualize the subspaces and provide navigation facilities to interactively explore large sets of subspaces. Our approach allows users to effectively compare and relate subspaces with respect to involved dimensions and clusters of objects. We apply our approach to synthetic and real data sets. We thereby demonstrate its support for understanding HD data from different perspectives, effectively yielding a more complete view on HD data.",Andrada Tatu;Fabian Maass;Ines Färber;Enrico Bertini;Tobias Schreck;Thomas Seidl 0001;Daniel A. Keim,Andrada Tatu;Fabian Maaß;Ines Färber;Enrico Bertini;Tobias Schreck;Thomas Seidl;Daniel Keim,"University of Konstanz, Germany;University of Konstanz, Germany;RWTH Aachen University Germany;University of Konstanz, Germany;University of Konstanz, Germany;RWTH Aachen University Germany;University of Konstanz Germany",10.1109/INFVIS.2005.1532142;10.1109/TVCG.2010.138;10.1109/VAST.2010.5652392;10.1109/INFVIS.2004.71;10.1109/VAST.2010.5652450;10.1109/VAST.2011.6102439;10.1109/TVCG.2011.188;10.1109/INFVIS.2004.3;10.1109/TVCG.2009.153,,60,41,35,
InfoVis,2014,Learning Perceptual Kernels for Visualization Design,10.1109/TVCG.2014.2346978,http://dx.doi.org/10.1109/TVCG.2014.2346978,1933,1942,J,"Visualization design can benefit from careful consideration of perception, as different assignments of visual encoding variables such as color, shape and size affect how viewers interpret data. In this work, we introduce perceptual kernels: distance matrices derived from aggregate perceptual judgments. Perceptual kernels represent perceptual differences between and within visual variables in a reusable form that is directly applicable to visualization evaluation and automated design. We report results from crowd-sourced experiments to estimate kernels for color, shape, size and combinations thereof. We analyze kernels estimated using five different judgment types-including Likert ratings among pairs, ordinal triplet comparisons, and manual spatial arrangement-and compare them to existing perceptual models. We derive recommendations for collecting perceptual similarities, and then demonstrate how the resulting kernels can be applied to automate visualization design decisions.",Çagatay Demiralp;Michael S. Bernstein;Jeffrey Heer,Çağatay Demiralp;Michael S. Bernstein;Jeffrey Heer,Stanford University;Stanford University;University of Washington,10.1109/TVCG.2010.186;10.1109/TVCG.2006.163;10.1109/TVCG.2007.70594;10.1109/TVCG.2011.167;10.1109/TVCG.2007.70583;10.1109/TVCG.2008.125;10.1109/TVCG.2010.130;10.1109/TVCG.2007.70539,"Visualization, design, encoding, perception, model, crowdsourcing, automated visualization, visual embedding",60,43,47,
InfoVis,2014,A Principled Way of Assessing Visualization Literacy,10.1109/TVCG.2014.2346984,http://dx.doi.org/10.1109/TVCG.2014.2346984,1963,1972,J,"We describe a method for assessing the visualization literacy (VL) of a user. Assessing how well people understand visualizations has great value for research (e. g., to avoid confounds), for design (e. g., to best determine the capabilities of an audience), for teaching (e. g., to assess the level of new students), and for recruiting (e. g., to assess the level of interviewees). This paper proposes a method for assessing VL based on Item Response Theory. It describes the design and evaluation of two VL tests for line graphs, and presents the extension of the method to bar charts and scatterplots. Finally, it discusses the reimplementation of these tests for fast, effective, and scalable web-based use.",Jeremy Boy;Ronald A. Rensink;Enrico Bertini;Jean-Daniel Fekete,Jeremy Boy;Ronald A. Rensink;Enrico Bertini;Jean-Daniel Fekete,"Inria, Telecom ParisTech, EnsadLab;University of British Columbia;NYU Polytechnic School of Engineering;Inria",10.1109/TVCG.2011.160,"Literacy, Visualization literacy, Rasch Model, Item Response Theory",60,52,52,
SciVis,2014,City Forensics: Using Visual Elements to Predict Non-Visual City Attributes,10.1109/TVCG.2014.2346446,http://dx.doi.org/10.1109/TVCG.2014.2346446,2624,2633,J,"We present a method for automatically identifying and validating predictive relationships between the visual appearance of a city and its non-visual attributes (e.g. crime statistics, housing prices, population density etc.). Given a set of street-level images and (location, city-attribute-value) pairs of measurements, we first identify visual elements in the images that are discriminative of the attribute. We then train a predictor by learning a set of weights over these elements using non-linear Support Vector Regression. To perform these operations efficiently, we implement a scalable distributed processing framework that speeds up the main computational bottleneck (extracting visual elements) by an order of magnitude. This speedup allows us to investigate a variety of city attributes across 6 different American cities. We find that indeed there is a predictive relationship between visual elements and a number of city attributes including violent crime rates, theft rates, housing prices, population density, tree presence, graffiti presence, and the perception of danger. We also test human performance for predicting theft based on street-level images and show that our predictor outperforms this baseline with 33% higher accuracy on average. Finally, we present three prototype applications that use our system to (1) define the visual boundary of city neighborhoods, (2) generate walking directions that avoid or seek out exposure to city attributes, and (3) validate user-specified visual elements for prediction.",Sean M. Arietta;Alexei A. Efros;Ravi Ramamoorthi;Maneesh Agrawala,Sean M. Arietta;Alexei A. Efros;Ravi Ramamoorthi;Maneesh Agrawala,"EECS Department, University of California, Berkeley;EECS Department, University of California, Berkeley;CSE Department, University of California, San Diego;EECS Department, University of California, Berkeley",,"Data mining, big data, computational geography, visual processing",60,51,49,HM
Vis,1997,Architectural walkthroughs using portal textures,10.1109/VISUAL.1997.663903,http://dx.doi.org/10.1109/VISUAL.1997.663903,355,362,C,This paper outlines a method to dynamically replace portals with textures in a cell-partitioned model. The rendering complexity is reduced to the geometry of the current cell thus increasing interactive performance. A portal is a generalization of windows and doors. It connects two adjacent cells (or rooms). Each portal of the current cell that is some distance away from the viewpoint is rendered as a texture. The portal texture (smoothly) returns to geometry when the viewpoint gets close to the portal. This way all portal sequences (not too close to the viewpoint) have a depth complexity of one. The size of each texture and distance at which the transition occurs is configurable for each portal.,Daniel G. Aliaga;Anselmo Lastra,D.G. Aliaga;A.A. Lastra,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.1996.567774,"visibility culling, cells, portals, textures, sample points, morphing",59,18,13,
Vis,1998,Simplification of tetrahedral meshes,10.1109/VISUAL.1998.745315,http://dx.doi.org/10.1109/VISUAL.1998.745315,287,295,C,"We present a method for the construction of multiple levels of tetrahedral meshes approximating a trivariate function at different levels of detail. Starting with an initial, high-resolution triangulation of a three-dimensional region, we construct coarser representation levels by collapsing tetrahedra. Each triangulation defines a linear spline function, where the function values associated with the vertices are the spline coefficients. Based on predicted errors, we collapse tetrahedron in the grid that do not cause the maximum error to exceed a use-specified threshold. Bounds are stored for individual tetrahedra and are updated as the mesh is simplified. We continue the simplification process until a certain error is reached. The result is a hierarchical data description suited for the efficient visualization of large data sets at varying levels of detail.",Issac J. Trotts;Bernd Hamann;Kenneth I. Joy;David F. Wiley,I.J. Trotts;B. Hamann;K.I. Joy;D.F. Wiley,"Center for Image Process. & Integrated Comput., California Univ., Davis, CA, USA",10.1109/VISUAL.1996.568126;10.1109/VISUAL.1996.568124;10.1109/VISUAL.1997.663906,"approximation, hierarchical representation, mesh generation, multiresolution method, scattered data, spline, triangulation, visualization",59,24,18,
Vis,1998,Real-time techniques for 3D flow visualization,10.1109/VISUAL.1998.745317,http://dx.doi.org/10.1109/VISUAL.1998.745317,305,312,C,"Visualization of three-dimensional steady flow has to overcome a lot of problems to be effective. Among them are occlusion of distant details, lack of directional and depth hints and occlusion. We present methods which address these problems for real-time graphic representations applicable in virtual environments. We use dashtubes, i.e., animated, opacity-mapped streamlines, as a visualization icon for 3D-flow visualization. We present a texture mapping technique to keep the level of texture detail along a streamline nearly constant even when the velocity of the flow varies considerably. An algorithm is described which distributes the dashtubes evenly in space. We apply magic lenses and magic boxes as interaction techniques for investigating densely filled areas without overwhelming the observer with visual detail. Implementation details of these methods and their integration in our virtual environment conclude the paper.",Anton L. Fuhrmann;M. Eduard Gröller,A. Fuhrmann;E. Groller,"Inst. of Comput. Graphics, Wien Univ., Austria",10.1109/VISUAL.1994.346312;10.1109/VISUAL.1997.663897;10.1109/VISUAL.1997.663921;10.1109/VISUAL.1991.175771;10.1109/VISUAL.1997.663912;10.1109/VISUAL.1993.398877,"virtual environments, flow visualization, texturing, interaction, magic lens, focussing",59,23,22,
InfoVis,2004,A History Mechanism for Visual Data Mining,10.1109/INFVIS.2004.2,http://dx.doi.org/10.1109/INFVIS.2004.2,49,56,C,"A major challenge of current visualization and visual data mining (VDM) frameworks is to support users in the orientation in complex visual mining scenarios. An important aspect to increase user support and user orientation is to use a history mechanism that, first of all, provides un- and redoing functionality. In this paper, we present a new approach to include such history functionality into a VDM framework. Therefore, we introduce the theoretical background, outline design and implementation aspects of a history management unit, and conclude with a discussion showing the usefulness of our history management in a VDM framework",Matthias Kreuseler;Thomas Nocke;Heidrun Schumann,M. Kreuseler;T. Nocke;H. Schumann,SD Industries GmbH,10.1109/INFVIS.1998.729560;10.1109/VISUAL.2002.1183791;10.1109/VISUAL.2000.885676;10.1109/INFVIS.2003.1249009;10.1109/VISUAL.1999.809871,"Visual data mining, Visualization, History, Undo/Redo",59,31,19,
Vis,2005,Illustration-inspired techniques for visualizing time-varying data,10.1109/VISUAL.2005.1532857,http://dx.doi.org/10.1109/VISUAL.2005.1532857,679,686,C,"Traditionally, time-varying data has been visualized using snapshots of the individual time steps or an animation of the snapshots shown in a sequential manner. For larger datasets with many time-varying features, animation can be limited in its use, as an observer can only track a limited number of features over the last few frames. Visually inspecting each snapshot is not practical either for a large number of time-steps. We propose new techniques inspired from the illustration literature to convey change over time more effectively in a time-varying dataset. Speedlines are used extensively by cartoonists to convey motion, speed, or change over different panels. Flow ribbons are another technique used by cartoonists to depict motion in a single frame. Strobe silhouettes are used to depict previous positions of an object to convey the previous positions of the object to the user. These illustration-inspired techniques can be used in conjunction with animation to convey change over time.",Alark Joshi;Penny Rheingans,A. Joshi;P. Rheingans,"Maryland Univ., Baltimore, MD, USA;Maryland Univ., Baltimore, MD, USA",10.1109/VISUAL.2001.964520;10.1109/VISUAL.1999.809910;10.1109/VISUAL.1994.346321;10.1109/VISUAL.1996.567807;10.1109/VISUAL.1999.809879;10.1109/VISUAL.2005.1532858;10.1109/VISUAL.2002.1183777;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2003.1250386,"Flow visualization, Non-photorealistic rendering, time-varying data, illustration",59,14,24,
VAST,2010,Anomaly detection in GPS data based on visual analytics,10.1109/VAST.2010.5652467,http://dx.doi.org/10.1109/VAST.2010.5652467,51,58,C,"Modern machine learning techniques provide robust approaches for data-driven modeling and critical information extraction, while human experts hold the advantage of possessing high-level intelligence and domain-specific expertise. We combine the power of the two for anomaly detection in GPS data by integrating them through a visualization and human-computer interaction interface. In this paper we introduce GPSvas (GPS Visual Analytics System), a system that detects anomalies in GPS data using the approach of visual analytics: a conditional random field (CRF) model is used as the machine learning component for anomaly detection in streaming GPS traces. A visualization component and an interactive user interface are built to visualize the data stream, display significant analysis results (i.e., anomalies or uncertain predications) and hidden information extracted by the anomaly detection model, which enable human experts to observe the real-time data behavior and gain insights into the data flow. Human experts further provide guidance to the machine learning model through the interaction tools; the learning model is then incrementally improved through an active learning procedure.",Zicheng Liao;Yizhou Yu;Baoquan Chen,Zicheng Liao;Yizhou Yu;Baoquan Chen,"University of Illinois at Urbana-Champaign;University of Illinois at Urbana-Champaign;Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences",10.1109/TVCG.2009.145,,59,45,28,
VAST,2010,Understanding text corpora with multiple facets,10.1109/VAST.2010.5652931,http://dx.doi.org/10.1109/VAST.2010.5652931,99,106,C,"Text visualization becomes an increasingly more important research topic as the need to understand massive-scale textual information is proven to be imperative for many people and businesses. However, it is still very challenging to design effective visual metaphors to represent large corpora of text due to the unstructured and high-dimensional nature of text. In this paper, we propose a data model that can be used to represent most of the text corpora. Such a data model contains four basic types of facets: time, category, content (unstructured), and structured facet. To understand the corpus with such a data model, we develop a hybrid visualization by combining the trend graph with tag-clouds. We encode the four types of data facets with four separate visual dimensions. To help people discover evolutionary and correlation patterns, we also develop several visual interaction methods that allow people to interactively analyze text by one or more facets. Finally, we present two case studies to demonstrate the effectiveness of our solution in support of multi-faceted visual analysis of text corpora.",Lei Shi 0002;Furu Wei;Shixia Liu;Li Tan;Xiaoxiao Lian;Michelle X. Zhou,Lei Shi;Furu Wei;Shixia Liu;Li Tan;Xiaoxiao Lian;Michelle X. Zhou,"IBM Research - China, 19 Zhongguancun Software Park, Beijing 100193, China;IBM Research - China, 19 Zhongguancun Software Park, Beijing 100193, China;IBM Research - China, 19 Zhongguancun Software Park, Beijing 100193, China;IBM Research - China, 19 Zhongguancun Software Park, Beijing 100193, China;IBM Research - China, 19 Zhongguancun Software Park, Beijing 100193, China;IBM Research - Almaden, 650 Harry Road San Jose, CA 95120, USA",10.1109/VAST.2009.5333443;10.1109/VAST.2007.4389005;10.1109/TVCG.2008.172;10.1109/TVCG.2009.171;10.1109/TVCG.2008.166;10.1109/TVCG.2009.165;10.1109/INFVIS.2002.1173155;10.1109/INFVIS.1999.801866;10.1109/VAST.2007.4389006;10.1109/INFVIS.2005.1532122;10.1109/INFVIS.2000.885097,"text visualization, multi-facet data visualization",59,30,29,
InfoVis,2011,Context-Preserving Visual Links,10.1109/TVCG.2011.183,http://dx.doi.org/10.1109/TVCG.2011.183,2249,2258,J,"Evaluating, comparing, and interpreting related pieces of information are tasks that are commonly performed during visual data analysis and in many kinds of information-intensive work. Synchronized visual highlighting of related elements is a well-known technique used to assist this task. An alternative approach, which is more invasive but also more expressive is visual linking in which line connections are rendered between related elements. In this work, we present context-preserving visual links as a new method for generating visual links. The method specifically aims to fulfill the following two goals: first, visual links should minimize the occlusion of important information; second, links should visually stand out from surrounding information by minimizing visual interference. We employ an image-based analysis of visual saliency to determine the important regions in the original representation. A consequence of the image-based approach is that our technique is application-independent and can be employed in a large number of visual data analysis scenarios in which the underlying content cannot or should not be altered. We conducted a controlled experiment that indicates that users can find linked elements in complex visualizations more quickly and with greater subjective satisfaction than in complex visualizations in which plain highlighting is used. Context-preserving visual links were perceived as visually more attractive than traditional visual links that do not account for the context information.",Markus Steinberger;Manuela Waldner;Marc Streit;Alexander Lex;Dieter Schmalstieg,Markus Steinberger;Manuela Waldner;Marc Streit;Alexander Lex;Dieter Schmalstieg,Graz University of Technology;Graz University of Technology;Graz University of Technology;Graz University of Technology;Graz University of Technology,10.1109/TVCG.2010.138;10.1109/INFVIS.2001.963286;10.1109/TVCG.2006.147;10.1109/TVCG.2009.122;10.1109/VISUAL.1995.485139;10.1109/TVCG.2010.174;10.1109/TVCG.2006.166;10.1109/TVCG.2007.70521,"Visual links, highlighting, connectedness, routing, image-based, saliency",59,50,33,BP
VAST,2011,Characterizing the intelligence analysis process: Informing visual analytics design through a longitudinal field study,10.1109/VAST.2011.6102438,http://dx.doi.org/10.1109/VAST.2011.6102438,21,30,C,"While intelligence analysis has been a primary target domain for visual analytics system development, relatively little user and task analysis has been conducted within this area. Our research community's understanding of the work processes and practices of intelligence analysts is not deep enough to adequately address their needs. Without a better understanding of the analysts and their problems, we cannot build visual analytics systems that integrate well with their work processes and truly provide benefit to them. In order to close this knowledge gap, we conducted a longitudinal, observational field study of intelligence analysts in training within the intelligence program at Mercyhurst College. We observed three teams of analysts, each working on an intelligence problem for a ten-week period. Based upon study findings, we describe and characterize processes and methods of intelligence analysis that we observed, make clarifications regarding the processes and practices, and suggest design implications for visual analytics systems for intelligence analysis.",Youn ah Kang;John T. Stasko,Youn-ah Kang;John Stasko,"Georgia Institute of Technology, USA;Georgia Institute of Technology, USA",10.1109/VAST.2008.4677362;10.1109/VISUAL.1992.235203;10.1109/VAST.2008.4677358;10.1109/TVCG.2009.111;10.1109/VAST.2007.4389006,"Intelligence analysis, qualitatvie user study",59,37,31,
InfoVis,2016,Immersive Collaborative Analysis of Network Connectivity: CAVE-style or Head-Mounted Display?,10.1109/TVCG.2016.2599107,http://dx.doi.org/10.1109/TVCG.2016.2599107,441,450,J,"High-quality immersive display technologies are becoming mainstream with the release of head-mounted displays (HMDs) such as the Oculus Rift. These devices potentially represent an affordable alternative to the more traditional, centralised CAVE-style immersive environments. One driver for the development of CAVE-style immersive environments has been collaborative sense-making. Despite this, there has been little research on the effectiveness of collaborative visualisation in CAVE-style facilities, especially with respect to abstract data visualisation tasks. Indeed, very few studies have focused on the use of these displays to explore and analyse abstract data such as networks and there have been no formal user studies investigating collaborative visualisation of abstract data in immersive environments. In this paper we present the results of the first such study. It explores the relative merits of HMD and CAVE-style immersive environments for collaborative analysis of network connectivity, a common and important task involving abstract data. We find significant differences between the two conditions in task completion time and the physical movements of the participants within the space: participants using the HMD were faster while the CAVE2 condition introduced an asymmetry in movement between collaborators. Otherwise, affordances for collaborative data analysis offered by the low-cost HMD condition were not found to be different for accuracy and communication with the CAVE2. These results are notable, given that the latest HMDs will soon be accessible (in terms of cost and potentially ubiquity) to a massive audience.",Maxime Cordeil;Tim Dwyer;Karsten Klein 0001;Bireswar Laha;Kim Marriott;Bruce H. Thomas,Maxime Cordeil;Tim Dwyer;Karsten Klein;Bireswar Laha;Kim Marriott;Bruce H. Thomas,"Monash University;Monash University;Monash University;Stanford University, USA;Monash University;University of South Australia",10.1109/VISUAL.2001.964545;10.1109/TVCG.2014.2346573;10.1109/VAST.2007.4389011;10.1109/TVCG.2006.156;10.1109/TVCG.2011.234,3D Network;Oculus Rift;CAVE;Immersive Analytics;Collaboration,59,59,41,
Vis,1997,Interval volume tetrahedrization,10.1109/VISUAL.1997.663886,http://dx.doi.org/10.1109/VISUAL.1997.663886,221,228,C,"The interval volume is a generalization of the isosurface commonly associated with the marching cubes algorithm. Based upon samples at the locations of a 3D rectilinear grid, the algorithm produces a triangular approximation to the surface defined by F(x,y,z)=c. The interval volume is defined by /spl alpha//spl les/F(x,y,z)/spl les//spl beta/. The authors describe an algorithm for computing a tetrahedrization of a polyhedral approximation to the interval volume.",Gregory M. Nielson;Junwon Sung,G.M. Nielson;Junwon Sung,"Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA",10.1109/VISUAL.1991.175782;10.1109/VISUAL.1995.480789,,58,29,6,
Vis,1998,Continuous cartogram construction,10.1109/VISUAL.1998.745303,http://dx.doi.org/10.1109/VISUAL.1998.745303,197,204,C,"Area cartograms are used for visualizing geographically distributed data by attaching measurements to regions of a map and scaling the regions such that their areas are proportional to the measured quantities. A continuous area cartogram is a cartogram that is constructed without changing the underlying map topology. We present a new algorithm for the construction of continuous area cartograms that was developed by viewing their construction as a constrained optimization problem. The algorithm uses a relaxation method that exploits hierarchical resolution, constrained dynamics, and a scheme that alternates goals of achieving correct region areas and adjusting region shapes. It is compared favorably to existing methods in its ability to preserve region shape recognition cues, while still achieving high accuracy.",Donald H. House;Christopher J. Kocmoud,D.H. House;C.J. Kocmoud,"Visualization Lab., Texas A&M Univ., College Station, TX, USA",,"cartogram, value-by-area map, map transformation,anamorphosis, thematic cartography, constrained optimization",58,11,0,
Vis,1999,Isosurface extraction techniques for Web-based volume visualization,10.1109/VISUAL.1999.809878,http://dx.doi.org/10.1109/VISUAL.1999.809878,139,519,C,"The reconstruction of isosurfaces from scalar volume data has positioned itself as a fundamental visualization technique in many different applications. But the dramatically increasing size of volumetric data sets often prohibits the handling of these models on affordable low-end single processor architectures. Distributed client-server systems integrating high-bandwidth transmission channels and Web based visualization tools are one alternative to attack this particular problem, but therefore new approaches to reduce the load of numerical processing and the number of generated primitives are required. We outline different scenarios for distributed isosurface reconstruction from large scale volumetric data sets. We demonstrate how to directly generate stripped surface representations and we introduce adaptive and hierarchical concepts to minimize the number of vertices that have to be reconstructed, transmitted and rendered. Furthermore, we propose a novel computation scheme, which allows the user to flexibly exploit locally available resources. The proposed algorithms have been merged together in order to build a platform-independent Web based application. Extensive use of VRML and Java OpenGL bindings allows for the exploration of large scale volume data quite efficiently.",Klaus Engel;Rüdiger Westermann;Thomas Ertl,K. Engel;R. Westermann;T. Ertl,"Stuttgart Univ., Germany",10.1109/VISUAL.1997.663891;10.1109/VISUAL.1996.568121;10.1109/VISUAL.1995.480806;10.1109/VISUAL.1991.175782;10.1109/VISUAL.1998.745300;10.1109/VISUAL.1996.568127,"Volume visualization, Isosurface reconstruction, Distributed Systems, Web-based Applications",58,15,26,
Vis,2001,Lagrangian-Eulerian Advection for Unsteady Flow Visualization,10.1109/VISUAL.2001.964493,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2001.964492,53,60,C,"In this paper, we propose a new technique to visualize dense representations of time-dependent vector fields based on a Lagrangian-Eulerian Advection (LEA) scheme. The algorithm produces animations with high spatio-temporal correlation at interactive rates. With this technique, every still frame depicts the instantaneous structure of the flow, whereas an animated sequence of frames reveals the motion a dense collection of particles would take when released into the flow. The simplicity of both the resulting data structures and the implementation suggest that LEA could become a useful component of any scientific visualization toolkit concerned with the display of unsteady flows.",Bruno Jobard;Gordon Erlebacher;M. Yousuff Hussaini,B. Jobard;G. Erlebacher;M. Yousuff Hussaini,"Sch. of Computational Sci. & Inf. Technol., Florida State Univ., Tallahassee, FL, USA;Sch. of Computational Sci. & Inf. Technol., Florida State Univ., Tallahassee, FL, USA;Sch. of Computational Sci. & Inf. Technol., Florida State Univ., Tallahassee, FL, USA",10.1109/VISUAL.2000.885689;10.1109/VISUAL.1994.346311;10.1109/VISUAL.1995.485146;10.1109/VISUAL.2000.885689,,58,20,13,
VAST,2006,Semantic Image Browser: Bridging Information Visualization with Automated Intelligent Image Analysis,10.1109/VAST.2006.261425,http://dx.doi.org/10.1109/VAST.2006.261425,191,198,C,"Browsing and retrieving images from large image collections are becoming common and important activities. Semantic image analysis techniques, which automatically detect high level semantic contents of images for annotation, are promising solutions toward this problem. However, few efforts have been made to convey the annotation results to users in an intuitive manner to enable effective image browsing and retrieval. There is also a lack of methods to monitor and evaluate the automatic image analysis algorithms due to the high dimensional nature of image data, features, and contents. In this paper, we propose a novel, scalable semantic image browser by applying existing information visualization techniques to semantic image analysis. This browser not only allows users to effectively browse and search in large image databases according to the semantic content of images, but also allows analysts to evaluate their annotation process through interactive visual exploration. The major visualization components of this browser are multi-dimensional scaling (MDS) based image layout, the value and relation (VaR) display that allows effective high dimensional visualization without dimension reduction, and a rich set of interaction tools such as search by sample images and content relationship detection. Our preliminary user study showed that the browser was easy to use and understand, and effective in supporting image browsing and retrieval tasks",Jing Yang 0001;Jianping Fan 0001;Daniel Hubball;Yuli Gao;Hangzai Luo;William Ribarsky;Matthew O. Ward,Jing Yang;Jianping Fan;Daniel Hubball;Yuli Gao;Hangzai Luo;William Ribarsky;Matthew Ward,"Dept of Computer Science, University of North Carolina at Charlotte, jyang13@uncc.edu;Dept of Computer Science, University of North Carolina at Charlotte, jfan@uncc.edu;Dept of Computer Science, University of North Carolina at Charlotte, dhubball@uncc.edu;Dept of Computer Science, University of North Carolina at Charlotte, ygao@uncc.edu;Dept of Computer Science, University of North Carolina at Charlotte, hluo@uncc.edu;Dept of Computer Science, University of North Carolina at Charlotte, ribarsky@uncc.edu;Dept of Computer Science, Worcester Polytechnic, Institute. matt@cs.wpi.edu",10.1109/INFVIS.1999.801855;10.1109/INFVIS.1995.528686;10.1109/INFVIS.2003.1249009;10.1109/VISUAL.1995.485140;10.1109/INFVIS.2004.71,"Image retrieval, image layout, semantic image classification,multi-dimensional visualization, visual analytics",58,33,23,
Vis,2009,Exploring 3D DTI fiber Tracts with Linked 2D Representations,10.1109/TVCG.2009.141,http://dx.doi.org/10.1109/TVCG.2009.141,1449,1456,J,"We present a visual exploration paradigm that facilitates navigation through complex fiber tracts by combining traditional 3D model viewing with lower dimensional representations. To this end, we create standard streamtube models along with two two-dimensional representations, an embedding in the plane and a hierarchical clustering tree, for a given set of fiber tracts. We then link these three representations using both interaction and color obtained by embedding fiber tracts into a perceptually uniform color space. We describe an anecdotal evaluation with neuroscientists to assess the usefulness of our method in exploring anatomical and functional structures in the brain. Expert feedback indicates that, while a standalone clinical use of the proposed method would require anatomical landmarks in the lower dimensional representations, the approach would be particularly useful in accelerating tract bundle selection. Results also suggest that combining traditional 3D model viewing with lower dimensional representations can ease navigation through the complex fiber tract models, improving exploration of the connectivity in the brain.",Radu Jianu;Çagatay Demiralp;David H. Laidlaw,Radu Jianu;Cagatay Demiralp;David Laidlaw,Brown University;Brown University;Brown University,10.1109/VISUAL.2000.885739;10.1109/VISUAL.1991.175794;10.1109/VISUAL.1996.567787;10.1109/VISUAL.2004.30;10.1109/TVCG.2009.112;10.1109/VISUAL.1994.346302;10.1109/VISUAL.2005.1532779,"DTI fiber tracts, embedding, coloring, interaction",58,50,42,
InfoVis,2012,Understanding Pen and Touch Interaction for Data Exploration on Interactive Whiteboards,10.1109/TVCG.2012.275,http://dx.doi.org/10.1109/TVCG.2012.275,2779,2788,J,"Current interfaces for common information visualizations such as bar graphs, line graphs, and scatterplots usually make use of the WIMP (Windows, Icons, Menus and a Pointer) interface paradigm with its frequently discussed problems of multiple levels of indirection via cascading menus, dialog boxes, and control panels. Recent advances in interface capabilities such as the availability of pen and touch interaction challenge us to re-think this and investigate more direct access to both the visualizations and the data they portray. We conducted a Wizard of Oz study to explore applying pen and touch interaction to the creation of information visualization interfaces on interactive whiteboards without implementing a plethora of recognizers. Our wizard acted as a robust and flexible pen and touch recognizer, giving participants maximum freedom in how they interacted with the system. Based on our qualitative analysis of the interactions our participants used, we discuss our insights about pen and touch interactions in the context of learnability and the interplay between pen and touch gestures. We conclude with suggestions for designing pen and touch enabled interactive visualization interfaces.",Jagoda Walny;Bongshin Lee;Paul Johns;Nathalie Henry Riche;Sheelagh Carpendale,Jagoda Walny;Bongshin Lee;Paul Johns;Nathalie Henry Riche;Sheelagh Carpendale,University of Calgary;Microsoft Research;Microsoft Research;Microsoft Research;University of Calgary,10.1109/TVCG.2012.262;10.1109/TVCG.2009.174;10.1109/TVCG.2011.251;10.1109/TVCG.2007.70568;10.1109/TVCG.2010.164,"Pen and touch, interaction, Wizard of Oz, whiteboard, data exploration",58,36,47,
InfoVis,2013,A Deeper Understanding of Sequence in Narrative Visualization,10.1109/TVCG.2013.119,http://dx.doi.org/10.1109/TVCG.2013.119,2406,2415,J,"Conveying a narrative with visualizations often requires choosing an order in which to present visualizations. While evidence exists that narrative sequencing in traditional stories can affect comprehension and memory, little is known about how sequencing choices affect narrative visualization. We consider the forms and reactions to sequencing in narrative visualization presentations to provide a deeper understanding with a focus on linear, 'slideshow-style' presentations. We conduct a qualitative analysis of 42 professional narrative visualizations to gain empirical knowledge on the forms that structure and sequence take. Based on the results of this study we propose a graph-driven approach for automatically identifying effective sequences in a set of visualizations to be presented linearly. Our approach identifies possible transitions in a visualization set and prioritizes local (visualization-to-visualization) transitions based on an objective function that minimizes the cost of transitions from the audience perspective. We conduct two studies to validate this function. We also expand the approach with additional knowledge of user preferences for different types of local transitions and the effects of global sequencing strategies on memory, preference, and comprehension. Our results include a relative ranking of types of visualization transitions by the audience perspective and support for memory and subjective rating benefits of visualization sequences that use parallelism as a structural device. We discuss how these insights can guide the design of narrative visualization and systems that support optimization of visualization sequence.",Jessica Hullman;Steven Mark Drucker;Nathalie Henry Riche;Bongshin Lee;Danyel Fisher;Eytan Adar,Jessica Hullman;Steven Drucker;Nathalie Henry Riche;Bongshin Lee;Danyel Fisher;Eytan Adar,University of Michigan;Microsoft Research;Microsoft Research;Microsoft Research;Microsoft Research;University of Michigan,10.1109/VISUAL.2005.1532788;10.1109/TVCG.2007.70577;10.1109/TVCG.2007.70594;10.1109/TVCG.2010.179;10.1109/TVCG.2008.137;10.1109/TVCG.2011.255;10.1109/TVCG.2007.70584;10.1109/TVCG.2007.70539;10.1109/INFVIS.2000.885086,"Data storytelling, narrative visualization, narrative structure",58,54,37,
InfoVis,2014,Origin-Destination Flow Data Smoothing and Mapping,10.1109/TVCG.2014.2346271,http://dx.doi.org/10.1109/TVCG.2014.2346271,2043,2052,J,"This paper presents a new approach to flow mapping that extracts inherent patterns from massive geographic mobility data and constructs effective visual representations of the data for the understanding of complex flow trends. This approach involves a new method for origin-destination flow density estimation and a new method for flow map generalization, which together can remove spurious data variance, normalize flows with control population, and detect high-level patterns that are not discernable with existing approaches. The approach achieves three main objectives in addressing the challenges for analyzing and mapping massive flow data. First, it removes the effect of size differences among spatial units via kernel-based density estimation, which produces a measurement of flow volume between each pair of origin and destination. Second, it extracts major flow patterns in massive flow data through a new flow sampling method, which filters out duplicate information in the smoothed flows. Third, it enables effective flow mapping and allows intuitive perception of flow patterns among origins and destinations without bundling or altering flow paths. The approach can work with both point-based flow data (such as taxi trips with GPS locations) and area-based flow data (such as county-to-county migration). Moreover, the approach can be used to detect and compare flow patterns at different scales or in relatively sparse flow datasets, such as migration for each age group. We evaluate and demonstrate the new approach with case studies of U.S. migration data and experiments with synthetic data.",Diansheng Guo;Xi Zhu 0002,Diansheng Guo;Xi Zhu,"Department of Geography, University of South Carolina;Department of Geography, University of South Carolina",10.1109/TVCG.2009.143;10.1109/TVCG.2008.135;10.1109/TVCG.2006.147;10.1109/TVCG.2006.193;10.1109/TVCG.2011.202;10.1109/INFVIS.2005.1532150;10.1109/TVCG.2011.181;10.1109/VISUAL.2005.1532819,"flow mapping, kernel smoothing, generalization, multi-resolution mapping, graph drawing, spatial data mining",58,64,45,
InfoVis,2015,Time Curves: Folding Time to Visualize Patterns of Temporal Evolution in Data,10.1109/TVCG.2015.2467851,http://dx.doi.org/10.1109/TVCG.2015.2467851,559,568,J,"We introduce time curves as a general approach for visualizing patterns of evolution in temporal data. Examples of such patterns include slow and regular progressions, large sudden changes, and reversals to previous states. These patterns can be of interest in a range of domains, such as collaborative document editing, dynamic network analysis, and video analysis. Time curves employ the metaphor of folding a timeline visualization into itself so as to bring similar time points close to each other. This metaphor can be applied to any dataset where a similarity metric between temporal snapshots can be defined, thus it is largely datatype-agnostic. We illustrate how time curves can visually reveal informative patterns in a range of different datasets.",Benjamin Bach;Conglei Shi;Nicolas Heulot;Tara M. Madhyastha;Thomas J. Grabowski;Pierre Dragicevic,Benjamin Bach;Conglei Shi;Nicolas Heulot;Tara Madhyastha;Tom Grabowski;Pierre Dragicevic,"Microsoft Research-Inria Joint Centre;IBM T.J, Watson Research Center, Yorktown Height, NY;IRT SystemX;Department of Radiology, University of Washington;Department of Radiology and Neurology, University of Washington;Inria",10.1109/TVCG.2011.186;10.1109/TVCG.2007.70535;10.1109/INFVIS.2004.1;10.1109/TVCG.2014.2346325;10.1109/TVCG.2013.192;10.1109/INFVIS.2002.1173155,"Temporal data visualization, information visualization, multidimensional scaling",58,64,49,
VAST,2016,SmartAdP: Visual Analytics of Large-scale Taxi Trajectories for Selecting Billboard Locations,10.1109/TVCG.2016.2598432,http://dx.doi.org/10.1109/TVCG.2016.2598432,1,10,J,"The problem of formulating solutions immediately and comparing them rapidly for billboard placements has plagued advertising planners for a long time, owing to the lack of efficient tools for in-depth analyses to make informed decisions. In this study, we attempt to employ visual analytics that combines the state-of-the-art mining and visualization techniques to tackle this problem using large-scale GPS trajectory data. In particular, we present SmartAdP, an interactive visual analytics system that deals with the two major challenges including finding good solutions in a huge solution space and comparing the solutions in a visual and intuitive manner. An interactive framework that integrates a novel visualization-driven data mining model enables advertising planners to effectively and efficiently formulate good candidate solutions. In addition, we propose a set of coupled visualizations: a solution view with metaphor-based glyphs to visualize the correlation between different solutions; a location view to display billboard locations in a compact manner; and a ranking view to present multi-typed rankings of the solutions. This system has been demonstrated using case studies with a real-world dataset and domain-expert interviews. Our approach can be adapted for other location selection problems such as selecting locations of retail stores or restaurants using trajectory data.",Dongyu Liu;Di Weng;Yuhong Li;Jie Bao 0003;Yu Zheng 0004;Huamin Qu;Yingcai Wu,Dongyu Liu;Di Weng;Yuhong Li;Jie Bao;Yu Zheng;Huamin Qu;Yingcai Wu,"Zhejiang UniversityHong Kong University of Science and Technology;State Key Lab of CAD & CGZhejiang University;University of Macau;Microsoft Research, Beijing, China;Microsoft Research, Beijing, China;Hong Kong University of Science and Technology;State Key Lab of CAD & CGZhejiang University",10.1109/TVCG.2013.122;10.1109/TVCG.2015.2467051;10.1109/TVCG.2013.226;10.1109/VAST.2011.6102455;10.1109/TVCG.2013.228;10.1109/TVCG.2015.2467112;10.1109/TVCG.2012.265;10.1109/TVCG.2010.183;10.1109/TVCG.2014.2346912;10.1109/TVCG.2007.70521;10.1109/TVCG.2015.2467771;10.1109/TVCG.2013.173;10.1109/TVCG.2011.181;10.1109/TVCG.2009.111,optimal billboard locations;taxi trajectory;visual analytics;comparative analysis,58,78,51,
Vis,1998,Isosurface extraction in time-varying fields using a temporal hierarchical index tree,10.1109/VISUAL.1998.745298,http://dx.doi.org/10.1109/VISUAL.1998.745298,159,166,C,"Many high-performance isosurface extraction algorithms have been proposed in the past several years as a result of intensive research efforts. When applying these algorithms to large-scale time-varying fields, the storage overhead incurred from storing the search index often becomes overwhelming. This paper proposes an algorithm for locating isosurface cells in time-varying fields. We devise a new data structure, called the temporal hierarchical index tree, which utilizes the temporal coherence that exists in a time-varying field and adaptively coalesces the cells' extreme values over time; the resulting extreme values are then used to create the isosurface cell search index. For a typical time-varying scalar data set, not only does this temporal hierarchical index tree require much less storage space, but also the amount of I/O required to access the indices from the disk at different time steps is substantially reduced. We illustrate the utility and speed of our algorithm with data from several large-scale time-varying CFD simulations. Our algorithm can achieve more than 80% of disk-space savings when compared with the existing techniques, while the isosurface extraction time is nearly optimal.",Han-Wei Shen,H.-W. Shen,"MRJ Technol. Solutions, NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1996.568123;10.1109/VISUAL.1997.663895;10.1109/VISUAL.1996.568121;10.1109/VISUAL.1998.745299;10.1109/VISUAL.1991.175780;10.1109/VISUAL.1995.480806,"scalar field visualization, volume visualization, isosurface extraction, time-varying fields, marching cubes, span space",57,23,18,
Vis,2001,A complete distance field representation,10.1109/VISUAL.2001.964518,http://dx.doi.org/10.1109/VISUAL.2001.964518,247,254,C,"Distance fields are an important volume representation. A high quality distance field facilitates accurate surface characterization and gradient estimation. However, due to Nyquist's law, no existing volumetric methods based on the linear sampling theory can fully capture surface details, such as comers and edges, in 3D space. We propose a novel complete distance field representation (CDFR) that does not rely on Nyquist's sampling theory. To accomplish this, we construct a volume where each voxel has a complete description of all portions of surface that affect the local distance field. For any desired distance, we are able to extract a surface contour in true Euclidean distance, at any level of accuracy, from the same CDFR representation. Such point-based iso-distance contours have faithful per-point gradients and can be interactively visualized using splatting, providing per-point shaded image quality. We also demonstrate applying CDFR to a cutting edge design for manufacturing application involving high-complexity parts at unprecedented accuracy using only commonly available computational resources.",Jian Huang;Roger Crawfis;Shao-Chiung Lu;Shuh-Yuan Liou,Jian Huang;Yan Li;R. Crawfis;Shao-Chiung Lu;Shuh-Yuan Liou,"Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA",10.1109/VISUAL.1993.398877;10.1109/VISUAL.1995.485152;10.1109/VISUAL.2000.885698,"distance fields, volume modeling, polygonal surfaces, point-based models, graphics",57,9,22,
Vis,2003,A texture-based framework for spacetime-coherent visualization of time-dependent vector fields,10.1109/VISUAL.2003.1250361,http://dx.doi.org/10.1109/VISUAL.2003.1250361,107,114,C,"We propose unsteady flow advection-convolution (UFAC) as a novel visualization approach for unsteady flows. It performs time evolution governed by pathlines, but builds spatial correlation according to instantaneous streamlines whose spatial extent is controlled by the flow unsteadiness. UFAC is derived from a generic framework that provides spacetime-coherent dense representations of time dependent-vector fields by a two-step process: 1) construction of continuous trajectories in spacetime for temporal coherence; and 2) convolution along another set of paths through the above spacetime for spatially correlated patterns. Within the framework, known visualization techniques-such as Lagrangian-Eulerian advection, image-based flow visualization, unsteady flow LIC, and dynamic LIC-can be reproduced, often with better image quality, higher performance, or increased flexibility of the visualization style. Finally, we present a texture-based discretization of the framework and its interactive implementation on graphics hardware, which allows the user to gradually balance visualization speed against quality.",Daniel Weiskopf;Gordon Erlebacher;Thomas Ertl,D. Weiskopf;G. Erlebacher;T. Ertl,"Inst. of Visualization & Interactive Syst., Stuttgart Univ., Germany",10.1109/VISUAL.2001.964493;10.1109/VISUAL.1999.809906," time-dependent vector fields, unsteady flow visualization, LIC, texture advection, hardware acceleration",57,27,23,
Vis,2003,Effectively visualizing multi-valued flow data using color and texture,10.1109/VISUAL.2003.1250362,http://dx.doi.org/10.1109/VISUAL.2003.1250362,115,121,C,"In this paper we offer several new insights and techniques for effectively using color and texture to simultaneously convey information about multiple 2D scalar and vector distributions, in a way that facilitates allowing each distribution to be understood both individually and in the context of one or more of the other distributions. Specifically, we introduce the concepts of: color weaving for simultaneously representing information about multiple co-located color encoded distributions; and texture stitching for achieving more spatially accurate multi-frequency line integral convolution representations of combined scalar and vector distributions. The target application for our research is the definition, detection and visualization of regions of interest in a turbulent boundary layer flow at moderate Reynolds number. In this work, we examine and analyze streamwise-spanwise planes of three-component velocity vectors with the goal of identifying and characterizing spatially organized packets of hairpin vortices.",Timothy Urness;Victoria Interrante;Ivan Marusic;Ellen Longmire;Bharathram Ganapathisubramani,T. Urness;V. Interrante;I. Marusic;E. Longmire;B. Ganapathisubramani,"Dept. of Comput. Sci. & Eng., Minnesota Univ., USA;Dept. of Comput. Sci. & Eng., Minnesota Univ., USA",10.1109/VISUAL.1999.809905;10.1109/VISUAL.1997.663897;10.1109/VISUAL.1996.568118;10.1109/VISUAL.2002.1183788;10.1109/VISUAL.1996.567784;10.1109/VISUAL.1998.745294;10.1109/VISUAL.1998.745292,"flow visualization, line integral convolution, multi-variate data visualization, color, texture",57,28,19,
Vis,2004,Linear and cubic box splines for the body centered cubic lattice,10.1109/VISUAL.2004.65,http://dx.doi.org/10.1109/VISUAL.2004.65,11,18,C,"We derive piecewise linear and piecewise cubic box spline reconstruction filters for data sampled on the body centered cubic (BCC) lattice. We analytically derive a time domain representation of these reconstruction filters and using the Fourier slice-projection theorem we derive their frequency responses. The quality of these filters, when used in reconstructing BCC sampled volumetric data, is discussed and is demonstrated with a raycaster. Moreover, to demonstrate the superiority of the BCC sampling, the resulting reconstructions are compared with those produced from similar filters applied to data sampled on the Cartesian lattice.",Alireza Entezari;Ramsay Dyer;Torsten Möller,A. Entezari;R. Dyer;T. Moller,"Graphics, Usability, & Visualization Lab., Simon Fraser Univ., Burnaby, BC, Canada;Graphics, Usability, & Visualization Lab., Simon Fraser Univ., Burnaby, BC, Canada;Graphics, Usability, & Visualization Lab., Simon Fraser Univ., Burnaby, BC, Canada",10.1109/VISUAL.1993.398851;10.1109/VISUAL.2001.964498;10.1109/VISUAL.1997.663848;10.1109/VISUAL.1994.346331;10.1109/VISUAL.2001.964499,"Body Centered Cubic Lattice, Reconstruction, Optimal Regular Sampling",57,28,21,
Vis,2004,Scout: a hardware-accelerated system for quantitatively driven visualization and analysis,10.1109/VISUAL.2004.95,http://dx.doi.org/10.1109/VISUAL.2004.95,171,178,C,"Quantitative techniques for visualization are critical to the successful analysis of both acquired and simulated scientific data. Many visualization techniques rely on indirect mappings, such as transfer functions, to produce the final imagery. In many situations, it is preferable and more powerful to express these mappings as mathematical expressions, or queries, that can then be directly applied to the data. We present a hardware-accelerated system that provides such capabilities and exploits current graphics hardware for portions of the computational tasks that would otherwise be executed on the CPU. In our approach, the direct programming of the graphics processor using a concise data parallel language, gives scientists the capability to efficiently explore and visualize data sets.",Patrick S. McCormick;Jeff T. Inman;James P. Ahrens;Charles D. Hansen;Greg Roth,P.S. McCormick;J. Inman;J.P. Ahrens;C. Hansen;G. Roth,"Advanced Comput. Lab., Los Alamos Nat. Lab., NM, USA;Advanced Comput. Lab., Los Alamos Nat. Lab., NM, USA;Advanced Comput. Lab., Los Alamos Nat. Lab., NM, USA",10.1109/VISUAL.1995.480821;10.1109/VISUAL.1999.809864;10.1109/VISUAL.2001.964519;10.1109/VISUAL.2003.1250357,"Visualization systems, hardware acceleration, multi-variate visualization, volume rendering",57,26,26,
InfoVis,2006,Spatial Analysis of News Sources,10.1109/TVCG.2006.179,http://dx.doi.org/10.1109/TVCG.2006.179,765,772,J,"People in different places talk about different things. This interest distribution is reflected by the newspaper articles circulated in a particular area. We use data from our large-scale newspaper analysis system (Lydia) to make entity datamaps, a spatial visualization of the interest in a given named entity. Our goal is to identify entities which display regional biases. We develop a model of estimating the frequency of reference of an entity in any given city from the reference frequency centered in surrounding cities, and techniques for evaluating the spatial significance of this distribution",Andrew Mehler;Yunfan Bao;Xin Li 0003;Yue Wang;Steven Skiena,Andrew Mehler;Yunfan Bao;Xin Li;Yue Wang;Steven Skiena,,,"GIS, geographic visualization, text and document visualization, information analytics, WWW data visualization, spidering, newspapers",57,25,19,
Vis,2006,A Novel Visualization Model for Web Search Results,10.1109/TVCG.2006.111,http://dx.doi.org/10.1109/TVCG.2006.111,981,988,J,"This paper presents an interactive visualization system, named WebSearchViz, for visualizing the Web search results and facilitating users' navigation and exploration. The metaphor in our model is the solar system with its planets and asteroids revolving around the sun. Location, color, movement, and spatial distance of objects in the visual space are used to represent the semantic relationships between a query and relevant Web pages. Especially, the movement of objects and their speeds add a new dimension to the visual space, illustrating the degree of relevance among a query and Web search results in the context of users' subjects of interest. By interacting with the visual space, users are able to observe the semantic relevance between a query and a resulting Web page with respect to their subjects of interest, context information, or concern. Users' subjects of interest can be dynamically changed, redefined, added, or deleted from the visual space",Tien Nguyen;Jun Zhang,Tien Nguyen;Jin Zhang,Electrical and Computer Engineering Department at Iowa State University;University of Wisconsin at Milwaukee,10.1109/INFVIS.1995.528691;10.1109/INFVIS.2001.963287;10.1109/INFVIS.1995.528692;10.1109/INFVIS.1998.729553;10.1109/INFVIS.1999.801864;10.1109/INFVIS.2000.885099,"Visualization model, Web search results, movement, speed",57,34,36,
Vis,2007,Similarity-Guided Streamline Placement with Error Evaluation,10.1109/TVCG.2007.70595,http://dx.doi.org/10.1109/TVCG.2007.70595,1448,1455,J,"Most streamline generation algorithms either provide a particular density of streamlines across the domain or explicitly detect features, such as critical points, and follow customized rules to emphasize those features. However, the former generally includes many redundant streamlines, and the latter requires Boolean decisions on which points are features (and may thus suffer from robustness problems for real-world data). We take a new approach to adaptive streamline placement for steady vector fields in 2D and 3D. We define a metric for local similarity among streamlines and use this metric to grow streamlines from a dense set of candidate seed points. The metric considers not only Euclidean distance, but also a simple statistical measure of shape and directional similarity. Without explicit feature detection, our method produces streamlines that naturally accentuate regions of geometric interest. In conjunction with this method, we also propose a quantitative error metric for evaluating a streamline representation based on how well it preserves the information from the original vector field. This error metric reconstructs a vector field from points on the streamline representation and computes a difference of the reconstruction from the original vector field.",Yuan Chen;Jonathan D. Cohen 0001;Julian Krolik,Yuan Chen;Jonathan Cohen;Julian Krolik,Johns Hopkins University;Lawrence Livermore National Laboratory;Johns Hopkins University,10.1109/VISUAL.2005.1532831;10.1109/VISUAL.2005.1532832;10.1109/VISUAL.2004.87;10.1109/VISUAL.2001.964530;10.1109/TVCG.2006.116;10.1109/VISUAL.2000.885690,"Adaptive streamlines, vector field reconstruction, shape matching",57,46,16,
InfoVis,2009,ResultMaps: Visualization for Search Interfaces,10.1109/TVCG.2009.176,http://dx.doi.org/10.1109/TVCG.2009.176,1057,1064,J,"Hierarchical representations are common in digital repositories, yet are not always fully leveraged in their online search interfaces. This work describes ResultMaps, which use hierarchical treemap representations with query string-driven digital library search engines. We describe two lab experiments, which find that ResultsMap users yield significantly better results over a control condition on some subjective measures, and we find evidence that ResultMaps have ancillary benefits via increased understanding of some aspects of repository content. The ResultMap system and experiments contribute an understanding of the benefits-direct and indirect-of the ResultMap approach to repository search visualization.",Edward Clarkson;Krishna Desai;James D. Foley,Edward Clarkson;Krishna Desai;James Foley,Georgia Tech;Georgia Tech;Georgia Tech,10.1109/VISUAL.1991.175815;10.1109/TVCG.2006.142;10.1109/INFVIS.1995.528686,"Treemap, evaluation, user studies, digital library, digital repository, search engine, search visualization, infovis",57,37,41,
VAST,2009,Capturing and supporting the analysis process,10.1109/VAST.2009.5333020,http://dx.doi.org/10.1109/VAST.2009.5333020,131,138,C,"Visual analytics tools provide powerful visual representations in order to support the sense-making process. In this process, analysts typically iterate through sequences of steps many times, varying parameters each time. Few visual analytics tools support this process well, nor do they provide support for visualizing and understanding the analysis process itself. To help analysts understand, explore, reference, and reuse their analysis process, we present a visual analytics system named CzSaw (See-Saw) that provides an editable and re-playable history navigation channel in addition to multiple visual representations of document collections and the entities within them (in a manner inspired by Jigsaw). Conventional history navigation tools range from basic undo and redo to branching timelines of user actions. In CzSaw's approach to this, first, user interactions are translated into a script language that drives the underlying scripting-driven propagation system. The latter allows analysts to edit analysis steps, and ultimately to program them. Second, on this base, we build both a history view showing progress and alternative paths, and a dependency graph showing the underlying logic of the analysis and dependency relations among the results of each step. These tools result in a visual model of the sense-making process, providing a way for analysts to visualize their analysis process, to reinterpret the problem, explore alternative paths, extract analysis patterns from existing history, and reuse them with other related analyses.",Nazanin Kadivar;Victor Y. Chen;Dustin T. Dunsmuir;Eric Lee;Cheryl Z. Qian;John Dill;Chris Shaw 0002;Robert F. Woodbury,Nazanin Kadivar;Victor Chen;Dustin Dunsmuir;Eric Lee;Cheryl Qian;John Dill;Christopher Shaw;Robert Woodbury,"School of Interactive Arts and Technology, Simon Fraser University, Canada;School of Interactive Arts and Technology, Simon Fraser University, Canada;School of Interactive Arts and Technology, Simon Fraser University, Canada;School of Interactive Arts and Technology, Simon Fraser University, Canada;School of Interactive Arts and Technology, Simon Fraser University, Canada;School of Interactive Arts and Technology, Simon Fraser University, Canada;School of Interactive Arts and Technology, Simon Fraser University, Canada;School of Interactive Arts and Technology, Simon Fraser University, Canada",10.1109/INFVIS.2005.1532136;10.1109/VAST.2008.4677362;10.1109/VAST.2007.4388992;10.1109/TVCG.2008.137;10.1109/VAST.2007.4389006;10.1109/VAST.2008.4677365;10.1109/INFVIS.2004.2;10.1109/VAST.2007.4389002;10.1109/TVCG.2007.70515;10.1109/VAST.2007.4389001,"Visual Analytics, Sense-making, Analysis Process, Visual History",57,36,28,
Vis,2010,Efficient High-Quality Volume Rendering of SPH Data,10.1109/TVCG.2010.148,http://dx.doi.org/10.1109/TVCG.2010.148,1533,1540,J,"High quality volume rendering of SPH data requires a complex order-dependent resampling of particle quantities along the view rays. In this paper we present an efficient approach to perform this task using a novel view-space discretization of the simulation domain. Our method draws upon recent work on GPU-based particle voxelization for the efficient resampling of particles into uniform grids. We propose a new technique that leverages a perspective grid to adaptively discretize the view-volume, giving rise to a continuous level-of-detail sampling structure and reducing memory requirements compared to a uniform grid. In combination with a level-of-detail representation of the particle set, the perspective grid allows effectively reducing the amount of primitives to be processed at run-time. We demonstrate the quality and performance of our method for the rendering of fluid and gas dynamics SPH simulations consisting of many millions of particles.",Roland Fraedrich;Stefan Auer;Rüdiger Westermann,Roland Fraedrich;Stefan Auer;Rudiger Westermann,Technische Universität München;Technische Universität München;Technische Universität München,10.1109/VISUAL.2003.1250404;10.1109/TVCG.2008.164;10.1109/VISUAL.1992.235223;10.1109/VISUAL.2003.1250404;10.1109/VISUAL.2003.1250384;10.1109/TVCG.2007.70526;10.1109/TVCG.2009.142;10.1109/TVCG.2007.70600;10.1109/VISUAL.2004.55,"Particle visualization, volume rendering, ray-casting, GPU resampling",57,39,38,
Vis,2010,Uncertainty-Aware Guided Volume Segmentation,10.1109/TVCG.2010.208,http://dx.doi.org/10.1109/TVCG.2010.208,1358,1365,J,"Although direct volume rendering is established as a powerful tool for the visualization of volumetric data, efficient and reliable feature detection is still an open topic. Usually, a tradeoff between fast but imprecise classification schemes and accurate but time-consuming segmentation techniques has to be made. Furthermore, the issue of uncertainty introduced with the feature detection process is completely neglected by the majority of existing approaches.In this paper we propose a guided probabilistic volume segmentation approach that focuses on the minimization of uncertainty. In an iterative process, our system continuously assesses uncertainty of a random walker-based segmentation in order to detect regions with high ambiguity, to which the user's attention is directed to support the correction of potential misclassifications. This reduces the risk of critical segmentation errors and ensures that information about the segmentation's reliability is conveyed to the user in a dependable way. In order to improve the efficiency of the segmentation process, our technique does not only take into account the volume data to be segmented, but also enables the user to incorporate classification information. An interactive workflow has been achieved by implementing the presented system on the GPU using the OpenCL API. Our results obtained for several medical data sets of different modalities, including brain MRI and abdominal CT, demonstrate the reliability and efficiency of our approach.",Jörg-Stefan Praßni;Timo Ropinski;Klaus H. Hinrichs,Jorg-Stefan Prassni;Timo Ropinski;Klaus Hinrichs,University of Münster;University of Münster;University of Münster,10.1109/VISUAL.2005.1532855;10.1109/VISUAL.2003.1250370;10.1109/TVCG.2009.189;10.1109/TVCG.2007.70518;10.1109/VISUAL.2005.1532807;10.1109/VISUAL.2003.1250369,"Volume segmentation, uncertainty, classification, random walker",57,40,40,
VAST,2014,Visual Exploration of Sparse Traffic Trajectory Data,10.1109/TVCG.2014.2346746,http://dx.doi.org/10.1109/TVCG.2014.2346746,1813,1822,J,"In this paper, we present a visual analysis system to explore sparse traffic trajectory data recorded by transportation cells. Such data contains the movements of nearly all moving vehicles on the major roads of a city. Therefore it is very suitable for macro-traffic analysis. However, the vehicle movements are recorded only when they pass through the cells. The exact tracks between two consecutive cells are unknown. To deal with such uncertainties, we first design a local animation, showing the vehicle movements only in the vicinity of cells. Besides, we ignore the micro-behaviors of individual vehicles, and focus on the macro-traffic patterns. We apply existing trajectory aggregation techniques to the dataset, studying cell status pattern and inter-cell flow pattern. Beyond that, we propose to study the correlation between these two patterns with dynamic graph visualization techniques. It allows us to check how traffic congestion on one cell is correlated with traffic flows on neighbouring links, and with route selection in its neighbourhood. Case studies show the effectiveness of our system.",Zuchao Wang;Tangzhi Ye;Min Lu;Xiaoru Yuan;Huamin Qu;Jacky Yuan;Qianliang Wu,Zuchao Wang;Tangzhi Ye;Min Lu;Xiaoru Yuan;Huamin Qu;Jacky Yuan;Qianliang Wu,"Peking University;Peking University;Peking University;Peking University;Hong Kong University of Science and Technology;Nanjing Intelligent Transportation Systems Co., Ltd;Nanjing Intelligent Transportation Systems Co., Ltd",10.1109/VAST.2012.6400556;10.1109/INFVIS.2004.27;10.1109/VAST.2008.4677356;10.1109/INFVIS.2005.1532151;10.1109/VAST.2011.6102458;10.1109/TVCG.2011.226;10.1109/TVCG.2013.228;10.1109/TVCG.2013.193;10.1109/VAST.2009.5332584;10.1109/TVCG.2013.226;10.1109/VAST.2011.6102454;10.1109/VAST.2011.6102455;10.1109/TVCG.2009.182;10.1109/TVCG.2012.265,"Sparse Traffic Trajectory, Traffic Visualization, Dynamic Graph Visualization, Traffic Congestion",57,64,46,
Vis,1990,Applying space subdivision techniques to volume rendering,10.1109/VISUAL.1990.146377,http://dx.doi.org/10.1109/VISUAL.1990.146377,150,"159, 470",C,"The authors present a ray-tracing algorithm for volume rendering designed to work efficiently when the data of interest is distributed sparsely through the volume. A simple preprocessing step identifies the voxels representing features of interest. Frequently this set of voxels, arbitrarily distributed in three-dimensional space, is a small fraction of the original voxel grid. A median-cut space partitioning scheme, combined with bounding volumes to prune void spaces in the resulting search structure, is used to store the voxels of interest in a k-d tree. The k-d tree is used as a data structure. The tree is then efficiently ray-traced to render the voxel data. The k-d tree is view independent, and can be used for animation sequences involving changes in positions of the viewer or positions of lights. This search structure has been applied to render voxel data from MRI, CAT scan, and electron density distributions.&lt;&lt;ETX&gt;&gt;",Kalpathi R. Subramanian;Donald S. Fussell,K.R. Subramanian;D.S. Fussell,"Center for High Performance Comput., Texas Univ., Austin, TX, USA;Center for High Performance Comput., Texas Univ., Austin, TX, USA",,,56,21,21,
InfoVis,1998,Reconfigurable disc trees for visualizing large hierarchical information space,10.1109/INFVIS.1998.729555,http://dx.doi.org/10.1109/INFVIS.1998.729555,19,"25, 149",C,"We present a new visualization technique, called RDT (Reconfigurable Disc Tree) which can alleviate the disadvantages of cone trees significantly for large hierarchies while maintaining its context of using 3D depth. In RDT, each node is associated with a disc, around which its children are placed. Using discs instead of cones as the basic shape in RDT has several advantages: significant reduction of occluded region, sharp increase in number of displayed nodes, and easy projection onto plane without visual overlapping. We show that RDT can greatly enhance user perception by transforming its shapes dynamically in several ways: (1) disc tree which can significantly reduce the occluded region by the foreground objects; (2) compact disc tree which can increase the number of nodes displayed on the screen; and (3) plane disc tree which can be mapped onto the plane without visual overlapping. We describe an implementation of our visualization system called VISIT (Visual Information System for reconfigurable dIsc tree). It provides 2D and 3D layouts for RDT and various user interface features such as tree reconfiguration, tree transformation, tree shading, viewing transformation, animation, selection and browsing which can enhance the user perception and navigation capabilities. We also evaluate our system using the following three metrics: percentage of occlusion, density of displayed nodes on a screen, and number of identifiable nodes.",Chang-Sung Jeong;Alex T. Pang,Chang-Sung Jeong;A. Pang,"Dept. of Electron. Eng., Korea Univ., Seoul, South Korea",10.1109/INFVIS.1995.528689;10.1109/INFVIS.1997.636792;10.1109/VISUAL.1991.175815;10.1109/VISUAL.1996.567745,"Information visualization, disc tree,compact disc tree, plane disc tree, hierarchy",56,18,8,
InfoVis,2005,A note on space-filling visualizations and space-filling curves,10.1109/INFVIS.2005.1532145,http://dx.doi.org/10.1109/INFVIS.2005.1532145,181,186,C,"A recent line of treemap research has focused on layout algorithms that optimize properties such as stability, preservation of ordering information, and aspect ratio of rectangles. No ideal treemap layout algorithm has been found, and so it is natural to explore layouts that produce nonrectangular regions. This note describes a connection between space-filling visualizations and the mathematics of space-filling curves, and uses that connection to characterize a family of layout algorithms which produce nonrectangular regions but enjoy geometric continuity under changes to the data and legibility even for highly unbalanced trees.",Martin Wattenberg,M. Wattenberg,"IBM Res., White Plains, NY, USA",10.1109/INFVIS.2001.963283;10.1109/INFVIS.2002.1173152,Hierarchy Visualization,56,20,15,
VAST,2006,Monitoring Network Traffic with Radial Traffic Analyzer,10.1109/VAST.2006.261438,http://dx.doi.org/10.1109/VAST.2006.261438,123,128,C,"Extensive spread of malicious code on the Internet and also within intranets has risen the user's concern about what kind of data is transferred between her or his computer and other hosts on the network. Visual analysis of this kind of information is a challenging task, due to the complexity and volume of the data type considered, and requires special design of appropriate visualization techniques. In this paper, we present a scalable visualization toolkit for analyzing network activity of computer hosts on a network. The visualization combines network packet volume and type distribution information with geographic information, enabling the analyst to use geographic distortion techniques such as the HistoMap technique to become aware of the traffic components in the course of the analysis. The presented analysis tool is especially useful to compare important network load characteristics in a geographically aware display, to relate communication partners, and to identify the type of network traffic occurring. The results of the analysis are helpful in understanding typical network communication activities, and in anticipating potential performance bottlenecks or problems. It is suited for both off-line analysis of historic data, and via animation for on-line monitoring of packet-based network traffic in real time",Daniel A. Keim;Florian Mansmann;Jörn Schneidewind;Tobias Schreck,Daniel A. Keim;Florian Mansmann;Jorn Schneidewind;Tobias Schreck,"Databases, Data Mining and Visualization Group, University of Konstanz, Germany. keim@inf.uni-konstanz.de;Databases, Data Mining and Visualization Group, University of Konstanz, Germany. mansmann@inf.uni-konstanz.de;Databases, Data Mining and Visualization Group, University of Konstanz, Germany. schneide@inf.uni-konstanz.de;Databases, Data Mining and Visualization Group, University of Konstanz, Germany. schreck@inf.uni-konstanz.de",10.1109/INFVIS.2000.885091;10.1109/INFVIS.1998.729557,"Visual Analytics, Network Traffic Monitoring, Information Visualization and Geography-based Solutions",56,31,24,
Vis,2008,Extensions of Parallel Coordinates for Interactive Exploration of Large Multi-Timepoint Data Sets,10.1109/TVCG.2008.131,http://dx.doi.org/10.1109/TVCG.2008.131,1436,1451,J,"Parallel coordinate plots (PCPs) are commonly used in information visualization to provide insight into multi-variate data. These plots help to spot correlations between variables. PCPs have been successfully applied to unstructured datasets up to a few millions of points. In this paper, we present techniques to enhance the usability of PCPs for the exploration of large, multi-timepoint volumetric data sets, containing tens of millions of points per timestep. The main difficulties that arise when applying PCPs to large numbers of data points are visual clutter and slow performance, making interactive exploration infeasible. Moreover, the spatial context of the volumetric data is usually lost. We describe techniques for preprocessing using data quantization and compression, and for fast GPU-based rendering of PCPs using joint density distributions for each pair of consecutive variables, resulting in a smooth, continuous visualization. Also, fast brushing techniques are proposed for interactive data selection in multiple linked views, including a 3D spatial volume view. These techniques have been successfully applied to three large data sets: Hurricane Isabel (Vis'04 contest), the ionization front instability data set (Vis'08 design contest), and data from a large-eddy simulation of cumulus clouds. With these data, we show how PCPs can be extended to successfully visualize and interactively explore multi-timepoint volumetric datasets with an order of magnitude more data points.",Jorik Blaas;Charl P. Botha;Frits H. Post,Jorik Blaas;Charl Botha;Frits Post,TU Delft;TU Delft;TU Delft,10.1109/VISUAL.1999.809866;10.1109/TVCG.2006.170;10.1109/INFVIS.2005.1532138;10.1109/INFVIS.2004.68;10.1109/VISUAL.1994.346302;10.1109/VISUAL.2000.885739,"Parallel coordinate plots, time-varying, multi-field, linked related views",56,46,17,
VAST,2009,Proximity-based visualization of movement trace data,10.1109/VAST.2009.5332593,http://dx.doi.org/10.1109/VAST.2009.5332593,11,18,C,"The increasing availability of motion sensors and video cameras in living spaces has made possible the analysis of motion patterns and collective behavior in a number of situations. The visualization of this movement data, however, remains a challenge. Although maintaining the actual layout of the data space is often desirable, direct visualization of movement traces becomes cluttered and confusing as the spatial distribution of traces may be disparate and uneven. We present proximity-based visualization as a novel approach to the visualization of movement traces in an abstract space rather than the given spatial layout. This abstract space is obtained by considering proximity data, which is computed as the distance between entities and some number of important locations. These important locations can range from a single fixed point, to a moving point, several points, or even the proximities between the entities themselves. This creates a continuum of proximity spaces, ranging from the fixed absolute reference frame to completely relative reference frames. By combining these abstracted views with the concrete spatial views, we provide a way to mentally map the abstract spaces back to the real space. We demonstrate the effectiveness of this approach, and its applicability to visual analytics problems such as hazard prevention, migration patterns, and behavioral studies.",Tarik Crnovrsanin;Chris Muelder;Carlos D. Correa;Kwan-Liu Ma,Tarik Crnovrsanin;Chris Muelder;Carlos Correa;Kwan-Liu Ma,"University of California, Davis, USA;University of California, Davis, USA;University of California, Davis, USA;University of California, Davis, USA",10.1109/INFVIS.2004.27;10.1109/VISUAL.1990.146402;10.1109/TVCG.2007.70621;10.1109/TVCG.2007.70558,"Spatio-temporal visualization, proximity, linked views, principal component analysis, temporal trajectories, movement patterns",56,45,33,
VAST,2010,DimStiller: Workflows for dimensional analysis and reduction,10.1109/VAST.2010.5652392,http://dx.doi.org/10.1109/VAST.2010.5652392,3,10,C,"DimStiller is a system for dimensionality reduction and analysis. It frames the task of understanding and transforming input dimensions as a series of analysis steps where users transform data tables by chaining together different techniques, called operators, into pipelines of expressions. The individual operators have controls and views that are linked together based on the structure of the expression. Users interact with the operator controls to tune parameter choices, with immediate visual feedback guiding the exploration of local neighborhoods of the space of possible data tables. DimStiller also provides global guidance for navigating data-table space through expression templates called workflows, which permit re-use of common patterns of analysis.",Stephen Ingram;Tamara Munzner;Veronika Irvine;Melanie Tory;Steven Bergner;Torsten Möller,Stephen Ingram;Tamara Munzner;Veronika Irvine;Melanie Tory;Steven Bergner;Torsten Möller,University of British Columbia;University of British Columbia;University of Victoria;University of Victoria;Simon Fraser University;Simon Fraser University,10.1109/INFVIS.2003.1249013;10.1109/VISUAL.1994.346302;10.1109/TVCG.2006.178;10.1109/INFVIS.2003.1249015;10.1109/TVCG.2009.153;10.1109/INFVIS.2004.71,,56,43,20,
VAST,2012,Visual cluster exploration of web clickstream data,10.1109/VAST.2012.6400494,http://dx.doi.org/10.1109/VAST.2012.6400494,3,12,C,"Web clickstream data are routinely collected to study how users browse the web or use a service. It is clear that the ability to recognize and summarize user behavior patterns from such data is valuable to e-commerce companies. In this paper, we introduce a visual analytics system to explore the various user behavior patterns reflected by distinct clickstream clusters. In a practical analysis scenario, the system first presents an overview of clickstream clusters using a Self-Organizing Map with Markov chain models. Then the analyst can interactively explore the clusters through an intuitive user interface. He can either obtain summarization of a selected group of data or further refine the clustering result. We evaluated our system using two different datasets from eBay. Analysts who were working on the same data have confirmed the system's effectiveness in extracting user behavior patterns from complex datasets and enhancing their ability to reason.",Jishang Wei;Zeqian Shen;Neel Sundaresan;Kwan-Liu Ma,Jishang Wei;Zeqian Shen;Neel Sundaresan;Kwan-Liu Ma,"University of California, Davis;eBay Research Labs;eBay Research Labs;University of California, Davis",10.1109/INFVIS.2005.1532145;10.1109/VAST.2007.4389008;10.1109/VAST.2011.6102462;10.1109/VISUAL.1991.175815,,56,39,28,
InfoVis,2014,Revisiting Bertin Matrices: New Interactions for Crafting Tabular Visualizations,10.1109/TVCG.2014.2346279,http://dx.doi.org/10.1109/TVCG.2014.2346279,2082,2091,J,"We present Bertifier, a web app for rapidly creating tabular visualizations from spreadsheets. Bertifier draws from Jacques Bertin's matrix analysis method, whose goal was to “simplify without destroying” by encoding cell values visually and grouping similar rows and columns. Although there were several attempts to bring this method to computers, no implementation exists today that is both exhaustive and accessible to a large audience. Bertifier remains faithful to Bertin's method while leveraging the power of today's interactive computers. Tables are formatted and manipulated through crossets, a new interaction technique for rapidly applying operations on rows and columns. We also introduce visual reordering, a semi-interactive reordering approach that lets users apply and tune automatic reordering algorithms in a WYSIWYG manner. Sessions with eight users from different backgrounds suggest that Bertifier has the potential to bring Bertin's method to a wider audience of both technical and non-technical users, and empower them with data analysis and communication tools that were so far only accessible to a handful of specialists.COMPUTER",Charles Perin;Pierre Dragicevic;Jean-Daniel Fekete,Charles Perin;Pierre Dragicevic;Jean-Daniel Fekete,INRIA;INRIA;INRIA,10.1109/TVCG.2006.160;10.1109/TVCG.2014.2346292;10.1109/TVCG.2014.2346426,"Visualization, Interaction, Tabular Data, Bertin, Crossing, Crossets",56,45,60,
VAST,2014,EvoRiver: Visual Analysis of Topic Coopetition on Social Media,10.1109/TVCG.2014.2346919,http://dx.doi.org/10.1109/TVCG.2014.2346919,1753,1762,J,"Cooperation and competition (jointly called “coopetition”) are two modes of interactions among a set of concurrent topics on social media. How do topics cooperate or compete with each other to gain public attention? Which topics tend to cooperate or compete with one another? Who plays the key role in coopetition-related interactions? We answer these intricate questions by proposing a visual analytics system that facilitates the in-depth analysis of topic coopetition on social media. We model the complex interactions among topics as a combination of carry-over, coopetition recruitment, and coopetition distraction effects. This model provides a close functional approximation of the coopetition process by depicting how different groups of influential users (i.e., “topic leaders”) affect coopetition. We also design EvoRiver, a time-based visualization, that allows users to explore coopetition-related interactions and to detect dynamically evolving patterns, as well as their major causes. We test our model and demonstrate the usefulness of our system based on two Twitter data sets (social topics data and business topics data).",Guodao Sun;Yingcai Wu;Shixia Liu;Tai-Quan Peng;Jonathan J. H. Zhu;Ronghua Liang,Guodao Sun;Yingcai Wu;Shixia Liu;Tai-Quan Peng;Jonathan J. H. Zhu;Ronghua Liang,Zhejiang University of Technology;Microsoft Research;Microsoft Research;Nanyang Technological University;City University of Hong Kong;Zhejiang University of Technology,10.1109/VAST.2010.5652931;10.1109/TVCG.2012.291;10.1109/TVCG.2008.166;10.1109/TVCG.2011.239;10.1109/TVCG.2012.253;10.1109/TVCG.2014.2346920;10.1109/TVCG.2013.221;10.1109/TVCG.2013.196;10.1109/TVCG.2013.162,"Topic coopetition, information diffusion, information propagation, time-based visualization",56,64,46,
InfoVis,1998,The shape of Shakespeare: visualizing text using implicit surfaces,10.1109/INFVIS.1998.729568,http://dx.doi.org/10.1109/INFVIS.1998.729568,121,"129, 160",C,"Information visualization focuses on the use of visual means for exploring non-visual information. While free-form text is a rich, common source of information, visualization of text is a challenging problem since text is inherently non-spatial. The paper explores the use of implicit surface models for visualizing text. The authors describe several techniques for text visualization that aid in understanding document content and document relationships. A simple method is defined for mapping document content to shape. By comparing the shapes of multiple documents, global content similarities and differences may be noted. In addition, they describe a visual clustering method in which documents are arranged in 3D based upon similarity scoring. Documents deemed closely related blend together as a single connected shape. Hence, a document corpus becomes a collection of shapes that reflect inter-document relationships. These techniques provide methods to visualize individual documents as well as corpus meta-data. They then combine the two techniques to produce transparent clusters enclosing individual document shapes. This provides a way to visualize both local and global contextual information. Finally, they elaborate on several potential applications of these methods.",Randall M. Rohrer;John L. Sibert;David S. Ebert,R.M. Rohrer;D.S. Ebert;J.L. Sibert,"Dept. of Electr. Eng. & Comput. Sci., George Washington Univ., Washington, DC, USA",10.1109/INFVIS.1997.636761;10.1109/INFVIS.1997.636759;10.1109/INFVIS.1995.528686;10.1109/VISUAL.1996.568110;10.1109/INFVIS.1996.559228,"information visualization, text visualization, procedural visualization, implicit surface modeling, blobby models, document clustering, information retrieval, graphics, user interfaces",55,21,26,
Vis,1998,Feature comparisons of vector fields using Earth mover's distance,10.1109/VISUAL.1998.745291,http://dx.doi.org/10.1109/VISUAL.1998.745291,103,109,C,"A novel approach is introduced to define a quantitative measure of closeness between vector fields. The usefulness of this measurement can be seen when comparing computational and experimental flow fields under the same conditions. Furthermore, its applicability can be extended to more cumbersome tasks, such as navigating through a large database, searching for similar topologies. This new measure relies on the use of critical points, which are a key feature in vector field topology. In order to characterize critical points, /spl alpha/ and /spl beta/ parameters are introduced. They are used to form a closed set of eight unique patterns for simple critical points. These patterns are also basic building blocks for higher-order nonlinear vector fields. In order to study and compare a given set of vector fields, a measure of distance between different patterns of critical points is introduced. The basic patterns of critical points are mapped onto a unit circle in /spl alpha/-/spl beta/ space. The concept of the ""Earth mover's distance"" is used to compute the closeness between various pairs of vector fields, and a nearest-neighbor query is thus produced to illustrate the relationship between the given set of vector fields. This approach quantitatively measures the similarity and dissimilarity between vector fields. It is ideal for data compression of a large flow field, since only the number and types of critical points along with their corresponding /spl alpha/ and /spl beta/ parameters are necessary to reconstruct the whole field. It can also be used to better quantify the changes in time-varying data sets.",Yingmei Lavin;Rajesh Batra;Lambertus Hesselink,Y. Lavin;R. Batra;L. Hesselink,"Dept. of Phys., Stanford Univ., CA, USA",10.1109/VISUAL.1997.663858;10.1109/VISUAL.1997.663857,,55,25,17,
Vis,1998,Eliminating popping artifacts in sheet buffer-based splatting,10.1109/VISUAL.1998.745309,http://dx.doi.org/10.1109/VISUAL.1998.745309,239,245,C,"Splatting is a fast volume rendering algorithm which achieves its speed by projecting voxels in the form of pre-integrated interpolation kernels, or splats. Presently, two main variants of the splatting algorithm exist: (i) the original method, in which all splats are composited back-to-front, and (ii) the sheet-buffer method, in which the splats are added in cache-sheets, aligned with the volume face most parallel to the image plane, which are subsequently composited back-to-front. The former method is prone to cause bleeding artifacts from hidden objects, while the latter method reduces bleeding, but causes very visible color popping artifacts when the orientation of the compositing sheets changes suddenly as the image screen becomes more parallel to another volume face. We present a new variant of the splatting algorithm in which the compositing sheets are always parallel to the image plane, eliminating the condition for popping, while maintaining the insensitivity to color bleeding. This enables pleasing animated viewing of volumetric objects without temporal color and lighting discontinuities. The method uses a hierarchy of partial splats and employs an efficient list-based volume traversal scheme for fast splat access. It also offers more accuracy for perspective splatting as the decomposition of the individual splats facilitates a better approximation to the diverging nature of the rays that traverse the splatting kernels.",Klaus Mueller;Roger Crawfis,K. Mueller;R. Crawfis,"Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA",10.1109/VISUAL.1996.567608;10.1109/VISUAL.1996.568119;10.1109/VISUAL.1995.480792;10.1109/VISUAL.1997.663882;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1993.398852,,55,28,23,
InfoVis,2000,Visualizing sequential patterns for text mining,10.1109/INFVIS.2000.885097,http://dx.doi.org/10.1109/INFVIS.2000.885097,105,111,C,"A sequential pattern in data mining is a finite series of elements such as A/spl rarr/B/spl rarr/C/spl rarr/D where A, B, C, and D are elements of the same domain. The mining of sequential patterns is designed to find patterns of discrete events that frequently happen in the same arrangement along a timeline. Like association and clustering, the mining of sequential patterns is among the most popular knowledge discovery techniques that apply statistical measures to extract useful information from large datasets. As out computers become more powerful, we are able to mine bigger datasets and obtain hundreds of thousands of sequential patterns in full detail. With this vast amount of data, we argue that neither data mining nor visualization by itself can manage the information and reflect the knowledge effectively. Subsequently, we apply visualization to augment data mining in a study of sequential patterns in large text corpora. The result shows that we can learn more and more quickly in an integrated visual data-mining environment.",Pak Chung Wong;Wendy Cowley;Harlan Foote;Elizabeth Jurrus;James J. Thomas,Pak Chung Wong;W. Cowley;H. Foote;E. Jurrus;J. Thomas,"Pacific Northwest Lab., Richland, WA, USA",10.1109/INFVIS.1998.729565;10.1109/INFVIS.1998.729570;10.1109/VISUAL.1998.745302;10.1109/INFVIS.1995.528686;10.1109/INFVIS.1999.801866;10.1109/INFVIS.1997.636791,,55,15,14,
Vis,2001,Salient iso-surface detection with model-independent statistical signatures,10.1109/VISUAL.2001.964516,http://dx.doi.org/10.1109/VISUAL.2001.964516,231,238,C,"Volume graphics has not been accepted for widespread use. One of the inhibiting reasons is the lack of general methods for data-analysis and simple interfaces for data exploration. An error-and-trial iterative procedure is often used to select a desirable transfer function or mine the dataset for salient iso-values. New semi-automatic methods that are also data-centric have shown much promise. However, general and robust methods are still needed for data-exploration and analysis. In this paper, we propose general model-independent statistical methods based on central moments of data. Using these techniques we show how salient iso-surfaces at material boundaries can be determined. We provide examples from the medical and computational domain to demonstrate the effectiveness of our methods.",Shivaraj Tenginakai;Jinho Lee;Raghu Machiraju,S. Tenginakai;Jinho Lee;R. Machiraju,"Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA;Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA;Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA",10.1109/VISUAL.1998.745319;10.1109/VISUAL.1997.663875;10.1109/VISUAL.1996.568113,"Iso-values, Transfer Functions, Surface Extraction, Direct Volume Rendering",55,24,13,
InfoVis,2002,A space-optimized tree visualization,10.1109/INFVIS.2002.1173152,http://dx.doi.org/10.1109/INFVIS.2002.1173152,85,92,C,"We describe a new method for the visualization of tree structured relational data. It can be used especially for the display of very large hierarchies in a 2-dimensional space. We discuss the advantages and limitations of current techniques of tree visualization. Our strategy is to optimize the drawing of trees in a geometrical plane and maximize the utilization of display space by allowing more nodes and links to be displayed at a limit screen resolution. We use the concept of enclosure to partition the entire display space into a collection of local regions that are assigned to all nodes in tree T for the display of their sub-trees and themselves. To enable the exploration of large hierarchies, we use a modified semantic zooming technique to view the detail of a particular part of the hierarchy at a time based on user's interest. Layout animation is also provided to preserve the mental map while the user is exploring the hierarchy by changing zoomed views.",Quang Vinh Nguyen;Mao Lin Huang,Quang Vinh Nguyen;Mao Lin Huang,"Fac. of Inf. Technol., Univ. of Technol., Sydney, NSW, Australia;Fac. of Inf. Technol., Univ. of Technol., Sydney, NSW, Australia",10.1109/INFVIS.1998.729555;10.1109/VISUAL.1991.175815,,55,7,17,
Vis,2004,Haptic display of interaction between textured models,10.1109/VISUAL.2004.37,http://dx.doi.org/10.1109/VISUAL.2004.37,297,304,C,Surface texture is among the most salient haptic characteristics of objects; it can induce vibratory contact forces that lead to perception of roughness. We present a new algorithm to display haptic texture information resulting from the interaction between two textured objects. We compute contact forces and torques using low-resolution geometric representations along with texture images that encode surface details. We also introduce a novel force model based on directional penetration depth and describe an efficient implementation on programmable graphics hardware that enables interactive haptic texture rendering of complex models. Our force model takes into account important factors identified by psychophysics studies and is able to haptically display interaction due to fine surface textures that previous algorithms do not capture.,Miguel A. Otaduy;Nitin Jain;Avneesh Sud;Ming C. Lin,M.A. Otaduy;N. Jain;A. Sud;M.C. Lin,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.2003.1250380,"haptics, textures, graphics hardware",55,27,27,
Vis,2005,Visualizing data with motion,10.1109/VISUAL.2005.1532838,http://dx.doi.org/10.1109/VISUAL.2005.1532838,527,534,C,"This paper describes an experimental study of three perceptual properties of motion: flicker, direction, and velocity. Our goal is to understand how to apply these properties to represent data in a visualization environment. Results from our experiments show that all three properties can encode multiple data values, but that minimum visual differences are needed to ensure rapid and accurate target detection: flicker must be coherent and must have a cycle length of 120 milliseconds or greater, direction must differ by at least 20/spl deg/, and velocity must differ by at least 0.43/spl deg/ of subtended visual angle. We conclude with an overview of how we are applying our results to real-world data, and then discuss future work we plan to pursue.",Daniel E. Huber;Christopher G. Healey,D.E. Huber;C.G. Healey,,10.1109/VISUAL.1990.146373,"direction, flicker, motion, multidimensional, perception, velocity, visualization",55,16,16,
InfoVis,2007,Legible Cities: Focus-Dependent Multi-Resolution Visualization of Urban Relationships,10.1109/TVCG.2007.70574,http://dx.doi.org/10.1109/TVCG.2007.70574,1169,1175,J,"Numerous systems have been developed to display large collections of data for urban contexts; however, most have focused on layering of single dimensions of data and manual calculations to understand relationships within the urban environment. Furthermore, these systems often limit the user's perspectives on the data, thereby diminishing the user's spatial understanding of the viewing region. In this paper, we introduce a highly interactive urban visualization tool that provides intuitive understanding of the urban data. Our system utilizes an aggregation method that combines buildings and city blocks into legible clusters, thus providing continuous levels of abstraction while preserving the user's mental model of the city. In conjunction with a 3D view of the urban model, a separate but integrated information visualization view displays multiple disparate dimensions of the urban data, allowing the user to understand the urban environment both spatially and cognitively in one glance. For our evaluation, expert users from various backgrounds viewed a real city model with census data and confirmed that our system allowed them to gain more intuitive and deeper understanding of the urban model from different perspectives and levels of abstraction than existing commercial urban visualization systems.",Remco Chang;Ginette Wessel;Robert Kosara;Eric Sauda;William Ribarsky,Remco Chang;Ginette Wessel;Robert Kosara;Eric Sauda;William Ribarsky,,10.1109/INFVIS.2004.12;10.1109/VISUAL.1990.146402;10.1109/INFVIS.2005.1532149,"Urban models, information visualization, multi-resolution",55,33,31,
InfoVis,2008,HiPP: A Novel Hierarchical Point Placement Strategy and its Application to the Exploration of Document Collections,10.1109/TVCG.2008.138,http://dx.doi.org/10.1109/TVCG.2008.138,1229,1236,J,"Point placement strategies aim at mapping data points represented in higher dimensions to bi-dimensional spaces and are frequently used to visualize relationships amongst data instances. They have been valuable tools for analysis and exploration of data sets of various kinds. Many conventional techniques, however, do not behave well when the number of dimensions is high, such as in the case of documents collections. Later approaches handle that shortcoming, but may cause too much clutter to allow flexible exploration to take place. In this work we present a novel hierarchical point placement technique that is capable of dealing with these problems. While good grouping and separation of data with high similarity is maintained without increasing computation cost, its hierarchical structure lends itself both to exploration in various levels of detail and to handling data in subsets, improving analysis capability and also allowing manipulation of larger data sets.",Fernando Vieira Paulovich;Rosane Minghim,Fernando V. Paulovich;Rosane Minghim,"Instituto de Ciências Matemáticas e de Computação (ICMC), University of São Paulo, São Carlos/SP, Brazil;Instituto de Ciências Matemáticas e de Computação (ICMC), University of São Paulo, São Carlos/SP, Brazil",10.1109/VISUAL.1999.809866;10.1109/VISUAL.1991.175815;10.1109/VAST.2007.4389002;10.1109/VISUAL.1996.567787,"Text and document visualization, hierarchical multidimensional visualization, visual knowledge discovery, high-dimensional data",55,47,24,
Vis,2009,Scalable and Interactive Segmentation and Visualization of Neural Processes in EM Datasets,10.1109/TVCG.2009.178,http://dx.doi.org/10.1109/TVCG.2009.178,1505,1514,J,"Recent advances in scanning technology provide high resolution EM (electron microscopy) datasets that allow neuro-scientists to reconstruct complex neural connections in a nervous system. However, due to the enormous size and complexity of the resulting data, segmentation and visualization of neural processes in EM data is usually a difficult and very time-consuming task. In this paper, we present NeuroTrace, a novel EM volume segmentation and visualization system that consists of two parts: a semi-automatic multiphase level set segmentation with 3D tracking for reconstruction of neural processes, and a specialized volume rendering approach for visualization of EM volumes. It employs view-dependent on-demand filtering and evaluation of a local histogram edge metric, as well as on-the-fly interpolation and ray-casting of implicit surfaces for segmented neural structures. Both methods are implemented on the GPU for interactive performance. NeuroTrace is designed to be scalable to large datasets and data-parallel hardware architectures. A comparison of NeuroTrace with a commonly used manual EM segmentation tool shows that our interactive workflow is faster and easier to use for the reconstruction of complex neural processes.",Won-Ki Jeong;Johanna Beyer;Markus Hadwiger;Amelio Vázquez Reina;Hanspeter Pfister;Ross T. Whitaker,Won-Ki Jeong;Johanna Beyer;Markus Hadwiger;Amelio Vazquez;Hanspeter Pfister;Ross T. Whitaker,School of Engineering and Applied Sciences at Harvard University;VRVis Center for Virtual Reality and Visualization Research;VRVis Center for Virtual Reality and Visualization Research;School of Engineering and Applied Sciences at Harvard University;School of Engineering and Applied Sciences at Harvard University;Scientific Computing and Imaging Institute at the University of Utah,10.1109/TVCG.2008.169;10.1109/VISUAL.2003.1250357;10.1109/TVCG.2008.179;10.1109/VISUAL.1999.809912;10.1109/TVCG.2007.70532,"Segmentation, neuroscience, connectome, volume rendering, implicit surface rendering, graphics hardware",55,42,32,
Vis,2010,Supine and Prone Colon Registration Using Quasi-Conformal Mapping,10.1109/TVCG.2010.200,http://dx.doi.org/10.1109/TVCG.2010.200,1348,1357,J,"In virtual colonoscopy, CT scans are typically acquired with the patient in both supine (facing up) and prone (facing down) positions. The registration of these two scans is desirable so that the user can clarify situations or confirm polyp findings at a location in one scan with the same location in the other, thereby improving polyp detection rates and reducing false positives. However, this supine-prone registration is challenging because of the substantial distortions in the colon shape due to the patient's change in position. We present an efficient algorithm and framework for performing this registration through the use of conformal geometry to guarantee that the registration is a diffeomorphism (a one-to-one and onto mapping). The taeniae coli and colon flexures are automatically extracted for each supine and prone surface, employing the colon geometry. The two colon surfaces are then divided into several segments using the flexures, and each segment is cut along a taenia coli and conformally flattened to the rectangular domain using holomorphic differentials. The mean curvature is color encoded as texture images, from which feature points are automatically detected using graph cut segmentation, mathematic morphological operations, and principal component analysis. Corresponding feature points are found between supine and prone and are used to adjust the conformal flattening to be quasi-conformal, such that the features become aligned. We present multiple methods of visualizing our results, including 2D flattened rendering, corresponding 3D endoluminal views, and rendering of distortion measurements. We demonstrate the efficiency and efficacy of our registration method by illustrating matched views on both the 2D flattened colon images and in the 3D volume rendered colon endoluminal view. We analytically evaluate the correctness of the results by measuring the distance between features on the registered colons.",Wei Zeng 0002;Joseph Marino;Krishna Chaitanya Gurijala;Xianfeng Gu;Arie E. Kaufman,Wei Zeng;Joseph Marino;Krishna Chaitanya Gurijala;Xianfeng Gu;Arie Kaufman,Stony Brook University;Stony Brook University;Stony Brook University;Stony Brook University;Stony Brook University,10.1109/VISUAL.2005.1532806;10.1109/TVCG.2006.112;10.1109/VISUAL.2004.75;10.1109/TVCG.2006.158,"Data registration, geometry-based techniques, medical visualization, mathematical foundations for visualization",55,51,39,
InfoVis,2011,Asymmetric Relations in Longitudinal Social Networks,10.1109/TVCG.2011.169,http://dx.doi.org/10.1109/TVCG.2011.169,2283,2290,J,"In modeling and analysis of longitudinal social networks, visual exploration is used in particular to complement and inform other methods. The most common graphical representations for this purpose appear to be animations and small multiples of intermediate states, depending on the type of media available. We present an alternative approach based on matrix representation of gestaltlines (a combination of Tufte's sparklines with glyphs based on gestalt theory). As a result, we obtain static, compact, yet data-rich diagrams that support specifically the exploration of evolving dyadic relations and persistent group structure, although at the expense of cross-sectional network views and indirect linkages.",Ulrik Brandes;Bobo Nick,Ulrik Brandes;Bobo Nick,University of Konstanz;University of Konstanz,10.1109/TVCG.2006.163;10.1109/TVCG.2007.70582;10.1109/TVCG.2009.116;10.1109/TVCG.2006.122;10.1109/TVCG.2010.215,"Network visualization, Social networks, Time series data, visual knolwedge discovery and representation, glyph-based techniques",55,41,59,
InfoVis,2012,Perception of Visual Variables on Tiled Wall-Sized Displays for Information Visualization Applications,10.1109/TVCG.2012.251,http://dx.doi.org/10.1109/TVCG.2012.251,2516,2525,J,"We present the results of two user studies on the perception of visual variables on tiled high-resolution wall-sized displays. We contribute an understanding of, and indicators predicting how, large variations in viewing distances and viewing angles affect the accurate perception of angles, areas, and lengths. Our work, thus, helps visualization researchers with design considerations on how to create effective visualizations for these spaces. The first study showed that perception accuracy was impacted most when viewers were close to the wall but differently for each variable (Angle, Area, Length). Our second study examined the effect of perception when participants could move freely compared to when they had a static viewpoint. We found that a far but static viewpoint was as accurate but less time consuming than one that included free motion. Based on our findings, we recommend encouraging viewers to stand further back from the display when conducting perception estimation tasks. If tasks need to be conducted close to the wall display, important information should be placed directly in front of the viewer or above, and viewers should be provided with an estimation of the distortion effects predicted by our work-or encouraged to physically navigate the wall in specific ways to reduce judgement error.",Anastasia Bezerianos;Petra Isenberg,Anastasia Bezerianos;Petra Isenberg,Univ Paris-Sud;INRIA,10.1109/TVCG.2011.160;10.1109/TVCG.2006.184,"Information visualization, perception, wall-displays",55,44,41,
InfoVis,2012,SnapShot: Visualization to Propel Ice Hockey Analytics,10.1109/TVCG.2012.263,http://dx.doi.org/10.1109/TVCG.2012.263,2819,2828,J,"Sports analysts live in a world of dynamic games flattened into tables of numbers, divorced from the rinks, pitches, and courts where they were generated. Currently, these professional analysts use R, Stata, SAS, and other statistical software packages for uncovering insights from game data. Quantitative sports consultants seek a competitive advantage both for their clients and for themselves as analytics becomes increasingly valued by teams, clubs, and squads. In order for the information visualization community to support the members of this blossoming industry, it must recognize where and how visualization can enhance the existing analytical workflow. In this paper, we identify three primary stages of today's sports analyst's routine where visualization can be beneficially integrated: 1) exploring a dataspace; 2) sharing hypotheses with internal colleagues; and 3) communicating findings to stakeholders.Working closely with professional ice hockey analysts, we designed and built SnapShot, a system to integrate visualization into the hockey intelligence gathering process. SnapShot employs a variety of information visualization techniques to display shot data, yet given the importance of a specific hockey statistic, shot length, we introduce a technique, the radial heat map. Through a user study, we received encouraging feedback from several professional analysts, both independent consultants and professional team personnel.",Hannah Pileggi;Charles D. Stolper;J. Michael Boyle;John T. Stasko,Hannah Pileggi;Charles D. Stolper;J. Michael Boyle;John T. Stasko,"Georgia Institute of Technology;Georgia Institute of Technology;Sports Analytics Institute, Inc.;Georgia Institute of Technology",10.1109/TVCG.2010.179;10.1109/TVCG.2007.70537;10.1109/INFVIS.1997.636793;10.1109/TVCG.2011.185;10.1109/TVCG.2007.70577;10.1109/INFVIS.1996.559229,"Visual knowledge discovery, visual knowledge representation, hypothesis testing, visual evidence, human computer interaction",55,45,28,
InfoVis,2013,Dimension Projection Matrix/Tree: Interactive Subspace Visual Exploration and Analysis of High Dimensional Data,10.1109/TVCG.2013.150,http://dx.doi.org/10.1109/TVCG.2013.150,2625,2633,J,"For high-dimensional data, this work proposes two novel visual exploration methods to gain insights into the data aspect and the dimension aspect of the data. The first is a Dimension Projection Matrix, as an extension of a scatterplot matrix. In the matrix, each row or column represents a group of dimensions, and each cell shows a dimension projection (such as MDS) of the data with the corresponding dimensions. The second is a Dimension Projection Tree, where every node is either a dimension projection plot or a Dimension Projection Matrix. Nodes are connected with links and each child node in the tree covers a subset of the parent node's dimensions or a subset of the parent node's data items. While the tree nodes visualize the subspaces of dimensions or subsets of the data items under exploration, the matrix nodes enable cross-comparison between different combinations of subspaces. Both Dimension Projection Matrix and Dimension Project Tree can be constructed algorithmically through automation, or manually through user interaction. Our implementation enables interactions such as drilling down to explore different levels of the data, merging or splitting the subspaces to adjust the matrix, and applying brushing to select data clusters. Our method enables simultaneously exploring data correlation and dimension correlation for data with high dimensions.",Xiaoru Yuan;Donghao Ren;Zuchao Wang;Cong Guo 0004,Xiaoru Yuan;Donghao Ren;Zuchao Wang;Cong Guo,"Key Laboratory of Machine Perception (Ministry of Education) and School of EECS, Peking University;Key Laboratory of Machine Perception (Ministry of Education) and School of EECS, Peking University;Key Laboratory of Machine Perception (Ministry of Education) and School of EECS, Peking University;Key Laboratory of Machine Perception (Ministry of Education) and School of EECS, Peking University",10.1109/INFVIS.2005.1532142;10.1109/TVCG.2009.179;10.1109/TVCG.2010.138;10.1109/INFVIS.2003.1249015;10.1109/VISUAL.1990.146402;10.1109/VAST.2012.6400488;10.1109/VISUAL.1997.663866;10.1109/VISUAL.1995.485140;10.1109/TVCG.2010.184;10.1109/TVCG.2009.128;10.1109/VAST.2006.261422;10.1109/VISUAL.1999.809866;10.1109/INFVIS.2004.60;10.1109/INFVIS.2004.3;10.1109/INFVIS.2004.71;10.1109/TVCG.2009.153;10.1109/TVCG.2008.153;10.1109/INFVIS.2002.1173151,"High dimensional data, hierarchical visualization, sub-dimensional space, user interaction, subspace, tree, matrix",55,51,43,
VAST,2014,INFUSE: Interactive Feature Selection for Predictive Modeling of High Dimensional Data,10.1109/TVCG.2014.2346482,http://dx.doi.org/10.1109/TVCG.2014.2346482,1614,1623,J,"Predictive modeling techniques are increasingly being used by data scientists to understand the probability of predicted outcomes. However, for data that is high-dimensional, a critical step in predictive modeling is determining which features should be included in the models. Feature selection algorithms are often used to remove non-informative features from models. However, there are many different classes of feature selection algorithms. Deciding which one to use is problematic as the algorithmic output is often not amenable to user interpretation. This limits the ability for users to utilize their domain expertise during the modeling process. To improve on this limitation, we developed INFUSE, a novel visual analytics system designed to help analysts understand how predictive features are being ranked across feature selection algorithms, cross-validation folds, and classifiers. We demonstrate how our system can lead to important insights in a case study involving clinical researchers predicting patient outcomes from electronic medical records.",Josua Krause;Adam Perer;Enrico Bertini,Josua Krause;Adam Perer;Enrico Bertini,NYU Polytechnic School of Engineering;IBM T.J. Watson Research Center;NYU Polytechnic School of Engineering,10.1109/INFVIS.2004.71;10.1109/VAST.2009.5332586;10.1109/INFVIS.2005.1532142;10.1109/TVCG.2011.229;10.1109/VAST.2011.6102448;10.1109/INFVIS.2003.1249015;10.1109/TVCG.2011.178;10.1109/VAST.2011.6102453;10.1109/TVCG.2013.125;10.1109/TVCG.2009.153;10.1109/VAST.2010.5652443,"Predictive modeling, feature selection, classification, visual analytics, high-dimensional data",55,63,23,
Vis,1997,Controlled simplification of genus for polygonal models ,10.1109/VISUAL.1997.663909,http://dx.doi.org/10.1109/VISUAL.1997.663909,403,410,C,"Genus-reducing simplifications are important in constructing multiresolution hierarchies for level-of-detail-based rendering, especially for datasets that have several relatively small holes, tunnels, and cavities. We present a genus-reducing simplification approach that is complementary to the existing work on genus-preserving simplifications. We propose a simplification framework in which genus-reducing and genus-preserving simplifications alternate to yield much better multiresolution hierarchies than would have been possible by using either one of them. In our approach we first identify the holes and the concavities by extending the concept of /spl alpha/-hulls to polygonal meshes under the L/sub /spl infin// distance metric and then generate valid triangulations to fill them.",Jihad El-Sana;Amitabh Varshney,J. El-Sana;A. Varshney,"State Univ. of New York, Stony Brook, NY, USA",,,54,15,40,
Vis,1998,Selective visualization of vortices in hydrodynamic flows,10.1109/VISUAL.1998.745333,http://dx.doi.org/10.1109/VISUAL.1998.745333,419,422,C,"Vortices are important features in many research and engineering fields. Visualization is an important step in gaining more understanding and control of vortices. Vortex detection criteria fall into two categories: point based scalar quantities, calculated at single points, and curve based geometric criteria, calculated for, e.g., streamlines. The first category is easy to compute, but does not work in all cases. The second category is more intuitive and should work in all cases, but currently only works in 2D (or 3D projected) flows. We show applications of both approaches in hydrodynamic flows.",I. Ari Sadarjoen;Frits H. Post;Bing Ma;David C. Banks;Hans-Georg Pagendarm,I.A. Sadarjoen;F.H. Post;Bing Ma;D.C. Banks;H.-G. Pagendarm,"Dept. of Comput. Sci., Delft Univ. of Technol., Netherlands",10.1109/VISUAL.1995.485158;10.1109/VISUAL.1997.663910;10.1109/VISUAL.1994.346327;10.1109/VISUAL.1996.568137,,54,26,12,
Vis,2001,Integrating occlusion culling with view-dependent rendering,10.1109/VISUAL.2001.964534,http://dx.doi.org/10.1109/VISUAL.2001.964534,371,378,C,"We present an approach that integrates occlusion culling within the view-dependent rendering framework. View-dependent rendering provides the ability to change level of detail over the surface seamlessly and smoothly in real-time. The exclusive use of view-parameters to perform level-of-detail selection causes even occluded regions to be rendered in high level of detail. To overcome this serious drawback we have integrated occlusion culling into the level selection mechanism. Because computing exact visibility is expensive and it is currently not possible to perform this computation in real time, we use a visibility estimation technique instead. Our approach reduces dramatically the resolution at occluded regions.",Jihad El-Sana;Neta Sokolovsky;Cláudio T. Silva,J. El-Sana;N. Sokolovsky;C.T. Silva,"Dept. of Comput. Sci., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel;Dept. of Comput. Sci., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel",10.1109/VISUAL.1999.809877;10.1109/VISUAL.1999.809875;10.1109/VISUAL.1997.663860;10.1109/VISUAL.1996.568117;10.1109/VISUAL.2000.885724;10.1109/VISUAL.1998.745283;10.1109/VISUAL.1995.480805,,54,14,44,
Vis,2001,Computed tomography angiography: a case study of peripheral vessel investigation,10.1109/VISUAL.2001.964555,http://dx.doi.org/10.1109/VISUAL.2001.964555,477,480,C,This paper deals with vessel exploration based on computed tomography angiography. Large image sequences of the lower extremities are investigated in a clinical environment. Two different approaches for peripheral vessel diagnosis dealing with stenosis and calcification detection are introduced. The paper presents an automated vessel-tracking tool for curved planar reformation. An interactive segmentation tool for bone removal is proposed.,Armin Kanitsar;Rainer Wegenkittl;Petr Felkel;Dominik Fleischmann;Dominique Sandner;M. Eduard Gröller,A. Kanitsar;D. Fleischmann;R. Wegenkittl;D. Sandner;P. Felkel;E. Groller,"Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria",,"Computed Tomography Angiography (CTA), semi automatic segmentation, optimal path computation",54,17,7,
Vis,2002,Semotus Visum: a flexible remote visualization framework,10.1109/VISUAL.2002.1183758,http://dx.doi.org/10.1109/VISUAL.2002.1183758,61,68,C,"By offering more detail and precision, large data sets can provide greater insights to researchers than small data sets. However, these data sets require greater computing resources to view and manage. Remote visualization techniques allow the use of computers that cannot be operated locally. The Semotus Visum framework applies a high-performance client-server paradigm to the problem. The framework utilizes both client and server resources via multiple rendering methods. Experimental results show the framework delivers high frame rates and low latency across a wide range of data sets.",Eric Luke;Charles D. Hansen,E.J. Luke;C.D. Hansen,"Sci. Comput. & Imaging Inst., Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.1997.663891;10.1109/VISUAL.1999.809878;10.1109/VISUAL.1998.745300,"remote visualization, client/server",54,27,21,
InfoVis,2005,An interactive 3D integration of parallel coordinates and star glyphs,10.1109/INFVIS.2005.1532141,http://dx.doi.org/10.1109/INFVIS.2005.1532141,149,156,C,"Parallel coordinates are a powerful method for visualizing multidimensional data but, when applied to large data sets, they become cluttered and difficult to read. Star glyphs, on the other hand, can be used to display either the attributes of a data item or the values across all items for a single attribute. Star glyphs may readily provide a quick impression; however, since the full data set require multiple glyphs, overall readings are more difficult. We present parallel glyphs, an interactive integration of the visual representations of parallel coordinates and star glyphs that utilizes the advantages of both representations to offset the disadvantages they have separately. We discuss the role of uniform and stepped colour scales in the visual comparison of non-adjacent items and star glyphs. Parallel glyphs provide capabilities for focus-in-context exploration using two types of lenses and interactions specific to the 3D space.",Elena Fanea;Sheelagh Carpendale;Tobias Isenberg 0001,E. Fanea;S. Carpendale;T. Isenberg,"Dept. of Comput. Sci., Calgary Univ., Alta., Canada;Dept. of Comput. Sci., Calgary Univ., Alta., Canada;Dept. of Comput. Sci., Calgary Univ., Alta., Canada",10.1109/VISUAL.1995.485139;10.1109/INFVIS.2003.1249024;10.1109/INFVIS.2003.1249008;10.1109/INFVIS.2002.1173157;10.1109/INFVIS.2004.71;10.1109/INFVIS.2003.1249015;10.1109/INFVIS.2004.15;10.1109/INFVIS.2004.68;10.1109/VISUAL.1999.809866;10.1109/INFVIS.2002.1173151;10.1109/VISUAL.1994.346302;10.1109/VISUAL.1997.663866;10.1109/VISUAL.1990.146402,"Parallel Glyphs, parallel coordinates, star glyphs, multi-dimensional data sets, 3D visualization",54,14,27,
Vis,2005,Texture-based visualization of uncertainty in flow fields,10.1109/VISUAL.2005.1532853,http://dx.doi.org/10.1109/VISUAL.2005.1532853,647,654,C,"In this paper, we present two novel texture-based techniques to visualize uncertainty in time-dependent 2D flow fields. Both methods use semi-Lagrangian texture advection to show flow direction by streaklines and convey uncertainty by blurring these streaklines. The first approach applies a cross advection perpendicular to the flow direction. The second method employs isotropic diffusion that can be implemented by Gaussian filtering. Both methods are derived from a generic filtering process that is incorporated into the traditional texture advection pipeline. Our visualization methods allow for a continuous change of the density of flow representation by adapting the density of particle injection. All methods can be mapped to efficient GPU implementations. Therefore, the user can interactively control all important characteristics of the system like particle density, error influence, or dye injection to create meaningful illustrations of the underlying uncertainty. Even though there are many sources of uncertainties, we focus on uncertainty that occurs during data acquisition. We demonstrate the usefulness of our methods for the example of real-world fluid flow data measured with the particle image velocimetry (PIV) technique. Furthermore, we compare these techniques with an adapted multi-frequency noise approach.",Ralf P. Botchen;Daniel Weiskopf,R.P. Botchen;D. Weiskopf;T. Ertl,"Stuttgart Univ., Germany;Stuttgart Univ., Germany;Stuttgart Univ., Germany",10.1109/VISUAL.1996.567784;10.1109/VISUAL.2000.885689;10.1109/VISUAL.1996.568116,"Uncertainty visualization, unsteady flow visualization, texture advection, GPU programming",54,13,24,
Vis,2009,Time and Streak Surfaces for Flow Visualization in Large Time-Varying Data Sets,10.1109/TVCG.2009.190,http://dx.doi.org/10.1109/TVCG.2009.190,1267,1274,J,"Time and streak surfaces are ideal tools to illustrate time-varying vector fields since they directly appeal to the intuition about coherently moving particles. However, efficient generation of high-quality time and streak surfaces for complex, large and time-varying vector field data has been elusive due to the computational effort involved. In this work, we propose a novel algorithm for computing such surfaces. Our approach is based on a decoupling of surface advection and surface adaptation and yields improved efficiency over other surface tracking methods, and allows us to leverage inherent parallelization opportunities in the surface advection, resulting in more rapid parallel computation. Moreover, we obtain as a result of our algorithm the entire evolution of a time or streak surface in a compact representation, allowing for interactive, high-quality rendering, visualization and exploration of the evolving surface. Finally, we discuss a number of ways to improve surface depiction through advanced rendering and texturing, while preserving interactivity, and provide a number of examples for real-world datasets and analyze the behavior of our algorithm on them.",Harinarayan Krishnan;Christoph Garth;Kenneth I. Joy,Hari Krishnan;Christoph Garth;Kenneth Joy,"University of California, Davis;University of California, Davis;University of California, Davis",10.1109/TVCG.2007.70557;10.1109/VISUAL.1992.235211;10.1109/VISUAL.1993.398875;10.1109/VISUAL.2001.964506;10.1109/TVCG.2008.163;10.1109/VISUAL.2000.885688;10.1109/TVCG.2008.133,"3D vector field visualization, flow visualization, time-varying, time and streak surfaces, surface extraction",54,41,18,
InfoVis,2010,Graphical inference for infovis,10.1109/TVCG.2010.161,http://dx.doi.org/10.1109/TVCG.2010.161,973,979,J,"How do we know if what we see is really there? When visualizing data, how do we avoid falling into the trap of apophenia where we see patterns in random noise? Traditionally, infovis has been concerned with discovering new relationships, and statistics with preventing spurious relationships from being reported. We pull these opposing poles closer with two new techniques for rigorous statistical inference of visual discoveries. The ""Rorschach"" helps the analyst calibrate their understanding of uncertainty and ""line-up"" provides a protocol for assessing the significance of visual discoveries, protecting against the discovery of spurious structure.",Hadley Wickham;Dianne Cook;Heike Hofmann;Andreas Buja,Hadley Wickham;Dianne Cook;Heike Hofmann;Andreas Buja,"Rice University;Iowa State University;Iowa State University;Wharton School, University of Pennsylvania",10.1109/TVCG.2007.70577,"Statistics, visual testing, permutation tests, null hypotheses, data plots",54,42,17,BP
InfoVis,2011,Benefitting InfoVis with Visual Difficulties,10.1109/TVCG.2011.175,http://dx.doi.org/10.1109/TVCG.2011.175,2213,2222,J,"Many well-cited theories for visualization design state that a visual representation should be optimized for quick and immediate interpretation by a user. Distracting elements like decorative ""chartjunk"" or extraneous information are avoided so as not to slow comprehension. Yet several recent studies in visualization research provide evidence that non-efficient visual elements may benefit comprehension and recall on the part of users. Similarly, findings from studies related to learning from visual displays in various subfields of psychology suggest that introducing cognitive difficulties to visualization interaction can improve a user's understanding of important information. In this paper, we synthesize empirical results from cross-disciplinary research on visual information representations, providing a counterpoint to efficiency-based design theory with guidelines that describe how visual difficulties can be introduced to benefit comprehension and recall. We identify conditions under which the application of visual difficulties is appropriate based on underlying factors in visualization interaction like active processing and engagement. We characterize effective graph design as a trade-off between efficiency and learning difficulties in order to provide Information Visualization (InfoVis) researchers and practitioners with a framework for organizing explorations of graphs for which comprehension and recall are crucial. We identify implications of this view for the design and evaluation of information visualizations.",Jessica Hullman;Eytan Adar;Priti Shah,Jessica Hullman;Eytan Adar;Priti Shah,University of Michigan School of Information;University of Michigan School of Information;University of Michigan,10.1109/INFVIS.1995.528688;10.1109/TVCG.2008.125;10.1109/TVCG.2007.70539;10.1109/TVCG.2010.177;10.1109/INFVIS.2001.963279;10.1109/TVCG.2009.111,"Desirable difficulites, cognitive efficiency, active processing, engagement, individual differences ",54,51,70,HM
InfoVis,2011,Stereoscopic Highlighting: 2D Graph Visualization on Stereo Displays,10.1109/TVCG.2011.234,http://dx.doi.org/10.1109/TVCG.2011.234,2325,2333,J,"In this paper we present a new technique and prototype graph visualization system, stereoscopic highlighting, to help answer accessibility and adjacency queries when interacting with a node-link diagram. Our technique utilizes stereoscopic depth to highlight regions of interest in a 2D graph by projecting these parts onto a plane closer to the viewpoint of the user. This technique aims to isolate and magnify specific portions of the graph that need to be explored in detail without resorting to other highlighting techniques like color or motion, which can then be reserved to encode other data attributes. This mechanism of stereoscopic highlighting also enables focus+context views by juxtaposing a detailed image of a region of interest with the overall graph, which is visualized at a further depth with correspondingly less detail. In order to validate our technique, we ran a controlled experiment with 16 subjects comparing static visual highlighting to stereoscopic highlighting on 2D and 3D graph layouts for a range of tasks. Our results show that while for most tasks the difference in performance between stereoscopic highlighting alone and static visual highlighting is not statistically significant, users performed better when both highlighting methods were used concurrently. In more complicated tasks, 3D layout with static visual highlighting outperformed 2D layouts with a single highlighting method. However, it did not outperform the 2D layout utilizing both highlighting techniques simultaneously. Based on these results, we conclude that stereoscopic highlighting is a promising technique that can significantly enhance graph visualizations for certain use cases.",Basak Alper;Tobias Höllerer;JoAnn Kuchera-Morin;Angus G. Forbes,Basak Alper;Tobias Hollerer;JoAnn Kuchera-Morin;Angus Forbes,"UC Santa Barbara, MAT;UC Santa Barbara, CS;UC Santa Barbara, MAT;UC Santa Barbara, MAT",10.1109/INFVIS.1999.801869;10.1109/TVCG.2007.70521;10.1109/INFVIS.2002.1173160,"Graph visualization, stereo displays, virtual reality",54,40,30,
Vis,1992,Visualization for the document space,10.1109/VISUAL.1992.235198,http://dx.doi.org/10.1109/VISUAL.1992.235198,274,281,C,"An information retrieval frame work that promotes graphical displays, and that will make documents in the computer visualizable to the searcher, is described. As examples of such graphical displays, two simulation results of using a Kohonen feature map to generate map displays for information retrieval are presented and discussed. The map displays are a mapping from a high-dimensional document space to a two-dimensional space. They show document relationships by various visual cues, such as dots, links, clusters, and areas, as well as their measurement and spatial arrangement. Using the map displays as an interface for document retrieval systems, the user is provided with richer visual information to support browsing and searching.&lt;&lt;ETX&gt;&gt;",X. Lin,X. Lin,"Center for Comput. Legal Res., Pace Univ., White Plains, NY, USA",,,53,17,17,
InfoVis,2002,A hybrid layout algorithm for sub-quadratic multidimensional scaling,10.1109/INFVIS.2002.1173161,http://dx.doi.org/10.1109/INFVIS.2002.1173161,152,158,C,"Many clustering and layout techniques have been used for structuring and visualising complex data. This paper is inspired by a number of such contemporary techniques and presents a novel hybrid approach based upon stochastic sampling, interpolation and spring models. We use Chalmers' 1996 O(N/sup 2/) spring model as a benchmark when evaluating our technique, comparing layout quality and run times using data sets of synthetic and real data. Our algorithm runs in O(N/spl radic/N) and executes significantly faster than Chalmers' 1996 algorithm, whilst producing superior layouts. In reducing complexity and run time, we allow the visualisation of data sets of previously infeasible size. Our results indicate that our method is a solid foundation for interactive and visual exploration of data.",Alistair Morrison;Greg Ross;Matthew Chalmers,A. Morrison;G. Ross;M. Chalmers,"Dept. of Comput. Sci., Glasgow Univ., UK;Dept. of Comput. Sci., Glasgow Univ., UK;Dept. of Comput. Sci., Glasgow Univ., UK",10.1109/VISUAL.1996.567787,,53,21,0,
Vis,2003,A constraint-based technique for haptic volume exploration,10.1109/VISUAL.2003.1250381,http://dx.doi.org/10.1109/VISUAL.2003.1250381,263,269,C,"We present a haptic rendering technique that uses directional constraints to facilitate enhanced exploration modes for volumetric datasets. The algorithm restricts user motion in certain directions by incrementally moving a proxy point along the axes of a local reference frame. Reaction forces are generated by a spring coupler between the proxy and the data probe, which can be tuned to the capabilities of the haptic interface. Secondary haptic effects including field forces, friction, and texture can be easily incorporated to convey information about additional characteristics of the data. We illustrate the technique with two examples: displaying fiber orientation in heart muscle layers and exploring diffusion tensor fiber tracts in brain white matter tissue. Initial evaluation of the approach indicates that haptic constraints provide an intuitive means or displaying directional information in volume data.",Milan Ikits;J. Dean Brederson;Charles D. Hansen;Christopher R. Johnson 0001,M. Ikits;J.D. Brederson;C.D. Hansen;C.R. Johnson,"Sci. Comput. & Imaging Inst., Utah Univ., USA;Sci. Comput. & Imaging Inst., Utah Univ., USA;Sci. Comput. & Imaging Inst., Utah Univ., USA;Sci. Comput. & Imaging Inst., Utah Univ., USA",10.1109/VISUAL.2001.964545;10.1109/VISUAL.2000.885686;10.1109/VISUAL.1996.568108,"haptic rendering, immersive visualization, human-computer interaction",53,28,43,
Vis,2004,The VesselGlyph: focus & context visualization in CT-angiography,10.1109/VISUAL.2004.104,http://dx.doi.org/10.1109/VISUAL.2004.104,385,392,C,"Accurate and reliable visualization of blood vessels is still a challenging problem, notably in the presence of morphologic changes resulting from atherosclerotic diseases. We take advantage of partially segmented data with approximately identified vessel centerlines to comprehensively visualize the diseased peripheral arterial tree. We introduce the VesselGlyph as an abstract notation for novel focus &amp; context visualization techniques of tubular structures such as contrast-medium enhanced arteries in CT-angiography (CTA). The proposed techniques combine direct volume rendering (DVR) and curved planar reformation (CPR) within a single image. The VesselGlyph consists of several regions where different rendering methods are used. The region type, the used visualization method and the region parameters depend on the distance from the vessel centerline and on viewing parameters as well. By selecting proper rendering techniques for different regions, vessels are depicted in a naturally looking and undistorted anatomic context. This may facilitate the diagnosis and treatment planning of patients with peripheral arterial occlusive disease. In this paper we furthermore present a way of how to implement the proposed techniques in software and by means of modern 3D graphics accelerators.",Matús Straka;Michal Cervenanský;Alexandra La Cruz;Arnold Köchl;Milos Srámek;M. Eduard Gröller;Dominik Fleischmann,M. Straka;M. Cervenansky;A. La Cruz;A. Kochl;M. Sramek;E. Groller;D. Fleischmann,"Comm. for Sci. Visualization, Austrian Acad. of Sci., Austria",10.1109/VISUAL.2001.964538;10.1109/VISUAL.2002.1183754;10.1109/VISUAL.2001.964555,"focus & context technique, direct volume rendering, curved planar reformation, vessel visualization",53,20,20,
Vis,2005,Extraction of parallel vector surfaces in 3D time-dependent fields and application to vortex core line tracking,10.1109/VISUAL.2005.1532851,http://dx.doi.org/10.1109/VISUAL.2005.1532851,631,638,C,"We introduce an approach to tracking vortex core lines in time-dependent 3D flow fields which are defined by the parallel vectors approach. They build surface structures in the 4D space-time domain. To extract them, we introduce two 4D vector fields which act as feature flow fields, i.e., their integration gives the vortex core structures. As part of this approach, we extract and classify local bifurcations of vortex core lines in space-time. Based on a 4D stream surface integration, we provide an algorithm to extract the complete vortex core structure. We apply our technique to a number of test data sets.",Holger Theisel;Jan Sahner;Tino Weinkauf;Hans-Christian Hege;Hans-Peter Seidel,H. Theisel;J. Sahner;T. Weinkauf;H.-C. Hege;H.-P. Seidel,"MPI Saarbrucken, Germany",10.1109/VISUAL.2004.99;10.1109/VISUAL.1994.346327;10.1109/VISUAL.1999.809896;10.1109/VISUAL.1992.235211;10.1109/VISUAL.1993.398875;10.1109/VISUAL.2001.964506;10.1109/VISUAL.1998.745290;10.1109/VISUAL.1998.745296,"flow visualization, vortex core lines, bifurcations",53,15,27,
InfoVis,2007,"Visual Analysis of Network Traffic for Resource Planning, Interactive Monitoring, and Interpretation of Security Threats",10.1109/TVCG.2007.70522,http://dx.doi.org/10.1109/TVCG.2007.70522,1105,1112,J,"The Internet has become a wild place: malicious code is spread on personal computers across the world, deploying botnets ready to attack the network infrastructure. The vast number of security incidents and other anomalies overwhelms attempts at manual analysis, especially when monitoring service provider backbone links. We present an approach to interactive visualization with a case study indicating that interactive visualization can be applied to gain more insight into these large data sets. We superimpose a hierarchy on IP address space, and study the suitability of Treemap variants for each hierarchy level. Because viewing the whole IP hierarchy at once is not practical for most tasks, we evaluate layout stability when eliding large parts of the hierarchy, while maintaining the visibility and ordering of the data of interest.",Florian Mansmann;Daniel A. Keim;Stephen C. North;Brian Rexroad;Daniel Sheleheda,Florian Mansmann;Daniel A. Keim;Stephen C. North;Brian Rexroad;Daniel Sheleheda,,10.1109/VAST.2006.261438;10.1109/INFVIS.2002.1173156;10.1109/INFVIS.2004.57;10.1109/VISUAL.1991.175815,"Information visualization, network security, network monitoring, treemap",53,42,21,
Vis,2007,Cores of Swirling Particle Motion in Unsteady Flows,10.1109/TVCG.2007.70545,http://dx.doi.org/10.1109/TVCG.2007.70545,1759,1766,J,"In nature and in flow experiments particles form patterns of swirling motion in certain locations. Existing approaches identify these structures by considering the behavior of stream lines. However, in unsteady flows particle motion is described by path lines which generally gives different swirling patterns than stream lines. We introduce a novel mathematical characterization of swirling motion cores in unsteady flows by generalizing the approach of Sujudi/Haimes to path lines. The cores of swirling particle motion are lines sweeping over time, i.e., surfaces in the space-time domain. They occur at locations where three derived 4D vectors become coplanar. To extract them, we show how to re-formulate the problem using the parallel vectors operator. We apply our method to a number of unsteady flow fields.",Tino Weinkauf;Jan Sahner;Holger Theisel;Hans-Christian Hege,Tino Weinkauf;Jan Sahner;Holger Theisel;Hans-Christian Hege,Zuse Institute Berlin;Zuse Institute Berlin;Bielefeld University;Zuse Institute Berlin,10.1109/VISUAL.1999.809896;10.1109/VISUAL.2005.1532851;10.1109/VISUAL.1998.745296,"unsteady flow visualization, feature extraction, particle motion",53,45,22,
Vis,2007,Interactive Visualization of Volumetric White Matter Connectivity in DT-MRI Using a Parallel-Hardware Hamilton-Jacobi Solver,10.1109/TVCG.2007.70571,http://dx.doi.org/10.1109/TVCG.2007.70571,1480,1487,J,"In this paper we present a method to compute and visualize volumetric white matter connectivity in diffusion tensor magnetic resonance imaging (DT-MRI) using a Hamilton-Jacobi (H-J) solver on the GPU (graphics processing unit). Paths through the volume are assigned costs that are lower if they are consistent with the preferred diffusion directions. The proposed method finds a set of voxels in the DTI volume that contain paths between two regions whose costs are within a threshold of the optimal path. The result is a volumetric optimal path analysis, which is driven by clinical and scientific questions relating to the connectivity between various known anatomical regions of the brain. To solve the minimal path problem quickly, we introduce a novel numerical algorithm for solving H-J equations, which we call the fast iterative method (FIM). This algorithm is well-adapted to parallel architectures, and we present a GPU-based implementation, which runs roughly 50-100 times faster than traditional CPU-based solvers for anisotropic H-J equations. The proposed system allows users to freely change the endpoints of interesting pathways and to visualize the optimal volumetric path between them at an interactive rate. We demonstrate the proposed method on some synthetic and real DT-MRI datasets and compare the performance with existing methods.",Won-Ki Jeong;P. Thomas Fletcher;Ran Tao 0011;Ross T. Whitaker,Won-Ki Jeong;P. Thomas Fletcher;Ran Tao;Ross Whitaker,"Scientific Computing and Imaging Institute, School of Computing, University of Utah, Salt Lake City, UT;Scientific Computing and Imaging Institute, School of Computing, University of Utah, Salt Lake City, UT;Scientific Computing and Imaging Institute, School of Computing, University of Utah, Salt Lake City, UT;Scientific Computing and Imaging Institute, School of Computing, University of Utah, Salt Lake City, UT",10.1109/VISUAL.2003.1250358;10.1109/VISUAL.2003.1250357,"Diffusion tensor visualization, graphics hardware, interactivity",53,45,30,
InfoVis,2009,ActiviTree: Interactive Visual Exploration of Sequences in Event-Based Data Using Graph Similarity,10.1109/TVCG.2009.117,http://dx.doi.org/10.1109/TVCG.2009.117,945,952,J,"The identification of significant sequences in large and complex event-based temporal data is a challenging problem with applications in many areas of today's information intensive society. Pure visual representations can be used for the analysis, but are constrained to small data sets. Algorithmic search mechanisms used for larger data sets become expensive as the data size increases and typically focus on frequency of occurrence to reduce the computational complexity, often overlooking important infrequent sequences and outliers. In this paper we introduce an interactive visual data mining approach based on an adaptation of techniques developed for Web searching, combined with an intuitive visual interface, to facilitate user-centred exploration of the data and identification of sequences significant to that user. The search algorithm used in the exploration executes in negligible time, even for large data, and so no pre-processing of the selected data is required, making this a completely interactive experience for the user. Our particular application area is social science diary data but the technique is applicable across many other disciplines.",Katerina Vrotsou;Jimmy Johansson;Matthew Cooper 0001,Katerina Vrotsou;Jimmy Johansson;Matthew Cooper,"Norrk&#x0F6;ping Visualization and Interaction Studio, Link&#x0F6;ping University;Norrk&#x0F6;ping Visualization and Interaction Studio, Link&#x0F6;ping University;Norrk&#x0F6;ping Visualization and Interaction Studio, Link&#x0F6;ping University",10.1109/TVCG.2006.192;10.1109/VAST.2006.261421,"Interactive visual exploration, event-based data, sequence identification, graph similarity, node similarity",53,40,27,
Vis,2009,BrainGazer - Visual Queries for Neurobiology Research,10.1109/TVCG.2009.121,http://dx.doi.org/10.1109/TVCG.2009.121,1497,1504,J,"Neurobiology investigates how anatomical and physiological relationships in the nervous system mediate behavior. Molecular genetic techniques, applied to species such as the common fruit fly Drosophila melanogaster, have proven to be an important tool in this research. Large databases of transgenic specimens are being built and need to be analyzed to establish models of neural information processing. In this paper we present an approach for the exploration and analysis of neural circuits based on such a database. We have designed and implemented \emph{BrainGazer}, a system which integrates visualization techniques for volume data acquired through confocal microscopy as well as annotated anatomical structures with an intuitive approach for accessing the available information. We focus on the ability to visually query the data based on semantic as well as spatial relationships. Additionally, we present visualization techniques for the concurrent depiction of neurobiological volume data and geometric objects which aim to reduce visual clutter. The described system is the result of an ongoing interdisciplinary collaboration between neurobiologists and visualization researchers.",Stefan Bruckner;Veronika Soltészová;M. Eduard Gröller;Jirí Hladuvka;Katja Bühler;Jai Y. Yu;Barry J. Dickson,Stefan Bruckner;Veronika Solteszova;Eduard Groller;Jiri Hladuvka;Katja Buhler;Jai Y. Yu;Barry J. Dickson,"Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria;VRVis Research Center, Vienna, Austria;VRVis Research Center, Vienna, Austria;Research Institute of Molecular Pathology, Vienna, Austria;Research Institute of Molecular Pathology, Vienna, Austria",10.1109/VISUAL.2004.104;10.1109/VISUAL.1990.146378;10.1109/VISUAL.2003.1250412;10.1109/TVCG.2006.197;10.1109/VISUAL.1995.485139;10.1109/VISUAL.1996.568136;10.1109/TVCG.2006.195;10.1109/VAST.2008.4677354,"Biomedical visualization, neurobiology, visual queries, volume visualization",53,40,43,
InfoVis,2010,GeneaQuilts: A System for Exploring Large Genealogies,10.1109/TVCG.2010.159,http://dx.doi.org/10.1109/TVCG.2010.159,1073,1081,J,"GeneaQuilts is a new visualization technique for representing large genealogies of up to several thousand individuals. The visualization takes the form of a diagonally-filled matrix, where rows are individuals and columns are nuclear families. After identifying the major tasks performed in genealogical research and the limits of current software, we present an interactive genealogy exploration system based on GeneaQuilts. The system includes an overview, a timeline, search and filtering components, and a new interaction technique called Bring &amp; Slide that allows fluid navigation in very large genealogies. We report on preliminary feedback from domain experts and show how our system supports a number of their tasks.",Anastasia Bezerianos;Pierre Dragicevic;Jean-Daniel Fekete;Juhee Bae;Benjamin Watson,Anastasia Bezerianos;Pierre Dragicevic;Jean-Daniel Fekete;Juhee Bae;Ben Watson,,10.1109/INFVIS.2002.1173156;10.1109/INFVIS.2005.1532124,"Genealogy visualization, interaction",53,41,41,
VAST,2014,TopicPanorama: A Full Picture of Relevant Topics,10.1109/VAST.2014.7042494,http://dx.doi.org/10.1109/VAST.2014.7042494,183,192,C,"We present a visual analytics approach to developing a full picture of relevant topics discussed in multiple sources such as news, blogs, or micro-blogs. The full picture consists of a number of common topics among multiple sources as well as distinctive topics. The key idea behind our approach is to jointly match the topics extracted from each source together in order to interactively and effectively analyze common and distinctive topics. We start by modeling each textual corpus as a topic graph. These graphs are then matched together with a consistent graph matching method. Next, we develop an LOD-based visualization for better understanding and analysis of the matched graph. The major feature of this visualization is that it combines a radially stacked tree visualization with a density-based graph visualization to facilitate the examination of the matched topic graph from multiple perspectives. To compensate for the deficiency of the graph matching algorithm and meet different users' needs, we allow users to interactively modify the graph matching result. We have applied our approach to various data including news, tweets, and blog data. Qualitative evaluation and a real-world case study with domain experts demonstrate the promise of our approach, especially in support of analyzing a topic-graph-based full picture at different levels of detail.",Shixia Liu;Xiting Wang;Jianfei Chen;Jim Zhu;Baining Guo,Shixia Liu;Xiting Wang;Jianfei Chen;Jim Zhu;Baining Guo,"Microsoft Research Asia;Tsinghua University and Microsoft Research Asia;Dept. of Comp. Sei. &amp; Tech., TNList Lab, State Key Lab of lntell. Tech. &amp; Sys., Tsingua University;Dept. of Comp. Sei. &amp; Tech., TNList Lab, State Key Lab of Intell. Tech. &amp; Sys., Tsinghua University;Microsoft Research Asia",10.1109/VAST.2011.6102461;10.1109/TVCG.2011.239;10.1109/TVCG.2009.111;10.1109/TVCG.2010.154;10.1109/VAST.2011.6102439;10.1109/TVCG.2006.193;10.1109/TVCG.2012.285;10.1109/TVCG.2013.221;10.1109/TVCG.2013.162;10.1109/TVCG.2012.279;10.1109/TVCG.2010.183;10.1109/TVCG.2014.2346433;10.1109/TVCG.2007.70521;10.1109/TVCG.2013.233;10.1109/TVCG.2013.212;10.1109/TVCG.2007.70582;10.1109/TVCG.2013.232;10.1109/TVCG.2010.129;10.1109/TVCG.2014.2346919,"Topic graph, graph matching, graph visualization, user interactions, level-of-detail",53,38,61,
VAST,2015,Interactive Visual Discovering of Movement Patterns from Sparsely Sampled Geo-tagged Social Media Data,10.1109/TVCG.2015.2467619,http://dx.doi.org/10.1109/TVCG.2015.2467619,270,279,J,"Social media data with geotags can be used to track people's movements in their daily lives. By providing both rich text and movement information, visual analysis on social media data can be both interesting and challenging. In contrast to traditional movement data, the sparseness and irregularity of social media data increase the difficulty of extracting movement patterns. To facilitate the understanding of people's movements, we present an interactive visual analytics system to support the exploration of sparsely sampled trajectory data from social media. We propose a heuristic model to reduce the uncertainty caused by the nature of social media data. In the proposed system, users can filter and select reliable data from each derived movement category, based on the guidance of uncertainty model and interactive selection tools. By iteratively analyzing filtered movements, users can explore the semantics of movements, including the transportation methods, frequent visiting sequences and keyword descriptions. We provide two cases to demonstrate how our system can help users to explore the movement patterns.",Siming Chen 0001;Xiaoru Yuan;Zhenhuang Wang;Cong Guo 0004;Jie Liang 0004;Zuchao Wang;Xiaolong Zhang 0001;Jiawan Zhang,Siming Chen;Xiaoru Yuan;Zhenhuang Wang;Cong Guo;Jie Liang;Zuchao Wang;Xiaolong Luke Zhang;Jiawan Zhang,"Key Laboratory of Machine Perception (Ministry of Education), School of EECS, Peking University;Key Laboratory of Machine Perception (Ministry of Education), School of EECS, Peking University;Key Laboratory of Machine Perception (Ministry of Education), School of EECS, Peking University;Key Laboratory of Machine Perception (Ministry of Education), School of EECS, Peking University;Key Laboratory of Machine Perception (Ministry of Education), School of EECS, Peking University;Key Laboratory of Machine Perception (Ministry of Education), School of EECS, Peking University;College of Information Sciences and Technology, Pennsylvania State University;School of Computer Science and Technology, and School of Computer Software, Tianjin University",10.1109/VAST.2009.5332584;10.1109/VAST.2008.4677356;10.1109/TVCG.2009.182;10.1109/TVCG.2011.185;10.1109/TVCG.2012.291;10.1109/TVCG.2009.143;10.1109/INFVIS.2004.27;10.1109/INFVIS.2005.1532150;10.1109/TVCG.2012.265;10.1109/TVCG.2014.2346746;10.1109/TVCG.2014.2346922,"Spatial temporal visual analytics, Geo-tagged social media, Sparsely sampling, Uncertainty, Movement",53,58,47,
Vis,1992,Visualizing wind velocities by advecting cloud textures,10.1109/VISUAL.1992.235210,http://dx.doi.org/10.1109/VISUAL.1992.235210,179,184,C,"In order to visualize both clouds and wind in climate simulations, clouds were rendered using a 3D texture which was advected by the wind flow. The simulation is described. Rendering, the advection of texture coordinates, and haze effects are discussed. Results are presented.&lt;&lt;ETX&gt;&gt;",Nelson L. Max;Roger Crawfis;Dean Williams,N. Max;R. Crawfis;D. Williams,"Lawrence Livermore Nat. Lab., CA, USA;Lawrence Livermore Nat. Lab., CA, USA;Lawrence Livermore Nat. Lab., CA, USA",10.1109/VISUAL.1991.175773,"advection, 3-D texture, volume visualization, vectorfield, wind, clouds, climate modeling",52,28,11,
Vis,1996,Fast Perspective Volume Rendering with Splatting by Utilizing a Ray-Driven Approach,10.1109/VISUAL.1996.567608,http://doi.ieeecomputersociety.org/10.1109/VISUAL.1996.567608,65,72,C,"Volume ray casting is based on sampling the data along sight rays. In this technique, reconstruction is achieved by a convolution, which collects the contribution of multiple voxels to one sample point. Splatting, on the other hand, is based on projecting data points on to the screen, and reconstruction is implemented by an ""inverted convolution"", where the contribution of one data element is distributed to many sample points (i.e. pixels). Splatting produces images of a quality comparable to ray casting but at greater speeds. This is achieved by pre-computing the projection footprint that the interpolation kernel leaves on the image plane. However, while fast incremental schemes can be utilized for orthographic projection, the perspective projection complicates the mapping of the footprints and is therefore rather slow. In this paper, we merge the technique of splatting with the principles of ray casting to yield a ray-driven splatting approach. We imagine splats as being suspended in object space, a splat at every voxel. Rays are then spawned to traverse the space and intersect the splats. An efficient and accurate way of intersecting and addressing the splats is described. Not only is ray-driven splatting inherently insensitive to the complexity of the perspective viewing transform, it also offers acceleration methods such as early ray termination and bounding volumes, which are methods that traditional voxel-driven splatting cannot benefit from. This results in competitive or superior performance for parallel projection, and superior performance for perspective projection.",Klaus Mueller;Roni Yagel,K. Mueller;R. Yagel,"Biomed. Eng. Center, Ohio State Univ., Columbus, OH, USA",10.1109/VISUAL.1995.480792;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1993.398852,,52,17,0,
Vis,1996,LISTEN: sounding uncertainty visualization,10.1109/VISUAL.1996.568105,http://dx.doi.org/10.1109/VISUAL.1996.568105,189,195,C,"Integrated presentation of data with uncertainty is a worthy goal in scientific visualization. It allows researchers to make informed decisions based on imperfect data. It also allows users to visually compare and contrast different algorithms for performing the same task or different models for representing the same physical phenomenon. We present LISTEN-a data sonification system that has been incorporated into two visualization systems: a system for visualizing geometric uncertainty of surface interpolants; and a system for visualizing uncertainty in fluid flow. LISTEN is written in C++ for the SGI platform. It works with the SGI internal audio chip or a MIDI device or both. LISTEN is an object-oriented system that is modular, flexible, adaptable, portable, interactive and extensible. We demonstrate that sonification is very effective as an additional tool in visualizing geometric and fluid flow uncertainty.",Suresh K. Lodha;Catherine M. Wilson;Robert E. Sheehan,S.K. Lodha;C.M. Wilson;R.E. Sheehan,"Dept. of Comput. & Inf. Sci., California Univ., Santa Cruz, CA, USA",10.1109/VISUAL.1992.235199;10.1109/VISUAL.1995.480802;10.1109/VISUAL.1996.568116;10.1109/VISUAL.1994.346315;10.1109/VISUAL.1993.398849;10.1109/VISUAL.1995.485141,"flow, geometry, interactive, interpolation, MIDI, modular, portable, sonification, uncertainty, visualization",52,20,56,
Vis,1998,Building perceptual textures to visualize multidimensional datasets,10.1109/VISUAL.1998.745292,http://dx.doi.org/10.1109/VISUAL.1998.745292,111,118,C,"Presents a new method for using texture to visualize multi-dimensional data elements arranged on an underlying 3D height field. We hope to use simple texture patterns in combination with other visual features like hue and intensity to increase the number of attribute values we can display simultaneously. Our technique builds perceptual texture elements (or pexels) to represent each data element. Attribute values encoded in the data element are used to vary the appearance of a corresponding pexel. Texture patterns that form when the pexels are displayed can be used to rapidly and accurately explore the dataset. Our pexels are built by controlling three separate texture dimensions: height, density and regularity. Results from computer graphics, computer vision and cognitive psychology have identified these dimensions as important for the formation of perceptual texture patterns. We conducted a set of controlled experiments to measure the effectiveness of these dimensions, and to identify any visual interference that may occur when all three are displayed simultaneously at the same spatial location. Results from our experiments show that these dimensions can be used in specific combinations to form perceptual textures for visualizing multidimensional datasets. We demonstrate the effectiveness of our technique by applying it to two real-world visualization environments: tracking typhoon activity in southeast Asia, and analyzing ocean conditions in the northern Pacific.",Christopher G. Healey;James T. Enns,C.G. Healey;J.T. Enns,"North Carolina State Univ., Raleigh, NC, USA",10.1109/VISUAL.1996.568118;10.1109/VISUAL.1993.398872,"computer graphics, experimental design, human vision, multidimensional dataset, oceanography, perception, preattentive processing, scientific visualization, texture, typhoon",52,11,21,
Vis,1999,A framework for assisted exploration with collaboration,10.1109/VISUAL.1999.809893,http://dx.doi.org/10.1109/VISUAL.1999.809893,241,529,C,"We approach the problem of exploring a virtual space by exploiting positional and camera-model constraints on navigation to provide extra assistance that focuses the user's explorational wanderings on the task objectives. Our specific design incorporates not only task-based constraints on the viewer's location, gaze, and viewing parameters, but also a personal ""glide"" that serves two important functions: keeping the user oriented in the navigation space, and ""pointing"" to interesting subject areas as they are approached. The guide's cues may be ignored by continuing in motion, but if the user stops, the gaze shifts automatically toward whatever the guide was interested in. This design has the serendipitous feature that it automatically incorporates a nested collaborative paradigm simply by allowing any given viewer to be seen as the ""guide"" of one or more viewers following behind; the leading automated guide (we tend to select a guide dog for this avatar) can remind the leading live human guide of interesting sites to point out, while each real human collaborator down the chain has some choices about whether to follow the local leader's hints. We have chosen VRML as our initial development medium primarily because of its portability, and we have implemented a variety of natural modes for leading and collaborating, including ways for collaborators to attach to and detach from a particular leader.",Eric A. Wernert;Andrew J. Hanson,E.A. Wernert;A.J. Hanson,"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA",10.1109/VISUAL.1998.745326;10.1109/VISUAL.1997.663876,"wayfinding, locomotion, navigation, exploration, collaboration, virtual reality, VRML",52,17,28,
Vis,2000,Shock and vortex visualization using a combined visual/haptic interface,10.1109/VISUAL.2000.885686,http://dx.doi.org/10.1109/VISUAL.2000.885686,131,137,C,"Specific rendering modes are developed for a combined visual/haptic interface to allow exploration and understanding of fluid dynamics data. The focus is on visualization of shock surfaces and vortex cores. Advantages provided by augmenting traditional graphical rendering modes with haptic rendering modes are discussed. Particular emphasis is placed on synergistic combinations of visual and haptic modes which enable rapid, exploratory interaction with the data. Implementation issues are also discussed.",Dale A. Lawrence;Christopher D. Lee;Lucy Y. Pao;Roman Y. Novoselov,D.A. Lawrence;C.D. Lee;L.Y. Pao;R.Y. Novoselov,"Dept. of Aerosp. Eng. Sci., Colorado Univ., Boulder, CO, USA",10.1109/VISUAL.1998.745296;10.1109/VISUAL.1998.745333;10.1109/VISUAL.1996.568108,"haptic, interface, vortex, shock, visualization, fluid dynamics, virtual environment",52,20,22,
Vis,2002,A multiphase approach to efficient surface simplification,10.1109/VISUAL.2002.1183765,http://dx.doi.org/10.1109/VISUAL.2002.1183765,117,124,C,"We present a new multiphase method for efficiently simplifying polygonal surface models of arbitrary size. It operates by combining an initial out-of-core uniform clustering phase with a subsequent in-core iterative edge contraction phase. These two phases are both driven by quadric error metrics, and quadrics are used to pass information about the original surface between phases. The result is a method that produces approximations of a quality comparable to quadric-based iterative edge contraction, but at a fraction of the cost in terms of running time and memory consumption.",Michael Garland;Eric Shaffer,M. Garland;E. Shaffer,"Illinois Univ., Urbana, IL, USA;Illinois Univ., Urbana, IL, USA",10.1109/VISUAL.2001.964502;10.1109/VISUAL.2001.964503;10.1109/VISUAL.1998.745282;10.1109/VISUAL.1998.745314,"multiphase simplification, quadric error metrics, massive meshes, out-of-core simplification",52,22,18,
Vis,2002,A model for the visualization exploration process,10.1109/VISUAL.2002.1183791,http://dx.doi.org/10.1109/VISUAL.2002.1183791,323,330,C,"The current state of the art in visualization research places strong emphasis on different techniques to derive insight from disparate types of data. However, little work has investigated the visualization process itself. The information content of the visualization process - the results, history, and relationships between those results - is addressed by this work. A characterization of the visualization process is discussed, leading to a general model of the visualization exploration process. The model, based upon a new parameter derivation calculus, can be used for automated reporting, analysis, or visualized directly. An XML-based language for expressing visualization sessions using the model is also described. These sessions can then be shared and reused by collaborators. The model, along with the XML representation, provides an effective means to utilize information within the visualization process to further data exploration.",T. J. Jankun-Kelly;Kwan-Liu Ma;Michael Gertz 0001,T.J. Jankun-Kelly;Kwan-Liu Ma;M. Gertz,"Comput. Sci. Dept., California Univ., Davis, CA, USA;Comput. Sci. Dept., California Univ., Davis, CA, USA;Comput. Sci. Dept., California Univ., Davis, CA, USA",10.1109/VISUAL.2002.1183816;10.1109/INFVIS.1998.729560;10.1109/VISUAL.1999.809871;10.1109/VISUAL.1995.480821;10.1109/VISUAL.1993.398857;10.1109/VISUAL.1992.235203;10.1109/VISUAL.1995.480801;10.1109/VISUAL.1994.346304,"visualization process, visualization models, scientific and information visualization, collaboration, XML",52,27,23,
Vis,2003,Hybrid segmentation and exploration of the human lungs,10.1109/VISUAL.2003.1250370,http://dx.doi.org/10.1109/VISUAL.2003.1250370,177,184,C,"Segmentation of the tracheo-bronchial tree of the lungs is notoriously difficult. This is due to the fact that the small size of some of the anatomical structures is subject to partial volume effects. Furthermore, the limited intensity contrast between the participating materials (air, blood, and tissue) increases the segmentation of difficulties. In this paper, we propose a hybrid segmentation method which is based on a pipeline of three segmentation stages to extract the lower airways down to the seventh generation of the bronchi. User interaction is limited to the specification of a seed point inside the easily detectable trachea at the upper end of the lower airways. Similarly, the complementary vascular tree of the lungs can be segmented. Furthermore, we modified our virtual endoscopy system to visualize the vascular and airway system of the lungs along with other features, such as lung tumors.",Dirk Bartz;Dirk Mayer;Jan Fischer;Sebastian Ley;Ángel del Río;Steffi Thust;Claus Peter Heussel;Hans-Ulrich Kauczor;Wolfgang Straßer,D. Bartz;D. Mayer;J. Fischer;S. Ley;A. del Rio;S. Thust;C.P. Heussel;H.-U. Kauczor;W. Strasser,"Visual Comput. for Medicine, Eberhard-Karls-Univ. Tubingen, Germany",10.1109/VISUAL.2000.885732,"Tracheo-bronchial tree, segmentation, multi-slice CT, virtual endoscopy",52,26,17,
InfoVis,2007,Visualizing the History of Living Spaces,10.1109/TVCG.2007.70621,http://dx.doi.org/10.1109/TVCG.2007.70621,1153,1160,J,"The technology available to building designers now makes it possible to monitor buildings on a very large scale. Video cameras and motion sensors are commonplace in practically every office space, and are slowly making their way into living spaces. The application of such technologies, in particular video cameras, while improving security, also violates privacy. On the other hand, motion sensors, while being privacy-conscious, typically do not provide enough information for a human operator to maintain the same degree of awareness about the space that can be achieved by using video cameras. We propose a novel approach in which we use a large number of simple motion sensors and a small set of video cameras to monitor a large office space. In our system we deployed 215 motion sensors and six video cameras to monitor the 3,000-square-meter office space occupied by 80 people for a period of about one year. The main problem in operating such systems is finding a way to present this highly multidimensional data, which includes both spatial and temporal components, to a human operator to allow browsing and searching recorded data in an efficient and intuitive way. In this paper we present our experiences and the solutions that we have developed in the course of our work on the system. We consider this work to be the first step in helping designers and managers of building systems gain access to information about occupants' behavior in the context of an entire building in a way that is only minimally intrusive to the occupants' privacy.",Yuri A. Ivanov;Christopher Richard Wren;Alexander Sorokin;Ishwinder Kaur,Yuri Ivanov;Christopher Wren;Alexander Sorokin;Ishwinder Kaur,Mitsubuishi Electric Research Labs;Mitsubuishi Electric Research Labs;UIUC;MIT Media Lab,10.1109/INFVIS.2004.27;10.1109/INFVIS.2005.1532122,"Sensor networks, user interfaces, surveillance, timeline, spatio-temporal visualization",52,36,14,BP
VAST,2007,Analysis Guided Visual Exploration of Multivariate Data,10.1109/VAST.2007.4389000,http://dx.doi.org/10.1109/VAST.2007.4389000,83,90,C,"Visualization systems traditionally focus on graphical representation of information. They tend not to provide integrated analytical services that could aid users in tackling complex knowledge discovery tasks. Users' exploration in such environments is usually impeded due to several problems: 1) valuable information is hard to discover when too much data is visualized on the screen; 2) Users have to manage and organize their discoveries off line, because no systematic discovery management mechanism exists; 3) their discoveries based on visual exploration alone may lack accuracy; 4) and they have no convenient access to the important knowledge learned by other users. To tackle these problems, it has been recognized that analytical tools must be introduced into visualization systems. In this paper, we present a novel analysis-guided exploration system, called the nugget management system (NMS). It leverages the collaborative effort of human comprehensibility and machine computations to facilitate users' visual exploration processes. Specifically, NMS first extracts the valuable information (nuggets) hidden in datasets based on the interests of users. Given that similar nuggets may be re-discovered by different users, NMS consolidates the nugget candidate set by clustering based on their semantic similarity. To solve the problem of inaccurate discoveries, localized data mining techniques are applied to refine the nuggets to best represent the captured patterns in datasets. Lastly, the resulting well-organized nugget pool is used to guide users' exploration. To evaluate the effectiveness of NMS, we integrated NMS into Xmd- vTool, a freeware multivariate visualization system. User studies were performed to compare the users' efficiency and accuracy in finishing tasks on real datasets, with and without the help of NMS. Our user studies confirmed the effectiveness of NMS.",Di Yang;Elke A. Rundensteiner;Matthew O. Ward,Di Yang;Elke A. Rundensteiner;Matthew O. Ward,Worcester Polytechnic Institute. e-mail: diyang@wpi.edu;Worcester Polytechnic Institute. e-mail: rundenst@es.wpi.edu;Worcester Polytechnic Institute. e-mail: matt@cs.wpi.edu,10.1109/VISUAL.1994.346302;10.1109/VAST.2006.261415;10.1109/INFVIS.2004.71;10.1109/INFVIS.1997.636793;10.1109/VAST.2006.261430,"Visual Analytics, Visual Knowledge Discovery, Discovery Management, Analysis Guided Exploration",52,14,27,
Vis,2008,Vectorized Radviz and Its Application to Multiple Cluster Datasets,10.1109/TVCG.2008.173,http://dx.doi.org/10.1109/TVCG.2008.173,1444,1427,J,"Radviz is a radial visualization with dimensions assigned to points called dimensional anchors (DAs) placed on the circumference of a circle. Records are assigned locations within the circle as a function of its relative attraction to each of the DAs. The DAs can be moved either interactively or algorithmically to reveal different meaningful patterns in the dataset. In this paper we describe Vectorized Radviz (VRV) which extends the number of dimensions through data flattening. We show how VRV increases the power of Radviz through these extra dimensions by enhancing the flexibility in the layout of the DAs. We apply VRV to the problem of analyzing the results of multiple clusterings of the same data set, called multiple cluster sets or cluster ensembles. We show how features of VRV help discern patterns across the multiple cluster sets. We use the Iris data set to explain VRV and a newt gene microarray data set used in studying limb regeneration to show its utility. We then discuss further applications of VRV.",John Sharko;Georges G. Grinstein;Kenneth A. Marx,John Sharko;Georges Grinstein;Kenneth A. Marx,,10.1109/INFVIS.2004.15;10.1109/VISUAL.1997.663916;10.1109/INFVIS.1998.729559,"Visualization, Radviz, Vectorized Radviz, Clustering, Multiple Clustering, Cluster Ensembles, Flattening Datasets",52,44,29,
InfoVis,2009,Configuring Hierarchical Layouts to Address Research Questions,10.1109/TVCG.2009.128,http://dx.doi.org/10.1109/TVCG.2009.128,977,984,J,"We explore the effects of selecting alternative layouts in hierarchical displays that show multiple aspects of large multivariate datasets, including spatial and temporal characteristics. Hierarchical displays of this type condition a dataset by multiple discrete variable values, creating nested graphical summaries of the resulting subsets in which size, shape and colour can be used to show subset properties. These 'small multiples' are ordered by the conditioning variable values and are laid out hierarchically using dimensional stacking. Crucially, we consider the use of different layouts at different hierarchical levels, so that the coordinates of the plane can be used more effectively to draw attention to trends and anomalies in the data. We argue that these layouts should be informed by the type of conditioning variable and by the research question being explored. We focus on space-filling rectangular layouts that provide data-dense and rich overviews of data to address research questions posed in our exploratory analysis of spatial and temporal aspects of property sales in London. We develop a notation ('HiVE') that describes visualisation and layout states and provides reconfiguration operators, demonstrate its use for reconfiguring layouts to pursue research questions and provide guidelines for this process. We demonstrate how layouts can be related through animated transitions to reduce the cognitive load associated with their reconfiguration whilst supporting the exploratory process.",Aidan Slingsby;Jason Dykes;Jo Wood,Aidan Slingsby;Jason Dykes;Jo Wood,City University London;City University London;City University London,10.1109/TVCG.2007.70515;10.1109/INFVIS.2003.1249006;10.1109/VISUAL.1990.146386;10.1109/TVCG.2008.125;10.1109/TVCG.2007.70539;10.1109/VISUAL.2002.1183791,"Geovisualization, hierarchical, layout, guidelines, exploratory, notation",52,47,38,HM
InfoVis,2009,Interaction Techniques for Selecting and Manipulating Subgraphs in Network Visualizations,10.1109/TVCG.2009.151,http://dx.doi.org/10.1109/TVCG.2009.151,937,944,J,"We present a novel and extensible set of interaction techniques for manipulating visualizations of networks by selecting subgraphs and then applying various commands to modify their layout or graphical properties. Our techniques integrate traditional rectangle and lasso selection, and also support selecting a node's neighbourhood by dragging out its radius (in edges) using a novel kind of radial menu. Commands for translation, rotation, scaling, or modifying graphical properties (such as opacity) and layout patterns can be performed by using a hotbox (a transiently popped-up, semi-transparent set of widgets) that has been extended in novel ways to integrate specification of commands with 1D or 2D arguments. Our techniques require only one mouse button and one keyboard key, and are designed for fast, gestural, in-place interaction. We present the design and integration of these interaction techniques, and illustrate their use in interactive graph visualization. Our techniques are implemented in NAViGaTOR, a software package for visualizing and analyzing biological networks. An initial usability study is also reported.",Michael J. McGuffin;Igor Jurisica,Michael J. McGuffin;Igor Jurisica,Ecole de technologie superieure;Ontario Cancer Institute,10.1109/INFVIS.2005.1532124;10.1109/INFVIS.1996.559216,"Interactive graph drawing, network layout, radial menus, marking menus, hotbox, biological networks",52,38,19,HM
InfoVis,2009,Exemplar-based Visualization of Large Document Corpus,10.1109/TVCG.2009.140,http://dx.doi.org/10.1109/TVCG.2009.140,1161,1168,J,"With the rapid growth of the World Wide Web and electronic information services, text corpus is becoming available online at an incredible rate. By displaying text data in a logical layout (e.g., color graphs), text visualization presents a direct way to observe the documents as well as understand the relationship between them. In this paper, we propose a novel technique, Exemplar-based visualization (EV), to visualize an extremely large text corpus. Capitalizing on recent advances in matrix approximation and decomposition, EV presents a probabilistic multidimensional projection model in the low-rank text subspace with a sound objective function. The probability of each document proportion to the topics is obtained through iterative optimization and embedded to a low dimensional space using parameter embedding. By selecting the representative exemplars, we obtain a compact approximation of the data. This makes the visualization highly efficient and flexible. In addition, the selected exemplars neatly summarize the entire data set and greatly reduce the cognitive overload in the visualization, leading to an easier interpretation of large text corpus. Empirically, we demonstrate the superior performance of EV through extensive experiments performed on the publicly available text data sets.",Yanhua Chen;Lijun Wang;Ming Dong 0001;Jing Hua,Yanhua Chen;Lijun Wang;Ming Dong;Jing Hua,"Wayne State University, Detroit, MI;Wayne State University, Detroit, MI;Wayne State University, Detroit, MI;Wayne State University, Detroit, MI",10.1109/VISUAL.1999.809866;10.1109/TVCG.2008.138,"Exemplar, large-scale document visualization, multidimensional projection",52,34,24,
Vis,2009,Automatic Transfer Function Generation Using Contour Tree Controlled Residue Flow Model and Color Harmonics,10.1109/TVCG.2009.120,http://dx.doi.org/10.1109/TVCG.2009.120,1481,1488,J,"Transfer functions facilitate the volumetric data visualization by assigning optical properties to various data features and scalar values. Automation of transfer function specifications still remains a challenge in volume rendering. This paper presents an approach for automating transfer function generations by utilizing topological attributes derived from the contour tree of a volume. The contour tree acts as a visual index to volume segments, and captures associated topological attributes involved in volumetric data. A residue flow model based on Darcy's law is employed to control distributions of opacity between branches of the contour tree. Topological attributes are also used to control color selection in a perceptual color space and create harmonic color transfer functions. The generated transfer functions can depict inclusion relationship between structures and maximize opacity and color differences between them. The proposed approach allows efficient automation of transfer function generations, and exploration on the data to be carried out based on controlling of opacity residue flow rate instead of complex low-level transfer function parameter adjustments. Experiments on various data sets demonstrate the practical use of our approach in transfer function generations.",Jianlong Zhou;Masahiro Takatsuka,Jianlong Zhou;Masahiro Takatsuka,"The University of Sydney, Australia,and National ICT Australia (NICTA);The University of Sydney, Australia,and National ICT Australia (NICTA)",10.1109/VISUAL.1998.745319;10.1109/TVCG.2008.118;10.1109/VISUAL.1999.809932;10.1109/VISUAL.2003.1250414;10.1109/VISUAL.2004.96;10.1109/TVCG.2007.70591;10.1109/TVCG.2008.162;10.1109/VISUAL.2001.964519;10.1109/VISUAL.2003.1250413;10.1109/VISUAL.1997.663875;10.1109/TVCG.2006.148,"Volume Rendering, Transfer Function, Contour Tree, Residue Flow, Harmonic Color",52,47,30,
Vis,2010,View-Dependent Streamlines for 3D Vector fields,10.1109/TVCG.2010.212,http://dx.doi.org/10.1109/TVCG.2010.212,1578,1586,J,"This paper introduces a new streamline placement and selection algorithm for 3D vector fields. Instead of considering the problem as a simple feature search in data space, we base our work on the observation that most streamline fields generate a lot of self-occlusion which prevents proper visualization. In order to avoid this issue, we approach the problem in a view-dependent fashion and dynamically determine a set of streamlines which contributes to data understanding without cluttering the view. Since our technique couples flow characteristic criteria and view-dependent streamline selection we are able achieve the best of both worlds: relevant flow description and intelligible, uncluttered pictures. We detail an efficient GPU implementation of our algorithm, show comprehensive visual results on multiple datasets and compare our method with existing flow depiction techniques. Our results show that our technique greatly improves the readability of streamline visualizations on different datasets without requiring user intervention.",Stéphane Marchesin;Cheng-Kai Chen;Chris Ho;Kwan-Liu Ma,Stephane Marchesin;Cheng-Kai Chen;Chris Ho;Kwan-Liu Ma,UC Davis;UC Davis;UC Davis;UC Davis,10.1109/VISUAL.2005.1532831;10.1109/TVCG.2007.70595;10.1109/VISUAL.1994.346312;10.1109/VISUAL.2002.1183789;10.1109/TVCG.2006.116;10.1109/VISUAL.2000.885690;10.1109/VISUAL.1998.745295;10.1109/VISUAL.2005.1532832;10.1109/VISUAL.2005.1532834;10.1109/TVCG.2009.125,"Streamlines, Vector fields, View-dependent",52,46,31,
InfoVis,2011,Focus+Context Metro Maps,10.1109/TVCG.2011.205,http://dx.doi.org/10.1109/TVCG.2011.205,2528,2535,J,"We introduce a focus+context method to visualize a complicated metro map of a modern city on a small displaying area. The context of our work is with regard the popularity of mobile devices. The best route to the destination, which can be obtained from the arrival time of trains, is highlighted. The stations on the route enjoy larger spaces, whereas the other stations are rendered smaller and closer to fit the whole map into a screen. To simplify the navigation and route planning for visitors, we formulate various map characteristics such as octilinear transportation lines and regular station distances into energy terms. We then solve for the optimal layout in a least squares sense. In addition, we label the names of stations that are on the route of a passenger according to human preferences, occlusions, and consistencies of label positions using the graph cuts method. Our system achieves real-time performance by being able to report instant information because of the carefully designed energy terms. We apply our method to layout a number of metro maps and show the results and timing statistics to demonstrate the feasibility of our technique.",Yu-Shuen Wang;Ming-Te Chi,Yu-Shuen Wang;Ming-Te Chi,National Chiao Tung University;National Chengchi University,10.1109/INFVIS.1997.636786;10.1109/INFVIS.1996.559214;10.1109/TVCG.2008.132;10.1109/INFVIS.1998.729558;10.1109/VISUAL.2005.1532818,"Focus+context visualization, metro map, octilinear layout, graph labeling, optimization",52,37,26,
InfoVis,2011,Visualization of Parameter Space for Image Analysis,10.1109/TVCG.2011.253,http://dx.doi.org/10.1109/TVCG.2011.253,2402,2411,J,"Image analysis algorithms are often highly parameterized and much human input is needed to optimize parameter settings. This incurs a time cost of up to several days. We analyze and characterize the conventional parameter optimization process for image analysis and formulate user requirements. With this as input, we propose a change in paradigm by optimizing parameters based on parameter sampling and interactive visual exploration. To save time and reduce memory load, users are only involved in the first step - initialization of sampling - and the last step - visual analysis of output. This helps users to more thoroughly explore the parameter space and produce higher quality results. We describe a custom sampling plug-in we developed for CellProfiler - a popular biomedical image analysis framework. Our main focus is the development of an interactive visualization technique that enables users to analyze the relationships between sampled input parameters and corresponding output. We implemented this in a prototype called Paramorama. It provides users with a visual overview of parameters and their sampled values. User-defined areas of interest are presented in a structured way that includes image-based output and a novel layout algorithm. To find optimal parameter settings, users can tag high- and low-quality results to refine their search. We include two case studies to illustrate the utility of this approach.",A. Johannes Pretorius;Mark-Anthony Bray;Anne E. Carpenter;Roy A. Ruddle,A. Johannes Pretorius;Mark-Anthony Bray;Anne E. Carpenter;Roy A. Ruddle,"School of Computing, University of Leeds;Broad Institute of MIT and Harvard;Broad Institute of MIT and Harvard;School of Computing, University of Leeds",10.1109/INFVIS.2004.70;10.1109/VISUAL.2005.1532788;10.1109/VISUAL.1991.175815;10.1109/VISUAL.1999.809871;10.1109/VISUAL.2000.885678;10.1109/INFVIS.2001.963290,"Information visualization, visual analytics, parameter space, image analysis, sampling",52,40,27,
VAST,2016,Squares: Supporting Interactive Performance Analysis for Multiclass Classifiers,10.1109/TVCG.2016.2598828,http://dx.doi.org/10.1109/TVCG.2016.2598828,61,70,J,"Performance analysis is critical in applied machine learning because it influences the models practitioners produce. Current performance analysis tools suffer from issues including obscuring important characteristics of model behavior and dissociating performance from data. In this work, we present Squares, a performance visualization for multiclass classification problems. Squares supports estimating common performance metrics while displaying instance-level distribution information necessary for helping practitioners prioritize efforts and access data. Our controlled study shows that practitioners can assess performance significantly faster and more accurately with Squares than a confusion matrix, a common performance analysis tool in machine learning.",Donghao Ren;Saleema Amershi;Bongshin Lee;Jina Suh;Jason D. Williams,Donghao Ren;Saleema Amershi;Bongshin Lee;Jina Suh;Jason D. Williams,"University of California, Santa Barbara;Microsoft Research;Microsoft Research;Microsoft Research;Microsoft Research",10.1109/VISUAL.2000.885740;10.1109/VAST.2010.5652443;10.1109/TVCG.2012.277;10.1109/TVCG.2014.2346660;10.1109/VAST.2011.6102453;10.1109/TVCG.2011.185,Performance analysis;classification;usable machine learning,52,50,38,
Vis,1990,A system for three-dimensional acoustic 'visualization' in a virtual environment workstation,10.1109/VISUAL.1990.146398,http://dx.doi.org/10.1109/VISUAL.1990.146398,329,337,C,"The authors describe the real-time acoustic display capabilities developed for the virtual environment workstation (VIEW) project. The acoustic display is capable of generating localized acoustic cues in real time over headphones. An auditor symbology, a related collection of representational auditory objects or icons, can be designed using the auditory cue editor, which links both discrete and continuously varying acoustic parameters with information or events in the display. During a given display scenario, the symbology can be dynamically coordinated in real time with three-dimensional visual objects, speech, and gestural displays. The types of displays feasible with the system range from simple warnings and alarms to the acoustic representation of multidimensional data or events.&lt;&lt;ETX&gt;&gt;",Elizabeth M. Wenzel;Scott S. Fisher;Philip K. Stone;Scott H. Foster,E.M. Wenzel;P.K. Stone;S.S. Fisher;S.H. Foster,"NASA Ames Res. Center, Moffett Field, CA, USA;NASA Ames Res. Center, Moffett Field, CA, USA",,,51,19,36,
Vis,1997,Collision detection for volumetric objects,10.1109/VISUAL.1997.663851,http://dx.doi.org/10.1109/VISUAL.1997.663851,27,34,C,"We propose a probability model for the handling of complicated interactions between volumetric objects. In our model each volume is associated with a ""probability map"" that assigns a ""surface crossing"" probability to each space point according to local volume properties. The interaction between two volumes is then described by finding the intersecting regions between the volumes, and calculating the ""collision probabilities"" at each intersecting point from the surface crossing probabilities. To enable fast and efficient calculations, we introduce the concept of a distance map and develop two hierarchical collision detection algorithms, taking advantage of the uniform structure of volumetric datasets.",Taosong He;Arie E. Kaufman,Taosong He;A. Kaufman,"AT&T Bell Labs., Naperville, IL, USA",10.1109/VISUAL.1996.568108;10.1109/VISUAL.1994.346340,"volume visualization, volume rendering, virtual reality, volume graphics, volumetric collision, collision probability, surface crossing probability, distance map, octree, sphere tree",51,12,14,
Vis,2000,Bicubic subdivision-surface wavelets for large-scale isosurface representation and visualization,10.1109/VISUAL.2000.885720,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2000.885720,389,396,C,"We introduce a new subdivision-surface wavelet transform for arbitrary two-manifolds with boundary that is the first to use simple lifting-style filtering operations with bicubic precision. We also describe a conversion process for re-mapping large-scale isosurfaces to have subdivision connectivity and fair parameterizations so that the new wavelet transform can be used for compression and visualization. The main idea enabling our wavelet transform is the circular symmetrization of the filters in irregular neighborhoods, which replaces the traditional separation of filters into two 1D passes. Our wavelet transform uses polygonal base meshes to represent surface topology, from which a Catmull-Clark-style subdivision hierarchy is generated. The details between these levels of resolution are quickly computed and compactly stored as wavelet coefficients. The isosurface conversion process begins with a contour triangulation computed using conventional techniques, which we subsequently simplify with a variant edge-collapse procedure, followed by an edge-removal process. This provides a coarse initial base mesh, which is subsequently refined, relaxed and attracted in phases to converge to the contour. The conversion is designed to produce smooth, untangled and minimally-skewed parameterizations which improves the subsequent compression after applying the transform. We have demonstrated our conversion and transform for an isosurface obtained from a high-resolution turbulent-mixing hydrodynamics simulation, showing the potential for compression and level-of-detail visualization.",Martin Hering-Bertram;Mark A. Duchaineau;Bernd Hamann;Kenneth I. Joy,M. Bertram;M.A. Duchaineau;B. Hamann;K.I. Joy,"CASC, Lawrence Livermore Nat. Lab., CA, USA",10.1109/VISUAL.1994.346332;10.1109/VISUAL.1997.663871;10.1109/VISUAL.2000.885717,,51,12,0,
Vis,2002,Face-based luminance matching for perceptual colormap generation,10.1109/VISUAL.2002.1183788,http://dx.doi.org/10.1109/VISUAL.2002.1183788,299,306,C,"Most systems used for creating and displaying colormap-based visualizations are not photometrically calibrated. That is, the relationship between RGB input levels and perceived luminance is usually not known, due to variations in the monitor, hardware configuration, and the viewing environment. However, the luminance component of perceptually based colormaps should be controlled, due to the central role that luminance plays in our visual processing. We address this problem with a simple and effective method for performing luminance matching on an uncalibrated monitor. The method is akin to the minimally distinct border technique (a previous method of luminance matching used for measuring luminous efficiency), but our method relies on the brain's highly developed ability to distinguish human faces. We present a user study showing that our method produces equivalent results to the minimally distinct border technique, but with significantly improved precision. We demonstrate how results from our luminance matching method can be directly applied to create new univariate colormaps.",Gordon L. Kindlmann;Erik Reinhard;Sarah H. Creem-Regehr,G. Kindlmann;E. Reinhard;S. Creem,"Sch. of Comput., Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.1995.480803;10.1109/VISUAL.1992.235201;10.1109/VISUAL.2001.964510,"Colormaps, Color Scales, Isoluminance, Brightness Matching, Perceptually-based Visualization",51,29,26,
Vis,2003,3D IBFV: hardware-accelerated 3D flow visualization,10.1109/VISUAL.2003.1250377,http://dx.doi.org/10.1109/VISUAL.2003.1250377,233,240,C,"We present a hardware-accelerated method for visualizing 3D flow fields. The method is based on insertion, advection, and decay of dye. To this aim, we extend the texture-based IBFV technique presented by van Wijk (2001) for 2D flow visualization in two main directions. First, we decompose the 3D flow visualization problem in a series of 2D instances of the mentioned IBFV technique. This makes our method benefit from the hardware acceleration the original IBFV technique introduced. Secondly, we extend the concept of advected gray value (or color) noise by introducing opacity (or matter) noise. This allows us to produce sparse 3D noise pattern advections, thus address the occlusion problem inherent to 3D flow visualization. Overall, the presented method delivers interactively animated 3D flow, uses only standard OpenGL 1.1 calls and 2D textures, and is simple to understand and implement.",Alexandru Telea;Jarke J. van Wijk,A. Telea;J.J. van Wijk,"Dept. of Math. & Comput. Sci., Technische Universiteit Eindhoven, Netherlands;Dept. of Math. & Comput. Sci., Technische Universiteit Eindhoven, Netherlands",10.1109/VISUAL.1999.809892;10.1109/VISUAL.1997.663897,"Flow Visualization, Hardware Acceleration, Texture Advection, OpenGL",51,23,10,
Vis,2003,Hardware-based nonlinear filtering and segmentation using high-level shading languages,10.1109/VISUAL.2003.1250387,http://dx.doi.org/10.1109/VISUAL.2003.1250387,309,316,C,"Non-linear filtering is an important task for volume analysis. This paper presents hardware-based implementations of various non-linear filters for volume smoothing with edge preservation. The Cg high-level shading language is used in combination with latest PC consumer graphics hardware. Filtering is divided into pervertex and per-fragment stages. In both stages we propose techniques to increase the filtering performance. The vertex program pre-computes texture coordinates in order to address all contributing input samples of the operator mask. Thus additional computations are avoided in the fragment program. The presented fragment programs preserve cache coherence, exploit 4D vector arithmetic, and internal fixed point arithmetic to increase performance. We show the applicability of non-linear filters as part of a GPU-based segmentation pipeline. The resulting binary mask is compressed and decompressed in the graphics memory on-the-fly.",Ivan Viola;Armin Kanitsar;M. Eduard Gröller,I. Viola;A. Kanitsar;M.E. Groller,"Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria;Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria;Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria",10.1109/VISUAL.2002.1183766;10.1109/VISUAL.2002.1183762;10.1109/VISUAL.1999.809934," Non-linear Filtering, Segmentation, Hardware Acceleration",51,12,23,
Vis,2004,Physically based methods for tensor field visualization,10.1109/VISUAL.2004.80,http://dx.doi.org/10.1109/VISUAL.2004.80,123,130,C,"The physical interpretation of mathematical features of tensor fields is highly application-specific. Existing visualization methods for tensor fields only cover a fraction of the broad application areas. We present a visualization method tailored specifically to the class of tensor field exhibiting properties similar to stress and strain tensors, which are commonly encountered in geomechanics. Our technique is a global method that represents the physical meaning of these tensor fields with their central features: regions of compression or expansion. The method is based on two steps: first, we define a positive definite metric, with the same topological structure as the tensor field; second, we visualize the resulting metric. The eigenvector fields are represented using a texture-based approach resembling line integral convolution (LIC) methods. The eigenvalues of the metric are encoded in free parameters of the texture definition. Our method supports an intuitive distinction between positive and negative eigenvalues. We have applied our method to synthetic and some standard data sets, and ""real"" data from earth science and mechanical engineering application.",Ingrid Hotz;Louis Feng;Hans Hagen;Bernd Hamann;Kenneth I. Joy;Boris Jeremic,I. Hotz;L. Feng;H. Hagen;B. Hamann;K. Joy;B. Jeremic,"IDAV, California Univ., Davis, CA, USA;IDAV, California Univ., Davis, CA, USA",10.1109/VISUAL.1998.745316;10.1109/VISUAL.1999.809894;10.1109/VISUAL.1993.398849;10.1109/VISUAL.2002.1183798;10.1109/VISUAL.1994.346326;10.1109/VISUAL.2002.1183782;10.1109/VISUAL.2002.1183799;10.1109/VISUAL.2003.1250379,"tensors field, stress tensor, strain tensor, LIC",51,30,19,
Vis,2005,Visual analysis and exploration of fluid flow in a cooling jacket,10.1109/VISUAL.2005.1532850,http://dx.doi.org/10.1109/VISUAL.2005.1532850,623,630,C,"We present a visual analysis and exploration of fluid flow through a cooling jacket. Engineers invest a large amount of time and serious effort to optimize the flow through this engine component because of its important role in transferring heat away from the engine block. In this study we examine the design goals that engineers apply in order to construct an ideal-as-possible cooling jacket geometry and use a broad range of visualization tools in order to analyze, explore, and present the results. We systematically employ direct, geometric, and texture-based flow visualization techniques as well as automatic feature extraction and interactive feature-based methodology. And we discuss the relative advantages and disadvantages of these approaches as well as the challenges, both technical and perceptual with this application. The result is a feature-rich state-of-the-art flow visualization analysis applied to an important and complex data set from real-world computational fluid dynamics simulations.",Robert S. Laramee;Christoph Garth;Helmut Doleisch;Jürgen Schneider;Helwig Hauser;Hans Hagen,R.S. Laramee;C. Garth;H. Doleisch;J. Schneider;H. Hauser;H. Hagen,"VRVis Res. Center, Vienna, Austria",10.1109/VISUAL.1999.809895;10.1109/VISUAL.1992.235211;10.1109/VISUAL.1997.663910;10.1109/VISUAL.1996.568137;10.1109/VISUAL.2004.107;10.1109/VISUAL.2004.113;10.1109/VISUAL.1998.745333;10.1109/VISUAL.2002.1183821;10.1109/VISUAL.2003.1250376;10.1109/VISUAL.2002.1183822;10.1109/VISUAL.2004.59;10.1109/VISUAL.2004.128,"flow visualization, vector field visualization, feature-extraction, feature-based visualization, computational fluid dynamics (CFD), cooling jacket, visualization systems, engine simulation,heat transfer",51,25,28,
InfoVis,2007,Browsing Zoomable Treemaps: Structure-Aware Multi-Scale Navigation Techniques,10.1109/TVCG.2007.70540,http://dx.doi.org/10.1109/TVCG.2007.70540,1248,1253,J,"Treemaps provide an interesting solution for representing hierarchical data. However, most studies have mainly focused on layout algorithms and paid limited attention to the interaction with treemaps. This makes it difficult to explore large data sets and to get access to details, especially to those related to the leaves of the trees. We propose the notion of zoomable treemaps (ZTMs), an hybridization between treemaps and zoomable user interfaces that facilitates the navigation in large hierarchical data sets. By providing a consistent set of interaction techniques, ZTMs make it possible for users to browse through very large data sets (e.g., 700,000 nodes dispatched amongst 13 levels). These techniques use the structure of the displayed data to guide the interaction and provide a way to improve interactive navigation in treemaps.",Renaud Blanch;Eric Lecolinet,Renaud Blanch;Eric Lecolinet,,10.1109/INFVIS.2004.21;10.1109/INFVIS.2005.1532128;10.1109/INFVIS.2005.1532129;10.1109/INFVIS.2002.1173156;10.1109/INFVIS.2004.46;10.1109/INFVIS.1999.801860;10.1109/TVCG.2006.200;10.1109/INFVIS.2002.1173148;10.1109/INFVIS.2005.1532132,"Information visualization, multi-scale interaction, structure-aware navigation, zoomable treemaps",51,35,36,
VAST,2007,ClusterSculptor: A Visual Analytics Tool for High-Dimensional Data,10.1109/VAST.2007.4388999,http://dx.doi.org/10.1109/VAST.2007.4388999,75,82,C,"Cluster analysis (CA) is a powerful strategy for the exploration of high-dimensional data in the absence of a-priori hypotheses or data classification models, and the results of CA can then be used to form such models. But even though formal models and classification rules may not exist in these data exploration scenarios, domain scientists and experts generally have a vast amount of non-compiled knowledge and intuition that they can bring to bear in this effort. In CA, there are various popular mechanisms to generate the clusters, however, the results from their non- supervised deployment rarely fully agree with this expert knowledge and intuition. To this end, our paper describes a comprehensive and intuitive framework to aid scientists in the derivation of classification hierarchies in CA, using k-means as the overall clustering engine, but allowing them to tune its parameters interactively based on a non-distorted compact visual presentation of the inherent characteristics of the data in high- dimensional space. These include cluster geometry, composition, spatial relations to neighbors, and others. In essence, we provide all the tools necessary for a high-dimensional activity we call cluster sculpting, and the evolving hierarchy can then be viewed in a space-efficient radial dendrogram. We demonstrate our system in the context of the mining and classification of a large collection of millions of data items of aerosol mass spectra, but our framework readily applies to any high-dimensional CA scenario.",Eun Ju Nam;Yiping Han;Klaus Mueller;Alla Zelenyuk;Dan Imre,Eun Ju Nam;Yiping Han;Klaus Mueller;Alla Zelenyuk;Dan Imre,Stony Brook University. email: ejnam@cs.sunysb.edu;Stony Brook University. email: yiping@cs.sunysb.edu;Stony Brook University. email: mueller@cs.sunysb.edu;Pacific Northwest National Lab. email: alla.zelenyuk@pnl.gov;Imre Consulting. email: dimre2b@charter.net,10.1109/VISUAL.1997.663916;10.1109/INFVIS.2004.15;10.1109/INFVIS.1999.801859;10.1109/INFVIS.2004.68;10.1109/VISUAL.1990.146402,"Visual Analytics, High-Dimensional Data, Visual Data Mining, Visualization in Earth/Space/ and Environmental Sciences",51,35,28,
VAST,2007,Session Viewer: Visual Exploratory Analysis of Web Session Logs,10.1109/VAST.2007.4389008,http://dx.doi.org/10.1109/VAST.2007.4389008,147,154,C,"Large-scale session log analysis typically includes statistical methods and detailed log examinations. While both methods have merits, statistical methods can miss previously unknown sub- populations in the data and detailed analyses may have selection biases. We therefore built Session Viewer, a visualization tool to facilitate and bridge between statistical and detailed analyses. Taking a multiple-coordinated view approach, Session Viewer shows multiple session populations at the Aggregate, Multiple, and Detail data levels to support different analysis styles. To bridge between the statistical and the detailed analysis levels, Session Viewer provides fluid traversal between data levels and side-by-side comparison at all data levels. We describe an analysis of a large-scale web usage study to demonstrate the use of Session Viewer, where we quantified the importance of grouping sessions based on task type.",Heidi Lam;Daniel M. Russell;Diane Tang;Tamara Munzner,Heidi Lam;Daniel Russell;Diane Tang;Tamara Munzner,"University of British Columbia, Google, Inc. e-mail: hllam@cs.ubc.ca;Google, Inc. e-mail: drussell@google.com;Google, Inc. e-mail: diane@google.com;University of British Columbia. e-mail: tmm@cs.ubc.ca",10.1109/INFVIS.1998.729553;10.1109/INFVIS.2003.1249006;10.1109/INFVIS.2004.2;10.1109/INFVIS.1996.559227,"Web session log analysis, visual exploratory data analysis, information visualization",51,28,34,
Vis,2007,CoViCAD: Comprehensive Visualization of Coronary Artery Disease,10.1109/TVCG.2007.70550,http://dx.doi.org/10.1109/TVCG.2007.70550,1632,1639,J,"We present novel, comprehensive visualization techniques for the diagnosis of patients with coronary artery disease using segmented cardiac MRI data. We extent an accepted medical visualization technique called the bull's eye plot by removing discontinuities, preserving the volumetric nature of the left ventricular wall and adding anatomical context. The resulting volumetric bull's eye plot can be used for the assessment of transmurality. We link these visualizations to a 3D view that presents viability information in a detailed anatomical context. We combine multiple MRI scans (whole heart anatomical data, late enhancement data) and multiple segmentations (polygonal heart model, late enhancement contours, coronary artery tree). By selectively combining different rendering techniques we obtain comprehensive yet intuitive visualizations of the various data sources.",Maurice Termeer;Javier Oliván Bescós;Marcel Breeuwer;Anna Vilanova;Frans A. Gerritsen;M. Eduard Gröller,Maurice Termeer;Javier Oliván Bescós;Marcel Breeuwer;Anna Vilanova;Frans Gerritsen;Eduard Gröller,"Institute of Computer Graphics and Algorithms, Vienna University of Technology;Philips Medical Systems;Philips Medical Systems;Eindhoven University of Technology;Philips Medical Systems;Institute of Computer Graphics and Algorithms, Vienna University of Technology",10.1109/VISUAL.2003.1250386;10.1109/VISUAL.2002.1183754;10.1109/TVCG.2006.152;10.1109/VISUAL.2004.104,"Cardiac MRI, late enhancement, viability, bull's eye plot",51,34,14,
VAST,2008,Maintaining interactivity while exploring massive time series,10.1109/VAST.2008.4677357,http://dx.doi.org/10.1109/VAST.2008.4677357,59,66,C,"The speed of data retrieval qualitatively affects how analysts visually explore and analyze their data. To ensure smooth interactions in massive time series datasets, one needs to address the challenges of computing &lt;i&gt;ad&lt;/i&gt; &lt;i&gt;hoc&lt;/i&gt; queries, distributing query load, and hiding system latency. In this paper, we present ATLAS, a visualization tool for temporal data that addresses these issues using a combination of high performance database technology, predictive caching, and level of detail management. We demonstrate ATLAS using commodity hardware on a network traffic dataset of more than a billion records.",Sye-Min Chan;Ling Xiao;John Gerth;Pat Hanrahan,Sye-Min Chan;Ling Xiao;John Gerth;Pat Hanrahan,"Stanford University, USA;Stanford University, USA;Stanford University, USA;Stanford University, USA",10.1109/VAST.2006.261437;10.1109/VAST.2007.4388998,,51,12,30,
Vis,2008,Smoke Surfaces: An Interactive Flow Visualization Technique Inspired by Real-World Flow Experiments,10.1109/TVCG.2008.163,http://dx.doi.org/10.1109/TVCG.2008.163,1396,1403,J,"Smoke rendering is a standard technique for flow visualization. Most approaches are based on a volumetric, particle based, or image based representation of the smoke. This paper introduces an alternative representation of smoke structures: as semi-transparent streak surfaces. In order to make streak surface integration fast enough for interactive applications, we avoid expensive adaptive retriangulations by coupling the opacity of the triangles to their shapes. This way, the surface shows a smoke-like look even in rather turbulent areas. Furthermore, we show modifications of the approach to mimic smoke nozzles, wool tufts, and time surfaces. The technique is applied to a number of test data sets.",Wolfram von Funck;Tino Weinkauf;Holger Theisel;Hans-Peter Seidel,Wolfram von Funck;Tino Weinkauf;Holger Theisel;Hans-Peter Seidel,MPI Informatik Saarbücken;Zuse Institute Berlin;University of Magdeburg;MPI Informatik Saarbücken,10.1109/VISUAL.1995.485141;10.1109/VISUAL.1993.398846;10.1109/VISUAL.1992.235211;10.1109/VISUAL.2001.964506;10.1109/VISUAL.1993.398877,"Unsteady flow visualization, streak surfaces, smoke visualization",51,40,39,
Vis,2010,Exploration of 4D MRI Blood Flow using Stylistic Visualization,10.1109/TVCG.2010.153,http://dx.doi.org/10.1109/TVCG.2010.153,1339,1347,J,"Insight into the dynamics of blood-flow considerably improves the understanding of the complex cardiovascular system and its pathologies. Advances in MRI technology enable acquisition of 4D blood-flow data, providing quantitative blood-flow velocities over time. The currently typical slice-by-slice analysis requires a full mental reconstruction of the unsteady blood-flow field, which is a tedious and highly challenging task, even for skilled physicians. We endeavor to alleviate this task by means of comprehensive visualization and interaction techniques. In this paper we present a framework for pre-clinical cardiovascular research, providing tools to both interactively explore the 4D blood-flow data and depict the essential blood-flow characteristics. The framework encompasses a variety of visualization styles, comprising illustrative techniques as well as improved methods from the established field of flow visualization. Each of the incorporated styles, including exploded planar reformats, flow-direction highlights, and arrow-trails, locally captures the blood-flow dynamics and may be initiated by an interactively probed vessel cross-section. Additionally, we present the results of an evaluation with domain experts, measuring the value of each of the visualization styles and related rendering parameters.",Roy van Pelt;Javier Oliván Bescós;Marcel Breeuwer;Rachel E. Clough;M. Eduard Gröller;Bart M. ter Haar Romeny;Anna Vilanova,Roy van Pelt;Javier Olivan Bescos;Marcel Breeuwer;Rachel E. Clough;M. Eduard Groller;Bart ter Haar Romenij;Anna Vilanova,Eindhoven University of Technology;Philips Healthcare;Philips Healthcare;King's College London; Guy's and St Thomas' NHS foundation;Vienna University of Technology;Eindhoven University of Technology;Eindhoven University of Technology,10.1109/TVCG.2006.140;10.1109/TVCG.2009.138,"4D MRI blood-flow, Probing, Flow visualization, Illustrative visualization, Phase-contrast cine MRI",51,32,33,
SciVis,2012,Interactive Volume Exploration of Petascale Microscopy Data Streams Using a Visualization-Driven Virtual Memory Approach,10.1109/TVCG.2012.240,http://dx.doi.org/10.1109/TVCG.2012.240,2285,2294,J,"This paper presents the first volume visualization system that scales to petascale volumes imaged as a continuous stream of high-resolution electron microscopy images. Our architecture scales to dense, anisotropic petascale volumes because it: (1) decouples construction of the 3D multi-resolution representation required for visualization from data acquisition, and (2) decouples sample access time during ray-casting from the size of the multi-resolution hierarchy. Our system is designed around a scalable multi-resolution virtual memory architecture that handles missing data naturally, does not pre-compute any 3D multi-resolution representation such as an octree, and can accept a constant stream of 2D image tiles from the microscopes. A novelty of our system design is that it is visualization-driven: we restrict most computations to the visible volume data. Leveraging the virtual memory architecture, missing data are detected during volume ray-casting as cache misses, which are propagated backwards for on-demand out-of-core processing. 3D blocks of volume data are only constructed from 2D microscope image tiles when they have actually been accessed during ray-casting. We extensively evaluate our system design choices with respect to scalability and performance, compare to previous best-of-breed systems, and illustrate the effectiveness of our system for real microscopy data from neuroscience.",Markus Hadwiger;Johanna Beyer;Won-Ki Jeong;Hanspeter Pfister,Markus Hadwiger;Johanna Beyer;Won-Ki Jeong;Hanspeter Pfister,"King Adbullah University of Science and Technology, Saudi Arabia;King Adbullah University of Science and Technology, Saudi Arabia;UNIST;Harvard University",10.1109/VISUAL.1999.809908;10.1109/VISUAL.2003.1250384;10.1109/TVCG.2009.161,"Petascale volume exploration, high-resolution microscopy, high-throughput imaging, neuroscience",51,45,31,HM
VAST,2014,Serendip: Topic Model-Driven Visual Exploration of Text Corpora,10.1109/VAST.2014.7042493,http://dx.doi.org/10.1109/VAST.2014.7042493,173,182,C,"Exploration and discovery in a large text corpus requires investigation at multiple levels of abstraction, from a zoomed-out view of the entire corpus down to close-ups of individual passages and words. At each of these levels, there is a wealth of information that can inform inquiry - from statistical models, to metadata, to the researcher's own knowledge and expertise. Joining all this information together can be a challenge, and there are issues of scale to be combatted along the way. In this paper, we describe an approach to text analysis that addresses these challenges of scale and multiple information sources, using probabilistic topic models to structure exploration through multiple levels of inquiry in a way that fosters serendipitous discovery. In implementing this approach into a tool called Serendip, we incorporate topic model data and metadata into a highly reorderable matrix to expose corpus level trends; extend encodings of tagged text to illustrate probabilistic information at a passage level; and introduce a technique for visualizing individual word rankings, along with interaction techniques and new statistical methods to create links between different levels and information types. We describe example uses from both the humanities and visualization research that illustrate the benefits of our approach.",Eric C. Alexander;Joe Kohlmann;Robin Valenza;Michael Witmore;Michael Gleicher,Eric Alexander;Joe Kohlmann;Robin Valenza;Michael Witmore;Michael Gleicher,"Department of Computer Sciences at the University of Wisconsin-Madison;Department of Computer Sciences at the University of Wisconsin-Madison;Department of English at the University of Wisconsin-Madison;Folger Shakespeare Library in Washington, D. C.;Department of Computer Sciences at the University of Wisconsin-Madison.",10.1109/VAST.2011.6102449;10.1109/INFVIS.2000.885098;10.1109/INFVIS.1998.729568;10.1109/TVCG.2011.239;10.1109/TVCG.2011.220;10.1109/VAST.2012.6400486;10.1109/VAST.2011.6102461;10.1109/TVCG.2013.157;10.1109/TVCG.2013.162;10.1109/VAST.2007.4389006;10.1109/VAST.2007.4389004,"Text visualization, topic modeling",51,44,38,
VAST,2017,DeepEyes: Progressive Visual Analytics for Designing Deep Neural Networks,10.1109/TVCG.2017.2744358,http://dx.doi.org/10.1109/TVCG.2017.2744358,98,108,J,"Deep neural networks are now rivaling human accuracy in several pattern recognition problems. Compared to traditional classifiers, where features are handcrafted, neural networks learn increasingly complex features directly from the data. Instead of handcrafting the features, it is now the network architecture that is manually engineered. The network architecture parameters such as the number of layers or the number of filters per layer and their interconnections are essential for good performance. Even though basic design guidelines exist, designing a neural network is an iterative trial-and-error process that takes days or even weeks to perform due to the large datasets used for training. In this paper, we present DeepEyes, a Progressive Visual Analytics system that supports the design of neural networks during training. We present novel visualizations, supporting the identification of layers that learned a stable set of patterns and, therefore, are of interest for a detailed analysis. The system facilitates the identification of problems, such as superfluous filters or layers, and information that is not being captured by the network. We demonstrate the effectiveness of our system through multiple use cases, showing how a trained network can be compressed, reshaped and adapted to different problems.",Nicola Pezzotti;Thomas Höllt;Jan C. van Gemert;Boudewijn P. F. Lelieveldt;Elmar Eisemann;Anna Vilanova,Nicola Pezzotti;Thomas Höllt;Jan Van Gemert;Boudewijn P.F. Lelieveldt;Elmar Eisemann;Anna Vilanova,"Intelligent Systems department, Delft University of Technology, Delft, The Netherlands;Intelligent Systems department, Delft University of Technology, Delft, The Netherlands;Intelligent Systems department, Delft University of Technology, Delft, The Netherlands;Department of Radiology, Division of Image Processing, Leiden University Medical Center, Leiden, The Netherlands;Intelligent Systems department, Delft University of Technology, Delft, The Netherlands;Intelligent Systems department, Delft University of Technology, Delft, The Netherlands",10.1109/TVCG.2016.2598468;10.1109/TVCG.2014.2346578;10.1109/TVCG.2016.2598838;10.1109/TVCG.2014.2346574;10.1109/TVCG.2016.2598470,"Progressive visual analytics,deep neural networks,machine learning",51,40,50,
Vis,1995,Legibility enhancement for information visualisation,10.1109/VISUAL.1995.480814,http://dx.doi.org/10.1109/VISUAL.1995.480814,209,"216, 454",C,"Navigation in computer generated information spaces may be difficult, resulting in users getting ""lost in hyperspace"". This work aims to build on research from the area of city planning to try to solve this problem. We introduce the concepts of legibility and cognitive maps and the five features of urban landscape with which they are associated. Following this will be descriptions of techniques and algorithms which we have developed to allow these features to be introduced to three dimensional spaces for information visualisation. Next we describe a specific application of these techniques in the visualisation of the World Wide Web and conclude with a look at future development of the system.",Rob Ingram;Steve Benford,R. Ingram;S. Benford,"Dept. of Comput. Sci., Nottingham Univ., UK;Dept. of Comput. Sci., Nottingham Univ., UK",,,50,15,10,
Vis,1995,Marching through the Visible Man,10.1109/VISUAL.1995.485154,http://dx.doi.org/10.1109/VISUAL.1995.485154,368,"373, 476",C,"The National Library of Medicine is creating a digital atlas of the human body. This project, called the Visible Human, has already produced computed tomography, magnetic resonance imaging and physical cross-sections of a human male cadaver. This paper describes a methodology and results for extracting surfaces from the Visible Male's CT data. We use surface connectivity and isosurface extraction techniques to create polygonal models of the skin, bone, muscle and bowels. We also report early experiments with the physical cross-sections.",William E. Lorensen,W.E. Lorensen,"Corp. Res. & Dev., Gen. Electr. Co., Schenectady, NY, USA",10.1109/VISUAL.1992.235205,,50,20,9,
Vis,1996,Illustrating transparent surfaces with curvature-directed strokes,10.1109/VISUAL.1996.568110,http://dx.doi.org/10.1109/VISUAL.1996.568110,211,218,C,"Transparency can be a useful device for simultaneously depicting multiple superimposed layers of information in a single image. However, in computer-generated pictures-as in photographs and in directly viewed actual objects-it can often be difficult to adequately perceive the three-dimensional shape of a layered transparent surface or its relative depth distance from underlying structures. Inspired by artists' use of line to show shape, we have explored methods for automatically defining a distributed set of opaque surface markings that intend to portray the three-dimensional shape and relative depth of a smoothly curving layered transparent surface in an intuitively meaningful (and minimally occluding) way. This paper describes the perceptual motivation, artistic inspiration and practical implementation of an algorithm for ""texturing"" a transparent surface with uniformly distributed opaque short strokes, locally oriented in the direction of greatest normal curvature, and of length proportional to the magnitude of the surface curvature in the stroke direction. The driving application for this work is the visualization of layered surfaces in radiation therapy treatment planning data, and the technique is illustrated on transparent isointensity surfaces of radiation dose.",Victoria Interrante;Henry Fuchs;Stephen M. Pizer,V. Interrante;H. Fuchs;S. Pizer,"ICASE, NASA Langley Res. Center, USA",10.1109/VISUAL.1995.480795;10.1109/VISUAL.1990.146395;10.1109/VISUAL.1996.568111,,50,23,33,
Vis,1998,Efficient warping for architectural walkthroughs using layered depth images,10.1109/VISUAL.1998.745305,http://dx.doi.org/10.1109/VISUAL.1998.745305,211,215,C,"This paper presents efficient image-based rendering techniques used in the context of an architectural walkthrough system. Portals (doors and windows) are rendered by warping layered depth images (LDIs). In a preprocessing phase, for every portal, a number of pre-rendered images are combined into an LDI. The resulting LDI stores, exactly once, all surfaces visible in at least one of the images used in the construction, so most of the exposure errors are efficiently eliminated. The LDI can be warped in the McMillan occlusion compatible ordering. A substantial increase in performance is obtained by warping in parallel. Our parallelization scheme achieves good load balancing, scales with the number of processors, and preserves the occlusion compatible ordering. A fast, conservative reference-image-space clipping algorithm also reduces the warping effort.",Voicu Popescu;Anselmo Lastra;Daniel G. Aliaga;Manuel Menezes de Oliveira Neto,V. Popescu;A. Lastra;D. Aliaga;M. de Oliveira Neto,"North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.1997.663903,"image-based rendering, parallel warping, occlusion compatible ordering for discrete images, portal, cell, exposure error, layered depth image, clipping, architectural walkthrough",50,18,8,
Vis,2000,3D digital cleansing using segmentation rays,10.1109/VISUAL.2000.885674,http://dx.doi.org/10.1109/VISUAL.2000.885674,37,44,C,"We propose a novel approach for segmentation and digital cleansing of endoscopic organs. Our method can be used for a variety of segmentation needs with little or no modification. It aims at fulfilling the dual and often conflicting requirements of a fast and accurate segmentation and also eliminates the undesirable partial volume effect which contemporary approaches cannot. For segmentation and digital cleansing, we use the peculiar characteristics exhibited by the intersection of any two distinct-intensity regions. To detect these intersections we cast rays through the volume, which we call the segmentation rays as they assist in the segmentation. We then associate a certain task of reconstruction and classification with each intersection the ray detects. We further use volumetric contrast enhancement to reconstruct surface lost by segmentation (if any), which aids in improving the quality of the volume rendering.",Sarang Lakare;Ming Wan;Mie Sato;Arie E. Kaufman,S. Lakare;Ming Wan;M. Sato;A. Kaufman,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1999.809914,"Volume Segmentation, Segmentation Rays, Partial Volume Voxels, Volume Rendering, Virtual Endoscopy, Virtual Colonoscopy",50,12,11,
Vis,2000,"CEASAR: a smooth, accurate and robust centerline extraction algorithm",10.1109/VISUAL.2000.885675,http://dx.doi.org/10.1109/VISUAL.2000.885675,45,52,C,"We present CEASAR, a centerline extraction algorithm that delivers smooth, accurate and robust results. Centerlines are needed for accurate measurements of length along winding tubular structures. Centerlines are also required in automatic virtual navigation through human organs, such as the colon or the aorta, as they are used to control movement and orientation of the virtual camera. We introduce a concise but general definition of a centerline, and provide an algorithm that finds the centerline accurately and rapidly. Our algorithm is provably correct for general geometries. Our solution is fully automatic, which frees the user from having to engage in data preprocessing. For a number of test datasets, we show the smooth and accurate centerlines computed by our CEASAR algorithm on a single 194 MHz MIPS R10000 CPU within five minutes.",Ingmar Bitter;Mie Sato;Michael A. Bender;Kevin T. McDonnell;Arie E. Kaufman;Ming Wan,I. Bitter;M. Sato;M. Bender;K.T. McDonnell;A. Kaufman;Ming Wan,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.2000.885674,,50,14,18,
Vis,2002,XFastMesh: fast view-dependent meshing from external memory,10.1109/VISUAL.2002.1183796,http://dx.doi.org/10.1109/VISUAL.2002.1183796,363,370,C,"We present a novel disk-based multiresolution triangle mesh data structure that supports paging and view-dependent rendering of very large meshes at interactive frame rates from external memory. Our approach, called XFastMesh, is based on a view-dependent mesh simplification framework that represents half-edge collapse operations in a binary hierarchy known as a merge-tree forest. The proposed technique partitions the merge-tree forest into so-called detail blocks, which consist of binary subtrees, that are stored on disk. We present an efficient external memory data structure and file format that stores all detail information of the multiresolution triangulation method using significantly less storage then previously reported approaches. Furthermore, we present a paging algorithm that provides efficient loading and interactive rendering of large meshes from external memory at varying and view-dependent level-of-detail. The presented approach is highly efficient both in terms of space cost and paging performance.",Christopher DeCoro;Renato Pajarola,C. DeCoro;R. Pajarola,"Dept. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA;Dept. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA",10.1109/VISUAL.1997.663860;10.1109/VISUAL.2001.964502;10.1109/VISUAL.1998.745283;10.1109/VISUAL.2001.964503;10.1109/VISUAL.1996.568126;10.1109/VISUAL.1998.745282,"level-of-detail, multiresolution modeling, out-of-core rendering, interactive large-scale visualization",50,19,26,
InfoVis,2003,Visualization of Labeled Data Using Linear Transformation,10.1109/INFVIS.2003.1249017,http://doi.ieeecomputersociety.org/10.1109/INFVIS.2003.1249017,121,128,C,"We present a novel family of data-driven linear transformations, aimed at visualizing multivariate data in a low-dimensional space in a way that optimally preserves the structure of the data. The well-studied PCA and Fisher's LDA (linear discriminant analysis) are shown to be special members in this family of transformations, and we demonstrate how to generalize these two methods such as to enhance their performance. Furthermore, our technique is the only one, to the best of our knowledge, that reflects in the resulting embedding both the data coordinates and pairwise similarities and/or dissimilarities between the data elements. Even more so, when information on the clustering (labeling) decomposition of the data is known, this information can be integrated in the linear transformation, resulting in embeddings that clearly show the separation between the clusters, as well as their infrastructure. All this makes our technique very flexible and powerful, and lets us cope with kinds of data that other techniques fail to describe properly.",Yehuda Koren;Liran Carmel,Y. Koren;L. Carmel,"Dept. of Comput. Sci. & Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel;Dept. of Comput. Sci. & Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel",10.1109/INFVIS.2002.1173159;10.1109/INFVIS.2001.963275;10.1109/INFVIS.2002.1173161,"visualization, dimensionality-reduction, projection, principal component analysis, Fisher's linear discriminant analysis, eigenprojection, classification",50,15,9,
Vis,2003,Mental registration of 2D and 3D visualizations (an empirical study),10.1109/VISUAL.2003.1250396,http://dx.doi.org/10.1109/VISUAL.2003.1250396,371,378,C,"2D and 3D views are used together in many visualization domains, such as medical imaging, flow visualization, oceanographic visualization, and computer aided design (CAD). Combining these views into one display can be done by: (1) orientation icon (i.e., separate windows), (2) in-place methods (e.g., clip and cutting planes), and (3) a new method called ExoVis. How 2D and 3D views are displayed affects ease of mental registration (understanding the spatial relationship between views), an important factor influencing user performance. This paper compares the above methods in terms of their ability to support mental registration. Empirical results show that mental registration is significantly easier with in-place displays than with ExoVis, and significantly easier with ExoVis than with orientation icons. Different mental transformation strategies can explain this result. The results suggest that ExoVis may be a better alternative to orientation icons when in-place displays are not appropriate (e.g., when in-place methods hide data or cut the 3D view into several pieces).",Melanie Tory,M. Tory,"Sch. of Comput. Sci., Simon Fraser Univ., USA",10.1109/VISUAL.1992.235203;10.1109/VISUAL.1997.663914,"2D and 3D visualization, mental registration,slice, orthographic projection, empirical study, experiment",50,16,19,
VAST,2006,Interactive Visual Synthesis of Analytic Knowledge,10.1109/VAST.2006.261430,http://dx.doi.org/10.1109/VAST.2006.261430,51,58,C,"A visual investigation involves both the examination of existing information and the synthesis of new analytic knowledge. This is a progressive process in which newly synthesized knowledge becomes the foundation for future discovery. In this paper, we present a novel system supporting interactive, progressive synthesis of analytic knowledge. Here we use the term ""analytic knowledge"" to refer to concepts that a user derives from existing data along with the evidence supporting such concepts. Unlike existing visual analytic-tools, which typically support only exploration of existing information, our system offers two unique features. First, we support user-system cooperative visual synthesis of analytic knowledge from existing data. Specifically, users can visually define new concepts by annotating existing information, and refine partially formed concepts by linking additional evidence or manipulating related concepts. In response to user actions, our system can automatically manage the evolving corpus of synthesized knowledge and its corresponding evidence. Second, we support progressive visual analysis of synthesized knowledge. This feature allows analysts to visually explore both existing knowledge and synthesized knowledge, dynamically incorporating earlier analytic conclusions into the ensuing discovery process. We have applied our system to two complex but very different analytic applications. Our preliminary evaluation shows the promise of our work",David Gotz;Michelle X. Zhou;Vikram Aggarwal,David Gotz;Michelle X. Zhou;Vikram Aggarwal,"IBM T.J. Watson Research Center, e-mail: dgotz@us.ibm.com;IBM T.J. Watson Research Center, e-mail: mzhou@us.ibm.com;IBM T.J. Watson Research Center, email: vikram@us.ibm.com",10.1109/INFVIS.2005.1532146;10.1109/INFVIS.2005.1532136;10.1109/INFVIS.2001.963287;10.1109/INFVIS.1996.559210,"Visual Analytics, Intelligence analysis, Problem solving environments, Visual Knowledge Discovery",50,26,26,
Vis,2006,A Pipeline for Computer Aided Polyp Detection,10.1109/TVCG.2006.112,http://dx.doi.org/10.1109/TVCG.2006.112,861,868,J,"We present a novel pipeline for computer-aided detection (CAD) of colonic polyps by integrating texture and shape analysis with volume rendering and conformal colon flattening. Using our automatic method, the 3D polyp detection problem is converted into a 2D pattern recognition problem. The colon surface is first segmented and extracted from the CT data set of the patient's abdomen, which is then mapped to a 2D rectangle using conformal mapping. This flattened image is rendered using a direct volume rendering technique with a translucent electronic biopsy transfer function. The polyps are detected by a 2D clustering method on the flattened image. The false positives are further reduced by analyzing the volumetric shape and texture features. Compared with shape based methods, our method is much more efficient without the need of computing curvature and other shape parameters for the whole colon surface. The final detection results are stored in the 2D image, which can be easily incorporated into a virtual colonoscopy (VC) system to highlight the polyp locations. The extracted colon surface mesh can be used to accelerate the volumetric ray casting algorithm used to generate the VC endoscopic view. The proposed automatic CAD pipeline is incorporated into an interactive VC system, with a goal of helping radiologists detect polyps faster and with higher accuracy",Wei Hong 0006;Feng Qiu;Arie E. Kaufman,Wei Hong;Feng Qiu;Arie kaufman,"Department of Computer Science, Stony Brook University, Stony Brook, NY;Department of Computer Science, Stony Brook University, Stony Brook, NY;Department of Computer Science, Stony Brook University, Stony Brook, NY",10.1109/VISUAL.2001.964540;10.1109/VISUAL.2004.27;10.1109/VISUAL.1992.235231;10.1109/VISUAL.2003.1250384,"Computer Aided Detection, Virtual Colonoscopy, Texture Analysis, Volume Rendering",50,38,29,
Vis,2007,An Effective Illustrative Visualization Framework Based on Photic Extremum Lines (PELs),10.1109/TVCG.2007.70538,http://dx.doi.org/10.1109/TVCG.2007.70538,1328,1335,J,"Conveying shape using feature lines is an important visualization tool in visual computing. The existing feature lines (e.g., ridges, valleys, silhouettes, suggestive contours, etc.) are solely determined by local geometry properties (e.g., normals and curvatures) as well as the view position. This paper is strongly inspired by the observation in human vision and perception that a sudden change in the luminance plays a critical role to faithfully represent and recover the 3D information. In particular, we adopt the edge detection techniques in image processing for 3D shape visualization and present photic extremum lines (PELs) which emphasize significant variations of illumination over 3D surfaces. Comparing with the existing feature lines, PELs are more flexible and offer users more freedom to achieve desirable visualization effects. In addition, the user can easily control the shape visualization by changing the light position, the number of light sources, and choosing various light models. We compare PELs with the existing approaches and demonstrate that PEL is a flexible and effective tool to illustrate 3D surface and volume for visual computing.",Xuexiang Xie;Ying He 0001;Feng Tian 0006;Seah Hock Soon;Xianfeng Gu;Hong Qin,Xuexiang Xie;Ying He;Feng Tian;Hock-Soon Seah;Xianfeng Gu;Hong Qin,"School of Computer Engineering, Nanyang Technological University, Singapore;School of Computer Engineering, Nanyang Technological University, Singapore;School of Computer Engineering, Nanyang Technological University, Singapore;School of Computer Engineering, Nanyang Technological University, Singapore;Department of Computer Science, Stony Brook University, New York;Department of Computer Science, Stony Brook University, New York",10.1109/VISUAL.2003.1250414;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2002.1183777;10.1109/VISUAL.2005.1532856;10.1109/VISUAL.1995.480795,"Surface and volume illustration, illumination, photic extremum lines (PELs), silhouettes, suggestive contours, ridges and valleys, digital geometry processing",50,37,38,
InfoVis,2009,A Multi-Threading Architecture to Support Interactive Visual Exploration,10.1109/TVCG.2009.110,http://dx.doi.org/10.1109/TVCG.2009.110,1113,1120,J,"During continuous user interaction, it is hard to provide rich visual feedback at interactive rates for datasets containing millions of entries. The contribution of this paper is a generic architecture that ensures responsiveness of the application even when dealing with large data and that is applicable to most types of information visualizations. Our architecture builds on the separation of the main application thread and the visualization thread, which can be cancelled early due to user interaction. In combination with a layer mechanism, our architecture facilitates generating previews incrementally to provide rich visual feedback quickly. To help avoiding common pitfalls of multi-threading, we discuss synchronization and communication in detail. We explicitly denote design choices to control trade-offs. A quantitative evaluation based on the system VI S P L ORE shows fast visual feedback during continuous interaction even for millions of entries. We describe instantiations of our architecture in additional tools.",Harald Piringer;Christian Tominski;Philipp Muigg;Wolfgang Berger,Harald Piringer;Christian Tominski;Philipp Muigg;Wolfgang Berger,"VRVis Research Center, Vienna, Austria;Institute for Computer Science, University of Rostock, Germany;Vienna University of Technology and SimVis Gmbh, Vienna, Austria;VRVis Research Center, Vienna, Austria",10.1109/VISUAL.1999.809891;10.1109/TVCG.2006.138;10.1109/INFVIS.1997.636790;10.1109/TVCG.2006.171;10.1109/INFVIS.2004.12;10.1109/INFVIS.2002.1173156;10.1109/TVCG.2007.70540;10.1109/TVCG.2006.178;10.1109/TVCG.2006.170;10.1109/INFVIS.2004.64;10.1109/INFVIS.2000.885092;10.1109/VAST.2008.4677357,"Information visualization architecture, continuous interaction, multi-threading, layer, preview",50,36,37,
InfoVis,2009,Spatiotemporal Analysis of Sensor Logs using Growth Ring Maps,10.1109/TVCG.2009.182,http://dx.doi.org/10.1109/TVCG.2009.182,913,920,J,"Spatiotemporal analysis of sensor logs is a challenging research field due to three facts: a) traditional two-dimensional maps do not support multiple events to occur at the same spatial location, b) three-dimensional solutions introduce ambiguity and are hard to navigate, and c) map distortions to solve the overlap problem are unfamiliar to most users. This paper introduces a novel approach to represent spatial data changing over time by plotting a number of non-overlapping pixels, close to the sensor positions in a map. Thereby, we encode the amount of time that a subject spent at a particular sensor to the number of plotted pixels. Color is used in a twofold manner; while distinct colors distinguish between sensor nodes in different regions, the colors' intensity is used as an indicator to the temporal property of the subjects' activity. The resulting visualization technique, called growth ring maps, enables users to find similarities and extract patterns of interest in spatiotemporal data by using humans' perceptual abilities. We demonstrate the newly introduced technique on a dataset that shows the behavior of healthy and Alzheimer transgenic, male and female mice. We motivate the new technique by showing that the temporal analysis based on hierarchical clustering and the spatial analysis based on transition matrices only reveal limited results. Results and findings are cross-validated using multidimensional scaling. While the focus of this paper is to apply our visualization for monitoring animal behavior, the technique is also applicable for analyzing data, such as packet tracing, geographic monitoring of sales development, or mobile phone capacity planning.",Peter Bak;Florian Mansmann;Halldór Janetzko;Daniel A. Keim,Peter Bak;Florian Mansmann;Halldor Janetzko;Daniel Keim,University of Konstanz;University of Konstanz;University of Konstanz;University of Konstanz,10.1109/INFVIS.2004.27;10.1109/VISUAL.1995.485140;10.1109/INFVIS.2005.1532144;10.1109/TVCG.2006.198;10.1109/TVCG.2007.70621;10.1109/TVCG.2007.70535;10.1109/INFVIS.1999.801851;10.1109/TVCG.2006.202,"spatiotemporal visualization, visual analytics, animal behavior, dense pixel displays",50,31,26,
Vis,2009,Sampling and Visualizing Creases with Scale-Space Particles,10.1109/TVCG.2009.177,http://dx.doi.org/10.1109/TVCG.2009.177,1415,1424,J,"Particle systems have gained importance as a methodology for sampling implicit surfaces and segmented objects to improve mesh generation and shape analysis. We propose that particle systems have a significantly more general role in sampling structure from unsegmented data. We describe a particle system that computes samplings of crease features (i.e. ridges and valleys, as lines or surfaces) that effectively represent many anatomical structures in scanned medical data. Because structure naturally exists at a range of sizes relative to the image resolution, computer vision has developed the theory of scale-space, which considers an n-D image as an (n + 1)-D stack of images at different blurring levels. Our scale-space particles move through continuous four-dimensional scale-space according to spatial constraints imposed by the crease features, a particle-image energy that draws particles towards scales of maximal feature strength, and an inter-particle energy that controls sampling density in space and scale. To make scale-space practical for large three-dimensional data, we present a spline-based interpolation across scale from a small number of pre-computed blurrings at optimally selected scales. The configuration of the particle system is visualized with tensor glyphs that display information about the local Hessian of the image, and the scale of the particle. We use scale-space particles to sample the complex three-dimensional branching structure of airways in lung CT, and the major white matter structures in brain DTI.",Gordon L. Kindlmann;Raúl San José Estépar;Stephen M. Smith;Carl-Fredrik Westin,Gordon L. Kindlmann;Raúl San José Estepar;Stephen M. Smith;Carl-Fredrik Westin,"Department of Computer Science and the Computation Institute, University of Chicagoimplemented in a straight-forward manner at the level of individual;Department of Radiology, Brigham and Women’s Hospital, Harvard Medical Schoolborhood of particles and data values. Particles also enjoy the property;Centre for Functional MRI of the Brain, John Radcliffe Hospital, Oxford Universityundue influence. Our work leverages these properties while it extends;Department of Radiology, Brigham and Women’s Hospital, Harvard Medical Schoolborhood of particles and data values. Particles also enjoy the property",10.1109/TVCG.2008.154;10.1109/VISUAL.1993.398880;10.1109/TVCG.2007.70604;10.1109/TVCG.2008.148;10.1109/VISUAL.1997.663930;10.1109/TVCG.2008.167;10.1109/VISUAL.1999.809896,"Particle Systems, Crease Features, Ridge and Valley Detection, Lung CT, Diffusion Tensor MRI",50,45,72,
InfoVis,2010,eSeeTrack—Visualizing Sequential fixation Patterns,10.1109/TVCG.2010.149,http://dx.doi.org/10.1109/TVCG.2010.149,953,962,J,"We introduce eSeeTrack, an eye-tracking visualization prototype that facilitates exploration and comparison of sequential gaze orderings in a static or a dynamic scene. It extends current eye-tracking data visualizations by extracting patterns of sequential gaze orderings, displaying these patterns in a way that does not depend on the number of fixations on a scene, and enabling users to compare patterns from two or more sets of eye-gaze data. Extracting such patterns was very difficult with previous visualization techniques. eSeeTrack combines a timeline and a tree-structured visual representation to embody three aspects of eye-tracking data that users are interested in: duration, frequency and orderings of fixations. We demonstrate the usefulness of eSeeTrack via two case studies on surgical simulation and retail store chain data. We found that eSeeTrack allows ordering of fixations to be rapidly queried, explored and compared. Furthermore, our tool provides an effective and efficient mechanism to determine pattern outliers. This approach can be effective for behavior analysis in a variety of domains that are described at the end of this paper.",Hoi Ying Tsang;Melanie Tory;Colin Swindells,Hoi Ying Tsang;Melanie Tory;Colin Swindells,"University of Victoria;University of Victoria;University of Victoria, Locarna Systems",10.1109/TVCG.2009.117;10.1109/TVCG.2009.181;10.1109/TVCG.2008.172,,50,36,33,
Vis,2011,About the Influence of Illumination Models on Image Comprehension in Direct Volume Rendering,10.1109/TVCG.2011.161,http://dx.doi.org/10.1109/TVCG.2011.161,1922,1931,J,"In this paper, we present a user study in which we have investigated the influence of seven state-of-the-art volumetric illumination models on the spatial perception of volume rendered images. Within the study, we have compared gradient-based shading with half angle slicing, directional occlusion shading, multidirectional occlusion shading, shadow volume propagation, spherical harmonic lighting as well as dynamic ambient occlusion. To evaluate these models, users had to solve three tasks relying on correct depth as well as size perception. Our motivation for these three tasks was to find relations between the used illumination model, user accuracy and the elapsed time. In an additional task, users had to subjectively judge the output of the tested models. After first reviewing the models and their features, we will introduce the individual tasks and discuss their results. We discovered statistically significant differences in the testing performance of the techniques. Based on these findings, we have analyzed the models and extracted those features which are possibly relevant for the improved spatial comprehension in a relational task. We believe that a combination of these distinctive features could pave the way for a novel illumination model, which would be optimized based on our findings.",Florian Lindemann;Timo Ropinski,Florian Lindemann;Timo Ropinski,University of Münster;University of Münster,10.1109/TVCG.2008.108;10.1109/VISUAL.2002.1183761;10.1109/TVCG.2009.172;10.1109/TVCG.2011.211;10.1109/VISUAL.2003.1250394;10.1109/VISUAL.2002.1183764,"Volumetric illumination, volume rendering, spatial comprehension",50,45,42,
VAST,2013,MotionExplorer: Exploratory Search in Human Motion Capture Data Based on Hierarchical Aggregation,10.1109/TVCG.2013.178,http://dx.doi.org/10.1109/TVCG.2013.178,2257,2266,J,"We present MotionExplorer, an exploratory search and analysis system for sequences of human motion in large motion capture data collections. This special type of multivariate time series data is relevant in many research fields including medicine, sports and animation. Key tasks in working with motion data include analysis of motion states and transitions, and synthesis of motion vectors by interpolation and combination. In the practice of research and application of human motion data, challenges exist in providing visual summaries and drill-down functionality for handling large motion data collections. We find that this domain can benefit from appropriate visual retrieval and analysis support to handle these tasks in presence of large motion data. To address this need, we developed MotionExplorer together with domain experts as an exploratory search system based on interactive aggregation and visualization of motion states as a basis for data navigation, exploration, and search. Based on an overview-first type visualization, users are able to search for interesting sub-sequences of motion based on a query-by-example metaphor, and explore search results by details on demand. We developed MotionExplorer in close collaboration with the targeted users who are researchers working on human motion synthesis and analysis, including a summative field study. Additionally, we conducted a laboratory design study to substantially improve MotionExplorer towards an intuitive, usable and robust design. MotionExplorer enables the search in human motion capture data with only a few mouse clicks. The researchers unanimously confirm that the system can efficiently support their work.",Jürgen Bernard;Nils Wilhelm;Björn Krüger;Thorsten May;Tobias Schreck;Jörn Kohlhammer,Jürgen Bernard;Nils Wilhelm;Björn Krüger;Thorsten May;Tobias Schreck;Jörn Kohlhammer,"Fraunhofer Institute for Computer Graphics Research Darmstadt;Fraunhofer Institute for Computer Graphics Research Darmstadt;Institute of Computer Science, Universität Bonn;Fraunhofer Institute for Computer Graphics Research Darmstadt;Data Analysis and Visualization Group, Universität Konstanz;Fraunhofer Institute for Computer Graphics Research Darmstadt",10.1109/VISUAL.1999.809865;10.1109/VAST.2008.4677350;10.1109/TVCG.2006.120;10.1109/TVCG.2011.181;10.1109/TVCG.2011.188,"Visual analytics, exploratory search, multivariate time series, motion capture data, data aggregation, cluster glyph",50,44,45,
InfoVis,2015,Probing Projections: Interaction Techniques for Interpreting Arrangements and Errors of Dimensionality Reductions,10.1109/TVCG.2015.2467717,http://dx.doi.org/10.1109/TVCG.2015.2467717,629,638,J,"We introduce a set of integrated interaction techniques to interpret and interrogate dimensionality-reduced data. Projection techniques generally aim to make a high-dimensional information space visible in form of a planar layout. However, the meaning of the resulting data projections can be hard to grasp. It is seldom clear why elements are placed far apart or close together and the inevitable approximation errors of any projection technique are not exposed to the viewer. Previous research on dimensionality reduction focuses on the efficient generation of data projections, interactive customisation of the model, and comparison of different projection techniques. There has been only little research on how the visualization resulting from data projection is interacted with. We contribute the concept of probing as an integrated approach to interpreting the meaning and quality of visualizations and propose a set of interactive methods to examine dimensionality-reduced data as well as the projection itself. The methods let viewers see approximation errors, question the positioning of elements, compare them to each other, and visualize the influence of data dimensions on the projection space. We created a web-based system implementing these methods, and report on findings from an evaluation with data analysts using the prototype to examine multidimensional datasets.",Julian Stahnke;Marian Dörk;Boris Müller;Andreas Thom 0002,Julian Stahnke;Marian Dörk;Boris Müller;Andreas Thom,Potsdam University of Applied Sciences;Potsdam University of Applied Sciences;Potsdam University of Applied Sciences;Potsdam University of Applied Sciences,10.1109/TVCG.2013.157;10.1109/TVCG.2011.255;10.1109/VAST.2010.5652392;10.1109/VISUAL.1990.146402;10.1109/TVCG.2009.153;10.1109/TVCG.2012.279;10.1109/TVCG.2014.2346419;10.1109/TVCG.2013.153;10.1109/TVCG.2009.127;10.1109/VISUAL.1994.346302;10.1109/TVCG.2007.70589;10.1109/INFVIS.2004.60;10.1109/INFVIS.1995.528686,"Information visualization, interactivity, dimensionality reduction, multidimensional scaling",50,36,31,
Vis,1992,A 3-D streamline tracking algorithm using dual stream functions,10.1109/VISUAL.1992.235225,http://dx.doi.org/10.1109/VISUAL.1992.235225,62,68,C,"A methodology has been developed for constructing streamlines and particle paths in numerically generated fluid velocity fields. A graphical technique is used to convert the discretely defined flow within a cell into one represented by two three-dimensional stream functions. Streamlines are calculated by tracking constant values of each stream function, a process which corresponds to finding the intersection of two stream surfaces. The tracking process is mass conservative and does not use a time stepping method for integration, thus eliminating a computationally intensive part of traditional tracking algorithms. The method can be applied generally to any three-dimensional compressible or incompressible steady flow. Results presented compare the performance of the new method to the most commonly used scheme and show that calculation times can be reduced by an order of magnitude.&lt;&lt;ETX&gt;&gt;",David N. Kenwright;Gordon D. Mallison,D.N. Kenwright;G.D. Mallinson,"Dept. of Mech. Eng., Auckland Univ., New Zealand;Dept. of Mech. Eng., Auckland Univ., New Zealand",,,49,22,14,
Vis,1995,Unsteady flow volumes,10.1109/VISUAL.1995.485146,http://dx.doi.org/10.1109/VISUAL.1995.485146,329,"335, 469",C,"Flow volumes are extended for use in unsteady (time-dependent) flows. The resulting unsteady flow volumes are the 3D analogs of streaklines. There are few examples where methods other than particle tracing have been used to visualize time-varying flows. Since particle paths can become convoluted in time, there are additional considerations to be made when extending any visualization technique to unsteady flows. We present some solutions to the problems which occur in subdivision, rendering and system design. We apply the unsteady flow volumes to a variety of field types, including moving multi-zoned curvilinear grids.",Barry G. Becker;Nelson L. Max;David A. Lane,B.G. Becker;D.A. Lane;N.L. Max,"Lawrence Livermore Nat. Lab., CA, USA",10.1109/VISUAL.1992.235226;10.1109/VISUAL.1992.235227;10.1109/VISUAL.1994.346311;10.1109/VISUAL.1993.398876;10.1109/VISUAL.1993.398875;10.1109/VISUAL.1993.398846;10.1109/VISUAL.1992.235211;10.1109/VISUAL.1993.398877,,49,13,14,
InfoVis,1997,Domesticating Bead: adapting an information visualization system to a financial institution,10.1109/INFVIS.1997.636789,http://dx.doi.org/10.1109/INFVIS.1997.636789,73,80,C,"The Bead visualization system employs a fast algorithm for laying out high-dimensional data in a low-dimensional space, and a number of features added to 3D visualizations to improve imageability. We describe recent work on both aspects of the system, in particular a generalization of the data types laid out and the implementation of imageability features in a 2D visualization tool. The variety of data analyzed in a financial institution such as UBS, and the ubiquity of spreadsheets as a medium for analysis, led us to extend our layout tools to handle data in a generic spreadsheet format. We describe the metrics of similarity used for this data type, and give examples of layouts of sets of records of financial trades. Conservatism and scepticism with regard to 3D visualization, along with the lack of functionality of widely available 3D web browsers, led to the development of a 2D visualization tool with refinements of a number of our imageability features.",Dominique Brodbeck;Matthew Chalmers;Aran Lunzer;Pamela Cotture,D. Brodbeck;M. Chalmers;A. Lunzer;P. Cotture,"Ubilab, UBS, Zurich, Switzerland",10.1109/VISUAL.1990.146402;10.1109/INFVIS.1995.528686;10.1109/VISUAL.1996.568118;10.1109/INFVIS.1995.528688;10.1109/VISUAL.1994.346302;10.1109/VISUAL.1991.175794;10.1109/VISUAL.1996.567787,,49,17,23,
Vis,1997,Smooth hierarchical surface triangulations,10.1109/VISUAL.1997.663906,http://dx.doi.org/10.1109/VISUAL.1997.663906,379,386,C,"Presents a new method to produce a hierarchical set of triangle meshes that can be used to blend different levels of detail in a smooth fashion. The algorithm produces a sequence of meshes /spl Mscr//sub 0/, /spl Mscr//sub 1/, /spl Mscr//sub 2/..., /spl Mscr//sub n/, where each mesh /spl Mscr//sub i/ can be transformed to mesh /spl Mscr//sub i+1/ through a set of triangle-collapse operations. For each triangle, a function is generated that approximates the underlying surface in the area of the triangle, and this function serves as a basis for assigning a weight to the triangle in the ordering operation, and for supplying the point to which the triangles are collapsed. This technique allows us to view a triangulated surface model at varying levels of detail while insuring that the simplified mesh approximates the original surface well.",Tran S. Gieng;Bernd Hamann;Kenneth I. Joy;Gregory L. Schussman;Issac J. Trotts,T.S. Gieng;B. Hamann;K.I. Joy;G.L. Schussman;I.J. Trotts,"Center for Image Process. & Integrated Comput., California Univ., Davis, CA, USA",10.1109/VISUAL.1996.568126;10.1109/VISUAL.1996.568124,"mesh simplification, triangle meshes,level-of-detail representation, shape approximation",49,26,16,
Vis,1998,The Gridfit algorithm: an efficient and effective approach to visualizing large amounts of spatial data,10.1109/VISUAL.1998.745301,http://dx.doi.org/10.1109/VISUAL.1998.745301,181,188,C,"In a large number of applications, data is collected and referenced by their spatial locations. Visualizing large amounts of spatially referenced data on a limited-size screen display often results in poor visualizations due to the high degree of overplotting of neighboring datapoints. We introduce a new approach to visualizing large amounts of spatially referenced data. The basic idea is to intelligently use the unoccupied pixels of the display instead of overplotting data points. After formally describing the problem, we present two solutions which are based on: placing overlapping data points on the nearest unoccupied pixel; and shifting data points along a screen-filling curve (e.g., Hilbert-curve). We then develop a more sophisticated approach called Gridfit, which is based on a hierarchical partitioning of the data space. We evaluate all three approaches with respect to their efficiency and effectiveness and show the superiority of the Gridfit approach. For measuring the effectiveness, we not only present the resulting visualizations but also introduce mathematical effectiveness criteria measuring properties of the generated visualizations with respect to the original data such as distance- and position-preservation.",Daniel A. Keim;Annemarie Herrmann,D.A. Keim;A. Herrmann,"Inst. of Comput. Sci., Halle-Wittenberg Univ., Halle, Germany",10.1109/VISUAL.1995.485139;10.1109/INFVIS.1995.528688;10.1109/VISUAL.1991.175794;10.1109/VISUAL.1990.146387;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1993.398870;10.1109/VISUAL.1995.485140;10.1109/VISUAL.1994.346302;10.1109/INFVIS.1995.528690;10.1109/VISUAL.1990.146386,"visualizing large data sets, visualizing spatially referenced data, visualizing geographical data, interfaces to databases",49,22,34,
Vis,2000,Topology preserving compression of 2D vector fields,10.1109/VISUAL.2000.885714,http://dx.doi.org/10.1109/VISUAL.2000.885714,343,350,C,"We present an algorithm for compressing 2D vector fields that preserves topology. Our approach is to simplify the given data set using constrained clustering. We employ different types of global and local error metrics including the earth mover's distance metric to measure the degradation in topology as well as weighted magnitude and angular errors. As a result, we obtain precise error bounds in the compressed vector fields. Experiments with both analytic and simulated data sets are presented. Results indicate that one can obtain significant compression with low errors without losing topology information.",Suresh K. Lodha;Jose C. Renteria;Krishna M. Roskin,S.K. Lodha;J.C. Renteria;K.M. Roskin,"Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA",10.1109/VISUAL.1999.809865;10.1109/VISUAL.1998.745291;10.1109/VISUAL.1999.809907;10.1109/VISUAL.1998.745297;10.1109/VISUAL.1999.809863;10.1109/VISUAL.1999.809897;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1997.663858;10.1109/VISUAL.1998.745284,"compression, topology, vector fields, error metrics,clustering",49,24,15,
Vis,2002,Exploring scalar fields using critical isovalues,10.1109/VISUAL.2002.1183772,http://dx.doi.org/10.1109/VISUAL.2002.1183772,171,178,C,"Isosurfaces are commonly used to visualize scalar fields. Critical isovalues indicate isosurface topology changes: the creation of new surface components, merging of surface components or the formation of holes in a surface component. Therefore, they highlight interesting isosurface behavior and are helpful in exploration of large trivariate data sets. We present a method that detects critical isovalues in a scalar field defined by piecewise trilinear interpolation over a rectilinear grid and describe how to use them when examining volume data. We further review varieties of the marching cubes (MC) algorithm, with the intention of preserving topology of the trilinear interpolant when extracting an isosurface. We combine and extend two approaches in such a way that it is possible to extract meaningful isosurfaces even when a critical value is chosen as the isovalue.",Gunther H. Weber;Gerik Scheuermann;Hans Hagen;Bernd Hamann,G.H. Weber;G. Scheuermann;H. Hagen;B. Hamann,"AG Graphische Datenverarbeitung und Computergeometrie, Kaiserslautern Univ., Germany;AG Graphische Datenverarbeitung und Computergeometrie, Kaiserslautern Univ., Germany;AG Graphische Datenverarbeitung und Computergeometrie, Kaiserslautern Univ., Germany",10.1109/VISUAL.1990.146401;10.1109/VISUAL.1997.663875;10.1109/VISUAL.1998.745284;10.1109/VISUAL.1999.809932;10.1109/VISUAL.1991.175782;10.1109/VISUAL.2000.885703;10.1109/VISUAL.2000.885705,"scalar field topology, critical point, volume visualization, data exploration, isosurfaces, marching cubes",49,17,25,
Vis,2002,A new object-order ray-casting algorithm,10.1109/VISUAL.2002.1183776,http://dx.doi.org/10.1109/VISUAL.2002.1183776,203,210,C,"Many direct volume rendering algorithms have been proposed during the last decade to render 256/sup 3/ voxels interactively. However a lot of limitations are inherent to all of them, like low-quality images, a small viewport size or a fixed classification. In contrast, interactive high quality algorithms are still a challenge nowadays. We introduce here an efficient and accurate technique called object-order ray-casting that can achieve up to 10 fps on current workstations. Like usual ray-casting, colors and opacities are evenly sampled along the ray, but now within a new object-order algorithm. Thus, it allows to combine the main advantages of both worlds in term of speed and quality. We also describe an efficient hidden volume removal technique to compensate for the loss of early ray termination.",Benjamin Mora;Jean-Pierre Jessel;René Caubet,B. Mora;J.-P. Jessel;R. Caubet,"Inst. de Recherche en Informatique de Toulouse (IRIT), Univ. Paul Sabatier, Toulouse, France;Inst. de Recherche en Informatique de Toulouse (IRIT), Univ. Paul Sabatier, Toulouse, France;Inst. de Recherche en Informatique de Toulouse (IRIT), Univ. Paul Sabatier, Toulouse, France",10.1109/VISUAL.2001.964498;10.1109/VISUAL.2001.964521;10.1109/VISUAL.1999.809889;10.1109/VISUAL.1998.745309;10.1109/VISUAL.2000.885698;10.1109/VISUAL.1999.809911;10.1109/VISUAL.1999.809909;10.1109/VISUAL.1994.346331;10.1109/VISUAL.1995.480792,"Volume Rendering, Scientific Visualization, Medical Imaging, Ray Tracing",49,20,37,
Vis,2002,Efficient compression and rendering of multi-resolution meshes,10.1109/VISUAL.2002.1183794,http://dx.doi.org/10.1109/VISUAL.2002.1183794,347,354,C,"We present a method to code the multiresolution structure of a 3D triangle mesh in a manner that allows progressive decoding and efficient rendering at a client machine. The code is based on a special ordering of the mesh vertices which has good locality and continuity properties, inducing a natural multiresolution structure. This ordering also incorporates information allowing efficient rendering of the mesh at all resolutions using the contemporary vertex buffer mechanism. The performance of our code is shown to be competitive with existing progressive mesh compression methods, while achieving superior rendering speed.",Zachi Karni;Alexander Bogomjakov;Craig Gotsman,Z. Karni;A. Bogomjakov;C. Gotsman,"Fac. of Comput. Sci., Technion - Israel Inst. of Technol., Haifa, Israel",10.1109/VIS.1999.10000;10.1109/VISUAL.2000.885711;10.1109/VISUAL.1999.809902,"progressive compression, wavelets, geometry coding, rendering",49,22,26,
Vis,2003,Piecewise C¹ continuous surface reconstruction of noisy point clouds via local implicit quadric regression,10.1109/VISUAL.2003.1250359,http://dx.doi.org/10.1109/VISUAL.2003.1250359,91,98,C,"This paper addresses the problem of surface reconstruction of highly noisy point clouds. The surfaces to be reconstructed are assumed to be 2-manifolds of piecewise C/sup 1/ continuity, with isolated small irregular regions of high curvature, sophisticated local topology or abrupt burst of noise. At each sample point, a quadric field is locally fitted via a modified moving least squares method. These locally fitted quadric fields are then blended together to produce a pseudo-signed distance field using Shepard's method. We introduce a prioritized front growing scheme in the process of local quadrics fitting. Flatter surface areas tend to grow faster. The already fitted regions will subsequently guide the fitting of those irregular regions in their neighborhood.",Hui Xie 0001;Jianning Wang;Jing Hua;Hong Qin;Arie E. Kaufman,Hui Xie;Jianning Wang;Jing Hua;Hong Qin;A. Kaufman,"Dept. of Comput. Sci., Stony Brook univrsity, NY, USA;Dept. of Comput. Sci., Stony Brook univrsity, NY, USA;Dept. of Comput. Sci., Stony Brook univrsity, NY, USA;Dept. of Comput. Sci., Stony Brook univrsity, NY, USA;Dept. of Comput. Sci., Stony Brook univrsity, NY, USA",10.1109/VISUAL.2001.964489,"Computer Graphics, Surface Reconstruction, Point Cloud, Surface Representation, Solid Modeling, Moving Least Squares, Shepard's Method",49,15,21,
Vis,2003,Volume tracking using higher dimensional isosurfacing,10.1109/VISUAL.2003.1250374,http://dx.doi.org/10.1109/VISUAL.2003.1250374,209,216,C,"Tracking and visualizing local features from a time-varying volumetric data allows the user to focus on selected regions of interest, both in space and time, which can lead to a better understanding of the underlying dynamics. In this paper, we present an efficient algorithm to track time-varying isosurfaces and interval volumes using isosurfacing in higher dimensions. Instead of extracting the data features such as isosurfaces or interval volumes separately from multiple time steps and computing the spatial correspondence between those features, our algorithm extracts the correspondence directly from the higher dimensional geometry and thus can more efficiently follow the user selected local features in time. In addition, by analyzing the resulting higher dimensional geometry, it becomes easier to detect important topological events and the corresponding critical time steps for the selected features. With our algorithm, the user can interact with the underlying time-varying data more easily. The computation cost for performing time-varying volume tracking is also minimized.",Guangfeng Ji;Han-Wei Shen;Rephael Wenger,Guangfeng Ji;Han-Wei Shen;R. Wenger,"Dept. of Comput. & Inf. Sci., Ohio State Univ., USA;Dept. of Comput. & Inf. Sci., Ohio State Univ., USA;Dept. of Comput. & Inf. Sci., Ohio State Univ., USA",10.1109/VISUAL.2000.885704;10.1109/VISUAL.1998.745288;10.1109/VISUAL.1996.568103;10.1109/VISUAL.2002.1183774;10.1109/VISUAL.1996.567807;10.1109/VISUAL.2000.885703;10.1109/VISUAL.1995.480789;10.1109/VISUAL.1997.663886,"tracking, isosurface, interval volume, higher dimensional isosurfacing",49,17,24,
Vis,2003,Shape simplification based on the medial axis transform,10.1109/VISUAL.2003.1250410,http://dx.doi.org/10.1109/VISUAL.2003.1250410,481,488,C,"We present a new algorithm for simplifying the shape of 3D objects by manipulating their medial axis transform (MAT). From an unorganized set of boundary points, our algorithm computes the MAT, decomposes the axis into parts, then selectively removes a subset of these parts in order to reduce the complexity of the overall shape. The result is simplified MAT that can be used for a variety of shape operations. In addition, a polygonal surface of the resulting shape can be directly generated from the filtered MAT using a robust surface reconstruction method. The algorithm presented is shown to have a number of advantages over other existing approaches.",Roger C. Tam;Wolfgang Heidrich,R. Tam;W. Heidrich,"Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada;Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada",,"medial axis transform, shape simplification, topology preservation",49,19,25,
Vis,2005,Visualization of white matter tracts with wrapped streamlines,10.1109/VISUAL.2005.1532777,http://dx.doi.org/10.1109/VISUAL.2005.1532777,51,58,C,"Diffusion tensor imaging is a magnetic resonance imaging method which has gained increasing importance in neuroscience and especially in neurosurgery. It acquires diffusion properties represented by a symmetric 2nd order tensor for each voxel in the gathered dataset. From the medical point of view, the data is of special interest due lo different diffusion characteristics of varying brain tissue allowing conclusions about the underlying structures such as while matter tracts. An obvious way to visualize this data is to focus on the anisotropic areas using the major eigenvector for tractography and rendering lines for visualization of the simulation results. Our approach extends this technique to avoid line representation since lines lead 10 very complex illustrations and furthermore are mistakable. Instead, we generate surfaces wrapping bundles of lines. Thereby, a more intuitive representation of different tracts is achieved.",Frank Enders;Natascha Sauber;Dorit Merhof;Peter Hastreiter;Christopher Nimsky;Marc Stamminger,F. Enders;N. Sauber;D. Merhof;P. Hastreiter;C. Nimsky;M. Stamminger,"Dept. of Neurosurg., Erlangen-Nurnberg Univ., Erlangen, Germany",10.1109/VISUAL.2001.964524;10.1109/VISUAL.1999.809894;10.1109/VISUAL.1999.809886;10.1109/VISUAL.2001.964549;10.1109/VISUAL.2004.30;10.1109/VISUAL.2001.964519;10.1109/VISUAL.1991.175771,"Diffusion Tensor Imaging, Tractography, White Matter Tracts, Clustering",49,12,34,
Vis,2007,Interactive Visual Analysis of Perfusion Data,10.1109/TVCG.2007.70569,http://dx.doi.org/10.1109/TVCG.2007.70569,1392,1399,J,"Perfusion data are dynamic medical image data which characterize the regional blood flow in human tissue. These data bear a great potential in medical diagnosis, since diseases can be better distinguished and detected at an earlier stage compared to static image data. The wide-spread use of perfusion data is hampered by the lack of efficient evaluation methods. For each voxel, a time-intensity curve characterizes the enhancement of a contrast agent. Parameters derived from these curves characterize the perfusion and have to be integrated for diagnosis. The diagnostic evaluation of this multi-field data is challenging and time-consuming due to its complexity. For the visual analysis of such datasets, feature-based approaches allow to reduce the amount of data and direct the user to suspicious areas. We present an interactive visual analysis approach for the evaluation of perfusion data. For this purpose, we integrate statistical methods and interactive feature specification. Correlation analysis and Principal Component Analysis (PCA) are applied for dimension reduction and to achieve a better understanding of the inter-parameter relations. Multiple, linked views facilitate the definition of features by brushing multiple dimensions. The specification result is linked to all views establishing a focus+context style of visualization in 3D. We discuss our approach with respect to clinical datasets from the three major application areas: ischemic stroke diagnosis, breast tumor diagnosis, as well as the diagnosis of the coronary heart disease (CHD). It turns out that the significance of perfusion parameters strongly depends on the individual patient, scanning parameters, and data pre-processing.",Steffen Oeltze-Jafra;Helmut Doleisch;Helwig Hauser;Philipp Muigg;Bernhard Preim,Steffen Oeltze;Helmut Doleisch;Helwig Hauser;Philipp Muigg;Bernhard Preim,"Department of Simulation and Graphics, University of Magdeburg, Magdeburg, Germany;VRVis Research Center, Vienna, Austria;Department of Informatics, University of Bergen, Bergen, Norway;VRVis Research Center, Vienna, Austria;Department of Simulation and Graphics, University of Magdeburg, Magdeburg, Germany",10.1109/VISUAL.2000.885739,"Multi-field Visualization, Visual Data Mining, Time-varying Volume Data, Integrating InfoVis/SciVis",49,36,28,
Vis,2010,IRIS: Illustrative Rendering for Integral Surfaces,10.1109/TVCG.2010.173,http://dx.doi.org/10.1109/TVCG.2010.173,1319,1328,J,"Integral surfaces are ideal tools to illustrate vector fields and fluid flow structures. However, these surfaces can be visually complex and exhibit difficult geometric properties, owing to strong stretching, shearing and folding of the flow from which they are derived. Many techniques for non-photorealistic rendering have been presented previously. It is, however, unclear how these techniques can be applied to integral surfaces. In this paper, we examine how transparency and texturing techniques can be used with integral surfaces to convey both shape and directional information. We present a rendering pipeline that combines these techniques aimed at faithfully and accurately representing integral surfaces while improving visualization insight. The presented pipeline is implemented directly on the GPU, providing real-time interaction for all rendering modes, and does not require expensive preprocessing of integral surfaces after computation.",Mathias Hummel;Christoph Garth;Bernd Hamann;Hans Hagen;Kenneth I. Joy,Mathias Hummel;Christoph Garth;Bernd Hamann;Hans Hagen;Kenneth I. Joy,"University of Kaiserslautern;University of California, Davis;University of California, Davis;University of Kaiserslautern;University of California, Davis",10.1109/TVCG.2006.124;10.1109/VISUAL.2003.1250414;10.1109/TVCG.2008.133;10.1109/VISUAL.1992.235211;10.1109/TVCG.2009.190;10.1109/VISUAL.1993.398875;10.1109/VISUAL.2001.964506;10.1109/VISUAL.2000.885694;10.1109/TVCG.2008.163;10.1109/TVCG.2009.154,"Flow visualization, integral surfaces, illustrative rendering",49,32,36,
InfoVis,2011,Exploratory Analysis of Time-Series with ChronoLenses,10.1109/TVCG.2011.195,http://dx.doi.org/10.1109/TVCG.2011.195,2422,2431,J,"Visual representations of time-series are useful for tasks such as identifying trends, patterns and anomalies in the data. Many techniques have been devised to make these visual representations more scalable, enabling the simultaneous display of multiple variables, as well as the multi-scale display of time-series of very high resolution or that span long time periods. There has been comparatively little research on how to support the more elaborate tasks associated with the exploratory visual analysis of timeseries, e.g., visualizing derived values, identifying correlations, or discovering anomalies beyond obvious outliers. Such tasks typically require deriving new time-series from the original data, trying different functions and parameters in an iterative manner. We introduce a novel visualization technique called ChronoLenses, aimed at supporting users in such exploratory tasks. ChronoLenses perform on-the-fly transformation of the data points in their focus area, tightly integrating visual analysis with user actions, and enabling the progressive construction of advanced visual analysis pipelines.",Jian Zhao 0010;Fanny Chevalier;Emmanuel Pietriga;Ravin Balakrishnan,Jian Zhao;Fanny Chevalier;Emmanuel Pietriga;Ravin Balakrishnan,"University of Toronto, Canada;OCAD University, Canada;INRIA, France;University of Toronto, Canada",10.1109/TVCG.2010.162;10.1109/INFVIS.1999.801851;10.1109/VAST.2007.4389007;10.1109/INFVIS.2001.963273;10.1109/INFVIS.2005.1532148;10.1109/TVCG.2007.70583;10.1109/TVCG.2010.193,"Time-series Data, Exploratory Visualization, Focus+Context, Lens, Interaction Techniques",49,31,41,
InfoVis,2012,An Empirical Study on Using Visual Embellishments in Visualization,10.1109/TVCG.2012.197,http://dx.doi.org/10.1109/TVCG.2012.197,2759,2768,J,"In written and spoken communications, figures of speech (e.g., metaphors and synecdoche) are often used as an aid to help convey abstract or less tangible concepts. However, the benefits of using rhetorical illustrations or embellishments in visualization have so far been inconclusive. In this work, we report an empirical study to evaluate hypotheses that visual embellishments may aid memorization, visual search and concept comprehension. One major departure from related experiments in the literature is that we make use of a dual-task methodology in our experiment. This design offers an abstraction of typical situations where viewers do not have their full attention focused on visualization (e.g., in meetings and lectures). The secondary task introduces “divided attention”, and makes the effects of visual embellishments more observable. In addition, it also serves as additional masking in memory-based trials. The results of this study show that visual embellishments can help participants better remember the information depicted in visualization. On the other hand, visual embellishments can have a negative impact on the speed of visual search. The results show a complex pattern as to the benefits of visual embellishments in helping participants grasp key concepts from visualization.",Rita Borgo;Alfie Abdul-Rahman;Farhan Mohamed;Phil W. Grant;Irene Reppa;Luciano Floridi;Min Chen 0001,Rita Borgo;Alfie Abdul-Rahman;Farhan Mohamed;Philip W. Grant;Irene Reppa;Luciano Floridi;Min Chen,"Computer Science, Swansea University;Oxford e-Research Centre, Oxford University;Universiti Teknologi Malaysia;Computer Science, Swansea University;Psychology, Swansea University;Phylosophy, Oxford University;Oxford e-Research Centre, Oxford University",10.1109/TVCG.2010.132;10.1109/VISUAL.1996.568118;10.1109/TVCG.2008.171;10.1109/TVCG.2011.175,"Visual embellishments, metaphors, icons, cognition, working memory, long-term memory, visual search, evaluation",49,47,40,
VAST,2013,Interactive Exploration of Implicit and Explicit Relations in Faceted Datasets,10.1109/TVCG.2013.167,http://dx.doi.org/10.1109/TVCG.2013.167,2080,2089,J,"Many datasets, such as scientific literature collections, contain multiple heterogeneous facets which derive implicit relations, as well as explicit relational references between data items. The exploration of this data is challenging not only because of large data scales but also the complexity of resource structures and semantics. In this paper, we present PivotSlice, an interactive visualization technique which provides efficient faceted browsing as well as flexible capabilities to discover data relationships. With the metaphor of direct manipulation, PivotSlice allows the user to visually and logically construct a series of dynamic queries over the data, based on a multi-focus and multi-scale tabular view that subdivides the entire dataset into several meaningful parts with customized semantics. PivotSlice further facilitates the visual exploration and sensemaking process through features including live search and integration of online data, graphical interaction histories and smoothly animated visual state transitions. We evaluated PivotSlice through a qualitative lab study with university researchers and report the findings from our observations and interviews. We also demonstrate the effectiveness of PivotSlice using a scenario of exploring a repository of information visualization literature.",Jian Zhao 0010;Christopher Collins 0001;Fanny Chevalier;Ravin Balakrishnan,Jian Zhao;Christopher Collins;Fanny Chevalier;Ravin Balakrishnan,"University of Toronto;University of Ontario Institute of Technology;University of Toronto, Canada;University of Toronto, Canada",10.1109/TVCG.2008.137;10.1109/VAST.2011.6102440;10.1109/TVCG.2011.213;10.1109/TVCG.2010.154;10.1109/VAST.2006.261426;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2010.205;10.1109/TVCG.2012.252;10.1109/TVCG.2006.166;10.1109/INFVIS.2000.885086,"Faceted browsing, network exploration, dynamic query, interaction, information visualization, visual analytics",49,41,39,
Vis,1991,The hyperbox,10.1109/VISUAL.1991.175790,http://dx.doi.org/10.1109/VISUAL.1991.175790,133,"139, 418",C,"A hyperbox is a two-dimensional depiction of an N-dimensional box (rectangular parallelepiped). The authors define the visual syntax of hyperboxes, state some properties, and sketch two applications. Hyperboxes can be evocative visual names for tensors or multidimensional arrays in visual programming languages. They can also be used to simultaneously display all pairwise relationships in an N-dimensional dataset. This can be helpful in choosing a sequence of dimension-reducing transformations that preserve interesting properties of the dataset.&lt;&lt;ETX&gt;&gt;",Bowen Alpern;Larry Carter,B. Alpern;L. Carter,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.1990.146386;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1990.146387;10.1109/VISUAL.1990.146389,,48,22,9,
Vis,1992,Visualization of fuzzy data using generalized animation,10.1109/VISUAL.1992.235199,http://dx.doi.org/10.1109/VISUAL.1992.235199,268,273,C,"Methods are presented for the visualization of fuzzy data based on the sensitivity of the human visual system to motion and dynamic changes, and the ease of which electronic display devices can change their display. The methods include taking an otherwise static image and displaying in an animation loop either its segmented components or a series of blurred versions of the whole image. This approach was applied to sea-surface temperature data and was found to be effective in showing fuzzy details embedded in the data, and in drawing the viewer's attention. This approach and these methods could play a significant role in the display of browse products for massive data and information systems.&lt;&lt;ETX&gt;&gt;",Nahum D. Gershon,N.D. Gershon,"Mitre Corp., McLean, VA, USA",,,48,19,6,
Vis,1996,Hierarchical and parallelizable direct volume rendering for irregular and multiple grids,10.1109/VISUAL.1996.567606,http://dx.doi.org/10.1109/VISUAL.1996.567606,57,63,C,"A general volume rendering technique is described that efficiently produces images of excellent quality from data defined over irregular grids having a wide variety of formats. Rendering is done in software, eliminating the need for special graphics hardware, as well as any artifacts associated with graphics hardware. Images of volumes with about 1,000,000 cells can be produced in one to several minutes on a workstation with a 150-MHz processor. A significant advantage of this method for applications such as computational fluid dynamics is that it can process multiple intersecting grids. Such grids present problems for most current volume rendering techniques. Also, the wide range of cell sizes does not present difficulties, as it does for many techniques. A spatial hierarchical organization makes it possible to access data from a restricted region efficiently. The tree has greater depth in regions of greater detail, determined by the number of cells in the region. It also makes it possible to render useful ""preview"" images very quickly by displaying each region associated with a tree node as one cell. Previews show enough detail to navigate effectively in very large data sets. The algorithmic techniques include use of a k-d tree, with prefix-order partitioning of triangles, to reduce the number of primitives that must be processed for one rendering, coarse-grain parallelism for a shared-memory MIMD architecture, a new perspective transformation that achieves greater numerical accuracy, and a scanline algorithm with depth sorting and a new clipping technique.",Jane Wilhelms;Allen Van Gelder;Paul Tarantino;Jonathan Gibbs,J. Wilhelms;A. Van Gelder;P. Tarantino;J. Gibbs,"California Univ., Santa Cruz, CA, USA",10.1109/VISUAL.1992.235204;10.1109/VISUAL.1993.398853;10.1109/VISUAL.1995.480796;10.1109/VISUAL.1992.235228,"Computer Graphics, Scientific Visualization, Scanline, Direct Volume Rendering, Curvilinear Grid, Irregular Grid, k-D Tree",48,29,31,
Vis,1999,A multi-threaded streaming pipeline architecture for large structured data sets,10.1109/VISUAL.1999.809891,http://dx.doi.org/10.1109/VISUAL.1999.809891,225,232,C,"Computer simulation and digital measuring systems are now generating data of unprecedented size. The size of data is becoming so large that conventional visualization tools are incapable of processing it, which is in turn is impacting the effectiveness of computational tools. In this paper we describe an object-oriented architecture that addresses this problem by automatically breaking data into pieces, and then processes the data piece-by-piece within a pipeline of filters. The piece size is user specified and can be controlled to eliminate the need for swapping (i.e., relying on virtual memory). In addition, because piece size can be controlled, any size problem can be run on any size computer, at the expense of extra computational time. Furthermore pieces are automatically broken into sub-pieces and each piece assigned to a different thread for parallel processing. This paper includes numerical performance studies and references to the source code which is freely available on the Web.",C. Charles Law;Ken Martin;William J. Schroeder;Joshua Temkin,C.C. Law;W.J. Schroeder;K.M. Martin;J. Temkin,"Kitware Inc., USA",10.1109/VISUAL.1997.663895;10.1109/VISUAL.1997.663888;10.1109/VISUAL.1998.745299;10.1109/VISUAL.1998.745297;10.1109/VISUAL.1997.663910,,48,18,23,
Vis,2000,Two-level volume rendering - fusing MIP and DVR,10.1109/VISUAL.2000.885697,http://dx.doi.org/10.1109/VISUAL.2000.885697,211,218,C,"Presents a two-level approach for fusing direct volume rendering (DVR) and maximum-intensity projection (MIP) within a joint rendering method. Different structures within the data set are rendered locally by either MIP or DVR on an object-by-object basis. Globally, all the results of subsequent object renderings are combined in a merging step (usually compositing in our case). This allows us to selectively choose the most suitable technique for depicting each object within the data, while keeping the amount of information contained in the image at a reasonable level. This is especially useful when inner structures should be visualized together with semi-transparent outer parts, similar to the focus-and-context approach known from information visualization. We also present an implementation of our approach which allows us to explore volumetric data using two-level rendering at interactive frame rates.",Helwig Hauser;Lukas Mroz;Gian Italo Bischi;M. Eduard Gröller,H. Hauser;L. Mroz;G.-I. Bischi;M.E. Groller,"VRVis Res. Centre, Wien Univ. of Technol., Austria",10.1109/VISUAL.1998.745311;10.1109/VISUAL.1999.809887;10.1109/VISUAL.1996.568113,"visualization, volume rendering, dynamical systems,medical applications",48,13,20,
InfoVis,2001,Pixel bar charts: a new technique for visualizing large multi-attribute data sets without aggregation,10.1109/INFVIS.2001.963288,http://dx.doi.org/10.1109/INFVIS.2001.963288,113,120,C,,Daniel A. Keim;Ming C. Hao;Julian Ladisch;Meichun Hsu;Umeshwar Dayal,D. Keim;M.C. Hao;J. Ladisch;Meichun Hsu;U. Dayal,Hewlett Packard Research Laboratories,10.1109/VISUAL.1995.485140;10.1109/VISUAL.1993.398870;10.1109/INFVIS.1999.801867;10.1109/VISUAL.1991.175794;10.1109/VISUAL.1990.146387;10.1109/VISUAL.1990.146402;10.1109/INFVIS.1995.528690;10.1109/VISUAL.1990.146386,,48,19,19,
InfoVis,2004,"Major Information Visualization Authors, Papers and Topics in the ACM Library",10.1109/INFVIS.2004.45,http://dx.doi.org/10.1109/INFVIS.2004.45,r1,r1,M,"The presented work aims to identify major research topics, co-authorships, and trends in the IV Contest 2004 dataset. Co-author, paper-citation, and burst analysis were used to analyze the dataset. The results are visually presented as graphs, static Pajek [1] visualizations and interactive network layouts using Pajek&amp;#146;s SVG output feature. A complementary web page with all the raw data, details of the analyses, and high resolution images of all figures is available online at http://iv.slis.indiana.edu/ref/iv04contest/.",Weimao Ke;Katy Börner;Lalitha Viswanath,Weimao Ke;K. Borner;L. Viswanath,Indiana University,,,48,5,3,
Vis,2004,Augmented reality with tangible auto-fabricated models for molecular biology applications,10.1109/VISUAL.2004.7,http://dx.doi.org/10.1109/VISUAL.2004.7,235,241,C,"The evolving technology of computer auto-fabrication (""3D printing"") now makes it possible to produce physical models for complex biological molecules and assemblies. We report on an application that demonstrates the use of auto-fabricated tangible models and augmented reality for research and education in molecular biology, and for enhancing the scientific environment for collaboration and exploration. We have adapted an augmented reality system to allow virtual 3D representations (generated by the Python Molecular Viewer) to be overlaid onto a tangible molecular model. Users can easily change the overlaid information, switching between different representations of the molecule, displays of molecular properties such as electrostatics, or dynamic information. The physical model provides a powerful, intuitive interface for manipulating the computer models, streamlining the interface between human intent, the physical model, and the computational activity.",Alexandre Gillet;Michel F. Sanner;Daniel Stoffler;David S. Goodsell;Arthur J. Olson,A. Gillet;M. Sanner;D. Stoffler;D. Goodsell;A. Olson,,,"Molecular Modeling, Molecular Visualization, Augmented Reality",48,30,15,
InfoVis,2005,The visual code navigator: an interactive toolset for source code investigation,10.1109/INFVIS.2005.1532125,http://dx.doi.org/10.1109/INFVIS.2005.1532125,24,31,C,"We present the Visual Code Navigator, a set of three interrelated visual tools that we developed for exploring large source code software projects from three different perspectives, or views: the syntactic view shows the syntactic constructs in the source code. The symbol view shows the objects a file makes available after compilation, such as function signatures, variables, and namespaces. The evolution view looks at different versions in a project lifetime of a number of selected source files. The views share one code model, which combines hierarchical syntax based and line based information from multiple source files versions. We render this code model using a visual model that extends the pixel-filling, space partitioning properties of shaded cushion treemaps with novel techniques. We discuss how our views allow users to interactively answer complex questions on various code elements by simple mouse clicks. We validate the efficiency and effectiveness of our toolset by an informal user study on the source code of VTK, a large, industry-size C++ code base",Gerard Lommerse;Freek Nossin;Lucian Voinea;Alexandru Telea,G. Lommerse;F. Nossin;L. Voinea;A. Telea,,10.1109/INFVIS.1999.801860;10.1109/VISUAL.2001.964495,"source code visualization, multiple views, treemaps, pixel-filling displays, source code analysis",48,10,27,
Vis,2005,Phonon tracing for auralization and visualization of sound,10.1109/VISUAL.2005.1532790,http://dx.doi.org/10.1109/VISUAL.2005.1532790,151,158,C,"We present a new particle tracing approach for the simulation of mid- and high-frequency sound. Inspired by the photorealism obtained by methods like photon mapping, we develop a similar method for the physical simulation of sound within rooms. For given source and listener positions, our method computes a finite-response filter accounting for the different reflections at various surfaces with frequency-dependent absorption coefficients. Convoluting this filter with an anechoic input signal reproduces a realistic aural impression of the simulated room. We do not consider diffraction effects due to low frequencies, since these can be better computed by finite elements. Our method allows the visualization of a wave front propagation using color-coded blobs traversing the paths of individual phonons.",Martin Hering-Bertram;Eduard Deines;Jan Mohring;Jevgenijs Jegorovs;Hans Hagen,M. Bertram;E. Deines;J. Mohring;J. Jegorovs;H. Hagen,"TU Kaiserslautern, Germany;TU Kaiserslautern, Germany",," acoustics, auralization, raytracing, photon mapping",48,11,21,
Vis,2005,Visualization with stylized line primitives,10.1109/VISUAL.2005.1532859,http://dx.doi.org/10.1109/VISUAL.2005.1532859,695,702,C,"Line primitives are a very powerful visual attribute used for scientific visualization and in particular for 3D vector-field visualization. We extend the basic line primitives with additional visual attributes including color, line width, texture and orientation. To implement the visual attributes we represent the stylized line primitives as generalized cylinders. One important contribution of our work is an efficient rendering algorithm for stylized lines, which is hybrid in the sense that it uses both CPU and GPU based rendering. We improve the depth perception with a shadow algorithm. We present several applications for the visualization with stylized lines among which are the visualizations of 3D vector fields and molecular structures.",Carsten Stoll;Stefan Gumhold;Hans-Peter Seidel,C. Stoll;S. Gumhold;H.-P. Seidel,"Max-Planck-Inst. fur Inf., Saarbrucken, Germany;Max-Planck-Inst. fur Inf., Saarbrucken, Germany;Max-Planck-Inst. fur Inf., Saarbrucken, Germany",10.1109/VISUAL.2004.5;10.1109/VISUAL.1996.567777;10.1109/VISUAL.1998.745317," rendering, vector fields, streamlines",48,24,16,
Vis,2006,Asynchronous Distributed Calibration for Scalable and Reconfigurable Multi-Projector Displays,10.1109/TVCG.2006.121,http://dx.doi.org/10.1109/TVCG.2006.121,1101,1108,J,"Centralized techniques have been used until now when automatically calibrating (both geometrically and photometrically) large high-resolution displays created by tiling multiple projectors in a 2D array. A centralized server managed all the projectors and also the camera(s) used to calibrate the display. In this paper, we propose an asynchronous distributed calibration methodology via a display unit called the plug-and-play projector (PPP). The PPP consists of a projector, camera, computation and communication unit, thus creating a self-sufficient module that enables an asynchronous distributed architecture for multi-projector displays. We present a single-program-multiple-data (SPMD) calibration algorithm that runs on each PPP and achieves a truly scalable and reconfigurable display without any input from the user. It instruments novel capabilities like adding/removing PPPs from the display dynamically, detecting faults, and reshaping the display to a reasonable rectangular shape to react to the addition/removal/faults. To the best of our knowledge, this is the first attempt to realize a completely asynchronous and distributed calibration architecture and methodology for multi-projector displays",Ezekiel S. Bhasker;Pinaki Sinha;Aditi Majumder,Ezekiel S. Bhasker;Pinaki Sinha;Aditi Majumder,"Department of Computer Science, University of California, Irvine;Department of Computer Science, University of California, Irvine;Department of Computer Science, University of California, Irvine",10.1109/VISUAL.2002.1183793;10.1109/VISUAL.2000.885685;10.1109/VISUAL.2000.885684;10.1109/VISUAL.1999.809883;10.1109/VISUAL.2001.964508,"Multi-projector displays, projector-camera systems, geometric and color calibration, distributed algorithms",48,35,29,
InfoVis,2008,Improving the Readability of Clustered Social Networks using Node Duplication,10.1109/TVCG.2008.141,http://dx.doi.org/10.1109/TVCG.2008.141,1317,1324,J,"Exploring communities is an important task in social network analysis. Such communities are currently identified using clustering methods to group actors. This approach often leads to actors belonging to one and only one cluster, whereas in real life a person can belong to several communities. As a solution we propose duplicating actors in social networks and discuss potential impact of such a move. Several visual duplication designs are discussed and a controlled experiment comparing network visualization with and without duplication is performed, using 6 tasks that are important for graph readability and visual interpretation of social networks. We show that in our experiment, duplications significantly improve community-related tasks but sometimes interfere with other graph readability tasks. Finally, we propose a set of guidelines for deciding when to duplicate actors and choosing candidates for duplication, and alternative ways to render them in social network representations.",Nathalie Henry Riche;Anastasia Bezerianos;Jean-Daniel Fekete,Nathalie y Henr;Anastasia Bezerianos;Jean-Daniel Fekete,INRIA-LRI and Univ. of Sydney;NICTA;INRIA,10.1109/TVCG.2007.70582;10.1109/TVCG.2006.160;10.1109/VAST.2006.261426;10.1109/TVCG.2006.120;10.1109/INFVIS.1997.636792;10.1109/TVCG.2006.147;10.1109/INFVIS.2003.1249011,"Clustering, Graph Visualization, Node Duplications, Social Networks",48,36,32,
InfoVis,2009,ABySS-Explorer: Visualizing Genome Sequence Assemblies,10.1109/TVCG.2009.116,http://dx.doi.org/10.1109/TVCG.2009.116,881,888,J,"One bottleneck in large-scale genome sequencing projects is reconstructing the full genome sequence from the short subsequences produced by current technologies. The final stages of the genome assembly process inevitably require manual inspection of data inconsistencies and could be greatly aided by visualization. This paper presents our design decisions in translating key data features identified through discussions with analysts into a concise visual encoding. Current visualization tools in this domain focus on local sequence errors making high-level inspection of the assembly difficult if not impossible. We present a novel interactive graph display, ABySS-Explorer, that emphasizes the global assembly structure while also integrating salient data features such as sequence length. Our tool replaces manual and in some cases pen-and-paper based analysis tasks, and we discuss how user feedback was incorporated into iterative design refinements. Finally, we touch on applications of this representation not initially considered in our design phase, suggesting the generality of this encoding for DNA sequence data.",Cydney B. Nielsen;Shaun D. Jackman;Inanç Birol;Steven J. M. Jones,Cydney B. Nielsen;Shaun D. Jackman;Inanç Birol;Steven J.M. Jones,"BC Cancer Agency, Genome Sciences Centre;BC Cancer Agency, Genome Sciences Centre;BC Cancer Agency, Genome Sciences Centre;BC Cancer Agency, Genome Sciences Centre",10.1109/TVCG.2006.147,"Bioinformatics visualization, design study, DNA sequence, genome assembly",48,38,25,BP
InfoVis,2009,The Benefits of Synchronous Collaborative Information Visualization: Evidence from an Experimental Evaluation,10.1109/TVCG.2009.188,http://dx.doi.org/10.1109/TVCG.2009.188,1073,1080,J,"A great corpus of studies reports empirical evidence of how information visualization supports comprehension and analysis of data. The benefits of visualization for synchronous group knowledge work, however, have not been addressed extensively. Anecdotal evidence and use cases illustrate the benefits of synchronous collaborative information visualization, but very few empirical studies have rigorously examined the impact of visualization on group knowledge work. We have consequently designed and conducted an experiment in which we have analyzed the impact of visualization on knowledge sharing in situated work groups. Our experimental study consists of evaluating the performance of 131 subjects (all experienced managers) in groups of 5 (for a total of 26 groups), working together on a real-life knowledge sharing task. We compare (1) the control condition (no visualization provided), with two visualization supports: (2) optimal and (3) suboptimal visualization (based on a previous survey). The facilitator of each group was asked to populate the provided interactive visual template with insights from the group, and to organize the contributions according to the group consensus. We have evaluated the results through both objective and subjective measures. Our statistical analysis clearly shows that interactive visualization has a statistically significant, objective and positive impact on the outcomes of knowledge sharing, but that the subjects seem not to be aware of this. In particular, groups supported by visualization achieved higher productivity, higher quality of outcome and greater knowledge gains. No statistically significant results could be found between an optimal and a suboptimal visualization though (as classified by the pre-experiment survey). Subjects also did not seem to be aware of the benefits that the visualizations provided as no difference between the visualization and the control conditions was found for the self-reported measures of satisfaction and participation. An implication of our study for information visualization applications is to extend them by using real-time group annotation functionalities that aid in the group sense making process of the represented data.",Sabrina Bresciani;Martin J. Eppler,Sabrina Bresciani;Martin J. Eppler,University of Lugano (USI);University of St. Gallen (HSG),10.1109/VAST.2008.4677358;10.1109/TVCG.2007.70568;10.1109/TVCG.2008.125;10.1109/TVCG.2008.129,"Laboratory Studies, Visual Knowledge Representation, Collaborative and Distributed Visualization, synchronous situated collaboration, group work, experiment, knowledge sharing",48,32,49,
InfoVis,2011,MoleView: An Attribute and Structure-Based Semantic Lens for Large Element-Based Plots,10.1109/TVCG.2011.223,http://dx.doi.org/10.1109/TVCG.2011.223,2600,2609,J,"We present MoleView, a novel technique for interactive exploration of multivariate relational data. Given a spatial embedding of the data, in terms of a scatter plot or graph layout, we propose a semantic lens which selects a specific spatial and attribute-related data range. The lens keeps the selected data in focus unchanged and continuously deforms the data out of the selection range in order to maintain the context around the focus. Specific deformations include distance-based repulsion of scatter plot points, deforming straight-line node-link graph drawings, and as varying the simplification degree of bundled edge graph layouts. Using a brushing-based technique, we further show the applicability of our semantic lens for scenarios requiring a complex selection of the zones of interest. Our technique is simple to implement and provides real-time performance on large datasets. We demonstrate our technique with actual data from air and road traffic control, medical imaging, and software comprehension applications.",Christophe Hurter;Alexandru Telea;Ozan Ersoy,Christophe Hurter;Alexandru Telea;Ozan Ersoy,"DSNA, IRIT, Toulouse France;University of Groningen;University of Groningen",10.1109/TVCG.2011.233;10.1109/TVCG.2008.135;10.1109/TVCG.2006.147;10.1109/INFVIS.2005.1532150;10.1109/INFVIS.2004.66;10.1109/INFVIS.2003.1249008,"Semantic lenses, magic lenses, graph bundling, attribute filtering",48,38,35,
VAST,2011,Guiding feature subset selection with an interactive visualization,10.1109/VAST.2011.6102448,http://dx.doi.org/10.1109/VAST.2011.6102448,111,120,C,"We propose a method for the semi-automated refinement of the results of feature subset selection algorithms. Feature subset selection is a preliminary step in data analysis which identifies the most useful subset of features (columns) in a data table. So-called filter techniques use statistical ranking measures for the correlation of features. Usually a measure is applied to all entities (rows) of a data table. However, the differing contributions of subsets of data entities are masked by statistical aggregation. Feature and entity subset selection are, thus, highly interdependent. Due to the difficulty in visualizing a high-dimensional data table, most feature subset selection algorithms are applied as a black box at the outset of an analysis. Our visualization technique, SmartStripes, allows users to step into the feature subset selection process. It enables the investigation of dependencies and interdependencies between different feature and entity subsets. A user may even choose to control the iterations manually, taking into account the ranking measures, the contributions of different entity subsets, as well as the semantics of the features.",Thorsten May;Andreas Bannach;James Davey;Tobias Ruppert;Jörn Kohlhammer,Thorsten May;Andreas Bannach;James Davey;Tobias Ruppert;Jörn Kohlhammer,"Fraunhofer Institute for Computer Graphics Research, Darmstadt, Germany;Fraunhofer Institute for Computer Graphics Research, Darmstadt, Germany;Fraunhofer Institute for Computer Graphics Research, Darmstadt, Germany;Fraunhofer Institute for Computer Graphics Research, Darmstadt, Germany;Fraunhofer Institute for Computer Graphics Research, Darmstadt, Germany",10.1109/VAST.2010.5652392;10.1109/INFVIS.2003.1249006;10.1109/TVCG.2009.153;10.1109/TVCG.2008.153,,48,32,23,
InfoVis,2012,RankExplorer: Visualization of Ranking Changes in Large Time Series Data,10.1109/TVCG.2012.253,http://dx.doi.org/10.1109/TVCG.2012.253,2669,2678,J,"For many applications involving time series data, people are often interested in the changes of item values over time as well as their ranking changes. For example, people search many words via search engines like Google and Bing every day. Analysts are interested in both the absolute searching number for each word as well as their relative rankings. Both sets of statistics may change over time. For very large time series data with thousands of items, how to visually present ranking changes is an interesting challenge. In this paper, we propose RankExplorer, a novel visualization method based on ThemeRiver to reveal the ranking changes. Our method consists of four major components: 1) a segmentation method which partitions a large set of time series curves into a manageable number of ranking categories; 2) an extended ThemeRiver view with embedded color bars and changing glyphs to show the evolution of aggregation values related to each ranking category over time as well as the content changes in each ranking category; 3) a trend curve to show the degree of ranking changes over time; 4) rich user interactions to support interactive exploration of ranking changes. We have applied our method to some real time series data and the case studies demonstrate that our method can reveal the underlying patterns related to ranking changes which might otherwise be obscured in traditional visualizations.",Conglei Shi;Weiwei Cui;Shixia Liu;Panpan Xu;Wei Chen 0001;Huamin Qu,Conglei Shi;Weiwei Cui;Shixia Liu;Panpan Xu;Wei Chen;Huamin Qu,Hong Kong University of Science and Technology;Microsoft Research Aisa;Microsoft Research Aisa;Hong Kong University of Science and Technology;Zhe Jiang University;Hong Kong University of Science and Technology,10.1109/TVCG.2008.166;10.1109/VAST.2010.5652931;10.1109/TVCG.2010.193;10.1109/VAST.2010.5652530;10.1109/INFVIS.2000.885098;10.1109/INFVIS.2005.1532148;10.1109/TVCG.2011.179;10.1109/TVCG.2007.70535;10.1109/TVCG.2008.140;10.1109/TVCG.2010.129;10.1109/TVCG.2008.181;10.1109/TVCG.2009.187;10.1109/INFVIS.1999.801851;10.1109/INFVIS.2005.1532122;10.1109/VISUAL.1995.485140;10.1109/TVCG.2010.194;10.1109/TVCG.2011.239;10.1109/TVCG.2010.162;10.1109/TVCG.2011.195;10.1109/TVCG.2009.180,"Time-series data, ranking change, Themeriver, interaction techniques",48,39,38,
InfoVis,2014,iVisDesigner: Expressive Interactive Design of Information Visualizations,10.1109/TVCG.2014.2346291,http://dx.doi.org/10.1109/TVCG.2014.2346291,2092,2101,J,"We present the design, implementation and evaluation of iVisDesigner, a web-based system that enables users to design information visualizations for complex datasets interactively, without the need for textual programming. Our system achieves high interactive expressiveness through conceptual modularity, covering a broad information visualization design space. iVisDesigner supports the interactive design of interactive visualizations, such as provisioning for responsive graph layouts and different types of brushing and linking interactions. We present the system design and implementation, exemplify it through a variety of illustrative visualization designs and discuss its limitations. A performance analysis and an informal user study are presented to evaluate the system.",Donghao Ren;Tobias Höllerer;Xiaoru Yuan,Donghao Ren;Tobias Höllerer;Xiaoru Yuan,"Department of Computer Science, University of California, Santa Barbara;Department of Computer Science, University of California, Santa Barbara;Key Laboratory of Machine Perception (Ministry of Education), School of EECS",10.1109/INFVIS.2004.12;10.1109/TVCG.2010.144;10.1109/TVCG.2009.179;10.1109/TVCG.2009.174;10.1109/VISUAL.2005.1532788;10.1109/TVCG.2011.185;10.1109/TVCG.2007.70577;10.1109/INFVIS.2004.64;10.1109/TVCG.2010.126;10.1109/TVCG.2013.191;10.1109/INFVIS.1997.636792;10.1109/TVCG.2011.201;10.1109/TVCG.2011.261;10.1109/TVCG.2012.275;10.1109/INFVIS.1997.636761,"Visualization design, Interactive Design, Interaction, Expressiveness, Web-based visualization",48,42,40,
Vis,1998,Interactive virtual angioscopy,10.1109/VISUAL.1998.745337,http://dx.doi.org/10.1109/VISUAL.1998.745337,435,438,C,"Virtual angioscopy is a non invasive medical procedure for exploring parts of the human vascular system. We have developed an interactive tool that takes as input, data acquired with standard medical imaging modalities and regards it as a virtual environment to be interactively inspected. The system supports real time navigation with stereoscopic direct volume rendering and dynamic endoscopic camera control, interactive tissue classification, and interactive point picking for morphological feature measurement. We provide an overview of the system, discuss the techniques used in our prototype, and present experimental results on human data sets.",Enrico Gobbetti;Piero Pili;Antonio Zorcolo;Massimiliano Tuveri,E. Gobbetti;P. Pili;A. Zorcolo;M. Tuveri,"Center for Adv. Studies, Cagliari, Italy",10.1109/VISUAL.1997.663915,,47,18,29,
Vis,1999,Anisotropic nonlinear diffusion in flow visualization,10.1109/VISUAL.1999.809904,http://dx.doi.org/10.1109/VISUAL.1999.809904,325,539,C,"Vector field visualization is an important topic in scientific visualization. Its aim is to graphically represent field data in an intuitively understandable and precise way. Here a new approach based on anisotropic nonlinear diffusion is introduced. It enables an easy perception of flow data and serves as an appropriate scale space method for the visualization of complicated flow patterns. The approach is closely related to nonlinear diffusion methods in image analysis where images are smoothed while still retaining and enhancing edges. An initial noisy image is smoothed along streamlines, whereas the image is sharpened in the orthogonal direction. The method is based on a continuous model and requires the solution of a parabolic PDE problem. It is discretized only in the final implementational step. Therefore, many important qualitative aspects can already be discussed on a continuous level. Applications are shown in 2D and 3D and the provisions for flow segmentation are outlined.",Tobias Preußer;Martin Rumpf,T. Preusser;M. Rumpf,"Inst. fur Angewandte Math., Bonn Univ., Germany",10.1109/VISUAL.1993.398875;10.1109/VISUAL.1995.480817;10.1109/VISUAL.1994.346312;10.1109/VISUAL.1997.663912;10.1109/VISUAL.1996.567784;10.1109/VISUAL.1997.663898,"flow visualization, multiscale, nonlinear diffusion, segmentation",47,8,21,
InfoVis,2000,Redefining the focus and context of focus+context visualization,10.1109/INFVIS.2000.885094,http://dx.doi.org/10.1109/INFVIS.2000.885094,85,89,C,"The increasing diversity of computers, especially among small mobile devices such as mobile phones and PDAs, raise new questions about information visualization techniques developed for the desktop computer. Using a series of examples ranging from applications for ordinary desktop displays to web-browsers and other applications for PDAs, we describe how a focus+context technique, Flip Zooming, is changed due to the situation it is used in. Based on these examples, we discuss how the use of ""focus"" and ""context"" in focus+context techniques change in order to fit new areas of use for information visualization.",Staffan Björk;Johan Redström,S. Bjork;J. Redstrom,"Interactive Inst., Gothenburg, Sweden",10.1109/INFVIS.1997.636786;10.1109/INFVIS.1999.801857,,47,6,28,
Vis,2001,Smooth approximation and rendering of large scattered data sets,10.1109/VISUAL.2001.964530,http://dx.doi.org/10.1109/VISUAL.2001.964530,341,348,C,"Presents an efficient method to automatically compute a smooth approximation of large functional scattered data sets given over arbitrarily shaped planar domains. Our approach is based on the construction of a C/sup 1/-continuous bivariate cubic spline and our method offers optimal approximation order. Both local variation and nonuniform distribution of the data are taken into account by using local polynomial least squares approximations of varying degree. Since we only need to solve small linear systems and no triangulation of the scattered data points is required, the overall complexity of the algorithm is linear in the total number of points. Numerical examples dealing with several real-world scattered data sets with up to millions of points demonstrate the efficiency of our method. The resulting spline surface is of high visual quality and can be efficiently evaluated for rendering and modeling. In our implementation we achieve real-time frame rates for typical fly-through sequences and interactive frame rates for recomputing and rendering a locally modified spline surface.",Jörg Haber;Frank Zeilfelder;Oleg Davydov;Hans-Peter Seidel,J. Haber;F. Zeilfelder;O. Davydov;H.-P. Seidel,"Max-Planck-Inst. fur Inf., Saarbrucken, Germany;Max-Planck-Inst. fur Inf., Saarbrucken, Germany",10.1109/VISUAL.1997.663860,"scattered data approximation, least squares approximation, terrain visualization, data compression",47,16,46,
InfoVis,2003,Dynamic visualization of transient data streams,10.1109/INFVIS.2003.1249014,http://dx.doi.org/10.1109/INFVIS.2003.1249014,97,104,C,"We introduce two dynamic visualization techniques using multidimensional scaling to analyze transient data streams such as newswires and remote sensing imagery. While the time-sensitive nature of these data streams requires immediate attention in many applications, the unpredictable and unbounded characteristics of this information can potentially overwhelm many scaling algorithms that require a full re-computation for every update. We present an adaptive visualization technique based on data stratification to ingest stream information adaptively when influx rate exceeds processing rate. We also describe an incremental visualization technique based on data fusion to project new information directly onto a visualization subspace spanned by the singular vectors of the previously processed neighboring data. The ultimate goal is to leverage the value of legacy and new information and minimize re-processing of the entire dataset in full resolution. We demonstrate these dynamic visualization results using a newswire corpus and a remote sensing imagery sequence.",Pak Chung Wong;Harlan Foote;Dan Adams;Wendy Cowley;James J. Thomas,Pak Chung Wong;H. Foote;D. Adams;W. Cowley;J. Thomas,"PNNL, Richland, WA, USA;PNNL, Richland, WA, USA;PNNL, Richland, WA, USA;PNNL, Richland, WA, USA;PNNL, Richland, WA, USA",10.1109/VISUAL.1996.567787;10.1109/VISUAL.1997.663866;10.1109/INFVIS.2002.1173161;10.1109/INFVIS.1995.528686;10.1109/INFVIS.1999.801855,"Dynamic Visualization, Text Visualization, Remote Sensing Imagery, Transient Data Stream",47,9,28,
Vis,2003,Feature-sensitive subdivision and isosurface reconstruction,10.1109/VISUAL.2003.1250360,http://dx.doi.org/10.1109/VISUAL.2003.1250360,99,106,C,"We present improved subdivision and isosurface reconstruction algorithms for polygonizing implicit surfaces and performing accurate geometric operations. Our improved reconstruction algorithm uses directed distance fields (Kobbelt et al., 2001) to detect multiple intersections along an edge, separates them into components and reconstructs an isosurface locally within each components using the dual contouring algorithm (Ju et al., 2002). It can reconstruct thin features without creating handles and results in improved surface extraction from volumetric data. Our subdivision algorithm takes into account sharp features that arise from intersecting surfaces or Boolean operations and generates an adaptive grid such that each voxel has at most one sharp feature. The subdivision algorithm is combined with our improved reconstruction algorithm to compute accurate polygonization of Boolean combinations or offsets of complex primitives that faithfully reconstruct the sharp features. We have applied these algorithms to polygonize complex CAD models designed using thousands of Boolean operations on curved primitives.",Gokul Varadhan;Shankar Krishnan;Young J. Kim;Dinesh Manocha,G. Varadhan;S. Krishnan;Y.J. Kim;D. Manocha,"North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.2001.964518;10.1109/VISUAL.1996.568127,"Implicit modeling, Boolean operations, Marching Cubes, Distance fields, Subdivision",47,15,19,
Vis,2004,Topological lines in 3D tensor fields,10.1109/VISUAL.2004.105,http://dx.doi.org/10.1109/VISUAL.2004.105,313,320,C,"Visualization of 3D tensor fields continues to be a major challenge in terms of providing intuitive and uncluttered images that allow the users to better understand their data. The primary focus of this paper is on finding a formulation that lends itself to a stable numerical algorithm for extracting stable and persistent topological features from 2nd order real symmetric 3D tensors. While features in 2D tensors can be identified as either wedge or trisector points, in 3D, the corresponding stable features are lines, not just points. These topological feature lines provide a compact representation of the 3D tensor field and are essential in helping scientists and engineers understand their complex nature. Existing techniques work by finding degenerate points and are not numerically stable, and worse, produce both false positive and false negative feature points. This work seeks to address this problem with a robust algorithm that can extract these features in a numerically stable, accurate, and complete manner.",Xiaoqiang Zheng;Alex T. Pang,X. Zheng;A. Pang,"Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA;Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA",10.1109/VISUAL.1998.745316;10.1109/VISUAL.1999.809894;10.1109/VISUAL.1993.398849;10.1109/VISUAL.2003.1250379;10.1109/VISUAL.2002.1183798;10.1109/VISUAL.1994.346326;10.1109/VISUAL.1999.809905;10.1109/VISUAL.1998.745294;10.1109/VISUAL.1999.809886,"hyperstreamlines, real symmetric tensors, degenerate tensors, tensor topology, topological lines",47,27,22,
Vis,2005,Fast and reproducible fiber bundle selection in DTI visualization,10.1109/VISUAL.2005.1532778,http://dx.doi.org/10.1109/VISUAL.2005.1532778,59,64,C,"Diffusion tensor imaging (DTI) is an MRI-based technique for quantifying water diffusion in living tissue. In the white matter of the brain, water diffuses more rapidly along the neuronal axons than in the perpendicular direction. By exploiting this phenomenon, DTI can be used to determine trajectories of fiber bundles, or neuronal connections between regions, in the brain. The resulting bundles can be visualized. However, the resulting visualizations can be complex and difficult to interpret. An effective approach is to pre-determine trajectories from a large number of positions throughout the white matter (full brain fiber tracking) and to offer facilities to aid the user in selecting fiber bundles of interest. Two factors are crucial for the use and acceptance of this technique in clinical studies: firstly, the selection of the bundles by brain experts should be interactive, supported by real-time visualization of the trajectories registered with anatomical MRI scans. Secondly, the fiber selections should be reproducible, so that different experts will achieve the same results. In this paper we present a practical technique for the interactive selection of fiber-bundles using multiple convex objects that is an order of magnitude faster than similar techniques published earlier. We also present the results of a clinical study with ten subjects that show that our selection approach is highly reproducible for fractional anisotropy (FA) calculated over the selected fiber bundles.",Jorik Blaas;Charl P. Botha;Bart Peters;Frans Vos;Frits H. Post,J. Blaas;C.P. Botha;B. Peters;F.M. Vos;F.H. Post,"Data Visualization Group, Delft Univ. of Technol., Netherlands;Data Visualization Group, Delft Univ. of Technol., Netherlands",10.1109/VISUAL.1999.809894;10.1109/VISUAL.2004.30," diffusion tensor imaging, tractography, white matter",47,12,11,
Vis,2005,Opening the can of worms: an exploration tool for vortical flows,10.1109/VISUAL.2005.1532830,http://dx.doi.org/10.1109/VISUAL.2005.1532830,463,470,C,"Gaining a comprehensive understanding of turbulent flows still poses one of the great challenges in fluid dynamics. A well-established approach to advance this research is the analysis of the vortex structures contained in the flow. In order to be able to perform this analysis efficiently, supporting visualization tools with clearly defined requirements are needed. In this paper, we present a visualization system which matches these requirements to a large extent. The system consists of two components. The first component analyzes the flow by means of a novel combination of vortex core line detection and the /spl lambda//sub 2/ method. The second component is a vortex browser which allows for an interactive exploration and manipulation of the vortices detected and separated during the first phase. Our system improves the reliability and applicability of existing vortex detection methods and allows for a more efficient study of vortical flows which is demonstrated in an evaluation performed by experts.",Simon Stegmaier;Ulrich Rist;Thomas Ertl,S. Stegmaier;U. Rist;T. Ertl,"Inst. for Visualization & Interactive Syst., Stuttgart Univ., Germany",10.1109/VISUAL.1990.146359;10.1109/VISUAL.1998.745297;10.1109/VISUAL.1994.346327;10.1109/VISUAL.2004.3;10.1109/VISUAL.1998.745288;10.1109/VISUAL.1998.745296,"Flow Features, Vortex Detection, Interactive Manipulation, 3D Vector Field Visualization",47,14,25,
Vis,2005,Extracting higher order critical points and topological simplification of 3D vector fields,10.1109/VISUAL.2005.1532842,http://dx.doi.org/10.1109/VISUAL.2005.1532842,559,566,C,"This paper presents an approach to extracting and classifying higher order critical points of 3D vector fields. To do so, we place a closed convex surface s around the area of interest. Then we show that the complete 3D classification of a critical point into areas of different flow behavior is equivalent to extracting the topological skeleton of an appropriate 2D vector field on s, if each critical point is equipped with an additional bit of information. Out of this skeleton, we create an icon which replaces the complete topological structure inside s for the visualization. We apply our method to find a simplified visual representation of clusters of critical points, leading to expressive visualizations of topologically complex 3D vector fields.",Tino Weinkauf;Holger Theisel;Kuangyu Shi;Hans-Christian Hege;Hans-Peter Seidel,T. Weinkauf;H. Theisel;K. Shi;H.-C. Hege;H.-P. Seidel,"ZIB, Berlin, Germany",10.1109/VISUAL.1999.809907;10.1109/VISUAL.2002.1183786;10.1109/VISUAL.2000.885714;10.1109/VISUAL.1991.175773;10.1109/VISUAL.2000.885716;10.1109/VISUAL.2001.964507;10.1109/VISUAL.2003.1250376,,47,15,22,
Vis,2007,Moment Invariants for the Analysis of 2D Flow fields,10.1109/TVCG.2007.70579,http://dx.doi.org/10.1109/TVCG.2007.70579,1743,1750,J,"We present a novel approach for analyzing two-dimensional (2D) flow field data based on the idea of invariant moments. Moment invariants have traditionally been used in computer vision applications, and we have adapted them for the purpose of interactive exploration of flow field data. The new class of moment invariants we have developed allows us to extract and visualize 2D flow patterns, invariant under translation, scaling, and rotation. With our approach one can study arbitrary flow patterns by searching a given 2D flow data set for any type of pattern as specified by a user. Further, our approach supports the computation of moments at multiple scales, facilitating fast pattern extraction and recognition. This can be done for critical point classification, but also for patterns with greater complexity. This multi-scale moment representation is also valuable for the comparative visualization of flow field data. The specific novel contributions of the work presented are the mathematical derivation of the new class of moment invariants, their analysis regarding critical point features, the efficient computation of a novel feature space representation, and based upon this the development of a fast pattern recognition algorithm for complex flow structures.",Michael Schlemmer;Manuel Heringer;Florian Morr;Ingrid Hotz;Martin Hering-Bertram;Christoph Garth;Wolfgang Kollmann;Bernd Hamann;Hans Hagen,Michael Schlemmer;Manuel Heringer;Florian Morr;Ingrid Hotz;Martin Hering-Bertram;Christoph Garth;Wolfgang Kollmann;Bernd Hamann;Hans Hagen,"University of Kaiserslautern, Germany;University of Kaiserslautern, Germany;University of Kaiserslautern, Germany;Konrad-Zuse-Zentrum f ¨ur Informationstechnik Berlin (ZIB), FU Berlin, Germany;Fraunhofer Institut f ¨ur Techno- und Wirtschaftsmathematik (ITWM) in Kaiserslautern, Germany;University of Kaiserslautern, Germany, and the Institute for Data Analysis and Visualization at the University of California, Davis, CA;Department of Mechanical and Aeronautical Engineering, University of California, Davis, CA;Institute for Data Analysis and Visualization and Department of Computer Science, University of California, Davis, CA;University of Kaiserslautern, Germany",10.1109/VISUAL.2004.68;10.1109/VISUAL.1999.809873;10.1109/VISUAL.2005.1532858;10.1109/VISUAL.2003.1250372,"Flow Visualization, Feature Detection, Pattern Extraction, Pattern Recognition, Image Processing",47,43,23,
Vis,2008,Interactive Comparison of Scalar fields Based on Largest Contours with Applications to Flow Visualization,10.1109/TVCG.2008.143,http://dx.doi.org/10.1109/TVCG.2008.143,1475,1482,J,"Understanding fluid flow data, especially vortices, is still a challenging task. Sophisticated visualization tools help to gain insight. In this paper, we present a novel approach for the interactive comparison of scalar fields using isosurfaces, and its application to fluid flow datasets. Features in two scalar fields are defined by largest contour segmentation after topological simplification. These features are matched using a volumetric similarity measure based on spatial overlap of individual features. The relationships defined by this similarity measure are ranked and presented in a thumbnail gallery of feature pairs and a graph representation showing all relationships between individual contours. Additionally, linked views of the contour trees are provided to ease navigation. The main render view shows the selected features overlapping each other. Thus, by displaying individual features and their relationships in a structured fashion, we enable exploratory visualization of correlations between similar structures in two scalar fields. We demonstrate the utility of our approach by applying it to a number of complex fluid flow datasets, where the emphasis is put on the comparison of vortex related scalar quantities.",Dominic Schneider;Alexander Wiebel;Hamish A. Carr;Mario Hlawitschka;Gerik Scheuermann,Dominic Schneider;Alexander Wiebel;Hamish Carr;Mario Hlawitschka;Gerik Scheuermann,University of Leipzig;University of Leipzig;University College Dublin;University of Leipzig;University of Leipzig,10.1109/TVCG.2006.164;10.1109/VISUAL.2001.964519;10.1109/VISUAL.2004.107;10.1109/TVCG.2007.70615;10.1109/VISUAL.2005.1532830;10.1109/TVCG.2006.165;10.1109/VISUAL.2004.96;10.1109/VISUAL.2003.1250374;10.1109/TVCG.2007.70519;10.1109/VISUAL.2005.1532848;10.1109/VISUAL.1997.663875;10.1109/VISUAL.2005.1532835,"Scalar topology, comparative visualization, contour tree, largest contours, flow visualization",47,45,36,
InfoVis,2010,MulteeSum: A Tool for Comparative Spatial and Temporal Gene Expression Data,10.1109/TVCG.2010.137,http://dx.doi.org/10.1109/TVCG.2010.137,908,917,J,"Cells in an organism share the same genetic information in their DNA, but have very different forms and behavior because of the selective expression of subsets of their genes. The widely used approach of measuring gene expression over time from a tissue sample using techniques such as microarrays or sequencing do not provide information about the spatial position with in the tissue where these genes are expressed. In contrast, we are working with biologists who use techniques that measure gene expression in every individual cell of entire fruitfly embryos over an hour of their development, and do so for multiple closely-related subspecies of Drosophila. These scientists are faced with the challenge of integrating temporal gene expression data with the spatial location of cells and, moreover, comparing this data across multiple related species. We have worked with these biologists over the past two years to develop MulteeSum, a visualization system that supports inspection and curation of data sets showing gene expression over time, in conjunction with the spatial location of the cells where the genes are expressed - it is the first tool to support comparisons across multiple such data sets. MulteeSum is part of a general and flexible framework we developed with our collaborators that is built around multiple summaries for each cell, allowing the biologists to explore the results of computations that mix spatial information, gene expression measurements over time, and data from multiple related species or organisms. We justify our design decisions based on specific descriptions of the analysis needs of our collaborators, and provide anecdotal evidence of the efficacy of MulteeSum through a series of case studies.",Miriah D. Meyer;Tamara Munzner;Angela H. DePace;Hanspeter Pfister,Miriah Meyer;Tamara Munzner;Angela DePace;Hanspeter Pfister,,10.1109/TVCG.2006.178;10.1109/TVCG.2007.70583;10.1109/TVCG.2007.70589;10.1109/TVCG.2009.167,"Spatial data, temporal data, gene expression",47,33,27,
VAST,2011,Visual analytics decision support environment for epidemic modeling and response evaluation,10.1109/VAST.2011.6102457,http://dx.doi.org/10.1109/VAST.2011.6102457,191,200,C,"In modeling infectious diseases, scientists are studying the mechanisms by which diseases spread, predicting the future course of the outbreak, and evaluating strategies applied to control an epidemic. While recent work has focused on accurately modeling disease spread, less work has been performed in developing interactive decision support tools for analyzing the future course of the outbreak and evaluating potential disease mitigation strategies. The absence of such tools makes it difficult for researchers, analysts and public health officials to evaluate response measures within outbreak scenarios. As such, our research focuses on the development of an interactive decision support environment in which users can explore epidemic models and their impact. This environment provides a spatiotemporal view where users can interactively utilize mitigative response measures and observe the impact of their decision over time. Our system also provides users with a linked decision history visualization and navigation tool that support the simultaneous comparison of mortality and infection rates corresponding to different response measures at different points in time.",Shehzad Afzal;Ross Maciejewski;David S. Ebert,Shehzad Afzal;Ross Maciejewski;David S. Ebert,"Purdue University Visualization and Analytics Center, USA;Purdue University Visualization and Analytics Center, USA;Purdue University Visualization and Analytics Center, USA",10.1109/TVCG.2008.137;10.1109/TVCG.2007.70594;10.1109/VISUAL.1993.398857;10.1109/VAST.2009.5333020;10.1109/TVCG.2010.223;10.1109/TVCG.2010.190;10.1109/TVCG.2010.206;10.1109/TVCG.2009.187;10.1109/TVCG.2010.171;10.1109/VAST.2006.261450;10.1109/INFVIS.2000.885086,,47,37,30,
Vis,2011,The FLOWLENS: A Focus-and-Context Visualization Approach for Exploration of Blood Flow in Cerebral Aneurysms,10.1109/TVCG.2011.243,http://dx.doi.org/10.1109/TVCG.2011.243,2183,2192,J,"Blood flow and derived data are essential to investigate the initiation and progression of cerebral aneurysms as well as their risk of rupture. An effective visual exploration of several hemodynamic attributes like the wall shear stress (WSS) and the inflow jet is necessary to understand the hemodynamics. Moreover, the correlation between focus-and-context attributes is of particular interest. An expressive visualization of these attributes and anatomic information requires appropriate visualization techniques to minimize visual clutter and occlusions. We present the FLOWLENS as a focus-and-context approach that addresses these requirements. We group relevant hemodynamic attributes to pairs of focus-and-context attributes and assign them to different anatomic scopes. For each scope, we propose several FLOWLENS visualization templates to provide a flexible visual filtering of the involved hemodynamic pairs. A template consists of the visualization of the focus attribute and the additional depiction of the context attribute inside the lens. Furthermore, the FLOWLENS supports local probing and the exploration of attribute changes over time. The FLOWLENS minimizes visual cluttering, occlusions, and provides a flexible exploration of a region of interest. We have applied our approach to seven representative datasets, including steady and unsteady flow data from CFD simulations and 4D PC-MRI measurements. Informal user interviews with three domain experts confirm the usefulness of our approach.",Rocco Gasteiger;Mathias Neugebauer;Oliver Beuing;Bernhard Preim,Rocco Gasteiger;Mathias Neugebauer;Oliver Beuing;Bernhard Preim,"Department of Simulation and Graphics, University of Magdeburg, Germany;Department of Simulation and Graphics, University of Magdeburg, Germany;Department of Neuroradiology, University Hospital Magdeburg, Germany;Department of Simulation and Graphics, University of Magdeburg, Germany",10.1109/TVCG.2010.166;10.1109/TVCG.2009.138;10.1109/TVCG.2010.153;10.1109/TVCG.2006.124;10.1109/TVCG.2009.126;10.1109/VISUAL.2005.1532818,"Flow Visualization, Focus-and-Context, Illustrative Rendering, Aneurysm",47,36,41,
Vis,2011,Voronoi-Based Extraction and Visualization of Molecular Paths,10.1109/TVCG.2011.259,http://dx.doi.org/10.1109/TVCG.2011.259,2025,2034,J,"Visual analysis is widely used to study the behavior of molecules. Of particular interest are the analysis of molecular interactions and the investigation of binding sites. For large molecules, however, it is difficult to detect possible binding sites and paths leading to these sites by pure visual inspection. In this paper, we present new methods for the computation and visualization of potential molecular paths. Using a novel filtering method, we extract the significant paths from the Voronoi diagram of spheres. For the interactive visualization of molecules and their paths, we present several methods using deferred shading and other state-of-theart techniques. To allow for a fast overview of reachable regions of the molecule, we illuminate the molecular surface using a large number of light sources placed on the extracted paths. We also provide a method to compute the extension surface of selected paths and visualize it using the skin surface. Furthermore, we use the extension surface to clip the molecule to allow easy visual tracking of even deeply buried paths. The methods are applied to several proteins to demonstrate their usefulness.",Norbert Lindow;Daniel Baum;Hans-Christian Hege,Norbert Lindow;Daniel Baum;Hans-Christian Hege,Zuse Institute Berlin (ZIB);Zuse Institute Berlin (ZIB);Zuse Institute Berlin (ZIB),10.1109/TVCG.2010.218;10.1109/TVCG.2006.115;10.1109/TVCG.2009.157,"Molecular visualization, data filtering, geometry-based techniques, view-dependent visualization",47,42,49,HM
InfoVis,2012,How Capacity Limits of Attention Influence Information Visualization Effectiveness,10.1109/TVCG.2012.233,http://dx.doi.org/10.1109/TVCG.2012.233,2402,2410,J,"In this paper, we explore how the capacity limits of attention influence the effectiveness of information visualizations. We conducted a series of experiments to test how visual feature type (color vs. motion), layout, and variety of visual elements impacted user performance. The experiments tested users' abilities to (1) determine if a specified target is on the screen, (2) detect an odd-ball, deviant target, different from the other visible objects, and (3) gain a qualitative overview by judging the number of unique categories on the screen. Our results show that the severe capacity limits of attention strongly modulate the effectiveness of information visualizations, particularly the ability to detect unexpected information. Keeping in mind these capacity limits, we conclude with a set of design guidelines which depend on a visualization's intended use.",Steve Haroz;David Whitney,Steve Haroz;David Whitney,"University of California, Davis;University of California, Berkeley",10.1109/INFVIS.2001.963274;10.1109/VISUAL.1996.568118;10.1109/TVCG.2010.186;10.1109/VISUAL.2005.1532838,"Perception, attention, color, motion, user study, nominal axis, layout, goal-oriented design",47,43,35,BP
VAST,2014,Visualizing Mobility of Public Transportation System,10.1109/TVCG.2014.2346893,http://dx.doi.org/10.1109/TVCG.2014.2346893,1833,1842,J,"Public transportation systems (PTSs) play an important role in modern cities, providing shared/massive transportation services that are essential for the general public. However, due to their increasing complexity, designing effective methods to visualize and explore PTS is highly challenging. Most existing techniques employ network visualization methods and focus on showing the network topology across stops while ignoring various mobility-related factors such as riding time, transfer time, waiting time, and round-the-clock patterns. This work aims to visualize and explore passenger mobility in a PTS with a family of analytical tasks based on inputs from transportation researchers. After exploring different design alternatives, we come up with an integrated solution with three visualization modules: isochrone map view for geographical information, isotime flow map view for effective temporal information comparison and manipulation, and OD-pair journey view for detailed visual analysis of mobility factors along routes between specific origin-destination pairs. The isotime flow map linearizes a flow map into a parallel isoline representation, maximizing the visualization of mobility information along the horizontal time axis while presenting clear and smooth pathways from origin to destinations. Moreover, we devise several interactive visual query methods for users to easily explore the dynamics of PTS mobility over space and time. Lastly, we also construct a PTS mobility model from millions of real passenger trajectories, and evaluate our visualization techniques with assorted case studies with the transportation researchers.",Wei Zeng 0004;Chi-Wing Fu;Stefan Müller Arisona;Alexander Erath;Huamin Qu,Wei Zeng;Chi-Wing Fu;Stefan Müller Arisona;Alexander Erath;Huamin Qu,"Nanyang Technological University, Singapore;Nanyang Technological University, Singapore;University of Applied Sciences;ETH Zurich;Hong Kong University of Science and Technology",10.1109/INFVIS.2001.963273;10.1109/TVCG.2011.202;10.1109/TVCG.2011.205;10.1109/TVCG.2009.143;10.1109/TVCG.2012.265;10.1109/TVCG.2013.228;10.1109/TVCG.2013.226;10.1109/VAST.2011.6102455;10.1109/INFVIS.2005.1532150,"Mobility, public transportation, visual analytics",47,54,42,
VAST,2014,Supporting Communication and Coordination in Collaborative Sensemaking,10.1109/TVCG.2014.2346573,http://dx.doi.org/10.1109/TVCG.2014.2346573,1633,1642,J,"When people work together to analyze a data set, they need to organize their findings, hypotheses, and evidence, share that information with their collaborators, and coordinate activities amongst team members. Sharing externalizations (recorded information such as notes) could increase awareness and assist with team communication and coordination. However, we currently know little about how to provide tool support for this sort of sharing. We explore how linked common work (LCW) can be employed within a `collaborative thinking space', to facilitate synchronous collaborative sensemaking activities in Visual Analytics (VA). Collaborative thinking spaces provide an environment for analysts to record, organize, share and connect externalizations. Our tool, CLIP, extends earlier thinking spaces by integrating LCW features that reveal relationships between collaborators' findings. We conducted a user study comparing CLIP to a baseline version without LCW. Results demonstrated that LCW significantly improved analytic outcomes at a collaborative intelligence task. Groups using CLIP were also able to more effectively coordinate their work, and held more discussion of their findings and hypotheses. LCW enabled them to maintain awareness of each other's activities and findings and link those findings to their own work, preventing disruptive oral awareness notifications.",Narges Mahyar;Melanie Tory,Narges Mahyar;Melanie Tory,University of Victoria;University of Victoria,10.1109/VAST.2009.5333245;10.1109/VAST.2006.261439;10.1109/VAST.2008.4677358;10.1109/TVCG.2013.197;10.1109/VAST.2011.6102438;10.1109/VAST.2009.5333878;10.1109/VAST.2006.261430;10.1109/VAST.2007.4389011;10.1109/VAST.2007.4389006;10.1109/VAST.2011.6102447,"Sensemaking, Collaboration, Externalization, Linked common work, Collaborative thinking space",47,44,43,BP
VAST,2015,TargetVue: Visual Analysis of Anomalous User Behaviors in Online Communication Systems,10.1109/TVCG.2015.2467196,http://dx.doi.org/10.1109/TVCG.2015.2467196,280,289,J,"Users with anomalous behaviors in online communication systems (e.g. email and social medial platforms) are potential threats to society. Automated anomaly detection based on advanced machine learning techniques has been developed to combat this issue; challenges remain, though, due to the difficulty of obtaining proper ground truth for model training and evaluation. Therefore, substantial human judgment on the automated analysis results is often required to better adjust the performance of anomaly detection. Unfortunately, techniques that allow users to understand the analysis results more efficiently, to make a confident judgment about anomalies, and to explore data in their context, are still lacking. In this paper, we propose a novel visual analysis system, TargetVue, which detects anomalous users via an unsupervised learning model and visualizes the behaviors of suspicious users in behavior-rich context through novel visualization designs and multiple coordinated contextual views. Particularly, TargetVue incorporates three new ego-centric glyphs to visually summarize a user's behaviors which effectively present the user's communication activities, features, and social interactions. An efficient layout method is proposed to place these glyphs on a triangle grid, which captures similarities among users and facilitates comparisons of behaviors of different users. We demonstrate the power of TargetVue through its application in a social bot detection challenge using Twitter data, a case study based on email records, and an interview with expert users. Our evaluation shows that TargetVue is beneficial to the detection of users with anomalous communication behaviors.",Nan Cao;Conglei Shi;Wan-Yi Sabrina Lin;Jie Lu;Yu-Ru Lin;Ching-Yung Lin,Nan Cao;Conglei Shi;Sabrina Lin;Jie Lu;Yu-Ru Lin;Ching-Yung Lin,IBM T. J. Watson Research Center;IBM T. J. Watson Research Center;IBM T. J. Watson Research Center;IBM T. J. Watson Research Center;University of Pissburg;IBM T. J. Watson Research Center,10.1109/TVCG.2012.291;10.1109/TVCG.2006.170;10.1109/VISUAL.2002.1183816;10.1109/TVCG.2014.2346922,"Anomaly Detection, Social Media, Visual Analysis",47,53,45,
Vis,1990,The application of transport theory to visualization of 3D scalar data fields,10.1109/VISUAL.1990.146391,http://dx.doi.org/10.1109/VISUAL.1990.146391,273,"280, 481-2",C,"The author describes a visualization model for three-dimensional scalar data fields based on linear transport theory. The concept of virtual particles for the extraction of information from data fields in introduced. The role of different types of interaction of the data field with those particles such as absorption, scattering, source and color shift are discussed and demonstrated. Special attention is given to possible tools for the enhancement of interesting data features. Random texturing can provide visual insights as to the magnitude and distribution of deviations of related data fields, e.g., originating from analytic models, and measurements, or in the noise content of a given data field. Hidden symmetries of a data set can often be identified visually by allowing it to interact with a preselected beam of physical particles with the attendant appearance of characteristic structural effects such as channeling.&lt;&lt;ETX&gt;&gt;",Wolfgang Krüger,W. Krueger,"ART+COM e.V., Berlin, Germany",,,46,11,24,
Vis,1993,An architecture for rule-based visualization,10.1109/VISUAL.1993.398874,http://dx.doi.org/10.1109/VISUAL.1993.398874,236,243,C,"In Rogowitz and Treinish (1993), we introduced an architecture for incorporating perceptual rules into the visualization process. In this architecture, higher-level descriptors of the data, metadata, flow to perceptual rules, which constrain visualization operations. In this paper, we develop a deeper analysis of the rules, the prerequisite metadata, and the system for enabling their operation.&lt;&lt;ETX&gt;&gt;",Bernice E. Rogowitz;Lloyd Treinish,B.E. Rogowitz;L.A. Treinish,"IBM T.J. Watson Res. Center, Yorktown Heights, NY, USA;IBM T.J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.1992.235199;10.1109/VISUAL.1992.235219;10.1109/VISUAL.1991.175818,,46,20,28,
Vis,1997,Haar wavelets over triangular domains with applications to multiresolution models for flow over a sphere,10.1109/VISUAL.1997.663871,http://dx.doi.org/10.1109/VISUAL.1997.663871,143,149,C,"Some new piecewise constant wavelets defined over nested triangulated domains are presented and applied to the problem of multiresolution analysis of flow over a spherical domain. These new, nearly orthogonal wavelets have advantages over the existing weaker biorthogonal wavelets. In the planar case of uniform areas, the wavelets converge to one of two fully orthogonal Haar wavelets. These new, fully orthogonal wavelets are proven to be the only possible wavelets of this type.",Gregory M. Nielson;Il-Hong Jung;Junwon Sung,G.M. Nielson;Il-Hong Jung;Junwon Sung,"Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA",,,46,26,3,
Vis,1998,Image-guided streamline placement on curvilinear grid surfaces,10.1109/VISUAL.1998.745295,http://dx.doi.org/10.1109/VISUAL.1998.745295,135,142,C,"The success of using a streamline technique for visualizing a vector field usually depends largely on the choice of adequate seed points. G. Turk and D. Banks (1996) developed an elegant technique for automatically placing seed points to achieve a uniform distribution of streamlines on a 2D vector field. Their method uses an energy function calculated from the low-pass filtered streamline image to guide the optimization process of the streamline distribution. This paper proposes a new technique for creating evenly distributed streamlines on 3D parametric surfaces found in curvilinear grids. We make use of Turk and Banks's 2D algorithm by first mapping the vectors on a 3D surface into the computational space of the curvilinear grid. To take into the consideration the mapping distortion caused by the uneven grid density in a curvilinear grid, a new energy function is designed and used for guiding the placement of streamlines in the computational space with desired local densities.",Xiaoyang Mao;Yuji Hatanaka;Hidenori Higashida;Atsumi Imamiya,X. Mao;Y. Hatanaka;H. Higashida;A. Imamiya,"Dept. of Comput. & Media Eng., Yamanashi Univ., Kofu, Japan",10.1109/VISUAL.1994.346312;10.1109/VISUAL.1995.480819,"vector field visualization, flow visualization, streamline, curvilinear grid",46,24,12,
Vis,2000,Hardware-accelerated texture advection for unsteady flow visualization,10.1109/VISUAL.2000.885689,http://dx.doi.org/10.1109/VISUAL.2000.885689,155,162,C,"We present a novel hardware-accelerated texture advection algorithm to visualize the motion of two-dimensional unsteady flows. Making use of several proposed extensions to the OpenGL-1.2 specification, we demonstrate animations of over 65,000 particles at 2 frames/sec on an SGI Octane with EMXI graphics. High image quality is achieved by careful attention to edge effects, noise frequency, and image enhancement. We provide a detailed description of the hardware implementation, including temporal and spatial coherence techniques, dye advection techniques, and feature extraction.",Bruno Jobard;Gordon Erlebacher;M. Yousuff Hussaini,B. Jobard;G. Erlebacher;M.Y. Hussaini,"Sch. of Comput. Sci. & Inf. Technol., Tallahassee, FL, USA",10.1109/VISUAL.1995.480817;10.1109/VISUAL.1998.745324,"unsteady, vector field, pathlines, streakline, advection, texture, hardware, OpenGL",46,20,18,
Vis,2004,Adaptive 4-8 texture hierarchies,10.1109/VISUAL.2004.4,http://dx.doi.org/10.1109/VISUAL.2004.4,219,226,C,"We address the texture level-of-detail problem for extremely large surfaces such as terrain during realtime, view-dependent rendering. A novel texture hierarchy is introduced based on 4-8 refinements of raster tiles, in which the texture grids in effect rotate 45 degrees for each level of refinement. This hierarchy provides twice as many levels of detail as conventional quadtree-style refinement schemes such as mipmaps, and thus provides per-pixel view-dependent filtering that is twice as close to the ideal cutoff frequency for an average pixel. Because of this more gradual change in low-pass filtering, and due to the more precise emulation of the ideal cutoff frequency, we find in practice that the transitions between texture levels of detail are not perceptible. This allows rendering systems to avoid the complexity and performance costs of per-pixel blending between texture levels of detail. The 4-8 texturing scheme is integrated into a variant of the real-time optimally adapting meshes (ROAM) algorithm for view-dependent multiresolution mesh generation. Improvements to ROAM included here are: the diamond data structure as a streamlined replacement for the triangle bintree elements, the use of low-pass-filtered geometry patches in place of individual triangles, integration of 4-8 textures, and a simple out-of-core data access mechanism for texture and geometry tiles.",Lok M. Hwa;Mark A. Duchaineau;Kenneth I. Joy,L.M. Hwa;M.A. Duchaineau;K.I. Joy,"California Univ., Davis, CA, USA",10.1109/VISUAL.2001.964533;10.1109/VISUAL.1997.663860;10.1109/VISUAL.2002.1183783;10.1109/VISUAL.1998.745282;10.1109/VISUAL.1998.745280;10.1109/VISUAL.2000.885699;10.1109/VISUAL.1995.480813;10.1109/VISUAL.2003.1250366,"Large Data Set Visualization, Level-of-Detail Techniques, View-Dependent Visualization, Adaptive Textures, Out-of-Core Algorithms",46,9,24,BP
Vis,2004,Local and global comparison of continuous functions,10.1109/VISUAL.2004.68,http://dx.doi.org/10.1109/VISUAL.2004.68,275,280,C,We introduce local and global comparison measures for a collection of k /spl les/ d real-valued smooth functions on a common d-dimensional Riemannian manifold. For k = d = 2 we relate the measures to the set of critical points of one function restricted to the level sets of the other. The definition of the measures extends to piecewise linear functions for which they are easy to compute. The computation of the measures forms the centerpiece of a software tool which we use to study scientific datasets.,Herbert Edelsbrunner;John Harer;Vijay Natarajan;Valerio Pascucci,H. Edelsbrunner;J. Harer;V. Natarajan;V. Pascucci,"Dept. of Comput. Sci. & Math., Duke Univ., Durham, NC, USA",,"Visualization, Riemannian manifolds, smooth functions, time-varying data, comparison measure, differential forms",46,17,13,
Vis,2005,COTS cluster-based sort-last rendering: performance evaluation and pipelined implementation,10.1109/VISUAL.2005.1532785,http://dx.doi.org/10.1109/VISUAL.2005.1532785,111,118,C,"Sort-last parallel rendering is an efficient technique to visualize huge datasets on COTS clusters. The dataset is subdivided and distributed across the cluster nodes. For every frame, each node renders a full resolution image of its data using its local GPU, and the images are composited together using a parallel image compositing algorithm. In this paper, we present a performance evaluation of standard sort-last parallel rendering methods and of the different improvements proposed in the literature. This evaluation is based on a detailed analysis of the different hardware and software components. We present a new implementation of sort-last rendering that fully overlaps CPU(s), GPU and network usage all along the algorithm. We present experiments on a 3 years old 32-node PC cluster and on a 1.5 years old 5-node PC cluster, both with Gigabit interconnect, showing volume rendering at respectively 13 and 31 frames per second and polygon rendering at respectively 8 and 17 frames per second on a 1024 x 768 render area, and we show that our implementation outperforms or equals many other implementations and specialized visualization clusters.",Xavier Cavin;Christophe Mion;Alain Filbois,X. Cavin;C. Mion;A. Filbois,,,"cluster-based visualization, sort-last rendering, parallel image compositing",46,14,32,
InfoVis,2007,Weaving Versus Blending: a quantitative assessment of the information carrying capacities of two alternative methods for conveying multivariate data with color.,10.1109/TVCG.2007.70623,http://dx.doi.org/10.1109/TVCG.2007.70623,1270,1277,J,"In many applications, it is important to understand the individual values of, and relationships between, multiple related scalar variables defined across a common domain. Several approaches have been proposed for representing data in these situations. In this paper we focus on strategies for the visualization of multivariate data that rely on color mixing. In particular, through a series of controlled observer experiments, we seek to establish a fundamental understanding of the information-carrying capacities of two alternative methods for encoding multivariate information using color: color blending and color weaving. We begin with a baseline experiment in which we assess participants' abilities to accurately read numerical data encoded in six different basic color scales defined in the L*a*b* color space. We then assess participants' abilities to read combinations of 2, 3, 4 and 6 different data values represented in a common region of the domain, encoded using either color blending or color weaving. In color blending a single mixed color is formed via linear combination of the individual values in L*a*b* space, and in color weaving the original individual colors are displayed side-by-side in a high frequency texture that fills the region. A third experiment was conducted to clarify some of the trends regarding the color contrast and its effect on the magnitude of the error that was observed in the second experiment. The results indicate that when the component colors are represented side-by-side in a high frequency texture, most participants' abilities to infer the values of individual components are significantly improved, relative to when the colors are blended. Participants' performance was significantly better with color weaving particularly when more than 2 colors were used, and even when the individual colors subtended only 3 minutes of visual angle in the texture. However, the information-carrying capacity of the color weaving approach has its limits. We found that participants' abilities to accurately interpret each of the individual components in a high frequency color texture typically falls off as the number of components increases from 4 to 6. We found no significant advantages, in either color blending or color weaving, to using color scales based on component hues thatare more widely separated in the L*a*b* color space. Furthermore, we found some indications that extra difficulties may arise when opponent hues are employed.",Haleh Hagh-Shenas;Sunghee Kim;Victoria Interrante;Christopher G. Healey,Haleh Hagh-Shenas;Sunghee Kim;Victoria Interrante;Christopher Healey,Boston Scientific;Gettysburg College;University of Minnesota;North Carolina State University,10.1109/INFVIS.2005.1532140;10.1109/VISUAL.2003.1250362;10.1109/VISUAL.1999.809905;10.1109/INFVIS.2005.1532137,"Color, perception, visualization, color weaving, color blending",46,40,14,
InfoVis,2008,Exploration of Networks using overview+detail with Constraint-based cooperative layout,10.1109/TVCG.2008.130,http://dx.doi.org/10.1109/TVCG.2008.130,1293,1300,J,"A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The user explores the network by changing the focal node in the detailed view or by changing the level of detail of a node or cluster. For scalability, fast force-based layout algorithms are used for the overview and the detailed view. However, using the same layout algorithm in both views is problematic since layout for the detailed view has different requirements to that in the overview. Here we present a model in which constrained graph layout algorithms are used for layout in the detailed view. This means the detailed view has high-quality layout including sophisticated edge routing and is customisable by the user who can add placement constraints on the layout. Scalability is still ensured since the slower layout techniques are only applied to the small subgraph shown in the detailed view. The main technical innovations are techniques to ensure that the overview and detailed view remain synchronized, and modifying constrained graph layout algorithms to support smooth, stable layout. The key innovation supporting stability are new dynamic graph layout algorithms that preserve the topology or structure of the network when the user changes the focus node or the level of detail by in situ semantic zooming. We have built a prototype tool and demonstrate its use in two application domains, UML class diagrams and biological networks.",Tim Dwyer;Kim Marriott;Falk Schreiber;Peter J. Stuckey;Michael Woodward;Michael Wybrow,Tim Dwyer;Kim Marriott;Falk Schreiber;Peter Stuckey;Michael Woodward;Michael Wybrow,Microsoft Research;Monash University;IPL-Gatersleben;National ICT Australia;The University of Melbourne;Monash University,10.1109/INFVIS.2002.1173159;10.1109/TVCG.2006.122;10.1109/TVCG.2006.156;10.1109/INFVIS.2005.1532126;10.1109/INFVIS.2004.43;10.1109/TVCG.2006.177;10.1109/INFVIS.2002.1173148;10.1109/INFVIS.2004.66;10.1109/INFVIS.1999.801854,"Graph drawing, constraints, stress majorization, force directed algorithms, multidimensional scaling",46,36,39,
VAST,2008,Narratives: A visualization to track narrative events as they develop,10.1109/VAST.2008.4677364,http://dx.doi.org/10.1109/VAST.2008.4677364,115,122,C,"Analyzing unstructured text streams can be challenging. One popular approach is to isolate specific themes in the text, and to visualize the connections between them. Some existing systems, like ThemeRiver, provide a temporal view of changes in themes; other systems, like In-Spire, use clustering techniques to help an analyst identify the themes at a single point in time. Narratives combines both of these techniques; it uses a temporal axis to visualize ways that concepts have changed over time, and introduces several methods to explore how those concepts relate to each other. Narratives is designed to help the user place news stories in their historical and social context by understanding how the major topics associated with them have changed over time. Users can relate articles through time by examining the topical keywords that summarize a specific news event. By tracking the attention to a news article in the form of references in social media (such as weblogs), a user discovers both important events and measures the social relevance of these stories.",Danyel Fisher;Aaron Hoff;George G. Robertson;Matthew Hurst,Danyel Fisher;Aaron Hoff;George Robertson;Matthew Hurst,"Microsoft Research, USA;Microsoft Research, USA;Microsoft Research, USA;Microsoft Live Labs, Switzerland",10.1109/INFVIS.2005.1532122;10.1109/INFVIS.1999.801851,"blogs, events, trends, time series, topic detection and tracking",46,22,16,
InfoVis,2010,Matching Visual Saliency to Confidence in Plots of Uncertain Data,10.1109/TVCG.2010.176,http://dx.doi.org/10.1109/TVCG.2010.176,980,989,J,"Conveying data uncertainty in visualizations is crucial for preventing viewers from drawing conclusions based on untrustworthy data points. This paper proposes a methodology for efficiently generating density plots of uncertain multivariate data sets that draws viewers to preattentively identify values of high certainty while not calling attention to uncertain values. We demonstrate how to augment scatter plots and parallel coordinates plots to incorporate statistically modeled uncertainty and show how to integrate them with existing multivariate analysis techniques, including outlier detection and interactive brushing. Computing high quality density plots can be expensive for large data sets, so we also describe a probabilistic plotting technique that summarizes the data without requiring explicit density plot computation. These techniques have been useful for identifying brain tumors in multivariate magnetic resonance spectroscopy data and we describe how to extend them to visualize ensemble data sets.",David Feng 0001;Lester Kwock;Yueh Z. Lee;Russell M. Taylor II,David Feng;Lester Kwock;Yueh Lee;Russell Taylor,UNC Chapel Hill;UNC Chapel Hill;UNC Chapel Hill;UNC Chapel Hill,10.1109/TVCG.2008.119;10.1109/INFVIS.2001.963286;10.1109/TVCG.2008.167;10.1109/TVCG.2009.179;10.1109/INFVIS.2002.1173145;10.1109/TVCG.2009.131;10.1109/VISUAL.1999.809866;10.1109/TVCG.2009.114;10.1109/TVCG.2006.170;10.1109/INFVIS.2004.3;10.1109/VISUAL.1994.346302;10.1109/TVCG.2008.153;10.1109/TVCG.2009.118,"Uncertainty visualization, brushing, scatter plots, parallel coordinates, multivariate data",46,39,39,
InfoVis,2011,Visual Thinking In Action: Visualizations As Used On Whiteboards,10.1109/TVCG.2011.251,http://dx.doi.org/10.1109/TVCG.2011.251,2508,2517,J,"While it is still most common for information visualization researchers to develop new visualizations from a data-or taskdriven perspective, there is growing interest in understanding the types of visualizations people create by themselves for personal use. As part of this recent direction, we have studied a large collection of whiteboards in a research institution, where people make active use of combinations of words, diagrams and various types of visuals to help them further their thought processes. Our goal is to arrive at a better understanding of the nature of visuals that are created spontaneously during brainstorming, thinking, communicating, and general problem solving on whiteboards. We use the qualitative approaches of open coding, interviewing, and affinity diagramming to explore the use of recognizable and novel visuals, and the interplay between visualization and diagrammatic elements with words, numbers and labels. We discuss the potential implications of our findings on information visualization design.",Jagoda Walny;Sheelagh Carpendale;Nathalie Henry Riche;Gina Venolia;Philip Fawcett,Jagoda Walny;Sheelagh Carpendale;Nathalie Henry Riche;Gina Venolia;Philip Fawcett,University of Calgary;University of Calgary / Microsoft Research;Microsoft Research;Microsoft Research;Microsoft Research,10.1109/TVCG.2010.144;10.1109/TVCG.2010.179;10.1109/TVCG.2006.156;10.1109/TVCG.2007.70535;10.1109/TVCG.2008.155;10.1109/INFVIS.2004.10;10.1109/INFVIS.2002.1173148;10.1109/VISUAL.1991.175815;10.1109/TVCG.2010.164,"Visualization, diagrams, whiteboards, observational study",46,32,51,
Vis,2011,GPU-based Real-Time Approximation of the Ablation Zone for Radiofrequency Ablation,10.1109/TVCG.2011.207,http://dx.doi.org/10.1109/TVCG.2011.207,1812,1821,J,"Percutaneous radiofrequency ablation (RFA) is becoming a standard minimally invasive clinical procedure for the treatment of liver tumors. However, planning the applicator placement such that the malignant tissue is completely destroyed, is a demanding task that requires considerable experience. In this work, we present a fast GPU-based real-time approximation of the ablation zone incorporating the cooling effect of liver vessels. Weighted distance fields of varying RF applicator types are derived from complex numerical simulations to allow a fast estimation of the ablation zone. Furthermore, the heat-sink effect of the cooling blood flow close to the applicator's electrode is estimated by means of a preprocessed thermal equilibrium representation of the liver parenchyma and blood vessels. Utilizing the graphics card, the weighted distance field incorporating the cooling blood flow is calculated using a modular shader framework, which facilitates the real-time visualization of the ablation zone in projected slice views and in volume rendering. The proposed methods are integrated in our software assistant prototype for planning RFA therapy. The software allows the physician to interactively place virtual RF applicator models. The real-time visualization of the corresponding approximated ablation zone facilitates interactive evaluation of the tumor coverage in order to optimize the applicator's placement such that all cancer cells are destroyed by the ablation.",Christian Rieder;Tim Kröger;Christian Schumann;Horst K. Hahn,Christian Rieder;Tim Kroeger;Christian Schumann;Horst K. Hahn,"Fraunhofer MEVIS;Fraunhofer MEVIS / CeVis, University of Bremen;Fraunhofer MEVIS;Fraunhofer MEVIS / Jacobs University Bremen",10.1109/TVCG.2010.208;10.1109/VISUAL.1998.745311;10.1109/VISUAL.2000.885694,"Radiofrequency ablation, ablation zone visualization, distance field, volume rendering, GPU, interaction",46,49,37,
SciVis,2013,Semi-Automatic Vortex Extraction in 4D PC-MRI Cardiac Blood Flow Data using Line Predicates,10.1109/TVCG.2013.189,http://dx.doi.org/10.1109/TVCG.2013.189,2773,2782,J,"Cardiovascular diseases (CVD) are the leading cause of death worldwide. Their initiation and evolution depends strongly on the blood flow characteristics. In recent years, advances in 4D PC-MRI acquisition enable reliable and time-resolved 3D flow measuring, which allows a qualitative and quantitative analysis of the patient-specific hemodynamics. Currently, medical researchers investigate the relation between characteristic flow patterns like vortices and different pathologies. The manual extraction and evaluation is tedious and requires expert knowledge. Standardized, (semi-)automatic and reliable techniques are necessary to make the analysis of 4D PC-MRI applicable for the clinical routine. In this work, we present an approach for the extraction of vortex flow in the aorta and pulmonary artery incorporating line predicates. We provide an extensive comparison of existent vortex extraction methods to determine the most suitable vortex criterion for cardiac blood flow and apply our approach to ten datasets with different pathologies like coarctations, Tetralogy of Fallot and aneurysms. For two cases we provide a detailed discussion how our results are capable to complement existent diagnosis information. To ensure real-time feedback for the domain experts we implement our method completely on the GPU.",Benjamin Köhler 0001;Rocco Gasteiger;Uta Preim;Holger Theisel;Matthias Gutberlet;Bernhard Preim,Benjamin Köhler;Rocco Gasteiger;Uta Preim;Holger Theisel;Matthias Gutberlet;Bernhard Preim,"Visualization and Visual Computing, University of Magdeburg;Visualization and Visual Computing, University of Magdeburg;Herzzentrum in Leipzig;Visualization and Visual Computing, University of Magdeburg;Herzzentrum in Leipzig;Visualization and Visual Computing, University of Magdeburg",10.1109/TVCG.2011.260;10.1109/VISUAL.1999.809869;10.1109/TVCG.2010.153;10.1109/VISUAL.1999.809896;10.1109/TVCG.2011.243;10.1109/TVCG.2007.70545;10.1109/VISUAL.2004.99;10.1109/TVCG.2010.173,"4D pc-mri, cardiac blood flow, hemodynamics, line predicates, vortex extraction",46,40,45,
VAST,2013,Space-Time Visual Analytics of Eye-Tracking Data for Dynamic Stimuli,10.1109/TVCG.2013.194,http://dx.doi.org/10.1109/TVCG.2013.194,2129,2138,J,"We introduce a visual analytics method to analyze eye movement data recorded for dynamic stimuli such as video or animated graphics. The focus lies on the analysis of data of several viewers to identify trends in the general viewing behavior, including time sequences of attentional synchrony and objects with strong attentional focus. By using a space-time cube visualization in combination with clustering, the dynamic stimuli and associated eye gazes can be analyzed in a static 3D representation. Shot-based, spatiotemporal clustering of the data generates potential areas of interest that can be filtered interactively. We also facilitate data drill-down: the gaze points are shown with density-based color mapping and individual scan paths as lines in the space-time cube. The analytical process is supported by multiple coordinated views that allow the user to focus on different aspects of spatial and temporal information in eye gaze data. Common eye-tracking visualization techniques are extended to incorporate the spatiotemporal characteristics of the data. For example, heat maps are extended to motion-compensated heat maps and trajectories of scan paths are included in the space-time visualization. Our visual analytics approach is assessed in a qualitative users study with expert users, which showed the usefulness of the approach and uncovered that the experts applied different analysis strategies supported by the system.",Kuno Kurzhals;Daniel Weiskopf,Kuno Kurzhals;Daniel Weiskopf,University of Stuttgart.;University of Stuttgart.,10.1109/TVCG.2010.149;10.1109/TVCG.2011.193;10.1109/TVCG.2012.276;10.1109/TVCG.2006.194,"Eye-tracking, space-time cube, dynamic areas of interest, spatiotemporal clustering, motion-compensated heat map",46,39,47,
VAST,2014,Finding Waldo: Learning about Users from their Interactions,10.1109/TVCG.2014.2346575,http://dx.doi.org/10.1109/TVCG.2014.2346575,1663,1672,J,"Visual analytics is inherently a collaboration between human and computer. However, in current visual analytics systems, the computer has limited means of knowing about its users and their analysis processes. While existing research has shown that a user's interactions with a system reflect a large amount of the user's reasoning process, there has been limited advancement in developing automated, real-time techniques that mine interactions to learn about the user. In this paper, we demonstrate that we can accurately predict a user's task performance and infer some user personality traits by using machine learning techniques to analyze interaction data. Specifically, we conduct an experiment in which participants perform a visual search task, and apply well-known machine learning algorithms to three encodings of the users' interaction data. We achieve, depending on algorithm and encoding, between 62% and 83% accuracy at predicting whether each user will be fast or slow at completing the task. Beyond predicting performance, we demonstrate that using the same techniques, we can infer aspects of the user's personality factors, including locus of control, extraversion, and neuroticism. Further analyses show that strong results can be attained with limited observation time: in one case 95% of the final accuracy is gained after a quarter of the average task completion time. Overall, our findings show that interactions can provide information to the computer about its human collaborator, and establish a foundation for realizing mixed-initiative visual analytics systems.",Eli T. Brown;Alvitta Ottley;Helen Zhao;Quan Lin;Richard Souvenir;Alex Endert;Remco Chang,Eli T Brown;Alvitta Ottley;Helen Zhao;Quan Lin;Richard Souvenir;Alex Endert;Remco Chang,Tufts U;Tufts U;Tufts U;Tufts U;U.N.C. Charlotte;Pacific Northwest National Lab;Tufts U,10.1109/TVCG.2012.204;10.1109/VAST.2010.5653587;10.1109/VAST.2009.5333020;10.1109/VAST.2012.6400486;10.1109/VISUAL.2005.1532788;10.1109/TVCG.2012.276;10.1109/VAST.2006.261436;10.1109/VAST.2008.4677352,"User Interactions, Analytic Provenance, Visualization, Applied Machine Learning",46,43,47,
VAST,2016,Patterns and Sequences: Interactive Exploration of Clickstreams to Understand Common Visitor Paths,10.1109/TVCG.2016.2598797,http://dx.doi.org/10.1109/TVCG.2016.2598797,321,330,J,"Modern web clickstream data consists of long, high-dimensional sequences of multivariate events, making it difficult to analyze. Following the overarching principle that the visual interface should provide information about the dataset at multiple levels of granularity and allow users to easily navigate across these levels, we identify four levels of granularity in clickstream analysis: patterns, segments, sequences and events. We present an analytic pipeline consisting of three stages: pattern mining, pattern pruning and coordinated exploration between patterns and sequences. Based on this approach, we discuss properties of maximal sequential patterns, propose methods to reduce the number of patterns and describe design considerations for visualizing the extracted sequential patterns and the corresponding raw sequences. We demonstrate the viability of our approach through an analysis scenario and discuss the strengths and limitations of the methods based on user feedback.",Zhicheng Liu;Yang Wang;Mira Dontcheva;Matthew Hoffman 0001;Seth Walker;Alan Wilson 0004,Zhicheng Liu;Yang Wang;Mira Dontcheva;Matthew Hoffman;Seth Walker;Alan Wilson,"Adobe Research;University of California, Davis;Adobe Research;Adobe Research;Adobe Research;Adobe Systems Inc.",10.1109/VAST.2010.5652910;10.1109/VAST.2010.5652926;10.1109/TVCG.2013.225;10.1109/TVCG.2013.200;10.1109/INFVIS.2005.1532152;10.1109/INFVIS.2000.885091;10.1109/TVCG.2014.2346574;10.1109/VAST.2007.4389008;10.1109/TVCG.2011.185;10.1109/VAST.2014.7042487;10.1109/TVCG.2015.2467622;10.1109/VAST.2012.6400494,event sequences;Clickstream Data;sequence mining;visual analytics,46,47,38,
Vis,1991,Span filtering: an optimization scheme for volume visualization of large finite element models,10.1109/VISUAL.1991.175780,http://dx.doi.org/10.1109/VISUAL.1991.175780,68,"75, 411",C,"Techniques for displaying 3D isovalues of scalar fields such as stress within a solid finite-element model generally involve examining each element for values of interest. An inexpensive, straightforward method is discussed for reducing the number of elements searched for such isovalues. It takes advantage of one traversal of the element data to yield a compact classification of the model by result values and ranges, with no sorting required. This data structure can then relate any scalar isovalue to a set of element groups which are closely inclusive of the isovalue. This method is intended for applications requiring repeated access to the analysis data, such as animation and interactive rendering of isosurfaces and scalar fields. While applicable to general volume visualization problems, it is particularly well suited to optimizing real-valued continuum field results such as those found in finite-element data.&lt;&lt;ETX&gt;&gt;",Richard S. Gallagher,R.S. Gallagher,"Swanson Analysis Systems Inc., Houston, PA, USA",10.1109/VISUAL.1990.146390,,45,25,21,
Vis,1997,Fast oriented line integral convolution for vector field visualization via the Internet,10.1109/VISUAL.1997.663897,http://dx.doi.org/10.1109/VISUAL.1997.663897,309,316,C,"Oriented line integral convolution (OLIC) illustrates flow fields by convolving a sparse texture with an anisotropic convolution kernel. The kernel is aligned to the underlying flow of the vector field. OLIC does not only show the direction of the flow but also its orientation. The paper presents fast rendering of oriented line integral convolution (FROLIC), which is approximately two orders of magnitude faster than OLIC. Costly convolution operations as done in OLIC are replaced in FROLIC by approximating a streamlet through a set of disks with varying intensity. The issue of overlapping streamlets is discussed. Two efficient animation techniques for animating FROLIC images are described. FROLIC has been implemented as a Java applet. This allows researchers from various disciplines (typically with inhomogenous hardware environments) to conveniently explore and investigate analytically defined 2D vector fields.",Rainer Wegenkittl;M. Eduard Gröller,R. Wegenkittl;E. Groller,"Inst. of Comput. Graphics, Wien Univ. of Technol., Austria",10.1109/VISUAL.1995.480817;10.1109/VISUAL.1994.346313;10.1109/VISUAL.1993.398850;10.1109/VISUAL.1996.567784;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1994.346312,,45,18,18,
Vis,1999,Time-critical Multiresolution Scene Rendering,10.1109/VISUAL.1999.809876,http://doi.ieeecomputersociety.org/10.1109/VISUAL.1999.809876,123,130,C,"We describe a framework for time-critical rendering of graphics scenes composed of a large number of objects having complex geometric descriptions. Our technique relies upon a scene description in which objects are represented as multiresolution meshes. We perform a constrained optimization at each frame to choose the resolution of each potentially visible object that generates the best quality image while meeting timing constraints. The technique provides smooth level-of-detail control and aims at guaranteeing a uniform, bounded frame rate even for widely changing viewing conditions. The optimization algorithm is independent from the particular data structure used to represent multiresolution meshes. The only requirements are the ability to represent a mesh with an arbitrary number of triangles and to traverse a mesh structure at an arbitrary resolution in a short predictable time. A data structure satisfying these criteria is described and experimental results are discussed.",Enrico Gobbetti;Eric Bouvier,E. Gobbetti;E. Bouvier,"Center for Adv. Studies, Cagliari, Italy",10.1109/VISUAL.1996.568126;10.1109/VISUAL.1998.745282,"multiresolution modeling,level of detail,adaptive rendering, time-critical graphics",45,11,0,
Vis,2001,Connectivity shapes,10.1109/VISUAL.2001.964504,http://dx.doi.org/10.1109/VISUAL.2001.964504,135,142,C,"We describe a method to visualize the connectivity graph of a mesh using a natural embedding in 3D space. This uses a 3D shape representation that is based solely on mesh connectivity: the connectivity shape. Given a connectivity, we define its natural geometry as a smooth embedding in space with uniform edge lengths and describe efficient techniques to compute it. Our main contribution is to demonstrate that a surprising amount of geometric information is implicit in the connectivity. We also show how to generate connectivity shapes that approximate given 3D shapes. Potential applications of connectivity shapes to modeling and mesh coding are described.",Martin Isenburg;Stefan Gumhold;Craig Gotsman,M. Isenburg;S. Gumhold;C. Gotsman,"North Carolina Univ., Chapel Hill, NC, USA",,"Natural embedding, mesh connectivity, implicit geometry, polygon meshes, shape compression",45,17,22,
Vis,2001,A tetrahedra-based stream surface algorithm,10.1109/VISUAL.2001.964506,http://dx.doi.org/10.1109/VISUAL.2001.964506,151,158,C,"This paper presents a new algorithm for the calculation of stream surfaces for tetrahedral grids. It propagates the surface through the tetrahedra, one at a time, calculating the intersections with the tetrahedral faces. The method allows us to incorporate topological information from the cells, e.g. critical points. The calculations are based on barycentric coordinates, since this simplifies the theory and the algorithm. The stream surfaces are ruled surfaces inside each cell, and their construction starts with line segments on the faces. Our method supports the analysis of velocity fields resulting from computational fluid dynamics (CFD) simulations.",Gerik Scheuermann;Tom Bobach;Hans Hagen;Karim Mahrous;Bernd Hamann;Kenneth I. Joy;Wolfgang Kollmann,G. Scheuermann;T. Bobach;H. Hagen;K. Mahrous;B. Hamann;K.I. Joy;W. Kollmann,"Dept. of Comput. Sci., Kaiserslautern Univ., Germany;Dept. of Comput. Sci., Kaiserslautern Univ., Germany;Dept. of Comput. Sci., Kaiserslautern Univ., Germany",10.1109/VISUAL.1993.398875;10.1109/VISUAL.1992.235211;10.1109/VISUAL.1995.485145;10.1109/VISUAL.1999.809896;10.1109/VISUAL.1997.663910,"vector field visualization, flow visualization, tetrahedral grid, unstructured grid, flow surface",45,22,13,
Vis,2001,Virtual Temporal Bone Dissection: A Case Study,10.1109/VISUAL.2001.964561,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2001.964561,497,500,C,"The Temporal Bone Dissection Simulator is an ongoing research project for the construction of a synthetic environment suitable for virtual dissection of human temporal bone and related anatomy. Funded by the National Institute on Deafness and Other Communication Disorders (NIDCD), the primary goal of this project is to provide a safe, robust, and cost-effective virtual environment for learning the anatomy and surgical procedures associated with the temporal bone. Direct volume visualization has been indispensable for the necessary level of realism and interactivity that is vital to the success of this project. This work is being conducted by the Ohio Supercomputer Center in conjunction with the Department of Otolaryngology at the Ohio State University, and NIDCD.",Jason Bryan;Don Stredney;Gregory J. Wiet;Dennis Sessanna,J. Bryan;D. Stredney;G. Wiet;D. Sessanna,"Ohio Supercomput. Center, OH, USA;Ohio Supercomput. Center, OH, USA",,Temporal Bone Dissection,45,11,22,
Vis,2002,Visibility-guided simplification,10.1109/VISUAL.2002.1183784,http://dx.doi.org/10.1109/VISUAL.2002.1183784,267,274,C,"For some graphics applications, object interiors and hard-to-see regions contribute little to the final images and need not be processed. In this paper, we define a view-independent visibility measure on mesh surfaces based on the visibility function between the surfaces and a surrounding sphere of cameras. We demonstrate the usefulness of this measure with a visibility-guided simplification algorithm. Mesh simplification reduces the polygon counts of 3D models and speeds up the rendering process. Many mesh simplification algorithms are based on sequences of edge collapses that minimize geometric and attribute errors. By combining the surface visibility measure with a geometric error measure, we obtain simplified models with improvement proportional to the number of low visibility regions in the original models.",Eugene Zhang;Greg Turk,E. Zhang;G. Turk,"GVU Center & Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;GVU Center & Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA",10.1109/VISUAL.1999.809869;10.1109/VISUAL.2000.885723,"Visualization, Visibility, Mesh Simplification, Rendering",45,15,28,
InfoVis,2004,"Evaluating a System for Interactive Exploration of Large, Hierarchically Structured Document Repositories",10.1109/INFVIS.2004.19,http://dx.doi.org/10.1109/INFVIS.2004.19,127,134,C,"The InfoSky visual explorer is a system enabling users to interactively explore large, hierarchically structured document collections. Similar to a real-world telescope, InfoSky employs a planar graphical representation with variable magnification. Documents of similar content are placed close to each other and displayed as stars, while collections of documents at a particular level in the hierarchy are visualised as bounding polygons. Usability testing of an early prototype implementation of InfoSky revealed several design issues which prevented users from fully exploiting the power of the visual metaphor. Evaluation results have been incorporated into an advanced prototype, and another usability test has been conducted. A comparison of test results demonstrates enhanced system performance and points out promising directions for further work",Michael Granitzer;Wolfgang Kienreich;Vedran Sabol;Keith Andrews;Werner Klieber,M. Granitzer;W. Kienreich;V. Sabol;K. Andrews;W. Klieber,Know-Center,10.1109/VISUAL.1996.567787;10.1109/INFVIS.1997.636718,"information visualisation, navigation, document retrieval, hierarchical repositories, knowledge management, information management, force-directed placement, Voronoi",45,19,23,
Vis,2004,Visualization of intricate flow structures for vortex breakdown analysis,10.1109/VISUAL.2004.113,http://dx.doi.org/10.1109/VISUAL.2004.113,187,194,C,"Vortex breakdowns and flow recirculation are essential phenomena in aeronautics where they appear as a limiting factor in the design of modern aircrafts. Because of the inherent intricacy of these features, standard flow visualization techniques typically yield cluttered depictions. The paper addresses the challenges raised by the visual exploration and validation of two CFD simulations involving vortex breakdown. To permit accurate and insightful visualization we propose a new approach that unfolds the geometry of the breakdown region by letting a plane travel through the structure along a curve. We track the continuous evolution of the associated projected vector field using the theoretical framework of parametric topology. To improve the understanding of the spatial relationship between the resulting curves and lines we use direct volume rendering and multidimensional transfer functions for the display of flow-derived scalar quantities. This enriches the visualization and provides an intuitive context for the extracted topological information. Our results offer clear, synthetic depictions that permit new insight into the structural properties of vortex breakdowns.",Xavier Tricoche;Christoph Garth;Gordon L. Kindlmann;Eduard Deines;Gerik Scheuermann;Markus Rütten;Charles D. Hansen,X. Tricoche;C. Garth;G. Kindlmann;E. Deines;G. Scheuermann;M. Ruetten;C. Hansen,"Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.2001.964519;10.1109/VISUAL.1998.745296;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1997.663910;10.1109/VISUAL.1999.809896;10.1109/VISUAL.2003.1250414;10.1109/VISUAL.2003.1250376;10.1109/VISUAL.2001.964489;10.1109/VISUAL.1993.398875;10.1109/VISUAL.1991.175789;10.1109/VISUAL.1994.346314,"flow visualization, vortex analysis, parametric topology, cutting planes, volume rendering",45,29,32,
Vis,2004,Exploration of the brain's white matter pathways with dynamic queries,10.1109/VISUAL.2004.30,http://dx.doi.org/10.1109/VISUAL.2004.30,377,384,C,"Diffusion tensor imaging (DTI) is a magnetic resonance imaging method that can be used to measure local information about the structure of white matter within the human brain. Combining DTI data with the computational methods of MR tractography, neuroscientists can estimate the locations and sizes of nerve bundles (white matter pathways) that course through the human brain. Neuroscientists have used visualization techniques to better understand tractography data, but they often struggle with the abundance and complexity of the pathways. We describe a novel set of interaction techniques that make it easier to explore and interpret such pathways. Specifically, our application allows neuroscientists to place and interactively manipulate box-shaped regions (or volumes of interest) to selectively display pathways that pass through specific anatomical areas. A simple and flexible query language allows for arbitrary combinations of these queries using Boolean logic operators. Queries can be further restricted by numerical path properties such as length, mean fractional anisotropy, and mean curvature. By precomputing the pathways and their statistical properties, we obtain the speed necessary for interactive question-and-answer sessions with brain researchers. We survey some questions that researchers have been asking about tractography data and show how our system can be used to answer these questions efficiently.",David Akers;Anthony J. Sherbondy;Rachel Mackenzie;Robert F. Dougherty;Brian A. Wandell,D. Akers;A. Sherbondy;R. Mackenzie;R. Dougherty;B. Wandell,"Stanford Univ., CA, USA;Stanford Univ., CA, USA;Stanford Univ., CA, USA;Stanford Univ., CA, USA;Stanford Univ., CA, USA",10.1109/VISUAL.1999.809894;10.1109/VISUAL.1999.809886;10.1109/VISUAL.2002.1183799,"Visualization, DTI, MR Tractography",45,12,28,
InfoVis,2005,Dig-CoLa: directed graph layout through constrained energy minimization,10.1109/INFVIS.2005.1532130,http://dx.doi.org/10.1109/INFVIS.2005.1532130,65,72,C,"We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high performance force directed placement (FDP) algorithm so that the directed nature of the graph is highlighted while useful properties of FDP - such as emphasis of symmetries and preservation of proximity relations - are retained. Our algorithm automatically identifies those parts of the digraph that contain hierarchical information and draws them accordingly. Additionally, those parts that do not contain hierarchy are drawn at the same quality expected from a nonhierarchical, undirected layout algorithm. An interesting application of our algorithm is directional multidimensional scaling (DMDS). DMDS deals with low dimensional embedding of multivariate data where we want to emphasize the overall flow in the data (e.g. chronological progress) along one of the axes.",Tim Dwyer;Yehuda Koren,T. Dwyer;Y. Koren,"Sch. of Comput. Sci. & Software Eng., Monash Univ., Australia",,,45,9,25,BP
Vis,2006,Hybrid Visualization for White Matter Tracts using Triangle Strips and Point Sprites,10.1109/TVCG.2006.151,http://dx.doi.org/10.1109/TVCG.2006.151,1181,1188,J,"Diffusion tensor imaging is of high value in neurosurgery, providing information about the location of white matter tracts in the human brain. For their reconstruction, streamline techniques commonly referred to as fiber tracking model the underlying fiber structures and have therefore gained interest. To meet the requirements of surgical planning and to overcome the visual limitations of line representations, a new real-time visualization approach of high visual quality is introduced. For this purpose, textured triangle strips and point sprites are combined in a hybrid strategy employing GPU programming. The triangle strips follow the fiber streamlines and are textured to obtain a tube-like appearance. A vertex program is used to orient the triangle strips towards the camera. In order to avoid triangle flipping in case of fiber segments where the viewing and segment direction are parallel, a correct visual representation is achieved in these areas by chains of point sprites. As a result, high quality visualization similar to tubes is provided allowing for interactive multimodal inspection. Overall, the presented approach is faster than existing techniques of similar visualization quality and at the same time allows for real-time rendering of dense bundles encompassing a high number of fibers, which is of high importance for diagnosis and surgical planning",Dorit Merhof;Markus Sonntag;Frank Enders;Christopher Nimsky;Peter Hastreiter;Günther Greiner,Dorit Merhof;Markus Sonntag;Frank Enders;Christopher Nimsky;Peter Hastreiter;Guenther Greiner,"Computer Graphics Group, Univ. Erlangen, and Dept. of Neurosurgery, Univ. Erlangen;Computer Graphics Group, Univ. Erlangen;Computer Graphics Group, Univ. Erlangen, and Dept. of Neurosurgery, Univ. Erlangen;Dept. of Neurosurgery, Univ. Erlangen;Computer Graphics Group, Univ. Erlangen, and Dept. of Neurosurgery, Univ. Erlangen;Computer Graphics Group, Univ. Erlangen",10.1109/VISUAL.2005.1532859;10.1109/VISUAL.2005.1532772;10.1109/VISUAL.2002.1183799;10.1109/VISUAL.2005.1532773;10.1109/VISUAL.2005.1532778;10.1109/VISUAL.1996.567777;10.1109/VISUAL.2005.1532779;10.1109/VISUAL.2004.30,"Diffusion tensor data, fiber tracking, streamline visualization",45,32,40,
Vis,2007,Interactive sound rendering in complex and dynamic scenes using frustum tracing,10.1109/TVCG.2007.70567,http://dx.doi.org/10.1109/TVCG.2007.70567,1672,1679,J,"We present a new approach for real-time sound rendering in complex, virtual scenes with dynamic sources and objects. Our approach combines the efficiency of interactive ray tracing with the accuracy of tracing a volumetric representation. We use a four-sided convex frustum and perform clipping and intersection tests using ray packet tracing. A simple and efficient formulation is used to compute secondary frusta and perform hierarchical traversal. We demonstrate the performance of our algorithm in an interactive system for complex environments and architectural models with tens or hundreds of thousands of triangles. Our algorithm can perform real-time simulation and rendering on a high-end PC.",Christian Lauterbach;Anish Chandak;Dinesh Manocha,Christian Lauterbach;Anish Chandak;Dinesh Manocha,"Department of Computer Science, Campus Box 3175, Sitterson Hall, University of North Carolina-Chapel Hill, Chapel Hill, NC 27599;Department of Computer Science, Campus Box 3175, Sitterson Hall, University of North Carolina-Chapel Hill, Chapel Hill, NC 27599;Department of Computer Science, Campus Box 3175, Sitterson Hall, University of North Carolina-Chapel Hill, Chapel Hill, NC 27599",10.1109/TVCG.2006.125;10.1109/VISUAL.2005.1532790,"Acoustic propagation,Interactive systems",45,25,48,
VAST,2008,Entity-based collaboration tools for intelligence analysis,10.1109/VAST.2008.4677362,http://dx.doi.org/10.1109/VAST.2008.4677362,99,106,C,"Software tools that make it easier for analysts to collaborate as a natural part of their work will lead to better analysis that is informed by more perspectives. We are interested to know if software tools can be designed that support collaboration even as they allow analysts to find documents and organize information (including evidence, schemas, and hypotheses). We have modified the Entity Workspace system, described previously, to test such designs. We have evaluated the resulting design in both a laboratory study and a study where it is situated with an analysis team. In both cases, effects on collaboration appear to be positive. Key aspects of the design include an evidence notebook optimized for organizing entities (rather than text characters), information structures that can be collapsed and expanded, visualization of evidence that emphasizes events and documents (rather than emphasizing the entity graph), and a notification system that finds entities of mutual interest to multiple analysts.",Eric A. Bier;Stuart K. Card;John W. Bodnar,Eric A. Bier;Stuart K. Card;John W. Bodnar,"Palo Alto Research Center, Inc., 3333 Coyote Hill Road, California, 94304, USA;Palo Alto Research Center, Inc., 3333 Coyote Hill Road, California, 94304, USA;Science Applications International Corporation, 1710 SAIC Drive, McLean, VA 22102, USA",10.1109/VAST.2006.261427;10.1109/VAST.2007.4389006,"sensemaking, information foraging, collective intelligence, exploratory search, information workspace, entity-based, collaboration, intelligence analysis, visualization, semantic notebook, argumentation marshalling, visual analytics",45,29,17,BP
Vis,2008,Hypothesis Generation in Climate Research with Interactive Visual Data Exploration,10.1109/TVCG.2008.139,http://dx.doi.org/10.1109/TVCG.2008.139,1579,1586,J,"One of the most prominent topics in climate research is the investigation, detection, and allocation of climate change. In this paper, we aim at identifying regions in the atmosphere (e.g., certain height layers) which can act as sensitive and robust indicators for climate change. We demonstrate how interactive visual data exploration of large amounts of multi-variate and time-dependent climate data enables the steered generation of promising hypotheses for subsequent statistical evaluation. The use of new visualization and interaction technology-in the context of a coordinated multiple views framework-allows not only to identify these promising hypotheses, but also to efficiently narrow down parameters that are required in the process of computational data analysis. Two datasets, namely an ECHAM5 climate model run and the ERA-40 reanalysis incorporating observational data, are investigated. Higher-order information such as linear trends or signal-to-noise ratio is derived and interactively explored in order to detect and explore those regions which react most sensitively to climate change. As one conclusion from this study, we identify an excellent potential for usefully generalizing our approach to other, similar application cases, as well.",Johannes Kehrer;Florian Ladstädter;Philipp Muigg;Helmut Doleisch;Andrea K. Steiner;Helwig Hauser,Johannes Kehrer;Florian Ladstädter;Philipp Muigg;Helmut Doleisch;Andrea Steiner;Helwig Hauser,"Department of Informatics, University of Bergen, Norway;Wegener Center for Climate and Global Change (WegCenter) and Institute for Geophysics, Astrophysics, and Meteorology (IGAM), University of Graz, Austria;VRVis Research Center and SimVis GmbH, Vienna, Austria;VRVis Research Center and SimVis GmbH, Vienna, Austria;Wegener Center for Climate and Global Change (WegCenter) and Institute for Geophysics, Astrophysics, and Meteorology (IGAM), University of Graz, Austria;Department of Informatics, University of Bergen, Norway",10.1109/INFVIS.2005.1532138;10.1109/VISUAL.1994.346302;10.1109/VISUAL.2005.1532850;10.1109/TVCG.2006.170,"Interactive visual hypothesis generation, interactive visual exploration and analysis, visualization for climate research",45,41,29,
Vis,2008,Invariant Crease Lines for Topological and Structural Analysis of Tensor fields,10.1109/TVCG.2008.148,http://dx.doi.org/10.1109/TVCG.2008.148,1627,1634,J,"We introduce a versatile framework for characterizing and extracting salient structures in three-dimensional symmetric second-order tensor fields. The key insight is that degenerate lines in tensor fields, as defined by the standard topological approach, are exactly crease (ridge and valley) lines of a particular tensor invariant called mode. This reformulation allows us to apply well-studied approaches from scientific visualization or computer vision to the extraction of topological lines in tensor fields. More generally, this main result suggests that other tensor invariants, such as anisotropy measures like fractional anisotropy (FA), can be used in the same framework in lieu of mode to identify important structural properties in tensor fields. Our implementation addresses the specific challenge posed by the non-linearity of the considered scalar measures and by the smoothness requirement of the crease manifold computation. We use a combination of smooth reconstruction kernels and adaptive refinement strategy that automatically adjust the resolution of the analysis to the spatial variation of the considered quantities. Together, these improvements allow for the robust application of existing ridge line extraction algorithms in the tensor context of our problem. Results are proposed for a diffusion tensor MRI dataset, and for a benchmark stress tensor field used in engineering research.",Xavier Tricoche;Gordon L. Kindlmann;Carl-Fredrik Westin,Xavier Tricoche;Gordon Kindlmann;Carl-Fredrik Westin,"Purdue University;Brigham and Women's Hospital, Harvard Medical School;Brigham and Women's Hospital, Harvard Medical School",10.1109/VISUAL.2004.105;10.1109/TVCG.2007.70602;10.1109/VISUAL.1999.809896;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1994.346326;10.1109/VISUAL.1994.346326;10.1109/VISUAL.1990.146359;10.1109/TVCG.2007.70554,"Tensor fields, tensor invariants, ridge lines, crease extraction, structural analysis, topology",45,40,43,
Vis,2008,Revisiting Histograms and Isosurface Statistics,10.1109/TVCG.2008.160,http://dx.doi.org/10.1109/TVCG.2008.160,1659,1666,J,"Recent results have shown a link between geometric properties of isosurfaces and statistical properties of the underlying sampled data. However, this has two defects: not all of the properties described converge to the same solution, and the statistics computed are not always invariant under isosurface-preserving transformations. We apply Federer's Coarea Formula from geometric measure theory to explain these discrepancies. We describe an improved substitute for histograms based on weighting with the inverse gradient magnitude, develop a statistical model that is invariant under isosurface-preserving transformations, and argue that this provides a consistent method for algorithm evaluation across multiple datasets based on histogram equalization. We use our corrected formulation to reevaluate recent results on average isosurface complexity, and show evidence that noise is one cause of the discrepancy between the expected figure and the observed one.",Carlos Scheidegger;John M. Schreiner;Brian Duffy;Hamish A. Carr;Cláudio T. Silva,Carlos E. Scheidegger;John M. Schreiner;Brian Duffy;Hamish Carr;Cláudio T. Silva,,10.1109/TVCG.2006.168;10.1109/TVCG.2008.119;10.1109/VISUAL.2001.964519;10.1109/VISUAL.2001.964515;10.1109/VISUAL.1997.663875;10.1109/VISUAL.2001.964516,"Isosurfaces, Histograms, Coarea Formula",45,34,17,
VAST,2009,"What's being said near ""Martha""? Exploring name entities in literary text collections",10.1109/VAST.2009.5333248,http://dx.doi.org/10.1109/VAST.2009.5333248,107,114,C,"A common task in literary analysis is to study characters in a novel or collection. Automatic entity extraction, text analysis and effective user interfaces facilitate character analysis. Using our interface, called POSvis, the scholar uses word clouds and self-organizing graphs to review vocabulary, to filter by part of speech, and to explore the network of characters located near characters under review. Further, visualizations show word usages within an analysis window (i.e. a book chapter), which can be compared with a reference window (i.e. the whole book). We describe the interface and report on an early case study with a humanities scholar.",Romain Vuillemot;Tanya E. Clement;Catherine Plaisant;Amit Kumar,Romain Vuillemot;Tanya Clement;Catherine Plaisant;Amit Kumar,"Université de Lyon, France;University of Maryland, USA;University of Maryland, USA;University of Illinois, Urbana Champaign, USA",10.1109/TVCG.2008.172;10.1109/TVCG.2007.70577;10.1109/VAST.2008.4677359;10.1109/VAST.2007.4389004;10.1109/VAST.2007.4389006,"Visual Analytics, Design, Experimentation, Human Factors",45,25,19,
InfoVis,2010,SignalLens: Focus+Context Applied to Electronic Time Series,10.1109/TVCG.2010.193,http://dx.doi.org/10.1109/TVCG.2010.193,900,907,J,"Electronic test and measurement systems are becoming increasingly sophisticated in order to match the increased complexity and ultra-high speed of the devices under test. A key feature in many such instruments is a vastly increased capacity for storage of digital signals. Storage of 109 time points or more is now possible. At the same time, the typical screens on such measurement devices are relatively small. Therefore, these instruments can only render an extremely small fraction of the complete signal at any time. SignalLens uses a Focus+Context approach to provide a means of navigating to and inspecting low-level signal details in the context of the entire signal trace. This approach provides a compact visualization suitable for embedding into the small displays typically provided by electronic measurement instruments. We further augment this display with computed tracks which display time-aligned computed properties of the signal. By combining and filtering these computed tracks it is possible to easily and quickly find computationally detected features in the data which are often obscured by the visual compression required to render the large data sets on a small screen. Further, these tracks can be viewed in the context of the entire signal trace as well as visible high-level signal features. Several examples using real-world electronic measurement data are presented, which demonstrate typical use cases and the effectiveness of the design.",Robert Kincaid,Robert Kincaid,Agilent Laboratories,10.1109/VAST.2009.5333895,"Focus+Context, Lens, Test and Measurement, Electronic Signal, Signal Processing ",45,36,26,HM
InfoVis,2010,Uncovering Strengths and Weaknesses of Radial Visualizations---an Empirical Approach,10.1109/TVCG.2010.209,http://dx.doi.org/10.1109/TVCG.2010.209,935,942,J,"Radial visualizations play an important role in the information visualization community. But the decision to choose a radial coordinate system is rather based on intuition than on scientific foundations. The empirical approach presented in this paper aims at uncovering strengths and weaknesses of radial visualizations by comparing them to equivalent ones in Cartesian coordinate systems. We identified memorizing positions of visual elements as a generic task when working with visualizations. A first study with 674 participants provides a broad data spectrum for exploring differences between the two visualization types. A second, complementing study with fewer participants focuses on further questions raised by the first study. Our findings document that Cartesian visualizations tend to outperform their radial counterparts especially with respect to answer times. Nonetheless, radial visualization seem to be more appropriate for focusing on a particular data dimension.",Stephan Diehl 0001;Fabian Beck 0001;Michael Burch,Stephan Diehl;Fabian Beck;Michael Burch,University of Trier;University of Trier;University of Stuttgart,10.1109/INFVIS.2004.70;10.1109/INFVIS.2001.963291;10.1109/VISUAL.1997.663916;10.1109/INFVIS.2001.963291,"Radial visualization, user study, visual memory",45,33,19,
InfoVis,2012,A User Study on Curved Edges in Graph Visualization,10.1109/TVCG.2012.189,http://dx.doi.org/10.1109/TVCG.2012.189,2449,2456,J,"Recently there has been increasing research interest in displaying graphs with curved edges to produce more readable visualizations. While there are several automatic techniques, little has been done to evaluate their effectiveness empirically. In this paper we present two experiments studying the impact of edge curvature on graph readability. The goal is to understand the advantages and disadvantages of using curved edges for common graph tasks compared to straight line segments, which are the conventional choice for showing edges in node-link diagrams. We included several edge variations: straight edges, edges with different curvature levels, and mixed straight and curved edges. During the experiments, participants were asked to complete network tasks including determination of connectivity, shortest path, node degree, and common neighbors. We also asked the participants to provide subjective ratings of the aesthetics of different edge types. The results show significant performance differences between the straight and curved edges and clear distinctions between variations of curved edges.",Kai Xu 0003;Chris Rooney;Peter J. Passmore;Dong-Han Ham;Phong H. Nguyen,Kai Xu;Chris Rooney;Peter Passmore;Dong-Han Ham;Phong H. Nguyen,Middlesex University;Middlesex University;Middlesex University;Chonnam National University;Middlesex University,10.1109/TVCG.2011.233;10.1109/INFVIS.2002.1173155;10.1109/TVCG.2006.147;10.1109/INFVIS.2005.1532136;10.1109/INFVIS.2005.1532131;10.1109/INFVIS.2003.1249008;10.1109/TVCG.2006.166,"Graph, visualization, curved edges, evaluation",45,30,35,
InfoVis,2014,"Overview: The Design, Adoption, and Analysis of a Visual Document Mining Tool for Investigative Journalists",10.1109/TVCG.2014.2346431,http://dx.doi.org/10.1109/TVCG.2014.2346431,2271,2280,J,"For an investigative journalist, a large collection of documents obtained from a Freedom of Information Act request or a leak is both a blessing and a curse: such material may contain multiple newsworthy stories, but it can be difficult and time consuming to find relevant documents. Standard text search is useful, but even if the search target is known it may not be possible to formulate an effective query. In addition, summarization is an important non-search task. We present Overview, an application for the systematic analysis of large document collections based on document clustering, visualization, and tagging. This work contributes to the small set of design studies which evaluate a visualization system “in the wild”, and we report on six case studies where Overview was voluntarily used by self-initiated journalists to produce published stories. We find that the frequently-used language of “exploring” a document collection is both too vague and too narrow to capture how journalists actually used our application. Our iterative process, including multiple rounds of deployment and observations of real world usage, led to a much more specific characterization of tasks. We analyze and justify the visual encoding and interaction techniques used in Overview's design with respect to our final task abstractions, and propose generalizable lessons for visualization design methodology.",Matthew Brehmer;Stephen Ingram;Jonathan Stray;Tamara Munzner,Matthew Brehmer;Stephen Ingram;Jonathan Stray;Tamara Munzner,University of British Columbia;University of British Columbia;Columbia Journalism School and the Associated Press;University of British Columbia,10.1109/TVCG.2009.127;10.1109/INFVIS.2004.19;10.1109/TVCG.2012.224;10.1109/TVCG.2012.213;10.1109/TVCG.2012.260;10.1109/TVCG.2009.140;10.1109/TVCG.2013.162;10.1109/TVCG.2013.153;10.1109/TVCG.2009.148;10.1109/TVCG.2013.124;10.1109/TVCG.2011.239;10.1109/VAST.2010.5652940;10.1109/TVCG.2011.209,"Design study, investigative journalism, task and requirements analysis, text and document data, text analysis",45,27,53,
InfoVis,2014,An Algebraic Process for Visualization Design,10.1109/TVCG.2014.2346325,http://dx.doi.org/10.1109/TVCG.2014.2346325,2181,2190,J,"We present a model of visualization design based on algebraic considerations of the visualization process. The model helps characterize visual encodings, guide their design, evaluate their effectiveness, and highlight their shortcomings. The model has three components: the underlying mathematical structure of the data or object being visualized, the concrete representation of the data in a computer, and (to the extent possible) a mathematical description of how humans perceive the visualization. Because we believe the value of our model lies in its practical application, we propose three general principles for good visualization design. We work through a collection of examples where our model helps explain the known properties of existing visualizations methods, both good and not-so-good, as well as suggesting some novel methods. We describe how to use the model alongside experimental user studies, since it can help frame experiment outcomes in an actionable manner. Exploring the implications and applications of our model and its design principles should provide many directions for future visualization research.",Gordon L. Kindlmann;Carlos Scheidegger,Gordon Kindlmann;Carlos Scheidegger,University of Chicago;University of Arizona,10.1109/TVCG.2013.173;10.1109/INFVIS.1999.801860;10.1109/TVCG.2010.132;10.1109/TVCG.2010.199;10.1109/VISUAL.1996.568118;10.1109/TVCG.2013.124;10.1109/TVCG.2009.125;10.1109/TVCG.2009.111;10.1109/TVCG.2007.70594;10.1109/TVCG.2013.119;10.1109/INFVIS.2003.1249005;10.1109/INFVIS.2004.59;10.1109/VISUAL.1996.567784;10.1109/TVCG.2013.126;10.1109/TVCG.2008.121;10.1109/TVCG.2012.230;10.1109/TVCG.2010.161,"Visualization Design, Symmetries, Visualization Theory",45,41,63,HM
Vis,1992,Interactive splatting of nonrectilinear volumes,10.1109/VISUAL.1992.235228,http://dx.doi.org/10.1109/VISUAL.1992.235228,37,44,C,"Various techniques are described for achieving interactive direct volume rendering of nonrectilinear data sets using fast projection (splatting) methods. The use of graphics hardware, rendering approximations, parallelization and reduced resolution meshes are discussed. Results from the use of these techniques are presented in the form of color photos and comparative timings.&lt;&lt;ETX&gt;&gt;",Peter L. Williams,P.L. Williams,"Nat. Center for Supercomput. Applications, Illinois Univ., Urbana, IL, USA",10.1109/VISUAL.1991.175818,,44,24,27,
Vis,1993,Interactive visualization methods for four dimensions,10.1109/VISUAL.1993.398869,http://dx.doi.org/10.1109/VISUAL.1993.398869,196,203,C,"Making accurate computer graphics representations of surfaces and volumes (2-manifolds and 3-manifolds) embedded in four-dimensional space typically involves complex and time-consuming computations. In order to make simulated worlds that help develop human intuition about the fourth dimensions, we need techniques that permit real-time, interactive manipulation of the most sophisticated depictions available. We propose the following new methods that bring us significantly closer to this goal: an approach to high-speed 4D illuminated surface rendering incorporating 4D shading and occlusion coding; a procedure for rapidly generating 2D screen images of tessellated 3-manifolds illuminated by 4D light. These methods are orders of magnitude faster than previous approaches, enabling the real-time manipulation of high-resolution 4D images on commercial graphics hardware.&lt;&lt;ETX&gt;&gt;",Andrew J. Hanson;Robert A. Cross,A.J. Hanson;R.A. Cross,"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA;Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA",10.1109/VISUAL.1991.175821;10.1109/VISUAL.1992.235222,,44,21,9,
Vis,1995,Interactive maximum projection volume rendering,10.1109/VISUAL.1995.480790,http://dx.doi.org/10.1109/VISUAL.1995.480790,11,"18, 433",C,"Maximum projection is a volume rendering technique that, for each pixel, finds the maximum intensity along a projector. For certain important classes of data, this is an approximation to summation rendering which produces superior visualizations. We show how maximum projection rendering with additional depth cues can be implemented using simple affine transformations in object space. This technique can be used together with 3D graphics libraries and standard graphics hardware, thus allowing interactive manipulations of the volume data. The algorithm presented allows for a wide range of tradeoffs between interactivity and image quality.",Michael D. McCool;Wolfgang Heidrich;John Stevens,W. Heidrich;M. McCool;J. Stevens,"Comput. Graphics Lab., Waterloo Univ., Ont., Canada",,,44,20,17,
Vis,1997,Computing the separating surface for segmented data,10.1109/VISUAL.1997.663887,http://dx.doi.org/10.1109/VISUAL.1997.663887,229,233,C,"An algorithm for computing a triangulated surface which separates a collection of data points that have been segmented into a number of different classes is presented. The problem generalizes the concept of an isosurface which separates data points that have been segmented into only two classes: those for which data function values are above the threshold and those which are below the threshold value. The algorithm is very simple, easy to implement and applies without limit to the number of classes.",Gregory M. Nielson;Richard Franke,G.M. Nielson;R. Franke,"Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA",10.1109/VISUAL.1991.175782,,44,27,5,
InfoVis,1999,3D interactive visualization for inter-cell dependencies of spreadsheets,10.1109/INFVIS.1999.801861,http://dx.doi.org/10.1109/INFVIS.1999.801861,79,"82, 148",C,"This paper proposes a new technique to visualize dependencies among cells in a spreadsheet. In this way, the system firstly visualizes a spreadsheet on a plane in three-dimensional space, and draws arcs between interrelated cells. By allowing a user to select an arbitrary cell and lift it up with direct manipulation, the system utilizes the third dimension to ameliorate visual occlusion of crossing arcs. As the user lifts a focused cell up, the interrelated cells are lifted up together; thus hidden dataflow networks can be visually intelligible interactively. Because spreadsheets are aimed at calculation itself rather than appearances of outputs, their mechanism is relatively invisible and not obvious for ordinary users. Our visualization helps such users to understand structures and mechanism of spreadsheets.",Hidekazu Shiozawa;Ken-ichi Okada;Yutaka Matsushita,H. Shiozawa;K. Okada;Y. Matsushita,"Dept. of Inf. & Comput. Sci., Keio Univ., Yokohama, Japan",10.1109/INFVIS.1997.636761,"information visualization, 3D user interfaces, spreadsheets, inter-cell dependencies, lifting-up operation, Natto View",44,9,15,
Vis,2000,A spreadsheet interface for visualization exploration,10.1109/VISUAL.2000.885678,http://dx.doi.org/10.1109/VISUAL.2000.885678,69,76,C,"As the size and complexity of data sets continues to increase, the development of user interfaces and interaction techniques that expedite the process of exploring that data must receive new attention. Regardless of the speed of rendering, it is important to coherently organize the visual process of exploration: this information both grants insights about the data to a user and can be used by collaborators to understand the results. To fulfil these needs, we present a spreadsheet-like interface to data exploration. The interface displays a 2-dimensional window into visualization parameter space which users manipulate as they search for desired results. Through tabular organization and a clear correspondence between parameters and results, the interface eases the discovery, comparison and analysis of the underlying data. Users can utilize operators and the integrated interpreter to further explore and automate the visualization process; using a method introduced in this paper, these operations can be applied to cells in different stacks of the interface. Via illustrations using a variety of data sets, we demonstrate the efficacy of this novel interface.",T. J. Jankun-Kelly;Kwan-Liu Ma,T.J. Jankun-Kelly;Kwan-Liu Ma,"Dept. of Comput. Sci., California Univ., Davis, CA, USA",10.1109/VISUAL.1999.809871;10.1109/VISUAL.1995.480821,"speadsheets, user interfaces, knowledge representation, scientific visualization, visualization systems, volume rendering",44,20,19,
Vis,2005,Illuminated lines revisited,10.1109/VISUAL.2005.1532772,http://dx.doi.org/10.1109/VISUAL.2005.1532772,19,26,C,"For the rendering of vector and tensor fields, several texture-based volumetric rendering methods were presented in recent years. While they have indisputable merits, the classical vertex-based rendering of integral curves has the advantage of better zooming capabilities as it is not bound to a fixed resolution. It has been shown that lighting can improve spatial perception of lines significantly, especially if lines appear in bundles. Although OpenGL does not directly support lighting of lines, fast rendering of illuminated lines can be achieved by using basic texture mapping. This existing technique is based on a maximum principle which gives a good approximation of specular reflection. Diffuse reflection however is essentially limited to bidirectional lights at infinity. We show how the realism can be further increased by improving diffuse reflection. We present simplified expressions for the Phong/Blinn lighting of infinitesimally thin cylindrical tubes. Based on these, we propose a fast rendering technique with diffuse and specular reflection for orthographic and perspective views and for multiple local and infinite lights. The method requires commonly available programmable vertex and fragment shaders and only two-dimensional lookup textures.",Ovidio Mallo;Ronald Peikert;Christian Sigg;Filip Sadlo,O. Mallo;R. Peikert;C. Sigg;F. Sadlo,"Eidgenossische Tech. Hochschule, Zurich, Switzerland;Eidgenossische Tech. Hochschule, Zurich, Switzerland;Eidgenossische Tech. Hochschule, Zurich, Switzerland;Eidgenossische Tech. Hochschule, Zurich, Switzerland",10.1109/VISUAL.2004.5;10.1109/VISUAL.2003.1250378;10.1109/VISUAL.2002.1183797;10.1109/VISUAL.1996.567777;10.1109/VISUAL.1997.663912,"Field lines, illumination, vector field visualization,texture mapping, graphics hardware",44,29,17,
Vis,2005,HOT-lines: tracking lines in higher order tensor fields,10.1109/VISUAL.2005.1532773,http://dx.doi.org/10.1109/VISUAL.2005.1532773,27,34,C,"Tensors occur in many areas of science and engineering. Especially, they are used to describe charge, mass and energy transport (i.e. electrical conductivity tensor, diffusion tensor, thermal conduction tensor resp.) If the locale transport pattern is complicated, usual second order tensor representation is not sufficient. So far, there are no appropriate visualization methods for this case. We point out similarities of symmetric higher order tensors and spherical harmonics. A spherical harmonic representation is used to improve tensor glyphs. This paper unites the definition of streamlines and tensor lines and generalizes tensor lines to those applications where second order tensors representations fail. The algorithm is tested on the tractography problem in diffusion tensor magnetic resonance imaging (DT-MRI) and improved for this special application.",Mario Hlawitschka;Gerik Scheuermann,M. Hlawitschka;G. Scheuermann,"Inst. for Comput. Sci., Leipzig Univ., Germany;Inst. for Comput. Sci., Leipzig Univ., Germany",10.1109/VISUAL.2004.105;10.1109/VISUAL.1992.235193;10.1109/VISUAL.2000.885716;10.1109/VISUAL.2002.1183797;10.1109/VISUAL.1994.346326,"Higher order tensors, spherical harmonics, tensor lines, tractography, vector/tensor visualization, visualization in medicine, DT-MRI",44,13,34,
VAST,2006,Enhancing Visual Analysis of Network Traffic Using a Knowledge Representation,10.1109/VAST.2006.261436,http://dx.doi.org/10.1109/VAST.2006.261436,107,114,C,"This paper presents a network traffic analysis system that couples visual analysis with a declarative knowledge representation. The system supports multiple iterations of the sense-making loop of analytic reasoning by allowing users to save discoveries as they are found and to reuse them in future iterations. We show how the knowledge representation can be used to improve both the visual representations and the basic analytical tasks of filtering and changing level of detail. We describe how the system can be used to produce models of network patterns, and show results from classifying one day of network traffic in our laboratory",Ling Xiao;John Gerth;Pat Hanrahan,Ling Xiao;John Gerth;Pat Hanrahan,"Stanford University, Email: lingxiao@cs.stanford.edu;Stanford University, Email: gerth@cs.stanford.edu;Stanford University, Email: hanrahan@cs.stanford.edu",10.1109/INFVIS.1996.559226,"network traffic visualization, visual analysis",44,28,23,
Vis,2006,Enhancing Depth Perception in Translucent Volumes,10.1109/TVCG.2006.139,http://dx.doi.org/10.1109/TVCG.2006.139,1117,1124,J,"We present empirical studies that consider the effects of stereopsis and simulated aerial perspective on depth perception in translucent volumes. We consider a purely absorptive lighting model, in which light is not scattered or reflected, but is simply absorbed as it passes through the volume. A purely absorptive lighting model is used, for example, when rendering digitally reconstructed radiographs (DRRs), which are synthetic X-ray images reconstructed from CT volumes. Surgeons make use of DRRs in planning and performing operations, so an improvement of depth perception in DRRs may help diagnosis and surgical planning",Marta Kersten;James Stewart;Nikolaus F. Troje;Randy E. Ellis,Marta Kersten;James Stewart;Niko Troje;Randy Ellis,"Medical Computing Lab, Queen’s University;Medical Computing Lab, Queen’s University;Medical Computing Lab, Queen’s University;Medical Computing Lab, Queen’s University",,"Stereo, Stereopsis, X-ray, Radiograph, Volume Rendering",44,28,25,
InfoVis,2007,Overview Use in Multiple Visual Information Resolution Interfaces,10.1109/TVCG.2007.70583,http://dx.doi.org/10.1109/TVCG.2007.70583,1278,1285,J,"In interfaces that provide multiple visual information resolutions (VIR), low-VIR overviews typically sacrifice visual details for display capacity, with the assumption that users can select regions of interest to examine at higher VI Rs. Designers can create low VIRs based on multi-level structure inherent in the data, but have little guidance with single-level data. To better guide design tradeoff between display capacity and visual target perceivability, we looked at overview use in two multiple-VIR interfaces with high-VIR displays either embedded within, or separate from, the overviews. We studied two visual requirements for effective overview and found that participants would reliably use the low-VIR overviews only when the visual targets were simple and had small visual spans. Otherwise, at least 20% chose to use the high-VIR view exclusively. Surprisingly, neither of the multiple-VIR interfaces provided performance benefits when compared to using the high-VIR view alone. However, we did observe benefits in providing side-by-side comparisons for target matching. We conjecture that the high cognitive load of multiple-VIR interface interactions, whether real or perceived, is a more considerable barrier to their effective use than was previously considered.",Heidi Lam;Tamara Munzner;Robert Kincaid,Heidi Lam;Tamara Munzner;Robert Kincaid,IEEE Computer Society;IEEE Computer Society,10.1109/INFVIS.2005.1532136;10.1109/VISUAL.2005.1532838;10.1109/INFVIS.2004.59;10.1109/VISUAL.1990.146375,"Multiple resolutions, overview use, user study",44,27,21,
VAST,2007,Visual Analytics on Mobile Devices for Emergency Response,10.1109/VAST.2007.4388994,http://dx.doi.org/10.1109/VAST.2007.4388994,35,42,C,"Using mobile devices for visualization provides a ubiquitous environment for accessing information and effective decision making. These visualizations are critical in satisfying the knowledge needs of operators in areas as diverse as education, business, law enforcement, protective services, medical services, scientific discovery, and homeland security. In this paper, we present an efficient and interactive mobile visual analytic system for increased situational awareness and decision making in emergency response and training situations. Our system provides visual analytics with locational scene data within a simple interface tailored to mobile device capabilities. In particular, we focus on processing and displaying sensor network data for first responders. To verify our system, we have used simulated data of The Station nightclub fire evacuation.",SungYe Kim;Yun Jang;Angela Mellema;David S. Ebert;Timothy W. Collins,Sung Ye Kim;Yun Jang;Angela Mellema;David S. Ebert;Timothy Collinss,"Purdue University Regional Visualization and Analytics Center (PURVAC), Purdue University, West Lafayette, IN. e-mail: inside@purdue.edu;Purdue University Regional Visualization and Analytics Center (PURVAC), Purdue University, West Lafayette, IN. e-mail: inside@purdue.edu, jangy@purdue.edu;Purdue University Regional Visualization and Analytics Center (PURVAC), Purdue University, West Lafayette, IN. e-mail: inside@purdue.edu, amellema@purdue.edu;Purdue University Regional Visualization and Analytics Center (PURVAC), Purdue University, West Lafayette, IN. e-mail: inside@purdue.edu, ebertd@purdue.edu;Purdue Homeland Security Institute (PHSI), Purdue University, West Lafayette, IN. e-mail: tfcollins@purdue.edu",10.1109/VAST.2006.261434,"mobile visualization, visual analytics, emergency response",44,25,20,
InfoVis,2008,Visualizing Incomplete and Partially Ranked Data,10.1109/TVCG.2008.181,http://dx.doi.org/10.1109/TVCG.2008.181,1356,1363,J,"Ranking data, which result from m raters ranking n items, are difficult to visualize due to their discrete algebraic structure, and the computational difficulties associated with them when n is large. This problem becomes worse when raters provide tied rankings or not all items are ranked. We develop an approach for the visualization of ranking data for large n which is intuitive, easy to use, and computationally efficient. The approach overcomes the structural and computational difficulties by utilizing a natural measure of dissimilarity for raters, and projecting the raters into a low dimensional vector space where they are viewed. The visualization techniques are demonstrated using voting data, jokes, and movie preferences.",Paul Kidwell;Guy Lebanon;William S. Cleveland,Paul Kidwell;Guy Lebanon;William Cleveland,"Department of Statistics, Purdue University;College of Computing, Georgia Institute of Technology;Departments of Statistics and Computer Science, Purdue University",,"Partial rankings, incomplete rankings, multidimensional scaling",44,36,21,
Vis,2010,Streak Lines as Tangent Curves of a Derived Vector field,10.1109/TVCG.2010.198,http://dx.doi.org/10.1109/TVCG.2010.198,1225,1234,J,"Characteristic curves of vector fields include stream, path, and streak lines. Stream and path lines can be obtained by a simple vector field integration of an autonomous ODE system, i.e., they can be described as tangent curves of a vector field. This facilitates their mathematical analysis including the extraction of core lines around which stream or path lines exhibit swirling motion, or the computation of their curvature for every point in the domain without actually integrating them. Such a description of streak lines is not yet available, which excludes them from most of the feature extraction and analysis tools that have been developed in our community. In this paper, we develop the first description of streak lines as tangent curves of a derived vector field - the streak line vector field - and show how it can be computed from the spatial and temporal gradients of the flow map, i.e., a dense path line integration is required. We demonstrate the high accuracy of our approach by comparing it to solutions where the ground truth is analytically known and to solutions where the ground truth has been obtained using the classic streak line computation. Furthermore, we apply a number of feature extraction and analysis tools to the new streak line vector field including the extraction of cores of swirling streak lines and the computation of streak line curvature fields. These first applications foreshadow the large variety of possible future research directions based on our new mathematical description of streak lines.",Tino Weinkauf;Holger Theisel,Tino Weinkauf;Holger Theisel,New York University;University of Magdeburg,10.1109/TVCG.2007.70557;10.1109/VISUAL.2005.1532851;10.1109/TVCG.2007.70545;10.1109/TVCG.2009.154;10.1109/TVCG.2007.70554;10.1109/VISUAL.2004.99;10.1109/TVCG.2008.133;10.1109/TVCG.2009.190;10.1109/VISUAL.2005.1532832;10.1109/VISUAL.1999.809896;10.1109/VISUAL.1992.235211;10.1109/TVCG.2008.163;10.1109/TVCG.2007.70551,"Unsteady flow visualization, streak lines, streak surfaces, feature extraction",44,43,38,BP
VAST,2011,Interactive visual comparison of multiple trees,10.1109/VAST.2011.6102439,http://dx.doi.org/10.1109/VAST.2011.6102439,31,40,C,"Traditionally, the visual analysis of hierarchies, respectively, trees, is conducted by focusing on one given hierarchy. However, in many research areas multiple, differing hierarchies need to be analyzed simultaneously in a comparative way - in particular to highlight differences between them, which sometimes can be subtle. A prominent example is the analysis of so-called phylogenetic trees in biology, reflecting hierarchical evolutionary relationships among a set of organisms. Typically, the analysis considers multiple phylogenetic trees, either to account for statistical significance or for differences in derivation of such evolutionary hierarchies; for example, based on different input data, such as the 16S ribosomal RNA and protein sequences of highly conserved enzymes. The simultaneous analysis of a collection of such trees leads to more insight into the evolutionary process. We introduce a novel visual analytics approach for the comparison of multiple hierarchies focusing on both global and local structures. A new tree comparison score has been elaborated for the identification of interesting patterns. We developed a set of linked hierarchy views showing the results of automatic tree comparison on various levels of details. This combined approach offers detailed assessment of local and global tree similarities. The approach was developed in close cooperation with experts from the evolutionary biology domain. We apply it to a phylogenetic data set on bacterial ancestry, demonstrating its application benefit.",Sebastian Bremm;Tatiana von Landesberger;Martin Hess;Tobias Schreck;Philipp Weil;Kay Hamacher,Sebastian Bremm;Tatiana von Landesberger;Martin Heß;Tobias Schreck;Philipp Weil;Kay Hamacherk,"Interactive-Graphics Systems, TU Darmstadt, Germany;Interactive-Graphics Systems, TU Darmstadt, Germany;Interactive-Graphics Systems, TU Darmstadt, Germany;Data Analysis and Visualization Group, University of Konstanz, Germany;Computational Biology, TU Darmstadt, Germany;Computational Biology, TU Darmstadt, Germany",10.1109/TVCG.2008.114;10.1109/TVCG.2009.130;10.1109/VAST.2009.5333893;10.1109/TVCG.2007.70529,,44,38,39,
InfoVis,2013,DiffAni: Visualizing Dynamic Graphs with a Hybrid of Difference Maps and Animation,10.1109/TVCG.2013.149,http://dx.doi.org/10.1109/TVCG.2013.149,2556,2565,J,"Visualization of dynamically changing networks (graphs) is a significant challenge for researchers. Previous work has experimentally compared animation, small multiples, and other techniques, and found trade-offs between these. One potential way to avoid such trade-offs is to combine previous techniques in a hybrid visualization. We present two taxonomies of visualizations of dynamic graphs: one of non-hybrid techniques, and one of hybrid techniques. We also describe a prototype, called DiffAni, that allows a graph to be visualized as a sequence of three kinds of tiles: diff tiles that show difference maps over some time interval, animation tiles that show the evolution of the graph over some time interval, and small multiple tiles that show the graph state at an individual time slice. This sequence of tiles is ordered by time and covers all time slices in the data. An experimental evaluation of DiffAni shows that our hybrid approach has advantages over non-hybrid techniques in certain cases.",Sébastien Rufiange;Michael J. McGuffin,Sébastien Rufiange;Michael J. McGuffin,école de technologie supérieure;école de technologie supérieure,10.1109/VAST.2012.6400552;10.1109/TVCG.2011.169;10.1109/INFVIS.2005.1532151;10.1109/TVCG.2011.226;10.1109/INFVIS.2002.1173155;10.1109/TVCG.2011.213;10.1109/TVCG.2008.141;10.1109/TVCG.2007.70582;10.1109/INFVIS.2002.1173148;10.1109/INFVIS.2005.1532129;10.1109/INFVIS.2002.1173160;10.1109/TVCG.2007.70539,"Dynamic networks, hybrid visualization, taxonomy, evolution, animation, difference map",44,40,43,
SciVis,2013,Area-Preservation Mapping using Optimal Mass Transport,10.1109/TVCG.2013.135,http://dx.doi.org/10.1109/TVCG.2013.135,2838,2847,J,"We present a novel area-preservation mapping/flattening method using the optimal mass transport technique, based on the Monge-Brenier theory. Our optimal transport map approach is rigorous and solid in theory, efficient and parallel in computation, yet general for various applications. By comparison with the conventional Monge-Kantorovich approach, our method reduces the number of variables from O(n&lt;sup&gt;2&lt;/sup&gt;) to O(n), and converts the optimal mass transport problem to a convex optimization problem, which can now be efficiently carried out by Newton's method. Furthermore, our framework includes the area weighting strategy that enables users to completely control and adjust the size of areas everywhere in an accurate and quantitative way. Our method significantly reduces the complexity of the problem, and improves the efficiency, flexibility and scalability during visualization. Our framework, by combining conformal mapping and optimal mass transport mapping, serves as a powerful tool for a broad range of applications in visualization and graphics, especially for medical imaging. We provide a variety of experimental results to demonstrate the efficiency, robustness and efficacy of our novel framework.",Xin Zhao 0015;Zhengyu Su;Xianfeng Gu;Arie E. Kaufman;Jian Sun;Jie Gao 0001;Feng Luo 0002,Xin Zhao;Zhengyu Su;Xianfeng David Gu;Arie Kaufman;Jian Sun;Jie Gao;Feng Luo,Stony Brook University;Stony Brook University;Stony Brook University;Stony Brook University;Tsinghua University;Stony Brook University;Rutgers University,10.1109/TVCG.2011.171,"Area-preservation mapping, surface flattening, optimal transport map, Monge-Brenier theory, visualization and graphics applications",44,41,38,
SciVis,2015,Streamline Variability Plots for Characterizing the Uncertainty in Vector Field Ensembles,10.1109/TVCG.2015.2467204,http://dx.doi.org/10.1109/TVCG.2015.2467204,767,776,J,"We present a new method to visualize from an ensemble of flow fields the statistical properties of streamlines passing through a selected location. We use principal component analysis to transform the set of streamlines into a low-dimensional Euclidean space. In this space the streamlines are clustered into major trends, and each cluster is in turn approximated by a multivariate Gaussian distribution. This yields a probabilistic mixture model for the streamline distribution, from which confidence regions can be derived in which the streamlines are most likely to reside. This is achieved by transforming the Gaussian random distributions from the low-dimensional Euclidean space into a streamline distribution that follows the statistical model, and by visualizing confidence regions in this distribution via iso-contours. We further make use of the principal component representation to introduce a new concept of streamline-median, based on existing median concepts in multidimensional Euclidean spaces. We demonstrate the potential of our method in a number of real-world examples, and we compare our results to alternative clustering approaches for particle trajectories as well as curve boxplots.",Florian Ferstl;Kai Bürger;Rüdiger Westermann,Florian Ferstl;Kai Bürger;Rüdiger Westermann,Computer Graphics and Visualization Group;Computer Graphics and Visualization Group;Computer Graphics and Visualization Group,10.1109/TVCG.2007.70595;10.1109/VISUAL.2000.885715;10.1109/VISUAL.1999.809863;10.1109/TVCG.2013.141;10.1109/TVCG.2007.70518;10.1109/TVCG.2014.2346455;10.1109/VISUAL.2005.1532779;10.1109/TVCG.2010.181;10.1109/VISUAL.1999.809865;10.1109/TVCG.2013.143,"Ensemble visualization, uncertainty visualization, flow visualization, streamlines, statistical modeling",44,55,50,
VAST,2015,InterAxis: Steering Scatterplot Axes via Observation-Level Interaction,10.1109/TVCG.2015.2467615,http://dx.doi.org/10.1109/TVCG.2015.2467615,131,140,J,"Scatterplots are effective visualization techniques for multidimensional data that use two (or three) axes to visualize data items as a point at its corresponding x and y Cartesian coordinates. Typically, each axis is bound to a single data attribute. Interactive exploration occurs by changing the data attributes bound to each of these axes. In the case of using scatterplots to visualize the outputs of dimension reduction techniques, the x and y axes are combinations of the true, high-dimensional data. For these spatializations, the axes present usability challenges in terms of interpretability and interactivity. That is, understanding the axes and interacting with them to make adjustments can be challenging. In this paper, we present InterAxis, a visual analytics technique to properly interpret, define, and change an axis in a user-driven manner. Users are given the ability to define and modify axes by dragging data items to either side of the x or y axes, from which the system computes a linear combination of data attributes and binds it to the axis. Further, users can directly tune the positive and negative contribution to these complex axes by using the visualization of data attributes that correspond to each axis. We describe the details of our technique and demonstrate the intended usage through two scenarios.",Hannah Kim;Jaegul Choo;Haesun Park;Alex Endert,Hannah Kim;Jaegul Choo;Haesun Park;Alex Endert,Georgia Institute of Technology;Korea University;Georgia Institute of Technology;Georgia Institute of Technology,10.1109/TVCG.2011.185;10.1109/VAST.2012.6400486;10.1109/TVCG.2013.212;10.1109/VAST.2010.5652443;10.1109/TVCG.2011.201;10.1109/TVCG.2008.153;10.1109/VAST.2011.6102449;10.1109/TVCG.2013.157;10.1109/TVCG.2014.2346250;10.1109/VISUAL.1990.146386;10.1109/TVCG.2011.178;10.1109/TVCG.2013.167,"Scatterplots, user interaction, model steering",44,41,50,
Vis,1991,A scientific visualization synthesizer,10.1109/VISUAL.1991.175811,http://dx.doi.org/10.1109/VISUAL.1991.175811,262,267,C,"Methods for displaying scientific data using textures and raster operations rather than geometric techniques are described. The flexibility and simplicity of raster operations allow a greater choice of visualization techniques with only a small set of basic operations. In addition, texture mapping techniques that allow the representation of several variables simultaneously, without a high degree of clutter, are shown. The combination of traditional geometric techniques, image composition techniques, and image rendering techniques can be integrated into a single framework for the display of scientific data. A system for generating and operating on textures and images for the purposes of scientific visualization is presented. To illustrate its advantage, the development of bump maps for vector filters and contour lines is demonstrated.&lt;&lt;ETX&gt;&gt;",Roger Crawfis;M. J. Allison,R.A. Crawfis;M.J. Allison,"Lawrence Livermore Nat. Lab., CA, USA;Lawrence Livermore Nat. Lab., CA, USA",,,43,10,8,
Vis,1995,An illustrated analysis of sonification for scientific visualisation,10.1109/VISUAL.1995.480802,http://dx.doi.org/10.1109/VISUAL.1995.480802,110,117,C,This paper presents an analysis of progress in the use of sound as a tool in support of visualisation and gives an insight into its development and future needs. Special emphasis is given to the use of sound in scientific and engineering applications. A system developed to support surface data presentation and interaction by using sound is presented and discussed.,Rosane Minghim;A. Robin Forrest,R. Minghim;A.R. Forrest,"Sch. of Inf. Syst., East Anglia Univ., Norwich, UK;Sch. of Inf. Syst., East Anglia Univ., Norwich, UK",,,43,26,47,
InfoVis,1996,Data characterization for automatically visualizing heterogeneous information,10.1109/INFVIS.1996.559211,http://dx.doi.org/10.1109/INFVIS.1996.559211,13,"20, 117",C,"Automated graphical generation systems should be able to design effective presentations for heterogeneous (quantitative and qualitative) information in static or interactive environments. When building such a system, it is important to thoroughly understand the presentation-related characteristics of domain-specific information. We define a data-analysis taxonomy that can be used to characterize heterogeneous information. In addition to capturing the presentation-related properties of data, our characterization takes into account the user's information-seeking goals and visual-interpretation preferences. We use automatically-generated examples from two different application domains to demonstrate the coverage of the proposed taxonomy and its utility for selecting effective graphical techniques.",Michelle X. Zhou;Steven K. Feiner,M.X. Zhou;S.K. Feiner,"Dept. of Comput. Sci., Columbia Univ., New York, NY, USA",10.1109/VISUAL.1990.146375,,43,10,13,
InfoVis,1997,Visualizing information on a sphere,10.1109/INFVIS.1997.636759,http://dx.doi.org/10.1109/INFVIS.1997.636759,11,16,C,"We describe a method for the visualization of information units on spherical domains which is employed in the banking industry for risk analysis, stock prediction and other tasks. The system is based on a quantification of the similarity of related objects that governs the parameters of a mass-spring system. Unlike existing approaches we initialize all information units onto the inner surface of two concentric spheres and attach them with springs to the outer sphere. Since the spring stiffnesses correspond to the computed similarity measures, the system converges into an energy minimum which reveals multidimensional relations and adjacencies in terms of spatial neighborhoods. Depending on the application scenario our approach supports different topological arrangements of related objects. In order to cope with large data sets we propose a blobby clustering mechanism that enables encapsulation of similar objects by implicit shapes. In addition, we implemented various interaction techniques allowing semantic analysis of the underlying data sets. Our prototype system IVORY is written in Java, and its versatility is illustrated by an example from financial service providers.",Markus H. Gross;Thomas C. Sprenger;J. Finger,M.H. Gross;T.C. Sprenger;J. Finger,"Dept. of Comput. Sci., Zurich Univ., Switzerland",10.1109/INFVIS.1995.528689;10.1109/INFVIS.1995.528691;10.1109/INFVIS.1995.528686;10.1109/VISUAL.1996.567787,"information visualization, physically-based systems, multidimensional information space, hierarchies, blobby clustering",43,16,21,
Vis,1997,An anti-aliasing technique for splatting,10.1109/VISUAL.1997.663882,http://dx.doi.org/10.1109/VISUAL.1997.663882,197,204,C,"Splatting is a popular direct volume rendering algorithm. However, the algorithm does not correctly render cases where the volume sampling rate is higher than the image sampling rate (e.g. more than one voxel maps into a pixel). This situation arises with orthographic projections of high-resolution volumes, as well as with perspective projections of volumes of any resolution. The result is potentially severe spatial and temporal aliasing artifacts. Some volume ray-casting algorithms avoid these artifacts by employing reconstruction kernels which vary in width as the rays diverge. Unlike ray-casting algorithms, existing splatting algorithms do not have an equivalent mechanism for avoiding these artifacts. The authors propose such a mechanism, which delivers high-quality splatted images and has the potential for a very efficient hardware implementation.",J. Edward Swan;Klaus Mueller;Torsten Möller;Naeem Shareef;Roger Crawfis;Roni Yagel,J.E. Swan;K. Mueller;T. Moller;N. Shareel;R. Crawfis;R. Yagel,"Adv. Comput. Center for the Arts & Design, Ohio State Univ., Columbus, OH, USA",10.1109/VISUAL.1996.567608;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1994.346331;10.1109/VISUAL.1995.480792;10.1109/VISUAL.1993.398852,"volume rendering, splatting, direct volume rendering, resampling, reconstruction, anti-aliasing, perspective projection",43,17,26,BP
InfoVis,1998,LensBar-visualization for browsing and filtering large lists of data,10.1109/INFVIS.1998.729567,http://dx.doi.org/10.1109/INFVIS.1998.729567,113,"120, 159",C,"The author proposes a simple and powerful graphical interface tool called the LensBar for filtering and visualizing large lists of data. Browsing and querying are the most important tasks in retrieving information and LensBar integrates the two techniques into a simple scroll window with slider. While it looks familiar to users of conventional graphical interface tools, its filtering and zooming features offer sophisticated handling of large lists of textual data.",Toshiyuki Masui,T. Masui,"Sony Comput. Sci. Labs. Inc., Tokyo, Japan",,,43,13,18,
InfoVis,2005,Importance-driven visualization layouts for large time series data,10.1109/INFVIS.2005.1532148,http://dx.doi.org/10.1109/INFVIS.2005.1532148,203,210,C,"Time series are an important type of data with applications in virtually every aspect of the real world. Often a large number of time series have to be monitored and analyzed in parallel. Sets of time series may show intrinsic hierarchical relationships and varying degrees of importance among the individual time series. Effective techniques for visually analyzing large sets of time series should encode the relative importance and hierarchical ordering of the time series data by size and position, and should also provide a high degree of regularity in order to support comparability by the analyst. In this paper, we present a framework for visualizing large sets of time series. Based on the notion of inter time series importance relationships, we define a set of objective functions that space-filling layout schemes for time series data should obey. We develop an efficient algorithm addressing the identified problems by generating layouts that reflect hierarchy and importance based relationships in a regular layout with favorable aspect ratios. We apply our technique to a number of real world data sets including sales and stock data, and we compare our technique with an aspect ratio aware variant of the well known TreeMap algorithm. The examples show the advantages and practical usefulness of our layout algorithm.",Ming C. Hao;Umeshwar Dayal;Daniel A. Keim;Tobias Schreck,M.C. Hao;Umeshwar Dayal;D.A. Keim;T. Schreck,"Hewlett-Packard Labs., Palo Alto, CA, USA;Hewlett-Packard Labs., Palo Alto, CA, USA",10.1109/INFVIS.1999.801867;10.1109/INFVIS.1999.801851;10.1109/VISUAL.1995.485140;10.1109/INFVIS.1999.801860;10.1109/INFVIS.2000.885086,"Information Visualization, Time Series, Space-Filling Layout Generation",43,17,16,
VAST,2006,Time Tree: Exploring Time Changing Hierarchies,10.1109/VAST.2006.261450,http://dx.doi.org/10.1109/VAST.2006.261450,3,10,C,"Intelligence analysis often involves the task of gathering information about an organization. Knowledge about individuals in an organization and their relationships, often represented as a hierarchical organization chart, is crucial for understanding the organization. However, it is difficult for intelligence analysts to follow all individuals in an organization. Existing hierarchy visualizations have largely focused on the visualization of fixed structures and can not effectively depict the evolution of a hierarchy over time. We introduce TimeTree, a novel visualization tool designed to enable exploration of a changing hierarchy. TimeTree enables analysts to navigate the history of an organization, identify events associated with a specific entity (visualized on a TimeSlider), and explore an aggregate view of an individual's career path (a CareerTree). We demonstrate the utility of TimeTree by investigating a set of scenarios developed by an expert intelligence analyst. The scenarios are evaluated using a real dataset composed of eighteen thousand career events from more than eight thousand individuals. Insights gained from this analysis are presented",Stuart K. Card;Bongwon Suh;Bryan A. Pendleton;Bryan Heer;John W. Bodnar,Stuart K. Card;Bongwon Suh;Bryan A. Pendleton;Jeffrey Heer;John W. Bodnar,"Palo Alto Research Center, 3333 Coyote Hill Road Palo Alto, CA 94304. E-mail: card@parc.com;Palo Alto Research Center, 3333 Coyote Hill Road Palo Alto, CA 94304. E-mail: suh@parc.com;Palo Alto Research Center, 3333 Coyote Hill Road Palo Alto, CA 94304. E-mail: bpendlet@parc.com;University of California at Berkeley, jheer@cs.berkeley.edu;SAIC, john.w.bodnar@saic.com",10.1109/INFVIS.2003.1249010;10.1109/VISUAL.1991.175815,"TimeTree, DOI Tree, tree visualization,organizational chart, timeseries data, visual analytics",43,17,29,
Vis,2006,On Histograms and Isosurface Statistics,10.1109/TVCG.2006.168,http://dx.doi.org/10.1109/TVCG.2006.168,1259,1266,J,"In this paper, we show that histograms represent spatial function distributions with a nearest neighbour interpolation. We confirm that this results in systematic underrepresentation of transitional features of the data, and provide new insight why this occurs. We further show that isosurface statistics, which use higher quality interpolation, give better representations of the function distribution. We also use our experimentally collected isosurface statistics to resolve some questions as to the formal complexity of isosurfaces",Hamish A. Carr;Brian Duffy;Brian Denby,Carr Hamish;Brian Duffy;Brain Denby,University College Dublin;University College Dublin;University College Dublin,10.1109/VISUAL.1994.346334;10.1109/VISUAL.2001.964519;10.1109/VISUAL.1994.346331;10.1109/VISUAL.1991.175782;10.1109/VISUAL.2001.964515;10.1109/VISUAL.2001.964516;10.1109/VISUAL.1997.663875,"histograms, isosurfaces, isosurface statistics",43,36,16,BP
Vis,2007,Transform Coding for Hardware-accelerated Volume Rendering,10.1109/TVCG.2007.70516,http://dx.doi.org/10.1109/TVCG.2007.70516,1600,1607,J,"Hardware-accelerated volume rendering using the GPU is now the standard approach for real-time volume rendering, although limited graphics memory can present a problem when rendering large volume data sets. Volumetric compression in which the decompression is coupled to rendering has been shown to be an effective solution to this problem; however, most existing techniques were developed in the context of software volume rendering, and all but the simplest approaches are prohibitive in a real-time hardware-accelerated volume rendering context. In this paper we present a novel block-based transform coding scheme designed specifically with real-time volume rendering in mind, such that the decompression is fast without sacrificing compression quality. This is made possible by consolidating the inverse transform with dequantization in such a way as to allow most of the reprojection to be precomputed. Furthermore, we take advantage of the freedom afforded by offline compression in order to optimize the encoding as much as possible while hiding this complexity from the decoder. In this context we develop a new block classification scheme which allows us to preserve perceptually important features in the compression. The result of this work is an asymmetric transform coding scheme that allows very large volumes to be compressed and then decompressed in real-time while rendering on the GPU.",Nathaniel Fout;Kwan-Liu Ma,Nathaniel Fout;Kwan-Liu Ma,"Department of Computer Science, University of California, Davis;Department of Computer Science, University of California, Davis",10.1109/VISUAL.2002.1183757;10.1109/VISUAL.2001.964520;10.1109/VISUAL.2004.95;10.1109/VISUAL.1993.398845;10.1109/VISUAL.2003.1250357;10.1109/VISUAL.1995.480812;10.1109/VISUAL.2003.1250385,"Volume Compression, Compressed Volume Rendering, Transform Coding, Hardware-accelerated Volume Rendering",43,38,25,
Vis,2007,Topological Visualization of Brain Diffusion MRI Data,10.1109/TVCG.2007.70602,http://dx.doi.org/10.1109/TVCG.2007.70602,1496,1503,J,"Topological methods give concise and expressive visual representations of flow fields. The present work suggests a comparable method for the visualization of human brain diffusion MRI data. We explore existing techniques for the topological analysis of generic tensor fields, but find them inappropriate for diffusion MRI data. Thus, we propose a novel approach that considers the asymptotic behavior of a probabilistic fiber tracking method and define analogs of the basic concepts of flow topology, like critical points, basins, and faces, with interpretations in terms of brain anatomy. The resulting features are fuzzy, reflecting the uncertainty inherent in any connectivity estimate from diffusion imaging. We describe an algorithm to extract the new type of features, demonstrate its robustness under noise, and present results for two regions in a diffusion MRI dataset to illustrate that the method allows a meaningful visual analysis of probabilistic fiber tracking results.",Thomas Schultz 0001;Holger Theisel;Hans-Peter Seidel,Thomas Schultz;Holger Theisel;Hans-Peter Seidel,,10.1109/VISUAL.1999.809894;10.1109/VISUAL.2005.1532777;10.1109/VISUAL.2005.1532841;10.1109/VISUAL.1994.346326;10.1109/VISUAL.2005.1532778;10.1109/VISUAL.1994.346326,"Diffusion tensor, probabilistic fiber tracking, tensor topology, uncertainty visualization",43,37,32,
Vis,2007,"Topology, Accuracy, and Quality of Isosurface Meshes Using Dynamic Particles",10.1109/TVCG.2007.70604,http://dx.doi.org/10.1109/TVCG.2007.70604,1704,1711,J,"This paper describes a method for constructing isosurface triangulations of sampled, volumetric, three-dimensional scalar fields. The resulting meshes consist of triangles that are of consistently high quality, making them well suited for accurate interpolation of scalar and vector-valued quantities, as required for numerous applications in visualization and numerical simulation. The proposed method does not rely on a local construction or adjustment of triangles as is done, for instance, in advancing wavefront or adaptive refinement methods. Instead, a system of dynamic particles optimally samples an implicit function such that the particles' relative positions can produce a topologically correct Delaunay triangulation. Thus, the proposed method relies on a global placement of triangle vertices. The main contributions of the paper are the integration of dynamic particles systems with surface sampling theory and PDE-based methods for controlling the local variability of particle densities, as well as detailing a practical method that accommodates Delaunay sampling requirements to generate sparse sets of points for the production of high-quality tessellations.",Miriah D. Meyer;Robert Michael Kirby;Ross T. Whitaker,Miriah Meyer;Robert M. Kirby;Ross Whitaker,"Scientific Computing and Imaging Institute at the University of Utah,;Scientific Computing and Imaging Institute at the University of Utah,;Scientific Computing and Imaging Institute at the University of Utah,",10.1109/VISUAL.2002.1183766;10.1109/VISUAL.2003.1250414;10.1109/VISUAL.2003.1250363;10.1109/TVCG.2006.149;10.1109/VISUAL.2002.1183808;10.1109/VISUAL.2000.885705,"Isosurface extraction, particle systems, Delaunay triangulation",43,35,47,
Vis,2009,Color Seamlessness in Multi-Projector Displays Using Constrained Gamut Morphing,10.1109/TVCG.2009.124,http://dx.doi.org/10.1109/TVCG.2009.124,1317,1326,J,"Multi-projector displays show significant spatial variation in 3D color gamut due to variation in the chromaticity gamuts across the projectors, vignetting effect of each projector and also overlap across adjacent projectors. In this paper we present a new constrained gamut morphing algorithm that removes all these variations and results in true color seamlessness across tiled multi-projector displays. Our color morphing algorithm adjusts the intensities of light from each pixel of each projector precisely to achieve a smooth morphing from one projector's gamut to the other's through the overlap region. This morphing is achieved by imposing precise constraints on the perceptual difference between the gamuts of two adjacent pixels. In addition, our gamut morphing assures a C1 continuity yielding visually pleasing appearance across the entire display. We demonstrate our method successfully on a planar and a curved display using both low and high-end projectors. Our approach is completely scalable, efficient and automatic. We also demonstrate the real-time performance of our image correction algorithm on GPUs for interactive applications. To the best of our knowledge, this is the first work that presents a scalable method with a strong foundation in perception and realizes, for the first time, a truly seamless display where the number of projectors cannot be deciphered.",Behzad Sajadi;Maxim Lazarov;Meenakshisundaram Gopi;Aditi Majumder,Behzad Sajadi;Maxim Lazarov;M. Gopi;Aditi Majumder,"University of California, Irvine;University of California, Irvine;University of California, Irvine;University of California, Irvine",10.1109/VISUAL.2001.964508;10.1109/VISUAL.2002.1183793;10.1109/VISUAL.2000.885684;10.1109/VISUAL.1999.809883;10.1109/TVCG.2007.70586;10.1109/TVCG.2006.121,"Color Calibration, Multi-Projector Displays, Tiled Displays",43,35,19,
Vis,2009,Visualization and Exploration of Temporal Trend Relationships in Multivariate Time-Varying Data,10.1109/TVCG.2009.200,http://dx.doi.org/10.1109/TVCG.2009.200,1359,1366,J,"We present a new algorithm to explore and visualize multivariate time-varying data sets. We identify important trend relationships among the variables based on how the values of the variables change over time and how those changes are related to each other in different spatial regions and time intervals. The trend relationships can be used to describe the correlation and causal effects among the different variables. To identify the temporal trends from a local region, we design a new algorithm called SUBDTW to estimate when a trend appears and vanishes in a given time series. Based on the beginning and ending times of the trends, their temporal relationships can be modeled as a state machine representing the trend sequence. Since a scientific data set usually contains millions of data points, we propose an algorithm to extract important trend relationships in linear time complexity. We design novel user interfaces to explore the trend relationships, to visualize their temporal characteristics, and to display their spatial distributions. We use several scientific data sets to test our algorithm and demonstrate its utilities.",Teng-Yok Lee;Han-Wei Shen,Teng-Yok Lee;Han-Wei Shen,The Ohio State University;The Ohio State University,10.1109/TVCG.2008.131;10.1109/VISUAL.1999.809864;10.1109/VISUAL.2004.95;10.1109/VISUAL.2003.1250402;10.1109/TVCG.2007.70519;10.1109/INFVIS.1997.636793;10.1109/TVCG.2008.140;10.1109/VAST.2006.261421,"SUBDTW, trend sequence, trend sequence clustering",43,38,26,
VAST,2010,Improving the visual analysis of high-dimensional datasets using quality measures,10.1109/VAST.2010.5652433,http://dx.doi.org/10.1109/VAST.2010.5652433,19,26,C,"Modern visualization methods are needed to cope with very high-dimensional data. Efficient visual analytical techniques are required to extract the information content in these data. The large number of possible projections for each method, which usually grow quadrat-ically or even exponentially with the number of dimensions, urges the necessity to employ automatic reduction techniques, automatic sorting or selecting the projections, based on their information-bearing content. Different quality measures have been successfully applied for several specified user tasks and established visualization techniques, like Scatterplots, Scatterplot Matrices or Parallel Coordinates. Many other popular visualization techniques exist, but due to the structural differences, the measures are not directly applicable to them and new approaches are needed. In this paper we propose new quality measures for three popular visualization methods: Radviz, Pixel-Oriented Displays and Table Lenses. Our experiments show that these measures efficiently guide the visual analysis task.",Georgia Albuquerque;Martin Eisemann;Dirk J. Lehmann;Holger Theisel;Marcus A. Magnor,Georgia Albuquerque;Martin Eisemann;Dirk J. Lehmann;Holger Theisel;Marcus Magnor,"TU Braunschweig, Germany;TU Braunschweig, Germany;University of Magdeburg, Germany;University of Magdeburg, Germany;TU Braunschweig, Germany",10.1109/INFVIS.2005.1532145;10.1109/INFVIS.2005.1532142;10.1109/VISUAL.1997.663916;10.1109/VAST.2006.261423;10.1109/VAST.2009.5332628;10.1109/TVCG.2008.173,,43,30,29,
VAST,2010,Visual market sector analysis for financial time series data,10.1109/VAST.2010.5652530,http://dx.doi.org/10.1109/VAST.2010.5652530,83,90,C,"The massive amount of financial time series data that originates from the stock market generates large amounts of complex data of high interest. However, adequate solutions that can effectively handle the information in order to gain insight and to understand the market mechanisms are rare. In this paper, we present two techniques and applications that enable the user to interactively analyze large amounts of time series data in real-time in order to get insight into the development of assets, market sectors, countries, and the financial market as a whole. The first technique allows users to quickly analyze combinations of single assets, market sectors as well as countries, compare them to each other, and to visually discover the periods of time where market sectors and countries get into turbulence. The second application clusters a selection of large amounts of financial time series data according to their similarity, and analyzes the distribution of the assets among market sectors. This allows users to identify the characteristic graphs which are representative for the development of a particular market sector, and also to identify the assets which behave considerably differently compared to other assets in the same sector. Both applications allow the user to perform investigative exploration techniques and interactive visual analysis in real-time.",Hartmut Ziegler;Marco Jenny;Tino Gruse;Daniel A. Keim,Hartmut Ziegler;Marco Jenny;Tino Gruse;Daniel A. Keim,University of Konstanz;University of Konstanz;University of Konstanz;University of Konstanz,10.1109/INFVIS.2001.963273;10.1109/INFVIS.1997.636789;10.1109/INFVIS.2001.963288;10.1109/INFVIS.1999.801851;10.1109/INFVIS.2003.1249027,"Visual Analytics, financial Information Visualization, Time Series Data, Time Series Clustering, Explorative Analysis",43,34,49,
InfoVis,2011,In Situ Exploration of Large Dynamic Networks,10.1109/TVCG.2011.213,http://dx.doi.org/10.1109/TVCG.2011.213,2334,2343,J,"The analysis of large dynamic networks poses a challenge in many fields, ranging from large bot-nets to social networks. As dynamic networks exhibit different characteristics, e.g., being of sparse or dense structure, or having a continuous or discrete time line, a variety of visualization techniques have been specifically designed to handle these different aspects of network structure and time. This wide range of existing techniques is well justified, as rarely a single visualization is suitable to cover the entire visual analysis. Instead, visual representations are often switched in the course of the exploration of dynamic graphs as the focus of analysis shifts between the temporal and the structural aspects of the data. To support such a switching in a seamless and intuitive manner, we introduce the concept of in situ visualization- a novel strategy that tightly integrates existing visualization techniques for dynamic networks. It does so by allowing the user to interactively select in a base visualization a region for which a different visualization technique is then applied and embedded in the selection made. This permits to change the way a locally selected group of data items, such as nodes or time points, are shown - right in the place where they are positioned, thus supporting the user's overall mental map. Using this approach, a user can switch seamlessly between different visual representations to adapt a region of a base visualization to the specifics of the data within it or to the current analysis focus. This paper presents and discusses the in situ visualization strategy and its implications for dynamic graph visualization. Furthermore, it illustrates its usefulness by employing it for the visual exploration of dynamic networks from two different fields: model versioning and wireless mesh networks.",Steffen Hadlak;Hans-Jörg Schulz;Heidrun Schumann,Steffen Hadlak;Hans-Jorg Schulz;Heidrun Schumann,University of Rostock;Graz University of Technology;University of Rostock,10.1109/TVCG.2009.151;10.1109/TVCG.2008.114;10.1109/INFVIS.2004.18;10.1109/TVCG.2007.70582;10.1109/INFVIS.2000.885087;10.1109/INFVIS.2004.66;10.1109/INFVIS.2002.1173153;10.1109/INFVIS.2002.1173160;10.1109/INFVIS.2005.1532151;10.1109/INFVIS.2003.1249006;10.1109/TVCG.2007.70529;10.1109/TVCG.2006.166,"Dynamic graph data, multiform visualization, multi-focus+context",43,32,51,
InfoVis,2012,Visualizing Network Traffic to Understand the Performance of Massively Parallel Simulations,10.1109/TVCG.2012.286,http://dx.doi.org/10.1109/TVCG.2012.286,2467,2476,J,"The performance of massively parallel applications is often heavily impacted by the cost of communication among compute nodes. However, determining how to best use the network is a formidable task, made challenging by the ever increasing size and complexity of modern supercomputers. This paper applies visualization techniques to aid parallel application developers in understanding the network activity by enabling a detailed exploration of the flow of packets through the hardware interconnect. In order to visualize this large and complex data, we employ two linked views of the hardware network. The first is a 2D view, that represents the network structure as one of several simplified planar projections. This view is designed to allow a user to easily identify trends and patterns in the network traffic. The second is a 3D view that augments the 2D view by preserving the physical network topology and providing a context that is familiar to the application developers. Using the massively parallel multi-physics code pF3D as a case study, we demonstrate that our tool provides valuable insight that we use to explain and optimize pF3D's performance on an IBM Blue Gene/P system.",Aaditya G. Landge;Joshua A. Levine;Abhinav Bhatele;Katherine E. Isaacs;Todd Gamblin;Martin Schulz 0001;Steve H. Langer;Peer-Timo Bremer;Valerio Pascucci,Aaditya G. Landge;Joshua A. Levine;Abhinav Bhatele;Katherine E. Isaacs;Todd Gamblin;Martin Schulz;Steve H. Langer;Peer-Timo Bremer;Valerio Pascucci,"SCI Institute, University of Utah;SCI Institute, University of Utah;Lawrence Livermore National Laboratory;University of California, Davis;Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory;SCI Institute, University of Utah",10.1109/TVCG.2009.196;10.1109/INFVIS.2004.66,"Performance analysis, network traffic visualization, projected graph layouts",43,36,37,
SciVis,2012,Efficient Structure-Aware Selection Techniques for 3D Point Cloud Visualizations with 2DOF Input,10.1109/TVCG.2012.217,http://dx.doi.org/10.1109/TVCG.2012.217,2245,2254,J,"Data selection is a fundamental task in visualization because it serves as a pre-requisite to many follow-up interactions. Efficient spatial selection in 3D point cloud datasets consisting of thousands or millions of particles can be particularly challenging. We present two new techniques, TeddySelection and CloudLasso, that support the selection of subsets in large particle 3D datasets in an interactive and visually intuitive manner. Specifically, we describe how to spatially select a subset of a 3D particle cloud by simply encircling the target particles on screen using either the mouse or direct-touch input. Based on the drawn lasso, our techniques automatically determine a bounding selection surface around the encircled particles based on their density. This kind of selection technique can be applied to particle datasets in several application domains. TeddySelection and CloudLasso reduce, and in some cases even eliminate, the need for complex multi-step selection processes involving Boolean operations. This was confirmed in a formal, controlled user study in which we compared the more flexible CloudLasso technique to the standard cylinder-based selection technique. This study showed that the former is consistently more efficient than the latter - in several cases the CloudLasso selection time was half that of the corresponding cylinder-based selection.",Lingyun Yu;Konstantinos Efstathiou 0001;Petra Isenberg;Tobias Isenberg 0001,Lingyun Yu;Konstantinos Efstathiou;Petra Isenberg;Tobias Isenberg,University of Groningen;University of Groningen;INRIA;University of Groningen,10.1109/TVCG.2010.157;10.1109/TVCG.2012.292;10.1109/TVCG.2008.153,"3D interaction, spatial selection, direct-touch interaction",43,28,39,HM
SciVis,2012,Hierarchical Exploration of Volumes Using Multilevel Segmentation of the Intensity-Gradient Histograms,10.1109/TVCG.2012.231,http://dx.doi.org/10.1109/TVCG.2012.231,2355,2363,J,"Visual exploration of volumetric datasets to discover the embedded features and spatial structures is a challenging and tedious task. In this paper we present a semi-automatic approach to this problem that works by visually segmenting the intensity-gradient 2D histogram of a volumetric dataset into an exploration hierarchy. Our approach mimics user exploration behavior by analyzing the histogram with the normalized-cut multilevel segmentation technique. Unlike previous work in this area, our technique segments the histogram into a reasonable set of intuitive components that are mutually exclusive and collectively exhaustive. We use information-theoretic measures of the volumetric data segments to guide the exploration. This provides a data-driven coarse-to-fine hierarchy for a user to interactively navigate the volume in a meaningful manner.",Cheuk Yiu Ip;Amitabh Varshney;Joseph JáJá,Cheuk Yiu Ip;Amitabh Varshney;Joseph JaJa,University of Maryland;University of Maryland;University of Maryland,10.1109/TVCG.2010.132;10.1109/TVCG.2009.185;10.1109/VISUAL.1999.809932;10.1109/VISUAL.2005.1532795;10.1109/VISUAL.2003.1250370;10.1109/TVCG.2010.208;10.1109/TVCG.2008.162;10.1109/TVCG.2011.248;10.1109/TVCG.2011.173;10.1109/TVCG.2006.174;10.1109/TVCG.2011.231;10.1109/TVCG.2007.70590;10.1109/TVCG.2009.197;10.1109/TVCG.2006.148,"Volume exploration, volume classification, normalized cut, Information-guided exploration",43,40,46,BP
InfoVis,2014,Activity Sculptures: Exploring the Impact of Physical Visualizations on Running Activity,10.1109/TVCG.2014.2352953,http://dx.doi.org/10.1109/TVCG.2014.2352953,2201,2210,J,"Data sculptures are a promising type of visualizations in which data is given a physical form. In the past, they have mostly been used for artistic, communicative or educational purposes, and designers of data sculptures argue that in such situations, physical visualizations can be more enriching than pixel-based visualizations. We present the design of Activity Sculptures: data sculptures of running activity. In a three-week field study we investigated the impact of the sculptures on 14 participants' running activity, the personal and social behaviors generated by the sculptures, as well as participants' experiences when receiving these individual physical tokens generated from the specific data of their runs. The physical rewards generated curiosity and personal experimentation but also social dynamics such as discussion on runs or envy/competition. We argue that such passive (or calm) visualizations can complement nudging and other mechanisms of persuasion with a more playful and reflective look at ones' activity.",Simon Stusak;Aurélien Tabard;Franziska Sauka;Rohit Ashok Khot;Andreas Butz,Simon Stusak;Aurélien Tabard;Franziska Sauka;Rohit Ashok Khot;Andreas Butz,"University of Munich (LMU);Université de Lyon & CNRS, France;University of Munich (LMU);Exertion Games Lab, RMIT University;University of Munich (LMU)",10.1109/TVCG.2007.70541;10.1109/INFVIS.2003.1249031;10.1109/TVCG.2013.134,"Physical Visualizations, Activity Sculptures, Physical Activity, Data Sculptures, Behavioral Change",43,27,41,
SciVis,2014,Using Topological Analysis to Support Event-Guided Exploration in Urban Data,10.1109/TVCG.2014.2346449,http://dx.doi.org/10.1109/TVCG.2014.2346449,2634,2643,J,"The explosion in the volume of data about urban environments has opened up opportunities to inform both policy and administration and thereby help governments improve the lives of their citizens, increase the efficiency of public services, and reduce the environmental harms of development. However, cities are complex systems and exploring the data they generate is challenging. The interaction between the various components in a city creates complex dynamics where interesting facts occur at multiple scales, requiring users to inspect a large number of data slices over time and space. Manual exploration of these slices is ineffective, time consuming, and in many cases impractical. In this paper, we propose a technique that supports event-guided exploration of large, spatio-temporal urban data. We model the data as time-varying scalar functions and use computational topology to automatically identify events in different data slices. To handle a potentially large number of events, we develop an algorithm to group and index them, thus allowing users to interactively explore and query event patterns on the fly. A visual exploration interface helps guide users towards data slices that display interesting events and trends. We demonstrate the effectiveness of our technique on two different data sets from New York City (NYC): data about taxi trips and subway service. We also report on the feedback we received from analysts at different NYC agencies.",Harish Doraiswamy;Nivan Ferreira;Theodoros Damoulas;Juliana Freire;Cláudio T. Silva,Harish Doraiswamy;Nivan Ferreira;Theodoros Damoulas;Juliana Freire;Cláudio T. Silva,New York University;New York University;New York University;New York University;New York University,10.1109/TVCG.2013.130;10.1109/TVCG.2007.70574;10.1109/VAST.2008.4677356;10.1109/VISUAL.2004.96;10.1109/TVCG.2013.179;10.1109/TVCG.2006.186;10.1109/VAST.2008.4677354;10.1109/TVCG.2013.226;10.1109/TVCG.2013.228;10.1109/VAST.2012.6400557;10.1109/VAST.2011.6102454;10.1109/TVCG.2013.131,"Computational topology, event detection, spatio-temporal index, urban data, visual exploration",43,36,56,
VAST,2015,Supporting Iterative Cohort Construction with Visual Temporal Queries,10.1109/TVCG.2015.2467622,http://dx.doi.org/10.1109/TVCG.2015.2467622,91,100,J,"Many researchers across diverse disciplines aim to analyze the behavior of cohorts whose behaviors are recorded in large event databases. However, extracting cohorts from databases is a difficult yet important step, often overlooked in many analytical solutions. This is especially true when researchers wish to restrict their cohorts to exhibit a particular temporal pattern of interest. In order to fill this gap, we designed COQUITO, a visual interface that assists users defining cohorts with temporal constraints. COQUITO was designed to be comprehensible to domain experts with no preknowledge of database queries and also to encourage exploration. We then demonstrate the utility of COQUITO via two case studies, involving medical and social media researchers.",Josua Krause;Adam Perer;Harry Stavropoulos,Josua Krause;Adam Perer;Harry Stavropoulos,NYU;IBM T.J. Watson Research Center;IBM T.J. Watson Research Center,10.1109/TVCG.2011.185;10.1109/VAST.2007.4389013;10.1109/VAST.2006.261421;10.1109/TVCG.2014.2346682;10.1109/VAST.2010.5652890;10.1109/TVCG.2014.2346482;10.1109/TVCG.2013.200;10.1109/TVCG.2013.206;10.1109/TVCG.2009.117;10.1109/INFVIS.2001.963273;10.1109/TVCG.2012.225;10.1109/TVCG.2013.167,"Visual temporal queries, cohort definition, electronic medical records, information visualization",43,40,44,
VAST,2015,egoSlider: Visual Analysis of Egocentric Network Evolution,10.1109/TVCG.2015.2468151,http://dx.doi.org/10.1109/TVCG.2015.2468151,260,269,J,"Ego-network, which represents relationships between a specific individual, i.e., the ego, and people connected to it, i.e., alters, is a critical target to study in social network analysis. Evolutionary patterns of ego-networks along time provide huge insights to many domains such as sociology, anthropology, and psychology. However, the analysis of dynamic ego-networks remains challenging due to its complicated time-varying graph structures, for example: alters come and leave, ties grow stronger and fade away, and alter communities merge and split. Most of the existing dynamic graph visualization techniques mainly focus on topological changes of the entire network, which is not adequate for egocentric analytical tasks. In this paper, we present egoSlider, a visual analysis system for exploring and comparing dynamic ego-networks. egoSlider provides a holistic picture of the data through multiple interactively coordinated views, revealing ego-network evolutionary patterns at three different layers: a macroscopic level for summarizing the entire ego-network data, a mesoscopic level for overviewing specific individuals' ego-network evolutions, and a microscopic level for displaying detailed temporal information of egos and their alters. We demonstrate the effectiveness of egoSlider with a usage scenario with the DBLP publication records. Also, a controlled user study indicates that in general egoSlider outperforms a baseline visualization of dynamic networks for completing egocentric analytical tasks.",Yanhong Wu;Naveen Pitipornvivat;Jian Zhao 0010;Sixiao Yang;Guowei Huang;Huamin Qu,Yanhong Wu;Naveen Pitipornvivat;Jian Zhao;Sixiao Yang;Guowei Huang;Huamin Qu,Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Autodesk Research;Huawei Technologies Co. Ltd.;Huawei Technologies Co. Ltd.;Hong Kong University of Science and Technology,10.1109/TVCG.2011.169;10.1109/TVCG.2011.226;10.1109/TVCG.2006.147;10.1109/TVCG.2013.149,"Egocentric network, dynamic graph, network visualization, glyph-based design, visual analytics",43,44,53,
Vis,1993,Visualization of turbulent flow with particles,10.1109/VISUAL.1993.398850,http://dx.doi.org/10.1109/VISUAL.1993.398850,46,52,C,"In this work a new method for visualization of three-dimensional turbulent flow using particle motion animation is presented. The method is based on Reynolds decomposition of a turbulent flow field into a convective and a turbulent motion. At each step of particle path generation a stochastic perturbation is added, resulting in random-walk motions of particles. A physical relation is established between the perturbations and the eddy-diffusivity, which is calculated in a turbulent flow simulation. The flow data used is a mean velocity field, and an eddy-diffusivity field. The erratic particle motions are more than just a visual effect, but represent a real physical phenomenon. An implementation of the method is described, and an example of a turbulent channel flow is given, which clearly shows the random particle motions in their context of general fluid motion patterns.&lt;&lt;ETX&gt;&gt;",Andrea J. S. Hin;Frits H. Post,A.J.S. Hin;F.H. Post,"Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands;Fac. of Tech. Math. & Inf., Delft Univ. of Technol., Netherlands",,,42,19,23,
Vis,1994,Integrated control of distributed volume visualization through the World-Wide-Web,10.1109/VISUAL.1994.346342,http://dx.doi.org/10.1109/VISUAL.1994.346342,13,20,C,"The World-Wide-Web (WWW) has created a new paradigm for online information retrieval by providing immediate and ubiquitous access to digital information of any type from data repositories located throughout the world. The web's development enables not only effective access for the generic user but also more efficient and timely information exchange among scientists and researchers. We have extended the capabilities of the web to include access to three-dimensional volume data sets with integrated control of a distributed client-server volume visualization system. This paper provides a brief background on the World-Wide-Web, an overview of the extensions necessary to support these new data types and a description of an implementation of this approach in a WWW-compliant distributed visualization system.&lt;&lt;ETX&gt;&gt;",Cheong S. Ang;David C. Martin;Michael D. Doyle,C.S. Ang;D.C. Martin;M.D. Doyle,"Libr. & Center for Knowledge Manage., California Univ., San Francisco, CA, USA;Libr. & Center for Knowledge Manage., California Univ., San Francisco, CA, USA;Libr. & Center for Knowledge Manage., California Univ., San Francisco, CA, USA",10.1109/VISUAL.1992.235231,,42,10,27,
InfoVis,1996,Distortion viewing techniques for 3-dimensional data,10.1109/INFVIS.1996.559215,http://dx.doi.org/10.1109/INFVIS.1996.559215,46,"53, 119",C,"As the use of 3D information presentation becomes more prevalent, the need for effective viewing tools grows accordingly. Much work has been done in developing tools for 2D spaces which allow for detail in context views. We examine the extension of such 2D methods to 3D and explore the limitations encountered in accessing internal regions of the data with these methods. We then describe a novel solution to this problem of internal access with the introduction of a distortion function which creates a clear line of sight to the focus revealing sections previously obscured. The distortion is symmetric about the line of sight and is smoothly integrated back into the original 3D layout.",Sheelagh Carpendale;David J. Cowperthwaite;F. David Fracchia,M. Sheelagh T. Carpendale;D.J. Cowperthwaite;F.D. Fracchia,"Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada",,"distortion viewing, screen layout, 3D interaction, information visualization, interface metaphors, interface design issues",42,14,21,
InfoVis,1996,Animating multidimensional scaling to visualize N-dimensional data sets,10.1109/INFVIS.1996.559223,http://dx.doi.org/10.1109/INFVIS.1996.559223,72,"73, 126",M,"Many techniques have been developed for visualizing multivariate (multidimensional) data. Most, if not all, are limited by the number of dimensions which can be effectively displayed. Multidimensional scaling (MDS) is an iterative non-linear technique for projecting n-D data down to a lower number of dimensions. This work presents extensions to MDS that enhance visualization of high-dimensional data sets. These extensions include animation, stochastic perturbation, and flow visualization techniques.",Chris Bentley;Matthew O. Ward,C.L. Bentley;M.O. Ward,"Dept. of Comput. Sci., Worcester Polytech. Inst., MA, USA",,,42,24,5,
Vis,1997,Integrated volume compression and visualization,10.1109/VISUAL.1997.663900,http://dx.doi.org/10.1109/VISUAL.1997.663900,329,336,C,"Volumetric data sets require enormous storage capacity even at moderate resolution levels. The excessive storage demands not only stress the capacity of the underlying storage and communications systems, but also seriously limit the speed of volume rendering due to data movement and manipulation. A novel volumetric data visualization scheme is proposed and implemented in this work that renders 2D images directly from compressed 3D data sets. The novelty of this algorithm is that rendering is performed on the compressed representation of the volumetric data without pre-decompression. As a result, the overheads associated with both data movement and rendering processing are significantly reduced. The proposed algorithm generalizes previously proposed whole-volume frequency-domain rendering schemes by first dividing the 3D data set into subcubes, transforming each subcube to a frequency-domain representation, and applying the Fourier projection theorem to produce the projected 2D images according to given viewing angles. Compared to the whole-volume approach, the subcube-based scheme not only achieves higher compression efficiency by exploiting local coherency, but also improves the quality of resultant rendering images because it approximates the occlusion effect on a subcube by subcube basis.",Tzi-cker Chiueh;Chuan-Kai Yang;Taosong He;Hanspeter Pfister;Arie E. Kaufman,Tzi-Cker Chiueh;Chuan-Kai Yang;Taosong He;H. Pfister;A. Kaufman,"Center for Visual Comput., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1993.398845,"Volume Compression, Fourier Projection Theorem, Discrete Hartley Transform, Image Compositing",42,5,16,
Vis,2001,"Visualization of Sports using Motion Trajectories: Providing Insights into Performance, Style, and Strategy",10.1109/VISUAL.2001.964496,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2001.964496,75,82,C,"Remote experience of sporting events has thus far been limited mostly to watching video and the scores and statistics associated with the sport. However, a fast-developing trend is the use of visualization techniques to give new insights into performance, style, and strategy of the players. Automated techniques can extract accurate information from video about player performance that not even the most skilled observer is able to discern. When presented as static images or as a three-dimensional virtual replay, this information makes viewing a game an entirely new and exciting experience. This paper presents one such sports visualization system called LucentVision, which has been developed for the sport of tennis. LucentVision uses real-time video analysis to obtain motion trajectories of players and the ball, and offers a rich set of visualization options based on this trajectory data. The system has been used extensively in the broadcast of international tennis tournaments, both on television and the Internet.",Gopal Sarma Pingali;Agata Opalach;Yves Jean;Ingrid Carlbom,G. Pingali;A. Opalach;Y. Jean;I. Carlbom,"IBM Thomas J. Watson Res. Center, Hawthorne, NY, USA",10.1109/VISUAL.1997.663893,"sports visualization, virtual environment, telepresence, real-time video analysis, multi-camera tracking, multimedia indexing",42,16,26,
Vis,2002,Visualizing dynamic molecular conformations,10.1109/VISUAL.2002.1183780,http://dx.doi.org/10.1109/VISUAL.2002.1183780,235,242,C,"The bioactivity of a molecule strongly depends on its metastable conformational shapes and the transitions between these. Therefore, conformation analysis and visualization is a basic prerequisite for the understanding of biochemical processes. We present techniques for visual analysis of metastable molecular conformations. Core of these are flexibly applicable methods for alignment of molecular geometries, as well as methods for depicting shape and 'fuzziness' of metastable conformations. All analysis tools are provided in an integrated working environment. The described techniques are demonstrated with pharmaceutically active biomolecules.",Johannes Schmidt-Ehrenberg;Daniel Baum;Hans-Christian Hege,J. Schmidt-Ehrenberg;D. Baum;H.-C. Hege,"Zuse Inst. Berlin (ZIB), Germany;Zuse Inst. Berlin (ZIB), Germany;Zuse Inst. Berlin (ZIB), Germany",10.1109/VISUAL.2000.885733,"uncertainty visualization, molecular conformation analysis, molecular modeling, drug design",42,12,18,
InfoVis,2004,IN-SPIRE InfoVis 2004 Contest Entry,10.1109/INFVIS.2004.37,http://dx.doi.org/10.1109/INFVIS.2004.37,r2,r2,M,"This is the first part (summary) of a three-part contest entry submitted to IEEE InfoVis 2004. The contest topic is visualizing InfoVis symposium papers from 1995 to 2002 and their references. The paper introduces the visualization tool IN-SPIRE, the visualization process and results, and presents lessons learned.",Pak Chung Wong;Elizabeth G. Hetzler;Christian Posse;Mark A. Whiting;Susan L. Havre;Nick Cramer;Anuj R. Shah;Mudita Singhal;Alan Turner;James J. Thomas,Pak Chung Wong;B. Hetzler;C. Posse;M. Whiting;S. Havre;N. Cramer;Anuj Shah;M. Singhal;A. Turner;J. Thomas,Pacific Northwest National Laboratory,,,42,15,5,
InfoVis,2004,Value and Relation Display for Interactive Exploration of High Dimensional Datasets,10.1109/INFVIS.2004.71,http://dx.doi.org/10.1109/INFVIS.2004.71,73,80,C,"Traditional multidimensional visualization techniques, such as glyphs, parallel coordinates and scatterplot matrices, suffer from clutter at the display level and difficult user navigation among dimensions when visualizing high dimensional datasets. In this paper, we propose a new multidimensional visualization technique named a value and relation (VaR) display, together with a rich set of navigation and selection tools, for interactive exploration of datasets with up to hundreds of dimensions. By explicitly conveying the relationships among the dimensions of a high dimensional dataset, the VaR display helps users grasp the associations among dimensions. By using pixel-oriented techniques to present values of the data items in a condensed manner, the VaR display reveals data patterns in the dataset using as little screen space as possible. The navigation and selection tools enable users to interactively reduce clutter, navigate within the dimension space, and examine data value details within context effectively and efficiently. The VaR display scales well to datasets with large numbers of data items by employing sampling and texture mapping. A case study on a real dataset, as well as the VaR displays of multiple real datasets throughout the paper, reveals how our proposed approach helps users interactively explore high dimensional datasets with large numbers of data items",Jing Yang 0001;Anilkumar Patro;Shiping Huang;Nishant K. Mehta;Matthew O. Ward;Elke A. Rundensteiner,Jing Yang;A. Patro;Shiping Huang;N. Mehta;M.O. Ward;E.A. Rundensteiner,Worcester Polytechnic Institute,10.1109/INFVIS.1998.729559;10.1109/INFVIS.2003.1249015;10.1109/VISUAL.1994.346302;10.1109/INFVIS.2003.1249014;10.1109/INFVIS.1995.528686;10.1109/VISUAL.1995.485140,"Multi-dimensional visualization, pixel-oriented, multi-dimensional scaling, high dimensional datasets",42,20,24,
Vis,2005,Stream-processing points,10.1109/VISUAL.2005.1532801,http://dx.doi.org/10.1109/VISUAL.2005.1532801,239,246,C,"With the growing size of captured 3D models it has become increasingly important to provide basic efficient processing methods for large unorganized raw surface-sample point data sets. In this paper we introduce a novel stream-based (and out-of-core) point processing framework. The proposed approach processes points in an orderly sequential way by sorting them and sweeping along a spatial dimension. The major advantages of this new concept are: (1) support of extensible and concatenate local operators called stream operators, (2) low main-memory usage and (3) applicability to process very large data sets out-of-core.",Renato Pajarola,R. Pajarola,"Dept. of Informatics, Zurich Univ., Switzerland",10.1109/VISUAL.2001.964489;10.1109/VISUAL.2000.885721;10.1109/VISUAL.2002.1183770;10.1109/VISUAL.2003.1250408;10.1109/VISUAL.2005.1532800;10.1109/VISUAL.2002.1183771,"point processing, sequential processing, normal estimation, curvature estimation, fairing",42,5,40,
InfoVis,2006,Visual Analysis of Multivariate State Transition Graphs,10.1109/TVCG.2006.192,http://dx.doi.org/10.1109/TVCG.2006.192,685,692,J,"We present a new approach for the visual analysis of state transition graphs. We deal with multivariate graphs where a number of attributes are associated with every node. Our method provides an interactive attribute-based clustering facility. Clustering results in metric, hierarchical and relational data, represented in a single visualization. To visualize hierarchically structured quantitative data, we introduce a novel technique: the bar tree. We combine this with a node-link diagram to visualize the hierarchy and an arc diagram to visualize relational data. Our method enables the user to gain significant insight into large state transition graphs containing tens of thousands of nodes. We illustrate the effectiveness of our approach by applying it to a real-world use case. The graph we consider models the behavior of an industrial wafer stepper and contains 55 043 nodes and 289 443 edges",A. Johannes Pretorius;Jarke J. van Wijk,A. Johannes Pretorius;Jarke J. Van Wijk,"Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, PO Box 513, 5600 MB Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, PO Box 513, 5600 MB Eindhoven, The Netherlands",10.1109/INFVIS.2002.1173153;10.1109/INFVIS.2002.1173155;10.1109/VISUAL.1991.175796;10.1109/VISUAL.2002.1183778;10.1109/INFVIS.2003.1249028,"Graph visualization, multivariate visualization, interactive clustering, state spaces, transition systems, finite state machines",42,29,19,
Vis,2007,Variable Interactions in Query-Driven Visualization,10.1109/TVCG.2007.70519,http://dx.doi.org/10.1109/TVCG.2007.70519,1400,1407,J,"Our ability to generate ever-larger, increasingly-complex data, has established the need for scalable methods that identify, and provide insight into, important variable trends and interactions. Query-driven methods are among the small subset of techniques that are able to address both large and highly complex datasets. This paper presents a new method that increases the utility of query-driven techniques by visually conveying statistical information about the trends that exist between variables in a query. In this method, correlation fields, created between pairs of variables, are used with the cumulative distribution functions of variables expressed in a users query. This integrated use of cumulative distribution functions and correlation fields visually reveals, with respect to the solution space of the query, statistically important interactions between any three variables, and allows for trends between these variables to be readily identified. We demonstrate our method by analyzing interactions between variables in two flame-front simulations.",Luke J. Gosink;John C. Anderson;E. Wes Bethel;Kenneth I. Joy,Luke Gosink;John Anderson;Wes Bethel;Kenneth Joy,"Institute for Data Analysis and Visualization (IDAV), University of California, Davis;Institute for Data Analysis and Visualization (IDAV), University of California, Davis;Computing Sciences Division and Scientific Visualization Group, Lawrence Berkeley National Laboratory;Institute for Data Analysis and Visualization (IDAV), University of California, Davis",10.1109/VISUAL.2004.68;10.1109/VISUAL.2005.1532792;10.1109/VISUAL.1999.809866;10.1109/TVCG.2006.165;10.1109/VISUAL.2003.1250362,"Multivariate Data, Query-Driven Visualization",42,37,22,
VAST,2008,VAST 2008 Challenge: Introducing mini-challenges,10.1109/VAST.2008.4677383,http://dx.doi.org/10.1109/VAST.2008.4677383,,,M,"Visual analytics experts realize that one effective way to push the field forward and to develop metrics for measuring the performance of various visual analytics components is to hold an annual competition. The VAST 2008 Challenge is the third year that such a competition was held in conjunction with the IEEE Visual Analytics Science and Technology (VAST) symposium. The authors restructured the contest format used in 2006 and 2007 to reduce the barriers to participation and offered four mini-challenges and a Grand Challenge. Mini Challenge participants were to use visual analytic tools to explore one of four heterogeneous data collections to analyze specific activities of a fictitious, controversial movement. Questions asked in the Grand Challenge required the participants to synthesize data from all four data sets. In this paper we give a brief overview of the data sets, the tasks, the participation, the judging, and the results.",Georges G. Grinstein;Catherine Plaisant;Sharon J. Laskowski;Teresa O'Connell;Jean Scholtz;Mark A. Whiting,Georges Grinstein;Catherine Plaisant;Sharon Laskowski;Theresa O'Connell;Jean Scholtz;Mark Whiting,"University of Massachusetts, Lowell, USA;University of Maryland, USA;National Institute of Standards and Technology, USA;National Institute of Standards and Technology, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA",,,42,23,6,
Vis,2008,Interactive Volume Exploration for Feature Detection and Quantification in Industrial CT Data,10.1109/TVCG.2008.147,http://dx.doi.org/10.1109/TVCG.2008.147,1507,1514,J,"This paper presents a novel method for interactive exploration of industrial CT volumes such as cast metal parts, with the goal of interactively detecting, classifying, and quantifying features using a visualization-driven approach. The standard approach for defect detection builds on region growing, which requires manually tuning parameters such as target ranges for density and size, variance, as well as the specification of seed points. If the results are not satisfactory, region growing must be performed again with different parameters. In contrast, our method allows interactive exploration of the parameter space, completely separated from region growing in an unattended pre-processing stage. The pre-computed feature volume tracks a feature size curve for each voxel over time, which is identified with the main region growing parameter such as variance. A novel 3D transfer function domain over (density, feature.size, time) allows for interactive exploration of feature classes. Features and feature size curves can also be explored individually, which helps with transfer function specification and allows coloring individual features and disabling features resulting from CT artifacts. Based on the classification obtained through exploration, the classified features can be quantified immediately.",Markus Hadwiger;Laura Fritz;Christof Rezk-Salama;Thomas Höllt;Georg Geier;Thomas Pabel,Markus Hadwiger;Fritz Laura;Christof Rezk-Salama;Thomas Höllt;Georg Geier;Thomas Pabel,"VRVis Research Center, Austria;VRVis Research Center, Austria;University of Siegen, Germany;VRVis Research Center, Austria;Austrian Foundry Research Institute;Austrian Foundry Research Institute",10.1109/VISUAL.2003.1250418;10.1109/VISUAL.2001.964519;10.1109/VISUAL.1997.663875;10.1109/VISUAL.2001.964516,"Non-Destructive Testing, Multi-Dimensional Transfer Functions, Region Growing, Volume Rendering",42,39,18,
VAST,2010,Towards the Personal Equation of Interaction: The impact of personality factors on visual analytics interface interaction,10.1109/VAST.2010.5653587,http://dx.doi.org/10.1109/VAST.2010.5653587,203,210,C,"These current studies explored the impact of individual differences in personality factors on interface interaction and learning performance behaviors in both an interactive visualization and a menu-driven web table in two studies. Participants were administered 3 psychometric measures designed to assess Locus of Control, Extraversion, and Neuroticism. Participants were then asked to complete multiple procedural learning tasks in each interface. Results demonstrated that all three measures predicted completion times. Additionally, results analyses demonstrated personality factors also predicted the number of insights participants reported while completing the tasks in each interface. We discuss how these findings advance our ongoing research in the Personal Equation of Interaction.",Tera Marie Green;Brian D. Fisher,Tear Marie Green;Brian Fisher,School of Interactive Arts &#x002B; Technology Simon Fraser University;School of Interactive Arts &#x002B; Technology Simon Fraser University,,"visual analytics, cognition and perception theory, embodied cognition, visualization taxonomies and models",42,25,25,
InfoVis,2011,BirdVis: Visualizing and Understanding Bird Populations,10.1109/TVCG.2011.176,http://dx.doi.org/10.1109/TVCG.2011.176,2374,2383,J,"Birds are unrivaled windows into biotic processes at all levels and are proven indicators of ecological well-being. Understanding the determinants of species distributions and their dynamics is an important aspect of ecology and is critical for conservation and management. Through crowdsourcing, since 2002, the eBird project has been collecting bird observation records. These observations, together with local-scale environmental covariates such as climate, habitat, and vegetation phenology have been a valuable resource for a global community of educators, land managers, ornithologists, and conservation biologists. By associating environmental inputs with observed patterns of bird occurrence, predictive models have been developed that provide a statistical framework to harness available data for predicting species distributions and making inferences about species-habitat associations. Understanding these models, however, is challenging because they require scientists to quantify and compare multiscale spatialtemporal patterns. A large series of coordinated or sequential plots must be generated, individually programmed, and manually composed for analysis. This hampers the exploration and is a barrier to making the cross-species comparisons that are essential for coordinating conservation and extracting important ecological information. To address these limitations, as part of a collaboration among computer scientists, statisticians, biologists and ornithologists, we have developed BirdVis, an interactive visualization system that supports the analysis of spatio-temporal bird distribution models. BirdVis leverages visualization techniques and uses them in a novel way to better assist users in the exploration of interdependencies among model parameters. Furthermore, the system allows for comparative visualization through coordinated views, providing an intuitive interface to identify relevant correlations and patterns. We justify our design decisions and present case studies that show how BirdVis has helped scientists obtain new evidence for existing hypotheses, as well as formulate new hypotheses in their domain.",Nivan Ferreira;Lauro Didier Lins;Daniel Fink;Steve Kelling;Christopher Wood;Juliana Freire;Cláudio T. Silva,Nivan Ferreira;Lauro Lins;Daniel Fink;Steve Kelling;Christopher Wood;Juliana Freire;Claudio Silva,University of Utah;University of Utah;Cornell Lab of Ornithology;Cornell Lab of Ornithology;Cornell Lab of Ornithology;University of Utah;University of Utah,10.1109/VISUAL.2001.964510;10.1109/VISUAL.1990.146361;10.1109/TVCG.2010.194;10.1109/TVCG.2010.130;10.1109/TVCG.2007.70570;10.1109/TVCG.2008.153,"Ornithology, species distribution models, multiscale analysis, spatial data, temporal data",42,30,46,
InfoVis,2011,"VisBricks: Multiform Visualization of Large, Inhomogeneous Data",10.1109/TVCG.2011.250,http://dx.doi.org/10.1109/TVCG.2011.250,2291,2300,J,"Large volumes of real-world data often exhibit inhomogeneities: vertically in the form of correlated or independent dimensions and horizontally in the form of clustered or scattered data items. In essence, these inhomogeneities form the patterns in the data that researchers are trying to find and understand. Sophisticated statistical methods are available to reveal these patterns, however, the visualization of their outcomes is mostly still performed in a one-view-fits-all manner, In contrast, our novel visualization approach, VisBricks, acknowledges the inhomogeneity of the data and the need for different visualizations that suit the individual characteristics of the different data subsets. The overall visualization of the entire data set is patched together from smaller visualizations, there is one VisBrick for each cluster in each group of interdependent dimensions. Whereas the total impression of all VisBricks together gives a comprehensive high-level overview of the different groups of data, each VisBrick independently shows the details of the group of data it represents, State-of-the-art brushing and visual linking between all VisBricks furthermore allows the comparison of the groupings and the distribution of data items among them. In this paper, we introduce the VisBricks visualization concept, discuss its design rationale and implementation, and demonstrate its usefulness by applying it to a use case from the field of biomedicine.",Alexander Lex;Hans-Jörg Schulz;Marc Streit;Christian Partl;Dieter Schmalstieg,Alexander Lex;Hans-Jorg Schulz;Marc Streit;Christian Partl;Dieter Schmalstieg,Graz University of Technology;Graz University of Technology;Graz University of Technology;Graz University of Technology;Graz University of Technology,10.1109/INFVIS.2005.1532129;10.1109/TVCG.2010.138;10.1109/TVCG.2006.120;10.1109/TVCG.2007.70582;10.1109/INFVIS.2003.1249006;10.1109/TVCG.2006.147;10.1109/TVCG.2009.167;10.1109/TVCG.2010.216;10.1109/TVCG.2006.166,"Inhomogeneous data, multiple coordinated views, multiform visualization",42,34,34,
Vis,2011,Load-Balanced Parallel Streamline Generation on Large Scale Vector fields,10.1109/TVCG.2011.219,http://dx.doi.org/10.1109/TVCG.2011.219,1785,1794,J,"Because of the ever increasing size of output data from scientific simulations, supercomputers are increasingly relied upon to generate visualizations. One use of supercomputers is to generate field lines from large scale flow fields. When generating field lines in parallel, the vector field is generally decomposed into blocks, which are then assigned to processors. Since various regions of the vector field can have different flow complexity, processors will require varying amounts of computation time to trace their particles, causing load imbalance, and thus limiting the performance speedup. To achieve load-balanced streamline generation, we propose a workload-aware partitioning algorithm to decompose the vector field into partitions with near equal workloads. Since actual workloads are unknown beforehand, we propose a workload estimation algorithm to predict the workload in the local vector field. A graph-based representation of the vector field is employed to generate these estimates. Once the workloads have been estimated, our partitioning algorithm is hierarchically applied to distribute the workload to all partitions. We examine the performance of our workload estimation and workload-aware partitioning algorithm in several timings studies, which demonstrates that by employing these methods, better scalability can be achieved with little overhead.",Boonthanome Nouanesengsy;Teng-Yok Lee;Han-Wei Shen,Boonthanome Nouanesengsy;Teng-Yok Lee;Han-Wei Shen,The Ohio State University;The Ohio State University;The Ohio State University,,"Flow visualization, Parallel processing, 3D vector field visualization, Streamlines",42,36,24,
VAST,2012,"Just-in-time annotation of clusters, outliers, and trends in point-based data visualizations",10.1109/VAST.2012.6400487,http://dx.doi.org/10.1109/VAST.2012.6400487,73,82,C,"We introduce the concept of just-in-time descriptive analytics as a novel application of computational and statistical techniques performed at interaction-time to help users easily understand the structure of data as seen in visualizations. Fundamental to just-intime descriptive analytics is (a) identifying visual features, such as clusters, outliers, and trends, user might observe in visualizations automatically, (b) determining the semantics of such features by performing statistical analysis as the user is interacting, and (c) enriching visualizations with annotations that not only describe semantics of visual features but also facilitate interaction to support high-level understanding of data. In this paper, we demonstrate just-in-time descriptive analytics applied to a point-based multi-dimensional visualization technique to identify and describe clusters, outliers, and trends. We argue that it provides a novel user experience of computational techniques working alongside of users allowing them to build faster qualitative mental models of data by demonstrating its application on a few use-cases. Techniques used to facilitate just-in-time descriptive analytics are described in detail along with their runtime performance characteristics. We believe this is just a starting point and much remains to be researched, as we discuss open issues and opportunities in improving accessibility and collaboration.",Eser Kandogan,Eser Kandogan,"IBM Center for Advanced Visualization, IBM Research",10.1109/INFVIS.2003.1249015;10.1109/INFVIS.2005.1532142;10.1109/INFVIS.2004.3;10.1109/TVCG.2011.220;10.1109/INFVIS.2004.15;10.1109/INFVIS.1998.729559;10.1109/VAST.2006.261423;10.1109/TVCG.2009.153;10.1109/VAST.2010.5652885;10.1109/VAST.2009.5332628;10.1109/TVCG.2011.229,"Just-in-time descriptive analytics, feature identification and characterization, point-based visualizations",42,34,41,
InfoVis,2014,Constructing Visual Representations: Investigating the Use of Tangible Tokens,10.1109/TVCG.2014.2346292,http://dx.doi.org/10.1109/TVCG.2014.2346292,2102,2111,J,"The accessibility of infovis authoring tools to a wide audience has been identified as a major research challenge. A key task in the authoring process is the development of visual mappings. While the infovis community has long been deeply interested in finding effective visual mappings, comparatively little attention has been placed on how people construct visual mappings. In this paper, we present the results of a study designed to shed light on how people transform data into visual representations. We asked people to create, update and explain their own information visualizations using only tangible building blocks. We learned that all participants, most of whom had little experience in visualization authoring, were readily able to create and talk about their own visualizations. Based on our observations, we discuss participants' actions during the development of their visual representations and during their analytic activities. We conclude by suggesting implications for tool design to enable broader support for infovis authoring.",Samuel Huron;Yvonne Jansen;Sheelagh Carpendale,Samuel Huron;Yvonne Jansen;Sheelagh Carpendale,Inria and IRI;Inria and University of Copenhagen;University of Calgary,10.1109/TVCG.2009.176;10.1109/TVCG.2011.185;10.1109/TVCG.2013.227;10.1109/TVCG.2007.70577;10.1109/INFVIS.2004.64;10.1109/TVCG.2011.251;10.1109/VISUAL.1997.663890;10.1109/TVCG.2012.275;10.1109/TVCG.2013.134;10.1109/TVCG.2010.164;10.1109/TVCG.2007.70541;10.1109/TVCG.2012.199,"Constructive visualization, Physical visualization, Dynamic visualization, Empirical study, Token, Visualization authoring, Information visualization, Visual mapping, Novices, Visualization construction, Visual analytics",42,29,57,
Vis,1995,Optimization of time-dependent particle tracing using tetrahedral decomposition,10.1109/VISUAL.1995.485145,http://dx.doi.org/10.1109/VISUAL.1995.485145,321,"328, 468",C,"An efficient algorithm is presented for computing particle paths, streak lines and time lines in time-dependent flows with moving curvilinear grids. The integration, velocity interpolation, and step size control are all performed in physical space which avoids the need to transform the velocity field into computational space. This leads to higher accuracy because there are no Jacobian matrix approximations, and expensive matrix inversions are eliminated. Integration accuracy is maintained using an adaptive step size control scheme which is regulated by the path line curvature. The problem of point location and interpolation in physical space is simplified by decomposing hexahedral cells into tetrahedral cells. This enables the point location to be done analytically and substantially faster than with a Newton-Raphson iterative method. Results presented show this algorithm is up to six times faster than particle tracers which operate on hexahedral cells, and produces almost identical traces.",David N. Kenwright;David A. Lane,D.N. Kenwright;D.A. Lane,"Comput. Sci. Corp., NASA Ames Res. Center, Moffett Field, CA, USA;Comput. Sci. Corp., NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1993.398848;10.1109/VISUAL.1991.175771,,41,14,20,
Vis,1996,Flow visualization for turbomachinery design,10.1109/VISUAL.1996.568137,http://dx.doi.org/10.1109/VISUAL.1996.568137,381,384,C,"Visualization of CFD data for turbomachinery design poses some special requirements which are often not addressed by standard flow visualization systems. The authors discuss the issues involved with this particular application and its requirements with respect to flow visualization. Aiming at a feature-based visualization for this task, they examine various existing techniques to locate vortices. The specific flow conditions for turbomachines demonstrate limitations of current methods. Visualization of turbomachinery flow thus raises some challenges and research topics, particularly regarding feature extraction.",Martin Roth;Ronald Peikert,M. Roth;R. Peikert,"Swiss Center for Sci. Comput., Eidgenossische Tech. Hochschule, Zurich, Switzerland",10.1109/VISUAL.1991.175773,,41,22,9,BCS
Vis,1996,"Time management, simultaneity and time-critical computation in interactive unsteady visualization environments",10.1109/VISUAL.1996.568117,http://dx.doi.org/10.1109/VISUAL.1996.568117,255,261,C,"The paper describes time management and time critical computing for a near real time interactive unsteady visualization environment. Subtle issues regarding the flow of time are described, formalized and addressed. The resulting system correctly reflects time behavior while allowing the user to control the flow of time. The problem of time critical computation is discussed and a solution is presented. These time critical algorithms provide control over the frame rate of a visualization system, allowing interactive exploration.",Steve Bryson;Sandy Johan,S. Bryson;S. Johan,"NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1995.485145,,41,14,12,
Vis,1996,Wavelets applied to lossless compression and progressive transmission of floating point data in 3-D curvilinear grids,10.1109/VISUAL.1996.568138,http://dx.doi.org/10.1109/VISUAL.1996.568138,385,388,C,"A method of lossless compression using wavelets is presented that enables progressive transmission of computational fluid dynamics (CFD) data in PLOT3D format. The floating point data is first converted to double-precision floating point format to maintain adequate precision throughout the transform process. It is then transformed using Haar wavelets-four times in two spatial dimensions, twice in the third spatial dimension, and twice in time for a total compression factor of 64 times. The double precision format will maintain enough precision during the transform to keep the process lossless. Next, the transformed data is compressed using Huffman coding and transmitted progressively using spectral selection. This allows most of the information to be transmitted in the first pass. Details are transmitted in later passes which ultimately provide for lossless reconstruction of the original data.",Aaron Trott;Robert J. Moorhead II;John McGinley,A. Trott;R. Moorhead;J. McGinley,"NSF Eng. Res. Center for CFS, Mississippi State Univ., MS, USA",10.1109/VISUAL.1994.346332,,41,19,3,
Vis,1997,Displaying data in multidimensional relevance space with 2D visualization maps,10.1109/VISUAL.1997.663868,http://dx.doi.org/10.1109/VISUAL.1997.663868,127,134,C,"The paper introduces a tool for visualizing a multidimensional relevance space. Abstractly, the information to be displayed consists of a large number of objects, a set of features that are likely to be of interest to the user, and some function that measures the relevance level of every object to the various features. The goal is to provide the user with a concise and comprehensible visualization of that information. For the type of applications concentrated on, the exact relevance measures of the objects are not significant. This enables accuracy to be traded for a clearer display. The idea is to ""flatten"" the multidimensionality of the feature space into a 2D ""relevance map"", capturing the inter-relations among the features, without causing too many ambiguous interpretations of the results. To better reflect the nature of the data and to resolve the ambiguity the authors refine the given set of features and introduce the notion of composed features. The layout of the map is then obtained by grading it according to a set of rules and using a simulated annealing algorithm which optimizes the layout with respect to these rules. The technique proposed has been implemented and tested, in the context of visualizing the result of a Web search, in the RMAP (Relevance Map) prototype system.",Jackie Assa;Daniel Cohen-Or;Tova Milo,J. Assa;D. Cohen-Or;T. Milo,"Dept. of Comput. Sci., Tel Aviv Univ., Israel",10.1109/INFVIS.1995.528691;10.1109/VISUAL.1990.146402;10.1109/INFVIS.1995.528686;10.1109/VISUAL.1993.398863;10.1109/INFVIS.1995.528692,,41,10,32,
Vis,1998,Battlefield visualization on the responsive workbench,10.1109/VISUAL.1998.745344,http://dx.doi.org/10.1109/VISUAL.1998.745344,463,466,C,"In this paper we describe a battlefield visualization system, called Dragon, which we have implemented on a virtual reality responsive workbench. The Dragon system has been successfully deployed as part of two large military exercises: the Hunter Warrior advanced warfighting experiment, in March 1997, and the Joint Counter Mine advanced concept tactical demonstration, in August and September 1997. We describe battlefield visualization, the Dragon system, and the workbench, and we describe our experiences as part of these two real-world deployments, with an emphasis on lessons learned and needed future work.",Jim Durbin;J. Edward Swan;Brad Colbert;John Crowe;Rob King;Tony King;Christopher Scannell;Zachary Wartell;Terry Welsh,J. Durbin;J.E. Swan;B. Colbert;J. Crowe;R. King;T. King;C. Scannell;Z. Wartell;T. Welsh,"Naval Res. Lab., Washington, DC, USA",10.1109/VISUAL.1996.568128,,41,17,11,
Vis,2000,FastSplats: optimized splatting on rectilinear grids,10.1109/VISUAL.2000.885698,http://dx.doi.org/10.1109/VISUAL.2000.885698,219,226,C,"Splatting is widely applied in many areas, including volume, point-based and image-based rendering. Improvements to splatting, such as eliminating popping and color bleeding, occasion-based acceleration, post-rendering classification and shading, have all been recently accomplished. These improvements share a common need for efficient frame-buffer accesses. We present an optimized software splatting package, using a newly designed primitive, called FastSplat, to scan-convert footprints. Our approach does not use texture mapping hardware, but supports the whole pipeline in memory. In such an integrated pipeline, we are then able to study the optimization strategies and address image quality issues. While this research is meant for a study of the inherent trade-off of splatting, our renderer, purely in software, achieves 3- to 5-fold speedups over a top-end texture hardware implementation (for opaque data sets). We further propose a method of efficient occlusion culling using a summed area table of opacity. 3D solid texturing and bump mapping capabilities are demonstrated to show the flexibility of such an integrated rendering pipeline. A detailed numerical error analysis, in addition to the performance and storage issues, is also presented. Our approach requires low storage and uses simple operations. Thus, it is easily implementable in hardware.",Jian Huang;Roger Crawfis;Naeem Shareef;Klaus Mueller,Jian Huang;K. Mueller;N. Shareef;R. Crawfis,"Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA",10.1109/VISUAL.1999.809909;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1999.809872,,41,9,22,
Vis,2002,TetFusion: an algorithm for rapid tetrahedral mesh simplification,10.1109/VISUAL.2002.1183767,http://dx.doi.org/10.1109/VISUAL.2002.1183767,133,140,C,"This paper introduces an algorithm for rapid progressive simplification of tetrahedral meshes: TetFusion. We describe how a simple geometry decimation operation steers a rapid and controlled progressive simplification of tetrahedral meshes, while also taking care of complex mesh-inconsistency problems. The algorithm features a high decimation ratio per step, and inherently discourages any cases of self-intersection of boundary, element-boundary intersection at concave boundary-regions, and negative volume tetrahedra (flipping). We achieved rigorous reduction ratios of up to 98% for meshes consisting of 827,904 elements in less than 2 minutes, progressing through a series of level-of-details (LoDs) of the mesh in a controlled manner. We describe how the approach supports a balanced re-distribution of space between tetrahedral elements, and explain some useful control parameters that make it faster and more intuitive than 'edge collapse'-based decimation methods for volumetric meshes. Finally, we discuss how this approach can be employed for rapid LoD prototyping of large time-varying datasets as an aid to interactive visualization.",Prashant Chopra;Jörg Meyer 0003,P. Chopra;J. Meyer,"Eng. Res. Center, Mississippi State Univ., MS, USA;Eng. Res. Center, Mississippi State Univ., MS, USA",10.1109/VISUAL.1998.745329;10.1109/VISUAL.1997.663883;10.1109/VISUAL.1999.809868;10.1109/VISUAL.2000.885680;10.1109/VISUAL.1998.745315;10.1109/VISUAL.1999.809901,"mesh simplification, multi resolution, level-of-detail, unstructured meshes",41,15,23,
Vis,2003,Monte Carlo volume rendering,10.1109/VISUAL.2003.1250406,http://dx.doi.org/10.1109/VISUAL.2003.1250406,449,456,C,"In this paper a novel volume-rendering technique based on Monte Carlo integration is presented. As a result of a preprocessing, a point cloud of random samples is generated using a normalized continuous reconstruction of the volume as a probability density function. This point cloud is projected onto the image plane, and to each pixel an intensity value is assigned which is proportional to the number of samples projected onto the corresponding pixel area. In such a way a simulated X-ray image of the volume can be obtained. Theoretically, for a fixed image resolution, there exists an M number of samples such that the average standard deviation of the estimated pixel intensities us under the level of quantization error regardless of the number of voxels. Therefore Monte Carlo Volume Rendering (MCVR) is mainly proposed to efficiently visualize large volume data sets. Furthermore, network applications are also supported, since the trade-off between image quality and interactivity can be adapted to the bandwidth of the client/server connection by using progressive refinement.",Balázs Csébfalvi;László Szirmay-Kalos,B. Csebfalvi;L. Szirmay-Kalos,"Dept. of Control Eng. & Inf. Technol., Budapest Tech. Univ., Hungary;Dept. of Control Eng. & Inf. Technol., Budapest Tech. Univ., Hungary",10.1109/VISUAL.2002.1183757;10.1109/VISUAL.2001.964490;10.1109/VISUAL.2002.1183777," X-ray volume rendering, Monte Carlo integration, importance sampling, progressive refinement",41,19,35,
Vis,2004,Display of vector fields using a reaction-diffusion model,10.1109/VISUAL.2004.25,http://dx.doi.org/10.1109/VISUAL.2004.25,115,122,C,"Effective visualization of vector fields relies on the ability to control the size and density of the underlying mapping to visual cues used to represent the field. In this paper we introduce the use of a reaction-diffusion model, already well known for its ability to form irregular spatio-temporal patters, to control the size, density, and placement of the vector field representation. We demonstrate that it is possible to encode vector field information (orientation and magnitude) into the parameters governing a reaction-diffusion model to form a spot pattern with the correct orientation, size, and density, creating an effective visualization. To encode direction we texture the spots using a light to dark fading texture. We also show that it is possible to use the reaction-diffusion model to visualize an additional scalar value, such as the uncertainty in the orientation of the vector field. An additional benefit of the reaction-diffusion visualization technique arises from its automatic density distribution. This benefit suggests using the technique to augment other vector visualization techniques. We demonstrate this utility by augmenting a LIC visualization with a reaction-diffusion visualization. Finally, the reaction-diffusion visualization method provides a technique that can be used for streamline and glyph placement.",Allen R. Sanderson;Christopher R. Johnson 0001;Robert Michael Kirby,A.R. Sanderson;C.R. Johnson;R.M. Kirby,"Sci. Comput. & Imaging Inst., Utah Univ., Salt Lake City, UT, USA;Sci. Comput. & Imaging Inst., Utah Univ., Salt Lake City, UT, USA;Sci. Comput. & Imaging Inst., Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.1999.809865;10.1109/VISUAL.1995.480817;10.1109/VISUAL.1995.485141;10.1109/VISUAL.2000.885688;10.1109/VISUAL.1996.567784;10.1109/VISUAL.1992.235211;10.1109/VISUAL.1992.235225;10.1109/TVCG.2009.126;10.1109/VISUAL.1996.567777;10.1109/VISUAL.2003.1250357;10.1109/VISUAL.1999.809904;10.1109/VISUAL.1999.809905;10.1109/VISUAL.1991.175789;10.1109/VISUAL.1997.663897,"Vector Field Visualization, Flow Visualization, Reaction-Diffusion, Vector Fields",41,17,33,
InfoVis,2005,Visualization of graphs with associated timeseries data,10.1109/INFVIS.2005.1532151,http://dx.doi.org/10.1109/INFVIS.2005.1532151,225,232,C,"The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a visual property (e.g. color) of the vertex, along with sliders or some such mechanism to animate the graph for other timepoints. Alternatively, data from all the timepoints can be overlaid simultaneously by embedding small charts into graph vertices. These graph visualizations may also be linked to other visualizations (e.g., parallel co-ordinates) using brushing and linking. This paper describes a study performed to evaluate and rank graph+timeseries visualization options based on users' performance time and accuracy of responses on predefined tasks. The results suggest that overlaying data on graph vertices one timepoint at a time may lead to more accurate performance for tasks involving analysis of a graph at a single timepoint, and comparisons between graph vertices for two distinct timepoints. Overlaying data simultaneously for all the timepoints on graph vertices may lead to more accurate and faster performance for tasks involving searching for outlier vertices displaying different behavior than the rest of the graph vertices for all timepoints. Single views have advantage over multiple views on tasks that require topological information. Also, the number of attributes displayed on nodes has a non trivial influence on accuracy of responses, whereas the number of visualizations affect the performance time.",Purvi Saraiya;Peter Lee 0005;Chris North 0001,Purvi Saraiya;P. Lee;C. North,"Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA;Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA;Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA",10.1109/INFVIS.2004.1;10.1109/INFVIS.1996.559226;10.1109/INFVIS.2003.1249009,"Graph visualization, data overlay, timeseries data analysis, usability experiments",41,11,25,
Vis,2005,Illustration and photography inspired visualization of flows and volumes,10.1109/VISUAL.2005.1532858,http://dx.doi.org/10.1109/VISUAL.2005.1532858,687,694,C,"Understanding and analyzing complex volumetrically varying data is a difficult problem. Many computational visualization techniques have had only limited success in succinctly portraying the structure of three-dimensional turbulent flow. Motivated by both the extensive history and success of illustration and photographic flow visualization techniques, we have developed a new interactive volume rendering and visualization system for flows and volumes that simulates and enhances traditional illustration, experimental advection, and photographic flow visualization techniques. Our system uses a combination of varying focal and contextual illustrative styles, new advanced two-dimensional transfer functions, enhanced Schlieren and shadowgraphy shaders, and novel oriented structure enhancement techniques to allow interactive visualization, exploration, and comparative analysis of scalar, vector, and time-varying volume datasets. Both traditional illustration techniques and photographic flow visualization techniques effectively reduce visual clutter by using compact oriented structure information to convey three-dimensional structures. Therefore, a key to the effectiveness of our system is using one-dimensional (Schlieren and shadowgraphy) and two-dimensional (silhouette) oriented structural information to reduce visual clutter, while still providing enough three-dimensional structural information for the user's visual system to understand complex three-dimensional flow data. By combining these oriented feature visualization techniques with flexible transfer function controls, we can visualize scalar and vector data, allow comparative visualization of flow properties in a succinct, informative manner, and provide continuity for visualizing time-varying datasets.",Nikolai A. Svakhine;Yun Jang;David S. Ebert;Kelly P. Gaither,N.A. Svakhine;Y. Jang;D. Ebert;K. Gaither,"Purdue Univ., West Lafayette, IN, USA;Purdue Univ., West Lafayette, IN, USA;Purdue Univ., West Lafayette, IN, USA",10.1109/VISUAL.1995.485141;10.1109/VISUAL.1993.398846;10.1109/VISUAL.2003.1250378;10.1109/VISUAL.1996.567777;10.1109/VISUAL.1997.663912;10.1109/VISUAL.2003.1250361;10.1109/VISUAL.1999.809905;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2000.885689;10.1109/VISUAL.2005.1532857;10.1109/VISUAL.2000.885696;10.1109/VISUAL.1993.398877,"interactive volume illustration, flow visualization, non-photorealistic rendering, photographic techniques",41,18,35,
Vis,2006,Visual Signatures in Video Visualization,10.1109/TVCG.2006.194,http://dx.doi.org/10.1109/TVCG.2006.194,1093,1100,J,"Video visualization is a computation process that extracts meaningful information from original video data sets and conveys the extracted information to users in appropriate visual representations. This paper presents a broad treatment of the subject, following a typical research pipeline involving concept formulation, system development, a path-finding user study, and a field trial with real application data. In particular, we have conducted a fundamental study on the visualization of motion events in videos. We have, for the first time, deployed flow visualization techniques in video visualization. We have compared the effectiveness of different abstract visual representations of videos. We have conducted a user study to examine whether users are able to learn to recognize visual signatures of motions, and to assist in the evaluation of different visualization techniques. We have applied our understanding and the developed techniques to a set of application video clips. Our study has demonstrated that video visualization is both technically feasible and cost-effective. It has provided the first set of evidence confirming that ordinary users can be accustomed to the visual features depicted in video visualizations, and can learn to recognize visual signatures of a variety of motion events",Min Chen 0001;Ralf P. Botchen;Rudy Hashim;Daniel Weiskopf;Thomas Ertl;Ian M. Thornton,Min Chen;Ralf Botchen;Rudy Hashim;Daniel Weiskopf;Thomas Ertl;Ian Thornton,IEEE Computer Society;IEEE Computer Society,10.1109/VISUAL.2003.1250401;10.1109/VISUAL.1991.175792;10.1109/VISUAL.1995.480819,"Video visualization, volume visualization, flow visualization, human factors, user study, visual signatures, video processing, optical flow, GPU rendering",41,29,26,
InfoVis,2007,Visualization of Heterogeneous Data,10.1109/TVCG.2007.70617,http://dx.doi.org/10.1109/TVCG.2007.70617,1200,1207,J,"Both the resource description framework (RDF), used in the semantic web, and Maya Viz u-forms represent data as a graph of objects connected by labeled edges. Existing systems for flexible visualization of this kind of data require manual specification of the possible visualization roles for each data attribute. When the schema is large and unfamiliar, this requirement inhibits exploratory visualization by requiring a costly up-front data integration step. To eliminate this step, we propose an automatic technique for mapping data attributes to visualization attributes. We formulate this as a schema matching problem, finding appropriate paths in the data model for each required visualization attribute in a visualization template.",Mike Cammarano;Xin Dong 0001;Bryan Chan;Jeff Klingner;Justin Talbot;Alon Y. Halevy;Pat Hanrahan,Mike Cammarano;Xin Dong;Bryan Chan;Jeff Klingner;Justin Talbot;Alon Halevey;Pat Hanrahan,Stanford University;University of Washington;Stanford University;Stanford University;Stanford University;Google;Stanford University,10.1109/INFVIS.2000.885086;10.1109/VISUAL.1994.346302;10.1109/INFVIS.1996.559210,"Data integration, RDF, attribute inference",41,27,45,
Vis,2007,Contextualized Videos: Combining Videos with Environment Models to Support Situational Understanding,10.1109/TVCG.2007.70544,http://dx.doi.org/10.1109/TVCG.2007.70544,1568,1575,J,"Multiple spatially-related videos are increasingly used in security, communication, and other applications. Since it can be difficult to understand the spatial relationships between multiple videos in complex environments (e.g. to predict a person's path through a building), some visualization techniques, such as video texture projection, have been used to aid spatial understanding. In this paper, we identify and begin to characterize an overall class of visualization techniques that combine video with 3D spatial context. This set of techniques, which we call contextualized videos, forms a design palette which must be well understood so that designers can select and use appropriate techniques that address the requirements of particular spatial video tasks. In this paper, we first identify user tasks in video surveillance that are likely to benefit from contextualized videos and discuss the video, model, and navigation related dimensions of the contextualized video design space. We then describe our contextualized video testbed which allows us to explore this design space and compose various video visualizations for evaluation. Finally, we describe the results of our process to identify promising design patterns through user selection of visualization features from the design space, followed by user interviews.",Yi Wang;David M. Krum;Enylton Machado Coelho;Doug A. Bowman,Yi Wang;David M. Krum;Enylton M. Coelho;Doug A. Bowman,Center for HCI at Virginia Tech;Robert Bosch Research and Technology Center;Robert Bosch Research and Technology Center;Center for HCI at Virginia Tech,10.1109/VISUAL.2003.1250396;10.1109/TVCG.2006.194;10.1109/VISUAL.2003.1250401;10.1109/VISUAL.2003.1250400;10.1109/VISUAL.2005.1532836;10.1109/VISUAL.2005.1532782,"situational awareness, videos, virtual environment models, design space, testbed design and evaluation",41,24,24,
Vis,2007,LiveSync: Deformed Viewing Spheres for Knowledge-Based Navigation,10.1109/TVCG.2007.70576,http://dx.doi.org/10.1109/TVCG.2007.70576,1544,1551,J,"Although real-time interactive volume rendering is available even for very large data sets, this visualization method is used quite rarely in the clinical practice. We suspect this is because it is very complicated and time consuming to adjust the parameters to achieve meaningful results. The clinician has to take care of the appropriate viewpoint, zooming, transfer function setup, clipping planes and other parameters. Because of this, most often only 2D slices of the data set are examined. Our work introduces LiveSync, a new concept to synchronize 2D slice views and volumetric views of medical data sets. Through intuitive picking actions on the slice, the users define the anatomical structures they are interested in. The 3D volumetric view is updated automatically with the goal that the users are provided with expressive result images. To achieve this live synchronization we use a minimal set of derived information without the need for segmented data sets or data-specific pre-computations. The components we consider are the picked point, slice view zoom, patient orientation, viewpoint history, local object shape and visibility. We introduce deformed viewing spheres which encode the viewpoint quality for the components. A combination of these deformed viewing spheres is used to estimate a good viewpoint. Our system provides the physician with synchronized views which help to gain deeper insight into the medical data with minimal user interaction.",Peter Kohlmann;Stefan Bruckner;Armin Kanitsar;M. Eduard Gröller,Peter Kohlmann;Stefan Bruckner;Armin Kanitsar;Eduard Gröller,IEEE Computer Society,10.1109/VISUAL.2005.1532834;10.1109/TVCG.2006.152;10.1109/VISUAL.2005.1532833,"Navigation, interaction, linked views, medical visualization, viewpoint selection",41,23,20,
Vis,2007,Surface Extraction from Multi-Material Components for Metrology using Dual Energy CT,10.1109/TVCG.2007.70598,http://dx.doi.org/10.1109/TVCG.2007.70598,1520,1527,J,"This paper describes a novel method for creating surface models of multi-material components using dual energy computed tomography (DECT). The application scenario is metrology and dimensional measurement in industrial high resolution 3D X-ray computed tomography (3DCT). Based on the dual source / dual exposure technology this method employs 3DCT scans of a high precision micro-focus and a high energy macro-focus X-ray source. The presented work makes use of the advantages of dual X-ray exposure technology in order to facilitate dimensional measurements of multi-material components with high density material within low density material. We propose a workflow which uses image fusion and local surface extraction techniques: a prefiltering step reduces noise inherent in the data. For image fusion the datasets have to be registered. In the fusion step the benefits of both scans are combined. The structure of the specimen is taken from the low precision, blurry, high energy dataset while the sharp edges are adopted and fused into the resulting image from the high precision, crisp, low energy dataset. In the final step a reliable surface model is extracted from the fused dataset using a local adaptive technique. The major contribution of this paper is the development of a specific workflow for dimensional measurements of multi-material industrial components, which takes two X-ray CT datasets with complementary strengths and weaknesses into account. The performance of the workflow is discussed using a test specimen as well as two real world industrial parts. As result, a significant improvement in overall measurement precision, surface geometry and mean deviation to reference measurement compared to single exposure scans was facilitated.",Christoph Heinzl;Johann Kastner;M. Eduard Gröller,Christoph Heinzl;Johann Kastner;Eduard Gröller,,10.1109/VISUAL.2003.1250418;10.1109/VISUAL.2001.964519,"DECT image fusion, local surface extraction, Dual Energy CT, metrology, dimensional measurement, variance comparison",41,36,31,
Vis,2009,Perception-Based Transparency Optimization for Direct Volume Rendering,10.1109/TVCG.2009.172,http://dx.doi.org/10.1109/TVCG.2009.172,1283,1290,J,"The semi-transparent nature of direct volume rendered images is useful to depict layered structures in a volume. However, obtaining a semi-transparent result with the layers clearly revealed is difficult and may involve tedious adjustment on opacity and other rendering parameters. Furthermore, the visual quality of layers also depends on various perceptual factors. In this paper, we propose an auto-correction method for enhancing the perceived quality of the semi-transparent layers in direct volume rendered images. We introduce a suite of new measures based on psychological principles to evaluate the perceptual quality of transparent structures in the rendered images. By optimizing rendering parameters within an adaptive and intuitive user interaction process, the quality of the images is enhanced such that specific user requirements can be met. Experimental results on various datasets demonstrate the effectiveness and robustness of our method.",Ming-Yuen Chan;Yingcai Wu;Wai-Ho Mak;Wei Chen 0001;Huamin Qu,Ming-Yuen Chan;Yingcai Wu;Wai-Ho Mak;Wei Chen;Huamin Qu,"Department of Computer Science and Engineering, The Hong Kong University of Science and Technology;Department of Computer Science and Engineering, The Hong Kong University of Science and Technology;Department of Computer Science and Engineering, The Hong Kong University of Science and Technology;State Key Lab of CAD&amp;CG, Zhejiang University;Department of Computer Science and Engineering, The Hong Kong University of Science and Technology",10.1109/VISUAL.1998.745319;10.1109/VISUAL.2000.885694;10.1109/TVCG.2008.118;10.1109/VISUAL.2003.1250414;10.1109/TVCG.2007.70591;10.1109/VISUAL.2004.62;10.1109/TVCG.2008.162;10.1109/TVCG.2006.183;10.1109/TVCG.2008.159;10.1109/TVCG.2006.148,"Direct volume rendering, image enhancement, layer perception",41,27,29,HM
VAST,2010,Flow-based scatterplots for sensitivity analysis,10.1109/VAST.2010.5652460,http://dx.doi.org/10.1109/VAST.2010.5652460,43,50,C,"Visualization of multi-dimensional data is challenging due to the number of complex correlations that may be present in the data but that are difficult to be visually identified. One of the main causes for this problem is the inherent loss of information that occurs when high-dimensional data is projected into 2D or 3D. Although 2D scatterplots are ubiquitous due to their simplicity and familiarity, there are not a lot of variations on their basic metaphor. In this paper, we present a new way of visualizing multidimensional data using scatterplots. We extend 2D scatterplots using sensitivity coefficients to highlight local variation of one variable with respect to another. When applied to a scatterplot, these sensitivities can be understood as velocities, and the resulting visualization resembles a flow field. We also present a number of operations, based on flow-field analysis, that help users navigate, select and cluster points in an efficient manner. We show the flexibility and generality of this approach using a number of multidimensional data sets across different domains.",Yu-Hsuan Chan;Carlos D. Correa;Kwan-Liu Ma,Yu-Hsuan Chan;Carlos D. Correa;Kwan-Liu Ma,University of California at Davis;University of California at Davis;University of California at Davis,10.1109/TVCG.2008.119;10.1109/VAST.2008.4677368;10.1109/VAST.2009.5332611;10.1109/VAST.2007.4389000;10.1109/TVCG.2006.166;10.1109/TVCG.2008.153,"Uncertainty, Data Transformations, Principal Component Analysis, Model fitting",41,33,35,
InfoVis,2011,Drawing Road Networks with Focus Regions,10.1109/TVCG.2011.191,http://dx.doi.org/10.1109/TVCG.2011.191,2555,2562,J,"Mobile users of maps typically need detailed information about their surroundings plus some context information about remote places. In order to avoid that the map partly gets too dense, cartographers have designed mapping functions that enlarge a user-defined focus region - such functions are sometimes called fish-eye projections. The extra map space occupied by the enlarged focus region is compensated by distorting other parts of the map. We argue that, in a map showing a network of roads relevant to the user, distortion should preferably take place in those areas where the network is sparse. Therefore, we do not apply a predefined mapping function. Instead, we consider the road network as a graph whose edges are the road segments. We compute a new spatial mapping with a graph-based optimization approach, minimizing the square sum of distortions at edges. Our optimization method is based on a convex quadratic program (CQP); CQPs can be solved in polynomial time. Important requirements on the output map are expressed as linear inequalities. In particular, we show how to forbid edge crossings. We have implemented our method in a prototype tool. For instances of different sizes, our method generated output maps that were far less distorted than those generated with a predefined fish-eye projection. Future work is needed to automate the selection of roads relevant to the user. Furthermore, we aim at fast heuristics for application in real-time systems.",Jan-Henrik Haunert;Leon Sering,Jan-Henrik Haunert;Leon Sering,University of W&#x0FC;rzburg;University of W&#x0FC;rzburg,10.1109/TVCG.2008.132;10.1109/INFVIS.2004.66,"cartography, schematic maps, fish-eye view, graph drawing, optimization, quadratic programming",41,32,33,
InfoVis,2012,Evaluating the Effect of Style in Information Visualization,10.1109/TVCG.2012.221,http://dx.doi.org/10.1109/TVCG.2012.221,2739,2748,J,"This paper reports on a between-subject, comparative online study of three information visualization demonstrators that each displayed the same dataset by way of an identical scatterplot technique, yet were different in style in terms of visual and interactive embellishment. We validated stylistic adherence and integrity through a separate experiment in which a small cohort of participants assigned our three demonstrators to predefined groups of stylistic examples, after which they described the styles with their own words. From the online study, we discovered significant differences in how participants execute specific interaction operations, and the types of insights that followed from them. However, in spite of significant differences in apparent usability, enjoyability and usefulness between the style demonstrators, no variation was found on the self-reported depth, expert-rated depth, confidence or difficulty of the resulting insights. Three different methods of insight analysis have been applied, revealing how style impacts the creation of insights, ranging from higher-level pattern seeking to a more reflective and interpretative engagement with content, which is what underlies the patterns. As this study only forms the first step in determining how the impact of style in information visualization could be best evaluated, we propose several guidelines and tips on how to gather, compare and categorize insights through an online evaluation study, particularly in terms of analyzing the concise, yet wide variety of insights and observations in a trustworthy and reproducable manner.",Andrew Vande Moere;Martin Tomitsch;Christoph Wimmer;Christoph M. Bösch;Thomas Grechenig,Andrew Vande Moere;Martin Tomitsch;Christoph Wimmer;Boesch Christoph;Thomas Grechenig,KU Leuven;University of Sydney;TU Wien;TU Wien;TU Wien,10.1109/TVCG.2007.70541;10.1109/TVCG.2007.70577;10.1109/TVCG.2009.122,"Visualization, design, style, aesthetics, evaluation, online study, user experience",41,33,33,
InfoVis,2012,Representative Factor Generation for the Interactive Visual Analysis of High-Dimensional Data,10.1109/TVCG.2012.256,http://dx.doi.org/10.1109/TVCG.2012.256,2621,2630,J,"Datasets with a large number of dimensions per data item (hundreds or more) are challenging both for computational and visual analysis. Moreover, these dimensions have different characteristics and relations that result in sub-groups and/or hierarchies over the set of dimensions. Such structures lead to heterogeneity within the dimensions. Although the consideration of these structures is crucial for the analysis, most of the available analysis methods discard the heterogeneous relations among the dimensions. In this paper, we introduce the construction and utilization of representative factors for the interactive visual analysis of structures in high-dimensional datasets. First, we present a selection of methods to investigate the sub-groups in the dimension set and associate representative factors with those groups of dimensions. Second, we introduce how these factors are included in the interactive visual analysis cycle together with the original dimensions. We then provide the steps of an analytical procedure that iteratively analyzes the datasets through the use of representative factors. We discuss how our methods improve the reliability and interpretability of the analysis process by enabling more informed selections of computational tools. Finally, we demonstrate our techniques on the analysis of brain imaging study results that are performed over a large group of subjects.",Cagatay Turkay;Arvid Lundervold;Astri J. Lundervold;Helwig Hauser,Cagatay Turkay;Arvid Lundervold;Astri Johansen Lundervold;Helwig Hauser,"Department of Informatics, University of Bergen;Department of Biomedicine, University of Bergen;Department of Biological and Medical Psychology, University of Bergen;Department of Informatics, University of Bergen",10.1109/TVCG.2009.199;10.1109/INFVIS.2005.1532142;10.1109/VAST.2011.6102449;10.1109/INFVIS.2000.885086;10.1109/VISUAL.1994.346302;10.1109/TVCG.2008.116;10.1109/TVCG.2011.178;10.1109/TVCG.2007.70569;10.1109/VISUAL.1999.809866;10.1109/INFVIS.2004.60;10.1109/INFVIS.2004.3;10.1109/TVCG.2009.153,"Interactive visual analysis, high-dimensional data analysis",41,35,46,
InfoVis,2014,The Persuasive Power of Data Visualization,10.1109/TVCG.2014.2346419,http://dx.doi.org/10.1109/TVCG.2014.2346419,2211,2220,J,"Data visualization has been used extensively to inform users. However, little research has been done to examine the effects of data visualization in influencing users or in making a message more persuasive. In this study, we present experimental research to fill this gap and present an evidence-based analysis of persuasive visualization. We built on persuasion research from psychology and user interfaces literature in order to explore the persuasive effects of visualization. In this experimental study we define the circumstances under which data visualization can make a message more persuasive, propose hypotheses, and perform quantitative and qualitative analyses on studies conducted to test these hypotheses. We compare visual treatments with data presented through barcharts and linecharts on the one hand, treatments with data presented through tables on the other, and then evaluate their persuasiveness. The findings represent a first step in exploring the effectiveness of persuasive visualization.",Anshul Vikram Pandey;Anjali Manivannan;Oded Nov;Margaret Satterthwaite;Enrico Bertini,Anshul Vikram Pandey;Anjali Manivannan;Oded Nov;Margaret Satterthwaite;Enrico Bertini,New York University;New York University;New York University;New York University;New York University,10.1109/TVCG.2012.199;10.1109/TVCG.2012.221;10.1109/TVCG.2012.197;10.1109/TVCG.2011.192;10.1109/TVCG.2013.234,"Persuasive visualization, elaboration likelihood model, evaluation",41,43,39,
InfoVis,2015,"Evaluation of Parallel Coordinates: Overview, Categorization and Guidelines for Future Research",10.1109/TVCG.2015.2466992,http://dx.doi.org/10.1109/TVCG.2015.2466992,579,588,J,"The parallel coordinates technique is widely used for the analysis of multivariate data. During recent decades significant research efforts have been devoted to exploring the applicability of the technique and to expand upon it, resulting in a variety of extensions. Of these many research activities, a surprisingly small number concerns user-centred evaluations investigating actual use and usability issues for different tasks, data and domains. The result is a clear lack of convincing evidence to support and guide uptake by users as well as future research directions. To address these issues this paper contributes a thorough literature survey of what has been done in the area of user-centred evaluation of parallel coordinates. These evaluations are divided into four categories based on characterization of use, derived from the survey. Based on the data from the survey and the categorization combined with the authors' experience of working with parallel coordinates, a set of guidelines for future research directions is proposed.",Jimmy Johansson;Camilla Forsell,Jimmy Johansson;Camilla Forsell,"Norrköping Visualization Center C/Linköping University, Sweden;Norrköping Visualization Center C/Linköping University, Sweden",10.1109/TVCG.2014.2346626;10.1109/TVCG.2011.201;10.1109/VISUAL.1999.809866;10.1109/TVCG.2014.2346979;10.1109/INFVIS.2002.1173157;10.1109/TVCG.2013.126;10.1109/INFVIS.2005.1532138;10.1109/TVCG.2009.153;10.1109/INFVIS.2004.15;10.1109/INFVIS.2004.5;10.1109/TVCG.2011.197;10.1109/VISUAL.1997.663867,"Survey, evaluation, guidelines, parallel coordinates",41,48,50,
VAST,2017,Do Convolutional Neural Networks Learn Class Hierarchy?,10.1109/TVCG.2017.2744683,http://dx.doi.org/10.1109/TVCG.2017.2744683,152,162,J,"Convolutional Neural Networks (CNNs) currently achieve state-of-the-art accuracy in image classification. With a growing number of classes, the accuracy usually drops as the possibilities of confusion increase. Interestingly, the class confusion patterns follow a hierarchical structure over the classes. We present visual-analytics methods to reveal and analyze this hierarchy of similar classes in relation with CNN-internal data. We found that this hierarchy not only dictates the confusion patterns between the classes, it furthermore dictates the learning behavior of CNNs. In particular, the early layers in these networks develop feature detectors that can separate high-level groups of classes quite well, even after a few training epochs. In contrast, the latter layers require substantially more epochs to develop specialized feature detectors that can separate individual classes. We demonstrate how these insights are key to significant improvement in accuracy by designing hierarchy-aware CNNs that accelerate model convergence and alleviate overfitting. We further demonstrate how our methods help in identifying various quality issues in the training data.",Bilal Alsallakh;Amin Jourabloo;Mao Ye;Xiaoming Liu 0002;Ren Liu,Alsallakh Bilal;Amin Jourabloo;Mao Ye;Xiaoming Liu;Liu Ren,"Bosch Research North AmericaPalo Alto, CA;Michigan State University;Bosch Research North AmericaPalo Alto, CA;Michigan State University;Bosch Research North AmericaPalo Alto, CA",10.1109/TVCG.2014.2346660;10.1109/VAST.2015.7347637;10.1109/TVCG.2016.2598831;10.1109/TVCG.2016.2598838;10.1109/TVCG.2016.2598828;10.1109/TVCG.2017.2744158;10.1109/VISUAL.2005.1532820;10.1109/VAST.2011.6102453,"Convolutional Neural Networks,deep learning,image classification,large-scale classification,confusion matrix",41,23,77,
VAST,2017,Analyzing the Training Processes of Deep Generative Models,10.1109/TVCG.2017.2744938,http://dx.doi.org/10.1109/TVCG.2017.2744938,77,87,J,"Among the many types of deep models, deep generative models (DGMs) provide a solution to the important problem of unsupervised and semi-supervised learning. However, training DGMs requires more skill, experience, and know-how because their training is more complex than other types of deep models such as convolutional neural networks (CNNs). We develop a visual analytics approach for better understanding and diagnosing the training process of a DGM. To help experts understand the overall training process, we first extract a large amount of time series data that represents training dynamics (e.g., activation changes over time). A blue-noise polyline sampling scheme is then introduced to select time series samples, which can both preserve outliers and reduce visual clutter. To further investigate the root cause of a failed training process, we propose a credit assignment algorithm that indicates how other neurons contribute to the output of the neuron causing the training failure. Two case studies are conducted with machine learning experts to demonstrate how our approach helps understand and diagnose the training processes of DGMs. We also show how our approach can be directly used to analyze other types of deep models, such as CNNs.",Mengchen Liu;Jiaxin Shi;Kelei Cao;Jun Zhu 0001;Shixia Liu,Mengchen Liu;Jiaxin Shi;Kelei Cao;Jun Zhu;Shixia Liu,Tsinghua UniversityNational Engineering Lab for Big Data Software;Tsinghua University;Tsinghua UniversityNational Engineering Lab for Big Data Software;Tsinghua University;Tsinghua UniversityNational Engineering Lab for Big Data Software,10.1109/TVCG.2016.2598496;10.1109/TVCG.2014.2346594;10.1109/TVCG.2010.131;10.1109/TVCG.2011.239;10.1109/TVCG.2016.2598831;10.1109/TVCG.2016.2598797;10.1109/TVCG.2016.2598838;10.1109/TVCG.2016.2598829;10.1109/VISUAL.2005.1532820;10.1109/VAST.2016.7883511;10.1109/TVCG.2016.2598664,"deep learning,deep generative models,blue noise sampling,credit assignment",41,35,55,
Vis,1995,An architecture for retaining and analyzing visual explorations of databases,10.1109/VISUAL.1995.480801,http://dx.doi.org/10.1109/VISUAL.1995.480801,101,108,C,"A software architecture is presented to integrate a database management system with data visualization. One of its primary objectives, the retention of user-data interactions, is detailed. By storing all queries over the data along with high-level descriptions of the query results and the associated visualization, the processes by which a database is explored can be analyzed. This approach can lead to important contributions in the development of user models as ""data explorers"", metadata models for scientific databases, intelligent assistants and data exploration services. We describe the underlying elements of this approach, specifically the visual database exploration model and the metadata objects that support the model.",John Peter Lee;Georges G. Grinstein,J.P. Lee;G.G. Grinstein,"Inst. for Visualization & Perception Res., Massachusetts Univ., Lowell, MA, USA;Inst. for Visualization & Perception Res., Massachusetts Univ., Lowell, MA, USA",10.1109/VISUAL.1994.346304;10.1109/VISUAL.1994.346303;10.1109/VISUAL.1990.146375;10.1109/VISUAL.1992.235203;10.1109/VISUAL.1993.398874;10.1109/VISUAL.1993.398857,"visual database exploration, database visualization, metadata, user modeling, interaction",40,15,23,
InfoVis,1996,FINESSE: a financial information spreadsheet,10.1109/INFVIS.1996.559222,http://dx.doi.org/10.1109/INFVIS.1996.559222,70,"71, 125",M,"We outline a spreadsheet-based system for visualization of real-time financial information. Our system permits the user to define arithmetic and presentation relationships amongst the various cells of the spreadsheet. The cells contain primitives that can be numbers, text, images, functions and graphics. Presenting financial information in this format allows its intended clients, the financial analysts, to work in the familiar environment of a spreadsheet and allows them the flexibility afforded by the powerful interface of the spreadsheet paradigm. In addition, our system permits real-time visualization of the financial data stream allowing its user to visually trade the changing market trends in two and three dimensions.",Amitabh Varshney;Arie E. Kaufman,A. Varshney;A. Kaufman,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",,,40,11,11,
Vis,1997,Vortex identification-applications in aerodynamics: a case study,10.1109/VISUAL.1997.663910,http://dx.doi.org/10.1109/VISUAL.1997.663910,413,416,C,"An eigenvector method for vortex identification has been applied to recent numerical and experimental studies in external flow aerodynamics. It is shown to be an effective way to extract and visualize features such as vortex cores, spiral vortex breakdowns, vortex bursting, and vortex diffusion. Several problems are reported and illustrated. These include: disjointed line segments, detecting non-vortical flow features, and vortex core displacement. Future research and applications are discussed, such as using vortex cores to guide automatic grid refinement.",David N. Kenwright;Robert Haimes,D. Kenwright;R. Haimes,"NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1996.568137;10.1109/VISUAL.1994.346327;10.1109/VISUAL.1991.175773,,40,17,16,BCS
Vis,1997,A visualization of music,10.1109/VISUAL.1997.663931,http://dx.doi.org/10.1109/VISUAL.1997.663931,499,503,C,"Currently, the most popular method of visualizing music is music notation. Through music notation, an experienced musician can gain an impression of how a particular piece of music sounds simply by looking at the notes on paper. However, most listeners are unfamiliar or uncomfortable with the complex nature of music notation. The goal of this project is to present an alternate method for visualizing music that makes use of color and 3D space. This paper describes one method of visualizing music in 3D space. The implementation of this method shows that music visualization is an effective technique, although it is certainly not the only possible method for accomplishing the task. Throughout the course of this project, several variations and alternative approaches were discussed. The final version of this project reflects the decisions that were made in order to present the best possible representation of music data.",Sean M. Smith;Glen N. Williams,S.M. Smith;G.N. Williams,"Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA",,,40,13,10,
Vis,2001,"The ""Which Blair project"": a quick visual method for evaluating perceptual color maps",10.1109/VISUAL.2001.964510,http://dx.doi.org/10.1109/VISUAL.2001.964510,183,190,C,"We have developed a fast, perceptual method for selecting color scales for data visualization that takes advantage of our sensitivity to luminance variations in human faces. To do so, we conducted experiments in which we mapped various color scales onto the intensity values of a digitized photograph of a face and asked observers to rate each image. We found a very strong correlation between the perceived naturalness of the images and the degree to which the underlying color scales increased monotonically in luminance. Color scales that did not include a monotonically increasing luminance component produced no positive rating scores. Since color scales with monotonic luminance profiles are widely recommended for visualizing continuous scalar data, a purely visual technique for identifying such color scales could be very useful, especially in situations where color calibration is not integrated into the visualization environment, such as over the Internet.",Bernice E. Rogowitz;Alan D. Kalvin,B.E. Rogowitz;A.D. Kalvin,"IBM Thomas J. Watson Res. Center, Hawthorne, NY, USA;IBM Thomas J. Watson Res. Center, Hawthorne, NY, USA",10.1109/VISUAL.1995.480803,"Perceptual color scales, visual artifacts in visualization, Internet color, human color vision",40,24,25,
InfoVis,2002,Graphical encoding for information visualization: an empirical study,10.1109/INFVIS.2002.1173146,http://dx.doi.org/10.1109/INFVIS.2002.1173146,43,50,C,"Research in several areas provides scientific guidance for use of graphical encoding to convey information in an information visualization display. By graphical encoding we mean the use of visual display elements such as icon color, shape, size, or position to convey information about objects represented by the icons. Literature offers inconclusive and often conflicting viewpoints, including the suggestion that the effectiveness of a graphical encoding depends on the type of data represented. Our empirical study suggests that the nature of the users' perceptual task is more indicative of the effectiveness of a graphical encoding than the type of data represented.",Lucy T. Nowell;Robert S. Schulman;Deborah Hix,L. Nowell;R. Schulman;D. Hix,"Battelle Pacific Northwest Lab., Richland, WA, USA",,,40,7,31,
Vis,2003,A visual exploration process for the analysis of Internet routing data,10.1109/VISUAL.2003.1250415,http://dx.doi.org/10.1109/VISUAL.2003.1250415,523,530,C,"The Internet pervades many aspects of our lives and is becoming indispensable to critical functions in areas such as commerce, government, production and general information dissemination. To maintain the stability and efficiency of the Internet, every effort must be made to protect it against various forms of attacks, malicious users, and errors. A key component in the Internet security effort is the routine examination of Internet routing data, which unfortunately can be too large and complicated to browse directly. We have developed an interactive visualization process which proves to be very effective for the analysis of Internet routing data. In this application paper, we show how each step in the visualization process helps direct the analysis and glean insights from the data. These insights include the discovery of patterns, detection of faults and abnormal events, understanding of event correlations, formation of causation hypotheses, and classification of anomalies. We also discuss lessons learned in our visual analysis study.",Soon Tee Teoh;Kwan-Liu Ma;Shyhtsun Felix Wu,Soon Tee Teoh;Kwan-Liu Ma;S.F. Wu,"Dept. of Comput. Sci., California Univ., Davis, CA, USA;Dept. of Comput. Sci., California Univ., Davis, CA, USA;Dept. of Comput. Sci., California Univ., Davis, CA, USA",10.1109/VISUAL.2002.1183816," information visualization, text visualization, network visualization , internet stability, homeland security",40,14,16,
Vis,2003,Visualizing industrial CT volume data for nondestructive testing applications,10.1109/VISUAL.2003.1250418,http://dx.doi.org/10.1109/VISUAL.2003.1250418,547,554,C,"This paper describes a set of techniques developed for the visualization of high-resolution volume data generated from industrial computed tomography for nondestructive testing (NDT) applications. Because the data are typically noisy and contain fine features, direct volume rendering methods do not always give us satisfactory results. We have coupled region growing techniques and a 2D histogram interface to facilitate volumetric feature extraction. The new interface allows the user to conveniently identify, separate or composite, and compare features in the data. To lower the cost of segmentation, we show how partial region growing results can suggest a reasonably good classification function for the rendering of the whole volume. The NDT applications that we work on demand visualization tasks including not only feature extraction and visual inspection, but also modeling and measurement of concealed structures in volumetric objects. An efficient filtering and modeling process for generating surface representation of extracted features is also introduced. Four CT data sets for preliminary NDT are used to demonstrate the effectiveness of the new visualization strategy that we have developed.",Runzhen Huang;Kwan-Liu Ma;Patrick S. McCormick;William Ward,R. Huang;Kwan-Liu Ma;P. McCormick;W. Ward,"California Univ., Davis, CA, USA;California Univ., Davis, CA, USA",,"Computed tomography, feature extraction, hardware-acceleration rendering, image processing, interactive visualization, nondestructive testing and evaluation, scientific visualization, surface modeling, user interface, volume rendering",40,13,17,
VAST,2006,Exploratory Visualization of Multivariate Data with Variable Quality,10.1109/VAST.2006.261424,http://dx.doi.org/10.1109/VAST.2006.261424,183,190,C,"Real-world data is known to be imperfect, suffering from various forms of defects such as sensor variability, estimation errors, uncertainty, human errors in data entry, and gaps in data gathering. Analysis conducted on variable quality data can lead to inaccurate or incorrect results. An effective visualization system must make users aware of the quality of their data by explicitly conveying not only the actual data content, but also its quality attributes. While some research has been conducted on visualizing uncertainty in spatio-temporal data and univariate data, little work has been reported on extending this capability into multivariate data visualization. In this paper we describe our approach to the problem of visually exploring multivariate data with variable quality. As a foundation, we propose a general approach to defining quality measures for tabular data, in which data may experience quality problems at three granularities: individual data values, complete records, and specific dimensions. We then present two approaches to visual mapping of quality information into display space. In particular, one solution embeds the quality measures as explicit values into the original dataset by regarding value quality and record quality as new data dimensions. The other solution is to superimpose the quality information within the data visualizations using additional visual variables. We also report on user studies conducted to assess alternate mappings of quality attributes to visual variables for the second method. In addition, we describe case studies that expose some of the advantages and disadvantages of these two approaches",Zaixian Xie;Shiping Huang;Matthew O. Ward;Elke A. Rundensteiner,Zaixian Xie;Shiping Huang;Matthew O. Ward;Elke A. Rundensteiner,"Computer Science Department, Worcester Polytechnic Institute, xiezx@cs.wpi.edu;Computer Science Department, Worcester Polytechnic Institute, shiping@cs.wpi.edu;Computer Science Department, Worcester Polytechnic Institute, matt@cs.wpi.edu;Computer Science Department, Worcester Polytechnic Institute, rundenst@cs.wpi.edu",10.1109/VISUAL.2000.885679;10.1109/INFVIS.2002.1173145;10.1109/VISUAL.1995.485139;10.1109/INFVIS.2004.10,"Uncertainty visualization, multivariate visualization,data quality",40,17,25,
InfoVis,2007,Geographically Weighted Visualization: Interactive Graphics for Scale-Varying Exploratory Analysis,10.1109/TVCG.2007.70558,http://dx.doi.org/10.1109/TVCG.2007.70558,1161,1168,J,"We introduce a series of geographically weighted (GW) interactive graphics, or geowigs, and use them to explore spatial relationships at a range of scales. We visually encode information about geographic and statistical proximity and variation in novel ways through &lt;i&gt;gw-choropleth maps&lt;/i&gt;, multivariate &lt;i&gt;gw-boxplots, gw-shading&lt;/i&gt; and &lt;i&gt;scalograms&lt;/i&gt;. The new graphic types reveal information about GW statistics at several scales concurrently. We impement these views in prototype software containing dynamic links and GW interactions that encourage exploration and refine them to consider directional geographies. An informal evaluation uses interactive GW techniques to consider Guerry's dataset of 'moral statistics', casting doubt on correlations originally proposed through visual analysis, revealing new local anomalies and suggesting multivariate geographic relationships. Few attempts at visually synthesising geography with multivariate statistical values at multiple scales have been reported. The &lt;i&gt;geowigs &lt;/i&gt;proposed here provide informative representations of multivariate local variation, particularly when combined with interactions that coordinate views and result in &lt;i&gt;gw-shading&lt;/i&gt;. We argue that they are widely applicable to area and point-based geographic data and provide a set of methods to support visual analysis using GW statistics through which the effects of geography can be explored at multiple scales.",Jason Dykes;Chris Brunsdon,Jason Dykes;Chris Brunsdon,,,"Geographical weighting, exploratory data analysis, scale, multivariate, directional, interaction, coordinated views",40,32,21,
VAST,2007,Intelligent Visual Analytics Queries,10.1109/VAST.2007.4389001,http://dx.doi.org/10.1109/VAST.2007.4389001,91,98,C,"Visualizations of large multi-dimensional data sets, occurring in scientific and commercial applications, often reveal interesting local patterns. Analysts want to identify the causes and impacts of these interesting areas, and they also want to search for similar patterns occurring elsewhere in the data set. In this paper we introduce the Intelligent Visual Analytics Query (IVQuery) concept that combines visual interaction with automated analytical methods to support analysts in discovering the special properties and relations of identified patterns. The idea of IVQuery is to interactively select focus areas in the visualization. Then, according to the characteristics of the selected areas, such as the data dimensions and records, IVQuery employs analytical methods to identify the relationships to other portions of the data set. Finally, IVQuery generates visual representations for analysts to view and refine the results. IVQuery has been applied successfully to different real-world data sets, such as data warehouse performance, product sales, and sever performance analysis, and demonstrates the benefits of this technique over traditional filtering and zooming techniques. The visual analytics query technique can be used with many different types of visual representation. In this paper we show how to use IVQuery with parallel coordinates, visual maps, and scatter plots.",Ming C. Hao;Umeshwar Dayal;Daniel A. Keim;D. Morent;Jörn Schneidewind,Ming C. Hao;Umeshwar Dayal;Daniel A. Keim;Dominik Morent;Joern Schneidewind,"Hewlett Packard Laboratories, CA. Electronic Mail: Ming.hao@hp.com;Hewlett Packard Laboratories, CA. Electronic Mail: Umeshwar.dayal@hp.com;University of Konstanz, Germany. Electronic Mail: keim@informatik.uni-konstanz.de;University of Konstanz, Germany. Electronic Mail: Dominik.Morent@uni-konstanz.de;University of Konstanz, Germany. Electronic Mail: schneide@inf.uni-konstanz.de",10.1109/TVCG.2006.200;10.1109/INFVIS.1998.729559;10.1109/VISUAL.1990.146402;10.1109/INFVIS.2000.885086;10.1109/VISUAL.1994.346302,"Visual Analytics Query, Similarity Queries, Interactive Queries",40,25,18,
Vis,2007,Two-Level Approach to Efficient Visualization of Protein Dynamics,10.1109/TVCG.2007.70517,http://dx.doi.org/10.1109/TVCG.2007.70517,1616,1623,J,"Proteins are highly flexible and large amplitude deformations of their structure, also called slow dynamics, are often decisive to their function. We present a two-level rendering approach that enables visualization of slow dynamics of large protein assemblies. Our approach is aligned with a hierarchical model of large scale molecules. Instead of constantly updating positions of large amounts of atoms, we update the position and rotation of residues, i.e., higher level building blocks of a protein. Residues are represented by one vertex only indicating its position and additional information defining the rotation. The atoms in the residues are generated on-the-fly on the GPU, exploiting the new graphics hardware geometry shader capabilities. Moreover, we represent the atoms by billboards instead of tessellated spheres. Our representation is then significantly faster and pixel precise. We demonstrate the usefulness of our new approach in the context of our collaborative bioinformatics project.",Ove Daae Lampe;Ivan Viola;Nathalie Reuter;Helwig Hauser,Ove Daae Lampe;Ivan Viola;Nathalie Reuter;Helwig Hauser,"Christian Michelsen Research, Norway;Department of Informatics, University of Bergen, Norway;Computational Biology Unit/BCCS, University of Bergen, Norway;Department of Informatics, University of Bergen, Norway",10.1109/VISUAL.2005.1532859;10.1109/INFVIS.1996.559215;10.1109/VISUAL.2000.885733;10.1109/TVCG.2006.115,"Molecular visualization, hardware acceleration, protein dynamics",40,28,33,
InfoVis,2008,Particle-based labeling: Fast point-feature labeling without obscuring other visual features,10.1109/TVCG.2008.152,http://dx.doi.org/10.1109/TVCG.2008.152,1237,1244,J,"In many information visualization techniques, labels are an essential part to communicate the visualized data. To preserve the expressiveness of the visual representation, a placed label should neither occlude other labels nor visual representatives (e.g., icons, lines) that communicate crucial information. Optimal, non-overlapping labeling is an NP-hard problem. Thus, only a few approaches achieve a fast non-overlapping labeling in highly interactive scenarios like information visualization. These approaches generally target the point-feature label placement (PFLP) problem, solving only label-label conflicts. This paper presents a new, fast, solid and flexible 2D labeling approach for the PFLP problem that additionally respects other visual elements and the visual extent of labeled features. The results (number of placed labels, processing time) of our particle-based method compare favorably to those of existing techniques. Although the esthetic quality of non-real-time approaches may not be achieved with our method, it complies with practical demands and thus supports the interactive exploration of information spaces. In contrast to the known adjacent techniques, the flexibility of our technique enables labeling of dense point clouds by the use of non-occluding distant labels. Our approach is independent of the underlying visualization technique, which enables us to demonstrate the application of our labeling method within different information visualization scenarios.",Martin Luboschik;Heidrun Schumann;Hilko Cords,Martin Luboschik;Heidrun Schumann;Hilko Cords,University of Rostock;University of Rostock;University of Rostock,10.1109/TVCG.2006.136;10.1109/TVCG.2006.136;10.1109/VISUAL.2005.1532856,"Interactive labeling, dynamic labeling, automatic label placement, occlusion-free, information visualization",40,35,23,
InfoVis,2008,Rapid Graph Layout Using Space filling Curves,10.1109/TVCG.2008.158,http://dx.doi.org/10.1109/TVCG.2008.158,1301,1308,J,"Network data frequently arises in a wide variety of fields, and node-link diagrams are a very natural and intuitive representation of such data. In order for a node-link diagram to be effective, the nodes must be arranged well on the screen. While many graph layout algorithms exist for this purpose, they often have limitations such as high computational complexity or node colocation. This paper proposes a new approach to graph layout through the use of space filling curves which is very fast and guarantees that there will be no nodes that are colocated. The resulting layout is also aesthetic and satisfies several criteria for graph layout effectiveness.",Chris Muelder;Kwan-Liu Ma,Chris Muelder;Kwan-Liu Ma,"University of California, Davis;University of California, Davis",10.1109/INFVIS.2002.1173159;10.1109/INFVIS.2005.1532145;10.1109/INFVIS.2005.1532126;10.1109/INFVIS.2004.66;10.1109/TVCG.2007.70580," Information visualization, Graph layout, Space filling curves",40,33,34,
Vis,2009,Multi-Scale Surface Descriptors,10.1109/TVCG.2009.168,http://dx.doi.org/10.1109/TVCG.2009.168,1201,1208,J,"Local shape descriptors compactly characterize regions of a surface, and have been applied to tasks in visualization, shape matching, and analysis. Classically, curvature has be used as a shape descriptor; however, this differential property characterizes only an infinitesimal neighborhood. In this paper, we provide shape descriptors for surface meshes designed to be multi-scale, that is, capable of characterizing regions of varying size. These descriptors capture statistically the shape of a neighborhood around a central point by fitting a quadratic surface. They therefore mimic differential curvature, are efficient to compute, and encode anisotropy. We show how simple variants of mesh operations can be used to compute the descriptors without resorting to expensive parameterizations, and additionally provide a statistical approximation for reduced computational cost. We show how these descriptors apply to a number of uses in visualization, analysis, and matching of surfaces, particularly to tasks in protein surface analysis.",Gregory Cipriano;George N. Phillips Jr.;Michael Gleicher,Gregory Cipriano;George N. Phillips Jr.;Michael Gleicher,University of Wisconsin;University of Wisconsin;University of Wisconsin,10.1109/VISUAL.2003.1250414;10.1109/VISUAL.2002.1183787;10.1109/VISUAL.2002.1183785,"Curvature, descriptors, npr, stylized rendering, shape matching",40,28,35,
Vis,2009,Stress Tensor field Visualization for Implant Planning in Orthopedics,10.1109/TVCG.2009.184,http://dx.doi.org/10.1109/TVCG.2009.184,1399,1406,J,"We demonstrate the application of advanced 3D visualization techniques to determine the optimal implant design and position in hip joint replacement planning. Our methods take as input the physiological stress distribution inside a patient's bone under load and the stress distribution inside this bone under the same load after a simulated replacement surgery. The visualization aims at showing principal stress directions and magnitudes, as well as differences in both distributions. By visualizing changes of normal and shear stresses with respect to the principal stress directions of the physiological state, a comparative analysis of the physiological stress distribution and the stress distribution with implant is provided, and the implant parameters that most closely replicate the physiological stress state in order to avoid stress shielding can be determined. Our method combines volume rendering for the visualization of stress magnitudes with the tracing of short line segments for the visualization of stress directions. To improve depth perception, transparent, shaded, and antialiased lines are rendered in correct visibility order, and they are attenuated by the volume rendering. We use a focus+context approach to visually guide the user to relevant regions in the data, and to support a detailed stress analysis in these regions while preserving spatial context information. Since all of our techniques have been realized on the GPU, they can immediately react to changes in the simulated stress tensor field and thus provide an effective means for optimal implant selection and positioning in a computational steering environment.",Christian Dick;Joachim Georgii;Rainer Burgkart;Rüdiger Westermann,Christian Dick;Joachim Georgii;Rainer Burgkart;Rüdiger Westermann,Technische Universität München;Technische Universität München;Technische Universität München;Technische Universität München,10.1109/VISUAL.2005.1532780;10.1109/TVCG.2006.124;10.1109/VISUAL.2003.1250379;10.1109/VISUAL.2004.80;10.1109/VISUAL.1998.745294;10.1109/TVCG.2007.70532;10.1109/VISUAL.2002.1183797;10.1109/VISUAL.1994.346326;10.1109/VISUAL.2005.1532771;10.1109/VISUAL.2002.1183798;10.1109/VISUAL.1994.346326;10.1109/VISUAL.2002.1183799;10.1109/TVCG.2006.151;10.1109/VISUAL.1998.745316,"Stress Tensor fields, Biomedical Visualization, Comparative Visualization, Implant Planning, GPU Techniques",40,38,48,
Vis,2010,Visualization by Proxy: A Novel Framework for Deferred Interaction with Volume Data,10.1109/TVCG.2010.215,http://dx.doi.org/10.1109/TVCG.2010.215,1551,1559,J,"Interactivity is key to exploration of volume data. Interactivity may be hindered due to many factors, e.g. large data size,high resolution or complexity of a data set, or an expensive rendering algorithm. We present a novel framework for visualizing volumedata that enables interactive exploration using proxy images, without accessing the original 3D data. Data exploration using directvolume rendering requires multiple (often redundant) accesses to possibly large amounts of data. The notion of visualization by proxyrelies on the ability to defer operations traditionally used for exploring 3D data to a more suitable intermediate representation forinteraction - proxy images. Such operations include view changes, transfer function exploration, and relighting. While previous workhas addressed specific interaction needs, we provide a complete solution that enables real-time interaction with large data sets andhas low hardware and storage requirements.",Anna Tikhonova;Carlos D. Correa;Kwan-Liu Ma,Anna Tikhonova;Carlos D. Correa;Kwan-Liu Ma,,10.1109/TVCG.2007.70591;10.1109/VISUAL.1996.568113;10.1109/VISUAL.2002.1183758,"Volume visualization, deferred interaction, image-based rendering, volume distortion camera",40,32,34,
Vis,2011,Automatic Transfer Functions Based on Informational Divergence,10.1109/TVCG.2011.173,http://dx.doi.org/10.1109/TVCG.2011.173,1932,1941,J,"In this paper we present a framework to define transfer functions from a target distribution provided by the user. A target distribution can reflect the data importance, or highly relevant data value interval, or spatial segmentation. Our approach is based on a communication channel between a set of viewpoints and a set of bins of a volume data set, and it supports 1D as well as 2D transfer functions including the gradient information. The transfer functions are obtained by minimizing the informational divergence or Kullback-Leibler distance between the visibility distribution captured by the viewpoints and a target distribution selected by the user. The use of the derivative of the informational divergence allows for a fast optimization process. Different target distributions for 1D and 2D transfer functions are analyzed together with importance-driven and view-based techniques.",Marc Ruiz;Anton Bardera;Imma Boada;Ivan Viola,Marc Ruiz;Anton Bardera;Imma Boada;Ivan Viola;Miquel Feixas;Mateu Sbert,University of Girona;University of Girona;University of Girona;University of Bergen,10.1109/TVCG.2010.132;10.1109/TVCG.2006.137;10.1109/TVCG.2006.159;10.1109/TVCG.2010.131;10.1109/TVCG.2006.152;10.1109/VISUAL.2003.1250414;10.1109/TVCG.2007.70576;10.1109/TVCG.2009.120;10.1109/VISUAL.1996.568113;10.1109/TVCG.2008.140;10.1109/VISUAL.2005.1532834;10.1109/VISUAL.2002.1183785;10.1109/TVCG.2006.148,"Transfer function, Information theory, Informational divergence, Kullback-Leibler distance",40,32,46,
Vis,2011,Multi-Touch Table System for Medical Visualization: Application to Orthopedic Surgery Planning,10.1109/TVCG.2011.224,http://dx.doi.org/10.1109/TVCG.2011.224,1775,1784,J,"Medical imaging plays a central role in a vast range of healthcare practices. The usefulness of 3D visualizations has been demonstrated for many types of treatment planning. Nevertheless, full access to 3D renderings outside of the radiology department is still scarce even for many image-centric specialties. Our work stems from the hypothesis that this under-utilization is partly due to existing visualization systems not taking the prerequisites of this application domain fully into account. We have developed a medical visualization table intended to better fit the clinical reality. The overall design goals were two-fold: similarity to a real physical situation and a very low learning threshold. This paper describes the development of the visualization table with focus on key design decisions. The developed features include two novel interaction components for touch tables. A user study including five orthopedic surgeons demonstrates that the system is appropriate and useful for this application domain.",Claes Lundström;Thomas Rydell;Camilla Forsell;Anders Persson;Anders Ynnerman,Claes Lundstrom;Thomas Rydell;Camilla Forsell;Anders Persson;Anders Ynnerman,"Center for Medical Image Science and Visualization, Linköping University, Sweden / Sectra Imtec AB, Sweden;Interactive Institute, Norrköping, Sweden;C-research, Linköping University, Sweden;Center for Medical Image Science and Visualization, Linköping University, Sweden;C-research, Linköping University, Sweden",10.1109/TVCG.2010.157;10.1109/VAST.2010.5652880;10.1109/TVCG.2006.146,"Medical visualization, multi-touch, tabletop display, treatment planning",40,38,42,
InfoVis,2013,Perception of Average Value in Multiclass Scatterplots,10.1109/TVCG.2013.183,http://dx.doi.org/10.1109/TVCG.2013.183,2316,2325,J,"The visual system can make highly efficient aggregate judgements about a set of objects, with speed roughly independent of the number of objects considered. While there is a rich literature on these mechanisms and their ramifications for visual summarization tasks, this prior work rarely considers more complex tasks requiring multiple judgements over long periods of time, and has not considered certain critical aggregation types, such as the localization of the mean value of a set of points. In this paper, we explore these questions using a common visualization task as a case study: relative mean value judgements within multi-class scatterplots. We describe how the perception literature provides a set of expected constraints on the task, and evaluate these predictions with a large-scale perceptual study with crowd-sourced participants. Judgements are no harder when each set contains more points, redundant and conflicting encodings, as well as additional sets, do not strongly affect performance, and judgements are harder when using less salient encodings. These results have concrete ramifications for the design of scatterplots.",Michael Gleicher;Michael Correll;Christine Nothelfer;Steven Franconeri,Michael Gleicher;Michael Correll;Christine Nothelfer;Steven Franconeri,University of Wisconsin - Madison;University of Wisconsin - Madison;Northwestern University;Northwestern University,10.1109/TVCG.2012.233,"Psychophysics, Information Visualization, Perceptual Study",40,34,59,
InfoVis,2013,Visual Sedimentation,10.1109/TVCG.2013.227,http://dx.doi.org/10.1109/TVCG.2013.227,2446,2455,J,"We introduce Visual Sedimentation, a novel design metaphor for visualizing data streams directly inspired by the physical process of sedimentation. Visualizing data streams (e. g., Tweets, RSS, Emails) is challenging as incoming data arrive at unpredictable rates and have to remain readable. For data streams, clearly expressing chronological order while avoiding clutter, and keeping aging data visible, are important. The metaphor is drawn from the real-world sedimentation processes: objects fall due to gravity, and aggregate into strata over time. Inspired by this metaphor, data is visually depicted as falling objects using a force model to land on a surface, aggregating into strata over time. In this paper, we discuss how this metaphor addresses the specific challenge of smoothing the transition between incoming and aging data. We describe the metaphor's design space, a toolkit developed to facilitate its implementation, and example applications to a range of case studies. We then explore the generative capabilities of the design space through our toolkit. We finally illustrate creative extensions of the metaphor when applied to real streams of data.",Samuel Huron;Romain Vuillemot;Jean-Daniel Fekete,Samuel Huron;Romain Vuillemot;Jean-Daniel Fekete,INRIA;INRIA;INRIA,10.1109/VAST.2012.6400552;10.1109/TVCG.2012.291;10.1109/TVCG.2011.179;10.1109/INFVIS.2003.1249014;10.1109/TVCG.2011.185;10.1109/TVCG.2008.166;10.1109/TVCG.2008.171;10.1109/INFVIS.2004.65;10.1109/TVCG.2007.70539,"Design, Information Visualization, Dynamic visualization, Dynamic data, Data stream, Real time, Metaphor",40,35,42,
SciVis,2015,TelCoVis: Visual Exploration of Co-occurrence in Urban Human Mobility Based on Telco Data,10.1109/TVCG.2015.2467194,http://dx.doi.org/10.1109/TVCG.2015.2467194,935,944,J,"Understanding co-occurrence in urban human mobility (i.e. people from two regions visit an urban place during the same time span) is of great value in a variety of applications, such as urban planning, business intelligence, social behavior analysis, as well as containing contagious diseases. In recent years, the widespread use of mobile phones brings an unprecedented opportunity to capture large-scale and fine-grained data to study co-occurrence in human mobility. However, due to the lack of systematic and efficient methods, it is challenging for analysts to carry out in-depth analyses and extract valuable information. In this paper, we present TelCoVis, an interactive visual analytics system, which helps analysts leverage their domain knowledge to gain insight into the co-occurrence in urban human mobility based on telco data. Our system integrates visualization techniques with new designs and combines them in a novel way to enhance analysts' perception for a comprehensive exploration. In addition, we propose to study the correlations in co-occurrence (i.e. people from multiple regions visit different places during the same time span) by means of biclustering techniques that allow analysts to better explore coordinated relationships among different regions and identify interesting patterns. The case studies based on a real-world dataset and interviews with domain experts have demonstrated the effectiveness of our system in gaining insights into co-occurrence and facilitating various analytical tasks.",Wenchao Wu;Jiayi Xu;Haipeng Zeng;Yixian Zheng;Huamin Qu;Bing Ni;Mingxuan Yuan;Lionel M. Ni,Wenchao Wu;Jiayi Xu;Haipeng Zeng;Yixian Zheng;Huamin Qu;Bing Ni;Mingxuan Yuan;Lionel M. Ni,Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Noah's Ark Lab;Noah's Ark Lab;University of Macau,10.1109/VAST.2010.5652478;10.1109/TVCG.2013.193;10.1109/TVCG.2014.2346276;10.1109/TVCG.2013.226;10.1109/TVCG.2011.166;10.1109/TVCG.2013.173;10.1109/TVCG.2014.2346271;10.1109/VAST.2011.6102455;10.1109/INFVIS.2000.885091;10.1109/TVCG.2014.2346665;10.1109/TVCG.2012.265;10.1109/TVCG.2013.228;10.1109/VAST.2014.7042490;10.1109/TVCG.2014.2346922,"Co-occurrence, human mobility, telco data, bicluster, visual analytics",40,40,45,
Vis,1994,Strata-various: multi-layer visualization of dynamics in software system behavior,10.1109/VISUAL.1994.346322,http://dx.doi.org/10.1109/VISUAL.1994.346322,172,"178, C19",C,"Current software visualization tools are inadequate for understanding, debugging, and tuning realistically complex applications. These tools often present only static structure, or they present dynamics from only a few of the many layers of a program and its underlying system. This paper introduces ""PV"", a prototype program visualization system which provides concurrent visual presentation of behavior from all layers, including: the program itself, user-level libraries, the operating system, and the hardware, as this behavior unfolds over time. PV juxtaposes views from different layers in order to facilitate visual correlation, and allows these views to be navigated in a coordinated fashion. This results in an extremely powerful mechanism for exploring application behavior. Experience is presented from actual use of PV in production settings with programmers facing real deadlines and serious performance problems.&lt;&lt;ETX&gt;&gt;",Doug Kimelman;Bryan S. Rosenburg;Tova Roth,D. Kimelman;B. Rosenburg;T. Roth,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",,,39,15,18,
Vis,1995,Direct rendering of Laplacian pyramid compressed volume data,10.1109/VISUAL.1995.480812,http://dx.doi.org/10.1109/VISUAL.1995.480812,192,199,C,"Volume rendering generates 2D images by ray tracing 3D volume data. This technique imposes considerable demands on storage space as the data set grows in size. In this paper, we describe a method to render compressed volume data directly to reduce the memory requirements of the rendering process. The volume data was compressed by a technique called the Laplacian pyramid. A compression ratio of 10:1 was achieved by uniform quantization over the Laplacian pyramid. The quality of the images obtained by this technique as virtually indistinguishable from that of the images generated from the uncompressed volume data. A significant improvement in computational performance was achieved by using a cache algorithm to temporarily retain the reconstructed voxels to be used by the adjacent rays.",Mohammad H. Ghavamnia;Xue D. Yang,M.H. Ghavamnia;X.D. Yang,"Dept. of Comput. Sci., Regina Univ., Sask., Canada;Dept. of Comput. Sci., Regina Univ., Sask., Canada",10.1109/VISUAL.1993.398845,,39,24,14,
Vis,1996,Deformable volume rendering by 3D texture mapping and octree encoding,10.1109/VISUAL.1996.567609,http://dx.doi.org/10.1109/VISUAL.1996.567609,73,80,C,"Rendering deformable volume data currently needs separate processes for deformation and rendering, and is expensive in terms of both computational and memory costs. Recognizing the importance of unifying these processes, we present a new approach to the direct rendering of deformable volumes without explicitly constructing the intermediate deformed volumes. The volume deformation is done by a radial basis function that is piecewise linearly approximated by an adaptive subdivision of the octree encoded target volume. The octree blocks in the target volume are then projected, reverse morphed and texture mapped, using the SGI 3D texture mapping hardware, in a back-to-front order. A template-based Z-plane/block intersection method is used to expedite the block projection computation.",Shiaofen Fang;Rajagopalan Srinivasan;Su Huang;Raghu Raghavan,Shiaofen Fang;Su Huang;Rajagopalan Srinivasan;Raghu Raghavan,"Nat. Univ. of Singapore, Singapore",10.1109/VISUAL.1994.346333,"Volume Rendering, 3D Texture Mapping, Morphing, Volume Deformation, Octree, Scientific Visualization",39,10,25,
Vis,1996,Volume Thinning for Automatic Isosurface Propagation,10.1109/VISUAL.1996.568123,http://doi.ieeecomputersociety.org/10.1109/VISUAL.1996.568123,303,310,C,"An isosurface can be efficiently generated by visiting adjacent intersected cells in order, as if the isosurface were propagating itself. We previously proposed an extrema graph method (T. Itoh and K. Koyamada, 1995), which generates a graph connecting extremum points. The isosurface propagation starts from some of the intersected cells that are found both by visiting the cells through which arcs of the graph pass and by visiting the cells on the boundary of a volume. We propose an efficient method of searching for cells intersected by an isosurface. This method generates a volumetric skeleton. consisting of cells, like an extrema graph, by applying a thinning algorithm used in the image recognition area. Since it preserves the topological features of the volume and the connectivity of the extremum points, it necessarily intersects every isosurface. The method is more efficient than the extrema graph method, since it does not require that cells on the boundary be visited.",Takayuki Itoh;Yasushi Yamaguchi;Koji Koyamada,T. Itoh;Y. Yamaguchi;K. Koyamada,"Res. Lab., IBM Japan Ltd., Tokyo, Japan",10.1109/VISUAL.1991.175780,,39,15,0,
Vis,2001,"Archaeological Data Visualization in VR: Analysis of Lamp Finds at the Great Temple of Petra, a Case Study",10.1109/VISUAL.2001.964560,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2001.964560,493,496,C,"Presents the results of an evaluation of the ARCHAVE (ARCHAeological Virtual Environment) system, an immersive virtual reality (VR) environment for archaeological research. ARCHAVE is implemented in a Cave. The evaluation studied researchers analyzing lamp and coin finds throughout the excavation trenches at the Petra Great Temple site in Jordan. Experienced archaeologists used our system to study excavation data, confirming existing hypotheses and postulating new theories they had not been able to discover without the system. ARCHAVE provided access to the excavation database, and researchers were able to examine the data in the context of a life-size representation of the present-day architectural ruins of the temple. They also had access to a miniature model for site-wide analysis. Because users quickly became comfortable with the interface, they concentrated their efforts on examining the data being retrieved and displayed. The immersive VR visualization of the recovered information gave them the opportunity to explore it in a new and dynamic way and, in several cases, enabled them to make discoveries that opened new lines of investigation about the excavation.",Daniel Acevedo Feliz;Eileen Vote;David H. Laidlaw;Martha Sharp Joukowsky,D. Acevedo;E. Vote;D.H. Laidlaw;M.S. Joukowsky,"Brown Univ., Providence, RI, USA;Brown Univ., Providence, RI, USA;Brown Univ., Providence, RI, USA",,"Scientific Visualization, Archaeological Data Analysis, Immersive Virtual Reality Interfaces",39,10,9,
Vis,2002,Integration of measurement tools in medical 3d visualizations,10.1109/VISUAL.2002.1183752,http://dx.doi.org/10.1109/VISUAL.2002.1183752,21,28,C,"We discuss 3d interaction techniques for the quantitative analysis of spatial relations in medical visualizations. We describe the design and implementation of measurement tools to measure distances, angles and volumes in 3d visualizations. The visualization of measurement tools as recognizable 3d objects and a 3d interaction, which is both intuitive and precise, determines the usability of such facilities. Measurements may be carried out in 2d visualizations of the original radiological data and in 3d visualizations. The result of a measurement carried out in one view is also displayed in the other view appropriately. We discuss the validation of the obtained measures. Finally, we describe how some important measurement tasks may be solved automatically.",Bernhard Preim;Christian Tietjen;Wolf Spindler;Heinz-Otto Peitgen,B. Preim;C. Tietjen;W. Spindler;H.-O. Peitgen,"Center for Med. Diagnostic Syst. & Visualization, MeVis, Bremen, Germany;Center for Med. Diagnostic Syst. & Visualization, MeVis, Bremen, Germany;Center for Med. Diagnostic Syst. & Visualization, MeVis, Bremen, Germany;Center for Med. Diagnostic Syst. & Visualization, MeVis, Bremen, Germany",,"medical visualization, computer-assisted surgery, quantitative analysis, interaction techniques",39,16,14,
Vis,2004,Stream line and path line oriented topology for 2D time-dependent vector fields,10.1109/VISUAL.2004.99,http://dx.doi.org/10.1109/VISUAL.2004.99,321,328,C,"Topological methods aim at the segmentation of a vector field into areas of different flow behavior. For 2D time-dependent vector fields, two such segmentations are possible: either concerning the behavior of stream lines, or of path lines. While stream line oriented topology is well established, we introduce path line oriented topology as a new visualization approach in this paper. As a contribution to stream line oriented topology we introduce new methods to detect global bifurcations like saddle connections and cyclic fold bifurcations. To get the path line oriented topology we segment the vector field into areas of attracting, repelling and saddle-like behavior of the path lines. We compare both kinds of topologies and apply them to a number of data sets.",Holger Theisel;Tino Weinkauf;Hans-Christian Hege;Hans-Peter Seidel,H. Theisel;T. Weinkauf;H.-C. Hege;H.-P. Seidel,"Max-Planck-Inst. fur Inf., Saarbrucken, Germany",10.1109/VISUAL.1999.809907;10.1109/VISUAL.2000.885714;10.1109/VISUAL.1993.398849;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1996.567777;10.1109/VISUAL.2000.885716;10.1109/VISUAL.2001.964507;10.1109/VISUAL.2003.1250376,"flow visualization, vector field topology, bifurcations, stream lines, path lines",39,25,28,
Vis,2006,Lines of Curvature for Polyp Detection in Virtual Colonoscopy,10.1109/TVCG.2006.158,http://dx.doi.org/10.1109/TVCG.2006.158,885,892,J,"Computer-aided diagnosis (CAD) is a helpful addition to laborious visual inspection for preselection of suspected colonic polyps in virtual colonoscopy. Most of the previous work on automatic polyp detection makes use of indicators based on the scalar curvature of the colon wall and can result in many false-positive detections. Our work tries to reduce the number of false-positive detections in the preselection of polyp candidates. Polyp surface shape can be characterized and visualized using lines of curvature. In this paper, we describe techniques for generating and rendering lines of curvature on surfaces and we show that these lines can be used as part of a polyp detection approach. We have adapted existing approaches on explicit triangular surface meshes, and developed a new algorithm on implicit surfaces embedded in 3D volume data. The visualization of shaded colonic surfaces can be enhanced by rendering the derived lines of curvature on these surfaces. Features strongly correlated with true-positive detections were calculated on lines of curvature and used for the polyp candidate selection. We studied the performance of these features on 5 data sets that included 331 pre-detected candidates, of which 50 sites were true polyps. The winding angle had a significant discriminating power for true-positive detections, which was demonstrated by a Wilcoxon rank sum test with p&amp;lt;0.001. The median winding angle and inter-quartile range (IQR) for true polyps were 7.817 and 6.770-9.288 compared to 2.954 and 1.995-3.749 for false-positive detections",Lingxiao Zhao;Charl P. Botha;Javier Bescos;Roel Truyen;Frans Vos;Frits H. Post,Lingxiao Zhao;Charl Botha;Javier Bescos;Roel Truyen;Frans Vos;Frits Post,"Data Visualization Group, Delft University of Technology;Data Visualization Group, Delft University of Technology;Philips Medical Systems Nederland BV, Best;Philips Medical Systems Nederland BV, Best;Quantitative Imaging Group, Delft University of Technology and Dept. of Radiology, Academic Medical Centre, Amsterdam;Data Visualization Group, Delft University of Technology",10.1109/VISUAL.2005.1532832;10.1109/VISUAL.2000.885690;10.1109/VISUAL.2002.1183789;10.1109/VISUAL.1995.480795,"Medical visualization, virtual colonoscopy, polyp detection, line of curvature, implicit surface",39,31,33,
InfoVis,2008,Multi-Focused Geospatial Analysis Using Probes,10.1109/TVCG.2008.149,http://dx.doi.org/10.1109/TVCG.2008.149,1165,1172,J,"Traditional geospatial information visualizations often present views that restrict the user to a single perspective. When zoomed out, local trends and anomalies become suppressed and lost; when zoomed in for local inspection, spatial awareness and comparison between regions become limited. In our model, coordinated visualizations are integrated within individual probe interfaces, which depict the local data in user-defined regions-of-interest. Our probe concept can be incorporated into a variety of geospatial visualizations to empower users with the ability to observe, coordinate, and compare data across multiple local regions. It is especially useful when dealing with complex simulations or analyses where behavior in various localities differs from other localities and from the system as a whole. We illustrate the effectiveness of our technique over traditional interfaces by incorporating it within three existing geospatial visualization systems: an agent-based social simulation, a census data exploration tool, and an 3D GIS environment for analyzing urban change over time. In each case, the probe-based interaction enhances spatial awareness, improves inspection and comparison capabilities, expands the range of scopes, and facilitates collaboration among multiple users.",Thomas Butkiewicz;Wenwen Dou;Zachary Wartell;William Ribarsky;Remco Chang,Thomas Butkiewicz;Wenwen Dou;Zachary Wartell;William Ribarsky;Remco Chang,"The Charlotte Visualization Center, UNC Charlotte;The Charlotte Visualization Center, UNC Charlotte;The Charlotte Visualization Center, UNC Charlotte;The Charlotte Visualization Center, UNC Charlotte;The Charlotte Visualization Center, UNC Charlotte",10.1109/INFVIS.2000.885102;10.1109/TVCG.2007.70574,"Multiple-view techniques, geospatial visualization, geospatial analysis, focus + context, probes",39,26,20,
Vis,2008,Direct Volume Editing,10.1109/TVCG.2008.120,http://dx.doi.org/10.1109/TVCG.2008.120,1388,1395,J,"In this work we present basic methodology for interactive volume editing on GPUs, and we demonstrate the use of these methods to achieve a number of different effects. We present fast techniques to modify the appearance and structure of volumetric scalar fields given on Cartesian grids. Similar to 2D circular brushes as used in surface painting we present 3D spherical brushes for intuitive coloring of particular structures in such fields. This paint metaphor is extended to allow the user to change the data itself, and the use of this functionality for interactive structure isolation, hole filling, and artefact removal is demonstrated. Building on previous work in the field we introduce high-resolution selection volumes, which can be seen as a resolution-based focus+context metaphor. By utilizing such volumes we present a novel approach to interactive volume editing at sub-voxel accuracy. Finally, we introduce a fast technique to paste textures onto iso-surfaces in a 3D scalar field. Since the texture resolution is independent of the volume resolution, this technique allows structure-aligned textures containing appearance properties or textual information to be used for volume augmentation and annotation.",Kai Bürger;Jens H. Krüger;Rüdiger Westermann,Kai Bürger;Jens Krüger;Rüdiger Westermann,"Technische Universität München, tum.3D;Scientific Computing and Imaging Institute, University of Utah;Technische Universität München, tum.3D",10.1109/TVCG.2006.124;10.1109/VISUAL.1996.568110;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2002.1183762;10.1109/VISUAL.2002.1183777;10.1109/TVCG.2007.70555;10.1109/VISUAL.2003.1250381;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2004.48;10.1109/VISUAL.2005.1532856;10.1109/VISUAL.1996.568108,"Volume editing, GPU, painting, carving, annotations",39,23,37,
Vis,2008,Interactive Visual Steering - Rapid Visual Prototyping of a Common Rail Injection System,10.1109/TVCG.2008.145,http://dx.doi.org/10.1109/TVCG.2008.145,1699,1706,J,"Interactive steering with visualization has been a common goal of the visualization research community for twenty years, but it is rarely ever realized in practice. In this paper we describe a successful realization of a tightly coupled steering loop, integrating new simulation technology and interactive visual analysis in a prototyping environment for automotive industry system design. Due to increasing pressure on car manufacturers to meet new emission regulations, to improve efficiency, and to reduce noise, both simulation and visualization are pushed to their limits. Automotive system components, such as the powertrain system or the injection system have an increasing number of parameters, and new design approaches are required. It is no longer possible to optimize such a system solely based on experience or forward optimization. By coupling interactive visualization with the simulation back-end (computational steering), it is now possible to quickly prototype a new system, starting from a non-optimized initial prototype and the corresponding simulation model. The prototyping continues through the refinement of the simulation model, of the simulation parameters and through trial-and-error attempts to an optimized solution. The ability to early see the first results from a multidimensional simulation space - thousands of simulations are run for a multidimensional variety of input parameters - and to quickly go back into the simulation and request more runs in particular parameter regions of interest significantly improves the prototyping process and provides a deeper understanding of the system behavior. The excellent results which we achieved for the common rail injection system strongly suggest that our approach has a great potential of being generalized to other, similar scenarios.",Kresimir Matkovic;Denis Gracanin;Mario Jelovic;Helwig Hauser,Kresimir Matkovic;Denis Gracanin;Mario Jelovic;Helwig Hauser,"VRVis Research Center, Vienna;Virginia Tech;AVL AST, Zagreb;University of Bergen",10.1109/INFVIS.2004.12;10.1109/VISUAL.1998.745289;10.1109/VISUAL.2005.1532821;10.1109/INFVIS.2005.1532143;10.1109/VISUAL.2003.1250417;10.1109/VISUAL.2005.1532850,"Interactive computational steering, interactive visual analysis, simulation, common rail injection system",39,33,24,
VAST,2009,Two-stage framework for visualization of clustered high dimensional data,10.1109/VAST.2009.5332629,http://dx.doi.org/10.1109/VAST.2009.5332629,67,74,C,"In this paper, we discuss dimension reduction methods for 2D visualization of high dimensional clustered data. We propose a two-stage framework for visualizing such data based on dimension reduction methods. In the first stage, we obtain the reduced dimensional data by applying a supervised dimension reduction method such as linear discriminant analysis which preserves the original cluster structure in terms of its criteria. The resulting optimal reduced dimension depends on the optimization criteria and is often larger than 2. In the second stage, the dimension is further reduced to 2 for visualization purposes by another dimension reduction method such as principal component analysis. The role of the second-stage is to minimize the loss of information due to reducing the dimension all the way to 2. Using this framework, we propose several two-stage methods, and present their theoretical characteristics as well as experimental comparisons on both artificial and real-world text data sets.",Jaegul Choo;Shawn Bohn;Haesun Park,Jaegul Choo;Shawn Bohn;Haesun Park,"College of Computing, Georgia Institute of Technology, 266 Ferst Drive, Atlanta, 30332, USA;National Visualization and Analytics Center, Pacific Northwest National Laboratory, 902 Battelle Blvd, Richland, WA 99354, USA;College of Computing, Georgia Institute of Technology, 266 Ferst Drive, Atlanta, 30332, USA",10.1109/INFVIS.2003.1249017,"dimension reduction, linear discriminant analysis, principal component analysis, orthogonal centroid method, 2D projection, clustered data, regularization, generalized singular value decomposition",39,30,21,
Vis,2009,Markerless View-Independent Registration of Multiple Distorted Projectors on Extruded Surfaces Using an Uncalibrated Camera,10.1109/TVCG.2009.166,http://dx.doi.org/10.1109/TVCG.2009.166,1307,1316,J,"In this paper, we present the first algorithm to geometrically register multiple projectors in a view-independent manner (i.e. wallpapered) on a common type of curved surface, vertically extruded surface, using an uncalibrated camera without attaching any obtrusive markers to the display screen. Further, it can also tolerate large non-linear geometric distortions in the projectors as is common when mounting short throw lenses to allow a compact set-up. Our registration achieves sub-pixel accuracy on a large number of different vertically extruded surfaces and the image correction to achieve this registration can be run in real time on the GPU. This simple markerless registration has the potential to have a large impact on easy set-up and maintenance of large curved multi-projector displays, common for visualization, edutainment, training and simulation applications.",Behzad Sajadi;Aditi Majumder,Behzad Sajadi;Aditi Majumder,"University of California, Irvine;University of California, Irvine",10.1109/VISUAL.2001.964508;10.1109/VISUAL.2002.1183793;10.1109/VISUAL.1999.809883;10.1109/TVCG.2009.124;10.1109/TVCG.2007.70586,"Registration, Calibration, Multi-Projector Displays, Tiled Displays",39,31,20,HM
Vis,2009,A Novel Interface for Interactive Exploration of DTI fibers,10.1109/TVCG.2009.112,http://dx.doi.org/10.1109/TVCG.2009.112,1433,1440,J,"Visual exploration is essential to the visualization and analysis of densely sampled 3D DTI fibers in biological speciments, due to the high geometric, spatial, and anatomical complexity of fiber tracts. Previous methods for DTI fiber visualization use zooming, color-mapping, selection, and abstraction to deliver the characteristics of the fibers. However, these schemes mainly focus on the optimization of visualization in the 3D space where cluttering and occlusion make grasping even a few thousand fibers difficult. This paper introduces a novel interaction method that augments the 3D visualization with a 2D representation containing a low-dimensional embedding of the DTI fibers. This embedding preserves the relationship between the fibers and removes the visual clutter that is inherent in 3D renderings of the fibers. This new interface allows the user to manipulate the DTI fibers as both 3D curves and 2D embedded points and easily compare or validate his or her results in both domains. The implementation of the framework is GPU based to achieve real-time interaction. The framework was applied to several tasks, and the results show that our method reduces the user's workload in recognizing 3D DTI fibers and permits quick and accurate DTI fiber selection.",Wei Chen 0001;Zi'ang Ding;Song Zhang 0004;Anna MacKay-Brandt;Stephen Correia;Huamin Qu;John Allen Crow;David F. Tate;Zhicheng Yan;Qunsheng Peng,Wei Chen;Zi'ang Ding;Song Zhang;Anna MacKay-Brandt;Stephen Correia;Huamin Qu;John Allen Crow;David F. Tate;Zhicheng Yan;Qunsheng Peng,"State Key Lab of CAD&CG,Zhejiang University;State Key Lab of CAD&CG,Zhejiang University;Department of Computer Science and Engineering,Mississippi State University;Brown University;Brown University;Department of Computer Science and Engineering,The Hong Kong University of Science and Technology;College of Veterinary Medicine, Mississippi State University;Brigham and Women’s Hospital;State Key Lab of CAD&CG,Zhejiang University;State Key Lab of CAD&CG,Zhejiang University",10.1109/TVCG.2007.70602;10.1109/TVCG.2009.141;10.1109/VISUAL.2005.1532777;10.1109/VISUAL.2003.1250413;10.1109/VISUAL.2005.1532778;10.1109/VISUAL.2005.1532779;10.1109/VISUAL.2005.1532772;10.1109/VISUAL.2003.1250379;10.1109/VISUAL.2004.30,"Diffusion Tensor Imaging, fibers, fiber Clustering, Visualization Interface",39,35,30,
Vis,2009,Parameter Sensitivity Visualization for DTI fiber Tracking,10.1109/TVCG.2009.170,http://dx.doi.org/10.1109/TVCG.2009.170,1441,1448,J,"Fiber tracking of diffusion tensor imaging (DTI) data offers a unique insight into the three-dimensional organisation of white matter structures in the living brain. However, fiber tracking algorithms require a number of user-defined input parameters that strongly affect the output results. Usually the fiber tracking parameters are set once and are then re-used for several patient datasets. However, the stability of the chosen parameters is not evaluated and a small change in the parameter values can give very different results. The user remains completely unaware of such effects. Furthermore, it is difficult to reproduce output results between different users. We propose a visualization tool that allows the user to visually explore how small variations in parameter values affect the output of fiber tracking. With this knowledge the user cannot only assess the stability of commonly used parameter values but also evaluate in a more reliable way the output results between different patients. Existing tools do not provide such information. A small user evaluation of our tool has been done to show the potential of the technique.",Ralph Brecheisen;Anna Vilanova;Bram Platel;Bart M. ter Haar Romeny,Ralph Brecheisen;Anna Vilanova;Bram Platel;Bart ter Haar Romeny,Technical University Eindhoven;Technical University Eindhoven;Technical University Eindhoven;Technical University Eindhoven,10.1109/TVCG.2008.147;10.1109/VISUAL.2005.1532853;10.1109/TVCG.2007.70518;10.1109/VISUAL.2005.1532778;10.1109/VISUAL.2005.1532779;10.1109/VISUAL.1996.568116;10.1109/VISUAL.1999.809894;10.1109/VISUAL.2004.30;10.1109/VISUAL.2001.964552,"fiber Tracking, Parameter Sensitivity, Stopping Criteria, Diffusion Tensor Imaging, Uncertainty Visualization",39,29,33,
Vis,2009,Volume Ray Casting with Peak finding and Differential Sampling,10.1109/TVCG.2009.204,http://dx.doi.org/10.1109/TVCG.2009.204,1571,1578,J,"Direct volume rendering and isosurfacing are ubiquitous rendering techniques in scientific visualization, commonly employed in imaging 3D data from simulation and scan sources. Conventionally, these methods have been treated as separate modalities, necessitating different sampling strategies and rendering algorithms. In reality, an isosurface is a special case of a transfer function, namely a Dirac impulse at a given isovalue. However, artifact-free rendering of discrete isosurfaces in a volume rendering framework is an elusive goal, requiring either infinite sampling or smoothing of the transfer function. While preintegration approaches solve the most obvious deficiencies in handling sharp transfer functions, artifacts can still result, limiting classification. In this paper, we introduce a method for rendering such features by explicitly solving for isovalues within the volume rendering integral. In addition, we present a sampling strategy inspired by ray differentials that automatically matches the frequency of the image plane, resulting in fewer artifacts near the eye and better overall performance. These techniques exhibit clear advantages over standard uniform ray casting with and without preintegration, and allow for high-quality interactive volume rendering with sharp C&lt;sup&gt;0&lt;/sup&gt; transfer functions.",Aaron Knoll;Younis Hijazi;Rolf Westerteiger;Mathias Schott;Charles D. Hansen;Hans Hagen,Aaron Knoll;Younis Hijazi;Rolf Westerteiger;Mathias Schott;Charles Hansen;Hans Hagen,"University of Kaiserslautern;University of Strasbourg;University of Kaiserslautern;SCI Institute, University of Utah;SCI Institute, University of Utah;University of Kaiserslautern",10.1109/VISUAL.1994.346320;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2003.1250412;10.1109/VISUAL.1998.745713;10.1109/TVCG.2006.154;10.1109/VISUAL.2000.885683;10.1109/TVCG.2006.149;10.1109/VISUAL.2001.964490;10.1109/VISUAL.2004.52;10.1109/VISUAL.1998.745300,"direct volume rendering, isosurface, ray casting, ray differentials, sampling, transfer function, preintegration, view dependent",39,32,35,
Vis,2010,Illustrative Stream Surfaces,10.1109/TVCG.2010.166,http://dx.doi.org/10.1109/TVCG.2010.166,1329,1338,J,"Stream surfaces are an intuitive approach to represent 3D vector fields. In many cases, however, they are challenging objects to visualize and to understand, due to a high degree of self-occlusion. Despite the need for adequate rendering methods, little work has been done so far in this important research area. In this paper, we present an illustrative rendering strategy for stream surfaces. In our approach, we apply various rendering techniques, which are inspired by the traditional flow illustrations drawn by Dallmann and Abraham &amp; Shaw in the early 1980s. Among these techniques are contour lines and halftoning to show the overall surface shape. Flow direction as well as singularities on the stream surface are depicted by illustrative surface streamlines. ;To go beyond reproducing static text book images, we provide several interaction features, such as movable cuts and slabs allowing an interactive exploration of the flow and insights into subjacent structures, e.g., the inner windings of vortex breakdown bubbles. These methods take only the parameterized stream surface as input, require no further preprocessing, and can be freely combined by the user. We explain the design, GPU-implementation, and combination of the different illustrative rendering and interaction methods and demonstrate the potential of our approach by applying it to stream surfaces from various flow simulations.",Silvia Born;Alexander Wiebel;Jan Friedrich;Gerik Scheuermann;Dirk Bartz,Silvia Born;Alexander Wiebel;Jan Friedrich;Gerik Scheuermann;Dirk Bartz,Universität Leipzig;Max Planck Institute for Human Cognitive and Brain Sciences;Universität Leipzig;Universität Leipzig;Universität Leipzig,10.1109/VISUAL.1990.146395;10.1109/TVCG.2009.190;10.1109/TVCG.2007.70565;10.1109/VISUAL.2005.1532857;10.1109/VISUAL.1999.809905;10.1109/TVCG.2008.133;10.1109/TVCG.2009.138;10.1109/VISUAL.2001.964506;10.1109/VISUAL.2005.1532858;10.1109/VISUAL.2005.1532855;10.1109/TVCG.2008.170;10.1109/VISUAL.2004.113;10.1109/VISUAL.2003.1250376,"Flow visualization, Stream surfaces, Illustrative rendering, Silhouettes, GPU technique, 3D vector field data",39,27,51,HM
VAST,2011,Network-based visual analysis of tabular data,10.1109/VAST.2011.6102440,http://dx.doi.org/10.1109/VAST.2011.6102440,41,50,C,"Tabular data are pervasive. Although tables often describe multivariate data without explicit network semantics, it may be advantageous to explore the data modeled as a graph or network for analysis. Even when a given table design conveys some static network semantics, analysts may want to look at multiple networks from different perspectives, at different levels of abstraction, and with different edge semantics. We present a system called Ploceus that offers a general approach for performing multi-dimensional and multi-level network-based visual analysis on multivariate tabular data. Powered by an underlying relational algebraic framework, Ploceus supports flexible construction and transformation of networks through a direct manipulation interface, and integrates dynamic network manipulation with visual exploration for a seamless analytic experience.",Zhicheng Liu;Shamkant B. Navathe;John T. Stasko,Zhicheng Liu;Shamkant B. Navathe;John T. Stasko,"Georgia Institute of Technology, USA;Georgia Institute of Technology, USA;Georgia Institute of Technology, USA",10.1109/TVCG.2006.122;10.1109/TVCG.2010.177;10.1109/TVCG.2007.70582;10.1109/TVCG.2006.166;10.1109/VAST.2010.5652520;10.1109/INFVIS.2000.885086;10.1109/VAST.2007.4389006,,39,25,37,HM
VAST,2011,Visual sentiment analysis on twitter data streams,10.1109/VAST.2011.6102472,http://dx.doi.org/10.1109/VAST.2011.6102472,277,278,M,"Twitter currently receives about 190 million tweets (small text-based Web posts) a day, in which people share their comments regarding a wide range of topics. A large number of tweets include opinions about products and services. However, with Twitter being a relatively new phenomenon, these tweets are underutilized as a source for evaluating customer sentiment. To explore high-volume twitter data, we introduce three novel time-based visual sentiment analysis techniques: (1) topic-based sentiment analysis that extracts, maps, and measures customer opinions; (2) stream analysis that identifies interesting tweets based on their density, negativity, and influence characteristics; and (3) pixel cell-based sentiment calendars and high density geo maps that visualize large volumes of data in a single view. We applied these techniques to a variety of twitter data, (e.g., movies, amusement parks, and hotels) to show their distribution and patterns, and to identify influential opinions.",Ming C. Hao;Christian Rohrdantz;Halldór Janetzko;Umeshwar Dayal;Daniel A. Keim;Lars-Erik Haug;Meichun Hsu,Ming Hao;Christian Rohrdantz;Halldór Janetzko;Umeshwar Dayal;Daniel A. Keim;Lars-Erik Haug;Mei-Chun Hsu,"Hewlett-Packard Labs, USA;Hewlett-Packard Labs, USA;Hewlett-Packard Labs, USA;Hewlett-Packard Labs, USA;Hewlett-Packard Labs, USA;University of Konstanz, Germany;University of Konstanz, Germany",,,39,20,3,
InfoVis,2012,Memorability of Visual Features in Network Diagrams,10.1109/TVCG.2012.245,http://dx.doi.org/10.1109/TVCG.2012.245,2477,2485,J,"We investigate the cognitive impact of various layout features-symmetry, alignment, collinearity, axis alignment and orthogonality - on the recall of network diagrams (graphs). This provides insight into how people internalize these diagrams and what features should or shouldn't be utilised when designing static and interactive network-based visualisations. Participants were asked to study, remember, and draw a series of small network diagrams, each drawn to emphasise a particular visual feature. The visual features were based on existing theories of perception, and the task enabled visual processing at the visceral level only. Our results strongly support the importance of visual features such as symmetry, collinearity and orthogonality, while not showing any significant impact for node-alignment or parallel edges.",Kim Marriott;Helen C. Purchase;Michael Wybrow;Cagatay Goncu,Kim Marriott;Helen Purchase;Michael Wybrow;Cagatay Goncu,Monash University;University of Glasgow;Monash University;Monash University,10.1109/TVCG.2008.155;10.1109/TVCG.2009.109,"Network diagrams, graph layout, perceptual theories, visual features, diagram recall, experiment",39,34,48,
InfoVis,2012,Sketchy Rendering for Information Visualization,10.1109/TVCG.2012.262,http://dx.doi.org/10.1109/TVCG.2012.262,2749,2758,J,"We present and evaluate a framework for constructing sketchy style information visualizations that mimic data graphics drawn by hand. We provide an alternative renderer for the Processing graphics environment that redefines core drawing primitives including line, polygon and ellipse rendering. These primitives allow higher-level graphical features such as bar charts, line charts, treemaps and node-link diagrams to be drawn in a sketchy style with a specified degree of sketchiness. The framework is designed to be easily integrated into existing visualization implementations with minimal programming modification or design effort. We show examples of use for statistical graphics, conveying spatial imprecision and for enhancing aesthetic and narrative qualities of visualization. We evaluate user perception of sketchiness of areal features through a series of stimulus-response tests in order to assess users' ability to place sketchiness on a ratio scale, and to estimate area. Results suggest relative area judgment is compromised by sketchy rendering and that its influence is dependent on the shape being rendered. They show that degree of sketchiness may be judged on an ordinal scale but that its judgement varies strongly between individuals. We evaluate higher-level impacts of sketchiness through user testing of scenarios that encourage user engagement with data visualization and willingness to critique visualization design. Results suggest that where a visualization is clearly sketchy, engagement may be increased and that attitudes to participating in visualization annotation are more positive. The results of our work have implications for effective information visualization design that go beyond the traditional role of sketching as a tool for prototyping or its use for an indication of general uncertainty.",Jo Wood;Petra Isenberg;Tobias Isenberg 0001;Jason Dykes;Nadia Boukhelifa;Aidan Slingsby,Jo Wood;Petra Isenberg;Tobias Isenberg;Jason Dykes;Nadia Boukhelifa;Aidan Slingsby,"giCentre, City University London;INRIA, Paris;University of Groningen, Netherlands;giCentre, City University London;INRIA, Paris;giCentre, City University London",10.1109/TVCG.2010.186;10.1109/TVCG.2011.175;10.1109/TVCG.2012.220;10.1109/TVCG.2011.251;10.1109/TVCG.2011.209;10.1109/TVCG.2011.255,"NPR, non-photorealistic rendering, sketch, hand-drawn, uncertainty, visualization",39,32,47,
InfoVis,2012,Taxonomy-Based Glyph Design---with a Case Study on Visualizing Workflows of Biological Experiments,10.1109/TVCG.2012.271,http://dx.doi.org/10.1109/TVCG.2012.271,2603,2612,J,"Glyph-based visualization can offer elegant and concise presentation of multivariate information while enhancing speed and ease in visual search experienced by users. As with icon designs, glyphs are usually created based on the designers' experience and intuition, often in a spontaneous manner. Such a process does not scale well with the requirements of applications where a large number of concepts are to be encoded using glyphs. To alleviate such limitations, we propose a new systematic process for glyph design by exploring the parallel between the hierarchy of concept categorization and the ordering of discriminative capacity of visual channels. We examine the feasibility of this approach in an application where there is a pressing need for an efficient and effective means to visualize workflows of biological experiments. By processing thousands of workflow records in a public archive of biological experiments, we demonstrate that a cost-effective glyph design can be obtained by following a process of formulating a taxonomy with the aid of computation, identifying visual channels hierarchically, and defining application-specific abstraction and metaphors.",Eamonn Maguire;Philippe Rocca-Serra;Susanna-Assunta Sansone;Jim Davies;Min Chen 0001,Eamonn Maguire;Philippe Rocca-Serra;Susanna-Assunta Sansone;Jim Davies;Min Chen,University of Oxford;University of Oxford;University of Oxford;University of Oxford;University of Oxford,10.1109/TVCG.2006.134;10.1109/TVCG.2012.197;10.1109/TVCG.2010.132;10.1109/VISUAL.1995.485141;10.1109/INFVIS.1998.729568,"Glyph-based techniques, taxonomies, design methodologies, bioinformatics visualization",39,31,63,
SciVis,2013,An Information-Aware Framework for Exploring Multivariate Data Sets,10.1109/TVCG.2013.133,http://dx.doi.org/10.1109/TVCG.2013.133,2683,2692,J,"Information theory provides a theoretical framework for measuring information content for an observed variable, and has attracted much attention from visualization researchers for its ability to quantify saliency and similarity among variables. In this paper, we present a new approach towards building an exploration framework based on information theory to guide the users through the multivariate data exploration process. In our framework, we compute the total entropy of the multivariate data set and identify the contribution of individual variables to the total entropy. The variables are classified into groups based on a novel graph model where a node represents a variable and the links encode the mutual information shared between the variables. The variables inside the groups are analyzed for their representativeness and an information based importance is assigned. We exploit specific information metrics to analyze the relationship between the variables and use the metrics to choose isocontours of selected variables. For a chosen group of points, parallel coordinates plots (PCP) are used to show the states of the variables and provide an interface for the user to select values of interest. Experiments with different data sets reveal the effectiveness of our proposed framework in depicting the interesting regions of the data sets taking into account the interaction among the variables.",Ayan Biswas;Soumya Dutta;Han-Wei Shen;Jonathan Woodring,Ayan Biswas;Soumya Dutta;Han-Wei Shen;Jonathan Woodring,The Ohio State University;The Ohio State University;The Ohio State University;Los Alamos National Laboratory,10.1109/TVCG.2010.132;10.1109/TVCG.2009.120;10.1109/VISUAL.1990.146402;10.1109/TVCG.2010.131;10.1109/TVCG.2006.152;10.1109/TVCG.2008.116;10.1109/TVCG.2010.184;10.1109/INFVIS.2004.15;10.1109/TVCG.2008.160;10.1109/TVCG.2008.140;10.1109/VAST.2007.4389000;10.1109/TVCG.2011.201;10.1109/VISUAL.1995.485139;10.1109/VISUAL.2005.1532833;10.1109/TVCG.2010.182;10.1109/VISUAL.1997.663875;10.1109/VISUAL.2002.1183785,"Information theory, framework, isosurface, multivariate uncertainty",39,42,46,
SciVis,2013,Fast Generation of Virtual X-ray Images for Reconstruction of 3D Anatomy,10.1109/TVCG.2013.159,http://dx.doi.org/10.1109/TVCG.2013.159,2673,2682,J,"We propose a novel GPU-based approach to render virtual X-ray projections of deformable tetrahedral meshes. These meshes represent the shape and the internal density distribution of a particular anatomical structure and are derived from statistical shape and intensity models (SSIMs). We apply our method to improve the geometric reconstruction of 3D anatomy (e.g. pelvic bone) from 2D X-ray images. For that purpose, shape and density of a tetrahedral mesh are varied and virtual X-ray projections are generated within an optimization process until the similarity between the computed virtual X-ray and the respective anatomy depicted in a given clinical X-ray is maximized. The OpenGL implementation presented in this work deforms and projects tetrahedral meshes of high resolution (200.000+ tetrahedra) at interactive rates. It generates virtual X-rays that accurately depict the density distribution of an anatomy of interest. Compared to existing methods that accumulate X-ray attenuation in deformable meshes, our novel approach significantly boosts the deformation/projection performance. The proposed projection algorithm scales better with respect to mesh resolution and complexity of the density distribution, and the combined deformation and projection on the GPU scales better with respect to the number of deformation parameters. The gain in performance allows for a larger number of cycles in the optimization process. Consequently, it reduces the risk of being stuck in a local optimum. We believe that our approach will improve treatments in orthopedics, where 3D anatomical information is essential.",Moritz Ehlke;Heiko Ramm;Hans Lamecker;Hans-Christian Hege;Stefan Zachow,Moritz Ehlke;Heiko Ramm;Hans Lamecker;Hans-Christian Hege;Stefan Zachow,Zuse Institut Berlin (ZIB);Zuse Institut Berlin (ZIB);Zuse Institut Berlin (ZIB);Zuse Institut Berlin (ZIB);Zuse Institut Berlin (ZIB),10.1109/VISUAL.2005.1532809;10.1109/VISUAL.2005.1532815;10.1109/TVCG.2006.110;10.1109/VISUAL.2003.1250384,"Digitally reconstructed radiographs, volume rendering, mesh deformation, statistical shape and intensity models, image registration, GPU acceleration",39,31,24,
VAST,2013,Explainers: Expert Explorations with Crafted Projections,10.1109/TVCG.2013.157,http://dx.doi.org/10.1109/TVCG.2013.157,2042,2051,J,"This paper introduces an approach to exploration and discovery in high-dimensional data that incorporates a user's knowledge and questions to craft sets of projection functions meaningful to them. Unlike most prior work that defines projections based on their statistical properties, our approach creates projection functions that align with user-specified annotations. Therefore, the resulting derived dimensions represent concepts defined by the user's examples. These especially crafted projection functions, or explainers, can help find and explain relationships between the data variables and user-designated concepts. They can organize the data according to these concepts. Sets of explainers can provide multiple perspectives on the data. Our approach considers tradeoffs in choosing these projection functions, including their simplicity, expressive power, alignment with prior knowledge, and diversity. We provide techniques for creating collections of explainers. The methods, based on machine learning optimization frameworks, allow exploring the tradeoffs. We demonstrate our approach on model problems and applications in text analysis.",Michael Gleicher,Michael Gleicher,"Department of Computer Sciences, University of Wisconsin - Madison",10.1109/VAST.2012.6400487;10.1109/VAST.2012.6400486;10.1109/TVCG.2012.277;10.1109/INFVIS.2005.1532142;10.1109/INFVIS.2004.71;10.1109/TVCG.2012.256;10.1109/VAST.2010.5652392;10.1109/VAST.2012.6400490;10.1109/TVCG.2011.220;10.1109/INFVIS.1998.729559;10.1109/VAST.2011.6102448;10.1109/TVCG.2009.153,"High-dimensional spaces, exploration, support vector machines",39,33,51,HM
VAST,2014,Proactive Spatiotemporal Resource Allocation and Predictive Visual Analytics for Community Policing and Law Enforcement,10.1109/TVCG.2014.2346926,http://dx.doi.org/10.1109/TVCG.2014.2346926,1863,1872,J,"In this paper, we present a visual analytics approach that provides decision makers with a proactive and predictive environment in order to assist them in making effective resource allocation and deployment decisions. The challenges involved with such predictive analytics processes include end-users' understanding, and the application of the underlying statistical algorithms at the right spatiotemporal granularity levels so that good prediction estimates can be established. In our approach, we provide analysts with a suite of natural scale templates and methods that enable them to focus and drill down to appropriate geospatial and temporal resolution levels. Our forecasting technique is based on the Seasonal Trend decomposition based on Loess (STL) method, which we apply in a spatiotemporal visual analytics context to provide analysts with predicted levels of future activity. We also present a novel kernel density estimation technique we have developed, in which the prediction process is influenced by the spatial correlation of recent incidents at nearby locations. We demonstrate our techniques by applying our methodology to Criminal, Traffic and Civil (CTC) incident datasets.",Abish Malik;Ross Maciejewski;Sherry Towers;Sean McCullough;David S. Ebert,Abish Malik;Ross Maciejewski;Sherry Towers;Sean McCullough;David S. Ebert,Purdue University;Arizona State University;Arizona State University;Purdue University;Purdue University,10.1109/TVCG.2013.125;10.1109/TVCG.2013.206;10.1109/VAST.2012.6400491;10.1109/VAST.2007.4389006;10.1109/TVCG.2013.200,"Visual Analytics, Natural Scales, Seasonal Trend decomposition based on Loess (STL), Law Enforcement",39,37,45,
InfoVis,2015,Beyond Weber's Law: A Second Look at Ranking Visualizations of Correlation,10.1109/TVCG.2015.2467671,http://dx.doi.org/10.1109/TVCG.2015.2467671,469,478,J,"Models of human perception - including perceptual “laws” - can be valuable tools for deriving visualization design recommendations. However, it is important to assess the explanatory power of such models when using them to inform design. We present a secondary analysis of data previously used to rank the effectiveness of bivariate visualizations for assessing correlation (measured with Pearson's r) according to the well-known Weber-Fechner Law. Beginning with the model of Harrison et al. [1], we present a sequence of refinements including incorporation of individual differences, log transformation, censored regression, and adoption of Bayesian statistics. Our model incorporates all observations dropped from the original analysis, including data near ceilings caused by the data collection process and entire visualizations dropped due to large numbers of observations worse than chance. This model deviates from Weber's Law, but provides improved predictive accuracy and generalization. Using Bayesian credibility intervals, we derive a partial ranking that groups visualizations with similar performance, and we give precise estimates of the difference in performance between these groups. We find that compared to other visualizations, scatterplots are unique in combining low variance between individuals and high precision on both positively- and negatively correlated data. We conclude with a discussion of the value of data sharing and replication, and share implications for modeling similar experimental data.",Matthew Kay 0001;Jeffrey Heer,Matthew Kay;Jeffrey Heer,University of Washington;University of Washington,10.1109/TVCG.2014.2346979,"Weber's law, perception of correlation, log transformation, censored regression, Bayesian methods",39,40,21,HM
VAST,2015,FeatureInsight: Visual support for error-driven feature ideation in text classification,10.1109/VAST.2015.7347637,http://dx.doi.org/10.1109/VAST.2015.7347637,105,112,C,"Machine learning requires an effective combination of data, features, and algorithms. While many tools exist for working with machine learning data and algorithms, support for thinking of new features, or feature ideation, remains poor. In this paper, we investigate two general approaches to support feature ideation: visual summaries and sets of errors. We present FeatureInsight, an interactive visual analytics tool for building new dictionary features (semantically related groups of words) for text classification problems. FeatureInsight supports an error-driven feature ideation process and provides interactive visual summaries of sets of misclassified documents. We conducted a controlled experiment evaluating both visual summaries and sets of errors in FeatureInsight. Our results show that visual summaries significantly improve feature ideation, especially in combination with sets of errors. Users preferred visual summaries over viewing raw data, and only preferred examining sets when visual summaries were provided. We discuss extensions of both approaches to data types other than text, and point to areas for future research.",Michael Brooks;Saleema Amershi;Bongshin Lee;Steven Mark Drucker;Ashish Kapoor;Patrice Y. Simard,Michael Brooks;Saleema Amershi;Bongshin Lee;Steven M. Drucker;Ashish Kapoor;Patrice Simard,"University of Washington, USA;Microsoft Research, USA;Microsoft Research, USA;Microsoft Research, USA;Microsoft Research, USA;Microsoft Research, USA",10.1109/VAST.2010.5652443,,39,27,37,
InfoVis,2016,Embedded Data Representations,10.1109/TVCG.2016.2598608,http://dx.doi.org/10.1109/TVCG.2016.2598608,461,470,J,"We introduce embedded data representations, the use of visual and physical representations of data that are deeply integrated with the physical spaces, objects, and entities to which the data refers. Technologies like lightweight wireless displays, mixed reality hardware, and autonomous vehicles are making it increasingly easier to display data in-context. While researchers and artists have already begun to create embedded data representations, the benefits, trade-offs, and even the language necessary to describe and compare these approaches remain unexplored. In this paper, we formalize the notion of physical data referents - the real-world entities and spaces to which data corresponds - and examine the relationship between referents and the visual and physical representations of their data. We differentiate situated representations, which display data in proximity to data referents, and embedded representations, which display data so that it spatially coincides with data referents. Drawing on examples from visualization, ubiquitous computing, and art, we explore the role of spatial indirection, scale, and interaction for embedded representations. We also examine the tradeoffs between non-situated, situated, and embedded data displays, including both visualizations and physicalizations. Based on our observations, we identify a variety of design challenges for embedded data representation, and suggest opportunities for future research and applications.",Wesley Willett;Yvonne Jansen;Pierre Dragicevic,Wesley Willett;Yvonne Jansen;Pierre Dragicevic,University of Calgary;University of Copenhagen;Inria,10.1109/TVCG.2013.134;10.1109/INFVIS.1998.729560,augmented reality;Information visualization;data physicalization;ambient displays;ubiquitous computing,39,36,54,
Vis,1991,Visualization and analysis of multi-variate data: a technique for all fields,10.1109/VISUAL.1991.175796,http://dx.doi.org/10.1109/VISUAL.1991.175796,171,"178, 421",C,"A technique is presented for plotting large multivariate data sets that involves the mapping of n independent variable dimensions on to a single hierarchical horizontal axis with a single dependent variable being plotted on the vertical axis. The emphasis is on visual statistical analysis of either discrete variables or continuous variables that have been sampled on, or binned to, a regular n-dimensional lattice. The general applicability of the technique is discussed, and ways are explored of representing the hierarchical data-driven symbols that are particularly well suited to a variety of visual analysis tasks.&lt;&lt;ETX&gt;&gt;",Ted Mihalisin;John Timlin;John Schwegler,T. Mihalisin;J. Timlin;J. Schwegler,"Mihalisin Associates, Ambler, PA, USA;Mihalisin Associates, Ambler, PA, USA;Mihalisin Associates, Ambler, PA, USA",,,38,12,9,
Vis,1996,BLaC-wavelets: a multiresolution analysis with non-nested spaces,10.1109/VISUAL.1996.567602,http://dx.doi.org/10.1109/VISUAL.1996.567602,43,48,C,"In the last five years, there has been numerous applications of wavelets and multiresolution analysis in many fields of computer graphics as different as geometric modelling, volume visualization or illumination modelling. Classical multiresolution analysis is based on the knowledge of a nested set of functional spaces in which the successive approximations of a given function converge to that function, and can be efficiently computed. This paper first proposes a theoretical framework which enables multiresolution analysis even if the functional spaces are not nested, as long as they still have the property that the successive approximations converge to the given function. Based on this concept, we finally introduce a new multiresolution analysis with exact reconstruction for large data sets defined on uniform grids. We construct a one-parameter family of multiresolution analyses which is a blending of Haar and linear multiresolution, using BLaC (Blending of Linear and Constant) wavelets.",Georges-Pierre Bonneau;Stefanie Hahmann;Gregory M. Nielson,G.-P. Bonneau;S. Hahmann;G.M. Nielson,"Lab. LMC, CNRS, Grenoble, France",,,38,22,6,
Vis,1997,VizWiz: a Java applet for interactive 3D scientific visualization on the Web,10.1109/VISUAL.1997.663891,http://dx.doi.org/10.1109/VISUAL.1997.663891,261,267,C,"VizWiz is a Java applet that provides basic interactive scientific visualization functionality, such as isosurfaces, cutting planes, and elevation plots, for 2D and 3D datasets that can be loaded into the applet by the user via, the applet's Web server. VizWiz is unique in that it is a completely platform independent scientific visualization tool, and is usable over the Web, without being manually downloaded or installed. Its 3D graphics are implemented using only the Java AWT API, making them portable across all Java supporting platforms. The paper describes the implementation of VizWiz, including design tradeoffs. Graphics performance figures are provided for a number of different platforms. A solution to the problem of uploading user data files into a Java applet, working around security limitations, is demonstrated. The lessons learned from this project are discussed.",Cherilyn Michaels;Michael J. Bailey,C. Michaels;M. Bailey,"Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA, USA",10.1109/VISUAL.1990.146361,,38,11,6,
Vis,2001,Quantitative comparative evaluation of 2D vector field visualization methods,10.1109/VISUAL.2001.964505,http://dx.doi.org/10.1109/VISUAL.2001.964505,143,150,C,"Presents results from a user study that compared six visualization methods for 2D vector data. Two methods used different distributions of short arrows, two used different distributions of integral curves, one used wedges located to suggest flow lines, and the final one was line-integral convolution (LIC). We defined three simple but representative tasks for users to perform using visualizations from each method: (1) locating all critical points in an image, (2) identifying critical point types, and (3) advecting a particle. The results show different strengths and weaknesses for each method. We found that users performed better with methods that: (1) showed the sign of vectors within the vector field, (2) visually represented integral curves, and (3) visually represented the locations of critical points. These results provide quantitative support for some of the anecdotal evidence concerning visualization methods. The tasks and testing framework also provide a basis for comparing other visualization methods, for creating more effective methods and for defining additional tasks to further understand tradeoffs among methods. They may also be useful for evaluating 2D vectors on 2D surfaces embedded in 3D and for defining analogous tasks for 3D visualization methods.",David H. Laidlaw;Robert Michael Kirby;J. Scott Davidson;Timothy S. Miller;Marco da Silva;William H. Warren;Michael J. Tarr,D.H. Laidlaw;R.M. Kirby;J.S. Davidson;T.S. Miller;M. da Silva;W.H. Warren;M. Tarr,"Dept. of Comput. Sci., Brown Univ., Providence, RI, USA",10.1109/VISUAL.1991.175773;10.1109/VISUAL.1999.809905,"Scientific Visualization, User Study, Line-integral Convolution, Two-dimensional Vector Fields, Streamlines, Iconic Textures, Image-guided Streamlines, Jittered Grid Icons, Critical Point, Advection, Fluid Dynamics, Fluid Flow",38,15,13,
Vis,2001,Normal bounds for subdivision-surface interference detection,10.1109/VISUAL.2001.964529,http://dx.doi.org/10.1109/VISUAL.2001.964529,333,340,C,"Subdivision surfaces are an attractive representation when modeling arbitrary-topology free-form surfaces and show great promise for applications in engineering design and computer animation. Interference detection is a critical tool in many of these applications. In this paper, we derive normal bounds for subdivision surfaces and use these to develop an efficient algorithm for (self-) interference detection.",Eitan Grinspun;Peter Schröder,E. Grinspun;P. Schroder,,,"Subdivision Surfaces, Multiresolution Surfaces, Self-interference, Gauss map, Loop's Scheme",38,11,34,
Vis,2002,Computing singularities of 3D vector fields with geometric algebra,10.1109/VISUAL.2002.1183786,http://dx.doi.org/10.1109/VISUAL.2002.1183786,283,289,C,"Critical points of a vector field are key to their characterization. Their positions as well as their indexes are crucial for understanding vector fields. Considerable work exists in 2D, but less is available for 3D or higher dimensions. Geometric algebra is a derivative of Clifford algebra that not only enables a succinct definition of the index of a critical point in higher dimension; it also provides insight and computational pathways for calculating the index. We describe the problems in terms of geometric algebra and present an octree based solution using the algebra for finding critical points and their index in a 3D vector field.",Stephen Mann;Alyn P. Rockwood,S. Mann;A. Rockwood,"Waterloo Univ., Ont., Canada",10.1109/VISUAL.1997.663858;10.1109/VISUAL.1997.663871,"Geometric Algebra, 3D Vector Fields, Singularities",38,17,20,
Vis,2002,Comparative evaluation of visualization and experimental results using image comparison metrics,10.1109/VISUAL.2002.1183790,http://dx.doi.org/10.1109/VISUAL.2002.1183790,315,322,C,"Comparative evaluation of visualization and experimental results is a critical step in computational steering. In this paper, we present a study of image comparison metrics for quantifying the magnitude of difference between visualization of a computer simulation and a photographic image captured from an experiment. We examined eleven metrics, including three spatial domain, four spatial-frequency domain and four HVS (human-vision system) metrics. Among these metrics, a spatial-frequency domain metric called 2nd-order Fourier comparison was proposed specifically for this work. Our study consisted of two stages: base cases and field trials. The former is a general study on a controlled comparison space using purposely selected data, and the latter involves imagery results from computational fluid dynamics and a rheological experiment. This study has introduced a methodological framework for analyzing image-level methods used in comparative visualization. For the eleven metrics considered, it has offered a set of informative indicators as to the strengths and weaknesses of each metric. In particular, we have identified three image comparison metrics that are effective in separating ""similar"" and ""different"" image groups. Our 2nd-order Fourier comparison metric has compared favorably with others in two of the three tests, and has shown its potential to be used for steering computer simulation quantitatively.",Hualin Zhou;Min Chen 0001;Michael F. Webster,Hualin Zhou;Min Chen;M.F. Webster,"Univ. of Wales, Swansea, UK;Univ. of Wales, Swansea, UK;Univ. of Wales, Swansea, UK",10.1109/VISUAL.1999.809873;10.1109/VISUAL.1996.568140;10.1109/VISUAL.1998.745332,"scientific visualization, comparative visualization, image comparison, error metrics, human vision system, rheology",38,12,26,
Vis,2004,Constrained inverse volume rendering for planetary nebulae,10.1109/VISUAL.2004.18,http://dx.doi.org/10.1109/VISUAL.2004.18,83,90,C,"Determining the three-dimensional structure of distant astronomical objects is a challenging task, given that terrestrial observations provide only one viewpoint. For this task, bipolar planetary nebulae are interesting objects of study because of their pronounced axial symmetry due to fundamental physical processes. Making use of this symmetry constraint, we present a technique to automatically recover the axisymmetric structure of bipolar planetary nebulae from two-dimensional images. With GPU-based volume rendering driving a nonlinear optimization, we estimate the nebula's local emission density as a function of its radial and axial coordinates, and we recover the orientation of the nebula relative to Earth. The optimization refines the nebula model and its orientation by minimizing the differences between the rendered image and the original astronomical image. The resulting model enables realistic 3D visualizations of planetary nebulae, e.g. for educational purposes in planetarium shows. In addition, the recovered spatial distribution of the emissive gas allows validating computer simulation results of the astrophysical formation processes of planetary nebulae.",Marcus A. Magnor;Gordon L. Kindlmann;Charles D. Hansen,M. Magnor;G. Kindlmann;N. Duric;C. Hansen,,,"volumetric modeling, inverse rendering, volume rendering, volume reconstruction, planetary nebulae",38,16,36,
Vis,2005,A shader-based parallel rendering framework,10.1109/VISUAL.2005.1532787,http://dx.doi.org/10.1109/VISUAL.2005.1532787,127,134,C,"Existing parallel or remote rendering solutions rely on communicating pixels, OpenGL commands, scene-graph changes or application-specific data. We propose an intermediate solution based on a set of independent graphics primitives that use hardware shaders to specify their visual appearance. Compared to an OpenGL based approach, it reduces the complexity of the model by eliminating most fixed function parameters while giving access to the latest functionalities of graphics cards. It also suppresses the OpenGL state machine that creates data dependencies making primitive re-scheduling difficult. Using a retained-mode communication protocol transmitting changes between each frame, combined with the possibility to use shaders to implement interactive data processing operations instead of sending final colors and geometry, we are able to optimize the network load. High level information such as bounding volumes is used to setup advanced schemes where primitives are issued in parallel, routed according to their visibility, merged and re-ordered when received for rendering. Different optimization algorithms can be efficiently implemented, saving network bandwidth or reducing texture switches for instance. We present performance results based on two VTK applications, a parallel iso-surface extraction and a parallel volume renderer. We compare our approach with Chromium. Results show that our approach leads to significantly better performance and scalability, while offering easy access to hardware accelerated rendering algorithms.",Jérémie Allard;Bruno Raffin,J. Allard;B. Raffin,"ID-IMAG, CNRS, France;ID-IMAG, CNRS, France",10.1109/VISUAL.1995.480821;10.1109/VISUAL.2002.1183812," Distributed Rendering, Shaders, Volume Rendering",38,6,35,
InfoVis,2006,Multi-Scale Banking to 45 Degrees,10.1109/TVCG.2006.163,http://dx.doi.org/10.1109/TVCG.2006.163,701,708,J,"In his text Visualizing Data, William Cleveland demonstrates how the aspect ratio of a line chart can affect an analyst's perception of trends in the data. Cleveland proposes an optimization technique for computing the aspect ratio such that the average absolute orientation of line segments in the chart is equal to 45 degrees. This technique, called banking to 45deg, is designed to maximize the discriminability of the orientations of the line segments in the chart. In this paper, we revisit this classic result and describe two new extensions. First, we propose alternate optimization criteria designed to further improve the visual perception of line segment orientations. Second, we develop multi-scale banking, a technique that combines spectral analysis with banking to 45deg. Our technique automatically identifies trends at various frequency scales and then generates a banked chart for each of these scales. We demonstrate the utility of our techniques in a range of visualization tools and analysis examples",Jeffrey Heer;Maneesh Agrawala,Jeffrey Heer;Maneesh Agrawala,"Computer Science Division of the University of California, Berkeley.;Computer Science Division of the University of California, Berkeley",,"Information visualization, banking to 45 degrees, line charts, time-series, sparklines, graphical perception",38,32,8,
VAST,2006,Pixnostics: Towards Measuring the Value of Visualization,10.1109/VAST.2006.261423,http://dx.doi.org/10.1109/VAST.2006.261423,199,206,C,"During the last two decades a wide variety of advanced methods for the visual exploration of large data sets have been proposed. For most of these techniques user interaction has become a crucial element, since there are many situations in which a user or an analyst has to select the right parameter settings from among many or select a subset of the available attribute space for the visualization process, in order to construct valuable visualizations that provide insight, into the data and reveal interesting patterns. The right choice of input parameters is often essential, since suboptimal parameter settings or the investigation of irrelevant data dimensions make the exploration process more time consuming and may result in wrong conclusions. In this paper we propose a novel method for automatically determining meaningful parameter- and attribute settings based on the information content of the resulting visualizations. Our technique called Pixnostics, in analogy to Scagnostics (Wilkinson et al., 2005), automatically analyses pixel images resulting from diverse parameter mappings and ranks them according to the potential value for the user. This allows a more effective and more efficient visual data analysis process, since the attribute/parameter space is reduced to meaningful selections and thus the analyst obtains faster insight into the data. Real world applications are provided to show the benefit of the proposed approach",Jörn Schneidewind;Mike Sips;Daniel A. Keim,Jorn Schneidewind;Mike Sips;Daniel A. Keim,"University of Konstanz, Germany. schneide@inf.uni-konstanz.de;Stanford University, USA. ms@pixelmap.org;University of Konstanz, Germany. keim@inf.uni-konstanz.de",10.1109/INFVIS.2005.1532145;10.1109/INFVIS.2005.1532142;10.1109/VISUAL.2005.1532782;10.1109/VISUAL.2005.1532781;10.1109/INFVIS.2000.885092,"Visual Data Exploration, Visualization technique,Visual Analytics",38,25,24,
Vis,2006,Mesh Layouts for Block-Based Caches,10.1109/TVCG.2006.162,http://dx.doi.org/10.1109/TVCG.2006.162,1213,1220,J,"Current computer architectures employ caching to improve the performance of a wide variety of applications. One of the main characteristics of such cache schemes is the use of block fetching whenever an uncached data element is accessed. To maximize the benefit of the block fetching mechanism, we present novel cache-aware and cache-oblivious layouts of surface and volume meshes that improve the performance of interactive visualization and geometric processing algorithms. Based on a general I/O model, we derive new cache-aware and cache-oblivious metrics that have high correlations with the number of cache misses when accessing a mesh. In addition to guiding the layout process, our metrics can be used to quantify the quality of a layout, e.g. for comparing different layouts of the same mesh and for determining whether a given layout is amenable to significant improvement. We show that layouts of unstructured meshes optimized for our metrics result in improvements over conventional layouts in the performance of visualization applications such as isosurface extraction and view-dependent rendering. Moreover, we improve upon recent cache-oblivious mesh layouts in terms of performance, applicability, and accuracy",Sung-Eui Yoon;Peter Lindstrom,Sung-eui Yoon;Peter Lindstrom,Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory,10.1109/VISUAL.2004.86;10.1109/VISUAL.2003.1250408;10.1109/VISUAL.2001.964533;10.1109/VISUAL.1996.568125;10.1109/VISUAL.2005.1532800;10.1109/VISUAL.2002.1183794,"Mesh and graph layouts, cache-aware and cache-oblivious layouts, metrics for cache coherence, data locality",38,24,32,
Vis,2007,Stochastic DT-MRI Connectivity Mapping on the GPU,10.1109/TVCG.2007.70597,http://dx.doi.org/10.1109/TVCG.2007.70597,1504,1511,J,"We present a method for stochastic fiber tract mapping from diffusion tensor MRI (DT-MRI) implemented on graphics hardware. From the simulated fibers we compute a connectivity map that gives an indication of the probability that two points in the dataset are connected by a neuronal fiber path. A Bayesian formulation of the fiber model is given and it is shown that the inversion method can be used to construct plausible connectivity. An implementation of this fiber model on the graphics processing unit (GPU) is presented. Since the fiber paths can be stochastically generated independently of one another, the algorithm is highly parallelizable. This allows us to exploit the data-parallel nature of the GPU fragment processors. We also present a framework for the connectivity computation on the GPU. Our implementation allows the user to interactively select regions of interest and observe the evolving connectivity results during computation. Results are presented from the stochastic generation of over 250,000 fiber steps per iteration at interactive frame rates on consumer-grade graphics hardware.",Tim McGraw;Mariappan S. Nadar,Tim McGraw;Mariappan Nadar,West Virginia University;Siemens Corporate Research,10.1109/VISUAL.2005.1532780;10.1109/TVCG.2006.134;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.1998.745294;10.1109/VISUAL.1999.809886;10.1109/VISUAL.2005.1532779;10.1109/VISUAL.2005.1532777;10.1109/VISUAL.1999.809904;10.1109/TVCG.2006.151,"diffusion tensor, magnetic resonance imaging, stochastic tractography",38,27,60,
Vis,2007,Texture-based feature tracking for effective time-varying data visualization,10.1109/TVCG.2007.70599,http://dx.doi.org/10.1109/TVCG.2007.70599,1472,1479,J,"Analyzing, visualizing, and illustrating changes within time-varying volumetric data is challenging due to the dynamic changes occurring between timesteps. The changes and variations in computational fluid dynamic volumes and atmospheric 3D datasets do not follow any particular transformation. Features within the data move at different speeds and directions making the tracking and visualization of these features a difficult task. We introduce a texture-based feature tracking technique to overcome some of the current limitations found in the illustration and visualization of dynamic changes within time-varying volumetric data. Our texture-based technique tracks various features individually and then uses the tracked objects to better visualize structural changes. We show the effectiveness of our texture-based tracking technique with both synthetic and real world time-varying data. Furthermore, we highlight the specific visualization, annotation, registration, and feature isolation benefits of our technique. For instance, we show how our texture-based tracking can lead to insightful visualizations of time-varying data. Such visualizations, more than traditional visualization techniques, can assist domain scientists to explore and understand dynamic changes.",Jesus J. Caban;Alark Joshi;Penny Rheingans,Jesus Caban;Alark Joshi;Penny Rheingans,"University of Maryland, Baltimore County;University of Maryland, Baltimore County;University of Maryland, Baltimore County",10.1109/VISUAL.2003.1250374;10.1109/VISUAL.2000.885694;10.1109/VISUAL.1998.745288;10.1109/VISUAL.1996.567807,"Feature tracking, texture-based analysis, flow visualization, time-varying data, visualization",38,31,19,
Vis,2008,Focus+Context Visualization with Distortion Minimization,10.1109/TVCG.2008.132,http://dx.doi.org/10.1109/TVCG.2008.132,1731,1738,J,"The need to examine and manipulate large surface models is commonly found in many science, engineering, and medical applications. On a desktop monitor, however, seeing the whole model in detail is not possible. In this paper, we present a new, interactive Focus+Context method for visualizing large surface models. Our method, based on an energy optimization model, allows the user to magnify an area of interest to see it in detail while deforming the rest of the area without perceivable distortion. The rest of the surface area is essentially shrunk to use as little of the screen space as possible in order to keep the entire model displayed on screen. We demonstrate the efficacy and robustness of our method with a variety of models.",Yu-Shuen Wang;Tong-Yee Lee;Chiew-Lan Tai,Yu-Shuen Wang;Tong-Yee Lee;Chiew-Lan Tai,National Cheng-Kung University;National Cheng-Kung University;Hong Kong University of Science and Technology,10.1109/INFVIS.1997.636786;10.1109/VISUAL.2004.48;10.1109/INFVIS.1996.559215;10.1109/VISUAL.2003.1250400;10.1109/INFVIS.1996.559214;10.1109/INFVIS.1998.729558;10.1109/VISUAL.2005.1532818,"Focus+Context visualization, magnification, bounding space",38,30,15,
Vis,2009,Exploring the Millennium Run - Scalable Rendering of Large-Scale Cosmological Datasets,10.1109/TVCG.2009.142,http://dx.doi.org/10.1109/TVCG.2009.142,1251,1258,J,"In this paper we investigate scalability limitations in the visualization of large-scale particle-based cosmological simulations, and we present methods to reduce these limitations on current PC architectures. To minimize the amount of data to be streamed from disk to the graphics subsystem, we propose a visually continuous level-of-detail (LOD) particle representation based on a hierarchical quantization scheme for particle coordinates and rules for generating coarse particle distributions. Given the maximal world space error per level, our LOD selection technique guarantees a sub-pixel screen space error during rendering. A brick-based page-tree allows to further reduce the number of disk seek operations to be performed. Additional particle quantities like density, velocity dispersion, and radius are compressed at no visible loss using vector quantization of logarithmically encoded floating point values. By fine-grain view-frustum culling and presence acceleration in a geometry shader the required geometry throughput on the GPU can be significantly reduced. We validate the quality and scalability of our method by presenting visualizations of a particle-based cosmological dark-matter simulation exceeding 10 billion elements.",Roland Fraedrich;Jens Schneider;Rüdiger Westermann,Roland Fraedrich;Jens Schneider;Rüdiger Westermann,Technische Universität München;Technische Universität München;Technische Universität München,10.1109/VISUAL.2003.1250404;10.1109/VISUAL.2002.1183824;10.1109/VISUAL.2003.1250404;10.1109/VISUAL.2005.1532795;10.1109/VISUAL.2003.1250385;10.1109/TVCG.2006.176;10.1109/TVCG.2007.70530;10.1109/VISUAL.1997.663888;10.1109/TVCG.2007.70526;10.1109/VISUAL.2004.112;10.1109/TVCG.2006.155,"Particle Visualization, Scalability, Cosmology",38,31,26,
InfoVis,2010,Stacking Graphic Elements to Avoid Over-Plotting,10.1109/TVCG.2010.197,http://dx.doi.org/10.1109/TVCG.2010.197,1044,1052,J,"An ongoing challenge for information visualization is how to deal with over-plotting forced by ties or the relatively limited visual field of display devices. A popular solution is to represent local data density with area (bubble plots, treemaps), color(heatmaps), or aggregation (histograms, kernel densities, pixel displays). All of these methods have at least one of three deficiencies:1) magnitude judgments are biased because area and color have convex downward perceptual functions, 2) area, hue, and brightnesshave relatively restricted ranges of perceptual intensity compared to length representations, and/or 3) it is difficult to brush or link toindividual cases when viewing aggregations. In this paper, we introduce a new technique for visualizing and interacting with datasets that preserves density information by stacking overlapping cases. The overlapping data can be points or lines or other geometric elements, depending on the type of plot. We show real-dataset applications of this stacking paradigm and compare them to other techniques that deal with over-plotting in high-dimensional displays.",Tommy Dang;Leland Wilkinson;Anushka Anand,Tuan Nhon Dang;Leland Wilkinson;Anushka Anand,,10.1109/INFVIS.2005.1532139;10.1109/INFVIS.2005.1532138;10.1109/TVCG.2009.131;10.1109/INFVIS.1995.528685;10.1109/VISUAL.1991.175815;10.1109/INFVIS.2005.1532122;10.1109/INFVIS.2004.68;10.1109/INFVIS.2000.885098,"Dot plots, Parallel coordinate plots, Multidimensional data, Density-based visualization",38,38,38,
InfoVis,2012,Graphical Overlays: Using Layered Elements to Aid Chart Reading,10.1109/TVCG.2012.229,http://dx.doi.org/10.1109/TVCG.2012.229,2631,2638,J,"Reading a visualization can involve a number of tasks such as extracting, comparing or aggregating numerical values. Yet, most of the charts that are published in newspapers, reports, books, and on the Web only support a subset of these tasks. In this paper we introduce graphical overlays-visual elements that are layered onto charts to facilitate a larger set of chart reading tasks. These overlays directly support the lower-level perceptual and cognitive processes that viewers must perform to read a chart. We identify five main types of overlays that support these processes; the overlays can provide (1) reference structures such as gridlines, (2) highlights such as outlines around important marks, (3) redundant encodings such as numerical data labels, (4) summary statistics such as the mean or max and (5) annotations such as descriptive text for context. We then present an automated system that applies user-chosen graphical overlays to existing chart bitmaps. Our approach is based on the insight that generating most of these graphical overlays only requires knowing the properties of the visual marks and axes that encode the data, but does not require access to the underlying data values. Thus, our system analyzes the chart bitmap to extract only the properties necessary to generate the desired overlay. We also discuss techniques for generating interactive overlays that provide additional controls to viewers. We demonstrate several examples of each overlay type for bar, pie and line charts.",Nicholas Kong;Maneesh Agrawala,Nicholas Kong;Maneesh Agrawala,"University of California, Berkeley;University of California, Berkeley",10.1109/TVCG.2011.242;10.1109/VISUAL.1991.175820;10.1109/TVCG.2009.122;10.1109/TVCG.2011.183,"Visualization, overlays, graphical perception, graph comprehension",38,24,38,
InfoVis,2013,Radial Sets: Interactive Visual Analysis of Large Overlapping Sets,10.1109/TVCG.2013.184,http://dx.doi.org/10.1109/TVCG.2013.184,2496,2505,J,"In many applications, data tables contain multi-valued attributes that often store the memberships of the table entities to multiple sets such as which languages a person masters, which skills an applicant documents, or which features a product comes with. With a growing number of entities, the resulting element-set membership matrix becomes very rich of information about how these sets overlap. Many analysis tasks targeted at set-typed data are concerned with these overlaps as salient features of such data. This paper presents Radial Sets, a novel visual technique to analyze set memberships for a large number of elements. Our technique uses frequency-based representations to enable quickly finding and analyzing different kinds of overlaps between the sets, and relating these overlaps to other attributes of the table entities. Furthermore, it enables various interactions to select elements of interest, find out if they are over-represented in specific sets or overlaps, and if they exhibit a different distribution for a specific attribute compared to the rest of the elements. These interactions allow formulating highly-expressive visual queries on the elements in terms of their set memberships and attribute values. As we demonstrate via two usage scenarios, Radial Sets enable revealing and analyzing a multitude of overlapping patterns between large sets, beyond the limits of state-of-the-art techniques.",Bilal Alsallakh;Wolfgang Aigner;Silvia Miksch;Helwig Hauser,Bilal Alsallakh;Wolfgang Aigner;Silvia Miksch;Helwig Hauser,Vienna University of Technology;Vienna University of Technology;Vienna University of Technology;University of Bergen,10.1109/TVCG.2006.160;10.1109/TVCG.2009.122;10.1109/TVCG.2008.144;10.1109/TVCG.2011.186;10.1109/INFVIS.2004.1;10.1109/TVCG.2010.210;10.1109/TVCG.2012.254;10.1109/INFVIS.2002.1173157,"Multi-valued attributes, set-typed data, overlapping sets, visualization technique, scalability",38,32,50,
VAST,2014,Feature-Driven Visual Analytics of Soccer Data,10.1109/VAST.2014.7042477,http://dx.doi.org/10.1109/VAST.2014.7042477,13,22,C,"Soccer is one the most popular sports today and also very interesting from an scientific point of view. We present a system for analyzing high-frequency position-based soccer data at various levels of detail, allowing to interactively explore and analyze for movement features and game events. Our Visual Analytics method covers single-player, multi-player and event-based analytical views. Depending on the task the most promising features are semi-automatically selected, processed, and visualized. Our aim is to help soccer analysts in finding the most important and interesting events in a match. We present a flexible, modular, and expandable layer-based system allowing in-depth analysis. The integration of Visual Analytics techniques into the analysis process enables the analyst to find interesting events based on classification and allows, by a set of custom views, to communicate the found results. The feedback loop in the Visual Analytics pipeline helps to further improve the classification results. We evaluate our approach by investigating real-world soccer matches and collecting additional expert feedback. Several use cases and findings illustrate the capabilities of our approach.",Halldór Janetzko;Dominik Sacha;Manuel Stein;Tobias Schreck;Daniel A. Keim;Oliver Deussen,Halld'or Janetzko;Dominik Sacha;Manuel Stein;Tobias Schreck;Daniel A. Keim;Oliver Deussen,University of Konstanz;University of Konstanz;University of Konstanz;University of Konstanz;University of Konstanz;University of Konstanz,10.1109/TVCG.2012.263;10.1109/VAST.2008.4677350;10.1109/TVCG.2007.70621;10.1109/TVCG.2013.228;10.1109/TVCG.2013.193;10.1109/TVCG.2013.207;10.1109/TVCG.2013.186,"Visual Analytics, Sport Analytics, Soccer Analysis",38,27,43,
InfoVis,2015,"Visualization, Selection, and Analysis of Traffic Flows",10.1109/TVCG.2015.2467112,http://dx.doi.org/10.1109/TVCG.2015.2467112,379,388,J,"Visualization of the trajectories of moving objects leads to dense and cluttered images, which hinders exploration and understanding. It also hinders adding additional visual information, such as direction, and makes it difficult to interactively extract traffic flows, i.e., subsets of trajectories. In this paper we present our approach to visualize traffic flows and provide interaction tools to support their exploration. We show an overview of the traffic using a density map. The directions of traffic flows are visualized using a particle system on top of the density map. The user can extract traffic flows using a novel selection widget that allows for the intuitive selection of an area, and filtering on a range of directions and any additional attributes. Using simple, visual set expressions, the user can construct more complicated selections. The dynamic behaviors of selected flows may then be shown in annotation windows in which they can be interactively explored and compared. We validate our approach through use cases where we explore and analyze the temporal behavior of aircraft and vessel trajectories, e.g., landing and takeoff sequences, or the evolution of flight route density. The aircraft use cases have been developed and validated in collaboration with domain experts.",Roeland Scheepens;Christophe Hurter;Huub van de Wetering;Jarke J. van Wijk,Roeland Scheepens;Christophe Hurter;Huub Van De Wetering;Jarke J. Van Wijk,"Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands;Interactive Computing Laboratory (LII) of the French Civil Aviation University (ENAC) in Toulouse, France;Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands",10.1109/TVCG.2011.185;10.1109/TVCG.2011.261;10.1109/VISUAL.1999.809905;10.1109/VISUAL.1998.745294,"Moving Object Visualization, traffic flows, interaction",38,32,36,
VAST,2015,CiteRivers: Visual Analytics of Citation Patterns,10.1109/TVCG.2015.2467621,http://dx.doi.org/10.1109/TVCG.2015.2467621,190,199,J,"The exploration and analysis of scientific literature collections is an important task for effective knowledge management. Past interest in such document sets has spurred the development of numerous visualization approaches for their interactive analysis. They either focus on the textual content of publications, or on document metadata including authors and citations. Previously presented approaches for citation analysis aim primarily at the visualization of the structure of citation networks and their exploration. We extend the state-of-the-art by presenting an approach for the interactive visual analysis of the contents of scientific documents, and combine it with a new and flexible technique to analyze their citations. This technique facilitates user-steered aggregation of citations which are linked to the content of the citing publications using a highly interactive visualization approach. Through enriching the approach with additional interactive views of other important aspects of the data, we support the exploration of the dataset over time and enable users to analyze citation patterns, spot trends, and track long-term developments. We demonstrate the strengths of our approach through a use case and discuss it based on expert user feedback.",Florian Heimerl;Qi Han 0006;Steffen Koch;Thomas Ertl,Florian Heimerl;Qi Han;Steffen Koch;Thomas Ertl,Institute for Visualization and Interactive Systems (VIS);Institute for Visualization and Interactive Systems (VIS);Institute for Visualization and Interactive Systems (VIS);Institute for Visualization and Interactive Systems (VIS),10.1109/INFVIS.2004.77;10.1109/TVCG.2015.2467757;10.1109/TVCG.2008.166;10.1109/TVCG.2013.212;10.1109/VAST.2009.5333443;10.1109/TVCG.2011.239;10.1109/TVCG.2012.252;10.1109/TVCG.2013.162;10.1109/TVCG.2012.277;10.1109/INFVIS.2004.45;10.1109/INFVIS.2005.1532150;10.1109/TVCG.2009.162;10.1109/TVCG.2009.171;10.1109/INFVIS.2005.1532122;10.1109/INFVIS.1995.528686;10.1109/TVCG.2014.2346920;10.1109/TVCG.2009.202,"scientific literature, visual document analysis, visual citation analysis, streamgraph, clustering",38,42,53,
SciVis,2016,OSPRay - A CPU Ray Tracing Framework for Scientific Visualization,10.1109/TVCG.2016.2599041,http://dx.doi.org/10.1109/TVCG.2016.2599041,931,940,J,"Scientific data is continually increasing in complexity, variety and size, making efficient visualization and specifically rendering an ongoing challenge. Traditional rasterization-based visualization approaches encounter performance and quality limitations, particularly in HPC environments without dedicated rendering hardware. In this paper, we present OSPRay, a turn-key CPU ray tracing framework oriented towards production-use scientific visualization which can utilize varying SIMD widths and multiple device backends found across diverse HPC resources. This framework provides a high-quality, efficient CPU-based solution for typical visualization workloads, which has already been integrated into several prevalent visualization packages. We show that this system delivers the performance, high-level API simplicity, and modular device support needed to provide a compelling new rendering framework for implementing efficient scientific visualization workflows.",Ingo Wald;Gregory P. Johnson;Jefferson Amstutz;Carson Brownlee;Aaron Knoll;Jim Jeffers;Johannes Günther 0001;Paul A. Navrátil,I Wald;GP Johnson;J Amstutz;C Brownlee;A Knoll;J Jeffers;J Günther;P Navratil,Intel Corp;Intel Corp;Intel Corp;Intel Corp;SCI InsituteUniversity of Utah;Intel Corp;Intel Corp;Texas Advanced Computing Center,10.1109/SciVis.2015.7429492;10.1109/TVCG.2010.173;10.1109/TVCG.2015.2467963,,38,55,51,
VAST,2016,SemanticTraj: A New Approach to Interacting with Massive Taxi Trajectories,10.1109/TVCG.2016.2598416,http://dx.doi.org/10.1109/TVCG.2016.2598416,11,20,J,"Massive taxi trajectory data is exploited for knowledge discovery in transportation and urban planning. Existing tools typically require users to select and brush geospatial regions on a map when retrieving and exploring taxi trajectories and passenger trips. To answer seemingly simple questions such as “What were the taxi trips starting from Main Street and ending at Wall Street in the morning?” or “Where are the taxis arriving at the Art Museum at noon typically coming from?”, tedious and time consuming interactions are usually needed since the numeric GPS points of trajectories are not directly linked to the keywords such as “Main Street”, “Wall Street”, and “Art Museum”. In this paper, we present SemanticTraj, a new method for managing and visualizing taxi trajectory data in an intuitive, semantic rich, and efficient means. With SemanticTraj, domain and public users can find answers to the aforementioned questions easily through direct queries based on the terms. They can also interactively explore the retrieved data in visualizations enhanced by semantic information of the trajectories and trips. In particular, taxi trajectories are converted into taxi documents through a textualization transformation process. This process maps GPS points into a series of street/POI names and pick-up/drop-off locations. It also converts vehicle speeds into user-defined descriptive terms. Then, a corpus of taxi documents is formed and indexed to enable flexible semantic queries over a text search engine. Semantic labels and meta-summaries of the results are integrated with a set of visualizations in a SemanticTraj prototype, which helps users study taxi trajectories quickly and easily. A set of usage scenarios are presented to show the usability of the system. We also collected feedback from domain experts and conducted a preliminary user study to evaluate the visual system.",Shamal Al-Dohuki;Yingyu Wu;Farah Kamw;Jing Yang;Xin Li;Ye Zhao;Xinyue Ye;Wei Chen 0001;Chao Ma;Fei Wang 0016,Shamal Al-Dohuki;Yingyu Wu;Farah Kamw;Jing Yang;Xin Li;Ye Zhao;Xinyue Ye;Wei Chen;Chao Ma;Fei Wang,Kent State University;Kent State University;Kent State University;UNC Charlotte;China Petroleum University;Kent State University;Kent State University;Zhejiang University;Kent State University;Zhejiang University,10.1109/TVCG.2015.2467732;10.1109/TVCG.2013.226;10.1109/VAST.2014.7042486;10.1109/VAST.2011.6102455;10.1109/TVCG.2014.2346746;10.1109/TVCG.2013.228;10.1109/VAST.2010.5652885,Taxi Trajectories;Taxi Document;Textualization;Name Query;Semantic Interaction;Text Search Engine,38,51,44,
InfoVis,2017,The Hologram in My Hand: How Effective is Interactive Exploration of 3D Visualizations in Immersive Tangible Augmented Reality?,10.1109/TVCG.2017.2745941,http://dx.doi.org/10.1109/TVCG.2017.2745941,457,467,J,"We report on a controlled user study comparing three visualization environments for common 3D exploration. Our environments differ in how they exploit natural human perception and interaction capabilities. We compare an augmented-reality head-mounted display (Microsoft HoloLens), a handheld tablet, and a desktop setup. The novel head-mounted HoloLens display projects stereoscopic images of virtual content into a user's real world and allows for interaction in-situ at the spatial position of the 3D hologram. The tablet is able to interact with 3D content through touch, spatial positioning, and tangible markers, however, 3D content is still presented on a 2D surface. Our hypothesis is that visualization environments that match human perceptual and interaction capabilities better to the task at hand improve understanding of 3D visualizations. To better understand the space of display and interaction modalities in visualization environments, we first propose a classification based on three dimensions: perception, interaction, and the spatial and cognitive proximity of the two. Each technique in our study is located at a different position along these three dimensions. We asked 15 participants to perform four tasks, each task having different levels of difficulty for both spatial perception and degrees of freedom for interaction. Our results show that each of the tested environments is more effective for certain tasks, but that generally the desktop environment is still fastest and most precise in almost all cases.",Benjamin Bach;Ronell Sicat;Johanna Beyer;Maxime Cordeil;Hanspeter Pfister,Benjamin Bach;Ronell Sicat;Johanna Beyer;Maxime Cordeil;Hanspeter Pfister,Harvard University;Harvard University;Harvard University;Monash University;Harvard University,10.1109/TVCG.2011.234;10.1109/TVCG.2012.216;10.1109/TVCG.2016.2599107;10.1109/TVCG.2008.153;10.1109/TVCG.2013.121;10.1109/TVCG.2013.134;10.1109/TVCG.2015.2467202,"Augmented Reality,3D Interaction,User Study,Immersive Displays",38,32,67,
Vis,1990,Methods for surface interrogation,10.1109/VISUAL.1990.146381,http://dx.doi.org/10.1109/VISUAL.1990.146381,187,"193, 472",C,"The authors discuss various visualization techniques that have the goal of identifying unwanted curvature regions interactively on screen. The authors give a critical survey of surface interrogation methods. Several isoline and contouring techniques are presented, and the reflection line method, which simulates the so-called light cage by computer graphics, is presented. The isophote method analyzes surfaces by determining lines of equal light intensity. Silhouettes are special isophotes. A different approach to these problems is the mapping-technique. The mapping methods recognize unwanted curvature regions by detecting singularities of a special mapping of the curve or surface investigated. Curvature plots are a practical means of analyzing free-form surfaces. All these methods are effective, but generally need a lot of computational effort. The free-form surface visualization by ray tracing is discussed.&lt;&lt;ETX&gt;&gt;",Hans Hagen;Thomas Schreiber;Ernst Gschwind,H. Hagen;T. Schreiber;E. Gschwind,"Kaiserslautern Univ., Germany;Kaiserslautern Univ., Germany",,,37,6,8,
Vis,1994,Approximation of isosurface in the Marching Cube: ambiguity problem,10.1109/VISUAL.1994.346307,http://dx.doi.org/10.1109/VISUAL.1994.346307,288,292,C,The purpose of the article is the consideration of the problem of ambiguity over the faces arising in the Marching Cube algorithm. The article shows that for unambiguous choice of the sequence of the points of intersection of the isosurface with edges confining the face it is sufficient to sort them along one of the coordinates. It also presents the solution of this problem inside the cube. Graph theory methods are used to approximate the isosurface inside the cell.&lt;&lt;ETX&gt;&gt;,Sergey V. Matveyev,S.V. Matveyev,"Dept. of Comput. Sci., Inst. for High Energy Phys., Moscow, Russia",10.1109/VISUAL.1991.175782,,37,16,7,
Vis,1997,Two-phase perspective ray casting for interactive volume navigation,10.1109/VISUAL.1997.663878,http://dx.doi.org/10.1109/VISUAL.1997.663878,183,189,C,"Volume navigation is the interactive exploration of volume data sets by ""flying"" the view point through the data, producing a volume rendered view at each frame. The authors present an inexpensive perspective volume navigation method designed to run on a PC platform with accelerated 3D graphics hardware. They compute perspective projections at each frame, allow trilinear interpolation of sample points, and render both gray scale and RGB volumes by volumetric compositing. The implementation handles arbitrarily large volumes, by dynamically swapping data within the local depth-limited frustum into main memory as the viewpoint moves through the volume. They describe a new ray casting algorithm that takes advantage of the coherence inherent in adjacent frames to generate a sequence of approximate animated frames much faster than they could be computed individually. They also take advantage of the 3D graphics acceleration hardware to offload much of the alpha blending and resampling from the CPU.",Martin L. Brady;Kenneth K. Jung;H. T. Nguyen;Thinh P. Q. Nguyen,M. Brady;K. Jung;H.T. Nguyen;T. Nguyen,"Microcomput. Res. Labs., Intel Corp., USA",10.1109/VISUAL.1994.346340;10.1109/VISUAL.1995.485154;10.1109/VISUAL.1996.567603,"Volume navigation, volume rendering, 3D medical imaging, scientific visualization, texture mapping",37,8,18,
Vis,1998,Feature detection in linked derived spaces,10.1109/VISUAL.1998.745289,http://dx.doi.org/10.1109/VISUAL.1998.745289,87,94,C,"This paper describes by example a strategy for plotting and interacting with data in multiple metric spaces. The example system was designed for use with time-varying computational fluid dynamics (CFD) data sets, but the methodology is directly applicable to other types of field data. The central objects embodied by the tool are portraits, which show the data in various coordinate systems, while preserving their spatial connectivity and temporal variability. The coordinates are derived in various ways from the field data, and an important feature is that new and derived portraits can be created interactively. The primary operations supported by the tool are brushing and linking: the user can select a subset of a given portrait, and this subset is highlighted in all portraits. The user can combine highlighted subsets from an arbitrary number of portraits with the usual logical operators, thereby indicating where an arbitrarily complex set of conditions holds. The system is useful for exploratory visualization and feature detection in multivariate data.",Chris Henze,C. Henze,"NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1996.568115;10.1109/VISUAL.1996.568121;10.1109/VISUAL.1994.346327;10.1109/VISUAL.1995.485139;10.1109/VISUAL.1991.175794;10.1109/VISUAL.1994.346302,"computational fluid dynamics, feature detection, flow visualization, multivariate visualization, brushing",37,18,16,
Vis,1999,PLIC: bridging the gap between streamlines and LIC,10.1109/VISUAL.1999.809906,http://dx.doi.org/10.1109/VISUAL.1999.809906,341,541,C,"This paper explores mapping strategies for generating LIC-like images from streamlines and streamline-like images from LIC. The main contribution of this paper is a technique which we call pseudo-LIC or PLIC. By adjusting a small set of key parameters, PLIC can generate flow visualizations that span the spectrum of streamline-like to LIC-like images. Among the advantages of PLIC are: image quality comparable with LIC, performance speedup over LIC, use of a template texture that is independent of the size of the flow field, handles the problem of multiple streamlines occupying the same pixel in image space, reduced aliasing, applicability to time varying data sets, and variable speed animation.",Vivek Verma;David L. Kao;Alex T. Pang,V. Verma;D. Kao;A. Pang,"Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA",10.1109/VISUAL.1996.567784;10.1109/VISUAL.1997.663899;10.1109/VISUAL.1997.663898;10.1109/VISUAL.1994.346313;10.1109/VISUAL.1998.745332;10.1109/VISUAL.1998.745324;10.1109/VISUAL.1996.568116,"unsteady flow, variable speed animation, jitter, texture mapping, comparative visualization",37,19,22,
InfoVis,2000,New methods for the visualization of electric power system information,10.1109/INFVIS.2000.885101,http://dx.doi.org/10.1109/INFVIS.2000.885101,131,16c,C,"One area in need of new research in information visualization is the operation and analysis of large-scale electric power systems. In analyzing power systems, one is usually confronted with a large amount of multivariate data. With systems containing tens of thousands of electrical nodes (buses), a key challenge is to present this data in a form so the user can assess the state of the system in an intuitive and quick manner. This is particularly true when trying to analyze relationships between actual network power flows, the scheduled power flows, and the capacity of the transmission system. With electric industry restructuring and the move towards having a single entity, such as an independent system operator or pool, operate a much larger system, this need has become more acute. This paper presents several power system visualization techniques to help in this task. These techniques include animation of power system flow values, contouring of bus and transmission line flow values, data aggregation techniques and interactive 3D data visualization.",Thomas J. Overbye;Jamie D. Weber,T.J. Overbye;J.D. Weber,"Illinois Univ., Urbana, IL, USA",,,37,31,18,
Vis,2000,A level-set method for flow visualization,10.1109/VISUAL.2000.885688,http://dx.doi.org/10.1109/VISUAL.2000.885688,147,154,C,"We propose a technique for visualizing steady flow. Using this technique, we first convert the vector field data into a scalar level-set representation. We then analyze the dynamic behavior and subsequent distortion of level-sets and interactively monitor the evolving structures by means of texture-based surface rendering. Next, we combine geometrical and topological considerations to derive a multiscale representation and to implement a method for the automatic placement of a sparse set of graphical primitives depicting homogeneous streams in the fields. Using the resulting algorithms, we have built a visualization system that enables us to effectively display the flow direction and its dynamics even for dense 3D fields.",Rüdiger Westermann;Christopher R. Johnson 0001;Thomas Ertl,R. Westermann;C. Johnson;T. Ertl,"Sci. Comput. & Visualization Group, Univ. of Technol., Aachen, Germany",10.1109/VISUAL.1999.809865;10.1109/VISUAL.1999.809892;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1992.235211;10.1109/VISUAL.1997.663912;10.1109/VISUAL.1999.809863;10.1109/VISUAL.1993.398875;10.1109/VISUAL.1993.398875;10.1109/VISUAL.1997.663898;10.1109/VISUAL.1997.663859;10.1109/VISUAL.1994.346312,"Flow Visualization, Level-Sets, Feature Extraction,Multiscale Representation, Texture Mapping",37,17,30,
Vis,2002,Sea of images,10.1109/VISUAL.2002.1183792,http://dx.doi.org/10.1109/VISUAL.2002.1183792,331,338,C,"A long-standing research problem in computer graphics is to reproduce the visual experience of walking through a large photorealistic environment interactively. On one hand, traditional geometry-based rendering systems fall short of simulating the visual realism of a complex environment. On the other hand, image-based rendering systems have to date been unable to capture and store a sampled representation of a large environment with complex lighting and visibility effects. In this paper, we present a ""sea of images,"" a practical approach to dense sampling, storage, and reconstruction of the plenoptic function in large, complex indoor environments. We use a motorized cart to capture omnidirectional images every few inches on a eye-height plane throughout an environment. The captured images are compressed and stored in a multiresolution hierarchy suitable for real-time prefetching during an interactive walkthrough. Later, novel images are reconstructed for a simulated observer by resampling nearby captured images. Our system acquires 15,254 images over 1,050 square feet at an average image spacing of 1.5 inches. The average capture and processing time is 7 hours. We demonstrate realistic walkthroughs of real-world environments reproducing specular reflections and occlusion effects while rendering 15-25 frames per second.",Daniel G. Aliaga;Thomas A. Funkhouser;Dimah Yanovsky;Ingrid Carlbom,D.G. Aliaga;T. Funkhouser;D. Yanovsky;I. Carlbom,"Lucent Technol. Bell Labs, NJ, USA",10.1109/VISUAL.1995.480797,"image-based rendering, capture, reconstruction, interactive, walkthrough",37,14,37,
VAST,2006,Accelerating Network Traffic Analytics Using Query-Driven Visualization,10.1109/VAST.2006.261437,http://dx.doi.org/10.1109/VAST.2006.261437,115,122,C,"Realizing operational analytics solutions where large and complex data must be analyzed in a time-critical fashion entails integrating many different types of technology. This paper focuses on an interdisciplinary combination of scientific data management and visualization/analysis technologies targeted at reducing the time required for data filtering, querying, hypothesis testing and knowledge discovery in the domain of network connection data analysis. We show that use of compressed bitmap indexing can quickly answer queries in an interactive visual data analysis application, and compare its performance with two alternatives for serial and parallel filtering/querying on 2.5 billion records' worth of network connection data collected over a period of 42 weeks. Our approach to visual network connection data exploration centers on two primary factors: interactive ad-hoc and multiresolution query formulation and execution over n dimensions and visual display of the n-dimensional histogram results. This combination is applied in a case study to detect a distributed network scan and to then identify the set of remote hosts participating in the attack. Our approach is sufficiently general to be applied to a diverse set of data understanding problems as well as used in conjunction with a diverse set of analysis and visualization tools",E. Wes Bethel;Scott Campbell;Eli Dart;Kurt Stockinger;Kesheng Wu,E. Wes Bethel;Scott Campbell;Eli Dart;Kurt Stockinger;Kesheng Wu,"Computational Research Division, e-mail: ewbethel@lbl.gov;National Energy Research Scientific Computing Center Division, e-mail: scampbell@lbl.gov;Energy Sciences Network, e-mail: dart@es.net;Computational Research Division, Lawrence Berkeley National Laboratory, University of California, Berkeley, CA 94720. e-mail: kstockinger@lbl.gov;Computational Research Division, Lawrence Berkeley National Laboratory, University of California, Berkeley, CA 94720. e-mail: kwu@lbl.gov",10.1109/VISUAL.1999.809930;10.1109/VISUAL.2005.1532792,"query-driven visualization, network security, data mining, visual analytics",37,20,44,
InfoVis,2007,Spatialization Design: Comparing Points and Landscapes,10.1109/TVCG.2007.70596,http://dx.doi.org/10.1109/TVCG.2007.70596,1262,1269,J,"Spatializations represent non-spatial data using a spatial layout similar to a map. We present an experiment comparing different visual representations of spatialized data, to determine which representations are best for a non-trivial search and point estimation task. Primarily, we compare point-based displays to 2D and 3D information landscapes. We also compare a colour (hue) scale to a grey (lightness) scale. For the task we studied, point-based spatializations were far superior to landscapes, and 2D landscapes were superior to 3D landscapes. Little or no benefit was found for redundantly encoding data using colour or greyscale combined with landscape height. 3D landscapes with no colour scale (height-only) were particularly slow and inaccurate. A colour scale was found to be better than a greyscale for all display types, but a greyscale was helpful compared to height-only. These results suggest that point-based spatializations should be chosen over landscape representations, at least for tasks involving only point data itself rather than derived information about the data space.",Melanie Tory;David W. Sprague;Fuqu Wu;Wing Yan So;Tamara Munzner,Melanie Tory;David Sprague;Fuqu Wu;Wing Yan So;Tamara Munzner,University of Victoria;University of Victoria;University of Victoria;University of Victoria;University of British Columbia,10.1109/INFVIS.2004.60;10.1109/INFVIS.2004.19;10.1109/INFVIS.2002.1173146;10.1109/INFVIS.1995.528686,"Spatialization, Information Landscape, User Study, Numerosity, 3D, 2D, Colour, Greyscale, Surface, Points",37,24,25,
Vis,2007,Visualizing Whole-Brain DTI Tractography with GPU-based Tuboids and LoD Management,10.1109/TVCG.2007.70532,http://dx.doi.org/10.1109/TVCG.2007.70532,1488,1495,J,"Diffusion tensor imaging (DTI) of the human brain, coupled with tractography techniques, enable the extraction of large- collections of three-dimensional tract pathways per subject. These pathways and pathway bundles represent the connectivity between different brain regions and are critical for the understanding of brain related diseases. A flexible and efficient GPU-based rendering technique for DTI tractography data is presented that addresses common performance bottlenecks and image-quality issues, allowing interactive render rates to be achieved on commodity hardware. An occlusion query-based pathway LoD management system for streamlines/streamtubes/tuboids is introduced that optimizes input geometry, vertex processing, and fragment processing loads, and helps reduce overdraw. The tuboid, a fully-shaded streamtube impostor constructed entirely on the GPU from streamline vertices, is also introduced. Unlike full streamtubes and other impostor constructs, tuboids require little to no preprocessing or extra space over the original streamline data. The supported fragment processing levels of detail range from texture-based draft shading to full raycast normal computation, Phong shading, environment mapping, and curvature-correct text labeling. The presented text labeling technique for tuboids provides adaptive, aesthetically pleasing labels that appear attached to the surface of the tubes. Furthermore, an occlusion query aggregating and scheduling scheme for tuboids is described that reduces the query overhead. Results for a tractography dataset are presented, and demonstrate that LoD-managed tuboids offer benefits over traditional streamtubes both in performance and appearance.",Vid Petrovic;James H. Fallon;Falko Kuester,Vid Petrovic;James Fallon;Falko Kuester,"Calit2, University of California, Irvine;University of California, Irvine;Calit2, University of California, San Diego",10.1109/VISUAL.2002.1183799;10.1109/VISUAL.2005.1532859;10.1109/VISUAL.2004.30;10.1109/TVCG.2006.151;10.1109/VISUAL.2003.1250368;10.1109/TVCG.2006.197;10.1109/VISUAL.1996.567777,"Tuboids, stream tubes, interactive gpu-centric rendering, neuronal pathways",37,31,23,
Vis,2007,Registration Techniques for Using Imperfect and Par tially Calibrated Devices in Planar Multi-Projector Displays,10.1109/TVCG.2007.70586,http://dx.doi.org/10.1109/TVCG.2007.70586,1368,1375,J,"Multi-projector displays today are automatically registered, both geometrically and photometrically, using cameras. Existing registration techniques assume pre-calibrated projectors and cameras that are devoid of imperfections such as lens distortion. In practice, however, these devices are usually imperfect and uncalibrated. Registration of each of these devices is often more challenging than the multi-projector display registration itself. To make tiled projection-based displays accessible to a layman user we should allow the use of uncalibrated inexpensive devices that are prone to imperfections. In this paper, we make two important advances in this direction. First, we present a new geometric registration technique that can achieve geometric alignment in the presence of severe projector lens distortion using a relatively inexpensive low-resolution camera. This is achieved via a closed-form model that relates the projectors to cameras, in planar multi-projector displays, using rational Bezier patches. This enables us to geometrically calibrate a 3000 times 2500 resolution planar multi-projector display made of 3 times 3 array of nine severely distorted projectors using a low resolution (640 times 480) VGA camera. Second, we present a photometric self-calibration technique for a projector-camera pair. This allows us to photometrically calibrate the same display made of nine projectors using a photometrically uncalibrated camera. To the best of our knowledge, this is the first work that allows geometrically imperfect projectors and photometrically uncalibrated cameras in calibrating multi-projector displays.",Ezekiel S. Bhasker;Ray Juang;Aditi Majumder,Ezekiel Bhasker;Ray Juang;Aditi Majumder,"University of California, Irvine;University of California, Irvine;University of California, Irvine",10.1109/VISUAL.2001.964508;10.1109/TVCG.2006.121;10.1109/VISUAL.2000.885685;10.1109/VISUAL.2002.1183793;10.1109/VISUAL.2000.885684;10.1109/VISUAL.1999.809883,"Geometric calibration, photometric calibration, tiled displays",37,23,39,
InfoVis,2009,Smooth Graphs for Visual Exploration of Higher-Order State Transitions,10.1109/TVCG.2009.181,http://dx.doi.org/10.1109/TVCG.2009.181,969,976,J,"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 timeseries 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;Robert S. Laramee;Frits H. Post,Jorik Blaas;Charl Botha;Edward Grundy;Mark Jones;Robert Laramee;Frits Post,"Visualization Group, Delft University of Technology, NL;Visualization Group, Delft University of Technology, NL;Visual Computing Group, Swansea University, UK.;Visual Computing Group, Swansea University, UK.;Visual Computing Group, Swansea University, UK.;Visualization Group, Delft University of Technology, NL",10.1109/INFVIS.1995.528685;10.1109/TVCG.2008.155;10.1109/TVCG.2008.135;10.1109/TVCG.2006.192;10.1109/INFVIS.2001.963281;10.1109/INFVIS.2001.963281;10.1109/TVCG.2006.147,"State transitions, Graph drawing, Time series, Biological data",37,25,23,
Vis,2009,Interactive Coordinated Multiple-View Visualization of Biomechanical Motion Data,10.1109/TVCG.2009.152,http://dx.doi.org/10.1109/TVCG.2009.152,1383,1390,J,"We present an interactive framework for exploring space-time and form-function relationships in experimentally collected high-resolution biomechanical data sets. These data describe complex 3D motions (e.g. chewing, walking, flying) performed by animals and humans and captured via high-speed imaging technologies, such as biplane fluoroscopy. In analyzing these 3D biomechanical motions, interactive 3D visualizations are important, in particular, for supporting spatial analysis. However, as researchers in information visualization have pointed out, 2D visualizations can also be effective tools for multi-dimensional data analysis, especially for identifying trends over time. Our approach, therefore, combines techniques from both 3D and 2D visualizations. Specifically, it utilizes a multi-view visualization strategy including a small multiples view of motion sequences, a parallel coordinates view, and detailed 3D inspection views. The resulting framework follows an overview first, zoom and filter, then details-on-demand style of analysis, and it explicitly targets a limitation of current tools, namely, supporting analysis and comparison at the level of a collection of motions rather than sequential analysis of a single or small number of motions. Scientific motion collections appropriate for this style of analysis exist in clinical work in orthopedics and physical rehabilitation, in the study of functional morphology within evolutionary biology, and in other contexts. An application is described based on a collaboration with evolutionary biologists studying the mechanics of chewing motions in pigs. Interactive exploration of data describing a collection of more than one hundred experimentally captured pig chewing cycles is described.",Daniel F. Keefe;Marcus Ewert;William Ribarsky;Remco Chang,Daniel Keefe;Marcus Ewert;William Ribarsky;Remco Chang,University of Minnesota;University of Minnesota;University of North Carolina - Charlotte;University of North Carolina - Charlotte,10.1109/TVCG.2008.125;10.1109/TVCG.2007.70569;10.1109/TVCG.2008.109,"Scientific visualization, information visualization, coordinated multiple views, biomechanics",37,36,22,
Vis,2009,VisMashup: Streamlining the Creation of Custom Visualization Applications,10.1109/TVCG.2009.195,http://dx.doi.org/10.1109/TVCG.2009.195,1539,1546,J,"Visualization is essential for understanding the increasing volumes of digital data. However, the process required to create insightful visualizations is involved and time consuming. Although several visualization tools are available, including tools with sophisticated visual interfaces, they are out of reach for users who have little or no knowledge of visualization techniques and/or who do not have programming expertise. In this paper, we propose VisMashup, a new framework for streamlining the creation of customized visualization applications. Because these applications can be customized for very specific tasks, they can hide much of the complexity in a visualization specification and make it easier for users to explore visualizations by manipulating a small set of parameters. We describe the framework and how it supports the various tasks a designer needs to carry out to develop an application, from mining and exploring a set of visualization specifications (pipelines), to the creation of simplified views of the pipelines, and the automatic generation of the application and its interface. We also describe the implementation of the system and demonstrate its use in two real application scenarios.",Emanuele Santos;Lauro Didier Lins;James P. Ahrens;Juliana Freire;Cláudio T. Silva,Emanuele Santos;Lauro Lins;James Ahrens;Juliana Freire;Claudio Silva,University of Utah;University of Utah;Los Alamos National Lab;University of Utah;University of Utah,10.1109/TVCG.2007.70584;10.1109/VISUAL.2005.1532795;10.1109/TVCG.2007.70577,"Scientific Visualization, Dataflow, Visualization Systems",37,29,37,
InfoVis,2011,Exploring Uncertainty in Geodemographics with Interactive Graphics,10.1109/TVCG.2011.197,http://dx.doi.org/10.1109/TVCG.2011.197,2545,2554,J,"Geodemographic classifiers characterise populations by categorising geographical areas according to the demographic and lifestyle characteristics of those who live within them. The dimension-reducing quality of such classifiers provides a simple and effective means of characterising population through a manageable set of categories, but inevitably hides heterogeneity, which varies within and between the demographic categories and geographical areas, sometimes systematically. This may have implications for their use, which is widespread in government and commerce for planning, marketing and related activities. We use novel interactive graphics to delve into OAC - a free and open geodemographic classifier that classifies the UK population in over 200,000 small geographical areas into 7 super-groups, 21 groups and 52 sub-groups. Our graphics provide access to the original 41 demographic variables used in the classification and the uncertainty associated with the classification of each geographical area on-demand. It also supports comparison geographically and by category. This serves the dual purpose of helping understand the classifier itself leading to its more informed use and providing a more comprehensive view of population in a comprehensible manner. We assess the impact of these interactive graphics on experienced OAC users who explored the details of the classification, its uncertainty and the nature of between - and within - class variation and then reflect on their experiences. Visualization of the complexities and subtleties of the classification proved to be a thought-provoking exercise both confirming and challenging users' understanding of population, the OAC classifier and the way it is used in their organisations. Users identified three contexts for which the techniques were deemed useful in the context of local government, confirming the validity of the proposed methods.",Aidan Slingsby;Jason Dykes;Jo Wood,Aidan Slingsby;Jason Dykes;Jo Wood,"giCentre, City University London;giCentre, City University London;giCentre, City University London",10.1109/INFVIS.1996.559216;10.1109/TVCG.2010.191;10.1109/TVCG.2007.70574;10.1109/TVCG.2010.186;10.1109/VISUAL.1999.809866;10.1109/TVCG.2008.165;10.1109/TVCG.2006.202;10.1109/TVCG.2007.70515;10.1109/INFVIS.2004.12,"Geodemographics, OAC, classification, cartography, uncertainty",37,35,58,
Vis,2011,Adaptive Extraction and Quantification of Geophysical Vortices,10.1109/TVCG.2011.162,http://dx.doi.org/10.1109/TVCG.2011.162,2088,2095,J,"We consider the problem of extracting discrete two-dimensional vortices from a turbulent flow. In our approach we use a reference model describing the expected physics and geometry of an idealized vortex. The model allows us to derive a novel correlation between the size of the vortex and its strength, measured as the square of its strain minus the square of its vorticity. For vortex detection in real models we use the strength parameter to locate potential vortex cores, then measure the similarity of our ideal analytical vortex and the real vortex core for different strength thresholds. This approach provides a metric for how well a vortex core is modeled by an ideal vortex. Moreover, this provides insight into the problem of choosing the thresholds that identify a vortex. By selecting a target coefficient of determination (i.e., statistical confidence), we determine on a per-vortex basis what threshold of the strength parameter would be required to extract that vortex at the chosen confidence. We validate our approach on real data from a global ocean simulation and derive from it a map of expected vortex strengths over the global ocean.",Sean Williams;Mark R. Petersen;Peer-Timo Bremer;Matthew Hecht;Valerio Pascucci;James P. Ahrens;Mario Hlawitschka;Bernd Hamann,Sean Williams;Mark Petersen;Peer-Timo Bremer;Matthew Hecht;Valerio Pascucci;James Ahrens;Mario Hlawitschka;Bernd Hamann,"Computer, Computational and Statistical Sciences Division, Los Alamos National Laboratory;Lawrence-Livermore National Laboratory;Computer, Computational and Statistical Sciences Division, Los Alamos National Laboratory;Scientific Computing and Imaging Institute, University of Utah;Computer, Computational and Statistical Sciences Division, Los Alamos National Laboratory;Institute for Data Analysis and Visualization (IDAV) and Department of Computer Science, University of California, Davis;Institute for Data Analysis and Visualization (IDAV) and Department of Computer Science, University of California, Davis",10.1109/VISUAL.1994.346327;10.1109/TVCG.2008.143;10.1109/VISUAL.1993.398877,"Vortex extraction, feature extraction, statistical data analysis",37,45,19,
Vis,2011,Flow Radar Glyphs—Static Visualization of Unsteady Flow with Uncertainty,10.1109/TVCG.2011.203,http://dx.doi.org/10.1109/TVCG.2011.203,1949,1958,J,"A new type of glyph is introduced to visualize unsteady flow with static images, allowing easier analysis of time-dependent phenomena compared to animated visualization. Adopting the visual metaphor of radar displays, this glyph represents flow directions by angles and time by radius in spherical coordinates. Dense seeding of flow radar glyphs on the flow domain naturally lends itself to multi-scale visualization: zoomed-out views show aggregated overviews, zooming-in enables detailed analysis of spatial and temporal characteristics. Uncertainty visualization is supported by extending the glyph to display possible ranges of flow directions. The paper focuses on 2D flow, but includes a discussion of 3D flow as well. Examples from CFD and the field of stochastic hydrogeology show that it is easy to discriminate regions of different spatiotemporal flow behavior and regions of different uncertainty variations in space and time. The examples also demonstrate that parameter studies can be analyzed because the glyph design facilitates comparative visualization. Finally, different variants of interactive GPU-accelerated implementations are discussed.",Marcel Hlawatsch;Philipp C. Leube;Wolfgang Nowak;Daniel Weiskopf,Marcel Hlawatsch;Philipp Leube;Wolfgang Nowak;Daniel Weiskopf,"Visualization Research Center, University of Stuttgart;Institute of Hydraulic Engineering (LH2), University of Stuttgart;Institute of Hydraulic Engineering (LH2), University of Stuttgart;Visualization Research Center, University of Stuttgart",10.1109/VISUAL.2005.1532853;10.1109/VISUAL.1993.398849;10.1109/INFVIS.2001.963273;10.1109/VISUAL.2003.1250402;10.1109/VISUAL.1996.568139;10.1109/VISUAL.2005.1532857;10.1109/VISUAL.1991.175792;10.1109/VISUAL.1995.480819;10.1109/VISUAL.1996.568116;10.1109/TVCG.2009.182,"Visualization, glyph, uncertainty, unsteady flow",37,37,35,
InfoVis,2012,The DeepTree Exhibit: Visualizing the Tree of Life to Facilitate Informal Learning,10.1109/TVCG.2012.272,http://dx.doi.org/10.1109/TVCG.2012.272,2789,2798,J,"In this paper, we present the DeepTree exhibit, a multi-user, multi-touch interactive visualization of the Tree of Life. We developed DeepTree to facilitate collaborative learning of evolutionary concepts. We will describe an iterative process in which a team of computer scientists, learning scientists, biologists, and museum curators worked together throughout design, development, and evaluation. We present the importance of designing the interactions and the visualization hand-in-hand in order to facilitate active learning. The outcome of this process is a fractal-based tree layout that reduces visual complexity while being able to capture all life on earth; a custom rendering and navigation engine that prioritizes visual appeal and smooth fly-through; and a multi-user interface that encourages collaborative exploration while offering guided discovery. We present an evaluation showing that the large dataset encouraged free exploration, triggers emotional responses, and facilitates visitor engagement and informal learning.",Florian Block;Michael S. Horn;Brenda Caldwell Phillips;Judy Diamond;E. Margaret Evans;Chia Shen,Florian Block;Michael S. Horn;Brenda Caldwell Phillips;Judy Diamond;E. Margaret Evans;Chia Shen,Harvard University;Northwestern University;Harvard University;University of Nebraska State Museum;University of Michigan;Harvard University,10.1109/INFVIS.2001.963285;10.1109/INFVIS.1997.636718;10.1109/TVCG.2009.111;10.1109/TVCG.2007.70539;10.1109/INFVIS.2002.1173153;10.1109/TVCG.2008.127;10.1109/INFVIS.2002.1173148;10.1109/TVCG.2007.70541,"Informal science education, collaborative learning, large tree visualizations, multi-touch interaction",37,30,55,
VAST,2012,Visual analytics methods for categoric spatio-temporal data,10.1109/VAST.2012.6400553,http://dx.doi.org/10.1109/VAST.2012.6400553,183,192,C,"We focus on visual analysis of space- and time-referenced categorical data, which describe possible states of spatial (geographical) objects or locations and their changes over time. The analysis of these data is difficult as there are only limited possibilities to analyze the three aspects (location, time and category) simultaneously. We present a new approach which interactively combines (a) visualization of categorical changes over time; (b) various spatial data displays; (c) computational techniques for task-oriented selection of time steps. They provide an expressive visualization with regard to either the overall evolution over time or unusual changes. We apply our approach on two use cases demonstrating its usefulness for a wide variety of tasks. We analyze data from movement tracking and meteorologic areas. Using our approach, expected events could be detected and new insights were gained.",Tatiana von Landesberger;Sebastian Bremm;Natalia V. Andrienko;Gennady L. Andrienko;Maria Tekusova,T. von Landesberger;Sebastian Bremm;Natalia Andrienko;Gennady Andrienko;Mária Tekušová,"TU Darmstadt Darmstadt, Germany;TU Darmstadt Darmstadt, Germany;Fraunhofer IAIS Bonn, Germany;Fraunhofer IAIS Bonn, Germany;SHMU Bratislava, Slovakia",10.1109/TVCG.2011.174;10.1109/TVCG.2009.117;10.1109/TVCG.2009.181;10.1109/INFVIS.2000.885098;10.1109/TVCG.2010.138;10.1109/VAST.2010.5652530;10.1109/INFVIS.2004.27;10.1109/INFVIS.2005.1532152;10.1109/INFVIS.2001.963281;10.1109/TVCG.2008.165;10.1109/TVCG.2009.153,,37,26,43,
VAST,2012,"Analyst's Workspace: An embodied sensemaking environment for large, high-resolution displays",10.1109/VAST.2012.6400559,http://dx.doi.org/10.1109/VAST.2012.6400559,123,131,C,"Distributed cognition and embodiment provide compelling models for how humans think and interact with the environment. Our examination of the use of large, high-resolution displays from an embodied perspective has lead directly to the development of a new sensemaking environment called Analyst's Workspace (AW). AW leverages the embodied resources made more accessible through the physical nature of the display to create a spatial workspace. By combining spatial layout of documents and other artifacts with an entity-centric, explorative investigative approach, AW aims to allow the analyst to externalize elements of the sensemaking process as a part of the investigation, integrated into the visual representations of the data itself. In this paper, we describe the various capabilities of AW and discuss the key principles and concepts underlying its design, emphasizing unique design principles for designing visual analytic tools for large, high-resolution displays.",Christopher Andrews;Chris North 0001,Christopher Andrews;Chris North,Virginia Tech;Virginia Tech,10.1109/TVCG.2008.121;10.1109/VAST.2008.4677362;10.1109/INFVIS.2004.27;10.1109/VAST.2008.4677358;10.1109/TVCG.2006.184;10.1109/VAST.2007.4388992;10.1109/VAST.2010.5652880;10.1109/VAST.2011.6102449;10.1109/VAST.2007.4389006;10.1109/VAST.2011.6102438;10.1109/VAST.2009.5333878,"Embodiment, distributed cognition, large and high-resolution display, sensemaking, space",37,31,52,
VAST,2013,Space Transformation for Understanding Group Movement,10.1109/TVCG.2013.193,http://dx.doi.org/10.1109/TVCG.2013.193,2169,2178,J,"We suggest a methodology for analyzing movement behaviors of individuals moving in a group. Group movement is analyzed at two levels of granularity: the group as a whole and the individuals it comprises. For analyzing the relative positions and movements of the individuals with respect to the rest of the group, we apply space transformation, in which the trajectories of the individuals are converted from geographical space to an abstract 'group space'. The group space reference system is defined by both the position of the group center, which is taken as the coordinate origin, and the direction of the group's movement. Based on the individuals' positions mapped onto the group space, we can compare the behaviors of different individuals, determine their roles and/or ranks within the groups, and, possibly, understand how group movement is organized. The utility of the methodology has been evaluated by applying it to a set of real data concerning movements of wild social animals and discussing the results with experts in animal ethology.",Natalia V. Andrienko;Gennady L. Andrienko;Louise Barrett;Marcus Dostie;S. Peter Henzi,Natalia Andrienko;Gennady Andrienko;Louise Barrett;Marcus Dostie;Peter Henzi,Fraunhofer Institute IAIS;Fraunhofer Institute IAIS;University of Lethbridge and University of South Africa;University of Lethbridge and University of South Africa;University of Lethbridge and University of South Africa,10.1109/INFVIS.2005.1532142;10.1109/INFVIS.2004.27,"Visual analytics, movement data, collective movement",37,36,37,
VAST,2016,Characterizing Guidance in Visual Analytics,10.1109/TVCG.2016.2598468,http://dx.doi.org/10.1109/TVCG.2016.2598468,111,120,J,"Visual analytics (VA) is typically applied in scenarios where complex data has to be analyzed. Unfortunately, there is a natural correlation between the complexity of the data and the complexity of the tools to study them. An adverse effect of complicated tools is that analytical goals are more difficult to reach. Therefore, it makes sense to consider methods that guide or assist users in the visual analysis process. Several such methods already exist in the literature, yet we are lacking a general model that facilitates in-depth reasoning about guidance. We establish such a model by extending van Wijk's model of visualization with the fundamental components of guidance. Guidance is defined as a process that gradually narrows the gap that hinders effective continuation of the data analysis. We describe diverse inputs based on which guidance can be generated and discuss different degrees of guidance and means to incorporate guidance into VA tools. We use existing guidance approaches from the literature to illustrate the various aspects of our model. As a conclusion, we identify research challenges and suggest directions for future studies. With our work we take a necessary step to pave the way to a systematic development of guidance techniques that effectively support users in the context of VA.",Davide Ceneda;Theresia Gschwandtner;Thorsten May;Silvia Miksch;Hans-Jörg Schulz;Marc Streit;Christian Tominski,Davide Ceneda;Theresia Gschwandtner;Thorsten May;Silvia Miksch;Hans-Jörg Schulz;Marc Streit;Christian Tominski,"Vienna University of Technology, Austria;Vienna University of Technology, Austria;Fraunhofer IGD, Darmstadt, Germany;Vienna University of Technology, Austria;University of Rostock, Germany;Johannes Kepler University, Linz, Austria;University of Rostock, Germany",10.1109/VISUAL.2000.885678;10.1109/TVCG.2015.2467191;10.1109/VISUAL.1990.146375;10.1109/TVCG.2014.2346260;10.1109/TVCG.2014.2346481;10.1109/INFVIS.2004.2;10.1109/TVCG.2013.120;10.1109/VISUAL.1997.663889;10.1109/TVCG.2015.2467691;10.1109/VISUAL.2002.1183803;10.1109/TVCG.2007.70589;10.1109/TVCG.2008.174;10.1109/TVCG.2014.2346482,Visual analytics;guidance model;assistance;user support,37,55,55,
Vis,1990,Classifying visual knowledge representations: a foundation for visualization research,10.1109/VISUAL.1990.146374,http://dx.doi.org/10.1109/VISUAL.1990.146374,131,138,C,"An exploratory effort to classify visual representations into homogeneous clusters is discussed. The authors collected hierarchical sorting data from twelve subjects. Five principal groups of visual representations emerged from a cluster analysis of sorting data: graphs and tables, maps, diagrams, networks, and icons. Two dimensions appear to distinguish these clusters: the amount of spatial information and cognitive processing effort. The authors discuss visual information processing issues relevant to the research, methodology and data analyses used to develop the classification system, results of the empirical study, and possible directions for future research.&lt;&lt;ETX&gt;&gt;",Gerald L. Lohse;Henry H. Rueter;Kevin Biolsi;Neff Walker,J. Lohse;H. Rueter;K. Biolsi;N. Walker,"Cognitive Sci. & Machine Intelligence Lab., Michigan Univ., Ann Arbor, MI, USA;Cognitive Sci. & Machine Intelligence Lab., Michigan Univ., Ann Arbor, MI, USA;Cognitive Sci. & Machine Intelligence Lab., Michigan Univ., Ann Arbor, MI, USA;Cognitive Sci. & Machine Intelligence Lab., Michigan Univ., Ann Arbor, MI, USA",,,36,15,32,
Vis,1990,Automatic illustration of 3D geometric models: surfaces,10.1109/VISUAL.1990.146395,http://dx.doi.org/10.1109/VISUAL.1990.146395,307,"314, 485-6",C,"The authors present techniques for automating the illustration of geometric models based on traditional hand illustration methods. A system based on the techniques of traditional illustrators for automatically generating illustrations of complex three-dimensional models is described. The system relies on a richer set of display primitives, which are also outlined. Algorithmic details for emphasizing significant model components are discussed, and some preliminary results are presented.&lt;&lt;ETX&gt;&gt;",Debra Dooley;Michael F. Cohen,D. Dooley;M.F. Cohen,"Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA;Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA",,,36,9,14,
Vis,1992,Rendering surface-particles,10.1109/VISUAL.1992.235226,http://dx.doi.org/10.1109/VISUAL.1992.235226,54,61,C,"Surface-particles are very small facets, modeled as points with a normal. They can be used to visualize flow in several ways by variation of the properties of the particle sources. A method is presented for the rendering of surface-particles. This method includes an improved shading model, the use of Gaussian filters for the prevention of spatial and temporal artifacts, an efficient scan-conversion algorithm, the handling of occlusion and the simultaneous rendering of geometric objects and surface-particles. The synthesis of images with limited depth of field is described, which literally allows the scientist to focus on areas of interest.&lt;&lt;ETX&gt;&gt;",Jarke J. van Wijk,J.J. van Wijk,"Netherlands Energy Res. Found. ECN, Petten, Netherlands",10.1109/VISUAL.1990.146359,,36,20,23,
Vis,1995,Automatic generation of triangular irregular networks using greedy cuts,10.1109/VISUAL.1995.480813,http://dx.doi.org/10.1109/VISUAL.1995.480813,201,"208, 453",C,"Proposes a new approach to the automatic generation of triangular irregular networks (TINs) from dense terrain models. We have developed and implemented an algorithm based on the greedy principle used to compute minimum-link paths in polygons. Our algorithm works by taking greedy cuts (""bites"") out of a simple closed polygon that bounds the yet-to-be triangulated region. The algorithm starts with a large polygon, bounding the whole extent of the terrain to be triangulated, and works its way inward, performing at each step one of three basic operations: ear cutting, greedy biting, and edge splitting. We give experimental evidence that our method is competitive with current algorithms and has the potential to be faster and to generate many fewer triangles. Also, it is able to keep the structural terrain fidelity at almost no extra cost in running time and it requires very little memory beyond that for the input height array.",Cláudio T. Silva;Joseph S. B. Mitchell;Arie E. Kaufman,C.T. Silva;J.S.B. Mitchell;A.E. Kaufman,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1992.235191;10.1109/VISUAL.1990.146379,,36,8,25,
Vis,1997,Visualization of higher order singularities in vector fields,10.1109/VISUAL.1997.663858,http://dx.doi.org/10.1109/VISUAL.1997.663858,67,74,C,"Presents an algorithm for the visualization of vector field topology based on Clifford algebra. It allows the detection of higher-order singularities. This is accomplished by first analysing the possible critical points and then choosing a suitable polynomial approximation, because conventional methods based on piecewise linear or bilinear approximation do not allow higher-order critical points and destroy the topology in such cases. The algorithm is still very fast, because of using linear approximation outside the areas with several critical points.",Gerik Scheuermann;Hans Hagen;Heinz Krüger;Martin Menzel;Alyn P. Rockwood,G. Scheuermann;H. Hagen;H. Kruger;M. Menzel;A. Rockwood,"Dept. of Comput. Sci., Kaiserslautern Univ., Germany",,,36,19,7,
Vis,1997,Multivariate visualization using metric scaling,10.1109/VISUAL.1997.663866,http://dx.doi.org/10.1109/VISUAL.1997.663866,111,118,C,"The authors present an efficient visualization approach to support multivariate data exploration through a simple but effective low dimensional data overview based on metric scaling. A multivariate dataset is first transformed into a set of dissimilarities between all pairs of data records. A graph configuration algorithm based on principal components is then wed to determine the display coordinates of the data records in the low dimensional data overview. This overview provides a graphical summary of the multivariate data with reduced data dimensions, reduced data size, and additional data semantics. It can be used to enhance multidimensional data brushing, or to arrange the layout of other conventional multivariate visualization techniques. Real life data is used to demonstrate the approach.",Pak Chung Wong;R. Daniel Bergeron,Pak Chung Wong;R.D. Bergeron,"Dept. of Comput. Sci., New Hampshire Univ., Durham, NH, USA",10.1109/VISUAL.1995.480811;10.1109/VISUAL.1995.485139;10.1109/VISUAL.1994.346302;10.1109/VISUAL.1996.567800;10.1109/VISUAL.1993.398864;10.1109/VISUAL.1990.146387,,36,12,20,
Vis,1997,The motion map: efficient computation of steady flow animations,10.1109/VISUAL.1997.663899,http://dx.doi.org/10.1109/VISUAL.1997.663899,323,328,C,"The paper presents a new approach for animating 2D steady flow fields. It is based on an original data structure called the motion map. The motion map contains not only a dense representation of the flow field but also all the motion information required to animate the flow. An important feature of this method is that it allows, in a natural way, cyclical variable-speed animations. As far as efficiency is concerned, the advantage of this method is that computing the motion map does not take more time than computing a single still image of the flow and the motion map has to be computed only once. Another advantage is that the memory requirements for a cyclical animation of an arbitrary number of frames amounts to the memory cost of a single still image.",Bruno Jobard;Wilfrid Lefer,B. Jobard;W. Lefer,"Lab., Calais, France",10.1109/VISUAL.1994.346313,,36,13,12,
Vis,1998,Interactive display of very large textures,10.1109/VISUAL.1998.745322,http://dx.doi.org/10.1109/VISUAL.1998.745322,343,350,C,"Large textures cause bottlenecks in real time applications that often lead to a loss of interactivity. These performance bottlenecks occur because of disk and network transfer, texture translation, and memory swapping. We present a software solution that alleviates the problems associated with large textures by treating texture as a bandwidth limited resource rather than a finite resource. As a result the display of large textures is reduced to a caching problem in which texture memory serves as the primary cache for texture data, main memory the secondary cache, and local disk the tertiary cache. By using this cache hierarchy, applications are able to maintain real time performance while displaying textures hundreds of times larger than can fit into texture memory.",David Cline;Parris K. Egbert,D. Cline;P.K. Egbert,"Dept. of Comput. Sci., Brigham Young Univ., Provo, UT, USA",,"texture caching, bandwidth-limited resource, texture mapping, real-time display, interactivity",36,17,22,
InfoVis,1999,Sensemaking of evolving Web sites using visualization spreadsheets,10.1109/INFVIS.1999.801853,http://dx.doi.org/10.1109/INFVIS.1999.801853,18,"25, 142",C,"In the process of knowledge discovery, workers examine available information in order to make sense of it. By sensemaking, we mean interacting with and operating on the information with a variety of information processing mechanisms. Previously, we introduced a concept that uses the spreadsheet metaphor with cells containing visualizations of complex data. We extend and apply a cognitive model called ""visual sensemaking"" to the visualization spreadsheet. We use the task of making sense of a large Web site as a concrete example throughout the paper for demonstration. Using a variety of visualization techniques, such as the Disk Tree and Cone Tree, we show that the interactions of the visualization spreadsheet help users draw conclusions from the overall relationships of the entire information set.",Ed H. Chi;Stuart K. Card,E.H. Chi;S.K. Card,"Xerox Palo Alto Res. Center, CA, USA",10.1109/INFVIS.1995.528691;10.1109/INFVIS.1995.528689;10.1109/INFVIS.1995.528686;10.1109/INFVIS.1998.729560;10.1109/VISUAL.1993.398870;10.1109/INFVIS.1995.528692,"Information visualization, Spreadsheet, Sensemaking, World Wide Web, Information ecologies, Log file analysis",36,14,19,
Vis,1999,Efficient compression of non-manifold polygonal meshes,10.1109/VISUAL.1999.809870,http://dx.doi.org/10.1109/VISUAL.1999.809870,73,512,C,"We present a method for compressing non-manifold polygonal meshes, i.e. polygonal meshes with singularities, which occur very frequently in the real-world. Most efficient polygonal compression methods currently available are restricted to a manifold mesh: they require a conversion process, and fail to retrieve the original model connectivity after decompression. The present method works by converting the original model to a manifold model, encoding the manifold model using an existing mesh compression technique, and clustering, or stitching together during the decompression process vertices that were duplicated earlier to faithfully recover the original connectivity. This paper focuses on efficiently encoding and decoding the stitching information. By separating connectivity from geometry and properties, the method avoids encoding vertices (and properties bound to vertices) multiple times; thus a reduction of the size of the bit-stream of about 10% is obtained compared with encoding the model as a manifold.",André Guéziec;Frank Bossen;Gabriel Taubin;Cláudio T. Silva,A. Gueziec;F. Bossen;G. Taubin;C. Silva,"Multigen Paradigm, San Jose, CA, USA",10.1109/VISUAL.1997.663902;10.1109/VISUAL.1998.745327,"Polygonal Mesh, Geometry Compression, Non-Manifold, Stitching",36,14,16,
Vis,1999,High performance presence-accelerated ray casting,10.1109/VISUAL.1999.809911,http://dx.doi.org/10.1109/VISUAL.1999.809911,379,546,C,"We present a novel presence acceleration for volumetric ray casting. A highly accurate estimation for object presence is obtained by projecting all grid cells associated with the object boundary on the image plane. Memory space and access time are reduced by run-length encoding of the boundary cells, while boundary cell projection time is reduced by exploiting projection templates and multiresolution volumes. Efforts have also been made towards a fast perspective projection as well as interactive classification. We further present task partitioning schemes for effective parallelization of both boundary cell projection and ray traversal procedures. Good load balancing has been reached by taking full advantage of both the optimizations in the serial rendering algorithm and shared-memory architecture. Our experimental results on a 16-processor SGI Power Challenge have shown interactive rendering rates for 256/sup 3/ volumetric data sets at 10-30 Hz. We describe the theory and implementation of our algorithm, and shows its superiority over the shear-warp factorization approach.",Ming Wan;Arie E. Kaufman;Steve Bryson,M. Wan;A. Kaufman;S. Bryson,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1994.346319;10.1109/VISUAL.1990.146377;10.1109/VISUAL.1999.809914;10.1109/VISUAL.1992.235231;10.1109/VISUAL.1998.745713,"Volume rendering, presence acceleration, run-length encoding, projection template, multiresolution volumes, interactive classification, parallel processing",36,22,14,
Vis,2000,"Tetrahedron based, least squares, progressive volume models with application to freehand ultrasound data",10.1109/VISUAL.2000.885681,http://dx.doi.org/10.1109/VISUAL.2000.885681,93,100,C,"We present a new method for the modeling of freehand collected three-dimensional ultrasound data. The model is piecewise linear and based upon progressive tetrahedral domains created by a subdivision scheme which splits a tetrahedron on on its longest edge and guarantees a valid tetrahedrization. Least squares error is used to characterize the model and an effective iterative technique is used to compute the values of the model at the vertices of the tetrahedral grid. Since the subdivision strategy is adaptive, the complexity of the model conforms to the complexity of the data leading to an extremely efficient and highly compressed volume model. The model is evaluated in real time using piecewise linear interpolation, and gives a medical professional the chance to see images which would not be possible using conventional ultrasound techniques.",Tom Roxborough;Gregory M. Nielson,T. Roxborough;G.M. Nielson,"Arizona State Univ., Tempe, AZ, USA",10.1109/VISUAL.1997.663907,,36,10,17,
Vis,2000,New techniques for topologically correct surface reconstruction,10.1109/VISUAL.2000.885718,http://dx.doi.org/10.1109/VISUAL.2000.885718,373,380,C,"We present a novel approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that, we introduce the concept of /spl lambda/-intervals. It turns out that for smooth regions of the surface this method works very well and at difficult parts of the surface yields an output well-suited for postprocessing. As a postprocessing step we propose a topological clean up and a new technique based on linear programming in order to establish a topologically correct surface. These techniques should be useful also for many other reconstruction schemes.",Udo Adamy;Joachim Giesen;Matthias John 0003,U. Adamy;J. Giesen;M. John,"Inst. for Theor. Comput. Sci., Eidgenossische Tech. Hochschule, Zurich, Switzerland",10.1109/VISUAL.1998.745286,"surface reconstruction, gabriel graph, linear programming, topology",36,11,18,
Vis,2002,Fast visualization of plane-like structures in voxel data,10.1109/VISUAL.2002.1183753,http://dx.doi.org/10.1109/VISUAL.2002.1183753,29,36,C,"We present a robust, noise-resistant criterion characterizing plane-like skeletons in binary voxel objects. It is based on a distance map and the geodesic distance along the object's boundary. A parameter allows us to control the noise sensitivity. If needed, homotopy with the original object might be reconstructed in a second step, using an improved distance ordered thinning algorithm. The skeleton is analyzed to create a geometric representation for rendering. Plane-like parts are transformed into an triangulated surface not enclosing a volume by a suitable triangulation scheme. The resulting surfaces have lower triangle count than those created with standard methods and tend to maintain the original geometry, even after simplification with a high decimation rate. Our algorithm allows us to interactively render expressive images of complex 3D structures, emphasizing independently plane-like and rod-like structures. The methods are applied for visualization of the microstructure of bone biopsies.",Steffen Prohaska;Hans-Christian Hege,S. Prohaska;H.-C. Hege,"Dept. for Sci. Visualization, Zuse Inst. Berlin, Germany;Dept. for Sci. Visualization, Zuse Inst. Berlin, Germany",,"skeletonization, thinning, distance transform, triangulation, visualization",36,12,19,
Vis,2002,Direct surface extraction from 3D freehand ultrasound images,10.1109/VISUAL.2002.1183755,http://dx.doi.org/10.1109/VISUAL.2002.1183755,45,52,C,"This paper presents a new technique for the extraction of surfaces from 3D ultrasound data. Surface extraction from ultrasound data is challenging for a number of reasons including noise and artifacts in the images and nonuniform data sampling. A method is proposed to fit an approximating radial basis function to the group of data samples. An explicit surface is then obtained by iso-surfacing the function. In most previous 3D ultrasound research, a pre-processing step is taken to interpolate the data into a regular voxel array and a corresponding loss of resolution. We are the first to represent the set of semi-structured ultrasound pixel data as a single function. From this we are able to extract surfaces without first reconstructing the irregularly spaced pixels into a regular 3D voxel array.",Youwei Zhang;Robert Rohling;Dinesh K. Pai,Youwei Zhang;R. Rohling;D.K. Pai,"Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada",10.1109/VISUAL.1991.175782;10.1109/VISUAL.1994.346295,"Radial Basis Functions, Ultrasound, Isosurface, 3D Freehand Ultrasound, Direct Surface Extraction, Unstructured data",36,8,27,
Vis,2002,"PMR: point to mesh rendering, a feature-based approach",10.1109/VISUAL.2002.1183770,http://dx.doi.org/10.1109/VISUAL.2002.1183770,155,162,C,"Within the field of computer graphics and visualization, it is often necessary to visualize polygonal models with large number of polygons. Display quality is mandatory, but it is also desirable to have the ability to rapidly update the display in order to facilitate interactive use. Point based rendering methods have been shown effective for this task. Building on this paradigm we introduce the PMR system which uses a hierarchy both in points and triangles for rendering. This hierarchy is fundamentally different from the ones used in existing methods. It is based on the feature geometry in the object space rather than its projection in the screen space. This provides certain advantages over the existing methods.",Tamal K. Dey;James Hudson,T.K. Dey;J. Hudson,"Ohio State Univ., Columbus, OH, USA;Ohio State Univ., Columbus, OH, USA",10.1109/VISUAL.2001.964489;10.1109/VISUAL.2001.964492;10.1109/VISUAL.2001.964491;10.1109/VISUAL.1997.663909,"rendering, feature, multi-resolution, level of details, Voronoi diagram",36,15,35,
Vis,2004,Flow field clustering via algebraic multigrid,10.1109/VISUAL.2004.32,http://dx.doi.org/10.1109/VISUAL.2004.32,35,42,C,"We present a novel multiscale approach for flow visualization. We define a local alignment tensor that encodes a measure for alignment to the direction of a given flow field. This tensor induces an anisotropic differential operator on the flow domain, which is discretized with a standard finite element technique. The entries of the corresponding stiffness matrix represent the anisotropically weighted couplings of adjacent nodes of the domain mesh. We use an algebraic multigrid algorithm to generate a hierarchy of fine to coarse descriptions for the above coupling data. This hierarchy comprises a set of coarse grid nodes, a multiscale of basis functions and their corresponding supports. We use these supports to obtain a multilevel decomposition of the flow structure. Standard streamline icons are used to visualize this decomposition at any user-selected level of detail. The method provides a single framework for vector field decomposition independent on the domain dimension or mesh type. Applications are shown in 2D, for flow fields on curved surfaces, and for 3D volumetric flow fields.",Michael Griebel;Tobias Preußer;Martin Rumpf;Marc Alexander Schweitzer;Alexandru Telea,M. Griebel;T. Preusser;M. Rumpf;M.A. Schweitzer;A. Telea,"Inst. for Numerical Simulation, Bonn Univ., Germany",10.1109/VISUAL.1999.809865;10.1109/VISUAL.2003.1250372;10.1109/VISUAL.2003.1250377;10.1109/VISUAL.2003.1250363;10.1109/VISUAL.1999.809863,"algebraic multigrid, multiscale visualization, flow visualization",36,17,28,
Vis,2005,Distributed data management for large volume visualization,10.1109/VISUAL.2005.1532794,http://dx.doi.org/10.1109/VISUAL.2005.1532794,183,189,C,"We propose a distributed data management scheme for large data visualization that emphasizes efficient data sharing and access. To minimize data access time and support users with a variety of local computing capabilities, we introduce an adaptive data selection method based on an ""enhanced time-space partitioning"" (ETSP) tree that assists with effective visibility culling, as well as multiresolution data selection. By traversing the tree, our data management algorithm can quickly identify the visible regions of data, and, for each region, adaptively choose the lowest resolution satisfying user-specified error tolerances. Only necessary data elements are accessed and sent to the visualization pipeline. To further address the issue of sharing large-scale data among geographically distributed collaborative teams, we have designed an infrastructure for integrating our data management technique with a distributed data storage system provided by logistical networking (LoN). Data sets at different resolutions are generated and uploaded to LoN for wide-area access. We describe a parallel volume rendering system that verifies the effectiveness of our data storage, selection and access scheme.",Jinzhu Gao;Jian Huang 0007;C. Ryan Johnson;Scott Atchley;James Arthur Kohl,J. Gao;J. Huang;C.R. Johnson;S. Atchley,"Oak Ridge Nat. Lab., TN, USA",10.1109/VISUAL.2002.1183758;10.1109/VISUAL.2002.1183757;10.1109/VISUAL.1999.809910;10.1109/VISUAL.1998.745300;10.1109/VISUAL.2004.110;10.1109/VISUAL.2004.112;10.1109/VISUAL.1999.809879,"large data visualization, distributed storage, logistical networking, visibility culling, volume rendering, multiresolution rendering",36,10,23,
VAST,2006,"Toward a Multi-Analyst, Collaborative Framework for Visual Analytics",10.1109/VAST.2006.261439,http://dx.doi.org/10.1109/VAST.2006.261439,129,136,C,"We describe a framework for the display of complex, multidimensional data, designed to facilitate exploration, analysis, and collaboration among multiple analysts. This framework aims to support human collaboration by making it easier to share representations, to translate from one point of view to another, to explain arguments, to update conclusions when underlying assumptions change, and to justify or account for decisions or actions. Multidimensional visualization techniques are used with interactive, context-sensitive, and tunable graphs. Visual representations are flexibly generated using a knowledge representation scheme based on annotated logic; this enables not only tracking and fusing different viewpoints, but also unpacking them. Fusing representations supports the creation of multidimensional meta-displays as well as the translation or mapping from one point of view to another. At the same time, analysts also need to be able to unpack one another's complex chains of reasoning, especially if they have reached different conclusions, and to determine the implications, if any, when underlying assumptions or evidence turn out to be false. The framework enables us to support a variety of scenarios as well as to systematically generate and test experimental hypotheses about the impact of different kinds of visual representations upon interactive collaboration by teams of distributed analysts",Susan Brennan;Klaus Mueller;Gregory J. Zelinsky;I. V. Ramakrishnan;David Scott Warren;Arie E. Kaufman,Susan E. Brennan;Klaus Mueller;Greg Zelinsky;IV Ramakrishnan;David S. Warren;Arie Kaufman,"Stony Brook University, Psychology Department, Stony Brook University, Stony Brook, NY 11794-3300, susan.brennan@sunysb.edu;Stony Brook University, Computer Science Department, Stony Brook University, Stony Brook, NY 11794-4400. mueller@cs.sunysb.edu;Stony Brook University, Psychology Department, Stony Brook University, Stony Brook, NY 11794-3300, gzelinsky@ms.cc.sunysb.edu;Stony Brook University, Computer Science Department, Stony Brook University, Stony Brook, NY 11794-4400. ram@cs.sunysb.edu;Stony Brook University, Computer Science Department, Stony Brook University, Stony Brook, NY 11794-4400. warren@cs.sunysb.edu;Stony Brook University, Computer Science Department, Stony Brook University, Stony Brook, NY 11794-4400. ari@cs.sunysb.edu",,"visual analytics, collaborative and distributed visualization, data management and knowledge representation, visual knowledge discovery",36,25,25,
Vis,2007,Illustrative Deformation for Data Exploration,10.1109/TVCG.2007.70565,http://dx.doi.org/10.1109/TVCG.2007.70565,1320,1327,J,"Much of the visualization research has focused on improving the rendering quality and speed, and enhancing the perceptibility of features in the data. Recently, significant emphasis has been placed on focus+context (F+C) techniques (e.g., fisheye views and magnification lens) for data exploration in addition to viewing transformation and hierarchical navigation. However, most of the existing data exploration techniques rely on the manipulation of viewing attributes of the rendering system or optical attributes of the data objects, with users being passive viewers. In this paper, we propose a more active approach to data exploration, which attempts to mimic how we would explore data if we were able to hold it and interact with it in our hands. This involves allowing the users to physically or actively manipulate the geometry of a data object. While this approach has been traditionally used in applications, such as surgical simulation, where the original geometry of the data objects is well understood by the users, there are several challenges when this approach is generalized for applications, such as flow and information visualization, where there is no common perception as to the normal or natural geometry of a data object. We introduce a taxonomy and a set of transformations especially for illustrative deformation of general data exploration. We present combined geometric or optical illustration operators for focus+context visualization, and examine the best means for preventing the deformed context from being misperceived. We demonstrated the feasibility of this generalization with examples of flow, information and video visualization.",Carlos D. Correa;Deborah Silver;Mi Chen,Carlos Correa;Debora Silver;Mi Chen,"Department of Electrical and Computer Engineering, Rutgers, The State University of New Jersey;Department of Electrical and Computer Engineering, Rutgers, The State University of New Jersey;Department of Computer Science, University of Wales, Swansea",10.1109/VISUAL.2000.885696;10.1109/TVCG.2006.144;10.1109/VISUAL.2003.1250400;10.1109/TVCG.2006.152;10.1109/VISUAL.2003.1250401;10.1109/INFVIS.2004.59;10.1109/VISUAL.2002.1183777;10.1109/TVCG.2006.140;10.1109/VISUAL.2001.964519;10.1109/VISUAL.2004.48;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2005.1532856;10.1109/VISUAL.2005.1532818,"Volume deformation, focus+context visualization, interaction techniques",36,25,31,
Vis,2008,The Seismic Analyzer: Interpreting and Illustrating 2D Seismic Data,10.1109/TVCG.2008.170,http://dx.doi.org/10.1109/TVCG.2008.170,1571,1578,J,"We present a toolbox for quickly interpreting and illustrating 2D slices of seismic volumetric reflection data. Searching for oil and gas involves creating a structural overview of seismic reflection data to identify hydrocarbon reservoirs. We improve the search of seismic structures by precalculating the horizon structures of the seismic data prior to interpretation. We improve the annotation of seismic structures by applying novel illustrative rendering algorithms tailored to seismic data, such as deformed texturing and line and texture transfer functions. The illustrative rendering results in multi-attribute and scale invariant visualizations where features are represented clearly in both highly zoomed in and zoomed out views. Thumbnail views in combination with interactive appearance control allows for a quick overview of the data before detailed interpretation takes place. These techniques help reduce the work of seismic illustrators and interpreters.",Daniel Patel;Christopher Giertsen;John Thurmond;John Gjelberg;M. Eduard Gröller,Daniel Patel;Christopher Giertsen;John Thurmond;John Gjelberg;Eduard Grøller,"Christian Michelsen Research, Bergen, Norway;Christian Michelsen Research, Bergen, Norway;StatoilHydro, Bergen, Norway;StatoilHydro, Bergen, Norway;Vienna University of Technology, Austria",10.1109/VISUAL.1999.809905;10.1109/VISUAL.2005.1532802;10.1109/VISUAL.1991.175811,"Seismic interpretation, Illustrative rendering, Seismic attributes, Top-down interpretation",36,27,20,
Vis,2009,Focus+Context Route Zooming and Information Overlay in 3D Urban Environments,10.1109/TVCG.2009.144,http://dx.doi.org/10.1109/TVCG.2009.144,1547,1554,J,"In this paper we present a novel focus+context zooming technique, which allows users to zoom into a route and its associated landmarks in a 3D urban environment from a 45-degree bird's-eye view. Through the creative utilization of the empty space in an urban environment, our technique can informatively reveal the focus region and minimize distortions to the context buildings. We first create more empty space in the 2D map by broadening the road with an adapted seam carving algorithm. A grid-based zooming technique is then used to enlarge the landmarks to reclaim the created empty space and thus reduce distortions to the other parts. Finally,an occlusion-free route visualization scheme adaptively scales the buildings occluding the route to make the route always visible to users. Our method can be conveniently integrated into Google Earth and Virtual Earth to provide seamless route zooming and help users better explore a city and plan their tours. It can also be used in other applications such as information overlay to a virtual city.",Huamin Qu;Haomian Wang;Weiwei Cui;Yingcai Wu;Ming-Yuen Chan,Huamin Qu;Haomian Wang;Weiwei Cui;Yingcai Wu;Ming-Yuen Chan,The Hong Kong University of Science and Technology;The Hong Kong University of Science and Technology;The Hong Kong University of Science and Technology;The Hong Kong University of Science and Technology;The Hong Kong University of Science and Technology,10.1109/TVCG.2008.124;10.1109/TVCG.2006.163;10.1109/TVCG.2006.167;10.1109/INFVIS.1998.729558;10.1109/TVCG.2008.132,"focus+context visualization, zooming, 3D virtual environment, seam carving",36,28,20,
InfoVis,2011,"Angular Histograms: Frequency-Based Visualizations for Large, High Dimensional Data",10.1109/TVCG.2011.166,http://dx.doi.org/10.1109/TVCG.2011.166,2572,2580,J,"Parallel coordinates is a popular and well-known multivariate data visualization technique. However, one of their inherent limitations has to do with the rendering of very large data sets. This often causes an overplotting problem and the goal of the visual information seeking mantra is hampered because of a cluttered overview and non-interactive update rates. In this paper, we propose two novel solutions, namely, angular histograms and attribute curves. These techniques are frequency-based approaches to large, high-dimensional data visualization. They are able to convey both the density of underlying polylines and their slopes. Angular histogram and attribute curves offer an intuitive way for the user to explore the clustering, linear correlations and outliers in large data sets without the over-plotting and clutter problems associated with traditional parallel coordinates. We demonstrate the results on a wide variety of data sets including real-world, high-dimensional biological data. Finally, we compare our methods with the other popular frequency-based algorithms.",Zhao Geng;Zhenmin Peng;Robert S. Laramee;Jonathan Roberts 0002;Rick Walker,Zhao Geng;ZhenMin Peng;Robert S.Laramee;Jonathan C. Roberts;Rick Walker,"Swansea University, UK;Swansea University, UK;Swansea University, UK;Bangore University, UK;Bangor University, UK",10.1109/INFVIS.2002.1173157;10.1109/INFVIS.2004.68;10.1109/TVCG.2006.138;10.1109/TVCG.2007.70535;10.1109/VISUAL.1999.809866;10.1109/INFVIS.1996.559216;10.1109/VISUAL.1990.146402;10.1109/TVCG.2010.184;10.1109/INFVIS.2005.1532138;10.1109/TVCG.2006.170;10.1109/TVCG.2008.131,"Parallel Coordinates, Angular Histogram, Attribute Curves",36,23,28,
VAST,2011,How locus of control influences compatibility with visualization style,10.1109/VAST.2011.6102445,http://dx.doi.org/10.1109/VAST.2011.6102445,81,90,C,"Existing research suggests that individual personality differences are correlated with a user's speed and accuracy in solving problems with different types of complex visualization systems. In this paper, we extend this research by isolating factors in personality traits as well as in the visualizations that could have contributed to the observed correlation. We focus on a personality trait known as “locus of control,” which represents a person's tendency to see themselves as controlled by or in control of external events. To isolate variables of the visualization design, we control extraneous factors such as color, interaction, and labeling, and specifically focus on the overall layout style of the visualizations. We conduct a user study with four visualizations that gradually shift from an indentation metaphor to a containment metaphor and compare the participants' speed, accuracy, and preference with their locus of control. Our findings demonstrate that there is indeed a correlation between the two: participants with an internal locus of control perform more poorly with visualizations that employ a containment metaphor, while those with an external locus of control perform well with such visualizations. We discuss a possible explanation for this relationship based in cognitive psychology and propose that these results can be used to better understand how people use visualizations and how to adapt visual analytics design to an individual user's needs.",Caroline Ziemkiewicz;R. Jordan Crouser;Ashley Rye Yauilla;Sara L. Su;William Ribarsky;Remco Chang,Caroline Ziemkiewicz;R. Jordan Crouser;Ashley Rye Yauilla;Sara L. Su;William Ribarsky;Remco Chang,"Brown University, USA;Tufts University, USA;Winthrop University, USA;Tufts University, USA;UNC Charlotte, USA;Tufts University, USA",10.1109/VAST.2010.5653587;10.1109/TVCG.2008.171;10.1109/TVCG.2008.121,,36,20,31,HM
Vis,2011,Branching and Circular Features in High Dimensional Data,10.1109/TVCG.2011.177,http://dx.doi.org/10.1109/TVCG.2011.177,1902,1911,J,"Large observations and simulations in scientific research give rise to high-dimensional data sets that present many challenges and opportunities in data analysis and visualization. Researchers in application domains such as engineering, computational biology, climate study, imaging and motion capture are faced with the problem of how to discover compact representations of highdimensional data while preserving their intrinsic structure. In many applications, the original data is projected onto low-dimensional space via dimensionality reduction techniques prior to modeling. One problem with this approach is that the projection step in the process can fail to preserve structure in the data that is only apparent in high dimensions. Conversely, such techniques may create structural illusions in the projection, implying structure not present in the original high-dimensional data. Our solution is to utilize topological techniques to recover important structures in high-dimensional data that contains non-trivial topology. Specifically, we are interested in high-dimensional branching structures. We construct local circle-valued coordinate functions to represent such features. Subsequently, we perform dimensionality reduction on the data while ensuring such structures are visually preserved. Additionally, we study the effects of global circular structures on visualizations. Our results reveal never-before-seen structures on real-world data sets from a variety of applications.",Bei Wang 0001;Brian Summa;Valerio Pascucci;Mikael Vejdemo-Johansson,Bei Wang;Brian Summa;Valerio Pascucci;Mikael Vejdemo-Johansson,"SCI Institute, University of Utah;SCI Institute, University of Utah;SCI Institute, University of Utah;Department of mathematics, Stanford University",10.1109/TVCG.2010.213;10.1109/TVCG.2009.119;10.1109/TVCG.2007.70601;10.1109/TVCG.2010.139;10.1109/VAST.2010.5652940,"Dimensionality reduction, circular coordinates, visualization, topological analysis",36,19,51,
InfoVis,2012,Adaptive Composite Map Projections,10.1109/TVCG.2012.192,http://dx.doi.org/10.1109/TVCG.2012.192,2575,2582,J,"All major web mapping services use the web Mercator projection. This is a poor choice for maps of the entire globe or areas of the size of continents or larger countries because the Mercator projection shows medium and higher latitudes with extreme areal distortion and provides an erroneous impression of distances and relative areas. The web Mercator projection is also not able to show the entire globe, as polar latitudes cannot be mapped. When selecting an alternative projection for information visualization, rivaling factors have to be taken into account, such as map scale, the geographic area shown, the map's height-to-width ratio, and the type of cartographic visualization. It is impossible for a single map projection to meet the requirements for all these factors. The proposed composite map projection combines several projections that are recommended in cartographic literature and seamlessly morphs map space as the user changes map scale or the geographic region displayed. The composite projection adapts the map's geometry to scale, to the map's height-to-width ratio, and to the central latitude of the displayed area by replacing projections and adjusting their parameters. The composite projection shows the entire globe including poles; it portrays continents or larger countries with less distortion (optionally without areal distortion); and it can morph to the web Mercator projection for maps showing small regions.",Bernhard Jenny,Bernhard Jenny,Oregon State University,10.1109/TVCG.2011.191;10.1109/TVCG.2010.191;10.1109/INFVIS.2000.885095,"Multi-scale map, web mapping, web cartography, web map projection, web Mercator, HTML5 Canvas",36,30,38,
SciVis,2012,An Adaptive Prediction-Based Approach to Lossless Compression of Floating-Point Volume Data,10.1109/TVCG.2012.194,http://dx.doi.org/10.1109/TVCG.2012.194,2295,2304,J,"In this work, we address the problem of lossless compression of scientific and medical floating-point volume data. We propose two prediction-based compression methods that share a common framework, which consists of a switched prediction scheme wherein the best predictor out of a preset group of linear predictors is selected. Such a scheme is able to adapt to different datasets as well as to varying statistics within the data. The first method, called APE (Adaptive Polynomial Encoder), uses a family of structured interpolating polynomials for prediction, while the second method, which we refer to as ACE (Adaptive Combined Encoder), combines predictors from previous work with the polynomial predictors to yield a more flexible, powerful encoder that is able to effectively decorrelate a wide range of data. In addition, in order to facilitate efficient visualization of compressed data, our scheme provides an option to partition floating-point values in such a way as to provide a progressive representation. We compare our two compressors to existing state-of-the-art lossless floating-point compressors for scientific data, with our data suite including both computer simulations and observational measurements. The results demonstrate that our polynomial predictor, APE, is comparable to previous approaches in terms of speed but achieves better compression rates on average. ACE, our combined predictor, while somewhat slower, is able to achieve the best compression rate on all datasets, with significantly better rates on most of the datasets.",Nathaniel Fout;Kwan-Liu Ma,Nathaniel Fout;Kwan-Liu Ma,"University of California, Davis;University of California, Davis",10.1109/VISUAL.1996.568138;10.1109/TVCG.2006.143;10.1109/VISUAL.1994.346332,"Volume compression, lossless compression, floating-point compression",36,29,34,
SciVis,2013,Design by Dragging: An Interface for Creative Forward and Inverse Design with Simulation Ensembles,10.1109/TVCG.2013.147,http://dx.doi.org/10.1109/TVCG.2013.147,2783,2791,J,"We present an interface for exploring large design spaces as encountered in simulation-based engineering, design of visual effects, and other tasks that require tuning parameters of computationally-intensive simulations and visually evaluating results. The goal is to enable a style of design with simulations that feels as-direct-as-possible so users can concentrate on creative design tasks. The approach integrates forward design via direct manipulation of simulation inputs (e.g., geometric properties, applied forces) in the same visual space with inverse design via 'tugging' and reshaping simulation outputs (e.g., scalar fields from finite element analysis (FEA) or computational fluid dynamics (CFD)). The interface includes algorithms for interpreting the intent of users' drag operations relative to parameterized models, morphing arbitrary scalar fields output from FEA and CFD simulations, and in-place interactive ensemble visualization. The inverse design strategy can be extended to use multi-touch input in combination with an as-rigid-as-possible shape manipulation to support rich visual queries. The potential of this new design approach is confirmed via two applications: medical device engineering of a vacuum-assisted biopsy device and visual effects design using a physically based flame simulation.",Dane M. Coffey;Chi-Lun Lin;Arthur G. Erdman;Daniel F. Keefe,Dane Coffey;Chi-Lun Lin;Arthur G. Erdman;Daniel F. Keefe,University of Minnesota;University of Minnesota;University of Minnesota;University of Minnesota,10.1109/TVCG.2012.261;10.1109/TVCG.2010.223;10.1109/TVCG.2010.190;10.1109/TVCG.2011.248;10.1109/VISUAL.2000.885734;10.1109/TVCG.2010.171;10.1109/TVCG.2007.70581,"Design, simulation, direct manipulation, multi-touch",36,35,27,HM
VAST,2013,Interactive Exploration of Surveillance Video through Action Shot Summarization and Trajectory Visualization,10.1109/TVCG.2013.168,http://dx.doi.org/10.1109/TVCG.2013.168,2119,2128,J,"We propose a novel video visual analytics system for interactive exploration of surveillance video data. Our approach consists of providing analysts with various views of information related to moving objects in a video. To do this we first extract each object's movement path. We visualize each movement by (a) creating a single action shot image (a still image that coalesces multiple frames), (b) plotting its trajectory in a space-time cube and (c) displaying an overall timeline view of all the movements. The action shots provide a still view of the moving object while the path view presents movement properties such as speed and location. We also provide tools for spatial and temporal filtering based on regions of interest. This allows analysts to filter out large amounts of movement activities while the action shot representation summarizes the content of each movement. We incorporated this multi-part visual representation of moving objects in sViSIT, a tool to facilitate browsing through the video content by interactive querying and retrieval of data. Based on our interaction with security personnel who routinely interact with surveillance video data, we identified some of the most common tasks performed. This resulted in designing a user study to measure time-to-completion of the various tasks. These generally required searching for specific events of interest (targets) in videos. Fourteen different tasks were designed and a total of 120 min of surveillance video were recorded (indoor and outdoor locations recording movements of people and vehicles). The time-to-completion of these tasks were compared against a manual fast forward video browsing guided with movement detection. We demonstrate how our system can facilitate lengthy video exploration and significantly reduce browsing time to find events of interest. Reports from expert users identify positive aspects of our approach which we summarize in our recommendations for future video visual analytics systems.",Amir H. Meghdadi;Pourang Irani,Amir H. Meghdadi;Pourang Irani,"Department of Computer Science, University of Manitoba;Department of Computer Science, University of Manitoba",10.1109/INFVIS.2004.27;10.1109/TVCG.2012.222;10.1109/VISUAL.2003.1250401,"Video visual analytics, surveillance video, video visualization, video summarization, video browsing and exploration",36,37,33,
VAST,2013,Visual Analytics for Multimodal Social Network Analysis: A Design Study with Social Scientists,10.1109/TVCG.2013.223,http://dx.doi.org/10.1109/TVCG.2013.223,2032,2041,J,"Social network analysis (SNA) is becoming increasingly concerned not only with actors and their relations, but also with distinguishing between different types of such entities. For example, social scientists may want to investigate asymmetric relations in organizations with strict chains of command, or incorporate non-actors such as conferences and projects when analyzing coauthorship patterns. Multimodal social networks are those where actors and relations belong to different types, or modes, and multimodal social network analysis (mSNA) is accordingly SNA for such networks. In this paper, we present a design study that we conducted with several social scientist collaborators on how to support mSNA using visual analytics tools. Based on an openended, formative design process, we devised a visual representation called parallel node-link bands (PNLBs) that splits modes into separate bands and renders connections between adjacent ones, similar to the list view in Jigsaw. We then used the tool in a qualitative evaluation involving five social scientists whose feedback informed a second design phase that incorporated additional network metrics. Finally, we conducted a second qualitative evaluation with our social scientist collaborators that provided further insights on the utility of the PNLBs representation and the potential of visual analytics for mSNA.",Sohaib Ghani;Bum Chul Kwon;Seungyoon Lee;Ji Soo Yi;Niklas Elmqvist,Sohaib Ghani;Bum Chul Kwon;Seungyoon Lee;Ji Soo Yi;Niklas Elmqvist,"School of Electrical and Computer Engineering, Purdue University;School of Industrial Engineering, Purdue University;Brian Lamb School of Communication, Purdue University;School of Industrial Engineering, Purdue University;School of Electrical and Computer Engineering, Purdue University",10.1109/TVCG.2011.247;10.1109/VAST.2011.6102440;10.1109/TVCG.2012.213;10.1109/TVCG.2011.201;10.1109/VAST.2007.4389006;10.1109/TVCG.2007.70521;10.1109/INFVIS.2005.1532142;10.1109/VISUAL.1990.146402;10.1109/TVCG.2007.70535;10.1109/INFVIS.2002.1173155;10.1109/VAST.2006.261430;10.1109/TVCG.2006.166;10.1109/TVCG.2011.209,"Design study, user-centered design, node-link diagrams, multimodal graphs, interaction, qualitative evaluation",36,37,55,
SciVis,2014,Multi-Charts for Comparative 3D Ensemble Visualization,10.1109/TVCG.2014.2346448,http://dx.doi.org/10.1109/TVCG.2014.2346448,2694,2703,J,"A comparative visualization of multiple volume data sets is challenging due to the inherent occlusion effects, yet it is important to effectively reveal uncertainties, correlations and reliable trends in 3D ensemble fields. In this paper we present bidirectional linking of multi-charts and volume visualization as a means to analyze visually 3D scalar ensemble fields at the data level. Multi-charts are an extension of conventional bar and line charts: They linearize the 3D data points along a space-filling curve and draw them as multiple charts in the same plot area. The bar charts encode statistical information on ensemble members, such as histograms and probability densities, and line charts are overlayed to allow comparing members against the ensemble. Alternative linearizations based on histogram similarities or ensemble variation allow clustering of spatial locations depending on data distribution. Multi-charts organize the data at multiple scales to quickly provide overviews and enable users to select regions exhibiting interesting behavior interactively. They are further put into a spatial context by allowing the user to brush or query value intervals and specific distributions, and to simultaneously visualize the corresponding spatial points via volume rendering. By providing a picking mechanism in 3D and instantly highlighting the corresponding data points in the chart, the user can go back and forth between the abstract and the 3D view to focus the analysis.",Ismail Demir;Christian Dick;Rüdiger Westermann,Ismail Demir;Christian Dick;Rüdiger Westermann,"Computer Graphics and Visualization Group, Technische Universität München Informatik 15, Garching, Germany;Computer Graphics and Visualization Group, Technische Universität München Informatik 15, Garching, Germany;Computer Graphics and Visualization Group, Technische Universität München Informatik 15, Garching, Germany",10.1109/TVCG.2013.143;10.1109/VISUAL.2000.885739;10.1109/TVCG.2006.159;10.1109/TVCG.2008.139;10.1109/TVCG.2007.70518;10.1109/TVCG.2010.181;10.1109/TVCG.2009.198;10.1109/INFVIS.2002.1173157;10.1109/VISUAL.1999.809921,"Ensemble visualization, brushing and linking, statistical analysis",36,40,57,
VAST,2014,Visual Abstraction and Exploration of Multi-class Scatterplots,10.1109/TVCG.2014.2346594,http://dx.doi.org/10.1109/TVCG.2014.2346594,1683,1692,J,"Scatterplots are widely used to visualize scatter dataset for exploring outliers, clusters, local trends, and correlations. Depicting multi-class scattered points within a single scatterplot view, however, may suffer from heavy overdraw, making it inefficient for data analysis. This paper presents a new visual abstraction scheme that employs a hierarchical multi-class sampling technique to show a feature-preserving simplification. To enhance the density contrast, the colors of multiple classes are optimized by taking the multi-class point distributions into account. We design a visual exploration system that supports visual inspection and quantitative analysis from different perspectives. We have applied our system to several challenging datasets, and the results demonstrate the efficiency of our approach.",Haidong Chen;Wei Chen 0001;Honghui Mei;Zhiqi Liu;Kun Zhou;Weifeng Chen 0002;Wentao Gu;Kwan-Liu Ma,Haidong Chen;Wei Chen;Honghui Mei;Zhiqi Liu;Kun Zhou;Weifeng Chen;Wentao Gu;Kwan-Liu Ma,State Key Lab of CAD&CG;State Key Lab of CAD&CG;State Key Lab of CAD&CG;State Key Lab of CAD&CG;State Key Lab of CAD&CG;Zhejiang University of Finance & Economics;Zhejiang GongShang University;University of California at Davis,10.1109/TVCG.2013.150;10.1109/TVCG.2008.119;10.1109/VISUAL.1998.745301;10.1109/TVCG.2008.120;10.1109/TVCG.2010.197;10.1109/TVCG.2006.187;10.1109/TVCG.2007.70623;10.1109/TVCG.2013.180;10.1109/INFVIS.2004.52;10.1109/VAST.2010.5652460;10.1109/TVCG.2009.112;10.1109/TVCG.2009.122;10.1109/TVCG.2011.181;10.1109/TVCG.2012.238;10.1109/TVCG.2010.176;10.1109/TVCG.2013.212;10.1109/TVCG.2011.261;10.1109/TVCG.2008.153;10.1109/TVCG.2013.183,"Scatterplot, overdraw reduction, sampling, visual abstraction",36,56,48,
VAST,2015,VA2: A Visual Analytics Approach for Evaluating Visual Analytics Applications,10.1109/TVCG.2015.2467871,http://dx.doi.org/10.1109/TVCG.2015.2467871,61,70,J,"Evaluation has become a fundamental part of visualization research and researchers have employed many approaches from the field of human-computer interaction like measures of task performance, thinking aloud protocols, and analysis of interaction logs. Recently, eye tracking has also become popular to analyze visual strategies of users in this context. This has added another modality and more data, which requires special visualization techniques to analyze this data. However, only few approaches exist that aim at an integrated analysis of multiple concurrent evaluation procedures. The variety, complexity, and sheer amount of such coupled multi-source data streams require a visual analytics approach. Our approach provides a highly interactive visualization environment to display and analyze thinking aloud, interaction, and eye movement data in close relation. Automatic pattern finding algorithms allow an efficient exploratory search and support the reasoning process to derive common eye-interaction-thinking patterns between participants. In addition, our tool equips researchers with mechanisms for searching and verifying expected usage patterns. We apply our approach to a user study involving a visual analytics application and we discuss insights gained from this joint analysis. We anticipate our approach to be applicable to other combinations of evaluation techniques and a broad class of visualization applications.",Tanja Blascheck;Markus John;Kuno Kurzhals;Steffen Koch;Thomas Ertl,Tanja Blascheck;Markus John;Kuno Kurzhals;Steffen Koch;Thomas Ertl,"Institute for Visualization and Interactive Systems (VIS), Germany;Institute for Visualization and Interactive Systems (VIS), Germany;Visualization Research Center, Germany;Institute for Visualization and Interactive Systems (VIS), Germany;Institute for Visualization and Interactive Systems (VIS), Germany",10.1109/TVCG.2012.276;10.1109/TVCG.2013.124;10.1109/VAST.2008.4677361;10.1109/VAST.2009.5333878;10.1109/TVCG.2014.2346677;10.1109/VAST.2010.5653598;10.1109/TVCG.2012.273;10.1109/VISUAL.2005.1532837,"visual analytics, qualitative evaluation, thinking aloud, interaction logs, eye tracking, time series data",36,33,53,HM
Vis,1990,Moving iconic objects in scientific visualization,10.1109/VISUAL.1990.146373,http://dx.doi.org/10.1109/VISUAL.1990.146373,124,"130, 468",C,"The idea of independently moving, interacting graphical objects is introduced as a method for the visualization of continuous fields. Bird-oid objects or boids are discussed. These boids derive from: (1) icons which are geometric objects whose shape and appearance are related to the field variables, (2) three-dimensional cursors by which a user interactively picks a point in space, (3) particle traces, which are numerically integrated trajectories in space, (4) moving frames of vectors along space curves, and (5) actors, which are programming objects that can create and destroy instances of themselves, act according to internal logic, and communicate with each other and with a user. A software prototype in the C++ language has been developed which demonstrates some of the capabilities of these objects for the visualization of scalar, vector, and tensor fields defined over finite elements or finite volumes.&lt;&lt;ETX&gt;&gt;",G. David Kerlick,D.G. Kerlick,"Tektronix Labs., Beaverton, OR, USA",,,35,13,22,
Vis,1992,Display of scientific data structures for algorithm visualization,10.1109/VISUAL.1992.235215,http://dx.doi.org/10.1109/VISUAL.1992.235215,139,146,C,"A technique for defining graphical depictions for all the data types defined in an algorithm is presented. The ability to display arbitrary combinations of an algorithm's data objects in a common frame of reference, coupled with interactive control of algorithm execution, provides a powerful way to understand algorithm behavior. Type definitions are constrained so that all primitive values occurring in data objects are assigned scalar types. A graphical display, including user interaction with the display, is modeled by a special data type. Mappings from the scalar types into the display model type provide a simple user interface for controlling how all data types are depicted, without the need for type-specific graphics logic.&lt;&lt;ETX&gt;&gt;",William L. Hibbard;Charles R. Dyer;Brian E. Paul,W. Hibbard;C.R. Dyer;B. Paul,"Wisconsin Univ., Madison, WI, USA;Wisconsin Univ., Madison, WI, USA;Wisconsin Univ., Madison, WI, USA",,,35,15,9,
Vis,1993,Visualization of time-dependent flow fields,10.1109/VISUAL.1993.398848,http://dx.doi.org/10.1109/VISUAL.1993.398848,32,38,C,"Presently, there are very few visualization systems available for time-dependent flow fields. Although existing visualization systems for instantaneous flow fields may be used to view time-dependent flow fields at discrete points in time, the time variable is usually not considered in the visualization technique. We present a simple and effective approach for visualizing time-dependent flow fields using streaklines. A system was developed to demonstrate this approach. The system can process many time frames of flow fields without requiring that all the data be in memory simultaneously, and it also handles flow fields with moving grids. We have used the system to visualize streaklines from several large 3-D time-dependent flow fields with moving grids. The system was able to provide useful insights to the physical phenomena in the flow fields.&lt;&lt;ETX&gt;&gt;",David A. Lane,D.A. Lane,"NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1992.235211;10.1109/VISUAL.1990.146360;10.1109/VISUAL.1992.235212;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1991.175789,,35,17,20,
Vis,1995,A hardware acceleration method for volumetric ray tracing,10.1109/VISUAL.1995.480792,http://dx.doi.org/10.1109/VISUAL.1995.480792,27,"34, 435",C,"We present an acceleration method for volumetric ray tracing which utilizes standard graphics hardware without compromising image accuracy. The graphics hardware is employed to identify those segments of each ray that could possibly contribute to the final image. A volumetric ray tracing algorithm is then used to compute the final image, traversing only the identified segments of the rays. This technique can be used to render volumetric isosurfaces as well as translucent volumes. In addition, this method can accelerate the traversal of shadow rays when performing recursive ray tracing.",Lisa M. Sobierajski;Ricardo S. Avila,L.M. Sobierajski;R.S. Avila,"Corp. Res. & Dev., Gen. Electr. Co., Schenectady, NY, USA;Corp. Res. & Dev., Gen. Electr. Co., Schenectady, NY, USA",10.1109/VISUAL.1994.346320;10.1109/VISUAL.1995.485154;10.1109/VISUAL.1990.146391;10.1109/VISUAL.1993.398854;10.1109/VISUAL.1994.346340;10.1109/VISUAL.1992.235231,,35,18,14,
Vis,1995,IFS fractal interpolation for 2D and 3D visualization,10.1109/VISUAL.1995.480798,http://dx.doi.org/10.1109/VISUAL.1995.480798,77,"84, 441",C,"Reconstruction is used frequently in visualization of one, two, and three dimensional data. Data uncertainty is typically ignored, and a deficiency of many interpolation schemes is smoothing which may indicate features or characteristics of the data that are not there. The author investigates the use of iterated function systems (IFS's) for interpolation. He shows new derivations for fractal interpolation in two and three dimensional scalar data, and new point and polytope rendering algorithms with tremendous speed advantages over ray tracing. The interpolations may be used to give an indication of the uncertainty of the data, statistically represent the data at a variety of scales, allow tunability from the data, and may allow more accurate data analysis.",Craig M. Wittenbrink,C.M. Wittenbrink,"Baskin Center for Comput. Eng. & Inf. Sci., California Univ., Santa Cruz, CA, USA",,,35,18,20,
Vis,1995,Interval volume: a solid fitting technique for volumetric data display and analysis,10.1109/VISUAL.1995.480807,http://dx.doi.org/10.1109/VISUAL.1995.480807,151,"158, 448",C,"Proposes as a generalization of isosurfaces, the 'interval volume', which is a new type of geometric model representing 3D subvolumes with field values belonging to a closed interval. A dominant surface fitting algorithm called 'marching cubes' is extended to obtain a solid fitting algorithm, which extracts from a given volumetric dataset a high-resolution polyhedral solid data structure of the interval volume. Rendering methods for the interval volume and principal related operations are also presented. The effectiveness of this approach is illustrated with 4D simulated data from atomic collision research.",Issei Fujishiro;Yuji Maeda;Hiroshi Sato,I. Fujishiro;Y. Maeda;H. Sato,"Dept. of Inf. Sci., Ochanomizu Univ., Tokyo, Japan",10.1109/VISUAL.1991.175782;10.1109/VISUAL.1992.235223,"Volume visualization, surface fitting, isosurface, Marching cubes, atomic collision",35,20,17,
Vis,1996,Opacity-modulating triangular textures for irregular surfaces,10.1109/VISUAL.1996.568111,http://dx.doi.org/10.1109/VISUAL.1996.568111,219,225,C,"Many scientific and medical visualization techniques produce irregular surfaces whose shape and structure need to be understood. Examples include tissue and tumor boundaries in medical imaging, molecular surfaces and force thresholds in chemical and pharmaceutical applications, and isosurfaces in a wide range of 3D domains. The 3D shape of such surfaces can be particularly difficult to interpret because of the unfamiliar, irregular shapes, the potential concavities and bulges, and the lack of parallel lines and right angles to provide perspective depth cues. Attempts to display multiple irregular surfaces by making some or all of them transparent further complicates the problem. Texture can provide valuable cues to aid in the interpretation of irregular surfaces. Opacity-modulating textures offer a mechanism for the display of multiple surfaces without the extreme loss of clarity of multiple transparent surfaces. This paper presents a method for creating simple repeating textures and mapping them onto irregular surfaces.",Penny Rheingans,P. Rheingans,"Dept. of Comput. Sci., Mississippi Univ., MS, USA",10.1109/VISUAL.1990.146395;10.1109/VISUAL.1995.480795,,35,15,15,
InfoVis,1997,Metrics for effective information visualization,10.1109/INFVIS.1997.636794,http://dx.doi.org/10.1109/INFVIS.1997.636794,108,111,C,"Metrics for information visualization will help designers create and evaluate 3D information visualizations. Based on experience from 60+ 3D information visualizations, the metrics we propose are: number of data points and data density; number of dimensions and cognitive overhead; occlusion percentage; and reference context and percentage of identifiable points.",Richard Brath,R. Brath,"Visible Decision Inc., Toronto, Ont., Canada",10.1109/INFVIS.1996.559213;10.1109/INFVIS.1995.528682;10.1109/INFVIS.1996.559211,,35,5,0,
Vis,2001,Visualizing 2D probability distributions from EOS satellite image-derived data sets: a case study,10.1109/VISUAL.2001.964550,http://dx.doi.org/10.1109/VISUAL.2001.964550,457,460,C,"Maps of biophysical and geophysical variables using Earth Observing System (EOS) satellite image data are an important component of Earth science. These maps have a single value derived at every grid cell and standard techniques are used to visualize them. Current tools fall short, however, when it is necessary to describe a distribution of values at each grid cell. Distributions may represent a frequency of occurrence over time, frequency of occurrence from multiple runs of an ensemble forecast or possible values from an uncertainty model. We identify these ""distribution data sets"" and present a case study to visualize such 2D distributions. Distribution data sets are different from multivariate data sets in the sense that the values are for a single variable instead of multiple variables. Data for this case study consists of multiple realizations of percent forest cover, generated using a geostatistical technique that combines ground measurements and satellite imagery to model uncertainty about forest cover. We present two general approaches for analyzing and visualizing such data sets. The first is a pixel-wise analysis of the probability density functions for the 2D image while the second is an analysis of features identified within the image. Such pixel-wise and feature-wise views will give Earth scientists a more complete understanding of distribution data sets. See www.cse.ucsc.edu/research/avis/nasa is for additional information.",David L. Kao;Jennifer L. Dungan;Alex T. Pang,D. Kao;J.L. Dungan;A. Pang,"NASA Ames Res. Center, Moffett Field, CA, USA;NASA Ames Res. Center, Moffett Field, CA, USA",,"uncertainty, probability density function, geostatistics, conditional simulation, data assimilation",35,20,15,
Vis,2003,Visibility culling using plenoptic opacity functions for large volume visualization,10.1109/VISUAL.2003.1250391,http://dx.doi.org/10.1109/VISUAL.2003.1250391,341,348,C,"Visibility culling has the potential to accelerate large data visualization in significant ways. Unfortunately, existing algorithms do not scale well when parallelized, and require full re-computation whenever the opacity transfer function is modified. To address these issues, we have designed a Plenoptic Opacity Function (POF) scheme to encode the view-dependent opacity of a volume block. POFs are computed off-line during a pre-processing stage, only once for each block. We show that using POFs is (i) an efficient, conservative and effective way to encode the opacity variations of a volume block for a range of views, (ii) flexible for re-use by a family of opacity transfer functions without the need for additional off-line processing, and (iii) highly scalable for use in massively parallel implementations. Our results confirm the efficacy of POFs for visibility culling in large-scale parallel volume rendering; we can interactively render the Visible Woman dataset using software ray-casting on 32 processors, with interactive modification of the opacity transfer function on-the-fly.",Jinzhu Gao;Jian Huang 0007;Han-Wei Shen;James Arthur Kohl,Jinzhu Gao;Jian Huang;Han-Wei Shen;J.A. Kohl,"Ohio State Univ., USA",10.1109/VISUAL.2002.1183757;10.1109/VISUAL.2002.1183784;10.1109/VISUAL.1998.745713;10.1109/VISUAL.2001.964519;10.1109/VISUAL.1998.745300;10.1109/VISUAL.2001.964515;10.1109/VISUAL.2000.885698,"visibility culling, volume rendering, plenoptic opacity function, large data visualization",35,5,27,
Vis,2004,Hardware-accelerated adaptive EWA volume splatting,10.1109/VISUAL.2004.38,http://dx.doi.org/10.1109/VISUAL.2004.38,67,74,C,We present a hardware-accelerated adaptive EWA (elliptical weighted average) volume splatting algorithm. EWA splatting combines a Gaussian reconstruction kernel with a low-pass image filter for high image quality without aliasing artifacts or excessive blurring. We introduce a novel adaptive filtering scheme to reduce the computational cost of EWA splatting. We show how this algorithm can be efficiently implemented on modern graphics processing units (GPUs). Our implementation includes interactive classification and fast lighting. To accelerate the rendering we store splat geometry and 3D volume data locally in GPU memory. We present results for several rectilinear volume datasets that demonstrate the high image quality and interactive rendering speed of our method.,Wei Chen 0001;Ren Liu;Matthias Zwicker;Hanspeter Pfister,Wei Chen;Liu Ren;M. Zwicker;H. Pfister,"Zhejiang Univ., Hangzhou, China",10.1109/VISUAL.1993.398877;10.1109/VISUAL.1997.663882;10.1109/VISUAL.2003.1250403;10.1109/VISUAL.1998.745309;10.1109/VISUAL.1996.567608;10.1109/VISUAL.1999.809909;10.1109/VISUAL.1995.480797;10.1109/VISUAL.2001.964490;10.1109/VISUAL.2000.885698,"Direct volume rendering, volume splatting, EWA filter, hardware acceleration",35,9,35,
Vis,2004,Interactive point-based isosurface extraction,10.1109/VISUAL.2004.52,http://dx.doi.org/10.1109/VISUAL.2004.52,457,464,C,"We propose a novel point-based approach to view dependent isosurface extraction. We introduce a fast visibility query system for the view dependent traversal, which exhibits moderate memory requirements. This technique allows for an interactive interrogation of the full visible woman dataset (1GB) at four to fifteen frames per second on a desktop computer. The point-based approach is built on an extraction scheme that classifies different sections of the isosurface into four categories, depending on the size of the geometry when projected onto the screen. In particular, we use points to represent small and subpixel triangles, as well as larger sections of the isosurface whose projection has subpixel size. To assign consistent and robust normals to individual points representing such regions, we propose to compute them during post processing of the extracted isosurface and provide the corresponding hardware implementation.",Yarden Livnat;Xavier Tricoche,Y. Livnat;X. Tricoche,"Sci. Comput. & Imaging Inst., Utah Univ., Salt Lake City, UT, USA;Sci. Comput. & Imaging Inst., Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.1998.745713;10.1109/VISUAL.1998.745299;10.1109/VISUAL.1997.663895;10.1109/VISUAL.1995.480806;10.1109/VISUAL.1996.568123;10.1109/VISUAL.2002.1183810;10.1109/VISUAL.1991.175780;10.1109/VISUAL.1998.745300;10.1109/VISUAL.1994.346334,"Isosurface, point-based, view-dependent, large datasets, interactive",35,17,30,
Vis,2004,Light Collages: lighting design for effective visualization,10.1109/VISUAL.2004.62,http://dx.doi.org/10.1109/VISUAL.2004.62,281,288,C,"We introduce Light Collages - a lighting design system for effective visualization based on principles of human perception. Artists and illustrators enhance perception of features with lighting that is locally consistent and globally inconsistent. Inspired by these techniques, we design the placement of light sources to convey a greater sense of realism and better perception of shape with globally inconsistent lighting. Our algorithm segments the objects into local surface patches and uses a number of perceptual heuristics, such as highlights, shadows, and silhouettes, to enhance the perception of shape. We show our results on scientific and sculptured datasets.",Chang Ha Lee;Xuejun Hao;Amitabh Varshney,C.H. Lee;Xuejun Hao;A. Varshney,"Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA;Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA;Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA",10.1109/VISUAL.2003.1250394;10.1109/VISUAL.2003.1250392;10.1109/VISUAL.2003.1250395;10.1109/VISUAL.2002.1183785,"Lighting design, scientific illustration, inconsistent lighting, light placement, silhouette enhancement, proximity shadows",35,20,29,
Vis,2005,The application of GPU particle tracing to diffusion tensor field visualization,10.1109/VISUAL.2005.1532780,http://dx.doi.org/10.1109/VISUAL.2005.1532780,73,78,C,"In this paper we introduce GPU particle tracing for the visualization of 3D diffusion tensor fields. For about half a million particles, reconstruction of diffusion directions from the tensor field, time integration and rendering can be done at interactive rates. Different visualization options like oriented particles of diffusion-dependent shape, stream lines or stream tubes facilitate the use of particle tracing for diffusion tensor visualization. The proposed methods provide efficient and intuitive means to show the dynamics in diffusion tensor fields, and they accommodate the exploration of the diffusion properties of biological tissue.",Polina Kondratieva;Jens H. Krüger;Rüdiger Westermann,P. Kondratieva;J. Kruger;R. Westermann,"Comput. Graphics & Visualization Group, Technische Univ. Munchen, Germany;Comput. Graphics & Visualization Group, Technische Univ. Munchen, Germany;Comput. Graphics & Visualization Group, Technische Univ. Munchen, Germany",10.1109/VISUAL.1999.809886;10.1109/VISUAL.2002.1183799;10.1109/VISUAL.1992.235193;10.1109/VISUAL.1999.809894;10.1109/VISUAL.1998.745294,"Diffusion Tensors, Dynamic Visualization, GPU Particle Tracing and Streamlines, Medical Visualization",35,11,18,
Vis,2005,VolumeExplorer: roaming large volumes to couple visualization and data processing for oil and gas exploration,10.1109/VISUAL.2005.1532802,http://dx.doi.org/10.1109/VISUAL.2005.1532802,247,254,C,"In this paper, we present a volume roaming system dedicated to oil and gas exploration. Our system combines probe-based volume rendering with data processing and computing. The daily oil production and the estimation of the world proven-reserves directly affect the barrel price and have a strong impact on the economy. Among others, production and correct estimation are linked to the accuracy of the sub-surface model used for predicting oil reservoirs shape and size. Geoscientists build this model from the interpretation of seismic data, i.e. 3D images of the subsurface obtained from geophysical surveys. Our system couples visualization and data processing for the interpretation of seismic data. It is based on volume roaming along with efficient volume paging to manipulate the multi-gigabyte data sets commonly acquired during seismic surveys. Our volume rendering lenses implement high quality pre-integrated volume rendering with accurate lighting. They use a generic multi-modal volume rendering system that blends several volumes in the spirit of the ""stencil"" paradigm used in 2D painting programs. In addition, our system can interactively display non-polygonal isosurfaces painted with an attribute. Beside the visualization algorithms, automatic extraction of local features of the subsurface model also take full advantage of the volume paging.",Laurent Castanie;Bruno Lévy;Fabien Bosquet,L. Castanie;B. Levy;F. Bosquet,,10.1109/VISUAL.2004.46;10.1109/VISUAL.1997.663878;10.1109/VISUAL.2005.1532785;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2000.885683;10.1109/VISUAL.1999.809908;10.1109/VISUAL.2002.1183757;10.1109/VISUAL.1999.809889,"Oil and gas exploration, seismic interpretation, large volumes, volume bricking, out-of-core, volume roaming, paging, texture-based volume visualization, multi-modal rendering, programmable graphics hardware",35,3,36,
Vis,2006,Hub-based Simulation and Graphics Hardware Accelerated Visualization for Nanotechnology Applications,10.1109/TVCG.2006.150,http://dx.doi.org/10.1109/TVCG.2006.150,1061,1068,J,"The Network for computational nanotechnology (NCN) has developed a science gateway at nanoHUB.org for nanotechnology education and research. Remote users can browse through online seminars and courses, and launch sophisticated nanotechnology simulation tools, all within their Web browser. Simulations are supported by a middleware that can route complex jobs to grid supercomputing resources. But what is truly unique about the middleware is the way that it uses hardware accelerated graphics to support both problem setup and result visualization. This paper describes the design and integration of a remote visualization framework into the nanoHUB for interactive visual analytics of nanotechnology simulations. Our services flexibly handle a variety of nanoscience simulations, render them utilizing graphics hardware acceleration in a scalable manner, and deliver them seamlessly through the middleware to the user. Rendering is done only on-demand, as needed, so each graphics hardware unit can simultaneously support many user sessions. Additionally, a novel node distribution scheme further improves our system's scalability. Our approach is not only efficient but also cost-effective. Only half-dozen render nodes are anticipated to support hundreds of active tool sessions on the nanoHUB. Moreover, this architecture and visual analytics environment provides capabilities that can serve many areas of scientific simulation and analysis beyond nanotechnology with its ability to interactively analyze and visualize multivariate scalar and vector fields",Wei Qiao;Michael McLennan;Rick Kennell;David S. Ebert;Gerhard Klimeck,Wei Qiao;Michael McLennan;Rick Kennell;David Ebert;Gerhard Klimeck,Purdue University;Purdue University;Purdue University;Purdue University;Purdue University,10.1109/VISUAL.2002.1183758;10.1109/VISUAL.2003.1250377;10.1109/VISUAL.2005.1532795;10.1109/VISUAL.1992.235211;10.1109/VISUAL.2005.1532811;10.1109/VISUAL.2003.1250361;10.1109/VISUAL.2000.885683;10.1109/VISUAL.2005.1532794;10.1109/VISUAL.2005.1532793;10.1109/VISUAL.1994.346315;10.1109/VISUAL.2000.885689,"remote visualization, volume visualization, flow visualization, graphics hardware, nanotechnology simulation",35,27,47,
Vis,2007,A Flexible Multi-Volume Shader Framework for Arbitrarily Intersecting Multi-Resolution Datasets,10.1109/TVCG.2007.70534,http://dx.doi.org/10.1109/TVCG.2007.70534,1584,1591,J,"We present a powerful framework for 3D-texture-based rendering of multiple arbitrarily intersecting volumetric datasets. Each volume is represented by a multi-resolution octree-based structure and we use out-of-core techniques to support extremely large volumes. Users define a set of convex polyhedral volume lenses, which may be associated with one or more volumetric datasets. The volumes or the lenses can be interactively moved around while the region inside each lens is rendered using interactively defined multi-volume shaders. Our rendering pipeline splits each lens into multiple convex regions such that each region is homogenous and contains a fixed number of volumes. Each such region is further split by the brick boundaries of the associated octree representations. The resulting puzzle of lens fragments is sorted in front-to-back or back-to-front order using a combination of a view-dependent octree traversal and a GPU-based depth peeling technique. Our current implementation uses slice-based volume rendering and allows interactive roaming through multiple intersecting multi-gigabyte volumes.",John Plate;Thorsten Holtkämper;Bernd Fröhlich 0001,John Plate;Thorsten Holtkaemper;Bernd Froehlich,,10.1109/VISUAL.2003.1250406;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2002.1183762,"Multi-volume visualization, constructive solid geometry, shading, display algorithms",35,27,15,
Vis,2007,Random-Accessible Compressed Triangle Meshes,10.1109/TVCG.2007.70585,http://dx.doi.org/10.1109/TVCG.2007.70585,1536,1543,J,"With the exponential growth in size of geometric data, it is becoming increasingly important to make effective use of multilevel caches, limited disk storage, and bandwidth. As a result, recent work in the visualization community has focused either on designing sequential access compression schemes or on producing cache-coherent layouts of (uncompressed) meshes for random access. Unfortunately combining these two strategies is challenging as they fundamentally assume conflicting modes of data access. In this paper, we propose a novel order-preserving compression method that supports transparent random access to compressed triangle meshes. Our decompression method selectively fetches from disk, decodes, and caches in memory requested parts of a mesh. We also provide a general mesh access API for seamless mesh traversal and incidence queries. While the method imposes no particular mesh layout, it is especially suitable for cache-oblivious layouts, which minimize the number of decompression I/O requests and provide high cache utilization during access to decompressed, in-memory portions of the mesh. Moreover, the transparency of our scheme enables improved performance without the need for application code changes. We achieve compression rates on the order of 20:1 and significantly improved I/O performance due to reduced data transfer. To demonstrate the benefits of our method, we implement two common applications as benchmarks. By using cache-oblivious layouts for the input models, we observe 2-6 times overall speedup compared to using uncompressed meshes.",Sung-Eui Yoon;Peter Lindstrom,Sung-eui Yoon;Peter Lindstrom,Korea Advanced Institute of Science and Technology (KAIST);Lawrence Livermore National Laboratory,10.1109/VISUAL.2002.1183796;10.1109/TVCG.2006.143;10.1109/VISUAL.2005.1532800;10.1109/TVCG.2006.162;10.1109/VISUAL.2001.964532,"Mesh compression, random access, cache-coherent layouts, mesh data structures, external memory algorithms",35,24,44,
Vis,2008,Volume MLS Ray Casting,10.1109/TVCG.2008.186,http://dx.doi.org/10.1109/TVCG.2008.186,1372,1379,J,"The method of Moving Least Squares (MLS) is a popular framework for reconstructing continuous functions from scattered data due to its rich mathematical properties and well-understood theoretical foundations. This paper applies MLS to volume rendering, providing a unified mathematical framework for ray casting of scalar data stored over regular as well as irregular grids. We use the MLS reconstruction to render smooth isosurfaces and to compute accurate derivatives for high-quality shading effects. We also present a novel, adaptive preintegration scheme to improve the efficiency of the ray casting algorithm by reducing the overall number of function evaluations, and an efficient implementation of our framework exploiting modern graphics hardware. The resulting system enables high-quality volume integration and shaded isosurface rendering for regular and irregular volume data.",Christian Ledergerber;Gaël Guennebaud;Miriah D. Meyer;Moritz Bächer;Hanspeter Pfister,Christian Ledergerber;Gaël Guennebaud;Miriah Meyer;Moritz Bächer;Hanspeter Pfister,IIC at Harvard University;CNR of Pisa;IIC at Harvard University;IIC at Harvard University;IIC at Harvard University,10.1109/VISUAL.1993.398853;10.1109/VISUAL.2000.885683;10.1109/TVCG.2006.141;10.1109/VISUAL.2001.964490;10.1109/VISUAL.2003.1250414;10.1109/VISUAL.1994.346331;10.1109/VISUAL.2003.1250390,"Volume Visualization, Unstructured Grids, Moving Least Squares Reconstruction, Adaptive Integration",35,26,51,
InfoVis,2009,Towards Utilizing GPUs in Information Visualization: A Model and Implementation of Image-Space Operations,10.1109/TVCG.2009.191,http://dx.doi.org/10.1109/TVCG.2009.191,1105,1112,J,"Modern programmable GPUs represent a vast potential in terms of performance and visual flexibility for information visualization research, but surprisingly few applications even begin to utilize this potential. In this paper, we conjecture that this may be due to the mismatch between the high-level abstract data types commonly visualized in our field, and the low-level floating-point model supported by current GPU shader languages. To help remedy this situation, we present a refinement of the traditional information visualization pipeline that is amenable to implementation using GPU shaders. The refinement consists of a final image-space step in the pipeline where the multivariate data of the visualization is sampled in the resolution of the current view. To concretize the theoretical aspects of this work, we also present a visual programming environment for constructing visualization shaders using a simple drag-and-drop interface. Finally, we give some examples of the use of shaders for well-known visualization techniques.",Bryan McDonnel;Niklas Elmqvist,Bryan McDonnel;Niklas Elmqvist,"Purdue University in West Lafayette, IN;Purdue University in West Lafayette, IN",10.1109/INFVIS.2004.12;10.1109/VISUAL.2004.95;10.1109/INFVIS.2002.1173156;10.1109/VAST.2007.4389013;10.1109/TVCG.2007.70580;10.1109/INFVIS.1998.729560;10.1109/INFVIS.1997.636792,"GPU-acceleration, shader programming, interaction, high-performance visualization",35,23,40,
Vis,2009,Interactive Streak Surface Visualization on the GPU,10.1109/TVCG.2009.154,http://dx.doi.org/10.1109/TVCG.2009.154,1259,1266,J,"In this paper we present techniques for the visualization of unsteady flows using streak surfaces, which allow for the first time an adaptive integration and rendering of such surfaces in real-time. The techniques consist of two main components, which are both realized on the GPU to exploit computational and bandwidth capacities for numerical particle integration and to minimize bandwidth requirements in the rendering of the surface. In the construction stage, an adaptive surface representation is generated. Surface refinement and coarsening strategies are based on local surface properties like distortion and curvature. We compare two different methods to generate a streak surface: a) by computing a patch-based surface representation that avoids any interdependence between patches, and b) by computing a particle-based surface representation including particle connectivity, and by updating this connectivity during particle refinement and coarsening. In the rendering stage, the surface is either rendered as a set of quadrilateral surface patches using high-quality point-based approaches, or a surface triangulation is built in turn from the given particle connectivity and the resulting triangle mesh is rendered. We perform a comparative study of the proposed techniques with respect to surface quality, visual quality and performance by visualizing streak surfaces in real flows using different rendering options.",Kai Bürger;Florian Ferstl;Holger Theisel;Rüdiger Westermann,Kai Buerger;Florian Ferstl;Holger Theisel;Rüdiger Westermann,Technische Universität München;Technische Universität München;University of Magdeburg;Technische Universität München,10.1109/VISUAL.1992.235211;10.1109/VISUAL.2001.964506;10.1109/TVCG.2008.133;10.1109/VISUAL.1993.398875;10.1109/TVCG.2008.163,"Unsteady flow visualization, streak surface generation, GPUs",35,27,20,
Vis,2009,Visual Human+Machine Learning,10.1109/TVCG.2009.199,http://dx.doi.org/10.1109/TVCG.2009.199,1327,1334,J,"In this paper we describe a novel method to integrate interactive visual analysis and machine learning to support the insight generation of the user. The suggested approach combines the vast search and processing power of the computer with the superior reasoning and pattern recognition capabilities of the human user. An evolutionary search algorithm has been adapted to assist in the fuzzy logic formalization of hypotheses that aim at explaining features inside multivariate, volumetric data. Up to now, users solely rely on their knowledge and expertise when looking for explanatory theories. However, it often remains unclear whether the selected attribute ranges represent the real explanation for the feature of interest. Other selections hidden in the large number of data variables could potentially lead to similar features. Moreover, as simulation complexity grows, users are confronted with huge multidimensional data sets making it almost impossible to find meaningful hypotheses at all. We propose an interactive cycle of knowledge-based analysis and automatic hypothesis generation. Starting from initial hypotheses, created with linking and brushing, the user steers a heuristic search algorithm to look for alternative or related hypotheses. The results are analyzed in information visualization views that are linked to the volume rendering. Individual properties as well as global aggregates are visually presented to provide insight into the most relevant aspects of the generated hypotheses. This novel approach becomes computationally feasible due to a GPU implementation of the time-critical parts in the algorithm. A thorough evaluation of search times and noise sensitivity as well as a case study on data from the automotive domain substantiate the usefulness of the suggested approach.",Raphael Fuchs;Jürgen Waser;M. Eduard Gröller,Raphael Fuchs;Jürgen Waser;Meister Eduard Groller,ETH Zurich;VRVis Vienna;TU Vienna,10.1109/TVCG.2007.70615;10.1109/TVCG.2008.139;10.1109/VAST.2007.4389001;10.1109/VAST.2007.4389000,"Interactive Visual Analysis, Volumetric Data, Multiple Competing Hypotheses, Knowledge Discovery, Computerassisted Multivariate Data Exploration, Curse of Dimensionality, Predictive Analysis, Genetic Algorithm",35,27,31,
InfoVis,2012,Compressed Adjacency Matrices: Untangling Gene Regulatory Networks,10.1109/TVCG.2012.208,http://dx.doi.org/10.1109/TVCG.2012.208,2457,2466,J,"We present a novel technique-Compressed Adjacency Matrices-for visualizing gene regulatory networks. These directed networks have strong structural characteristics: out-degrees with a scale-free distribution, in-degrees bound by a low maximum, and few and small cycles. Standard visualization techniques, such as node-link diagrams and adjacency matrices, are impeded by these network characteristics. The scale-free distribution of out-degrees causes a high number of intersecting edges in node-link diagrams. Adjacency matrices become space-inefficient due to the low in-degrees and the resulting sparse network. Compressed adjacency matrices, however, exploit these structural characteristics. By cutting open and rearranging an adjacency matrix, we achieve a compact and neatly-arranged visualization. Compressed adjacency matrices allow for easy detection of subnetworks with a specific structure, so-called motifs, which provide important knowledge about gene regulatory networks to domain experts. We summarize motifs commonly referred to in the literature, and relate them to network analysis tasks common to the visualization domain. We show that a user can easily find the important motifs in compressed adjacency matrices, and that this is hard in standard adjacency matrix and node-link diagrams. We also demonstrate that interaction techniques for standard adjacency matrices can be used for our compressed variant. These techniques include rearrangement clustering, highlighting, and filtering.",Kasper Dinkla;Michel A. Westenberg;Jarke J. van Wijk,Kasper Dinkla;Michel A. Westenberg;Jarke J. van Wijk,Eindhoven University of Technology;Eindhoven University of Technology;Eindhoven University of Technology,10.1109/TVCG.2011.187;10.1109/TVCG.2006.160;10.1109/TVCG.2007.70582;10.1109/INFVIS.2004.1;10.1109/INFVIS.2005.1532126;10.1109/INFVIS.2004.46;10.1109/TVCG.2006.147;10.1109/TVCG.2008.141;10.1109/TVCG.2007.70556;10.1109/INFVIS.2004.5;10.1109/TVCG.2006.156;10.1109/TVCG.2010.159;10.1109/INFVIS.2003.1249030,"Network, gene regulation, scale-free, adjacency matrix",35,33,43,
Vis,1994,Progressive transmission of scientific data using biorthogonal wavelet transform,10.1109/VISUAL.1994.346332,http://dx.doi.org/10.1109/VISUAL.1994.346332,93,"99, C9",C,"An important issue in scientific visualization systems is the management of data sets. Most data sets in scientific visualization, whether created by measurement or simulation, are usually voluminous. The goal of data management is to reduce the storage space and the access time of these data sets to speed up the visualization process. A new progressive transmission scheme using spline biorthogonal wavelet bases is proposed in this paper. By exploiting the properties of this set of wavelet bases, a fast algorithm involving only additions and subtractions is developed. Due to the multiresolutional nature of the wavelet transform, this scheme is compatible with hierarchical-structured rendering algorithms. The formula for reconstructing the functional values in a continuous volume space is given in a simple polynomial form. Lossless compression is possible, even when using floating-point numbers. This algorithm has been applied to data from a global ocean model. The lossless compression ratio is about 1.5:1. With a compression ratio of 50:1, the reconstructed data is still of good quality. Several other wavelet bases are compared with the spline biorthogonal wavelet bases. Finally the reconstructed data is visualized using various algorithms and the results are demonstrated.&lt;&lt;ETX&gt;&gt;",Hai Tao;Robert J. Moorhead II,Hai Tao;R.J. Moorhead,"NSF Eng. Res. Center for Comput. Field Simulation, Mississippi Univ., MS, USA;NSF Eng. Res. Center for Comput. Field Simulation, Mississippi Univ., MS, USA",10.1109/VISUAL.1993.398845,,34,14,15,
Vis,1995,Interval set: a volume rendering technique generalizing isosurface extraction,10.1109/VISUAL.1995.480789,http://dx.doi.org/10.1109/VISUAL.1995.480789,3,"10, 342",C,"A scalar volume V={(x,f(x))|x/spl isin/R} is described by a function f(x) defined over some region R of the three dimensional space. The paper presents a simple technique for rendering interval sets of the form I/sub g/(a,b)={(x,f(x))|a/spl les/g(x)/spl les/b}, where a and b are either real numbers of infinities. We describe an algorithm for triangulating interval sets as /spl alpha/ shapes, which can be accurately and efficiently rendered as surfaces or semi transparent clouds. On the theoretical side, interval sets provide an unified approach to isosurface extraction and direct volume rendering. On the practical side, interval sets add flexibility to scalar volume visualization-we may choose to, for example, have an interactive, high quality display of the volume surrounding or ""inside"" an isosurface when such display for the entire volume is too expensive to produce.",Baining Guo,Baining Guo,"Dept. of Comput. Sci., Toronto Univ., Ont., Canada",,,34,16,22,
Vis,1996,Fast stereo volume rendering,10.1109/VISUAL.1996.567603,http://dx.doi.org/10.1109/VISUAL.1996.567603,49,56,C,"We present new volume rendering techniques for efficiently generating high-quality stereoscopic images and propose criteria to evaluate stereo volume rendering algorithms. Specifically, we present fast stereo volume ray casting algorithms using segment composition and linearly-interpolated re-projection. A fast stereo shear-warp volume rendering algorithm is also presented and discussed.",Taosong He;Arie E. Kaufman,T. He;A. Kaufman,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1994.346340,,34,10,17,
Vis,1996,Complex-valued contour meshing,10.1109/VISUAL.1996.568103,http://dx.doi.org/10.1109/VISUAL.1996.568103,173,180,C,"An isovalue contour of a function of two complex variables defines a surface in four-space. We present a robust technique for creating polygonal contours of complex-valued functions. The technique, contour meshing, generalizes well to larger dimensions.",Chris Weigle;David C. Banks,C. Weigle;D.C. Banks,"Dept. of Comput. Sci., Mississippi State Univ., MS, USA",10.1109/VISUAL.1993.398869;10.1109/VISUAL.1991.175782,,34,21,15,
Vis,1997,Multiresolution compression and reconstruction,10.1109/VISUAL.1997.663901,http://dx.doi.org/10.1109/VISUAL.1997.663901,337,346,C,"The paper presents a framework for multiresolution compression and geometric reconstruction of arbitrarily dimensioned data designed for distributed applications. Although being restricted to uniform sampled data, the versatile approach enables the handling of a large variety of real world elements. Examples include nonparametric, parametric and implicit lines, surfaces or volumes, all of which are common to large scale data sets. The framework is based on two fundamental steps: compression is carried out by a remote server and generates a bit-stream transmitted over the underlying network. Geometric reconstruction is performed by the local client and renders a piecewise linear approximation of the data. More precisely, the compression scheme consists of a newly developed pipeline starting from an initial B-spline wavelet precoding. The fundamental properties of wavelets allow progressive transmission and interactive control of the compression gain by means of global and local oracles. In particular the authors discuss the problem of oracles in semiorthogonal settings and propose sophisticated oracles to remove unimportant coefficients. In addition, geometric constraints such as boundary lines can be compressed in a lossless manner and are incorporated into the resulting bit-stream. The reconstruction pipeline performs a piecewise adaptive linear approximation of data using a fast and easy to use point removal strategy which works with any subsequent triangulation technique.",Oliver G. Staadt;Markus H. Gross;Roger Weber,O.G. Staadt;M.H. Gross;R. Weber,"Dept. of Comput. Sci., Eidgenossische Tech. Hochschule, Zurich, Switzerland",,"wavelets, isosurfaces, volumes, triangulation, tetrahedralization, meshing, oracles",34,10,24,
Vis,1998,Pixel masks for screen-door transparency,10.1109/VISUAL.1998.745323,http://dx.doi.org/10.1109/VISUAL.1998.745323,351,358,C,"Rendering objects transparently gives additional insight in complex and overlapping structures. However, traditional techniques for the rendering of transparent objects such as alpha blending are not very well suited for the rendering of multiple transparent objects in dynamic scenes. Screen door transparency is a technique to render transparent objects in a simple and efficient way: no sorting is required and intersecting polygons can be handled without further preprocessing. With this technique, polygons are rendered through a mask: only where the mask is present, pixels are set. However, artifacts such as incorrect opacities and distracting patterns can easily occur if the masks are not carefully designed. The requirements on the masks are considered. Next, three algorithms are presented for the generation of pixel masks. One algorithm is designed for the creation of small (e.g. 4/spl times/4) masks. The other two algorithms can be used for the creation of larger masks (e.g. 32/spl times/32). For each of these algorithms, results are presented and discussed.",Jurriaan D. Mulder;Frans C. A. Groen;Jarke J. van Wijk,J.D. Mulder;F.C.A. Groen;J.J. van Wijk,"Center for Math. & Comput. Sci., CWI, Amsterdam, Netherlands",10.1109/VISUAL.1990.146361,Screen-Door Transparency,34,5,11,
InfoVis,1999,Visualizing application behavior on superscalar processors,10.1109/INFVIS.1999.801852,http://dx.doi.org/10.1109/INFVIS.1999.801852,10,"17, 141",C,"The advent of superscalar processors with out-of-order execution makes it increasingly difficult to determine how well an application is utilizing the processor and how to adapt the application to improve its performance. We describe a visualization system for the analysis of application behavior on superscalar processors. Our system provides an overview-plus-detail display of the application's execution. A timeline view of pipeline performance data shows the overall utilization of the pipeline. This information is displayed using multiple time scales, enabling the user to drill down from a high-level application overview to a focus region of hundreds of cycles. This region of interest is displayed in detail using an animated cycle-by-cycle view of the execution. This view shows how instructions are reordered and executed and how functional units are being utilized. Additional context views correlate instuctions in this detailed view with the relevant source code for the application. This allows the user to discover the root cause of the poor pipeline utilization and make changes to the application to improve its performance. This visualization system can be easily configured to display a variety of processor models and configurations. We demonstrate it for both the MXS and MMIX processor models.",Chris Stolte;Robert Bosch;Pat Hanrahan;Mendel Rosenblum,C. Stolte;R. Bosch;P. Hanrahan;M. Rosenblum,"Dept. of Comput. Sci., Stanford Univ., CA, USA",,"Computer systems visualization, visualization systems, superscalar processors",34,10,15,
Vis,1999,Implant sprays: compression of progressive tetrahedral mesh connectivity,10.1109/VISUAL.1999.809901,http://dx.doi.org/10.1109/VISUAL.1999.809901,299,305,C,"Irregular tetrahedral meshes, which are popular in many engineering and scientific applications, often contain a large number of vertices. A mesh of V vertices and T tetrahedra requires 48 V bits or less to store the vertex coordinates, 4/spl middot/T/spl middot/log/sub 2/(V) bits to store the tetrahedra-vertex incidence relations, also called connectivity information, and kV bits to store the k-bit value samples associated with the vertices. Given that T is 5 to 7 times larger than V and that V often exceeds 32/sup 3/, the storage space required for the connectivity is larger than 300 V bits and thus dominates the overall storage cost. Our ""implants spray"" compression approach introduced in the paper reduces this cost to about 30 V bits or less-a 10:1 compression ratio. Furthermore, implant spray supports the progressive refinement of a crude model through a series of vertex-splits operations.",Renato Pajarola;Jarek Rossignac;Andrzej Szymczak,R. Pajarola;J. Rossignac;A. Szymczak,"Graphics, Visualization & Usability Center, Georgia Inst. of Technol., Atlanta, GA, USA",10.1109/VISUAL.1998.745315;10.1109/VISUAL.1998.745329,"tetrahedral meshes, compression, multiresolution models, progressive incremental reconstruction",34,13,17,
Vis,1999,Real-time visualization of scalably large collections of heterogeneous objects,10.1109/VISUAL.1999.809924,http://dx.doi.org/10.1109/VISUAL.1999.809924,437,558,C,"This paper presents results for real-time visualization of out-of-core collections of 3D objects. This is a significant extension of previous methods and shows the generality of hierarchical paging procedures applied both to global terrain and any objects that reside on it. Applied to buildings, the procedure shows the effectiveness of using a screen-based paging and display criterion within a hierarchical framework. The results demonstrate that the method is scalable since it is able to handle multiple collections of buildings (e.g., cities) placed around the earth with full interactivity and without extensive memory load. Further the method shows efficient handling of culling and is applicable to larger, extended collections of buildings. Finally, the method shows that levels of detail can be incorporated to provide improved detail management.",Douglass Davis;William Ribarsky;Tian-Yue Jiang;Nickolas Faust;Sean Ho,D. Davis;W. Ribarsky;T.Y. Jiang;N. Fanst;S. Ho,"GVU Center, Georgia Inst. of Technol., Atlanta, GA, USA",10.1109/VISUAL.1998.745342;10.1109/VISUAL.1997.663888;10.1109/VISUAL.1998.745299,,34,10,10,
Vis,1999,Visualizing large-scale telecommunication networks and services,10.1109/VISUAL.1999.809930,http://dx.doi.org/10.1109/VISUAL.1999.809930,457,461,C,"Visual exploration of massive datasets arising from telecommunication networks and services is a challenge. This paper describes SWIFT-3D, an integrated data visualization and exploration system created at AT&amp;T Labs for large scale network analysis. SWIFT-3D integrates a collection of interactive tools that includes pixel-oriented 2D maps, interactive 3D maps, statistical displays, network topology diagrams and an interactive drill-down query interface. Example applications are described, demonstrating a successful application to analyze unexpected network events (high volumes of unanswered calls), and comparison of usage of an Internet service with voice network traffic and local access coverage.",Eleftherios Koutsofios;Stephen C. North;Russell Truscott;Daniel A. Keim,E.E. Koutsofios;S.C. North;R. Truscott;D.A. Keim,"Inf. Visualization Res., AT&T Labs., Florham Park, NJ, USA",10.1109/VISUAL.1998.745301;10.1109/INFVIS.1995.528688;10.1109/VISUAL.1991.175794,,34,18,7,
Vis,2003,Interactive view-dependent rendering with conservative occlusion culling in complex environments,10.1109/VISUAL.2003.1250368,http://dx.doi.org/10.1109/VISUAL.2003.1250368,163,170,C,"This paper presents an algorithm combining view-dependent rendering and conservative occlusion culling for interactive display of complex environments. A vertex hierarchy of the entire scene is decomposed into a cluster hierarchy through a novel clustering and partitioning algorithm. The cluster hierarchy is then used for view-frustum and occlusion culling. Using hardware accelerated occlusion queries and frame-to-frame coherence, a potentially visible set of clusters is computed. An active vertex front and face list is computed from the visible clusters and rendered using vertex arrays. The integrated algorithm has been implemented on a Pentium IV PC with a NVIDIA GeForce 4 graphics card and applied in two complex environments composed of millions of triangles. The resulting system can render these environments at interactive rates with little loss in image quality and minimal popping artifacts.",Sung-Eui Yoon;Brian Salomon;Dinesh Manocha,Sung-Eui Yoon;B. Salomon;D. Manocha,"North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.2002.1183760;10.1109/VISUAL.2001.964534;10.1109/VISUAL.2002.1183796,"Interactive Display, View-Dependent Rendering, Occlusion Culling, Level of Detail, Multiresolution Hierarchies",34,5,40,
Vis,2004,Interactive exploration of large remote micro-CT scans,10.1109/VISUAL.2004.51,http://dx.doi.org/10.1109/VISUAL.2004.51,345,352,C,"Datasets of tens of gigabytes are becoming common in computational and experimental science. This development is driven by advances in imaging technology, producing detectors with growing resolutions, as well as availability of cheap processing power and memory capacity in commodity-based computing clusters. We describe the design of a visualization system that allows scientists to interactively explore large remote data sets in an efficient and flexible way. The system is broadly applicable and currently used by medical scientists conducting an osteoporosis research project. Human vertebral bodies are scanned using a high resolution microCT scanner producing scans of roughly 8 GB size each. All participating research groups require access to the centrally stored data. Due to the rich internal bone structure, scientists need to interactively explore the full dataset at coarse levels, as well as visualize subvolumes of interest at the highest resolution. Our solution is based on HDF5 and GridFTP. When accessing data remotely, the HDF5 data processing pipeline is modified to support efficient retrieval of subvolumes. We reduce the overall latency and optimize throughput by executing high-level operations on the remote side. The GridFTP protocol is used to pass the HDF5 requests to a customized server. The approach takes full advantage of local graphics hardware for rendering. Interactive visualization is accomplished using a background thread to access the datasets stored in a multiresolution format. A hierarchical volume tenderer provides seamless integration of high resolution details with low resolution overviews.",Steffen Prohaska;Andrei Hutanu;Ralf Kähler;Hans-Christian Hege,S. Prohaska;A. Hutanu;R. Kahler;H.-C. Hege,"Sci. Visualization Dept., Zuse Inst. Berlin, Germany;Sci. Visualization Dept., Zuse Inst. Berlin, Germany;Sci. Visualization Dept., Zuse Inst. Berlin, Germany;Sci. Visualization Dept., Zuse Inst. Berlin, Germany",10.1109/VISUAL.2000.885729;10.1109/VISUAL.2002.1183758;10.1109/VISUAL.2002.1183757;10.1109/VISUAL.1999.809891;10.1109/VISUAL.2002.1183764;10.1109/VISUAL.1999.809908;10.1109/VISUAL.1997.663888,"large data, out-of-core-methods, remote visualization, multiresolution visualization",34,12,38,
Vis,2004,Interactive terascale particle visualization,10.1109/VISUAL.2004.55,http://dx.doi.org/10.1109/VISUAL.2004.55,353,360,C,"This work describes the methods used to produce an interactive visualization of a 2 TB computational fluid dynamics (CFD) data set using particle tracing (streaklines). We use the method introduced by Bruckschen el al. (2001) that precomputes a large number of particles, stores them on disk using a space-filling curve ordering that minimizes seeks, then retrieves and displays the particles according to the user's command. We describe how the particle computation can be performed using a PC cluster, how the algorithm can be adapted to work with a multiblock curvilinear mesh, how scalars can be extracted and used to color the particles, and how the out-of-core visualization can be scaled to 293 billion particles while still achieving interactive performance on PC hardware. Compared to the earlier work, our data set size and total number of particles are an order of magnitude larger. We also describe a new compression technique that losslessly reduces the amount of particle storage by 41% and speeds the particle retrieval by about 20%.",David Ellsworth;Bryan Green;Patrick J. Moran,D. Ellsworth;B. Green;P. Moran,"NASA Ames Res. Center, Moffett Field, CA, USA;NASA Ames Res. Center, Moffett Field, CA, USA;NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.2003.1250375;10.1109/VISUAL.1998.745299;10.1109/VISUAL.1997.663888;10.1109/VISUAL.2003.1250420;10.1109/VISUAL.1994.346311;10.1109/VISUAL.1998.745343;10.1109/VISUAL.1995.480821,"visualization, particle tracing, large data, out-of-core, PC hardware, clusters, computational fluid dynamics",34,19,14,
InfoVis,2005,Temporal visualization of planning polygons for efficient partitioning of geo-spatial data,10.1109/INFVIS.2005.1532149,http://dx.doi.org/10.1109/INFVIS.2005.1532149,211,218,C,"Partitioning of geo-spatial data for efficient allocation of resources such as schools and emergency health care services is driven by a need to provide better and more effective services. Partitioning of spatial data is a complex process that depends on numerous factors such as population, costs incurred in deploying or utilizing resources and target capacity of a resource. Moreover, complex data such as population distributions are dynamic i.e. they may change over time. Simple animation may not effectively show temporal changes in spatial data. We propose the use of three temporal visualization techniques -wedges, rings and time slices - to display the nature of change in temporal data in a single view. Along with maximizing resource utilization and minimizing utilization costs, a partition should also ensure the long term effectiveness of the plan. We use multi-attribute visualization techniques to highlight the strengths and identify the weaknesses of a partition. Comparative visualization techniques allow multiple partitions to be viewed simultaneously. Users can make informed decisions about how to partition geo spatial data by using a combination of our techniques for multi-attribute visualization, temporal visualization and comparative visualization.",Poonam Shanbhag;Penny Rheingans;Marie desJardins,Poonam Shanbhag;P. Rheingans;M. desJardins,"Maryland Univ., Baltimore, MD, USA;Maryland Univ., Baltimore, MD, USA;Maryland Univ., Baltimore, MD, USA",10.1109/INFVIS.2001.963273;10.1109/INFVIS.2001.963274,"Temporal visualization, time-dependent attributes, spatial data, multi-attribute visualization, resource allocation",34,5,14,
VAST,2006,Collaborative Visual Analytics: Inferring from the Spatial Organization and Collaborative Use of Information,10.1109/VAST.2006.261415,http://dx.doi.org/10.1109/VAST.2006.261415,137,144,C,"We introduce a visual analytics environment for the support of remote-collaborative sense-making activities. Team members use their individual graphical interfaces to collect, organize and comprehend task-relevant information relative to their areas of expertise. A system of computational agents infers possible relationships among information items through the analysis of the spatial and temporal organization and collaborative use of information. The computational agents support the exchange of information among team members to converge their individual contributions. Our system allows users to navigate vast amounts of shared information effectively and remotely dispersed team members to work independently without diverting from common objectives as well as to minimize the necessary amount of verbal communication",Paul E. Keel,Paul E. Keel,"Massachusetts Institute of Technology, Computer Science and Artificial Intelligence Laboratory, e-mail: keel@mit.edu",,"Visual analytics, Spatial information organization,Indirect human computer interaction,Indirect collaboration, Agents,Sense-making",34,17,23,
VAST,2007,SpiralView: Towards Security Policies Assessment through Visual Correlation of Network Resources with Evolution of Alarms,10.1109/VAST.2007.4389007,http://dx.doi.org/10.1109/VAST.2007.4389007,139,146,C,"This article presents SpiralView, a visualization tool for helping system administrators to assess network policies. The tool is meant to be a complementary support to the routine activity of network monitoring, enabling a retrospective view on the alarms generated during and extended period of time. The tool permits to reason about how alarms distribute over time and how they correlate with network resources (e.g., users, IPs, applications, etc.), supporting the analysts in understanding how the network evolves and thus in devising new security policies for the future. The spiral visualization plots alarms in time, and, coupled with interactive bar charts and a users/applications graph view, is used to present network data and perform queries. The user is able to segment the data in meaningful subsets, zoom on specific related information, and inspect for relationships between alarms, users, and applications. In designing the visualizations and their interaction, and through tests with security experts, several ameliorations over the standard techniques have been provided.",Enrico Bertini;Patrick Hertzog;Denis Lalanne,Enrico Bertini;Patrick Hertzog;Denis Lalanne,University of Fribourg. enrico.bertini@unifr.ch;NEXThink S.A. patrick.hertzog@nexthink.com;University of Fribourg. denis.lalanne@unifr.ch,10.1109/INFVIS.2001.963273;10.1109/INFVIS.2001.963279;10.1109/INFVIS.2003.1249020,"Network security, Intrusion Detection, Visualization, Data Exploration",34,21,25,
Vis,2007,Lattice-Based Volumetric Global Illumination,10.1109/TVCG.2007.70573,http://dx.doi.org/10.1109/TVCG.2007.70573,1576,1583,J,"We describe a novel volumetric global illumination framework based on the face-centered cubic (FCC) lattice. An FCC lattice has important advantages over a Cartesian lattice. It has higher packing density in the frequency domain, which translates to better sampling efficiency. Furthermore, it has the maximal possible kissing number (equivalent to the number of nearest neighbors of each site), which provides optimal 3D angular discretization among all lattices. We employ a new two-pass (illumination and rendering) global illumination scheme on an FCC lattice. This scheme exploits the angular discretization to greatly simplify the computation in multiple scattering and to minimize illumination information storage. The GPU has been utilized to further accelerate the rendering stage. We demonstrate our new framework with participating media and volume rendering with multiple scattering, where both are significantly faster than traditional techniques with comparable quality.",Feng Qiu;Fang Xu;Zhe Fan;Neophytos Neophytou;Arie E. Kaufman;Klaus Mueller,Feng Qiu;Fang Xu;Zhe Fan;Neophytou Neophytos;Arie Kaufman;Klaus Mueller,"Department of Computer Science, Stony Brook University, Stony Brook, NY 11794-4400;Department of Computer Science, Stony Brook University, Stony Brook, NY 11794-4400;Department of Computer Science, Stony Brook University, Stony Brook, NY 11794-4400;Department of Computer Science, Stony Brook University, Stony Brook, NY 11794-4400;Department of Computer Science, Stony Brook University, Stony Brook, NY 11794-4400;Department of Computer Science, Stony Brook University, Stony Brook, NY 11794-4400",10.1109/VISUAL.2004.65;10.1109/VISUAL.2001.964498;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2005.1532811,"Volume visualization, volume rendering, participating media, lattice, FCC lattice, sampling, multiple scattering, GPU",34,24,29,
Vis,2007,Molecular Surface Abstraction,10.1109/TVCG.2007.70578,http://dx.doi.org/10.1109/TVCG.2007.70578,1608,1615,J,"In this paper we introduce a visualization technique that provides an abstracted view of the shape and spatio-physico-chemical properties of complex molecules. Unlike existing molecular viewing methods, our approach suppresses small details to facilitate rapid comprehension, yet marks the location of significant features so they remain visible. Our approach uses a combination of filters and mesh restructuring to generate a simplified representation that conveys the overall shape and spatio-physico-chemical properties (e.g. electrostatic charge). Surface markings are then used in the place of important removed details, as well as to supply additional information. These simplified representations are amenable to display using stylized rendering algorithms to further enhance comprehension. Our initial experience suggests that our approach is particularly useful in browsing collections of large molecules and in readily making comparisons between them.",Gregory Cipriano;Michael Gleicher,Gregory Cipriano;Michael Gleicher,"Department of Computer Sciences, University of Wisconsin, Madison;Department of Computer Sciences, University of Wisconsin, Madison",10.1109/VISUAL.1993.398882;10.1109/VISUAL.2002.1183769;10.1109/VISUAL.2005.1532822;10.1109/VISUAL.2002.1183780;10.1109/VISUAL.2004.62;10.1109/TVCG.2006.115,"molecular surfaces, molecular visualization, surfaces, textures, cartographic labeling",34,26,39,
Vis,2009,Visual Exploration of Climate Variability Changes Using Wavelet Analysis,10.1109/TVCG.2009.197,http://dx.doi.org/10.1109/TVCG.2009.197,1375,1382,J,"Due to its nonlinear nature, the climate system shows quite high natural variability on different time scales, including multiyear oscillations such as the El Nino southern oscillation phenomenon. Beside a shift of the mean states and of extreme values of climate variables, climate change may also change the frequency or the spatial patterns of these natural climate variations. Wavelet analysis is a well established tool to investigate variability in the frequency domain. However, due to the size and complexity of the analysis results, only few time series are commonly analyzed concurrently. In this paper we will explore different techniques to visually assist the user in the analysis of variability and variability changes to allow for a holistic analysis of a global climate model data set consisting of several variables and extending over 250 years. Our new framework and data from the IPCC AR4 simulations with the coupled climate model ECHAM5/MPI-OM are used to explore the temporal evolution of El Nino due to climate change.",Heike Leitte;Michael Böttinger;Uwe Mikolajewicz;Gerik Scheuermann,Heike Janicke;Michael Bottinger;Uwe Mikolajewicz;Gerik Scheuermann,University of Leipzig;German Climate Computing Center (DKRZ);Max Planck Institute for Meteorology (MPI-M);University of Leipzig,10.1109/TVCG.2008.116;10.1109/VISUAL.2003.1250383;10.1109/VISUAL.1997.663871,"Wavelet analysis, multivariate data, time-dependent data, climate variability change visualization, El Nino",34,32,33,
InfoVis,2010,Rethinking Map Legends with Visualization,10.1109/TVCG.2010.191,http://dx.doi.org/10.1109/TVCG.2010.191,890,899,J,"This design paper presents new guidance for creating map legends in a dynamic environment. Our contribution is a set ofguidelines for legend design in a visualization context and a series of illustrative themes through which they may be expressed. Theseare demonstrated in an applications context through interactive software prototypes. The guidelines are derived from cartographicliterature and in liaison with EDINA who provide digital mapping services for UK tertiary education. They enhance approaches tolegend design that have evolved for static media with visualization by considering: selection, layout, symbols, position, dynamismand design and process. Broad visualization legend themes include: The Ground Truth Legend, The Legend as Statistical Graphicand The Map is the Legend. Together, these concepts enable us to augment legends with dynamic properties that address specificneeds, rethink their nature and role and contribute to a wider re-evaluation of maps as artifacts of usage rather than statements offact. EDINA has acquired funding to enhance their clients with visualization legends that use these concepts as a consequence ofthis work. The guidance applies to the design of a wide range of legends and keys used in cartography and information visualization.",Jason Dykes;Jo Wood;Aidan Slingsby,Jason Dykes;Jo Wood;Aidan Slingsby,,10.1109/TVCG.2007.70561;10.1109/TVCG.2008.165;10.1109/TVCG.2007.70539;10.1109/TVCG.2006.202;10.1109/INFVIS.2000.885095;10.1109/TVCG.2007.70589;10.1109/TVCG.2009.128,"Cartography, design, Digimap service, legend, online web mapping, visualization",34,23,62,HM
Vis,2010,Interactive Vector field Feature Identification,10.1109/TVCG.2010.170,http://dx.doi.org/10.1109/TVCG.2010.170,1560,1568,J,"We introduce a flexible technique for interactive exploration of vector field data through classification derived from user-specified feature templates. Our method is founded on the observation that, while similar features within the vector field may be spatially disparate, they share similar neighborhood characteristics. Users generate feature-based visualizations by interactively highlighting well-accepted and domain specific representative feature points. Feature exploration begins with the computation of attributes that describe the neighborhood of each sample within the input vector field. Compilation of these attributes forms a representation of the vector field samples in the attribute space. We project the attribute points onto the canonical 2D plane to enable interactive exploration of the vector field using a painting interface. The projection encodes the similarities between vector field points within the distances computed between their associated attribute points. The proposed method is performed at interactive rates for enhanced user experience and is completely flexible as showcased by the simultaneous identification of diverse feature types.",Joel Daniels II;Erik W. Anderson;Luis Gustavo Nonato;Cláudio T. Silva,Joel Daniels II;Erik W. Anderson;Luis Gustavo Nonato;Claudio T. Silva,,10.1109/TVCG.2009.138;10.1109/VISUAL.1993.398846;10.1109/TVCG.2007.70579;10.1109/VISUAL.1991.175794;10.1109/VISUAL.1998.745333;10.1109/VISUAL.1992.235211;10.1109/TVCG.2008.116;10.1109/TVCG.2009.190;10.1109/VISUAL.1999.809917;10.1109/VISUAL.1997.663910;10.1109/VISUAL.1998.745296;10.1109/VISUAL.1991.175771;10.1109/VISUAL.2000.885690;10.1109/VISUAL.2000.885689,"Vector field, data clustering, feature classification, high-dimensional data, user interaction",34,29,46,
InfoVis,2011,Improved Similarity Trees and their Application to Visual Data Classification,10.1109/TVCG.2011.212,http://dx.doi.org/10.1109/TVCG.2011.212,2459,2468,J,"An alternative form to multidimensional projections for the visual analysis of data represented in multidimensional spaces is the deployment of similarity trees, such as Neighbor Joining trees. They organize data objects on the visual plane emphasizing their levels of similarity with high capability of detecting and separating groups and subgroups of objects. Besides this similarity-based hierarchical data organization, some of their advantages include the ability to decrease point clutter; high precision; and a consistent view of the data set during focusing, offering a very intuitive way to view the general structure of the data set as well as to drill down to groups and subgroups of interest. Disadvantages of similarity trees based on neighbor joining strategies include their computational cost and the presence of virtual nodes that utilize too much of the visual space. This paper presents a highly improved version of the similarity tree technique. The improvements in the technique are given by two procedures. The first is a strategy that replaces virtual nodes by promoting real leaf nodes to their place, saving large portions of space in the display and maintaining the expressiveness and precision of the technique. The second improvement is an implementation that significantly accelerates the algorithm, impacting its use for larger data sets. We also illustrate the applicability of the technique in visual data mining, showing its advantages to support visual classification of data sets, with special attention to the case of image classification. We demonstrate the capabilities of the tree for analysis and iterative manipulation and employ those capabilities to support evolving to a satisfactory data organization and classification.",Jose Gustavo Paiva;Laura Florian;Hélio Pedrini;Guilherme P. Telles;Rosane Minghim,Jose Gustavo Paiva;Laura Florian;Helio Pedrini;Guilherme Telles;Rosane Minghim,"ICMC, University of S&#x0E3;o Paulo, Brazil;ICMC, University of S&#x0E3;o Paulo, Brazil;University of Campinas, Brazil;University of Campinas, Brazil;ICMC, University of S&#x0E3;o Paulo, Brazil",10.1109/INFVIS.1999.801855;10.1109/TVCG.2009.140;10.1109/VAST.2007.4389002;10.1109/TVCG.2008.138;10.1109/VISUAL.1996.567787;10.1109/TVCG.2010.207;10.1109/TVCG.2010.170;10.1109/INFVIS.2002.1173148,"Similarity Trees, Multidimensional Projections, Image Classification",34,25,42,
VAST,2011,Visual social network analytics for relationship discovery in the enterprise,10.1109/VAST.2011.6102443,http://dx.doi.org/10.1109/VAST.2011.6102443,71,79,C,"As people continue to author and share increasing amounts of information in social media, the opportunity to leverage such information for relationship discovery tasks increases. In this paper, we describe a set of systems that mine, aggregate, and infer a social graph from social media inside an enterprise, resulting in over 73 million relationships between 450,000 people. We then describe SaNDVis, a novel visual analytics tool that supports people-centric tasks like expertise location, team building, and team coordination in the enterprise. We also provide details of a 12-month-long, large-scale deployment to almost 1,800 users from which we extract dominant use cases from log and interview data. By integrating social position, evidence, and facets into SaNDVis, we demonstrate how users can use a visual analytics tool to reflect on existing relationships as well as build new relationships in an enterprise setting.",Adam Perer;Ido Guy;Erel Uziel;Inbal Ronen;Michal Jacovi,Adam Perer;Ido Guy;Erel Uziel;Inbal Ronen;Michal Jacovi,"IBM Research, USA;IBM Research, USA;IBM Research, USA;IBM Research, USA;IBM Research, USA",10.1109/TVCG.2006.122;10.1109/TVCG.2007.70582;10.1109/VAST.2006.261426;10.1109/INFVIS.2005.1532126;10.1109/TVCG.2006.166,"information discovery, social networks, social data mining, social visualization",34,17,45,HM
Vis,2011,Feature-Based Statistical Analysis of Combustion Simulation Data,10.1109/TVCG.2011.199,http://dx.doi.org/10.1109/TVCG.2011.199,1822,1831,J,"We present a new framework for feature-based statistical analysis of large-scale scientific data and demonstrate its effectiveness by analyzing features from Direct Numerical Simulations (DNS) of turbulent combustion. Turbulent flows are ubiquitous and account for transport and mixing processes in combustion, astrophysics, fusion, and climate modeling among other disciplines. They are also characterized by coherent structure or organized motion, i.e. nonlocal entities whose geometrical features can directly impact molecular mixing and reactive processes. While traditional multi-point statistics provide correlative information, they lack nonlocal structural information, and hence, fail to provide mechanistic causality information between organized fluid motion and mixing and reactive processes. Hence, it is of great interest to capture and track flow features and their statistics together with their correlation with relevant scalar quantities, e.g. temperature or species concentrations. In our approach we encode the set of all possible flow features by pre-computing merge trees augmented with attributes, such as statistical moments of various scalar fields, e.g. temperature, as well as length-scales computed via spectral analysis. The computation is performed in an efficient streaming manner in a pre-processing step and results in a collection of meta-data that is orders of magnitude smaller than the original simulation data. This meta-data is sufficient to support a fully flexible and interactive analysis of the features, allowing for arbitrary thresholds, providing per-feature statistics, and creating various global diagnostics such as Cumulative Density Functions (CDFs), histograms, or time-series. We combine the analysis with a rendering of the features in a linked-view browser that enables scientists to interactively explore, visualize, and analyze the equivalent of one terabyte of simulation data. We highlight the utility of this new framework for combustion science; however, it is applicable to many other science domains.",Janine Bennett;Vaidyanathan Krishnamoorthy;Shusen Liu;Ray W. Grout;Evatt R. Hawkes;Jacqueline Chen;Jason F. Shepherd;Valerio Pascucci;Peer-Timo Bremer,Janine C. Bennett;Vaidyanathan Krishnamoorthy;Shusen Liu;Ray W. Grout;Evatt R. Hawkes;Jacqueline H. Chen;Jason Shepherd;Valerio Pascucci;Peer-Timo Bremer,"Sandia National Laboratories;SCI Institute, University of Utah;SCI Institute, University of Utah;National Renewable Energy Laboratory;The University of New South Wales;Sandia National Laboratories;Sandia National Laboratories;SCI Institute, University of Utah;Lawrence Livermore National Laboratory SCI Institute, University of Utah",10.1109/VISUAL.2004.96;10.1109/VISUAL.2003.1250386;10.1109/TVCG.2007.70603;10.1109/TVCG.2006.186;10.1109/VISUAL.1997.663875,"Topology, Statistics, Data analysis, Data exploration, Visualization in Physical Sciences and Engineering, Multi-variate Data",34,22,47,
InfoVis,2013,Entourage: Visualizing Relationships between Biological Pathways using Contextual Subsets,10.1109/TVCG.2013.154,http://dx.doi.org/10.1109/TVCG.2013.154,2536,2545,J,"Biological pathway maps are highly relevant tools for many tasks in molecular biology. They reduce the complexity of the overall biological network by partitioning it into smaller manageable parts. While this reduction of complexity is their biggest strength, it is, at the same time, their biggest weakness. By removing what is deemed not important for the primary function of the pathway, biologists lose the ability to follow and understand cross-talks between pathways. Considering these cross-talks is, however, critical in many analysis scenarios, such as judging effects of drugs. In this paper we introduce Entourage, a novel visualization technique that provides contextual information lost due to the artificial partitioning of the biological network, but at the same time limits the presented information to what is relevant to the analyst's task. We use one pathway map as the focus of an analysis and allow a larger set of contextual pathways. For these context pathways we only show the contextual subsets, i.e., the parts of the graph that are relevant to a selection. Entourage suggests related pathways based on similarities and highlights parts of a pathway that are interesting in terms of mapped experimental data. We visualize interdependencies between pathways using stubs of visual links, which we found effective yet not obtrusive. By combining this approach with visualization of experimental data, we can provide domain experts with a highly valuable tool. We demonstrate the utility of Entourage with case studies conducted with a biochemist who researches the effects of drugs on pathways. We show that the technique is well suited to investigate interdependencies between pathways and to analyze, understand, and predict the effect that drugs have on different cell types.",Alexander Lex;Christian Partl;Denis Kalkofen;Marc Streit;Samuel Gratzl;Anne Mai Wassermann;Dieter Schmalstieg;Hanspeter Pfister,Alexander Lex;Christian Partl;Denis Kalkofen;Marc Streit;Samuel Gratzl;Anne Mai Wassermann;Dieter Schmalstieg;Hanspeter Pfister,Harvard University;Graz University of Technology;Graz University of Technology;Johannes Kepler University Linz;Johannes Kepler University Linz;Novartis Institutes for BioMedical Research;Graz University of Technology;Harvard University,10.1109/VAST.2009.5333443;10.1109/TVCG.2011.250;10.1109/TVCG.2011.213;10.1109/TVCG.2009.122;10.1109/TVCG.2011.183;10.1109/INFVIS.2000.885087,"Pathway visualization, biological networks, subsets, graphs, biomolecular data",34,28,33,
InfoVis,2013,GPLOM: The Generalized Plot Matrix for Visualizing Multidimensional Multivariate Data,10.1109/TVCG.2013.160,http://dx.doi.org/10.1109/TVCG.2013.160,2606,2614,J,"Scatterplot matrices (SPLOMs), parallel coordinates, and glyphs can all be used to visualize the multiple continuous variables (i.e., dependent variables or measures) in multidimensional multivariate data. However, these techniques are not well suited to visualizing many categorical variables (i.e., independent variables or dimensions). To visualize multiple categorical variables, 'hierarchical axes' that 'stack dimensions' have been used in systems like Polaris and Tableau. However, this approach does not scale well beyond a small number of categorical variables. Emerson et al. [8] extend the matrix paradigm of the SPLOM to simultaneously visualize several categorical and continuous variables, displaying many kinds of charts in the matrix depending on the kinds of variables involved. We propose a variant of their technique, called the Generalized Plot Matrix (GPLOM). The GPLOM restricts Emerson et al.'s technique to only three kinds of charts (scatterplots for pairs of continuous variables, heatmaps for pairs of categorical variables, and barcharts for pairings of categorical and continuous variable), in an effort to make it easier to understand. At the same time, the GPLOM extends Emerson et al.'s work by demonstrating interactive techniques suited to the matrix of charts. We discuss the visual design and interactive features of our GPLOM prototype, including a textual search feature allowing users to quickly locate values or variables by name. We also present a user study that compared performance with Tableau and our GPLOM prototype, that found that GPLOM is significantly faster in certain cases, and not significantly slower in other cases.",Jean-François Im;Michael J. McGuffin;Rock Leung,Jean-François Im;Michael J. McGuffin;Rock Leung,"école de technologie supérieure;école de technologie supérieure;SAP, Vancouver",10.1109/INFVIS.2005.1532142;10.1109/TVCG.2007.70523;10.1109/TVCG.2009.179;10.1109/VAST.2009.5332586;10.1109/TVCG.2007.70594;10.1109/VISUAL.1990.146386;10.1109/TVCG.2011.185;10.1109/TVCG.2010.205;10.1109/TVCG.2011.183;10.1109/VISUAL.1993.398859;10.1109/TVCG.2011.201;10.1109/TVCG.2010.164;10.1109/INFVIS.2000.885086;10.1109/TVCG.2007.70521;10.1109/INFVIS.2004.15;10.1109/TVCG.2008.153;10.1109/VISUAL.1991.175796,"Multidimensional data, tabular data, relational data, mdmv, high-dimensional data, database visualization, database overview, parallel coordinates, scatterplot matrix, user interfaces, business intelligence",34,27,40,
SciVis,2013,ConnectomeExplorer: Query-Guided Visual Analysis of Large Volumetric Neuroscience Data,10.1109/TVCG.2013.142,http://dx.doi.org/10.1109/TVCG.2013.142,2868,2877,J,"This paper presents ConnectomeExplorer, an application for the interactive exploration and query-guided visual analysis of large volumetric electron microscopy (EM) data sets in connectomics research. Our system incorporates a knowledge-based query algebra that supports the interactive specification of dynamically evaluated queries, which enable neuroscientists to pose and answer domain-specific questions in an intuitive manner. Queries are built step by step in a visual query builder, building more complex queries from combinations of simpler queries. Our application is based on a scalable volume visualization framework that scales to multiple volumes of several teravoxels each, enabling the concurrent visualization and querying of the original EM volume, additional segmentation volumes, neuronal connectivity, and additional meta data comprising a variety of neuronal data attributes. We evaluate our application on a data set of roughly one terabyte of EM data and 750 GB of segmentation data, containing over 4,000 segmented structures and 1,000 synapses. We demonstrate typical use-case scenarios of our collaborators in neuroscience, where our system has enabled them to answer specific scientific questions using interactive querying and analysis on the full-size data for the first time.",Johanna Beyer;Ali K. Al-Awami;Narayanan Kasthuri;Jeff Lichtman;Hanspeter Pfister;Markus Hadwiger,Johanna Beyer;Ali Al-Awami;Narayanan Kasthuri;Jeff W. Lichtman;Hanspeter Pfister;Markus Hadwiger,King Abdullah University of Science and Technology;King Abdullah University of Science and Technology;Center for Brain Science at Harvard University;Center for Brain Science at Harvard University;School of Engineering and Applied Sciences at Harvard University;King Abdullah University of Science and Technology,10.1109/INFVIS.2000.885086;10.1109/VISUAL.2005.1532792;10.1109/TVCG.2009.178;10.1109/TVCG.2012.240;10.1109/TVCG.2006.195;10.1109/VISUAL.1995.485139;10.1109/TVCG.2007.70560;10.1109/TVCG.2009.118;10.1109/TVCG.2009.121,"Connectomics, neuroscience, query algebra, visual knowledge discovery, petascale volume analysis",34,34,45,
SciVis,2013,Comparative Visual Analysis of Lagrangian Transport in CFD Ensembles,10.1109/TVCG.2013.141,http://dx.doi.org/10.1109/TVCG.2013.141,2743,2752,J,"Sets of simulation runs based on parameter and model variation, so-called ensembles, are increasingly used to model physical behaviors whose parameter space is too large or complex to be explored automatically. Visualization plays a key role in conveying important properties in ensembles, such as the degree to which members of the ensemble agree or disagree in their behavior. For ensembles of time-varying vector fields, there are numerous challenges for providing an expressive comparative visualization, among which is the requirement to relate the effect of individual flow divergence to joint transport characteristics of the ensemble. Yet, techniques developed for scalar ensembles are of little use in this context, as the notion of transport induced by a vector field cannot be modeled using such tools. We develop a Lagrangian framework for the comparison of flow fields in an ensemble. Our techniques evaluate individual and joint transport variance and introduce a classification space that facilitates incorporation of these properties into a common ensemble visualization. Variances of Lagrangian neighborhoods are computed using pathline integration and Principal Components Analysis. This allows for an inclusion of uncertainty measurements into the visualization and analysis approach. Our results demonstrate the usefulness and expressiveness of the presented method on several practical examples.",Mathias Hummel;Harald Obermaier;Christoph Garth;Kenneth I. Joy,Mathias Hummel;Harald Obermaier;Christoph Garth;Kenneth I. Joy,"University of Kaiserslautern;University of California, Davis;University of Kaiserslautern;University of California, Davis",10.1109/TVCG.2011.203;10.1109/VISUAL.1996.568116;10.1109/TVCG.2010.190;10.1109/TVCG.2010.181;10.1109/TVCG.2007.70551,"Ensemble, flow field, time-varying, comparison, visualization, Lagrangian, variance, principal components analysis",34,36,34,BP
InfoVis,2014,Four Experiments on the Perception of Bar Charts,10.1109/TVCG.2014.2346320,http://dx.doi.org/10.1109/TVCG.2014.2346320,2152,2160,J,"Bar charts are one of the most common visualization types. In a classic graphical perception paper, Cleveland &amp;amp; McGill studied how different bar chart designs impact the accuracy with which viewers can complete simple perceptual tasks. They found that people perform substantially worse on stacked bar charts than on aligned bar charts, and that comparisons between adjacent bars are more accurate than between widely separated bars. However, the study did not explore why these differences occur. In this paper, we describe a series of follow-up experiments to further explore and explain their results. While our results generally confirm Cleveland &amp;amp; McGill's ranking of various bar chart configurations, we provide additional insight into the bar chart reading task and the sources of participants' errors. We use our results to propose new hypotheses on the perception of bar charts.",Justin Talbot;Vidya Setlur;Anushka Anand,Justin Talbot;Vidya Setlur;Anushka Anand,Tableau Research;Tableau Research;Tableau Research,10.1109/TVCG.2012.237,"Graphical perception, bar charts",34,30,12,
VAST,2015,Visual Analysis and Dissemination of Scientific Literature Collections with SurVis,10.1109/TVCG.2015.2467757,http://dx.doi.org/10.1109/TVCG.2015.2467757,180,189,J,"Bibliographic data such as collections of scientific articles and citation networks have been studied extensively in information visualization and visual analytics research. Powerful systems have been built to support various types of bibliographic analysis, but they require some training and cannot be used to disseminate the insights gained. In contrast, we focused on developing a more accessible visual analytics system, called SurVis, that is ready to disseminate a carefully surveyed literature collection. The authors of a survey may use our Web-based system to structure and analyze their literature database. Later, readers of the survey can obtain an overview, quickly retrieve specific publications, and reproduce or extend the original bibliographic analysis. Our system employs a set of selectors that enable users to filter and browse the literature collection as well as to control interactive visualizations. The versatile selector concept includes selectors for textual search, filtering by keywords and meta-information, selection and clustering of similar publications, and following citation links. Agreement to the selector is represented by word-sized sparkline visualizations seamlessly integrated into the user interface. Based on an analysis of the analytical reasoning process, we derived requirements for the system. We developed the system in a formative way involving other researchers writing literature surveys. A questionnaire study with 14 visual analytics experts confirms that SurVis meets the initially formulated requirements.",Fabian Beck 0001;Sebastian Koch;Daniel Weiskopf,Fabian Beck;Sebastian Koch;Daniel Weiskopf,"VISUS, University of Stuttgart, Germany;VISUS, University of Stuttgart, Germany;VISUS, University of Stuttgart, Germany",10.1109/TVCG.2011.169;10.1109/TVCG.2012.252;10.1109/TVCG.2015.2467621;10.1109/VAST.2009.5333564;10.1109/TVCG.2010.194;10.1109/VAST.2007.4389006;10.1109/TVCG.2013.167,"Visual analytics of documents, bibliographic data, dissemination, literature browser",34,39,37,
Vis,1992,"Color, change, and control of quantitative data display",10.1109/VISUAL.1992.235201,http://dx.doi.org/10.1109/VISUAL.1992.235201,252,259,C,"Calico, a dynamic tool for the creation and manipulation of color mappings for the exploration of multivariate, quantitative data, was used to study the effects of user control and smooth change on user preference, accuracy, and confidence. The results of the study, as well as other user experiences with Calico, support the hypothesis that dynamic manipulation of color mappings is a useful feature of systems for the exploration of quantitative data using color. The main effect observed is a clear user preference for representations providing control over the mapping, a small but significant increase in accuracy, and greater confidence in information gleaned from manipulable displays. A smaller and less consistent effect showed greater user preference for an confidence in representations which provided smooth change between images.&lt;&lt;ETX&gt;&gt;",Penny Rheingans,P. Rheingans,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.1990.146383,,33,10,13,
Vis,1992,Interactive visualization of large scalar voxel fields,10.1109/VISUAL.1992.235229,http://dx.doi.org/10.1109/VISUAL.1992.235229,29,36,C,"A technique is given allowing interactive visualization of large, scalar, discrete volume fields as semitransparent clouds 'on the fly', i.e. without preprocessing. Interactivity is not restricted to geometric transformations, but includes all possible methods of processing the data. The system flexibly trades-off quality for performance at any desirable level. In particular, by using a scanline based method and a DDA-based traversing scheme instead of ray-tracing one achieves real-time processing during previewing. By means of the 'pyramidal volume' traversing technique, one achieves high-quality, constant-time filtering, independent of the data resolution. Several filters help to detect 'fuzzy', obscured hot spots, even within noisy data. The visualization pipeline allows the application of filters at four different stages, maximizing their flexibility. Four different illumination models have been implemented.&lt;&lt;ETX&gt;&gt;",Georgios Sakas;J. Hartig,G. Sakas;J. Hartig,"Tech. Hochschule, Darmstadt, Germany;Tech. Hochschule, Darmstadt, Germany",,,33,10,17,
Vis,1994,Streamball techniques for flow visualization,10.1109/VISUAL.1994.346315,http://dx.doi.org/10.1109/VISUAL.1994.346315,225,"231, C25",C,We introduce the concept of streamballs for flow visualization. Streamballs are based upon implicit surface generation techniques adopted from the well-known metaballs. Their property to split or merge automatically in areas of significant divergence or convergence makes them an ideal tool for the visualization of arbitrary complex fields. Using convolution surfaces generated by continuous skeletons for streamball construction offers the possibility to visualize even tensor fields.&lt;&lt;ETX&gt;&gt;,Manfred Brill;Hans Hagen;Hans-Christian Rodrian;Wladimir Djatschin;Stanislav V. Klimenko,M. Brill;H. Hagen;H.-C. Rodrian;W. Djatschin;S.V. Klimenko,"Dept. of Comput. Sci., Kaiserslautern Univ., Germany;Dept. of Comput. Sci., Kaiserslautern Univ., Germany;Dept. of Comput. Sci., Kaiserslautern Univ., Germany",10.1109/VISUAL.1992.235193;10.1109/VISUAL.1991.175789;10.1109/VISUAL.1992.235226;10.1109/VISUAL.1992.235211;10.1109/VISUAL.1993.398875,,33,18,11,
Vis,1994,"A distributed, parallel, interactive volume rendering package",10.1109/VISUAL.1994.346341,http://dx.doi.org/10.1109/VISUAL.1994.346341,21,"30, C2",C,"This paper presents a parallel ray-casting volume rendering algorithm and its implementation on the massively parallel IBM SP-1 computer using the Chameleon message passing library. Though this algorithm takes advantage of many of the unique features of the SP-1 (e.g. high-speed switch, large memory per node, high-speed disk array, HIPPI display, et al.), the use of Chameleon allows the code to be executed on any collection of workstations. The algorithm is image-ordered and distributes the data and the computational load to individual processors. After the volume data is distributed, all processors then perform local ray tracing of their respective subvolumes concurrently. No interprocess communication takes place during the ray tracing process. After a subimage is generated by each processor, the final image is obtained by composing subimages between all the processors. The program itself is implemented as an interactive process through a GUI residing on a graphics workstation which is coupled to the parallel rendering algorithm via sockets. The paper highlights the Chameleon implementation, the GUI, some optimization improvements, static load balancing, and direct parallel display to a HIPPI framebuffer.&lt;&lt;ETX&gt;&gt;",John S. Rowlan;G. Edward Lent;Nihar Gokhale;Shannon Bradshaw,J.S. Rowlan;G.E. Lent;N. Gokhale;S. Bradshaw,"Div. of Math. & Comput. Sci., Argonne Nat. Lab., IL, USA;Div. of Math. & Comput. Sci., Argonne Nat. Lab., IL, USA;Div. of Math. & Comput. Sci., Argonne Nat. Lab., IL, USA;Div. of Math. & Comput. Sci., Argonne Nat. Lab., IL, USA",,,33,10,11,
InfoVis,1999,The automated multidimensional detective,10.1109/INFVIS.1999.801865,http://dx.doi.org/10.1109/INFVIS.1999.801865,112,"119, 151",C,"Automation has arrived to parallel coordinates. A geometrically motivated classifier is presented and applied, with both training and testing stages, to 3 real datasets. Our results compared to those from 33 other classifiers have the least error. The algorithm is based on parallel coordinates and has very low computational complexity in the number of variables and the size of the dataset-contrasted with the very high or unknown (often unstated) complexity of other classifiers, the low complexity enables the rule derivation to be done in near real-time hence making the classification adaptive to changing conditions, provides comprehensible and explicit rules-contrasted to neural networks which are ""black boxes"", does dimensionality selection-where the minimal set of original variables (not transformed new variables as in Principal Component Analysis) required to state the rule is found, orders these variables so as to optimize the clarity of separation between the designated set and its complement-this solves the pesky ""ordering problem"" in parallel coordinates. The algorithm is display independent, hence it can be applied to very large in size and number of variables datasets. Though it is instructive to present the results visually, the input size is no longer display-limited as for visual data mining.",Alfred Inselberg;Tova Avidan,A. Inselberg;T. Avidan,"Dept. of Comput. Sci., Tel Aviv Univ., Israel",10.1109/INFVIS.1997.636793,,33,14,9,
Vis,2001,Accelerated volume ray-casting using texture mapping,10.1109/VISUAL.2001.964521,http://dx.doi.org/10.1109/VISUAL.2001.964521,271,278,C,"Acceleration techniques for volume ray-casting are primarily based on pre-computed data structures that allow one to efficiently traverse empty or homogeneous regions. In order to display volume data that successively undergoes color lookups, however, the data structures have to be re-built continuously. In this paper we propose a technique that circumvents this drawback using hardware accelerated texture mapping. In a first rendering pass we employ graphics hardware to interactively determine for each ray where the material is hit. In a second pass ray-casting is performed, but ray traversal starts right in front of the previously determined regions. The algorithm enables interactive classification and it considerably accelerates the view dependent display of selected materials and surfaces from volume data. In contrast to other techniques that are solely based on texture mapping our approach requires less memory and accurately performs the composition of material contributions along the ray.",Rüdiger Westermann;Bernd Sevenich,R. Westermann;B. Sevenich,"Sci. Visualization & Imaging Group, Univ. of Technol., Aachen, Germany;Sci. Visualization & Imaging Group, Univ. of Technol., Aachen, Germany",10.1109/VISUAL.1997.663880;10.1109/VISUAL.1998.745713;10.1109/VISUAL.1997.663888;10.1109/VISUAL.1990.146391;10.1109/VISUAL.1993.398852;10.1109/VISUAL.1999.809911,"Volume Rendering, Ray-Casting, Texture Mapping, Visualization, Graphics Hardware",33,18,36,
Vis,2004,Dual contouring with topology-preserving simplification using enhanced cell representation,10.1109/VISUAL.2004.27,http://dx.doi.org/10.1109/VISUAL.2004.27,505,512,C,"We present a fast, topology-preserving approach for isosurface simplification. The underlying concept behind our approach is to preserve the disconnected surface components in cells during isosurface simplification. We represent isosurface components in a novel representation, called enhanced cell, where each surface component in a cell is represented by a vertex and its connectivity information. A topology-preserving vertex clustering algorithm is applied to build a vertex octree. An enhanced dual contouring algorithm is applied to extract error-bounded multiresolution isosurfaces from the vertex octree while preserving the finest resolution isosurface topology. Cells containing multiple vertices are properly handled during contouring. Our approach demonstrates better results than existing octree-based simplification techniques.",Nan Zhang 0011;Wei Hong 0006;Arie E. Kaufman,Nan Zhang;Wei Hong;A. Kaufman,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1994.346308;10.1109/VISUAL.2001.964503;10.1109/VISUAL.2003.1250356;10.1109/VISUAL.2003.1250360;10.1109/VISUAL.2002.1183810;10.1109/VISUAL.1996.568127;10.1109/VISUAL.2000.885703,"isosurface simplification, isosurface extraction, topology preservation, vertex clustering",33,15,24,
Vis,2004,Projecting tetrahedra without rendering artifacts,10.1109/VISUAL.2004.85,http://dx.doi.org/10.1109/VISUAL.2004.85,27,34,C,"Hardware-accelerated direct volume rendering of unstructured volumetric meshes is often based on tetrahedral cell projection, in particular, the projected tetrahedra (PT) algorithm and its variants. Unfortunately, even implementations of the most advanced variants of the PT algorithm are very prone to rendering artifacts. In this work, we identify linear interpolation in screen coordinates as a cause for significant rendering artifacts and implement the correct perspective interpolation for the PT algorithm with programmable graphics hardware. We also demonstrate how to use features of modern graphics hardware to improve the accuracy of the coloring of individual tetrahedra and the compositing of the resulting colors, in particular, by employing a logarithmic scale for the preintegrated color lookup table, using textures with high color resolution, rendering to floating-point color buffers, and alpha dithering. Combined with a correct visibility ordering, these techniques result in the first implementation of the PT algorithm without objectionable rendering artifacts. Apart from the important improvement in rendering quality, our approach also provides a test bed for different implementations of the PT algorithm that allows us to study the particular rendering artifacts introduced by these variants.",Martin Kraus;Wei Qiao;David S. Ebert,M. Kraus;Wei Qiao;D.S. Ebert,"Purdue Univ., West Lafayette, IN, USA;Purdue Univ., West Lafayette, IN, USA;Purdue Univ., West Lafayette, IN, USA",10.1109/VISUAL.2000.885683;10.1109/VISUAL.2003.1250390;10.1109/VISUAL.2001.964514;10.1109/VISUAL.2003.1250384,"volume visualization, volume rendering, cell projection, projected tetrahedra, perspective interpolation, dithering, programmable graphics hardware",33,17,23,
InfoVis,2005,Interactive visualization of genealogical graphs,10.1109/INFVIS.2005.1532124,http://dx.doi.org/10.1109/INFVIS.2005.1532124,16,23,C,"The general problem of visualizing ""family trees"", or genealogical graphs, in 2D, is considered. A graph theoretic analysis is given, which identifies why genealogical graphs can be difficult to draw. This motivates some novel graphical representations, including one based on a dual tree, a subgraph formed by the union of two trees. Dual trees can be drawn in various styles, including an indented outline style, and allow users to browse general multitrees in addition to genealogical graphs, by transitioning between different dual tree views. A software prototype for such browsing is described, that supports smoothly animated transitions, automatic camera framing, rotation of subtrees, and a novel interaction technique for expanding or collapsing subtrees to any depth with a single mouse drag",Michael J. McGuffin;Ravin Balakrishnan,M.J. McGuffin;R. Balakrishnan,,10.1109/INFVIS.2004.21;10.1109/INFVIS.1997.636718;10.1109/VISUAL.1991.175815;10.1109/INFVIS.2002.1173148,"genealogy, genealogies, family trees, kinship, multi-trees, graph drawing, graph theory, graph browsing and navigation",33,9,23,
Vis,2005,View-dependent rendering of multiresolution texture-atlases,10.1109/VISUAL.2005.1532798,http://dx.doi.org/10.1109/VISUAL.2005.1532798,215,222,C,"Real-time rendering of massively textured 3D scenes usually involves two major problems: Large numbers of texture switches are a well-known performance bottleneck and the set of simultaneously visible textures is limited by the graphics memory. This paper presents a level-of-detail texturing technique that overcomes both problems. In a preprocessing step, the technique creates a hierarchical data structure for all textures used by scene objects, and it derives texture atlases at different resolutions. At runtime, our texturing technique requires only a small set of these texture atlases, which represent scene textures in an appropriate size depending on the current camera position and screen resolution. Independent of the number and total size of all simultaneously visible textures, the achieved frame rates are similar to that of rendering the scene without any texture switches. Since the approach includes dynamic texture loading, the total size of the textures is only limited by the hard disk capacity. The technique is applicable for any 3D scenes whose scene objects are primarily distributed in a plane, such as in the case of 3D city models or outdoor scenes in computer games. Our approach has been successfully applied to massively textured, large-scale 3D city models.",Henrik Buchholz;Jürgen Döllner,H. Buchholz;J. Dollner,"Hasso-Plattner Inst., Potsdam Univ., Germany;Hasso-Plattner Inst., Potsdam Univ., Germany",10.1109/VISUAL.1998.745322;10.1109/VISUAL.2004.4;10.1109/VISUAL.2000.885699,"Multiresolution textures, texture level-of-detail, realtime rendering, view-dependent rendering",33,8,24,
Vis,2005,Quality mesh generation for molecular skin surfaces using restricted union of balls,10.1109/VISUAL.2005.1532822,http://dx.doi.org/10.1109/VISUAL.2005.1532822,399,405,C,"Quality surface meshes for molecular models are desirable in the studies of protein shapes and functionalities. However, there is still no robust software that is capable to generate such meshes with good quality. In this paper, we present a Delaunay-based surface triangulation algorithm generating quality surface meshes for the molecular skin model. We expand the restricted union of balls along the surface and generate an /spl epsiv/-sampling of the skin surface incrementally. At the same time, a quality surface mesh is extracted from the Delaunay triangulation of the sample points. The algorithm supports robust and efficient implementation and guarantees the mesh quality and topology as well. Our results facilitate molecular visualization and have made a contribution towards generating quality volumetric tetrahedral meshes for the macromolecules.",Ho-Lun Cheng;Xinwei Shi,H.-L. Cheng;X. Shi,"Sch. of Comput., Nat. Univ. of Singapore, Singapore;Sch. of Comput., Nat. Univ. of Singapore, Singapore",10.1109/VISUAL.2004.36,"Smooth surfaces, meshing, restricted union of balls, Delaunay triangulation, guaranteed quality triangulation, homeomorphism",33,4,16,
VAST,2006,NetLens: Iterative Exploration of Content-Actor Network Data,10.1109/VAST.2006.261426,http://dx.doi.org/10.1109/VAST.2006.261426,91,98,C,"Networks have remained a challenge for information retrieval and visualization because of the rich set of tasks that users want to accomplish. This paper offers an abstract content-actor network data model, a classification of tasks, and a tool to support them. The NetLens interface was designed around the abstract content-actor network data model to allow users to pose a series of elementary queries and iteratively refine visual overviews and sorted lists. This enables the support of complex queries that are traditionally hard to specify. NetLens is general and scalable in that it applies to any dataset that can be represented with our abstract data model. This paper describes NetLens applying a subset of the ACM Digital Library consisting of about 4,000 papers from the CM I conference written by about 6,000 authors. In addition, we are now working on a collection of half a million emails, and a dataset of legal cases",Hyunmo Kang;Catherine Plaisant;Bongshin Lee;Benjamin B. Bederson,Hyunmo Kang;Catherine Plaisant;Bongshin Lee;Benjamin B. Bederson,"University of Maryland Institute for Advanced Computer Studies, kang@cs.umd.edu;University of Maryland Institute for Advanced Computer Studies, plaisant@cs.umd.edu;Human-Computer Interaction Laboratory, Computer Science Department, bongshin@cs.umd.edu;Human-Computer Interaction Laboratory, Computer Science Department; University of Maryland Institute for Advanced Computer Studies, bederson@cs.umd.edu",10.1109/INFVIS.2004.1;10.1109/INFVIS.1996.559210;10.1109/INFVIS.2005.1532136,"Human-Computer Interaction, information visualization, network visualization, content-actor network data, iterative query refinement, incremental data exploration, user interfaces, digital library, piccolo",33,13,29,
VAST,2007,Point Placement by Phylogenetic Trees and its Application to Visual Analysis of Document Collections,10.1109/VAST.2007.4389002,http://dx.doi.org/10.1109/VAST.2007.4389002,99,106,C,"The task of building effective representations to visualize and explore collections with moderate to large number of documents is hard. It depends on the evaluation of some distance measure among texts and also on the representation of such relationships in bi- dimensional spaces. In this paper we introduce an alternative approach for building visual maps of documents based on their content similarity, through reconstruction of phylogenetic trees. The tree is capable of representing relationships that allows the user to quickly recover information detected by the similarity metric. For a variety of text collections of different natures we show that we can achieve improved exploration capability and more clear visualization of relationships amongst documents.",Ana M. Cuadros;Fernando Vieira Paulovich;Rosane Minghim;Guilherme P. Telles,Ana M. Cuadros;Fernando V. Paulovich;Rosane Minghim;Guilherme P. Telles,"Instituto de Ciências Matemáticas e de Computação, Universidade de São Paulo, São Carlos, Brazil. e-mail: anamaria@icmc.usp.br;Instituto de Ciências Matemáticas e de Computação, Universidade de São Paulo, São Carlos, Brazil. e-mail: paulovic@icmc.usp.br;Instituto de Ciências Matemáticas e de Computação, Universidade de São Paulo, São Carlos, Brazil. e-mail: rminghim@icmc.usp.br;Instituto de Ciências Matemáticas e de Computação, Universidade de São Paulo, São Carlos, Brazil. e-mail: gpt@icmc.usp.br",10.1109/INFVIS.1995.528686;10.1109/VISUAL.1996.567787,"Document Visualization, Multidimensional Visualization, Document Analysis, Text Analytics, Phylogenetic Trees",33,26,29,
Vis,2007,Time Dependent Processing in a Parallel Pipeline Architecture,10.1109/TVCG.2007.70600,http://dx.doi.org/10.1109/TVCG.2007.70600,1376,1383,J,"Pipeline architectures provide a versatile and efficient mechanism for constructing visualizations, and they have been implemented in numerous libraries and applications over the past two decades. In addition to allowing developers and users to freely combine algorithms, visualization pipelines have proven to work well when streaming data and scale well on parallel distributed- memory computers. However, current pipeline visualization frameworks have a critical flaw: they are unable to manage time varying data. As data flows through the pipeline, each algorithm has access to only a single snapshot in time of the data. This prevents the implementation of algorithms that do any temporal processing such as particle tracing; plotting over time; or interpolation, fitting, or smoothing of time series data. As data acquisition technology improves, as simulation time-integration techniques become more complex, and as simulations save less frequently and regularly, the ability to analyze the time-behavior of data becomes more important. This paper describes a modification to the traditional pipeline architecture that allows it to accommodate temporal algorithms. Furthermore, the architecture allows temporal algorithms to be used in conjunction with algorithms expecting a single time snapshot, thus simplifying software design and allowing adoption into existing pipeline frameworks. Our architecture also continues to work well in parallel distributed-memory environments. We demonstrate our architecture by modifying the popular VTK framework and exposing the functionality to the ParaView application. We use this framework to apply time-dependent algorithms on large data with a parallel cluster computer and thereby exercise a functionality that previously did not exist.",John Biddiscombe;Berk Geveci;Ken Martin;Kenneth Moreland;David C. Thompson 0001,John Biddiscombe;Berk Geveci;Ken Martin;Kenneth Moreland;David Thompson,"Swiss National Supercomputing Centre;Kitware, Inc.;Kitware, Inc.;Sandia National Laboratories;Sandia National Laboratories",10.1109/VISUAL.2005.1532793;10.1109/VISUAL.1992.235219;10.1109/VISUAL.2005.1532795;10.1109/VISUAL.1991.175794;10.1109/VISUAL.2004.55;10.1109/INFVIS.2000.885092;10.1109/VISUAL.1995.480821,"data-parallel visualization pipeline, time-varying data",33,21,25,
Vis,2008,Box Spline Reconstruction On The Face-Centered Cubic Lattice,10.1109/TVCG.2008.115,http://dx.doi.org/10.1109/TVCG.2008.115,1523,1530,J,We introduce and analyze an efficient reconstruction algorithm for FCC-sampled data. The reconstruction is based on the 6-direction box spline that is naturally associated with the FCC lattice and shares the continuity and approximation order of the triquadratic B-spline. We observe less aliasing for generic level sets and derive special techniques to attain the higher evaluation efficiency promised by the lower degree and smaller stencil-size of the C1 6-direction box spline over the triquadratic B-spline.,Minho Kim;Alireza Entezari;Jörg Peters,Minho Kim;Alireza Entezari;Jörg Peters,University of Florida;University of Florida;University of Florida,10.1109/VISUAL.1994.346331;10.1109/TVCG.2007.70573;10.1109/VISUAL.2001.964498;10.1109/VISUAL.1993.398851;10.1109/VISUAL.2005.1532811;10.1109/VISUAL.2005.1532810;10.1109/VISUAL.2004.65,"Volumetric data reconstruction, box spline, Face-Centered Cubic lattice",33,20,32,
InfoVis,2010,Necklace Maps,10.1109/TVCG.2010.180,http://dx.doi.org/10.1109/TVCG.2010.180,881,889,J,"Statistical data associated with geographic regions is nowadays globally available in large amounts and hence automated methods to visually display these data are in high demand. There are several well-established thematic map types for quantitative data on the ratio-scale associated with regions: choropleth maps, cartograms, and proportional symbol maps. However, all these maps suffer from limitations, especially if large data values are associated with small regions. To overcome these limitations, we propose a novel type of quantitative thematic map, the necklace map. In a necklace map, the regions of the underlying two-dimensional map are projected onto intervals on a one-dimensional curve (the necklace) that surrounds the map regions. Symbols are scaled such that their area corresponds to the data of their region and placed without overlap inside the corresponding interval on the necklace. Necklace maps appear clear and uncluttered and allow for comparatively large symbol sizes. They visualize data sets well which are not proportional to region sizes. The linear ordering of the symbols along the necklace facilitates an easy comparison of symbol sizes. One map can contain several nested or disjoint necklaces to visualize clustered data. The advantages of necklace maps come at a price: the association between a symbol and its region is weaker than with other types of maps. Interactivity can help to strengthen this association if necessary. We present an automated approach to generate necklace maps which allows the user to interactively control the final symbol placement. We validate our approach with experiments using various data sets and maps.",Bettina Speckmann;Kevin Verbeek,authro Speckmann;Kevin Verbeek,,10.1109/INFVIS.2004.57;10.1109/TVCG.2008.165,"Geographic Visualization, Automated Cartography, Proportional Symbol Maps, Necklace Maps",33,31,18,HM
InfoVis,2010,The Streams of Our Lives: Visualizing Listening Histories in Context,10.1109/TVCG.2010.206,http://dx.doi.org/10.1109/TVCG.2010.206,1119,1128,J,"The choices we take when listening to music are expressions of our personal taste and character. Storing and accessing our listening histories is trivial due to services like Last.fm, but learning from them and understanding them is not. Existing solutions operate at a very abstract level and only produce statistics. By applying techniques from information visualization to this problem, we were able to provide average people with a detailed and powerful tool for accessing their own musical past. LastHistory is an interactive visualization for displaying music listening histories, along with contextual information from personal photos and calendar entries. Its two main user tasks are (1) analysis, with an emphasis on temporal patterns and hypotheses related to musical genre and sequences, and (2) reminiscing, where listening histories and context represent part of one's past. In this design study paper we give an overview of the field of music listening histories and explain their unique characteristics as a type of personal data. We then describe the design rationale, data and view transformations of LastHistory and present the results from both a laband a large-scale online study. We also put listening histories in contrast to other lifelogging data. The resonant and enthusiastic feedback that we received from average users shows a need for making their personal data accessible. We hope to stimulate such developments through this research.",Dominikus Baur;Frederik Seiffert;Michael Sedlmair;Sebastian Boring,Dominikus Baur;Frederik Seiffert;Michael Sedlmair;Sebastian Boring,University of Munich (LMU);University of Munich (LMU);University of Munich (LMU);University of Munich (LMU),10.1109/TVCG.2008.166;10.1109/TVCG.2007.70541;10.1109/INFVIS.2001.963273;10.1109/INFVIS.2002.1173155;10.1109/INFVIS.1999.801851;10.1109/VAST.2006.261421,"Information visualization, lifelogging, design study, music, listening history, timelines, photos, calendars",33,25,38,
Vis,2011,Extinction-Based Shading and Illumination in GPU Volume Ray-Casting,10.1109/TVCG.2011.198,http://dx.doi.org/10.1109/TVCG.2011.198,1795,1802,J,"Direct volume rendering has become a popular method for visualizing volumetric datasets. Even though computers are continually getting faster, it remains a challenge to incorporate sophisticated illumination models into direct volume rendering while maintaining interactive frame rates. In this paper, we present a novel approach for advanced illumination in direct volume rendering based on GPU ray-casting. Our approach features directional soft shadows taking scattering into account, ambient occlusion and color bleeding effects while achieving very competitive frame rates. In particular, multiple dynamic lights and interactive transfer function changes are fully supported. Commonly, direct volume rendering is based on a very simplified discrete version of the original volume rendering integral, including the development of the original exponential extinction into a-blending. In contrast to a-blending forming a product when sampling along a ray, the original exponential extinction coefficient is an integral and its discretization a Riemann sum. The fact that it is a sum can cleverly be exploited to implement volume lighting effects, i.e. soft directional shadows, ambient occlusion and color bleeding. We will show how this can be achieved and how it can be implemented on the GPU.",Philipp Schlegel;Maxim Makhinya;Renato Pajarola,Philipp Schlegel;Maxim Makhinya;Renato Pajarola,University of Zurich;University of Zurich;University of Zurich,10.1109/TVCG.2007.70555;10.1109/VISUAL.2002.1183764;10.1109/VISUAL.2003.1250384,"Volume Rendering, Shadows, Ambient Occlusion, GPU Ray-Casting, Exponential Extinction",33,32,36,
Vis,2011,TransGraph: Hierarchical Exploration of Transition Relationships in Time-Varying Volumetric Data,10.1109/TVCG.2011.246,http://dx.doi.org/10.1109/TVCG.2011.246,2015,2024,J,"A fundamental challenge for time-varying volume data analysis and visualization is the lack of capability to observe and track data change or evolution in an occlusion-free, controllable, and adaptive fashion. In this paper, we propose to organize a timevarying data set into a hierarchy of states. By deriving transition probabilities among states, we construct a global map that captures the essential transition relationships in the time-varying data. We introduce the TransGraph, a graph-based representation to visualize hierarchical state transition relationships. The TransGraph not only provides a visual mapping that abstracts data evolution over time in different levels of detail, but also serves as a navigation tool that guides data exploration and tracking. The user interacts with the TransGraph and makes connection to the volumetric data through brushing and linking. A set of intuitive queries is provided to enable knowledge extraction from time-varying data. We test our approach with time-varying data sets of different characteristics and the results show that the TransGraph can effectively augment our ability in understanding time-varying data.",Yi Gu;Chaoli Wang 0001,Yi Gu;Chaoli Wang,Michigan Technological University;Michigan Technological University,10.1109/TVCG.2008.119;10.1109/VISUAL.1994.346321;10.1109/VAST.2006.261451;10.1109/VISUAL.1999.809871;10.1109/TVCG.2006.165;10.1109/VISUAL.2003.1250401;10.1109/TVCG.2008.116;10.1109/TVCG.2010.190;10.1109/VISUAL.2003.1250402;10.1109/VISUAL.1995.480809;10.1109/TVCG.2008.140;10.1109/VISUAL.2001.964531;10.1109/TVCG.2009.200,"Time-varying data visualization, hierarchical representation, states, transition relationship, user interface",33,32,30,
InfoVis,2012,Interaction Support for Visual Comparison Inspired by Natural Behavior,10.1109/TVCG.2012.237,http://dx.doi.org/10.1109/TVCG.2012.237,2719,2728,J,"Visual comparison is an intrinsic part of interactive data exploration and analysis. The literature provides a large body of existing solutions that help users accomplish comparison tasks. These solutions are mostly of visual nature and custom-made for specific data. We ask the question if a more general support is possible by focusing on the interaction aspect of comparison tasks. As an answer to this question, we propose a novel interaction concept that is inspired by real-world behavior of people comparing information printed on paper. In line with real-world interaction, our approach supports users (1) in interactively specifying pieces of graphical information to be compared, (2) in flexibly arranging these pieces on the screen, and (3) in performing the actual comparison of side-by-side and overlapping arrangements of the graphical information. Complementary visual cues and add-ons further assist users in carrying out comparison tasks. Our concept and the integrated interaction techniques are generally applicable and can be coupled with different visualization techniques. We implemented an interactive prototype and conducted a qualitative user study to assess the concept's usefulness in the context of three different visualization techniques. The obtained feedback indicates that our interaction techniques mimic the natural behavior quite well, can be learned quickly, and are easy to apply to visual comparison tasks.",Christian Tominski;Camilla Forsell;Jimmy Johansson,Christian Tominski;Camilla Forsell;Jimmy Johansson,University of Rostock;Link&#x00F6;ping University;Link&#x00F6;ping University,10.1109/TVCG.2008.109;10.1109/TVCG.2007.70568;10.1109/TVCG.2011.201;10.1109/TVCG.2007.70515;10.1109/TVCG.2007.70623;10.1109/TVCG.2009.151;10.1109/INFVIS.2002.1173157;10.1109/TVCG.2011.223;10.1109/TVCG.2007.70582;10.1109/TVCG.2008.153,"Interaction techniques, visual comparison, visualization, human-computer interaction, natural interaction",33,29,51,
VAST,2012,Inter-active learning of ad-hoc classifiers for video visual analytics,10.1109/VAST.2012.6400492,http://dx.doi.org/10.1109/VAST.2012.6400492,23,32,C,"Learning of classifiers to be used as filters within the analytical reasoning process leads to new and aggravates existing challenges. Such classifiers are typically trained ad-hoc, with tight time constraints that affect the amount and the quality of annotation data and, thus, also the users' trust in the classifier trained. We approach the challenges of ad-hoc training by inter-active learning, which extends active learning by integrating human experts' background knowledge to greater extent. In contrast to active learning, not only does inter-active learning include the users' expertise by posing queries of data instances for labeling, but it also supports the users in comprehending the classifier model by visualization. Besides the annotation of manually or automatically selected data instances, users are empowered to directly adjust complex classifier models. Therefore, our model visualization facilitates the detection and correction of inconsistencies between the classifier model trained by examples and the user's mental model of the class definition. Visual feedback of the training process helps the users assess the performance of the classifier and, thus, build up trust in the filter created. We demonstrate the capabilities of inter-active learning in the domain of video visual analytics and compare its performance with the results of random sampling and uncertainty sampling of training sets.",Benjamin Höferlin;Rudolf Netzel;Markus Höferlin;Daniel Weiskopf;Gunther Heidemann,Benjamin Höferlin;Rudolf Netzel;Markus Höferlin;Daniel Weiskopf;Gunther Heidemann,"Institute of Cognitive Science, University of Osnabrück;Visualization Research Center (VISUS), University of Stuttgart;Visualization Research Center (VISUS), University of Stuttgart;Visualization Research Center (VISUS), University of Stuttgart;Institute of Cognitive Science, University of Osnabrück",10.1109/VAST.2010.5652398;10.1109/TVCG.2012.277,,33,18,43,
InfoVis,2013,Evaluation of filesystem Provenance Visualization Tools,10.1109/TVCG.2013.155,http://dx.doi.org/10.1109/TVCG.2013.155,2476,2485,J,"Having effective visualizations of filesystem provenance data is valuable for understanding its complex hierarchical structure. The most common visual representation of provenance data is the node-link diagram. While effective for understanding local activity, the node-link diagram fails to offer a high-level summary of activity and inter-relationships within the data. We present a new tool, InProv, which displays filesystem provenance with an interactive radial-based tree layout. The tool also utilizes a new time-based hierarchical node grouping method for filesystem provenance data we developed to match the user's mental model and make data exploration more intuitive. We compared InProv to a conventional node-link based tool, Orbiter, in a quantitative evaluation with real users of filesystem provenance data including provenance data experts, IT professionals, and computational scientists. We also compared in the evaluation our new node grouping method to a conventional method. The results demonstrate that InProv results in higher accuracy in identifying system activity than Orbiter with large complex data sets. The results also show that our new time-based hierarchical node grouping method improves performance in both tools, and participants found both tools significantly easier to use with the new time-based node grouping method. Subjective measures show that participants found InProv to require less mental activity, less physical activity, less work, and is less stressful to use. Our study also reveals one of the first cases of gender differences in visualization; both genders had comparable performance with InProv, but women had a significantly lower average accuracy (56%) compared to men (70%) with Orbiter.",Michelle Borkin;Chelsea S. Yeh;Madelaine Boyd;Peter Macko;Krzysztof Z. Gajos;Margo I. Seltzer;Hanspeter Pfister,Michelle A. Borkin;Chelsea S. Yeh;Madelaine Boyd;Peter Macko;Krzysztof Z. Gajos;Margo Seltzer;Hanspeter Pfister,Harvard University;Harvard University;Harvard University;Harvard University;Harvard University;Harvard University;Harvard University,10.1109/TVCG.2006.193;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2006.120;10.1109/TVCG.2009.167;10.1109/INFVIS.2004.66;10.1109/INFVIS.2004.1;10.1109/VISUAL.2005.1532788;10.1109/TVCG.2011.247;10.1109/INFVIS.2005.1532134,"Provenance data, graph/network data, hierarchy data, quantitative evaluation, gender differences",33,27,54,
InfoVis,2013,Understanding Interfirm Relationships in Business Ecosystems with Interactive Visualization,10.1109/TVCG.2013.209,http://dx.doi.org/10.1109/TVCG.2013.209,2526,2535,J,"Business ecosystems are characterized by large, complex, and global networks of firms, often from many different market segments, all collaborating, partnering, and competing to create and deliver new products and services. Given the rapidly increasing scale, complexity, and rate of change of business ecosystems, as well as economic and competitive pressures, analysts are faced with the formidable task of quickly understanding the fundamental characteristics of these interfirm networks. Existing tools, however, are predominantly query- or list-centric with limited interactive, exploratory capabilities. Guided by a field study of corporate analysts, we have designed and implemented dotlink360, an interactive visualization system that provides capabilities to gain systemic insight into the compositional, temporal, and connective characteristics of business ecosystems. dotlink360 consists of novel, multiple connected views enabling the analyst to explore, discover, and understand interfirm networks for a focal firm, specific market segments or countries, and the entire business ecosystem. System evaluation by a small group of prototypical users shows supporting evidence of the benefits of our approach. This design study contributes to the relatively unexplored, but promising area of exploratory information visualization in market research and business strategy.",Rahul C. Basole;Trustin Clear;Mengdie Hu;Harshit Mehrotra;John T. Stasko,Rahul C. Basole;Trustin Clear;Mengdie Hu;Harshit Mehrotra;John Stasko,Georgia Tech;Georgia Tech;Georgia Tech;Georgia Tech;Georgia Tech,10.1109/TVCG.2006.160;10.1109/INFVIS.2005.1532134;10.1109/INFVIS.2003.1249027;10.1109/INFVIS.2005.1532126;10.1109/TVCG.2012.213;10.1109/TVCG.2006.122;10.1109/VAST.2010.5652530;10.1109/TVCG.2006.166,"Business ecosystems, market research, strategic analysis, design study, interaction, network visualization",33,36,51,
InfoVis,2014,Design Activity Framework for Visualization Design,10.1109/TVCG.2014.2346331,http://dx.doi.org/10.1109/TVCG.2014.2346331,2191,2200,J,"An important aspect in visualization design is the connection between what a designer does and the decisions the designer makes. Existing design process models, however, do not explicitly link back to models for visualization design decisions. We bridge this gap by introducing the design activity framework, a process model that explicitly connects to the nested model, a well-known visualization design decision model. The framework includes four overlapping activities that characterize the design process, with each activity explicating outcomes related to the nested model. Additionally, we describe and characterize a list of exemplar methods and how they overlap among these activities. The design activity framework is the result of reflective discussions from a collaboration on a visualization redesign project, the details of which we describe to ground the framework in a real-world design process. Lastly, from this redesign project we provide several research outcomes in the domain of cybersecurity, including an extended data abstraction and rich opportunities for future visualization research.",Sean McKenna;Dominika Mazur;James Agutter;Miriah D. Meyer,Sean McKenna;Dominika Mazur;James Agutter;Miriah Meyer,"School of Computing, Salt Lake City, UT;Department of Psychology, University of Utah, Salt Lake City, UT;College of Architecture and Planning, University of Utah, Salt Lake City, UT;School of Computing, Salt Lake City, UT",10.1109/TVCG.2012.213;10.1109/TVCG.2011.209;10.1109/TVCG.2009.111;10.1109/TVCG.2013.126;10.1109/TVCG.2013.145,"Design, frameworks, process, cybersecurity, nested model, decisions, models, evaluation, visualization",33,38,69,
VAST,2014,Visual Methods for Analyzing Probabilistic Classification Data,10.1109/TVCG.2014.2346660,http://dx.doi.org/10.1109/TVCG.2014.2346660,1703,1712,J,"Multi-class classifiers often compute scores for the classification samples describing probabilities to belong to different classes. In order to improve the performance of such classifiers, machine learning experts need to analyze classification results for a large number of labeled samples to find possible reasons for incorrect classification. Confusion matrices are widely used for this purpose. However, they provide no information about classification scores and features computed for the samples. We propose a set of integrated visual methods for analyzing the performance of probabilistic classifiers. Our methods provide insight into different aspects of the classification results for a large number of samples. One visualization emphasizes at which probabilities these samples were classified and how these probabilities correlate with classification error in terms of false positives and false negatives. Another view emphasizes the features of these samples and ranks them by their separation power between selected true and false classifications. We demonstrate the insight gained using our technique in a benchmarking classification dataset, and show how it enables improving classification performance by interactively defining and evaluating post-classification rules.",Bilal Alsallakh;Allan Hanbury;Helwig Hauser;Silvia Miksch;Andreas Rauber,Bilal Alsallakh;Allan Hanbury;Helwig Hauser;Silvia Miksch;Andreas Rauber,Vienna University of Technology;Vienna University of Technology;University of Bergen;Vienna University of Technology;Vienna University of Technology,10.1109/VISUAL.2000.885740;10.1109/VAST.2010.5652398;10.1109/VAST.2009.5332628;10.1109/TVCG.2012.277;10.1109/VAST.2012.6400486;10.1109/TVCG.2013.184;10.1109/TVCG.2012.254;10.1109/VAST.2011.6102448;10.1109/VAST.2011.6102453;10.1109/VAST.2012.6400492;10.1109/VAST.2010.5652443,"Probabilistic classification, confusion analysis, feature evaluation and selection, visual inspection",33,28,43,
VAST,2014,VarifocalReader -- In-Depth Visual Analysis of Large Text Documents,10.1109/TVCG.2014.2346677,http://dx.doi.org/10.1109/TVCG.2014.2346677,1723,1732,J,"Interactive visualization provides valuable support for exploring, analyzing, and understanding textual documents. Certain tasks, however, require that insights derived from visual abstractions are verified by a human expert perusing the source text. So far, this problem is typically solved by offering overview-detail techniques, which present different views with different levels of abstractions. This often leads to problems with visual continuity. Focus-context techniques, on the other hand, succeed in accentuating interesting subsections of large text documents but are normally not suited for integrating visual abstractions. With VarifocalReader we present a technique that helps to solve some of these approaches' problems by combining characteristics from both. In particular, our method simplifies working with large and potentially complex text documents by simultaneously offering abstract representations of varying detail, based on the inherent structure of the document, and access to the text itself. In addition, VarifocalReader supports intra-document exploration through advanced navigation concepts and facilitates visual analysis tasks. The approach enables users to apply machine learning techniques and search mechanisms as well as to assess and adapt these techniques. This helps to extract entities, concepts and other artifacts from texts. In combination with the automatic generation of intermediate text levels through topic segmentation for thematic orientation, users can test hypotheses or develop interesting new research questions. To illustrate the advantages of our approach, we provide usage examples from literature studies.",Steffen Koch;Markus John;Michael Wörner 0001;Andreas Müller 0012;Thomas Ertl,Steffen Koch;Markus John;Michael Wörner;Andreas Müller;Thomas Ertl,Institute of Visualization and Interactive Systems (VIS);Institute of Visualization and Interactive Systems (VIS);Institute of Visualization and Interactive Systems (VIS);Institute for Natural Language Processing (IMS);Institute of Visualization and Interactive Systems (VIS),10.1109/VAST.2010.5652926;10.1109/TVCG.2008.172;10.1109/VAST.2012.6400485;10.1109/TVCG.2013.188;10.1109/TVCG.2007.70577;10.1109/VAST.2012.6400486;10.1109/TVCG.2012.277;10.1109/TVCG.2009.165;10.1109/TVCG.2013.162;10.1109/INFVIS.1995.528686;10.1109/VAST.2009.5333248;10.1109/TVCG.2012.260;10.1109/VAST.2007.4389006;10.1109/VAST.2009.5333919;10.1109/VAST.2007.4389004,"visual analytics, document analysis, literary analysis, natural language processing, text mining, machine learning, distant reading",33,25,48,
InfoVis,2015,A comparative study between RadViz and Star Coordinates,10.1109/TVCG.2015.2467324,http://dx.doi.org/10.1109/TVCG.2015.2467324,619,628,J,"RadViz and star coordinates are two of the most popular projection-based multivariate visualization techniques that arrange variables in radial layouts. Formally, the main difference between them consists of a nonlinear normalization step inherent in RadViz. In this paper we show that, although RadViz can be useful when analyzing sparse data, in general this design choice limits its applicability and introduces several drawbacks for exploratory data analysis. In particular, we observe that the normalization step introduces nonlinear distortions, can encumber outlier detection, prevents associating the plots with useful linear mappings, and impedes estimating original data attributes accurately. In addition, users have greater flexibility when choosing different layouts and views of the data in star coordinates. Therefore, we suggest that analysts and researchers should carefully consider whether RadViz's normalization step is beneficial regarding the data sets' characteristics and analysis tasks.",Manuel Rubio-Sánchez;Laura Raya;Francisco Diaz;Alberto Sánchez 0001,Manuel Rubio-Sánchez;Laura Raya;Francisco Díaz;Alberto Sanchez,URJC;U-tad;UPM;URJC and CCS,10.1109/VAST.2010.5652433;10.1109/INFVIS.1998.729559;10.1109/VISUAL.1997.663916;10.1109/TVCG.2013.182;10.1109/TVCG.2014.2346258;10.1109/TVCG.2008.173,"RadViz, Star coordinates, Exploratory data analysis, Cluster analysis, Classification, Outlier detection",33,34,45,
Vis,1994,Fast surface rendering from raster data by voxel traversal using chessboard distance,10.1109/VISUAL.1994.346320,http://dx.doi.org/10.1109/VISUAL.1994.346320,188,"195, C21",C,"The increasing distinguishing capability of tomographic and other 3D scanners as well as the new voxelization algorithms place new demands on visualization techniques aimed at interactivity and rendition quality. Among others, triangulation on a subvoxel level based on the marching cube algorithm has gained popularity in recent years. However without graphics hardware support, rendering many small triangles could be awkward. We present a surface rendering approach based on ray tracing of segmented volumetric data. We show that if a proper interpolation scheme and voxel traversal algorithm are used, high quality images can be obtained within an acceptable time and without hardware support.&lt;&lt;ETX&gt;&gt;",Milos Srámek,M. Sramek,"Slovak Tech. Univ., Bratislava, Slovakia",10.1109/VISUAL.1993.398852,,32,19,21,
Vis,1994,Feature detection from vector quantities in a numerically simulated hypersonic flow field in combination with experimental flow visualization,10.1109/VISUAL.1994.346329,http://dx.doi.org/10.1109/VISUAL.1994.346329,117,"123, C12",C,"In computational fluid dynamics visualization is a frequently used tool for data evaluation, understanding of flow characteristics, and qualitative comparison to flow visualizations originating from experiments. Building on an existing visualization software system, that allows for a careful selection of state-of-the-art visualization techniques and some extensions, it became possible to present various features of the data in a single image. The visualizations show vortex position and rotation as well as skin-friction lines, experimental oil-flow traces, and shock-wave positions. By adding experimental flow visualization a comparison between numerical simulation and wind-tunnel flow becomes possible up to a high level of detail. Since some of the underlying algorithms are not yet described in detail in the visualization literature, some experiences gained from the implementation are illustrated.&lt;&lt;ETX&gt;&gt;",Hans-Georg Pagendarm;Birgit Walter,H.-G. Pagendarm;B. Walter,"DLR, German Aerosp. Res. Establ., Gottingen, Germany;DLR, German Aerosp. Res. Establ., Gottingen, Germany",10.1109/VISUAL.1992.235225,,32,18,23,
Vis,1994,Isosurface generation by using extrema graphs,10.1109/VISUAL.1994.346334,http://dx.doi.org/10.1109/VISUAL.1994.346334,77,"83, C7",C,"A high-performance algorithm for generating isosurfaces is presented. In this algorithm, extrema points in a scalar field are first extracted. A graph is then generated in which the extrema points are taken as nodes. Each arc of the graph has a list of IDs of the cells that are intersected by the arc. A boundary cell list ordered according to cells' values is also generated. The graph and the list generated in this pre-process are used as a guide in searching for seed cells. Isosurfaces are generated from seed cells that are found in arcs of the graph. In this process, isosurfaces appear to propagate themselves. The algorithm visits only cells that are intersected by an isosurface and cells whose IDs an included in cell lists. It is especially efficient when many isosurfaces are interactively generated in a huge volume. Some benchmark tests described show the efficiency of the algorithm.&lt;&lt;ETX&gt;&gt;",Takayuki Itoh;Koji Koyamada,T. Itoh;K. Koyamada,"Res. Lab., IBM Japan Ltd., Tokyo, Japan;Res. Lab., IBM Japan Ltd., Tokyo, Japan",10.1109/VISUAL.1992.235213;10.1109/VISUAL.1991.175780,,32,14,7,
Vis,1995,Splatting of curvilinear volumes,10.1109/VISUAL.1995.480796,http://dx.doi.org/10.1109/VISUAL.1995.480796,61,"68, 439",C,The paper presents a splatting algorithm for volume rendering of curvilinear grids. A stochastic sampling technique called Poisson sphere/ellipsoid sampling is employed to adaptively resample a curvilinear grid with a set of randomly distributed points whose energy support extents are well approximated by spheres and ellipsoids. Filter kernels corresponding to these spheres and ellipsoids are used to generate the volume rendered image of the curvilinear grid with a conventional footprint evaluation algorithm. Experimental results show that our approach can be regarded as an alternative to existing fast volume rendering techniques of curvilinear grids.,Xiaoyang Mao;Lichan Hong;Arie E. Kaufman,Xiaoyang Mao;Lichan Hong;A. Kaufman,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1992.235228;10.1109/VISUAL.1993.398853;10.1109/VISUAL.1994.346340,,32,12,24,
Vis,1996,Contour blending using warp-guided distance field interpolation,10.1109/VISUAL.1996.567812,http://dx.doi.org/10.1109/VISUAL.1996.567812,165,172,C,"Given (n-1)-dimensional parallel cross-sections of an n-dimensional body, one would like to reconstruct the n-dimensional body. The method based on Distance Field Interpolation (DFI) gives a robust solution to this problem in its ability to deal with any topology in any dimension. Still this method may give undesired solutions to the problem if the changes from one cross-section to the next are significant relative to the size of the details in the cross-sections. We consider the problem of solid reconstruction from contours, which can also be considered as a contour blending or contour morphing problem, where the third dimension is time. The method presented is based on interpolation of the distance field, guided by a warp function which is controlled by a set of corresponding anchor points. Some rules for defining a smooth least-distorting warp function are given. To reduce the distortion of the intermediate shapes, the warp function is decomposed into a rigid rotational part and an elastic part. The distance field interpolation method is modified so that the interpolation is guided by the warp function. The advantage of the new approach is that it is capable of blending between contours having different topological genus, and no correspondence between the geometric primitives should be established. The desired general correspondence is defined by the user in terms of a relatively small number of anchor points.",Daniel Cohen-Or;David Levin;Amira Solomovici,D. Cohen-Or;D. Levin;A. Solomovici,"Sch. of Math. Sci., Tel Aviv Univ., Israel",10.1109/VISUAL.1994.346333,"Shape-plending, Interpolation, Shape Reconstruction, Radial Basis functions",32,16,21,
Vis,2000,Fairing of non-manifolds for visualization,10.1109/VISUAL.2000.885722,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2000.885722,407,414,C,"The concept of fairing applied to irregular triangular meshes has become more and more important. Previous contributions constructed better fairing operators, and applied them both to multiresolution editing tools and to multiresolution representations of meshes. The authors generalize these powerful techniques to handle non-manifold models. Our framework computes a multilevel fairing of models by fairing both the two-manifold surfaces that define the model, the so-called two-features, and all the boundary and intersection curves of the model, the so-called one-features. In addition we introduce two extensions that can be used in our framework as well as in manifold fairing concepts: an exact local volume preservation strategy and a method for feature preservation. Our framework works with any of the manifold fairing operators for meshes.",Andreas Hubeli;Markus H. Gross,A. Hubeli;M. Gross,"Eidgenossische Tech. Hochschule, Zurich, Switzerland",,,32,6,0,
InfoVis,2001,Collapsible cylindrical trees: a fast hierarchical navigation technique,10.1109/INFVIS.2001.963284,http://dx.doi.org/10.1109/INFVIS.2001.963284,79,86,C,,Raimund Dachselt;Jürgen Ebert,R. Dachselt;J. Ebert,Dresden University of Technology,10.1109/INFVIS.1997.636718;10.1109/INFVIS.1995.528692;10.1109/VISUAL.1991.175815,"visualization, web navigation, hierarchy, interactive tree, sitemap, 3D graphics, VRML, XML",32,10,17,
Vis,2001,Variational classification for visualization of 3D ultrasound data,10.1109/VISUAL.2001.964539,http://dx.doi.org/10.1109/VISUAL.2001.964539,403,410,C,"We present a new technique for visualizing surfaces from 3D ultrasound data. 3D ultrasound datasets are typically fuzzy, contain a substantial amount of noise and speckle, and suffer from several other problems that make extraction of continuous and smooth surfaces extremely difficult. We propose a novel opacity classification algorithm for 3D ultrasound datasets, based on the variational principle. More specifically, we compute a volumetric opacity function that optimally satisfies a set of simultaneous requirements. One requirement makes the function attain nonzero values only in the vicinity of a user-specified value, resulting in soft shells of finite, approximately constant thickness around isosurfaces in the volume. Other requirements are designed to make the function smoother and less sensitive to noise and speckle. The computed opacity function lends itself well to explicit geometric surface extraction, as well as to direct volume rendering at interactive rates. We also describe a new splatting algorithm that is particularly well suited for displaying soft opacity shells. Several examples and comparisons are included to illustrate our approach and demonstrate its effectiveness on real 3D ultrasound datasets.",Raanan Fattal;Dani Lischinski,R. Fattal;D. Lischinski,"Sch. of Comput. Sci. & Eng., Jerusalem, Israel;Sch. of Comput. Sci. & Eng., Jerusalem, Israel",10.1109/VISUAL.1993.398877;10.1109/VISUAL.1997.663875,"3D ultrasound, classification, isosurface extraction, opacity function, splatting, the variational principle, volume rendering",32,3,21,
Vis,2003,Visually accurate multi-field weather visualization,10.1109/VISUAL.2003.1250383,http://dx.doi.org/10.1109/VISUAL.2003.1250383,279,286,C,"Weather visualization is a difficult problem because it comprises volumetric multi-field data and traditional surface-based approaches obscure details of the complex three-dimensional structure of cloud dynamics. Therefore, visually accurate volumetric multi-field visualization of storm scale and cloud scale data is needed to effectively and efficiently communicate vital information to weather forecasters, improving storm forecasting, atmospheric dynamics models, and weather spotter training. We have developed a new approach to multi-field visualization that uses field specific, physically-based opacity, transmission, and lighting calculations per-field for the accurate visualization of storm and cloud scale weather data. Our approach extends traditional transfer function approaches to multi-field data and to volumetric illumination and scattering.",Kirk Riley;David S. Ebert;Charles D. Hansen;Jason J. Levit,K. Riley;D. Ebert;C. Hansen;J. Levit,"Purdue Univ., West Lafayette, IN, USA;Purdue Univ., West Lafayette, IN, USA",,"Multi-Field Visualization, Visually Accurate Visualization, Weather Visualization",32,19,35,
InfoVis,2004,Paint Inspired Color Mixing and Compositing for Visualization,10.1109/INFVIS.2004.52,http://dx.doi.org/10.1109/INFVIS.2004.52,113,118,C,"Color is often used to convey information, and color compositing is often required while visualizing multiattribute information. This paper proposes an alternative method for color compositing. In order to present understandable color blending to the general public, several techniques are proposed. First, a paint-inspired RYB color space is used. In addition, noise patterns are employed to produce subregions of pure color within an overlapped region. We show examples to demonstrate the effectiveness of our technique for visualization",Nathan Gossett;Baoquan Chen,N. Gossett;Baoquan Chen,University of Minnesota at Twin Cities,10.1109/VISUAL.2003.1250362,"RYB, Color Mixing, Perception",32,16,6,
InfoVis,2004,Artifacts of the Presence Era: Using Information Visualization to Create an Evocative Souvenir,10.1109/INFVIS.2004.8,http://dx.doi.org/10.1109/INFVIS.2004.8,105,111,C,"We present Artifacts of the Presence Era, a digital installation that uses a geological metaphor to visualize the events in a physical space over time. The piece captures video and audio from a museum and constructs an impressionistic visualization of the evolving history in the space. Instead of creating a visualization tool for data analysis, we chose to produce a piece that functions as a souvenir of a particular time and place. We describe the design choices we made in creating this installation, the visualization techniques we developed, and the reactions we observed from users and the media. We suggest that the same approach can be applied to a more general set of visualization contexts, ranging from email archives to newsgroups conversations",Fernanda B. Viégas;Ethan Perry;Ethan Howe;Judith S. Donath,F.B. Viegas;E. Perry;E. Howe;J. Donath,Massachusetts Institute of Technology,,"visualization, history, public space",32,15,15,
Vis,2004,Centroidal Voronoi tessellation based algorithms for vector fields visualization and segmentation,10.1109/VISUAL.2004.13,http://dx.doi.org/10.1109/VISUAL.2004.13,43,50,C,"A new method for the simplification and the visualization of vector fields is presented based on the notion of centroidal Voronoi tessellations (CVT's). A CVT is a special Voronoi tessellation for which the generators of the Voronoi regions in the tessellation are also the centers of mass (or means) with respect to a prescribed density. A distance function in both the spatial and vector spaces is introduced to measure the similarity of the spatially distributed vector fields. Based on such a distance, vector fields are naturally clustered and their simplified representations are obtained. Our method combines simple geometric intuitions with the rigorously established optimality properties of the CVTs. It is simple to describe, easy to understand and implement. Numerical examples are also provided to illustrate the effectiveness and competitiveness of the CVT-based vector simplification and visualization methodology.",Qiang Du 0001;Xiaoqiang Wang,Qiang Du;Xiaoquiang Wang,"Dept. of Math., Pennsylvania State Univ., University Park, PA, USA;Dept. of Math., Pennsylvania State Univ., University Park, PA, USA",10.1109/VISUAL.1999.809865;10.1109/VISUAL.1995.480817,"Flow Visualization, Vector Field, Simplification, Segmentation, Clustering, Centroidal Voronoi tessellation",32,8,18,
Vis,2005,Reflection nebula visualization,10.1109/VISUAL.2005.1532803,http://dx.doi.org/10.1109/VISUAL.2005.1532803,255,262,C,"Stars form in dense clouds of interstellar gas and dust. The residual dust surrounding a young star scatters and diffuses its light, making the star's ""cocoon"" of dust observable from Earth. The resulting structures, called reflection nebulae, are commonly very colorful in appearance due to wavelength-dependent effects in the scattering and extinction of light. The intricate interplay of scattering and extinction cause the color hues, brightness distributions, and the apparent shapes of such nebulae to vary greatly with viewpoint. We describe an interactive visualization tool for realistically rendering the appearance of arbitrary 3D dust distributions surrounding one or more illuminating stars. Our rendering algorithm is based on the physical models used in astrophysics research. The tool can be used to create virtual fly-throughs of reflection nebulae for interactive desktop visualizations, or to produce scientifically accurate animations for educational purposes, e.g., in planetarium shows. The algorithm is also applicable to investigate on-the-fly the visual effects of physical parameter variations, exploiting visualization technology to help gain a deeper and more intuitive understanding of the complex interaction of light and dust in real astrophysical settings.",Marcus A. Magnor;Kristian Hildebrand;Andrei Lintu;Andrew J. Hanson,M.A. Magnor;K. Hildebrand;A. Lintu;A.J. Hanson,,10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2004.18,"volume rendering, global illumination, dust, nebula,astronomy",32,11,32,
Vis,2005,A handheld flexible display system,10.1109/VISUAL.2005.1532846,http://dx.doi.org/10.1109/VISUAL.2005.1532846,591,597,C,"A new close range virtual reality system is introduced that allows intuitive and immersive user interaction with computer generated objects. A projector with a special spherical lens is combined with a flexible, tracked rear projection screen that users hold in their hands. Unlike normal projectors, the spherical lens allows for a 180 degree field of view and nearly infinite depth of focus. This allows the user to move the screen around the environment and use it as a virtual ""slice"" to examine the interior of 3D volumes. This provides a concrete correspondence between the virtual representation of the 3D volume and how that volume would actually appear if its real counterpart was sliced open. The screen can also be used as a ""magic window"" to view the mesh of the volume from different angles prior to taking cross sections of it. Real time rendering of the desired 3D volume or mesh is accomplished using current graphics hardware. Additional applications of the system are also discussed.",Jonathan Konieczny;Clement Shimizu;Gary W. Meyer;D'nardo Colucci,J. Konieczny;C. Shimizu;G. Meyer;D. Colucci,"Digital Technol. Center, Minnesota Univ., Minneapolis, MN, USA;Digital Technol. Center, Minnesota Univ., Minneapolis, MN, USA;Digital Technol. Center, Minnesota Univ., Minneapolis, MN, USA;Digital Technol. Center, Minnesota Univ., Minneapolis, MN, USA",10.1109/VISUAL.2001.964508;10.1109/VISUAL.2003.1250351,"visualization, virtual reality, user interfaces, projectors, volume rendering, curved sections",32,6,11,
Vis,2007,Visualizing Large-Scale Uncertainty in Astrophysical Data,10.1109/TVCG.2007.70530,http://dx.doi.org/10.1109/TVCG.2007.70530,1640,1647,J,"Visualization of uncertainty or error in astrophysical data is seldom available in simulations of astronomical phenomena, and yet almost all rendered attributes possess some degree of uncertainty due to observational error. Uncertainties associated with spatial location typically vary significantly with scale and thus introduce further complexity in the interpretation of a given visualization. This paper introduces effective techniques for visualizing uncertainty in large-scale virtual astrophysical environments. Building upon our previous transparently scalable visualization architecture, we develop tools that enhance the perception and comprehension of uncertainty across wide scale ranges. Our methods include a unified color-coding scheme for representing log-scale distances and percentage errors, an ellipsoid model to represent positional uncertainty, an ellipsoid envelope model to expose trajectory uncertainty, and a magic-glass design supporting the selection of ranges of log-scale distance and uncertainty parameters, as well as an overview mode and a scalable WIM tool for exposing the magnitudes of spatial context and uncertainty.",Hongwei Li;Chi-Wing Fu;Yinggang Li;Andrew J. Hanson,Hongwei Li;Chi-Wing Fu;Yinggang Li;Andrew Hanson,"Hong Kong University of Science & Technology;Hong Kong University of Science & Technology;Indiana University, Bloomington;Indiana University, Bloomington",10.1109/VISUAL.2000.885679;10.1109/VISUAL.2002.1183769;10.1109/VISUAL.2003.1250404;10.1109/VISUAL.2005.1532807;10.1109/TVCG.2006.155;10.1109/TVCG.2006.176;10.1109/VISUAL.2004.25;10.1109/VISUAL.2005.1532853;10.1109/VISUAL.1996.568116;10.1109/VISUAL.2002.1183824;10.1109/VISUAL.1996.568105;10.1109/INFVIS.2002.1173145;10.1109/VISUAL.2005.1532803;10.1109/VISUAL.2004.18,"Uncertainty visualization, large spatial scale, interstellar data, astronomy",32,24,50,
Vis,2008,Surface Extraction from Multi-field Particle Volume Data Using Multi-dimensional Cluster Visualization,10.1109/TVCG.2008.167,http://dx.doi.org/10.1109/TVCG.2008.167,1483,1490,J,"Data sets resulting from physical simulations typically contain a multitude of physical variables. It is, therefore, desirable that visualization methods take into account the entire multi-field volume data rather than concentrating on one variable. We present a visualization approach based on surface extraction from multi-field particle volume data. The surfaces segment the data with respect to the underlying multi-variate function. Decisions on segmentation properties are based on the analysis of the multi-dimensional feature space. The feature space exploration is performed by an automated multi-dimensional hierarchical clustering method, whose resulting density clusters are shown in the form of density level sets in a 3D star coordinate layout. In the star coordinate layout, the user can select clusters of interest. A selected cluster in feature space corresponds to a segmenting surface in object space. Based on the segmentation property induced by the cluster membership, we extract a surface from the volume data. Our driving applications are smoothed particle hydrodynamics (SPH) simulations, where each particle carries multiple properties. The data sets are given in the form of unstructured point-based volume data. We directly extract our surfaces from such data without prior resampling or grid generation. The surface extraction computes individual points on the surface, which is supported by an efficient neighborhood computation. The extracted surface points are rendered using point-based rendering operations. Our approach combines methods in scientific visualization for object-space operations with methods in information visualization for feature-space operations.",Lars Linsen;Tran Van Long;Paul Rosenthal;Stephan Rosswog,Lars Linsen;Tran Van Long;Paul Rosenthal;Stephan Rosswog,Jacobs University;Jacobs University;Jacobs University;Jacobs University,10.1109/TVCG.2007.70615;10.1109/TVCG.2006.164;10.1109/TVCG.2007.70569;10.1109/TVCG.2006.165;10.1109/TVCG.2007.70526,"Multi-field and multi-variate visualization, isosurfaces and surface extraction, point-based visualization, star coordinates, visualization in astrophysics, particle simulations",32,23,49,
Vis,2008,Visualizing Temporal Patterns in Large Multivariate Data using Textual Pattern Matching,10.1109/TVCG.2008.184,http://dx.doi.org/10.1109/TVCG.2008.184,1467,1474,J,"Extracting and visualizing temporal patterns in large scientific data is an open problem in visualization research. First, there are few proven methods to flexibly and concisely define general temporal patterns for visualization. Second, with large time-dependent data sets, as typical with todaypsilas large-scale simulations, scalable and general solutions for handling the data are still not widely available. In this work, we have developed a textual pattern matching approach for specifying and identifying general temporal patterns. Besides defining the formalism of the language, we also provide a working implementation with sufficient efficiency and scalability to handle large data sets. Using recent large-scale simulation data from multiple application domains, we demonstrate that our visualization approach is one of the first to empower a concept driven exploration of large-scale time-varying multivariate data.",Markus Glatter;Jian Huang 0007;Sean Ahern;Jamison Daniel;Aidong Lu,Markus Glatter;Jian Huang;Sean Ahern;Jamison Daniel;Aidong Lu,The University of Tennessee at Knoxville;The University of Tennessee at Knoxville;Oak Ridge National Laboratory;Oak Ridge National Laboratory;University of North Carolina at Charlotte,10.1109/VISUAL.2003.1250402;10.1109/TVCG.2007.70600;10.1109/TVCG.2006.175;10.1109/VISUAL.2004.95;10.1109/TVCG.2007.70519;10.1109/VISUAL.2001.964519;10.1109/VISUAL.2005.1532792,"Multivariate visualization, Time-varying, Uncertainty",32,26,8,
VAST,2009,Visual analysis of graphs with multiple connected components,10.1109/VAST.2009.5333893,http://dx.doi.org/10.1109/VAST.2009.5333893,155,162,C,"In this paper, we present a system for the interactive visualization and exploration of graphs with many weakly connected components. The visualization of large graphs has recently received much research attention. However, specific systems for visual analysis of graph data sets consisting of many components are rare. In our approach, we rely on graph clustering using an extensive set of topology descriptors. Specifically, we use the self-organizing-map algorithm in conjunction with a user-adaptable combination of graph features for clustering of graphs. It offers insight into the overall structure of the data set. The clustering output is presented in a grid containing clusters of the connected components of the input graph. Interactive feature selection and task-tailored data views allow the exploration of the whole graph space. The system provides also tools for assessment and display of cluster quality. We demonstrate the usefulness of our system by application to a shareholder network analysis problem based on a large real-world data set. While so far our approach is applied to weighted directed graphs only, it can be used for various graph types.",Tatiana von Landesberger;Melanie Görner;Tobias Schreck,Tatiana von Landesberger;Melanie Gorner;Tobias Schreck,"Interactive Graphics Systems Group, Technische Universität Darmstadt and Fraunhofer IGD, Germany;Interactive Graphics Systems Group, Technische Universität Darmstadt, Germany;Interactive Graphics Systems Group, Technische Universität Darmstadt, Germany",10.1109/TVCG.2006.193;10.1109/TVCG.2008.135;10.1109/INFVIS.2003.1249011;10.1109/TVCG.2006.147,,32,19,48,
Vis,2011,Topological Spines: A Structure-preserving Visual Representation of Scalar fields,10.1109/TVCG.2011.244,http://dx.doi.org/10.1109/TVCG.2011.244,1842,1851,J,"We present topological spines-a new visual representation that preserves the topological and geometric structure of a scalar field. This representation encodes the spatial relationships of the extrema of a scalar field together with the local volume and nesting structure of the surrounding contours. Unlike other topological representations, such as contour trees, our approach preserves the local geometric structure of the scalar field, including structural cycles that are useful for exposing symmetries in the data. To obtain this representation, we describe a novel mechanism based on the extraction of extremum graphs-sparse subsets of the Morse-Smale complex that retain the important structural information without the clutter and occlusion problems that arise from visualizing the entire complex directly. Extremum graphs form a natural multiresolution structure that allows the user to suppress noise and enhance topological features via the specification of a persistence range. Applications of our approach include the visualization of 3D scalar fields without occlusion artifacts, and the exploratory analysis of high-dimensional functions.",Carlos D. Correa;Peter Lindstrom;Peer-Timo Bremer,Carlos Correa;Peter Lindstrom;Peer-Timo Bremer,Lawrence Livermore National Lab;Lawrence Livermore National Lab;Lawrence Livermore National Lab,10.1109/VISUAL.2002.1183772;10.1109/TVCG.2007.70552;10.1109/TVCG.2007.70601;10.1109/VISUAL.2003.1250376;10.1109/TVCG.2009.163;10.1109/TVCG.2008.110;10.1109/TVCG.2010.213;10.1109/VISUAL.2005.1532839;10.1109/TVCG.2006.186,"Scalar field topology, topological spine, extremum graph, Morse-Smale complex",32,32,36,
InfoVis,2014,"Domino: Extracting, Comparing, and Manipulating Subsets Across Multiple Tabular Datasets",10.1109/TVCG.2014.2346260,http://dx.doi.org/10.1109/TVCG.2014.2346260,2023,2032,J,"Answering questions about complex issues often requires analysts to take into account information contained in multiple interconnected datasets. A common strategy in analyzing and visualizing large and heterogeneous data is dividing it into meaningful subsets. Interesting subsets can then be selected and the associated data and the relationships between the subsets visualized. However, neither the extraction and manipulation nor the comparison of subsets is well supported by state-of-the-art techniques. In this paper we present Domino, a novel multiform visualization technique for effectively representing subsets and the relationships between them. By providing comprehensive tools to arrange, combine, and extract subsets, Domino allows users to create both common visualization techniques and advanced visualizations tailored to specific use cases. In addition to the novel technique, we present an implementation that enables analysts to manage the wide range of options that our approach offers. Innovative interactive features such as placeholders and live previews support rapid creation of complex analysis setups. We introduce the technique and the implementation using a simple example and demonstrate scalability and effectiveness in a use case from the field of cancer genomics.",Samuel Gratzl;Nils Gehlenborg;Alexander Lex;Hanspeter Pfister;Marc Streit,Samuel Gratzl;Nils Gehlenborg;Alexander Lex;Hanspeter Pfister;Marc Streit,Johannes Kepler University Linz;Harvard Medical School;Harvard University;Harvard University;Johannes Kepler University Linz,10.1109/TVCG.2009.179;10.1109/TVCG.2010.138;10.1109/VISUAL.1990.146402;10.1109/TVCG.2012.207;10.1109/TVCG.2011.250;10.1109/VISUAL.2005.1532788;10.1109/TVCG.2013.173;10.1109/TVCG.2011.183;10.1109/TVCG.2013.160;10.1109/TVCG.2011.201;10.1109/TVCG.2006.166;10.1109/INFVIS.2005.1532152;10.1109/INFVIS.2004.15;10.1109/TVCG.2007.70521,"Multiple coordinated views, visual linking, relationships, heterogeneous data, categorical data",32,31,37,HM
SciVis,2014,Characterizing Molecular Interactions in Chemical Systems,10.1109/TVCG.2014.2346403,http://dx.doi.org/10.1109/TVCG.2014.2346403,2476,2485,J,"Interactions between atoms have a major influence on the chemical properties of molecular systems. While covalent interactions impose the structural integrity of molecules, noncovalent interactions govern more subtle phenomena such as protein folding, bonding or self assembly. The understanding of these types of interactions is necessary for the interpretation of many biological processes and chemical design tasks. While traditionally the electron density is analyzed to interpret the quantum chemistry of a molecular system, noncovalent interactions are characterized by low electron densities and only slight variations of them - challenging their extraction and characterization. Recently, the signed electron density and the reduced gradient, two scalar fields derived from the electron density, have drawn much attention in quantum chemistry since they enable a qualitative visualization of these interactions even in complex molecular systems and experimental measurements. In this work, we present the first combinatorial algorithm for the automated extraction and characterization of covalent and noncovalent interactions in molecular systems. The proposed algorithm is based on a joint topological analysis of the signed electron density and the reduced gradient. Combining the connectivity information of the critical points of these two scalar fields enables to visualize, enumerate, classify and investigate molecular interactions in a robust manner. Experiments on a variety of molecular systems, from simple dimers to proteins or DNA, demonstrate the ability of our technique to robustly extract these interactions and to reveal their structural relations to the atoms and bonds forming the molecules. For simple systems, our analysis corroborates the observations made by the chemists while it provides new visual and quantitative insights on chemical interactions for larger molecular systems.",David Günther;Roberto Álvarez Boto;Juila Contreras-Garcia;Jean-Philip Piquemal;Julien Tierny,David Günther;Roberto A. Boto;Juila Contreras-Garcia;Jean-Philip Piquemal;Julien Tierny,"Institut-Mines-Télécom, Paris, France;Sorbonne Universités, Paris, France;Sorbonne Universités, Paris, France;Sorbonne Universités, Paris, France;CNRS LIP6, UPMC, Paris, France",10.1109/TVCG.2009.163;10.1109/VISUAL.2004.96;10.1109/VISUAL.2003.1250376;10.1109/TVCG.2008.110;10.1109/TVCG.2009.157;10.1109/TVCG.2011.259;10.1109/TVCG.2007.70578;10.1109/TVCG.2013.158,"Molecular Chemistry, Topological Data Analysis, Morse-Smale Complex, Join Tree",32,32,58,
InfoVis,2015,How do People Make Sense of Unfamiliar Visualizations?: A Grounded Model of Novice's Information Visualization Sensemaking,10.1109/TVCG.2015.2467195,http://dx.doi.org/10.1109/TVCG.2015.2467195,499,508,J,"In this paper, we would like to investigate how people make sense of unfamiliar information visualizations. In order to achieve the research goal, we conducted a qualitative study by observing 13 participants when they endeavored to make sense of three unfamiliar visualizations (i.e., a parallel-coordinates plot, a chord diagram, and a treemap) that they encountered for the first time. We collected data including audio/video record of think-aloud sessions and semi-structured interview; and analyzed the data using the grounded theory method. The primary result of this study is a grounded model of NOvice's information VIsualization Sensemaking (NOVIS model), which consists of the five major cognitive activities: 1 encountering visualization, 2 constructing a frame, 3 exploring visualization, 4 questioning the frame, and 5 floundering on visualization. We introduce the NOVIS model by explaining the five activities with representative quotes from our participants. We also explore the dynamics in the model. Lastly, we compare with other existing models and share further research directions that arose from our observations.",Sukwon Lee;Sung-Hee Kim;Ya-Hsin Hung;Heidi Lam;Youn ah Kang;Ji Soo Yi,Sukwon Lee;Sung-Hee Kim;Ya-Hsin Hung;Heidi Lam;Youn-Ah Kang;Ji Soo Yi,"School of Industrial Engineering, Purdue University, West Lafayette, IN, USA;Department of Computer Science, University of British Columbia, Vancouver, BC, Canada;School of Industrial Engineering, Purdue University, West Lafayette, IN, USA;Google Inc., Mountain View, CA, USA;Techno-Art Division, Information and Interaction Design, Incheon, South Korea;School of Industrial Engineering, Purdue University, West Lafayette, IN, USA",10.1109/TVCG.2013.234;10.1109/TVCG.2014.2346984;10.1109/TVCG.2010.164;10.1109/VAST.2011.6102435;10.1109/TVCG.2014.2346452;10.1109/TVCG.2010.177;10.1109/TVCG.2014.2346481;10.1109/TVCG.2010.179;10.1109/TVCG.2007.70515,"Sensemaking model, information visualization, novice users, grounded theory, qualitative study",32,36,48,
VAST,2015,Temporal MDS Plots for Analysis of Multivariate Data,10.1109/TVCG.2015.2467553,http://dx.doi.org/10.1109/TVCG.2015.2467553,141,150,J,"Multivariate time series data can be found in many application domains. Examples include data from computer networks, healthcare, social networks, or financial markets. Often, patterns in such data evolve over time among multiple dimensions and are hard to detect. Dimensionality reduction methods such as PCA and MDS allow analysis and visualization of multivariate data, but per se do not provide means to explore multivariate patterns over time. We propose Temporal Multidimensional Scaling (TMDS), a novel visualization technique that computes temporal one-dimensional MDS plots for multivariate data which evolve over time. Using a sliding window approach, MDS is computed for each data window separately, and the results are plotted sequentially along the time axis, taking care of plot alignment. Our TMDS plots enable visual identification of patterns based on multidimensional similarity of the data evolving over time. We demonstrate the usefulness of our approach in the field of network security and show in two case studies how users can iteratively explore the data to identify previously unknown, temporally evolving patterns.",Dominik Jäckle;Fabian Fischer 0001;Tobias Schreck;Daniel A. Keim,Dominik Jäckle;Fabian Fischer;Tobias Schreck;Daniel A. Keim,"University of Konstanz, Germany;University of Konstanz, Germany;Graz University of Technology, Austria;University of Konstanz, Germany",10.1109/VAST.2009.5332593;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1995.485140;10.1109/VISUAL.1990.146386;10.1109/TVCG.2007.70592;10.1109/VAST.2009.5332628,"Multivariate Data, Time Series, Data Reduction, Multidimensional Scaling",32,34,41,
InfoVis,2016,"Hashedcubes: Simple, Low Memory, Real-Time Visual Exploration of Big Data",10.1109/TVCG.2016.2598624,http://dx.doi.org/10.1109/TVCG.2016.2598624,671,680,J,"We propose Hashedcubes, a data structure that enables real-time visual exploration of large datasets that improves the state of the art by virtue of its low memory requirements, low query latencies, and implementation simplicity. In some instances, Hashedcubes notably requires two orders of magnitude less space than recent data cube visualization proposals. In this paper, we describe the algorithms to build and query Hashedcubes, and how it can drive well-known interactive visualizations such as binned scatterplots, linked histograms and heatmaps. We report memory usage, build time and query latencies for a variety of synthetic and real-world datasets, and find that although sometimes Hashedcubes offers slightly slower querying times to the state of the art, the typical query is answered fast enough to easily sustain a interaction. In datasets with hundreds of millions of elements, only about 2% of the queries take longer than 40ms. Finally, we discuss the limitations of data structure, potential spacetime tradeoffs, and future research directions.",Cícero A. L. Pahins;Sean A. Stephens;Carlos Scheidegger;João Luiz Dihl Comba,Cícero A. L. Pahins;Sean A. Stephens;Carlos Scheidegger;João L. D. Comba,Instituto de InformáticaUFRGS;University of Arizona;University of Arizona;Instituto de InformáticaUFRGS,10.1109/TVCG.2013.179;10.1109/TVCG.2014.2346452;10.1109/TVCG.2014.2346574;10.1109/TVCG.2015.2467771,Scalability;data cube;multidimensional data;interactive exploration,32,38,45,
VAST,2016,ViDX: Visual Diagnostics of Assembly Line Performance in Smart Factories,10.1109/TVCG.2016.2598664,http://dx.doi.org/10.1109/TVCG.2016.2598664,291,300,J,"Visual analytics plays a key role in the era of connected industry (or industry 4.0, industrial internet) as modern machines and assembly lines generate large amounts of data and effective visual exploration techniques are needed for troubleshooting, process optimization, and decision making. However, developing effective visual analytics solutions for this application domain is a challenging task due to the sheer volume and the complexity of the data collected in the manufacturing processes. We report the design and implementation of a comprehensive visual analytics system, ViDX. It supports both real-time tracking of assembly line performance and historical data exploration to identify inefficiencies, locate anomalies, and form hypotheses about their causes and effects. The system is designed based on a set of requirements gathered through discussions with the managers and operators from manufacturing sites. It features interlinked views displaying data at different levels of detail. In particular, we apply and extend the Marey's graph by introducing a time-aware outlier-preserving visual aggregation technique to support effective troubleshooting in manufacturing processes. We also introduce two novel interaction techniques, namely the quantiles brush and samples brush, for the users to interactively steer the outlier detection algorithms. We evaluate the system with example use cases and an in-depth user interview, both conducted together with the managers and operators from manufacturing plants. The result demonstrates its effectiveness and reports a successful pilot application of visual analytics for manufacturing in smart factories.",Panpan Xu;Honghui Mei;Ren Liu;Wei Chen 0001,Panpan Xu;Honghui Mei;Liu Ren;Wei Chen,Bosch Research North America;Zhejiang University;Bosch Research North America;Zhejiang University,10.1109/TVCG.2014.2346454;10.1109/TVCG.2015.2467592;10.1109/TVCG.2006.170;10.1109/TVCG.2015.2467622;10.1109/TVCG.2014.2346682;10.1109/TVCG.2012.225;10.1109/TVCG.2013.200;10.1109/INFVIS.2002.1173149;10.1109/TVCG.2011.185,Temporal Data;Marey's Graph;Visual Analytics;Manufacturing;Smart Factory;Connected Industry;Industry 4.0,32,37,36,HM
InfoVis,2017,Modeling Color Difference for Visualization Design,10.1109/TVCG.2017.2744359,http://dx.doi.org/10.1109/TVCG.2017.2744359,392,401,J,"Color is frequently used to encode values in visualizations. For color encodings to be effective, the mapping between colors and values must preserve important differences in the data. However, most guidelines for effective color choice in visualization are based on either color perceptions measured using large, uniform fields in optimal viewing environments or on qualitative intuitions. These limitations may cause data misinterpretation in visualizations, which frequently use small, elongated marks. Our goal is to develop quantitative metrics to help people use color more effectively in visualizations. We present a series of crowdsourced studies measuring color difference perceptions for three common mark types: points, bars, and lines. Our results indicate that peoples' abilities to perceive color differences varies significantly across mark types. Probabilistic models constructed from the resulting data can provide objective guidance for designers, allowing them to anticipate viewer perceptions in order to inform effective encoding design.",Danielle Albers Szafir,Danielle Albers Szafir,University of Colorado,10.1109/VISUAL.1995.480803;10.1109/TVCG.2011.185;10.1109/TVCG.2010.154;10.1109/TVCG.2014.2346978;10.1109/TVCG.2016.2598918;10.1109/VISUAL.1996.568118;10.1109/TVCG.2011.194;10.1109/TVCG.2012.279;10.1109/TVCG.2016.2599106;10.1109/TVCG.2016.2599030;10.1109/TVCG.2008.118,"Color Perception,Graphical Perception,Color Models,Crowdsourcing",32,24,55,BP
Vis,1990,Visualizing a scalar field on an N-dimensional lattice,10.1109/VISUAL.1990.146389,http://dx.doi.org/10.1109/VISUAL.1990.146389,255,"262, 479-480",C,"The authors address the problem of visualizing a scalar dependent variable which is a function of many independent variables. In particular, cases where the number of independent variables is three or greater are discussed. A new hierarchical method of plotting that allows one to interactively view millions of data points with up to 10 independent variables is presented. The technique is confined to the case where each independent variable is sampled in a regular grid or lattice-like fashion, i.e., in equal increments. The proposed technique can be described in either an active or a passive manner. In the active view the points of the N-dimensional independent variables lattice are mapped to a single horizontal axis in a hierarchical manner, while in the passive view an observer samples the points of the N-dimensional lattice in a prescribed fashion and notes the values of the dependent variable. In the passive view a plot of the dependent variable versus a single parametric variable, which is simply the sampling number, forms the multidimensional graph.&lt;&lt;ETX&gt;&gt;",Ted Mihalisin;E. Grawlinksi;John Timlin;John Schwegler,T. Mihalisin;E. Gawlinski;J. Timlin;J. Schwegler,"Dept. of Phys., Temple Univ., Philadelphia, PA, USA;Dept. of Phys., Temple Univ., Philadelphia, PA, USA;Dept. of Phys., Temple Univ., Philadelphia, PA, USA;Dept. of Phys., Temple Univ., Philadelphia, PA, USA",,,31,11,3,
Vis,1991,Visualizing the fourth dimension using geometry and light,10.1109/VISUAL.1991.175821,http://dx.doi.org/10.1109/VISUAL.1991.175821,321,"328, 432",C,"Techniques for visualizing mathematical objects in four-dimensional (4D) space that exploit four-dimensional lighting effects are explored. The geometry of image production, stereography, and shadows in 4D is analyzed. Alternatives for smooth and specular shaded rendering of curves, surfaces, and solids in 4D are examined and a new approach that systematically converts curves or surfaces into uniquely renderable solids in 4D space by attaching spheres or circles to each point is proposed. Analogs of 3D shading methods are used to produce volume renderings that distinguish objects whose 3D projections from 4D are identical. Analyzing the procedures needed to justify and evaluate a system as this for teaching humans to 'see' in four dimensions leads to the proposal of a generally applicable four-step visualization paradigm.&lt;&lt;ETX&gt;&gt;",Andrew J. Hanson;Pheng-Ann Heng,A.J. Hanson;P.A. Heng,"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA;Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA",10.1109/VISUAL.1990.146370,,31,12,22,
Vis,1993,Rapid exploration of curvilinear grids using direct volume rendering (Extended Abstract),10.1109/VISUAL.1993.398853,http://dx.doi.org/10.1109/VISUAL.1993.398853,70,77,C,"Fast techniques for direct volume rendering over curvilinear grids (common to computational fluid dynamics and finite element analysis) are developed. Three new projection methods that use polygon-rendering hardware for speed are presented and compared with each other and with previous methods for tetrahedral grids and rectilinear grids. A simplified algorithm for visibility ordering, based on a combination of breadth-first and depth-first searches, is described. A new multi-pass blending method is described that reduces visual artifacts that are introduced by linear interpolation in hardware where exponential interpolation is needed. Visualization tools that permit rapid data banding and cycling through transfer functions, as well as region restriction, are described.&lt;&lt;ETX&gt;&gt;",Allen Van Gelder;Jane Wilhelms,A. Van Gelder;J. Wilhelms,"Comput. & Inf. Sci., California Univ., Santa Cruz, CA, USA;Comput. & Inf. Sci., California Univ., Santa Cruz, CA, USA",10.1109/VISUAL.1992.235204;10.1109/VISUAL.1992.235228,,31,17,21,
Vis,1994,A lattice model for data display,10.1109/VISUAL.1994.346304,http://dx.doi.org/10.1109/VISUAL.1994.346304,310,317,C,"In order to develop a foundation for visualization, we develop lattice models for data objects and displays that focus on the fact that data objects are approximations to mathematical objects and real displays are approximations to ideal displays. These lattice models give us a way to quantize the information content of data and displays and to define conditions on the visualization mappings from data to displays. Mappings satisfy these conditions if and only if they are lattice isomorphisms. We show how to apply this result to scientific data and display models, and discuss how it might be applied to recursively defined data types appropriate for complex information processing.&lt;&lt;ETX&gt;&gt;",William L. Hibbard;Charles R. Dyer;Brian E. Paul,W.L. Hibbard;C.R. Dyer;B.E. Paul,"Space Sci. & Eng. Center, Wisconsin Univ., Madison, WI, USA",10.1109/VISUAL.1992.235205;10.1109/VISUAL.1992.235202;10.1109/VISUAL.1991.175818;10.1109/VISUAL.1992.235215,,31,18,18,
Vis,1995,3D computational steering with parametrized geometric objects,10.1109/VISUAL.1995.485143,http://dx.doi.org/10.1109/VISUAL.1995.485143,304,"311, 466",C,"Computational steering is the ultimate goal of interactive simulation: researchers change parameters of their simulation and immediately receive feedback on the effect. We present a general and flexible graphics tool that is part of an environment for computational steering developed at CWI. It enables the researcher to interactively develop his own interface with the simulation. This interface is constructed with 3D parametrized geometric objects. The properties of the objects are parametrized to output data and input parameters of the simulation. The objects visualize the output of the simulation, while the researcher can steer the simulation by direct manipulation of the objects. Several applications of 3D computational steering are presented.",Jurriaan D. Mulder;Jarke J. van Wijk,J.D. Mulder;J.J. van Wijk,"Centre for Math. & Comput. Sci., CWI, Amsterdam, Netherlands",10.1109/VISUAL.1991.175812;10.1109/VISUAL.1993.398895;10.1109/VISUAL.1990.146382,,31,12,16,
Vis,1997,An interactive cerebral blood vessel exploration system,10.1109/VISUAL.1997.663917,http://dx.doi.org/10.1109/VISUAL.1997.663917,443,446,C,"An interactive cerebral blood vessel exploration system is described. It has been designed on the basis of neurosurgeons' requirements in order to assist them in the diagnosis of vascular pathologies. The system is based on the construction of a symbolic model of the vascular tree, with automatic identification and labelling of vessel bifurcations, aneurysms and stenoses. It provides several types of visualization: individual MRA (magnetic resonance angiography) slices, MIP (maximum intensity projection), shaded rendering, symbolic schemes and surface reconstruction.",Anna Puig;Dani Tost;Isabel Navazo,A. Puig;D. Tost;I. Navazo,"Polytech. Univ. of Catalonia, Spain",10.1109/VISUAL.1995.480790,"Volume Modelling and Rendering, Medical Applications, Cerebral Blood Vessel",31,9,20,
InfoVis,2000,Metaphor-aware 3D navigation,10.1109/INFVIS.2000.885104,http://dx.doi.org/10.1109/INFVIS.2000.885104,155,165,C,"Anyone who has ever experienced three-dimensional (3D) interfaces will agree that navigating in a 3D world is not a trivial task. The user interface of traditional 3D browsers provides simple navigation tools that allow the user to modify the camera parameters such as orientation, position and focal. Using these tools, it is frequent that, after some movements, the user is lost in the virtual 3D space and usually tries to restart from the beginning. We present how the 3D navigation problem is addressed in the context of the CyberNet project (Abel et al., 2000). Our underlying principle is to help the user navigate by adapting the navigation tool to the virtual world. We feel that the navigation schemes provided by the 3D browsers are too generic for some specific 3D tools and we have developed adaptive navigation features that are dependent on the 3D metaphor used for visualizing the information and on the user's task.",Cristina Russo Dos Santos;Pascal Gros;Pierre Abel;Didier Loisel;N. Trichaud;J. P. Paris,C. Russo dos Santos;P. Gros;P. Abel;D. Loisel;N. Trichaud;J.P. Paris,"Eurecom Inst., Sophia Antipolis, France",10.1109/VISUAL.1997.663876,,31,9,14,
Vis,2000,Visualizing high-dimensional predictive model quality,10.1109/VISUAL.2000.885740,http://dx.doi.org/10.1109/VISUAL.2000.885740,493,496,C,"Using inductive learning techniques to construct classification models from large, high-dimensional data sets is a useful way to make predictions in complex domains. However, these models can be difficult for users to understand. We have developed a set of visualization methods that help users to understand and analyze the behavior of learned models, including techniques for high-dimensional data space projection, display of probabilistic predictions, variable/class correlation, and instance mapping. We show the results of applying these techniques to models constructed from a benchmark data set of census data, and draw conclusions about the utility of these methods for model understanding.",Penny Rheingans;Marie desJardins,P. Rheingans;M. DesJardins,"Dept. of Comput. Sci. & Electr. Eng., Maryland Univ., Baltimore, MD, USA",10.1109/VISUAL.1997.663922;10.1109/INFVIS.1998.729565;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1997.663868,,31,14,14,
InfoVis,2001,Getting along: composition of visualization paradigms,10.1109/INFVIS.2001.963278,http://dx.doi.org/10.1109/INFVIS.2001.963278,37,40,C,,Alan Keahey,T.A. Keahey,"Visual Insights, Inc.",10.1109/INFVIS.1997.636786;10.1109/VISUAL.1992.235217;10.1109/VISUAL.1991.175815;10.1109/INFVIS.1997.636718;10.1109/INFVIS.1997.636784;10.1109/INFVIS.1996.559214;10.1109/INFVIS.1998.729558,,31,6,16,
InfoVis,2002,Process visualization with levels of detail,10.1109/INFVIS.2002.1173149,http://dx.doi.org/10.1109/INFVIS.2002.1173149,67,70,C,"We demonstrate how we apply information visualization techniques to process monitoring. Virtual instruments are enhanced using history encoding instruments are capable of displaying the current value and the value from the near past. Multi-instruments are capable of displaying several data sources simultaneously. Levels of detail for virtual instruments are introduced where the screen area is inversely proportional to the information amount displayed. Furthermore the monitoring system is enhanced by using: 3D anchoring attachment of instruments to positions on a 3D model, collision avoidance a physically based spring model prevents instruments from overlapping, and focus+context rendering - giving the user a possibility to examine particular instruments in detail without loosing the context information.",Kresimir Matkovic;Helwig Hauser;Reinhard Sainitzer;M. Eduard Gröller,K. Matkovic;H. Hauser;R. Sainitzer;M.E. Groller,"VRVis Res. Center, Vienna, Austria;VRVis Res. Center, Vienna, Austria",10.1109/INFVIS.1998.729558;10.1109/INFVIS.2001.963286,"process visualization, information visualization, levels of detail, focus+context visualization",31,19,10,
InfoVis,2005,An evaluation of content browsing techniques for hierarchical space-filling visualizations,10.1109/INFVIS.2005.1532132,http://dx.doi.org/10.1109/INFVIS.2005.1532132,81,88,C,"Space-filling visualizations, such as the TreeMap, are well suited for displaying the properties of nodes in hierarchies. To browse the contents of the hierarchy, the primary mode of interaction is by drilling down through many successive layers. In this paper we introduce a distortion algorithm based on fisheye and continuous zooming techniques for browsing data in the TreeMap representation. The motivation behind the distortion approach is for assisting users to rapidly browse information displayed in the TreeMap without opening successive layers of the hierarchy. Two experiments were conducted to evaluate the new approach. In the first experiment (N=20) the distortion approach is compared to the drill down method. Results show that subjects are quicker and more accurate in locating targets of interest using the distortion method. The second experiment (N=12) evaluates the effectiveness of the two approaches in a task requiring context, we define as the context browsing task. The results show that subjects are quicker and more accurate in locating targets with the distortion technique in the context browsing task.",Kang Shi;Pourang Irani;Pak Ching Li,Kang Shi;Pourang Irani;B. Li,"Dept. of Comput. Sci., Manitoba Univ., Winnipeg, Man., Canada;Dept. of Comput. Sci., Manitoba Univ., Winnipeg, Man., Canada;Dept. of Comput. Sci., Manitoba Univ., Winnipeg, Man., Canada",10.1109/INFVIS.2000.885091;10.1109/INFVIS.2004.21,"browsing, distortion, hierarchy navigation, focus+context, drill-down, space-filling visualization, TreeMap, semantic zooming",31,7,15,
Vis,2005,Build-by-number: rearranging the real world to visualize novel architectural spaces,10.1109/VISUAL.2005.1532789,http://dx.doi.org/10.1109/VISUAL.2005.1532789,143,150,C,"We present build-by-number, a technique for quickly designing architectural structures that can be rendered photorealistically at interactive rates. We combine image-based capturing and rendering with procedural modeling techniques to allow the creation of novel structures in the style of real-world structures. Starting with a simple model recovered from a sparse image set, the model is divided into feature regions, such as doorways, windows, and brick. These feature regions essentially comprise a mapping from model space to image space, and can be recombined to texture a novel model. Procedural rules for the growth and reorganization of the model are automatically derived to allow for very fast editing and design. Further, the redundancies marked by the feature labeling can be used to perform automatic occlusion replacement and color equalization in the finished scene, which is rendered using view-dependent texture mapping on standard graphics hardware. Results using four captured scenes show that a great variety of novel structures can be created very quickly once a captured scene is available, and rendered with a degree of realism comparable to the original scene.",Daniel R. Bekins;Daniel G. Aliaga,D. Bekins;D.G. Aliaga,"Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA;Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA",,,31,11,17,
Vis,2005,Interactive rendering of large unstructured grids using dynamic level-of-detail,10.1109/VISUAL.2005.1532796,http://dx.doi.org/10.1109/VISUAL.2005.1532796,199,206,C,"We describe a new dynamic level-of-detail (LOD) technique that allows real-time rendering of large tetrahedral meshes. Unlike approaches that require hierarchies of tetrahedra, our approach uses a subset of the faces that compose the mesh. No connectivity is used for these faces so our technique eliminates the need for topological information and hierarchical data structures. By operating on a simple set of triangular faces, our algorithm allows a robust and straightforward graphics hardware (GPU) implementation. Because the subset of faces processed can be constrained to arbitrary size, interactive rendering is possible for a wide range of data sets and hardware configurations.",Steven P. Callahan;João Luiz Dihl Comba;Peter Shirley;Cláudio T. Silva,S.P. Callahan;J.L.D. Comba;P. Shirley;C.T. Silva,"Sci. Comput. & Imaging Inst., Utah State Univ., Logan, UT, USA",10.1109/VISUAL.2004.102;10.1109/VISUAL.1999.809908;10.1109/VISUAL.1998.745283;10.1109/VISUAL.2004.85;10.1109/VISUAL.2003.1250390;10.1109/VISUAL.2002.1183778;10.1109/VISUAL.1998.745329;10.1109/VISUAL.2002.1183767;10.1109/VISUAL.2000.885711," interactive volume rendering, multiresolution meshes, level-of-detail, tetrahedral meshes",31,5,41,
Vis,2006,Interactive Point-Based Rendering of Higher-Order Tetrahedral Data,10.1109/TVCG.2006.154,http://dx.doi.org/10.1109/TVCG.2006.154,1229,1236,J,"Computational simulations frequently generate solutions defined over very large tetrahedral volume meshes containing many millions of elements. Furthermore, such solutions may often be expressed using non-linear basis functions. Certain solution techniques, such as discontinuous Galerkin methods, may even produce non-conforming meshes. Such data is difficult to visualize interactively, as it is far too large to fit in memory and many common data reduction techniques, such as mesh simplification, cannot be applied to non-conforming meshes. We introduce a point-based visualization system for interactive rendering of large, potentially non-conforming, tetrahedral meshes. We propose methods for adaptively sampling points from non-linear solution data and for decimating points at run time to fit GPU memory limits. Because these are streaming processes, memory consumption is independent of the input size. We also present an order-independent point rendering method that can efficiently render volumes on the order of 20 million tetrahedra at interactive rates",Yuan Zhou;Michael Garland,Yuan Zhou;Michael Garland,,10.1109/VISUAL.2003.1250406;10.1109/VISUAL.2005.1532796;10.1109/VISUAL.2005.1532776;10.1109/VISUAL.2005.1532809;10.1109/VISUAL.2003.1250404;10.1109/VISUAL.2002.1183757;10.1109/VISUAL.2002.1183771;10.1109/VISUAL.2004.91;10.1109/VISUAL.2003.1250390;10.1109/VISUAL.1999.809868;10.1109/VISUAL.2004.38;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2000.885683;10.1109/VISUAL.2002.1183778;10.1109/VISUAL.2005.1532808;10.1109/VISUAL.2003.1250389;10.1109/VISUAL.1995.480790;10.1109/VISUAL.2004.81;10.1109/VISUAL.2005.1532801,"Interactive large higher-order tetrahedral volume visualization, point-based visualization",31,19,35,
Vis,2006,Progressive Volume Rendering of Large Unstructured Grids,10.1109/TVCG.2006.171,http://dx.doi.org/10.1109/TVCG.2006.171,1307,1314,J,"We describe a new progressive technique that allows real-time rendering of extremely large tetrahedral meshes. Our approach uses a client-server architecture to incrementally stream portions of the mesh from a server to a client which refines the quality of the approximate rendering until it converges to a full quality rendering. The results of previous steps are re-used in each subsequent refinement, thus leading to an efficient rendering. Our novel approach keeps very little geometry on the client and works by refining a set of rendered images at each step. Our interactive representation of the dataset is efficient, light-weight, and high quality. We present a framework for the exploration of large datasets stored on a remote server with a thin client that is capable of rendering and managing full quality volume visualizations",Steven P. Callahan;Louis Bavoil;Valerio Pascucci;Cláudio T. Silva,Steven P. Callahan;Louis Bavoil;Valerio Pascucci;Claudio T. Silva,Scientific Computing and Imaging Institute at the University of Utah;Scientific Computing and Imaging Institute at the University of Utah;Lawrence Livermore National Laboratory;Scientific Computing and Imaging Institute at the University of Utah,10.1109/VISUAL.2005.1532796;10.1109/VISUAL.1998.745713;10.1109/VISUAL.2003.1250390;10.1109/VISUAL.2004.102;10.1109/VISUAL.2005.1532793,"Volume Rendering, Large Unstructured Grids, Client-Server, Progressive Rendering, Level-of-Detail",31,17,26,
Vis,2006,"Superellipsoid-based, Real Symmetric Traceless Tensor Glyphs Motivated by Nematic Liquid Crystal Alignment Visualization",10.1109/TVCG.2006.181,http://dx.doi.org/10.1109/TVCG.2006.181,1197,1204,J,"A glyph-based method for visualizing the nematic liquid crystal alignment tensor is introduced. Unlike previous approaches, the glyph is based upon physically-linked metrics, not offsets of the eigenvalues. These metrics, combined with a set of superellipsoid shapes, communicate both the strength of the crystal's uniaxial alignment and the amount of biaxiality. With small modifications, our approach can visualize any real symmetric traceless tensor",T. J. Jankun-Kelly;Ketan Mehta,T.j. Jankun-Kelly;Ketan Mehta,"Department of Computer Science and Engineering, James Worth Bagley College of Engineering, Mississippi State University, Mississippi State, MS, 39762;Vital Images, 5850 Opus Parkway, Suite 300, Minnetonka, MN 55343. Work completed at Mississippi State University",10.1109/TVCG.2006.133;10.1109/VISUAL.2005.1532770;10.1109/VISUAL.2005.1532773;10.1109/TVCG.2006.182,"scientific visualization, tensor visualization, symmetric traceless tensor, nematic liquid crystals",31,25,25,
InfoVis,2007,Sequential Document Visualization,10.1109/TVCG.2007.70592,http://dx.doi.org/10.1109/TVCG.2007.70592,1208,1215,J,"Documents and other categorical valued time series are often characterized by the frequencies of short range sequential patterns such as n-grams. This representation converts sequential data of varying lengths to high dimensional histogram vectors which are easily modeled by standard statistical models. Unfortunately, the histogram representation ignores most of the medium and long range sequential dependencies making it unsuitable for visualizing sequential data. We present a novel framework for sequential visualization of discrete categorical time series based on the idea of local statistical modeling. The framework embeds categorical time series as smooth curves in the multinomial simplex summarizing the progression of sequential trends. We discuss several visualization techniques based on the above framework and demonstrate their usefulness for document visualization.",Yi Mao;Joshua V. Dillon;Guy Lebanon,Yi Mao;Joshua Dillon;Guy Lebanon,,10.1109/VISUAL.1993.398863;10.1109/VISUAL.1998.745302;10.1109/INFVIS.2001.963287;10.1109/INFVIS.2001.963273;10.1109/INFVIS.2000.885097,"Document visualization, multi-resolution analysis, local fitting",31,15,23,
VAST,2008,Cell phone Mini Challenge: Node-link animation award animating multivariate dynamic social networks,10.1109/VAST.2008.4677393,http://dx.doi.org/10.1109/VAST.2008.4677393,,,M,"This article describes the visualization tool developed for analysing a dynamic social network of phone calls, for the VAST 2008 mini challenge. The tool was designed to highlight temporal changes in the network, by animating different network visual representations. We also explain how animating these network representations, helped to identify key events in the mini challenge problem scenario. Finally, we make some suggestions for future research and development in the area.",Michael Farrugia;Aaron J. Quigley,Michael Farrugia;Aaron Quigley,"University College Dublin, Ireland;University College Dublin, Ireland",,,31,6,6,
Vis,2008,Query-Driven Visualization of Time-Varying Adaptive Mesh Refinement Data,10.1109/TVCG.2008.157,http://dx.doi.org/10.1109/TVCG.2008.157,1715,1722,J,"The visualization and analysis of AMR-based simulations is integral to the process of obtaining new insight in scientific research. We present a new method for performing query-driven visualization and analysis on AMR data, with specific emphasis on time-varying AMR data. Our work introduces a new method that directly addresses the dynamic spatial and temporal properties of AMR grids that challenge many existing visualization techniques. Further, we present the first implementation of query-driven visualization on the GPU that uses a GPU-based indexing structure to both answer queries and efficiently utilize GPU memory. We apply our method to two different science domains to demonstrate its broad applicability.",Luke J. Gosink;John C. Anderson;E. Wes Bethel;Kenneth I. Joy,Miriah Meyer;Luke J. Gosink;John C. Anderson;E. Wes Bethel;Kenneth I. Joy,,10.1109/VISUAL.2000.885704;10.1109/VISUAL.2005.1532792;10.1109/VAST.2006.261437;10.1109/VISUAL.2002.1183820;10.1109/VISUAL.2003.1250402;10.1109/TVCG.2007.70519;10.1109/VISUAL.1993.398869;10.1109/VISUAL.2005.1532793,"AMR, Query-Driven Visualization, Multitemporal Visualization",31,18,33,
Vis,2008,Sinus Endoscopy - Application of Advanced GPU Volume Rendering for Virtual Endoscopy,10.1109/TVCG.2008.161,http://dx.doi.org/10.1109/TVCG.2008.161,1491,1498,J,"For difficult cases in endoscopic sinus surgery, a careful planning of the intervention is necessary. Due to the reduced field of view during the intervention, the surgeons have less information about the surrounding structures in the working area compared to open surgery. Virtual endoscopy enables the visualization of the operating field and additional information, such as risk structures (e.g., optical nerve and skull base) and target structures to be removed (e.g., mucosal swelling). The Sinus Endoscopy system provides the functional range of a virtual endoscopic system with special focus on a realistic representation. Furthermore, by using direct volume rendering, we avoid time-consuming segmentation steps for the use of individual patient datasets. However, the image quality of the endoscopic view can be adjusted in a way that a standard computer with a modern standard graphics card achieves interactive frame rates with low CPU utilization. Thereby, characteristics of the endoscopic view are systematically used for the optimization of the volume rendering speed. The system design was based on a careful analysis of the endoscopic sinus surgery and the resulting needs for computer support. As a small standalone application it can be instantly used for surgical planning and patient education. First results of a clinical evaluation with ENT surgeons were employed to fine-tune the user interface, in particular to reduce the number of controls by using appropriate default values wherever possible. The system was used for preoperative planning in 102 cases, provides useful information for intervention planning (e.g., anatomic variations of the Rec. Frontalis), and closely resembles the intraoperative situation.",Arno Krüger;Christoph Kubisch;Gero Strauß;Bernhard Preim,Arno Krueger;Christoph Kubisch;Bernhard Preim;Gero Strauss,"Department of Simulation and Graphics, Otto-von-Guericke-University of Magdeburg, Germany;Department of Simulation and Graphics, Otto-von-Guericke-University of Magdeburg, Germany;Department of Simulation and Graphics, Otto-von-Guericke-University of Magdeburg, Germany;ENT Department,University Hospital of Leipzig, Germany",10.1109/VISUAL.2003.1250370;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2004.98,"medical visualization, sinus surgery, operation planning, virtual endoscopy, volume rendering",31,27,22,
VAST,2009,finVis: Applied visual analytics for personal financial planning,10.1109/VAST.2009.5333920,http://dx.doi.org/10.1109/VAST.2009.5333920,195,202,C,"FinVis is a visual analytics tool that allows the non-expert casual user to interpret the return, risk and correlation aspects of financial data and make personal finance decisions. This interactive exploratory tool helps the casual decision-maker quickly choose between various financial portfolio options and view possible outcomes. FinVis allows for exploration of inter-temporal data to analyze outcomes of short-term or long-term investment decisions. FinVis helps the user overcome cognitive limitations and understand the impact of correlation between financial instruments in order to reap the benefits of portfolio diversification. Because this software is accessible by non-expert users, decision-makers from the general population can benefit greatly from using FinVis in practical applications. We quantify the value of FinVis using experimental economics methods and find that subjects using the FinVis software make better financial portfolio decisions as compared to subjects using a tabular version with the same information. We also find that FinVis engages the user, which results in greater exploration of the dataset and increased learning as compared to a tabular display. Further, participants using FinVis reported increased confidence in financial decision-making and noted that they were likely to use this tool in practical application.",Stephen Rudolph;Anya Samak;David S. Ebert,Stephen Rudolph;Anya Savikhin;David S. Ebert,"Purdue University Regional Visualization and Analytics Center (PURVAC), USA;Purdue University Department of Economics, USA;Purdue University Regional Visualization and Analytics Center (PURVAC), USA",10.1109/INFVIS.2000.885098;10.1109/INFVIS.1997.636789;10.1109/TVCG.2007.70541;10.1109/INFVIS.2001.963273;10.1109/TVCG.2007.70589;10.1109/TVCG.2007.70577;10.1109/VAST.2008.4677363;10.1109/INFVIS.2003.1249027,"Casual Information Visualization, visual analytics, personal finance, visualization of risk, economic decision-making",31,27,39,
Vis,2009,Hue-Preserving Color Blending,10.1109/TVCG.2009.150,http://dx.doi.org/10.1109/TVCG.2009.150,1275,1282,J,"We propose a new perception-guided compositing operator for color blending. The operator maintains the same rules for achromatic compositing as standard operators (such as the over operator), but it modifies the computation of the chromatic channels. Chromatic compositing aims at preserving the hue of the input colors; color continuity is achieved by reducing the saturation of colors that are to change their hue value. The main benefit of hue preservation is that color can be used for proper visual labeling, even under the constraint of transparency rendering or image overlays. Therefore, the visualization of nominal data is improved. Hue-preserving blending can be used in any existing compositing algorithm, and it is particularly useful for volume rendering. The usefulness of hue-preserving blending and its visual characteristics are shown for several examples of volume visualization.",Johnson Chuang;Daniel Weiskopf;Torsten Möller,Johnson Chuang;Daniel Weiskopf;Torsten Moller,Simon Fraser University;Universit&#x0E4;t Stuttgart;Simon Fraser University,10.1109/VISUAL.1996.568118;10.1109/TVCG.2008.118;10.1109/TVCG.2006.183,"Image compositing, perceptual transparency, color blending, volume rendering, illustrative visualization",31,27,35,
Vis,2009,Visual Exploration of Nasal Airflow,10.1109/TVCG.2009.198,http://dx.doi.org/10.1109/TVCG.2009.198,1407,1414,J,"Rhinologists are often faced with the challenge of assessing nasal breathing from a functional point of view to derive effective therapeutic interventions. While the complex nasal anatomy can be revealed by visual inspection and medical imaging, only vague information is available regarding the nasal airflow itself: Rhinomanometry delivers rather unspecific integral information on the pressure gradient as well as on total flow and nasal flow resistance. In this article we demonstrate how the understanding of physiological nasal breathing can be improved by simulating and visually analyzing nasal airflow, based on an anatomically correct model of the upper human respiratory tract. In particular we demonstrate how various information visualization (InfoVis) techniques, such as a highly scalable implementation of parallel coordinates, time series visualizations, as well as unstructured grid multi-volume rendering, all integrated within a multiple linked views framework, can be utilized to gain a deeper understanding of nasal breathing. Evaluation is accomplished by visual exploration of spatio-temporal airflow characteristics that include not only information on flow features but also on accompanying quantities such as temperature and humidity. To our knowledge, this is the first in-depth visual exploration of the physiological function of the nose over several simulated breathing cycles under consideration of a complete model of the nasal airways, realistic boundary conditions, and all physically relevant time-varying quantities.",Stefan Zachow;Philipp Muigg;Thomas Hildebrandt;Helmut Doleisch;Hans-Christian Hege,Stefan Zachow;Philipp Muigg;Thomas Hildebrandt;Helmut Doleisch;Hans-Christian Hege,"Zuse Institute Berlin (ZIB);Vienna University of Technology and SimVis GmbH, Austria;Asklepios Clinic Birkenwerder;SimVis GmbH, Austria;Zuse Institute Berlin (ZIB)",10.1109/TVCG.2008.139;10.1109/TVCG.2007.70588;10.1109/VISUAL.2003.1250390;10.1109/VISUAL.2000.885739;10.1109/VISUAL.1990.146402;10.1109/VISUAL.2005.1532788;10.1109/TVCG.2006.170,"Flow visualization, exploratory data analysis, interactive visual analysis of scientific data, time-dependent data",31,23,44,
InfoVis,2012,Does an Eye Tracker Tell the Truth about Visualizations?: findings while Investigating Visualizations for Decision Making,10.1109/TVCG.2012.215,http://dx.doi.org/10.1109/TVCG.2012.215,2421,2430,J,"For information visualization researchers, eye tracking has been a useful tool to investigate research participants' underlying cognitive processes by tracking their eye movements while they interact with visual techniques. We used an eye tracker to better understand why participants with a variant of a tabular visualization called `SimulSort' outperformed ones with a conventional table and typical one-column sorting feature (i.e., Typical Sorting). The collected eye-tracking data certainly shed light on the detailed cognitive processes of the participants; SimulSort helped with decision-making tasks by promoting efficient browsing behavior and compensatory decision-making strategies. However, more interestingly, we also found unexpected eye-tracking patterns with Simul- Sort. We investigated the cause of the unexpected patterns through a crowdsourcing-based study (i.e., Experiment 2), which elicited an important limitation of the eye tracking method: incapability of capturing peripheral vision. This particular result would be a caveat for other visualization researchers who plan to use an eye tracker in their studies. In addition, the method to use a testing stimulus (i.e., influential column) in Experiment 2 to verify the existence of such limitations would be useful for researchers who would like to verify their eye tracking results.",Sung-Hee Kim;Zhihua Dong;Hanjun Xian;Benjavan Upatising;Ji Soo Yi,Sung-Hee Kim;Zhihua Dong;Hanjun Xian;Benjavan Upatising;Ji Soo Yi,Purdue University;Purdue University;Purdue University;Purdue University;Purdue University,10.1109/VISUAL.1990.146402;10.1109/TVCG.2011.193;10.1109/VAST.2008.4677363;10.1109/TVCG.2010.149;10.1109/TVCG.2011.183;10.1109/VAST.2009.5333920,"Visualized decision making, eye tracking, crowdsourcing, quantitative empirical study, limitations, peripheral vision",31,26,55,
InfoVis,2012,Visualizing Flow of Uncertainty through Analytical Processes,10.1109/TVCG.2012.285,http://dx.doi.org/10.1109/TVCG.2012.285,2526,2535,J,"Uncertainty can arise in any stage of a visual analytics process, especially in data-intensive applications with a sequence of data transformations. Additionally, throughout the process of multidimensional, multivariate data analysis, uncertainty due to data transformation and integration may split, merge, increase, or decrease. This dynamic characteristic along with other features of uncertainty pose a great challenge to effective uncertainty-aware visualization. This paper presents a new framework for modeling uncertainty and characterizing the evolution of the uncertainty information through analytical processes. Based on the framework, we have designed a visual metaphor called uncertainty flow to visually and intuitively summarize how uncertainty information propagates over the whole analysis pipeline. Our system allows analysts to interact with and analyze the uncertainty information at different levels of detail. Three experiments were conducted to demonstrate the effectiveness and intuitiveness of our design.",Yingcai Wu;Guo-Xun Yuan;Kwan-Liu Ma,Yingcai Wu;Guo-Xun Yuan;Kwan-Liu Ma,"University of California, Davis;University of California, Davis;University of California, Davis",10.1109/TVCG.2008.137;10.1109/TVCG.2011.178;10.1109/INFVIS.2004.2;10.1109/INFVIS.2002.1173145;10.1109/VISUAL.1993.398857;10.1109/VAST.2009.5332611;10.1109/TVCG.2010.183;10.1109/TVCG.2009.114;10.1109/TVCG.2011.197;10.1109/TVCG.2010.176,"Uncertainty visualization, uncertainty quantification, uncertainty propagation, error ellipsoids, uncertainty fusion",31,34,46,
InfoVis,2013,Creative User-Centered Visualization Design for Energy Analysts and Modelers,10.1109/TVCG.2013.145,http://dx.doi.org/10.1109/TVCG.2013.145,2516,2525,J,"We enhance a user-centered design process with techniques that deliberately promote creativity to identify opportunities for the visualization of data generated by a major energy supplier. Visualization prototypes developed in this way prove effective in a situation whereby data sets are largely unknown and requirements open - enabling successful exploration of possibilities for visualization in Smart Home data analysis. The process gives rise to novel designs and design metaphors including data sculpting. It suggests: that the deliberate use of creativity techniques with data stakeholders is likely to contribute to successful, novel and effective solutions; that being explicit about creativity may contribute to designers developing creative solutions; that using creativity techniques early in the design process may result in a creative approach persisting throughout the process. The work constitutes the first systematic visualization design for a data rich source that will be increasingly important to energy suppliers and consumers as Smart Meter technology is widely deployed. It is novel in explicitly employing creativity techniques at the requirements stage of visualization design and development, paving the way for further use and study of creativity methods in visualization design.",Sarah Goodwin;Jason Dykes;Sara Jones 0001;Iain Dillingham;Graham Dove;Alison Duffy;Alexander Kachkaev;Aidan Slingsby;Jo Wood,Sarah Goodwin;Jason Dykes;Sara Jones;Iain Dillingham;Graham Dove;Alison Duffy;Alexander Kachkaev;Aidan Slingsby;Jo Wood,"giCentre, City University London;giCentre, City University London;Centre for Creativity in Professional Practice, City University London;giCentre, City University London;Centre for Creativity in Professional Practice, City University London;Centre for Creativity in Professional Practice, City University London;giCentre, City University London;giCentre, City University London;giCentre, City University London",10.1109/TVCG.2010.191;10.1109/TVCG.2012.213;10.1109/TVCG.2011.196;10.1109/TVCG.2007.70539;10.1109/INFVIS.1999.801851;10.1109/TVCG.2011.209,"Creativity techniques, user-centered design, data visualization, smart home, energy consumption",31,33,57,
InfoVis,2013,Orthographic Star Coordinates,10.1109/TVCG.2013.182,http://dx.doi.org/10.1109/TVCG.2013.182,2615,2624,J,"Star coordinates is a popular projection technique from an nD data space to a 2D/3D visualization domain. It is defined by setting n coordinate axes in the visualization domain. Since it generally defines an affine projection, strong distortions can occur: an nD sphere can be mapped to an ellipse of arbitrary size and aspect ratio. We propose to restrict star coordinates to orthographic projections which map an nD sphere of radius r to a 2D circle of radius r. We achieve this by formulating conditions for the coordinate axes to define orthographic projections, and by running a repeated non-linear optimization in the background of every modification of the coordinate axes. This way, we define a number of orthographic interaction concepts as well as orthographic data tour sequences: a scatterplot tour, a principle component tour, and a grand tour. All concepts are illustrated and evaluated with synthetic and real data.",Dirk J. Lehmann;Holger Theisel,Dirk J. Lehmann;Holger Theisel,University of Magdeburg;University of Magdeburg,10.1109/VISUAL.1997.663916,"Start plot, multivariate visualization, visual analytics",31,27,27,
SciVis,2013,Coupled Ensemble Flow Line Advection and Analysis,10.1109/TVCG.2013.144,http://dx.doi.org/10.1109/TVCG.2013.144,2733,2742,J,"Ensemble run simulations are becoming increasingly widespread. In this work, we couple particle advection with pathline analysis to visualize and reveal the differences among the flow fields of ensemble runs. Our method first constructs a variation field using a Lagrangian-based distance metric. The variation field characterizes the variation between vector fields of the ensemble runs, by extracting and visualizing the variation of pathlines within ensemble. Parallelism in a MapReduce style is leveraged to handle data processing and computing at scale. Using our prototype system, we demonstrate how scientists can effectively explore and investigate differences within ensemble simulations.",Hanqi Guo 0001;Xiaoru Yuan;Jian Huang 0007;Xiaomin Zhu,Hanqi Guo;Xiaoru Yuan;Jian Huang;Xiaomin Zhu,"Key Laboratory of Machine Perception (Ministry of Education), School of EECS, and Center for Computational Science and Engineering, Peking University;Key Laboratory of Machine Perception (Ministry of Education), School of EECS, and Center for Computational Science and Engineering, Peking University;University of Tennessee;National Super Computing Center in Jinan, Shandong, China",10.1109/VISUAL.2005.1532853;10.1109/TVCG.2011.219;10.1109/TVCG.2011.203;10.1109/TVCG.2006.116;10.1109/TVCG.2010.190;10.1109/TVCG.2010.181;10.1109/VISUAL.1996.568116;10.1109/TVCG.2007.70551,"Ensemble analysis, parallel processing, field line advection",31,28,43,
InfoVis,2014,Tree Colors: Color Schemes for Tree-Structured Data,10.1109/TVCG.2014.2346277,http://dx.doi.org/10.1109/TVCG.2014.2346277,2072,2081,J,"We present a method to map tree structures to colors from the Hue-Chroma-Luminance color model, which is known for its well balanced perceptual properties. The Tree Colors method can be tuned with several parameters, whose effect on the resulting color schemes is discussed in detail. We provide a free and open source implementation with sensible parameter defaults. Categorical data are very common in statistical graphics, and often these categories form a classification tree. We evaluate applying Tree Colors to tree structured data with a survey on a large group of users from a national statistical institute. Our user study suggests that Tree Colors are useful, not only for improving node-link diagrams, but also for unveiling tree structure in non-hierarchical visualizations.",Martijn Tennekes;Edwin de Jonge,Martijn Tennekes;Edwin de Jonge,Statistics Netherlands;Statistics Netherlands,10.1109/TVCG.2011.193;10.1109/INFVIS.2000.885091;10.1109/INFVIS.2002.1173151,"Color schemes, statistical graphics, hierarchical data",31,26,34,
VAST,2014,Feedback-Driven Interactive Exploration of Large Multidimensional Data Supported by Visual Classifier,10.1109/VAST.2014.7042480,http://dx.doi.org/10.1109/VAST.2014.7042480,43,52,C,"The extraction of relevant and meaningful information from multivariate or high-dimensional data is a challenging problem. One reason for this is that the number of possible representations, which might contain relevant information, grows exponentially with the amount of data dimensions. Also, not all views from a possibly large view space, are potentially relevant to a given analysis task or user. Focus+Context or Semantic Zoom Interfaces can help to some extent to efficiently search for interesting views or data segments, yet they show scalability problems for very large data sets. Accordingly, users are confronted with the problem of identifying interesting views, yet the manual exploration of the entire view space becomes ineffective or even infeasible. While certain quality metrics have been proposed recently to identify potentially interesting views, these often are defined in a heuristic way and do not take into account the application or user context. We introduce a framework for a feedback-driven view exploration, inspired by relevance feedback approaches used in Information Retrieval. Our basic idea is that users iteratively express their notion of interestingness when presented with candidate views. From that expression, a model representing the user's preferences, is trained and used to recommend further interesting view candidates. A decision support system monitors the exploration process and assesses the relevance-driven search process for convergence and stability. We present an instantiation of our framework for exploration of Scatter Plot Spaces based on visual features. We demonstrate the effectiveness of this implementation by a case study on two real-world datasets. We also discuss our framework in light of design alternatives and point out its usefulness for development of user- and context-dependent visual exploration systems.",Michael Behrisch 0001;Fatih Korkmaz;Lin Shao;Tobias Schreck,Michael Behrisch;Fatih Korkmaz;Lin Shao;Tobias Schreck,"Universität Konstanz, Germany;Universität  Konstanz, Germany;Universität Konstanz, Germany;Universität Konstanz, Germany",10.1109/INFVIS.2005.1532142;10.1109/TVCG.2012.277;10.1109/TVCG.2010.184;10.1109/VAST.2012.6400486;10.1109/VAST.2007.4389001;10.1109/TVCG.2013.160;10.1109/VAST.2012.6400488,"View Space Exploration Framework, Interesting View Problem, Relevance Feedback, User Preference Model",31,26,37,
InfoVis,2015,HOLA: Human-like Orthogonal Network Layout,10.1109/TVCG.2015.2467451,http://dx.doi.org/10.1109/TVCG.2015.2467451,349,358,J,"Over the last 50 years a wide variety of automatic network layout algorithms have been developed. Some are fast heuristic techniques suitable for networks with hundreds of thousands of nodes while others are multi-stage frameworks for higher-quality layout of smaller networks. However, despite decades of research currently no algorithm produces layout of comparable quality to that of a human. We give a new “human-centred” methodology for automatic network layout algorithm design that is intended to overcome this deficiency. User studies are first used to identify the aesthetic criteria algorithms should encode, then an algorithm is developed that is informed by these criteria and finally, a follow-up study evaluates the algorithm output. We have used this new methodology to develop an automatic orthogonal network layout method, HOLA, that achieves measurably better (by user study) layout than the best available orthogonal layout algorithm and which produces layouts of comparable quality to those produced by hand.",Steve Kieffer;Tim Dwyer;Kim Marriott;Michael Wybrow,Steve Kieffer;Tim Dwyer;Kim Marriott;Michael Wybrow,Monash University and NICTA Victoria;Monash University;Monash University and NICTA Victoria;Monash University,10.1109/TVCG.2006.120;10.1109/TVCG.2012.208;10.1109/TVCG.2013.151;10.1109/TVCG.2006.156;10.1109/TVCG.2009.109;10.1109/TVCG.2008.141;10.1109/TVCG.2006.147;10.1109/TVCG.2012.245;10.1109/TVCG.2008.155,"Graph layout, orthogonal layout, automatic layout algorithms, user-generated layout, graph-drawing aesthetics",31,39,36,BP
VAST,2015,A Case Study Using Visualization Interaction Logs and Insight Metrics to Understand How Analysts Arrive at Insights,10.1109/TVCG.2015.2467613,http://dx.doi.org/10.1109/TVCG.2015.2467613,51,60,J,"We present results from an experiment aimed at using logs of interactions with a visual analytics application to better understand how interactions lead to insight generation. We performed an insight-based user study of a visual analytics application and ran post hoc quantitative analyses of participants' measured insight metrics and interaction logs. The quantitative analyses identified features of interaction that were correlated with insight characteristics, and we confirmed these findings using a qualitative analysis of video captured during the user study. Results of the experiment include design guidelines for the visual analytics application aimed at supporting insight generation. Furthermore, we demonstrated an analysis method using interaction logs that identified which interaction patterns led to insights, going beyond insight-based evaluations that only quantify insight characteristics. We also discuss choices and pitfalls encountered when applying this analysis method, such as the benefits and costs of applying an abstraction framework to application-specific actions before further analysis. Our method can be applied to evaluations of other visualization tools to inform the design of insight-promoting interactions and to better understand analyst behaviors.",Hua Guo;Steven R. Gomez;Caroline Ziemkiewicz;David H. Laidlaw,Hua Guo;Steven R. Gomez;Caroline Ziemkiewicz;David H. Laidlaw,Brown University;Brown University;Aptima Inc.;Brown University,10.1109/INFVIS.2005.1532136;10.1109/TVCG.2014.2346575;10.1109/VAST.2014.7042482;10.1109/VAST.2008.4677365;10.1109/TVCG.2008.137;10.1109/VAST.2009.5333878;10.1109/TVCG.2014.2346452;10.1109/TVCG.2012.221;10.1109/TVCG.2007.70515,"Evaluation, visual analytics, interaction, intelligence analysis, insight-based evaluation",31,27,34,HM
VAST,2016,Multi-Resolution Climate Ensemble Parameter Analysis with Nested Parallel Coordinates Plots,10.1109/TVCG.2016.2598830,http://dx.doi.org/10.1109/TVCG.2016.2598830,81,90,J,"Due to the uncertain nature of weather prediction, climate simulations are usually performed multiple times with different spatial resolutions. The outputs of simulations are multi-resolution spatial temporal ensembles. Each simulation run uses a unique set of values for multiple convective parameters. Distinct parameter settings from different simulation runs in different resolutions constitute a multi-resolution high-dimensional parameter space. Understanding the correlation between the different convective parameters, and establishing a connection between the parameter settings and the ensemble outputs are crucial to domain scientists. The multi-resolution high-dimensional parameter space, however, presents a unique challenge to the existing correlation visualization techniques. We present Nested Parallel Coordinates Plot (NPCP), a new type of parallel coordinates plots that enables visualization of intra-resolution and inter-resolution parameter correlations. With flexible user control, NPCP integrates superimposition, juxtaposition and explicit encodings in a single view for comparative data visualization and analysis. We develop an integrated visual analytics system to help domain scientists understand the connection between multi-resolution convective parameters and the large spatial temporal ensembles. Our system presents intricate climate ensembles with a comprehensive overview and on-demand geographic details. We demonstrate NPCP, along with the climate ensemble visualization system, based on real-world use-cases from our collaborators in computational and predictive science.",Junpeng Wang;Xiaotong Liu;Han-Wei Shen;Guang Lin,Junpeng Wang;Xiaotong Liu;Han-Wei Shen;Guang Lin,The Ohio State University;The Ohio State University;The Ohio State University;Purdue University,10.1109/TVCG.2010.181;10.1109/TVCG.2008.153;10.1109/INFVIS.1998.729559;10.1109/TVCG.2012.237;10.1109/INFVIS.2004.68;10.1109/TVCG.2014.2346755;10.1109/SciVis.2015.7429487;10.1109/VISUAL.1999.809866;10.1109/TVCG.2013.122;10.1109/INFVIS.2004.15;10.1109/TVCG.2015.2467431;10.1109/TVCG.2015.2468093;10.1109/TVCG.2010.184;10.1109/TVCG.2014.2346321,Parallel coordinates plots;parameter analysis;multi-resolution climate ensembles,31,36,48,
Vis,1990,An interpersonal multimedia visualization system,10.1109/VISUAL.1990.146399,http://dx.doi.org/10.1109/VISUAL.1990.146399,338,341,C,"MediaView is a computer program that provides a generic infrastructure for authoring and interacting with multimedia documents. Among its applications is the ability to furnish a user with a comprehensive environment for analysis and visualization. With this program the user can produce a document that contains mathematics, datasets and associated visualizations. From the dataset or embedded mathematics animated sequences can be produced in situ. Equations that appear in a document have a backing format that is compatible with the Mathematica language. Thus, by clicking on an equation, its semantics are conveyed to Mathematica, where the user can perform a variety of symbolic and numerical operations. Since the document is all digital, it can be shared on a local network or mailed electronically to a distant site. Animations and any other substructures of the document persist through the mailing process and can be awakened at the destination by the recipient.&lt;&lt;ETX&gt;&gt;",Richard L. Phillips,R.L. Phillips,"Los Alamos Nat. Lab., NM, USA",,,30,0,8,
Vis,1992,The state of the art of visual languages for visualization,10.1109/VISUAL.1992.235207,http://dx.doi.org/10.1109/VISUAL.1992.235207,202,209,C,"Data flow visual language systems are being used to provide sophisticated environments for the visualization of scientific data. These systems are evolving rapidly and are beginning to encompass related technologies such as distributed computing and user interface development systems. A hierarchical classification of the components and issues involved is presented, giving an understanding of the design decisions and trade-offs that the developers of these systems are making. The component categories can be used as a framework for discussing where interoperability of competing visual programming environments might occur and what the future holds for these systems.&lt;&lt;ETX&gt;&gt;",Carla S. Williams;John Rasure;C. Hansen,C. Williams;J. Rasure;C. Hansen,"Dept. of Electr. & Comput. Eng., New Mexico Univ., Albuquerque, NM, USA;Dept. of Electr. & Comput. Eng., New Mexico Univ., Albuquerque, NM, USA",10.1109/VISUAL.1992.235219,,30,13,8,
Vis,1993,Optimal filter design for volume reconstruction and visualization,10.1109/VISUAL.1993.398851,http://dx.doi.org/10.1109/VISUAL.1993.398851,54,61,C,"Digital filtering is a crucial operation in volume reconstruction and visualization. Lowpass filters are needed for subsampling and minification. Interpolation filters are needed for registration and magnification, and to compensate for geometric distortions introduced by scanners. Interpolation filters are also needed in volume rendering for ray-casting and slicing. In this paper, we describe a method for digital filter design of interpolation filters based on weighted Chebyshev minimization. The accuracy of the resulting filters are compared with some commonly used filters defined by piecewise cubic polynomials. A significant finding of this paper is that although piecewise cubic interpolation has some computational advantages and may yield visually satisfactory results for some data, other data result in artifacts such as blurring. Furthermore, piecewise cubic filters are inferior for operations such as registration. Better results are obtained by the filters derived in this papers at only small increases in computation.&lt;&lt;ETX&gt;&gt;",Ingrid Carlbom,I. Carlbom,"Digital Equipment Corp., Cambridge, MA, USA",,,30,22,26,
Vis,1996,Perceptualisation using a tactile mouse,10.1109/VISUAL.1996.568104,http://dx.doi.org/10.1109/VISUAL.1996.568104,181,188,C,"Whilst there has been considerable effort in constructing force feedback devices for use in virtual environments, and in the use of touch as a prosthesis for the blind, there has been little work on the use of touch in the visualisation or more properly, perceptualisation of data. Touch potentially offers an additional dimension of perception where visualisation is limited by screen size, resolution, and visual overload. We describe some tactile mice and experiments in using tactile mice for a variety of perceptualisation tasks.",Robert G. Hughes;A. Robin Forrest,R.G. Hughes;A.R. Forrest,"Sch. of Inf. Syst., Univ. of East Anglia, Norwich, UK",10.1109/VISUAL.1995.480802,,30,7,24,
Vis,1996,Virtual Workbench-a non-immersive virtual environment for visualizing and interacting with 3D objects for scientific visualization,10.1109/VISUAL.1996.568128,http://dx.doi.org/10.1109/VISUAL.1996.568128,345,349,C,"The Virtual Workbench (VW) is a non-immersive virtual environment that allows users to view and interact with stereoscopic objects displayed on a workspace similar to a tabletop workspace used in day-to-day life. A VW is an ideal environment for collaborative work where several colleagues can gather around the table to study 3D virtual objects. The Virtual Reality laboratory at the Naval Research Laboratory has implemented the VW using a concept similar to (Froehlich et al., 1994). This paper investigates how the VW can be used as a non-immersive display device for understanding and interpreting complex objects encountered in the scientific visualization field. Different techniques for interacting with 3D visualization objects on the table and using VW as a display device for visualization are evaluated using several cases.",Upul Obeysekare;Chas Williams;Jim Durbin;Lawrence J. Rosenblum;Robert Rosenberg;Fernando Grinstein;Ravi Ramamurthi;Alexandra Landsberg;William Sandberg,U. Obeysekare;C. Williams;J. Durbin;L. Rosenblum;R. Rosenberg;F. Grinstein;R. Ramamurti;A. Landsberg;W. Sandberg,"Naval Res. Lab., Washington, DC, USA",10.1109/VISUAL.1991.175771,,30,14,12,
InfoVis,1998,Visualizing decision table classifiers,10.1109/INFVIS.1998.729565,http://dx.doi.org/10.1109/INFVIS.1998.729565,102,"105, 157",C,"Decision tables, like decision trees or neural nets, are classification models used for prediction. They are induced by machine learning algorithms. A decision table consists of a hierarchical table in which each entry in a higher level table gets broken down by the values of a pair of additional attributes to form another table. The structure is similar to dimensional stacking. A visualization method is presented that allows a model based on many attributes to be understood even by those unfamiliar with machine learning. Various forms of interaction are used to make this visualization more useful than other static designs.",Barry G. Becker,B.G. Becker,"Silicon Graphics Inc., Mountain View, CA, USA",10.1109/VISUAL.1990.146386,,30,10,12,
InfoVis,1999,Dynamic hierarchy specification and visualization,10.1109/INFVIS.1999.801859,http://dx.doi.org/10.1109/INFVIS.1999.801859,65,72,C,This paper describes concepts that underlie the design and implementation of an information exploration system that allows users to impose arbitrary hierarchical organizations on their data. Such hierarchies allow a user to embed important semantic information into the hierarchy definition. Our goal is to recognize the significance of this implicit information and to utilize it in the hierarchy visualization. The innovative features of our system include the dynamic modification of the hierarchy definitions and the definition and implementation of a set of layout algorithms that utilize semantic information implicit in the tree construction.,Richard M. Wilson 0002;R. Daniel Bergeron,R.M. Wilson;R.D. Bergeron,"Dept. of Comput. Sci., New Hampshire Univ., Durham, NH, USA",10.1109/INFVIS.1995.528689;10.1109/INFVIS.1998.729555;10.1109/VISUAL.1991.175815,,30,13,16,
Vis,1999,Rendering on a budget: a framework for time-critical rendering,10.1109/VISUAL.1999.809875,http://dx.doi.org/10.1109/VISUAL.1999.809875,115,516,C,"We present a technique for optimizing the rendering of high-depth complexity scenes. Prioritized-Layered Projection (PLP) does this by rendering an estimation of the visible set. The novelty in our work lies in the fact that we do not explicitly compute visible sets. Instead, our work is based on computing on demand a priority order for the polygons that maximizes the likelihood of rendering visible polygons before occluded ones for any given scene. Given a fixed budget, e.g. time or number of triangles, our rendering algorithm makes sure to render geometry, respecting the computed priority. There are two main steps to our technique: (1) an occupancy based tessellation of space; and (2) a solidity based traversal algorithm. PLP works by computing an occupancy based tessellation of space, which tends to have smaller cells where there are more geometric primitives, e.g., polygons. In this spatial tessellation, each cell is assigned a solidity value, which is directly proportional to its likelihood of occluding other cells. In its simplest form, a cell's solidity value is directly proportional to the number of polygons contained within it. During our traversal algorithm, cells are marked for projection, and the geometric primitives contained within them actually rendered. The traversal algorithm makes use of the cells' solidity, and other view-dependent information to determine the ordering in which to project cells. By tailoring the traversal algorithm to the occupancy based tessellation, we can achieve very good frame rates with low preprocessing and rendering costs. We describe our technique and its implementation in detail. We also provide experimental evidence of its performance and briefly discuss extensions of our algorithm.",James T. Klosowski;Cláudio T. Silva,J.T. Klosowski;C.T. Silva,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",,"Polygon rendering, visibility ordering, occlusion culling",30,9,21,
Vis,1999,Visualizing the evolution of a subject domain: a case study,10.1109/VISUAL.1999.809927,http://dx.doi.org/10.1109/VISUAL.1999.809927,449,561,C,"We explore the potential of information visualization techniques in enhancing existing methodologies for domain analysis and modeling. In this case study, we particularly focus on visualizing the evolution of the hypertext field based on author co-citation patterns, including the use of a sliding-window scheme to generate a series of annual snapshots of the domain structure, and a factor-referenced color-coding scheme to highlight predominant specialties in the field.",Chaomei Chen;Les Carr,C. Chen;L. Carr,"Dept. of Inf. Syst. & Comput., Brunel Univ., Uxbridge, UK",10.1109/VISUAL.1993.398870,,30,9,13,
Vis,2000,Extracting regions of interest applying a local watershed transformation,10.1109/VISUAL.2000.885672,http://dx.doi.org/10.1109/VISUAL.2000.885672,21,28,C,"We present a new technique for extracting regions of interest (ROI) applying a local watershed transformation. The proposed strategy for computing catchment basins in a given region of interest is based on a rain-falling simulation. Unlike the standard watershed algorithms, which flood the complete (gradient magnitude of an) image, the proposed approach allows us to perform this task locally. Thus, a controlled region growth is performed, saving time and reducing the memory requirement especially when applied on volume data. A second problem arising from the standard watershed transformation is the over-segmented result and the lack of sound criteria for merging the computed basins. For overcoming this drawback, we present a basin-merging strategy introducing four criteria for merging adjacent basins. The threshold values applied in this strategy are derived from the user input and match rather the attributes of the selected object than of all objects in the image. In doing so, the user is not required to adjust abstract numbers, but to simply select a coarse region of interest. Moreover, the proposed algorithm is not limited to the 2D case. As we show in this work, it is suitable for volume data processing as well. Finally, we present the results of applying the proposed approach on several example images and volume data sets.",Stanislav L. Stoev;Wolfgang Straßer,S.L. Stoev;W. Strasser,"WSI/GRIS, Tubingen Univ., Germany",10.1109/VISUAL.1998.745311,"computer vision, image processing, data visualization, volume visualization, feature extraction, morphological segmentation, Biomedical image segmentation, watershed transformation",30,9,19,
Vis,2002,Probabilistic surfaces: point based primitives to show surface uncertainty,10.1109/VISUAL.2002.1183769,http://dx.doi.org/10.1109/VISUAL.2002.1183769,147,153,C,"Efficient and informative visualization of surfaces with uncertainties is an important topic with many applications in science and engineering. Examples include environmental pollution borderline identification, identification of the limits of an oil basin, or discrimination between contaminated and healthy tissue in medicine. This paper presents an approach for such visualization using points as display primitives. The approach is to render each polygon as a collection of points and to displace each point from the surface in the direction of the surface normal by an amount proportional to some random number multiplied by the uncertainty level at that point. This approach can be used in combination with other techniques such as pseudo-coloring and shading to give rise to efficient and revealing visualizations. The method is used to visualize real and simulated tumor formations with uncertainty of tumor boundaries.",Gevorg Grigoryan;Penny Rheingans,G. Grigoryan;P. Rheingans,"Maryland Univ., Baltimore, MD, USA;Maryland Univ., Baltimore, MD, USA",10.1109/VISUAL.1996.568105;10.1109/VISUAL.2000.885679;10.1109/VISUAL.2001.964492;10.1109/VISUAL.1995.480802,"uncertainty, visualizing surface uncertainty, points as display primitives",30,16,18,
InfoVis,2003,Design choices when architecting visualizations,10.1109/INFVIS.2003.1249007,http://dx.doi.org/10.1109/INFVIS.2003.1249007,41,48,C,"In this paper, we focus on some of the key design decisions we faced during the process of architecting a visualization system and present some possible choices, with their associated advantages and disadvantages. We frame this discussion within the context of Rivet, our general visualization environment designed for rapidly prototyping interactive, exploratory visualization tools for analysis. As we designed increasingly sophisticated visualizations, we needed to refine Rivet in order to be able to create these richer displays for larger and more complex data sets. The design decisions we discuss in this paper include: the internal data model, data access, semantic meta-data information the visualization can use to create effective visual decodings, the need for data transformations in a visualization tool, modular objects for flexibility, and the tradeoff between simplicity and expressiveness when providing methods for creating visualizations.",Diane Tang;Chris Stolte;Robert Bosch,D. Tang;C. Stolte;R. Bosche,"Stanford Univ., CA, USA;Stanford Univ., CA, USA;Stanford Univ., CA, USA",10.1109/INFVIS.1996.559213;10.1109/INFVIS.2002.1173156;10.1109/VISUAL.1995.480801;10.1109/INFVIS.1998.729560;10.1109/INFVIS.2002.1173141;10.1109/INFVIS.2000.885086;10.1109/VISUAL.1992.235219,"information visualization, system architecture, semantic meta-data, data transformations, design tradeoffs",30,4,30,
Vis,2003,Adaptive design of a global opacity transfer function for direct volume rendering of ultrasound data,10.1109/VISUAL.2003.1250411,http://dx.doi.org/10.1109/VISUAL.2003.1250411,489,496,C,"While there are a couple of transfer function design approaches for CT and MRI (magnetic resonance imaging) data, direct volume rendering of ultrasound data still relies on manual adjustment of an inflexible piecewise linear opacity transfer function (OTF) on a trial-and-error basis. The main challenge of automatically designing an OTF for visualization of sonographic data is the low signal-to-noise ratio in combination with real time data acquisition at frame rates up to 25 volumes per second. In this paper, we present an efficient solution of this task. Our approach is based on the evaluation of tube cores, i.e., collections of voxels gathered by traversing the volume in rendering directions. We use information about the probable position of an interface between tissues of different echogenicity to adaptively design an OTF in a multiplicative way. We show the appropriateness of our approach by examples, deliberately on data sets of moderate quality arising frequently in clinical settings.",Dieter Hönigmann;Johannes Ruisz;Christoph Haider,D. Honigmann;J. Ruisz;C. Haider,"Adv. Comput. Vision GmbH, ACV, Vienna, Austria;Adv. Comput. Vision GmbH, ACV, Vienna, Austria;Adv. Comput. Vision GmbH, ACV, Vienna, Austria",10.1109/VISUAL.1997.663875;10.1109/VISUAL.1996.568113,"3D ultrasound, direct volume rendering, transfer function",30,7,18,
VAST,2006,VAST 2006 Contest - A Tale of Alderwood,10.1109/VAST.2006.261420,http://dx.doi.org/10.1109/VAST.2006.261420,215,216,M,"Visual analytics experts realize that one effective way to push the field forward and to develop metrics for measuring the performance of various visual analytics components is to hold an annual competition. The first visual analytics science and technology (VAST) contest was held in conjunction with the 2006 IEEE VAST Symposium. The competition entailed the identification of possible political shenanigans in the fictitious town of Alderwood. A synthetic data set was made available as well as tasks. We summarize how we prepared and advertised the contest, developed some initial metrics for evaluation, and selected the winners. The winners were invited to participate at an additional live competition at the symposium to provide them with feedback from senior analysts",Georges G. Grinstein;Theresa A. O'Connell;Sharon J. Laskowski;Catherine Plaisant;Jean Scholtz;Mark A. Whiting,Georges Grinstein;Theresa O'Connell;Sharon Laskowski;Catherine Plaisant;Jean Scholtz;Mark Whiting,"University of Massachusetts Lowell, grinstein@cs.uml.edu;National Institute of Standards and Technology, theresa.oconnell@nist.gov;National Institute of Standards and Technology, sharon.laskowski@nist.gov;University of Maryland, plaisant@cs.umd.edu;Pacific Northwest, National Laboratory, jean.scholtz@pnl.com;Pacific Northwest, National Laboratory, mark.a.whiting@pnl.gov",,,30,14,8,
Vis,2006,A Generic and Scalable Pipeline for GPU Tetrahedral Grid Rendering,10.1109/TVCG.2006.110,http://dx.doi.org/10.1109/TVCG.2006.110,1345,1352,J,"Recent advances in algorithms and graphics hardware have opened the possibility to render tetrahedral grids at interactive rates on commodity PCs. This paper extends on this work in that it presents a direct volume rendering method for such grids which supports both current and upcoming graphics hardware architectures, large and deformable grids, as well as different rendering options. At the core of our method is the idea to perform the sampling of tetrahedral elements along the view rays entirely in local barycentric coordinates. Then, sampling requires minimum GPU memory and texture access operations, and it maps efficiently onto a feed-forward pipeline of multiple stages performing computation and geometry construction. We propose to spawn rendered elements from one single vertex. This makes the method amenable to upcoming Direct3D 10 graphics hardware which allows to create geometry on the GPU. By only modifying the algorithm slightly it can be used to render per-pixel iso-surfaces and to perform tetrahedral cell projection. As our method neither requires any pre-processing nor an intermediate grid representation it can efficiently deal with dynamic and large 3D meshes",Joachim Georgii;Rüdiger Westermann,Joachim Georgii;Rudiger Westermann,,10.1109/VISUAL.2003.1250390;10.1109/VISUAL.1997.663853;10.1109/VISUAL.2000.885683;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2001.964512;10.1109/VISUAL.1996.567606,"Direct volume rendering, unstructured grids, programmable graphics hardware",30,20,33,
Vis,2006,Representing Higher-Order Singularities in Vector fields on Piecewise Linear Surfaces,10.1109/TVCG.2006.173,http://dx.doi.org/10.1109/TVCG.2006.173,1315,1322,J,"Accurately representing higher-order singularities of vector fields defined on piecewise linear surfaces is a non-trivial problem. In this work, we introduce a concise yet complete interpolation scheme of vector fields on arbitrary triangulated surfaces. The scheme enables arbitrary singularities to be represented at vertices. The representation can be considered as a facet-based ""encoding"" of vector fields on piecewise linear surfaces. The vector field is described in polar coordinates over each facet, with a facet edge being chosen as the reference to define the angle. An integer called the period jump is associated to each edge of the triangulation to remove the ambiguity when interpolating the direction of the vector field between two facets that share an edge. To interpolate the vector field, we first linearly interpolate the angle of rotation of the vectors along the edges of the facet graph. Then, we use a variant of Nielson's side-vertex scheme to interpolate the vector field over the entire surface. With our representation, we remove the bound imposed on the complexity of singularities that a vertex can represent by its connectivity. This bound is a limitation generally exists in vertex-based linear schemes. Furthermore, using our data structure, the index of a vertex of a vector field can be combinatorily determined",Wan-Chiu Li;Bruno Vallet;Nicolas Ray;Bruno Lévy,Wan-chiu Li;Bruno Vallet;Nicolas Ray;Bruno Levy,,10.1109/VISUAL.2005.1532776;10.1109/VISUAL.1994.346313;10.1109/VISUAL.2003.1250363;10.1109/VISUAL.2005.1532842;10.1109/VISUAL.1999.809892;10.1109/VISUAL.1999.809897;10.1109/VISUAL.2000.885716;10.1109/VISUAL.2003.1250364,"vector field visualization, higher-order singularities, line integral convolution, GPU",30,28,32,
Vis,2009,Comparing 3D Vector field Visualization Methods: A User Study,10.1109/TVCG.2009.126,http://dx.doi.org/10.1109/TVCG.2009.126,1219,1226,J,"In a user study comparing four visualization methods for three-dimensional vector data, participants used visualizations from each method to perform five simple but representative tasks: 1) determining whether a given point was a critical point, 2) determining the type of a critical point, 3) determining whether an integral curve would advect through two points, 4) determining whether swirling movement is present at a point, and 5) determining whether the vector field is moving faster at one point than another. The visualization methods were line and tube representations of integral curves with both monoscopic and stereoscopic viewing. While participants reported a preference for stereo lines, quantitative results showed performance among the tasks varied by method. Users performed all tasks better with methods that: 1) gave a clear representation with no perceived occlusion, 2) clearly visualized curve speed and direction information, and 3) provided fewer rich 3D cues (e.g., shading, polygonal arrows, overlap cues, and surface textures). These results provide quantitative support for anecdotal evidence on visualization methods. The tasks and testing framework also give a basis for comparing other visualization methods, for creating more effective methods, and for defining additional tasks to explore further the tradeoffs among the methods.",Andrew S. Forsberg;Jian Chen 0006;David H. Laidlaw,Andrew Forsberg;Jian Chen;David Laidlaw,Brown University;Brown University;Brown University,10.1109/VISUAL.1996.567777;10.1109/VISUAL.2005.1532831;10.1109/VISUAL.2004.59;10.1109/VISUAL.2005.1532772,"3D vector fields, visualization, user study, tubes, lines, stereoscopic and monoscopic viewing",30,27,28,
Vis,2009,Kd-Jump: a Path-Preserving Stackless Traversal for Faster Isosurface Raytracing on GPUs,10.1109/TVCG.2009.161,http://dx.doi.org/10.1109/TVCG.2009.161,1555,1562,J,"Stackless traversal techniques are often used to circumvent memory bottlenecks by avoiding a stack and replacing return traversal with extra computation. This paper addresses whether the stackless traversal approaches are useful on newer hardware and technology (such as CUDA). To this end, we present a novel stackless approach for implicit kd-trees, which exploits the benefits of index-based node traversal, without incurring extra node visitation. This approach, which we term Kd-Jump, enables the traversal to immediately return to the next valid node, like a stack, without incurring extra node visitation (kd-restart). Also, Kd-Jump does not require global memory (stack) at all and only requires a small matrix in fast constant-memory. We report that Kd-Jump outperforms a stack by 10 to 20% and kd-restar t by 100%. We also present a Hybrid Kd-Jump, which utilizes a volume stepper for leaf testing and a run-time depth threshold to define where kd-tree traversal stops and volume-stepping occurs. By using both methods, we gain the benefits of empty space removal, fast texture-caching and realtime ability to determine the best threshold for current isosurface and view direction.",David Meirion Hughes;Ik Soo Lim,David M. Hughes;Ik Soo Lim,"School of Computer Science, Bangor University, UK;Computer Science, Bangor University, UK",10.1109/VISUAL.2004.48,"Raytracing, isosurface, GPU, parallel computing, volume visualization",30,19,25,
InfoVis,2011,Product Plots,10.1109/TVCG.2011.227,http://dx.doi.org/10.1109/TVCG.2011.227,2223,2230,J,"We propose a new framework for visualising tables of counts, proportions and probabilities. We call our framework product plots, alluding to the computation of area as a product of height and width, and the statistical concept of generating a joint distribution from the product of conditional and marginal distributions. The framework, with extensions, is sufficient to encompass over 20 visualisations previously described in fields of statistical graphics and infovis, including bar charts, mosaic plots, treemaps, equal area plots and fluctuation diagrams.",Hadley Wickham;Heike Hofmann,Hadley Wickham;Heike Hofmann,Rice University;Iowa State University,10.1109/TVCG.2007.70594;10.1109/TVCG.2006.200;10.1109/INFVIS.2002.1173141;10.1109/INFVIS.2000.885091;10.1109/VISUAL.1990.146386;10.1109/TVCG.2010.186;10.1109/INFVIS.2005.1532128;10.1109/INFVIS.2005.1532142;10.1109/TVCG.2010.209;10.1109/TVCG.2009.128;10.1109/INFVIS.2005.1532145,"Statistics, joint distribution, conditional distribution, treemap, bar chart, mosaic plot",30,27,52,
VAST,2011,Perception-based visual quality measures,10.1109/VAST.2011.6102437,http://dx.doi.org/10.1109/VAST.2011.6102437,13,20,C,"In recent years diverse quality measures to support the exploration of high-dimensional data sets have been proposed. Such measures can be very useful to rank and select information-bearing projections of very high dimensional data, when the visual exploration of all possible projections becomes unfeasible. But even though a ranking of the low dimensional projections may support the user in the visual exploration task, different measures deliver different distances between the views that do not necessarily match the expectations of human perception. As an alternative solution, we propose a perception-based approach that, similar to the existing measures, can be used to select information bearing projections of the data. Specifically, we construct a perceptual embedding for the different projections based on the data from a psychophysics study and multi-dimensional scaling. This embedding together with a ranking function is then used to estimate the value of the projections for a specific user task in a perceptual sense.",Georgia Albuquerque;Martin Eisemann;Marcus A. Magnor,Georgia Albuquerque;Martin Eisemann;Marcus Magnor,"TU Braunschweig, Germany;TU Braunschweig, Germany;TU Braunschweig, Germany",10.1109/INFVIS.2005.1532142;10.1109/VAST.2010.5652433;10.1109/VAST.2006.261423;10.1109/VAST.2009.5332628;10.1109/TVCG.2010.184;10.1109/TVCG.2009.153,,30,24,19,
Vis,2011,Two-Dimensional Time-Dependent Vortex Regions Based on the Acceleration Magnitude,10.1109/TVCG.2011.249,http://dx.doi.org/10.1109/TVCG.2011.249,2080,2087,J,"Acceleration is a fundamental quantity of flow fields that captures Galilean invariant properties of particle motion. Considering the magnitude of this field, minima represent characteristic structures of the flow that can be classified as saddle- or vortex-like. We made the interesting observation that vortex-like minima are enclosed by particularly pronounced ridges. This makes it possible to define boundaries of vortex regions in a parameter-free way. Utilizing scalar field topology, a robust algorithm can be designed to extract such boundaries. They can be arbitrarily shaped. An efficient tracking algorithm allows us to display the temporal evolution of vortices. Various vortex models are used to evaluate the method. We apply our method to two-dimensional model systems from computational fluid dynamics and compare the results to those arising from existing definitions.",Jens Kasten;Jan Reininghaus;Ingrid Hotz;Hans-Christian Hege,Jens Kasten;Jan Reininghaus;Ingrid Hotz;Hans-Christian Hege,Zuse Institute Berlin;Zuse Institute Berlin;Zuse Institute Berlin;Zuse Institute Berlin,10.1109/VISUAL.2005.1532830;10.1109/VISUAL.2004.107;10.1109/TVCG.2008.143;10.1109/VISUAL.2002.1183821;10.1109/TVCG.2006.201,"Vortex regions, time-dependent flow fields, feature extraction",30,31,33,
InfoVis,2012,Spatial Text Visualization Using Automatic Typographic Maps,10.1109/TVCG.2012.264,http://dx.doi.org/10.1109/TVCG.2012.264,2556,2564,J,"We present a method for automatically building typographic maps that merge text and spatial data into a visual representation where text alone forms the graphical features. We further show how to use this approach to visualize spatial data such as traffic density, crime rate, or demographic data. The technique accepts a vector representation of a geographic map and spatializes the textual labels in the space onto polylines and polygons based on user-defined visual attributes and constraints. Our sample implementation runs as a Web service, spatializing shape files from the OpenStreetMap project into typographic maps for any region.",Shehzad Afzal;Ross Maciejewski;Yun Jang;Niklas Elmqvist;David S. Ebert,Shehzad Afzal;Ross Maciejewski;Yun Jang;Niklas Elmqvist;David S. Ebert,Purdue University;Arizona State University;Sejong University;Purdue University;Purdue University,10.1109/VAST.2010.5652931;10.1109/TVCG.2010.191;10.1109/TVCG.2010.175;10.1109/INFVIS.1995.528686;10.1109/VISUAL.1997.663912;10.1109/VISUAL.2000.885694;10.1109/INFVIS.2005.1532131;10.1109/INFVIS.2002.1173144;10.1109/TVCG.2008.165;10.1109/TVCG.2010.194;10.1109/TVCG.2009.171;10.1109/INFVIS.2000.885095,"Geovisualization, spatial data, text visualization, label placement",30,21,48,
InfoVis,2013,Edge Compression Techniques for Visualization of Dense Directed Graphs,10.1109/TVCG.2013.151,http://dx.doi.org/10.1109/TVCG.2013.151,2596,2605,J,"We explore the effectiveness of visualizing dense directed graphs by replacing individual edges with edges connected to 'modules'-or groups of nodes-such that the new edges imply aggregate connectivity. We only consider techniques that offer a lossless compression: that is, where the entire graph can still be read from the compressed version. The techniques considered are: a simple grouping of nodes with identical neighbor sets; Modular Decomposition which permits internal structure in modules and allows them to be nested; and Power Graph Analysis which further allows edges to cross module boundaries. These techniques all have the same goal-to compress the set of edges that need to be rendered to fully convey connectivity-but each successive relaxation of the module definition permits fewer edges to be drawn in the rendered graph. Each successive technique also, we hypothesize, requires a higher degree of mental effort to interpret. We test this hypothetical trade-off with two studies involving human participants. For Power Graph Analysis we propose a novel optimal technique based on constraint programming. This enables us to explore the parameter space for the technique more precisely than could be achieved with a heuristic. Although applicable to many domains, we are motivated by-and discuss in particular-the application to software dependency analysis.",Tim Dwyer;Nathalie Henry Riche;Kim Marriott;Christopher Mears,Tim Dwyer;Nathalie Henry Riche;Kim Marriott;Christopher Mears,Monash University;Microsoft Research;Monash University;Monash University,10.1109/TVCG.2009.165;10.1109/TVCG.2011.233;10.1109/TVCG.2006.120;10.1109/INFVIS.2004.66,"Directed graphs, networks, modular decomposition, power graph analysis",30,28,25,
InfoVis,2014,TenniVis: Visualization for Tennis Match Analysis,10.1109/TVCG.2014.2346445,http://dx.doi.org/10.1109/TVCG.2014.2346445,2339,2348,J,"Existing research efforts into tennis visualization have primarily focused on using ball and player tracking data to enhance professional tennis broadcasts and to aid coaches in helping their students. Gathering and analyzing this data typically requires the use of an array of synchronized cameras, which are expensive for non-professional tennis matches. In this paper, we propose TenniVis, a novel tennis match visualization system that relies entirely on data that can be easily collected, such as score, point outcomes, point lengths, service information, and match videos that can be captured by one consumer-level camera. It provides two new visualizations to allow tennis coaches and players to quickly gain insights into match performance. It also provides rich interactions to support ad hoc hypothesis development and testing. We first demonstrate the usefulness of the system by analyzing the 2007 Australian Open men's singles final. We then validate its usability by two pilot user studies where two college tennis coaches analyzed the matches of their own players. The results indicate that useful insights can quickly be discovered and ad hoc hypotheses based on these insights can conveniently be tested through linked match videos.",Tom Polk;Jing Yang;Yueqi Hu;Ye Zhao,Tom Polk;Jing Yang;Yueqi Hu;Ye Zhao,University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte;Kent State University,10.1109/TVCG.2012.263;10.1109/TVCG.2013.192;10.1109/VISUAL.2001.964496;10.1109/INFVIS.1996.559229;10.1109/INFVIS.2002.1173148,"Visual knowledge discovery, sports analytics, tennis visualization",30,34,28,
InfoVis,2016,Data-Driven Guides: Supporting Expressive Design for Information Graphics,10.1109/TVCG.2016.2598620,http://dx.doi.org/10.1109/TVCG.2016.2598620,491,500,J,"In recent years, there is a growing need for communicating complex data in an accessible graphical form. Existing visualization creation tools support automatic visual encoding, but lack flexibility for creating custom design; on the other hand, freeform illustration tools require manual visual encoding, making the design process time-consuming and error-prone. In this paper, we present Data-Driven Guides (DDG), a technique for designing expressive information graphics in a graphic design environment. Instead of being confined by predefined templates or marks, designers can generate guides from data and use the guides to draw, place and measure custom shapes. We provide guides to encode data using three fundamental visual encoding channels: length, area, and position. Users can combine more than one guide to construct complex visual structures and map these structures to data. When underlying data is changed, we use a deformation technique to transform custom shapes using the guides as the backbone of the shapes. Our evaluation shows that data-driven guides allow users to create expressive and more accurate custom data-driven graphics.",Nam Wook Kim;Eston Schweickart;Zhicheng Liu;Mira Dontcheva;Wilmot Li;Jovan Popovic;Hanspeter Pfister,Nam Wook Kim;Eston Schweickart;Zhicheng Liu;Mira Dontcheva;Wilmot Li;Jovan Popovic;Hanspeter Pfister,"John A. Paulson School of Engineering and Applied SciencesHarvard University;Computer Science department, Cornell University;Adobe Research;Adobe Research;Adobe Research;Adobe Research;John A. Paulson School of Engineering and Applied SciencesHarvard University",10.1109/TVCG.2014.2346292;10.1109/INFVIS.1996.559212;10.1109/TVCG.2011.175;10.1109/TVCG.2016.2598609;10.1109/TVCG.2013.234;10.1109/INFVIS.2004.64;10.1109/TVCG.2012.197;10.1109/INFVIS.2000.885086;10.1109/INFVIS.2000.885093;10.1109/TVCG.2014.2346979;10.1109/TVCG.2014.2346320;10.1109/TVCG.2014.2346291;10.1109/TVCG.2015.2467732;10.1109/INFVIS.2004.12;10.1109/TVCG.2013.191;10.1109/TVCG.2011.251;10.1109/TVCG.2010.144;10.1109/TVCG.2011.185;10.1109/TVCG.2007.70577,Information graphics;visualization;design tools;2D graphics,30,36,55,
VAST,2016,EventAction: Visual analytics for temporal event sequence recommendation,10.1109/VAST.2016.7883512,http://dx.doi.org/10.1109/VAST.2016.7883512,61,70,C,"Recommender systems are being widely used to assist people in making decisions, for example, recommending films to watch or books to buy. Despite its ubiquity, the problem of presenting the recommendations of temporal event sequences has not been studied. We propose EventAction, which to our knowledge, is the first attempt at a prescriptive analytics interface designed to present and explain recommendations of temporal event sequences. EventAction provides a visual analytics approach to (1) identify similar records, (2) explore potential outcomes, (3) review recommended temporal event sequences that might help achieve the users' goals, and (4) interactively assist users as they define a personalized action plan associated with a probability of success. Following the design study framework, we designed and deployed EventAction in the context of student advising and reported on the evaluation with a student review manager and three graduate students.",Fan Du;Catherine Plaisant;Neil Spring;Ben Shneiderman,Fan Du;Catherine Plaisant;Neil Spring;Ben Shneiderman,"University of Maryland, United States of America;University of Maryland, United States of America;University of Maryland, United States of America;University of Maryland, United States of America",10.1109/TVCG.2009.187;10.1109/TVCG.2012.225;10.1109/TVCG.2012.213;10.1109/TVCG.2015.2467622;10.1109/TVCG.2014.2346682,,30,26,45,
InfoVis,2018,Formalizing Visualization Design Knowledge as Constraints: Actionable and Extensible Models in Draco,10.1109/TVCG.2018.2865240,http://dx.doi.org/10.1109/TVCG.2018.2865240,438,448,J,"There exists a gap between visualization design guidelines and their application in visualization tools. While empirical studies can provide design guidance, we lack a formal framework for representing design knowledge, integrating results across studies, and applying this knowledge in automated design tools that promote effective encodings and facilitate visual exploration. We propose modeling visualization design knowledge as a collection of constraints, in conjunction with a method to learn weights for soft constraints from experimental data. Using constraints, we can take theoretical design knowledge and express it in a concrete, extensible, and testable form: the resulting models can recommend visualization designs and can easily be augmented with additional constraints or updated weights. We implement our approach in Draco, a constraint-based system based on Answer Set Programming (ASP). We demonstrate how to construct increasingly sophisticated automated visualization design systems, including systems based on weights learned directly from the results of graphical perception experiments.",Dominik Moritz;Chenglong Wang;Greg L. Nelson;Halden Lin;Adam M. Smith;Bill Howe;Jeffrey Heer,Dominik Moritz;Chenglong Wang;Greg L. Nelson;Halden Lin;Adam M. Smith;Bill Howe;Jeffrey Heer,University of Washington;University of Washington;University of Washington;University of Washington;University of California Santa Cruz;University of Washington;University of Washington,10.1109/INFVIS.2005.1532136;10.1109/TVCG.2014.2346984;10.1109/TVCG.2013.183;10.1109/TVCG.2014.2346979;10.1109/TVCG.2007.70594;10.1109/TVCG.2017.2744320;10.1109/TVCG.2017.2744198;10.1109/TVCG.2017.2744198;10.1109/TVCG.2016.2599030;10.1109/TVCG.2017.2744359;10.1109/TVCG.2015.2467191,"Automated Visualization Design,Perceptual Effectiveness,Constraints,Knowledge Bases,Answer Set Programming",30,20,67,BP
Vis,1991,Shadowed hedgehogs: a technique for visualizing 2D slices of 3D vector fields,10.1109/VISUAL.1991.175792,http://dx.doi.org/10.1109/VISUAL.1991.175792,148,153,C,"The technique of placing directed line segments at grid points, known as hedgehogging, which has been used for visualizing 2D vector fields, is considered. A means of rapidly rendering a slice of a 3D field, suitable for a bilevel display, is provided. Shape and shadowing are used to disambiguate orientation. Liberal use of lookup tables makes the technique very fast.&lt;&lt;ETX&gt;&gt;",R. Victor Klassen;Steven J. Harrington,R.V. Klassen;S.J. Harrington,"Xerox Webster Res. Center, Webster, NY, USA;Xerox Webster Res. Center, Webster, NY, USA",,,29,11,8,
Vis,1992,A scientific visualization renderer,10.1109/VISUAL.1992.235204,http://dx.doi.org/10.1109/VISUAL.1992.235204,227,234,C,"While scientific visualization systems share many requirements with other graphical applications, they also have special requirements that make solutions based on standard rendering hardware or software not entirely satisfactory. Those requirements are illustrated by describing the renderer used in a production scientific visualization system, Data Explorer. The requirements for a visualization renderer are discussed. Implementation techniques used to meet the requirements of parallelism, volume rendering of irregular data, clipping, and integration of rendering modalities are described. The renderer described is a software renderer, but it is hoped that the requirements and implementation presented might influence the design of future generations of rendering hardware.&lt;&lt;ETX&gt;&gt;",Bruce Lucas,B. Lucas,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.1992.235219;10.1109/VISUAL.1991.175818,,29,12,10,
Vis,1992,Virtual Smoke: an interactive 3D flow visualization technique,10.1109/VISUAL.1992.235227,http://dx.doi.org/10.1109/VISUAL.1992.235227,46,53,C,"A technique is given for computer visualization of simultaneous three-dimensional vector and scalar fields such as velocity and temperature in reacting fluid flow fields. The technique, which is called Virtual Smoke, simulates the use of colored smoke for experimental gaseous fluid flow visualization. However, it is noninvasive and can animate, in particular, the dynamic behaviors of steady-state or instantaneous flow fields obtained from numerical simulations. Virtual Smoke is based on volume seeds and volume seedlings, which are direct volume visualization methods previously developed for highly interactive scalar volume data exploration. Data from combustion simulations are used to demonstrate the effectiveness of Virtual Smoke.&lt;&lt;ETX&gt;&gt;",Kwan-Liu Ma;Philip J. Smith,Kwan-Liu Ma;P.J. Smith,"Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.1991.175772;10.1109/VISUAL.1991.175778;10.1109/VISUAL.1991.175770;10.1109/VISUAL.1990.146360;10.1109/VISUAL.1991.175789;10.1109/VISUAL.1991.175777,,29,9,22,
Vis,1994,User modeling for adaptive visualization systems,10.1109/VISUAL.1994.346316,http://dx.doi.org/10.1109/VISUAL.1994.346316,217,"223, C24",C,"Meaningful scientific visualizations benefit the interpretation of scientific data, concepts and processes. To ensure meaningful visualizations, the visualization system needs to adapt to desires, disabilities and abilities of the user, interpretation aim, resources (hardware, software) available, and the form and content of the data to be visualized. We suggest describing these characteristics with four models: user model, problem domain/task model, resource model and data model. The paper makes suggestions for the generation of a user model as a basis for an adaptive visualization system. We propose to extract information about the user by involving the user in interactive computer tests and games. Relevant abilities tested are color perception, color memory, color ranking, mental rotation, and fine motor coordination.&lt;&lt;ETX&gt;&gt;",Gitta Domik;Bernd Gutkauf,G.O. Domik;B. Gutkauf,"Paderborn Univ., Germany",10.1109/VISUAL.1990.146387;10.1109/VISUAL.1991.175795;10.1109/VISUAL.1990.146375,,29,7,26,
Vis,1995,Automated generation of visual simulation databases using remote sensing and GIS,10.1109/VISUAL.1995.480799,http://dx.doi.org/10.1109/VISUAL.1995.480799,86,"93, 442",C,"This paper reports on the development of a strategy to generate databases used for real-time interactive landscape visualization. The database construction from real world data is intended to be as automated as possible. The primary sources of information are remote sensing imagery recorded by Landsat's Thematic Mapper (TM) and digital elevation models (DEM). Additional datasets (traffic networks and buildings) are added to extend the database. In a first step the TM images are geocoded and then segmented into areas of different land coverage. During the visual simulation highly detailed photo textures are applied onto the terrain based on the classification results to increase the apparent amount of detail. The data processing and integration is carried out using custom image processing and geographic information systems (GIS) software. Finally, a sample visual simulation application is implemented. Emphasis is put on practical implementation to test the feasibility of the approach as a whole.",Martin Suter;Daniel Nüesch,M. Suter;D. Nuesch,"Dept. of Geogr., Zurich Univ., Switzerland;Dept. of Geogr., Zurich Univ., Switzerland",,"remote sensing, geographic information systems,geographic databases,satellite images,classification, visual simulation, level of detail",29,8,12,
InfoVis,2000,Density functions for visual attributes and effective partitioning in graph visualization,10.1109/INFVIS.2000.885090,http://dx.doi.org/10.1109/INFVIS.2000.885090,49,56,C,"Two tasks in graph visualization require partitioning: the assignment of visual attributes and divisive clustering. Often, we would like to assign a color or other visual attributes to a node or edge that indicates an associated value. In an application involving divisive clustering, we would like to partition the graph into subsets of graph elements based on metric values in such a way that all subsets are evenly populated. Assuming a uniform distribution of metric values during either partitioning or coloring can have undesired effects such as empty clusters or only one level of emphasis for the entire graph. Probability density functions derived from statistics about a metric can help systems succeed at these tasks.",Ivan Herman;M. Scott Marshall;Guy Melançon,I. Herman;M.S. Marshall;G. Melancon,"Centre for Math. & Comput. Sci., Amsterdam, Netherlands",10.1109/INFVIS.1999.801859;10.1109/VISUAL.1991.175773;10.1109/INFVIS.1999.801858;10.1109/VISUAL.1990.146360,"graph visualization, graph navigation, metrics, clustering",29,9,18,
Vis,2001,Compressing large polygonal models,10.1109/VISUAL.2001.964532,http://dx.doi.org/10.1109/VISUAL.2001.964532,357,262,C,"Presents an algorithm that uses partitioning and gluing to compress large triangular meshes which are too complex to fit in main memory. The algorithm is based largely on the existing mesh compression algorithms, most of which require an 'in-core' representation of the input mesh. Our solution is to partition the mesh into smaller submeshes and compress these submeshes separately using existing mesh compression techniques. Since a direct partition of the input mesh is out of question, instead we partition a simplified mesh and use the partition on the simplified model to obtain a partition on the original model. In order to recover the full connectivity, we present a simple scheme for encoding/decoding the resulting boundary structure from the mesh partition. When compressing large models with few singular vertices, a negligible portion of the compressed output is devoted to gluing information. On desktop computers, we have run experiments on models with millions of vertices, which could not be compressed using standard compression software packages, and have observed compression ratios as high as 17 to 1 using our technique.",Jeffrey Ho;Kuang-chih Lee;David J. Kriegman,J. Ho;Kuang-Chih Lee;D. Kriegman,"Beckman Inst. for Adv. Sci. & Technol., Illinois Univ., Urbana, IL, USA",10.1109/VISUAL.1997.663902;10.1109/VISUAL.1998.745327;10.1109/VISUAL.1999.809870,compression algorithms,29,14,21,
InfoVis,2003,Empirical comparison of dynamic query sliders and brushing histograms,10.1109/INFVIS.2003.1249020,http://dx.doi.org/10.1109/INFVIS.2003.1249020,147,153,C,"Dynamic queries facilitate rapid exploration of information by real-time visual display of both query formulation and results. Dynamic query sliders are linked to the main visualization to filter data. A common alternative to dynamic queries is to link several simple visualizations, such as histograms, to the main visualization with a brushing interaction strategy. Selecting data in the histograms highlights that data in the main visualization. We compare these two approaches in an empirical experiment on DataMaps, a geographic data visualization tool. Dynamic query sliders resulted in better performance for simple range tasks, while brushing histograms was better for complex trend evaluation and attribute relation tasks. Participants preferred brushing histograms for understanding relationships between attributes and the rich information they provided.",Qing Li;Chris North 0001,Qing Li;C. North,"Dept. of Comput. Sci., Virginia Polytech. Inst & State Univ., Blacksburg, VA, USA;Dept. of Comput. Sci., Virginia Polytech. Inst & State Univ., Blacksburg, VA, USA",10.1109/INFVIS.1999.801862,"Dynamic query, slider, histogram, usability study, information visualization, multidimensional visualization",29,1,16,
Vis,2003,Voxels on fire,10.1109/VISUAL.2003.1250382,http://dx.doi.org/10.1109/VISUAL.2003.1250382,271,278,C,We introduce a method for the animation of fire propagation and the burning consumption of objects represented as volumetric data sets. Our method uses a volumetric fire propagation model based on an enhanced distance field. It can simulate the spreading of multiple fire fronts over a specified isosurface without actually having to create that isosurface. The distance field is generated from a specific shell volume that rapidly creates narrow spatial bands around the virtual surface of any given isovalue. The complete distance field is then obtained by propagation from the initial bands. At each step multiple fire fronts can evolve simultaneously on the volumetric object. The flames of the fire are constructed from streams of particles whose movement is regulated by a velocity field generated with the hardware-accelerated Lattice Boltzmann Model (LBM). The LBM provides a physically-based simulation of the air flow around the burning object. The object voxels and the splats associated with the flame particles are rendered in the same pipeline so that the volume data with its external and internal structures can be displayed along with the fire.,Ye Zhao;Xiaoming Wei;Zhe Fan;Arie E. Kaufman;Hong Qin,Ye Zhao;Xiaoming Wei;Zhe Fan;A. Kaufman;Hong Qin,"Center for Visual Comput., Stony Brook Univ., NY, USA;Center for Visual Comput., Stony Brook Univ., NY, USA;Center for Visual Comput., Stony Brook Univ., NY, USA;Center for Visual Comput., Stony Brook Univ., NY, USA;Center for Visual Comput., Stony Brook Univ., NY, USA",10.1109/VISUAL.2002.1183779;10.1109/VISUAL.1993.398879,"Fire Propagation, Distance Field, Lattice Boltzmann Model, Splatting, GPU Acceleration",29,7,34,
Vis,2005,OpenGL multipipe SDK: a toolkit for scalable parallel rendering,10.1109/VISUAL.2005.1532786,http://dx.doi.org/10.1109/VISUAL.2005.1532786,119,126,C,"We describe OpenGL multipipe SDK (MPK), a toolkit for scalable parallel rendering based on OpenGL. MPK provides a uniform application programming interface (API) to manage scalable graphics applications across many different graphics subsystems. MPK-based applications run seamlessly from single-processor, single-pipe desktop systems to large multi-processor, multipipe scalable graphics systems. The application is oblivious of the system configuration, which can be specified through a configuration file at run time. To scale application performance, MPK uses a decomposition system that supports different modes for task partitioning and implements optimized CPU-based composition algorithms. MPK also provides a customizable image composition interface, which can be used to apply post-processing algorithms on raw pixel data obtained from executing sub-tasks on multiple graphics pipes in parallel. This can be used to implement parallel versions of any CPU-based algorithm, not necessarily used for rendering. In this paper, we motivate the need for a scalable graphics API and discuss the architecture of MPK. We present MPK's graphics configuration interface, introduce the notion of compound-based decomposition schemes and describe our implementation. We present some results from our work on a couple of target system architectures and conclude with future directions of research in this area.",Praveen Bhaniramka;Philippe C. D. Robert;Stefan Eilemann,Praveen Bhaniramka;P.C.D. Robert;S. Eilemann,,10.1109/VISUAL.1999.809890,"Scalable Rendering, Parallel Rendering, Immersive Environments, Scalable Graphics Hardware",29,6,39,
Vis,2005,Surface reconstruction via contour metamorphosis: an Eulerian approach with Lagrangian particle tracking,10.1109/VISUAL.2005.1532823,http://dx.doi.org/10.1109/VISUAL.2005.1532823,407,414,C,"We present a robust method for 3D reconstruction of closed surfaces from sparsely sampled parallel contours. A solution to this problem is especially important for medical segmentation, where manual contouring of 2D imaging scans is still extensively used. Our proposed method is based on a morphing process applied to neighboring contours that sweeps out a 3D surface. Our method is guaranteed to produce closed surfaces that exactly pass through the input contours, regardless of the topology of the reconstruction. Our general approach consecutively morphs between sets of input contours using an Eulerian formulation (i.e. fixed grid) augmented with Lagrangian particles (i.e. interface tracking). This is numerically accomplished by propagating the input contours as 2D level sets with carefully constructed continuous speed functions. Specifically this involves particle advection to estimate distances between the contours, monotonicity constrained spline interpolation to compute continuous speed functions without overshooting, and state-of-the-art numerical techniques for solving the level set equations. We demonstrate the robustness of our method on a variety of medical, topographic and synthetic data sets.",Ola Nilsson;David E. Breen;Ken Museth,O. Nilsson;D. Breen;K. Museth,"Linkoping Univ., Sweden",10.1109/VISUAL.1996.567812;10.1109/VISUAL.2002.1183773;10.1109/VISUAL.1998.745281;10.1109/VISUAL.1995.480820,"3D reconstruction, contours, level sets",29,6,43,
VAST,2006,Exploring Large-Scale Video News via Interactive Visualization,10.1109/VAST.2006.261433,http://dx.doi.org/10.1109/VAST.2006.261433,75,82,C,"In this paper, we have developed a novel visualization framework to enable more effective visual analysis of large-scale news videos, where keyframes and keywords are automatically extracted from news video clips and visually represented according to their interestingness measurement to help audiences rind news stories of interest at first glance. A computational approach is also developed to quantify the interestingness measurement of video clips. Our experimental results have shown that our techniques for intelligent news video analysis have the capacity to enable more effective visualization of large-scale news videos. Our news video visualization system is very useful for security applications and for general audiences to quickly find news topics of interest from among many channels",Hangzai Luo;Jianping Fan 0001;Jing Yang 0001;William Ribarsky;Shin'ichi Satoh,Hangzai Luo;Jianping Fan;Jing Yang;William Ribarsky;Shin'ichi Satoh,"Department of Computer Science, UNC-Charlotte, Charlotte, NC, USA. e-mail: hluo@uncc.edu;Department of Computer Science, UNC-Charlotte, Charlotte, NC, USA. e-mail: jfan@uncc.edu;Department of Computer Science, UNC-Charlotte, Charlotte, NC, USA. e-mail: jyang13@uncc.edu;Department of Computer Science, UNC-Charlotte, Charlotte, NC, USA. e-mail: rebarsky@uncc.edu;National Institute of Informatics, Tokyo, Japan. e-mail: satoh@nii.ac.jp",10.1109/INFVIS.1998.729570;10.1109/INFVIS.2003.1249019;10.1109/VISUAL.1991.175815,"News Visualization, Semantic Video Classification",29,19,25,
Vis,2006,Occlusion-Free Animation of Driving Routes for Car Navigation Systems,10.1109/TVCG.2006.167,http://dx.doi.org/10.1109/TVCG.2006.167,1141,1148,J,"This paper presents a method for occlusion-free animation of geographical landmarks, and its application to a new type of car navigation system in which driving routes of interest are always visible. This is achieved by animating a nonperspective image where geographical landmarks such as mountain tops and roads are rendered as if they are seen from different viewpoints. The technical contribution of this paper lies in formulating the nonperspective terrain navigation as an inverse problem of continuously deforming a 3D terrain surface from the 2D screen arrangement of its associated geographical landmarks. The present approach provides a perceptually reasonable compromise between the navigation clarity and visual realism where the corresponding nonperspective view is fully augmented by assigning appropriate textures and shading effects to the terrain surface according to its geometry. An eye tracking experiment is conducted to prove that the present approach actually exhibits visually-pleasing navigation frames while users can clearly recognize the shape of the driving route without occlusion, together with the spatial configuration of geographical landmarks in its neighborhood",Shigeo Takahashi;Kenichi Yoshida;Kenji Shimada;Tomoyuki Nishita,Shigeo Takahashi;Kenichi Yoshida;Kenji Shimada;Tomoyuki Nishita,"University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa, Chiba, 227-8561, Japan;University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa, Chiba, 227-8561, Japan;Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, U.S.A.;University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa, Chiba, 227-8561, Japan",10.1109/INFVIS.1997.636786;10.1109/VISUAL.2005.1532818,"car navigation systems, nonperspective projection, occlusion-free animation, visual perception, temporal coherence",29,24,24,
Vis,2006,Using Visual Cues of Contact to Improve Interactive Manipulation of Virtual Objects in Industrial Assembly/Maintenance Simulations,10.1109/TVCG.2006.189,http://dx.doi.org/10.1109/TVCG.2006.189,1013,1020,J,"This paper describes a set of visual cues of contact designed to improve the interactive manipulation of virtual objects in industrial assembly/maintenance simulations. These visual cues display information of proximity, contact and effort between virtual objects when the user manipulates a part inside a digital mock-up. The set of visual cues encloses the apparition of glyphs (arrow, disk, or sphere) when the manipulated object is close or in contact with another part of the virtual environment. Light sources can also be added at the level of contact points. A filtering technique is proposed to decrease the number of glyphs displayed at the same time. Various effects - such as change in color, change in size, and deformation of shape - can be applied to the glyphs as a function of proximity with other objects or amplitude of the contact forces. A preliminary evaluation was conducted to gather the subjective preference of a group of participants during the simulation of an automotive assembly operation. The collected questionnaires showed that participants globally appreciated our visual cues of contact. The changes in color appeared to be preferred concerning the display of distances and proximity information. Size changes and deformation effects appeared to be preferred in terms of perception of contact forces between the parts. Last, light sources were selected to focus the attention of the user on the contact areas",Jean Sreng;Anatole Lécuyer;Christine Mégard;Claude Andriot,Jean Sreng;Anatole Lecuyer;Christine Megard;Claude Andriot,IEEE Computer Society,10.1109/VISUAL.2001.964526;10.1109/VISUAL.2000.885692,"virtual prototyping, assembly/maintenance simulation, visual cues, glyph, light, contact, proximity, force",29,20,26,
Vis,2007,Generalized Streak Lines: Analysis and Visualization of Boundary Induced Vortices,10.1109/TVCG.2007.70557,http://dx.doi.org/10.1109/TVCG.2007.70557,1735,1742,J,"We present a method to extract and visualize vortices that originate from bounding walls of three-dimensional time- dependent flows. These vortices can be detected using their footprint on the boundary, which consists of critical points in the wall shear stress vector field. In order to follow these critical points and detect their transformations, affected regions of the surface are parameterized. Thus, an existing singularity tracking algorithm devised for planar settings can be applied. The trajectories of the singularities are used as a basis for seeding particles. This leads to a new type of streak line visualization, in which particles are released from a moving source. These generalized streak lines visualize the particles that are ejected from the wall. We demonstrate the usefulness of our method on several transient fluid flow datasets from computational fluid dynamics simulations.",Alexander Wiebel;Xavier Tricoche;Dominic Schneider;Heike Leitte;Gerik Scheuermann,Alexander Wiebel;Xavier Tricoche;Dominic Schneider;Heike Jaenicke;Gerik Scheuermann,IEEE Computer Society;IEEE Computer Society,10.1109/VISUAL.2004.107;10.1109/TVCG.2006.173;10.1109/TVCG.2006.199;10.1109/VISUAL.1990.146359;10.1109/VISUAL.2005.1532851;10.1109/VISUAL.1999.809896,"Skin friction, singularity tracking, vortex, generalized streak line, flow visualization, time-dependent vector fields",29,24,33,
InfoVis,2008,Balloon Focus: a Seamless Multi-Focus+Context Method for Treemaps,10.1109/TVCG.2008.114,http://dx.doi.org/10.1109/TVCG.2008.114,1157,1164,J,"The treemap is one of the most popular methods for visualizing hierarchical data. When a treemap contains a large number of items, inspecting or comparing a few selected items in a greater level of detail becomes very challenging. In this paper, we present a seamless multi-focus and context technique, called Balloon Focus, that allows the user to smoothly enlarge multiple treemap items served as the foci, while maintaining a stable treemap layout as the context. Our method has several desirable features. First, this method is quite general and can be used with different treemap layout algorithms. Second, as the foci are enlarged, the relative positions among all items are preserved. Third, the foci are placed in a way that the remaining space is evenly distributed back to the non-focus treemap items. When Balloon Focus enlarges the focus items to a maximum degree, the above features ensure that the treemap will maintain a consistent appearance and avoid any abrupt layout changes. In our algorithm, a DAG (Directed Acyclic Graph) is used to maintain the positional constraints, and an elastic model is employed to govern the placement of the treemap items. We demonstrate a treemap visualization system that integrates data query, manual focus selection, and our novel multi-focus+context technique, Balloon Focus, together. A user study was conducted. Results show that with Balloon Focus, users can better perform the tasks of comparing the values and the distribution of the foci.",Ying Tu;Han-Wei Shen,Ying Tu;Han-Wei Shen,the Ohio State University;the Ohio State University,10.1109/INFVIS.2000.885091;10.1109/INFVIS.2001.963278;10.1109/INFVIS.2005.1532148;10.1109/INFVIS.2002.1173156;10.1109/INFVIS.1996.559214;10.1109/INFVIS.1998.729558;10.1109/INFVIS.2005.1532132;10.1109/INFVIS.2004.66;10.1109/INFVIS.2002.1173151,"Treemap, focus+context, multi-focus, fisheye, magnification, visualizing query results, multi-scale viewing",29,16,28,
InfoVis,2008,Vispedia: Interactive Visual Exploration of Wikipedia Data via Search-Based Integration,10.1109/TVCG.2008.178,http://dx.doi.org/10.1109/TVCG.2008.178,1213,1220,J,"Wikipedia is an example of the collaborative, semi-structured data sets emerging on the Web. These data sets have large, non-uniform schema that require costly data integration into structured tables before visualization can begin. We present Vispedia, a Web-based visualization system that reduces the cost of this data integration. Users can browse Wikipedia, select an interesting data table, then use a search interface to discover, integrate, and visualize additional columns of data drawn from multiple Wikipedia articles. This interaction is supported by a fast path search algorithm over DBpedia, a semantic graph extracted from Wikipedia's hyperlink structure. Vispedia can also export the augmented data tables produced for use in traditional visualization systems. We believe that these techniques begin to address the ""long tail"" of visualization by allowing a wider audience to visualize a broader class of data. We evaluated this system in a first-use formative lab study. Study participants were able to quickly create effective visualizations for a diverse set of domains, performing data integration as needed.",Bryan Chan;Leslie Wu;Justin Talbot;Mike Cammarano;Pat Hanrahan,Bryan Chan;Leslie Wu;Justin Talbot;Mike Cammarano;Pat Hanrahan,Stanford University;Stanford University;Stanford University;Stanford University;Stanford University,10.1109/TVCG.2007.70617;10.1109/TVCG.2007.70577;10.1109/VAST.2007.4389010,"Information visualization, Data integration, Wikipedia, Semantic web, Search interfaces",29,22,34,
VAST,2008,Applied visual analytics for economic decision-making,10.1109/VAST.2008.4677363,http://dx.doi.org/10.1109/VAST.2008.4677363,107,114,C,"This paper introduces the application of visual analytics techniques as a novel approach for improving economic decision making. Particularly, we focus on two known problems where subjectspsila behavior consistently deviates from the optimal, the Winnerpsilas and Loserpsilas Curse. According to economists, subjects fail to recognize the profit-maximizing decision strategy in both the Winnerpsilas and Loserpsilas curse because they are unable to properly consider all the available information. As such, we have created a visual analytics tool to aid subjects in decision making under the Acquiring a Company framework common in many economic experiments. We demonstrate the added value of visual analytics in the decision making process through a series of user studies comparing standard visualization methods with interactive visual analytics techniques. Our work presents not only a basis for development and evaluation of economic visual analytic research, but also empirical evidence demonstrating the added value of applying visual analytics to general decision making tasks.",Anya Samak;Ross Maciejewski;David S. Ebert,Anya Savikhin;Ross Maciejewski;David S. Ebert,"Purdue University Department of Economics, USA;Purdue University Regional Visualization and Analytics Center (PURVAC), USA;Purdue University Regional Visualization and Analytics Center (PURVAC), USA",,,29,16,18,
Vis,2008,Interactive Blood Damage Analysis for Ventricular Assist Devices,10.1109/TVCG.2008.142,http://dx.doi.org/10.1109/TVCG.2008.142,1515,1522,J,"Ventricular Assist Devices (VADs) support the heart in its vital task of maintaining circulation in the human body when the heart alone is not able to maintain a sufficient flow rate due to illness or degenerative diseases. However, the engineering of these devices is a highly demanding task. Advanced modeling methods and computer simulations allow the investigation of the fluid flow inside such a device and in particular of potential blood damage. In this paper we present a set of visualization methods which have been designed to specifically support the analysis of a tensor-based blood damage prediction model. This model is based on the tracing of particles through the VAD, for each of which the cumulative blood damage can be computed. The model's tensor output approximates a single blood cell's deformation in the flow field. The tensor and derived scalar data are subsequently visualized using techniques based on icons, particle visualization, and function plotting. All these techniques are accessible through a Virtual Reality-based user interface, which features not only stereoscopic rendering but also natural interaction with the complex three-dimensional data. To illustrate the effectiveness of these visualization methods, we present the results of an analysis session that was performed by domain experts for a specific data set for the MicroMed DeBakey VAD.",Bernd Hentschel 0001;Irene Tedjo-Palczynski;Markus Probst;Marc Wolter;Marek Behr;Christian H. Bischof;Torsten W. Kuhlen,Bernd Hentschel;Irene Tedjo;Markus Probst;Marc Wolter;Marek Behr;Christian Bischof;Torsten Kuhlen,"Virtual Reality Group, RWTH Aachen University;Virtual Reality Group, RWTH Aachen University;Chair for Computational Analysis of Technical Systems (CATS), RWTH Aachen University;Virtual Reality Group, RWTH Aachen University;Chair for Computational Analysis of Technical Systems (CATS), RWTH Aachen University;Institute for Scientific Computing, RWTH Aachen University;Virtual Reality Group, RWTH Aachen University",10.1109/VISUAL.2004.55;10.1109/VISUAL.1991.175771;10.1109/VISUAL.2004.80;10.1109/VISUAL.2002.1183798;10.1109/VISUAL.1993.398849;10.1109/TVCG.2006.134;10.1109/TVCG.2006.181;10.1109/VISUAL.1991.175781;10.1109/VISUAL.1996.567777,"Tensor visualization, time-dependent data, blood damage, ventricular assist device, virtual reality",29,22,30,
InfoVis,2009,Comparing Dot and Landscape Spatializations for Visual Memory Differences,10.1109/TVCG.2009.127,http://dx.doi.org/10.1109/TVCG.2009.127,1033,1040,J,"Spatialization displays use a geographic metaphor to arrange non-spatial data. For example, spatializations are commonly applied to document collections so that document themes appear as geographic features such as hills. Many common spatialization interfaces use a 3-D landscape metaphor to present data. However, it is not clear whether 3-D spatializations afford improved speed and accuracy for user tasks compared to similar 2-D spatializations. We describe a user study comparing users' ability to remember dot displays, 2-D landscapes, and 3-D landscapes for two different data densities (500 vs. 1000 points). Participants' visual memory was statistically more accurate when viewing dot displays and 3-D landscapes compared to 2-D landscapes. Furthermore, accuracy remembering a spatialization was significantly better overall for denser spatializations. Theseresults are of benefit to visualization designers who are contemplating the best ways to present data using spatialization techniques.",Melanie Tory;Colin Swindells;Rebecca Dreezer,Melanie Tory;Colin Swindells;Rebecca Dreezer,University of Victoria;University of Victoria;McMaster University,10.1109/INFVIS.2004.19;10.1109/INFVIS.2002.1173146;10.1109/TVCG.2007.70596;10.1109/INFVIS.2004.60;10.1109/INFVIS.2001.963291;10.1109/INFVIS.1995.528686;10.1109/INFVIS.2001.963291;10.1109/INFVIS.2001.963274,"Information interfaces and presentation, screen design, evaluation / methodology, user / machine systems, software psychology, landscape visualization",29,22,31,
VAST,2009,Describing story evolution from dynamic information streams,10.1109/VAST.2009.5333437,http://dx.doi.org/10.1109/VAST.2009.5333437,99,106,C,"Sources of streaming information, such as news syndicates, publish information continuously. Information portals and news aggregators list the latest information from around the world enabling information consumers to easily identify events in the past 24 hours. The volume and velocity of these streams causes information from prior days to quickly vanish despite its utility in providing an informative context for interpreting new information. Few capabilities exist to support an individual attempting to identify or understand trends and changes from streaming information over time. The burden of retaining prior information and integrating with the new is left to the skills, determination, and discipline of each individual. In this paper we present a visual analytics system for linking essential content from information streams over time into dynamic stories that develop and change over multiple days. We describe particular challenges to the analysis of streaming information and present a fundamental visual representation for showing story change and evolution over time.",Stuart J. Rose;Scott Butner;Wendy Cowley;Michelle L. Gregory;Julia Walker,Stuart Rose;Scott Butner;Wendy Cowley;Michelle Gregory;Julia Walker,"Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA",10.1109/INFVIS.2000.885098;10.1109/INFVIS.2005.1532133,,29,16,18,
Vis,2009,Interactive Visual Analysis of Complex Scientific Data as Families of Data Surfaces,10.1109/TVCG.2009.155,http://dx.doi.org/10.1109/TVCG.2009.155,1351,1358,J,"The widespread use of computational simulation in science and engineering provides challenging research opportunities. Multiple independent variables are considered and large and complex data are computed, especially in the case of multi-run simulation. Classical visualization techniques deal well with 2D or 3D data and also with time-dependent data. Additional independent dimensions, however, provide interesting new challenges. We present an advanced visual analysis approach that enables a thorough investigation of families of data surfaces, i.e., datasets, with respect to pairs of independent dimensions. While it is almost trivial to visualize one such data surface, the visual exploration and analysis of many such data surfaces is a grand challenge, stressing the users' perception and cognition. We propose an approach that integrates projections and aggregations of the data surfaces at different levels (one scalar aggregate per surface, a 1D profile per surface, or the surface as such). We demonstrate the necessity for a flexible visual analysis system that integrates many different (linked) views for making sense of this highly complex data. To demonstrate its usefulness, we exemplify our approach in the context of a meteorological multi-run simulation data case and in the context of the engineering domain, where our collaborators are working with the simulation of elastohydrodynamic (EHD) lubrication bearing in the automotive industry.",Kresimir Matkovic;Denis Gracanin;Borislav Klarin;Helwig Hauser,Kresimir Matkovic;Denis Gracanin;Borislav Klarin;Helwig Hauser,"VRVis Research Center, Vienna, Austria;Virginia Tech., Blacksburg, USA;AVL AST d. o. o., Zagreb, Croatia;University of Bergen, Norway",10.1109/VISUAL.1997.663867;10.1109/TVCG.2008.145;10.1109/INFVIS.2001.963273;10.1109/TVCG.2006.170,"Interactive visual analysis, family of surfaces, coordinated multiple views, multidimensional multivariate data",29,25,23,
Vis,2010,Exploration and Visualization of Segmentation Uncertainty using Shape and Appearance Prior Information,10.1109/TVCG.2010.152,http://dx.doi.org/10.1109/TVCG.2010.152,1366,1375,J,We develop an interactive analysis and visualization tool for probabilistic segmentation in medical imaging. The originality of our approach is that the data exploration is guided by shape and appearance knowledge learned from expert-segmented images of a training population. We introduce a set of multidimensional transfer function widgets to analyze the multivariate probabilistic field data. These widgets furnish the user with contextual information about conformance or deviation from the population statistics. We demonstrate the user's ability to identify suspicious regions (e.g. tumors) and to correct the misclassification results. We evaluate our system and demonstrate its usefulness in the context of static anatomical and time-varying functional imaging datasets.,Ahmed Saad;Ghassan Hamarneh;Torsten Möller,Ahmed Saad;Ghassan Hamarneh;Torsten Moller,Simon Fraser University;Simon Fraser University;Simon Fraser University,10.1109/TVCG.2009.189;10.1109/VISUAL.2005.1532807;10.1109/VISUAL.2003.1250414;10.1109/TVCG.2007.70518,"Uncertainty visualization, Medical imaging, Probabilistic segmentation",29,21,51,
InfoVis,2011,Adaptive Privacy-Preserving Visualization Using Parallel Coordinates,10.1109/TVCG.2011.163,http://dx.doi.org/10.1109/TVCG.2011.163,2241,2248,J,"Current information visualization techniques assume unrestricted access to data. However, privacy protection is a key issue for a lot of real-world data analyses. Corporate data, medical records, etc. are rich in analytical value but cannot be shared without first going through a transformation step where explicit identifiers are removed and the data is sanitized. Researchers in the field of data mining have proposed different techniques over the years for privacy-preserving data publishing and subsequent mining techniques on such sanitized data. A well-known drawback in these methods is that for even a small guarantee of privacy, the utility of the datasets is greatly reduced. In this paper, we propose an adaptive technique for privacy preser vation in parallel coordinates. Based on knowledge about the sensitivity of the data, we compute a clustered representation on the fly, which allows the user to explore the data without breaching privacy. Through the use of screen-space privacy metrics, the technique adapts to the user's screen parameters and interaction. We demonstrate our method in a case study and discuss potential attack scenarios.",Aritra Dasgupta;Robert Kosara,Aritra Dasgupta;Robert Kosara,UNC-Charlotte;UNC-Charlotte,10.1109/VISUAL.1990.146402;10.1109/INFVIS.2005.1532138;10.1109/TVCG.2010.184;10.1109/VISUAL.1999.809866;10.1109/TVCG.2006.170,"Parallel coordinates, privacy, clustering",29,23,30,
InfoVis,2011,Sequence Surveyor: Leveraging Overview for Scalable Genomic Alignment Visualization,10.1109/TVCG.2011.232,http://dx.doi.org/10.1109/TVCG.2011.232,2392,2401,J,"In this paper, we introduce overview visualization tools for large-scale multiple genome alignment data. Genome alignment visualization and, more generally, sequence alignment visualization are an important tool for understanding genomic sequence data. As sequencing techniques improve and more data become available, greater demand is being placed on visualization tools to scale to the size of these new datasets. When viewing such large data, we necessarily cannot convey details, rather we specifically design overview tools to help elucidate large-scale patterns. Perceptual science, signal processing theory, and generality provide a framework for the design of such visualizations that can scale well beyond current approaches. We present Sequence Surveyor, a prototype that embodies these ideas for scalable multiple whole-genome alignment overview visualization. Sequence Surveyor visualizes sequences in parallel, displaying data using variable color, position, and aggregation encodings. We demonstrate how perceptual science can inform the design of visualization techniques that remain visually manageable at scale and how signal processing concepts can inform aggregation schemes that highlight global trends, outliers, and overall data distributions as the problem scales. These techniques allow us to visualize alignments with over 100 whole bacterial-sized genomes.",Danielle Albers Szafir;Colin N. Dewey;Michael Gleicher,Danielle Albers;Colin Dewey;Michael Gleicher,University of Wisconsin-Madison;University of Wisconsin-Madison;University of Wisconsin-Madison,10.1109/TVCG.2007.70623;10.1109/INFVIS.2002.1173156;10.1109/TVCG.2009.128;10.1109/TVCG.2009.167,"Bioinformatics Visualization, Perception Theory, Scalability Issues, Visual Design",29,26,34,
Vis,2011,Authalic Parameterization of General Surfaces Using Lie Advection,10.1109/TVCG.2011.171,http://dx.doi.org/10.1109/TVCG.2011.171,2005,2014,J,"Parameterization of complex surfaces constitutes a major means of visualizing highly convoluted geometric structures as well as other properties associated with the surface. It also enables users with the ability to navigate, orient, and focus on regions of interest within a global view and overcome the occlusions to inner concavities. In this paper, we propose a novel area-preserving surface parameterization method which is rigorous in theory, moderate in computation, yet easily extendable to surfaces of non-disc and closed-boundary topologies. Starting from the distortion induced by an initial parameterization, an area restoring diffeomorphic flow is constructed as a Lie advection of differential 2-forms along the manifold, which yields equality of the area elements between the domain and the original surface at its final state. Existence and uniqueness of result are assured through an analytical derivation. Based upon a triangulated surface representation, we also present an efficient algorithm in line with discrete differential modeling. As an exemplar application, the utilization of this method for the effective visualization of brain cortical imaging modalities is presented. Compared with conformal methods, our method can reveal more subtle surface patterns in a quantitative manner. It, therefore, provides a competitive alternative to the existing parameterization techniques for better surface-based analysis in various scenarios.",Guangyu Zou;Jiaxi Hu;Xianfeng Gu;Jing Hua,Guangyu Zou;Jiaxi Hu;Xianfeng Gu;Jing Hua,Wayne State University;Wayne State University;Stony Brook University;Wayne State University,10.1109/TVCG.2008.134;10.1109/TVCG.2009.159;10.1109/TVCG.2006.134;10.1109/VISUAL.2004.75;10.1109/VISUAL.2002.1183795;10.1109/VISUAL.2001.964553,"Area-preserving surface parameterization, differential forms, Lie advection, surface visualization",29,29,37,
InfoVis,2012,Algorithms for Labeling Focus Regions,10.1109/TVCG.2012.193,http://dx.doi.org/10.1109/TVCG.2012.193,2583,2592,J,"In this paper, we investigate the problem of labeling point sites in focus regions of maps or diagrams. This problem occurs, for example, when the user of a mapping service wants to see the names of restaurants or other POIs in a crowded downtown area but keep the overview over a larger area. Our approach is to place the labels at the boundary of the focus region and connect each site with its label by a linear connection, which is called a leader. In this way, we move labels from the focus region to the less valuable context region surrounding it. In order to make the leader layout well readable, we present algorithms that rule out crossings between leaders and optimize other characteristics such as total leader length and distance between labels. This yields a new variant of the boundary labeling problem, which has been studied in the literature. Other than in traditional boundary labeling, where leaders are usually schematized polylines, we focus on leaders that are either straight-line segments or Bezier curves. Further, we present algorithms that, given the sites, find a position of the focus region that optimizes the above characteristics. We also consider a variant of the problem where we have more sites than space for labels. In this situation, we assume that the sites are prioritized by the user. Alternatively, we take a new facility-location perspective which yields a clustering of the sites. We label one representative of each cluster. If the user wishes, we apply our approach to the sites within a cluster, giving details on demand.",Martin Fink 0001;Jan-Henrik Haunert;André Schulz 0001;Joachim Spoerhase;Alexander Wolff 0001,Martin Fink;Jan-Henrik Haunert;André Schulz;Joachim Spoerhase;Alexander Wolff,Universität Würzburg;Universität Würzburg;Universität Münster;Universität Würzburg;Universität Würzburg,10.1109/TVCG.2011.191;10.1109/TVCG.2010.180;10.1109/TVCG.2011.183;10.1109/INFVIS.2000.885087,"Focus+context techniques, data clustering, mobile and ubiquitous visualization, geographic/geospatial visualization",29,26,28,
SciVis,2012,Multivariate Data Analysis Using Persistence-Based filtering and Topological Signatures,10.1109/TVCG.2012.248,http://dx.doi.org/10.1109/TVCG.2012.248,2382,2391,J,"The extraction of significant structures in arbitrary high-dimensional data sets is a challenging task. Moreover, classifying data points as noise in order to reduce a data set bears special relevance for many application domains. Standard methods such as clustering serve to reduce problem complexity by providing the user with classes of similar entities. However, they usually do not highlight relations between different entities and require a stopping criterion, e.g. the number of clusters to be detected. In this paper, we present a visualization pipeline based on recent advancements in algebraic topology. More precisely, we employ methods from persistent homology that enable topological data analysis on high-dimensional data sets. Our pipeline inherently copes with noisy data and data sets of arbitrary dimensions. It extracts central structures of a data set in a hierarchical manner by using a persistence-based filtering algorithm that is theoretically well-founded. We furthermore introduce persistence rings, a novel visualization technique for a class of topological features-the persistence intervals-of large data sets. Persistence rings provide a unique topological signature of a data set, which helps in recognizing similarities. In addition, we provide interactive visualization techniques that assist the user in evaluating the parameter space of our method in order to extract relevant structures. We describe and evaluate our analysis pipeline by means of two very distinct classes of data sets: First, a class of synthetic data sets containing topological objects is employed to highlight the interaction capabilities of our method. Second, in order to affirm the utility of our technique, we analyse a class of high-dimensional real-world data sets arising from current research in cultural heritage.",Bastian Rieck;Hubert Mara;Heike Leitte,Bastian Rieck;Hubert Mara;Heike Leitte,Interdisciplinary Center for Scientific Computing;Interdisciplinary Center for Scientific Computing;Interdisciplinary Center for Scientific Computing,10.1109/VISUAL.1990.146373;10.1109/VISUAL.2005.1532839;10.1109/TVCG.2007.70601;10.1109/VISUAL.2002.1183774,"Topological persistence, multivariate data, clustering",29,27,40,
VAST,2012,An Affordance-Based Framework for Human Computation and Human-Computer Collaboration,10.1109/TVCG.2012.195,http://dx.doi.org/10.1109/TVCG.2012.195,2859,2868,J,"Visual Analytics is “the science of analytical reasoning facilitated by visual interactive interfaces” [70]. The goal of this field is to develop tools and methodologies for approaching problems whose size and complexity render them intractable without the close coupling of both human and machine analysis. Researchers have explored this coupling in many venues: VAST, Vis, InfoVis, CHI, KDD, IUI, and more. While there have been myriad promising examples of human-computer collaboration, there exists no common language for comparing systems or describing the benefits afforded by designing for such collaboration. We argue that this area would benefit significantly from consensus about the design attributes that define and distinguish existing techniques. In this work, we have reviewed 1,271 papers from many of the top-ranking conferences in visual analytics, human-computer interaction, and visualization. From these, we have identified 49 papers that are representative of the study of human-computer collaborative problem-solving, and provide a thorough overview of the current state-of-the-art. Our analysis has uncovered key patterns of design hinging on humanand machine-intelligence affordances, and also indicates unexplored avenues in the study of this area. The results of this analysis provide a common framework for understanding these seemingly disparate branches of inquiry, which we hope will motivate future work in the field.",R. Jordan Crouser;Remco Chang,R. Jordon Crouser;Remco Chang,Tufts University;Tufts University,10.1109/VAST.2010.5652398;10.1109/VAST.2011.6102461;10.1109/TVCG.2009.199;10.1109/VAST.2010.5652910;10.1109/VAST.2010.5652484;10.1109/VAST.2009.5332584;10.1109/VAST.2010.5652885;10.1109/VAST.2009.5333564;10.1109/VAST.2010.5652392;10.1109/VAST.2009.5332586;10.1109/VAST.2011.6102451;10.1109/VAST.2009.5333023;10.1109/VAST.2009.5333020;10.1109/VAST.2009.5332628;10.1109/TVCG.2011.173;10.1109/TVCG.2011.218;10.1109/TVCG.2011.231;10.1109/VAST.2010.5652443;10.1109/VAST.2010.5653598;10.1109/VAST.2011.6102447,"Human computation, human complexity, theory, framework",29,25,83,
InfoVis,2014,The Not-so-Staggering Effect of Staggered Animated Transitions on Visual Tracking,10.1109/TVCG.2014.2346424,http://dx.doi.org/10.1109/TVCG.2014.2346424,2241,2250,J,"Interactive visual applications often rely on animation to transition from one display state to another. There are multiple animation techniques to choose from, and it is not always clear which should produce the best visual correspondences between display elements. One major factor is whether the animation relies on staggering-an incremental delay in start times across the moving elements. It has been suggested that staggering may reduce occlusion, while also reducing display complexity and producing less overwhelming animations, though no empirical evidence has demonstrated these advantages. Work in perceptual psychology does show that reducing occlusion, and reducing inter-object proximity (crowding) more generally, improves performance in multiple object tracking. We ran simulations confirming that staggering can in some cases reduce crowding in animated transitions involving dot clouds (as found in, e.g., animated 2D scatterplots). We empirically evaluated the effect of two staggering techniques on tracking tasks, focusing on cases that should most favour staggering. We found that introducing staggering has a negligible, or even negative, impact on multiple object tracking performance. The potential benefits of staggering may be outweighed by strong costs: a loss of common-motion grouping information about which objects travel in similar paths, and less predictability about when any specific object would begin to move. Staggering may be beneficial in some conditions, but they have yet to be demonstrated. The present results are a significant step toward a better understanding of animation pacing, and provide direction for further research.",Fanny Chevalier;Pierre Dragicevic;Steven Franconeri,Fanny Chevalier;Pierre Dragicevic;Steven Franconeri,Inria;Inria;Northwestern University,10.1109/TVCG.2012.199;10.1109/INFVIS.1999.801854;10.1109/INFVIS.2002.1173148;10.1109/TVCG.2008.153;10.1109/TVCG.2007.70539,"Animated transitions, staggered animation, visual tracking",29,29,41,
VAST,2014,PEARL: An Interactive Visual Analytic Tool for Understanding Personal Emotion Style Derived from Social Media,10.1109/VAST.2014.7042496,http://dx.doi.org/10.1109/VAST.2014.7042496,203,212,C,"Hundreds of millions of people leave digital footprints on social media (e.g., Twitter and Facebook). Such data not only disclose a person's demographics and opinions, but also reveal one's emotional style. Emotional style captures a person's patterns of emotions over time, including his overall emotional volatility and resilience. Understanding one's emotional style can provide great benefits for both individuals and businesses alike, including the support of self-reflection and delivery of individualized customer care. We present PEARL, a timeline-based visual analytic tool that allows users to interactively discover and examine a person's emotional style derived from this person's social media text. Compared to other visual text analytic systems, our work offers three unique contributions. First, it supports multi-dimensional emotion analysis from social media text to automatically detect a person's expressed emotions at different time points and summarize those emotions to reveal the person's emotional style. Second, it effectively visualizes complex, multi-dimensional emotion analysis results to create a visual emotional profile of an individual, which helps users browse and interpret one's emotional style. Third, it supports rich visual interactions that allow users to interactively explore and validate emotion analysis results. We have evaluated our work extensively through a series of studies. The results demonstrate the effectiveness of our tool both in emotion analysis from social media and in support of interactive visualization of the emotion analysis results.",Jian Zhao 0010;Liang Gou;Fei Wang;Michelle X. Zhou,Jian Zhao;Liang Gou;Fei Wang;Michelle Zhou,University of Toronto;IBM Research Almad&#x00E9;n;IBM Research Almad&#x00E9;n;IBM Research Almad&#x00E9;n,10.1109/TVCG.2011.239;10.1109/VAST.2012.6400485;10.1109/TVCG.2010.129;10.1109/TVCG.2011.185;10.1109/TVCG.2010.183,"Personal emotion analytics, affective and mood modeling, social media text, Twitter, information visualization",29,24,34,
InfoVis,2015,"Improving Bayesian Reasoning: The Effects of Phrasing, Visualization, and Spatial Ability",10.1109/TVCG.2015.2467758,http://dx.doi.org/10.1109/TVCG.2015.2467758,529,538,J,"Decades of research have repeatedly shown that people perform poorly at estimating and understanding conditional probabilities that are inherent in Bayesian reasoning problems. Yet in the medical domain, both physicians and patients make daily, life-critical judgments based on conditional probability. Although there have been a number of attempts to develop more effective ways to facilitate Bayesian reasoning, reports of these findings tend to be inconsistent and sometimes even contradictory. For instance, the reported accuracies for individuals being able to correctly estimate conditional probability range from 6% to 62%. In this work, we show that problem representation can significantly affect accuracies. By controlling the amount of information presented to the user, we demonstrate how text and visualization designs can increase overall accuracies to as high as 77%. Additionally, we found that for users with high spatial ability, our designs can further improve their accuracies to as high as 100%. By and large, our findings provide explanations for the inconsistent reports on accuracy in Bayesian reasoning tasks and show a significant improvement over existing methods. We believe that these findings can have immediate impact on risk communication in health-related fields.",Alvitta Ottley;Evan M. Peck;Lane Harrison;Daniel Afergan;Caroline Ziemkiewicz;Holly A. Taylor;Paul K. J. Han;Remco Chang,Alvitta Ottley;Evan M. Peck;Lane T. Harrison;Daniel Afergan;Caroline Ziemkiewicz;Holly A. Taylor;Paul K. J. Han;Remco Chang,Tufts University;Bucknell University;Tufts University;Tufts University;Tufts University and Aptima Inc.;Tufts University;Maine Medical Center and Tufts Medical School;Tufts University,10.1109/TVCG.2014.2346575;10.1109/VAST.2010.5653587;10.1109/TVCG.2011.255;10.1109/TVCG.2013.119;10.1109/TVCG.2012.199;10.1109/TVCG.2010.179;10.1109/VISUAL.2005.1532836,"Bayesian Reasoning, Visualization, Spatial Ability, Individual Differences",29,28,47,
SciVis,2015,Gaze Stripes: Image-Based Visualization of Eye Tracking Data,10.1109/TVCG.2015.2468091,http://dx.doi.org/10.1109/TVCG.2015.2468091,1005,1014,J,"We present a new visualization approach for displaying eye tracking data from multiple participants. We aim to show the spatio-temporal data of the gaze points in the context of the underlying image or video stimulus without occlusion. Our technique, denoted as gaze stripes, does not require the explicit definition of areas of interest but directly uses the image data around the gaze points, similar to thumbnails for images. A gaze stripe consists of a sequence of such gaze point images, oriented along a horizontal timeline. By displaying multiple aligned gaze stripes, it is possible to analyze and compare the viewing behavior of the participants over time. Since the analysis is carried out directly on the image data, expensive post-processing or manual annotation are not required. Therefore, not only patterns and outliers in the participants' scanpaths can be detected, but the context of the stimulus is available as well. Furthermore, our approach is especially well suited for dynamic stimuli due to the non-aggregated temporal mapping. Complementary views, i.e., markers, notes, screenshots, histograms, and results from automatic clustering, can be added to the visualization to display analysis results. We illustrate the usefulness of our technique on static and dynamic stimuli. Furthermore, we discuss the limitations and scalability of our approach in comparison to established visualization techniques.",Kuno Kurzhals;Marcel Hlawatsch;Florian Heimerl;Michael Burch;Thomas Ertl;Daniel Weiskopf,Kuno Kurzhals;Marcel Hlawatsch;Florian Heimerl;Michael Burch;Thomas Ertl;Daniel Weiskopf,University of Stuttgart;University of Stuttgart;University of Stuttgart;University of Stuttgart;University of Stuttgart;University of Stuttgart,10.1109/TVCG.2011.232;10.1109/TVCG.2012.276;10.1109/INFVIS.2002.1173156;10.1109/TVCG.2013.194;10.1109/TVCG.2008.125,"Eye tracking, time-dependent data, spatio-temporal visualization",29,20,38,
InfoVis,2016,Colorgorical: Creating discriminable and preferable color palettes for information visualization,10.1109/TVCG.2016.2598918,http://dx.doi.org/10.1109/TVCG.2016.2598918,521,530,J,"We present an evaluation of Colorgorical, a web-based tool for creating discriminable and aesthetically preferable categorical color palettes. Colorgorical uses iterative semi-random sampling to pick colors from CIELAB space based on user-defined discriminability and preference importances. Colors are selected by assigning each a weighted sum score that applies the user-defined importances to Perceptual Distance, Name Difference, Name Uniqueness, and Pair Preference scoring functions, which compare a potential sample to already-picked palette colors. After, a color is added to the palette by randomly sampling from the highest scoring palettes. Users can also specify hue ranges or build off their own starting palettes. This procedure differs from previous approaches that do not allow customization (e.g., pre-made ColorBrewer palettes) or do not consider visualization design constraints (e.g., Adobe Color and ACE). In a Palette Score Evaluation, we verified that each scoring function measured different color information. Experiment 1 demonstrated that slider manipulation generates palettes that are consistent with the expected balance of discriminability and aesthetic preference for 3-, 5-, and 8-color palettes, and also shows that the number of colors may change the effectiveness of pair-based discriminability and preference scores. For instance, if the Pair Preference slider were upweighted, users would judge the palettes as more preferable on average. Experiment 2 compared Colorgorical palettes to benchmark palettes (ColorBrewer, Microsoft, Tableau, Random). Colorgorical palettes are as discriminable and are at least as preferable or more preferable than the alternative palette sets. In sum, Colorgorical allows users to make customized color palettes that are, on average, as effective as current industry standards by balancing the importance of discriminability and aesthetic preference.",Connor Gramazio;David H. Laidlaw;Karen B. Schloss,Connor C. Gramazio;David H. Laidlaw;Karen B. Schloss,"Dept. of Computer Science at Brown University;Dept. of Computer Science at Brown University;Dept. of Cognitive, Linguistic, and Psychological Sciences at Brown University",10.1109/VISUAL.1996.568118;10.1109/TVCG.2014.2346978;10.1109/TVCG.2015.2467471;10.1109/TVCG.2014.2346983;10.1109/TVCG.2012.233,Aesthetics in Visualization;Color Perception;Metrics & Benchmarks;Visual Design;Visualization,29,36,37,
InfoVis,2016,The Attraction Effect in Information Visualization,10.1109/TVCG.2016.2598594,http://dx.doi.org/10.1109/TVCG.2016.2598594,471,480,J,"The attraction effect is a well-studied cognitive bias in decision making research, where one's choice between two alternatives is influenced by the presence of an irrelevant (dominated) third alternative. We examine whether this cognitive bias, so far only tested with three alternatives and simple presentation formats such as numerical tables, text and pictures, also appears in visualizations. Since visualizations can be used to support decision making - e.g., when choosing a house to buy or an employee to hire - a systematic bias could have important implications. In a first crowdsource experiment, we indeed partially replicated the attraction effect with three alternatives presented as a numerical table, and observed similar effects when they were presented as a scatterplot. In a second experiment, we investigated if the effect extends to larger sets of alternatives, where the number of alternatives is too large for numerical tables to be practical. Our findings indicate that the bias persists for larger sets of alternatives presented as scatterplots. We discuss implications for future research on how to further study and possibly alleviate the attraction effect.",Evanthia Dimara;Anastasia Bezerianos;Pierre Dragicevic,Evanthia Dimara;Anastasia Bezerianos;Pierre Dragicevic,"Inria and Universit&#x00E9; Paris-Saclay;Inria, Univ Paris-Sud &#x0026; CNRS (LRI)Universit&#x00E9; Paris-Saclay;Inria and Universit&#x00E9; Paris-Saclay",10.1109/TVCG.2008.153;10.1109/TVCG.2014.2346984;10.1109/VAST.2008.4677363;10.1109/TVCG.2014.2346298;10.1109/TVCG.2012.199;10.1109/TVCG.2010.174;10.1109/VAST.2009.5333920,cognitive bias;Information visualization;decision-making;decoy effect;attraction effect;asymmetric dominance effect,29,29,61,HM
SciVis,2016,Urban Pulse: Capturing the Rhythm of Cities,10.1109/TVCG.2016.2598585,http://dx.doi.org/10.1109/TVCG.2016.2598585,791,800,J,"Cities are inherently dynamic. Interesting patterns of behavior typically manifest at several key areas of a city over multiple temporal resolutions. Studying these patterns can greatly help a variety of experts ranging from city planners and architects to human behavioral experts. Recent technological innovations have enabled the collection of enormous amounts of data that can help in these studies. However, techniques using these data sets typically focus on understanding the data in the context of the city, thus failing to capture the dynamic aspects of the city. The goal of this work is to instead understand the city in the context of multiple urban data sets. To do so, we define the concept of an “urban pulse” which captures the spatio-temporal activity in a city across multiple temporal resolutions. The prominent pulses in a city are obtained using the topology of the data sets, and are characterized as a set of beats. The beats are then used to analyze and compare different pulses. We also design a visual exploration framework that allows users to explore the pulses within and across multiple cities under different conditions. Finally, we present three case studies carried out by experts from two different domains that demonstrate the utility of our framework.",Fabio Miranda 0001;Harish Doraiswamy;Marcos Lage;Kai Zhao;Bruno Gonçalves;Luc Wilson;Mondrian Hsieh;Cláudio T. Silva,Fabio Miranda;Harish Doraiswamy;Marcos Lage;Kai Zhao;Bruno Gonçalves;Luc Wilson;Mondrian Hsieh;Cláudio T. Silva,New York University;New York University;Universidade Federal Fluminense;New York University;New York University;Kohn Pedersen Fox Associates PC;Kohn Pedersen Fox Associates PC;New York University,10.1109/TVCG.2015.2467592;10.1109/VAST.2015.7347636;10.1109/TVCG.2014.2346898;10.1109/TVCG.2013.226;10.1109/TVCG.2013.228;10.1109/TVCG.2015.2467619;10.1109/TVCG.2015.2467194;10.1109/VAST.2015.7347630;10.1109/TVCG.2011.181;10.1109/TVCG.2013.131;10.1109/TVCG.2015.2468111;10.1109/TVCG.2014.2346449,Topology-based techniques;urban data;visual exploration,29,31,53,
InfoVis,2017,Considerations for Visualizing Comparison,10.1109/TVCG.2017.2744199,http://dx.doi.org/10.1109/TVCG.2017.2744199,413,423,J,"Supporting comparison is a common and diverse challenge in visualization. Such support is difficult to design because solutions must address both the specifics of their scenario as well as the general issues of comparison. This paper aids designers by providing a strategy for considering those general issues. It presents four considerations that abstract comparison. These considerations identify issues and categorize solutions in a domain independent manner. The first considers how the common elements of comparison-a target set of items that are related and an action the user wants to perform on that relationship-are present in an analysis problem. The second considers why these elements lead to challenges because of their scale, in number of items, complexity of items, or complexity of relationship. The third considers what strategies address the identified scaling challenges, grouping solutions into three broad categories. The fourth considers which visual designs map to these strategies to provide solutions for a comparison analysis problem. In sequence, these considerations provide a process for developers to consider support for comparison in the design of visualization tools. Case studies show how these considerations can help in the design and evaluation of visualization solutions for comparison problems.",Michael Gleicher,Michael Gleicher,University of Wisconsin-Madison,10.1109/TVCG.2011.232;10.1109/TVCG.2015.2467618;10.1109/TVCG.2013.124;10.1109/VAST.2012.6400486;10.1109/TVCG.2014.2346298;10.1109/TVCG.2007.70535;10.1109/TVCG.2015.2467204;10.1109/TVCG.2012.284;10.1109/TVCG.2014.2346426;10.1109/TVCG.2013.183;10.1109/TVCG.2006.147;10.1109/TVCG.2007.70615;10.1109/VAST.2015.7347634;10.1109/TVCG.2010.162;10.1109/TVCG.2013.122;10.1109/TVCG.2010.177;10.1109/TVCG.2011.194;10.1109/TVCG.2009.167;10.1109/TVCG.2014.2346578;10.1109/TVCG.2009.111;10.1109/TVCG.2013.213;10.1109/VAST.2014.7042491;10.1109/TVCG.2013.120;10.1109/TVCG.2009.128;10.1109/TVCG.2012.237;10.1109/VISUAL.1990.146375;10.1109/TVCG.2008.165,"Information Visualization,Comparison,Taxonomies,Visualization Models,Task Analysis",29,27,82,
Vis,1992,Volume rendering on a distributed memory parallel computer,10.1109/VISUAL.1992.235221,http://dx.doi.org/10.1109/VISUAL.1992.235221,93,98,C,"A prototype implementation of a splatting volume renderer (SVR) on a commercially available distributed memory MIMD (multiple instruction stream, multiple data stream) parallel processor, the nCUBE2, is described. Some relatively good rendering times can be achieved with the nCUBE SVR. Message-passing bottlenecks occur when large numbers of floating-point values have to be collected from every processor for every picture. For large images this is a severe limitation. An initial implementation of a SVR on a distributed memory parallel computer demonstrates the need for parallel computers with high-bandwidth connections between processors, and also for new parallelizable volume rendering algorithms.&lt;&lt;ETX&gt;&gt;",T. Todd Elvins,T.T. Elvins,"Adv. Sci. Visualization Lab., San Diego, CA, USA",10.1109/VISUAL.1991.175807;10.1109/VISUAL.1991.175814,,28,12,12,
Vis,1993,Visual feedback in querying large databases,10.1109/VISUAL.1993.398864,http://dx.doi.org/10.1109/VISUAL.1993.398864,158,165,C,"In this paper, we describe a database query system that provides visual relevance feedback in querying large databases. The goal of our system is to support the query specification process by using each pixel of the display to represent one data item of the database. By arranging and coloring the pixels according to their relevance for the query, the user gets a visual impression of the resulting data set. Using sliders for each condition of the query, the user may change the query dynamically and receives immediate feedback by the visual representation of the resulting data set. By using multiple windows for different parts of a complex query, the user gets visual feedback for each part of the query and, therefore, will easier understand the overall result. The system may be used to query any database that contains tens of thousands to millions of data items, but it is especially helpful to explore large data sets with an unknown distribution of values and to find the interesting hot spots in huge amounts of data. The direct feedback allows to visually display the influence of incremental query refinements and, therefore, allows a better, easier and faster query specification.&lt;&lt;ETX&gt;&gt;",Daniel A. Keim;Hans-Peter Kriegel;Thomas Seidl 0001,D.A. Keim;H.-P. Kriegel;T. Seidl,"Inst. for Comput. Sci., Munich Univ., Germany;Inst. for Comput. Sci., Munich Univ., Germany;Inst. for Comput. Sci., Munich Univ., Germany",10.1109/VISUAL.1990.146387;10.1109/VISUAL.1990.146386;10.1109/VISUAL.1990.146389;10.1109/VISUAL.1990.146402,,28,8,18,
Vis,1997,Accelerated volume rendering using homogeneous region encoding,10.1109/VISUAL.1997.663880,http://dx.doi.org/10.1109/VISUAL.1997.663880,191,196,C,"Previous accelerated volume rendering techniques have used auxiliary hierarchical datastructures to skip empty and homogeneous regions. Although some recent research has taken advantage of more efficient direct encoding techniques to skip empty regions, no work has been done to directly encode homogeneous but not empty regions. 3D distance transforms previously used to encode empty space can be extended to preprocess homogeneous regions as well, and these regions can be efficiently encoded and incorporated into volume ray-casting and back projection algorithms with a high degree of flexibility.",Jason Freund;Kenneth R. Sloan,J. Freund;K. Sloan,"Silicon Graphics Inc., USA",10.1109/VISUAL.1990.146377,"Volume Rendering, Ray-casting",28,7,17,
Vis,1997,Extracting feature lines from 3D unstructured grids,10.1109/VISUAL.1997.663894,http://dx.doi.org/10.1109/VISUAL.1997.663894,285,292,C,"The paper discusses techniques for extracting feature lines from three-dimensional unstructured grids. The twin objectives are to facilitate the interactive manipulation of these typically very large and dense meshes, and to clarify the visualization of the solution data that accompanies them. The authors describe the perceptual importance of specific viewpoint-dependent and view-independent features, discuss the relative advantages and disadvantages of several alternative algorithms for identifying these features (taking into consideration both local and global criteria), and demonstrate the results of these methods on a variety of different data sets.",Kwan-Liu Ma;Victoria Interrante,Kwan-Liu Ma;V. Interrante,"Inst. for Comput. Applications in Sci. & Eng., NASA Langley Res. Center, Hampton, VA, USA",10.1109/VISUAL.1995.480795,,28,4,26,
Vis,1997,CAVEvis: distributed real-time visualization of time-varying scalar and vector fields using the CAVE virtual reality theater,10.1109/VISUAL.1997.663896,http://dx.doi.org/10.1109/VISUAL.1997.663896,301,308,C,"The paper discusses CAVEvis and a related set of tools for the interactive visualization and exploration of large sets of time-varying scalar and vector fields using the CAVE virtual reality environment. Since visualization of large data sets can be very time-consuming in both computation and rendering time, the task is distributed over multiple machines, each of which is specialized for some aspect of the visualization process. All modules must run asynchronously to maintain the highest level of interactivity. A model of distributed visualization is introduced that addresses important issues related to the management of time-dependent data, module synchronization, and interactivity bottlenecks.",Vijendra Jaswal,V. Jaswa,"Nat. Center for Supercomput. Applications, Champaign, IL, USA",10.1109/VISUAL.1996.568117;10.1109/VISUAL.1991.175771,,28,2,9,
Vis,1997,Collaborative augmented reality: exploring dynamical systems,10.1109/VISUAL.1997.663921,http://dx.doi.org/10.1109/VISUAL.1997.663921,459,462,C,"We present collaborative scientific visualization in STUDIERSTUBE. STUDIERSTUBE is an augmented reality system that has several advantages over conventional desktop and other virtual reality environments, including true stereoscopy, 3D-interaction, individual viewpoints and customized views for multiple users, unhindered natural collaboration and low cost. We demonstrate the application of this concept for the interaction of multiple users and illustrate it with several visualizations of dynamical systems in DynSys3D, a visualization system running on top of AVS.",Anton L. Fuhrmann;Helwig Löffelmann;Dieter Schmalstieg,A. Fuhrmann;H. Loffelmann;D. Schmalstieg,"Wien Univ. of Technol., Austria",10.1109/VISUAL.1996.568128,"virtual environments, scientific visualization, dynamical systems, augmented reality",28,18,17,
InfoVis,1999,Constellation: a visualization tool for linguistic queries from MindNet,10.1109/INFVIS.1999.801869,http://dx.doi.org/10.1109/INFVIS.1999.801869,132,"135, 154",C,"Constellation is a visualization system for the results of queries from the MindNet natural language semantic network. Constellation is targeted at helping MindNet's creators and users refine their algorithms, as opposed to understanding the structure of language. We designed a special-purpose graph layout algorithm which exploits higher-level structure in addition to the basic node and edge connectivity. Our layout prioritizes the creation of a semantic space to encode plausibility instead of traditional graph drawing metrics like minimizing edge crossings. We make careful use of several perceptual channels both to minimize the visual impact of edge crossings and to emphasize highlighted constellations of nodes and edges.",Tamara Munzner;François Guimbretière;George G. Robertson,T. Munzner;F. Guimbretiere;G. Robertson,"Stanford Univ., CA, USA",,,28,12,17,
Vis,2002,Tensor field visualisation using adaptive filtering of noise fields combined with glyph rendering,10.1109/VISUAL.2002.1183797,http://dx.doi.org/10.1109/VISUAL.2002.1183797,371,378,C,"While many methods exist for visualising scalar and vector data, visualisation of tensor data is still troublesome. We present a method for visualising second order tensors in three dimensions using a hybrid between direct volume rendering and glyph rendering. An overview scalar field is created by using three-dimensional adaptive filtering of a scalar field containing noise. The filtering process is controlled by the tensor field to be visualised, creating patterns that characterise the tensor field. By combining direct volume rendering of the scalar field with standard glyph rendering methods for detailed tensor visualisation, a hybrid solution is created. A combined volume and glyph renderer was implemented and tested with both synthetic tensors and strain-rate tensors from the human heart muscle, calculated from phase contrast magnetic resonance image data. A comprehensible result could be obtained, giving both an overview of the tensor field as well as detailed information on individual tensors.",Andreas Sigfridsson;Tino Ebbers;Einar Heiberg;Lars Wigström,A. Sigfridsson;T. Ebbers;E. Heiberg;L. Wigstrom,"Dept. of Medicine & Care, Linkoping Univ., Sweden;Dept. of Medicine & Care, Linkoping Univ., Sweden;Dept. of Medicine & Care, Linkoping Univ., Sweden;Dept. of Medicine & Care, Linkoping Univ., Sweden",10.1109/VISUAL.1992.235193;10.1109/VISUAL.1999.809905;10.1109/VISUAL.1998.745294;10.1109/VISUAL.1995.480817,"Tensor, Visualization, Volume rendering, Glyph rendering, Hybrid rendering, Strain-rate",28,12,19,
InfoVis,2003,Intelligently resolving point occlusion,10.1109/INFVIS.2003.1249018,http://dx.doi.org/10.1109/INFVIS.2003.1249018,131,136,C,"Large and high-dimensional data sets mapped to low-dimensional visualizations often result in perceptual ambiguities. One such ambiguity is overlap or occlusion that occurs when the number of records exceeds the number of unique locations in the presentation or when there exist two or more records that map to the same location. To lessen the affect of occlusion, non-standard visual attributes (i.e. shading and/or transparency) are applied, or such records may be remapped to a corresponding jittered location. The resulting mapping efficiently portrays the crowding of records but fails to provide the insight into the relationship between the neighboring records. We introduce a new interactive technique that intelligibly organizes overlapped points, a neural network-based smart jittering algorithm. We demonstrate this technique on a scatter plot, the most widely used visualization. The algorithm can be applied to other one, two, and multi-dimensional visualizations which represent data as points, including 3-dimensional scatter plots, RadViz, polar coordinates.",Marjan Trutschl;Georges G. Grinstein;Urska Cvek,M. Trutschl;G. Grinstein;U. Cvek,"LSU Comput. Sci., LSU Health Sci. Center, Shreveport, LA, USA",10.1109/VISUAL.1990.146402,"data visualization, information visualization, design, data points, data density, occlusion, identifiable points, jitter, neural networks",28,14,24,
InfoVis,2003,Causality visualization using animated growing polygons,10.1109/INFVIS.2003.1249025,http://dx.doi.org/10.1109/INFVIS.2003.1249025,189,196,C,"We present Growing Polygons, a novel visualization technique for the graphical representation of causal relations and information flow in a system of interacting processes. Using this method, individual processes are displayed as partitioned polygons with color-coded segments showing dependencies to other processes. The entire visualization is also animated to communicate the dynamic execution of the system to the user. The results from a comparative user study of the method show that the Growing Polygons technique is significantly more efficient than the traditional Hasse diagram visualization for analysis tasks related to deducing information flow in a system for both small and large executions. Furthermore, our findings indicate that the correctness when solving causality tasks is significantly improved using our method. In addition, the subjective ratings of the users rank the method as superior in all regards, including usability, efficiency, and enjoyability.",Niklas Elmqvist;Philippas Tsigas,N. Elmqvist;P. Tsigas,"Dept. of Comput. Sci., Chalmers Univ. of Technol., Goteborg, Sweden;Dept. of Comput. Sci., Chalmers Univ. of Technol., Goteborg, Sweden",10.1109/INFVIS.1998.729561,"causal relations, information visualization, interactive animation",28,19,14,
Vis,2003,Counting cases in marching cubes: toward a generic algorithm for producing substitopes,10.1109/VISUAL.2003.1250354,http://dx.doi.org/10.1109/VISUAL.2003.1250354,51,58,C,"We describe how to count the cases that arise in a family of visualization techniques, including marching cubes, sweeping simplices, contour meshing, interval volumes, and separating surfaces. Counting the cases is the first step toward developing a generic visualization algorithm to produce substitopes (geometric substitution of polytopes). We demonstrate the method using a software system (""GAP"") for computational group theory. The case-counts are organized into a table that provides taxonomy of members of the family; numbers in the table are derived from actual lists of cases, which are computed by our methods. The calculation confirms previously reported case-counts for large dimensions that are too large to check by hand, and predicts the number of cases that will arise in algorithms that have not yet been invented.",David C. Banks;Stephen A. Linton,D.C. Banks;S. Linton,"Florida State Univ., Gainesville, FL, USA",10.1109/VISUAL.2000.885704;10.1109/VISUAL.1997.663886;10.1109/VISUAL.1996.568103;10.1109/VISUAL.1996.568121;10.1109/VISUAL.1995.480806;10.1109/VISUAL.1991.175780;10.1109/VISUAL.1997.663887;10.1109/VISUAL.2001.964564,"level set, isosurface, orbit, group action, Marching Cubes, separating surfaces, geometric substitution, substitope",28,13,31,BP
Vis,2004,STEPS - an application for simulation of transsphenoidal endonasal pituitary surgery,10.1109/VISUAL.2004.98,http://dx.doi.org/10.1109/VISUAL.2004.98,513,520,C,"Endonasal transsphenoidal pituitary surgery is a minimally invasive endoscopic procedure, applied to remove various kinds of pituitary tumors. To reduce the risk associated with this treatment, the surgeon must be skilled and well-prepared. Virtual endoscopy can be beneficial as a tool for training, preoperative planning and intraoperative support. This work introduces STEPS, a virtual endoscopy system designed to aid surgeons in getting acquainted with the endoscopic view, the handling of instruments, the transsphenoidal approach and challenges associated with the procedure. STEPS also assists experienced surgeons in planning a real endoscopic intervention by getting familiar with the individual patient anatomy, identifying landmarks, planning the approach and deciding upon the ideal target position of the actual surgical activity. Besides interactive visualization using two different first-hit ray casting techniques, the application provides navigation and perception aids and the possibility to simulate the procedure, including haptic feedback and simulation of surgical instruments.",André Neubauer 0002;Stefan Wolfsberger;Marie-Thérèse Forster;Lukas Mroz;Rainer Wegenkittl;Katja Bühler,A. Neubauer;L. Mroz;S. Wolfsberger;R. Wegenkittl;M.-T. Forster;K. Buhler,"VRVis Res. Center, Vienna, Austria",10.1109/VISUAL.2000.885732;10.1109/VISUAL.2000.885702;10.1109/VISUAL.2000.885673,"virtual endoscopy, ray casting, iso-surfacing, pituitary surgery",28,12,21,BA
Vis,2004,Guaranteed quality triangulation of molecular skin surfaces,10.1109/VISUAL.2004.36,http://dx.doi.org/10.1109/VISUAL.2004.36,481,488,C,"We present an efficient algorithm to mesh the macromolecules surface model represented by the skin surface defined by Edelsbrunner. Our algorithm overcomes several challenges residing in current surface meshing methods. First, we guarantee the mesh quality with a provable lower bound of 21/spl deg/ on its minimum angle. Second, we ensure the triangulation is homeomorphic to the original surface. Third, we improve the efficiency of constructing the restricted Delaunay triangulation (RDT) of smooth surfaces. We achieve this by constructing the RDT using the advancing front method without computing the Delaunay tetrahedrization of the sample points on the surfaces. The difficulty of handling the front collision problem is tackled by employing the Morse theory. In particular, we construct the Morse-Smale complex to simplify the topological changes of the front. Our implementation results suggest that the algorithm decrease the time of generating high quality homeomorphic skin mesh from hours to a few minutes.",Ho-Lun Cheng;Xinwei Shi,Ho-Lun Cheng;Xinwei Shi,"Sch. of Comput., Nat. Univ. of Singapore, Singapore;Sch. of Comput., Nat. Univ. of Singapore, Singapore",,"Smooth surfaces, meshing, guaranteed quality triangulation, homeomorphism, Morse-Smale complex",28,7,16,
InfoVis,2005,Adapting the cognitive walkthrough method to assess the usability of a knowledge domain visualization,10.1109/INFVIS.2005.1532147,http://dx.doi.org/10.1109/INFVIS.2005.1532147,195,202,C,"The usability of knowledge domain visualization (KDViz) tools can be assessed at several levels. Cognitive walkthrough (CW) is a well known usability inspection method that focuses on how easily users can learn software through exploration. Typical applications of CW follow structured tasks where user goals and action sequences that lead to achievement of the goals are well defined. KDViz and other information visualization tools, however, are typically designed for users to explore data and user goals and actions are less well understood. In this paper, we describe how the traditional CW method may be adapted for assessing the usability of these systems. We apply the adapted version of CW to CiteSpace, a KDViz tool that uses bibliometric analyses to create visualizations of scientific literatures. We describe usability issues identified by the adapted CW and discuss how CiteSpace supported the completion of tasks, such as identifying research fronts, and the achievement of goals. Finally, we discuss improvements to the adapted CW and issues to be addressed before applying it to a wider range of KDViz tools.",Kenneth R. Allendoerfer;Serge Aluker;Gulshan Panjwani;Jason M. Proctor;David Sturtz;Mirjana Vukovic;Chaomei Chen,K. Allendoerfer;S. Aluker;G. Panjwani;J. Proctor;D. Sturtz;M. Vukovic;Chaomei Chen,"Coll. of Inf. Sci. & Technol., Drexel Univ., Philadelphia, PA, USA;Coll. of Inf. Sci. & Technol., Drexel Univ., Philadelphia, PA, USA;Coll. of Inf. Sci. & Technol., Drexel Univ., Philadelphia, PA, USA;Coll. of Inf. Sci. & Technol., Drexel Univ., Philadelphia, PA, USA;Coll. of Inf. Sci. & Technol., Drexel Univ., Philadelphia, PA, USA;Coll. of Inf. Sci. & Technol., Drexel Univ., Philadelphia, PA, USA;Coll. of Inf. Sci. & Technol., Drexel Univ., Philadelphia, PA, USA",,"Cognitive Walkthrough, usability inspection methods, bibliographic networks",28,2,14,
Vis,2005,Exploiting frame-to-frame coherence for accelerating high-quality volume raycasting on graphics hardware,10.1109/VISUAL.2005.1532799,http://dx.doi.org/10.1109/VISUAL.2005.1532799,223,230,C,GPU-based raycasting offers an interesting alternative to conventional slice-based volume rendering due to the inherent flexibility and the high quality of the generated images. Recent advances in graphics hardware allow for the ray traversal and volume sampling to be executed on a per-fragment level completely on the GPU leading to interactive framerates. In this work we present optimization techniques that improve the performance and quality of GPU-based volume raycasting. We apply a hybrid image/object space approach to accelerate the ray traversal in animation sequences that works for both isosurface rendering and semi-transparent volume rendering. An empty-space-leaping technique that exploits the spatial coherence between consecutively rendered images is used to estimate the optimal initial ray sampling point for each image pixel. These can double the rendering performance for typical volumetric data sets without sacrificing image quality. The achieved speed-up allows for further improvements of image quality. We demonstrate an object space antialiasing technique based on selective super-sampling at sharp creases and silhouette edges which also benefits from exploiting frame-to-frame coherence.,Thomas Klein;Magnus Strengert;Simon Stegmaier;Thomas Ertl,T. Klein;M. Strengert;S. Stegmaier;T. Ertl,"Inst. for Visualization & Interactive Syst., Stuttgart Univ., Germany;Inst. for Visualization & Interactive Syst., Stuttgart Univ., Germany;Inst. for Visualization & Interactive Syst., Stuttgart Univ., Germany;Inst. for Visualization & Interactive Syst., Stuttgart Univ., Germany",10.1109/VISUAL.2002.1183764;10.1109/VISUAL.1993.398852;10.1109/VISUAL.2001.964521;10.1109/VISUAL.2003.1250388;10.1109/VISUAL.2002.1183775;10.1109/VISUAL.2003.1250390;10.1109/VISUAL.2002.1183776;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2004.63,"Volume Raycasting, Programmable Graphics Hardware, Frame-to-Frame Coherence, Space Leaping",28,5,24,
Vis,2005,Prefiltered Gaussian reconstruction for high-quality rendering of volumetric data sampled on a body-centered cubic grid,10.1109/VISUAL.2005.1532810,http://dx.doi.org/10.1109/VISUAL.2005.1532810,311,318,C,"In this paper a novel high-quality reconstruction scheme is presented. Although our method is mainly proposed to reconstruct volumetric data sampled on an optimal body-centered cubic (BCC) grid, it can be easily adapted lo the conventional regular rectilinear grid as well. The reconstruction process is decomposed into two steps. The first step, which is considered to be a preprocessing, is a discrete Gaussian deconvolution performed only once in the frequency domain. Afterwards, the second step is a spatial-domain convolution with a truncated Gaussian kernel, which is used to interpolate arbitrary samples for ray casting. Since the preprocessing is actually a discrete prefiltering, we call our technique prefiltered Gaussian reconstruction (PGR). It is shown that the impulse response of PGR well approximates the ideal reconstruction kernel. Therefore the quality of PGR is much higher than that of previous reconstruction techniques proposed for optimally sampled data, which are based on linear and cubic box splines adapted to the BCC grid. Concerning the performance, PGR is slower than linear box-spline reconstruction but significantly faster than cubic box-spline reconstruction.",Balázs Csébfalvi,B. Csebfalvi,"Dept. of Control Eng. & Inf. Technol., Budapest Univ., Hungary",10.1109/VISUAL.2004.70;10.1109/VISUAL.2004.65;10.1109/VISUAL.2001.964498;10.1109/VISUAL.1997.663848;10.1109/VISUAL.1994.346331;10.1109/VISUAL.2001.964499,"Body-Centered Cubic Grid, Reconstruction, Optimal Regular Volume Sampling, Radial Basis Function Interpolation",28,9,31,
Vis,2005,Interactive visual analysis and exploration of injection systems simulations,10.1109/VISUAL.2005.1532821,http://dx.doi.org/10.1109/VISUAL.2005.1532821,391,398,C,"Simulations often generate large amounts of data that require use of SciVis techniques for effective exploration of simulation results. In some cases, like 1D theory of fluid dynamics, conventional SciVis techniques are not very useful. One such example is a simulation of injection systems that is becoming more and more important due to an increasingly restrictive emission regulations. There are many parameters and correlations among them that influence the simulation results. We describe how basic information visualization techniques can help in visualizing, understanding and analyzing this kind of data. The Com Vis tool is developed and used to analyze and explore the data. Com Vis supports multiple linked views and common information visualization displays such as 2D and 3D scatter-plot, histogram, parallel coordinates, pie-chart, etc. A diesel common rail injector with 2/2 way valve is used for a case study. Data sets were generated using a commercially available AVL HYDSIM simulation tool for dynamic analysis of hydraulic and hydro-mechanical systems, with the main application area in the simulation of fuel injection systems.",Kresimir Matkovic;Mario Jelovic;Josip Juric;Zoltan Konyha;Denis Gracanin,K. Matkovic;M. Jelovic;J. Juric;Z. Konyha;D. Gracanin,"VRVis Res. Center, Vienna, Austria",10.1109/INFVIS.1997.636793;10.1109/VISUAL.2000.885739;10.1109/VISUAL.1990.146402,"Information visualization, visual exploration, simulation, injection system",28,6,20,
Vis,2005,Example-based volume illustrations,10.1109/VISUAL.2005.1532854,http://dx.doi.org/10.1109/VISUAL.2005.1532854,655,662,C,"Scientific illustrations use accepted conventions and methodologies to effectively convey object properties and improve our understanding. We present a method to illustrate volume datasets by emulating example illustrations. As with technical illustrations, our volume illustrations more clearly delineate objects, enrich details, and artistically visualize volume datasets. For both color and scalar 3D volumes, we have developed an automatic color transfer method based on the clustering and similarities in the example illustrations and volume sources. As an extension to 2D Wang tiles, we provide a new, general texture synthesis method for Wang cubes that solves the edge discontinuity problem. We have developed a 2D illustrative slice viewer and a GPU-based direct volume rendering system that uses these non-periodic 3D textures to generate illustrative results similar to the 2D examples. Both applications simulate scientific illustrations to provide more information than the original data and visualize objects more effectively, while only requiring simple user interaction.",Aidong Lu;David S. Ebert,A. Lu;D.S. Ebert,"Purdue Univ., West Lafayette, IN, USA;Purdue Univ., West Lafayette, IN, USA",10.1109/VISUAL.2004.35;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2003.1250386;10.1109/VISUAL.1999.809905,"Volume Illustration, Example-based Rendering, Wang Cubes, Texture Synthesis, Color Transfer",28,6,33,
Vis,2006,A Spectral Analysis of Function Composition and its Implications for Sampling in Direct Volume Visualization,10.1109/TVCG.2006.113,http://dx.doi.org/10.1109/TVCG.2006.113,1353,1360,J,"In this paper we investigate the effects of function composition in the form g(f(x)) = h(x) by means of a spectral analysis of h. We decompose the spectral description of h(x) into a scalar product of the spectral description of g(x) and a term that solely depends on f(x) and that is independent of g(x). We then use the method of stationary phase to derive the essential maximum frequency of g(f(x)) bounding the main portion of the energy of its spectrum. This limit is the product of the maximum frequency of g(x) and the maximum derivative of f(x). This leads to a proper sampling of the composition h of the two functions g and f. We apply our theoretical results to a fundamental open problem in volume rendering - the proper sampling of the rendering integral after the application of a transfer function. In particular, we demonstrate how the sampling criterion can be incorporated in adaptive ray integration, visualization with multi-dimensional transfer functions, and pre-integrated volume rendering",Steven Bergner;Torsten Möller;Daniel Weiskopf;David J. Muraki,Steven Bergner;Torsten Moller;Daniel Weiskopf;David J. Muraki,GrUVi-Lab at Simon Fraser University;GrUVi-Lab at Simon Fraser University;GrUVi-Lab at Simon Fraser University;Department of Mathematics at Simon Fraser University,10.1109/VISUAL.2003.1250388;10.1109/VISUAL.2005.1532812;10.1109/VISUAL.2003.1250412;10.1109/VISUAL.1993.398852;10.1109/VISUAL.2000.885683;10.1109/VISUAL.2001.964519;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.1999.809908,"volume rendering, transfer function, signal processing, Fourier transform, adaptive sampling",28,25,27,
Vis,2006,Concurrent Visualization in a Production Supercomputing Environment,10.1109/TVCG.2006.128,http://dx.doi.org/10.1109/TVCG.2006.128,997,1004,J,"We describe a concurrent visualization pipeline designed for operation in a production supercomputing environment. The facility was initially developed on the NASA Ames ""Columbia"" supercomputer for a massively parallel forecast model (GEOS4). During the 2005 Atlantic hurricane season, GEOS4 was run 4 times a day under tight time constraints so that its output could be included in an ensemble prediction that was made available to forecasters at the National Hurricane Center. Given this time-critical context, we designed a configurable concurrent pipeline to visualize multiple global fields without significantly affecting the runtime model performance or reliability. We use MPEG compression of the accruing images to facilitate live low-bandwidth distribution of multiple visualization streams to remote sites. We also describe the use of our concurrent visualization framework with a global ocean circulation model, which provides a 864-fold increase in the temporal resolution of practically achievable animations. In both the atmospheric and oceanic circulation models, the application scientists gained new insights into their model dynamics, due to the high temporal resolution animations attainable",David Ellsworth;Bryan Green;Chris Henze;Patrick J. Moran;Timothy Sandstrom,David Ellsworth;Bryan Green;Chris Henze;Patrick Moran;Timothy Sandstrom,IEEE Computer Society;IEEE Computer Society;IEEE Computer Society,10.1109/VISUAL.2005.1532795,"Supercomputing, concurrent visualization, interactive visual computing, time-varying data, high temporal resolution visualization, GEOS4 global climate model, hurricane visualization, ECCO, ocean modeling",28,23,22,
Vis,2007,Conjoint Analysis to Measure the Perceived Quality in Volume Rendering,10.1109/TVCG.2007.70542,http://dx.doi.org/10.1109/TVCG.2007.70542,1664,1671,J,"Visualization algorithms can have a large number of parameters, making the space of possible rendering results rather high-dimensional. Only a systematic analysis of the perceived quality can truly reveal the optimal setting for each such parameter. However, an exhaustive search in which all possible parameter permutations are presented to each user within a study group would be infeasible to conduct. Additional complications may result from possible parameter co-dependencies. Here, we will introduce an efficient user study design and analysis strategy that is geared to cope with this problem. The user feedback is fast and easy to obtain and does not require exhaustive parameter testing. To enable such a framework we have modified a preference measuring methodology, conjoint analysis, that originated in psychology and is now also widely used in market research. We demonstrate our framework by a study that measures the perceived quality in volume rendering within the context of large parameter spaces.",Joachim Giesen;Klaus Mueller;Eva Schuberth;Lujin Wang;Peter Zolliker,Joachim Giesen;Klaus Mueller;Eva Schuberth;Lujin Wang;Peter Zolliker,MPI Informatik;Stony Brook University;ETH Zurich;Stony Brook University;EMPA D¨ubendorf,10.1109/TVCG.2006.137;10.1109/VISUAL.2005.1532834;10.1109/TVCG.2006.174;10.1109/VISUAL.2003.1250412;10.1109/INFVIS.2005.1532149;10.1109/TVCG.2006.113,"Conjoint Analysis, Parameterized Algorithms, Volume Visualization",28,17,15,
Vis,2007,Navigating in a Shape Space of Registered Models,10.1109/TVCG.2007.70581,http://dx.doi.org/10.1109/TVCG.2007.70581,1552,1559,J,"New product development involves people with different backgrounds. Designers, engineers, and consumers all have different design criteria, and these criteria interact. Early concepts evolve in this kind of collaborative context, and there is a need for dynamic visualization of the interaction between design shape and other shape-related design criteria. In this paper, a morphable model is defined from simplified representations of suitably chosen real cars, providing a continuous shape space to navigate, manipulate and visualize. Physical properties and consumer-provided scores for the real cars (such as 'weight' and 'sportiness') are estimated for new designs across the shape space. This coupling allows one to manipulate the shape directly while reviewing the impact on estimated criteria, or conversely, to manipulate the criterial values of the current design to produce a new shape with more desirable attributes.",Randall C. Smith;Richard R. Pawlicki;István Kókai;Jörg Finger;Thomas Vetter,Randall Smith;Richard Pawlicki;István Kókai;Jörg Finger;Thomas Vetter,GM R&D;GM R&D;University of Basel;University of Basel;University of Basel,,"Morphable model, shape space, barycentric coordinates, design space",28,21,18,
Vis,2008,Visualization of Myocardial Perfusion Derived from Coronary Anatomy,10.1109/TVCG.2008.180,http://dx.doi.org/10.1109/TVCG.2008.180,1595,1602,J,"Visually assessing the effect of the coronary artery anatomy on the perfusion of the heart muscle in patients with coronary artery disease remains a challenging task. We explore the feasibility of visualizing this effect on perfusion using a numerical approach. We perform a computational simulation of the way blood is perfused throughout the myocardium purely based on information from a three-dimensional anatomical tomographic scan. The results are subsequently visualized using both three-dimensional visualizations and bullpsilas eye plots, partially inspired by approaches currently common in medical practice. Our approach results in a comprehensive visualization of the coronary anatomy that compares well to visualizations commonly used for other scanning technologies. We demonstrate techniques giving detailed insight in blood supply, coronary territories and feeding coronary arteries of a selected region. We demonstrate the advantages of our approach through visualizations that show information which commonly cannot be directly observed in scanning data, such as a separate visualization of the supply from each coronary artery. We thus show that the results of a computational simulation can be effectively visualized and facilitate visually correlating these results to for example perfusion data.",Maurice Termeer;Javier Oliván Bescós;Marcel Breeuwer;Anna Vilanova;Frans A. Gerritsen;M. Eduard Gröller;Eike Nagel,Maurice Termeer;Javier Oliván Bescós;Marcel Breeuwer;Anna Vilanova;Frans Gerritsen;M. Eduard Gröller;Eike Nagel,Vienna University of Technology;Philips Healthcare;Philips Healthcare;Eindhoven University of Technology;Philips Healthcare;Vienna University of Technology;King's College London,10.1109/TVCG.2007.70550;10.1109/VISUAL.2002.1183754,"Cardiac visualization, coronary artery territories, myocardial perfusion",28,13,21,
VAST,2009,Connecting the dots in visual analysis,10.1109/VAST.2009.5333023,http://dx.doi.org/10.1109/VAST.2009.5333023,123,130,C,"During visual analysis, users must often connect insights discovered at various points of time. This process is often called ldquoconnecting the dots.rdquo When analysts interactively explore complex datasets over multiple sessions, they may uncover a large number of findings. As a result, it is often difficult for them to recall the past insights, views and concepts that are most relevant to their current line of inquiry. This challenge is even more difficult during collaborative analysis tasks where they need to find connections between their own discoveries and insights found by others. In this paper, we describe a context-based retrieval algorithm to identify notes, views and concepts from users' past analyses that are most relevant to a view or a note based on their line of inquiry. We then describe a related notes recommendation feature that surfaces the most relevant items to the user as they work based on this algorithm. We have implemented this recommendation feature in HARVEST, a Web based visual analytic system. We evaluate the related notes recommendation feature of HARVEST through a case study and discuss the implications of our approach.",Yedendra Babu Shrinivasan;David Gotz;Jie Lu,Yedendra B. Shrinivasan;David Gotzy;Jie Lu,"Eindhoven University of Technology, The Netherlands;IBM Research, USA;IBM Research, USA",10.1109/VAST.2008.4677362;10.1109/VAST.2007.4389006;10.1109/VAST.2007.4389011;10.1109/VAST.2006.261432;10.1109/VAST.2008.4677365,,28,12,20,
Vis,2009,Curve-Centric Volume Reformation for Comparative Visualization,10.1109/TVCG.2009.136,http://dx.doi.org/10.1109/TVCG.2009.136,1235,1242,J,"We present two visualization techniques for curve-centric volume reformation with the aim to create compelling comparative visualizations. A curve-centric volume reformation deforms a volume, with regards to a curve in space, to create a new space in which the curve evaluates to zero in two dimensions and spans its arc-length in the third. The volume surrounding the curve is deformed such that spatial neighborhood to the curve is preserved. The result of the curve-centric reformation produces images where one axis is aligned to arc-length, and thus allows researchers and practitioners to apply their arc-length parameterized data visualizations in parallel for comparison. Furthermore we show that when visualizing dense data, our technique provides an inside out projection, from the curve and out into the volume, which allows for inspection what is around the curve. Finally we demonstrate the usefulness of our techniques in the context of two application cases. We show that existing data visualizations of arc-length parameterized data can be enhanced by using our techniques, in addition to creating a new view and perspective on volumetric data around curves. Additionally we show how volumetric data can be brought into plotting environments that allow precise readouts. In the first case we inspect streamlines in a flow field around a car, and in the second we inspect seismic volumes and well logs from drilling.",Ove Daae Lampe;Carlos D. Correa;Kwan-Liu Ma;Helwig Hauser,Ove Daae Lampe;Carlos Correa;Kwan-Liu Ma;Helwig Hauser,CMR AS and the University of Bergen;UC Davis;UC Davis;University of Bergen,10.1109/TVCG.2006.144;10.1109/VISUAL.2002.1183754;10.1109/VISUAL.2001.964540;10.1109/VISUAL.1992.235194;10.1109/VISUAL.2003.1250353,"Volume Deformation, Curve-Centric-Reformation, Comparative Visualization, Radial Ray-Casting",28,23,29,
VAST,2010,Helping users recall their reasoning process,10.1109/VAST.2010.5653598,http://dx.doi.org/10.1109/VAST.2010.5653598,187,194,C,"The final product of an analyst's investigation using a visualization is often a report of the discovered knowledge, as well as the methods employed and reasoning behind the discovery. We believe that analysts may have difficulty keeping track of their knowledge discovery process and will require tools to assist in accurately recovering their reasoning. We first report on a study examining analysts' recall of their strategies and methods, demonstrating their lack of memory of the path of knowledge discovery. We then explore whether a tool visualizing the steps of the visual analysis can aid users in recalling their reasoning process. The results of our second study indicate that visualizations of interaction logs can serve as an effective memory aid, allowing analysts to recall additional details of their strategies and decisions.",Heather Lipford;Felesia Stukes;Wenwen Dou;Matthew E. Hawkins;Remco Chang,Heather Richter Lipford;Felesia Stukes;Wenwen Dou;Matthew E. Hawkins;Remco Chang,University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte,10.1109/TVCG.2008.137;10.1109/VAST.2007.4388992;10.1109/VAST.2008.4677365;10.1109/VAST.2008.4677360;10.1109/VAST.2007.4389009,"Visual analytics, visualization, reasoning process ",28,20,20,
Vis,2010,Interactive Visual Analysis of Multiple Simulation Runs Using the Simulation Model View: Understanding and Tuning of an Electronic Unit Injector,10.1109/TVCG.2010.171,http://dx.doi.org/10.1109/TVCG.2010.171,1449,1457,J,"Multiple simulation runs using the same simulation model with different values of control parameters generate a large data set that captures the behavior of the modeled phenomenon. However, there is a conceptual and visual gap between the simulation model behavior and the data set that makes data analysis more difficult. We propose a simulation model view that helps to bridge that gap by visually combining the simulation model description and the generated data. The simulation model view provides a visual outline of the simulation process and the corresponding simulation model. The view is integrated in a Coordinated Multiple Views; (CMV) system. As the simulation model view provides a limited display space, we use three levels of details. We explored the use of the simulation model view, in close collaboration with a domain expert, to understand and tune an electronic unit injector (EUI). We also developed analysis procedures based on the view. The EUI is mostly used in heavy duty Diesel engines. We were mainly interested in understanding the model and how to tune it for three different operation modes: low emission, low consumption, and high power. Very positive feedback from the domain expert shows that the use of the simulation model view and the corresponding ;analysis procedures within a CMV system represents an effective technique for interactive visual analysis of multiple simulation runs.",Kresimir Matkovic;Denis Gracanin;Mario Jelovic;Andreas Ammer;Alan Lez;Helwig Hauser,Kresimir Matkovic;Denis Gracanin;Mario Jelovic;Andreas Ammer;Alan Lez;Helwig Hauser,"VRVis Research Center, Vienna, Austria;Virginia Tech;AVL AST Croatia;VRVis Research Center, Vienna, Austria;VRVis Research Center, Vienna, Austria;University of Bergen, Norway",10.1109/TVCG.2009.155;10.1109/INFVIS.2002.1173149;10.1109/INFVIS.1995.528685;10.1109/INFVIS.2002.1173157,"Visualization in physical sciences and engineering, time series data, coordinated multiple views",28,23,20,
Vis,2010,TanGeoMS: Tangible Geospatial Modeling System,10.1109/TVCG.2010.202,http://dx.doi.org/10.1109/TVCG.2010.202,1605,1612,J,"We present TanGeoMS, a tangible geospatial modeling visualization system that couples a laser scanner, projector, and a flexible physical three-dimensional model with a standard geospatial information system (GIS) to create a tangible user interface for terrain data. TanGeoMS projects an image of real-world data onto a physical terrain model. Users can alter the topography of the model by modifying the clay surface or placing additional objects on the surface. The modified model is captured by an overhead laser scanner then imported into a GIS for analysis and simulation of real-world processes. The results are projected back onto the surface of the model providing feedback on the impact of the modifications on terrain parameters and simulated processes. Interaction with a physical model is highly intuitive, allowing users to base initial design decisions on geospatial data, test the impact of these decisions in GIS simulations, and use the feedback to improve their design. We demonstrate the system on three applications: investigating runoff management within a watershed, assessing the impact of storm surge on barrier islands, and exploring landscape rehabilitation in military training areas.",Laura Tateosian;Helena Mitásová;Brendan Harmon;Brent Fogleman;Katherine Weaver;Russell S. Harmon,Laura Tateosian;Helena Mitasova;Brendan Harmon;Brent Fogleman;Katherine Weaver;Russel Harmon,North Carolina State University;North Carolina State University;University of Oxford;North Carolina State University;North Carolina State University;US Army Research Office,10.1109/VISUAL.1999.809890,"Visualization system, geographic/geospatial visualization, terrain visualization, tangible user interface, collaborative visualization, human-computer interaction",28,21,13,
VAST,2011,A visual analytics process for maritime resource allocation and risk assessment,10.1109/VAST.2011.6102460,http://dx.doi.org/10.1109/VAST.2011.6102460,221,230,C,"In this paper, we present our collaborative work with the U.S. Coast Guard's Ninth District and Atlantic Area Commands where we developed a visual analytics system to analyze historic response operations and assess the potential risks in the maritime environment associated with the hypothetical allocation of Coast Guard resources. The system includes linked views and interactive displays that enable the analysis of trends, patterns and anomalies among the U.S. Coast Guard search and rescue (SAR) operations and their associated sorties. Our system allows users to determine the potential change in risks associated with closing certain stations in terms of response time, potential lives and property lost and provides optimal direction as to the nearest available station. We provide maritime risk assessment tools that allow analysts to explore Coast Guard coverage for SAR operations and identify regions of high risk. The system also enables a thorough assessment of all SAR operations conducted by each Coast Guard station in the Great Lakes region. Our system demonstrates the effectiveness of visual analytics in analyzing risk within the maritime domain and is currently being used by analysts at the Coast Guard Atlantic Area.",Abish Malik;Ross Maciejewski;Ben Maule;David S. Ebert,Abish Malik;Ross Maciejewski;Ben Maule;David S. Ebert,"Purdue University Visualization and Analytics Center (PURVAC), USA;Purdue University Visualization and Analytics Center (PURVAC), USA;United States Coast Guard, USA;Purdue University Visualization and Analytics Center (PURVAC), USA",10.1109/VISUAL.1993.398870;10.1109/VAST.2010.5652398;10.1109/VAST.2009.5333920;10.1109/VAST.2008.4677363;10.1109/INFVIS.1999.801851;10.1109/VAST.2007.4389006;10.1109/VAST.2009.5332611,"Visual analytics, risk assessment, Coast Guard",28,20,34,
Vis,2011,Interactive Multiscale Tensor Reconstruction for Multiresolution Volume Visualization,10.1109/TVCG.2011.214,http://dx.doi.org/10.1109/TVCG.2011.214,2135,2143,J,"Large scale and structurally complex volume datasets from high-resolution 3D imaging devices or computational simulations pose a number of technical challenges for interactive visual analysis. In this paper, we present the first integration of a multiscale volume representation based on tensor approximation within a GPU-accelerated out-of-core multiresolution rendering framework. Specific contributions include (a) a hierarchical brick-tensor decomposition approach for pre-processing large volume data, (b) a GPU accelerated tensor reconstruction implementation exploiting CUDA capabilities, and (c) an effective tensor-specific quantization strategy for reducing data transfer bandwidth and out-of-core memory footprint. Our multiscale representation allows for the extraction, analysis and display of structural features at variable spatial scales, while adaptive level-of-detail rendering methods make it possible to interactively explore large datasets within a constrained memory footprint. The quality and performance of our prototype system is evaluated on large structurally complex datasets, including gigabyte-sized micro-tomographic volumes.",Susanne K. Suter;José Antonio Iglesias Guitián;Fabio Marton;Marco Agus;Andreas Elsener;Christoph P. E. Zollikofer;Meenakshisundaram Gopi;Enrico Gobbetti;Renato Pajarola,Susanne K. Suter;Jose A. Iglesias Guitian;Fabio Marton;Marco Agus;Andreas Elsener;Christoph P.E. Zollikofer;M. Gopi;Enrico Gobbetti;Renato Pajarola,"University of Zurich, Switzerland;CRS4, Italy;CRS4, Italy;CRS4, Italy;University of Zurich, Switzerland;University of Zurich, Switzerland;University of California, Irvine, USA;CRS4, Italy;University of Zurich, Switzerland",10.1109/VISUAL.2002.1183757;10.1109/VISUAL.1997.663900;10.1109/TVCG.2007.70516;10.1109/VISUAL.1998.745311;10.1109/TVCG.2006.146;10.1109/VISUAL.2003.1250385,"GPU/CUDA, multiscale, tensor reconstruction, interactive volume visualization, multiresolution rendering",28,30,28,
Vis,2011,Interactive Virtual Probing of 4D MRI Blood-Flow,10.1109/TVCG.2011.215,http://dx.doi.org/10.1109/TVCG.2011.215,2153,2162,J,"Better understanding of hemodynamics conceivably leads to improved diagnosis and prognosis of cardiovascular diseases. Therefore, an elaborate analysis of the blood-flow in heart and thoracic arteries is essential. Contemporary MRI techniques enable acquisition of quantitative time-resolved flow information, resulting in 4D velocity fields that capture the blood-flow behavior. Visual exploration of these fields provides comprehensive insight into the unsteady blood-flow behavior, and precedes a quantitative analysis of additional blood-flow parameters. The complete inspection requires accurate segmentation of anatomical structures, encompassing a time-consuming and hard-to-automate process, especially for malformed morphologies. We present a way to avoid the laborious segmentation process in case of qualitative inspection, by introducing an interactive virtual probe. This probe is positioned semi-automatically within the blood-flow field, and serves as a navigational object for visual exploration. The difficult task of determining position and orientation along the view-direction is automated by a fitting approach, aligning the probe with the orientations of the velocity field. The aligned probe provides an interactive seeding basis for various flow visualization approaches. We demonstrate illustration-inspired particles, integral lines and integral surfaces, conveying distinct characteristics of the unsteady blood-flow. Lastly, we present the results of an evaluation with domain experts, valuing the practical use of our probe and flow visualization techniques.",Roy van Pelt;Javier Oliván Bescós;Marcel Breeuwer;Rachel E. Clough;M. Eduard Gröller;Bart M. ter Haar Romeny;Anna Vilanova,Roy van Pelt;Javier Olivan Bescos;Marcel Breeuwer;Rachel E. Clough;M. Eduard Groller;Bart ter Haar Romenij;Anna Vilanova,"Eindhoven University of Technology, The Netherlands;Philips Healthcare, The Netherlands;Philips Healthcare, The Netherlands;NIHR Comprehensive Biomedical Research Centre of Guy's and St Thomas' NHS Foundation Trust and King's College London, United Kingdom;Vienna University of Technology, Austria;Eindhoven University of Technology, The Netherlands;Eindhoven University of Technology, The Netherlands",10.1109/VISUAL.1993.398849;10.1109/TVCG.2009.154;10.1109/TVCG.2010.173;10.1109/TVCG.2010.153;10.1109/TVCG.2007.70576;10.1109/TVCG.2008.133;10.1109/TVCG.2009.138;10.1109/VISUAL.2005.1532847;10.1109/TVCG.2010.166;10.1109/VISUAL.2005.1532857,"Probing, Flow visualization, Illustrative visualization, Multivalued images, Phase-contrast cine MRI",28,21,29,
Vis,2011,Saliency-Assisted Navigation of Very Large Landscape Images,10.1109/TVCG.2011.231,http://dx.doi.org/10.1109/TVCG.2011.231,1737,1746,J,"The field of visualization has addressed navigation of very large datasets, usually meshes and volumes. Significantly less attention has been devoted to the issues surrounding navigation of very large images. In the last few years the explosive growth in the resolution of camera sensors and robotic image acquisition techniques has widened the gap between the display and image resolutions to three orders of magnitude or more. This paper presents the first steps towards navigation of very large images, particularly landscape images, from an interactive visualization perspective. The grand challenge in navigation of very large images is identifying regions of potential interest. In this paper we outline a three-step approach. In the first step we use multi-scale saliency to narrow down the potential areas of interest. In the second step we outline a method based on statistical signatures to further cull out regions of high conformity. In the final step we allow a user to interactively identify the exceptional regions of high interest that merit further attention. We show that our approach of progressive elicitation is fast and allows rapid identification of regions of interest. Unlike previous work in this area, our approach is scalable and computationally reasonable on very large images. We validate the results of our approach by comparing them to user-tagged regions of interest on several very large landscape images from the Internet.",Cheuk Yiu Ip;Amitabh Varshney,Cheuk Yiu Ip;Amitabh Varshney,University of Maryland;University of Maryland,10.1109/TVCG.2010.132;10.1109/TVCG.2007.70557;10.1109/TVCG.2007.70615;10.1109/TVCG.2006.152;10.1109/VISUAL.2003.1250401;10.1109/TVCG.2006.174;10.1109/VISUAL.2005.1532833,"Image Saliency, Very Large Scale Images, Scene Perception, Interactive Visualization, Anomaly Detection, Guided Interaction",28,21,46,HM
InfoVis,2012,Living Liquid: Design and Evaluation of an Exploratory Visualization Tool for Museum Visitors,10.1109/TVCG.2012.244,http://dx.doi.org/10.1109/TVCG.2012.244,2799,2808,J,"Interactive visualizations can allow science museum visitors to explore new worlds by seeing and interacting with scientific data. However, designing interactive visualizations for informal learning environments, such as museums, presents several challenges. First, visualizations must engage visitors on a personal level. Second, visitors often lack the background to interpret visualizations of scientific data. Third, visitors have very limited time at individual exhibits in museums. This paper examines these design considerations through the iterative development and evaluation of an interactive exhibit as a visualization tool that gives museumgoers access to scientific data generated and used by researchers. The exhibit prototype, Living Liquid, encourages visitors to ask and answer their own questions while exploring the time-varying global distribution of simulated marine microbes using a touchscreen interface. Iterative development proceeded through three rounds of formative evaluations using think-aloud protocols and interviews, each round informing a key visualization design decision: (1) what to visualize to initiate inquiry, (2) how to link data at the microscopic scale to global patterns, and (3) how to include additional data that allows visitors to pursue their own questions. Data from visitor evaluations suggests that, when designing visualizations for public audiences, one should (1) avoid distracting visitors from data that they should explore, (2) incorporate background information into the visualization, (3) favor understandability over scientific accuracy, and (4) layer data accessibility to structure inquiry. Lessons learned from this case study add to our growing understanding of how to use visualizations to actively engage learners with scientific data.",Joyce Ma;Isaac Liao;Kwan-Liu Ma;Jennifer Frazier,Joyce Ma;Isaac Liao;Kwan-Liu Ma;Jennifer Frazier,"Exploratorium;University of California, Davis;University of California, Davis;Exploratorium",10.1109/TVCG.2008.127;10.1109/TVCG.2011.175;10.1109/INFVIS.2004.8,"Information visualization, user interaction, evaluation, user studies, science museums, informal learning environments",28,25,45,
SciVis,2012,On the Interpolation of Data with Normally Distributed Uncertainty for Visualization,10.1109/TVCG.2012.249,http://dx.doi.org/10.1109/TVCG.2012.249,2305,2314,J,"In many fields of science or engineering, we are confronted with uncertain data. For that reason, the visualization of uncertainty received a lot of attention, especially in recent years. In the majority of cases, Gaussian distributions are used to describe uncertain behavior, because they are able to model many phenomena encountered in science. Therefore, in most applications uncertain data is (or is assumed to be) Gaussian distributed. If such uncertain data is given on fixed positions, the question of interpolation arises for many visualization approaches. In this paper, we analyze the effects of the usual linear interpolation schemes for visualization of Gaussian distributed data. In addition, we demonstrate that methods known in geostatistics and machine learning have favorable properties for visualization purposes in this case.",Steven Schlegel;Nico Korn;Gerik Scheuermann,Steven Schlegel;Nico Korn;Gerik Scheuermann,University of Leipzig;Helmholtz-Centre Dresden-Rossendorf;University of Leipzig,10.1109/TVCG.2007.70530;10.1109/TVCG.2011.203;10.1109/VISUAL.2005.1532807,"Gaussian process, uncertainty, interpolation",28,27,26,
SciVis,2013,A Lightweight Tangible 3D Interface for Interactive Visualization of Thin fiber Structures,10.1109/TVCG.2013.121,http://dx.doi.org/10.1109/TVCG.2013.121,2802,2809,J,"We present a prop-based, tangible interface for 3D interactive visualization of thin fiber structures. These data are commonly found in current bioimaging datasets, for example second-harmonic generation microscopy of collagen fibers in tissue. Our approach uses commodity visualization technologies such as a depth sensing camera and low-cost 3D display. Unlike most current uses of these emerging technologies in the games and graphics communities, we employ the depth sensing camera to create a fish-tank sterePoscopic virtual reality system at the scientist's desk that supports tracking of small-scale gestures with objects already found in the work space. We apply the new interface to the problem of interactive exploratory visualization of three-dimensional thin fiber data. A critical task for the visual analysis of these data is understanding patterns in fiber orientation throughout a volume.The interface enables a new, fluid style of data exploration and fiber orientation analysis by using props to provide needed passive-haptic feedback, making 3D interactions with these fiber structures more controlled. We also contribute a low-level algorithm for extracting fiber centerlines from volumetric imaging. The system was designed and evaluated with two biophotonic experts who currently use it in their lab. As compared to typical practice within their field, the new visualization system provides a more effective way to examine and understand the 3D bioimaging datasets they collect.",Bret Jackson;Tung Yuen Lau;David Schroeder;Kimani C. Toussaint;Daniel F. Keefe,Bret Jackson;Tung Yuen Lau;David Schroeder;Kimani C. Toussaint;Daniel F. Keefe,University of Minnesota;University of Illinois Urbana-Champaign;University of Minnesota;University of Illinois Urbana-Champaign;University of Minnesota,10.1109/TVCG.2009.138;10.1109/VISUAL.2005.1532846;10.1109/VISUAL.2002.1183753;10.1109/VISUAL.1997.663912,"Scientific visualization, 3D interaction, tangible interaction, microscopy visualization",28,23,26,
InfoVis,2014,DimpVis: Exploring Time-varying Information Visualizations by Direct Manipulation,10.1109/TVCG.2014.2346250,http://dx.doi.org/10.1109/TVCG.2014.2346250,2003,2012,J,"We introduce a new direct manipulation technique, DimpVis, for interacting with visual items in information visualizations to enable exploration of the time dimension. DimpVis is guided by visual hint paths which indicate how a selected data item changes through the time dimension in a visualization. Temporal navigation is controlled by manipulating any data item along its hint path. All other items are updated to reflect the new time. We demonstrate how the DimpVis technique can be designed to directly manipulate position, colour, and size in familiar visualizations such as bar charts and scatter plots, as a means for temporal navigation. We present results from a comparative evaluation, showing that the DimpVis technique was subjectively preferred and quantitatively competitive with the traditional time slider, and significantly faster than small multiples for a variety of tasks.",Brittany Kondo;Christopher Collins 0001,Brittany Kondo;Christopher Collins,University of Ontario Institute of Technology;University of Ontario Institute of Technology,10.1109/TVCG.2013.147;10.1109/TVCG.2012.204;10.1109/TVCG.2012.260;10.1109/TVCG.2008.175;10.1109/VAST.2012.6400486;10.1109/TVCG.2012.265;10.1109/TVCG.2013.149;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2011.185;10.1109/TVCG.2008.125;10.1109/TVCG.2011.195,"Time navigation, direct manipulation, information visualization",28,25,33,
SciVis,2015,In Situ Eddy Analysis in a High-Resolution Ocean Climate Model,10.1109/TVCG.2015.2467411,http://dx.doi.org/10.1109/TVCG.2015.2467411,857,866,J,"An eddy is a feature associated with a rotating body of fluid, surrounded by a ring of shearing fluid. In the ocean, eddies are 10 to 150 km in diameter, are spawned by boundary currents and baroclinic instabilities, may live for hundreds of days, and travel for hundreds of kilometers. Eddies are important in climate studies because they transport heat, salt, and nutrients through the world's oceans and are vessels of biological productivity. The study of eddies in global ocean-climate models requires large-scale, high-resolution simulations. This poses a problem for feasible (timely) eddy analysis, as ocean simulations generate massive amounts of data, causing a bottleneck for traditional analysis workflows. To enable eddy studies, we have developed an in situ workflow for the quantitative and qualitative analysis of MPAS-Ocean, a high-resolution ocean climate model, in collaboration with the ocean model research and development process. Planned eddy analysis at high spatial and temporal resolutions will not be possible with a postprocessing workflow due to various constraints, such as storage size and I/O time, but the in situ workflow enables it and scales well to ten-thousand processing elements.",Jonathan Woodring;Mark R. Petersen;Andre Schmeißer;John Patchett;James P. Ahrens;Hans Hagen,Jonathan Woodring;Mark Petersen;Andre Schmeiβer;John Patchett;James Ahrens;Hans Hagen,"Los Alamos National Laboratory, USA;Los Alamos National Laboratory, USA;Computer Graphics and HCI Group, Germany;Los Alamos National Laboratory, USA;Los Alamos National Laboratory, USA;Computer Graphics and HCI Group, Germany",10.1109/TVCG.2008.143;10.1109/VISUAL.2005.1532830;10.1109/TVCG.2010.215;10.1109/TVCG.2011.162,"In situ analysis, online analysis, mesoscale eddies, ocean modeling, climate modeling, simulation, feature extraction,feature analysis, high performance computing, supercomputing, software engineering, collaborative development, revision control",28,33,54,
VAST,2015,The Data Context Map: Fusing Data and Attributes into a Unified Display,10.1109/TVCG.2015.2467552,http://dx.doi.org/10.1109/TVCG.2015.2467552,121,130,J,"Numerous methods have been described that allow the visualization of the data matrix. But all suffer from a common problem - observing the data points in the context of the attributes is either impossible or inaccurate. We describe a method that allows these types of comprehensive layouts. We achieve it by combining two similarity matrices typically used in isolation - the matrix encoding the similarity of the attributes and the matrix encoding the similarity of the data points. This combined matrix yields two of the four submatrices needed for a full multi-dimensional scaling type layout. The remaining two submatrices are obtained by creating a fused similarity matrix - one that measures the similarity of the data points with respect to the attributes, and vice versa. The resulting layout places the data objects in direct context of the attributes and hence we call it the data context map. It allows users to simultaneously appreciate (1) the similarity of data objects, (2) the similarity of attributes in the specific scope of the collection of data objects, and (3) the relationships of data objects with attributes and vice versa. The contextual layout also allows data regions to be segmented and labeled based on the locations of the attributes. This enables, for example, the map's application in selection tasks where users seek to identify one or more data objects that best fit a certain configuration of factors, using the map to visually balance the tradeoffs.",Shenghui Cheng;Klaus Mueller,Shenghui Cheng;Klaus Mueller,"Visual Analytics and Imaging Laboratory, Computer Science Department, Stony Brook University and SUNY, Korea;Visual Analytics and Imaging Laboratory, Computer Science Department, Stony Brook University and SUNY, Korea",10.1109/TVCG.2013.146;10.1109/VAST.2009.5332629;10.1109/VISUAL.1997.663916;10.1109/VISUAL.1990.146402;10.1109/TVCG.2011.220;10.1109/INFVIS.1997.636793;10.1109/TVCG.2010.207,"High Dimensional Data, Low-Dimensional Embedding, Visual Analytics, Decision Make, Tradeoffs",28,30,37,
Vis,1991,Interactive data exploration with a supercomputer,10.1109/VISUAL.1991.175809,http://dx.doi.org/10.1109/VISUAL.1991.175809,248,254,C,"An experiment in exploratory data visualization using a massively parallel processor is described. In exploratory data visualization, it is typically not known what is being looked for: instead, the data are explored with a variety of visualization techniques that can illuminate its nature by demonstrating patterns in it. With this approach, the authors were able to find new features in some of their oldest datasets and to create more vivid presentations of familiar features in these datasets. Their experience has also led to a better understanding of the nature of the exploratory visualization and has resulted in some formal representations of the interaction process in this environment.&lt;&lt;ETX&gt;&gt;",Stuart Smith;Georges G. Grinstein;R. Daniel Bergeron,S. Smith;G. Grinstein;R.D. Bergeron,"Dept. of Comput. Sci., Lowell Univ., MA, USA;Dept. of Comput. Sci., Lowell Univ., MA, USA",,,27,8,7,
Vis,1992,"A voxel-based, forward projection algorithm for rendering surface and volumetric data",10.1109/VISUAL.1992.235190,http://dx.doi.org/10.1109/VISUAL.1992.235190,340,348,C,"A voxel-based, forward projection algorithm with a pipeline architecture for real-time applications is presented. The multisensor capabilities (electrooptical, or visual, and infrared) currently implemented in software have also been applied to non-real-time imaging applications on workstations and minicomputers. Most suited for terrain-based applications, the system features haze, imbedded targets, moving objects, smooth shading, and specular reflections.&lt;&lt;ETX&gt;&gt;",John R. Wright;Julia C. Hsieh,J.R. Wright;J.C.L. Hsieh,"Hughes Training Inc., West Covina, CA, USA;Hughes Training Inc., West Covina, CA, USA",,,27,12,12,
InfoVis,1995,Research report. DataSpace: 3-D visualizations of large databases,10.1109/INFVIS.1995.528690,http://dx.doi.org/10.1109/INFVIS.1995.528690,82,88,C,"DataSpace is a system for interactive 3-D visualization and analysis of large databases. DataSpace utilizes the display space by placing panels of information, possibly generated by different visualization applications, in a 3-D graph layout, and providing continuous navigation facilities. Selective rearrangements and transparency can be used to reduce occlusion or to compare or merge a set of images (e.g. line graphs or scatter plots) that are aligned and stacked in depth. A prototype system supporting the basic 3-D graphic operations (layout, zoom, rotation, translation, transparency) has been implemented. We provide several illustrative examples of DataSpace displays taken from the current system. We present the 3-D display paradigm, describe the query, layout and rendering steps required to create a display, and discuss some performance issues.",Vinod Anupam;Shaul Dar;Ted Leibfried;Eric Petajan,V. Anupam;S. Dar;T. Leibfried;E. Petajan,"AT&T Bell Labs., Murray Hill, NJ, USA;AT&T Bell Labs., Murray Hill, NJ, USA;AT&T Bell Labs., Murray Hill, NJ, USA;AT&T Bell Labs., Murray Hill, NJ, USA",10.1109/VISUAL.1994.346304,,27,8,16,
Vis,1996,Flexible information visualization of multivariate data from biological sequence similarity searches,10.1109/VISUAL.1996.567796,http://dx.doi.org/10.1109/VISUAL.1996.567796,133,140,C,"Information visualization faces challenges presented by the need to represent abstract data and the relationships within the data. Previously, we presented a system for visualizing similarities between a single DNA sequence and a large database of other DNA sequences (E.H. Chi et al., 1995). Similarity algorithms generate similarity information in textual reports that can be hundreds or thousands of pages long. Our original system visualized the most important variables from these reports. However, the biologists we work with found this system so useful they requested visual representations of other variables. We present an enhanced system for interactive exploration of this multivariate data. We identify a larger set of useful variables in the information space. The new system involves more variables, so it focuses on exploring subsets of the data. We present an interactive system allowing mapping of different variables to different axes, incorporating animation using a time axis, and providing tools for viewing subsets of the data. Detail-on-demand is preserved by hyperlinks to the analysis reports. We present three case studies illustrating the use of these techniques. The combined technique of applying a time axis with a 3D scatter plot and query filters to visualization of biological sequence similarity data is both powerful and novel.",Ed H. Chi;John Riedl;Elizabeth Shoop;John V. Carlis;Ernest F. Retzel;Phillip Barry,E.H.-H. Chi;J. Riedl;E. Shoop;J.V. Carlis;E. Retzel;P. Barry,"Dept. of Comput. Sci., Minnesota Univ. Med. Sch., Minneapolis, MN, USA",10.1109/VISUAL.1993.398883;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1995.480794,"Information Visualization, Biomedical Visualization, Multimodal and Multidimensional Visualization, Applications of Visualization",27,10,19,
Vis,1997,Pearls found on the way to the ideal interface for scanned probe microscopes,10.1109/VISUAL.1997.663923,http://dx.doi.org/10.1109/VISUAL.1997.663923,467,470,C,"Since 1991, our team of computer scientists, chemists and physicists have worked together to develop an advanced, virtual-environment interface to scanned-probe microscopes. The interface has provided insights and useful capabilities well beyond those of the traditional interface. This paper lists the particular visualization and control techniques that have enabled actual scientific discovery, including specific examples of insight gained using each technique. This information can help scientists determine which features are likely to be useful in their particular application, and which would be just sugar coating. It can also guide computer scientists to suggest the appropriate type of interface to help solve a particular problem. We have found benefit in advanced rendering with natural viewpoint control (but not always), from semi-automatic control techniques, from force feedback during manipulation, and from storing/replaying data for an entire experiment. These benefits come when the system is well-integrated into the existing tool and allows export of the data to standard visualization packages.",Russell M. Taylor II;Jun Chen;Shoji Okimoto;Noel Llopis-Artime;Vernon L. Chi;Frederick P. Brooks Jr.;Michael R. Falvo;Scott Paulson;Pichet Thiansathaporn;David Glick;Sean Washburn;Richard Superfine,R.M. Taylor;S. Washburn;R. Superfine;Jun Chen;S. Okimoto;N. Llopis-Artime;V.L. Chi;F.P. Brooks;M. Falvo;S. Paulson;P. Thiansathaporn;D. Glick,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",,"scientific visualization, interactive graphics, virtual environment, scanning tunneling microscopy, atomic force microscopy, user interface, telepresence, teleoperation, haptic, force",27,14,6,
Vis,1998,Constrained optimal framings of curves and surfaces using quaternion Gauss maps,10.1109/VISUAL.1998.745326,http://dx.doi.org/10.1109/VISUAL.1998.745326,375,382,C,"We propose a general paradigm for computing optimal coordinate frame fields that may be exploited to visualize curves and surfaces. Parallel transport framings, which work well for open curves, generally fail to have desirable properties for cyclic curves and for surfaces. We suggest that minimal quaternion measure provides an appropriate heuristic generalization of parallel transport. Our approach differs from minimal tangential acceleration approaches due to the addition of ""sliding ring"" constraints that fix one frame axis, but allow an axial rotational freedom whose value is varied in the optimization process. Our fundamental tool is the quaternion Gauss map, a generalization to quaternion space of the tangent map for curves and of the Gauss map for surfaces. The quaternion Gauss map takes 3D coordinate frame fields for curves and surfaces into corresponding curves and surfaces constrained to the space of possible orientations in quaternion space. Standard optimization tools provide application specific means of choosing optimal, e.g., length- or area-minimizing, quaternion frame fields in this constrained space.",Andrew J. Hanson,A.J. Hanson,"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA",10.1109/VISUAL.1994.346330;10.1109/VISUAL.1997.663876,"Quaternions, Frames, Tubing, Curves, Surfaces",27,6,27,
InfoVis,1999,A framework for focus+context visualization,10.1109/INFVIS.1999.801857,http://dx.doi.org/10.1109/INFVIS.1999.801857,53,"56, 145",C,"This paper aims to give a systematic account of focus+context visualization techniques, i.e. visualizations which aim to give users integrated visual access to details and context in a data set. We introduce the notion that there are different orders of information visualization with focus+context being a second-order visualization and provide a formal framework for describing and constructing focus+context visualizations.",Staffan Björk;Lars Erik Holmquist;Johan Redström,S. Bjork;L.E. Holmquist;J. Redstrom,"Viktoria Inst., Sweden",10.1109/INFVIS.1997.636786;10.1109/INFVIS.1998.729558,"Focus+context visualization, information visualization, fisheye views, formal methods, theory",27,7,22,
Vis,2001,Surgical simulator for hysteroscopy: a case study of visualization in surgical training,10.1109/VISUAL.2001.964548,http://dx.doi.org/10.1109/VISUAL.2001.964548,449,452,C,"Computer-based surgical simulation promises to provide a broader scope of clinical training through the introduction of anatomic variation, simulation of untoward events, and collection of performance data. We present a haptically-enabled surgical simulator for the most common techniques in diagnostic and operative hysteroscopy-cervical dilation, endometrial resection and ablation, and lesion excision. Engineering tradeoffs in developing a real-time, haptic-rate simulator are discussed.",Kevin Montgomery;Wm. LeRoy Heinrichs;Cynthia Bruyns;Simon Wildermuth;Christopher J. Hasser;Stephanie Ozenne;David Bailey,K. Montgomery;L.R. Heinrichs;C. Bruyns;S. Wildermuth;C. Hasser;S. Ozenne;D. Bailey,"Nat. Biocomputation Center, Stanford, CA, USA",,"surgical simulation, hysteroscopy, haptics",27,7,8,
Vis,2002,Kinetic visualization: a technique for illustrating 3D shape and structure,10.1109/VISUAL.2002.1183805,http://dx.doi.org/10.1109/VISUAL.2002.1183805,435,442,C,"Motion provides strong visual cues for the perception of shape and depth, as demonstrated by cognitive scientists and visual artists. This paper presents a novel visualization technique-kinetic visualization -that uses particle systems to add supplemental motion cues which can aid in the perception of shape and spatial relationships of static objects. Based on a set of rules following perceptual and physical principles, particles flowing over the surface of an object not only bring out, but also attract attention to, essential information on the shape of the object that might not be readily visible with conventional rendering that uses lighting and view changes. Replacing still images with animations in this fashion, we demonstrate with both surface and volumetric models in the accompanying videos that in many cases the resulting visualizations effectively enhance the perception of three-dimensional shape and structure. The results of a preliminary user study that we have conducted also show evidence that the supplemental motion cues help.",Eric B. Lum;Aleksander Stompel;Kwan-Liu Ma,E.B. Lum;A. Stompel;Kwan-Liu Ma,"Dept. of Comput. Sci., California Univ., Davis, CA, USA;Dept. of Comput. Sci., California Univ., Davis, CA, USA;Dept. of Comput. Sci., California Univ., Davis, CA, USA",10.1109/VISUAL.2000.885742,"animation, visual perception, particle systems, scientific visualization, volume rendering",27,11,21,
Vis,2003,Chameleon: an interactive texture-based rendering framework for visualizing three-dimensional vector fields,10.1109/VISUAL.2003.1250378,http://dx.doi.org/10.1109/VISUAL.2003.1250378,241,248,C,"In this paper we present an interactive texture-based technique for visualizing three-dimensional vector fields. The goal of the algorithm is to provide a general volume rendering framework allowing the user to compute three-dimensional flow textures interactively, and to modify the appearance of the visualization on the fly. To achieve our goal, we decouple the visualization pipeline into two disjoint stages. First, streamlines are generated from the 3D vector data. Various geometric properties of the streamlines are extracted and converted into a volumetric form using a hardware-assisted slice sweeping algorithm. In the second phase of the algorithm, the attributes stored in the volume are used as texture coordinates to look up an appearance texture to generate both informative and aesthetic representations of the underlying vector field. Users can change the input textures and instantaneously visualize the rendering results. With our algorithm, visualizations with enhanced structural perception using various visual cues can be rendered in real time. A myriad of existing geometry-based and texture-based visualization techniques can also be emulated.",Guo-Shi Li;Udeepta Bordoloi;Han-Wei Shen,Guo-Shi Li;U.D. Bordoloi;Han-Wei Shen,"Dept. of Comput. & Inf. Sci., Ohio State Univ., USA;Dept. of Comput. & Inf. Sci., Ohio State Univ., USA;Dept. of Comput. & Inf. Sci., Ohio State Univ., USA",10.1109/VISUAL.1996.567784;10.1109/VISUAL.1993.398846;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1992.235211;10.1109/VISUAL.1996.567777;10.1109/VISUAL.1997.663912,"3D flow visualization, vector field visualization, volume rendering, texture mapping",27,8,22,
InfoVis,2005,Dynamic visualization of graphs with extended labels,10.1109/INFVIS.2005.1532131,http://dx.doi.org/10.1109/INFVIS.2005.1532131,73,80,C,"The paper describes a novel technique to visualize graphs with extended node and link labels. The lengths of these labels range from a short phrase to a full sentence to an entire paragraph and beyond. Our solution is different from all the existing approaches that almost always rely on intensive computational effort to optimize the label placement problem. Instead, we share the visualization resources with the graph and present the label information in static, interactive, and dynamic modes without the requirement for tackling the intractability issues. This allows us to reallocate the computational resources for dynamic presentation of real time information. The paper includes a user study to evaluate the effectiveness and efficiency of the visualization technique.",Pak Chung Wong;Patrick Mackey;Ken Perrine;James R. Eagan;Harlan Foote;James J. Thomas,Pak Chung Wong;P. Mackey;K. Perrine;J. Eagan;H. Foote;J. Thomas,"Pacific Northwest Nat. Lab., Richland, WA, USA;Pacific Northwest Nat. Lab., Richland, WA, USA;Pacific Northwest Nat. Lab., Richland, WA, USA",,"Graph Label Placement, Dynamic Animation, Graph Visualization, Information Visualization",27,6,22,
InfoVis,2005,Turning the bucket of text into a pipe,10.1109/INFVIS.2005.1532133,http://dx.doi.org/10.1109/INFVIS.2005.1532133,89,94,C,"Many visual analysis tools operate on a fixed set of data. However, professional information analysts follow issues over a period of time and need to be able to easily add new documents to an ongoing exploration. Some analysts handle documents in a moving window of time, with new documents constantly added and old ones aging out. This paper describes both the user interaction and the technical implementation approach for a visual analysis system designed to support constantly evolving text collections.",Elizabeth G. Hetzler;Vernon L. Crow;Deborah A. Payne;Alan Turner,E.G. Hetzler;V.L. Crow;D.A. Payne;A.E. Turner,"Pacific Northwest Nat. Lab., Richland, WA, USA;Pacific Northwest Nat. Lab., Richland, WA, USA;Pacific Northwest Nat. Lab., Richland, WA, USA;Pacific Northwest Nat. Lab., Richland, WA, USA",10.1109/INFVIS.2001.963274;10.1109/INFVIS.2002.1173160;10.1109/INFVIS.2003.1249014;10.1109/INFVIS.1999.801853,"Information Visualization, Dynamic visualization, User interaction design, real-time updating",27,7,10,
Vis,2007,Grid With a View: Optimal Texturing for Perception of Layered Surface Shape,10.1109/TVCG.2007.70559,http://dx.doi.org/10.1109/TVCG.2007.70559,1656,1663,J,"We present the results of two controlled studies comparing layered surface visualizations under various texture conditions. The task was to estimate surface normals, measured by accuracy of a hand-set surface normal probe. A single surface visualization was compared with the two-surfaces case under conditions of no texture and with projected grid textures. Variations in relative texture spacing on top and bottom surfaces were compared, as well as opacity of the top surface. Significant improvements are found for the textured cases over non-textured surfaces. Either larger or thinner top-surface textures, and lower top surface opacities are shown to give less bottom surface error. Top surface error appears to be highly resilient to changes in texture. Given the results we also present an example of how appropriate textures might be useful in volume visualization.",Alethea Bair;Donald H. House,Alethea Bair;Donald House,Texas A&M University;Texas A&M University,10.1109/VISUAL.2005.1532782;10.1109/TVCG.2006.183;10.1109/VISUAL.2001.964505;10.1109/INFVIS.2003.1249022;10.1109/TVCG.2006.180,"Perception, optimal visualization, texturing, layered surfaces",27,14,32,
InfoVis,2008,Viz-A-Vis: Toward Visualizing Video through Computer Vision,10.1109/TVCG.2008.185,http://dx.doi.org/10.1109/TVCG.2008.185,1261,1268,J,"In the established procedural model of information visualization, the first operation is to transform raw data into data tables. The transforms typically include abstractions that aggregate and segment relevant data and are usually defined by a human, user or programmer. The theme of this paper is that for video, data transforms should be supported by low level computer vision. High level reasoning still resides in the human analyst, while part of the low level perception is handled by the computer. To illustrate this approach, we present Viz-A-Vis, an overhead video capture and access system for activity analysis in natural settings over variable periods of time. Overhead video provides rich opportunities for long-term behavioral and occupancy analysis, but it poses considerable challenges. We present initial steps addressing two challenges. First, overhead video generates overwhelmingly large volumes of video impractical to analyze manually. Second, automatic video analysis remains an open problem for computer vision.",Mario Romero;Jay Summet;John T. Stasko;Gregory D. Abowd,Mario Romero;Jay Summet;John Stasko;Gregory Abowd,Georgia Tech;Georgia Tech;Georgia Tech;Georgia Tech,10.1109/VISUAL.2003.1250401;10.1109/TVCG.2007.70621,"Spatiotemporal visualization, time series data, video visualization, sensor analytics, image/video analytics",27,14,29,
VAST,2008,Multidimensional visual analysis using cross-filtered views,10.1109/VAST.2008.4677370,http://dx.doi.org/10.1109/VAST.2008.4677370,163,170,C,"Analysis of multidimensional data often requires careful examination of relationships across dimensions. Coordinated multiple view approaches have become commonplace in visual analysis tools because they directly support expression of complex multidimensional queries using simple interactions. However, generating such tools remains difficult because of the need to map domain-specific data structures and semantics into the idiosyncratic combinations of interdependent data and visual abstractions needed to reveal particular patterns and distributions in cross-dimensional relationships. This paper describes: (1) a method for interactively expressing sequences of multidimensional set queries by cross-filtering data values across pairs of views, and (2) design strategies for constructing coordinated multiple view interfaces for cross-filtered visual analysis of multidimensional data sets. Using examples of cross-filtered visualizations of data from several different domains, we describe how cross-filtering can be modularized and reused across designs, flexibly customized with respect to data types across multiple dimensions, and incorporated into more wide-ranging multiple view designs. The demonstrated analytic utility of these examples suggest that cross-filtering is a suitable design pattern for instantiation in a wide variety of visual analysis tools.",Chris Weaver,Chris Weaver,"The GeoVISTA Center and Department of Geography, The Pennsylvania State University, USA",10.1109/TVCG.2006.178;10.1109/VAST.2006.261428;10.1109/INFVIS.2003.1249024;10.1109/INFVIS.2000.885086;10.1109/VISUAL.1994.346302;10.1109/INFVIS.1998.729560;10.1109/TVCG.2007.70594;10.1109/VAST.2007.4389006,,27,15,27,
InfoVis,2009,Harnessing the Information Ecosystem with Wiki-based Visualization Dashboards,10.1109/TVCG.2009.148,http://dx.doi.org/10.1109/TVCG.2009.148,1081,1088,J,"We describe the design and deployment of Dashiki, a public Website where users may collaboratively build visualization dashboards through a combination of a wiki-like syntax and interactive editors. Our goals are to extend existing research on social data analysis into presentation and organization of data from multiple sources, explore new metaphors for these activities, and participate more fully in the Web's information ecology by providing tighter integration with real-time data. To support these goals, our design includes novel and low-barrier mechanisms for editing and layout of dashboard pages and visualizations, connection to data sources, and coordinating interaction between visualizations. In addition to describing these technologies, we provide a preliminary report on the public launch of a prototype based on this design, including a description of the activities of our users derived from observation and interviews.",Matt McKeon,Matt McKeon,IBM Research,10.1109/TVCG.2007.70577;10.1109/INFVIS.1998.729560;10.1109/TVCG.2008.172;10.1109/TVCG.2006.178;10.1109/VAST.2008.4677366;10.1109/TVCG.2008.175;10.1109/VAST.2007.4389011;10.1109/VISUAL.1994.346302,"visualization, web, social software, wikis, social data analysis, collaboration, dashboards, visual analytics",27,12,26,
VAST,2009,Iterative integration of visual insights during patent search and analysis,10.1109/VAST.2009.5333564,http://dx.doi.org/10.1109/VAST.2009.5333564,203,210,C,"Patents are an important economic factor in todays globalized markets. Therefore, the analysis of patent information has become an inevitable task for a variety of interest groups. The retrieval of relevant patent information is an integral part of almost every patent analysis scenario. Unfortunately, the complexity of patent material inhibits a straightforward retrieval of all relevant patent documents and leads to iterative, time-consuming approaches in practice. With `PatViz', a new system for interactive analysis of patent information has been developed to leverage iterative query refinement. PatViz supports users in building complex queries visually and in exploring patent result sets interactively. Thereby, the visual query module introduces an abstraction layer that provides uniform access to different retrieval systems and relieves users of the burden to learn different complex query languages. By establishing an integrated environment it allows for interactive reintegration of insights gained from visual result set exploration into the visual query representation. We expect that the approach we have taken is also suitable to improve iterative query refinement in other Visual Analytics systems.",Steffen Koch;Harald Bosch;Mark Giereth;Thomas Ertl,Steffen Koch;Harald Bosch;Mark Giereth;Thomas Ertl,"Visualization and Interactive Systems Group, Universität Stuttgart, Germany;Visualization and Interactive Systems Group, Universität Stuttgart, Germany;Visualization and Interactive Systems Group, Universität Stuttgart, Germany;Visualization and Interactive Systems Group, Universität Stuttgart, Germany",10.1109/INFVIS.2000.885086;10.1109/VAST.2007.4389009;10.1109/VAST.2007.4389006,"Patent retrieval, information visualization, visual analytics, multiple coordinated views",27,16,23,BP
VAST,2009,Model space visualization for multivariate linear trend discovery,10.1109/VAST.2009.5333431,http://dx.doi.org/10.1109/VAST.2009.5333431,75,82,C,"Discovering and extracting linear trends and correlations in datasets is very important for analysts to understand multivariate phenomena. However, current widely used multivariate visualization techniques, such as parallel coordinates and scatterplot matrices, fail to reveal and illustrate such linear relationships intuitively, especially when more than 3 variables are involved or multiple trends coexist in the dataset. We present a novel multivariate model parameter space visualization system that helps analysts discover single and multiple linear patterns and extract subsets of data that fit a model well. Using this system, analysts are able to explore and navigate in model parameter space, interactively select and tune patterns, and refine the model for accuracy using computational techniques. We build connections between model space and data space visually, allowing analysts to employ their domain knowledge during exploration to better interpret the patterns they discover and their validity. Case studies with real datasets are used to investigate the effectiveness of the visualizations.",Zhenyu Guo;Matthew O. Ward;Elke A. Rundensteiner,Zhenyu Guo;Matthew O. Ward;Elke A. Rundensteiner,"Computer Science Department, Worcester Polytechnic Institute, USA;Computer Science Department, Worcester Polytechnic Institute, USA;Computer Science Department, Worcester Polytechnic Institute, USA",10.1109/VAST.2008.4677350;10.1109/VAST.2007.4389000;10.1109/VAST.2008.4677363;10.1109/VAST.2007.4388999;10.1109/VISUAL.1990.146402;10.1109/VAST.2008.4677352;10.1109/VAST.2008.4677368,"Knowledge Discovery, visual analysis, multivariate linear model construction, model space visualization",27,20,21,
VAST,2010,VizCept: Supporting synchronous collaboration for constructing visualizations in intelligence analysis,10.1109/VAST.2010.5652932,http://dx.doi.org/10.1109/VAST.2010.5652932,107,114,C,"In this paper, we present a new web-based visual analytics system, VizCept, which is designed to support fluid, collaborative analysis of large textual intelligence datasets. The main approach of the design is to combine individual workspace and shared visualization in an integrated environment. Collaborating analysts will be able to identify concepts and relationships from the dataset based on keyword searches in their own workspace and collaborate visually with other analysts using visualization tools such as a concept map view and a timeline view. The system allows analysts to parallelize the work by dividing initial sets of concepts, investigating them on their own workspace, and then integrating individual findings automatically on shared visualizations with support for interaction and personal graph layout in real time, in order to develop a unified plot. We highlight several design considerations that promote communication and analytic performance in small team synchronous collaboration. We report the result of a pair of case study applications including collaboration and communication methods, analysis strategies, and user behaviors under a competition setting in the same location at the same time. The results of these demonstrate the tool's effectiveness for synchronous collaborative construction and use of visualizations in intelligence data analysis.",Haeyong Chung;Seungwon Yang;Naveed Massjouni;Christopher Andrews;Rahul Kanna;Chris North 0001,Haeyong Chung;Seungwon Yang;Naveed Massjouni;Christopher Andrews;Rahul Kanna;Chris North,"Department of Computer Science, Virginia Tech;Department of Computer Science, Virginia Tech;Department of Computer Science, Virginia Tech;Department of Computer Science, Virginia Tech;Department of Computer Science, Virginia Tech;Department of Computer Science, Virginia Tech",10.1109/TVCG.2009.148;10.1109/VAST.2007.4389006;10.1109/VAST.2009.5333245;10.1109/VAST.2008.4677362;10.1109/TVCG.2007.70577;10.1109/VAST.2008.4677366,"Collaborative visualization, text and document data, intelligence analysis",27,15,24,
Vis,2010,A Scalable Distributed Paradigm for Multi-User Interaction with Tiled Rear Projection Display Walls,10.1109/TVCG.2010.128,http://dx.doi.org/10.1109/TVCG.2010.128,1623,1632,J,"We present the first distributed paradigm for multiple users to interact simultaneously with large tiled rear projection display walls. Unlike earlier works, our paradigm allows easy scalability across different applications, interaction modalities, displays and users. The novelty of the design lies in its distributed nature allowing well-compartmented, application independent, and application specific modules. This enables adapting to different 2D applications and interaction modalities easily by changing a few application specific modules. We demonstrate four challenging 2D applications on a nine projector display to demonstrate the application scalability of our method: map visualization, virtual graffiti, virtual bulletin board and an emergency management system. We demonstrate the scalability of our method to multiple interaction modalities by showing both gesture-based and laser-based user interfaces. Finally, we improve earlier distributed methods to register multiple projectors. Previous works need multiple patterns to identify the neighbors, the configuration of the display and the registration across multiple projectors in logarithmic time with respect to the number of projectors in the display. We propose a new approach that achieves this using a single pattern based on specially augmented QR codes in constant time. Further, previous distributed registration algorithms are prone to large misregistrations. We propose a novel radially cascading geometric registration technique that yields significantly better accuracy. Thus, our improvements allow a significantly more efficient and accurate technique for distributed self-registration of multi-projector display walls.",Pablo Roman;Maxim Lazarov;Aditi Majumder,Pablo Roman;Maxim Lazarov;Aditi Majumder,University of California Irvine UCI;University of California Irvine UCI;University of California Irvine UCI,10.1109/TVCG.2006.121;10.1109/TVCG.2007.70586;10.1109/VISUAL.2002.1183793;10.1109/TVCG.2009.124,"Tiled Displays, Human-Computer Interaction, Gesture-Based Interaction, Multi-user interaction, Distributed algorithms",27,21,38,
Vis,2010,Browsing Large Image Datasets through Voronoi Diagrams,10.1109/TVCG.2010.136,http://dx.doi.org/10.1109/TVCG.2010.136,1261,1270,J,"Conventional browsing of image collections use mechanisms such as thumbnails arranged on a regular grid or on a line, often mounted over a scrollable panel. However, this approach does not scale well with the size of the datasets (number of images). In this paper, we propose a new thumbnail-based interface to browse large collections of images. Our approach is based on weighted centroidal anisotropic Voronoi diagrams. A dynamically changing subset of images is represented by thumbnails and shown on the screen. Thumbnails are shaped like general polygons, to better cover screen space, while still reflecting the original aspect ratios or orientation of the represented images. During the browsing process, thumbnails are dynamically rearranged, reshaped and rescaled. The objective is to devote more screen space (more numerous and larger thumbnails) to the parts of the dataset closer to the current region of interest, and progressively lesser away from it, while still making the dataset visible as a whole. During the entire process, temporal coherence is always maintained. GPU implementation easily guarantees the frame rates needed for fully smooth interactivity.",Paolo Brivio;Marco Tarini;Paolo Cignoni,Paolo Brivio;Marco Tarini;Paolo Cignoni,,,"Visualization System and Toolkit Design, Scalability Issues, User Interfaces, Zooming and Navigation Techniques",27,20,33,
Vis,2010,Interactive Histology of Large-Scale Biomedical Image Stacks,10.1109/TVCG.2010.168,http://dx.doi.org/10.1109/TVCG.2010.168,1386,1395,J,"Histology is the study of the structure of biological tissue using microscopy techniques. As digital imaging technology advances, high resolution microscopy of large tissue volumes is becoming feasible; however, new interactive tools are needed to explore and analyze the enormous datasets. In this paper we present a visualization framework that specifically targets interactive examination of arbitrarily large image stacks. Our framework is built upon two core techniques: display-aware processing and GPU-accelerated texture compression. With display-aware processing, only the currently visible image tiles are fetched and aligned on-the-fly, reducing memory bandwidth and minimizing the need for time-consuming global pre-processing. Our novel texture compression scheme for GPUs is tailored for quick browsing of image stacks. We evaluate the usability of our viewer for two histology applications: digital pathology and visualization of neural structure at nanoscale-resolution in serial electron micrographs.",Won-Ki Jeong;Jens Schneider;Stephen G. Turney;Beverly E. Faulkner-Jones;Dominik Meyer;Rüdiger Westermann;R. Clay Reid;Jeff Lichtman;Hanspeter Pfister,Won-Ki Jeong;Jens Schneider;Stephen Turney;Beverly E Faulkner-Jones;Dominik Meyer;Rudiger Westermann;R. Clay Reid;Jeff Lichtman;Hanspeter Pfister,Harvard University;King Abdullar University of Science and Technology;Harvard University;BIDMC Pathology and Harvard Medical School;Technische Universit&#x0E4;t M&#x0FC;nchen;Technische Universit&#x0E4;t M&#x0FC;nchen;Harvard Medical School;Harvard University;Harvard University,10.1109/VISUAL.1994.346321;10.1109/VISUAL.2002.1183757;10.1109/VISUAL.2001.964520;10.1109/TVCG.2007.70516;10.1109/VISUAL.1995.480809;10.1109/VISUAL.2001.964531;10.1109/VISUAL.1995.480812;10.1109/VISUAL.2003.1250385,"Gigapixel viewer, biomedical image processing, GPU, texture compression",27,23,39,
Vis,2011,Straightening Tubular Flow for Side-by-Side Visualization,10.1109/TVCG.2011.235,http://dx.doi.org/10.1109/TVCG.2011.235,2063,2070,J,"Flows through tubular structures are common in many fields, including blood flow in medicine and tubular fluid flows in engineering. The analysis of such flows is often done with a strong reference to the main flow direction along the tubular boundary. In this paper we present an approach for straightening the visualization of tubular flow. By aligning the main reference direction of the flow, i.e., the center line of the bounding tubular structure, with one axis of the screen, we are able to natively juxtapose (1.) different visualizations of the same flow, either utilizing different flow visualization techniques, or by varying parameters of a chosen approach such as the choice of seeding locations for integration-based flow visualization, (2.) the different time steps of a time-dependent flow, (3.) different projections around the center line , and (4.) quantitative flow visualizations in immediate spatial relation to the more qualitative classical flow visualization. We describe how to utilize this approach for an informative interactive visual analysis. We demonstrate the potential of our approach by visualizing two datasets from two different fields: an arterial blood flow measurement and a tubular gas flow simulation from the automotive industry.",Paolo Angelelli;Helwig Hauser,Paolo Angelelli;Helwig Hauser,University of Bergen;University of Bergen,10.1109/TVCG.2009.169;10.1109/TVCG.2010.218;10.1109/VISUAL.1996.568137;10.1109/VISUAL.2003.1250353;10.1109/TVCG.2010.153;10.1109/VISUAL.2001.964540;10.1109/TVCG.2009.136,"Flow Visualization, Data Reformation, Comparative Visualization",27,19,35,
VAST,2012,A Visual Analytics Approach to Multiscale Exploration of Environmental Time Series,10.1109/TVCG.2012.191,http://dx.doi.org/10.1109/TVCG.2012.191,2899,2907,J,"We present a Visual Analytics approach that addresses the detection of interesting patterns in numerical time series, specifically from environmental sciences. Crucial for the detection of interesting temporal patterns are the time scale and the starting points one is looking at. Our approach makes no assumption about time scale and starting position of temporal patterns and consists of three main steps: an algorithm to compute statistical values for all possible time scales and starting positions of intervals, visual identification of potentially interesting patterns in a matrix visualization, and interactive exploration of detected patterns. We demonstrate the utility of this approach in two scientific scenarios and explain how it allowed scientists to gain new insight into the dynamics of environmental systems.",Mike Sips;Patrick Köthur;Andrea Unger;Hans-Christian Hege;Doris Dransch,Mike Sips;Patrick Köthur;Andrea Unger;Hans-Christian Hege;Doris Dransch,German Research Center for GeoSciences GFZ;German Research Center for GeoSciences GFZ;German Research Center for GeoSciences GFZ;Zuse Institute Berlin;German Research Center for GeoSciences GFZ,10.1109/INFVIS.2001.963273;10.1109/INFVIS.1995.528685,"Time series analysis, multiscale visualization, visual analytics",27,24,35,
InfoVis,2013,Information Visualization and Proxemics: Design Opportunities and Empirical findings,10.1109/TVCG.2013.166,http://dx.doi.org/10.1109/TVCG.2013.166,2386,2395,J,"People typically interact with information visualizations using a mouse. Their physical movement, orientation, and distance to visualizations are rarely used as input. We explore how to use such spatial relations among people and visualizations (i.e., proxemics) to drive interaction with visualizations, focusing here on the spatial relations between a single user and visualizations on a large display. We implement interaction techniques that zoom and pan, query and relate, and adapt visualizations based on tracking of users' position in relation to a large high-resolution display. Alternative prototypes are tested in three user studies and compared with baseline conditions that use a mouse. Our aim is to gain empirical data on the usefulness of a range of design possibilities and to generate more ideas. Among other things, the results show promise for changing zoom level or visual representation with the user's physical distance to a large display. We discuss possible benefits and potential issues to avoid when designing information visualizations that use proxemics.",Mikkel Rønne Jakobsen;Yonas Sahlemariam Haile;Søren Knudsen;Kasper Hornbæk,Mikkel R. Jakobsen;Yonas Sahlemariam Haile;Søren Knudsen;Kasper Hornbæk,University of Copenhagen;University of Copenhagen;University of Copenhagen;University of Copenhagen,10.1109/TVCG.2006.184;10.1109/TVCG.2012.204;10.1109/TVCG.2012.251;10.1109/TVCG.2007.70577;10.1109/INFVIS.2005.1532136,"Proxemics, information visualization, user study, large displays, user tracking, movement, orientation, distance",27,23,56,
InfoVis,2013,Visualizing Fuzzy Overlapping Communities in Networks,10.1109/TVCG.2013.232,http://dx.doi.org/10.1109/TVCG.2013.232,2486,2495,J,"An important feature of networks for many application domains is their community structure. This is because objects within the same community usually have at least one property in common. The investigation of community structure can therefore support the understanding of object attributes from the network topology alone. In real-world systems, objects may belong to several communities at the same time, i.e., communities can overlap. Analyzing fuzzy community memberships is essential to understand to what extent objects contribute to different communities and whether some communities are highly interconnected. We developed a visualization approach that is based on node-link diagrams and supports the investigation of fuzzy communities in weighted undirected graphs at different levels of detail. Starting with the network of communities, the user can continuously drill down to the network of individual nodes and finally analyze the membership distribution of nodes of interest. Our approach uses layout strategies and further visual mappings to graphically encode the fuzzy community memberships. The usefulness of our approach is illustrated by two case studies analyzing networks of different domains: social networking and biological interactions. The case studies showed that our layout and visualization approach helps investigate fuzzy overlapping communities. Fuzzy vertices as well as the different communities to which they belong can be easily identified based on node color and position.",Corinna Vehlow;Thomas Reinhardt;Daniel Weiskopf,Corinna Vehlow;Thomas Reinhardt;Daniel Weiskopf,"VISUS, University of Stuttgart;University of Stuttgart;VISUS, University of Stuttgart",10.1109/VISUAL.1993.398872;10.1109/INFVIS.2005.1532126;10.1109/TVCG.2011.186;10.1109/TVCG.2010.210;10.1109/TVCG.2009.122;10.1109/INFVIS.2004.43;10.1109/TVCG.2009.113,"Overlapping community visualization, fuzzy clustering, graph visualization, uncertainty visualization",27,27,53,
InfoVis,2014,OnSet: A Visualization Technique for Large-scale Binary Set Data,10.1109/TVCG.2014.2346249,http://dx.doi.org/10.1109/TVCG.2014.2346249,1993,2002,J,"Visualizing sets to reveal relationships between constituent elements is a complex representational problem. Recent research presents several automated placement and grouping techniques to highlight connections between set elements. However, these techniques do not scale well for sets with cardinality greater than one hundred elements. We present OnSet, an interactive, scalable visualization technique for representing large-scale binary set data. The visualization technique defines a single, combined domain of elements for all sets, and models each set by the elements that it both contains and does not contain. OnSet employs direct manipulation interaction and visual highlighting to support easy identification of commonalities and differences as well as membership patterns across different sets of elements. We present case studies to illustrate how the technique can be successfully applied across different domains such as bio-chemical metabolomics and task and event scheduling.",Ramik Sadana;Timothy Major;Alistair D. M. Dove;John T. Stasko,Ramik Sadana;Timothy Major;Alistair Dove;John Stasko,Georgia Tech.;Georgia Tech.;Georgia Aquarium;Georgia Tech.,10.1109/TVCG.2010.210;10.1109/TVCG.2009.122;10.1109/TVCG.2011.185;10.1109/TVCG.2008.144;10.1109/TVCG.2011.186;10.1109/TVCG.2013.184,"Set visualization, information visualization, direct manipulation, Euler diagrams, interaction, logical operations",27,31,23,
InfoVis,2014,The Influence of Contour on Similarity Perception of Star Glyphs,10.1109/TVCG.2014.2346426,http://dx.doi.org/10.1109/TVCG.2014.2346426,2251,2260,J,"We conducted three experiments to investigate the effects of contours on the detection of data similarity with star glyph variations. A star glyph is a small, compact, data graphic that represents a multi-dimensional data point. Star glyphs are often used in small-multiple settings, to represent data points in tables, on maps, or as overlays on other types of data graphics. In these settings, an important task is the visual comparison of the data points encoded in the star glyph, for example to find other similar data points or outliers. We hypothesized that for data comparisons, the overall shape of a star glyph-enhanced through contour lines-would aid the viewer in making accurate similarity judgments. To test this hypothesis, we conducted three experiments. In our first experiment, we explored how the use of contours influenced how visualization experts and trained novices chose glyphs with similar data values. Our results showed that glyphs without contours make the detection of data similarity easier. Given these results, we conducted a second study to understand intuitive notions of similarity. Star glyphs without contours most intuitively supported the detection of data similarity. In a third experiment, we tested the effect of star glyph reference structures (i.e., tickmarks and gridlines) on the detection of similarity. Surprisingly, our results show that adding reference structures does improve the correctness of similarity judgments for star glyphs with contours, but not for the standard star glyph. As a result of these experiments, we conclude that the simple star glyph without contours performs best under several criteria, reinforcing its practice and popularity in the literature. Contours seem to enhance the detection of other types of similarity, e. g., shape similarity and are distracting when data similarity has to be judged. Based on these findings we provide design considerations regarding the use of contours and reference structures on star glyphs.",Johannes Fuchs 0001;Petra Isenberg;Anastasia Bezerianos;Fabian Fischer 0001;Enrico Bertini,Johannes Fuchs;Petra Isenberg;Anastasia Bezerianos;Fabian Fischer;Enrico Bertini,"University of Konstanz;Inria;CNRS & Inria, Université Paris-Sud;University of Konstanz;NYU Poly",10.1109/TVCG.2012.220;10.1109/TVCG.2008.136;10.1109/TVCG.2011.242;10.1109/INFVIS.2004.15,"Glyphs, star glyphs, contours, perception, quantitative evaluation, similarity detection, visual comparison",27,24,35,
InfoVis,2014,NeuroLines: A Subway Map Metaphor for Visualizing Nanoscale Neuronal Connectivity,10.1109/TVCG.2014.2346312,http://dx.doi.org/10.1109/TVCG.2014.2346312,2369,2378,J,"We present NeuroLines, a novel visualization technique designed for scalable detailed analysis of neuronal connectivity at the nanoscale level. The topology of 3D brain tissue data is abstracted into a multi-scale, relative distance-preserving subway map visualization that allows domain scientists to conduct an interactive analysis of neurons and their connectivity. Nanoscale connectomics aims at reverse-engineering the wiring of the brain. Reconstructing and analyzing the detailed connectivity of neurons and neurites (axons, dendrites) will be crucial for understanding the brain and its development and diseases. However, the enormous scale and complexity of nanoscale neuronal connectivity pose big challenges to existing visualization techniques in terms of scalability. NeuroLines offers a scalable visualization framework that can interactively render thousands of neurites, and that supports the detailed analysis of neuronal structures and their connectivity. We describe and analyze the design of NeuroLines based on two real-world use-cases of our collaborators in developmental neuroscience, and investigate its scalability to large-scale neuronal connectivity data.",Ali K. Al-Awami;Johanna Beyer;Hendrik Strobelt;Narayanan Kasthuri;Jeff Lichtman;Hanspeter Pfister;Markus Hadwiger,Ali K. Al-Awami;Johanna Beyer;Hendrik Strobelt;Narayanan Kasthuri;Jeff W. Lichtman;Hanspeter Pfister;Markus Hadwiger,King Abdullah University of Science and Technology (KAUST);School of Engineering and Applied Sciences at Harvard University;School of Engineering and Applied Sciences at Harvard University;Center for Brain Science at Harvard University;Center for Brain Science at Harvard University;School of Engineering and Applied Sciences at Harvard University;King Abdullah University of Science and Technology (KAUST),10.1109/TVCG.2013.142;10.1109/TVCG.2012.240;10.1109/TVCG.2014.2346371;10.1109/TVCG.2009.121;10.1109/VAST.2011.6102439;10.1109/TVCG.2009.108;10.1109/TVCG.2011.192;10.1109/VISUAL.2002.1183754;10.1109/TVCG.2013.154,"Connectomics, Neuroscience, Data Abstraction, Multi-Trees, Focus+Context",27,20,47,HM
SciVis,2014,Design and Evaluation of Interactive Proofreading Tools for Connectomics,10.1109/TVCG.2014.2346371,http://dx.doi.org/10.1109/TVCG.2014.2346371,2466,2475,J,"Proofreading refers to the manual correction of automatic segmentations of image data. In connectomics, electron microscopy data is acquired at nanometer-scale resolution and results in very large image volumes of brain tissue that require fully automatic segmentation algorithms to identify cell boundaries. However, these algorithms require hundreds of corrections per cubic micron of tissue. Even though this task is time consuming, it is fairly easy for humans to perform corrections through splitting, merging, and adjusting segments during proofreading. In this paper we present the design and implementation of Mojo, a fully-featured single-user desktop application for proofreading, and Dojo, a multi-user web-based application for collaborative proofreading. We evaluate the accuracy and speed of Mojo, Dojo, and Raveler, a proofreading tool from Janelia Farm, through a quantitative user study. We designed a between-subjects experiment and asked non-experts to proofread neurons in a publicly available connectomics dataset. Our results show a significant improvement of corrections using web-based Dojo, when given the same amount of time. In addition, all participants using Dojo reported better usability. We discuss our findings and provide an analysis of requirements for designing visual proofreading software.",Daniel Haehn;Seymour Knowles-Barley;Mike Roberts;Johanna Beyer;Narayanan Kasthuri;Jeff Lichtman;Hanspeter Pfister,Daniel Haehn;Seymour Knowles-Barley;Mike Roberts;Johanna Beyer;Narayanan Kasthuri;Jeff W. Lichtman;Hanspeter Pfister,School of Engineering and Applied Sciences at Harvard University;Center for Brain Science at Harvard University;Computer Graphics Laboratory at Stanford University;School of Engineering and Applied Sciences at Harvard University;Center for Brain Science at Harvard University;Center for Brain Science at Harvard University;School of Engineering and Applied Sciences at Harvard University,10.1109/TVCG.2013.142;10.1109/TVCG.2012.240,"Proofreading, Segmentation, Connectomics, Quantitative Evaluation",27,27,49,
SciVis,2015,Isosurface Visualization of Data with Nonparametric Models for Uncertainty,10.1109/TVCG.2015.2467958,http://dx.doi.org/10.1109/TVCG.2015.2467958,777,786,J,"The problem of isosurface extraction in uncertain data is an important research problem and may be approached in two ways. One can extract statistics (e.g., mean) from uncertain data points and visualize the extracted field. Alternatively, data uncertainty, characterized by probability distributions, can be propagated through the isosurface extraction process. We analyze the impact of data uncertainty on topology and geometry extraction algorithms. A novel, edge-crossing probability based approach is proposed to predict underlying isosurface topology for uncertain data. We derive a probabilistic version of the midpoint decider that resolves ambiguities that arise in identifying topological configurations. Moreover, the probability density function characterizing positional uncertainty in isosurfaces is derived analytically for a broad class of nonparametric distributions. This analytic characterization can be used for efficient closed-form computation of the expected value and variation in geometry. Our experiments show the computational advantages of our analytic approach over Monte-Carlo sampling for characterizing positional uncertainty. We also show the advantage of modeling underlying error densities in a nonparametric statistical framework as opposed to a parametric statistical framework through our experiments on ensemble datasets and uncertain scalar fields.",Tushar M. Athawale;Elham Sakhaee;Alireza Entezari,Tushar Athawale;Elham Sakhaee;Alireza Entezari,"Department of Computer and Information Science and Engineering, University of Florida;Department of Computer and Information Science and Engineering, University of Florida;Department of Computer and Information Science and Engineering, University of Florida",10.1109/TVCG.2013.208;10.1109/VISUAL.2002.1183769;10.1109/TVCG.2013.152;10.1109/TVCG.2007.70518;10.1109/TVCG.2012.249;10.1109/TVCG.2013.143,"Uncertainty quantification, linear interpolation, isosurface extraction, marching cubes, nonparametric statistics",27,28,44,
VAST,2015,TimeLineCurator: Interactive Authoring of Visual Timelines from Unstructured Text,10.1109/TVCG.2015.2467531,http://dx.doi.org/10.1109/TVCG.2015.2467531,300,309,J,"We present TimeLineCurator, a browser-based authoring tool that automatically extracts event data from temporal references in unstructured text documents using natural language processing and encodes them along a visual timeline. Our goal is to facilitate the timeline creation process for journalists and others who tell temporal stories online. Current solutions involve manually extracting and formatting event data from source documents, a process that tends to be tedious and error prone. With TimeLineCurator, a prospective timeline author can quickly identify the extent of time encompassed by a document, as well as the distribution of events occurring along this timeline. Authors can speculatively browse possible documents to quickly determine whether they are appropriate sources of timeline material. TimeLineCurator provides controls for curating and editing events on a timeline, the ability to combine timelines from multiple source documents, and export curated timelines for online deployment. We evaluate TimeLineCurator through a benchmark comparison of entity extraction error against a manual timeline curation process, a preliminary evaluation of the user experience of timeline authoring, a brief qualitative analysis of its visual output, and a discussion of prospective use cases suggested by members of the target author communities following its deployment.",Johanna Fulda;Matthew Brehmer;Tamara Munzner,Johanna Fulda;Matthew Brehmel;Tamara Munzner,University of Munich (LMU);University of British Columbia;University of British Columbia,10.1109/VAST.2014.7042493;10.1109/TVCG.2011.185;10.1109/TVCG.2014.2346431;10.1109/TVCG.2013.124;10.1109/VAST.2012.6400557;10.1109/VAST.2011.6102461;10.1109/VAST.2012.6400485;10.1109/TVCG.2013.162;10.1109/TVCG.2013.214;10.1109/TVCG.2012.224;10.1109/TVCG.2014.2346291;10.1109/TVCG.2012.213;10.1109/VAST.2007.4389006;10.1109/TVCG.2012.212;10.1109/VAST.2012.6400530;10.1109/TVCG.2007.70577,"System, timelines, authoring environment, time-oriented data, journalism",27,27,76,
InfoVis,2016,Many-to-Many Geographically-Embedded Flow Visualisation: An Evaluation,10.1109/TVCG.2016.2598885,http://dx.doi.org/10.1109/TVCG.2016.2598885,411,420,J,"Showing flows of people and resources between multiple geographic locations is a challenging visualisation problem. We conducted two quantitative user studies to evaluate different visual representations for such dense many-to-many flows. In our first study we compared a bundled node-link flow map representation and OD Maps [37] with a new visualisation we call MapTrix. Like OD Maps, MapTrix overcomes the clutter associated with a traditional flow map while providing geographic embedding that is missing in standard OD matrix representations. We found that OD Maps and MapTrix had similar performance while bundled node-link flow map representations did not scale at all well. Our second study compared participant performance with OD Maps and MapTrix on larger data sets. Again performance was remarkably similar.",Yalong Yang 0001;Tim Dwyer;Sarah Goodwin;Kim Marriott,Yalong Yang;Tim Dwyer;Sarah Goodwin;Kim Marriott,"Monash University, Data61, CSIRO, Victoria;Monash University;Monash University;Monash University, Data61, CSIRO, Victoria",10.1109/INFVIS.2004.1;10.1109/TVCG.2011.202;10.1109/TVCG.2014.2346441;10.1109/TVCG.2008.165;10.1109/INFVIS.2005.1532150,Flow Maps;Matrix Visualisation;Cartographic Information Visualisation,27,30,39,HM
VAST,2017,Clustervision: Visual Supervision of Unsupervised Clustering,10.1109/TVCG.2017.2745085,http://dx.doi.org/10.1109/TVCG.2017.2745085,142,151,J,"Clustering, the process of grouping together similar items into distinct partitions, is a common type of unsupervised machine learning that can be useful for summarizing and aggregating complex multi-dimensional data. However, data can be clustered in many ways, and there exist a large body of algorithms designed to reveal different patterns. While having access to a wide variety of algorithms is helpful, in practice, it is quite difficult for data scientists to choose and parameterize algorithms to get the clustering results relevant for their dataset and analytical tasks. To alleviate this problem, we built Clustervision, a visual analytics tool that helps ensure data scientists find the right clustering among the large amount of techniques and parameters available. Our system clusters data using a variety of clustering techniques and parameters and then ranks clustering results utilizing five quality metrics. In addition, users can guide the system to produce more relevant results by providing task-relevant constraints on the data. Our visual user interface allows users to find high quality clustering results, explore the clusters using several coordinated visualization techniques, and select the cluster result that best suits their task. We demonstrate this novel approach using a case study with a team of researchers in the medical domain and showcase that our system empowers users to choose an effective representation of their complex data.",Bum Chul Kwon;Benjamin Eysenbach;Janu Verma;Kenney Ng;Christopher deFilippi;Walter F. Stewart;Adam Perer,Bum Chul Kwon;Ben Eysenbach;Janu Verma;Kenney Ng;Christopher De Filippi;Walter F. Stewart;Adam Perer,"IBM T.J. Watson Research Center, NY, USA;Massachusetts Institute of Technology, Cambridge, MA, USA;IBM T.J. Watson Research Center, NY, USA;IBM T.J. Watson Research Center, NY, USA;Inova Heart and Vascular Institute, Fairfax, VA, USA;Sutter Health Research, Walnut Creek, California, USA;IBM T.J. Watson Research Center, NY, USA",10.1109/TVCG.2011.188;10.1109/TVCG.2014.2346321;10.1109/TVCG.2015.2467717,"Unsupervised Clustering,Visual Analytics,Quality Metrics,Interactive Visual Clustering",27,17,46,
VAST,2017,Understanding Hidden Memories of Recurrent Neural Networks,10.1109/VAST.2017.8585721,http://dx.doi.org/10.1109/VAST.2017.8585721,13,24,C,"Recurrent neural networks (RNNs) have been successfully applied to various natural language processing (NLP) tasks and achieved better results than conventional methods. However, the lack of understanding of the mechanisms behind their effectiveness limits further improvements on their architectures. In this paper, we present a visual analytics method for understanding and comparing RNN models for NLP tasks. We propose a technique to explain the function of individual hidden state units based on their expected response to input texts. We then co-cluster hidden state units and words based on the expected response and visualize co-clustering results as memory chips and word clouds to provide more structured knowledge on RNNs' hidden states. We also propose a glyph-based sequence visualization based on aggregate information to analyze the behavior of an RNN's hidden state at the sentence-level. The usability and effectiveness of our method are demonstrated through case studies and reviews from domain experts.",Yao Ming;Shaozu Cao;Ruixiang Zhang;Zhen Li;Yuanzhe Chen;Yangqiu Song;Huamin Qu,Yao Ming;Shaozu Cao;Ruixiang Zhang;Zhen Li;Yuanzhe Chen;Yangqiu Song;Huamin Qu,Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology,10.1109/VAST.2015.7347637;10.1109/VAST.2010.5652443;10.1109/TVCG.2012.252;10.1109/TVCG.2016.2598831;10.1109/TVCG.2011.212;10.1109/TVCG.2016.2598838;10.1109/TVCG.2016.2598838;10.1109/TVCG.2016.2598828;10.1109/TVCG.2016.2598465;10.1109/TVCG.2014.2346665,"recurrent neural networks,visual analytics,understanding neural model,co-clustering",27,30,52,
Vis,1991,Run-time visualization of program data,10.1109/VISUAL.1991.175810,http://dx.doi.org/10.1109/VISUAL.1991.175810,255,261,C,"An improvement to visualization systems that provides a graphics window into an application displaying program data at run-time through an easy-to-use graphical interface is discussed. With little or no instrumentation of the application the user will be able to dynamically select data for graphical display as the program executes on a remote computer system. The data to be displayed and the type of display to be used are chosen interactively while the application is executing. Any data display can be enabled and disabled at any time; it is not necessary to specify the data or graphics technique before compilation as with conventional graphics tools. An architecture for such a remote visualization system is proposed, and an implementation, called Vista, is described. Designed primarily for scientific visualization, Vista or offers an environment for more effective debugging and program development.&lt;&lt;ETX&gt;&gt;",Allan Tuchman;David Jablonowski;George Cybenko,A. Tuchman;D. Jablonowski;G. Cybenko,"Center for Supercomput. Res. & Dev., Illinois Univ., Urbana, IL, USA;Center for Supercomput. Res. & Dev., Illinois Univ., Urbana, IL, USA;Center for Supercomput. Res. & Dev., Illinois Univ., Urbana, IL, USA",,,26,10,8,
Vis,1993,Virtual input devices for 3D systems,10.1109/VISUAL.1993.398862,http://dx.doi.org/10.1109/VISUAL.1993.398862,142,148,C,"The device unified interface is a generalized and easily expandable protocol for the communication between applications and input devices. The key idea is to unify various device data into the parameters of a so-called ""virtual input device."" The device information-base, which includes device dependent information, is also incorporated into the virtual input device. Using the device unified interface, system builders are able to design their applications independent of the input devices as well as utilize the capabilities of several devices in the same application.&lt;&lt;ETX&gt;&gt;",Taosong He;Arie E. Kaufman,T. He;A.E. Kaufman,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1992.235231,"device unified interface, 3d input device, virtual input device, device information-base",26,9,11,
InfoVis,1995,Research report: information animation applications in the capital markets,10.1109/INFVIS.1995.528682,http://dx.doi.org/10.1109/INFVIS.1995.528682,19,25,C,"3D computer graphics can be extremely expressive. It is possible to display an entire securities market, like the S&amp;P 500, on a single screen. With the correct approach to the visual design of the layout, these massive amounts of information can be quickly and easily comprehended by a human observer. By using motion and animated interaction, it is possible to use 3D as a reliable, accurate and precise decision-support tool. Information animation applications are particularly suited to the securities industry because that is where we find huge amounts of data, the value of which declines rapidly with time, and where critical decisions are being made on this data in very short periods of time. Information animation technology is an important new tool for the securities industry, where people need to be in the decision-making loop without suffering from information overload. Several examples are discussed including equity trading analytics, fixed income trading analytics and fixed-income risk viewing.",W. Wright,W. Wright,"Visible Decisions Inc., Toronto, Ont., Canada",,,26,7,10,
InfoVis,1995,Case study: 3D displays of Internet traffic,10.1109/INFVIS.1995.528697,http://dx.doi.org/10.1109/INFVIS.1995.528697,129,131,C,"The explosive growth in world-wide communications, especially the Internet, has highlighted the need for techniques to visualize network traffic. The traditional node and link network displays work well for small datasets but become visually cluttered and uninterpretable for large datasets. A natural 3D metaphor for displaying world-wide network data is to position the nodes on a globe and draw arcs between them coding the traffic. This technique has several advantages of over the traditional 2D displays, it naturally reduces line crossing clutter, provides an intuitive model for navigation and indication of time, and retains the geographic context. Coupling these strengths with some novel interaction techniques involving the globe surface translucency and arc heights illustrates the usefulness for this class of displays.",Kenneth C. Cox;Stephen G. Eick,K.C. Cox;S.G. Eick,"AT&T Bell Labs., Naperville, IL, USA;AT&T Bell Labs., Naperville, IL, USA",10.1109/VISUAL.1993.398870,,26,12,8,
Vis,1997,The VSBUFFER: visibility ordering of unstructured volume primitives by polygon drawing,10.1109/VISUAL.1997.663853,http://dx.doi.org/10.1109/VISUAL.1997.663853,35,42,C,"Different techniques have been proposed for rendering volumetric scalar data sets. Usually these approaches are focusing on orthogonal cartesian grids, but in the last years research did also concentrate on arbitrary structured or even unstructured topologies. In particular, direct volume rendering of these data types is numerically complex and mostly requires sorting the whole database. We present a new approach to direct rendering of convex, voluminous polyhedra on arbitrary grid topologies, which efficiently use hardware assisted polygon drawing to support the sorting procedure. The key idea of this technique lies in a two pass rendering approach. First, the volume primitives are drawn in polygon mode to obtain their cross sections in the VSBUFFER orthogonal to the viewing plane. Second, this buffer is traversed in front to back order and the volume integration is performed. Thus, the complexity of the sorting procedure is reduced. Furthermore, any connectivity information can be completely neglected, which allows for the rendering of arbitrary scattered, convex polyhedra.",Rüdiger Westermann;Thomas Ertl,R. Westermann;T. Ertl,"Comput. Graphics Group, Erlangen-Nurnberg Univ., Germany",10.1109/VISUAL.1996.567606;10.1109/VISUAL.1993.398853;10.1109/VISUAL.1990.146391,,26,10,24,
InfoVis,1998,Algorithm visualization for distributed environments,10.1109/INFVIS.1998.729561,http://dx.doi.org/10.1109/INFVIS.1998.729561,71,"78, 154",C,"The paper investigates the visualization of distributed algorithms. We present a conceptual model and a system, VADE, that realizes this model. Since in asynchronous distributed systems there is no way of knowing (let alone, visualizing) the ""real"" execution, we show how to generate a visualization which is consistent with the execution of the distributed algorithm. We also present the design and implementation of our system. VADE is designed so that the algorithm runs on the server's machines while the visualization is executed on a Web page on the client's machine. Programmers can write animations quickly and easily with the assistance of VADE's libraries.",Yoram Moses;Zvi Polunsky;Ayellet Tal;Leonid Ulitsky,Y. Moses;Z. Polunsky;A. Tal;L. Ulitsky,"Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel",10.1109/VISUAL.1997.663920,,26,8,27,
Vis,1998,Data level comparison of wind tunnel and computational fluid dynamics data,10.1109/VISUAL.1998.745332,http://dx.doi.org/10.1109/VISUAL.1998.745332,415,418,C,"The paper describes the architecture of a data level comparative visualization system and experiences using it to study computational fluid dynamics data and experimental wind tunnel data. We illustrate how the system can be used to compare data sets from different sources, data sets with different resolutions and data sets computed using different mathematical models of fluid flow. Suggested improvements to the system based on user feedback are also discussed.",Qin Shen;Alex T. Pang;Samuel P. Uselton,Q. Shen;A. Pang;S. Uselton,"Dept. of Comput. Sci., California Univ., CA, USA",10.1109/VISUAL.1997.663910;10.1109/VISUAL.1996.568115;10.1109/VISUAL.1996.568116;10.1109/VISUAL.1997.663911,,26,11,10,
Vis,1998,"Intent, perception, and out-of-core visualization applied to terrain",10.1109/VISUAL.1998.745342,http://dx.doi.org/10.1109/VISUAL.1998.745342,455,458,C,"This paper considers how out-of-core visualization applies to terrain datasets, which are among the largest now presented for interactive visualization and can range to sizes of 20 GB and more. It is found that a combination of out-of-core visualization, which tends to focus on 3D data, and visual simulation, which places an emphasis on visual perception and real-time display of multiresolution data, results in interactive terrain visualization with significantly improved data access and quality of presentation. Further, the visual simulation approach provides qualities that are useful for general data, not just terrain.",Douglass Davis;William Ribarsky;Nickolas Faust;Tian-Yue Jiang,D. Davis;T.Y. Jiang;W. Ribarsky;N. Faust,"Graphics, Visualization & Usability Center, Georgia Inst. of Technol., Atlanta, GA, USA",10.1109/VISUAL.1994.346311;10.1109/VISUAL.1997.663888,,26,6,9,
InfoVis,2004,BinX: Dynamic Exploration of Time Series Datasets Across Aggregation Levels,10.1109/INFVIS.2004.11,http://dx.doi.org/10.1109/INFVIS.2004.11,2,2,M,"Many fields of study produce time series datasets, and both the size and number of theses datasets are increasing rapidly due to the improvement of data accumulation methods such as small, cheap sensors and routine logging of events. Humans often fail to comprehend the structure of a long time series dataset because of the overwhelming amount of data and the range of different time scales at which there may be meaningful patterns. BinX is an interactive tool that provides dynamic visualization and manipulation of long time series datasets. The dataset is visualized through user controlled aggregation, augmented by various information visualization techniques.",Lior Berry;Tamara Munzner,L. Berry;T. Munzner,University of British Columbia,,,26,9,4,
Vis,2004,Vorticity based flow analysis and visualization for Pelton turbine design optimization,10.1109/VISUAL.2004.128,http://dx.doi.org/10.1109/VISUAL.2004.128,179,186,C,"Vorticity is the quantity used to describe the creation, transformation and extinction of vortices. It is present not only in vortices but also in shear flow. Especially in ducted flows, most of the overall vorticity is usually contained in the boundary layer. When a vortex develops from the boundary layer, this can be described by transport of vorticity. For a better understanding of a flow it is therefore of interest to examine vorticity in all of its different roles. The goal of this application study was not primarily the visualization of vortices but of vorticity distribution and its role in vortex phenomena. The underlying industrial case is a design optimization for a Pelton turbine. An important industrial objective is to improve the quality of the water jets driving the runner. Jet quality is affected mostly by vortices originating in the distributor ring. For a better understanding of this interrelation, it is crucial to not only visualize these vortices but also to analyze the mechanisms of their creation. We used various techniques for the visualization of vorticity, including field lines and modified isosurfaces. For field line based visualization, we extended the image-guided streamline placement algorithm of Turk and Banks to data-guided field line placement on three-dimensional unstructured grids.",Filip Sadlo;Ronald Peikert;Etienne Parkinson,F. Sadlo;R. Peikert;E. Parkinson,"Comput. Sci. Dept., Eidgenossische Tech. Hochschule, Zurich, Switzerland;Comput. Sci. Dept., Eidgenossische Tech. Hochschule, Zurich, Switzerland",10.1109/VISUAL.2003.1250372;10.1109/VISUAL.1996.567807;10.1109/VISUAL.1998.745317;10.1109/VISUAL.1992.235211;10.1109/VISUAL.2000.885690;10.1109/VISUAL.1998.745295;10.1109/VISUAL.1994.346327;10.1109/VISUAL.2001.964506;10.1109/VISUAL.1999.809896;10.1109/VISUAL.1999.809907;10.1109/VISUAL.2002.1183789,"flow visualization, feature extraction, line placement",26,15,33,
VAST,2006,Have Green - A Visual Analytics Framework for Large Semantic Graphs,10.1109/VAST.2006.261432,http://dx.doi.org/10.1109/VAST.2006.261432,67,74,C,"A semantic graph is a network of heterogeneous nodes and links annotated with a domain ontology. In intelligence analysis, investigators use semantic graphs to organize concepts and relationships as graph nodes and links in hopes of discovering key trends, patterns, and insights. However, as new information continues to arrive from a multitude of sources, the size and complexity of the semantic graphs will soon overwhelm an investigator's cognitive capacity to carry out significant analyses. We introduce a powerful visual analytics framework designed to enhance investigators' natural analytical capabilities to comprehend and analyze large semantic graphs. The paper describes the overall framework design, presents major development accomplishments to date, and discusses future directions of a new visual analytics system known as Have Green",Pak Chung Wong;George Chin Jr.;Harlan Foote;Patrick Mackey;James J. Thomas,Pak Chung Wong;George Chin;Harlan Foote;Patrick Mackey;Jim Thomas,"Pacific Northwest National Laboratory, Email: pak.wong@pnl.gov;Pacific Northwest National Laboratory, Email: george.chin@pnl.gov;Pacific Northwest National Laboratory, Email: harlan.foote@pnl.gov;Pacific Northwest National Laboratory, Email: patrick.mackey@pnl.gov;Pacific Northwest National Laboratory, Email: jim.thomas@pnl.gov",10.1109/INFVIS.2003.1249014;10.1109/INFVIS.2005.1532131,"Visual Analytics, Graph and Network Visualization, Information Analytics, Information Visualization",26,12,42,
Vis,2006,LOD Map - A Visual Interface for Navigating Multiresolution Volume Visualization,10.1109/TVCG.2006.159,http://dx.doi.org/10.1109/TVCG.2006.159,1029,1036,J,"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",Chaoli Wang 0001;Han-Wei Shen,Chaoli Wang;Han-wei Shen,"Department of Computer Science and Engineering, The Ohio State University, 395 Dreese Laboratories, Columbus, OH;Department of Computer Science and Engineering, The Ohio State University, 395 Dreese Laboratories, Columbus, OH",10.1109/VISUAL.1999.809871;10.1109/VISUAL.1999.809908;10.1109/VISUAL.2001.964519;10.1109/VISUAL.1995.480812;10.1109/VISUAL.2005.1532781;10.1109/VISUAL.2005.1532833;10.1109/INFVIS.2001.963283;10.1109/VISUAL.2005.1532834;10.1109/VISUAL.2002.1183757;10.1109/VISUAL.1997.663869;10.1109/VISUAL.2002.1183791;10.1109/VISUAL.1992.235230;10.1109/VISUAL.1997.663875,"LOD map, knowledge representation, perceptual reasoning, multiresolution rendering, large volume visualization",26,22,28,
Vis,2007,Visual Verification and Analysis of Cluster Detection for Molecular Dynamics,10.1109/TVCG.2007.70614,http://dx.doi.org/10.1109/TVCG.2007.70614,1624,1631,J,"A current research topic in molecular thermodynamics is the condensation of vapor to liquid and the investigation of this process at the molecular level. Condensation is found in many physical phenomena, e.g. the formation of atmospheric clouds or the processes inside steam turbines, where a detailed knowledge of the dynamics of condensation processes will help to optimize energy efficiency and avoid problems with droplets of macroscopic size. The key properties of these processes are the nucleation rate and the critical cluster size. For the calculation of these properties it is essential to make use of a meaningful definition of molecular clusters, which currently is a not completely resolved issue. In this paper a framework capable of interactively visualizing molecular datasets of such nucleation simulations is presented, with an emphasis on the detected molecular clusters. To check the quality of the results of the cluster detection, our framework introduces the concept of flow groups to highlight potential cluster evolution over time which is not detected by the employed algorithm. To confirm the findings of the visual analysis, we coupled the rendering view with a schematic view of the clusters' evolution. This allows to rapidly assess the quality of the molecular cluster detection algorithm and to identify locations in the simulation data in space as well as in time where the cluster detection fails. Thus, thermodynamics researchers can eliminate weaknesses in their cluster detection algorithms. Several examples for the effective and efficient usage of our tool are presented.",Sebastian Grottel;Guido Reina;Jadran Vrabec;Thomas Ertl,Sebastian Grottel;Guido Reina;Jadran Vrabec;Thomas Ertl,IEEE Computer Society,10.1109/VISUAL.2003.1250404;10.1109/VISUAL.2002.1183811;10.1109/TVCG.2006.115;10.1109/VISUAL.2004.103;10.1109/TVCG.2006.186;10.1109/VISUAL.2003.1250404,"Cluster detection analysis, molecular dynamics visualization, time-dependent scattered data, glyph visualization, out-of-core techniques, evolution graph vie",26,23,39,
VAST,2008,Cell phone mini challenge award: Social network accuracy - exploring temporal communication in mobile call graphs,10.1109/VAST.2008.4677389,http://dx.doi.org/10.1109/VAST.2008.4677389,,,M,"In the mobile call mini challenge of VAST 2008 contest, we explored the temporal communication patterns of Catalano/Vidro social network which is reflected in the mobile call data. We focus on detecting the hierarchy of the social network and try to get the important actors in it. We present our tools and methods in this summary. By using the visual analytic approaches, we can find out not only the temporal communication patterns in the social network but also the hierarchy of it.",Qi Ye;Tian Zhu 0001;Deyong Hu;Bin Wu 0001;Nan Du;Bai Wang 0001,Qi Ye;Tian Zhu;Deyong Hu;Bin Wu;Nan Du;Bai Wang,"Beijing University of Posts and Telecommunications, Beijing Key Lab of Intelligent Telecommunications Software and Multimedia, China;Beijing University of Posts and Telecommunications, Beijing Key Lab of Intelligent Telecommunications Software and Multimedia, China;Beijing University of Posts and Telecommunications, Beijing Key Lab of Intelligent Telecommunications Software and Multimedia, China;Beijing University of Posts and Telecommunications, Beijing Key Lab of Intelligent Telecommunications Software and Multimedia, China;Beijing University of Posts and Telecommunications, Beijing Key Lab of Intelligent Telecommunications Software and Multimedia, China;Beijing University of Posts and Telecommunications, Beijing Key Lab of Intelligent Telecommunications Software and Multimedia, China",,,26,6,3,
Vis,2008,Geodesic Distance-weighted Shape Vector Image Diffusion,10.1109/TVCG.2008.134,http://dx.doi.org/10.1109/TVCG.2008.134,1643,1650,J,"This paper presents a novel and efficient surface matching and visualization framework through the geodesic distance-weighted shape vector image diffusion. Based on conformal geometry, our approach can uniquely map a 3D surface to a canonical rectangular domain and encode the shape characteristics (e.g., mean curvatures and conformal factors) of the surface in the 2D domain to construct a geodesic distance-weighted shape vector image, where the distances between sampling pixels are not uniform but the actual geodesic distances on the manifold. Through the novel geodesic distance-weighted shape vector image diffusion presented in this paper, we can create a multiscale diffusion space, in which the cross-scale extrema can be detected as the robust geometric features for the matching and registration of surfaces. Therefore, statistical analysis and visualization of surface properties across subjects become readily available. The experiments on scanned surface models show that our method is very robust for feature extraction and surface matching even under noise and resolution change. We have also applied the framework on the real 3D human neocortical surfaces, and demonstrated the excellent performance of our approach in statistical analysis and integrated visualization of the multimodality volumetric data over the shape vector image.",Jing Hua;Zhaoqiang Lai;Ming Dong 0001;Xianfeng Gu;Hong Qin,Jing Hua;Zhaoqiang Lai;Ming Dong;Xianfeng Gu;Hong Qin,,,"Surface Matching, Shape Vector Image, Multiscale Diffusion, Visualization",26,28,32,
VAST,2009,Guided analysis of hurricane trends using statistical processes integrated with interactive parallel coordinates,10.1109/VAST.2009.5332586,http://dx.doi.org/10.1109/VAST.2009.5332586,19,26,C,"This paper demonstrates the promise of augmenting interactive multivariate representations with information from statistical processes in the domain of weather data analysis. Statistical regression, correlation analysis, and descriptive statistical calculations are integrated via graphical indicators into an enhanced parallel coordinates system, called the Multidimensional Data eXplorer (MDX). These statistical indicators, which highlight significant associations in the data, are complemented with interactive visual analysis capabilities. The resulting system allows a smooth, interactive, and highly visual workflow. The system's utility is demonstrated with an extensive hurricane climate study that was conducted by a hurricane expert. In the study, the expert used a new data set of environmental weather data, composed of 28 independent variables, to predict annual hurricane activity. MDX shows the Atlantic Meridional Mode increases the explained variance of hurricane seasonal activity by 7-15% and removes less significant variables used in earlier studies. The findings and feedback from the expert (1) validate the utility of the data set for hurricane prediction, and (2) indicate that the integration of statistical processes with interactive parallel coordinates, as implemented in MDX, addresses both deficiencies in traditional weather data analysis and exhibits some of the expected benefits of visual data analysis.",Chad A. Steed;J. Edward Swan;T. J. Jankun-Kelly;Patrick J. Fitzpatrick,Chad A. Steed;J. Edward Swan;T.J. Jankun-Kelly;Patrick J. Fitzpatrick,"Naval Research Laboratory, USA;Mississippi State University, USA;Mississippi State University, USA;Mississippi State University, USA",10.1109/TVCG.2007.70523;10.1109/INFVIS.2005.1532138;10.1109/VAST.2006.261452;10.1109/INFVIS.2004.68;10.1109/VISUAL.1995.485139;10.1109/INFVIS.2002.1173157;10.1109/VISUAL.1999.809866;10.1109/TVCG.2006.170,"Climate study, multivariate data, correlation, regression, interaction, statistical analysis, visual analytics",26,19,32,
Vis,2009,Intrinsic Geometric Scale Space by Shape Diffusion,10.1109/TVCG.2009.159,http://dx.doi.org/10.1109/TVCG.2009.159,1193,1200,J,"This paper formalizes a novel, intrinsic geometric scale space (IGSS) of 3D surface shapes. The intrinsic geometry of a surface is diffused by means of the Ricci flow for the generation of a geometric scale space. We rigorously prove that this multiscale shape representation satisfies the axiomatic causality property. Within the theoretical framework, we further present a feature-based shape representation derived from IGSS processing, which is shown to be theoretically plausible and practically effective. By integrating the concept of scale-dependent saliency into the shape description, this representation is not only highly descriptive of the local structures, but also exhibits several desired characteristics of global shape representations, such as being compact, robust to noise and computationally efficient. We demonstrate the capabilities of our approach through salient geometric feature detection and highly discriminative matching of 3D scans.",Guangyu Zou;Jing Hua;Zhaoqiang Lai;Xianfeng Gu;Ming Dong 0001,Guangyu Zou;Jing Hua;Zhaoqiang Lai;Xianfeng Gu;Ming Dong,Wayne State University;Wayne State University;Wayne State University;Stony Brook University;Wayne State University,10.1109/TVCG.2008.134,"Scale space, feature extraction, geometric flow, Riemannian manifolds",26,22,37,
VAST,2010,Discovering bits of place histories from people's activity traces,10.1109/VAST.2010.5652478,http://dx.doi.org/10.1109/VAST.2010.5652478,59,66,C,"Events that happened in the past are important for understanding the ongoing processes, predicting future developments, and making informed decisions. Significant and/or interesting events tend to attract many people. Some people leave traces of their attendance in the form of computer-processable data, such as records in the databases of mobile phone operators or photos on photo sharing web sites. We developed a suite of visual analytics methods for reconstructing past events from these activity traces. Our tools combine geocomputations, interactive geovisualizations and statistical methods to enable integrated analysis of the spatial, temporal, and thematic components of the data, including numeric attributes and texts. We demonstrate the utility of our approach on two large real data sets, mobile phone calls in Milano during 9 days and flickr photos made on British Isles during 5 years.",Gennady L. Andrienko;Natalia V. Andrienko;Martin Mladenov;Michael Mock;Christian Pölitz,Gennady Andrienko;Natalia Andrienko;Martin Mladenov;Michael Mock;Christian Pölitz,"Fraunhofer Institute IAIS (Intelligent Analysis and Information Systems), Sankt Augustin, Germany;Fraunhofer Institute IAIS (Intelligent Analysis and Information Systems), Sankt Augustin, Germany;Fraunhofer Institute IAIS (Intelligent Analysis and Information Systems), Sankt Augustin, Germany;Fraunhofer Institute IAIS (Intelligent Analysis and Information Systems), Sankt Augustin, Germany;Fraunhofer Institute IAIS (Intelligent Analysis and Information Systems), Sankt Augustin, Germany",10.1109/INFVIS.1999.801851;10.1109/TVCG.2007.70621,"event detection, spatio-temporal data, time series analysis, scalable visualization, geovisualization",26,20,23,HM
InfoVis,2011,BallotMaps: Detecting Name Bias in Alphabetically Ordered Ballot Papers,10.1109/TVCG.2011.174,http://dx.doi.org/10.1109/TVCG.2011.174,2384,2391,J,"The relationship between candidates' position on a ballot paper and vote rank is explored in the case of 5000 candidates for the UK 2010 local government elections in the Greater London area. This design study uses hierarchical spatially arranged graphics to represent two locations that affect candidates at very different scales: the geographical areas for which they seek election and the spatial location of their names on the ballot paper. This approach allows the effect of position bias to be assessed; that is, the degree to which the position of a candidate's name on the ballot paper influences the number of votes received by the candidate, and whether this varies geographically. Results show that position bias was significant enough to influence rank order of candidates, and in the case of many marginal electoral wards, to influence who was elected to government. Position bias was observed most strongly for Liberal Democrat candidates but present for all major political parties. Visual analysis of classification of candidate names by ethnicity suggests that this too had an effect on votes received by candidates, in some cases overcoming alphabetic name bias. The results found contradict some earlier research suggesting that alphabetic name bias was not sufficiently significant to affect electoral outcome and add new evidence for the geographic and ethnicity influences on voting behaviour. The visual approach proposed here can be applied to a wider range of electoral data and the patterns identified and hypotheses derived from them could have significant implications for the design of ballot papers and the conduct of fair elections.",Jo Wood;Donia Badawood;Jason Dykes;Aidan Slingsby,Jo Wood;Donia Badawood;Jason Dykes;Aidan Slingsby,"giCentre, City University London;giCentre, City University London;giCentre, City University London;giCentre, City University London",10.1109/TVCG.2009.128;10.1109/TVCG.2008.165;10.1109/TVCG.2010.161,"Voting, election, bias, democracy, governance, treemaps, geovisualization, hierarchy, governance",26,24,27,
VAST,2011,"Orion: A system for modeling, transformation and visualization of multidimensional heterogeneous networks",10.1109/VAST.2011.6102441,http://dx.doi.org/10.1109/VAST.2011.6102441,51,60,C,"The study of complex activities such as scientific production and software development often require modeling connections among heterogeneous entities including people, institutions and artifacts. Despite numerous advances in algorithms and visualization techniques for understanding such social networks, the process of constructing network models and performing exploratory analysis remains difficult and time-consuming. In this paper we present Orion, a system for interactive modeling, transformation and visualization of network data. Orion's interface enables the rapid manipulation of large graphs-including the specification of complex linking relationships-using simple drag-and-drop operations with desired node types. Orion maps these user interactions to statements in a declarative workflow language that incorporates both relational operators (e.g., selection, aggregation and joins) and network analytics (e.g., centrality measures). We demonstrate how these features enable analysts to flexibly construct and compare networks in domains such as online health communities, academic collaboration and distributed software development.",Jeffrey Heer;Adam Perer,Jeffrey Heer;Adam Perer,"Stanford University, USA;IBM Research, USA",10.1109/TVCG.2010.144;10.1109/TVCG.2009.174;10.1109/TVCG.2006.178;10.1109/TVCG.2007.70582;10.1109/TVCG.2006.166;10.1109/VAST.2006.261426;10.1109/INFVIS.2000.885086,"Social network analysis, data management, data transformation, graphs, visualization, end-user programming",26,13,34,
Vis,2011,Volume Analysis Using Multimodal Surface Similarity,10.1109/TVCG.2011.258,http://dx.doi.org/10.1109/TVCG.2011.258,1969,1978,J,"The combination of volume data acquired by multiple modalities has been recognized as an important but challenging task. Modalities often differ in the structures they can delineate and their joint information can be used to extend the classification space. However, they frequently exhibit differing types of artifacts which makes the process of exploiting the additional information non-trivial. In this paper, we present a framework based on an information-theoretic measure of isosurface similarity between different modalities to overcome these problems. The resulting similarity space provides a concise overview of the differences between the two modalities, and also serves as the basis for an improved selection of features. Multimodal classification is expressed in terms of similarities and dissimilarities between the isosurfaces of individual modalities, instead of data value combinations. We demonstrate that our approach can be used to robustly extract features in applications such as dual energy computed tomography of parts in industrial manufacturing.",Martin Haidacher;Stefan Bruckner;M. Eduard Gröller,Martin Haidacher;Stefan Bruckner;Eduard Groller,"Institute of Computer Graphics and Algorithms, Vienna University of Technology;Institute of Computer Graphics and Algorithms, Vienna University of Technology;Institute of Computer Graphics and Algorithms, Vienna University of Technology",10.1109/TVCG.2010.132;10.1109/TVCG.2006.168;10.1109/TVCG.2010.131;10.1109/TVCG.2006.152;10.1109/TVCG.2007.70598;10.1109/TVCG.2008.160;10.1109/TVCG.2010.182,"Multimodal data, volume visualization, surface similarity",26,21,42,
SciVis,2012,Computing Morse-Smale Complexes with Accurate Geometry,10.1109/TVCG.2012.209,http://dx.doi.org/10.1109/TVCG.2012.209,2014,2022,J,"Topological techniques have proven highly successful in analyzing and visualizing scientific data. As a result, significant efforts have been made to compute structures like the Morse-Smale complex as robustly and efficiently as possible. However, the resulting algorithms, while topologically consistent, often produce incorrect connectivity as well as poor geometry. These problems may compromise or even invalidate any subsequent analysis. Moreover, such techniques may fail to improve even when the resolution of the domain mesh is increased, thus producing potentially incorrect results even for highly resolved functions. To address these problems we introduce two new algorithms: (i) a randomized algorithm to compute the discrete gradient of a scalar field that converges under refinement; and (ii) a deterministic variant which directly computes accurate geometry and thus correct connectivity of the MS complex. The first algorithm converges in the sense that on average it produces the correct result and its standard deviation approaches zero with increasing mesh resolution. The second algorithm uses two ordered traversals of the function to integrate the probabilities of the first to extract correct (near optimal) geometry and connectivity. We present an extensive empirical study using both synthetic and real-world data and demonstrates the advantages of our algorithms in comparison with several popular approaches.",Attila Gyulassy;Peer-Timo Bremer;Valerio Pascucci,Attila Gyulassy;Peer-Timo Bremer;Valerio Pascucci,"SCI Institute, University of Utah;Lawrence Livermore National Laboratory;SCI Institute, University of Utah",10.1109/TVCG.2011.249;10.1109/TVCG.2008.110;10.1109/TVCG.2007.70603;10.1109/TVCG.2011.199;10.1109/VISUAL.2005.1532839;10.1109/TVCG.2006.186,"Topology, topological methods, Morse-Smale complex",26,24,30,
SciVis,2012,WYSIWYP: What You See Is What You Pick,10.1109/TVCG.2012.292,http://dx.doi.org/10.1109/TVCG.2012.292,2236,2244,J,"Scientists, engineers and physicians are used to analyze 3D data with slice-based visualizations. Radiologists for example are trained to read slices of medical imaging data. Despite the numerous examples of sophisticated 3D rendering techniques, domain experts, who still prefer slice-based visualization do not consider these to be very useful. Since 3D renderings have the advantage of providing an overview at a glance, while 2D depictions better serve detailed analyses, it is of general interest to better combine these methods. Recently there have been attempts to bridge this gap between 2D and 3D renderings. These attempts include specialized techniques for volume picking in medical imaging data that result in repositioning slices. In this paper, we present a new volume picking technique called WYSIWYP (“what you see is what you pick”) that, in contrast to previous work, does not require pre-segmented data or metadata and thus is more generally applicable. The positions picked by our method are solely based on the data itself, the transfer function, and the way the volumetric rendering is perceived by the user. To demonstrate the utility of the proposed method, we apply it to automated positioning of slices in volumetric scalar fields from various application areas. Finally, we present results of a user study in which 3D locations selected by users are compared to those resulting from WYSIWYP. The user study confirms our claim that the resulting positions correlate well with those perceived by the user.",Alexander Wiebel;Frans Vos;David Foerster;Hans-Christian Hege,Alexander Wiebel;Frans M. Vos;David Foerster;Hans-Christian Hege,Zuse Institute Berlin (ZIB);TU Delft;Zuse Institute Berlin (ZIB);Zuse Institute Berlin (ZIB),10.1109/TVCG.2012.217;10.1109/VISUAL.1998.745337;10.1109/VISUAL.2003.1250384;10.1109/TVCG.2007.70576;10.1109/VISUAL.2005.1532833;10.1109/TVCG.2009.121,"Picking, volume rendering, WYSIWYG",26,24,40,
VAST,2012,A correlative analysis process in a visual analytics environment,10.1109/VAST.2012.6400491,http://dx.doi.org/10.1109/VAST.2012.6400491,33,42,C,"Finding patterns and trends in spatial and temporal datasets has been a long studied problem in statistics and different domains of science. This paper presents a visual analytics approach for the interactive exploration and analysis of spatiotemporal correlations among multivariate datasets. Our approach enables users to discover correlations and explore potentially causal or predictive links at different spatiotemporal aggregation levels among the datasets, and allows them to understand the underlying statistical foundations that precede the analysis. Our technique utilizes the Pearson's product-moment correlation coefficient and factors in the lead or lag between different datasets to detect trends and periodic patterns amongst them.",Abish Malik;Ross Maciejewski;Niklas Elmqvist;Yun Jang;David S. Ebert;Whitney Huang,Abish Malik;Ross Maciejewski;Niklas Elmqvist;Yun Jang;David S. Ebert;Whitney Huang,"Purdue University, USA;Arizona State University, USA;Purdue University, USA;Sejong University, South Korea;Purdue University, USA;Purdue University, USA",10.1109/INFVIS.2005.1532148;10.1109/TVCG.2011.179;10.1109/TVCG.2010.193;10.1109/INFVIS.1999.801851;10.1109/INFVIS.1999.801851;10.1109/VAST.2007.4389006;10.1109/TVCG.2007.70539;10.1109/TVCG.2010.162;10.1109/TVCG.2011.195,"Visual analytics, correlative analysis",26,22,34,
SciVis,2014,Multiscale Symmetry Detection in Scalar Fields by Clustering Contours,10.1109/TVCG.2014.2346332,http://dx.doi.org/10.1109/TVCG.2014.2346332,2427,2436,J,"The complexity in visualizing volumetric data often limits the scope of direct exploration of scalar fields. Isocontour extraction is a popular method for exploring scalar fields because of its simplicity in presenting features in the data. In this paper, we present a novel representation of contours with the aim of studying the similarity relationship between the contours. The representation maps contours to points in a high-dimensional transformation-invariant descriptor space. We leverage the power of this representation to design a clustering based algorithm for detecting symmetric regions in a scalar field. Symmetry detection is a challenging problem because it demands both segmentation of the data and identification of transformation invariant segments. While the former task can be addressed using topological analysis of scalar fields, the latter requires geometry based solutions. Our approach combines the two by utilizing the contour tree for segmenting the data and the descriptor space for determining transformation invariance. We discuss two applications, query driven exploration and asymmetry visualization, that demonstrate the effectiveness of the approach.",Dilip Mathew Thomas;Vijay Natarajan,Dilip Mathew Thomas;Vijay Natarajan,"Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India;Department of Computer Science and Automation and Supercomputer Education Research Centre, Indian Institute of Science, Bangalore, India",10.1109/TVCG.2013.142;10.1109/VISUAL.1999.809869;10.1109/TVCG.2006.149;10.1109/TVCG.2011.236;10.1109/TVCG.2008.143;10.1109/TVCG.2011.258;10.1109/TVCG.2013.148,"Scalar field visualization, symmetry detection, contour tree, data exploration",26,25,43,
InfoVis,2015,Visual Encodings of Temporal Uncertainty: A Comparative User Study,10.1109/TVCG.2015.2467752,http://dx.doi.org/10.1109/TVCG.2015.2467752,539,548,J,"A number of studies have investigated different ways of visualizing uncertainty. However, in the temporal dimension, it is still an open question how to best represent uncertainty, since the special characteristics of time require special visual encodings and may provoke different interpretations. Thus, we have conducted a comprehensive study comparing alternative visual encodings of intervals with uncertain start and end times: gradient plots, violin plots, accumulated probability plots, error bars, centered error bars, and ambiguation. Our results reveal significant differences in error rates and completion time for these different visualization types and different tasks. We recommend using ambiguation - using a lighter color value to represent uncertain regions - or error bars for judging durations and temporal bounds, and gradient plots - using fading color or transparency - for judging probability values.",Theresia Gschwandtner;Markus Bögl;Paolo Federico 0001;Silvia Miksch,Theresia Gschwandtnei;Markus Bögl;Paolo Federico;Silvia Miksch,Vienna University of Technology;Vienna University of Technology;Vienna University of Technology;Vienna University of Technology,10.1109/TVCG.2014.2346298;10.1109/TVCG.2012.279;10.1109/INFVIS.2002.1173145;10.1109/TVCG.2009.114,"Uncertainty, temporal intervals, visualization",26,26,27,
VAST,2015,"VAiRoma: A Visual Analytics System for Making Sense of Places, Times, and Events in Roman History",10.1109/TVCG.2015.2467971,http://dx.doi.org/10.1109/TVCG.2015.2467971,210,219,J,"Learning and gaining knowledge of Roman history is an area of interest for students and citizens at large. This is an example of a subject with great sweep (with many interrelated sub-topics over, in this case, a 3,000 year history) that is hard to grasp by any individual and, in its full detail, is not available as a coherent story. In this paper, we propose a visual analytics approach to construct a data driven view of Roman history based on a large collection of Wikipedia articles. Extracting and enabling the discovery of useful knowledge on events, places, times, and their connections from large amounts of textual data has always been a challenging task. To this aim, we introduce VAiRoma, a visual analytics system that couples state-of-the-art text analysis methods with an intuitive visual interface to help users make sense of events, places, times, and more importantly, the relationships between them. VAiRoma goes beyond textual content exploration, as it permits users to compare, make connections, and externalize the findings all within the visual interface. As a result, VAiRoma allows users to learn and create new knowledge regarding Roman history in an informed way. We evaluated VAiRoma with 16 participants through a user study, with the task being to learn about roman piazzas through finding relevant articles and new relationships. Our study results showed that the VAiRoma system enables the participants to find more relevant articles and connections compared to Web searches and literature search conducted in a roman library. Subjective feedback on VAiRoma was also very positive. In addition, we ran two case studies that demonstrate how VAiRoma can be used for deeper analysis, permitting the rapid discovery and analysis of a small number of key documents even when the original collection contains hundreds of thousands of documents.",Isaac Cho;Wenwen Dou;Derek Xiaoyu Wang;Eric Sauda;William Ribarsky,Isaac Cho;Wewnen Dou;Derek Xiaoyu Wang;Eric Sauda;William Ribarsky,UNC Charlotte;UNC Charlotte,10.1109/VAST.2014.7042493;10.1109/VAST.2007.4389012;10.1109/TVCG.2014.2346431;10.1109/TVCG.2007.70617;10.1109/TVCG.2008.178;10.1109/VAST.2010.5652885;10.1109/TVCG.2011.239;10.1109/VAST.2012.6400485;10.1109/TVCG.2013.162;10.1109/INFVIS.2000.885098;10.1109/TVCG.2011.179;10.1109/TVCG.2014.2346481;10.1109/INFVIS.2000.885091,"Visual Analytics, Text Analytics, Wikipedia",26,23,40,
VAST,2016,TopicLens: Efficient Multi-Level Visual Topic Exploration of Large-Scale Document Collections,10.1109/TVCG.2016.2598445,http://dx.doi.org/10.1109/TVCG.2016.2598445,151,160,J,"Topic modeling, which reveals underlying topics of a document corpus, has been actively adopted in visual analytics for large-scale document collections. However, due to its significant processing time and non-interactive nature, topic modeling has so far not been tightly integrated into a visual analytics workflow. Instead, most such systems are limited to utilizing a fixed, initial set of topics. Motivated by this gap in the literature, we propose a novel interaction technique called TopicLens that allows a user to dynamically explore data through a lens interface where topic modeling and the corresponding 2D embedding are efficiently computed on the fly. To support this interaction in real time while maintaining view consistency, we propose a novel efficient topic modeling method and a semi-supervised 2D embedding algorithm. Our work is based on improving state-of-the-art methods such as nonnegative matrix factorization and t-distributed stochastic neighbor embedding. Furthermore, we have built a web-based visual analytics system integrated with TopicLens. We use this system to measure the performance and the visualization quality of our proposed methods. We provide several scenarios showcasing the capability of TopicLens using real-world datasets.",Minjeong Kim;Kyeongpil Kang;Deok Gun Park 0001;Jaegul Choo;Niklas Elmqvist,Minjeong Kim;Kyeongpil Kang;Deokgun Park;Jaegul Choo;Niklas Elmqvist,"Korea University;Korea University;University of Maryland, College Park, MD, USA;Korea University;University of Maryland, College Park, MD, USA",10.1109/INFVIS.2003.1249014;10.1109/TVCG.2013.212;10.1109/INFVIS.2003.1249008;10.1109/INFVIS.2004.43;10.1109/TVCG.2014.2346574;10.1109/TVCG.2011.239;10.1109/TVCG.2010.154;10.1109/VAST.2014.7042494,topic modeling;nonnegative matrix factorization;t-distributed stochastic neighbor embedding;magic lens;text analytics,26,29,51,
Vis,1990,Volume visualization in cell biology,10.1109/VISUAL.1990.146378,http://dx.doi.org/10.1109/VISUAL.1990.146378,160,"168, 471-2",C,"The authors discuss the special properties of volumetric cell data (e.g., noise, discontinuity, raggedness) and the particular difficulties encountered when trying to visualize them in three dimensions. The authors describe some of the solutions adopted, specifically in surface discrimination and shading. Nerve cells (neuroblastoma) grown in tissue culture were selected as the biological preparation because these cells possess very rich actin structures. The cells were stained with a fluorescent probe specific for actin (rhodamine-phalloidin) and were viewed and optically sectioned using the Bio-Rad MRC 600 confocal fluorescence microscope. The slice dataset was then reconstructed and processed in the BioCube environment, a comprehensive system developed for volume visualization of cellular structures. The actin cytoskeleton of single cells was visualized and manipulated using this system.&lt;&lt;ETX&gt;&gt;",Arie E. Kaufman;Roni Yagel;Reuven Bakalash;I. Spector,A. Kaufman;R. Yagel;R. Bakalash;I. Spector,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",,,25,13,29,
Vis,1992,Four-dimensional views of 3D scalar fields,10.1109/VISUAL.1992.235222,http://dx.doi.org/10.1109/VISUAL.1992.235222,84,91,C,"Scalar functions of three variables, w=f(x, y, z), are common in many types of scientific and medical applications. Such 3D scalar fields can be understood as elevation maps in four dimensions, with three independent variables (x, y, z) and a fourth, dependent, variable w that corresponds to the elevations. It is shown how techniques developed originally for the display of 3-manifolds in 4D Euclidean space can be adapted to visualize 3D scalar fields in a variety of ways.&lt;&lt;ETX&gt;&gt;",Andrew J. Hanson;Pheng-Ann Heng,A.J. Hanson;P.A. Heng,"CERN, Geneva, Switzerland",10.1109/VISUAL.1990.146363;10.1109/VISUAL.1991.175821;10.1109/VISUAL.1990.146391,,25,15,17,
Vis,1993,Tioga: A database-oriented visualization tool,10.1109/VISUAL.1993.398855,http://dx.doi.org/10.1109/VISUAL.1993.398855,86,93,C,"In the work we present a new architecture for visualization systems that is based on data base management system (DBMS) technology. By building on the mechanisms present in a next-generation DBMS, rather than merely on the capabilities of a standard file manager, we show that a simpler and more powerful visualization system can be constructed. We retain the popular ""boxes and arrows"" programming notation for constructing visualization programs, but add a ""flight simulator"" model of movement to navigate the output of such programs. In addition, we provide a means to specify a hierarchy of abstracts of data of different types and resolutions, so that a ""zoom"" capability can be supported. The underlying DBMS support for this system, Tioga, is briefly described, as well as the current state of the implementation.&lt;&lt;ETX&gt;&gt;",Michael Stonebraker;Jolly Chen;Nobuko Nathan;Caroline Paxson;Alan Su;Jiang Wu,M. Stonebraker;J. Chen;N. Nathan;C. Paxson;A. Su;J. Wu,"EECS Dept., California Univ., Berkeley, CA, USA;EECS Dept., California Univ., Berkeley, CA, USA;EECS Dept., California Univ., Berkeley, CA, USA;EECS Dept., California Univ., Berkeley, CA, USA;EECS Dept., California Univ., Berkeley, CA, USA;EECS Dept., California Univ., Berkeley, CA, USA",,,25,7,15,
Vis,1994,Spiders: a new user interface for rotation and visualization of n-dimensional point sets,10.1109/VISUAL.1994.346318,http://dx.doi.org/10.1109/VISUAL.1994.346318,205,"211, C22",C,We present a new method for creating n-dimensional rotation matrices from manipulating the projections of n-dimensional data coordinate axes onto a viewing plane. A user interface for n-dimensional rotation is implemented. The interface is shown to have no rotational hysteresis.&lt;&lt;ETX&gt;&gt;,Kirk L. Duffin;Bill Barrett,K.L. Duffin;W.A. Barrett,"Brigham Young Univ., Provo, UT, USA;Brigham Young Univ., Provo, UT, USA",10.1109/VISUAL.1991.175794,,25,11,10,
Vis,1995,"Defining, computing, and visualizing molecular interfaces",10.1109/VISUAL.1995.480793,http://dx.doi.org/10.1109/VISUAL.1995.480793,36,"43, 436",C,"A parallel, analytic approach for defining and computing the inter and intra molecular interfaces in three dimensions is described. The molecular interface surfaces are derived from approximations to the power diagrams over the participating molecular units. For a given molecular interface our approach can generate a family of interface surfaces parametrized by /spl alpha/ and /spl beta/, where /spl alpha/ is the radius of the solvent molecule (also known as the probe radius) and /spl beta/ is the interface radius that defines the size of the molecular interface. Molecular interface surfaces provide biochemists with a powerful tool to study surface complementarity and to efficiently characterize the interactions during a protein substrate docking. The complexity of our algorithm for molecular environments is O(nk log/sup 2/ k), where n is the number of atoms in the participating molecular units and k is the average number of neighboring atoms-a constant, given /spl alpha/ and /spl beta/.",Amitabh Varshney;Frederick P. Brooks Jr.;David C. Richardson;William V. Wright;Dinesh Manocha,A. Varshney;F.P. Brooks;D.C. Richardson;W.V. Wright;D. Manocha,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1993.398878,,25,6,19,
Vis,1995,Vector plots for irregular grids,10.1109/VISUAL.1995.480819,http://dx.doi.org/10.1109/VISUAL.1995.480819,248,"253, 459",C,"A standard method for visualizing vector fields consists of drawing many small ""glyphs"" to represent the field. This paper extends the technique from regular to curvilinear and unstructured grids. In order to achieve a uniform density of vector glyphs on nonuniformly spaced grids, the paper describes two approaches to resampling the grid data. One of the methods, an element-based resampling, can be used to visualize vector fields at arbitrary surfaces within three-dimensional grids.",Don Dovey,D. Dovey,"Lawrence Livermore Nat. Lab., CA, USA",10.1109/VISUAL.1993.398877;10.1109/VISUAL.1994.346313;10.1109/VISUAL.1994.346312,,25,11,13,
Vis,1996,Two-handed interactive stereoscopic visualization,10.1109/VISUAL.1996.568109,http://dx.doi.org/10.1109/VISUAL.1996.568109,205,210,C,"This paper describes a minimally immersive interactive system for visualization of multivariate volumetric data. The system, SFA, uses glyph-based volume rendering which does not suffer the initial costs of isosurface rendering or voxel-based volume rendering, while offering the capability of viewing the entire volume. Glyph rendering also allows the simultaneous display of multiple data values per volume location. Two-handed interaction using three-space magnetic trackers and stereoscopic viewing are combined to produce a minimally immersive volumetric visualization system that enhances the user's three-dimensional perception of the data. We describe the usefulness of this system for visualizing volumetric scalar and vector data. SFA allows the three-dimensional volumetric visualization, manipulation, navigation, and analysis of multivariate, time-varying volumetric data, increasing the quantity and clarity of the information conveyed from the visualization system.",David S. Ebert;Chris Shaw 0002;Amen Zwa;Cindy Starr,D.S. Ebert;C.D. Shaw;A. Zwa;C. Starr,"Maryland Univ., Baltimore, MD, USA",10.1109/VISUAL.1995.485141,,25,9,20,
InfoVis,1998,An interactive view for hierarchical clustering,10.1109/INFVIS.1998.729556,http://dx.doi.org/10.1109/INFVIS.1998.729556,26,"31, 150",C,"The paper describes a visualization of a general hierarchical clustering algorithm that allows the user to manipulate the number of classes produced by the clustering method without requiring a radical re-drawing of the clustering tree. The visual method used, a space filling recursive division of a rectangular area, keeps the items under consideration at the same screen position, even while the number of classes is under interactive control. As well as presenting a compact representation of the clustering with different cluster numbers, this method is particularly useful in a linked views environment where additional information can be added to a display to encode other information, without this added level of detail being perturbed when changes are made to the number of clusters.",Graham J. Wills,G.J. Wills,"Lucent Technol., AT&T Bell Labs., Naperville, IL, USA",10.1109/INFVIS.1996.559216,,25,14,6,
Vis,1999,Optimal triangular Haar bases for spherical data,10.1109/VISUAL.1999.809898,http://dx.doi.org/10.1109/VISUAL.1999.809898,279,534,C,"Multiresolution analysis based on FWT (Fast Wavelet Transform) is now widely used in scientific visualization. Spherical biorthogonal wavelets for spherical triangular grids were introduced by P. Schroder and W. Sweldens (1995). In order to improve on the orthogonality of the wavelets, the concept of nearly orthogonality, and two new piecewise-constant (Haar) bases were introduced by G.M. Nielson (1997). We extend the results of Nielson. First we give two one-parameter families of triangular Haar wavelet bases that are nearly orthogonal in the sense of Nielson. Then we introduce a measure of orthogonality. This measure vanishes for orthogonal bases. Eventually, we show that we can find an optimal parameter of our wavelet families, for which the measure of orthogonality is minimized. Several numerical and visual examples for a spherical topographic data set illustrates our results.",Georges-Pierre Bonneau,G.-P. Bonneau,"CNRS, France",10.1109/VISUAL.1997.663871,"visualization, multiresolution, wavelets, orthogonality",25,11,7,
Vis,1999,LOD-sprite technique for accelerated terrain rendering,10.1109/VISUAL.1999.809900,http://dx.doi.org/10.1109/VISUAL.1999.809900,291,536,C,"We present a novel rendering technique, termed LOD-sprite rendering, which uses a combination of a level-of-detail (LOD) representation of the scene together with reusing image sprites (previously rendered images). Our primary application is accelerating terrain rendering. The LOD-sprite technique renders an initial frame using a high-resolution model of the scene geometry. It renders subsequent frames with a much lower-resolution model of the scene geometry and texture-maps each polygon with the image sprite from the initial high-resolution frame. As it renders these subsequent frames, the technique measures the error associated with the divergence of the view position from the position where the initial frame was rendered. Once this error exceeds a user-defined threshold, the technique re-renders the scene from the high-resolution model. We have efficiently implemented the LOD-sprite technique with texture mapping graphics hardware. Although to date we have only applied LOD-sprite to terrain rendering, it could easily be extended to other applications. We feel LOD-sprite holds particular promise for real time rendering systems.",Baoquan Chen;J. Edward Swan;Eddy Kuo;Arie E. Kaufman,B. Chen;J.E. Swan;E. Kuo;A. Kaufman,"State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1998.745344;10.1109/VISUAL.1996.567774;10.1109/VISUAL.1998.745282,"Image-Based Modeling and Rendering,Texture Mapping, Acceleration Techniques, Multi-Resolution, Level of Detail, Terrain Rendering, Virtual Reality, Virtual Environments",25,8,27,
Vis,2000,On-the-fly rendering of losslessly compressed irregular volume data,10.1109/VISUAL.2000.885682,http://dx.doi.org/10.1109/VISUAL.2000.885682,101,108,C,"Very large irregular-grid data sets are represented as tetrahedral meshes and may incur significant disk I/O access overhead in the rendering process. An effective way to alleviate the disk I/O overhead associated with rendering a large tetrahedral mesh is to reduce the I/O bandwidth requirement through compression. Existing tetrahedral mesh compression algorithms focus only on compression efficiency and cannot be readily integrated into the mesh rendering process, and thus demand that a compressed tetrahedral mesh be decompressed before it can be rendered into a 2D image. This paper presents an integrated tetrahedral mesh compression and rendering algorithm called Gatun, which allows compressed tetrahedral meshes to be rendered incrementally as they are being decompressed, thus leading to an efficient irregular grid rendering pipeline. Both compression and rendering algorithms in Gatun exploit the same local connectivity information among adjacent tetrahedra, and thus can be tightly integrated into a unified implementation framework. Our tetrahedral compression algorithm is specifically designed to facilitate the integration with an irregular grid renderer without any compromise in compression efficiency. A unique performance advantage of Gatun is its ability to reduce the runtime memory footprint requirement by releasing memory allocated to tetrahedra as early as possible.",Chuan-Kai Yang;Tulika Mitra;Tzi-cker Chiueh,Chuan-Kai Yang;T. Mitra;Tzi-Cker Chiueh,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1999.809868,"irregular grids, tetrahedral compression, volume rendering",25,4,16,
Vis,2000,Mastering interactive virtual bronchioscopy on a low-end PC,10.1109/VISUAL.2000.885732,http://dx.doi.org/10.1109/VISUAL.2000.885732,461,464,C,"Virtual endoscopy presents the cross-sectional acquired 3D-data of a computer tomograph as an endoluminal view. The common approach for the visualization of a virtual endoscopy is surface rendering, yielding images close to a real endoscopy. If external structures are of interest, volume rendering techniques have to be used. These methods do not display the exact shape of the inner lumen very well. For certain applications, e.g. operation planning of a transbronchial biopsy, both the shape of the inner lumen as well as outer structures like blood vessels and the tumor have to be delineated. A method is described, that allows a quick and easy hybrid visualization using overlays of different visualization methods like different surfaces or volume renderings with different transfer functions in real time on a low-end PC. To achieve real time frame rates, image based rendering techniques have been used.",Rainer Wegenkittl;Anna Vilanova;Balint Hegedüs;Daniel Wagner;Martin C. Freund;M. Eduard Gröller,R. Wegenkittl;A. Vilanova;B. Hegedust;D. Wagner;M.C. Freund;E.M. Groller,"Tiani Medgraph GesmbH, Vienna, Austria",10.1109/VISUAL.1999.809912;10.1109/VISUAL.1998.745337;10.1109/VISUAL.1999.809911,"medical visualization, virtual endoscopy, visualization system",25,7,13,
Vis,2002,A case study on automatic camera placement and motion for visualizing historical data,10.1109/VISUAL.2002.1183826,http://dx.doi.org/10.1109/VISUAL.2002.1183826,545,548,C,"In this paper, we address the problem of automatic camera positioning and automatic camera path generation in the context of historical data visualization. After short description of the given data, we elaborate on the constraints for the positioning of a virtual camera in such a way that not only the projected area is maximized, but also the depth of the displayed scene. This is especially important when displaying terrain models, which do not provide good 3D impression when only the projected area is maximized. Based on this concept, we present a method for computing an optimal camera position for each instant of time. Since the explored data are not static, but change depending on the explored scene time, we also discuss a method for animation generation. In order to avoid sudden changes of the camera position, when the previous method is applied for each frame (point in time), we introduce pseudo-events in time, which expand the bounding box defined by the currently active events of interest. In particular, this technique allows events happening in a future point in time to be taken into account such that when this time becomes current, all events of interest are already within the current viewing frustum of the camera.",Stanislav L. Stoev;Wolfgang Straßer,S.L. Stoev;W. Strasser,"Tubingen Univ., Germany;Tubingen Univ., Germany",10.1109/VISUAL.2001.964557,"Automatic Camera Control, Visualization, Historical Data, Time-dependent Data, Visualization Techniques",25,9,14,
Vis,2003,Extraction of topologically simple isosurfaces from volume datasets,10.1109/VISUAL.2003.1250356,http://dx.doi.org/10.1109/VISUAL.2003.1250356,67,74,C,"There are numerous algorithms in graphics and visualization whose performance is known to decay as the topological complexity of the input increases. On the other hand, the standard pipeline for 3D geometry acquisition often produces 3D models that are topologically more complex than their real forms. We present a simple and efficient algorithm that allows us to simplify the topology of an isosurface by alternating the values of some number of voxels. Its utility and performance are demonstrated on several examples, including signed distance functions from polygonal models and CT scans.",Andrzej Szymczak;James Vanderhyde,A. Szymczak;J. Vanderhyde,"Georgia Tech, USA;Georgia Tech, USA",10.1109/VISUAL.2002.1183774;10.1109/VISUAL.2000.885703;10.1109/VISUAL.2000.885704," Isosurface, Topology, Genus",25,15,42,
Vis,2004,Building an Ontology of Visualization,10.1109/VISUAL.2004.10,http://dx.doi.org/10.1109/VISUAL.2004.10,7,7,M,"Recent activity within the UK National e-Science Programme has identified a need to establish an ontology for visualization. Motivation for this includes defining web and grid services for visualization (the ‘semantic grid’), supporting collaborative work, curation, and underpinning visualization research and education. At a preliminary meeting, members of the UK visualization community identified a skeleton for the ontology. We have started to build on this by identifying how existing work might be related and utilized. We believe that the greatest challenge is reaching a consensus within the visualization community itself. This poster is intended as one step in this process, setting out the perceived needs for the ontology, and sketching initial directions. It is hoped that this will lead to debate, feedback and involvement across the community.",David J. Duke;Ken Brodlie;David A. Duce,D.J. Duke;K.W. Brodlie;D.A. Duce,University of Leeds,,,25,5,2,
Vis,2004,Dispersion simulation and visualization for urban security,10.1109/VISUAL.2004.24,http://dx.doi.org/10.1109/VISUAL.2004.24,553,560,C,"We present a system for simulating and visualizing the propagation of dispersive contaminants with an application to urban security. In particular, we simulate airborne contaminant propagation in open environments characterised by sky-scrapers and deep urban canyons. Our approach is based on the multiple relaxation time lattice Boltzmann model (MRTLBM), which can efficiently handle complex boundary conditions such as buildings. In addition, we model thermal effects on the flow field using the hybrid thermal MRTLBM. Our approach can also accommodate readings from various sensors distributed in the environment and adapt the simulation accordingly. We accelerate the computation and efficiently render many buildings with small textures on the GPU. We render streamlines and the contaminant smoke with self-shadowing composited with the textured buildings.",Feng Qiu;Ye Zhao;Zhe Fan;Xiaoming Wei;Haik Lorenz;Jianning Wang;Suzanne Yoakum-Stover;Arie E. Kaufman;Klaus Mueller,Feng Qiu;Ye Zhao;Zhe Fan;Xiaoming Wei;H. Lorenz;Jianning Wang;S. Yoakum-Stover;A. Kaufman;K. Mueller,"Dept. of Comput. Sci., Stony Brook Univ., NY, USA;Dept. of Comput. Sci., Stony Brook Univ., NY, USA;Dept. of Comput. Sci., Stony Brook Univ., NY, USA;Dept. of Comput. Sci., Stony Brook Univ., NY, USA;Dept. of Comput. Sci., Stony Brook Univ., NY, USA;Dept. of Comput. Sci., Stony Brook Univ., NY, USA;Dept. of Comput. Sci., Stony Brook Univ., NY, USA;Dept. of Comput. Sci., Stony Brook Univ., NY, USA;Dept. of Comput. Sci., Stony Brook Univ., NY, USA",10.1109/VISUAL.2003.1250382;10.1109/VISUAL.2002.1183764;10.1109/VISUAL.2002.1183779;10.1109/VISUAL.1993.398877,"Lattice Boltzmann Model, GPU, Visualization",25,6,45,
Vis,2004,Immersive design of DNA molecules with a tangible interface,10.1109/VISUAL.2004.47,http://dx.doi.org/10.1109/VISUAL.2004.47,227,234,C,"This work presents an experimental immersive interface for designing DNA components for application in nanotechnology. While much research has been done on immersive visualization, this is one of the first systems to apply advanced interface techniques to a scientific design problem. This system uses tangible 3D input devices (tongs, a raygun, and a multipurpose handle tool) to create and edit a purely digital representation of DNA. The tangible controllers are associated with functions (not data) while a virtual display is used to render the model. This interface was built in collaboration with a research group investigating the design of DNA tiles. A user study shows that scientists find the immersive interface more satisfying than a 2D interface due to the enhanced understanding gained by directly interacting with molecules in 3D space.",Steven Schkolne;Hiroshi Ishii 0001;Peter Schröder,S. Schkolne;H. Ishii;P. Schroder,,,"tangible user interface, molecular visualization, props, molecular modeling, spatial construction, virtual reality, augmented reality, responsive workbench, DNA design",25,11,34,
Vis,2005,High performance volume splatting for visualization of neurovascular data,10.1109/VISUAL.2005.1532805,http://dx.doi.org/10.1109/VISUAL.2005.1532805,271,278,C,"A new technique is presented to increase the performance of volume splatting by using hardware accelerated point sprites. This allows creating screen aligned elliptical splats for high quality volume splatting at very low cost on the GPU. Only one vertex per splat is stored on the graphics card. GPU generated point sprite texture coordinates are used for computing splats and per-fragment 3D-texture coordinates on the fly. Thus, only 6 bytes per splat are stored on the GPU and vertex shader load is 25% in comparison to applying textured quads. For eight predefined viewing directions, depth-sorting of the splats is performed in a pre-processing step where the resulting indices are stored on the GPU. Thereby, there is no data transfer between CPU and GPU during rendering. Post-classificative two dimensional transfer functions with lighting for scalar data and tagged volumes were implemented. Thereby, we focused on the visualization of neurovascular structures, where typically no more than 2% of the voxels contribute to the resulting 3D-representation. A comparison with a 3D-texture-based slicing algorithm showed frame rates up to 11 times higher for the presented approach on current CPUs. The presented technique was evaluated with a broad medical database and its value for highly sparse volume visualization is shown.",Fernando Vega Higuera;Peter Hastreiter;Rudolf Fahlbusch;Günther Greiner,F. Vega-Higuera;P. Hastreiter;R. Fahlbusch;G. Greiner,"Dept. of Neurosurg. & Comput. Graphics Group, Univ. of Erlangen, Germany;Dept. of Neurosurg. & Comput. Graphics Group, Univ. of Erlangen, Germany;Dept. of Neurosurg. & Comput. Graphics Group, Univ. of Erlangen, Germany;Dept. of Neurosurg. & Comput. Graphics Group, Univ. of Erlangen, Germany",10.1109/VISUAL.2004.38;10.1109/VISUAL.1997.663882;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.1996.567608;10.1109/VISUAL.2003.1250404;10.1109/VISUAL.2001.964519;10.1109/VISUAL.2003.1250388;10.1109/VISUAL.2001.964490;10.1109/VISUAL.1999.809909;10.1109/VISUAL.2003.1250386,"volume visualization, volume splatting, neurovascular structures, segmented data",25,1,27,
Vis,2005,Topology-driven surface mappings with robust feature alignment,10.1109/VISUAL.2005.1532840,http://dx.doi.org/10.1109/VISUAL.2005.1532840,543,550,C,"Topological concepts and techniques have been broadly applied in computer graphics and geometric modeling. However, the homotopy type of a mapping between two surfaces has not been addressed before. In this paper, we present a novel solution to the problem of computing continuous maps with different homotopy types between two arbitrary triangle meshes with the same topology. Inspired by the rich theory of topology as well as the existing body of work on surface mapping, our newly-developed mapping techniques are both fundamental and unique, offering many attractive advantages. First, our method allows the user to change the homotopy type or global structure of the mapping with minimal intervention. Moreover, to locally affect shape correspondence, we articulate a new technique that robustly satisfies hard feature constraints, without the use of heuristics to ensure validity. In addition to acting as a useful tool for computer graphics applications, our method can be used as a rigorous and practical mechanism for the visualization of abstract topological concepts such as homotopy type of surface mappings, homology basis, fundamental domain, and universal covering space. At the core of our algorithm is a procedure for computing the canonical homology basis and using it as a common cut graph for any surface with the same topology. We demonstrate our results by applying our algorithm to shape morphing in this paper.",Christopher Carner;Miao Jin;Xianfeng Gu;Hong Qin,C. Garner;M. Jin;X. Gu;H. Qin,"Stony Brook Univ., NY, USA;Stony Brook Univ., NY, USA;Stony Brook Univ., NY, USA;Stony Brook Univ., NY, USA",10.1109/VISUAL.2002.1183795,"Surface parameterization, Riemannian surface structure, Computational topology, Shape morphing",25,6,27,
InfoVis,2007,Visualizing Causal Semantics Using Animations,10.1109/TVCG.2007.70528,http://dx.doi.org/10.1109/TVCG.2007.70528,1254,1261,J,"Michotte's theory of ampliation suggests that causal relationships are perceived by objects animated under appropriate spatiotemporal conditions. We extend the theory of ampliation and propose that the immediate perception of complex causal relations is also dependent on a set of structural and temporal rules. We designed animated representations, based on Michotte's rules, for showing complex causal relationships or causal semantics. In this paper we describe a set of animations for showing semantics such as causal amplification, causal strength, causal dampening, and causal multiplicity. In a two part study we compared the effectiveness of both the static and animated representations. The first study (N=44) asked participants to recall passages that were previously displayed using both types of representations. Participants were 8% more accurate in recalling causal semantics when they were presented using animations instead of static graphs. In the second study (N=112) we evaluated the intuitiveness of the representations. Our results showed that while users were as accurate with the static graphs as with the animations, they were 9% faster in matching the correct causal statements in the animated condition. Overall our results show that animated diagrams that are designed based on perceptual rules such as those proposed by Michotte have the potential to facilitate comprehension of complex causal relations.",Nivedita R. Kadaba;Pourang Irani;Jason Leboe-McGowan,Nivedita Kadaba;Jason Leboe;Jason Leboe;Nivedita Kadaba;Nivedita Kadaba;Nivedita Kadaba;Pourang Irani;Pourang Irani;Pourang Irani;Pourang Irani;Jason Leboe;Jason Leboe,"Department of Computer Science, University of Manitoba;Department of Psychology, University of Manitoba;Department of Psychology, University of Manitoba;Department of Computer Science, University of Manitoba;Department of Computer Science, University of Manitoba;Department of Computer Science, University of Manitoba;Department of Computer Science, University of Manitoba;Department of Computer Science, University of Manitoba;Department of Computer Science, University of Manitoba;Department of Computer Science, University of Manitoba;Department of Psychology, University of Manitoba;Department of Psychology, University of Manitoba",10.1109/INFVIS.2003.1249025,"Causality, visualization, semantics, animated graphs, perception, visualizing cause and effect, graph semantics",25,16,21,
InfoVis,2008,Who Votes For What? A Visual Query Language for Opinion Data,10.1109/TVCG.2008.187,http://dx.doi.org/10.1109/TVCG.2008.187,1197,1204,J,"Surveys and opinion polls are extremely popular in the media, especially in the months preceding a general election. However, the available tools for analyzing poll results often require specialized training. Hence, data analysis remains out of reach for many casual computer users. Moreover, the visualizations used to communicate the results of surveys are typically limited to traditional statistical graphics like bar graphs and pie charts, both of which are fundamentally noninteractive. We present a simple interactive visualization that allows users to construct queries on large tabular data sets, and view the results in real time. The results of two separate user studies suggest that our interface lowers the learning curve for naive users, while still providing enough analytical power to discover interesting correlations in the data.",Geoffrey M. Draper;Richard F. Riesenfeld,Geoffrey Draper;Richard Riesenfeld,University of Utah;University of Utah,10.1109/TVCG.2007.70584;10.1109/INFVIS.1996.559210;10.1109/INFVIS.2005.1532134;10.1109/INFVIS.2001.963279;10.1109/VISUAL.1990.146402;10.1109/TVCG.2007.70617;10.1109/VAST.2006.261438;10.1109/INFVIS.1998.729570;10.1109/INFVIS.2001.963287;10.1109/INFVIS.2000.885086;10.1109/TVCG.2007.70539;10.1109/VAST.2007.4389013;10.1109/INFVIS.2000.885091;10.1109/TVCG.2007.70577;10.1109/TVCG.2006.147,"Visual query languages, radial visualization, data analysis, human-computer interaction",25,11,45,
VAST,2008,Understanding syndromic hotspots - a visual analytics approach,10.1109/VAST.2008.4677354,http://dx.doi.org/10.1109/VAST.2008.4677354,35,42,C,"When analyzing syndromic surveillance data, health care officials look for areas with unusually high cases of syndromes. Unfortunately, many outbreaks are difficult to detect because their signal is obscured by the statistical noise. Consequently, many detection algorithms have a high false positive rate. While many false alerts can be easily filtered by trained epidemiologists, others require health officials to drill down into the data, analyzing specific segments of the population and historical trends over time and space. Furthermore, the ability to accurately recognize meaningful patterns in the data becomes more challenging as these data sources increase in volume and complexity. To facilitate more accurate and efficient event detection, we have created a visual analytics tool that provides analysts with linked geo-spatiotemporal and statistical analytic views. We model syndromic hotspots by applying a kernel density estimation on the population sample. When an analyst selects a syndromic hotspot, temporal statistical graphs of the hotspot are created. Similarly, regions in the statistical plots may be selected to generate geospatial features specific to the current time period. Demographic filtering can then be combined to determine if certain populations are more affected than others. These tools allow analysts to perform real-time hypothesis testing and evaluation.",Ross Maciejewski;Stephen Rudolph;Ryan Hafen;Ahmad M. Abusalah;Mohamed Yakout;Mourad Ouzzani;William S. Cleveland;Shaun J. Grannis;Michael Wade;David S. Ebert,Ross Maciejewski;Stephen Rudolph;Ryan Hafen;Ahmad Abusalah;Mohamed Yakout;Mourad Ouzzani;William S. Cleveland;Shaun J. Grannis;Michael Wade;David S. Ebert,"Purdue University Regional Visualization and Analytics Center (PURVAC), USA;Purdue University Regional Visualization and Analytics Center (PURVAC), USA;Purdue University Regional Visualization and Analytics Center (PURVAC), USA;Purdue University Regional Visualization and Analytics Center (PURVAC), USA;Purdue University Regional Visualization and Analytics Center (PURVAC), USA;Purdue University Regional Visualization and Analytics Center (PURVAC), USA;Purdue University Regional Visualization and Analytics Center (PURVAC), USA;Regenstrief Institute and Indiana University School of Medicine, USA;Indiana State Department of Health, USA;Purdue University Regional Visualization and Analytics Center (PURVAC), USA",10.1109/INFVIS.2001.963294;10.1109/VAST.2007.4388991;10.1109/INFVIS.1998.729563;10.1109/VISUAL.1995.485139;10.1109/VAST.2007.4388993,,25,13,26,
Vis,2010,Interactive Visualization of Hyperspectral Images of Historical Documents,10.1109/TVCG.2010.172,http://dx.doi.org/10.1109/TVCG.2010.172,1441,1448,J,"This paper presents an interactive visualization tool to study and analyze hyperspectral images (HSI) of historical documents. This work is part of a collaborative effort with the Nationaal Archief of the Netherlands (NAN) and Art Innovation, a manufacturer of hyperspectral imaging hardware designed for old and fragile documents. The NAN is actively capturing HSI of historical documents for use in a variety of tasks related to the analysis and management of archival collections, from ink and paper analysis to monitoring the effects of environmental aging. To assist their work, we have developed a comprehensive visualization tool that offers an assortment of visualization and analysis methods, including interactive spectral selection, spectral similarity analysis, time-varying data analysis and visualization, and selective spectral band fusion. This paper describes our visualization software and how it is used to facilitate the tasks needed by our collaborators. Evaluation feedback from our collaborators on how this tool benefits their work is included.",Seon Joo Kim;Shaojie Zhuo;Fanbo Deng;Chi-Wing Fu;Michael S. Brown,Seon Joo Kim;Shaojie Zhuo;Fanbo Deng;Chi-Wing Fu;Michael Brown,National University of Singapore;National University of Singapore;National University of Singapore;Nanyang Technological University;National University of Singapore,10.1109/TVCG.2008.139;10.1109/TVCG.2008.161;10.1109/TVCG.2008.146;10.1109/TVCG.2006.155;10.1109/VISUAL.1995.485155;10.1109/TVCG.2008.182,"Hyperspectral visualization, data exploration, image fusion, document processing and analysis",25,18,31,
VAST,2011,ScatterBlogs: Geo-spatial document analysis,10.1109/VAST.2011.6102488,http://dx.doi.org/10.1109/VAST.2011.6102488,309,310,M,"We presented Scatterblogs, a system for microblog analysis that seamlessly integrates search backend and visual frontend. It provides powerful, automatic algorithms for detecting spatio-temporal `anomalies' within blog entries as well as corresponding visual representations and interaction facilities for inspecting anomalies or exploiting them in further analytic steps. Apart from that, we consider the system's combinatoric facilities for building complex hypotheses from temporal, spatial, and content-related aspects an important feature. This was the key for creating a cross-checked analysis for MC1.",Harald Bosch;Dennis Thom;Michael Wörner 0001;Steffen Koch;Edwin Puttmann;Dominik Jäckle;Thomas Ertl,Harald Bosch;Dennis Thom;Michael Wörner;Steffen Koch;Edwin Püttmann;Dominik Jäckle;Thomas Ertl,"Institute for Visualization and Interactive Systems, Universität Stuttgart, Germany;Institute for Visualization and Interactive Systems, Universität Stuttgart, Germany;Institute for Visualization and Interactive Systems, Universität Stuttgart, Germany;Institute for Visualization and Interactive Systems, Universität Stuttgart, Germany;Institute for Visualization and Interactive Systems, Universität Stuttgart, Germany;Institute for Visualization and Interactive Systems, Universität Stuttgart, Germany;Institute for Visualization and Interactive Systems, Universität Stuttgart, Germany",,,25,19,2,
Vis,2011,Image Plane Sweep Volume Illumination,10.1109/TVCG.2011.211,http://dx.doi.org/10.1109/TVCG.2011.211,2125,2134,J,"In recent years, many volumetric illumination models have been proposed, which have the potential to simulate advanced lighting effects and thus support improved image comprehension. Although volume ray-casting is widely accepted as the volume rendering technique which achieves the highest image quality, so far no volumetric illumination algorithm has been designed to be directly incorporated into the ray-casting process. In this paper we propose image plane sweep volume illumination (IPSVI), which allows the integration of advanced illumination effects into a GPU-based volume ray-caster by exploiting the plane sweep paradigm. Thus, we are able to reduce the problem complexity and achieve interactive frame rates, while supporting scattering as well as shadowing. Since all illumination computations are performed directly within a single rendering pass, IPSVI does not require any preprocessing nor does it need to store intermediate results within an illumination volume. It therefore has a significantly lower memory footprint than other techniques. This makes IPSVI directly applicable to large data sets. Furthermore, the integration into a GPU-based ray-caster allows for high image quality as well as improved rendering performance by exploiting early ray termination. This paper discusses the theory behind IPSVI, describes its implementation, demonstrates its visual results and provides performance measurements.",Erik Sundén;Anders Ynnerman;Timo Ropinski,Erik Sunden;Anders Ynnerman;Timo Ropinski,Link&#x0F5;ping University;Link&#x0F5;ping University;University of M&#x0FC;nster,10.1109/TVCG.2011.161;10.1109/VISUAL.2002.1183761;10.1109/VISUAL.2003.1250394;10.1109/VISUAL.2002.1183764;10.1109/TVCG.2007.70573;10.1109/VISUAL.2003.1250384;10.1109/TVCG.2009.164,"Interactive volume rendering, GPU-based ray-casting, Advanced illumination",25,19,44,
VAST,2012,Examining the Use of a Visual Analytics System for Sensemaking Tasks: Case Studies with Domain Experts,10.1109/TVCG.2012.224,http://dx.doi.org/10.1109/TVCG.2012.224,2869,2878,J,"While the formal evaluation of systems in visual analytics is still relatively uncommon, particularly rare are case studies of prolonged system use by domain analysts working with their own data. Conducting case studies can be challenging, but it can be a particularly effective way to examine whether visual analytics systems are truly helping expert users to accomplish their goals. We studied the use of a visual analytics system for sensemaking tasks on documents by six analysts from a variety of domains. We describe their application of the system along with the benefits, issues, and problems that we uncovered. Findings from the studies identify features that visual analytics systems should emphasize as well as missing capabilities that should be addressed. These findings inform design implications for future systems.",Youn ah Kang;John T. Stasko,Youn-ah Kang;John Stasko,Google Inc.;Georgia Institute of Technology,10.1109/VAST.2008.4677362;10.1109/VAST.2006.261416;10.1109/INFVIS.2004.5;10.1109/VAST.2011.6102438;10.1109/VAST.2012.6400559;10.1109/VAST.2007.4389006;10.1109/VAST.2009.5333878,"Visual analytics, case study, qualitative evaluation",25,22,42,
VAST,2012,Visual pattern discovery using random projections,10.1109/VAST.2012.6400490,http://dx.doi.org/10.1109/VAST.2012.6400490,43,52,C,"An essential element of exploratory data analysis is the use of revealing low-dimensional projections of high-dimensional data. Projection Pursuit has been an effective method for finding interesting low-dimensional projections of multidimensional spaces by optimizing a score function called a projection pursuit index. However, the technique is not scalable to high-dimensional spaces. Here, we introduce a novel method for discovering noteworthy views of high-dimensional data spaces by using binning and random projections. We define score functions, akin to projection pursuit indices, that characterize visual patterns of the low-dimensional projections that constitute feature subspaces. We also describe an analytic, multivariate visualization platform based on this algorithm that is scalable to extremely large problems.",Anushka Anand;Leland Wilkinson;Tommy Dang,Anushka Anand;Leland Wilkinson;Tuan Nhon Dang,"Department of Computer Science, University of Illinois at Chicago;Department of Computer Science, University of Illinois at Chicago;Department of Computer Science, University of Illinois at Chicago",10.1109/VAST.2010.5652433;10.1109/TVCG.2011.178;10.1109/VAST.2011.6102437;10.1109/VAST.2007.4389006;10.1109/VAST.2010.5652392;10.1109/INFVIS.2005.1532142;10.1109/VAST.2009.5332629,"Random Projections, High-dimensional Data",25,16,49,
SciVis,2013,Ambient Volume Scattering,10.1109/TVCG.2013.129,http://dx.doi.org/10.1109/TVCG.2013.129,2936,2945,J,"We present ambient scattering as a preintegration method for scattering on mesoscopic scales in direct volume rendering. Far-range scattering effects usually provide negligible contributions to a given location due to the exponential attenuation with increasing distance. This motivates our approach to preintegrating multiple scattering within a finite spherical region around any given sample point. To this end, we solve the full light transport with a Monte-Carlo simulation within a set of spherical regions, where each region may have different material parameters regarding anisotropy and extinction. This precomputation is independent of the data set and the transfer function, and results in a small preintegration table. During rendering, the look-up table is accessed for each ray sample point with respect to the viewing direction, phase function, and material properties in the spherical neighborhood of the sample. Our rendering technique is efficient and versatile because it readily fits in existing ray marching algorithms and can be combined with local illumination and volumetric ambient occlusion. It provides interactive volumetric scattering and soft shadows, with interactive control of the transfer function, anisotropy parameter of the phase function, lighting conditions, and viewpoint. A GPU implementation demonstrates the benefits of ambient scattering for the visualization of different types of data sets, with respect to spatial perception, high-quality illumination, translucency, and rendering speed.",Marco Ament;Filip Sadlo;Daniel Weiskopf,Marco Ament;Filip Sadlo;Daniel Weiskopf,"VISUS, University of Stuttgart;VISUS, University of Stuttgart;VISUS, University of Stuttgart",10.1109/TVCG.2011.211;10.1109/TVCG.2007.70555;10.1109/VISUAL.2003.1250394;10.1109/VISUAL.2000.885683;10.1109/TVCG.2010.187;10.1109/VISUAL.2004.64;10.1109/VISUAL.2003.1250406;10.1109/TVCG.2010.145;10.1109/TVCG.2012.232;10.1109/TVCG.2011.161;10.1109/TVCG.2011.198;10.1109/VISUAL.2002.1183764;10.1109/VISUAL.2005.1532803;10.1109/TVCG.2009.204,"Direct volume rendering, volume illumination, ambient scattering, preintegrated light transport, gradient-free shading",25,20,50,HM
VAST,2013,Semantics of Directly Manipulating Spatializations,10.1109/TVCG.2013.188,http://dx.doi.org/10.1109/TVCG.2013.188,2052,2059,J,"When high-dimensional data is visualized in a 2D plane by using parametric projection algorithms, users may wish to manipulate the layout of the data points to better reflect their domain knowledge or to explore alternative structures. However, few users are well-versed in the algorithms behind the visualizations, making parameter tweaking more of a guessing game than a series of decisive interactions. Translating user interactions into algorithmic input is a key component of Visual to Parametric Interaction (V2PI) [13]. Instead of adjusting parameters, users directly move data points on the screen, which then updates the underlying statistical model. However, we have found that some data points that are not moved by the user are just as important in the interactions as the data points that are moved. Users frequently move some data points with respect to some other 'unmoved' data points that they consider as spatially contextual. However, in current V2PI interactions, these points are not explicitly identified when directly manipulating the moved points. We design a richer set of interactions that makes this context more explicit, and a new algorithm and sophisticated weighting scheme that incorporates the importance of these unmoved data points into V2PI.",Xinran Hu;Lauren Bradel;Dipayan Maiti;Leanna House;Chris North 0001;Scotland Leman,Xinran Hu;Lauren Bradel;Dipayan Maiti;Leanna House;Chris North;Scotland Leman,Virginia Tech;Virginia Tech;Virginia Tech;Virginia Tech;Virginia Tech;Virginia Tech,10.1109/VAST.2011.6102449;10.1109/INFVIS.1995.528686;10.1109/TVCG.2012.260;10.1109/VAST.2012.6400486;10.1109/VAST.2008.4677358,"Visual to parametric interaction, visual analytics, statistical models",25,23,23,
InfoVis,2014,Exploring the Placement and Design of Word-Scale Visualizations,10.1109/TVCG.2014.2346435,http://dx.doi.org/10.1109/TVCG.2014.2346435,2291,2300,J,"We present an exploration and a design space that characterize the usage and placement of word-scale visualizations within text documents. Word-scale visualizations are a more general version of sparklines-small, word-sized data graphics that allow meta-information to be visually presented in-line with document text. In accordance with Edward Tufte's definition, sparklines are traditionally placed directly before or after words in the text. We describe alternative placements that permit a wider range of word-scale graphics and more flexible integration with text layouts. These alternative placements include positioning visualizations between lines, within additional vertical and horizontal space in the document, and as interactive overlays on top of the text. Each strategy changes the dimensions of the space available to display the visualizations, as well as the degree to which the text must be adjusted or reflowed to accommodate them. We provide an illustrated design space of placement options for word-scale visualizations and identify six important variables that control the placement of the graphics and the level of disruption of the source text. We also contribute a quantitative analysis that highlights the effect of different placements on readability and text disruption. Finally, we use this analysis to propose guidelines to support the design and placement of word-scale visualizations.",Pascal Goffin;Wesley Willett;Jean-Daniel Fekete;Petra Isenberg,Pascal Goffin;Wesley Willett;Jean-Daniel Fekete;Petra Isenberg,Inria;Inria;Inria;Inria,10.1109/TVCG.2013.192;10.1109/TVCG.2006.163;10.1109/TVCG.2012.196;10.1109/TVCG.2011.185;10.1109/TVCG.2007.70589;10.1109/TVCG.2011.183;10.1109/TVCG.2013.120;10.1109/TVCG.2010.194;10.1109/INFVIS.2005.1532144,"Information visualization, text visualization, sparklines, glyphs, design space, word-scale visualizations",25,22,34,
InfoVis,2015,Visualizing Multiple Variables Across Scale and Geography,10.1109/TVCG.2015.2467199,http://dx.doi.org/10.1109/TVCG.2015.2467199,599,608,J,"Comparing multiple variables to select those that effectively characterize complex entities is important in a wide variety of domains - geodemographics for example. Identifying variables that correlate is a common practice to remove redundancy, but correlation varies across space, with scale and over time, and the frequently used global statistics hide potentially important differentiating local variation. For more comprehensive and robust insights into multivariate relations, these local correlations need to be assessed through various means of defining locality. We explore the geography of this issue, and use novel interactive visualization to identify interdependencies in multivariate data sets to support geographically informed multivariate analysis. We offer terminology for considering scale and locality, visual techniques for establishing the effects of scale on correlation and a theoretical framework through which variation in geographic correlation with scale and locality are addressed explicitly. Prototype software demonstrates how these contributions act together. These techniques enable multiple variables and their geographic characteristics to be considered concurrently as we extend visual parameter space analysis (vPSA) to the spatial domain. We find variable correlations to be sensitive to scale and geography to varying degrees in the context of energy-based geodemographics. This sensitivity depends upon the calculation of locality as well as the geographical and statistical structure of the variable.",Sarah Goodwin;Jason Dykes;Aidan Slingsby;Cagatay Turkay,Sarah Goodwin;Jason Dykes;Aidan Slingsby;Cagatay Turkay,"Monash University;the giCentre, City University London;the giCentre, City University London;the giCentre, City University London",10.1109/TVCG.2007.70558;10.1109/TVCG.2013.145;10.1109/TVCG.2007.70539;10.1109/TVCG.2014.2346482;10.1109/VAST.2011.6102448;10.1109/TVCG.2013.125;10.1109/TVCG.2014.2346321;10.1109/TVCG.2009.128;10.1109/TVCG.2011.197;10.1109/TVCG.2012.256;10.1109/TVCG.2014.2346265,"Scale, Geography, Multivariate, Sensitivity Analysis, Variable Selection, Local Statistics, Geodemographics, Energy",25,25,51,
VAST,2015,Task-Driven Comparison of Topic Models,10.1109/TVCG.2015.2467618,http://dx.doi.org/10.1109/TVCG.2015.2467618,320,329,J,"Topic modeling, a method of statistically extracting thematic content from a large collection of texts, is used for a wide variety of tasks within text analysis. Though there are a growing number of tools and techniques for exploring single models, comparisons between models are generally reduced to a small set of numerical metrics. These metrics may or may not reflect a model's performance on the analyst's intended task, and can therefore be insufficient to diagnose what causes differences between models. In this paper, we explore task-centric topic model comparison, considering how we can both provide detail for a more nuanced understanding of differences and address the wealth of tasks for which topic models are used. We derive comparison tasks from single-model uses of topic models, which predominantly fall into the categories of understanding topics, understanding similarity, and understanding change. Finally, we provide several visualization techniques that facilitate these tasks, including buddy plots, which combine color and position encodings to allow analysts to readily view changes in document similarity.",Eric C. Alexander;Michael Gleicher,Eric Alexander;Michael Gleicher,University of Wisconsin-Madison;University of Wisconsin-Madison,10.1109/TVCG.2011.232;10.1109/VAST.2014.7042493;10.1109/TVCG.2013.212;10.1109/TVCG.2011.239;10.1109/TVCG.2012.260;10.1109/INFVIS.2000.885098;10.1109/TVCG.2014.2346578;10.1109/TVCG.2013.221,"Text visualization, topic modeling",25,25,36,
InfoVis,2016,Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization,10.1109/TVCG.2016.2598958,http://dx.doi.org/10.1109/TVCG.2016.2598958,541,550,J,"In this paper, we investigate Confluent Drawings (CD), a technique for bundling edges in node-link diagrams based on network connectivity. Edge-bundling techniques are designed to reduce edge clutter in node-link diagrams by coalescing lines into common paths or bundles. Unfortunately, traditional bundling techniques introduce ambiguity since edges are only bundled by spatial proximity, rather than network connectivity; following an edge from its source to its target can lead to the perception of incorrect connectivity if edges are not clearly separated within the bundles. Contrary, CDs bundle edges based on common sources or targets. Thus, a smooth path along a confluent bundle indicates precise connectivity. While CDs have been described in theory, practical investigation and application to real-world networks (i.e., networks beyond those with certain planarity restrictions) is currently lacking. Here, we provide the first algorithm for constructing CDs from arbitrary directed and undirected networks and present a simple layout method, embedded in a sand box environment providing techniques for interactive exploration. We then investigate patterns and artifacts in CDs, which we compare to other common edge-bundling techniques. Finally, we present the first user study that compares edge-compression techniques, including CD, power graphs, metro-style, and common edge bundling. We found that users without particular expertise in visualization or network analysis are able to read small CDs without difficulty. Compared to existing bundling techniques, CDs are more likely to allow people to correctly perceive connectivity.",Benjamin Bach;Nathalie Henry Riche;Christophe Hurter;Kim Marriott;Tim Dwyer,Benjamin Bach;Nathalie Henry Riche;Christophe Hurter;Kim Marriott;Tim Dwyer,"Microsoft Research-Inria Joint Centre, France;Microsoft Research, WA, USA;ENAC, Toulouse, France;Monash University, Melbourne, Australia;Monash University, Melbourne, Australia",10.1109/TVCG.2006.120;10.1109/TVCG.2006.147;10.1109/TVCG.2011.233;10.1109/TVCG.2011.190;10.1109/INFVIS.2003.1249008;10.1109/TVCG.2012.208;10.1109/TVCG.2006.160;10.1109/TVCG.2013.151;10.1109/INFVIS.2005.1532150,bundling;Network visualization;edge compression;confluent;power graph,25,28,45,
Vis,1991,Achieving direct volume visualization with interactive semantic region selection,10.1109/VISUAL.1991.175778,http://dx.doi.org/10.1109/VISUAL.1991.175778,58,"65, 410",C,"The authors have achieved rates as high as 15 frames per second for interactive direct visualization of 3D data by trading some function for speed, while volume rendering with a full complement of ramp classification capabilities is performed at 1.4 frames per second. These speeds have made the combination of region selection with volume rendering practical for the first time. Semantic-driven selection, rather than geometric clipping, has proved to be a natural means of interacting with 3D data. Internal organs in medical data or other regions of interest can be built from preprocessed region primitives. The resulting combined system has been applied to real 3D medical data with encouraging results.&lt;&lt;ETX&gt;&gt;",Terry S. Yoo;Ulrich Neumann;Henry Fuchs;Stephen M. Pizer;Tim J. Cullip;John Rhoades;Ross T. Whitaker,T.S. Yoo;U. Neumann;H. Fuchs;S.M. Pizer;T. Cullip;J. Rhoades;R. Whitaker,"North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA",,,24,10,13,
Vis,1993,Computer visualization of long genomic sequences,10.1109/VISUAL.1993.398883,http://dx.doi.org/10.1109/VISUAL.1993.398883,308,315,C,"Human beings find it difficult to analyze local and global oligonucleotide patterns in the linear primary sequences of a genome. In this paper, we present a family of iterated function systems (IFS) that can be used to generate a set of visual models of a DNA sequence. A new visualization function, the W-curve, that is derived from this IFS family is introduced. Using W-curves, a user can readily compare subsequences within a long genomic sequence - or between genomic sequences - and can visually evaluate the effect of local variations (mutations) upon the global genomic information content.&lt;&lt;ETX&gt;&gt;",Dachywan Wu;James Robergé;Douglas J. Cork;Bao Gia Nguyen;Thom Grace,D. Wu;J. Roberge;D.J. Cork;B.G. Nguyen;T. Grace,"Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA;Illinois Inst. of Technol., Chicago, IL, USA",,,24,10,14,
InfoVis,1996,Towards rich information landscapes for visualising structured Web spaces,10.1109/INFVIS.1996.559218,http://dx.doi.org/10.1109/INFVIS.1996.559218,62,"63, 121",M,"The Harmony browser for the Hyper-G Web server utilises Hyper-G's rich data model to provide a number of tightly-coupled, two- and three-dimensional visualisation and navigational facilities. In particular the Harmony Information Landscape visualises the hierarchical structure of Hyper-G spaces upon a plane in three-dimensional space. The Harmony Information Landscape has now been extended to display a combined structure and link map by selectively superimposing hyperlink relationships in the vertical dimension above and below the hierarchy map. In addition, documents returned by search queries may be selectively ""plotted"" in the landscape, indicating their whereabouts in a broader context, and several sets of 3D icons are available for representing the various document types.",Keith Andrews;Michael Pichler;Peter Wolf,K. Andrews;M. Pichler;P. Wolf,"Inst. for Inf. & Comput. Supported New Media, Graz Univ. of Technol., Austria",,,24,6,6,
InfoVis,1996,Dual multiresolution HyperSlice for multivariate data visualization,10.1109/INFVIS.1996.559224,http://dx.doi.org/10.1109/INFVIS.1996.559224,74,"75, 127",M,We present a new multiresolution visualization design which allows a user to control the physical data resolution as well as the logical display resolution of multivariate data. A system prototype is described which uses the HyperSlice representation. The notion of space projection in multivariate data is introduced. This process is coupled with wavelets to form a powerful tool for very large data visualization.,Pak Chung Wong;Andrew H. Crabb;R. Daniel Bergeron,Pak Chung Wong;A.H. Crabb;R.D. Bergeron,"Dept. of Comput. Sci., New Hampshire Univ., Durham, NH, USA",,,24,6,5,
InfoVis,1999,Aggregate Towers: scale sensitive visualization and decluttering of geospatial data,10.1109/INFVIS.1999.801863,http://dx.doi.org/10.1109/INFVIS.1999.801863,92,"99, 149",C,"We have developed a technique, Aggregate Towers, that allows geospatial data to be visualized across a range of map scales. We use a combination of data aggregation algorithms and dynamically aggregating data markers (e.g., icons or symbols) to accommodate interactive zooming by a user while maintaining a representation that remains intuitive, consistent across multiple scales and uncluttered. This approach implicitly generates multiple levels of overview displays from a single set of underlying data.",James K. Rayson,J.K. Rayson,"Mitre Corp., Bedford, MA, USA",10.1109/VISUAL.1998.745301;10.1109/INFVIS.1995.528684,"data visualization, information visualization, aggregation, zoom, cartography",24,7,17,
Vis,1999,Forward image mapping,10.1109/VISUAL.1999.809872,http://dx.doi.org/10.1109/VISUAL.1999.809872,89,514,C,"We present a novel forward image mapping algorithm, which speeds up perspective warping, as in texture mapping. It processes the source image in a special scanline order instead of the normal raster scanline order. This special scanline has the property of preserving parallelism when projecting to the target image. The algorithm reduces the complexity of perspective-correct image warping by eliminating the division per pixel and replacing it with a division per scanline. The method also corrects the perspective distortion in Gouraud shading with negligible overhead. Furthermore, the special scanline order is suitable for antialiasing using a more accurate antialiasing conic filter, with minimum additional cost. The algorithm is highlighted by incremental calculations and optimized memory bandwidth by reading each source pixel only once, suggesting a potential hardware implementation.",Baoquan Chen;Frank Dachille;Arie E. Kaufman,Baoquan Chen;F. Dachille;A. Kaufman,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",,"image warping, forward mapping, texture mapping, antialiasing, anisotropic filtering, Gouraud shading, hardware",24,6,17,
Vis,2000,Constructing material interfaces from data sets with volume-fraction information,10.1109/VISUAL.2000.885717,http://dx.doi.org/10.1109/VISUAL.2000.885717,367,372,C,"We present a new algorithm for material boundary interface reconstruction from data sets containing volume fractions. We transform the reconstruction problem to a problem that analyzes the dual data set, where each vertex in the dual mesh has an associated barycentric coordinate tuple that represents the fraction of each material present. After constructing the dual tetrahedral mesh from the original mesh, we construct material boundaries by mapping a tetrahedron into barycentric space and calculating the intersections with Voronoi cells in barycentric space. These intersections are mapped back to the original physical space and triangulated to form the boundary surface approximation. This algorithm can be applied to any grid structure and can treat any number of materials per element/vertex.",Kathleen S. Bonnell;Kenneth I. Joy;Bernd Hamann;Daniel Schikore;Mark A. Duchaineau,K.S. Bonnell;D.R. Schikore;K.I. Joy;M. Duchaineau;B. Hamann,"CIPIC, California Univ., Davis, CA, USA",10.1109/VISUAL.1991.175782;10.1109/VISUAL.1997.663887;10.1109/VISUAL.1997.663869,"Eulerian flow, material boundary surface, barycentric coordinates, volume fraction, Voronoi diagram",24,9,11,
InfoVis,2001,Case study: design and assessment of an enhanced geographic information system for exploration of multivariate health statistics,10.1109/INFVIS.2001.963294,http://dx.doi.org/10.1109/INFVIS.2001.963294,159,162,C,,Robert M. Edsall;Alan M. MacEachren;Linda Pickle,R.M. Edsall;A.M. MacEachren;L. Pickle,Arizona State University,10.1109/INFVIS.1998.729563,,24,9,5,
Vis,2001,Simplicial subdivisions and sampling artifacts,10.1109/VISUAL.2001.964499,http://dx.doi.org/10.1109/VISUAL.2001.964499,99,106,C,"We review several schemes for dividing cubical cells into simplices (tetrahedra) in 3-D for interpolating from sampled data to R/sup 3/ or for computing isosurfaces by barycentric interpolation. We present test data that reveal the geometric artifacts that these subdivision schemes generate, and discuss how these artifacts relate to the filter kernels that correspond to the subdivision schemes.",Hamish A. Carr;Torsten Möller;Jack Snoeyink,H. Carr;T. Moller;J. Snoeyink,"Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada",10.1109/VISUAL.1997.663887;10.1109/VISUAL.1996.568103;10.1109/VISUAL.1991.175782;10.1109/VISUAL.1997.663869;10.1109/VISUAL.1997.663885;10.1109/VISUAL.1997.663886,,24,11,27,
Vis,2001,The perspective shear-warp algorithm in a virtual environment,10.1109/VISUAL.2001.964513,http://dx.doi.org/10.1109/VISUAL.2001.964513,207,213,C,"Since the original paper of Lacroute and Levoy (1994), where the shear-warp factorization was also shown for perspective projections, a lot of work has been carried out using the shear-warp factorization with parallel projections. However, none of it has proved or improved the algorithm for the perspective projection. Also in Lacroute's Volpack library, the perspective shear-warp volume rendering algorithm is missing. This paper reports on an implementation of the perspective shear-warp algorithm, which includes enhancements for its application in immersive virtual environments. Furthermore, a mathematical proof for the correctness of the permutation of projection and warp is provided, so far a basic assumption of the shear-warp perspective projection.",Jürgen P. Schulze;Roland Niemeier;Ulrich Lang,R.P. Schulze;R. Niemeier;U. Lang,"High Performance Comput. Centre, Stuttgart, Germany",10.1109/VISUAL.1996.567603;10.1109/VISUAL.1999.809872,"Volume Rendering, Perspective Shear-Warp, Virtual Environments",24,8,16,
Vis,2001,RTVR-a flexible Java library for interactive volume rendering,10.1109/VISUAL.2001.964522,http://dx.doi.org/10.1109/VISUAL.2001.964522,279,286,C,"This paper presents several distinguishing design features of RTVR-a Java-based library for real-time volume rendering. We describe, how the careful design of data structures, which in our case are based on voxel enumeration, and an intelligent use of lookup tables enable interactive volume rendering even on low-end PC hardware. By assigning voxels to distinct objects within the volume and by using an individual setup and combination of look-up tables for each object, object-aware rendering is performed: different transfer functions, shading models, and also compositing modes can be mixed within a single scene to depict each object in the most appropriate way, while still providing rendering results in real-time. While providing frame rates similar to volume visualization using 3D consumer hardware, the approach utilized by RTVR offers much more flexibility and extensibility due to its pure software nature. Furthermore, due to the memory-efficiency of the data representation and the implementation in Java, RTVR can be used to provide volume viewing facilities over low-bandwidth networks, with almost full control over rendering and visualization mapping parameters (clipping, shading, compositing, transfer function) for the user. This paper also addresses specific problems which arise by the use of Java for interactive visualization.",Lukas Mroz;Helwig Hauser,L. Mroz;H. Hauser,"VRVis Research Center, Vienna, Austria;VRVis Research Center, Vienna, Austria",10.1109/VISUAL.2000.885726;10.1109/VISUAL.1998.745311;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2000.885729;10.1109/VISUAL.1994.346340;10.1109/VISUAL.1999.809878;10.1109/VISUAL.2000.885697,"interactive volume visualization,Internet-based visualization, Java",24,5,23,
Vis,2001,4D space-time techniques: a medical imaging case study,10.1109/VISUAL.2001.964554,http://dx.doi.org/10.1109/VISUAL.2001.964554,473,476,C,"We present the problem of visualizing time-varying medical data. Two medical imaging modalities are compared-MRI and dynamic SPECT. For each modality, we examine several derived scalar and vector quantities such as the change in intensity over time, the spatial gradient, and the change of the gradient over time. We compare several methods for presenting the data, including isosurfaces, direct volume rendering, and vector visualization using glyphs. These techniques may provide more information and context than methods currently used in practice; thus it is easier to discover temporal changes and abnormalities in a data set.",Melanie Tory;Niklas Röber;Torsten Möller;Anna Celler;M. Stella Atkins,M. Tory;N. Rober;T. Moller;A. Celler;M.S. Atkins,"Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada",10.1109/VISUAL.1993.398877;10.1109/VISUAL.1998.745294;10.1109/VISUAL.1999.809886,"health, display algorithms, animations, 4D visualization, MRI, dynamic SPECT, direct volume rendering, isosurface, glyph",24,8,20,
Vis,2002,Fast and reliable space leaping for interactive volume rendering,10.1109/VISUAL.2002.1183775,http://dx.doi.org/10.1109/VISUAL.2002.1183775,195,202,C,"We present a fast and reliable space-leaping scheme to accelerate ray casting during interactive navigation in a complex volumetric scene, where we combine innovative space-leaping techniques in a number of ways. First, we derive most of the pixel depths at the current frame by exploiting the temporal coherence during navigation, where we employ a novel fast cell-based reprojection scheme that is more reliable than the traditional intersection-point based reprojection. Next, we exploit the object space coherence to quickly detect the remaining pixel depths, by using a precomputed accurate distance field that stores the Euclidean distance from each empty (background) voxel toward its nearest object boundary. In addition, we propose an effective solution to the challenging new-incoming-objects problem during navigation. Our algorithm has been implemented on a 16-processor SGI Power Challenge and reached interactive rendering rates at more than 10 Hz during the navigation inside 512/sup 3/ volume data sets acquired from both a simulation phantom and actual patients.",Ming Wan;Aamir Sadiq;Arie E. Kaufman,Ming Wan;A. Sadiq;A. Kaufman,"Boeing Co., Seattle, WA, USA",,"virtual navigation, volume visualization, ray-casting optimization, space leaping",24,2,29,
Vis,2003,LightKit: a lighting system for effective visualization,10.1109/VISUAL.2003.1250395,http://dx.doi.org/10.1109/VISUAL.2003.1250395,363,370,C,"LightKit is a system for lighting three-dimensional synthetic scenes. LightKit simplifies the task of producing visually pleasing, easily interpretable images for visualization while making it harder to produce results where the scene illumination distracts from the visualization process. LightKit is based on lighting designs developed by artists and photographers and shown in previous studies to enhance shape perception. A key light provides natural overhead illumination of the scene, augmented by fill, head, and back lights. By default, lights are attached to a normalized, subject-centric, camera-relative coordinate frame to ensure consistent lighting independent of camera location or orientation. This system allows all lights to be positioned by specifying just six parameters. The intensity of each light is specified as a ratio to the key light intensity, allowing the scene's brightness to be adjusted using a single parameter. The color of each light is specified by a single normalized color parameter called warmth that is based on color temperature of natural sources. LightKit's default values for light position, intensity, and color are chosen to produce good results for a variety of scenes. LightKit is designed to work with both hardware graphics systems and, potentially, higher quality off-line rendering systems. We provide examples of images created using a LightKit implementation within the VTK visualization toolkit software framework.",Michael Halle;Jeanette C. Meng,M. Halle;J. Meng,"Harvard Med. Sch., Harvard Univ., USA;Harvard Med. Sch., Harvard Univ., USA",10.1109/VISUAL.2002.1183785,"Visualization, lighting design, light color",24,15,19,
Vis,2005,On the optimization of visualizations of complex phenomena,10.1109/VISUAL.2005.1532782,http://dx.doi.org/10.1109/VISUAL.2005.1532782,87,94,C,"The problem of perceptually optimizing complex visualizations is a difficult one, involving perceptual as well as aesthetic issues. In our experience, controlled experiments are quite limited in their ability to uncover interrelationships among visualization parameters, and thus may not be the most useful way to develop rules-of-thumb or theory to guide the production of high-quality visualizations. In this paper, we propose a new experimental approach to optimizing visualization quality that integrates some of the strong points of controlled experiments with methods more suited to investigating complex highly-coupled phenomena. We use human-in-the-loop experiments to search through visualization parameter space, generating large databases of rated visualization solutions. This is followed by data mining to extract results such as exemplar visualizations, guidelines for producing visualizations, and hypotheses about strategies leading to strong visualizations. The approach can easily address both perceptual and aesthetic concerns, and can handle complex parameter interactions. We suggest a genetic algorithm as a valuable way of guiding the human-in-the-loop search through visualization parameter space. We describe our methods for using clustering, histogramming, principal component analysis, and neural networks for data mining. The experimental approach is illustrated with a study of the problem of optimal texturing for viewing layered surfaces so that both surfaces are maximally observable.",Donald H. House;Alethea Bair;Colin Ware,D. House;A. Bair;C. Ware,"Texas A&M Univ., College Station, TX, USA;Texas A&M Univ., College Station, TX, USA",10.1109/VISUAL.1996.568113;10.1109/VISUAL.1996.567784,"perception, visualization evaluation,layered surfaces, genetic algorithm, data mining, principal component analysis, neural networks",24,6,30,
Vis,2006,Comparative Visualization for Wave-based and Geometric Acoustics,10.1109/TVCG.2006.125,http://dx.doi.org/10.1109/TVCG.2006.125,1173,1180,J,"We present a comparative visualization of the acoustic simulation results obtained by two different approaches that were combined into a single simulation algorithm. The first method solves the wave equation on a volume grid based on finite elements. The second method, phonon tracing, is a geometric approach that we have previously developed for interactive simulation, visualization and modeling of room acoustics. Geometric approaches of this kind are more efficient than FEM in the high and medium frequency range. For low frequencies they fail to represent diffraction, which on the other hand can be simulated properly by means of FEM. When combining both methods we need to calibrate them properly and estimate in which frequency range they provide comparable results. For this purpose we use an acoustic metric called gain and display the resulting error. Furthermore we visualize interference patterns, since these depend not only on diffraction, but also exhibit phase-dependent amplification and neutralization effects",Eduard Deines;Martin Hering-Bertram;Jan Mohring;Jevgenijs Jegorovs;Frank Michel 0001;Hans Hagen;Gregory M. Nielson,Eduard Deines;Martin Bertram;Jan Mohring;Jevgenij Jegorovs;Frank Michel;Hans Hagen;Gregory M. Nielson,,10.1109/VISUAL.2005.1532790,"Acoustic simulation, comparative visualization, ray tracing, finite element method, phonon map",24,16,22,
Vis,2007,Visualization of Cosmological Particle-Based Datasets,10.1109/TVCG.2007.70526,http://dx.doi.org/10.1109/TVCG.2007.70526,1712,1718,J,"We describe our visualization process for a particle-based simulation of the formation of the first stars and their impact on cosmic history. The dataset consists of several hundred time-steps of point simulation data, with each time-step containing approximately two million point particles. For each time-step, we interpolate the point data onto a regular grid using a method taken from the radiance estimate of photon mapping [21]. We import the resulting regular grid representation into ParaView [24], with which we extract isosurfaces across multiple variables. Our images provide insights into the evolution of the early universe, tracing the cosmic transition from an initially homogeneous state to one of increasing complexity. Specifically, our visualizations capture the build-up of regions of ionized gas around the first stars, their evolution, and their complex interactions with the surrounding matter. These observations will guide the upcoming James Webb Space Telescope, the key astronomy mission of the next decade.",Paul A. Navrátil;Jarrett Johnson;Volker Bromm,Paul Navratil;Jarrett Johnson;Volker Bromm,Texas Advanced Computing Center at the University of Texas at Austin;Department of Astronomy at the University of Texas at Austin;Department of Astronomy at the University of Texas at Austin,10.1109/VISUAL.2004.52;10.1109/VISUAL.2004.29,"Interpolation, Isosurface, Astronomy, Cosmology",24,20,41,
VAST,2008,Model-driven Visual Analytics,10.1109/VAST.2008.4677352,http://dx.doi.org/10.1109/VAST.2008.4677352,19,26,C,"We describe a visual analytics (VA) infrastructure, rooted on techniques in machine learning and logic-based deductive reasoning that will assist analysts to make sense of large, complex data sets by facilitating the generation and validation of models representing relationships in the data. We use logic programming (LP) as the underlying computing machinery to encode the relations as rules and facts and compute with them. A unique aspect of our approach is that the LP rules are automatically learned, using Inductive Logic Programming, from examples of data that the analyst deems interesting when viewing the data in the high-dimensional visualization interface. Using this system, analysts will be able to construct models of arbitrary relationships in the data, explore the data for scenarios that fit the model, refine the model if necessary, and query the model to automatically analyze incoming (future) data exhibiting the encoded relationships. In other words it will support both model-driven data exploration, as well as data-driven model evolution. More importantly, by basing the construction of models on techniques from machine learning and logic-based deduction, the VA process will be both flexible in terms of modeling arbitrary, user-driven relationships in the data as well as readily scale across different data domains.",Supriya Garg;Julia Eunju Nam;I. V. Ramakrishnan;Klaus Mueller,Supriya Garg;Julia Eunju Nam;I.V. Ramakrishnan;Klaus Mueller,"Computer Science Department, Stony Brook University, USA;Computer Science Department, Stony Brook University, USA;Computer Science Department, Stony Brook University, USA;Computer Science Department, Stony Brook University, USA",10.1109/VAST.2006.261437;10.1109/VAST.2007.4388999;10.1109/VAST.2007.4388998;10.1109/VAST.2007.4389003;10.1109/VAST.2007.4389000;10.1109/VAST.2006.261425;10.1109/VAST.2006.261436;10.1109/VAST.2007.4388992;10.1109/TVCG.2007.70581;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1990.146386,"Visual Analytics, Knowledge Discovery, Visual Clustering, Machine Learning, Grand Tour, High-dimensional Data, Network Security",24,20,27,
Vis,2008,Effective visualization of complex vascular structures using a non-parametric vessel detection method,10.1109/TVCG.2008.123,http://dx.doi.org/10.1109/TVCG.2008.123,1603,1610,J,"The effective visualization of vascular structures is critical for diagnosis, surgical planning as well as treatment evaluation. In recent work, we have developed an algorithm for vessel detection that examines the intensity profile around each voxel in an angiographic image and determines the likelihood that any given voxel belongs to a vessel; we term this the ""vesselness coefficient"" of the voxel. Our results show that our algorithm works particularly well for visualizing branch points in vessels. Compared to standard Hessian based techniques, which are fine-tuned to identify long cylindrical structures, our technique identifies branches and connections with other vessels. Using our computed vesselness coefficient, we explore a set of techniques for visualizing vasculature. Visualizing vessels is particularly challenging because not only is their position in space important for clinicians but it is also important to be able to resolve their spatial relationship. We applied visualization techniques that provide shape cues as well as depth cues to allow the viewer to differentiate between vessels that are closer from those that are farther. We use our computed vesselness coefficient to effectively visualize vasculature in both clinical neurovascular x-ray computed tomography based angiography images, as well as images from three different animal studies. We conducted a formal user evaluation of our visualization techniques with the help of radiologists, surgeons, and other expert users. Results indicate that experts preferred distance color blending and tone shading for conveying depth over standard visualization techniques.",Alark Joshi;Xiaoning Qian;Donald P. Dione;Ketan R. Bulsara;Christopher K. Breuer;Albert J. Sinusas;Xenophon Papademetris,Alark Joshi;Xiaoning Qian;Donald Dione;Ketan Bulsara;Christopher Breuer;Albert Sinusas;Xenophon Papademetris,Yale University;Yale University;Yale University;Yale University;Yale University;Yale University;Yale University,10.1109/TVCG.2006.172;10.1109/VISUAL.2000.885694;10.1109/TVCG.2007.70555;10.1109/VISUAL.2003.1250353,"Vessel identification, Vessel visualization, Evaluation of visualization techniques",24,21,17,
InfoVis,2009,Visualizing Social Photos on a Hasse Diagram for Eliciting Relations and Indexing New Photos,10.1109/TVCG.2009.201,http://dx.doi.org/10.1109/TVCG.2009.201,985,992,J,"Social photos, which are taken during family events or parties, represent individuals or groups of people. We show in this paper how a Hasse diagram is an efficient visualization strategy for eliciting different groups and navigating through them. However, we do not limit this strategy to these traditional uses. Instead we show how it can also be used for assisting in indexing new photos. Indexing consists of identifying the event and people in photos. It is an integral phase that takes place before searching and sharing. In our method we use existing indexed photos to index new photos. This is performed through a manual drag and drop procedure followed by a content fusion process that we call 'propagation'. At the core of this process is the necessity to organize and visualize the photos that will be used for indexing in a manner that is easily recognizable and accessible by the user. In this respect we make use of an object Galois sub-hierarchy and display it using a Hasse diagram. The need for an incremental display that maintains the user's mental map also leads us to propose a novel way of building the Hasse diagram. To validate the approach, we present some tests conducted with a sample of users that confirm the interest of this organization, visualization and indexation approach. Finally, we conclude by considering scalability, the possibility to extract social networks and automatically create personalised albums.",Michel Crampes;Jeremy de Oliveira-Kumar;Sylvie Ranwez;Jean Villerd,Michel Crampes;Jeremy de Oliveira-Kumar;Sylvie Ranwez;Jean Villerd,LGI2P/EMA Research Center;UNSW;LGI2P/EMA Research Center;LGI2P/EMA Research Center,,"Information visualization, Hasse Diagram, indexation, social photos, formal concept analysis, Galois sub-hierarchy",24,15,26,
InfoVis,2010,behaviorism: a framework for dynamic data visualization,10.1109/TVCG.2010.126,http://dx.doi.org/10.1109/TVCG.2010.126,1164,1171,J,"While a number of information visualization software frameworks exist, creating new visualizations, especially those that involve novel visualization metaphors, interaction techniques, data analysis strategies, and specialized rendering algorithms, is still often a difficult process. To facilitate the creation of novel visualizations we present a new software framework, behaviorism, which provides a wide range of flexibility when working with dynamic information on visual, temporal, and ontological levels, but at the same time providing appropriate abstractions which allow developers to create prototypes quickly which can then easily be turned into robust systems. The core of the framework is a set of three interconnected graphs, each with associated operators: a scene graph for high-performance 3D rendering, a data graph for different layers of semantically-linked heterogeneous data, and a timing graph for sophisticated control of scheduling, interaction, and animation. In particular, the timing graph provides a unified system to add behaviors to both data and visual elements, as well as to the behaviors themselves. To evaluate the framework we look briefly at three different projects all of which required novel visualizations in different domains, and all of which worked with dynamic data in different ways: an interactive ecological simulation, an information art installation, and an information visualization technique.",Angus G. Forbes;Tobias Höllerer;George Legrady,Angus Forbes;Tobias Hollerer;George Legrady,UCSB;UCSB;UCSB,10.1109/INFVIS.2004.64;10.1109/VISUAL.1996.567752;10.1109/INFVIS.1997.636761;10.1109/TVCG.2009.111,"Frameworks, information visualization, information art, dynamic data",24,17,37,
VAST,2010,Visual exploration of classification models for risk assessment,10.1109/VAST.2010.5652398,http://dx.doi.org/10.1109/VAST.2010.5652398,11,18,C,"In risk assessment applications well informed decisions are made based on huge amounts of multi-dimensional data. In many domains not only the risk of a wrong decision, but in particular the trade-off between the costs of possible decisions are of utmost importance. In this paper we describe a framework tightly integrating interactive visual exploration with machine learning to support the decision making process. The proposed approach uses a series of interactive 2D visualizations of numeric and ordinal data combined with visualization of classification models. These series of visual elements are further linked to the classifier's performance visualized using an interactive performance curve. An interactive decision point on the performance curve allows the decision maker to steer the classification model and instantly identify the critical, cost changing data elements, in the various linked visualizations. The critical data elements are represented as images in order to trigger associations related to the knowledge of the expert. In this context the data visualization and classification results are not only linked together, but are also linked back to the classification model. Such a visual analytics framework allows the user to interactively explore the costs of his decisions for different settings of the model and accordingly use the most suitable classification model and make more informed and reliable decisions. A case study on data from the Forensic Psychiatry domain reveals the usefulness of the suggested approach.",Gosia Migut;Marcel Worring,Malgorzata Migut;Marcel Worring,"Intelligent Systems Lab Amsterdam, University of Amsterdam;Intelligent Systems Lab Amsterdam, University of Amsterdam",10.1109/TVCG.2007.70515;10.1109/INFVIS.2005.1532139;10.1109/VAST.2009.5332628;10.1109/INFVIS.1998.729559;10.1109/TVCG.2009.199;10.1109/INFVIS.2000.885086;10.1109/TVCG.2007.70521;10.1109/VAST.2008.4677369;10.1109/VISUAL.1994.346302;10.1109/TVCG.2008.153,"Visual Analytics, Interactive Visual Exploration, Decision Boundary Visualization, Multi-dimensional Space, Classification",24,18,29,
VAST,2010,Click2Annotate: Automated Insight Externalization with rich semantics,10.1109/VAST.2010.5652885,http://dx.doi.org/10.1109/VAST.2010.5652885,155,162,C,"Insight Externalization (IE) refers to the process of capturing and recording the semantics of insights in decision making and problem solving. To reduce human effort, Automated Insight Externalization (AIE) is desired. Most existing IE approaches achieve automation by capturing events (e.g., clicks and key presses) or actions (e.g., panning and zooming). In this paper, we propose a novel AIE approach named Click2Annotate. It allows semi-automatic insight annotation that captures low-level analytics task results (e.g., clusters and outliers), which have higher semantic richness and abstraction levels than actions and events. Click2Annotate has two significant benefits. First, it reduces human effort required in IE and generates annotations easy to understand. Second, the rich semantic information encoded in the annotations enables various insight management activities, such as insight browsing and insight retrieval. We present a formal user study that proved this first benefit. We also illustrate the second benefit by presenting the novel insight management activities we developed based on Click2Annotate, namely scented insight browsing and faceted insight search.",Yang Chen;Scott Barlowe;Jing Yang 0001,Yang Chen;Scott Barlowe;Jing Yang,Department of Computer Science UNC Charlotte;Department of Computer Science UNC Charlotte;Department of Computer Science UNC Charlotte,10.1109/VISUAL.1990.146375;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2007.70541;10.1109/VAST.2008.4677365;10.1109/TVCG.2007.70577;10.1109/TVCG.2009.139,"Visual Analytics, Decision Making, Annotation, Insight Management, Multidimensional Visualization",24,17,18,
Vis,2010,Fast; Memory-Efficient Cell Location in Unstructured Grids for Visualization,10.1109/TVCG.2010.156,http://dx.doi.org/10.1109/TVCG.2010.156,1541,1550,J,"Applying certain visualization techniques to datasets described on unstructured grids requires the interpolation of variables of interest at arbitrary locations within the dataset's domain of definition. Typical solutions to the problem of finding the grid element enclosing a given interpolation point make use of a variety of spatial subdivision schemes. However, existing solutions are memory- intensive, do not scale well to large grids, or do not work reliably on grids describing complex geometries. In this paper, we propose a data structure and associated construction algorithm for fast cell location in unstructured grids, and apply it to the interpolation problem. Based on the concept of bounding interval hierarchies, the proposed approach is memory-efficient, fast and numerically robust. We examine the performance characteristics of the proposed approach and compare it to existing approaches using a number of benchmark problems related to vector field visualization. Furthermore, we demonstrate that our approach can successfully accommodate large datasets, and discuss application to visualization on both CPUs and GPUs.",Christoph Garth;Kenneth I. Joy,Christoph Garth;Kenneth I. Joy,"University of California, Davis;University of California, Davis",10.1109/TVCG.2008.163;10.1109/TVCG.2008.133;10.1109/VISUAL.2005.1532795;10.1109/TVCG.2009.154,"Unstructured grids, cell location, interpolation, vector field visualization",24,24,22,
VAST,2011,Visual analytic roadblocks for novice investigators,10.1109/VAST.2011.6102435,http://dx.doi.org/10.1109/VAST.2011.6102435,3,11,C,"We have observed increasing interest in visual analytics tools and their applications in investigative analysis. Despite the growing interest and substantial studies regarding the topic, understanding the major roadblocks of using such tools from novice users' perspectives is still limited. Therefore, we attempted to identify such “visual analytic roadblocks” for novice users in an investigative analysis scenario. To achieve this goal, we reviewed the existing models, theories, and frameworks that could explain the cognitive processes of human-visualization interaction in investigative analysis. Then, we conducted a qualitative experiment with six novice participants, using a slightly modified version of pair analytics, and analyzed the results through the open-coding method. As a result, we came up with four visual analytic roadblocks and explained these roadblocks using existing cognitive models and theories. We also provided design suggestions to overcome these roadblocks.",Bum Chul Kwon;Brian D. Fisher;Ji Soo Yi,Bum chul Kwon;Brian Fisher;Ji Soo Yi,"Purdue University, USA;Simon Fraser University, Canada;Purdue University, USA",10.1109/INFVIS.2004.10;10.1109/VAST.2007.4389006;10.1109/TVCG.2010.164;10.1109/VAST.2009.5333878;10.1109/TVCG.2010.179;10.1109/TVCG.2008.121;10.1109/INFVIS.2004.5;10.1109/TVCG.2007.70515;10.1109/TVCG.2010.177;10.1109/VAST.2006.261416;10.1109/TVCG.2008.171;10.1109/TVCG.2008.109;10.1109/TVCG.2007.70535;10.1109/VAST.2008.4677361;10.1109/TVCG.2007.70589;10.1109/TVCG.2007.70594,"Visual analytics, investigative analysis, cognitive model, framework, roadblock, qualitative experiment",24,14,28,
InfoVis,2012,An Empirical Model of Slope Ratio Comparisons,10.1109/TVCG.2012.196,http://dx.doi.org/10.1109/TVCG.2012.196,2613,2620,J,"Comparing slopes is a fundamental graph reading task and the aspect ratio chosen for a plot influences how easy these comparisons are to make. According to Banking to 45°, a classic design guideline first proposed and studied by Cleveland et al., aspect ratios that center slopes around 45° minimize errors in visual judgments of slope ratios. This paper revisits this earlier work. Through exploratory pilot studies that expand Cleveland et al.'s experimental design, we develop an empirical model of slope ratio estimation that fits more extreme slope ratio judgments and two common slope ratio estimation strategies. We then run two experiments to validate our model. In the first, we show that our model fits more generally than the one proposed by Cleveland et al. and we find that, in general, slope ratio errors are not minimized around 45°. In the second experiment, we explore a novel hypothesis raised by our model: that visible baselines can substantially mitigate errors made in slope judgments. We conclude with an application of our model to aspect ratio selection.",Justin Talbot;John Gerth;Pat Hanrahan,Justin Talbot;John Gerth;Pat Hanrahan,Stanford University;Stanford University;Stanford University,10.1109/TVCG.2006.163;10.1109/TVCG.2011.167,"Banking to 45 degrees, slope perception, orientation resolution, aspect ratio selection",24,24,15,
InfoVis,2012,Facilitating Discourse Analysis with Interactive Visualization,10.1109/TVCG.2012.226,http://dx.doi.org/10.1109/TVCG.2012.226,2639,2648,J,"A discourse parser is a natural language processing system which can represent the organization of a document based on a rhetorical structure tree-one of the key data structures enabling applications such as text summarization, question answering and dialogue generation. Computational linguistics researchers currently rely on manually exploring and comparing the discourse structures to get intuitions for improving parsing algorithms. In this paper, we present DAViewer, an interactive visualization system for assisting computational linguistics researchers to explore, compare, evaluate and annotate the results of discourse parsers. An iterative user-centered design process with domain experts was conducted in the development of DAViewer. We report the results of an informal formative study of the system to better understand how the proposed visualization and interaction techniques are used in the real research environment.",Jian Zhao 0010;Fanny Chevalier;Christopher Collins 0001;Ravin Balakrishnan,Jian Zhao;Fanny Chevalier;Christopher Collins;Ravin Balakrishnan,University of Toronto;University of Toronto;University of Ontario Institute of Technology;University of Toronto,10.1109/VAST.2011.6102439;10.1109/TVCG.2007.70529;10.1109/TVCG.2009.122;10.1109/INFVIS.1999.801869;10.1109/INFVIS.2003.1249030,"Discourse structure, tree comparison, computational linguisitics, visual analytics, interaction techniques",24,22,30,
InfoVis,2012,Graphical Tests for Power Comparison of Competing Designs,10.1109/TVCG.2012.230,http://dx.doi.org/10.1109/TVCG.2012.230,2441,2448,J,"Lineups [4, 28] have been established as tools for visual testing similar to standard statistical inference tests, allowing us to evaluate the validity of graphical findings in an objective manner. In simulation studies [12] lineups have been shown as being efficient: the power of visual tests is comparable to classical tests while being much less stringent in terms of distributional assumptions made. This makes lineups versatile, yet powerful, tools in situations where conditions for regular statistical tests are not or cannot be met. In this paper we introduce lineups as a tool for evaluating the power of competing graphical designs. We highlight some of the theoretical properties and then show results from two studies evaluating competing designs: both studies are designed to go to the limits of our perceptual abilities to highlight differences between designs. We use both accuracy and speed of evaluation as measures of a successful design. The first study compares the choice of coordinate system: polar versus cartesian coordinates. The results show strong support in favor of cartesian coordinates in finding fast and accurate answers to spotting patterns. The second study is aimed at finding shift differences between distributions. Both studies are motivated by data problems that we have recently encountered, and explore using simulated data to evaluate the plot designs under controlled conditions. Amazon Mechanical Turk (MTurk) is used to conduct the studies. The lineups provide an effective mechanism for objectively evaluating plot designs.",Heike Hofmann;Lendie Follett;Mahbubul Majumder;Dianne Cook,Heike Hofmann;Lendie Follett;Mahbubul Majumder;Dianne Cook,Iowa State University;Iowa State University;Iowa State University;Iowa State University,10.1109/TVCG.2009.111;10.1109/TVCG.2010.161,"Lineups, Visual inference, Power comparison, Efficiency of displays",24,20,28,
SciVis,2012,Augmented Topological Descriptors of Pore Networks for Material Science,10.1109/TVCG.2012.200,http://dx.doi.org/10.1109/TVCG.2012.200,2041,2050,J,"One potential solution to reduce the concentration of carbon dioxide in the atmosphere is the geologic storage of captured CO&lt;sub&gt;2&lt;/sub&gt; in underground rock formations, also known as carbon sequestration. There is ongoing research to guarantee that this process is both efficient and safe. We describe tools that provide measurements of media porosity, and permeability estimates, including visualization of pore structures. Existing standard algorithms make limited use of geometric information in calculating permeability of complex microstructures. This quantity is important for the analysis of biomineralization, a subsurface process that can affect physical properties of porous media. This paper introduces geometric and topological descriptors that enhance the estimation of material permeability. Our analysis framework includes the processing of experimental data, segmentation, and feature extraction and making novel use of multiscale topological analysis to quantify maximum flow through porous networks. We illustrate our results using synchrotron-based X-ray computed microtomography of glass beads during biomineralization. We also benchmark the proposed algorithms using simulated data sets modeling jammed packed bead beds of a monodispersive material.",Daniela Ushizima;Dmitriy Morozov;Gunther H. Weber;Andrea G. C. Bianchi;James A. Sethian;E. Wes Bethel,Daniela Ushizima;Dmitriy Morozov;Gunther H. Weber;Andrea G.C. Bianchi;James A. Sethian;E. Wes Bethel,"Lawrence Berkeley National Laboratory;Lawrence Berkeley National Laboratory;Lawrence Berkeley National Laboratory;Lawrence Berkeley National Laboratory;University of California, Berkeley;Lawrence Berkeley National Laboratory",10.1109/TVCG.2010.218;10.1109/TVCG.2007.70603;10.1109/VISUAL.2005.1532795,"Reeb graph, persistent homology, topological data analysis, geometric algorithms, segmentation, microscopy",24,25,25,
SciVis,2012,Turbulence Visualization at the Terascale on Desktop PCs,10.1109/TVCG.2012.274,http://dx.doi.org/10.1109/TVCG.2012.274,2169,2177,J,"Despite the ongoing efforts in turbulence research, the universal properties of the turbulence small-scale structure and the relationships between small- and large-scale turbulent motions are not yet fully understood. The visually guided exploration of turbulence features, including the interactive selection and simultaneous visualization of multiple features, can further progress our understanding of turbulence. Accomplishing this task for flow fields in which the full turbulence spectrum is well resolved is challenging on desktop computers. This is due to the extreme resolution of such fields, requiring memory and bandwidth capacities going beyond what is currently available. To overcome these limitations, we present a GPU system for feature-based turbulence visualization that works on a compressed flow field representation. We use a wavelet-based compression scheme including run-length and entropy encoding, which can be decoded on the GPU and embedded into brick-based volume ray-casting. This enables a drastic reduction of the data to be streamed from disk to GPU memory. Our system derives turbulence properties directly from the velocity gradient tensor, and it either renders these properties in turn or generates and renders scalar feature volumes. The quality and efficiency of the system is demonstrated in the visualization of two unsteady turbulence simulations, each comprising a spatio-temporal resolution of 10244. On a desktop computer, the system can visualize each time step in 5 seconds, and it achieves about three times this rate for the visualization of a scalar feature volume.",Marc Treib;Kai Bürger;Florian Reichl;Charles Meneveau;Alex Szalay;Rüdiger Westermann,Marc Treib;Kai Bürger;Florian Reichl;Charles Meneveau;Alex Szalay;Rüdiger Westermann,Technische Universität München;Technische Universität München;Technische Universität München;Johns Hopkins University;Johns Hopkins University;Technische Universität München,10.1109/VISUAL.2002.1183757;10.1109/VISUAL.2001.964520;10.1109/TVCG.2006.143;10.1109/VISUAL.2005.1532808;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2001.964531;10.1109/VISUAL.2004.55;10.1109/VISUAL.2003.1250385,"Visualization system and toolkit design, vector fields, volume rendering, data streaming, data compression",24,18,45,
InfoVis,2013,Visualizing Change over Time Using Dynamic Hierarchies: TreeVersity2 and the StemView,10.1109/TVCG.2013.231,http://dx.doi.org/10.1109/TVCG.2013.231,2566,2575,J,"To analyze data such as the US Federal Budget or characteristics of the student population of a University it is common to look for changes over time. This task can be made easier and more fruitful if the analysis is performed by grouping by attributes, such as by Agencies, Bureaus and Accounts for the Budget, or Ethnicity, Gender and Major in a University. We present TreeVersity2, a web based interactive data visualization tool that allows users to analyze change in datasets by creating dynamic hierarchies based on the data attributes. TreeVersity2 introduces a novel space filling visualization (StemView) to represent change in trees at multiple levels - not just at the leaf level. With this visualization users can explore absolute and relative changes, created and removed nodes, and each node's actual values, while maintaining the context of the tree. In addition, TreeVersity2 provides overviews of change over the entire time period, and a reporting tool that lists outliers in textual form, which helps users identify the major changes in the data without having to manually setup filters. We validated TreeVersity2 with 12 case studies with organizations as diverse as the National Cancer Institute, Federal Drug Administration, Department of Transportation, Office of the Bursar of the University of Maryland, or eBay. Our case studies demonstrated that TreeVersity2 is flexible enough to be used in different domains and provide useful insights for the data owners. A TreeVersity2 demo can be found at https://treeversity.cattlab.umd.edu.",John Alexis Guerra Gómez;Michael L. Pack;Catherine Plaisant;Ben Shneiderman,JohnAlexis Guerra-Gómez;Michael L. Pack;Catherine Plaisant;Ben Shneiderman,University of Maryland;University of Maryland;University of Maryland;University of Maryland,10.1109/VAST.2011.6102439;10.1109/TVCG.2006.147;10.1109/TVCG.2011.185;10.1109/VISUAL.1991.175815;10.1109/TVCG.2007.70556;10.1109/INFVIS.2002.1173150;10.1109/VAST.2006.261450;10.1109/INFVIS.2002.1173148;10.1109/INFVIS.2003.1249026;10.1109/TVCG.2007.70529,"Information visualization, Tree comparison",24,21,45,
VAST,2013,Open-Box Spectral Clustering: Applications to Medical Image Analysis,10.1109/TVCG.2013.181,http://dx.doi.org/10.1109/TVCG.2013.181,2100,2108,J,"Spectral clustering is a powerful and versatile technique, whose broad range of applications includes 3D image analysis. However, its practical use often involves a tedious and time-consuming process of tuning parameters and making application-specific choices. In the absence of training data with labeled clusters, help from a human analyst is required to decide the number of clusters, to determine whether hierarchical clustering is needed, and to define the appropriate distance measures, parameters of the underlying graph, and type of graph Laplacian. We propose to simplify this process via an open-box approach, in which an interactive system visualizes the involved mathematical quantities, suggests parameter values, and provides immediate feedback to support the required decisions. Our framework focuses on applications in 3D image analysis, and links the abstract high-dimensional feature space used in spectral clustering to the three-dimensional data space. This provides a better understanding of the technique, and helps the analyst predict how well specific parameter settings will generalize to similar tasks. In addition, our system supports filtering outliers and labeling the final clusters in such a way that user actions can be recorded and transferred to different data in which the same structures are to be found. Our system supports a wide range of inputs, including triangular meshes, regular grids, and point clouds. We use our system to develop segmentation protocols in chest CT and brain MRI that are then successfully applied to other datasets in an automated manner.",Thomas Schultz 0001;Gordon L. Kindlmann,Thomas Schultz;Gordon L. Kindlmann,University of Bonn;University of Chicago,10.1109/VISUAL.2005.1532820;10.1109/VAST.2010.5652926;10.1109/VISUAL.2000.885740;10.1109/VAST.2012.6400488;10.1109/TVCG.2009.141;10.1109/TVCG.2009.112;10.1109/TVCG.2009.177;10.1109/TVCG.2010.199;10.1109/TVCG.2009.199;10.1109/TVCG.2011.248;10.1109/TVCG.2011.253,"Image segmentation, spectral clustering, high-dimensional embeddings, linked views, programming with example",24,25,53,
VAST,2013,Visual Analytics for Model Selection in Time Series Analysis,10.1109/TVCG.2013.222,http://dx.doi.org/10.1109/TVCG.2013.222,2237,2246,J,"Model selection in time series analysis is a challenging task for domain experts in many application areas such as epidemiology, economy, or environmental sciences. The methodology used for this task demands a close combination of human judgement and automated computation. However, statistical software tools do not adequately support this combination through interactive visual interfaces. We propose a Visual Analytics process to guide domain experts in this task. For this purpose, we developed the TiMoVA prototype that implements this process based on user stories and iterative expert feedback on user experience. The prototype was evaluated by usage scenarios with an example dataset from epidemiology and interviews with two external domain experts in statistics. The insights from the experts' feedback and the usage scenarios show that TiMoVA is able to support domain experts in model selection tasks through interactive visual interfaces with short feedback cycles.",Markus Bögl;Wolfgang Aigner;Peter Filzmoser;Tim Lammarsch;Silvia Miksch;Alexander Rind,Markus Bögl;Wolfgang Aigner;Peter Filzmoser;Tim Lammarsch;Silvia Miksch;Alexander Rind,Vienna University of Technology;Vienna University of Technology;Vienna University of Technology;Vienna University of Technology;Vienna University of Technology;Vienna University of Technology,10.1109/TVCG.2013.206;10.1109/TVCG.2012.213;10.1109/TVCG.2007.70539,"Visual analytics, model selection, visual interaction, time series analysis, coordinated & multiple views",24,23,42,
InfoVis,2014,Attribute Signatures: Dynamic Visual Summaries for Analyzing Multivariate Geographical Data,10.1109/TVCG.2014.2346265,http://dx.doi.org/10.1109/TVCG.2014.2346265,2033,2042,J,"The visual analysis of geographically referenced datasets with a large number of attributes is challenging due to the fact that the characteristics of the attributes are highly dependent upon the locations at which they are focussed, and the scale and time at which they are measured. Specialized interactive visual methods are required to help analysts in understanding the characteristics of the attributes when these multiple aspects are considered concurrently. Here, we develop attribute signatures-interactively crafted graphics that show the geographic variability of statistics of attributes through which the extent of dependency between the attributes and geography can be visually explored. We compute a number of statistical measures, which can also account for variations in time and scale, and use them as a basis for our visualizations. We then employ different graphical configurations to show and compare both continuous and discrete variation of location and scale. Our methods allow variation in multiple statistical summaries of multiple attributes to be considered concurrently and geographically, as evidenced by examples in which the census geography of London and the wider UK are explored.",Cagatay Turkay;Aidan Slingsby;Helwig Hauser;Jo Wood;Jason Dykes,Cagatay Turkay;Aidan Slingsby;Helwig Hauser;Jo Wood;Jason Dykes,"Dep. of Computer Science at City University London, UK;Dep. of Computer Science at City University London, UK;Department of Informatics at University of Bergen, Bergen, Norway;Dep. of Computer Science at City University London, UK;Dep. of Computer Science at City University London, UK",10.1109/TVCG.2013.173;10.1109/TVCG.2011.178;10.1109/TVCG.2013.226;10.1109/TVCG.2011.197;10.1109/TVCG.2007.70558;10.1109/TVCG.2008.149;10.1109/INFVIS.2004.12;10.1109/TVCG.2012.256;10.1109/TVCG.2007.70574;10.1109/VAST.2008.4677350;10.1109/TVCG.2008.125;10.1109/TVCG.2013.122,"Visual analytics, multi-variate data, geographic information, geovisualization, interactive data analysis",24,20,54,
VAST,2014,Multi-Model Semantic Interaction for Text Analytics,10.1109/VAST.2014.7042492,http://dx.doi.org/10.1109/VAST.2014.7042492,163,172,C,"Semantic interaction offers an intuitive communication mechanism between human users and complex statistical models. By shielding the users from manipulating model parameters, they focus instead on directly manipulating the spatialization, thus remaining in their cognitive zone. However, this technique is not inherently scalable past hundreds of text documents. To remedy this, we present the concept of multi-model semantic interaction, where semantic interactions can be used to steer multiple models at multiple levels of data scale, enabling users to tackle larger data problems. We also present an updated visualization pipeline model for generalized multi-model semantic interaction. To demonstrate multi-model semantic interaction, we introduce StarSPIRE, a visual text analytics prototype that transforms user interactions on documents into both small-scale display layout updates as well as large-scale relevancy-based document selection.",Lauren Bradel;Chris North 0001;Leanna House;Scotland Leman,Lauren Bradel;Chris North;Leanna House;Scotland Leman,Virginia Tech.;Virginia Tech.;Virginia Tech.;Virginia Tech.,10.1109/VAST.2011.6102449;10.1109/TVCG.2013.188;10.1109/VAST.2012.6400559;10.1109/VAST.2012.6400486;10.1109/INFVIS.1995.528686;10.1109/VAST.2007.4389006,"Visual analytics, Semantic Interaction, Sensemaking, Text Analytics",24,25,35,
VAST,2014,Integrating Predictive Analytics and Social Media,10.1109/VAST.2014.7042495,http://dx.doi.org/10.1109/VAST.2014.7042495,193,202,C,"A key analytical task across many domains is model building and exploration for predictive analysis. Data is collected, parsed and analyzed for relationships, and features are selected and mapped to estimate the response of a system under exploration. As social media data has grown more abundant, data can be captured that may potentially represent behavioral patterns in society. In turn, this unstructured social media data can be parsed and integrated as a key factor for predictive intelligence. In this paper, we present a framework for the development of predictive models utilizing social media data. We combine feature selection mechanisms, similarity comparisons and model cross-validation through a variety of interactive visualizations to support analysts in model building and prediction. In order to explore how predictions might be performed in such a framework, we present results from a user study focusing on social media data as a predictor for movie box-office success.",Yafeng Lu;Robert Krüger;Dennis Thom;Feng Wang 0012;Steffen Koch;Thomas Ertl;Ross Maciejewski,Yafeng Lu;Robert Krüger;Dennis Thom;Feng Wang;Steffen Koch;Thomas Ertl;Ross Maciejewski,"Arizona State University;University of Stuttgart, Germany;University of Stuttgart, Germany;Arizona State University;University of Stuttgart, Germany;University of Stuttgart, Germany;Arizona State University",10.1109/VAST.2012.6400557;10.1109/TVCG.2011.185;10.1109/VAST.2012.6400486;10.1109/TVCG.2013.162;10.1109/TVCG.2013.221;10.1109/VAST.2011.6102456;10.1109/TVCG.2012.291;10.1109/TVCG.2013.125;10.1109/INFVIS.2004.10;10.1109/VAST.2011.6102448;10.1109/VAST.2010.5652443;10.1109/INFVIS.2004.3,"Social Media, Predictive Analytics, Feature Selection",24,24,49,
InfoVis,2015,Off the Radar: Comparative Evaluation of Radial Visualization Solutions for Composite Indicators,10.1109/TVCG.2015.2467322,http://dx.doi.org/10.1109/TVCG.2015.2467322,569,578,J,"A composite indicator (CI) is a measuring and benchmark tool used to capture multi-dimensional concepts, such as Information and Communication Technology (ICT) usage. Individual indicators are selected and combined to reflect a phenomena being measured. Visualization of a composite indicator is recommended as a tool to enable interested stakeholders, as well as the public audience, to better understand the indicator components and evolution overtime. However, existing CI visualizations introduce a variety of solutions and there is a lack in CI's visualization guidelines. Radial visualizations are popular among these solutions because of CI's inherent multi-dimensionality. Although in dispute, Radar-charts are often used for CI presentation. However, no empirical evidence on Radar's effectiveness and efficiency for common CI tasks is available. In this paper, we aim to fill this gap by reporting on a controlled experiment that compares the Radar chart technique with two other radial visualization methods: Flowercharts as used in the well-known OECD Betterlife index, and Circle-charts which could be adopted for this purpose. Examples of these charts in the current context are shown in Figure 1. We evaluated these charts, showing the same data with each of the mentioned techniques applying small multiple views for different dimensions of the data. We compared users' performance and preference empirically under a formal task-taxonomy. Results indicate that the Radar chart was the least effective and least liked, while performance of the two other options were mixed and dependent on the task. Results also showed strong preference of participants toward the Flower chart. Summarizing our results, we provide specific design guidelines for composite indicator visualization.",Yael Albo;Joel Lanir;Peter Bak;Sheizaf Rafaeli,Yael Albo;Joel Lanir;Peter Bak;Sheizaf Rafaeli,"University of Haifa, Israel;University of Haifa, Israel;IBM Research Haifa Lab, Haifa, Israel;Sheizaf Rafaeli is with University of Haifa, Israel",10.1109/TVCG.2010.209;10.1109/TVCG.2008.125,"Visualization evaluation, radial layout design, composite indicator visualization, experiment",24,24,35,
InfoVis,2015,TimeSpan: Using Visualization to Explore Temporal Multi-dimensional Data of Stroke Patients,10.1109/TVCG.2015.2467325,http://dx.doi.org/10.1109/TVCG.2015.2467325,409,418,J,"We present TimeSpan, an exploratory visualization tool designed to gain a better understanding of the temporal aspects of the stroke treatment process. Working with stroke experts, we seek to provide a tool to help improve outcomes for stroke victims. Time is of critical importance in the treatment of acute ischemic stroke patients. Every minute that the artery stays blocked, an estimated 1.9 million neurons and 12 km of myelinated axons are destroyed. Consequently, there is a critical need for efficiency of stroke treatment processes. Optimizing time to treatment requires a deep understanding of interval times. Stroke health care professionals must analyze the impact of procedures, events, and patient attributes on time-ultimately, to save lives and improve quality of life after stroke. First, we interviewed eight domain experts, and closely collaborated with two of them to inform the design of TimeSpan. We classify the analytical tasks which a visualization tool should support and extract design goals from the interviews and field observations. Based on these tasks and the understanding gained from the collaboration, we designed TimeSpan, a web-based tool for exploring multi-dimensional and temporal stroke data. We describe how TimeSpan incorporates factors from stacked bar graphs, line charts, histograms, and a matrix visualization to create an interactive hybrid view of temporal data. From feedback collected from domain experts in a focus group session, we reflect on the lessons we learned from abstracting the tasks and iteratively designing TimeSpan.",Mona Hosseinkhani Loorak;Charles Perin;Noreen Kamal;Michael D. Hill;Sheelagh Carpendale,Mona Hosseinkhani Loorak;Charles Perin;Noreen Kamal;Michael Hill;Sheelagh Carpendale,"Department of Computer Science, University of Calgary;Department of Computer Science, University of Calgary;Department of Clinical Neurosciences, University of Calgary;Department of Clinical Neurosciences, University of Calgary;Department of Computer Science, University of Calgary",10.1109/INFVIS.2005.1532136;10.1109/VAST.2006.261421;10.1109/TVCG.2014.2346682;10.1109/TVCG.2013.200;10.1109/TVCG.2014.2346279;10.1109/INFVIS.2005.1532152;10.1109/TVCG.2009.187;10.1109/TVCG.2012.225;10.1109/TVCG.2007.70515,"Multi-dimensional data, Temporal event sequences, Electronic health records",24,28,37,
InfoVis,2015,Visually Comparing Weather Features in Forecasts,10.1109/TVCG.2015.2467754,http://dx.doi.org/10.1109/TVCG.2015.2467754,389,398,J,"Meteorologists process and analyze weather forecasts using visualization in order to examine the behaviors of and relationships among weather features. In this design study conducted with meteorologists in decision support roles, we identified and attempted to address two significant common challenges in weather visualization: the employment of inconsistent and often ineffective visual encoding practices across a wide range of visualizations, and a lack of support for directly visualizing how different weather features relate across an ensemble of possible forecast outcomes. In this work, we present a characterization of the problems and data associated with meteorological forecasting, we propose a set of informed default encoding choices that integrate existing meteorological conventions with effective visualization practice, and we extend a set of techniques as an initial step toward directly visualizing the interactions of multiple features over an ensemble forecast. We discuss the integration of these contributions into a functional prototype tool, and also reflect on the many practical challenges that arise when working with weather data.",P. Samuel Quinan;Miriah D. Meyer,P. Samuel Quinan;Miriah Meyer,University of Utah;University of Utah,10.1109/VISUAL.1990.146361;10.1109/VISUAL.2002.1183788;10.1109/TVCG.2011.209;10.1109/TVCG.2010.181;10.1109/TVCG.2012.213;10.1109/TVCG.2013.143,"Design study, weather, geographic/geospatial visualization, ensemble data",24,30,38,
SciVis,2015,Association Analysis for Visual Exploration of Multivariate Scientific Data Sets,10.1109/TVCG.2015.2467431,http://dx.doi.org/10.1109/TVCG.2015.2467431,955,964,J,"The heterogeneity and complexity of multivariate characteristics poses a unique challenge to visual exploration of multivariate scientific data sets, as it requires investigating the usually hidden associations between different variables and specific scalar values to understand the data's multi-faceted properties. In this paper, we present a novel association analysis method that guides visual exploration of scalar-level associations in the multivariate context. We model the directional interactions between scalars of different variables as information flows based on association rules. We introduce the concepts of informativeness and uniqueness to describe how information flows between scalars of different variables and how they are associated with each other in the multivariate domain. Based on scalar-level associations represented by a probabilistic association graph, we propose the Multi-Scalar Informativeness-Uniqueness (MSIU) algorithm to evaluate the informativeness and uniqueness of scalars. We present an exploration framework with multiple interactive views to explore the scalars of interest with confident associations in the multivariate spatial domain, and provide guidelines for visual exploration using our framework. We demonstrate the effectiveness and usefulness of our approach through case studies using three representative multivariate scientific data sets.",Xiaotong Liu;Han-Wei Shen,Xiaotong Liu;Han-Wei Shen,The Ohio State University;The Ohio State University,10.1109/TVCG.2013.133;10.1109/TVCG.2007.70519;10.1109/TVCG.2008.116;10.1109/TVCG.2007.70615;10.1109/VISUAL.1995.485139;10.1109/TVCG.2006.165;10.1109/VAST.2012.6400488;10.1109/TVCG.2011.178;10.1109/VAST.2007.4389000,"Multivariate data, association analysis, visual exploration, multiple views",24,25,34,
VAST,2015,BiSet: Semantic Edge Bundling with Biclusters for Sensemaking,10.1109/TVCG.2015.2467813,http://dx.doi.org/10.1109/TVCG.2015.2467813,310,319,J,"Identifying coordinated relationships is an important task in data analytics. For example, an intelligence analyst might want to discover three suspicious people who all visited the same four cities. Existing techniques that display individual relationships, such as between lists of entities, require repetitious manual selection and significant mental aggregation in cluttered visualizations to find coordinated relationships. In this paper, we present BiSet, a visual analytics technique to support interactive exploration of coordinated relationships. In BiSet, we model coordinated relationships as biclusters and algorithmically mine them from a dataset. Then, we visualize the biclusters in context as bundled edges between sets of related entities. Thus, bundles enable analysts to infer task-oriented semantic insights about potentially coordinated activities. We make bundles as first class objects and add a new layer, “in-between”, to contain these bundle objects. Based on this, bundles serve to organize entities represented in lists and visually reveal their membership. Users can interact with edge bundles to organize related entities, and vice versa, for sensemaking purposes. With a usage scenario, we demonstrate how BiSet supports the exploration of coordinated relationships in text analytics.",Maoyuan Sun;Peng Mi;Chris North 0001;Naren Ramakrishnan,Maoyuan Sun;Peng Mi;Chris North;Naren Ramakrishnan,"Department of Computer Science, Discovery Analytics Center;Department of Computer Science, Discovery Analytics Center;Department of Computer Science, Discovery Analytics Center;Department of Computer Science, Discovery Analytics Center",10.1109/TVCG.2007.70521;10.1109/TVCG.2009.122;10.1109/TVCG.2008.135;10.1109/TVCG.2012.252;10.1109/TVCG.2012.260;10.1109/INFVIS.2004.1;10.1109/TVCG.2014.2346260;10.1109/TVCG.2007.70582;10.1109/TVCG.2006.147;10.1109/TVCG.2011.233;10.1109/VAST.2009.5333878;10.1109/TVCG.2011.250;10.1109/TVCG.2010.138;10.1109/TVCG.2014.2346752;10.1109/TVCG.2010.210;10.1109/TVCG.2011.183;10.1109/TVCG.2014.2346665,"Bicluster, coordinated relationship, semantic edge bundling",24,26,58,
SciVis,2016,Visualization as Seen through its Research Paper Keywords,10.1109/TVCG.2016.2598827,http://dx.doi.org/10.1109/TVCG.2016.2598827,771,780,J,"We present the results of a comprehensive multi-pass analysis of visualization paper keywords supplied by authors for their papers published in the IEEE Visualization conference series (now called IEEE VIS) between 1990-2015. From this analysis we derived a set of visualization topics that we discuss in the context of the current taxonomy that is used to categorize papers and assign reviewers in the IEEE VIS reviewing process. We point out missing and overemphasized topics in the current taxonomy and start a discussion on the importance of establishing common visualization terminology. Our analysis of research topics in visualization can, thus, serve as a starting point to (a) help create a common vocabulary to improve communication among different visualization sub-groups, (b) facilitate the process of understanding differences and commonalities of the various research sub-fields in visualization, (c) provide an understanding of emerging new research trends, (d) facilitate the crucial step of finding the right reviewers for research submissions, and (e) it can eventually lead to a comprehensive taxonomy of visualization research. One additional tangible outcome of our work is an online query tool (http://keyvis.org/) that allows visualization researchers to easily browse the 3952 keywords used for IEEE VIS papers since 1990 to find related work or make informed keyword choices.",Petra Isenberg;Tobias Isenberg 0001;Michael Sedlmair;Jian Chen;Torsten Möller,Petra Isenberg;Tobias Isenberg;Michael Sedlmair;Jian Chen;Torsten Möller,"Inria, France;Inria, France;University of Vienna, Austria;University of Maryland, Baltimore County, USA;University of Vienna, Austria",10.1109/TVCG.2012.195;10.1109/TVCG.2012.213;10.1109/INFVIS.2000.885092;10.1109/TVCG.2011.229;10.1109/TVCG.2008.109;10.1109/TVCG.2007.70515;10.1109/TVCG.2013.126,data analysis;research themes;research topics;taxonomy;visualization history;theory,24,23,48,
VAST,2016,Designing Progressive and Interactive Analytics Processes for High-Dimensional Data Analysis,10.1109/TVCG.2016.2598470,http://dx.doi.org/10.1109/TVCG.2016.2598470,131,140,J,"In interactive data analysis processes, the dialogue between the human and the computer is the enabling mechanism that can lead to actionable observations about the phenomena being investigated. It is of paramount importance that this dialogue is not interrupted by slow computational mechanisms that do not consider any known temporal human-computer interaction characteristics that prioritize the perceptual and cognitive capabilities of the users. In cases where the analysis involves an integrated computational method, for instance to reduce the dimensionality of the data or to perform clustering, such non-optimal processes are often likely. To remedy this, progressive computations, where results are iteratively improved, are getting increasing interest in visual analytics. In this paper, we present techniques and design considerations to incorporate progressive methods within interactive analysis processes that involve high-dimensional data. We define methodologies to facilitate processes that adhere to the perceptual characteristics of users and describe how online algorithms can be incorporated within these. A set of design recommendations and according methods to support analysts in accomplishing high-dimensional data analysis tasks are then presented. Our arguments and decisions here are informed by observations gathered over a series of analysis sessions with analysts from finance. We document observations and recommendations from this study and present evidence on how our approach contribute to the efficiency and productivity of interactive visual analysis sessions involving high-dimensional data.",Cagatay Turkay;Erdem Kaya;Selim Balcisoy;Helwig Hauser,Cagatay Turkay;Erdem Kaya;Selim Balcisoy;Helwig Hauser,"City University, London, UK;Sabanci University, Turkey;Sabanci University, Turkey;University of Bergen, Norway",10.1109/TVCG.2007.70539;10.1109/VAST.2008.4677361;10.1109/TVCG.2008.153;10.1109/TVCG.2014.2346481;10.1109/TVCG.2014.2346574;10.1109/TVCG.2007.70515;10.1109/TVCG.2012.213;10.1109/TVCG.2013.125;10.1109/TVCG.2012.256;10.1109/VAST.2008.4677357;10.1109/TVCG.2015.2467613;10.1109/TVCG.2014.2346265;10.1109/TVCG.2011.178;10.1109/INFVIS.2005.1532136;10.1109/INFVIS.1996.559223;10.1109/TVCG.2011.229;10.1109/TVCG.2008.125,Progressive analytics;high dimensional data;iterative refinement;visual analytics,24,35,48,
VAST,2016,An Analysis of Machine- and Human-Analytics in Classification,10.1109/TVCG.2016.2598829,http://dx.doi.org/10.1109/TVCG.2016.2598829,71,80,J,"In this work, we present a study that traces the technical and cognitive processes in two visual analytics applications to a common theoretic model of soft knowledge that may be added into a visual analytics process for constructing a decision-tree model. Both case studies involved the development of classification models based on the “bag of features” approach. Both compared a visual analytics approach using parallel coordinates with a machine-learning approach using information theory. Both found that the visual analytics approach had some advantages over the machine learning approach, especially when sparse datasets were used as the ground truth. We examine various possible factors that may have contributed to such advantages, and collect empirical evidence for supporting the observation and reasoning of these factors. We propose an information-theoretic model as a common theoretic basis to explain the phenomena exhibited in these two case studies. Together we provide interconnected empirical and theoretical evidence to support the usefulness of visual analytics.",Gary K. L. Tam;Vivek Kothari;Min Chen,Gary K. L. Tam;Vivek Kothari;Min Chen,Swansea University;University of Oxford;University of Oxford,10.1109/VAST.2010.5652467;10.1109/TVCG.2015.2467615;10.1109/VAST.2012.6400492;10.1109/TVCG.2013.207;10.1109/TVCG.2015.2467552;10.1109/TVCG.2015.2467612;10.1109/VAST.2010.5652398;10.1109/TVCG.2010.132;10.1109/TVCG.2014.2346660;10.1109/VAST.2015.7347629;10.1109/VAST.2011.6102453;10.1109/VAST.2011.6102448,information theory;Visual analytics;classification;decision tree;model;facial expression;visualization image,24,26,51,BP
SciVis,2017,The Topology ToolKit,10.1109/TVCG.2017.2743938,http://dx.doi.org/10.1109/TVCG.2017.2743938,832,842,J,"This system paper presents the Topology ToolKit (TTK), a software platform designed for the topological analysis of scalar data in scientific visualization. While topological data analysis has gained in popularity over the last two decades, it has not yet been widely adopted as a standard data analysis tool for end users or developers. TTK aims at addressing this problem by providing a unified, generic, efficient, and robust implementation of key algorithms for the topological analysis of scalar data, including: critical points, integral lines, persistence diagrams, persistence curves, merge trees, contour trees, Morse-Smale complexes, fiber surfaces, continuous scatterplots, Jacobi sets, Reeb spaces, and more. TTK is easily accessible to end users due to a tight integration with ParaView. It is also easily accessible to developers through a variety of bindings (Python, VTK/C++) for fast prototyping or through direct, dependency-free, C++, to ease integration into pre-existing complex systems. While developing TTK, we faced several algorithmic and software engineering challenges, which we document in this paper. In particular, we present an algorithm for the construction of a discrete gradient that complies to the critical points extracted in the piecewise-linear setting. This algorithm guarantees a combinatorial consistency across the topological abstractions supported by TTK, and importantly, a unified implementation of topological data simplification for multi-scale exploration and analysis. We also present a cached triangulation data structure, that supports time efficient and generic traversals, which self-adjusts its memory usage on demand for input simplicial meshes and which implicitly emulates a triangulation for regular grids with no memory overhead. Finally, we describe an original software architecture, which guarantees memory efficient and direct accesses to TTK features, while still allowing for researchers powerful and easy bindings and extensions. TTK is open source (BSD license) and its code. online documentation and video tutorials are available on TTK's website [108].",Julien Tierny;Guillaume Favelier;Joshua A. Levine;Charles Gueunet;Michael Michaux,Julien Tierny;Guillaume Favelier;Joshua A. Levine;Charles Gueunet;Michael Michaux,"Sorbonne Universites, UPMC Univ Paris 06, CNRS, LIP6 UMR 7606, France;Sorbonne Universites, UPMC Univ Paris 06, CNRS, LIP6 UMR 7606, France;University of Arizona, USA;Sorbonne Universites, UPMC Univ Paris 06, CNRS, LIP6 UMR 7606, France;Sorbonne Universites, UPMC Univ Paris 06, CNRS, LIP6 UMR 7606, France",10.1109/TVCG.2008.119;10.1109/VISUAL.2005.1532788;10.1109/VISUAL.2004.96;10.1109/TVCG.2014.2346322;10.1109/TVCG.2010.213;10.1109/TVCG.2014.2346403;10.1109/TVCG.2008.110;10.1109/TVCG.2012.209;10.1109/TVCG.2014.2346434;10.1109/TVCG.2015.2467432;10.1109/TVCG.2007.70603;10.1109/TVCG.2015.2467449;10.1109/TVCG.2006.186;10.1109/TVCG.2014.2346318;10.1109/TVCG.2014.2346332;10.1109/TVCG.2016.2599017;10.1109/TVCG.2009.163;10.1109/TVCG.2012.228,"Topological data analysis,scalar data,data segmentation,feature extraction,bivariate data,uncertain data",24,12,118,HM
Vis,1991,Deixis and the future of visualization excellence,10.1109/VISUAL.1991.175820,http://dx.doi.org/10.1109/VISUAL.1991.175820,314,"320, 431",C,"The authors maintain that of particular importance for visualization excellence is an understanding of effective deictic facilities, especially new techniques made possible by computation. They explain what deixis is and why it is fundamental to visualization and they analyze some of the requirements for effective deixis in the context of emergent visualization technology.&lt;&lt;ETX&gt;&gt;",William C. Hill;James D. Hollan,W.C. Hill;J.D. Hollan,,,,23,8,2,
Vis,1992,VISAGE: an object-oriented scientific visualization system,10.1109/VISUAL.1992.235205,http://dx.doi.org/10.1109/VISUAL.1992.235205,219,226,C,"VISAGE, a scientific visualization system implemented in an object-oriented, message passing environment, is described. The system includes over 500 classes ranging from visualization and graphics to Xlib and Motif user interface. Objects are created using compiled C and interact through an interpreted scripting language. The result is a flexible yet efficient system that has found wide application. The object architecture, the major issues faced when designing the visualization classes, and sample applications are also described.&lt;&lt;ETX&gt;&gt;",William J. Schroeder;William E. Lorensen;G. D. Montanaro;Christopher R. Volpe,W.J. Schroeder;W.E. Lorensen;G.D. Montanaro;C.R. Volpe,"GE Corp. Res. & Dev., Schenectady, NY, USA;GE Corp. Res. & Dev., Schenectady, NY, USA;GE Corp. Res. & Dev., Schenectady, NY, USA;GE Corp. Res. & Dev., Schenectady, NY, USA",10.1109/VISUAL.1991.175787;10.1109/VISUAL.1991.175789;10.1109/VISUAL.1990.146360,,23,9,21,
Vis,1995,Visualization of biological sequence similarity search results,10.1109/VISUAL.1995.480794,http://dx.doi.org/10.1109/VISUAL.1995.480794,44,"51, 437",C,"Biological sequence similarity analysis presents visualization challenges, primarily because of the massive amounts of discrete, multi dimensional data. Genomic data generated by molecular biologists is analyzed by algorithms that search for similarity to known sequences in large genomic databases. The output from these algorithms can be several thousand pages of text, and is difficult to analyze because of its length and complexity. We developed and implemented a novel graphical representation for sequence similarity search results, which visually reveals features that are difficult to find in textual reports. The method opens new possibilities in the interpretation of this discrete, multidimensional data by enabling interactive investigation of the graphical representation.",Ed H. Chi;Phillip Barry;Elizabeth Shoop;John V. Carlis;Ernest F. Retzel;John Riedl,E.H.-H. Chi;P. Barry;E. Shoop;J.V. Carlis;E. Retzel;J. Riedl,"Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA;Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA;Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA;Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA",10.1109/VISUAL.1993.398883,,23,6,19,
InfoVis,1996,Visualizing the results of multimedia Web search engines,10.1109/INFVIS.1996.559219,http://dx.doi.org/10.1109/INFVIS.1996.559219,64,"65, 122",M,"Search engines are very useful because they allow the user to retrieve documents of interest from the World-Wide Web. However, if the user's query results in lots of records to be retrieved, just listing the results is not very user-friendly. We are developing a system that allows the visualization of the results. Visualizations of both text and image search are generated on the fly based on the search results.",Sougata Mukherjea;Kyoji Hirata;Yoshinori Hara,S. Mukherjea;K. Hirata;Y. Hara,"C&C Res. Lab., NEC USA Inc., USA",,,23,11,2,
Vis,1998,Accelerated ray-casting for curvilinear volumes,10.1109/VISUAL.1998.745310,http://dx.doi.org/10.1109/VISUAL.1998.745310,247,253,C,"We present an efficient and robust ray-casting algorithm for directly rendering a curvilinear volume of arbitrarily-shaped cells. We designed the algorithm to alleviate the consumption of CPU power and memory space. By incorporating the essence of the projection paradigm into the ray-casting process, we have successfully accelerated the ray traversal through the grid and data interpolations at sample points. Our algorithm also overcomes the conventional limitation requiring the cells to be convex. Application of this algorithm to several commonly-used curvilinear data sets has produced a favorable performance when compared with recently reported algorithms.",Lichan Hong;Arie E. Kaufman,L. Hong;A. Kaufman,"Lucent Technol., AT&T Bell Labs., Naperville, IL, USA",10.1109/VISUAL.1993.398853;10.1109/VISUAL.1992.235228;10.1109/VISUAL.1996.567606,"volume visualization, volume rendering, irregular grid, curvilinear grid, ray-casting, parallel rendering, dynamic simulation",23,13,21,
InfoVis,1999,A Java-based visual mining infrastructure and applications,10.1109/INFVIS.1999.801867,http://dx.doi.org/10.1109/INFVIS.1999.801867,124,"127, 153",C,"Many real-world KDD (Knowledge Discovery &amp; Data Mining) applications involve the navigation of large volumes of information on the web, such as, Internet resources, hot topics, and telecom phone switches. Quite often users feel lost, confused and overwhelmed with displays that contain too much information. This paper discusses a new content-driven visual mining infrastructure called VisMine, that uses several innovative techniques: (1) hidden visual structure and relationships for uncluttering displays; (2) simultaneous visual presentations for high-dimensional knowledge discovery; and (3) a new visual interface to plug in existing graphic toolkits for expanding its use in a wide variety of visual applications. We have applied this infrastructure to three data mining visualization applications-topic hierarchy for document navigation, web-based trouble shooting, and telecom switch mining.",Ming C. Hao;Umeshwar Dayal;Meichun Hsu;Jim Baker;Bob Deletto,M.C. Hao;U. Dayal;M. Hsu;J. Baker;R. D'Eletto,"Hewlett Packard Res. Labs., USA",10.1109/VISUAL.1998.745301;10.1109/VISUAL.1993.398870,,23,7,9,
Vis,1999,C1-interpolation for vector field topology visualization,10.1109/VISUAL.1999.809897,http://dx.doi.org/10.1109/VISUAL.1999.809897,271,533,C,An application of C/sup 1/ scalar interpolation for 2D vector field topology visualization is presented. Powell-Sabin and Nielson interpolants are considered which both make use of Nielson's Minimum Norm Network for the precomputation of the derivatives in our implementation. A comparison of their results to the commonly used linear interpolant underlines their significant improvement of singularity location and topological skeleton depiction. Evaluation is based upon the processing of polynomial vector fields with known topology containing higher order singularities.,Gerik Scheuermann;Xavier Tricoche;Hans Hagen,G. Scheuermann;X. Tricoche;H. Hagen,"Dept. of Comput. Sci., Kaiserslautern Univ., Germany",10.1109/VISUAL.1991.175773;10.1109/VISUAL.1998.745284;10.1109/VISUAL.1998.745296,"vector field visualization, topology, critical point theory, C1-interpolation",23,14,13,
InfoVis,2000,Using Visualization to Detect Plagiarism in Computer Science Classes,10.0000/00000001,http://dl.acm.org/citation.cfm?id=857699,173,,C,,Randy L. Ribler;Marc Abrams,,,10.1109/VISUAL.1993.398883;10.1109/VISUAL.1995.480794,,23,,,
Vis,2001,Cell-projection of cyclic meshes,10.1109/VISUAL.2001.964514,http://dx.doi.org/10.1109/VISUAL.2001.964514,215,222,C,"We present the first algorithm that employs hardware-accelerated cell-projection for direct volume rendering of cyclic meshes, i.e., meshes with visibility cycles. The visibility sorting of a cyclic mesh is performed by an extended topological sorting, which computes and isolates visibility cycles. Measured sorting times are comparable to previously published algorithms, which are, however, restricted to acyclic meshes. In practice, our algorithm is also useful for acyclic meshes as numerical instabilities can lead to false visibility cycles. Our method includes a simple, hardware-assisted algorithm based on image compositing that renders visibility cycles correctly. For tetrahedral meshes this algorithm allows us to render each tetrahedral cell (whether it is part of a cycle or not) by hardware-accelerated cell-projection. In its basic form our method applies only to convex cyclic meshes; however, we present an exact and a simpler but inexact extension of our method for nonconvex meshes.",Martin Kraus;Thomas Ertl,M. Kraus;T. Ertl,"Visualization & Interactive Syst. Group, Stuttgart, Germany;Visualization & Interactive Syst. Group, Stuttgart, Germany",10.1109/VISUAL.2000.885683,"cell-projection, direct volume rendering, tetrahedral meshes, unstructured meshes, visibility cycles, visibility ordering, visibility sorting, volume visualization",23,11,18,
Vis,2002,Horizon occlusion culling for real-time rendering of hierarchical terrains,10.1109/VISUAL.2002.1183801,http://dx.doi.org/10.1109/VISUAL.2002.1183801,403,409,C,"We present a technique to perform occlusion culling for hierarchical terrains at run-time. The algorithm is simple to implement and requires minimal pre-processing and additional storage, yet leads to 2-4 times improvement in framerate for views with high degrees of occlusion. Our method is based on the well-known occlusion horizon algorithm. We show how to adapt the algorithm for use with hierarchical terrains. The occlusion horizon is constructed as the terrain is traversed in an approximate front to back ordering. Regions of the terrain are compared to the horizon to determine when they are completely occluded from the viewpoint. Culling these regions leads to significant savings in rendering.",Brandon Lloyd;Parris K. Egbert,B. Lloyd;P. Egbert,"Brigham Young Univ., Provo, UT, USA;Brigham Young Univ., Provo, UT, USA",10.1109/VISUAL.1998.745322;10.1109/VISUAL.1998.745280;10.1109/VISUAL.1997.663863;10.1109/VISUAL.1997.663860;10.1109/VISUAL.1998.745282,"rendering algorithms, visibility, occlusion culling",23,9,24,
Vis,2002,Approximating normals for marching cubes applied to locally supported isosurfaces,10.1109/VISUAL.2002.1183808,http://dx.doi.org/10.1109/VISUAL.2002.1183808,459,466,C,"We present some new methods for computing estimates of normal vectors at the vertices of a triangular mesh surface approximation to an isosurface which has been computed by the marching cube algorithm. These estimates are required for the smooth rendering of triangular mesh surfaces. The conventional method of computing estimates based upon divided difference approximations of the gradient can lead to poor estimates in some applications. This is particularly true for isosurfaces obtained from a field function, which is defined only for values near to the isosurface. We describe some efficient methods for computing the topology of the triangular mesh surface, which is used for obtaining local estimates of the normals. In addition, a new, one pass, approach for these types of applications is described and compared to existing methods.",Gregory M. Nielson;Adam Huang;Steve Sylvester,G.M. Nielson;A. Huang;S. Sylvester,"Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA;Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA;Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA",10.1109/VISUAL.1991.175782,"isosurface, normal vectors, marching cubes, triangular mesh, topology, Gouraud shading, approximation",23,12,7,
Vis,2002,Volume warping for adaptive isosurface extraction,10.1109/VISUAL.2002.1183809,http://dx.doi.org/10.1109/VISUAL.2002.1183809,467,474,C,"Polygonal approximations of isosurfaces extracted from uniformly sampled volumes are increasing in size due to the availability of higher resolution imaging techniques. The large number of I primitives represented hinders the interactive exploration of the dataset. Though many solutions have been proposed to this problem, many require the creation of isosurfaces at multiple resolutions or the use of additional data structures, often hierarchical, to represent the volume. We propose a technique for adaptive isosurface extraction that is easy to implement and allows the user to decide the degree of adaptivity as well as the choice of isosurface extraction algorithm. Our method optimizes the extraction of the isosurface by warping the volume. In a warped volume, areas of importance (e.g. containing significant details) are inflated while unimportant ones are contracted. Once the volume is warped, any extraction algorithm can be applied. The extracted mesh is subsequently unwarped such that the warped areas are rescaled to their initial proportions. The resulting isosurface is represented by a mesh that is more densely sampled in regions decided as important.",Laurent Balmelli;Christopher J. Morris;Gabriel Taubin;Fausto Bernardini,L. Balmelli;C.J. Morris;G. Taubin;F. Bernardini,"IBM Thomas J. Watson Res. Center, Hawthorne, NY, USA;IBM Thomas J. Watson Res. Center, Hawthorne, NY, USA;IBM Thomas J. Watson Res. Center, Hawthorne, NY, USA;IBM Thomas J. Watson Res. Center, Hawthorne, NY, USA",10.1109/VISUAL.1996.568127;10.1109/VISUAL.2000.885705,"isosurfaces, adaptive isosurface extraction, volume warping, adaptive tessellation",23,6,12,
Vis,2003,Information and scientific visualization: separate but equal or happy together at last,10.1109/VISUAL.2003.1250428,http://dx.doi.org/10.1109/VISUAL.2003.1250428,611,614,M,,Theresa-Marie Rhyne;Melanie Tory;Tamara Munzner;Matthew O. Ward;Christopher R. Johnson 0001;David H. Laidlaw,T. Rhyne;M. Tory;T. Munzner;M. Ward;C. Johnson;D.H. Laidlaw,North Carolina State University,,,23,12,2,
InfoVis,2006,Visualization of Geo-spatial Point Sets via Global Shape Transformation and Local Pixel Placement,10.1109/TVCG.2006.198,http://dx.doi.org/10.1109/TVCG.2006.198,749,756,J,"In many applications, data is collected and indexed by geo-spatial location. Discovering interesting patterns through visualization is an important way of gaining insight about such data. A previously proposed approach is to apply local placement functions such as PixelMaps that transform the input data set into a solution set that preserves certain constraints while making interesting patterns more obvious and avoid data loss from overplotting. In experience, this family of spatial transformations can reveal fine structures in large point sets, but it is sometimes difficult to relate those structures to basic geographic features such as cities and regional boundaries. Recent information visualization research has addressed other types of transformation functions that make spatially-transformed maps with recognizable shapes. These types of spatial-transformation are called global shape functions. In particular, cartogram-based map distortion has been studied. On the other hand, cartogram-based distortion does not handle point sets readily. In this study, we present a framework that allows the user to specify a global shape function and a local placement function. We combine cartogram-based layout (global shape) with PixelMaps (local placement), obtaining some of the benefits of each toward improved exploration of dense geo-spatial data sets",Christian Panse;Mike Sips;Daniel A. Keim;Stephen C. North,Christian Panse;Mike Sips;Daniel Keim;Stephen North,IEEE Computer Society;IEEE Computer Society;IEEE Computer Society;IEEE Computer Society,10.1109/VISUAL.1998.745303;10.1109/INFVIS.2004.57;10.1109/VISUAL.2003.1250410,"Geo-spatial Data, Shape Transformation, Cartogram, Pixel Visualization",23,18,12,
Vis,2006,Distributed Shared Memory for Roaming Large Volumes,10.1109/TVCG.2006.135,http://dx.doi.org/10.1109/TVCG.2006.135,1299,1306,J,"We present a cluster-based volume rendering system for roaming very large volumes. This system allows to move a gigabyte-sized probe inside a total volume of several tens or hundreds of gigabytes in real-time. While the size of the probe is limited by the total amount of texture memory on the cluster, the size of the total data set has no theoretical limit. The cluster is used as a distributed graphics processing unit that both aggregates graphics power and graphics memory. A hardware-accelerated volume renderer runs in parallel on the cluster nodes and the final image compositing is implemented using a pipelined sort-last rendering algorithm. Meanwhile, volume bricking and volume paging allow efficient data caching. On each rendering node, a distributed hierarchical cache system implements a global software-based distributed shared memory on the cluster. In case of a cache miss, this system first checks page residency on the other cluster nodes instead of directly accessing local disks. Using two gigabit Ethernet network interfaces per node, we accelerate data fetching by a factor of 4 compared to directly accessing local disks. The system also implements asynchronous disk access and texture loading, which makes it possible to overlap data loading, volume slicing and rendering for optimal volume roaming",Laurent Castanie;Christophe Mion;Xavier Cavin;Bruno Lévy,Laurent Castanie;Christophe Mion;Xavier Cavin;Bruno Levy,,10.1109/VISUAL.2005.1532794;10.1109/VISUAL.1997.663888;10.1109/VISUAL.2005.1532785;10.1109/VISUAL.2005.1532802,"Large volumes, volume roaming, out-of-core, hierarchical caching, distributed shared memory, hardware-accelerated volume visualization, graphics hardware, parallel rendering, graphics cluster",23,11,38,
Vis,2006,Scalable WIM: Effective Exploration in Large-scale Astrophysical Environments,10.1109/TVCG.2006.176,http://dx.doi.org/10.1109/TVCG.2006.176,1005,1012,J,"Navigating through large-scale virtual environments such as simulations of the astrophysical Universe is difficult. The huge spatial range of astronomical models and the dominance of empty space make it hard for users to travel across cosmological scales effectively, and the problem of wayfinding further impedes the user's ability to acquire reliable spatial knowledge of astronomical contexts. We introduce a new technique called the scalable world-in-miniature (WIM) map as a unifying interface to facilitate travel and wayfinding in a virtual environment spanning gigantic spatial scales: power-law spatial seating enables rapid and accurate transitions among widely separated regions; logarithmically mapped miniature spaces offer a global overview mode when the full context is too large; 3D landmarks represented in the WIM are enhanced by scale, positional, and directional cues to augment spatial context awareness; a series of navigation models are incorporated into the scalable WIM to improve the performance of travel tasks posed by the unique characteristics of virtual cosmic exploration. The scalable WIM user interface supports an improved physical navigation experience and assists pragmatic cognitive understanding of a visualization context that incorporates the features of large-scale astronomy",Yinggang Li;Chi-Wing Fu;Andrew J. Hanson,Yinggang Li;Chi-wing Fu;Andrew Hanson,Indiana University;Hong Kong University of Science & Technology;Indiana University,,"Astrophysical visualization, large-scale exploration, interaction techniques, world-in-miniature (WIM)",23,17,24,
Vis,2006,Vortex Visualization for Practical Engineering Applications,10.1109/TVCG.2006.201,http://dx.doi.org/10.1109/TVCG.2006.201,957,964,J,"In order to understand complex vortical flows in large data sets, we must be able to detect and visualize vortices in an automated fashion. In this paper, we present a feature-based vortex detection and visualization technique that is appropriate for large computational fluid dynamics data sets computed on unstructured meshes. In particular, we focus on the application of this technique to visualization of the flow over a serrated wing and the flow field around a spinning missile with dithering canards. We have developed a core line extraction technique based on the observation that vortex cores coincide with local extrema in certain scalar fields. We also have developed a novel technique to handle complex vortex topology that is based on k-means clustering. These techniques facilitate visualization of vortices in simulation data that may not be optimally resolved or sampled. Results are included that highlight the strengths and weaknesses of our approach. We conclude by describing how our approach can be improved to enhance robustness and expand its range of applicability",Monika Jankun-Kelly;Ming Jiang 0005;David S. Thompson;Raghu Machiraju,Monika Jankun-Kelly;Ming Jiang;David Thompson;Raghu Machiraju,"Graduate Research Assistant at the Computational Simulation and Design Center, Mississippi State University;Postdoctoral Researcher at the Center for Applied Scientific Computing, Lawrence Livermore National Laboratory;Associate Professor in the Department of Aerospace Engineering at Mississippi State University;Associate Professor in the Department of Computer Science and Engineering at The Ohio State University",10.1109/VISUAL.1997.663894;10.1109/VISUAL.2002.1183789;10.1109/VISUAL.2005.1532830;10.1109/VISUAL.1998.745296;10.1109/VISUAL.1998.745288;10.1109/VISUAL.1999.809896,"Vortex detection, vortex visualization, feature mining",23,19,31,
InfoVis,2007,Exploring Multiple Trees through DAG Representations,10.1109/TVCG.2007.70556,http://dx.doi.org/10.1109/TVCG.2007.70556,1294,1301,J,"We present a directed acyclic graph visualisation designed to allow interaction with a set of multiple classification trees, specifically to find overlaps and differences between groups of trees and individual trees. The work is motivated by the need to find a representation for multiple trees that has the space-saving property of a general graph representation and the intuitive parent-child direction cues present in individual representation of trees. Using example taxonomic data sets, we describe augmentations to the common barycenter DAG layout method that reveal shared sets of child nodes between common parents in a clearer manner. Other interactions such as displaying the multiple ancestor paths of a node when it occurs in several trees, and revealing intersecting sibling sets within the context of a single DAG representation are also discussed.",Martin Graham 0001;Jessie Kennedy,Martin Graham;Jessie Kennedy,IEEE Computer Society,10.1109/INFVIS.2005.1532129;10.1109/INFVIS.2002.1173148;10.1109/INFVIS.2002.1173153;10.1109/INFVIS.2000.885091;10.1109/VISUAL.1991.175815;10.1109/INFVIS.2004.70;10.1109/INFVIS.2005.1532152,"Multiple trees, Directed Acyclic Graph",23,19,42,
VAST,2007,NewsLab: Exploratory Broadcast News Video Analysis,10.1109/VAST.2007.4389005,http://dx.doi.org/10.1109/VAST.2007.4389005,123,130,C,"In this paper, we introduce NewsLab, an exploratory visualization approach for the analysis of large scale broadcast news video collections containing many thousands of news stories over extended periods of time. A river metaphor is used to depict the thematic changes of the news over time. An interactive lens metaphor allows the playback of fine-grained video segments selected through the river overview. Multi-resolution navigation is supported via a hierarchical time structure as well as a hierarchical theme structure. Themes can be explored hierarchically according to their thematic structure, or in an unstructured fashion using various ranking criteria. A rich set of interactions such as filtering, drill-down/roll-up navigation, history animation, and keyword based search are also provided. Our case studies show how this set of tools can be used to find emerging topics in the news, compare different broadcasters, or mine the news for topics of interest.",Mohammad Ghoniem;Dongning Luo;Jing Yang 0001;William Ribarsky,Mohammad Ghoniem;Dongning Luo;Jing Yang;William Ribarsky,UNC Charlotte. e-mail: mghoniem@uncc.edu;UNC Charlotte. e-mail: dluo2@uncc.edu;UNC Charlotte. e-mail: jyang13@uncc.edu;UNC Charlotte. e-mail: ribarsky@uncc.edu,10.1109/VAST.2006.261433;10.1109/VAST.2006.261425;10.1109/VISUAL.1996.568118;10.1109/INFVIS.1998.729559;10.1109/INFVIS.1999.801858;10.1109/INFVIS.2005.1532122,"Large data exploration, broadcast video analysis, time filtering, clustering, animation, comparative analysis",23,12,16,
VAST,2008,An information visualisation system for the understanding of web data,10.1109/VAST.2008.4677377,http://dx.doi.org/10.1109/VAST.2008.4677377,183,184,M,"Internet has become one of the best communication and marketing tools. Hence, designing well-structured Web sites with the information or products that users look for is a crucial mission. For this reason, understanding Web data is a decisive task to assure the success of a Website. In that sense, data mining techniques provide many metrics and statistics useful to automatically discover the structure, contents and usage of a site. This research aims at proving the usefulness of a set of information visualisation techniques in order to analyse Web data, using a visual Web mining tool that allows the combination, coordination and exploration of visualisations to get insight on Web data. The tool, named WET, provides a set of visual metaphors that represent the structure of the Websites where Web metrics are overlaid.",Victor Pascual-Cid,Victor Pascual-Cid,"Web Research Group, Universitat Pompeu Fabra and Fundació Barcelona Media, Spain",,,23,9,4,
InfoVis,2009,SellTrend: Inter-Attribute Visual Analysis of Temporal Transaction Data,10.1109/TVCG.2009.180,http://dx.doi.org/10.1109/TVCG.2009.180,1025,1032,J,"We present a case study of our experience designing SellTrend, a visualization system for analyzing airline travel purchase requests. The relevant transaction data can be characterized as multi-variate temporal and categorical event sequences, and the chief problem addressed is how to help company analysts identify complex combinations of transaction attributes that contribute to failed purchase requests. SellTrend combines a diverse set of techniques ranging from time series visualization to faceted browsing and historical trend analysis in order to help analysts make sense of the data. We believe that the combination of views and interaction capabilities in SellTrend provides an innovative approach to this problem and to other similar types of multivariate, temporally driven transaction data analysis. Initial feedback from company analysts confirms the utility and benefits of the system.",Zhicheng Liu;John T. Stasko;Timothy Sullivan,Zhicheng Liu;John Stasko;Timothy Sullivan,Georgia Institute of Technology;Georgia Institute of Technology;Travelport Corp.,10.1109/VAST.2007.4389009;10.1109/INFVIS.2005.1532139;10.1109/VISUAL.1991.175815;10.1109/VISUAL.1992.235181;10.1109/TVCG.2006.142;10.1109/INFVIS.1997.636793;10.1109/TVCG.2008.121;10.1109/VAST.2007.4389006,"investigative analysis, transaction analysis, information visualization, multiple views, time series data, multiple attributes, categorical data",23,13,30,HM
InfoVis,2009,Visualizing the Intellectual Structure with Paper-Reference Matrices,10.1109/TVCG.2009.202,http://dx.doi.org/10.1109/TVCG.2009.202,1153,1160,J,"Visualizing the intellectual structure of scientific domains using co-cited units such as references or authors has become a routine for domain analysis. In previous studies, paper-reference matrices are usually transformed into reference-reference matrices to obtain co-citation relationships, which are then visualized in different representations, typically as node-link networks, to represent the intellectual structures of scientific domains. Such network visualizations sometimes contain tightly knit components, which make visual analysis of the intellectual structure a challenging task. In this study, we propose a new approach to reveal co-citation relationships. Instead of using a reference-reference matrix, we directly use the original paper-reference matrix as the information source, and transform the paper-reference matrix into an FP-tree and visualize it in a Java-based prototype system. We demonstrate the usefulness of our approach through visual analyses of the intellectual structure of two domains: information visualization and Sloan Digital Sky Survey (SDSS). The results show that our visualization not only retains the major information of co-citation relationships, but also reveals more detailed sub-structures of tightly knit clusters than a conventional node-link network visualization.",Jian Zhang 0006;Chaomei Chen;Jiexun Li,Jian Zhang;Chaomei Chen;Jiexun Li,Drexel University;Drexel University;Drexel University,10.1109/INFVIS.2000.885091;10.1109/TVCG.2008.172;10.1109/TVCG.2008.135;10.1109/TVCG.2008.121;10.1109/INFVIS.2004.43;10.1109/TVCG.2008.130;10.1109/VISUAL.1991.175815,"Intellectual Structure, Paper-reference Matrix, FP-tree, Co-citation",23,18,35,
Vis,2009,Applying Manifold Learning to Plotting Approximate Contour Trees,10.1109/TVCG.2009.119,http://dx.doi.org/10.1109/TVCG.2009.119,1185,1192,J,"A contour tree is a powerful tool for delineating the topological evolution of isosurfaces of a single-valued function, and thus has been frequently used as a means of extracting features from volumes and their time-varying behaviors. Several sophisticated algorithms have been proposed for constructing contour trees while they often complicate the software implementation especially for higher-dimensional cases such as time-varying volumes. This paper presents a simple yet effective approach to plotting in 3D space, approximate contour trees from a set of scattered samples embedded in the high-dimensional space. Our main idea is to take advantage of manifold learning so that we can elongate the distribution of high-dimensional data samples to embed it into a low-dimensional space while respecting its local proximity of sample points. The contribution of this paper lies in the introduction of new distance metrics to manifold learning, which allows us to reformulate existing algorithms as a variant of currently available dimensionality reduction scheme. Efficient reduction of data sizes together with segmentation capability is also developed to equip our approach with a coarse-to-fine analysis even for large-scale datasets. Examples are provided to demonstrate that our proposed scheme can successfully traverse the features of volumes and their temporal behaviors through the constructed contour trees.",Shigeo Takahashi;Issei Fujishiro;Masato Okada,Shigeo Takahashi;Issei Fujishiro;Masato Okada,The University of Tokyo;Keio University;The University of Tokyo,10.1109/VISUAL.2002.1183772;10.1109/TVCG.2007.70601;10.1109/VISUAL.2004.96;10.1109/VISUAL.2002.1183774;10.1109/VISUAL.1997.663875,"Contour trees, manifold learning, time-varying volumes, high-dimensional data analysis",23,21,38,
Vis,2009,Multimodal Vessel Visualization of Mouse Aorta PET/CT Scans,10.1109/TVCG.2009.169,http://dx.doi.org/10.1109/TVCG.2009.169,1515,1522,J,"In this paper, we present a visualization system for the visual analysis of PET/CT scans of aortic arches of mice. The system has been designed in close collaboration between researchers from the areas of visualization and molecular imaging with the objective to get deeper insights into the structural and molecular processes which take place during plaque development. Understanding the development of plaques might lead to a better and earlier diagnosis of cardiovascular diseases, which are still the main cause of death in the western world. After motivating our approach, we will briefly describe the multimodal data acquisition process before explaining the visualization techniques used. The main goal is to develop a system which supports visual comparison of the data of different species. Therefore, we have chosen a linked multi-view approach, which amongst others integrates a specialized straightened multipath curved planar reformation and a multimodal vessel flattening technique. We have applied the visualization concepts to multiple data sets, and we will present the results of this investigation.",Timo Ropinski;Sven Hermann;Rainer Reich;Michael Schäfers 0001;Klaus H. Hinrichs,Timo Ropinski;Sven Hermann;Rainer Reich;Michael Schafers;Klaus Hinrichs,"Visualization and Computer Graphics Research Group (VisCG), University of M&#x0FC;nster;University Hospital of M&#x0FC;nster;Visualization and Computer Graphics Research Group (VisCG), University of M&#x0FC;nster;European Institute of Molecular Imaging (EIMI);Visualization and Computer Graphics Research Group (VisCG), University of M&#x0FC;nster",10.1109/VISUAL.2003.1250353;10.1109/VISUAL.1992.235203;10.1109/TVCG.2007.70576;10.1109/VISUAL.2004.104;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2001.964538;10.1109/TVCG.2007.70560;10.1109/VISUAL.2002.1183754;10.1109/VISUAL.2003.1250396,"Vessel visualization, plaque growth, multipath CPR, vessel flattening",23,20,36,
InfoVis,2010,Visualization of Diversity in Large Multivariate Data Sets,10.1109/TVCG.2010.216,http://dx.doi.org/10.1109/TVCG.2010.216,1053,1062,J,"Understanding the diversity of a set of multivariate objects is an important problem in many domains, including ecology, college admissions, investing, machine learning, and others. However, to date, very little work has been done to help users achieve this kind of understanding. Visual representation is especially appealing for this task because it offers the potential to allow users to efficiently observe the objects of interest in a direct and holistic way. Thus, in this paper, we attempt to formalize the problem of visualizing the diversity of a large (more than 1000 objects), multivariate (more than 5 attributes) data set as one worth deeper investigation by the information visualization community. In doing so, we contribute a precise definition of diversity, a set of requirements for diversity visualizations based on this definition, and a formal user study design intended to evaluate the capacity of a visual representation for communicating diversity information. Our primary contribution, however, is a visual representation, called the Diversity Map, for visualizing diversity. An evaluation of the Diversity Map using our study design shows that users can judge elements of diversity consistently and as or more accurately than when using the only other representation specifically designed to visualize diversity.",Tuan Pham;Rob Hess;Crystal Ju;Eugene Zhang;Ronald A. Metoyer,Tuan Pham;Rob Hess;Crystal Ju;Eugene Zhang;Ronald Metoyer,Oregon State University;Oregon State University;Oregon State University;Oregon State University;Oregon State University,10.1109/VISUAL.1990.146402;10.1109/VISUAL.1990.146386;10.1109/INFVIS.2004.15;10.1109/INFVIS.1997.636793;10.1109/INFVIS.2002.1173157;10.1109/VISUAL.1991.175815;10.1109/VISUAL.1999.809866;10.1109/INFVIS.2004.68,"Information visualization, diversity, categorical data, multivariate data, evaluation",23,17,38,
VAST,2010,Interactive querying of temporal data using a comic strip metaphor,10.1109/VAST.2010.5652890,http://dx.doi.org/10.1109/VAST.2010.5652890,163,170,C,"Finding patterns in temporal data is an important data analysis task in many domains. Static visualizations can help users easily see certain instances of patterns, but are not specially designed to support systematic analysis tasks, such as finding all instances of a pattern automatically. VizPattern is an interactive visual query environment that uses a comic strip metaphor to enable users to easily and quickly define and locate complex temporal patterns. Evaluations provide evidence that VizPattern is applicable in many domains, and that it enables a wide variety of users to answer questions about temporal data faster and with fewer errors than existing state-of-the-art visual analysis systems.",Jing Jin;Pedro A. Szekely,Jing Jin;Pedro Szekely,Information Sciences Institute University of Southern California;Information Sciences Institute University of Southern California,10.1109/VAST.2006.261421;10.1109/VAST.2006.261436,,23,14,23,
Vis,2010,Discontinuities in Continuous Scatterplots,10.1109/TVCG.2010.146,http://dx.doi.org/10.1109/TVCG.2010.146,1291,1300,J,"The concept of continuous scatterplot (CSP) is a modern visualization technique. The idea is to define a scalar density value based on the map between an n-dimensional spatial domain and an m-dimensional data domain, which describe the CSP space. Usually the data domain is two-dimensional to visually convey the underlying, density coded, data. In this paper we investigate kinds of map-based discontinuities, especially for the practical cases n = m = 2 and n = 3 | m = 2, and we depict relations between them and attributes of the resulting CSP itself. Additionally, we show that discontinuities build critical line structures, and we introduce algorithms to detect them. Further, we introduce a discontinuity-based visualization approach - called contribution map (CM) -which establishes a relationship between the CSP's data domain and the number of connected components in the spatial domain. We show that CMs enhance the CSP-based linking &amp;amp; brushing interaction. Finally, we apply our approaches to a number of synthetic as well as real data sets.",Dirk J. Lehmann;Holger Theisel,Dirk J. Lehmann;Holger Theisel,University of Magdeburg;University of Magdeburg,10.1109/TVCG.2006.168;10.1109/TVCG.2008.119;10.1109/VISUAL.1999.809896;10.1109/VISUAL.2005.1532851;10.1109/TVCG.2009.131,"Discontinuity, Scatterplot, Topology, Data Visualization",23,21,16,
InfoVis,2011,Arc Length-Based Aspect Ratio Selection,10.1109/TVCG.2011.167,http://dx.doi.org/10.1109/TVCG.2011.167,2276,2282,J,"The aspect ratio of a plot has a dramatic impact on our ability to perceive trends and patterns in the data. Previous approaches for automatically selecting the aspect ratio have been based on adjusting the orientations or angles of the line segments in the plot. In contrast, we recommend a simple, effective method for selecting the aspect ratio: minimize the arc length of the data curve while keeping the area of the plot constant. The approach is parameterization invariant, robust to a wide range of inputs, preserves visual symmetries in the data, and is a compromise between previously proposed techniques. Further, we demonstrate that it can be effectively used to select the aspect ratio of contour plots. We believe arc length should become the default aspect ratio selection method.",Justin Talbot;John Gerth;Pat Hanrahan,Justin Talbot;John Gerth;Pat Hanrahan,Stanford University;Stanford University;Stanford University,10.1109/TVCG.2006.163,"Aspect ratio selection, Banking to 45 degrees, Orientation resolution",23,14,17,
InfoVis,2012,Organizing Search Results with a Reference Map,10.1109/TVCG.2012.250,http://dx.doi.org/10.1109/TVCG.2012.250,2546,2555,J,"We propose a method to highlight query hits in hierarchically clustered collections of interrelated items such as digital libraries or knowledge bases. The method is based on the idea that organizing search results similarly to their arrangement on a fixed reference map facilitates orientation and assessment by preserving a user's mental map. Here, the reference map is built from an MDS layout of the items in a Voronoi treemap representing their hierarchical clustering, and we use techniques from dynamic graph layout to align query results with the map. The approach is illustrated on an archive of newspaper articles.",Arlind Nocaj;Ulrik Brandes,Arlind Nocaj;Ulrik Brandes,University of Konstanz;University of Konstanz,10.1109/INFVIS.2005.1532128;10.1109/INFVIS.1997.636718;10.1109/TVCG.2006.147;10.1109/TVCG.2010.154;10.1109/TVCG.2009.176,"Search results, mental map, voronoi treemaps, dynamic graph layout, multidimensional scaling, edge bundling",23,17,46,
InfoVis,2013,Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation,10.1109/TVCG.2013.187,http://dx.doi.org/10.1109/TVCG.2013.187,2326,2335,J,"Scatter plots are diagrams that visualize two-dimensional data as sets of points in the plane. They allow users to detect correlations and clusters in the data. Whether or not a user can accomplish these tasks highly depends on the aspect ratio selected for the plot, i.e., the ratio between the horizontal and the vertical extent of the diagram. We argue that an aspect ratio is good if the Delaunay triangulation of the scatter plot at this aspect ratio has some nice geometric property, e.g., a large minimum angle or a small total edge length. More precisely, we consider the following optimization problem. Given a set Q of points in the plane, find a scale factor s such that scaling the x-coordinates of the points in Q by s and the y-coordinates by 1=s yields a point set P(s) that optimizes a property of the Delaunay triangulation of P(s), over all choices of s. We present an algorithm that solves this problem efficiently and demonstrate its usefulness on real-world instances. Moreover, we discuss an empirical test in which we asked 64 participants to choose the aspect ratios of 18 scatter plots. We tested six different quality measures that our algorithm can optimize. In conclusion, minimizing the total edge length and minimizing what we call the 'uncompactness' of the triangles of the Delaunay triangulation yielded the aspect ratios that were most similar to those chosen by the participants in the test.",Martin Fink 0001;Jan-Henrik Haunert;Joachim Spoerhase;Alexander Wolff 0001,Martin Fink;Jan-Henrik Haunert;Joachim Spoerhase;Alexander Wolff,"Lehrstuhl I, Institut f&#x00FC;r Informatik, Universit&#x00C2;&#x00A8;at W&#x00FC;rzburg;Lehrstuhl I, Institut f&#x00FC;r Informatik, Universit&#x00C2;&#x00A8;at W&#x00FC;rzburg;Lehrstuhl I, Institut f&#x00FC;r Informatik, Universit&#x00C2;&#x00A8;at W&#x00FC;rzburg;Lehrstuhl I, Institut f&#x00FC;r Informatik, Universit&#x00C2;&#x00A8;at W&#x00FC;rzburg",10.1109/TVCG.2006.163;10.1109/TVCG.2012.196;10.1109/TVCG.2011.167,"Scatter plot, aspect ratio, Delaunay triangulation",23,19,28,
VAST,2013,An Extensible Framework for Provenance in Human Terrain Visual Analytics,10.1109/TVCG.2013.132,http://dx.doi.org/10.1109/TVCG.2013.132,2139,2148,J,"We describe and demonstrate an extensible framework that supports data exploration and provenance in the context of Human Terrain Analysis (HTA). Working closely with defence analysts we extract requirements and a list of features that characterise data analysed at the end of the HTA chain. From these, we select an appropriate non-classified data source with analogous features, and model it as a set of facets. We develop ProveML, an XML-based extension of the Open Provenance Model, using these facets and augment it with the structures necessary to record the provenance of data, analytical process and interpretations. Through an iterative process, we develop and refine a prototype system for Human Terrain Visual Analytics (HTVA), and demonstrate means of storing, browsing and recalling analytical provenance and process through analytic bookmarks in ProveML. We show how these bookmarks can be combined to form narratives that link back to the live data. Throughout the process, we demonstrate that through structured workshops, rapid prototyping and structured communication with intelligence analysts we are able to establish requirements, and design schema, techniques and tools that meet the requirements of the intelligence community. We use the needs and reactions of defence analysts in defining and steering the methods to validate the framework.",Rick Walker;Aidan Slingsby;Jason Dykes;Kai Xu 0003;Jo Wood;Phong H. Nguyen;Derek Stephens;B. L. William Wong;Yongjun Zheng,Rick Walker;Aiden Slingsby;Jason Dykes;Kai Xu;Jo Wood;Phong H. Nguyen;Derek Stephens;B.L. William Wong;Yongjun Zheng,Middlesex University;City University;City University;Middlesex University;City University;Middlesex University;Loughborough University;Middlesex University;Middlesex University,10.1109/TVCG.2012.252;10.1109/TVCG.2010.191;10.1109/VAST.2007.4388992;10.1109/TVCG.2006.142;10.1109/VAST.2006.261431;10.1109/TVCG.2010.154;10.1109/TVCG.2012.213;10.1109/INFVIS.2000.885086;10.1109/TVCG.2007.70577;10.1109/TVCG.2009.111;10.1109/VAST.2008.4677366;10.1109/VAST.2008.4677365;10.1109/VAST.2007.4388992;10.1109/TVCG.2009.128;10.1109/VAST.2009.5332611;10.1109/TVCG.2010.183;10.1109/VAST.2009.5333919;10.1109/TVCG.2011.209;10.1109/TVCG.2009.139;10.1109/TVCG.2008.175,"Human terrain analysis, provenance, framework, bookmarks, narratives",23,19,59,
VAST,2013,VAICo: Visual Analysis for Image Comparison,10.1109/TVCG.2013.213,http://dx.doi.org/10.1109/TVCG.2013.213,2090,2099,J,"Scientists, engineers, and analysts are confronted with ever larger and more complex sets of data, whose analysis poses special challenges. In many situations it is necessary to compare two or more datasets. Hence there is a need for comparative visualization tools to help analyze differences or similarities among datasets. In this paper an approach for comparative visualization for sets of images is presented. Well-established techniques for comparing images frequently place them side-by-side. A major drawback of such approaches is that they do not scale well. Other image comparison methods encode differences in images by abstract parameters like color. In this case information about the underlying image data gets lost. This paper introduces a new method for visualizing differences and similarities in large sets of images which preserves contextual information, but also allows the detailed analysis of subtle variations. Our approach identifies local changes and applies cluster analysis techniques to embed them in a hierarchy. The results of this process are then presented in an interactive web application which allows users to rapidly explore the space of differences and drill-down on particular features. We demonstrate the flexibility of our approach by applying it to multiple distinct domains.",Johanna Schmidt;M. Eduard Gröller;Stefan Bruckner,Johanna Schmidt;M. Eduard Gröller;Stefan Bruckner,Vienna University of Technology;Vienna University of Technology;University of Bergen,10.1109/TVCG.2007.70584;10.1109/TVCG.2007.70623;10.1109/VAST.2012.6400555;10.1109/TVCG.2010.190;10.1109/VISUAL.1999.809871;10.1109/VISUAL.1999.809873;10.1109/TVCG.2011.248;10.1109/VISUAL.2002.1183790,"Comparative visualization, focus+context visualization, image set comparison",23,29,41,
InfoVis,2014,"Node, Node-Link, and Node-Link-Group Diagrams: An Evaluation",10.1109/TVCG.2014.2346422,http://dx.doi.org/10.1109/TVCG.2014.2346422,2231,2240,J,"Effectively showing the relationships between objects in a dataset is one of the main tasks in information visualization. Typically there is a well-defined notion of distance between pairs of objects, and traditional approaches such as principal component analysis or multi-dimensional scaling are used to place the objects as points in 2D space, so that similar objects are close to each other. In another typical setting, the dataset is visualized as a network graph, where related nodes are connected by links. More recently, datasets are also visualized as maps, where in addition to nodes and links, there is an explicit representation of groups and clusters. We consider these three Techniques, characterized by a progressive increase of the amount of encoded information: node diagrams, node-link diagrams and node-link-group diagrams. We assess these three types of diagrams with a controlled experiment that covers nine different tasks falling broadly in three categories: node-based tasks, network-based tasks and group-based tasks. Our findings indicate that adding links, or links and group representations, does not negatively impact performance (time and accuracy) of node-based tasks. Similarly, adding group representations does not negatively impact the performance of network-based tasks. Node-link-group diagrams outperform the others on group-based tasks. These conclusions contradict results in other studies, in similar but subtly different settings. Taken together, however, such results can have significant implications for the design of standard and domain snecific visualizations tools.",Bahador Saket;Paolo Simonetto;Stephen G. Kobourov;Katy Börner,Bahador Saket;Paolo Simonetto;Stephen Kobourov;Katy Börner,University of Arizona;University of Arizona;University of Arizona;Indiana University,10.1109/INFVIS.2003.1249011;10.1109/TVCG.2011.186;10.1109/TVCG.2008.155;10.1109/INFVIS.1995.528686;10.1109/TVCG.2007.70596;10.1109/TVCG.2009.122;10.1109/TVCG.2013.187;10.1109/TVCG.2013.124,"graphs, networks, maps, scatter plots",23,22,48,
InfoVis,2014,Combing the Communication Hairball: Visualizing Parallel Execution Traces using Logical Time,10.1109/TVCG.2014.2346456,http://dx.doi.org/10.1109/TVCG.2014.2346456,2349,2358,J,"With the continuous rise in complexity of modern supercomputers, optimizing the performance of large-scale parallel programs is becoming increasingly challenging. Simultaneously, the growth in scale magnifies the impact of even minor inefficiencies - potentially millions of compute hours and megawatts in power consumption can be wasted on avoidable mistakes or sub-optimal algorithms. This makes performance analysis and optimization critical elements in the software development process. One of the most common forms of performance analysis is to study execution traces, which record a history of per-process events and interprocess messages in a parallel application. Trace visualizations allow users to browse this event history and search for insights into the observed performance behavior. However, current visualizations are difficult to understand even for small process counts and do not scale gracefully beyond a few hundred processes. Organizing events in time leads to a virtually unintelligible conglomerate of interleaved events and moderately high process counts overtax even the largest display. As an alternative, we present a new trace visualization approach based on transforming the event history into logical time inferred directly from happened-before relationships. This emphasizes the code's structural behavior, which is much more familiar to the application developer. The original timing data, or other information, is then encoded through color, leading to a more intuitive visualization. Furthermore, we use the discrete nature of logical timelines to cluster processes according to their local behavior leading to a scalable visualization of even long traces on large process counts. We demonstrate our system using two case studies on large-scale parallel codes.",Katherine E. Isaacs;Peer-Timo Bremer;Ilir Jusufi;Todd Gamblin;Abhinav Bhatele;Martin Schulz 0001;Bernd Hamann,Katherine E. Isaacs;Peer-Timo Bremer;Ilir Jusufi;Todd Gamblin;Abhinav Bhatele;Martin Schulz;Bernd Hamann,"University of California, Davis;Lawrence Livermore National Laboratory;University of California, Davis;Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory;University of California, Davis",10.1109/TVCG.2012.286;10.1109/TVCG.2009.196;10.1109/TVCG.2011.199;10.1109/TVCG.2013.200,"Information visualization, software visualization, timelines, traces, performance analysis",23,22,44,
VAST,2014,VAET: A Visual Analytics Approach for E-Transactions Time-Series,10.1109/TVCG.2014.2346913,http://dx.doi.org/10.1109/TVCG.2014.2346913,1743,1752,J,"Previous studies on E-transaction time-series have mainly focused on finding temporal trends of transaction behavior. Interesting transactions that are time-stamped and situation-relevant may easily be obscured in a large amount of information. This paper proposes a visual analytics system, Visual Analysis of E-transaction Time-Series (VAET), that allows the analysts to interactively explore large transaction datasets for insights about time-varying transactions. With a set of analyst-determined training samples, VAET automatically estimates the saliency of each transaction in a large time-series using a probabilistic decision tree learner. It provides an effective time-of-saliency (TOS) map where the analysts can explore a large number of transactions at different time granularities. Interesting transactions are further encoded with KnotLines, a compact visual representation that captures both the temporal variations and the contextual connection of transactions. The analysts can thus explore, select, and investigate knotlines of interest. A case study and user study with a real E-transactions dataset (26 million records) demonstrate the effectiveness of VAET.",Cong Xie;Wei Chen 0001;Xinxin Huang;Yueqi Hu;Scott Barlowe;Jing Yang,Cong Xie;Wei Chen;Xinxin Huang;Yueqi Hu;Scott Barlowe;Jing Yang,"State Key Lab of CAD&CG, Zhejiang University;State Key Lab of CAD&CG, Zhejiang University;State Key Lab of CAD&CG, Zhejiang University;Dept. of Computer Science, University of North Carolina, Charlotte;Western Carolina University;Dept. of Computer Science, University of North Carolina, Charlotte",10.1109/TVCG.2009.123;10.1109/VAST.2007.4389009;10.1109/TVCG.2012.212;10.1109/INFVIS.1995.528685;10.1109/VAST.2012.6400494;10.1109/TVCG.2010.162;10.1109/TVCG.2009.180,"Time-Series, Visual Analytics, E-transaction",23,35,27,
InfoVis,2015,Suggested Interactivity: Seeking Perceived Affordances for Information Visualization,10.1109/TVCG.2015.2467201,http://dx.doi.org/10.1109/TVCG.2015.2467201,639,648,J,"In this article, we investigate methods for suggesting the interactivity of online visualizations embedded with text. We first assess the need for such methods by conducting three initial experiments on Amazon's Mechanical Turk. We then present a design space for Suggested Interactivity (i. e., visual cues used as perceived affordances-SI), based on a survey of 382 HTML5 and visualization websites. Finally, we assess the effectiveness of three SI cues we designed for suggesting the interactivity of bar charts embedded with text. Our results show that only one cue (SI3) was successful in inciting participants to interact with the visualizations, and we hypothesize this is because this particular cue provided feedforward.",Jeremy Boy;Louis Eveillard;Françoise Détienne;Jean-Daniel Fekete,Jeremy Boy;Louis Eveillard;Françoise Detienne;Jean-Daniel Fekete,INRIA;EnsadLab;Telecom ParisTech;INRIA,10.1109/TVCG.2014.2346984;10.1109/TVCG.2013.134;10.1109/TVCG.2010.179;10.1109/INFVIS.2005.1532122,"Suggested interactivity, perceived affordances, information visualization for the people, online visualization",23,17,55,
InfoVis,2015,A Linguistic Approach to Categorical Color Assignment for Data Visualization,10.1109/TVCG.2015.2467471,http://dx.doi.org/10.1109/TVCG.2015.2467471,698,707,J,"When data categories have strong color associations, it is useful to use these semantically meaningful concept-color associations in data visualizations. In this paper, we explore how linguistic information about the terms defining the data can be used to generate semantically meaningful colors. To do this effectively, we need first to establish that a term has a strong semantic color association, then discover which color or colors express it. Using co-occurrence measures of color name frequencies from Google n-grams, we define a measure for colorability that describes how strongly associated a given term is to any of a set of basic color terms. We then show how this colorability score can be used with additional semantic analysis to rank and retrieve a representative color from Google Images. Alternatively, we use symbolic relationships defined by WordNet to select identity colors for categories such as countries or brands. To create visually distinct color palettes, we use k-means clustering to create visually distinct sets, iteratively reassigning terms with multiple basic color associations as needed. This can be additionally constrained to use colors only in a predefined palette.",Vidya Setlur;Maureen C. Stone,Vidya Setlur;Maureen C. Stone,Tableau Research;Tableau Research,,"linguistics, natural language processing, semantics, color names, categorical color, Google n-grams, WordNet, XKCD",23,25,45,
SciVis,2016,Hybrid Tactile/Tangible Interaction for 3D Data Exploration,10.1109/TVCG.2016.2599217,http://dx.doi.org/10.1109/TVCG.2016.2599217,881,890,J,"We present the design and evaluation of an interface that combines tactile and tangible paradigms for 3D visualization. While studies have demonstrated that both tactile and tangible input can be efficient for a subset of 3D manipulation tasks, we reflect here on the possibility to combine the two complementary input types. Based on a field study and follow-up interviews, we present a conceptual framework of the use of these different interaction modalities for visualization both separately and combined-focusing on free exploration as well as precise control. We present a prototypical application of a subset of these combined mappings for fluid dynamics data visualization using a portable, position-aware device which offers both tactile input and tangible sensing. We evaluate our approach with domain experts and report on their qualitative feedback.",Lonni Besançon;Paul Issartel;Mehdi Ammi;Tobias Isenberg 0001,Lonni Besançon;Paul Issartel;Mehdi Ammi;Tobias Isenberg,"Inria Saclay, Univ. Paris Saclay, France;Univ. Paris Saclay, France;Limsi/CNRS, France;Inria, France",10.1109/TVCG.2013.121;10.1109/TVCG.2010.164;10.1109/VISUAL.2004.47;10.1109/TVCG.2007.70515;10.1109/TVCG.2010.157;10.1109/VISUAL.2005.1532846;10.1109/TVCG.2011.224;10.1109/TVCG.2013.124;10.1109/TVCG.2015.2467202;10.1109/TVCG.2012.292;10.1109/TVCG.2013.126;10.1109/TVCG.2012.217,3D data visualization;Interaction;tactile input;tangible input,23,22,89,
VAST,2016,AxiSketcher: Interactive Nonlinear Axis Mapping of Visualizations through User Drawings,10.1109/TVCG.2016.2598446,http://dx.doi.org/10.1109/TVCG.2016.2598446,221,230,J,"Visual analytics techniques help users explore high-dimensional data. However, it is often challenging for users to express their domain knowledge in order to steer the underlying data model, especially when they have little attribute-level knowledge. Furthermore, users' complex, high-level domain knowledge, compared to low-level attributes, posits even greater challenges. To overcome these challenges, we introduce a technique to interpret a user's drawings with an interactive, nonlinear axis mapping approach called AxiSketcher. This technique enables users to impose their domain knowledge on a visualization by allowing interaction with data entries rather than with data attributes. The proposed interaction is performed through directly sketching lines over the visualization. Using this technique, users can draw lines over selected data points, and the system forms the axes that represent a nonlinear, weighted combination of multidimensional attributes. In this paper, we describe our techniques in three areas: 1) the design space of sketching methods for eliciting users' nonlinear domain knowledge; 2) the underlying model that translates users' input, extracts patterns behind the selected data points, and results in nonlinear axes reflecting users' complex intent; and 3) the interactive visualization for viewing, assessing, and reconstructing the newly formed, nonlinear axes.",Bum Chul Kwon;Hannah Kim;Emily Wall;Jaegul Choo;Haesun Park;Alex Endert,Bum Chul Kwon;Hannah Kim;Emily Wall;Jaegul Choo;Haesun Park;Alex Endert,"IBM T.J. Watson Research Center, Yorktown Heights, NY, USA;Georgia Institute of Technology, Atlanta, GA, USA;Georgia Institute of Technology, Atlanta, GA, USA;Korea University, Seoul, South Korea;Georgia Institute of Technology, Atlanta, GA, USA;Georgia Institute of Technology, Atlanta, GA, USA",10.1109/INFVIS.2004.60;10.1109/TVCG.2013.190;10.1109/TVCG.2015.2467615;10.1109/TVCG.2013.188;10.1109/TVCG.2014.2346481;10.1109/VAST.2011.6102449;10.1109/TVCG.2012.262;10.1109/TVCG.2015.2467591;10.1109/VAST.2010.5652443;10.1109/TVCG.2011.261;10.1109/TVCG.2013.191;10.1109/TVCG.2013.212;10.1109/TVCG.2013.167;10.1109/VAST.2012.6400486,axis mapping;interactive model steering;sketch;axis visualization;human-centered visual analytics,23,23,54,
VAST,2017,Comparing Visual-Interactive Labeling with Active Learning: An Experimental Study,10.1109/TVCG.2017.2744818,http://dx.doi.org/10.1109/TVCG.2017.2744818,298,308,J,"Labeling data instances is an important task in machine learning and visual analytics. Both fields provide a broad set of labeling strategies, whereby machine learning (and in particular active learning) follows a rather model-centered approach and visual analytics employs rather user-centered approaches (visual-interactive labeling). Both approaches have individual strengths and weaknesses. In this work, we conduct an experiment with three parts to assess and compare the performance of these different labeling strategies. In our study, we (1) identify different visual labeling strategies for user-centered labeling, (2) investigate strengths and weaknesses of labeling strategies for different labeling tasks and task complexities, and (3) shed light on the effect of using different visual encodings to guide the visual-interactive labeling process. We further compare labeling of single versus multiple instances at a time, and quantify the impact on efficiency. We systematically compare the performance of visual interactive labeling with that of active learning. Our main findings are that visual-interactive labeling can outperform active learning, given the condition that dimension reduction separates well the class distributions. Moreover, using dimension reduction in combination with additional visual encodings that expose the internal state of the learning model turns out to improve the performance of visual-interactive labeling.",Jürgen Bernard;Marco Hutter 0002;Matthias Zeppelzauer;Dieter W. Fellner;Michael Sedlmair,Jürgen Bernard;Marco Hutter;Matthias Zeppelzauer;Dieter Fellner;Michael Sedlmair,"Technische Universität Darmstadt, Darmstadt, Germany;Technische Universität Darmstadt, Darmstadt, Germany;St. Pölten University of Applied Sciences, St. Pölten, Austria;Fraunhofer IGD, Darmstadt, Germany;University of Vienna, Vienna, Austria",10.1109/VAST.2014.7042480;10.1109/VAST.2012.6400486;10.1109/TVCG.2012.277;10.1109/VAST.2012.6400492;10.1109/VAST.2010.5652392;10.1109/TVCG.2014.2346482;10.1109/TVCG.2016.2598589;10.1109/TVCG.2016.2598495;10.1109/TVCG.2013.153;10.1109/TVCG.2015.2467717,"Labeling,Visual-Interactive Labeling,Information Visualization,Visual Analytics,Active Learning,Machine Learning,Classification,Evaluation,Experiment,Dimensionality Reduction",23,15,72,
VAST,2017,Sequence Synopsis: Optimize Visual Summary of Temporal Event Data,10.1109/TVCG.2017.2745083,http://dx.doi.org/10.1109/TVCG.2017.2745083,45,55,J,"Event sequences analysis plays an important role in many application domains such as customer behavior analysis, electronic health record analysis and vehicle fault diagnosis. Real-world event sequence data is often noisy and complex with high event cardinality, making it a challenging task to construct concise yet comprehensive overviews for such data. In this paper, we propose a novel visualization technique based on the minimum description length (MDL) principle to construct a coarse-level overview of event sequence data while balancing the information loss in it. The method addresses a fundamental trade-off in visualization design: reducing visual clutter vs. increasing the information content in a visualization. The method enables simultaneous sequence clustering and pattern extraction and is highly tolerant to noises such as missing or additional events in the data. Based on this approach we propose a visual analytics framework with multiple levels-of-detail to facilitate interactive data exploration. We demonstrate the usability and effectiveness of our approach through case studies with two real-world datasets. One dataset showcases a new application domain for event sequence visualization, i.e., fault development path analysis in vehicles for predictive maintenance. We also discuss the strengths and limitations of the proposed method based on user feedback.",Yuanzhe Chen;Panpan Xu;Ren Liu,Yuanzhe Chen;Panpan Xu;Liu Ren,"Hong Kong University of Science and Technology;Bosch Research North America, Palo Alto, CA;Bosch Research North America, Palo Alto, CA",10.1109/VAST.2016.7883512;10.1109/TVCG.2013.214;10.1109/TVCG.2014.2346682;10.1109/TVCG.2015.2467622;10.1109/TVCG.2011.179;10.1109/TVCG.2016.2598797;10.1109/TVCG.2015.2467991;10.1109/TVCG.2013.200;10.1109/VAST.2015.7347682;10.1109/INFVIS.2000.885091;10.1109/TVCG.2016.2598591;10.1109/TVCG.2016.2598591;10.1109/TVCG.2009.117;10.1109/TVCG.2009.187;10.1109/VAST.2012.6400494;10.1109/TVCG.2012.225;10.1109/VAST.2009.5332595;10.1109/TVCG.2013.167,"Time Series Data,Data Transformation and Representation,Visual Knowledge Representation,Visual Analytics",23,19,60,
VAST,2017,"Warning, Bias May Occur: A Proposed Approach to Detecting Cognitive Bias in Interactive Visual Analytics",10.1109/VAST.2017.8585669,http://dx.doi.org/10.1109/VAST.2017.8585669,104,115,C,"Visual analytic tools combine the complementary strengths of humans and machines in human-in-the-loop systems. Humans provide invaluable domain expertise and sensemaking capabilities to this discourse with analytic models; however, little consideration has yet been given to the ways inherent human biases might shape the visual analytic process. In this paper, we establish a conceptual framework for considering bias assessment through human-in-the-loop systems and lay the theoretical foundations for bias measurement. We propose six preliminary metrics to systematically detect and quantify bias from user interactions and demonstrate how the metrics might be implemented in an existing visual analytic system, InterAxis. We discuss how our proposed metrics could be used by visual analytic systems to mitigate the negative effects of cognitive biases by making users aware of biased processes throughout their analyses.",Emily Wall;Leslie M. Blaha;Lyndsey Franklin;Alex Endert,Emily Wall;Leslie M. Blaha;Lyndsey Franklin;Alex Endert,Georgia Tech;Pacific Northwest National Laboratory;Pacific Northwest National Laboratory;Georgia Tech,10.1109/VAST.2012.6400486;10.1109/TVCG.2014.2346575;10.1109/VAST.2015.7347625;10.1109/TVCG.2016.2598594;10.1109/VAST.2011.6102449;10.1109/TVCG.2016.2599058;10.1109/VAST.2008.4677365;10.1109/VAST.2008.4677361;10.1109/VISUAL.2000.885678;10.1109/TVCG.2015.2467615;10.1109/TVCG.2016.2598446;10.1109/TVCG.2012.273;10.1109/TVCG.2015.2467551;10.1109/TVCG.2015.2467591;10.1109/TVCG.2014.2346481;10.1109/TVCG.2016.2598466;10.1109/TVCG.2017.2745078;10.1109/TVCG.2007.70589;10.1109/TVCG.2007.70515,"cognitive bias,visual analytics,human-in-the-loop,mixed initiative,user interaction,H.5.0 [Information Systems]: Human-Computer Interaction-General",23,15,80,
InfoVis,1997,Design and evaluation of incremental data structures and algorithms for dynamic query interfaces,10.1109/INFVIS.1997.636790,http://dx.doi.org/10.1109/INFVIS.1997.636790,81,86,C,"A dynamic query interface (DQI) is a database access mechanism that provides continuous real-time feedback to the user during query formulation. Previous work shows that DQIs are elegant and powerful interfaces to small databases. Unfortunately, when applied to large databases, previous DQI algorithms slow to a crawl. We present a new incremental approach to DQI algorithms and display updates that work well with large databases, both in theory and in practice.",Egemen Tanin;Richard Beigel;Ben Shneiderman,E. Tanin;R. Beigel;B. Shneiderman,"Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA",10.1109/INFVIS.1995.528688;10.1109/INFVIS.1995.528688,"Data Structure, Algorithm, Database, User Interface, Information Visualization, Direct Manipulation, Dynamic Query",22,5,14,
Vis,1998,Task-specific visualization design: a case study in operational weather forecasting,10.1109/VISUAL.1998.745330,http://dx.doi.org/10.1109/VISUAL.1998.745330,405,409,C,"Efforts to create highly generic visualizations, both content and interface, often when applied to non research oriented or operational activities are composed of several goals. Although these goals may appear to be related, they are often composed of distinct tasks. Generic solutions, even if domain-specific, may lack sufficient focus to be effective for such purposes. The design of different visualization tools matched to a set of tasks but built on top of a common framework with a similar approach to content is a promising alternative. This hypothesis is tested in detail by application to a demanding problem-operational weather forecasting.",Lloyd Treinish,L.A. Treinish,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.1995.480821;10.1109/VISUAL.1997.663922;10.1109/VISUAL.1994.346316;10.1109/INFVIS.1996.559211,,22,9,15,
Vis,1999,Large field visualization with demand-driven calculation,10.1109/VISUAL.1999.809864,http://dx.doi.org/10.1109/VISUAL.1999.809864,27,506,C,"Presents a system designed for the interactive definition and visualization of fields derived from large data sets: the Demand-Driven Visualizer (DDV). The system allows the user to write arbitrary expressions to define new fields, and then apply a variety of visualization techniques to the result. Expressions can include differential operators and numerous other built-in functions. Determination of field values, both in space and in time, is directed automatically by the demands of the visualization techniques. The payoff of following a demand-driven design philosophy throughout the visualization system becomes particularly evident when working with large time-series data, where the costs of eager evaluation alternatives can be prohibitive.",Patrick J. Moran;Chris Henze,P.J. Moran;C. Henze,"MRI Technol. Solutions, NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1992.235219;10.1109/VISUAL.1997.663888;10.1109/VISUAL.1996.568115;10.1109/VISUAL.1994.346311;10.1109/VISUAL.1993.398860;10.1109/VISUAL.1990.146360;10.1109/VISUAL.1997.663898;10.1109/VISUAL.1995.480821,"large scale visualization, scientific visualization, interactive visualization, demand-driven evaluation, lazy evaluation, interpreted systems, Python",22,10,21,
Vis,1999,Feature Comparisons Of 3-D Vector Fields Using Earth Mover's Distance,10.1109/VISUAL.1999.809874,http://dx.doi.org/10.1109/VISUAL.1998.745291,105,,C,"A method for comparing three-dimensional vector fields constructed from simple critical points is described. This method is a natural extension of previous work (Y. Lavin et al., 1998), which defined a distance metric for comparing two-dimensional fields. The extension to three-dimensions follows the path of our previous work, rethinking the representation of a critical point signature and the distance measure between the points. Since the method relies on topologically based information, problems such as grid matching and vector alignment which often complicate other comparison techniques are avoided. In addition, since only feature information is used to represent, and is therefore stored for each field, a significant amount of compression occurs.",Rajesh Batra;Lambertus Hesselink,R. Batra;L. Hesselink,"Dept. of Aeronaut. & Astronaut., Stanford Univ., CA, USA",10.1109/VISUAL.1998.745291;10.1109/VISUAL.1998.745332,,22,2,0,
Vis,2000,Image based rendering with stable frame rates,10.1109/VISUAL.2000.885702,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2000.885702,251,258,C,"Presents an efficient keyframeless image-based rendering technique. An intermediate image is used to exploit the coherences among neighboring frames. The pixels in the intermediate image are first rendered by a ray-casting method and then warped to the intermediate image at the current viewpoint and view direction. We use an offset buffer to record the precise positions of these pixels in the intermediate image. Every frame is generated in three steps: warping the intermediate image onto the frame, filling in holes, and selectively rendering a group of ""old"" pixels. By dynamically adjusting the number of those ""old"" pixels in the last step, the workload at every frame can be balanced. The pixels generated by the last two steps make contributions to the new intermediate image. Unlike occasional keyframes in conventional image-based rendering, which need to be totally re-rendered, intermediate images only need to be partially updated at every frame. In this way, we guarantee more stable frame rates and more uniform image qualities. The intermediate image can be warped efficiently by a modified incremental 3D warp algorithm. As a specific application, we demonstrate our technique with a voxel-based terrain rendering system.",Huamin Qu;Ming Wan;Jiafa Qin;Arie E. Kaufman,Huamin Qu;Ming Wan;Jiafa Qin;A. Kaufman,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1992.235190;10.1109/VISUAL.1998.745305;10.1109/VISUAL.1999.809900,"Image-based rendering, ray casting, voxel-based modeling,terrain rendering",22,0,0,
Vis,2000,A continuous clustering method for vector fields,10.1109/VISUAL.2000.885715,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2000.885715,351,358,C,"A new method for the simplification of flow fields is presented. It is based on continuous clustering. A well-known physical clustering model, the Cahn Hilliard model (J. Cahn and J. Hilliard, 1958), which describes phase separation, is modified to reflect the properties of the data to be visualized. Clusters are defined implicitly as connected components of the positivity set of a density function. An evolution equation for this function is obtained as a suitable gradient flow of an underlying anisotropic energy functional. Here, time serves as the scale parameter. The evolution is characterized by a successive coarsening of patterns: the actual clustering, and meanwhile the underlying simulation data specifies preferable pattern boundaries. The authors discuss the applicability of this new type of approach mainly for flow fields, where the cluster energy penalizes cross streamline boundaries, but the method also carries provisions in other fields as well. The clusters are visualized via iconic representations. A skeletonization algorithm is used to find suitable positions for the icons.",Harald Garcke;Tobias Preußer;Martin Rumpf;Alexandru Telea;Ulrich Weikard;Jarke J. van Wijk,H. Garcke;T. Preusser;M. Rumpf;A. Telea;U. Weikard;J. Van Wijk,,10.1109/VISUAL.1999.809865;10.1109/VISUAL.1995.480817;10.1109/VISUAL.1994.346313;10.1109/VISUAL.1999.809863;10.1109/VISUAL.1995.485141;10.1109/VISUAL.1999.809892;10.1109/VISUAL.1996.567777;10.1109/VISUAL.1999.809904,,22,4,0,
InfoVis,2002,Multiple foci drill-down through tuple and attribute aggregation polyarchies in tabular data,10.1109/INFVIS.2002.1173158,http://dx.doi.org/10.1109/INFVIS.2002.1173158,131,134,C,"Information analysis often involves decomposing data into sub-groups to allow for comparison and identification of relationships. Breakdown Visualization provides a mechanism to support this analysis through user guided drill-down of polyarchical metadata. This metadata describes multiple hierarchical structures for organizing tuple aggregations and table attributes. This structure is seen in financial data, organizational structures, sport statistics, and other domains. A spreadsheet format enables comparison of visualizations at any level of the hierarchy. Breakdown Visualization allows users to drill-down a single hierarchy then pivot into another hierarchy within the same view. It utilizes a fix and move technique that allows users to select multiple foci for drill-down.",Nathan Conklin;Sandeep Prabhakar;Chris North 0001,N. Conklin;S. Prabhakar;C. North,"Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA;Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA;Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA",10.1109/INFVIS.2000.885086;10.1109/INFVIS.1997.636761;10.1109/INFVIS.1996.559210,,22,7,14,
Vis,2002,A radial focus+context visualization for multi-dimensional functions,10.1109/VISUAL.2002.1183806,http://dx.doi.org/10.1109/VISUAL.2002.1183806,443,450,C,"The analysis of multidimensional functions is important in many engineering disciplines, and poses a major problem as the number of dimensions increases. Previous visualization approaches focus on representing three or fewer dimensions at a time. This paper presents a new focus+context visualization that provides an integrated overview of an entire multidimensional function space, with uniform treatment of all dimensions. The overview is displayed with respect to a user-controlled polar focal point in the function's parameter space. Function value patterns are viewed along rays that emanate from the focal point in all directions in the parameter space, and represented radially around the focal point in the visualization. Data near the focal point receives proportionally more screen space than distant data. This approach scales smoothly from two dimensions to 10-20, with a 1000 pixel range on each dimension.",Sanjini Jayaraman;Chris North 0001,S. Jayaraman;C. North,"Center for Human Comput. Interaction, Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA;Center for Human Comput. Interaction, Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA",10.1109/INFVIS.1997.636793;10.1109/INFVIS.1995.528688;10.1109/VISUAL.1993.398859;10.1109/INFVIS.1998.729558,"visualization, multidimensional functions",22,8,11,
Vis,2003,Interactive protein manipulation,10.1109/VISUAL.2003.1250423,http://dx.doi.org/10.1109/VISUAL.2003.1250423,581,588,C,"We describe an interactive visualization and modeling program for the creation of protein structures ""from scratch."" The input to our program is an amino acid sequence - decoded from a gene - and a sequence of predicted secondary structure types for each amino acid - provided by external structure prediction programs. Our program can be used in the set-up phase of a protein structure prediction process; the structures created with it serve as input for a subsequent global internal energy minimization, or another method of protein structure prediction. Our program supports basic visualization methods for protein structures, interactive manipulation based on inverse kinematics, and visualization guides to aid a user in creating ""good"" initial structures.",Oliver Kreylos;Nelson L. Max;Bernd Hamann;Silvia N. Crivelli;E. Wes Bethel,O. Kreylos;N.L. Max;B. Hamann;S.N. Crivelli;E. Wes Bethel,"Dept. of Comput. Sci., Univ. of California, Davis, CA, USA;Dept. of Comput. Sci., Univ. of California, Davis, CA, USA;Dept. of Comput. Sci., Univ. of California, Davis, CA, USA",,"Protein Structure Prediction, Protein Manipulation, Inverse Kinematics, Molecular Modeling, Molecular Visualization, Interactive Visualization, Computational Science",22,5,14,BA
Vis,2005,Visualizing intersecting surfaces with nested-surface techniques,10.1109/VISUAL.2005.1532835,http://dx.doi.org/10.1109/VISUAL.2005.1532835,503,510,C,"This paper describes the adaptation and evaluation of existing nested-surface visualization techniques for the problem of displaying intersecting surfaces. For this work, we collaborated with a neurosurgeon who is comparing multiple tumor segmentations with the goal of increasing the segmentation accuracy and reliability. A second collaborator, a physicist, aims to validate geometric models of specimens against atomic-force microscope images of actual specimens. These collaborators are interested in comparing both surface shape and inter-surface distances. Many commonly employed techniques for visually comparing multiple surfaces (side-by-side, wireframe, colormaps, uniform translucence) do not simultaneously convey inter-surface distance and the shapes of two or more surfaces. This paper describes a simple geometric partitioning of intersecting surfaces that enables the application of existing nested-surface techniques, such as texture-modulated translucent rendering of exteriors, to a broader range of visualization problems. Three user studies investigate the performance of existing techniques and a new shadow-casting glyph technique. The results of the first user study show that texture glyphs on partitioned, intersecting surfaces can convey inter-surface distance better than directly mapping distance to a red-gray-blue color scale on a single surface. The results of the second study show similar results for conveying local surface orientation. The results of the third user study show that adding cast shadows to texture glyphs can increase the understanding of inter-surface distance in static images, but can be overpowered by the shape cues from a simple rocking motion.",Chris Weigle;Russell M. Taylor II,C. Weigle;R.M. Taylor,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.1996.568118;10.1109/VISUAL.1996.568111;10.1109/INFVIS.2003.1249022;10.1109/VISUAL.2000.885723,"perception, user study, transparent surfaces, nested surfaces, intersecting surfaces, two-surface visualization, scientific visualization",22,5,33,
Vis,2006,Visualization of fibrous and Thread-like Data,10.1109/TVCG.2006.197,http://dx.doi.org/10.1109/TVCG.2006.197,1165,1172,J,"Thread-like structures are becoming more common in modern volumetric data sets as our ability to image vascular and neural tissue at higher resolutions improves. The thread-like structures of neurons and micro-vessels pose a unique problem in visualization since they tend to be densely packed in small volumes of tissue. This makes it difficult for an observer to interpret useful patterns from the data or trace individual fibers. In this paper we describe several methods for dealing with large amounts of thread-like data, such as data sets collected using knife-edge scanning microscopy (KESM) and serial block-face scanning electron microscopy (SBF-SEM). These methods allow us to collect volumetric data from embedded samples of whole-brain tissue. The neuronal and microvascular data that we acquire consists of thin, branching structures extending over very large regions. Traditional visualization schemes are not sufficient to make sense of the large, dense, complex structures encountered. In this paper, we address three methods to allow a user to explore a fiber network effectively. We describe interactive techniques for rendering large sets of neurons using self-orienting surfaces implemented on the GPU. We also present techniques for rendering fiber networks in a way that provides useful information about flow and orientation. Third, a global illumination framework is used to create high-quality visualizations that emphasize the underlying fiber structure. Implementation details, performance, and advantages and disadvantages of each approach are discussed",Zeki Melek;David Mayerich;Cem Yuksel;John Keyser,Zeki Melek;David Mayerich;Cem Yuksel;John Keyser,Computer Science at Texas A&M University;Computer Science at Texas A&M University;Visualization Science at Texas A&M University;Computer Science at Texas A&M University,10.1109/VISUAL.2005.1532859;10.1109/VISUAL.2003.1250399;10.1109/VISUAL.2005.1532780,"neuron visualization, GPU acceleration, global illumination, orientation filtering",22,17,17,
Vis,2007,A Unified Paradigm For Scalable Multi-Projector Displays,10.1109/TVCG.2007.70536,http://dx.doi.org/10.1109/TVCG.2007.70536,1360,1367,J,"We present a general framework for the modeling and optimization of scalable multi-projector displays. Based on this framework, we derive algorithms that can robustly optimize the visual quality of an arbitrary combination of projectors without manual adjustment. When the projectors are tiled, we show that our framework automatically produces blending maps that outperform state-of-the-art projector blending methods. When all the projectors are superimposed, the framework can produce high-resolution images beyond the Nyquist resolution limits of component projectors. When a combination of tiled and superimposed projectors are deployed, the same framework harnesses the best features of both tiled and superimposed multi-projector projection paradigms. The framework creates for the first time a new unified paradigm that is agnostic to a particular configuration of projectors yet robustly optimizes for the brightness, contrast, and resolution of that configuration. In addition, we demonstrate that our algorithms support high resolution video at real-time interactive frame rates achieved on commodity graphics platforms. This work allows for inexpensive, compelling, flexible, and robust large scale visualization systems to be built and deployed very efficiently.",Niranjan Damera-Venkata;Nelson L. Chang;Jeffrey M. DiCarlo,Niranjan Damera-Venkata;Nelson Chang;Jeffrey Dicarlo,"Hewlett-Packard Laboratories in Palo Alto, CA.;Hewlett-Packard Laboratories in Palo Alto, CA.;Hewlett-Packard Laboratories in Palo Alto, CA.",10.1109/VISUAL.1999.809883,"Multi-projector displays, tiled displays, large format displays, blending, stitching, automatic geometric alignment, photometric correction, super-resolution, superimposed projection",22,16,22,
Vis,2007,Scalable Hybrid Unstructured and Structured Grid Raycasting,10.1109/TVCG.2007.70588,http://dx.doi.org/10.1109/TVCG.2007.70588,1592,1599,J,"This paper presents a scalable framework for real-time raycasting of large unstructured volumes that employs a hybrid bricking approach. It adaptively combines original unstructured bricks in important (focus) regions, with structured bricks that are resampled on demand in less important (context) regions. The basis of this focus+context approach is interactive specification of a scalar degree of interest (DOI) function. Thus, rendering always considers two volumes simultaneously: a scalar data volume, and the current DOI volume. The crucial problem of visibility sorting is solved by raycasting individual bricks and compositing in visibility order from front to back. In order to minimize visual errors at the grid boundary, it is always rendered accurately, even for resampled bricks. A variety of different rendering modes can be combined, including contour enhancement. A very important property of our approach is that it supports a variety of cell types natively, i.e., it is not constrained to tetrahedral grids, even when interpolation within cells is used. Moreover, our framework can handle multi-variate data, e.g., multiple scalar channels such as temperature or pressure, as well as time-dependent data. The combination of unstructured and structured bricks with different quality characteristics such as the type of interpolation or resampling resolution in conjunction with custom texture memory management yields a very scalable system.",Philipp Muigg;Markus Hadwiger;Helmut Doleisch;Helwig Hauser,Philipp Muigg;Markus Hadwiger;Helmut Doleisch;Helwig Hauser,"VRVis Research Center, Austria;VRVis Research Center, Austria;VRVis Research Center, Austria;University of Bergen, Norway",10.1109/TVCG.2006.171;10.1109/VISUAL.2003.1250390;10.1109/TVCG.2006.124;10.1109/VISUAL.2001.964514;10.1109/TVCG.2006.152;10.1109/TVCG.2006.110;10.1109/TVCG.2006.154;10.1109/VISUAL.2000.885683;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2001.964512;10.1109/VISUAL.1999.809908,"Volume Rendering of Unstructured Grids, Focus+Context Techniques, Hardware-Assisted Volume Rendering",22,16,37,
InfoVis,2008,Interactive Visual Analysis of Set-Typed Data,10.1109/TVCG.2008.144,http://dx.doi.org/10.1109/TVCG.2008.144,1340,1347,J,"While it is quite typical to deal with attributes of different data types in the visualization of heterogeneous and multivariate datasets, most existing techniques still focus on the most usual data types such as numerical attributes or strings. In this paper we present a new approach to the interactive visual exploration and analysis of data that contains attributes which are of set type. A set-typed attribute of a data item - like one cell in a table - has a list of nGt=0 elements as its value. We present the setpsilaopsilagram as a new visualization approach to represent data of set type and to enable interactive visual exploration and analysis. We also demonstrate how this approach is capable to help in dealing with datasets that have a larger number of dimensions (more than a dozen or more), especially also in the context of categorical data. To illustrate the effectiveness of our approach, we present the interactive visual analysis of a CRM dataset with data from a questionnaire on the education and shopping habits of about 90000 people.",Wolfgang Freiler;Kresimir Matkovic;Helwig Hauser,Wolfgang Freiler;Kresimir Matkovic;Helwig Hauser,"VRVis Research Center, Vienna, Austria;VRVis Research Center, Vienna, Austria;University of Bergen, Norway",10.1109/INFVIS.1999.801860;10.1109/VISUAL.1990.146402;10.1109/INFVIS.2001.963288;10.1109/INFVIS.2003.1249016;10.1109/VAST.2007.4389006;10.1109/INFVIS.2005.1532139;10.1109/VISUAL.1991.175815,"Interactive Visual Analysis, Multidimensional Multivariate Data Visualization, Categorical Data Visualization, Interactive Visualization, Focus+Context Visualization, Multiple Coordinated Views",22,16,15,
Vis,2008,Novel interaction techniques for neurosurgical planning and stereotactic navigation,10.1109/TVCG.2008.150,http://dx.doi.org/10.1109/TVCG.2008.150,1587,1594,J,"Neurosurgical planning and image guided neurosurgery require the visualization of multimodal data obtained from various functional and structural image modalities, such as magnetic resonance imaging (MRI), computed tomography (CT), functional MRI, Single photon emission computed tomography (SPECT) and so on. In the case of epilepsy neurosurgery for example, these images are used to identify brain regions to guide intracranial electrode implantation and resection. Generally, such data is visualized using 2D slices and in some cases using a 3D volume rendering along with the functional imaging results. Visualizing the activation region effectively by still preserving sufficient surrounding brain regions for context is exceedingly important to neurologists and surgeons. We present novel interaction techniques for visualization of multimodal data to facilitate improved exploration and planning for neurosurgery. We extended the line widget from VTK to allow surgeons to control the shape of the region of the brain that they can visually crop away during exploration and surgery. We allow simple spherical, cubical, ellipsoidal and cylindrical (probe aligned cuts) for exploration purposes. In addition we integrate the cropping tool with the image-guided navigation system used for epilepsy neurosurgery. We are currently investigating the use of these new tools in surgical planning and based on further feedback from our neurosurgeons we will integrate them into the setup used for image-guided neurosurgery.",Alark Joshi;Dustin Scheinost;Kenneth P. Vives;Dennis D. Spencer;Lawrence H. Staib;Xenophon Papademetris,Alark Joshi;Dustin Scheinost;Kenneth Vives;Dennis Spencer;Lawrence Staib;Xenophon Papademetris,Yale University;Yale University;Yale University;Yale University;Yale University;Yale University,10.1109/VISUAL.2000.885694;10.1109/VISUAL.2002.1183762,"User interaction, irregular cropping",22,19,17,
VAST,2010,Visual readability analysis: How to make your writings easier to read,10.1109/VAST.2010.5652926,http://dx.doi.org/10.1109/VAST.2010.5652926,123,130,C,"We present a tool that is specifically designed to support a writer in revising a draft-version of a document. In addition to showing which paragraphs and sentences are difficult to read and understand, we assist the reader in understanding why this is the case. This requires features that are expressive predictors of readability, and are also semantically understandable. In the first part of the paper, we therefore discuss a semi-automatic feature selection approach that is used to choose appropriate measures from a collection of 141 candidate readability features. In the second part, we present the visual analysis tool VisRA, which allows the user to analyze the feature values across the text and within single sentences. The user can choose different visual representations accounting for differences in the size of the documents and the availability of information about the physical and logical layout of the documents. We put special emphasis on providing as much transparency as possible to ensure that the user can purposefully improve the readability of a sentence. Several case-studies are presented that show the wide range of applicability of our tool.",Daniela Oelke;David Spretke;Andreas Stoffel;Daniel A. Keim,Daniela Oelke;David Spretke;Andreas Stoffel;Daniel A. Keim,University of Konstanz;University of Konstanz;University of Konstanz;University of Konstanz,10.1109/VAST.2007.4389004,,22,3,29,BP
Vis,2010,A Curved Ray Camera for Handling Occlusions through Continuous Multiperspective Visualization,10.1109/TVCG.2010.127,http://dx.doi.org/10.1109/TVCG.2010.127,1235,1242,J,"Most images used in visualization are computed with the planar pinhole camera. This classic camera model has important advantages such as simplicity, which enables efficient software and hardware implementations, and similarity to the human eye, which yields images familiar to the user. However, the planar pinhole camera has only a single viewpoint, which limits images to parts of the scene to which there is direct line of sight. In this paper we introduce the curved ray camera to address the single viewpoint limitation. Rays are C&lt;sup&gt;1&lt;/sup&gt;-continuous curves that bend to circumvent occluders. Our camera is designed to provide a fast 3-D point projection operation, which enables interactive visualization. The camera supports both 3-D surface and volume datasets. The camera is a powerful tool that enables seamless integration of multiple perspectives for overcoming occlusions in visualization while minimizing distortions.",Jian Cui;Paul Rosen;Voicu Popescu;Christoph M. Hoffmann,Jian Cui;Paul Rosen;Voicu Popescu;Christoph Hoffmann,Purdue University;University of Utah;Purdue University;Purdue University,10.1109/TVCG.2008.124;10.1109/VISUAL.2004.50;10.1109/TVCG.2006.140;10.1109/TVCG.2006.167;10.1109/INFVIS.2003.1249008;10.1109/TVCG.2006.124,"Alleviating occlusions, camera model, curved rays, multiperspective visualization, interactive visualization",22,21,28,
Vis,2010,Analysis of Recurrent Patterns in Toroidal Magnetic fields,10.1109/TVCG.2010.133,http://dx.doi.org/10.1109/TVCG.2010.133,1431,1440,J,"In the development of magnetic confinement fusion which will potentially be a future source for low cost power, physicists must be able to analyze the magnetic field that confines the burning plasma. While the magnetic field can be described as a vector field, traditional techniques for analyzing the field's topology cannot be used because of its Hamiltonian nature. In this paper we describe a technique developed as a collaboration between physicists and computer scientists that determines the topology of a toroidal magnetic field using fieldlines with near minimal lengths. More specifically, we analyze the Poincaré map of the sampled fieldlines in a Poincaré section including identifying critical points and other topological features of interest to physicists. The technique has been deployed into an interactiveparallel visualization tool which physicists are using to gain new insight into simulations of magnetically confined burning plasmas.",Allen R. Sanderson;Guoning Chen;Xavier Tricoche;David Pugmire;Scott Kruger;Joshua A. Breslau,Allen Sanderson;Guoning Chen;Xavier Tricoche;David Pugmire;Scott Kruger;Joshua Breslau,"SCI Institute, University of Utah;SCI Institute, University of Utah;Purdue University;Oak Ridge National Laboratory;Tech-X Corporation;Princeton Plasma Physics Laboratory",10.1109/VISUAL.2005.1532842;10.1109/VISUAL.2001.964507;10.1109/VISUAL.2003.1250376;10.1109/VISUAL.1997.663858,"Confined magnetic fusion, magnetic field visualization, Poincare map, periodic magnetic fieldlines, recurrent patterns",22,22,44,
InfoVis,2011,Synthetic Generation of High-Dimensional Datasets,10.1109/TVCG.2011.237,http://dx.doi.org/10.1109/TVCG.2011.237,2317,2324,J,"Generation of synthetic datasets is a common practice in many research areas. Such data is often generated to meet specific needs or certain conditions that may not be easily found in the original, real data. The nature of the data varies according to the application area and includes text, graphs, social or weather data, among many others. The common process to create such synthetic datasets is to implement small scripts or programs, restricted to small problems or to a specific application. In this paper we propose a framework designed to generate high dimensional datasets. Users can interactively create and navigate through multi dimensional datasets using a suitable graphical user-interface. The data creation is driven by statistical distributions based on a few user-defined parameters. First, a grounding dataset is created according to given inputs, and then structures and trends are included in selected dimensions and orthogonal projection planes. Furthermore, our framework supports the creation of complex non-orthogonal trends and classified datasets. It can successfully be used to create synthetic datasets simulating important trends as multidimensional clusters, correlations and outliers.",Georgia Albuquerque;Thomas Löwe;Marcus A. Magnor,Georgia Albuquerque;Thomas Lowe;Marcus Magnor,TU Braunschweig;TU Braunschweig;TU Braunschweig,10.1109/INFVIS.2005.1532142;10.1109/VISUAL.1994.346302;10.1109/VAST.2010.5652433;10.1109/VAST.2009.5332628;10.1109/INFVIS.2004.15;10.1109/TVCG.2008.153,"Synthetic data generation, multivariate data, high-dimensional data, interaction",22,25,20,
Vis,2011,Hierarchical Event Selection for Video Storyboards with a Case Study on Snooker Video Visualization,10.1109/TVCG.2011.208,http://dx.doi.org/10.1109/TVCG.2011.208,1747,1756,J,"Video storyboard, which is a form of video visualization, summarizes the major events in a video using illustrative visualization. There are three main technical challenges in creating a video storyboard, (a) event classification, (b) event selection and (c) event illustration. Among these challenges, (a) is highly application-dependent and requires a significant amount of application specific semantics to be encoded in a system or manually specified by users. This paper focuses on challenges (b) and (c). In particular, we present a framework for hierarchical event representation, and an importance-based selection algorithm for supporting the creation of a video storyboard from a video. We consider the storyboard to be an event summarization for the whole video, whilst each individual illustration on the board is also an event summarization but for a smaller time window. We utilized a 3D visualization template for depicting and annotating events in illustrations. To demonstrate the concepts and algorithms developed, we use Snooker video visualization as a case study, because it has a concrete and agreeable set of semantic definitions for events and can make use of existing techniques of event detection and 3D reconstruction in a reliable manner. Nevertheless, most of our concepts and algorithms developed for challenges (b) and (c) can be applied to other application areas.",Matthew L. Parry;Philip A. Legg;David H. S. Chung;Iwan W. Griffiths;Min Chen 0001,Matthew L. Parry;Philip A. Legg;David H.S. Chung;Iwan W. Griffiths;Min Chen,Swansea University;Swansea University;Swansea University;Swansea University;Swansea University,10.1109/TVCG.2008.185;10.1109/INFVIS.2004.27;10.1109/VISUAL.2003.1250401;10.1109/TVCG.2007.70544;10.1109/TVCG.2006.194,"Multimedia visualization, Time series data, Illustrative visualization",22,18,29,
Vis,2011,Vortex Visualization in Ultra Low Reynolds Number Insect Flight,10.1109/TVCG.2011.260,http://dx.doi.org/10.1109/TVCG.2011.260,2071,2079,J,"We present the visual analysis of a biologically inspired CFD simulation of the deformable flapping wings of a dragonfly as it takes off and begins to maneuver, using vortex detection and integration-based flow lines. The additional seed placement and perceptual challenges introduced by having multiple dynamically deforming objects in the highly unsteady 3D flow domain are addressed. A brief overview of the high speed photogrammetry setup used to capture the dragonfly takeoff, parametric surfaces used for wing reconstruction, CFD solver and underlying flapping flight theory is presented to clarify the importance of several unsteady flight mechanisms, such as the leading edge vortex, that are captured visually. A novel interactive seed placement method is used to simplify the generation of seed curves that stay in the vicinity of relevant flow phenomena as they move with the flapping wings. This method allows a user to define and evaluate the quality of a seed's trajectory over time while working with a single time step. The seed curves are then used to place particles, streamlines and generalized streak lines. The novel concept of flowing seeds is also introduced in order to add visual context about the instantaneous vector fields surrounding smoothly animate streak lines. Tests show this method to be particularly effective at visually capturing vortices that move quickly or that exist for a very brief period of time. In addition, an automatic camera animation method is used to address occlusion issues caused when animating the immersed wing boundaries alongside many geometric flow lines. Each visualization method is presented at multiple time steps during the up-stroke and down-stroke to highlight the formation, attachment and shedding of the leading edge vortices in pairs of wings. Also, the visualizations show evidence of wake capture at stroke reversal which suggests the existence of previously unknown unsteady lift generation mechanisms that are unique to quad wing insects.",Christopher Koehler;Thomas Wischgoll;Haibo Dong;Zachary Gaston,Christopher Koehler;Thomas Wischgoll;Haibo Dong;Zachary Gaston,Wright State University College of Engineering and Computer Science;Wright State University College of Engineering and Computer Science;Wright State University College of Mechanical and Materials Engineering;Wright State University College of Mechanical and Materials Engineering,10.1109/VISUAL.2002.1183789;10.1109/VISUAL.2005.1532830;10.1109/TVCG.2007.70557;10.1109/VISUAL.2005.1532831;10.1109/TVCG.2008.163;10.1109/TVCG.2010.169;10.1109/VISUAL.2005.1532848;10.1109/VISUAL.2005.1532850;10.1109/TVCG.2010.212;10.1109/VISUAL.2000.885690;10.1109/TVCG.2010.198;10.1109/VISUAL.2004.113;10.1109/VISUAL.1998.745296;10.1109/TVCG.2007.70595;10.1109/TVCG.2009.190;10.1109/TVCG.2008.133;10.1109/TVCG.2006.199;10.1109/VISUAL.2002.1183821;10.1109/TVCG.2007.70545;10.1109/TVCG.2010.166;10.1109/TVCG.2006.201,"Flow visualization, flowing seed points, streak lines, streamlines, insect flight, vortex visualization, unsteady flow",22,18,47,
SciVis,2012,Visualizing Nuclear Scission through a Multifield Extension of Topological Analysis,10.1109/TVCG.2012.287,http://dx.doi.org/10.1109/TVCG.2012.287,2033,2040,J,"In nuclear science, density functional theory (DFT) is a powerful tool to model the complex interactions within the atomic nucleus, and is the primary theoretical approach used by physicists seeking a better understanding of fission. However DFT simulations result in complex multivariate datasets in which it is difficult to locate the crucial `scission' point at which one nucleus fragments into two, and to identify the precursors to scission. The Joint Contour Net (JCN) has recently been proposed as a new data structure for the topological analysis of multivariate scalar fields, analogous to the contour tree for univariate fields. This paper reports the analysis of DFT simulations using the JCN, the first application of the JCN technique to real data. It makes three contributions to visualization: (i) a set of practical methods for visualizing the JCN, (ii) new insight into the detection of nuclear scission, and (iii) an analysis of aesthetic criteria to drive further work on representing the JCN.",David J. Duke;Hamish A. Carr;Aaron Knoll;Nicolas Schunck;Hai Ah Nam;Andrzej Staszczak,David Duke;Hamish Carr;Aaron Knoll;Nicolas Schunck;Hai Ah Nam;Andrzej Staszczak,"University of Leeds, UK;University of Leeds, UK;Argonne National Lab, USA;Lawrence Livermore National Lab, USA;Oak Ridge National Lab, USA;University Marie Curie-Skłodowska, Poland",10.1109/TVCG.2008.143,"Topology, scalar fields, multifields",22,22,35,
InfoVis,2013,A Model for Structure-Based Comparison of Many Categories in Small-Multiple Displays,10.1109/TVCG.2013.122,http://dx.doi.org/10.1109/TVCG.2013.122,2287,2296,J,"Many application domains deal with multi-variate data that consist of both categorical and numerical information. Small-multiple displays are a powerful concept for comparing such data by juxtaposition. For comparison by overlay or by explicit encoding of computed differences, however, a specification of references is necessary. In this paper, we present a formal model for defining semantically meaningful comparisons between many categories in a small-multiple display. Based on pivotized data that are hierarchically partitioned by the categories assigned to the x and y axis of the display, we propose two alternatives for structure-based comparison within this hierarchy. With an absolute reference specification, categories are compared to a fixed reference category. With a relative reference specification, in contrast, a semantic ordering of the categories is considered when comparing them either to the previous or subsequent category each. Both reference specifications can be defined at multiple levels of the hierarchy (including aggregated summaries), enabling a multitude of useful comparisons. We demonstrate the general applicability of our model in several application examples using different visualizations that compare data by overlay or explicit encoding of differences.",Johannes Kehrer;Harald Piringer;Wolfgang Berger;M. Eduard Gröller,Johannes Kehrer;Harald Piringer;Wolfgang Berger;M. Eduard Gröller,"VRVis Research Center, Vienna, and the Institute of Computer Graphics and Algorithms, Vienna University of Technology;VRVis Research Center, Vienna;VRVis Research Center, Vienna;Institute of Computer Graphics and Algorithms, Vienna University of Technology",10.1109/TVCG.2010.138;10.1109/TVCG.2007.70594;10.1109/VISUAL.2005.1532821;10.1109/TVCG.2013.125;10.1109/TVCG.2011.178;10.1109/VAST.2011.6102439;10.1109/TVCG.2008.125;10.1109/INFVIS.2000.885086;10.1109/TVCG.2012.237;10.1109/TVCG.2007.70521,"Comparative visualization, small-multiple displays, trellis displays, categorical data",22,21,33,
SciVis,2013,MObjects--A Novel Method for the Visualization and Interactive Exploration of Defects in Industrial XCT Data,10.1109/TVCG.2013.177,http://dx.doi.org/10.1109/TVCG.2013.177,2906,2915,J,"This paper describes an advanced visualization method for the analysis of defects in industrial 3D X-Ray Computed Tomography (XCT) data. We present a novel way to explore a high number of individual objects in a dataset, e.g., pores, inclusions, particles, fibers, and cracks demonstrated on the special application area of pore extraction in carbon fiber reinforced polymers (CFRP). After calculating the individual object properties volume, dimensions and shape factors, all objects are clustered into a mean object (MObject). The resulting MObject parameter space can be explored interactively. To do so, we introduce the visualization of mean object sets (MObject Sets) in a radial and a parallel arrangement. Each MObject may be split up into sub-classes by selecting a specific property, e.g., volume or shape factor, and the desired number of classes. Applying this interactive selection iteratively leads to the intended classifications and visualizations of MObjects along the selected analysis path. Hereby the given different scaling factors of the MObjects down the analysis path are visualized through a visual linking approach. Furthermore the representative MObjects are exported as volumetric datasets to serve as input for successive calculations and simulations. In the field of porosity determination in CFRP non-destructive testing practitioners use representative MObjects to improve ultrasonic calibration curves. Representative pores also serve as input for heat conduction simulations in active thermography. For a fast overview of the pore properties in a dataset we propose a local MObjects visualization in combination with a color-coded homogeneity visualization of cells. The advantages of our novel approach are demonstrated using real world CFRP specimens. The results were evaluated through a questionnaire in order to determine the practicality of the MObjects visualization as a supportive tool for domain specialists.",Andreas Reh;Christian Gusenbauer;Johann Kastner;M. Eduard Gröller;Christoph Heinzl,Andreas Reh;Christian Gusenbauer;Johann Kastner;M. Eduard Gröller;Christoph Heinzl,"University of Applied Sciences Upper Austria, Campus Wels;University of Applied Sciences Upper Austria, Campus Wels;University of Applied Sciences Upper Austria, Campus Wels;Vienna University of Technology;University of Applied Sciences Upper Austria, Campus Wels",10.1109/TVCG.2012.231;10.1109/VISUAL.1999.809871;10.1109/TVCG.2009.121;10.1109/TVCG.2012.227;10.1109/TVCG.2011.248;10.1109/VISUAL.2005.1532807;10.1109/TVCG.2010.190;10.1109/TVCG.2010.214;10.1109/VISUAL.1993.398859;10.1109/VISUAL.1997.663875,"3D X-ray computed tomography, carbon fiber reinforced polymers, porosity, parameter space analysis, MObjects",22,16,29,
VAST,2013,Supporting the Visual Analysis of Dynamic Networks by Clustering associated Temporal Attributes,10.1109/TVCG.2013.198,http://dx.doi.org/10.1109/TVCG.2013.198,2267,2276,J,"The visual analysis of dynamic networks is a challenging task. In this paper, we introduce a new approach supporting the discovery of substructures sharing a similar trend over time by combining computation, visualization and interaction. With existing techniques, their discovery would be a tedious endeavor because of the number of nodes, edges as well as time points to be compared. First, on the basis of the supergraph, we therefore group nodes and edges according to their associated attributes that are changing over time. Second, the supergraph is visualized to provide an overview of the groups of nodes and edges with similar behavior over time in terms of their associated attributes. Third, we provide specific interactions to explore and refine the temporal clustering, allowing the user to further steer the analysis of the dynamic network. We demonstrate our approach by the visual analysis of a large wireless mesh network.",Steffen Hadlak;Heidrun Schumann;Clemens H. Cap;Till Wollenberg,Steffen Hadlak;Heidrun Schumann;Clemens H. Cap;Till Wollenberg,University of Rostock;University of Rostock;University of Rostock;University of Rostock,10.1109/INFVIS.2005.1532151;10.1109/VAST.2010.5652530;10.1109/INFVIS.2004.18;10.1109/TVCG.2011.226;10.1109/TVCG.2011.213;10.1109/TVCG.2006.193;10.1109/VAST.2012.6400493;10.1109/INFVIS.1999.801851;10.1109/TVCG.2007.70529;10.1109/INFVIS.2002.1173160,"Dynamic networks, visualization, supergraph clustering",22,21,34,
InfoVis,2015,Sketching Designs Using the Five Design-Sheet Methodology,10.1109/TVCG.2015.2467271,http://dx.doi.org/10.1109/TVCG.2015.2467271,419,428,J,"Sketching designs has been shown to be a useful way of planning and considering alternative solutions. The use of lo-fidelity prototyping, especially paper-based sketching, can save time, money and converge to better solutions more quickly. However, this design process is often viewed to be too informal. Consequently users do not know how to manage their thoughts and ideas (to first think divergently, to then finally converge on a suitable solution). We present the Five Design Sheet (FdS) methodology. The methodology enables users to create information visualization interfaces through lo-fidelity methods. Users sketch and plan their ideas, helping them express different possibilities, think through these ideas to consider their potential effectiveness as solutions to the task (sheet 1); they create three principle designs (sheets 2,3 and 4); before converging on a final realization design that can then be implemented (sheet 5). In this article, we present (i) a review of the use of sketching as a planning method for visualization and the benefits of sketching, (ii) a detailed description of the Five Design Sheet (FdS) methodology, and (iii) an evaluation of the FdS using the System Usability Scale, along with a case-study of its use in industry and experience of its use in teaching.",Jonathan Roberts 0002;Christopher James Headleand;Panagiotis D. Ritsos,Jonathan C. Roberts;Chris Headleand;Panagiotis D. Ritsos,"School of Computer Science, Bangor University;School of Computer Science, Bangor University;Department of Computer Science, University of Chester",10.1109/TVCG.2010.132;10.1109/INFVIS.2000.885092;10.1109/TVCG.2006.178;10.1109/VISUAL.1994.346304;10.1109/TVCG.2014.2346331;10.1109/TVCG.2009.111;10.1109/TVCG.2012.213;10.1109/INFVIS.2004.59;10.1109/TVCG.2012.262;10.1109/TVCG.2007.70515;10.1109/TVCG.2008.171,"Lo-fidelity prototyping, User-centred design, Sketching for visualization, Ideation",22,24,58,
VAST,2015,VisOHC: Designing Visual Analytics for Online Health Communities,10.1109/TVCG.2015.2467555,http://dx.doi.org/10.1109/TVCG.2015.2467555,71,80,J,"Through online health communities (OHCs), patients and caregivers exchange their illness experiences and strategies for overcoming the illness, and provide emotional support. To facilitate healthy and lively conversations in these communities, their members should be continuously monitored and nurtured by OHC administrators. The main challenge of OHC administrators' tasks lies in understanding the diverse dimensions of conversation threads that lead to productive discussions in their communities. In this paper, we present a design study in which three domain expert groups participated, an OHC researcher and two OHC administrators of online health communities, which was conducted to find with a visual analytic solution. Through our design study, we characterized the domain goals of OHC administrators and derived tasks to achieve these goals. As a result of this study, we propose a system called VisOHC, which visualizes individual OHC conversation threads as collapsed boxes-a visual metaphor of conversation threads. In addition, we augmented the posters' reply authorship network with marks and/or beams to show conversation dynamics within threads. We also developed unique measures tailored to the characteristics of OHCs, which can be encoded for thread visualizations at the users' requests. Our observation of the two administrators while using VisOHC showed that it supports their tasks and reveals interesting insights into online health communities. Finally, we share our methodological lessons on probing visual designs together with domain experts by allowing them to freely encode measurements into visual variables.",Bum Chul Kwon;Sung-Hee Kim;Sukwon Lee;Jaegul Choo;Jina Huh;Ji Soo Yi,Bum Chul Kwon;Sung-Hee Kim;Sukwon Lee;Jaegul Choo;Jina Huh;Ji Soo Yi,University of Konstanz;University of British Columbia;Purdue University;Korea University;Michigan State University;Purdue University,10.1109/TVCG.2014.2346433;10.1109/VAST.2011.6102441;10.1109/TVCG.2014.2346292;10.1109/INFVIS.2003.1249028;10.1109/TVCG.2010.175;10.1109/VAST.2014.7042494;10.1109/TVCG.2014.2346331;10.1109/VAST.2009.5333919;10.1109/TVCG.2012.213;10.1109/TVCG.2009.171;10.1109/TVCG.2009.187;10.1109/TVCG.2013.221;10.1109/VAST.2012.6400554;10.1109/VAST.2014.7042496;10.1109/TVCG.2008.171,"Online health communities, visual analytics, conversation analysis, thread visualization, healthcare, design study",22,17,44,
InfoVis,2016,cite2vec: Citation-Driven Document Exploration via Word Embeddings,10.1109/TVCG.2016.2598667,http://dx.doi.org/10.1109/TVCG.2016.2598667,691,700,J,"Effectively exploring and browsing document collections is a fundamental problem in visualization. Traditionally, document visualization is based on a data model that represents each document as the set of its comprised words, effectively characterizing what the document is. In this paper we take an alternative perspective: motivated by the manner in which users search documents in the research process, we aim to visualize documents via their usage, or how documents tend to be used. We present a new visualization scheme - cite2vec - that allows the user to dynamically explore and browse documents via how other documents use them, information that we capture through citation contexts in a document collection. Starting from a usage-oriented word-document 2D projection, the user can dynamically steer document projections by prescribing semantic concepts, both in the form of phrase/document compositions and document:phrase analogies, enabling the exploration and comparison of documents by their use. The user interactions are enabled by a joint representation of words and documents in a common high-dimensional embedding space where user-specified concepts correspond to linear operations of word and document vectors. Our case studies, centered around a large document corpus of computer vision research papers, highlight the potential for usage-based document visualization.",Matthew Berger;Katherine McDonough;Lee M. Seversky,Matthew Berger;Katherine McDonough;Lee M. Seversky,Air Force Research Laboratory;Northeastern University;Air Force Research Laboratory,10.1109/TVCG.2014.2346431;10.1109/VAST.2011.6102461;10.1109/TVCG.2011.220;10.1109/TVCG.2015.2467451;10.1109/TVCG.2010.207;10.1109/TVCG.2014.2346978;10.1109/TVCG.2015.2467757;10.1109/VAST.2009.5333428;10.1109/TVCG.2013.212;10.1109/TVCG.2015.2467621;10.1109/VAST.2014.7042493;10.1109/TVCG.2013.162;10.1109/TVCG.2009.202;10.1109/TVCG.2008.138,word embeddings;document visualization,22,27,44,
InfoVis,2016,Visualization by Demonstration: An Interaction Paradigm for Visual Data Exploration,10.1109/TVCG.2016.2598839,http://dx.doi.org/10.1109/TVCG.2016.2598839,331,340,J,"Although data visualization tools continue to improve, during the data exploration process many of them require users to manually specify visualization techniques, mappings, and parameters. In response, we present the Visualization by Demonstration paradigm, a novel interaction method for visual data exploration. A system which adopts this paradigm allows users to provide visual demonstrations of incremental changes to the visual representation. The system then recommends potential transformations (Visual Representation, Data Mapping, Axes, and View Specification transformations) from the given demonstrations. The user and the system continue to collaborate, incrementally producing more demonstrations and refining the transformations, until the most effective possible visualization is created. As a proof of concept, we present VisExemplar, a mixed-initiative prototype that allows users to explore their data by recommending appropriate transformations in response to the given demonstrations.",Bahador Saket;Hannah Kim;Eli T. Brown;Alex Endert,Bahador Saket;Hannah Kim;Eli T. Brown;Alex Endert,Georgia Institute of Technology;Georgia Institute of Technology;DePaul University;Georgia Institute of Technology,10.1109/TVCG.2014.2346292;10.1109/TVCG.2015.2467191;10.1109/TVCG.2007.70594;10.1109/VAST.2011.6102449;10.1109/TVCG.2007.70515;10.1109/TVCG.2014.2346250;10.1109/TVCG.2012.275;10.1109/TVCG.2015.2467153;10.1109/TVCG.2013.191;10.1109/TVCG.2011.251;10.1109/TVCG.2011.185;10.1109/TVCG.2014.2346291;10.1109/VAST.2012.6400486,Visual Data Exploration;Visualization by Demonstration;Visualization Tools,22,28,35,
InfoVis,2017,Priming and Anchoring Effects in Visualization,10.1109/TVCG.2017.2744138,http://dx.doi.org/10.1109/TVCG.2017.2744138,584,594,J,"We investigate priming and anchoring effects on perceptual tasks in visualization. Priming or anchoring effects depict the phenomena that a stimulus might influence subsequent human judgments on a perceptual level, or on a cognitive level by providing a frame of reference. Using visual class separability in scatterplots as an example task, we performed a set of five studies to investigate the potential existence of priming and anchoring effects. Our findings show that - under certain circumstances - such effects indeed exist. In other words, humans judge class separability of the same scatterplot differently depending on the scatterplot(s) they have seen before. These findings inform future work on better understanding and more accurately modeling human perception of visual patterns.",André Calero Valdez;Martina Ziefle;Michael Sedlmair,André Calero Valdez;Martina Ziefle;Michael Sedlmair,RWTH Aachen University;RWTH Aachen University;University of Vienna,10.1109/TVCG.2014.2346297;10.1109/TVCG.2011.229;10.1109/TVCG.2013.183;10.1109/VAST.2010.5653587;10.1109/TVCG.2012.233;10.1109/TVCG.2014.2346979;10.1109/TVCG.2015.2467671;10.1109/TVCG.2014.2346325;10.1109/TVCG.2007.70594;10.1109/TVCG.2012.199;10.1109/TVCG.2013.153;10.1109/TVCG.2012.196;10.1109/INFVIS.2005.1532142,"Perception,Anchoring,Bias,Scatterplots,Visualization,MTurk Study",22,10,66,
Vis,1990,Visualization of irregular multivariate data,10.1109/VISUAL.1990.146388,http://dx.doi.org/10.1109/VISUAL.1990.146388,247,"254, 478-9",C,"The authors discuss effective techniques for representing scalar and vector valued functions that interpolate to irregularly located data. Special attention is given to the situations where the sampling domain is a two-dimensional plane, 3-D volume, or a closed 3-D surface. The authors first discuss the multiquadric and thin-plate spline methods for interpolating scalar data sampled at arbitrary locations in a plane. Straightforward generalizations are then made to data sampled in 3-D volumetric regions as well as in higher dimensional spaces. The globally defined interpolants can be evaluated on a fine regular grid and they can then be visualized using conventional techniques. Triangular and tetrahedral based visualization techniques are also presented.&lt;&lt;ETX&gt;&gt;",Thomas A. Foley;David A. Lane,T.A. Foley;D.A. Lane,"Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA;Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA",,,21,10,31,
Vis,1992,Interactive terrain rendering and volume visualization on the Princeton Engine,10.1109/VISUAL.1992.235189,http://dx.doi.org/10.1109/VISUAL.1992.235189,349,355,C,"The implementation of truly interactive volume visualization and terrain rendering algorithms on the Princeton Engine (PE) video supercomputer is described. The PE is a single-instruction multiple-data (SIMD) computer. Since it was originally developed as a real-time digital television system simulator, it possesses many of the attributes necessary for interactive visualization: high-resolution displays, high-bandwidth I/O, supercomputer class computational performance, and a local memory array large enough to store multiple Landsat scenes and data volumes. It is shown that it is possible to generate truly interactive terrain rendering and volume visualization by computing images in real-time, at multiple frames/second.&lt;&lt;ETX&gt;&gt;",James T. Kaba;James R. Matey;Gordon Stoll;Herb Taylor;Pat Hanrahan,J. Kaba;J. Matey;G. Stoll;H. Taylor;P. Hanrahan,"David Sarnoff Res. Center, Princeton, NJ, USA;David Sarnoff Res. Center, Princeton, NJ, USA;David Sarnoff Res. Center, Princeton, NJ, USA;David Sarnoff Res. Center, Princeton, NJ, USA",10.1109/VISUAL.1991.175778;10.1109/VISUAL.1991.175777;10.1109/VISUAL.1991.175805,,21,9,28,
Vis,1992,SuperGlue: a programming environment for scientific visualization,10.1109/VISUAL.1992.235202,http://dx.doi.org/10.1109/VISUAL.1992.235202,243,250,C,"It is suggested that many existing platforms over emphasize ease-of-use and do not adequately address issues of extensibility. A visualization testbed, called SuperGlue, which is particularly suited for the rapid development of new visualization methods, was built. An interpreter supports rapid development of new code, and an extensive class hierarchy encourages code reuse. By explicitly designing for ease of programming, it was possible to produce a visualization system which is powerful, easy to use, and rapidly improving. The motivation of the work, the architecture of the system, and plans for further development are reported.&lt;&lt;ETX&gt;&gt;",Jeff P. Hultquist;E. L. Raible,J.P.M. Hultquist;E.L. Raible,"NASA Ames Res. Center, Moffett Field, CA, USA;NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1991.175771;10.1109/VISUAL.1990.146360;10.1109/VISUAL.1992.235211,,21,10,15,
Vis,1993,MRIVIEW: An interactive computational tool for investigation of brain structure and function,10.1109/VISUAL.1993.398885,http://dx.doi.org/10.1109/VISUAL.1993.398885,324,331,C,"MRIVIEW is a software system that uses image processing and visualization to provide neuroscience researchers with an integrated environment for combining functional and anatomical information. Key features of the software include semi-automated segmentation of volumetric head data and an interactive coordinate reconciliation method which utilizes surface visualization. The current system is a precursor to a computational brain atlas. We describe features this atlas will incorporate, including methods under development for visualizing brain functional data obtained from several different research modalities.&lt;&lt;ETX&gt;&gt;",Douglas M. Ranken;John S. George,D. Ranken;J. George,"Los Alamos Nat. Lab., NM, USA;Los Alamos Nat. Lab., NM, USA",,,21,11,21,
Vis,1994,Volume rendering of pool fire data,10.1109/VISUAL.1994.346291,http://dx.doi.org/10.1109/VISUAL.1994.346291,382,"385, C45",C,We describe how techniques from computer graphics are used to visualize pool fire data and compute radiative effects from pool fires. The basic tools are ray casting and accurate line integration using the RADCAL program. Example images in the visible and infrared band are shown which are given of irradiation calculations and novel methods to visualize the results of irradiation calculations.&lt;&lt;ETX&gt;&gt;,Holly E. Rushmeier;Anthony Hamins;Mun-Young Choi,H.E. Rushmeier;A. Hamins;M.-Y. Choi,"Nat. Inst. of Stand. & Technol., Gaithersburg, MD, USA;Nat. Inst. of Stand. & Technol., Gaithersburg, MD, USA",,,21,0,5,
InfoVis,1995,SDM: malleable information graphics,10.1109/INFVIS.1995.528684,http://dx.doi.org/10.1109/INFVIS.1995.528684,36,42,C,"Selective dynamic manipulation (SDM) is a paradigm for interacting with objects in visualizations. Its methods offer a high degree of selectivity, in choosing object sets, in the selection of interactive techniques and the properties they affect, and in the degree to which a user action affects the visualization. Our goal is to provide a flexible set of techniques and feedback mechanisms that enable users to move objects and transform their appearance to perform a variety of information analysis tasks.",Mei C. Chuah;Steven F. Roth;Joe Mattis;John Kolojejchick,M.C. Chuah;S.F. Roth;J. Mattis;J. Kolojejchick,"Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA;Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA;Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA;Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA",,"Interactive techniques, visualization, direct manipulation",21,5,16,
InfoVis,1995,Case study: visualizing Internet resources,10.1109/INFVIS.1995.528696,http://dx.doi.org/10.1109/INFVIS.1995.528696,122,128,C,"The goal is to improve the ability of people from all walks of life and interests to access, search, and use the information distributed in Internet resources. The process of interacting with information resources starts with browsing, continues with digesting and assimilating pieces of information, terminates with generation of new information, and begins anew with analysis of pre-existing and new information. Our approach is user-centric-taking users needs into account by allowing them to interact with the information contained in large arrays of documents. The visualization process is an integral part of the overall process. We have covered three related categories in this methodology. The first one is browsing through the World-Wide Web (WWW) hyperspace without becoming lost, based on a visual representation of the hyperspace hierarchical structure (hyperspace view). The second category is overcoming the rigidity of the WWW by allowing the user to construct interactively and visually a personal hyperspace of information, linking the documents according to the application or problem domain, or to the user's own perception, experience, culture, or way of thinking. The third category includes discovery and analysis of new information and relationships in retrieved documents by aggregating relevant information and representing it visually.",Nahum D. Gershon;Joshua LeVasseur;Joel Winstead;J. Croall;A. Pernicks;William Ruh,N. Gershon;J. LeVasseur;J. Winstead;J. Croall;A. Pernicks;W. Ruh,"Mitre Corp., McLean, VA, USA;Mitre Corp., McLean, VA, USA;Mitre Corp., McLean, VA, USA;Mitre Corp., McLean, VA, USA;Mitre Corp., McLean, VA, USA;Mitre Corp., McLean, VA, USA",,,21,7,7,
Vis,1995,On enhancing the speed of splatting with indexing,10.1109/VISUAL.1995.480797,http://dx.doi.org/10.1109/VISUAL.1995.480797,69,"76, 441",C,"Splatting is an object space direct volume rendering algorithm that produces images of high quality, but is computationally expensive like many other volume rendering algorithms. The paper presents a new technique that enhances the speed of splatting without trading off image quality. This new method reduces rendering time by employing a simple indexing mechanism which allows to visit and splat only the voxels of interest. It is shown that this algorithm is suitable for the dynamic situation in which viewing parameters and opacity transfer functions change interactively. We report experimental results on several test data sets of useful site and complexity, and discuss the cost/benefit trade off of our method.",Insung Ihm;Rae Kyoung Lee,Insung Ihm;Rae Kyoung Lee,"Dept. of Comput. Sci., Sogang Univ., Seoul, South Korea;Dept. of Comput. Sci., Sogang Univ., Seoul, South Korea",10.1109/VISUAL.1990.146377,,21,7,13,
Vis,1997,Efficient subdivision of finite-element datasets into consistent tetrahedra,10.1109/VISUAL.1997.663885,http://dx.doi.org/10.1109/VISUAL.1997.663885,213,219,C,"The paper discusses the problem of subdividing unstructured mesh topologies containing hexahedra, prisms, pyramids and tetrahedra into a consistent set of only tetrahedra, while preserving the overall mesh topology. Efficient algorithms for volume rendering, iso-contouring and particle advection exist for mesh topologies comprised solely of tetrahedra. General finite-element simulations however, consist mainly of hexahedra, and possibly prisms, pyramids and tetrahedra. Arbitrary subdivision of these mesh topologies into tetrahedra can lead to discontinuous behaviour across element faces. This will show up as visible artifacts in the iso-contouring and volume rendering algorithms, and lead to impossible face adjacency graphs for many algorithms. The authors present various properties of tetrahedral subdivisions, and an algorithm SOP determining a consistent subdivision containing a minimal set of tetrahedra.",Guy Albertelli;Roger Crawfis,G. Albertelli;R.A. Crawfis,"Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA",10.1109/VISUAL.1992.235210;10.1109/VISUAL.1993.398846,"tetrahedralization, mesh subdivision, volume rendering, flow visualization, isosurfaces, metrics, irregular grids",21,10,11,
Vis,1997,Interactive visualization of aircraft and power generation engines,10.1109/VISUAL.1997.663927,http://dx.doi.org/10.1109/VISUAL.1997.663927,483,486,C,"Presents a system for interactively visualizing large polygonal environments such as those produced by CAD systems during the design of aircraft and power generation engines. Our method combines view frustum culling with level-of-detail modeling to create a visualization system that supports part motion and has the ability to view arbitrary sets of data. To avoid long system start-up delays due to data loading, we have implemented our system using a dynamic loading strategy. This also allows us to interactively visualize more data than could fit in memory at one time.",Lisa Sobierajski Avila;William J. Schroeder,L. Sobierajski;W. Schroeder,"GE Corp. Res. & Dev., Miskayuna, NY, USA",10.1109/VISUAL.1996.567752;10.1109/VISUAL.1997.663883,,21,0,9,
InfoVis,1998,Saying it in graphics: from intentions to visualizations,10.1109/INFVIS.1998.729564,http://dx.doi.org/10.1109/INFVIS.1998.729564,97,101,C,"The authors propose a methodology for automatically realizing communicative goals in graphics. It features a task model that mediates the communicative intent and the selection of graphical techniques. The methodology supports the following functions: isolating assertions presentable in graphics; mapping such assertions into tasks for the potential reader, and selecting graphical techniques that support those tasks. They illustrate the methodology by redesigning a textual argument into a multimedia one with the same rhetorical and content structures but employing graphics to achieve some of the intentions.",Stephan M. Kerpedjiev;Giuseppe Carenini;Nancy L. Green;Johanna D. Moore;Steven F. Roth,S. Kerpedjiev;G. Carenini;N. Green;J. Moore;S. Roth,"Carnegie Mellon Univ., Pittsburgh, PA, USA",,,21,3,11,
Vis,1998,Contour interpolation and surface reconstruction of smooth terrain models,10.1109/VISUAL.1998.745281,http://dx.doi.org/10.1109/VISUAL.1998.745281,27,33,C,"Interpolating contours and reconstructing a rational surface from a contour map are two essential problems in terrain modeling. They are often met in the field of computer graphics and CAD systems based on geographic information systems. Although many approaches have been developed for these two problems, one difficulty still remains. That is how to ensure that the reconstructed surface is both smooth globally and coincides with the given contours exactly simultaneously. In this paper we solve the two problems in a unified framework. We use gradient controlled partial differential equation (PDE) surfaces to express terrain surfaces, in which the surface shapes can be globally determined by the contours, their locations, height and gradient values. The surface generated by this method is accurate in the sense of exactly coinciding with the original contours and smooth with C/sup 1/ continuity everywhere. The method can reveal smooth saddle shapes caused by surface branching of one to more and can make rational interpolated sub-contours between two or more neighboring contours.",Jianyun Chai;Takaharu Miyoshi;Eihachiro Nakamae,J. Chai;T. Miyoshi;E. Nakamae,"Sanei Co., Japan",,"PDE surfaces, terrain modeling, shape reconstruction, contour interpolation",21,7,21,
InfoVis,2000,GADGET/IV: a taxonomic approach to semi-automatic design of information visualization applications using modular visualization environment,10.1109/INFVIS.2000.885093,http://dx.doi.org/10.1109/INFVIS.2000.885093,77,83,C,"Since novice users of visualization systems lack knowledge and expertise in data visualization, it is a tough task for them to generate efficient and effective visualizations that allow them to comprehend information that is embedded in the data. Therefore, systems supporting the users to design appropriate visualizations are of great importance. The GADGET (Goal-oriented Application Design Guidance for modular visualization EnvironmenTs) system, which has been developed by the authors (1997), interactively helps users to design scientific visualization applications by presenting appropriate MVE (Modular Visualization Environment) prototypes according to the specification of the visualization goals expressed mainly with the Wehrend matrix (S. Wehrend &amp; C. Lewis, 1990). This paper extends this approach in order to develop a system named GADGET/IV, which is intended to provide the users with an environment for semi-automatic design of information visualization (IV) applications. To this end, a novel goal-oriented taxonomy of IV techniques is presented. Also, an initial design of the system architecture and user assistance flow is described. The usefulness of the GADGET/IV system is illustrated with example problems of Web site access frequency analysis.",Issei Fujishiro;Rika Furuhata;Yoshihiko Ichikawa;Yuriko Takeshima,I. Fujishiro;Y. Ichikawa;R. Furuhata;Y. Takeshima,"Dept. of Inf. Sci., Ochanomizu Univ., Tokyo, Japan",10.1109/INFVIS.1997.636788;10.1109/VISUAL.1997.663889;10.1109/INFVIS.1997.636792;10.1109/VISUAL.1990.146375,,21,7,20,
InfoVis,2000,Information content measures of visual displays,10.1109/INFVIS.2000.885096,http://dx.doi.org/10.1109/INFVIS.2000.885096,99,103,C,"With an increase in the number of different visualization techniques, it becomes necessary to develop a measure for evaluating the effectiveness of visualizations. Metrics to evaluate visual displays were developed based on measures of information content developed by Shannon and used in communication theory. These measures of information content can be used to quantify the relative effectiveness of displays.",Julie Yang-Peláez;Woodie Flowers,J. Yang-Pelaez;W.C. Flowers,"Dept. of Mech. Eng., MIT, Cambridge, MA, USA",10.1109/INFVIS.1997.636792;10.1109/INFVIS.1995.528691,,21,5,13,
Vis,2000,Four-dimensional non-linear ray tracing as a visualization tool for gravitational physics,10.1109/VISUAL.2000.885728,http://dx.doi.org/10.1109/VISUAL.2000.885728,445,448,C,"General relativistic ray tracing is presented as a tool for gravitational physics. It is shown how standard three-dimensional ray tracing can be extended to allow for general relativistic visualization. This visualization technique provides images as seen by an observer under the influence of a gravitational field and allows to probe space-time by null geodesics. Moreover, a technique is proposed for visualizing the caustic surfaces generated by a gravitational lens. The suitability of general relativistic ray tracing is demonstrated by means of two examples, namely the visualization of the rigidly rotating disk of dust and the warp drive metric.",Daniel Weiskopf,D. Weiskopf,"Inst. for Astron. & Astrophys., Tubingen Univ., Germany",10.1109/VISUAL.1992.235196,"differential geometry, four-dimensional spacetimes, general relativity, ray tracing, scientific visualization",21,5,20,
InfoVis,2001,Effective graph visualization via node grouping,10.1109/INFVIS.2001.963280,http://dx.doi.org/10.1109/INFVIS.2001.963280,51,58,C,,Janet M. Six;Ioannis G. Tollis,J.M. Six;I.G. Tollis,The University of Texas,,"Graph Drawing, Graph Visualization, Force-Directed Drawing, Orthogonal Drawing, Node Grouping, Experimental Studies",21,2,31,
InfoVis,2001,Case study: e-commerce clickstream visualization,10.1109/INFVIS.2001.963293,http://dx.doi.org/10.1109/INFVIS.2001.963293,153,156,C,,Jeffrey Brainerd;Barry G. Becker,J. Brainerd;B. Becker,Blue Martini Software,10.1109/INFVIS.1998.729554;10.1109/INFVIS.1997.636718;10.1109/INFVIS.1998.729553;10.1109/INFVIS.2000.885089;10.1109/INFVIS.2000.885090;10.1109/INFVIS.1995.528697;10.1109/INFVIS.1996.559226;10.1109/INFVIS.2000.885101,,21,8,17,
Vis,2001,Nonmanifold subdivision,10.1109/VISUAL.2001.964528,http://dx.doi.org/10.1109/VISUAL.2001.964528,325,332,C,"Commonly-used subdivision schemes require manifold control meshes and produce manifold surfaces. However, it is often necessary to model nonmanifold surfaces, such as several surface patches meeting at a common boundary. In this paper, we describe a subdivision algorithm that makes it possible to model nonmanifold surfaces. Any triangle mesh, subject only to the restriction that no two vertices of any triangle coincide, can serve as an input to the algorithm. Resulting surfaces consist of collections of manifold patches joined along nonmanifold curves and vertices. If desired, constraints may be imposed on the tangent planes of manifold patches sharing a curve or a vertex. The algorithm is an extension of a well-known Loop subdivision scheme, and uses techniques developed for piecewise smooth surfaces.",Lexing Ying;Denis Zorin,Lexing Ying;D. Zorin,"New York Univ., NY, USA;New York Univ., NY, USA",10.1109/VISUAL.1999.809870,"Subdivision surfaces, Nonmanifold surfaces, Geometric modeling",21,0,17,
InfoVis,2002,Visualization schemas for flexible information visualization,10.1109/INFVIS.2002.1173142,http://dx.doi.org/10.1109/INFVIS.2002.1173142,15,22,C,"Relational databases provide significant flexibility to organize, store, and manipulate an infinite variety of complex data collections. This flexibility is enabled by the concept of relational data schemas, which allow data owners to easily design custom databases according to their unique needs. However, user interfaces and information visualizations for accessing and utilizing databases have not kept pace with this level of flexibility. This paper introduces the concept of visualization schemas, based on the Snap-Together Visualization model, which are analogous to relational data schemas. Visualization schemas enable users to rapidly construct customized multiple-view visualizations for databases in a similarly flexible fashion without programming. Since the design of appropriate visualizations for a given database depends on the data schema, visualization schemas are a natural analogy to the data schema concept.",Chris North 0001;Nathan Conklin;Varun Saini,C. North;N. Conklin;V. Saini,"Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA;Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA;Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA",10.1109/INFVIS.1995.528688;10.1109/INFVIS.1997.636788,,21,5,20,
Vis,2002,Volume deformation for tensor visualization,10.1109/VISUAL.2002.1183798,http://dx.doi.org/10.1109/VISUAL.2002.1183798,379,386,C,"Visualizing second-order 3D tensor fields continue to be a challenging task. Although there are several algorithms that have been presented, no single algorithm by itself is sufficient for the analysis because of the complex nature of tensor fields. In this paper, we present two new methods, based on volume deformation, to show the effects of the tensor field upon its underlying media. We focus on providing a continuous representation of the nature of the tensor fields. Each of these visualization algorithms is good at displaying some particular properties of the tensor field.",Xiaoqiang Zheng;Alex T. Pang,Xiaoqiang Zheng;A. Pang,"Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA;Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA",10.1109/VISUAL.1998.745316;10.1109/VISUAL.1999.809905;10.1109/VISUAL.1993.398849;10.1109/VISUAL.1991.175789;10.1109/VISUAL.1992.235193;10.1109/VISUAL.1998.745294,"stress, strain, shear, symmetric tensors, anti-symmetric tensors, anisotropic tensors",21,6,12,
InfoVis,2003,Compound brushing,10.1109/INFVIS.2003.1249024,http://dx.doi.org/10.1109/INFVIS.2003.1249024,181,188,C,"This paper proposes a conceptual model called compound brushing for modeling the brushing techniques used in dynamic data visualization. In this approach, brushing techniques are modeled as higraphs with five types of basic entities: data, selection, device, renderer, and transformation. Using this model, a flexible visual programming tool is designed not only to configure/control various common types of brushing techniques currently used in dynamic data visualization, but also to investigate new brushing techniques.",Hong Chen,Hong Chen,"SAS Inst. Inc., Cary, NC, USA",10.1109/VISUAL.1995.485139;10.1109/INFVIS.2002.1173157;10.1109/INFVIS.2000.885092;10.1109/VISUAL.1994.346302;10.1109/INFVIS.1996.559216,"brushing, selection, dynamic graphics, data visualization, higraph, visual programming, dynamic query",21,0,17,
Vis,2003,Hierarchical clustering for unstructured volumetric scalar fields,10.1109/VISUAL.2003.1250389,http://dx.doi.org/10.1109/VISUAL.2003.1250389,325,332,C,"We present a method to represent unstructured scalar fields at multiple levels of detail. Using a parallelizable classification algorithm to build a cluster hierarchy, we generate a multiresolution representation of a given volumetric scalar data set. The method uses principal component analysis (PCA) for cluster generation and a fitting technique based on radial basis functions (RBFs). Once the cluster hierarchy has been generated, we utilize a variety of techniques for extracting different levels of detail. The main strength of this work is its generality. Regardless of grid type, this method can be applied to any discrete scalar field representation, even one given as a ""point cloud"".",Christopher S. Co;Bjørn Heckel;Hans Hagen;Bernd Hamann;Kenneth I. Joy,C.S. Co;B. Heckel;Hagen H;B. Hamann;K.I. Joy,"Dept. of Comput. Sci., Univ. of California, Davis, CA, USA;Dept. of Comput. Sci., Univ. of California, Davis, CA, USA;Dept. of Comput. Sci., Univ. of California, Davis, CA, USA;Dept. of Comput. Sci., Univ. of California, Davis, CA, USA;Dept. of Comput. Sci., Univ. of California, Davis, CA, USA",10.1109/VISUAL.2001.964503;10.1109/VISUAL.1998.745329;10.1109/VISUAL.1999.809863;10.1109/VISUAL.1996.568127;10.1109/VISUAL.2002.1183771,"scalar field simplification, multiresolution data representation, hierarchical clustering, principal component analysis, radial basis function",21,10,27,
Vis,2004,Visibility culling for time-varying volume rendering using temporal occlusion coherence,10.1109/VISUAL.2004.110,http://dx.doi.org/10.1109/VISUAL.2004.110,147,154,C,"Typically there is a high coherence in data values between neighboring time steps in an iterative scientific software simulation; this characteristic similarly contributes to a corresponding coherence in the visibility of volume blocks when these consecutive time steps are rendered. Yet traditional visibility culling algorithms were mainly designed for static data, without consideration of such potential temporal coherency. We explore the use of temporal occlusion coherence (TOC) to accelerate visibility culling for time-varying volume rendering. In our algorithm, the opacity of volume blocks is encoded by means of plenoptic opacity functions (POFs). A coherence-based block fusion technique is employed to coalesce time-coherent data blocks over a span of time steps into a single, representative block. Then POFs need only be computed for these representative blocks. To quickly determine the subvolumes that do not require updates in their visibility status for each subsequent time step, a hierarchical ""TOC tree"" data structure is constructed to store the spans of coherent time steps. To achieve maximal culling potential, while remaining conservative, we have extended our previous POP into an optimized POP (OPOP) encoding scheme for this specific scenario. To test our general TOC and OPOF approach, we have designed a parallel time-varying volume rendering algorithm accelerated by visibility culling. Results from experimental runs on a 32-processor cluster confirm both the effectiveness and scalability of our approach.",Jinzhu Gao;Han-Wei Shen;Jian Huang 0007;James Arthur Kohl,Jinzhu Gao;Han-Wei Shen;Jian Huang;J.A. Kohl,"Oak Ridge State Lab., Ohio State Univ., Columbus, OH, USA;Oak Ridge State Lab., Ohio State Univ., Columbus, OH, USA",10.1109/VISUAL.1994.346321;10.1109/VISUAL.1998.745713;10.1109/VISUAL.2001.964520;10.1109/VISUAL.1999.809910;10.1109/VISUAL.1999.809879;10.1109/VISUAL.1993.398869;10.1109/VISUAL.2001.964531;10.1109/VISUAL.2002.1183757;10.1109/VISUAL.2003.1250374;10.1109/VISUAL.1998.745300;10.1109/VISUAL.2000.885698;10.1109/VISUAL.2003.1250402,"visibility culling, time-varying data visualization, volume rendering, plenoptic opacity function, large data visualization",21,1,32,
Vis,2004,Detection and visualization of anomalous structures in molecular dynamics simulation data,10.1109/VISUAL.2004.23,http://dx.doi.org/10.1109/VISUAL.2004.23,465,472,C,"We explore techniques to detect and visualize features in data from molecular dynamics (MD) simulations. Although the techniques proposed are general, we focus on silicon (Si) atomic systems. The first set of methods use 3D location of atoms. Defects are detected and categorized using local operators and statistical modeling. Our second set of exploratory techniques employ electron density data. This data is visualized to glean the defects. We describe techniques to automatically detect the salient isovalues for isosurface extraction and designing transfer functions. We compare and contrast the results obtained from both sources of data. Essentially, we find that the methods of defect (feature) detection are at least as robust as those based on the exploration of electron density for Si systems.",Sameep Mehta;Kaden Hazzard;Raghu Machiraju;Srinivasan Parthasarathy 0001;John Wilkins,S. Mehta;K. Hazzard;R. Machiraju;S. Parthasarathy;J. Wilkins,"Dept. of Comput. Sci. & Eng., Ohio State Univ., Columbus, OH, USA",10.1109/VISUAL.1995.480793;10.1109/VISUAL.2002.1183753,"Feature Extraction, Scientific Data Visualization, Data Mining, Iso-surface, Transfer Functions, Molecular Dynamics",21,12,18,
Vis,2005,Rendering tetrahedral meshes with higher-order attenuation functions for digital radiograph reconstruction,10.1109/VISUAL.2005.1532809,http://dx.doi.org/10.1109/VISUAL.2005.1532809,303,310,C,"This paper presents a novel method for computing simulated x-ray images, or DRRs (digitally reconstructed radiographs), of tetrahedral meshes with higher-order attenuation functions. DRRs are commonly used in computer assisted surgery (CAS), with the attenuation function consisting of a voxelized CT study, which is viewed from different directions. Our application of DRRs is in intra-operative ""2D-3D"" registration, i.e., finding the pose of the CT dataset given a small number of patient radiographs. We register 2D patient images with a statistical tetrahedral model, which encodes the CT intensity numbers as Bernstein polynomials, and includes knowledge about typical shape variation modes. The unstructured grid is more suitable for applying deformations than a rectilinear grid, and the higher-order polynomials provide a better approximation of the actual density than constant or linear models. The infra-operative environment demands a fast method for creating the DRRs, which we present here. We demonstrate this application through the creation and use of a deformable atlas of human pelvis bones. Compared with other works on rendering unstructured grids, the main contributions of this work are: 1) Simple and perspective-correct interpolation of the thickness of a tetrahedral cell. 2) Simple and perspective-correct interpolation of front and back barycentric coordinates with respect to the cell. 3) Computing line integrals of higher-order functions. 4) Capability of applying shape deformations and variations in the attenuation function without significant performance loss. The method does not depend on for pre-integration, and does not require depth-sorting of the visualized cells. We present imaging and timing results of implementing the algorithm, and discuss the impact of using higher-order functions on the quality of the result and the performance.",Ofri Sadowsky;Jonathan D. Cohen 0001;Russell H. Taylor,C. Sadowsky;J.D. Cohen;R.H. Taylor,"Johns Hopkins Univ., Laurel, MD, USA;Johns Hopkins Univ., Laurel, MD, USA;Johns Hopkins Univ., Laurel, MD, USA",10.1109/VISUAL.2000.885683;10.1109/VISUAL.2004.85,"volume rendering, unstructured grids, projected tetrahedra, DRR, higher-order volumetric functions",21,6,18,
Vis,2005,Topological structures of 3D tensor fields,10.1109/VISUAL.2005.1532841,http://dx.doi.org/10.1109/VISUAL.2005.1532841,551,558,C,"Tensor topology is useful in providing a simplified and yet detailed representation of a tensor field. Recently the field of 3D tensor topology is advanced by the discovery that degenerate tensors usually form lines in their most basic configurations. These lines form the backbone for further topological analysis. A number of ways for extracting and tracing the degenerate tensor lines have also been proposed. In this paper, we complete the previous work by studying the behavior and extracting the separating surfaces emanating from these degenerate lines. First, we show that analysis of eigenvectors around a 3D degenerate tensor can be reduced to 2D. That is, in most instances, the 3D separating surfaces are just the trajectory of the individual 2D separatrices which includes trisectors and wedges. But the proof is by no means trivial since it is closely related to perturbation theory around a pair of singular slate. Such analysis naturally breaks down at the tangential points where the degenerate lines pass through the plane spanned by the eigenvectors associated with the repeated eigenvalues. Second, we show that the separatrices along a degenerate line may switch types (e.g. trisectors to wedges) exactly at the points where the eigenplane is tangential to the degenerate curve. This property leads to interesting and yet complicated configuration of surfaces around such transition points. Finally, we apply the technique to several common data sets to verify its correctness.",Xiaoqiang Zheng;Beresford N. Parlett;Alex T. Pang,X. Zheng;B. Parlett;A. Pang,"Comput. Sci. Dept., UCSC, Santa Cruz, CA, USA",10.1109/VISUAL.2004.105;10.1109/VISUAL.1999.809894;10.1109/VISUAL.1994.346326;10.1109/VISUAL.2004.113;10.1109/VISUAL.2003.1250376,"separating surface, trisectors, wedges, symmetric tensors, hyperstreamlines, degenerate tensors, tensor topology, topological line",21,10,13,
InfoVis,2006,Topographic Visualization of Prefix Propagation in the Internet,10.1109/TVCG.2006.185,http://dx.doi.org/10.1109/TVCG.2006.185,725,732,J,"We propose a new metaphor for the visualization of prefixes propagation in the Internet. Such a metaphor is based on the concept of topographic map and allows to put in evidence the relative importance of the Internet Service Providers (ISPs) involved in the routing of the prefix. Based on the new metaphor we propose an algorithm for computing layouts and experiment with such algorithm on a test suite taken from the real Internet. The paper extends the visualization approach of the BGPlay service, which is an Internet routing monitoring tool widely used by ISP operators",Pier Francesco Cortese;Giuseppe Di Battista;Antonello Moneta;Maurizio Patrignani;Maurizio Pizzonia,Pier Francesco Cortese;Giuseppe Di Battista;Antonello Moneta;Maurizio Patrignani;Maurizio Pizzonia,,10.1109/INFVIS.2004.18;10.1109/INFVIS.2001.963279;10.1109/INFVIS.2002.1173160,"Interdomain Routing, Internet Visualization, Graph Drawing, Spring Embedder",21,16,37,
VAST,2006,Visual Analysis of Historic Hotel Visitation Patterns,10.1109/VAST.2006.261428,http://dx.doi.org/10.1109/VAST.2006.261428,35,42,C,"Understanding the space and time characteristics of human interaction in complex social networks is a critical component of visual tools for intelligence analysis, consumer behavior analysis, and human geography. Visual identification and comparison of patterns of recurring events is an essential feature of such tools. In this paper, we describe a tool for exploring hotel visitation patterns in and around Rebersburg, Pennsylvania from 1898-1900. The tool uses a wrapping spreadsheet technique, called reruns, to display cyclic patterns of geographic events in multiple overlapping natural and artificial calendars. Implemented as an improvise visualization, the tool is in active development through a iterative process of data collection, hypothesis, design, discovery, and evaluation in close collaboration with historical geographers. Several discoveries have inspired ongoing data collection and plans to expand exploration to include historic weather records and railroad schedules. Distributed online evaluations of usability and usefulness have resulted in numerous feature and design recommendations",Chris Weaver;David Fyfe;Anthony C. Robinson;Deryck Holdsworth;Donna Peuquet;Alan M. MacEachren,Chris Weaver;David Fyfe;Anthony Robinson;Deryck Holdsworth;Donna Peuquet;Alan M. MacEachren,"The GeoVISTA Center and Department of Geography, The Pennsylvania State University, e-mail: cweaver@psu.edu;The GeoVISTA Center and Department of Geography, The Pennsylvania State University, e-mail: dfyfe@psu.edu;The GeoVISTA Center and Department of Geography, The Pennsylvania State University, e-mail: arobinson@psu.edu;The GeoVISTA Center and Department of Geography, The Pennsylvania State University, e-mail: dwh6@ems.psu.edu;The GeoVISTA Center and Department of Geography, The Pennsylvania State University, e-mail: peuquet@psu.edu;The GeoVISTA Center and Department of Geography, The Pennsylvania State University, e-mail: maceachren@psu.edu",10.1109/INFVIS.2004.12;10.1109/INFVIS.2002.1173155;10.1109/INFVIS.2004.64,"Geovisualization, exploratory visualization, historical geography, coordinated multiple views, travel pattern analysis",21,9,18,
Vis,2006,Texturing of Layered Surfaces for Optimal Viewing,10.1109/TVCG.2006.183,http://dx.doi.org/10.1109/TVCG.2006.183,1125,1132,J,"This paper is a contribution to the literature on perceptually optimal visualizations of layered three-dimensional surfaces. Specifically, we develop guidelines for generating texture patterns, which, when tiled on two overlapped surfaces, minimize confusion in depth-discrimination and maximize the ability to localize distinct features. We design a parameterized texture space and explore this texture space using a ""human in the loop"" experimental approach. Subjects are asked to rate their ability to identify Gaussian bumps on both upper and lower surfaces of noisy terrain fields. Their ratings direct a genetic algorithm, which selectively searches the texture parameter space to find fruitful areas. Data collected from these experiments are analyzed to determine what combinations of parameters work well and to develop texture generation guidelines. Data analysis methods include ANOVA, linear discriminant analysis, decision trees, and parallel coordinates. To confirm the guidelines, we conduct a post-analysis experiment, where subjects rate textures following our guidelines against textures violating the guidelines. Across all subjects, textures following the guidelines consistently produce high rated textures on an absolute scale, and are rated higher than those that did not follow the guidelines",Alethea Bair;Donald H. House;Colin Ware,Alethea Bair;Donald H. House;Colin Ware,IEEE Computer Society,10.1109/VISUAL.2005.1532782;10.1109/INFVIS.2003.1249022,"perception, optimal visualization, layered surfaces, human-in-the-loop, genetic algorithm, data mining, linear discriminant analysis, parallel coordinates, decision trees",21,13,20,
VAST,2009,Analysis of community-contributed space- and time-referenced data (example of flickr and panoramio photos),10.1109/VAST.2009.5333472,http://dx.doi.org/10.1109/VAST.2009.5333472,213,214,M,"Space- and time-referenced data published on the Web by general people can be viewed in a dual way: as independent spatio-temporal events and as trajectories of people in the geographical space. These two views suppose different approaches to the analysis, which can yield different kinds of valuable knowledge about places and about people. We define possible types of analysis tasks related to the two views of the data and present several analysis methods appropriate for these tasks. The methods are suited to large amounts of the data.",Gennady L. Andrienko;Natalia V. Andrienko;Peter Bak;Slava Kisilevich;Daniel A. Keim,Gennady Andrienko;Natalia Andrienko;Peter Bak;Slava Kisilevich;Daniel Keim,"University of Bonn and Fraunhofer Institute IAIS, Germany;University of Bonn and Fraunhofer Institute IAIS, Germany;University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany",,,21,12,3,
InfoVis,2010,An Extension of Wilkinson's Algorithm for Positioning Tick Labels on Axes,10.1109/TVCG.2010.130,http://dx.doi.org/10.1109/TVCG.2010.130,1036,1043,J,"The non-data components of a visualization, such as axes and legends, can often be just as important as the data itself. They provide contextual information essential to interpreting the data. In this paper, we describe an automated system for choosing positions and labels for axis tick marks. Our system extends Wilkinson's optimization-based labeling approach to create a more robust, full-featured axis labeler. We define an expanded space of axis labelings by automatically generating additional nice numbers as needed and by permitting the extreme labels to occur inside the data range. These changes provide flexibility in problematic cases, without degrading quality elsewhere. We also propose an additional optimization criterion, legibility, which allows us to simultaneously optimize over label formatting, font size, and orientation. To solve this revised optimization problem, we describe the optimization function and an efficient search algorithm. Finally, we compare our method to previous work using both quantitative and qualitative metrics. This paper is a good example of how ideas from automated graphic design can be applied to information visualization.",Justin Talbot;Sharon Lin;Pat Hanrahan,Justin Talbot;Sharon Lin;Pat Hanrahan,Stanford University;Stanford University;Stanford University,,"Axis labeling, nice numbers",21,14,12,
InfoVis,2010,Gremlin: An Interactive Visualization Model for Analyzing Genomic Rearrangements,10.1109/TVCG.2010.163,http://dx.doi.org/10.1109/TVCG.2010.163,918,926,J,"In this work we present, apply, and evaluate a novel, interactive visualization model for comparative analysis of structural variants and rearrangements in human and cancer genomes, with emphasis on data integration and uncertainty visualization. To support both global trend analysis and local feature detection, this model enables explorations continuously scaled from the high-level, complete genome perspective, down to the low-level, structural rearrangement view, while preserving global context at all times. We have implemented these techniques in Gremlin, a genomic rearrangement explorer with multi-scale, linked interactions, which we apply to four human cancer genome data sets for evaluation. Using an insight-based evaluation methodology, we compare Gremlin to Circos, the state-of-the-art in genomic rearrangement visualization, through a small user study with computational biologists working in rearrangement analysis. Results from user study evaluations demonstrate that this visualization model enables more total insights, more insights per minute, and more complex insights than the current state-of-the-art for visual analysis and exploration of genome rearrangements.",Trevor M. O'Brien;Anna M. Ritz;Benjamin J. Raphael;David H. Laidlaw,Trevor O'Brien;Anna Ritz;Benjamin Raphael;David Laidlaw,Brown University;Brown University;Brown University;Brown University,10.1109/TVCG.2009.174;10.1109/TVCG.2009.167,"Information visualization, bioinformatics, insight-based evaluation",21,18,14,
VAST,2010,finding and visualizing relevant subspaces for clustering high-dimensional astronomical data using connected morphological operators,10.1109/VAST.2010.5652450,http://dx.doi.org/10.1109/VAST.2010.5652450,35,42,C,"Data sets in astronomy are growing to enormous sizes. Modern astronomical surveys provide not only image data but also catalogues of millions of objects (stars, galaxies), each object with hundreds of associated parameters. Exploration of this very high-dimensional data space poses a huge challenge. Subspace clustering is one among several approaches which have been proposed for this purpose in recent years. However, many clustering algorithms require the user to set a large number of parameters without any guidelines. Some methods also do not provide a concise summary of the datasets, or, if they do, they lack additional important information such as the number of clusters present or the significance of the clusters. In this paper, we propose a method for ranking subspaces for clustering which overcomes many of the above limitations. First we carry out a transformation from parametric space to discrete image space where the data are represented by a grid-based density field. Then we apply so-called connected morphological operators on this density field of astronomical objects that provides visual support for the analysis of the important subspaces. Clusters in subspaces correspond to high-intensity regions in the density image. The importance of a cluster is measured by a new quality criterion based on the dynamics of local maxima of the density. Connected operators are able to extract such regions with an indication of the number of clusters present. The subspaces are visualized during computation of the quality measure, so that the user can interact with the system to improve the results. In the result stage, we use three visualization toolkits linked within a graphical user interface so that the user can perform an in-depth exploration of the ranked subspaces. Evaluation based on synthetic as well as real astronomical datasets demonstrates the power of the new method. We recover various known astronomical relations directly from the data with little or no a priori assumptions. Hence, our method holds good prospects for discovering new relations as well.",Bilkis J. Ferdosi;Hugo Buddelmeijer;Scott C. Trager;Michael H. F. Wilkinson;Jos B. T. M. Roerdink,Bilkis J. Ferdosi;Hugo Buddelmeijer;Scott Trager;Michael H. F. Wilkinson;Jos B. T. M. Roerdink,"Johann Bernoulli Institute for Mathematics and Computer Science, University of Groningen;Kapteyn Astronomical Institute, University of Groningen;Kapteyn Astronomical Institute, University of Groningen;Johann Bernoulli Institute for Mathematics and Computer Science, University of Groningen;Johann Bernoulli Institute for Mathematics and Computer Science, University of Groningen",,"Subspace finding, clustering high-dimensional data, connected morphological operators, visual exploration, astronomical data",21,15,31,
VAST,2010,Poster: Dynamic time transformation for interpreting clusters of trajectories with space-time cube,10.1109/VAST.2010.5653580,http://dx.doi.org/10.1109/VAST.2010.5653580,213,214,M,We propose a set of techniques that support visual interpretation of trajectory clusters by transforming absolute time references into relative positions within temporal cycles or with respect to the starting and/or ending times of the trajectories. We demonstrate the work of the approach on a real data set about individual movement over one year.,Gennady L. Andrienko;Natalia V. Andrienko,Gennady Andrienko;Natalia Andrienko,University of Bonn and Fraunhofer Institute IAIS;University of Bonn and Fraunhofer Institute IAIS,,,21,17,9,
Vis,2010,Articulated Planar Reformation for Change Visualization in Small Animal Imaging,10.1109/TVCG.2010.134,http://dx.doi.org/10.1109/TVCG.2010.134,1396,1404,J,"The analysis of multi-timepoint whole-body small animal CT data is greatly complicated by the varying posture of the subject at different timepoints. Due to these variations, correctly relating and comparing corresponding regions of interest is challenging.In addition, occlusion may prevent effective visualization of these regions of interest. To address these problems, we have developed a method that fully automatically maps the data to a standardized layout of sub-volumes, based on an articulated atlas registration.We have dubbed this process articulated planar reformation, or APR. A sub-volume can be interactively selected for closer inspection and can be compared with the corresponding sub-volume at the other timepoints, employing a number of different comparative visualization approaches. We provide an additional tool that highlights possibly interesting areas based on the change of bone density between timepoints. Furthermore we allow visualization of the local registration error, to give an indication of the accuracy of the registration. We have evaluated our approach on a case that exhibits cancer-induced bone resorption.",Peter Kok;Martin Baiker;Emile A. Hendriks;Frits H. Post;Jouke Dijkstra;Clemens W. G. M. Löwik;Boudewijn P. F. Lelieveldt;Charl P. Botha,Peter Kok;Martin Baiker;Emile A. Hendriks;Frits H. Post;Jouke Dijkstra;Clemens W.G.M. Lowik;Boudewijn P.F. Lelieveldt;Charl P. Botha,,10.1109/TVCG.2009.169;10.1109/VISUAL.2002.1183754;10.1109/VISUAL.2003.1250400;10.1109/TVCG.2006.140;10.1109/TVCG.2008.143,"Small animal imaging, comparative visualization, multi-timepoint, molecular imaging, articulated planar reformation",21,19,28,
InfoVis,2011,A Study on Dual-Scale Data Charts,10.1109/TVCG.2011.160,http://dx.doi.org/10.1109/TVCG.2011.160,2469,2478,J,"We present the results of a user study that compares different ways of representing Dual-Scale data charts. Dual-Scale charts incorporate two different data resolutions into one chart in order to emphasize data in regions of interest or to enable the comparison of data from distant regions. While some design guidelines exist for these types of charts, there is currently little empirical evidence on which to base their design. We fill this gap by discussing the design space of Dual-Scale cartesian-coordinate charts and by experimentally comparing the performance of different chart types with respect to elementary graphical perception tasks such as comparing lengths and distances. Our study suggests that cut-out charts which include collocated full context and focus are the best alternative, and that superimposed charts in which focus and context overlap on top of each other should be avoided.",Petra Isenberg;Anastasia Bezerianos;Pierre Dragicevic;Jean-Daniel Fekete,Petra Isenberg;Anastasia Bezerianos;Pierre Dragicevic;Jean-Daniel Fekete,INRIA;&#x0C9;cole Centrale;INRIA;INRIA,10.1109/INFVIS.1998.729558;10.1109/TVCG.2009.174;10.1109/TVCG.2007.70577,"Focus+Context, Quantitative Experiment, Dual-Scale Charts",21,19,36,
InfoVis,2011,TreeNetViz: Revealing Patterns of Networks over Tree Structures,10.1109/TVCG.2011.247,http://dx.doi.org/10.1109/TVCG.2011.247,2449,2458,J,"Network data often contain important attributes from various dimensions such as social affiliations and areas of expertise in a social network. If such attributes exhibit a tree structure, visualizing a compound graph consisting of tree and network structures becomes complicated. How to visually reveal patterns of a network over a tree has not been fully studied. In this paper, we propose a compound graph model, TreeNet, to support visualization and analysis of a network at multiple levels of aggregation over a tree. We also present a visualization design, TreeNetViz, to offer the multiscale and cross-scale exploration and interaction of a TreeNet graph. TreeNetViz uses a Radial, Space-Filling (RSF) visualization to represent the tree structure, a circle layout with novel optimization to show aggregated networks derived from TreeNet, and an edge bundling technique to reduce visual complexity. Our circular layout algorithm reduces both total edge-crossings and edge length and also considers hierarchical structure constraints and edge weight in a TreeNet graph. These experiments illustrate that the algorithm can reduce visual cluttering in TreeNet graphs. Our case study also shows that TreeNetViz has the potential to support the analysis of a compound graph by revealing multiscale and cross-scale network patterns.",Liang Gou;Xiaolong Zhang 0001,Liang Gou;Xiaolong Luke Zhang,The Pennsylvania State University;The Pennsylvania State University,10.1109/INFVIS.2004.1;10.1109/INFVIS.2003.1249011;10.1109/INFVIS.2003.1249030;10.1109/INFVIS.2002.1173151;10.1109/TVCG.2009.167;10.1109/TVCG.2006.192;10.1109/TVCG.2008.135;10.1109/TVCG.2006.120;10.1109/INFVIS.2000.885091;10.1109/TVCG.2006.166;10.1109/TVCG.2007.70521;10.1109/TVCG.2006.147,"Compound graph, network and tree, TreeNetViz, visualization, multiscale and cross-scale",21,15,42,
InfoVis,2012,Intelligent Graph Layout Using Many Users' Input,10.1109/TVCG.2012.236,http://dx.doi.org/10.1109/TVCG.2012.236,2699,2708,J,"In this paper, we propose a new strategy for graph drawing utilizing layouts of many sub-graphs supplied by a large group of people in a crowd sourcing manner. We developed an algorithm based on Laplacian constrained distance embedding to merge subgraphs submitted by different users, while attempting to maintain the topological information of the individual input layouts. To facilitate collection of layouts from many people, a light-weight interactive system has been designed to enable convenient dynamic viewing, modification and traversing between layouts. Compared with other existing graph layout algorithms, our approach can achieve more aesthetic and meaningful layouts with high user preference.",Xiaoru Yuan;Limei Che;Yifan Hu;Xin Zhang,Xiaoru Yuan;Limei Che;Yifan Hu;Xin Zhang,Peking University;Peking University;AT&amp;T Labs Research;Peking University,10.1109/TVCG.2008.155;10.1109/INFVIS.2005.1532130;10.1109/TVCG.2009.109;10.1109/TVCG.2007.70580,"Graph layout, Laplacian matrix, force directed layout, stress model, merging, editing, crowd sourcing",21,18,33,
SciVis,2012,Automatic Detection and Visualization of Qualitative Hemodynamic Characteristics in Cerebral Aneurysms,10.1109/TVCG.2012.202,http://dx.doi.org/10.1109/TVCG.2012.202,2178,2187,J,"Cerebral aneurysms are a pathological vessel dilatation that bear a high risk of rupture. For the understanding and evaluation of the risk of rupture, the analysis of hemodynamic information plays an important role. Besides quantitative hemodynamic information, also qualitative flow characteristics, e.g., the inflow jet and impingement zone are correlated with the risk of rupture. However, the assessment of these two characteristics is currently based on an interactive visual investigation of the flow field, obtained by computational fluid dynamics (CFD) or blood flow measurements. We present an automatic and robust detection as well as an expressive visualization of these characteristics. The detection can be used to support a comparison, e.g., of simulation results reflecting different treatment options. Our approach utilizes local streamline properties to formalize the inflow jet and impingement zone. We extract a characteristic seeding curve on the ostium, on which an inflow jet boundary contour is constructed. Based on this boundary contour we identify the impingement zone. Furthermore, we present several visualization techniques to depict both characteristics expressively. Thereby, we consider accuracy and robustness of the extracted characteristics, minimal visual clutter and occlusions. An evaluation with six domain experts confirms that our approach detects both hemodynamic characteristics reasonably.",Rocco Gasteiger;Dirk J. Lehmann;Roy van Pelt;Gábor Janiga;Oliver Beuing;Anna Vilanova;Holger Theisel;Bernhard Preim,Rocco Gasteiger;Dirk J. Lehmann;Roy van Pelt;Gábor Janiga;Oliver Beuing;Anna Vilanova;Holger Theisel;Bernhard Preim,"University of Magdeburg, Germany;University of Magdeburg, Germany;Eindhoven University of Technology, Netherlands;University of Magdeburg, Germany;University Hospital Magdeburg, Germany;Eindhoven University of Technology, Netherlands;University of Magdeburg, Germany;University of Magdeburg, Germany",10.1109/TVCG.2011.215;10.1109/TVCG.2011.159;10.1109/TVCG.2011.243;10.1109/TVCG.2009.138;10.1109/TVCG.2010.153;10.1109/TVCG.2010.173,"Cerebral aneurysm, Hemodynamic, Inflow jet, Impingement zone, Visualization, Glyph",21,17,37,
VAST,2012,The User Puzzle---Explaining the Interaction with Visual Analytics Systems,10.1109/TVCG.2012.273,http://dx.doi.org/10.1109/TVCG.2012.273,2908,2916,J,"Visual analytics emphasizes the interplay between visualization, analytical procedures performed by computers and human perceptual and cognitive activities. Human reasoning is an important element in this context. There are several theories in psychology and HCI explaining open-ended and exploratory reasoning. Five of these theories (sensemaking theories, gestalt theories, distributed cognition, graph comprehension theories and skill-rule-knowledge models) are described in this paper. We discuss their relevance for visual analytics. In order to do this more systematically, we developed a schema of categories relevant for visual analytics research and evaluation. All these theories have strengths but also weaknesses in explaining interaction with visual analytics systems. A possibility to overcome the weaknesses would be to combine two or more of these theories.",Margit Pohl;Michael Smuc;Eva Mayr,Margit Pohl;Michael Smuc;Eva Mayr,Vienna University of Technology;Danube University Krems;Danube University Krems,10.1109/TVCG.2008.121;10.1109/TVCG.2007.70515;10.1109/VAST.2010.5653598;10.1109/VAST.2008.4677361;10.1109/VAST.2011.6102445,"Cognitive theory, visual knowledge discovery, interaction design, reasoning, problem solving",21,20,65,
InfoVis,2013,Hybrid-Image Visualization for Large Viewing Environments,10.1109/TVCG.2013.163,http://dx.doi.org/10.1109/TVCG.2013.163,2346,2355,J,"We present a first investigation into hybrid-image visualization for data analysis in large-scale viewing environments. Hybrid-image visualizations blend two different visual representations into a single static view, such that each representation can be perceived at a different viewing distance. Our work is motivated by data analysis scenarios that incorporate one or more displays with sufficiently large size and resolution to be comfortably viewed by different people from various distances. Hybrid-image visualizations can be used, in particular, to enhance overview tasks from a distance and detail-in-context tasks when standing close to the display. By using a perception-based blending approach, hybrid-image visualizations make two full-screen visualizations accessible without tracking viewers in front of a display. We contribute a design space, discuss the perceptual rationale for our work, provide examples, and introduce a set of techniques and tools to aid the design of hybrid-image visualizations.",Petra Isenberg;Pierre Dragicevic;Wesley Willett;Anastasia Bezerianos;Jean-Daniel Fekete,Petra Isenberg;Pierre Dragicevic;Wesley Willett;Anastasia Bezerianos;Jean-Daniel Fekete,INRIA;INRIA;INRIA;LRI (Univ. Paris-Sud &amp; CNRS) &amp; INRIA;INRIA,10.1109/TVCG.2012.251;10.1109/TVCG.2012.264;10.1109/TVCG.2006.184;10.1109/TVCG.2007.70582;10.1109/INFVIS.2001.963288;10.1109/TVCG.2007.70583;10.1109/INFVIS.2005.1532131,"Multi-scale, large displays, hybrid images, collaboration, visualization",21,16,47,
InfoVis,2013,Visual Compression of Workflow Visualizations with Automated Detection of Macro Motifs,10.1109/TVCG.2013.225,http://dx.doi.org/10.1109/TVCG.2013.225,2576,2585,J,"This paper is concerned with the creation of 'macros' in workflow visualization as a support tool to increase the efficiency of data curation tasks. We propose computation of candidate macros based on their usage in large collections of workflows in data repositories. We describe an efficient algorithm for extracting macro motifs from workflow graphs. We discovered that the state transition information, used to identify macro candidates, characterizes the structural pattern of the macro and can be harnessed as part of the visual design of the corresponding macro glyph. This facilitates partial automation and consistency in glyph design applicable to a large set of macro glyphs. We tested this approach against a repository of biological data holding some 9,670 workflows and found that the algorithmically generated candidate macros are in keeping with domain expert expectations.",Eamonn Maguire;Philippe Rocca-Serra;Susanna-Assunta Sansone;Jim Davies;Min Chen 0001,Eamonn Maguire;Philippe Rocca-Serra;Susanna-Assunta Sansone;Jim Davies;Min Chen,University of Oxford;University of Oxford;University of Oxford;University of Oxford;University of Oxford,10.1109/TVCG.2007.70584;10.1109/INFVIS.2004.12;10.1109/TVCG.2006.147;10.1109/TVCG.2009.195;10.1109/TVCG.2012.271;10.1109/VISUAL.1996.567752;10.1109/TVCG.2008.174;10.1109/TVCG.2006.166,"Workflow visualization, motif detection, glyph-based visualization, glyph generation, state-transition-based algorithm",21,17,42,
SciVis,2013,Lighting Design for Globally Illuminated Volume Rendering,10.1109/TVCG.2013.172,http://dx.doi.org/10.1109/TVCG.2013.172,2946,2955,J,"With the evolution of graphics hardware, high quality global illumination becomes available for real-time volume rendering. Compared to local illumination, global illumination can produce realistic shading effects which are closer to real world scenes, and has proven useful for enhancing volume data visualization to enable better depth and shape perception. However, setting up optimal lighting could be a nontrivial task for average users. There were lighting design works for volume visualization but they did not consider global light transportation. In this paper, we present a lighting design method for volume visualization employing global illumination. The resulting system takes into account view and transfer-function dependent content of the volume data to automatically generate an optimized three-point lighting environment. Our method fully exploits the back light which is not used by previous volume visualization systems. By also including global shadow and multiple scattering, our lighting system can effectively enhance the depth and shape perception of volumetric features of interest. In addition, we propose an automatic tone mapping operator which recovers visual details from overexposed areas while maintaining sufficient contrast in the dark areas. We show that our method is effective for visualizing volume datasets with complex structures. The structural information is more clearly and correctly presented under the automatically generated light sources.",Yubo Zhang;Kwan-Liu Ma,Yubo Zhang;Kwan-Liu Ma,"University of California, Davis;University of California, Davis",10.1109/VISUAL.2005.1532812;10.1109/VISUAL.2004.62;10.1109/TVCG.2011.198;10.1109/TVCG.2012.267;10.1109/VISUAL.2002.1183785,"Global illumination, lighting design, volume rendering, tone mapping",21,19,33,
SciVis,2013,Uncertainty Quantification in Linear Interpolation for Isosurface Extraction,10.1109/TVCG.2013.208,http://dx.doi.org/10.1109/TVCG.2013.208,2723,2732,J,"We present a study of linear interpolation when applied to uncertain data. Linear interpolation is a key step for isosurface extraction algorithms, and the uncertainties in the data lead to non-linear variations in the geometry of the extracted isosurface. We present an approach for deriving the probability density function of a random variable modeling the positional uncertainty in the isosurface extraction. When the uncertainty is quantified by a uniform distribution, our approach provides a closed-form characterization of the mentioned random variable. This allows us to derive, in closed form, the expected value as well as the variance of the level-crossing position. While the former quantity is used for constructing a stable isosurface for uncertain data, the latter is used for visualizing the positional uncertainties in the expected isosurface level crossings on the underlying grid.",Tushar M. Athawale;Alireza Entezari,Tushar Athawale;Alireza Entezari,University of Florida;University of Florida,10.1109/VISUAL.2005.1532853;10.1109/TVCG.2007.70602;10.1109/VISUAL.1991.175782;10.1109/TVCG.2007.70518;10.1109/TVCG.2012.249;10.1109/VISUAL.1994.346331;10.1109/VISUAL.1996.568116;10.1109/TVCG.2009.194;10.1109/TVCG.2011.203,"Uncertainty quantification, linear interpolation, isosurface extraction, marching cubes",21,25,36,
VAST,2013,Identifying Redundancy and Exposing Provenance in Crowdsourced Data Analysis,10.1109/TVCG.2013.164,http://dx.doi.org/10.1109/TVCG.2013.164,2198,2206,J,"We present a system that lets analysts use paid crowd workers to explore data sets and helps analysts interactively examine and build upon workers' insights. We take advantage of the fact that, for many types of data, independent crowd workers can readily perform basic analysis tasks like examining views and generating explanations for trends and patterns. However, workers operating in parallel can often generate redundant explanations. Moreover, because workers have different competencies and domain knowledge, some responses are likely to be more plausible than others. To efficiently utilize the crowd's work, analysts must be able to quickly identify and consolidate redundant responses and determine which explanations are the most plausible. In this paper, we demonstrate several crowd-assisted techniques to help analysts make better use of crowdsourced explanations: (1) We explore crowd-assisted strategies that utilize multiple workers to detect redundant explanations. We introduce color clustering with representative selection-a strategy in which multiple workers cluster explanations and we automatically select the most-representative result-and show that it generates clusterings that are as good as those produced by experts. (2) We capture explanation provenance by introducing highlighting tasks and capturing workers' browsing behavior via an embedded web browser, and refine that provenance information via source-review tasks. We expose this information in an explanation-management interface that allows analysts to interactively filter and sort responses, select the most plausible explanations, and decide which to explore further.",Wesley Willett;Shiry Ginosar;Avital Steinitz;Björn Hartmann;Maneesh Agrawala,Wesley Willett;Shiry Ginosar;Avital Steinitz;Björn Hartmann;Maneesh Agrawala,INRIA;UC Berkeley;UC Berkeley;UC Berkeley;UC Berkeley,10.1109/TVCG.2007.70577,"Crowdsourcing, social data analysis",21,14,23,
InfoVis,2014,PanoramicData: Data Analysis through Pen & Touch,10.1109/TVCG.2014.2346293,http://dx.doi.org/10.1109/TVCG.2014.2346293,2112,2121,J,"Interactively exploring multidimensional datasets requires frequent switching among a range of distinct but inter-related tasks (e.g., producing different visuals based on different column sets, calculating new variables, and observing the interactions between sets of data). Existing approaches either target specific different problem domains (e.g., data-transformation or data-presentation) or expose only limited aspects of the general exploratory process; in either case, users are forced to adopt coping strategies (e.g., arranging windows or using undo as a mechanism for comparison instead of using side-by-side displays) to compensate for the lack of an integrated suite of exploratory tools. PanoramicData (PD) addresses these problems by unifying a comprehensive set of tools for visual data exploration into a hybrid pen and touch system designed to exploit the visualization advantages of large interactive displays. PD goes beyond just familiar visualizations by including direct UI support for data transformation and aggregation, filtering and brushing. Leveraging an unbounded whiteboard metaphor, users can combine these tools like building blocks to create detailed interactive visual display networks in which each visualization can act as a filter for others. Further, by operating directly on relational-databases, PD provides an approachable visual language that exposes a broad set of the expressive power of SQL including functionally complete logic filtering, computation of aggregates and natural table joins. To understand the implications of this novel approach, we conducted a formative user study with both data and visualization experts. The results indicated that the system provided a fluid and natural user experience for probing multi-dimensional data and was able to cover the full range of queries that the users wanted to pose.",Emanuel Zgraggen;Robert C. Zeleznik;Steven Mark Drucker,Emanuel Zgraggen;Robert Zeleznik;Steven M. Drucker,Brown University;Brown University;Microsoft Research,10.1109/INFVIS.2000.885086;10.1109/TVCG.2009.162;10.1109/TVCG.2010.164;10.1109/TVCG.2011.251;10.1109/TVCG.2013.191;10.1109/TVCG.2012.275;10.1109/VAST.2007.4389013;10.1109/TVCG.2013.150;10.1109/TVCG.2007.70521;10.1109/TVCG.2008.137;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2007.70594;10.1109/TVCG.2012.204,"Visual analytics, pen and touch, user interfaces, interaction design, coordinated and multiple views",21,15,38,
InfoVis,2014,Comparative Eye Tracking Study on Node-Link Visualizations of Trajectories,10.1109/TVCG.2014.2346420,http://dx.doi.org/10.1109/TVCG.2014.2346420,2221,2230,J,"We present the results of an eye tracking study that compares different visualization methods for long, dense, complex, and piecewise linear spatial trajectories. Typical sources of such data are from temporally discrete measurements of the positions of moving objects, for example, recorded GPS tracks of animals in movement ecology. In the repeated-measures within-subjects user study, four variants of node-link visualization techniques are compared, with the following representations of directed links: standard arrow, tapered, equidistant arrows, and equidistant comets. In addition, we investigate the effect of rendering order for the halo visualization of those links as well as the usefulness of node splatting. All combinations of link visualization techniques are tested for different trajectory density levels. We used three types of tasks: tracing of paths, identification of longest links, and estimation of the density of trajectory clusters. Results are presented in the form of the statistical evaluation of task completion time, task solution accuracy, and two eye tracking metrics. These objective results are complemented by a summary of subjective feedback from the participants. The main result of our study is that tapered links perform very well. However, we discuss that equidistant comets and equidistant arrows are a good option to perceive direction information independent of zoom-level of the display.",Rudolf Netzel;Michael Burch;Daniel Weiskopf,Juhee Bae;Benjamin Watson,VISUS;VISUS;VISUS,10.1109/INFVIS.2004.1;10.1109/TVCG.2011.193;10.1109/TVCG.2011.226,"User study, eye tracking, evaluation, trajectory visualization, node-link visualization, direction encoding, node splatting, halo rendering",21,18,33,
VAST,2014,A Five-Level Design Framework for Bicluster Visualizations,10.1109/TVCG.2014.2346665,http://dx.doi.org/10.1109/TVCG.2014.2346665,1713,1722,J,"Analysts often need to explore and identify coordinated relationships (e.g., four people who visited the same five cities on the same set of days) within some large datasets for sensemaking. Biclusters provide a potential solution to ease this process, because each computed bicluster bundles individual relationships into coordinated sets. By understanding such computed, structural, relations within biclusters, analysts can leverage their domain knowledge and intuition to determine the importance and relevance of the extracted relationships for making hypotheses. However, due to the lack of systematic design guidelines, it is still a challenge to design effective and usable visualizations of biclusters to enhance their perceptibility and interactivity for exploring coordinated relationships. In this paper, we present a five-level design framework for bicluster visualizations, with a survey of the state-of-the-art design considerations and applications that are related or that can be applied to bicluster visualizations. We summarize pros and cons of these design options to support user tasks at each of the five-level relationships. Finally, we discuss future research challenges for bicluster visualizations and their incorporation into visual analytics tools.",Maoyuan Sun;Chris North 0001;Naren Ramakrishnan,Maoyuan Sun;Chris North;Naren Ramakrishnan,"Department of Computer Science, Discovery Analytics Center, Virginia Tech;Department of Computer Science, Discovery Analytics Center, Virginia Tech;Department of Computer Science, Discovery Analytics Center, Virginia Tech",10.1109/TVCG.2006.147;10.1109/TVCG.2009.153;10.1109/INFVIS.2005.1532126;10.1109/TVCG.2010.138;10.1109/VISUAL.1990.146402;10.1109/TVCG.2011.250;10.1109/TVCG.2006.160;10.1109/TVCG.2009.122;10.1109/VISUAL.1999.809866;10.1109/VAST.2006.261426;10.1109/INFVIS.2004.1;10.1109/VAST.2011.6102449;10.1109/TVCG.2013.167;10.1109/TVCG.2006.170;10.1109/TVCG.2007.70582,"Biclusters, interactive visual analytics, coordinated relationships, design framework",21,19,93,
InfoVis,2015,TimeNotes: A Study on Effective Chart Visualization and Interaction Techniques for Time-Series Data,10.1109/TVCG.2015.2467751,http://dx.doi.org/10.1109/TVCG.2015.2467751,549,558,J,"Collecting sensor data results in large temporal data sets which need to be visualized, analyzed, and presented. One-dimensional time-series charts are used, but these present problems when screen resolution is small in comparison to the data. This can result in severe over-plotting, giving rise for the requirement to provide effective rendering and methods to allow interaction with the detailed data. Common solutions can be categorized as multi-scale representations, frequency based, and lens based interaction techniques. In this paper, we comparatively evaluate existing methods, such as Stack Zoom [15] and ChronoLenses [38], giving a graphical overview of each and classifying their ability to explore and interact with data. We propose new visualizations and other extensions to the existing approaches. We undertake and report an empirical study and a field study using these techniques.",James S. Walker;Rita Borgo;Mark W. Jones,James Walker;Rita Borgo;Mark W. Jones,Swansea University;Swansea University;Swansea University,10.1109/TVCG.2009.181;10.1109/TVCG.2014.2346428;10.1109/INFVIS.2005.1532148;10.1109/TVCG.2011.160;10.1109/TVCG.2010.162;10.1109/TVCG.2010.193;10.1109/INFVIS.1999.801860;10.1109/TVCG.2011.195,"Time-series Exploration, Focus+Context, Lens, Interaction Techniques",21,24,38,
InfoVis,2015,Guidelines for Effective Usage of Text Highlighting Techniques,10.1109/TVCG.2015.2467759,http://dx.doi.org/10.1109/TVCG.2015.2467759,489,498,J,"Semi-automatic text analysis involves manual inspection of text. Often, different text annotations (like part-of-speech or named entities) are indicated by using distinctive text highlighting techniques. In typesetting there exist well-known formatting conventions, such as bold typeface, italics, or background coloring, that are useful for highlighting certain parts of a given text. Also, many advanced techniques for visualization and highlighting of text exist; yet, standard typesetting is common, and the effects of standard typesetting on the perception of text are not fully understood. As such, we surveyed and tested the effectiveness of common text highlighting techniques, both individually and in combination, to discover how to maximize pop-out effects while minimizing visual interference between techniques. To validate our findings, we conducted a series of crowd-sourced experiments to determine: i) a ranking of nine commonly-used text highlighting techniques; ii) the degree of visual interference between pairs of text highlighting techniques; iii) the effectiveness of techniques for visual conjunctive search. Our results show that increasing font size works best as a single highlighting technique, and that there are significant visual interferences between some pairs of highlighting techniques. We discuss the pros and cons of different combinations as a design guideline to choose text highlighting techniques for text viewers.",Hendrik Strobelt;Daniela Oelke;Bum Chul Kwon;Tobias Schreck;Hanspeter Pfister,Hendrik Strobelt;Daniela Oelke;Bum Chul Kwon;Tobias Schreck;Hanspeter Pfister,Harvard University;Siemens AG;University of Konstanz;TU Graz;Harvard University,10.1109/TVCG.2012.277;10.1109/VAST.2007.4389004;10.1109/TVCG.2014.2346677;10.1109/TVCG.2007.70594;10.1109/TVCG.2011.183;10.1109/TVCG.2009.139;10.1109/VAST.2011.6102453;10.1109/INFVIS.1995.528686,"Text highlighting techniques, visual document analytics, text annotation, crowdsourced study",21,15,34,
InfoVis,2015,Poemage: Visualizing the Sonic Topology of a Poem,10.1109/TVCG.2015.2467811,http://dx.doi.org/10.1109/TVCG.2015.2467811,439,448,J,"The digital humanities have experienced tremendous growth within the last decade, mostly in the context of developing computational tools that support what is called distant reading - collecting and analyzing huge amounts of textual data for synoptic evaluation. On the other end of the spectrum is a practice at the heart of the traditional humanities, close reading - the careful, in-depth analysis of a single text in order to extract, engage, and even generate as much productive meaning as possible. The true value of computation to close reading is still very much an open question. During a two-year design study, we explored this question with several poetry scholars, focusing on an investigation of sound and linguistic devices in poetry. The contributions of our design study include a problem characterization and data abstraction of the use of sound in poetry as well as Poemage, a visualization tool for interactively exploring the sonic topology of a poem. The design of Poemage is grounded in the evaluation of a series of technology probes we deployed to our poetry collaborators, and we validate the final design with several case studies that illustrate the disruptive impact technology can have on poetry scholarship. Finally, we also contribute a reflection on the challenges we faced conducting visualization research in literary studies.",Nina McCurdy;Julie Lein;Katherine Coles;Miriah D. Meyer,Nina McCurdy;Julie Lein;Katharine Coles;Miriah Meyer,University of Utah School of Computing;University of Utah Department of English;University of Utah Department of English;University of Utah School of Computing,10.1109/TVCG.2011.186;10.1109/TVCG.2009.122;10.1109/VAST.2009.5333443;10.1109/TVCG.2008.135;10.1109/TVCG.2011.233;10.1109/INFVIS.2005.1532126;10.1109/TVCG.2012.213;10.1109/VAST.2007.4389006;10.1109/TVCG.2009.165;10.1109/TVCG.2009.171;10.1109/INFVIS.2002.1173155;10.1109/TVCG.2008.172;10.1109/INFVIS.1995.528686,"Visualization in the humanities, design studies, text and document data, graph/network data",21,21,58,
InfoVis,2015,Visual Mementos: Reflecting Memories with Personal Data,10.1109/TVCG.2015.2467831,http://dx.doi.org/10.1109/TVCG.2015.2467831,369,378,J,"In this paper we discuss the creation of visual mementos as a new application area for visualization. We define visual mementos as visualizations of personally relevant data for the purpose of reminiscing, and sharing of life experiences. Today more people collect digital information about their life than ever before. The shift from physical to digital archives poses new challenges and opportunities for self-reflection and self-representation. Drawing on research on autobiographical memory and on the role of artifacts in reminiscing, we identified design challenges for visual mementos: mapping data to evoke familiarity, expressing subjectivity, and obscuring sensitive details for sharing. Visual mementos can make use of the known strengths of visualization in revealing patterns to show the familiar instead of the unexpected, and extend representational mappings beyond the objective to include the more subjective. To understand whether people's subjective views on their past can be reflected in a visual representation, we developed, deployed and studied a technology probe that exemplifies our concept of visual mementos. Our results show how reminiscing has been supported and reveal promising new directions for self-reflection and sharing through visual mementos of personal experiences.",Alice Thudt;Dominikus Baur;Samuel Huron;Sheelagh Carpendale,Alice Thudt;Dominikus Baur;Samuel Huron;Sheelagh Carpendale,University of Calgary;An Independent Researcher;University of Calgary;University of Calgary,10.1109/TVCG.2010.206;10.1109/TVCG.2007.70541;10.1109/TVCG.2014.2352953;10.1109/INFVIS.2004.8,"Visual Memento, Memories, Personal Visualization, Movement Data, World Wide Web",21,25,69,
VAST,2015,An Uncertainty-Aware Approach for Exploratory Microblog Retrieval,10.1109/TVCG.2015.2467554,http://dx.doi.org/10.1109/TVCG.2015.2467554,250,259,J,"Although there has been a great deal of interest in analyzing customer opinions and breaking news in microblogs, progress has been hampered by the lack of an effective mechanism to discover and retrieve data of interest from microblogs. To address this problem, we have developed an uncertainty-aware visual analytics approach to retrieve salient posts, users, and hashtags. We extend an existing ranking technique to compute a multifaceted retrieval result: the mutual reinforcement rank of a graph node, the uncertainty of each rank, and the propagation of uncertainty among different graph nodes. To illustrate the three facets, we have also designed a composite visualization with three visual components: a graph visualization, an uncertainty glyph, and a flow map. The graph visualization with glyphs, the flow map, and the uncertainty analysis together enable analysts to effectively find the most uncertain results and interactively refine them. We have applied our approach to several Twitter datasets. Qualitative evaluation and two real-world case studies demonstrate the promise of our approach for retrieving high-quality microblog data.",Mengchen Liu;Shixia Liu;Xizhou Zhu;Qinying Liao;Furu Wei;Shimei Pan,Mengchen Liu;Shixia Liu;Xizhou Zhu;Qinying Liao;Furu Wei;Shimei Pan,"Tsinghua University;Tsinghua University;USTC;Microsoft;Microsoft;University of Maryland, Baltimore County",10.1109/TVCG.2013.186;10.1109/TVCG.2012.291;10.1109/VAST.2009.5332611;10.1109/TVCG.2013.223;10.1109/TVCG.2011.233;10.1109/VAST.2014.7042494;10.1109/VISUAL.1996.568116;10.1109/INFVIS.2005.1532150;10.1109/VAST.2010.5652931;10.1109/TVCG.2011.197;10.1109/TVCG.2014.2346919;10.1109/TVCG.2013.232;10.1109/TVCG.2011.202;10.1109/TVCG.2014.2346920;10.1109/TVCG.2010.183;10.1109/TVCG.2012.285;10.1109/TVCG.2013.221;10.1109/TVCG.2014.2346922,"microblog data, mutual reinforcement model, uncertainty modeling, uncertainty visualization, uncertainty propagation",21,27,55,
VAST,2015,The Visual Causality Analyst: An Interactive Interface for Causal Reasoning,10.1109/TVCG.2015.2467931,http://dx.doi.org/10.1109/TVCG.2015.2467931,230,239,J,"Uncovering the causal relations that exist among variables in multivariate datasets is one of the ultimate goals in data analytics. Causation is related to correlation but correlation does not imply causation. While a number of casual discovery algorithms have been devised that eliminate spurious correlations from a network, there are no guarantees that all of the inferred causations are indeed true. Hence, bringing a domain expert into the casual reasoning loop can be of great benefit in identifying erroneous casual relationships suggested by the discovery algorithm. To address this need we present the Visual Causal Analyst - a novel visual causal reasoning framework that allows users to apply their expertise, verify and edit causal links, and collaborate with the causal discovery algorithm to identify a valid causal network. Its interface consists of both an interactive 2D graph view and a numerical presentation of salient statistical parameters, such as regression coefficients, p-values, and others. Both help users in gaining a good understanding of the landscape of causal structures particularly when the number of variables is large. Our framework is also novel in that it can handle both numerical and categorical variables within one unified model and return plausible results. We demonstrate its use via a set of case studies using multiple practical datasets.",Jun Wang;Klaus Mueller,Jun Wang;Klaus Mueller,"Computer Science Department, Visual Analytics and Imaging Lab, Stony Brook, NY;Computer Science Department, Visual Analytics and Imaging Lab, Stony Brook, NY",10.1109/INFVIS.2003.1249025;10.1109/TVCG.2007.70528;10.1109/TVCG.2012.225;10.1109/VAST.2007.4388999,"Visual knowledge discovery, Causality, Hypothesis testing, Visual evidence, High-dimensional data",21,24,31,
InfoVis,2016,Gaussian Cubes: Real-Time Modeling for Visual Exploration of Large Multidimensional Datasets,10.1109/TVCG.2016.2598694,http://dx.doi.org/10.1109/TVCG.2016.2598694,681,690,J,"Recently proposed techniques have finally made it possible for analysts to interactively explore very large datasets in real time. However powerful, the class of analyses these systems enable is somewhat limited: specifically, one can only quickly obtain plots such as histograms and heatmaps. In this paper, we contribute Gaussian Cubes, which significantly improves on state-of-the-art systems by providing interactive modeling capabilities, which include but are not limited to linear least squares and principal components analysis (PCA). The fundamental insight in Gaussian Cubes is that instead of precomputing counts of many data subsets (as state-of-the-art systems do), Gaussian Cubes precomputes the best multivariate Gaussian for the respective data subsets. As an example, Gaussian Cubes can fit hundreds of models over millions of data points in well under a second, enabling novel types of visual exploration of such large datasets. We present three case studies that highlight the visualization and analysis capabilities in Gaussian Cubes, using earthquake safety simulations, astronomical catalogs, and transportation statistics. The dataset sizes range around one hundred million elements and 5 to 10 dimensions. We present extensive performance results, a discussion of the limitations in Gaussian Cubes, and future research directions.",Zhe Wang;Nivan Ferreira;Youhao Wei;Aarthy Sankari Bhaskar;Carlos Scheidegger,Zhe Wang;Nivan Ferreira;Youhao Wei;Aarthy Sankari Bhaskar;Carlos Scheidegger,University of Arizona;Universidade Federal de Pernambuco;University of Arizona;University of Arizona;University of Arizona,10.1109/VAST.2008.4677357;10.1109/INFVIS.2000.885086;10.1109/TVCG.2013.179;10.1109/TVCG.2014.2346452;10.1109/TVCG.2009.129;10.1109/TVCG.2013.141;10.1109/TVCG.2014.2346325;10.1109/VAST.2012.6400490,data cubes;Data modeling;dimensionality reduction;interactive visualization,21,20,45,
InfoVis,2016,Evaluating the Impact of Binning 2D Scalar Fields,10.1109/TVCG.2016.2599106,http://dx.doi.org/10.1109/TVCG.2016.2599106,431,440,J,"The expressiveness principle for visualization design asserts that a visualization should encode all of the available data, and only the available data, implying that continuous data types should be visualized with a continuous encoding channel. And yet, in many domains binning continuous data is not only pervasive, but it is accepted as standard practice. Prior work provides no clear guidance for when encoding continuous data continuously is preferable to employing binning techniques or how this choice affects data interpretation and decision making. In this paper, we present a study aimed at better understanding the conditions in which the expressiveness principle can or should be violated for visualizing continuous data. We provided participants with visualizations employing either continuous or binned greyscale encodings of geospatial elevation data and compared participants' ability to complete a wide variety of tasks. For various tasks, the results indicate significant differences in decision making, confidence in responses, and task completion time between continuous and binned encodings of the data. In general, participants with continuous encodings were faster to complete many of the tasks, but never outperformed those with binned encodings, while performance accuracy with binned encodings was superior to continuous encodings in some tasks. These findings suggest that strict adherence to the expressiveness principle is not always advisable. We discuss both the implications and limitations of our results and outline various avenues for potential work needed to further improve guidelines for using continuous versus binned encodings for continuous data types.",Lace M. K. Padilla;P. Samuel Quinan;Miriah D. Meyer;Sarah H. Creem-Regehr,Lace Padilla;P. Samuel Quinan;Miriah Meyer;Sarah H. Creem-Regehr,"Department of Psychology, University of Utah;University of UtahSchool of Computing;University of UtahSchool of Computing;Department of Psychology, University of Utah",10.1109/TVCG.2011.175;10.1109/TVCG.2015.2467754;10.1109/VISUAL.1999.809932;10.1109/VISUAL.1996.568118;10.1109/VISUAL.1995.480803;10.1109/TVCG.2013.124,Geographic/Geospatial Visualization;Qualitative Evaluation;Color Perception;Perceptual Cognition,21,19,54,
VAST,2017,ConceptVector: Text Visual Analytics via Interactive Lexicon Building Using Word Embedding,10.1109/TVCG.2017.2744478,http://dx.doi.org/10.1109/TVCG.2017.2744478,361,370,J,"Central to many text analysis methods is the notion of a concept: a set of semantically related keywords characterizing a specific object, phenomenon, or theme. Advances in word embedding allow building a concept from a small set of seed terms. However, naive application of such techniques may result in false positive errors because of the polysemy of natural language. To mitigate this problem, we present a visual analytics system called ConceptVector that guides a user in building such concepts and then using them to analyze documents. Document-analysis case studies with real-world datasets demonstrate the fine-grained analysis provided by ConceptVector. To support the elaborate modeling of concepts, we introduce a bipolar concept model and support for specifying irrelevant words. We validate the interactive lexicon building interface by a user study and expert reviews. Quantitative evaluation shows that the bipolar lexicon generated with our methods is comparable to human-generated ones.",Deok Gun Park 0001;Seungyeon Kim;Jurim Lee;Jaegul Choo;Nicholas Diakopoulos;Niklas Elmqvist,Deokgun Park;Seungyeon Kim;Jurim Lee;Jaegul Choo;Nicholas Diakopoulos;Niklas Elmqvist,"University of Maryland, College Park, MD, USA;Google Inc., Mountain View, CA, USA;Korea University, Seoul, Republic of Korea;Korea University, Seoul, Republic of Korea;Northwestern University, Evanston, IL, USA;University of Maryland, College Park, MD, USA",10.1109/TVCG.2016.2598667;10.1109/TVCG.2013.212;10.1109/TVCG.2011.239;10.1109/VAST.2011.6102461;10.1109/TVCG.2016.2598446;10.1109/TVCG.2015.2467555,"Text analytics,visual analytics,word embedding,text summarization,text classification,concepts",21,9,44,
Vis,1994,An annotation system for 3D fluid flow visualization,10.1109/VISUAL.1994.346309,http://dx.doi.org/10.1109/VISUAL.1994.346309,273,"279, C31",C,"Annotation is a key activity of data analysis. However, current data analysis systems focus almost exclusively on visualization. We propose a system which integrates annotations into a visualization system. Annotations are embedded in 3D data space, using the Post-it metaphor. This embedding allows contextual-based information storage and retrieval, and facilitates information sharing in collaborative environments. We provide a traditional database filter and a Magic Lens filter to create specialized views of the data. The system is customized for fluid flow applications, with features which allow users to store parameters of visualization tools and sketch 3D volumes.&lt;&lt;ETX&gt;&gt;",Maria M. Loughlin;John F. Hughes,M.M. Loughlin;J.F. Hughes,"Res. Lab., Digital Equipment Corp., Cambridge, MA, USA",10.1109/VISUAL.1990.146360;10.1109/VISUAL.1991.175837;10.1109/VISUAL.1992.235203,,20,7,16,
Vis,1996,Directional flow visualization of vector fields,10.1109/VISUAL.1996.568139,http://dx.doi.org/10.1109/VISUAL.1996.568139,389,392,C,"The paper presents interactive flow visualization methods that highlight directional information in the flow field. An added benefit of the proposed methods is that they reduce the amount of data being displayed and hence reduce clutter. The main idea behind these methods is the use of light sources to select and highlight regions in the flow field with similar directions. Varying the lighting conditions, by moving the light source and/or adding more lights, emphasizes different vector directions, set of directions, and vectors within a specified angle of a particular direction. The methods are straight forward, computationally inexpensive, and can be combined with other techniques that use glyph representation and other flow geometry such as streamlines for feature visualization. The authors apply these methods to an analytic data set to help explain how they work, and then to a simulation data set to highlight flow reversals.",Ed Boring;Alex T. Pang,E. Boring;A. Pang,"Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA",10.1109/VISUAL.1995.480819,"glyphs, streamlines, lighting, hue, value, region selection, clutter reduction, flow reversal",20,10,8,
Vis,1997,Dynamic smooth subdivision surfaces for data visualization,10.1109/VISUAL.1997.663905,http://dx.doi.org/10.1109/VISUAL.1997.663905,371,377,C,"Recursive subdivision schemes have been extensively used in computer graphics and scientific visualization for modeling smooth surfaces of arbitrary topology. Recursive subdivision generates a visually pleasing smooth surface in the limit from an initial user-specified polygonal mesh through the repeated application of a fixed set of subdivision rules. In this paper, we present a new dynamic surface model based on the Catmull-Clark (1978) subdivision scheme, which is a very popular method to model complicated objects of arbitrary genus because of many of its nice properties. Our new dynamic surface model inherits the attractive properties of the Catmull-Clark subdivision scheme as well as that of the physics-based modeling paradigm. This new model provides a direct and intuitive means of manipulating geometric shapes, a fast, robust and hierarchical approach for recovering complex geometric shapes from range and volume data using very few degrees of freedom (control vertices). We provide an analytic formulation and introduce the physical quantities required to develop the dynamic subdivision surface model which can be interactively deformed by applying synthesized forces in real time. The governing dynamic differential equation is derived using Lagrangian mechanics and a finite element discretization. Our experiments demonstrate that this new dynamic model has a promising future in computer graphics, geometric shape design and scientific visualization.",Chhandomay Mandal;Hong Qin;Baba C. Vemuri,C. Mandal;Hong Qin;B.C. Vemuri,"Dept. of Comput. & Inf. Sci. & Eng., Florida Univ., Gainesville, FL, USA",,"Visualization, Subdivision Surfaces, Dynamics, Finite Elements, Interactive Techniques",20,4,17,
InfoVis,1998,IVORY-an object-oriented framework for physics-based information visualization in Java,10.1109/INFVIS.1998.729562,http://dx.doi.org/10.1109/INFVIS.1998.729562,79,"86, 155",C,"We present IVORY a newly developed, platform-independent framework for physics based visualization. IVORY is especially designed for information visualization applications and multidimensional graph layout. It is fully implemented in Java 1.1 and its architecture features client server setup, which allows us to run the visualization even on thin clients. In addition, VRML 2.0 exports can be viewed by any VRML plugged-in WWW browser. Individual visual metaphors are invoked into IVORY via an advanced plug-in mechanism, where plug-ins can be implemented by any experienced user. The configuration of IVORY is accomplished using a script language, called IVML. Some interactive visualization examples, such as the integration of a haptic interface illustrate the performance and versatility of our system. Our current implementation supports NT 4.0.",Thomas C. Sprenger;Markus H. Gross;Daniel Bielser;T. Strasser,T.C. Sprenger;M.H. Gross;D. Bielser;T. Strasser,"Dept. of Comput. Sci., Fed. Inst. of Technol., Zurich, Switzerland",10.1109/INFVIS.1995.528691;10.1109/VISUAL.1996.567752;10.1109/INFVIS.1997.636759;10.1109/INFVIS.1995.528688;10.1109/INFVIS.1996.559226,"three-dimensional information visualization,physics-based graph layout, object-oriented visualization toolkit,multidimensional information modeling, time varying data",20,7,26,
Vis,1998,Visualizing differences in movies of cortical activity,10.1109/VISUAL.1998.745306,http://dx.doi.org/10.1109/VISUAL.1998.745306,217,224,C,"This paper discusses techniques for visualizing structure in video data and other data sets that represent time snapshots of physical phenomena. Individual frames of a movie are treated as vectors and projected onto a low-dimensional subspace spanned by principal components. Movies can be compared and their differences visualized by analyzing the nature of the subspace and the projections of multiple movies onto the same subspace. The approach is demonstrated on an application in neurobiology in which the electrical response of a visual cortex to optical stimulation is imaged onto a high-speed photodiode array to produce a cortical movie. Techniques for sampling movies over a single trial and multiple trials are discussed. The approach provides the traditional benefits of principal component analysis (compression, noise reduction and classification) and also allows the visual separation of spatial and temporal behavior.",Kay A. Robbins;David M. Senseman,K.A. Robbins;D.M. Senseman,"Div. of Comput. Sci., Texas Univ., San Antonio, TX, USA",10.1109/VISUAL.1997.663899,"scientific visualization, animation, video analysis",20,10,26,
InfoVis,1999,Efficient multi-object dynamic query histograms,10.1109/INFVIS.1999.801862,http://dx.doi.org/10.1109/INFVIS.1999.801862,84,91,C,"Dynamic queries offer continuous feedback during range queries, and have been shown to be effective and satisfying. Recent work has extended them to datasets of 100,000 objects and, separately, to queries involving relations among multiple objects. The latter work enables filtering houses by properties of their owners, for instance. Our primary concern is providing feedback from histograms during dynamic query. The height of each histogram bar shows the count of selected objects whose attribute value falls into a given range. Unfortunately, previous efficient algorithms for single object queries overcount in the case of multiple objects if for instance, a house has multiple owners. This paper presents an efficient algorithm that with high probability closely approximates the true counts.",Mark Derthick;James Harrison;Andrew Moore;Steven F. Roth,M. Derthick;J. Harrison;A. Moore;S.F. Roth,"Carnegie Mellon Univ., Pittsburgh, PA, USA",10.1109/INFVIS.1997.636790,"Dynamic Query, Database, Probabilistic Algorithms",20,9,15,
Vis,2000,Immersive virtual reality for visualizing flow through an artery,10.1109/VISUAL.2000.885731,http://dx.doi.org/10.1109/VISUAL.2000.885731,457,460,C,"We present an immersive system for exploring numerically simulated flow data through a model of a coronary artery graft. This tightly-coupled interdisciplinary project is aimed at understanding how to reduce the failure rate of these grafts. The visualization system provides a mechanism for exploring the effect of changes to the geometry, to the flow, and for exploring potential sources of future lesions. The system uses gestural and voice interactions exclusively, moving away from more traditional windows/icons/menus/point-and-click (WIMP) interfaces. We present an example session using the system and discuss our experiences developing, testing, and using it. We describe some of the interaction and rendering techniques that we experimented with and describe their level of success. Our experience suggests that systems like this are exciting to clinical researchers, but conclusive evidence of their value is not yet available.",Andrew S. Forsberg;David H. Laidlaw;Andries van Dam;Robert Michael Kirby;George E. Karniadakis;Jonathan L. Elion,A.S. Forsberg;D.H. Laidlaw;A. Van Dam;R.M. Kirby;G.E. Kafniadakis;J.L. Elion,"Dept. of Comput. Sci., Brown Univ., Providence, RI, USA",10.1109/VISUAL.1991.175771,,20,9,17,
InfoVis,2001,Visualization of state transition graphs,10.1109/INFVIS.2001.963281,http://dx.doi.org/10.1109/INFVIS.2001.963281,59,66,C,,Frank van Ham;Huub van de Wetering;Jarke J. van Wijk,F. van Ham;H. van de Wetering;J.J. van Wijk,Eindhoven University of Technology,10.1109/INFVIS.1995.528691;10.1109/INFVIS.1995.528689,,20,12,13,
Vis,2002,Optimized view-dependent rendering for large polygonal datasets,10.1109/VISUAL.2002.1183760,http://dx.doi.org/10.1109/VISUAL.2002.1183760,77,84,C,"In this paper we are presenting a novel approach for rendering large datasets in a view-dependent manner. In a typical view-dependent rendering framework, an appropriate level of detail is selected and sent to the graphics hardware for rendering at each frame. In our approach, we have successfully managed to speed up the selection of the level of detail as well as the rendering of the selected levels. We have accelerated the selection of the appropriate level of detail by not scanning active nodes that do not contribute to the incremental update of the selected level of detail. Our idea is based on imposing a spatial subdivision over the view-dependence trees data-structure, which allows spatial tree cells to refine and merge in real-time rendering to comply with the changes in the active nodes list. The rendering of the selected level of detail is accelerated by using vertex arrays. To overcome the dynamic changes in the selected levels of detail we use multiple small vertex arrays whose sizes depend on the memory on the graphics hardware. These multiple vertex arrays are attached to the active cells of the spatial tree and represent the active nodes of these cells. These vertex arrays, which are sent to the graphics hardware at each frame, merge and split with respect to the changes in the cells of the spatial tree.",Jihad El-Sana;Eitan Bachmant,J. El-Sana;E. Bachmat,"Dept. of Comput. Sci., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel;Dept. of Comput. Sci., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel",10.1109/VISUAL.1999.809877;10.1109/VISUAL.1997.663860;10.1109/VISUAL.2000.885724;10.1109/VISUAL.1998.745283;10.1109/VISUAL.1995.480805,"Surface Simplification, Level of Detail, Multiresolution Hierarchies, View-Dependent Rendering",20,9,15,
Vis,2002,A case study in selective visualization of unsteady 3D flow,10.1109/VISUAL.2002.1183821,http://dx.doi.org/10.1109/VISUAL.2002.1183821,525,528,C,"In this case study, we explore techniques for the purpose of visualizing isolated flow structures in time-dependent data. Our primary industrial application is the visualization of the vortex rope, a rotating helical structure which builds up in the draft tube of a water turbine. The vortex rope can be characterized by high values of normalized helicity, which is a scalar field derived from the given CFD velocity data. In two related applications, the goal is to visualize the cavitation regions near the runner blades of a Kaplan turbine and a water pump, respectively. Again, the flow structure of interest can be defined by a scalar field, namely by low pressure values. We propose a particle seeding scheme based on quasi-random numbers, which minimizes visual artifacts such as clusters or patterns. By constraining the visualization to a region of interest, occlusion problems are reduced and storage efficiency is gained.",Dirk Bauer;Ronald Peikert;Mie Sato;Mirjam Sick,D. Bauer;R. Peikert;M. Sato;M. Sick,"Dept. of Comput. Sci., Eidgenossische Tech. Hochschule, Zurich, Switzerland;Dept. of Comput. Sci., Eidgenossische Tech. Hochschule, Zurich, Switzerland;Dept. of Comput. Sci., Eidgenossische Tech. Hochschule, Zurich, Switzerland",10.1109/VISUAL.1994.346327;10.1109/VISUAL.2001.964493,"Flow Visualization, Feature Extraction, Particle Tracing",20,10,9,
Vis,2003,Exploring curved anatomic structures with surface sections,10.1109/VISUAL.2003.1250351,http://dx.doi.org/10.1109/VISUAL.2003.1250351,27,34,C,"The extraction of planar sections from volume images is the most commonly used technique for inspecting and visualizing anatomic structures. We propose to generalize the concept of planar section to the extraction of curved cross-sections (free form surfaces). Compared with planar slices, curved cross-sections may easily follow the trajectory of tubular structures and organs such as the aorta or the colon. They may be extracted from a 3D volume, displayed as a 3D view and possibly flattened. Flattening of curved cross-sections allows to inspect spatially complex relationship between anatomic structures and their neighborhood. They also allow to carry out measurements along a specific orientation. For the purpose of facilitating the interactive specification of free form surfaces, users may navigate in real time within the body and select the slices on which the surface control points will be positioned. Immediate feedback is provided by displaying boundary curves as cylindrical markers within a 3D view composed of anatomic organs, planar slices and possibly free form surface sections. Extraction of curved surface sections is an additional service that is available online as a Java applet (http://visiblehuman.epfl.ch). It may be used as an advanced tool for exploring and teaching anatomy.",Laurent Saroul;Sebastian Gerlach;Roger D. Hersch,L. Saroul;S. Gerlach;R.D. Herch,"Ecole Polytechnique Federale de Lausanne, Switzerland;Ecole Polytechnique Federale de Lausanne, Switzerland;Ecole Polytechnique Federale de Lausanne, Switzerland",10.1109/VISUAL.2002.1183754,"visualization, anatomic structures, curved sections, surface extraction, interactive flattening",20,5,13,
Vis,2003,Space efficient fast isosurface extraction for large datasets,10.1109/VISUAL.2003.1250373,http://dx.doi.org/10.1109/VISUAL.2003.1250373,201,208,C,"In this paper, we present a space efficient algorithm for speeding up isosurface extraction. Even though there exist algorithms that can achieve optimal search performance to identify isosurface cells, they prove impractical for large datasets due to a high storage overhead. With the dual goals of achieving fast isosurface extraction and simultaneously reducing the space requirement, we introduce an algorithm based on transform coding to compress the interval information of the cells in a dataset. Compression is achieved by first transforming the cell intervals (minima, maxima) into a form which allows more efficient compaction. It is followed by a dataset optimized non-uniform quantization stage. The compressed data is stored in a data structure that allows fast searches in the compression domain, thus eliminating the need to retrieve the original representation of the intervals at run-time. The space requirement of our search data structure is the mandatory cost of storing every cell ID once, plus an overhead for quantization information. The overhead is typically in the order of a few hundredths of the dataset size.",Udeepta Bordoloi;Han-Wei Shen,U.D. Bordoloi;Han-Wei Shen,"Dept. of Comput. & Inf. Sci., Ohio State Univ., USA;Dept. of Comput. & Inf. Sci., Ohio State Univ., USA",10.1109/VISUAL.1998.745299;10.1109/VISUAL.1997.663895;10.1109/VISUAL.1996.568121;10.1109/VISUAL.1991.175780;10.1109/VISUAL.1995.480806," Isosurface, Compression, Transform Coding, Quantization",20,3,15,
InfoVis,2004,RankSpiral: Toward Enhancing Search Results Visualizations,10.1109/INFVIS.2004.56,http://dx.doi.org/10.1109/INFVIS.2004.56,18,18,M,This paper addresses the problem of how to enable users to visually explore and compare large sets of documents that have been retrieved by different search engines or queries. The Rank-Spiral enables users to rapidly scan large numbers of documents and their titles in a single screen. It uses a spiral mapping that maximizes information density and minimizes occlusions. It solves the labeling problem by exploiting the structure of the special spiral mapping used. Focus+Context interactions enable users to examine document clusters or groupings in more detail.,Anselm Spoerri,A. Spoerri,Rutgers University,,,20,13,12,
InfoVis,2004,Understanding Eight Years of InfoVis Conferences Using PaperLens,10.1109/INFVIS.2004.69,http://dx.doi.org/10.1109/INFVIS.2004.69,r3,r3,M,"We present PaperLens, a visualization that reveals connections, trends, and activity throughout the InfoVis conference community for the last 8 years. It tightly couples views across papers, authors, and references. This paper describes how we analyzed the data, the strengths and weaknesses of PaperLens, and interesting patterns and relationships we have discovered using PaperLens.",Bongshin Lee;Mary Czerwinski;George G. Robertson;Benjamin B. Bederson,Bongshin Lee;M. Czerwinski;G. Robertson;B.B. Bederson,University of Maryland and Microsoft Research,,,20,2,3,
Vis,2004,On the role of color in the perception of motion in animated visualizations,10.1109/VISUAL.2004.73,http://dx.doi.org/10.1109/VISUAL.2004.73,305,312,C,"Although luminance contrast plays a predominant role in motion perception, significant additional effects are introduced by chromatic contrasts. In this paper, relevant results from psychophysical and physiological research are described to clarify the role of color in motion detection. Interpreting these psychophysical experiments, we propose guidelines for the design of animated visualizations, and a calibration procedure that improves the reliability of visual motion representation. The guidelines are applied to examples from texture-based flow visualization, as well as graph and tree visualisation.",Daniel Weiskopf,D. Weiskopf,"Inst. of Visualization & Interactive Syst., Stuttgart Univ., Germany",10.1109/VISUAL.2002.1183788;10.1109/VISUAL.2003.1250362;10.1109/VISUAL.2003.1250361;10.1109/VISUAL.1997.663874,"Color, luminance, motion detection, perception, human visual system, flow visualization, information visualization",20,7,91,
VAST,2006,Interactive Visualization and Analysis of Network and Sensor Data on Mobile Devices,10.1109/VAST.2006.261434,http://dx.doi.org/10.1109/VAST.2006.261434,83,90,C,"Mobile devices are rapidly gaining popularity due to their small size and their wide range of functionality. With the constant improvement in wireless network access, they are an attractive option not only for day to day use. but also for in-field analytics by first responders in widespread areas. However, their limited processing, display, graphics and power resources pose a major challenge in developing effective applications. Nevertheless, they are vital for rapid decision making in emergencies when combined with appropriate analysis tools. In this paper, we present an efficient, interactive visual analytic system using a PDA to visualize network information from Purdue's Ross-Ade Stadium during football games as an example of in-held data analytics combined with text and video analysis. With our system, we can monitor the distribution of attendees with mobile devices throughout the stadium through their access of information and association/disassociation from wireless access points, enabling the detection of crowd movement and event activity. Through correlative visualization and analysis of synchronized video (instant replay video) and text information (play statistics) with the network activity, we can provide insightful information to network monitoring personnel, safety personnel and analysts. This work provides a demonstration and testbed for mobile sensor analytics that will help to improve network performance and provide safety personnel with information for better emergency planning and guidance",Avin Pattath;Brian D. Bue;Yun Jang;David S. Ebert;Xuan Zhong;Aaron Ault;Edward J. Coyle,Avin Pattath;Brian Bue;Yun Jang;David Ebert;Xuan Zhong;Aaron Ault;Edward Coyle,"Purdue University Regional Visualization and Analytics Center (PURVAC), Purdue University, West Lafayette, IN. e-mail: apattath@purdue.edu;Purdue University Regional Visualization and Analytics Center (PURVAC), Purdue University, West Lafayette, IN. e-mail: bbue@purdue.edu;Purdue University Regional Visualization and Analytics Center (PURVAC), Purdue University, West Lafayette, IN. e-mail: jangy@purdue.edu;Purdue University Regional Visualization and Analytics Center (PURVAC), Purdue University, West Lafayette, IN. e-mail: ebertd@purdue.edu;Center for Wireless Systems and Applications (CWSA), Purdue University, West Lafayette, IN. e-mail: zhongx@purdue.edu;Center for Wireless Systems and Applications (CWSA), Purdue University, West Lafayette, IN. e-mail: aultac@purdue.edu;Center for Wireless Systems and Applications (CWSA), Purdue University, West Lafayette, IN. e-mail: coyle@purdue.edu",10.1109/INFVIS.2004.27;10.1109/VISUAL.2001.964496;10.1109/INFVIS.2005.1532135;10.1109/INFVIS.2005.1532131;10.1109/INFVIS.2000.885097,"mobile visualization, network visualization, visual analytics",20,11,26,
Vis,2006,Out-of-Core Remeshing of Large Polygonal Meshes,10.1109/TVCG.2006.169,http://dx.doi.org/10.1109/TVCG.2006.169,1221,1228,J,"We propose an out-of-core method for creating semi-regular surface representations from large input surface meshes. Our approach is based on a streaming implementation of the MAPS remesher of Lee et al. Our remeshing procedure consists of two stages. First, a simplification process is used to obtain the base domain. During simplification, we maintain the mapping information between the input and the simplified meshes. The second stage of remeshing uses the mapping information to produce samples of the output semi-regular mesh. The out-of-core operation of our method is enabled by the synchronous streaming of a simplified mesh and the mapping information stored at the original vertices. The synchronicity of two streaming buffers is maintained using a specially designed write strategy for each buffer. Experimental results demonstrate the remeshing performance of the proposed method, as well as other applications that use the created mapping between the simplified and the original surface representations",Minsu Ahn;Igor Guskov;Seungyong Lee 0001,Minsu Ahn;Igor Guskov;Seungyong Lee,Pohang University of Science and Technology (POSTECH);University of Michigan;Pohang University of Science and Technology (POSTECH),10.1109/VISUAL.2001.964503;10.1109/VISUAL.2003.1250408;10.1109/VISUAL.2005.1532800;10.1109/VISUAL.1998.745282;10.1109/VISUAL.2001.964532,"Out-of-core algorithm, semi-regular remeshing, shape compression",20,13,28,
Vis,2006,Visualization Tools for Vorticity Transport Analysis in Incompressible Flow,10.1109/TVCG.2006.199,http://dx.doi.org/10.1109/TVCG.2006.199,949,956,J,Vortices are undesirable in many applications while indispensable in others. It is therefore of common interest to understand their mechanisms of creation. This paper aims at analyzing the transport of vorticity inside incompressible flow. The analysis is based on the vorticity equation and is performed along pathlines which are typically started in upstream direction from vortex regions. Different methods for the quantitative and explorative analysis of vorticity transport are presented and applied to CFD simulations of water turbines. Simulation quality is accounted for by including the errors of meshing and convergence into analysis and visualization. The obtained results are discussed and interpretations with respect to engineering questions are given,Filip Sadlo;Ronald Peikert;Mirjam Sick,Filip Sadlo;Ronald Peikert;Mirjam Sick,"Computer Graphics Laboratory, Computer Science Department, ETH Zurich, Switzerland;Computer Graphics Laboratory, Computer Science Department, ETH Zurich, Switzerland;VA Tech Hydro, Zurich, Switzerland",10.1109/VISUAL.1996.567807;10.1109/VISUAL.1999.809896;10.1109/VISUAL.2004.128,"Flow visualization, vorticity transport, unsteady flow, linked views",20,16,15,
VAST,2007,FemaRepViz: Automatic Extraction and Geo-Temporal Visualization of FEMA National Situation Updates,10.1109/VAST.2007.4388991,http://dx.doi.org/10.1109/VAST.2007.4388991,11,18,C,"An architecture for visualizing information extracted from text documents is proposed. In conformance with this architecture, a toolkit, FemaRepViz, has been implemented to extract and visualize temporal, geospatial, and summarized information from FEMA national update reports. Preliminary tests have shown satisfactory accuracy for FEMARepViz. A central component of the architecture is an entity extractor that extracts named entities like person names, location names, temporal references, etc. FEMARepViz is based on FactXtractor, an entity-extractor that works on text documents. The information extracted using FactXtractor is processed using GeoTagger, a geographical name disambiguation tool based on a novel clustering-based disambiguation algorithm. To extract relationships among entities, we propose a machine-learning based algorithm that uses a novel stripped dependency tree kernel. We illustrate and evaluate the usefulness of our system on the FEMA National Situation Updates. Daily reports are fetched by FEMARepViz from the FEMA website, segmented into coherent sections and each section is classified into one of several known incident types. We use concept Vista, Google maps and Google earth to visualize the events extracted from the text reports and allow the user to interactively filter the topics, locations, and time-periods of interest to create a visual analytics toolkit that is useful for rapid analysis of events reported in a large set of text documents.",Chi-Chun Pan;Prasenjit Mitra,Chi-Chun Pan;Prasenjit Mitra,The Pennsylvania State University. e-mail: julianpan@psu.edu;The Pennsylvania State University. e-mail: pmitra@ist.psu.edu,,"visual analytics, geo-temporal visualization, text processing, knowledge discovery, geospatial analytics",20,9,0,
VAST,2007,Thin Client Visualization,10.1109/VAST.2007.4388996,http://dx.doi.org/10.1109/VAST.2007.4388996,51,58,C,"We have developed a Web 2.0 thin client visualization framework called GeoBoosttrade. Our framework focuses on geospatial visualization and using scalable vector graphics (SVG), AJAX, RSS and GeoRSS we have built a complete thin client component set. Our component set provides a rich user experience that is completely browser based. It includes maps, standard business charts, graphs, and time-oriented components. The components are live, interactive, linked, and support real time collaboration.",Stephen G. Eick;M. Andrew Eick;Jesse Fugitt;Brian Horst;Maxim Khailo;Russell A. Lankenau,Stephen G. Eick;M. Andrew Eick;Jesse Fugitt;Brian Horst;Maxim Khailo;Russell A. Lankenau,"SSS Research, Inc, 600 S. Washington, Suite 100, Naperville, IL 60540. eick@sss-research.com;SSS Research, Inc, 600 S. Washington, Suite 100, Naperville, IL 60540;SSS Research, Inc, 600 S. Washington, Suite 100, Naperville, IL 60540;SSS Research, Inc, 600 S. Washington, Suite 100, Naperville, IL 60540;SSS Research, Inc, 600 S. Washington, Suite 100, Naperville, IL 60540;SSS Research, Inc, 600 S. Washington, Suite 100, Naperville, IL 60540",,"web 20, JavaScript, scalable vector graphics, visualization components, linked view visual analytics",20,14,9,
Vis,2007,Efficient Surface Reconstruction using Generalized Coulomb Potentials,10.1109/TVCG.2007.70553,http://dx.doi.org/10.1109/TVCG.2007.70553,1512,1519,J,"We propose a novel, geometrically adaptive method for surface reconstruction from noisy and sparse point clouds, without orientation information. The method employs a fast convection algorithm to attract the evolving surface towards the data points. The force field in which the surface is convected is based on generalized Coulomb potentials evaluated on an adaptive grid (i.e., an octree) using a fast, hierarchical algorithm. Formulating reconstruction as a convection problem in a velocity field generated by Coulomb potentials offers a number of advantages. Unlike methods which compute the distance from the data set to the implicit surface, which are sensitive to noise due to the very reliance on the distance transform, our method is highly resilient to shot noise since global, generalized Coulomb potentials can be used to disregard the presence of outliers due to noise. Coulomb potentials represent long-range interactions that consider all data points at once, and thus they convey global information which is crucial in the fitting process. Both the spatial and temporal complexities of our spatially-adaptive method are proportional to the size of the reconstructed object, which makes our method compare favorably with respect to previous approaches in terms of speed and flexibility. Experiments with sparse as well as noisy data sets show that the method is capable of delivering crisp and detailed yet smooth surfaces.",Andrei C. Jalba;Jos B. T. M. Roerdink,Andrei C. Jalba;Jos B.T.M. Roerdink,"Institute for Mathematics and Computing Science, University of Groningen, The Netherlands;Institute for Mathematics and Computing Science, University of Groningen, The Netherlands",,"Surface reconstruction, Implicit surfaces, Octrees, Generalized Coulomb potentials, Polygonization",20,13,31,
Vis,2009,GL4D: A GPU-based Architecture for Interactive 4D Visualization,10.1109/TVCG.2009.147,http://dx.doi.org/10.1109/TVCG.2009.147,1587,1594,J,"This paper describes GL4D, an interactive system for visualizing 2-manifolds and 3-manifolds embedded in four Euclidean dimensions and illuminated by 4D light sources. It is a tetrahedron-based rendering pipeline that projects geometry into volume images, an exact parallel to the conventional triangle-based rendering pipeline for 3D graphics. Novel features include GPU-based algorithms for real-time 4D occlusion handling and transparency compositing; we thus enable a previously impossible level of quality and interactivity for exploring lit 4D objects. The 4D tetrahedrons are stored in GPU memory as vertex buffer objects, and the vertex shader is used to perform per-vertex 4D modelview transformations and 4D-to-3D projection. The geometry shader extension is utilized to slice the projected tetrahedrons and rasterize the slices into individual 2D layers of voxel fragments. Finally, the fragment shader performs per-voxel operations such as lighting and alpha blending with previously computed layers. We account for 4D voxel occlusion along the 4D-to-3D projection ray by supporting a multi-pass back-to-front fragment composition along the projection ray; to accomplish this, we exploit a new adaptation of the dual depth peeling technique to produce correct volume image data and to simultaneously render the resulting volume data using 3D transfer functions into the final 2D image. Previous CPU implementations of the rendering of 4D-embedded 3-manifolds could not perform either the 4D depth-buffered projection or manipulation of the volume-rendered image in real-time; in particular, the dual depth peeling algorithm is a novel GPU-based solution to the real-time 4D depth-buffering problem. GL4D is implemented as an integrated OpenGL-style API library, so that the underlying shader operations are as transparent as possible to the user.",Alan Chu;Chi-Wing Fu;Andrew J. Hanson;Pheng-Ann Heng,Alan Chu;Chi-Wing Fu;Andrew Hanson;Pheng-Ann Heng,"Chinese University of Hong Kong;Nanyang Technological University, Singapore;Indiana University, Bloomington;Chinese University of Hong Kong",10.1109/VISUAL.1994.346318;10.1109/VISUAL.2000.885704;10.1109/VISUAL.1992.235222;10.1109/VISUAL.2005.1532804;10.1109/TVCG.2007.70593;10.1109/VISUAL.1994.346324;10.1109/VISUAL.1993.398869,"Mathematical visualization, four-dimensional visualization, graphics hardware, interactive illumination",20,12,37,
InfoVis,2010,PedVis: A Structured; Space-Efficient Technique for Pedigree Visualization,10.1109/TVCG.2010.185,http://dx.doi.org/10.1109/TVCG.2010.185,1063,1072,J,"Public genealogical databases are becoming increasingly populated with historical data and records of the current population's ancestors. As this increasing amount of available information is used to link individuals to their ancestors, the resulting trees become deeper and more dense, which justifies the need for using organized, space-efficient layouts to display the data. Existing layouts are often only able to show a small subset of the data at a time. As a result, it is easy to become lost when navigating through the data or to lose sight of the overall tree structure. On the contrary, leaving space for unknown ancestors allows one to better understand the tree's structure, but leaving this space becomes expensive and allows fewer generations to be displayed at a time. In this work, we propose that the H-tree based layout be used in genealogical software to display ancestral trees. We will show that this layout presents an increase in the number of displayable generations, provides a nicely arranged, symmetrical, intuitive and organized fractal structure, increases the user's ability to understand and navigate through the data, and accounts for the visualization requirements necessary for displaying such trees. Finally, user-study results indicate potential for user acceptance of the new layout.",Claurissa Tuttle;Luis Gustavo Nonato;Cláudio T. Silva,Claurissa Tuttle;Luis Gustavo Nonato;Claudio Silva,"University of Utah;Universidade do Sao Paulo, Brazil;University of Utah",10.1109/TVCG.2008.158;10.1109/TVCG.2008.141;10.1109/INFVIS.2005.1532124;10.1109/INFVIS.2003.1249004;10.1109/VISUAL.1991.175815;10.1109/INFVIS.2002.1173152;10.1109/INFVIS.2002.1173148;10.1109/INFVIS.1997.636718,"Genealogy, Pedigree, H-tree",20,16,35,
Vis,2011,Nodes on Ropes: A Comprehensive Data and Control Flow for Steering Ensemble Simulations,10.1109/TVCG.2011.225,http://dx.doi.org/10.1109/TVCG.2011.225,1872,1881,J,"Flood disasters are the most common natural risk and tremendous efforts are spent to improve their simulation and management. However, simulation-based investigation of actions that can be taken in case of flood emergencies is rarely done. This is in part due to the lack of a comprehensive framework which integrates and facilitates these efforts. In this paper, we tackle several problems which are related to steering a flood simulation. One issue is related to uncertainty. We need to account for uncertain knowledge about the environment, such as levee-breach locations. Furthermore, the steering process has to reveal how these uncertainties in the boundary conditions affect the confidence in the simulation outcome. Another important problem is that the simulation setup is often hidden in a black-box. We expose system internals and show that simulation steering can be comprehensible at the same time. This is important because the domain expert needs to be able to modify the simulation setup in order to include local knowledge and experience. In the proposed solution, users steer parameter studies through the World Lines interface to account for input uncertainties. The transport of steering information to the underlying data-flow components is handled by a novel meta-flow. The meta-flow is an extension to a standard data-flow network, comprising additional nodes and ropes to abstract parameter control. The meta-flow has a visual representation to inform the user about which control operations happen. Finally, we present the idea to use the data-flow diagram itself for visualizing steering information and simulation results. We discuss a case-study in collaboration with a domain expert who proposes different actions to protect a virtual city from imminent flooding. The key to choosing the best response strategy is the ability to compare different regions of the parameter space while retaining an understanding of what is happening inside the data-flow system.",Jürgen Waser;Hrvoje Ribicic;Raphael Fuchs;Christian Hirsch;Benjamin Schindler;Günter Blöschl;M. Eduard Gröller,Jurgen Waser;Hrvoje Ribicic;Raphael Fuchs;Christian Hirsch;Benjamin Schindler;Gunther Bloschl;Eduard Groller,VRVis Vienna;VRVis Vienna;ETH Z&#x0FC;rich;VRVis Vienna;ETH Z&#x0FC;rich;TU Vienna;TU Vienna,10.1109/TVCG.2010.223;10.1109/TVCG.2007.70584;10.1109/INFVIS.2002.1173149;10.1109/TVCG.2010.214;10.1109/INFVIS.2004.12;10.1109/VISUAL.2005.1532795;10.1109/TVCG.2009.195;10.1109/INFVIS.2005.1532143;10.1109/TVCG.2010.190;10.1109/TVCG.2010.223,"Emergency/Disaster Management, Visual Knowledge Discovery, Visualization System and Toolkit Design, Data-Flow, Meta-Flow, Parameter Study, Uncertainty, Visualization of Control",20,20,48,
Vis,2011,Towards Robust Topology of Sparsely Sampled Data,10.1109/TVCG.2011.245,http://dx.doi.org/10.1109/TVCG.2011.245,1852,1861,J,"Sparse, irregular sampling is becoming a necessity for reconstructing large and high-dimensional signals. However, the analysis of this type of data remains a challenge. One issue is the robust selection of neighborhoods - a crucial part of analytic tools such as topological decomposition, clustering and gradient estimation. When extracting the topology of sparsely sampled data, common neighborhood strategies such as k-nearest neighbors may lead to inaccurate results, either due to missing neighborhood connections, which introduce false extrema, or due to spurious connections, which conceal true extrema. Other neighborhoods, such as the Delaunay triangulation, are costly to compute and store even in relatively low dimensions. In this paper, we address these issues. We present two new types of neighborhood graphs: a variation on and a generalization of empty region graphs, which considerably improve the robustness of neighborhood-based analysis tools, such as topological decomposition. Our findings suggest that these neighborhood graphs lead to more accurate topological representations of low- and high- dimensional data sets at relatively low cost, both in terms of storage and computation time. We describe the implications of our work in the analysis and visualization of scalar functions, and provide general strategies for computing and applying our neighborhood graphs towards robust data analysis.",Carlos D. Correa;Peter Lindstrom,Carlos Correa;Peter Lindstrom,Lawrence Livermore National Lab;Lawrence Livermore National Lab,10.1109/VISUAL.2005.1532839;10.1109/TVCG.2010.213;10.1109/TVCG.2011.244;10.1109/VAST.2010.5652940;10.1109/VISUAL.1999.809932,"Neighborhood graphs, topology, sparsely sampled data",20,15,54,BP
SciVis,2012,A Novel Approach to Visualizing Dark Matter Simulations,10.1109/TVCG.2012.187,http://dx.doi.org/10.1109/TVCG.2012.187,2078,2087,J,"In the last decades cosmological N-body dark matter simulations have enabled ab initio studies of the formation of structure in the Universe. Gravity amplified small density fluctuations generated shortly after the Big Bang, leading to the formation of galaxies in the cosmic web. These calculations have led to a growing demand for methods to analyze time-dependent particle based simulations. Rendering methods for such N-body simulation data usually employ some kind of splatting approach via point based rendering primitives and approximate the spatial distributions of physical quantities using kernel interpolation techniques, common in SPH (Smoothed Particle Hydrodynamics)-codes. This paper proposes three GPU-assisted rendering approaches, based on a new, more accurate method to compute the physical densities of dark matter simulation data. It uses full phase-space information to generate a tetrahedral tessellation of the computational domain, with mesh vertices defined by the simulation's dark matter particle positions. Over time the mesh is deformed by gravitational forces, causing the tetrahedral cells to warp and overlap. The new methods are well suited to visualize the cosmic web. In particular they preserve caustics, regions of high density that emerge, when several streams of dark matter particles share the same location in space, indicating the formation of structures like sheets, filaments and halos. We demonstrate the superior image quality of the new approaches in a comparison with three standard rendering techniques for N-body simulation data.",Ralf Kähler;Oliver Hahn;Tom Abel,Ralf Kaehler;Oliver Hahn;Tom Abel,KIPAC;KIPAC;KIPAC,10.1109/TVCG.2010.148;10.1109/VISUAL.2003.1250390;10.1109/VISUAL.2004.85;10.1109/TVCG.2006.154;10.1109/VISUAL.2003.1250404;10.1109/TVCG.2011.216;10.1109/TVCG.2009.142;10.1109/VISUAL.2001.964512;10.1109/VISUAL.2003.1250404,"Astrophysics, dark matter, n-body simulations, tetrahedral grids",20,17,35,
SciVis,2012,ElVis: A System for the Accurate and Interactive Visualization of High-Order finite Element Solutions,10.1109/TVCG.2012.218,http://dx.doi.org/10.1109/TVCG.2012.218,2325,2334,J,"This paper presents the Element Visualizer (ElVis), a new, open-source scientific visualization system for use with high-order finite element solutions to PDEs in three dimensions. This system is designed to minimize visualization errors of these types of fields by querying the underlying finite element basis functions (e.g., high-order polynomials) directly, leading to pixel-exact representations of solutions and geometry. The system interacts with simulation data through runtime plugins, which only require users to implement a handful of operations fundamental to finite element solvers. The data in turn can be visualized through the use of cut surfaces, contours, isosurfaces, and volume rendering. These visualization algorithms are implemented using NVIDIA's OptiX GPU-based ray-tracing engine, which provides accelerated ray traversal of the high-order geometry, and CUDA, which allows for effective parallel evaluation of the visualization algorithms. The direct interface between ElVis and the underlying data differentiates it from existing visualization tools. Current tools assume the underlying data is composed of linear primitives; high-order data must be interpolated with linear functions as a result. In this work, examples drawn from aerodynamic simulations-high-order discontinuous Galerkin finite element solutions of aerodynamic flows in particular-will demonstrate the superiority of ElVis' pixel-exact approach when compared with traditional linear-interpolation methods. Such methods can introduce a number of inaccuracies in the resulting visualization, making it unclear if visual artifacts are genuine to the solution data or if these artifacts are the result of interpolation errors. Linear methods additionally cannot properly visualize curved geometries (elements or boundaries) which can greatly inhibit developers' debugging efforts. As we will show, pixel-exact visualization exhibits none of these issues, removing the visualization scheme as a source of uncertainty for engineers using ElVis.",Blake Nelson;Eric Liu;Robert Michael Kirby;Robert Haimes,Blake Nelson;Eric Liu;Robert M. Kirby;Robert Haimes,University of Utah;MIT;University of Utah;MIT,10.1109/VISUAL.2005.1532776;10.1109/VISUAL.1991.175837;10.1109/VISUAL.2004.91;10.1109/TVCG.2006.154;10.1109/TVCG.2011.206,"High-order finite elements, spectral/hp elements, discontinuous Galerkin, fluid flow simulation, cut surface extraction, contours, isosurfaces",20,20,37,
SciVis,2012,Historygrams: Enabling Interactive Global Illumination in Direct Volume Rendering using Photon Mapping,10.1109/TVCG.2012.232,http://dx.doi.org/10.1109/TVCG.2012.232,2364,2371,J,"In this paper, we enable interactive volumetric global illumination by extending photon mapping techniques to handle interactive transfer function (TF) and material editing in the context of volume rendering. We propose novel algorithms and data structures for finding and evaluating parts of a scene affected by these parameter changes, and thus support efficient updates of the photon map. In direct volume rendering (DVR) the ability to explore volume data using parameter changes, such as editable TFs, is of key importance. Advanced global illumination techniques are in most cases computationally too expensive, as they prevent the desired interactivity. Our technique decreases the amount of computation caused by parameter changes, by introducing Historygrams which allow us to efficiently reuse previously computed photon media interactions. Along the viewing rays, we utilize properties of the light transport equations to subdivide a view-ray into segments and independently update them when invalid. Unlike segments of a view-ray, photon scattering events within the volumetric medium needs to be sequentially updated. Using our Historygram approach, we can identify the first invalid photon interaction caused by a property change, and thus reuse all valid photon interactions. Combining these two novel concepts, supports interactive editing of parameters when using volumetric photon mapping in the context of DVR. As a consequence, we can handle arbitrarily shaped and positioned light sources, arbitrary phase functions, bidirectional reflectance distribution functions and multiple scattering which has previously not been possible in interactive DVR.",Daniel Jönsson;Joel Kronander;Timo Ropinski;Anders Ynnerman,Daniel Jönsson;Joel Kronander;Timo Ropinski;Anders Ynnerman,"C-Research, Linköping University;C-Research, Linköping University;C-Research, Linköping University;C-Research, Linköping University",10.1109/TVCG.2011.211,"Volume rendering, photon mapping, global illumination, participating media",20,20,34,
VAST,2014,Cupid: Cluster-Based Exploration of Geometry Generators with Parallel Coordinates and Radial Trees,10.1109/TVCG.2014.2346626,http://dx.doi.org/10.1109/TVCG.2014.2346626,1693,1702,J,"Geometry generators are commonly used in video games and evaluation systems for computer vision to create geometric shapes such as terrains, vegetation or airplanes. The parameters of the generator are often sampled automatically which can lead to many similar or unwanted geometric shapes. In this paper, we propose a novel visual exploration approach that combines the abstract parameter space of the geometry generator with the resulting 3D shapes in a composite visualization. Similar geometric shapes are first grouped using hierarchical clustering and then nested within an illustrative parallel coordinates visualization. This helps the user to study the sensitivity of the generator with respect to its parameter space and to identify invalid parameter settings. Starting from a compact overview representation, the user can iteratively drill-down into local shape differences by clicking on the respective clusters. Additionally, a linked radial tree gives an overview of the cluster hierarchy and enables the user to manually split or merge clusters. We evaluate our approach by exploring the parameter space of a cup generator and provide feedback from domain experts.",Michael Beham;Wolfgang Herzner;M. Eduard Gröller;Johannes Kehrer,Michael Beham;Wolfgang Herzner;M. Eduard Gröller;Johannes Kehrer,Vienna University of Technology;Austrian Institute of Technology;Vienna University of Technology;Vienna University of Technology,10.1109/TVCG.2013.147;10.1109/TVCG.2013.213;10.1109/TVCG.2010.138;10.1109/TVCG.2009.155;10.1109/VISUAL.2005.1532856;10.1109/TVCG.2010.190;10.1109/TVCG.2006.147;10.1109/VISUAL.1993.398859;10.1109/VISUAL.1999.809866;10.1109/TVCG.2007.70581,"Composite visualization, hierarchical clustering, illustrative parallel coordinates, radial trees, 3D shape analysis",20,18,43,
VAST,2014,A Visual Reasoning Approach for Data-driven Transport Assessment on Urban Roads,10.1109/VAST.2014.7042486,http://dx.doi.org/10.1109/VAST.2014.7042486,103,112,C,"Transport assessment plays a vital role in urban planning and traffic control, which are influenced by multi-faceted traffic factors involving road infrastructure and traffic flow. Conventional solutions can hardly meet the requirements and expectations of domain experts. In this paper we present a data-driven solution by leveraging a visual analysis system to evaluate the real traffic situations based on taxi trajectory data. A sketch-based visual interface is designed to support dynamic query and visual reasoning of traffic situations within multiple coordinated views. In particular, we propose a novel road-based query model for analysts to interactively conduct evaluation tasks. This model is supported by a bi-directional hash structure, TripHash, which enables real-time responses to the data queries over a huge amount of trajectory data. Case studies with a real taxi GPS trajectory dataset (&amp;gt; 30GB) show that our system performs well for on-demand transport assessment and reasoning.",Fei Wang 0016;Wei Chen 0001;Feiran Wu;Ye Zhao;Han Hong;Tianyu Gu;Long Wang;Ronghua Liang;Hujun Bao,Fei Wang;Wei Chen;Feiran Wu;Ye Zhao;Han Hong;Tianyu Gu;Long Wang;Ronghua Liang;Hujun Bao,"State Key Lab of CAD&amp;CG, Zhejiang University;State Key Lab of CAD&amp;CG, Zhejiang University;State Key Lab of CAD&amp;CG, Zhejiang University;Kent State University;State Key Lab of CAD&amp;CG, Zhejiang University;State Key Lab of CAD&amp;CG, Zhejiang University;State Key Lab of CAD&amp;CG, Zhejiang University;Zhejiang University of Technology;State Key Lab of CAD&amp;CG, Zhejiang University",10.1109/VAST.2011.6102458;10.1109/TVCG.2013.226;10.1109/TVCG.2013.228;10.1109/TVCG.2013.179;10.1109/VAST.2011.6102455;10.1109/TVCG.2013.133,"Road-based Query, Taxi Trajectory, Hash Index, Visual Analysis",20,23,48,
VAST,2014,Using Visualizations to Monitor Changes and Harvest Insights from a Global-Scale Logging Infrastructure at Twitter,10.1109/VAST.2014.7042487,http://dx.doi.org/10.1109/VAST.2014.7042487,113,122,C,"Logging user activities is essential to data analysis for internet products and services. Twitter has built a unified logging infrastructure that captures user activities across all clients it owns, making it one of the largest datasets in the organization. This paper describes challenges and opportunities in applying information visualization to log analysis at this massive scale, and shows how various visualization techniques can be adapted to help data scientists extract insights. In particular, we focus on two scenarios: (1) monitoring and exploring a large collection of log events, and (2) performing visual funnel analysis on log data with tens of thousands of event types. Two interactive visualizations were developed for these purposes: we discuss design choices and the implementation of these systems, along with case studies of how they are being used in day-to-day operations at Twitter.",Krist Wongsuphasawat;Jimmy Lin,Krist Wongsuphasawat;Jimmy Lin,"Twitter, Inc.;Twitter, Inc.",10.1109/INFVIS.2000.885091;10.1109/TVCG.2009.117;10.1109/INFVIS.1997.636718;10.1109/VAST.2007.4389008;10.1109/INFVIS.1996.559227;10.1109/TVCG.2012.225;10.1109/TVCG.2007.70529;10.1109/VAST.2012.6400494;10.1109/TVCG.2013.231;10.1109/INFVIS.2004.64;10.1109/VISUAL.1991.175815;10.1109/TVCG.2013.200;10.1109/VAST.2006.261421;10.1109/TVCG.2011.185,"Information Visualization, Visual Analytics, Log Analysis, Log Visualization, Session Analysis, Funnel Analysis",20,13,45,
InfoVis,2015,Optimal Sets of Projections of High-Dimensional Data,10.1109/TVCG.2015.2467132,http://dx.doi.org/10.1109/TVCG.2015.2467132,609,618,J,"Finding good projections of n-dimensional datasets into a 2D visualization domain is one of the most important problems in Information Visualization. Users are interested in getting maximal insight into the data by exploring a minimal number of projections. However, if the number is too small or improper projections are used, then important data patterns might be overlooked. We propose a data-driven approach to find minimal sets of projections that uniquely show certain data patterns. For this we introduce a dissimilarity measure of data projections that discards affine transformations of projections and prevents repetitions of the same data patterns. Based on this, we provide complete data tours of at most n/2 projections. Furthermore, we propose optimal paths of projection matrices for an interactive data exploration. We illustrate our technique with a set of state-of-the-art real high-dimensional benchmark datasets.",Dirk J. Lehmann;Holger Theisel,Dirk J. Lehmann;Holger Theisel,University of Magdeburg;University of Magdeburg,10.1109/VAST.2010.5652433;10.1109/VAST.2011.6102437;10.1109/TVCG.2011.229;10.1109/VISUAL.1997.663916;10.1109/TVCG.2011.220;10.1109/TVCG.2013.182;10.1109/TVCG.2010.207;10.1109/VAST.2006.261423;10.1109/INFVIS.2005.1532142,"Multivariate Projections, Star Coordinates, Radial Visualization, High-dimensional Data",20,25,29,
SciVis,2015,Glyph-Based Comparative Visualization for Diffusion Tensor Fields,10.1109/TVCG.2015.2467435,http://dx.doi.org/10.1109/TVCG.2015.2467435,797,806,J,"Diffusion Tensor Imaging (DTI) is a magnetic resonance imaging modality that enables the in-vivo reconstruction and visualization of fibrous structures. To inspect the local and individual diffusion tensors, glyph-based visualizations are commonly used since they are able to effectively convey full aspects of the diffusion tensor. For several applications it is necessary to compare tensor fields, e.g., to study the effects of acquisition parameters, or to investigate the influence of pathologies on white matter structures. This comparison is commonly done by extracting scalar information out of the tensor fields and then comparing these scalar fields, which leads to a loss of information. If the glyph representation is kept, simple juxtaposition or superposition can be used. However, neither facilitates the identification and interpretation of the differences between the tensor fields. Inspired by the checkerboard style visualization and the superquadric tensor glyph, we design a new glyph to locally visualize differences between two diffusion tensors by combining juxtaposition and explicit encoding. Because tensor scale, anisotropy type, and orientation are related to anatomical information relevant for DTI applications, we focus on visualizing tensor differences in these three aspects. As demonstrated in a user study, our new glyph design allows users to efficiently and effectively identify the tensor differences. We also apply our new glyphs to investigate the differences between DTI datasets of the human brain in two different contexts using different b-values, and to compare datasets from a healthy and HIV-infected subject.",Changgong Zhang;Thomas Schultz 0001;Kai Lawonn;Elmar Eisemann;Anna Vilanova,Changgong Zhang;Thomas Schultz;Kai Lawonn;Elmar Eisemann;Anna Vilanova,Computer Graphics and Visualization Group at Delft University of Technology;Visualization and Medical Image Analysis Group at University of Bonn;Visualization Group at University of Magdeburg;Computer Graphics and Visualization Group at Delft University of Technology;Computer Graphics and Visualization Group at Delft University of Technology,10.1109/TVCG.2015.2467031;10.1109/TVCG.2006.134;10.1109/TVCG.2010.134;10.1109/VISUAL.1998.745294;10.1109/VAST.2014.7042491;10.1109/TVCG.2010.199,"Glyph Design, Comparative Visualization, Diffusion Tensor Field",20,22,43,
VAST,2015,Comparative visual analysis of vector field ensembles,10.1109/VAST.2015.7347634,http://dx.doi.org/10.1109/VAST.2015.7347634,81,88,C,"We present a new visual analysis approach to support the comparative exploration of 2D vector-valued ensemble fields. Our approach enables the user to quickly identify the most similar groups of ensemble members, as well as the locations where the variation among the members is high. We further provide means to visualize the main features of the potentially multimodal directional distributions at user-selected locations. For this purpose, directional data is modelled using mixtures of probability density functions (pdfs), which allows us to characterize and classify complex distributions with relatively few parameters. The resulting mixture models are used to determine the degree of similarity between ensemble members, and to construct glyphs showing the direction, spread, and strength of the principal modes of the directional distributions. We also propose several similarity measures, based on which we compute pairwise member similarities in the spatial domain and form clusters of similar members. The hierarchical clustering is shown using dendrograms and similarity matrices, which can be used to select particular members and visualize their variations. A user interface providing multiple linked views enables the simultaneous visualization of aggregated global and detailed local variations, as well as the selection of members for a detailed comparison.",Mihaela Jarema;Ismail Demir;Johannes Kehrer;Rüdiger Westermann,Mihaela Jarema;Ismail Demir;Johannes Kehrer;Rüdiger Westermann,"Technische Universität München, Germany;Technische Universität München, Germany;Technische Universität München, Germany;Technische Universität München, Germany",10.1109/TVCG.2014.2346626;10.1109/TVCG.2010.190;10.1109/VAST.2009.5332611;10.1109/TVCG.2006.160;10.1109/TVCG.2013.141;10.1109/TVCG.2013.177;10.1109/TVCG.2010.199;10.1109/TVCG.2014.2346321,"Uncertainty Visualization, Vector Field Data, Coordinated and Multiple Views, Glyph-based Techniques",20,16,43,
InfoVis,2016,WeightLifter: Visual Weight Space Exploration for Multi-Criteria Decision Making,10.1109/TVCG.2016.2598589,http://dx.doi.org/10.1109/TVCG.2016.2598589,611,620,J,"A common strategy in Multi-Criteria Decision Making (MCDM) is to rank alternative solutions by weighted summary scores. Weights, however, are often abstract to the decision maker and can only be set by vague intuition. While previous work supports a point-wise exploration of weight spaces, we argue that MCDM can benefit from a regional and global visual analysis of weight spaces. Our main contribution is WeightLifter, a novel interactive visualization technique for weight-based MCDM that facilitates the exploration of weight spaces with up to ten criteria. Our technique enables users to better understand the sensitivity of a decision to changes of weights, to efficiently localize weight regions where a given solution ranks high, and to filter out solutions which do not rank high enough for any plausible combination of weights. We provide a comprehensive requirement analysis for weight-based MCDM and describe an interactive workflow that meets these requirements. For evaluation, we describe a usage scenario of WeightLifter in automotive engineering and report qualitative feedback from users of a deployed version as well as preliminary feedback from decision makers in multiple domains. This feedback confirms that WeightLifter increases both the efficiency of weight-based MCDM and the awareness of uncertainty in the ultimate decisions.",Stephan Pajer;Marc Streit;Thomas Torsney-Weir;Florian Spechtenhauser;Torsten Möller;Harald Piringer,Stephan Pajer;Marc Streit;Thomas Torsney-Weir;Florian Spechtenhauser;Torsten Möller;Harald Piringer,VRVis Research Center;University Linz;University of Vienna;VRVis Research Center;University of Vienna;VRVis Research Center,10.1109/TVCG.2015.2468011;10.1109/TVCG.2013.147;10.1109/VAST.2015.7347686;10.1109/VISUAL.1993.398859;10.1109/TVCG.2008.145;10.1109/VAST.2011.6102457;10.1109/TVCG.2011.253;10.1109/TVCG.2014.2346321;10.1109/TVCG.2010.190;10.1109/TVCG.2009.110;10.1109/VAST.2010.5652460;10.1109/TVCG.2013.173;10.1109/TVCG.2011.248;10.1109/TVCG.2009.111,Visual analysis;decision making;multi-objective optimization;interactive ranking;rank sensitivity,20,23,41,
InfoVis,2016,Temporal Summary Images: An Approach to Narrative Visualization via Interactive Annotation Generation and Placement,10.1109/TVCG.2016.2598876,http://dx.doi.org/10.1109/TVCG.2016.2598876,511,520,J,"Visualization is a powerful technique for analysis and communication of complex, multidimensional, and time-varying data. However, it can be difficult to manually synthesize a coherent narrative in a chart or graph due to the quantity of visualized attributes, a variety of salient features, and the awareness required to interpret points of interest (POls). We present Temporal Summary Images (TSIs) as an approach for both exploring this data and creating stories from it. As a visualization, a TSI is composed of three common components: (1) a temporal layout, (2) comic strip-style data snapshots, and (3) textual annotations. To augment user analysis and exploration, we have developed a number of interactive techniques that recommend relevant data features and design choices, including an automatic annotations workflow. As the analysis and visual design processes converge, the resultant image becomes appropriate for data storytelling. For validation, we use a prototype implementation for TSIs to conduct two case studies with large-scale, scientific simulation datasets.",Chris Bryan;Kwan-Liu Ma;Jonathan Woodring,Chris Bryan;Kwan-Liu Ma;Jonathan Woodring,"University of California, Davis;University of California, Davis;Los Alamos National Laboratory",10.1109/TVCG.2008.166;10.1109/TVCG.2007.70594;10.1109/TVCG.2011.255;10.1109/TVCG.2010.179;10.1109/VAST.2010.5652890;10.1109/TVCG.2012.229;10.1109/TVCG.2012.212;10.1109/TVCG.2011.195;10.1109/VAST.2012.6400487,Narrative visualization;storytelling;annotations;comic strip visualization;time-varying data,20,26,46,
InfoVis,2016,VLAT: Development of a Visualization Literacy Assessment Test,10.1109/TVCG.2016.2598920,http://dx.doi.org/10.1109/TVCG.2016.2598920,551,560,J,"The Information Visualization community has begun to pay attention to visualization literacy; however, researchers still lack instruments for measuring the visualization literacy of users. In order to address this gap, we systematically developed a visualization literacy assessment test (VLAT), especially for non-expert users in data visualization, by following the established procedure of test development in Psychological and Educational Measurement: (1) Test Blueprint Construction, (2) Test Item Generation, (3) Content Validity Evaluation, (4) Test Tryout and Item Analysis, (5) Test Item Selection, and (6) Reliability Evaluation. The VLAT consists of 12 data visualizations and 53 multiple-choice test items that cover eight data visualization tasks. The test items in the VLAT were evaluated with respect to their essentialness by five domain experts in Information Visualization and Visual Analytics (average content validity ratio = 0.66). The VLAT was also tried out on a sample of 191 test takers and showed high reliability (reliability coefficient omega = 0.76). In addition, we demonstrated the relationship between users' visualization literacy and aptitude for learning an unfamiliar visualization and showed that they had a fairly high positive relationship (correlation coefficient = 0.64). Finally, we discuss evidence for the validity of the VLAT and potential research areas that are related to the instrument.",Sukwon Lee;Sung-Hee Kim;Bum Chul Kwon,Sukwon Lee;Sung-Hee Kim;Bum Chul Kwon,"School of Industrial Engineering, Purdue University, West Lafayette, IN, USA;Samsung Electronics Co., Ltd., Seoul, South Korea;IBM T.J. Watson Research Center, Yorktown Heights, NY, USA",10.1109/TVCG.2014.2346419;10.1109/TVCG.2014.2346481;10.1109/TVCG.2014.2346984;10.1109/VISUAL.1991.175815;10.1109/TVCG.2007.70515;10.1109/TVCG.2015.2467195;10.1109/VAST.2011.6102435;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2013.124;10.1109/TVCG.2015.2467201,Visualization Literacy;Assessment Test;Instrument;Measurement;Aptitude;Education,20,27,55,
VAST,2016,Visual Analysis of MOOC Forums with iForum,10.1109/TVCG.2016.2598444,http://dx.doi.org/10.1109/TVCG.2016.2598444,201,210,J,"Discussion forums of Massive Open Online Courses (MOOC) provide great opportunities for students to interact with instructional staff as well as other students. Exploration of MOOC forum data can offer valuable insights for these staff to enhance the course and prepare the next release. However, it is challenging due to the large, complicated, and heterogeneous nature of relevant datasets, which contain multiple dynamically interacting objects such as users, posts, and threads, each one including multiple attributes. In this paper, we present a design study for developing an interactive visual analytics system, called iForum, that allows for effectively discovering and understanding temporal patterns in MOOC forums. The design study was conducted with three domain experts in an iterative manner over one year, including a MOOC instructor and two official teaching assistants. iForum offers a set of novel visualization designs for presenting the three interleaving aspects of MOOC forums (i.e., posts, users, and threads) at three different scales. To demonstrate the effectiveness and usefulness of iForum, we describe a case study involving field experts, in which they use iForum to investigate real MOOC forum data for a course on JAVA programming.",Siwei Fu;Jian Zhao 0010;Weiwei Cui;Huamin Qu,Siwei Fu;Jian Zhao;Weiwei Cui;Huamin Qu,Hong Kong University of Science and Technology;Autodesk Research;Microsoft Research;Hong Kong University of Science and Technology,10.1109/TVCG.2006.147;10.1109/TVCG.2007.70535;10.1109/INFVIS.2003.1249028;10.1109/TVCG.2015.2467555,Discussion forum;MOOC;temporal visualization;visual analytics,20,28,40,
InfoVis,2017,Visual Exploration of Semantic Relationships in Neural Word Embeddings,10.1109/TVCG.2017.2745141,http://dx.doi.org/10.1109/TVCG.2017.2745141,553,562,J,"Constructing distributed representations for words through neural language models and using the resulting vector spaces for analysis has become a crucial component of natural language processing (NLP). However, despite their widespread application, little is known about the structure and properties of these spaces. To gain insights into the relationship between words, the NLP community has begun to adapt high-dimensional visualization techniques. In particular, researchers commonly use t-distributed stochastic neighbor embeddings (t-SNE) and principal component analysis (PCA) to create two-dimensional embeddings for assessing the overall structure and exploring linear relationships (e.g., word analogies), respectively. Unfortunately, these techniques often produce mediocre or even misleading results and cannot address domain-specific visualization challenges that are crucial for understanding semantic relationships in word embeddings. Here, we introduce new embedding techniques for visualizing semantic and syntactic analogies, and the corresponding tests to determine whether the resulting views capture salient structures. Additionally, we introduce two novel views for a comprehensive study of analogy relationships. Finally, we augment t-SNE embeddings to convey uncertainty information in order to allow a reliable interpretation. Combined, the different views address a number of domain-specific tasks difficult to solve with existing tools.",Shusen Liu;Peer-Timo Bremer;Jayaraman J. Thiagarajan;Vivek Srikumar;Bei Wang 0001;Yarden Livnat;Valerio Pascucci,Shusen Liu;Peer-Timo Bremer;Jayaraman J. Thiagarajan;Vivek Srikumar;Bei Wang;Yarden Livnat;Valerio Pascucci,Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory;School of ComputingUniversity of Utah;SCI InstituteUniversity of Utah;SCI InstituteUniversity of Utah;SCI InstituteUniversity of Utah,10.1109/TVCG.2011.185;10.1109/VISUAL.1990.146402;10.1109/TVCG.2013.196,"Natural Language Processing,Word Embedding,High-Dimensional Data",20,13,46,
VAST,2017,Bring It to the Pitch: Combining Video and Movement Data to Enhance Team Sport Analysis,10.1109/TVCG.2017.2745181,http://dx.doi.org/10.1109/TVCG.2017.2745181,13,22,J,"Analysts in professional team sport regularly perform analysis to gain strategic and tactical insights into player and team behavior. Goals of team sport analysis regularly include identification of weaknesses of opposing teams, or assessing performance and improvement potential of a coached team. Current analysis workflows are typically based on the analysis of team videos. Also, analysts can rely on techniques from Information Visualization, to depict e.g., player or ball trajectories. However, video analysis is typically a time-consuming process, where the analyst needs to memorize and annotate scenes. In contrast, visualization typically relies on an abstract data model, often using abstract visual mappings, and is not directly linked to the observed movement context anymore. We propose a visual analytics system that tightly integrates team sport video recordings with abstract visualization of underlying trajectory data. We apply appropriate computer vision techniques to extract trajectory data from video input. Furthermore, we apply advanced trajectory and movement analysis techniques to derive relevant team sport analytic measures for region, event and player analysis in the case of soccer analysis. Our system seamlessly integrates video and visualization modalities, enabling analysts to draw on the advantages of both analysis forms. Several expert studies conducted with team sport analysts indicate the effectiveness of our integrated approach.",Manuel Stein;Halldór Janetzko;Andreas Lamprecht;Thorsten Breitkreutz;Philipp Zimmermann;Bastian Goldlücke;Tobias Schreck;Gennady L. Andrienko;Michael Grossniklaus;Daniel A. Keim,Manuel Stein;Halldor Janetzko;Andreas Lamprecht;Thorsten Breitkreutz;Philipp Zimmermann;Bastian Goldlücke;Tobias Schreck;Gennady Andrienko;Michael Grossniklaus;Daniel A. Keim,"University of Konstanz;University of Zürich;University of Konstanz;University of Konstanz;University of Konstanz;University of Konstanz;Graz University of Technology;Fraunhofer IAIS, Germany;University of Konstanz;University of Konstanz",10.1109/TVCG.2007.70521;10.1109/VISUAL.2003.1250401;10.1109/TVCG.2013.207;10.1109/TVCG.2012.263;10.1109/TVCG.2014.2346445;10.1109/VAST.2014.7042477,"visual analytics,sport analytics,immersive analytics",20,13,49,
Vis,1990,Techniques for the interactive visualization of volumetric data,10.1109/VISUAL.1990.146363,http://dx.doi.org/10.1109/VISUAL.1990.146363,45,"50, 462-3",C,"Some ideas and techniques for visualizing volumetric data are introduced. The methods presented are different from both the volume rendering techniques and surface contour methods. Volumetric data is data with a domain of three independent variables. The independent variables do not have to indicate a position in space and can be abstract in the sense that they can represent any quantity. The authors cover only the case where the dependent data is a single scalar. The authors describe a collection of techniques and ideas for graphing cuberille grid data. All of these techniques are quite simple and rather easy to implement. During the development of these techniques, the authors were particularly concerned with allowing the user to interact with the system in order to interrogate and analyze the relationships indicated by the volumetric data.&lt;&lt;ETX&gt;&gt;",Gregory M. Nielson;Bernd Hamann,G.M. Nielson;B. Hamann,"Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA;Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA",10.1109/VISUAL.1990.146388,,19,7,35,
Vis,1990,Hierarchical triangulation using terrain features,10.1109/VISUAL.1990.146379,http://dx.doi.org/10.1109/VISUAL.1990.146379,168,175,C,"A hierarchical triangulation built from a digital elevation model in grid form is described. The authors present an algorithm that produces a hierarchy of triangulations in which each level of the hierarchy corresponds to a guaranteed level of accuracy. The number of very thin triangles (slivers) is significantly reduced. Such triangles produced undesirable effects in animation. In addition the number of levels of the triangulated irregular network (TIN) tree is reduced. This speeds up searching within the data structure. Tests on data with digital elevation input have confirmed the theoretical expectations. On eight such sets the average sliveriness with the method was between 1/5 and 1/10 of old triangulations and number of levels was about one third. There was an increase in the number of descendants at each level, but the total number of triangles was also lower.&lt;&lt;ETX&gt;&gt;",Lori L. Scarlatos;Theodosios Pavlidis,L. Scarlatos;T. Pavlidis,"Grumman Data Syst., Woodbury, NY, USA",,,19,9,20,
Vis,1991,Visualization in computational fluid dynamics: a case study,10.1109/VISUAL.1991.175837,http://dx.doi.org/10.1109/VISUAL.1991.175837,392,"397, 436",C,"VISUAL 3, a highly interactive environment for the visualization of 3D volumetric scientific data, is described. The volume can be broken up in a structured or unstructured manner, and the problem can be static or unsteady in time. Because the data are volumetric and all the information can be changing, traditional CAD techniques are not appropriate. Therefore, VISUAL3 was developed using intermediate mode-rendering methods. A unique aspect of VISUAL3 is the dimensional windowing approach coupled with cursor mapping, which allows efficient pointing in 3D space. VISUAL3 is composed of a large number of visualization tools that can be generally classified into identification, scanning, and probing techniques.&lt;&lt;ETX&gt;&gt;",Robert Haimes;David L. Darmofal,R. Haimes;D. Darmofal,"Dept. of Aeronaut. & Astronaut, MIT, Cambridge, MA, USA;Dept. of Aeronaut. & Astronaut, MIT, Cambridge, MA, USA",,,19,10,8,
Vis,1993,Data shaders,10.1109/VISUAL.1993.398879,http://dx.doi.org/10.1109/VISUAL.1993.398879,275,282,C,"The process of visualizing a scientific data set requires an extensive knowledge of the domain in which the data set is created. Because an in-depth knowledge of all scientific domains is not available to the creator of visualization software, a flexible and extensible visualization system is essential in providing a productive tool to the scientist. This paper presents a shading language, based on the RenderMan shading language, that extends the shading model used to render volume data sets. Data shaders, written in this shading language, give the users of a volume rendering system a means of specifying how a volume data set is to be rendered. This flexibility is useful both as a visualization tool in the scientific community and as a research tool in the visualization community.&lt;&lt;ETX&gt;&gt;",Brian Corrie;Paul Mackerras,B. Corrie;P. Mackerras,"Dept. of Comput. Sci., Australian Nat. Univ., Canberra, ACT, Australia;Dept. of Comput. Sci., Australian Nat. Univ., Canberra, ACT, Australia",10.1109/VISUAL.1991.175804,,19,5,21,
Vis,1993,Spray rendering: Visualization using smart particles,10.1109/VISUAL.1993.398880,http://dx.doi.org/10.1109/VISUAL.1993.398880,283,290,C,"We propose a new framework for doing scientific visualization. The basis for this framework is a combination of particle systems and behavioral animation. Here, particles are not only affected by the field that they are in, but can also exhibit different programmed behaviors. An intuitive delivery system, based on virtual cans of spray paint, is also described to introduce the smart particles into the data set. Hence the name spray rendering. Using this metaphor, different types of spray paint are used to highlight different features in the data set. Spray rendering offers several advantages over existing methods: (1) it generalizes the current techniques of surface, volume and flow visualization under one coherent framework; (2) it works with regular and irregular grids as well as sparse and dense data sets; (3) it allows selective progressive refinement; (4) it is modular, extensible and provides scientists with the flexibility for exploring relationships in their data sets in natural and artistic ways.&lt;&lt;ETX&gt;&gt;",Alex T. Pang;Kyle Smith,A. Pang;K. Smith,"Board of Studies in Comput. & Inf. Sci., California Univ., Santa Cruz, CA, USA;Board of Studies in Comput. & Inf. Sci., California Univ., Santa Cruz, CA, USA",10.1109/VISUAL.1992.235226,,19,10,17,
Vis,1994,Nonpolygonal isosurface rendering for large volume datasets,10.1109/VISUAL.1994.346306,http://dx.doi.org/10.1109/VISUAL.1994.346306,293,"300, C33",C,"Surface-based rendering techniques, particularly those that extract a polygonal approximation of an isosurface, are widely used in volume visualization. As dataset size increases though, the computational demands of these methods can overwhelm typically available computing resources. Recent work on accelerating such techniques has focused on preprocessing the volume data or postprocessing the extracted polygonization. The algorithm presented, concentrates instead on streamlining the surface extraction process itself so as to accelerate the rendering of large volumes. The technique shortens the conventional isosurface visualization pipeline by eliminating the intermediate polygonization. We compute the contribution of the isosurface within a volume cell to the resulting image directly from a simplified numerical description of the cell/surface intersection. The approach also reduces the work in the remaining stages of the visualization process. By quantizing the volume data, we exploit precomputed and cached data at key processing steps to improve rendering efficiency. The resulting implementation provides comparatively fast renderings with reasonable image quality.&lt;&lt;ETX&gt;&gt;",James W. Durkin;John F. Hughes,J.W. Durkin;J.F. Hughes,"Program of Comput. Graphics, Cornell Univ., Ithaca, NY, USA",,,19,3,12,
Vis,1996,History consideration in reconstructing polyhedral surfaces from parallel slices,10.1109/VISUAL.1996.567804,http://dx.doi.org/10.1109/VISUAL.1996.567804,149,156,C,"We introduce an algorithm for reconstructing a solid model given a series of planar cross sections. The main contribution of this work is the use of knowledge obtained during the interpolation of neighboring layers while attempting to interpolate a particular layer. This knowledge is used to reconstruct a surface in which consecutive layers are connected smoothly. In most previous work, each layer is interpolated independently of what happened or will happen in the other layers. We also discuss various objective functions which aim to optimize the reconstruction, and present an evaluation of the different objective functions by using various criteria.",Gill Barequet;Daniel Shapiro;Ayellet Tal,G. Barequet;D. Shapiro;A. Tal,"Tel Aviv Univ., Israel",,"reconstruction, interpolation, triangulation",19,9,35,
Vis,1996,Triangular NURBS surface modeling of scattered data,10.1109/VISUAL.1996.568122,http://doi.ieeecomputersociety.org/10.1109/VISUAL.1996.568122,295,302,C,"We propose to fit triangular NURBS surfaces to noisy, sparse, scattered 3D data while simultaneously localizing and preserving sharp edges. We use a vector voting method to interpolate, from sparse data, three dense potential fields for surfaces, edges, and junctions. The global voting interpolants encode several human perceptual grouping principles such as cosurfacity, proximity, and constancy of curvature. The inferred potential fields are stored in three volumetric grids, giving each voxel the probability of being a surface point, an edge point, and a junction point. Then we use a new model called ""winged B snakes"", which are deformable triangular NURBS surfaces embedded with active curves, to fit the surfaces and align the edges and junctions. Finally, a smooth C/sup 1/ surface which preserves discontinuity edges and junctions is constructed. Fine tuning and surface fairing is done by adjusting the weights.",Song Han;Gérard G. Medioni,Song Han;G. Medioni,"Inst. for Robotics & Intelligent Syst., Univ. of Southern California, Los Angeles, CA, USA",,,19,1,0,
InfoVis,1997,Managing multiple focal levels in Table Lens,10.1109/INFVIS.1997.636787,http://dx.doi.org/10.1109/INFVIS.1997.636787,59,63,C,"The Table Lens, focus+context visualization for large data tables, allows users to see 100 times as many data values as a spreadsheet in the same screen space in a manner that enables an extremely immediate form of exploratory data analysis. In the original Table Lens design, data are shown in the context area using graphical representations in a single pixel row. Scaling up the Table Lens technique beyond approximately 500 cases (rows) by 40 variables (columns) requires not showing every value individually and thus raises challenges for preserving the exploratory and navigational ease and power of the original design. We describe two design enhancements for introducing regions of less than a pixel row for each data value and discuss the issues raised by each.",Tichomir Tenev;Ramana Rao,T. Tenev;R. Rao,"Xerox Palo Alto Res. Center, CA, USA",,"Focus+Context, Fisheye, Information visualization, Table Lens",19,4,6,
Vis,1998,A distributed blackboard architecture for interactive data visualization,10.1109/VISUAL.1998.745307,http://dx.doi.org/10.1109/VISUAL.1998.745307,225,231,C,"In this paper the motivation, design and application of a distributed blackboard architecture for interactive data visualization is discussed. The main advantages of the architecture are twofold. First, it allows visualization tools to be tightly integrated with simulations. Second, it allows qualitative and quantitative analysis to be combined during the visualization process.",Robert van Liere;Jan Harkes;Wim C. de Leeuw,R. van Liere;J. Harkes;W. de Leeuw,"Center for Math. & Comput. Sci., CWI, Amsterdam, Netherlands",10.1109/VISUAL.1992.235202;10.1109/VISUAL.1991.175818;10.1109/VISUAL.1997.663896;10.1109/VISUAL.1996.567752;10.1109/VISUAL.1995.485143;10.1109/VISUAL.1992.235207;10.1109/VISUAL.1994.346304,,19,6,18,
Vis,1998,Comparing LIC and spot noise,10.1109/VISUAL.1998.745324,http://dx.doi.org/10.1109/VISUAL.1998.745324,359,365,C,Spot noise and line integral convolution (LIC) are two texture synthesis techniques for vector field visualization. The two techniques are compared. Continuous directional convolution is used as a common basis for comparing the techniques. It is shown that the techniques are based on the same mathematical concept. Comparisons of the visual appearance of the output and performance of the algorithms are made.,Wim C. de Leeuw;Robert van Liere,W. de Leeuw;R. van Liere,"Center for Math. & Comput. Sci., CWI, Amsterdam, Netherlands",10.1109/VISUAL.1997.663898;10.1109/VISUAL.1997.663912;10.1109/VISUAL.1995.480817,"flow visualization, texture synthesis",19,10,15,
Vis,1999,Spiraling Edge: fast surface reconstruction from partially organized sample points,10.1109/VISUAL.1999.809903,http://dx.doi.org/10.1109/VISUAL.1999.809903,317,538,C,"Many applications produce three-dimensional points that must be further processed to generate a surface. Surface reconstruction algorithms that start with a set of unorganized points are extremely time-consuming. Sometimes however, points are generated such that there is additional information available to the reconstruction algorithm. We present Spiraling Edge, a specialized algorithm for surface reconstruction that is three orders of magnitude faster than algorithms for the general case. In addition to sample point locations, our algorithm starts with normal information and knowledge of each point's neighbors. Our algorithm produces a localized approximation to the surface by creating a star-shaped triangulation between a point and a subset of its nearest neighbors. This surface patch is extended by locally triangulating each of the points along the edge of the patch. As each edge point is triangulated, it is removed from the edge and new edge points along the patch's edge are inserted in its place. The updated edge spirals out over the surface until the edge encounters a surface boundary and stops growing in that direction, or until the edge reduces to a small hole that is filled by the final triangle.",Patricia Crossno;Edward Angel,P. Crossno;E. Angel,"Sandia Nat. Labs., CA, USA",10.1109/VISUAL.1997.663930;10.1109/VISUAL.1998.745286,"Surface reconstruction, advancing front, triangulation",19,8,6,
Vis,2000,Scanline surfacing: building separating surfaces from planar contours,10.1109/VISUAL.2000.885706,http://dx.doi.org/10.1109/VISUAL.2000.885706,283,289,C,"A standard way to segment medical imaging datasets is by tracing contours around regions of interest in parallel planar slices. Unfortunately, the standard methods for reconstructing three dimensional surfaces from those planar contours tend to be either complicated or not very robust. Furthermore, they fail to consistently mesh abutting structures which share portions of contours. We present a novel, straight-forward algorithm for accurately and automatically reconstructing surfaces from planar contours. Our algorithm is based on scanline rendering and separating surface extraction. By rendering the contours as distinctly colored polygons and reading back each rendered slice into a segmented volume, we reduce the complex problem of building a surface from planar contours to the much simpler problem of extracting separating surfaces from a classified volume. Our scanline surfacing algorithm robustly handles complex surface topologies such as bifurcations, embedded features and abutting surfaces.",David M. Weinstein,D. Weinstein,"Sch. of Comput., Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.1997.663887;10.1109/VISUAL.1994.346337,"separating surfaces, planar contours, surface construction, scanline",19,4,26,
Vis,2001,Hardware-software-balanced resampling for the interactive visualization of unstructured grids,10.1109/VISUAL.2001.964512,http://dx.doi.org/10.1109/VISUAL.2001.964512,199,206,C,"In this paper we address the problem of interactively resampling unstructured grids. Three algorithms are presented. They all allow adaptive resampling of an unstructured grid on a multiresolution hierarchy of arbitrarily sized cartesian grids according to a varying element size. Two of the algorithms presented take advantage of hardware accelerated polygon rendering and 2D texture mapping. In exploiting new features of modem PC graphics adapters, the first algorithm tries to significantly minimize the number of polygons to be rendered. Reducing rasterization requirements is the main goal of the second algorithm, which distributes the computational workload differently between the main processor and the graphics chip. By comparing them to a new pure software approach, an optimal software-hardware balance is studied. We end up with a hybrid approach which greatly improves the performance of hardware assisted resampling by involving the main processor to a higher degree and thus enabling resampling at nearly interactive rates.",Manfred Weiler;Thomas Ertl,M. Weiler;T. Ertl,"Visualization & Interactive Syst. Group, Stuttgart Univ., Germany;Visualization & Interactive Syst. Group, Stuttgart Univ., Germany",10.1109/VISUAL.1996.567606,,19,7,15,
Vis,2001,Fast extraction of adaptive multiresolution meshes with guaranteed properties from volumetric data,10.1109/VISUAL.2001.964524,http://dx.doi.org/10.1109/VISUAL.2001.964524,295,302,C,"We present a new algorithm for extracting adaptive multiresolution triangle meshes from volume datasets. The algorithm guarantees that the topological genus of the generated mesh is the same as the genus of the surface embedded in the volume dataset at all levels of detail. In addition to this ""hard constraint"" on the genus of the mesh, the user can choose to specify some number of soft geometric constraints, such as triangle aspect ratio, minimum or maximum total number of vertices, minimum and/or maximum triangle edge lengths, maximum magnitude of various error metrics per triangle or vertex, including maximum curvature (area) error, maximum distance to the surface, and others. The mesh extraction process is fully automatic and does not require manual adjusting of parameters to produce the desired results as long as the user does not specify incompatible constraints. The algorithm robustly handles special topological cases, such as trimmed surfaces (intersections of the surface with the volume boundary), and manifolds with multiple disconnected components (several closed surfaces embedded in the same volume dataset). The meshes may self-intersect at coarse resolutions. However, the self-intersections are corrected automatically as the resolution of the meshes increase. We show several examples of meshes extracted from complex volume datasets.",Marcel Gavriliu;Joel Carranza;David E. Breen;Alan H. Barr,M. Gavriliu;J. Carranza;D.E. Breen;A.H. Barr,"Comput. Sci. Dept., California Inst. of Technol., USA;Comput. Sci. Dept., California Inst. of Technol., USA;Comput. Sci. Dept., California Inst. of Technol., USA;Comput. Sci. Dept., California Inst. of Technol., USA",10.1109/VISUAL.2000.885705,,19,8,27,
Vis,2001,"Case study: reconstruction, visualization and quantification of neuronal fiber pathways",10.1109/VISUAL.2001.964549,http://dx.doi.org/10.1109/VISUAL.2001.964549,453,456,C,"It is of significant interest for neurological studies to determine and visualize neuronal fiber pathways in the human brain. By exploiting the capability of diffusion tensor magnetic resonance imaging to detect local orientations of neuronal fibers, we have developed a system of algorithms to reconstruct, visualize and quantify neuronal fiber pathways in vivo. Illustrative results show that the system is a promising tool for visual analysis of fiber connectivity and quantitative studies of neuronal fibers.",Zhaohua Ding;John C. Gore;Adam W. Anderson,Zhaohua Ding;J.C. Gore;A.W. Anderson,"Dept. of Diagnostic Radiol., Yale Univ. Sch. of Med., New Haven, CT, USA;Dept. of Diagnostic Radiol., Yale Univ. Sch. of Med., New Haven, CT, USA;Dept. of Diagnostic Radiol., Yale Univ. Sch. of Med., New Haven, CT, USA",,"neuronal fiber pathway, diffusion tensor imaging",19,3,12,
Vis,2002,Level set segmentation from multiple non-uniform volume datasets,10.1109/VISUAL.2002.1183773,http://dx.doi.org/10.1109/VISUAL.2002.1183773,179,186,C,"Typically 3-D MR and CT scans have a relatively high resolution in the scanning X-Y plane, but much lower resolution in the axial Z direction. This non-uniform sampling of an object can miss small or thin structures. One way to address this problem is to scan the same object from multiple directions. In this paper we describe a method for deforming a level set model using velocity information derived from multiple volume datasets with non-uniform resolution in order to produce a single high-resolution 3D model. The method locally approximates the values of the multiple datasets by fitting a distance-weighted polynomial using moving least-squares. The proposed method has several advantageous properties: its computational cost is proportional to the object surface area, it is stable with respect to noise, imperfect registrations and abrupt changes in the data, it provides gain-correction, and it employs a distance-based weighting to ensures that the contributions from each scan are properly merged into the final result. We have demonstrated the effectiveness of our approach on four multi-scan datasets, a Griffin laser scan reconstruction, a CT scan of a teapot and MR scans of a mouse embryo and a zucchini.",Ken Museth;David E. Breen;Leonid Zhukov;Ross T. Whitaker,K. Museth;D.E. Breen;L. Zhukov;R.T. Whitaker,"Dept. of Comput. Sci., California Inst. of Technol., Pasadena, CA, USA;Dept. of Comput. Sci., California Inst. of Technol., Pasadena, CA, USA;Dept. of Comput. Sci., California Inst. of Technol., Pasadena, CA, USA",,"segmentation, visualization, level set models, 3D reconstruction",19,7,26,
Vis,2002,BLIC: Bi-Level Isosurface Compression,10.1109/VISUAL.2002.1183807,http://dx.doi.org/10.1109/VISUAL.2002.1183807,451,458,C,"In this paper we introduce a new and simple algorithm to compress isosurface data. This is the data extracted by isosurface algorithms from scalar functions defined on volume grids, and used to generate polygon meshes or alternative representations. In this algorithm the mesh connectivity and a substantial proportion of the geometric information are encoded to a fraction of a bit per marching cubes vertex with a context based arithmetic coder closely related to the JBIG binary image compression standard. The remaining optional geometric information that specifies the location of each marching cubes vertex more precisely along its supporting intersecting grid edge, is efficiently encoded in scan-order with the same mechanism. Vertex normals can optionally be computed as normalized gradient vectors by the encoder and included in the bitstream after quantization and entropy encoding, or computed by the decoder in a postprocessing smoothing step. These choices are determined by trade-offs associated with an in-core vs. out-of-core decoder structure. The main features of our algorithm are its extreme simplicity and high compression rates.",Gabriel Taubin,G. Taubin,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.1997.663848;10.1109/VISUAL.2000.885705,"3D Geometry Compression, Algorithms, Graphics",19,3,38,
InfoVis,2003,Improving Hybrid MDS with Pivot-Based Searching,10.1109/INFVIS.2003.1249012,http://doi.ieeecomputersociety.org/10.1109/INFVIS.2003.1249012,85,90,C,"An algorithm is presented for the visualization of multidimensional abstract data, building on a hybrid model introduced at Info Vis 2002. The most computationally complex stage of the original model involved performing a nearest-neighbour search for every data item. The complexity of this phase has been reduced by treating all high-dimensional relationships as a set of discretised distances to a constant number of randomly selected pivot items. In improving this computational bottleneck, the complexity is reduced to from O(N/sub 1/2 /N) to O(N/sub 5/4/). As well as documenting this improvement, the paper describes evaluation with a data set of 108000 14-dimensional items; a considerable increase on the size of data previously tested. Results illustrate that the reduction in complexity is reflected in significantly improved run times and that no negative impact is made upon the quality of layout produced.",Alistair Morrison;Matthew Chalmers,A. Morrison;M. Chalmers,"Dept. of Comput. Sci., Glasgow Univ., UK;Dept. of Comput. Sci., Glasgow Univ., UK",10.1109/INFVIS.2002.1173150;10.1109/INFVIS.2002.1173159;10.1109/VISUAL.1996.567787;10.1109/INFVIS.2002.1173161,"Multidimensional scaling, MDS, spring models, hybrid algorithms, pivots, near-neighbour search, force directed placement",19,3,17,
InfoVis,2003,FundExplorer: supporting the diversification of mutual fund portfolios using context treemaps,10.1109/INFVIS.2003.1249027,http://dx.doi.org/10.1109/INFVIS.2003.1249027,203,208,C,"An equity mutual fund is a financial instrument that invests in a set of stocks. Any two different funds may partially invest in some of the same stocks, thus overlap is common. Portfolio diversification aims at spreading an investment over many different stocks in search of greater returns. Helping people with portfolio diversification is challenging because it requires informing them about both their current portfolio of stocks held through funds and the other stocks in the market not invested in yet. Current stock/fund visualization systems either waste screen real estate and visualization of all data points. We have developed a system called FundExplorer that implements a distorted treemap to visualize both the amount of money invested in a person's fund portfolio and the context of remaining market stocks. The FundExplorer system enables people to interactively explore diversification possibilities with their portfolios.",Christoph Csallner;Marcus Handte;Othmar Lehmann;John T. Stasko,C. Csallner;M. Handte;O. Lehmann;J. Stasko,"Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA",10.1109/INFVIS.2002.1173156;10.1109/VISUAL.1992.235217,"information visualization, context, treemap, distortion, query, financial data, stock market, FundExplore",19,15,9,
Vis,2004,"Anisotropic volume rendering for extremely dense, thin line data",10.1109/VISUAL.2004.5,http://dx.doi.org/10.1109/VISUAL.2004.5,107,114,C,"Many large scale physics-based simulations which take place on PC clusters or supercomputers produce huge amounts of data including vector fields. While these vector data such as electromagnetic fields, fluid flow fields, or particle paths can be represented by lines, the sheer number of the lines overwhelms the memory and computation capability of a high-end PC used for visualization. Further, very dense or intertwined lines, rendered with traditional visualization techniques, can produce unintelligible results with unclear depth relationships between the lines and no sense of global structure. Our approach is to apply a lighting model to the lines and sample them into an anisotropic voxel representation based on spherical harmonics as a preprocessing step. Then we evaluate and render these voxels for a given view using traditional volume rendering. For extremely large line based datasets, conversion to anisotropic voxels reduces the overall storage and rendering for O(n) lines to O(1) with a large constant that is still small enough to allow meaningful visualization of the entire dataset at nearly interactive rates on a single commodity PC.",Gregory L. Schussman;Kwan-Liu Ma,G. Schussman;K.-L. Ma,"Stanford Linear Accelerator Center, Menlo Park, CA, USA",,"anisotropic lighting, line data, scientific visualization, vector field, volume rendering",19,16,17,
Vis,2004,"Methods for efficient, high quality volume resampling in the frequency domain",10.1109/VISUAL.2004.70,http://dx.doi.org/10.1109/VISUAL.2004.70,3,10,C,"Resampling is a frequent task in visualization and medical imaging. It occurs whenever images or volumes are magnified, rotated, translated, or warped. Resampling is also an integral procedure in the registration of multimodal datasets, such as CT, PET, and MRI, in the correction of motion artifacts in MRI, and in the alignment of temporal volume sequences in fMRI. It is well known that the quality of the resampling result depends heavily on the quality of the interpolation filter used. However, high-quality filters are rarely employed in practice due to their large spatial extents. We explore a new resampling technique that operates in the frequency-domain where high-quality filtering is feasible. Further, unlike previous methods of this kind, our technique is not limited to integer-ratio scaling factors, but can resample image and volume datasets at any rate. This would usually require the application of slow discrete Fourier transforms (DFT) to return the data to the spatial domain. We studied two methods that successfully avoid these delays: the chirp-z transform and the FFTW package. We also outline techniques to avoid the ringing artifacts that may occur with frequency-domain filtering. Thus, our method can achieve high-quality interpolation at speeds that are usually associated with spatial filters of far lower quality.",Aili Li;Klaus Mueller;Thomas Ernst 0001,A. Li;K. Mueller;T. Ernst,"Comput. Sci. Dept., State Univ. of New York, Stony Brook, NY, USA;Comput. Sci. Dept., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1994.346331,"resampling, filters, Fourier Transform",19,8,27,
Vis,2005,Particle and texture based spatiotemporal visualization of time-dependent vector fields,10.1109/VISUAL.2005.1532852,http://dx.doi.org/10.1109/VISUAL.2005.1532852,639,646,C,"We propose a hybrid particle and texture based approach for the visualization of time-dependent vector fields. The underlying space-time framework builds a dense vector field representation in a two-step process: 1) particle-based forward integration of trajectories in spacetime for temporal coherence, and 2) texture-based convolution along another set of paths through the spacetime for spatially correlated patterns. Particle density is controlled by stochastically injecting and removing particles, taking into account the divergence of the vector field. Alternatively, a uniform density can be maintained by placing exactly one particle in each cell of a uniform grid, which leads to particle-in-cell forward advection. Moreover, we discuss strategies of previous visualization methods for unsteady flow and show how they address issues of spatiotemporal coherence and dense visual representations. We demonstrate how our framework is capable of realizing several of these strategies. Finally, we present an efficient GPU implementation that facilitates an interactive visualization of unsteady 2D flow on Shader Model 3 compliant graphics hardware.",Daniel Weiskopf;Frederik Schramm;Gordon Erlebacher;Thomas Ertl,D. Weiskopf;F. Schramm;G. Erlebacher;T. Ertl,"Graphics, Usability, & Visualization Lab., Simon Fraser Univ., Burnaby, BC, Canada",10.1109/VISUAL.2003.1250377;10.1109/VISUAL.2003.1250363;10.1109/VISUAL.2003.1250361;10.1109/VISUAL.2000.885689;10.1109/VISUAL.2003.1250402;10.1109/VISUAL.2003.1250364,"Unsteady flow visualization, visualization framework, LIC, texture advection, particle systems, GPU methods",19,9,31,
Vis,2005,Illustrative display of hidden iso-surface structures,10.1109/VISUAL.2005.1532855,http://dx.doi.org/10.1109/VISUAL.2005.1532855,663,670,C,"Indirect volume rendering is a widespread method for the display of volume datasets. It is based on the extraction of polygonal iso-surfaces from volumetric data, which are then rendered using conventional rasterization methods. Whereas this rendering approach is fast and relatively easy to implement, it cannot easily provide an understandable display of structures occluded by the directly visible iso-surface. Simple approaches like alpha-blending for transparency when drawing the iso-surface often generate a visually complex output, which is difficult to interpret. Moreover, such methods can significantly increase the computational complexity of the rendering process. In this paper, we therefore propose a new approach for the illustrative indirect rendering of volume data in real-time. This algorithm emphasizes the silhouette of objects represented by the iso-surface. Additionally, shading intensities on objects are reproduced with a monochrome hatching technique. Using a specially designed two-pass rendering process, structures behind the front layer of the iso-surface are automatically extracted with a depth peeling method. The shapes of these hidden structures are also displayed as silhouette outlines. As an additional option, the geometry of explicitly specified inner objects can be displayed with constant translucency. Although these inner objects always remain visible, a specific shading and depth attenuation method is used to convey the depth relationships. We describe the implementation of the algorithm, which exploits the programmability of state-of-the-art graphics processing units (GPUs). The algorithm described in this paper does not require any preprocessing of the input data or a manual definition of inner structures. Since the presented method works on iso-surfaces, which are stored as polygonal datasets, it can also be applied to other types of polygonal models.",Jan Fischer;Dirk Bartz;Wolfgang Straßer,J. Fischer;D. Bartz;W. Strasser,"Visual Comput. for Medicine, Tubingen Univ., Germany;Visual Comput. for Medicine, Tubingen Univ., Germany",10.1109/VISUAL.2002.1183777;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2003.1250387;10.1109/VISUAL.2000.885723;10.1109/VISUAL.2004.48,"illustrative rendering, non-photorealistic rendering, transparency, indirect volume rendering, hatching, shading language",19,5,33,
VAST,2008,Visual evaluation of text features for document summarization and analysis,10.1109/VAST.2008.4677359,http://dx.doi.org/10.1109/VAST.2008.4677359,75,82,C,"Thanks to the Web-related and other advanced technologies, textual information is increasingly being stored in digital form and posted online. Automatic methods to analyze such textual information are becoming inevitable. Many of those methods are based on quantitative text features. Analysts face the challenge to choose the most appropriate features for their tasks. This requires effective approaches for evaluation and feature-engineering.",Daniela Oelke;Peter Bak;Daniel A. Keim;Mark Last;Guy Danon,Daniela Oelke;Peter Bak;Daniel A. Keim;Mark Last;Guy Danon,"University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;Ben-Gurion University of the Negev, Israel;Ben-Gurion University of the Negev, Israel",10.1109/VISUAL.1993.398863;10.1109/INFVIS.1995.528686;10.1109/VAST.2007.4389004,,19,10,27,
VAST,2008,Evaluating the relationship between user interaction and financial visual analysis,10.1109/VAST.2008.4677360,http://dx.doi.org/10.1109/VAST.2008.4677360,83,90,C,"It has been widely accepted that interactive visualization techniques enable users to more effectively form hypotheses and identify areas for more detailed investigation. There have been numerous empirical user studies testing the effectiveness of specific visual analytical tools. However, there has been limited effort in connecting a userpsilas interaction with his reasoning for the purpose of extracting the relationship between the two. In this paper, we present an approach for capturing and analyzing user interactions in a financial visual analytical tool and describe an exploratory user study that examines these interaction strategies. To achieve this goal, we created two visual tools to analyze raw interaction data captured during the user session. The results of this study demonstrate one possible strategy for understanding the relationship between interaction and reasoning both operationally and strategically.",Dong Hyun Jeong;Wenwen Dou;Heather Lipford;Felesia Stukes;Remco Chang;William Ribarsky,Dong Hyun Jeong;Wenwen Dou;Heather Richter Lipford;Felesia Stukes;Remco Chang;William Ribarsky,"UNC Charlotte, Viscenter, USA;UNC Charlotte, Viscenter, USA;UNC Charlotte, HCI Lab, USA;UNC Charlotte, HCI Lab, USA;UNC Charlotte, Viscenter, USA;UNC Charlotte, Viscenter, USA",10.1109/VAST.2007.4389009,,19,15,15,
Vis,2008,A Comparison of the Perceptual Benefits of Linear Perspective and Physically-Based Illumination for Display of Dense 3D Streamtubes,10.1109/TVCG.2008.108,http://dx.doi.org/10.1109/TVCG.2008.108,1723,1730,J,"Large datasets typically contain coarse features comprised of finer sub-features. Even if the shapes of the small structures are evident in a 3D display, the aggregate shapes they suggest may not be easily inferred. From previous studies in shape perception, the evidence has not been clear whether physically-based illumination confers any advantage over local illumination for understanding scenes that arise in visualization of large data sets that contain features at two distinct scales. In this paper we show that physically-based illumination can improve the perception for some static scenes of complex 3D geometry from flow fields. We perform human-subjects experiments to quantify the effect of physically-based illumination on participant performance for two tasks: selecting the closer of two streamtubes from a field of tubes, and identifying the shape of the domain of a flow field over different densities of tubes. We find that physically-based illumination influences participant performance as strongly as perspective projection, suggesting that physically-based illumination is indeed a strong cue to the layout of complex scenes. We also find that increasing the density of tubes for the shape identification task improved participant performance under physically-based illumination but not under the traditional hardware-accelerated illumination model.",Chris Weigle;David C. Banks,Chris Weigle;David Banks,"UT/ORNL Joint Institiute for Computational Sciences, Department of Electrical Engineering and Computer Science, University of Tennessee;UT/ORNL Joint Institiute for Computational Sciences, Department of Electrical Engineering and Computer Science, University of Tennessee",10.1109/TVCG.2006.197;10.1109/VISUAL.2003.1250395,"user study, volume completion, 3D shape perception, physically-based illumination, global illumination, local illumination, multi-scale visualization, flow visualization, streamtubes, DT-MRI, white matter tractography",19,12,28,
InfoVis,2009,Constructing Overview + Detail Dendrogram-Matrix Views,10.1109/TVCG.2009.130,http://dx.doi.org/10.1109/TVCG.2009.130,889,896,J,"A dendrogram that visualizes a clustering hierarchy is often integrated with a re-orderable matrix for pattern identification. The method is widely used in many research fields including biology, geography, statistics, and data mining. However, most dendrograms do not scale up well, particularly with respect to problems of graphical and cognitive information overload. This research proposes a strategy that links an overview dendrogram and a detail-view dendrogram, each integrated with a re-orderable matrix. The overview displays only a user-controlled, limited number of nodes that represent the ldquoskeletonrdquo of a hierarchy. The detail view displays the sub-tree represented by a selected meta-node in the overview. The research presented here focuses on constructing a concise overview dendrogram and its coordination with a detail view. The proposed method has the following benefits: dramatic alleviation of information overload, enhanced scalability and data abstraction quality on the dendrogram, and the support of data exploration at arbitrary levels of detail. The contribution of the paper includes a new metric to measure the ldquoimportancerdquo of nodes in a dendrogram; the method to construct the concise overview dendrogram from the dynamically-identified, important nodes; and measure for evaluating the data abstraction quality for dendrograms. We evaluate and compare the proposed method to some related existing methods, and demonstrating how the proposed method can help users find interesting patterns through a case study on county-level U.S. cervical cancer mortality and demographic data.",Jin Chen;Alan M. MacEachren;Donna Peuquet,Jin Chen;Alan M. MacEachren;Donna J. Peuquet,Pennsylvania State University;Pennsylvania State University;Pennsylvania State University,10.1109/TVCG.2006.161;10.1109/TVCG.2007.70535;10.1109/INFVIS.2004.46,"Dendrogram, reorderable matrix, compound graphs, data abstraction quality metrics, hierarchical clusters",19,12,28,
InfoVis,2009,Visual Analysis of Inter-Process Communication for Large-Scale Parallel Computing,10.1109/TVCG.2009.196,http://dx.doi.org/10.1109/TVCG.2009.196,1129,1136,J,"In serial computation, program profiling is often helpful for optimization of key sections of code. When moving to parallel computation, not only does the code execution need to be considered but also communication between the different processes which can induce delays that are detrimental to performance. As the number of processes increases, so does the impact of the communication delays on performance. For large-scale parallel applications, it is critical to understand how the communication impacts performance in order to make the code more efficient. There are several tools available for visualizing program execution and communications on parallel systems. These tools generally provide either views which statistically summarize the entire program execution or process-centric views. However, process-centric visualizations do not scale well as the number of processes gets very large. In particular, the most common representation of parallel processes is a Gantt chart with a row for each process. As the number of processes increases, these charts can become difficult to work with and can even exceed screen resolution. We propose a new visualization approach that affords more scalability and then demonstrate it on systems running with up to 16,384 processes.",Chris Muelder;François Gygi;Kwan-Liu Ma,Chris Muelder;Francois Gygi;Kwan-Liu Ma,"University of California, Davis;University of California, Davis;University of California, Davis",10.1109/INFVIS.2005.1532138;10.1109/INFVIS.2002.1173155;10.1109/INFVIS.2004.25,"Information Visualization, MPI Profiling, Scalability",19,15,33,
VAST,2009,SpRay: A visual analytics approach for gene expression data,10.1109/VAST.2009.5333911,http://dx.doi.org/10.1109/VAST.2009.5333911,179,186,C,"We present a new application, SpRay, designed for the visual exploration of gene expression data. It is based on an extension and adaption of parallel coordinates to support the visual exploration of large and high-dimensional datasets. In particular, we investigate the visual analysis of gene expression data as generated by micro-array experiments; We combine refined visual exploration with statistical methods to a visual analytics approach that proved to be particularly successful in this application domain. We will demonstrate the usefulness on several multidimensional gene expression datasets from different bioinformatics applications.",Janko Dietzsch;Julian Heinrich;Kay Nieselt;Dirk Bartz,Janko Dietzsch;Julian Heinrich;Kay Nieselt;Dirk Bartz,"ZBIT, University of Tübingen, Germany;VISUS, University of Stuttgart, Germany;ZBIT, University of Tübingen, Germany;ICCAS/VCM, Universität Leipzig, Germany",10.1109/VISUAL.2005.1532828;10.1109/INFVIS.2004.68;10.1109/VISUAL.2004.82;10.1109/TVCG.2006.138;10.1109/TVCG.2006.170;10.1109/INFVIS.2005.1532138,"Visual analytics, bioinformatics, gene expression experiments, microarray data, large-scale microarray",19,10,30,
VAST,2010,Two-stage framework for a topology-based projection and visualization of classified document collections,10.1109/VAST.2010.5652940,http://dx.doi.org/10.1109/VAST.2010.5652940,91,98,C,"During the last decades, electronic textual information has become the world's largest and most important information source. Daily newspapers, books, scientific and governmental publications, blogs and private messages have grown into a wellspring of endless information and knowledge. Since neither existing nor new information can be read in its entirety, we rely increasingly on computers to extract and visualize meaningful or interesting topics and documents from this huge information reservoir. In this paper, we extend, improve and combine existing individual approaches into an overall framework that supports topologi-cal analysis of high dimensional document point clouds given by the well-known tf-idf document-term weighting method. We show that traditional distance-based approaches fail in very high dimensional spaces, and we describe an improved two-stage method for topology-based projections from the original high dimensional information space to both two dimensional (2-D) and three dimensional (3-D) visualizations. To demonstrate the accuracy and usability of this framework, we compare it to methods introduced recently and apply it to complex document and patent collections.",Patrick Oesterling;Gerik Scheuermann;Sven Teresniak;Gerhard Heyer;Steffen Koch;Thomas Ertl;Gunther H. Weber,Patrick Oesterling;Gerik Scheuermann;Sven Teresniak;Gerhard Heyer;Steffen Koch;Thomas Ertl;Gunther H. Weber,University of Leipzig;University of Leipzig;University of Leipzig;University of Leipzig;University of Stuttgart;University of Stuttgart;Lawrence Berkeley National Laboratory,10.1109/VAST.2009.5333564;10.1109/TVCG.2007.70601;10.1109/VISUAL.1990.146402;10.1109/INFVIS.1995.528686;10.1109/VAST.2009.5332629;10.1109/TVCG.2009.119,,19,17,25,
Vis,2010,Interactive Separating Streak Surfaces,10.1109/TVCG.2010.169,http://dx.doi.org/10.1109/TVCG.2010.169,1569,1577,J,"Streak surfaces are among the most important features to support 3D unsteady flow exploration, but they are also among the computationally most demanding. Furthermore, to enable a feature driven analysis of the flow, one is mainly interested in streak surfaces that show separation profiles and thus detect unstable manifolds in the flow. The computation of such separation surfaces requires to place seeding structures at the separation locations and to let the structures move correspondingly to these locations in the unsteady flow. Since only little knowledge exists about the time evolution of separating streak surfaces, at this time, an automated exploration of 3D unsteady flows using such surfaces is not feasible. Therefore, in this paper we present an interactive approach for the visual analysis of separating streak surfaces. Our method draws upon recent work on the extraction of Lagrangian coherent structures (LCS) and the real-time visualization of streak surfaces on the GPU. We propose an interactive technique for computing ridges in the finite time Lyapunov exponent (FTLE) field at each time step, and we use these ridges as seeding structures to track streak surfaces in the time-varying flow. By showing separation surfaces in combination with particle trajectories, and by letting the user interactively change seeding parameters such as particle density and position, visually guided exploration of separation profiles in 3D is provided. To the best of our knowledge, this is the first time that the reconstruction and display of semantic separable surfaces in 3D unsteady flows can be performed interactively, giving rise to new possibilities for gaining insight into complex flow phenomena.",Florian Ferstl;Kai Bürger;Holger Theisel;Rüdiger Westermann,Florian Ferstl;Kai Burger;Holger Theisel;Rudiger Westermann,Technische Universität München;Technische Universität München;University of Magdeburg;Technische Universität München,10.1109/TVCG.2009.190;10.1109/TVCG.2007.70557;10.1109/VISUAL.1992.235211;10.1109/TVCG.2008.133;10.1109/VISUAL.2001.964506;10.1109/TVCG.2007.70554;10.1109/VISUAL.1993.398875;10.1109/TVCG.2009.177;10.1109/TVCG.2009.154;10.1109/TVCG.2006.151;10.1109/TVCG.2007.70551;10.1109/TVCG.2008.163;10.1109/VISUAL.2005.1532780,"Unsteady flow visualization, feature extraction, streak surface generation, GPUs",19,14,52,
VAST,2011,SAVE: Sensor anomaly visualization engine,10.1109/VAST.2011.6102458,http://dx.doi.org/10.1109/VAST.2011.6102458,201,210,C,"Diagnosing a large-scale sensor network is a crucial but challenging task. Particular challenges include the resource and bandwidth constraints on sensor nodes, the spatiotemporally dynamic network behaviors, and the lack of accurate models to understand such behaviors in a hostile environment. In this paper, we present the Sensor Anomaly Visualization Engine (SAVE), a system that fully leverages the power of both visualization and anomaly detection analytics to guide the user to quickly and accurately diagnose sensor network failures and faults. SAVE combines customized visualizations over separate sensor data facets as multiple coordinated views. Temporal expansion model, correlation graph and dynamic projection views are proposed to effectively interpret the topological, correlational and dimensional sensor data dynamics and their anomalies. Through a case study with real-world sensor network system and administrators, we demonstrate that SAVE is able to help better locate the system problem and further identify the root cause of major sensor network failure scenarios.",Lei Shi 0002;Qi Liao;Yuan He;Rui Li;Aaron Striegel;Zhong Su,Lei Shi;Qi Liao;Yuan He;Rui Li;Aaron Striegel;Zhong Su,"IBM Research - China;Computer Science and Engineering Department, University of Notre Dame, USA;Computer Science and Engineering Department, Hong Kong University of Science and Technology, HK;Computer Science and Technology Department, Xi'an Jiao Tong University, China;Computer Science and Engineering Department, University of Notre Dame, USA;IBM Research - China",10.1109/TVCG.2009.182;10.1109/VAST.2009.5333880;10.1109/INFVIS.2005.1532126;10.1109/INFVIS.2004.1;10.1109/VAST.2010.5652910,,19,18,30,
SciVis,2012,Effects of Stereo and Screen Size on the Legibility of Three-Dimensional Streamtube Visualization,10.1109/TVCG.2012.216,http://dx.doi.org/10.1109/TVCG.2012.216,2130,2139,J,"We report the impact of display characteristics (stereo and size) on task performance in diffusion magnetic resonance imaging (DMRI) in a user study with 12 participants. The hypotheses were that (1) adding stereo and increasing display size would improve task accuracy and reduce completion time, and (2) the greater the complexity of a spatial task, the greater the benefits of an improved display. Thus we expected to see greater performance gains when detailed visual reasoning was required. Participants used dense streamtube visualizations to perform five representative tasks: (1) determine the higher average fractional anisotropy (FA) values between two regions, (2) find the endpoints of fiber tracts, (3) name a bundle, (4) mark a brain lesion, and (5) judge if tracts belong to the same bundle. Contrary to our hypotheses, we found the task completion time was not improved by the use of the larger display and that performance accuracy was hurt rather than helped by the introduction of stereo in our study with dense DMRI data. Bigger was not always better. Thus cautious should be taken when selecting displays for scientific visualization applications. We explored the results further using the body-scale unit and subjective size and stereo experiences.",Jian Chen 0006;Haipeng Cai;Alexander P. Auchus;David H. Laidlaw,Jian Chen;Haipeng Cai;Alexander P. Auchus;David H. Laidlaw,University of Maryland Baltimore County;University of Southern Mississippi;University of Mississippi Medical Center;Brown University,10.1109/TVCG.2009.126;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2003.1250414;10.1109/TVCG.2009.111;10.1109/TVCG.2009.138;10.1109/TVCG.2006.183,"Display characteristics, diffusion tensor MRI, virtual environment",19,18,49,
VAST,2012,iLAMP: Exploring high-dimensional spacing through backward multidimensional projection,10.1109/VAST.2012.6400489,http://dx.doi.org/10.1109/VAST.2012.6400489,53,62,C,"Ever improving computing power and technological advances are greatly augmenting data collection and scientific observation. This has directly contributed to increased data complexity and dimensionality, motivating research of exploration techniques for multidimensional data. Consequently, a recent influx of work dedicated to techniques and tools that aid in understanding multidimensional datasets can be observed in many research fields, including biology, engineering, physics and scientific computing. While the effectiveness of existing techniques to analyze the structure and relationships of multidimensional data varies greatly, few techniques provide flexible mechanisms to simultaneously visualize and actively explore high-dimensional spaces. In this paper, we present an inverse linear affine multidimensional projection, coined iLAMP, that enables a novel interactive exploration technique for multidimensional data. iLAMP operates in reverse to traditional projection methods by mapping low-dimensional information into a high-dimensional space. This allows users to extrapolate instances of a multidimensional dataset while exploring a projection of the data to the planar domain. We present experimental results that validate iLAMP, measuring the quality and coherence of the extrapolated data; as well as demonstrate the utility of iLAMP to hypothesize the unexplored regions of a high-dimensional space.",Elisa Portes dos Santos;Emilio Vital Brazil;Joel Daniels II;Paulo Joia;Luis Gustavo Nonato;Mario Costa Sousa,Elisa Portes dos Santos Amorim;Emilio Vital Brazil;Joel Daniels;Paulo Joia;Luis Gustavo Nonato;Mario Costa Sousa,University of Calgary;University of Calgary;NYU Polytechnic Institute;University of Sao Paulo;University of Sao Paulo;University of Calgary,10.1109/INFVIS.2005.1532138;10.1109/TVCG.2008.116;10.1109/TVCG.2010.213;10.1109/TVCG.2009.140;10.1109/TVCG.2011.220;10.1109/VISUAL.1999.809866;10.1109/TVCG.2006.170;10.1109/INFVIS.2000.885086;10.1109/INFVIS.2004.15;10.1109/TVCG.2008.153;10.1109/INFVIS.2002.1173159;10.1109/INFVIS.2003.1249015;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1996.567787;10.1109/TVCG.2010.170;10.1109/TVCG.2007.70580;10.1109/TVCG.2010.207;10.1109/INFVIS.2002.1173161,,19,9,51,
VAST,2012,Reinventing the Contingency Wheel: Scalable Visual Analytics of Large Categorical Data,10.1109/TVCG.2012.254,http://dx.doi.org/10.1109/TVCG.2012.254,2849,2858,J,"Contingency tables summarize the relations between categorical variables and arise in both scientific and business domains. Asymmetrically large two-way contingency tables pose a problem for common visualization methods. The Contingency Wheel has been recently proposed as an interactive visual method to explore and analyze such tables. However, the scalability and readability of this method are limited when dealing with large and dense tables. In this paper we present Contingency Wheel++, new visual analytics methods that overcome these major shortcomings: (1) regarding automated methods, a measure of association based on Pearson's residuals alleviates the bias of the raw residuals originally used, (2) regarding visualization methods, a frequency-based abstraction of the visual elements eliminates overlapping and makes analyzing both positive and negative associations possible, and (3) regarding the interactive exploration environment, a multi-level overview+detail interface enables exploring individual data items that are aggregated in the visualization or in the table using coordinated views. We illustrate the applicability of these new methods with a use case and show how they enable discovering and analyzing nontrivial patterns and associations in large categorical data.",Bilal Alsallakh;Wolfgang Aigner;Silvia Miksch;M. Eduard Gröller,Bilal Alsallakh;Wolfgang Aigner;Silvia Miksch;M. Eduard Gröller,Vienna University of Technology;Vienna University of Technology;Vienna University of Technology;Vienna University of Technology,10.1109/INFVIS.2005.1532139;10.1109/VISUAL.2005.1532819;10.1109/INFVIS.2002.1173156;10.1109/INFVIS.2003.1249016;10.1109/INFVIS.2002.1173157,"Large categorical data, contingency table analysis, information interfaces and representation, visual analytics",19,15,42,HM
SciVis,2014,Conforming Morse-Smale Complexes,10.1109/TVCG.2014.2346434,http://dx.doi.org/10.1109/TVCG.2014.2346434,2595,2603,J,"Morse-Smale (MS) complexes have been gaining popularity as a tool for feature-driven data analysis and visualization. However, the quality of their geometric embedding and the sole dependence on the input scalar field data can limit their applicability when expressing application-dependent features. In this paper we introduce a new combinatorial technique to compute an MS complex that conforms to both an input scalar field and an additional, prior segmentation of the domain. The segmentation constrains the MS complex computation guaranteeing that boundaries in the segmentation are captured as separatrices of the MS complex. We demonstrate the utility and versatility of our approach with two applications. First, we use streamline integration to determine numerically computed basins/mountains and use the resulting segmentation as an input to our algorithm. This strategy enables the incorporation of prior flow path knowledge, effectively resulting in an MS complex that is as geometrically accurate as the employed numerical integration. Our second use case is motivated by the observation that often the data itself does not explicitly contain features known to be present by a domain expert. We introduce edit operations for MS complexes so that a user can directly modify their features while maintaining all the advantages of a robust topology-based representation.",Attila Gyulassy;David Günther;Joshua A. Levine;Julien Tierny;Valerio Pascucci,Attila Gyulassy;David Günther;Joshua A. Levine;Julien Tierny;Valerio Pascucci,"SCI Institute;Institut Mines-Télécom, Télécom ParisTech, CNRS LTCI, Paris, France;School of Computing, Visual Computing Division, Clemson University, Clemson, SC, USA;Institut Mines-Télécom, Télécom ParisTech, CNRS LTCI, Paris, France;SCI Institute, University of Utah",10.1109/TVCG.2011.249;10.1109/TVCG.2008.110;10.1109/TVCG.2007.70603;10.1109/TVCG.2006.186;10.1109/TVCG.2012.228;10.1109/TVCG.2012.209;10.1109/VISUAL.2005.1532839,"Computational Topology, Morse-Smale Complex, Data Analysis",19,15,52,
VAST,2014,Interactive Visual Analysis of Image-Centric Cohort Study Data,10.1109/TVCG.2014.2346591,http://dx.doi.org/10.1109/TVCG.2014.2346591,1673,1682,J,"Epidemiological population studies impose information about a set of subjects (a cohort) to characterize disease-specific risk factors. Cohort studies comprise heterogenous variables describing the medical condition as well as demographic and lifestyle factors and, more recently, medical image data. We propose an Interactive Visual Analysis (IVA) approach that enables epidemiologists to rapidly investigate the entire data pool for hypothesis validation and generation. We incorporate image data, which involves shape-based object detection and the derivation of attributes describing the object shape. The concurrent investigation of image-based and non-image data is realized in a web-based multiple coordinated view system, comprising standard views from information visualization and epidemiological data representations such as pivot tables. The views are equipped with brushing facilities and augmented by 3D shape renderings of the segmented objects, e.g., each bar in a histogram is overlaid with a mean shape of the associated subgroup of the cohort. We integrate an overview visualization, clustering of variables and object shape for data-driven subgroup definition and statistical key figures for measuring the association between variables. We demonstrate the IVA approach by validating and generating hypotheses related to lower back pain as part of a qualitative evaluation.",Paul Klemm;Steffen Oeltze-Jafra;Kai Lawonn;Katrin Hegenscheid;Henry Völzke;Bernhard Preim,Paul Klemm;Steffen Oeltze-Jafra;Kai Lawonn;Katrin Hegenscheid;Henry Völzke;Bernhard Preim,"Otto-von-Guericke University Magdeburg, Germany;Otto-von-Guericke University Magdeburg, Germany;Otto-von-Guericke University Magdeburg, Germany;Ernst-Moritz-Arndt University Greifswald, Germany;Ernst-Moritz-Arndt University Greifswald, Germany;Otto-von-Guericke University Magdeburg, Germany",10.1109/TVCG.2013.160;10.1109/TVCG.2011.185;10.1109/VISUAL.2000.885739;10.1109/TVCG.2011.217;10.1109/TVCG.2007.70569,"Interactive Visual Analysis, Epidemiology, Spine",19,23,44,
InfoVis,2015,AmbiguityVis: Visualization of Ambiguity in Graph Layouts,10.1109/TVCG.2015.2467691,http://dx.doi.org/10.1109/TVCG.2015.2467691,359,368,J,"Node-link diagrams provide an intuitive way to explore networks and have inspired a large number of automated graph layout strategies that optimize aesthetic criteria. However, any particular drawing approach cannot fully satisfy all these criteria simultaneously, producing drawings with visual ambiguities that can impede the understanding of network structure. To bring attention to these potentially problematic areas present in the drawing, this paper presents a technique that highlights common types of visual ambiguities: ambiguous spatial relationships between nodes and edges, visual overlap between community structures, and ambiguity in edge bundling and metanodes. Metrics, including newly proposed metrics for abnormal edge lengths, visual overlap in community structures and node/edge aggregation, are proposed to quantify areas of ambiguity in the drawing. These metrics and others are then displayed using a heatmap-based visualization that provides visual feedback to developers of graph drawing and visualization approaches, allowing them to quickly identify misleading areas. The novel metrics and the heatmap-based visualization allow a user to explore ambiguities in graph layouts from multiple perspectives in order to make reasonable graph layout choices. The effectiveness of the technique is demonstrated through case studies and expert reviews.",Yong Wang 0021;Qiaomu Shen;Daniel Archambault;Zhiguang Zhou;Min Zhu;Sixiao Yang;Huamin Qu,Yong Wang;Qiaomu Shen;Daniel Archambault;Zhiguang Zhou;Min Zhu;Sixiao Yang;Huamin Qu,Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Swansea University;Zhejiang University of Finance and Economics;Sichuan University;Huawei Co. Ltd.;Hong Kong University of Science and Technology,10.1109/TVCG.2006.120;10.1109/TVCG.2006.147;10.1109/TVCG.2012.245;10.1109/VAST.2009.5332628;10.1109/TVCG.2008.155;10.1109/TVCG.2012.189,"Visual Ambiguity, Visualization, Node-link diagram, Graph layout, Graph visualization",19,28,56,
SciVis,2015,Cluster Analysis of Vortical Flow in Simulations of Cerebral Aneurysm Hemodynamics,10.1109/TVCG.2015.2467203,http://dx.doi.org/10.1109/TVCG.2015.2467203,757,766,J,"Computational fluid dynamic (CFD) simulations of blood flow provide new insights into the hemodynamics of vascular pathologies such as cerebral aneurysms. Understanding the relations between hemodynamics and aneurysm initiation, progression, and risk of rupture is crucial in diagnosis and treatment. Recent studies link the existence of vortices in the blood flow pattern to aneurysm rupture and report observations of embedded vortices - a larger vortex encloses a smaller one flowing in the opposite direction - whose implications are unclear. We present a clustering-based approach for the visual analysis of vortical flow in simulated cerebral aneurysm hemodynamics. We show how embedded vortices develop at saddle-node bifurcations on vortex core lines and convey the participating flow at full manifestation of the vortex by a fast and smart grouping of streamlines and the visualization of group representatives. The grouping result may be refined based on spectral clustering generating a more detailed visualization of the flow pattern, especially further off the core lines. We aim at supporting CFD engineers researching the biological implications of embedded vortices.",Steffen Oeltze-Jafra;Juan R. Cebral;Gábor Janiga;Bernhard Preim,Steffen Oeltze-Jafra;Juan R. Cebral;Gábor Janiga;Bernhard Preim,"Department of Simulation and Graphics, University of Magdeburg, Germany;Center for Computational Fluid Dynamics, George Mason University, Fairfax, Virginia, USA;Institute of Fluid Dynamics and Thermodynamics, Germany;Department of Simulation and Graphics, University of Magdeburg, Germany",10.1109/TVCG.2009.138;10.1109/TVCG.2012.202;10.1109/TVCG.2014.2346406;10.1109/TVCG.2006.201;10.1109/VISUAL.2002.1183789;10.1109/TVCG.2013.189;10.1109/VISUAL.2004.59;10.1109/TVCG.2006.199;10.1109/VISUAL.2005.1532830;10.1109/VISUAL.2005.1532859,"Blood Flow, Aneurysm, Clustering, Vortex Dynamics, Embedded Vortices",19,21,51,
InfoVis,2016,Iterating between Tools to Create and Edit Visualizations,10.1109/TVCG.2016.2598609,http://dx.doi.org/10.1109/TVCG.2016.2598609,481,490,J,"A common workflow for visualization designers begins with a generative tool, like D3 or Processing, to create the initial visualization; and proceeds to a drawing tool, like Adobe Illustrator or Inkscape, for editing and cleaning. Unfortunately, this is typically a one-way process: once a visualization is exported from the generative tool into a drawing tool, it is difficult to make further, data-driven changes. In this paper, we propose a bridge model to allow designers to bring their work back from the drawing tool to re-edit in the generative tool. Our key insight is to recast this iteration challenge as a merge problem - similar to when two people are editing a document and changes between them need to reconciled. We also present a specific instantiation of this model, a tool called Hanpuku, which bridges between D3 scripts and Illustrator. We show several examples of visualizations that are iteratively created using Hanpuku in order to illustrate the flexibility of the approach. We further describe several hypothetical tools that bridge between other visualization tools to emphasize the generality of the model.",Alex Bigelow;Steven Mark Drucker;Danyel Fisher;Miriah D. Meyer,Alex Bigelow;Steven Drucker;Danyel Fisher;Miriah Meyer,University of Utah;Microsoft Research;Microsoft Research;University of Utah,10.1109/TVCG.2014.2346292;10.1109/TVCG.2015.2467191;10.1109/TVCG.2014.2346291;10.1109/TVCG.2015.2467091;10.1109/INFVIS.2004.12;10.1109/TVCG.2011.209;10.1109/TVCG.2007.70584;10.1109/TVCG.2011.185,illustration;Visualization;iteration,19,17,32,
InfoVis,2016,HindSight: Encouraging Exploration through Direct Encoding of Personal Interaction History,10.1109/TVCG.2016.2599058,http://dx.doi.org/10.1109/TVCG.2016.2599058,351,360,J,"Physical and digital objects often leave markers of our use. Website links turn purple after we visit them, for example, showing us information we have yet to explore. These “footprints” of interaction offer substantial benefits in information saturated environments - they enable us to easily revisit old information, systematically explore new information, and quickly resume tasks after interruption. While applying these design principles have been successful in HCI contexts, direct encodings of personal interaction history have received scarce attention in data visualization. One reason is that there is little guidance for integrating history into visualizations where many visual channels are already occupied by data. More importantly, there is not firm evidence that making users aware of their interaction history results in benefits with regards to exploration or insights. Following these observations, we propose HindSight - an umbrella term for the design space of representing interaction history directly in existing data visualizations. In this paper, we examine the value of HindSight principles by augmenting existing visualizations with visual indicators of user interaction history (e.g. How the Recession Shaped the Economy in 255 Charts, NYTimes). In controlled experiments of over 400 participants, we found that HindSight designs generally encouraged people to visit more data and recall different insights after interaction. The results of our experiments suggest that simple additions to visualizations can make users aware of their interaction history, and that these additions significantly impact users' exploration and insights.",Mi Feng;Cheng Deng;Evan M. Peck;Lane Harrison,Mi Feng;Cheng Deng;Evan M. Peck;Lane Harrison,Worcester Polytechnic Institute;Worcester Polytechnic Institute;Bucknell University;Worcester Polytechnic Institute,10.1109/VISUAL.2002.1183791;10.1109/VISUAL.2005.1532788;10.1109/TVCG.2014.2346452;10.1109/TVCG.2008.137;10.1109/TVCG.2014.2346424;10.1109/TVCG.2007.70589;10.1109/TVCG.2008.109,History;Visualization;Interaction,19,13,36,
InfoVis,2017,"Scatterplots: Tasks, Data, and Designs",10.1109/TVCG.2017.2744184,http://dx.doi.org/10.1109/TVCG.2017.2744184,402,412,J,"Traditional scatterplots fail to scale as the complexity and amount of data increases. In response, there exist many design options that modify or expand the traditional scatterplot design to meet these larger scales. This breadth of design options creates challenges for designers and practitioners who must select appropriate designs for particular analysis goals. In this paper, we help designers in making design choices for scatterplot visualizations. We survey the literature to catalog scatterplot-specific analysis tasks. We look at how data characteristics influence design decisions. We then survey scatterplot-like designs to understand the range of design options. Building upon these three organizations, we connect data characteristics, analysis tasks, and design choices in order to generate challenges, open questions, and example best practices for the effective design of scatterplots.",Alper Sarikaya;Michael Gleicher,Alper Sarikaya;Michael Gleicher,University of Wisconsin&#x2014;Madison;University of Wisconsin&#x2014;Madison,10.1109/TVCG.2015.2467618;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2008.119;10.1109/TVCG.2011.229;10.1109/TVCG.2011.185;10.1109/TVCG.2013.124;10.1109/VAST.2012.6400486;10.1109/VAST.2010.5652460;10.1109/TVCG.2014.2346594;10.1109/TVCG.2009.122;10.1109/TVCG.2006.161;10.1109/TVCG.2007.70535;10.1109/INFVIS.2002.1173156;10.1109/TVCG.2013.187;10.1109/TVCG.2013.183;10.1109/TVCG.2014.2346983;10.1109/TVCG.2006.163;10.1109/VAST.2016.7883507;10.1109/TVCG.2011.223;10.1109/TVCG.2015.2467615;10.1109/VAST.2009.5333895;10.1109/TVCG.2013.182;10.1109/TVCG.2013.130;10.1109/TVCG.2016.2598839;10.1109/TVCG.2013.120;10.1109/TVCG.2013.153;10.1109/TVCG.2011.167;10.1109/TVCG.2007.70596;10.1109/TVCG.2010.197;10.1109/INFVIS.2005.1532142;10.1109/TVCG.2013.150;10.1109/TVCG.2010.174,"Scatterplots,task taxonomies,study of designs",19,17,76,
SciVis,2017,A Virtual Reality Visualization Tool for Neuron Tracing,10.1109/TVCG.2017.2744079,http://dx.doi.org/10.1109/TVCG.2017.2744079,994,1003,J,"Tracing neurons in large-scale microscopy data is crucial to establishing a wiring diagram of the brain, which is needed to understand how neural circuits in the brain process information and generate behavior. Automatic techniques often fail for large and complex datasets, and connectomics researchers may spend weeks or months manually tracing neurons using 2D image stacks. We present a design study of a new virtual reality (VR) system, developed in collaboration with trained neuroanatomists, to trace neurons in microscope scans of the visual cortex of primates. We hypothesize that using consumer-grade VR technology to interact with neurons directly in 3D will help neuroscientists better resolve complex cases and enable them to trace neurons faster and with less physical and mental strain. We discuss both the design process and technical challenges in developing an interactive system to navigate and manipulate terabyte-sized image volumes in VR. Using a number of different datasets, we demonstrate that, compared to widely used commercial software, consumer-grade VR presents a promising alternative for scientists.",William Usher;Pavol Klacansky;Frederick Federer;Peer-Timo Bremer;Aaron Knoll;Jeff Yarch;Alessandra Angelucci;Valerio Pascucci,Will Usher;Pavol Klacansky;Frederick Federer;Peer-Timo Bremer;Aaron Knoll;Jeff Yarch;Alessandra Angelucci;Valerio Pascucci,"SCI Institute, University of Utah, USA;SCI Institute, University of Utah, USA;Moran Eye Institute, University of Utah, USA;Lawrence Livermore National Laboratory, USA;SCI Institute, University of Utah, USA;Moran Eye Institute, University of Utah, USA;Moran Eye Institute, University of Utah, USA;SCI Institute, University of Utah, USA",10.1109/TVCG.2009.204;10.1109/TVCG.2012.213,"Virtual reality,interaction design,design studies",19,13,47,
Vis,1992,Optimizing triangulations by curvature equalization,10.1109/VISUAL.1992.235191,http://dx.doi.org/10.1109/VISUAL.1992.235191,333,339,C,"An algorithm that attempts to improve a triangulation by shifting the vertices so that curvature within the triangles is nearly equal is presented. Unnecessary triangles are removed. The method is an effective way of guaranteeing that the triangle vertices are points of higher curvature, and that the triangle edges correspond to distinctive edges on the surfaces. Triangulations of surfaces with constant curvature-and hence no distinctive features-will gain nothing from this or any other optimization algorithm. As demonstrated by the results, the techinque of moving triangle vertices can improve some triangulation models. Greatest improvements occur with surfaces characterized by sharp edges, such as the pyramid and ridge models. Less improvement occurs on models that already approximate the surface topology and/or have less distinctive features.&lt;&lt;ETX&gt;&gt;",Lori L. Scarlatos;Theodosios Pavlidis,L.L. Scarlatos;T. Pavlidis,"Grumman Data Systems, Woodbury, NY, USA",,,18,7,14,
Vis,1992,Automated design of virtual worlds for visualizing multivariate relations,10.1109/VISUAL.1992.235197,http://dx.doi.org/10.1109/VISUAL.1992.235197,283,290,C,"Interactive visualization systems provide a powerful means to explore complex data, especially when coupled with 3-D interaction and display devices to produce virtual worlds. While designing a quality static 2-D visualization is already a difficult task for most users, designing an interactive 3-D one is even more challenging. To address this problem, AutoVisual, a research system that designs interactive virtual worlds for visualizing and exploring multivariate relations of arbitrary arity, is being developed. AutoVisual uses worlds within worlds, an interactive visualization technique that exploits nested, heterogeneous coordinate systems to map multiple variables onto each spatial dimension. AutoVisual's designs are guided by user-specified visualization tasks, and by a catalog of design principles encoded using a rule-based language.&lt;&lt;ETX&gt;&gt;",Clifford Beshers;Steven K. Feiner,C. Beshers;S. Feiner,"Dept. of Comput. Sci., Columbia Univ., New York, NY, USA;Dept. of Comput. Sci., Columbia Univ., New York, NY, USA",10.1109/VISUAL.1991.175819,,18,9,11,
Vis,1992,Visualizing code profiling line oriented statistics,10.1109/VISUAL.1992.235206,http://dx.doi.org/10.1109/VISUAL.1992.235206,210,217,C,"A visualization technique that makes it possible to display and analyze line count profile data is described. The technique is to make a reduced picture of code with the line execution counts identified with color. Hot spots are shown in red, warm spots in orange, and so on. It is possible to identify nonexecuted code and nonexecutable code such as declarations and static tables.&lt;&lt;ETX&gt;&gt;",Stephen G. Eick;Joseph L. Steffen,S.G. Eick;J.L. Steffen,"AT&T Bell Lab., Murray Hill, NJ, USA;AT&T Bell Lab., Murray Hill, NJ, USA",,,18,6,13,
Vis,1993,Geometric clipping using Boolean textures,10.1109/VISUAL.1993.398878,http://dx.doi.org/10.1109/VISUAL.1993.398878,268,274,C,"Texture mapping is normally used to convey geometric detail without adding geometric complexity. This paper introduces Boolean textures, a texture mapping technique that uses implicit functions to generate texture maps and texture coordinates. These Boolean textures perform clipping during a renderer's scan conversion step. Any implicit function is a candidate Boolean texture clipper. The paper describes how to use quadrics as clippers. Applications from engineering and medicine illustrate the effectiveness of texture as a clipping tool.&lt;&lt;ETX&gt;&gt;",William E. Lorenson,W.E. Lorensen,"General Electric Corp., Schenectady, NY, USA",10.1109/VISUAL.1992.235205;10.1109/VISUAL.1992.235204,,18,5,20,BP
Vis,1994,Visualizing flow with quaternion frames,10.1109/VISUAL.1994.346330,http://dx.doi.org/10.1109/VISUAL.1994.346330,108,"115, C11",C,"Flow fields, geodesics, and deformed volumes are natural sources of families of space curves that can be characterized by intrinsic geometric properties such as curvature, torsion, and Frenet frames. By expressing a curve's moving Frenet coordinate frame as an equivalent unit quaternion, we reduce the number of components that must be displayed from nine with six constraints to four with one constraint. We can then assign a color to each curve point by dotting its quaternion frame with a 4D light vector, or we can plot the frame values separately as a curve in the three-sphere. As examples, we examine twisted volumes used in topology to construct knots and tangles, a spherical volume deformation known as the Dirac string trick, and streamlines of 3D vector flow fields.&lt;&lt;ETX&gt;&gt;",Andrew J. Hanson;Hui Ma,A.J. Hanson;Hui Ma,"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA;Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA",10.1109/VISUAL.1993.398869;10.1109/VISUAL.1994.346324;10.1109/VISUAL.1992.235211,,18,9,15,
Vis,1997,Singularities in nonuniform tensor fields,10.1109/VISUAL.1997.663857,http://dx.doi.org/10.1109/VISUAL.1997.663857,59,66,C,"Studies the topology of 2nd-order symmetric tensor fields. Degenerate points are basic constituents of tensor fields. From the set of degenerate points, an experienced researcher can reconstruct a whole tensor field. We address the conditions for the existence of degenerate points and, based on these conditions, we predict the distribution of degenerate points inside the field. Every tensor can be decomposed into a deviator and an isotropic tensor. A deviator determines the properties of a tensor field, while the isotropic part provides a uniform bias. Deviators can be 3D or locally 2D. The triple-degenerate points of a tensor field are associated with the singular points of its deviator and the double-degenerate points of a tensor field have singular local 2D deviators. This provides insights into the similarity of topological structure between 1st-order (or vectors) and 2nd-order tensors. Control functions are in charge of the occurrences of a singularity of a deviator. These singularities can further be linked to important physical properties of the underlying physical phenomena. For a deformation tensor in a stationary flow, the singularities of its deviator actually represent the area of the vortex core in the field; for a stress tensor, the singularities represent the area with no stress; for a Newtonian flow, compressible flow and incompressible flow as well as stress and deformation tensors share similar topological features due to the similarity of their deviators; for a viscous flow, removing the large, isotropic pressure contribution dramatically enhances the anisotropy due to viscosity.",Yingmei Lavin;Yuval Levy;Lambertus Hesselink,Yingmei Lavin;Y. Levy;L. Hesselink,"Dept. of Phys., Stanford Univ., CA, USA",10.1109/VISUAL.1992.235193,,18,5,12,
Vis,1997,GADGET: goal-oriented application design guidance for modular visualization environments,10.1109/VISUAL.1997.663889,http://dx.doi.org/10.1109/VISUAL.1997.663889,245,252,C,"Modular visualization environments (MVEs) have recently been regarded as the de facto standard for scientific data visualization, mainly due to adoption of the visual programming style, reusability, and extendability. However, since scientists and engineers as the MVE principal user are not always familiar with how to map numerical data to proper graphical primitives, the set of built-in modules is not fully used to construct necessary application networks. Therefore, a certain mechanism needs to be incorporated into MVEs, which makes use of heuristics and expertise of visualization specialists (visineers), and which supports the user in designing his/her applications with MVEs. The Wehrend's goal-oriented taxonomy of visualization techniques is adopted as the basic philosophy to develop a system, called GADGET, for application design guidance for MVEs. The GADGET system interactively helps the user design appropriate applications according to the specific visualization goals, temporal efficiency versus accuracy requirements, and such properties as dimension and mesh type of a given target dataset. Also the GADGET system is capable of assisting the user in customizing a prototype modular network for his/her desired applications by showing execution examples involving datasets of the same type. The paper provides an overview of the GADGET guidance mechanism and system architecture, with an emphasis on its knowledge base design. Sample data visualization problems are used to demonstrate the usefulness of the GADGET system.",Issei Fujishiro;Yuriko Takeshima;Yoshihiko Ichikawa;Kyoko Nakamura,I. Fujishiro;Y. Takeshima;Y. Ichikawa;K. Nakamura,"Dept. of Inf. Sci., Ochanomizu Univ., Tokyo, Japan",10.1109/VISUAL.1990.146375;10.1109/VISUAL.1993.398857;10.1109/INFVIS.1996.559210,"visualization systems, Modular Visualization Environments (MVEs), dataflow paradigm, visineers' heuristics and expertise, taxonomy of visualization techniques, knowledge base, object-oriented design",18,4,32,
Vis,2000,Uniform frequency images: adding geometry to images to produce space-efficient textures,10.1109/VISUAL.2000.885701,http://dx.doi.org/10.1109/VISUAL.2000.885701,243,250,C,"Discusses the concept of uniform frequency images, which exhibit uniform local frequency properties. Such images make optimal use of space when sampled close to their Nyquist limit. A warping function may be applied to an arbitrary image to redistribute its local frequency content, reducing its highest frequencies and increasing its lowest frequencies in order to approach this uniform frequency ideal. The warped image may then be downsampled according to its new, reduced Nyquist limit, thereby reducing its storage requirements. To reconstruct the original image, the inverse warp is applied. We present a general, top-down algorithm to automatically generate a piecewise-linear warping function with this frequency balancing property for a given input image. The image size is reduced by applying the warp and then downsampling. We store this warped, downsampled image plus a small number of polygons with texture coordinates to describe the inverse warp. The original image is later reconstructed by rendering the associated polygons with the warped image applied as a texture map, a process which is easily accelerated by current graphics hardware. As compared to previous image compression techniques, we generate a similar graceful space-quality tradeoff with the advantage of being able to ""uncompress"" images during rendering. We report results for several images with sizes ranging from 15,000 to 300,000 pixels, achieving reduction rates of 70-90% with improved quality over downsampling alone.",Adam Hunter;Jonathan D. Cohen 0001,A. Hunter;J.D. Cohen,"Johns Hopkins Univ., MD, USA",,"texture mapping, Fourier analysis, sampling, parameterization, visualization",18,4,19,
Vis,2000,Multi-resolution visualization techniques for nested weather models,10.1109/VISUAL.2000.885745,http://dx.doi.org/10.1109/VISUAL.2000.885745,513,516,C,"Scaling of simulations challenges the effectiveness of conventional visualization methods. This problem becomes two-fold for mesoscale weather models that operate in near-real-time at cloud-scale resolution. For example, typical approaches to vector field visualization (e.g., wind) are based upon global methods, which may not illustrate detailed structure. In addition, such computations employ multi-resolution meshes to capture small-scale phenomena, which are not properly reflected in both vector and scalar realizations. To address the former critical point analysis and simple bandpass filtering of wind fields is employed for better seed point identification of streamline calculations. For the latter, an encapsulation of nested computational meshes is developed for general realization. It is then combined with the seed point calculation for an improved vector visualization of multi-resolution weather forecasting data.",Lloyd Treinish,L.A. Treinish,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.1999.809918;10.1109/VISUAL.1990.146359;10.1109/VISUAL.1995.480821;10.1109/VISUAL.1999.809897,"flow visualization, multi-resolution,visualization design, meteorology, weather forecasting",18,11,10,
InfoVis,2003,Coordinated graph and scatter-plot views for the visual exploration of microarray time-series data,10.1109/INFVIS.2003.1249023,http://dx.doi.org/10.1109/INFVIS.2003.1249023,173,180,C,"Microarrays are relatively new, high-throughput data acquisition technology for investigating biological phenomena at the micro-level. One of the more common procedures for microarray experimentation is that of the microarray time-course experiment. The product of microarray time-course experiment is time-series data, which subject to proper analysis has the potential to have significant impact on the diagnosis, treatment, and prevention of diseases. While existing information visualization techniques go some way to making microarray time-series data more manageable, requirements analysis has revealed significant limitations. The main finding was that users were unable to uncover and quantify common changes in value over a specified time-period. This paper describes a novel technique that provides this functionality by allowing the user to visually formulate and modify measurable queries with separate time-period and condition components. These visual queries are supported by the combination of a traditional value against time graph representation of the data with a complementary scatter-plot representation of a specified time-period. The multiple views of the visualization are coordinated so that the user can formulate and modify queries with rapid reversible display of query results in the traditional value against time graph format.",Paul Craig;Jessie Kennedy,P. Craig;J. Kennedy,"Sch. of Comput., Napier Univ., Edinburgh, UK;Sch. of Comput., Napier Univ., Edinburgh, UK",10.1109/INFVIS.2002.1173157,"Bioinformatics, Microarrays, Information Visualization, Time-Series, Multiple-views",18,11,22,
InfoVis,2004,WilmaScope Graph Visualisation,10.1109/INFVIS.2004.77,http://dx.doi.org/10.1109/INFVIS.2004.77,r4,r4,M,"Our visualisation of the IEEE InfoVis citation network is based on 3D graph visualisation techniques. To make effective use of the third dimension we use a layered approach, constraining nodes to lie on parallel planes depending on parameters such as year of publication or link degree. Within the parallel planes nodes are arranged using a fast force-directed layout method. A number of clusters representing different research areas were identified using a self organising map approach.",Adel Ahmed;Tim Dwyer;Colin Murray;Le Song;Ying Xin Wu,A. Ahmed;T. Dwyer;C. Murray;Le Song;Ying Xin Wu,University of Sydney,,,18,5,7,
Vis,2004,Efficient point-based isosurface exploration using the span-triangle,10.1109/VISUAL.2004.29,http://dx.doi.org/10.1109/VISUAL.2004.29,441,448,C,"We introduce a novel span-triangle data structure, based on the span-space representation for isosurfaces. It stores all necessary cell information for dynamic manipulation of the isovalue in an efficient way. We have found that using our data structure in combination with point-based techniques, implemented on graphics hardware, effects in real-time rendering and exploration. Our extraction algorithm utilizes an incremental and progressive update scheme, enabling smooth interaction without significant latency. Moreover, the corresponding visualization pipeline is capable of processing large data sets by utilizing all three levels of memory: disk, system and graphics. We address practical usability in actual medical applications, achieving a new level of interactivity.",Bartosz von Rymon-Lipinski;Nils Hanssen;Thomas Jansen 0005;Lutz Ritter;Erwin Keeve,B. von Rymon-Lipinski;N. Hanssen;T. Jansen;L. Ritter;E. Keeve,,10.1109/VISUAL.1991.175780;10.1109/VISUAL.2001.964489;10.1109/VISUAL.1996.568121;10.1109/VISUAL.1995.480806,"Point-Based Visualization, Isosurfaces, Hardware Acceleration, Large Data Set Visualization, Visualization in Medicine",18,5,26,
Vis,2004,Hierarchy Based 3D Visualization of Large Software Structures,10.1109/VISUAL.2004.39,http://dx.doi.org/10.1109/VISUAL.2004.39,4,4,M,Modern object-oriented programs are hierarchical systems with many thousands of interrelated subsystems. Visualization helps developers to better comprehend these large and complex systems. This work presents a three-dimensional visualization technique that represents the static structure of object-oriented software using distributions of three-dimensional objects on a two-dimensional plane. The visual complexity is reduced by adjusting the transparency of object surfaces to the distance of the viewpoint. An approach called Hierarchical Net is proposed for a clear representation of the relationships between the subsystems.,Michael Balzer;Oliver Deussen,M. Balzer;O. Deussen,University of Konstanz,,,18,9,8,
Vis,2004,Radial hermite operators for scattered point cloud data with normal vectors and applications to implicitizing polygon mesh surfaces for generalized CSG operations and smoothing,10.1109/VISUAL.2004.87,http://dx.doi.org/10.1109/VISUAL.2004.87,203,210,C,"We describe a new technique for fitting scattered point cloud data. Given a scattered point cloud of 3D data points and associated normal vectors, our new method produces an implicit volume model whose zero level isosurface interpolates the given points and associated normal vectors. We concentrate on certain application of these new volume modeling techniques. We take existing polygon mesh surfaces and use the present methods to construct implicit volume models for these surfaces. Implicit models allow for the application of Boolean operations on these surfaces through the techniques of constructive solid geometry. Also, standard wavelet and filter operators can be applied to the implicit volume model leading to effective smoothing and filtering algorithms, which are simple to implement.",Gregory M. Nielson,G.M. Nielson,"Arizona State Univ., AZ, USA",10.1109/VISUAL.2002.1183766;10.1109/VISUAL.2003.1250358;10.1109/VISUAL.2004.28;10.1109/VISUAL.2002.1183782;10.1109/VISUAL.1996.567602;10.1109/VISUAL.2002.1183808;10.1109/VISUAL.2003.1250398;10.1109/VISUAL.2003.1250359,"Surface reconstruction, point clouds, isosurfaces, polygon mesh",18,8,34,
InfoVis,2005,Visualizing coordination in situ,10.1109/INFVIS.2005.1532143,http://dx.doi.org/10.1109/INFVIS.2005.1532143,165,172,C,"Exploratory visualization environments allow users to build and browse coordinated multiview visualizations interactively. As the number of views and amount of coordination increases, conceptualizing coordination structure becomes more and more important for successful data exploration. Integrated metavisualization is exploratory visualization of coordination and other interactive structure directly inside a visualization's own user interface. This paper presents a model of integrated metavisualization, describes the problem of capturing dynamic interface structure as visualizable data, and outlines three general approaches to integration. Metavisualization has been implemented in improvise, using views, lenses, and embedding to reveal the dynamic structure of its own highly coordinated visualizations.",Chris Weaver,C. Weaver,"Comput. Sci. Dept., Univ. of Wisconsin-Madison, Madison, WI, USA",10.1109/INFVIS.2002.1173141;10.1109/INFVIS.2004.12;10.1109/INFVIS.2004.64;10.1109/INFVIS.1996.559213;10.1109/INFVIS.1997.636792;10.1109/INFVIS.2002.1173142;10.1109/INFVIS.2000.885092;10.1109/INFVIS.2002.1173163,"coordination, exploratory visualization, linked views, software visualization, metavisualization",18,9,32,
Vis,2005,VolQD: direct volume rendering of multi-million atom quantum dot simulations,10.1109/VISUAL.2005.1532811,http://dx.doi.org/10.1109/VISUAL.2005.1532811,319,326,C,"In this work we present a hardware-accelerated direct volume rendering system for visualizing multivariate wave functions in semiconducting quantum dot (QD) simulations. The simulation data contains the probability density values of multiple electron orbitals for up to tens of millions of atoms, computed by the NEMO3-D quantum device simulator software run on large-scale cluster architectures. These atoms form two interpenetrating crystalline face centered cubic lattices (FCC), where each FCC cell comprises the eight corners of a cubic cell and six additional face centers. We have developed compact representation techniques for the FCC lattice within PC graphics hardware texture memory, hardware-accelerated linear and cubic reconstruction schemes, and new multi-field rendering techniques utilizing logarithmic scale transfer functions. Our system also enables the user to drill down through the simulation data and execute statistical queries using general-purpose computing on the GPU (GPGPU).",Wei Qiao;David S. Ebert;Alireza Entezari;Marek Korkusinski;Gerhard Klimeck,W. Qiao;D.S. Ebert;A. Entezari;M. Korkusinski;G. Klimeck,"Purdue Univ., West Lafayette, IN, USA;Purdue Univ., West Lafayette, IN, USA",10.1109/VISUAL.2003.1250414;10.1109/VISUAL.2004.85;10.1109/VISUAL.2004.95;10.1109/VISUAL.2004.65;10.1109/VISUAL.2000.885683;10.1109/VISUAL.2001.964498,"volume visualization, volume rendering, programmable graphics hardware, face-centered cubic lattice, reconstruction filter, quantum dots, atomistic simulation",18,7,29,
Vis,2005,High dynamic range volume visualization,10.1109/VISUAL.2005.1532812,http://dx.doi.org/10.1109/VISUAL.2005.1532812,327,334,C,"High resolution volumes require high precision compositing to preserve detailed structures. This is even more desirable for volumes with high dynamic range values. After the high precision intermediate image has been computed, simply rounding up pixel values to regular display scales loses the computed details. In this paper, we present a novel high dynamic range volume visualization method for rendering volume data with both high spatial and intensity resolutions. Our method performs high precision volume rendering followed by dynamic tone mapping to preserve details on regular display devices. By leveraging available high dynamic range image display algorithms, this dynamic tone mapping can be automatically adjusted to enhance selected features for the final display. We also present a novel transfer function design interface with nonlinear magnification of the density range and logarithmic scaling of the color/opacity range to facilitate high dynamic range volume visualization. By leveraging modern commodity graphics hardware and out-of-core acceleration, our system can produce an effective visualization of huge volume data.",Xiaoru Yuan;Minh X. Nguyen;Baoquan Chen;David H. Porter,X. Yuan;M.Z. Nguyen;B. Chen;D.H. Porter,"Dept. of Comput. Sci. & Eng;, Minnesota Univ., MN, USA;Dept. of Comput. Sci. & Eng;, Minnesota Univ., MN, USA;Dept. of Comput. Sci. & Eng;, Minnesota Univ., MN, USA;Dept. of Comput. Sci. & Eng;, Minnesota Univ., MN, USA",10.1109/INFVIS.1997.636718;10.1109/VISUAL.1999.809908,"Volume Rendering, High Dynamic Range, Focus+Context Techniques, User Interfaces, Transfer Function Design, Non-linear Magnification",18,9,35,BA
Vis,2005,Eyegaze analysis of displays with combined 2D and 3D views,10.1109/VISUAL.2005.1532837,http://dx.doi.org/10.1109/VISUAL.2005.1532837,519,526,C,"Displays combining both 2D and 3D views have been shown to support higher performance on certain visualization tasks. However, it is not clear how best to arrange a combination of 2D and 3D views spatially in a display. In this study, we analyzed the eyegaze strategies of participants using two arrangements of 2D and 3D views to estimate the relative position of objects in a 3D scene. Our results show that the 3D view was used significantly more often than individual 2D views in both displays, indicating the importance of the 3D view for successful task completion. However, viewing patterns were significantly different between the two displays: transitions through centrally-placed views were always more frequent, and users avoided saccades between views that were far apart. Although the change in viewing strategy did not result in significant performance differences, error analysis indicates that a 3D overview in the center may reduce the number of serious errors compared to a 3D overview placed off to the side.",Melanie Tory;M. Stella Atkins;Arthur E. Kirkpatrick;Marios Nicolaou;Guang-Zhong Yang,M. Tory;M.S. Atkins;A.E. Kirkpatrick;M. Nicolaou;G.-Z. Yang,"Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada",10.1109/VISUAL.2003.1250396;10.1109/VISUAL.1997.663914,"visualization, 2D/3D combination display, user study, experiment, eyegaze analysis",18,8,19,
VAST,2006,Avian Flu Case Study with nSpace and GeoTime,10.1109/VAST.2006.261427,http://dx.doi.org/10.1109/VAST.2006.261427,27,34,C,"GeoTime and nSpace are new analysis tools that provide innovative visual analytic capabilities. This paper uses an epidemiology analysis scenario to illustrate and discuss these new investigative methods and techniques. In addition, this case study is an exploration and demonstration of the analytical synergy achieved by combining GeoTime's geo-temporal analysis capabilities, with the rapid information triage, scanning and sense-making provided by nSpace. A fictional analyst works through the scenario from the initial brainstorming through to a final collaboration and report. With the efficient knowledge acquisition and insights into large amounts of documents, there is more time for the analyst to reason about the problem and imagine ways to mitigate threats. The use of both nSpace and GeoTime initiated a synergistic exchange of ideas, where hypotheses generated in either software tool could be cross-referenced, refuted, and supported by the other tool",Pascale Proulx;Sumeet Tandon;Adam Bodnar;David Schroh;Robert Harper 0002;William Wright,Pascale Proulx;Sumeet Tandon;Adam Bodnar;David Schroh;Robert Harper;William Wright,"Oculus Info Inc., email: pascale.proulx@oculusinfo.com;Oculus Info Inc., email: sumeet.tandon@oculusinfo.com;Oculus Info Inc., email: adam.bodnar@oculusinfo.com;Oculus Info Inc., email: david.schroh@oculusinfo.com;Oculus Info Inc., email: rob.harper@oculusinfo.com;Oculus Info Inc., email: bill.wright@oculusinfo.com",10.1109/INFVIS.2004.27,"visual analytics, information visualization, human information interaction, sense making, geo-spatial information systems, temporal analysis, user centered design",18,12,22,
Vis,2006,A Trajectory-Preserving Synchronization Method for Collaborative Visualization,10.1109/TVCG.2006.114,http://dx.doi.org/10.1109/TVCG.2006.114,989,996,J,"In the past decade, a lot of research work has been conducted to support collaborative visualization among remote users over the networks, allowing them to visualize and manipulate shared data for problem solving. There are many applications of collaborative visualization, such as oceanography, meteorology and medical science. To facilitate user interaction, a critical system requirement for collaborative visualization is to ensure that remote users would perceive a synchronized view of the shared data. Failing this requirement, the user's ability in performing the desirable collaborative tasks would be affected. In this paper, we propose a synchronization method to support collaborative visualization. It considers how interaction with dynamic objects is perceived by application participants under the existence of network latency, and remedies the motion trajectory of the dynamic objects. It also handles the false positive and false negative collision detection problems. The new method is particularly well designed for handling content changes due to unpredictable user interventions or object collisions. We demonstrate the effectiveness of our method through a number of experiments",Lewis W. F. Li;Frederick W. B. Li;Rynson W. H. Lau,Lewis W.f. Li;Frederick W.b. Li;Rynson W.h. Lau,,10.1109/VISUAL.1997.663890;10.1109/VISUAL.1997.663896,"Collaborative visualization, network latency, motion synchronization, distributed synchronization",18,19,27,
Vis,2006,Extensions of the Zwart-Powell Box Spline for Volumetric Data Reconstruction on the Cartesian Lattice,10.1109/TVCG.2006.141,http://dx.doi.org/10.1109/TVCG.2006.141,1337,1344,J,"In this article we propose a box spline and its variants for reconstructing volumetric data sampled on the Cartesian lattice. In particular we present a tri-variate box spline reconstruction kernel that is superior to tensor product reconstruction schemes in terms of recovering the proper Cartesian spectrum of the underlying function. This box spline produces a C&lt;sup&gt;2&lt;/sup&gt; reconstruction that can be considered as a three dimensional extension of the well known Zwart-Powell element in 2D. While its smoothness and approximation power are equivalent to those of the tri-cubic B-spline, we illustrate the superiority of this reconstruction on functions sampled on the Cartesian lattice and contrast it to tensor product B-splines. Our construction is validated through a Fourier domain analysis of the reconstruction behavior of this box spline. Moreover, we present a stable method for evaluation of this box spline by means of a decomposition. Through a convolution, this decomposition reduces the problem to evaluation of a four directional box spline that we previously published in its explicit closed form",Alireza Entezari;Torsten Möller,Alireza Entezari;Torsten Moller,"School of Computing Science, Simon Fraser University;School of Computing Science, Simon Fraser University",10.1109/VISUAL.1994.346331;10.1109/VISUAL.1993.398851;10.1109/VISUAL.2005.1532811;10.1109/VISUAL.2004.65;10.1109/VISUAL.1997.663848,"Volumetric data interpolation, reconstruction, box splines",18,16,27,
Vis,2006,Scalable Data Servers for Large Multivariate Volume Visualization,10.1109/TVCG.2006.175,http://dx.doi.org/10.1109/TVCG.2006.175,1291,1298,J,"Volumetric datasets with multiple variables on each voxel over multiple time steps are often complex, especially when considering the exponentially large attribute space formed by the variables in combination with the spatial and temporal dimensions. It is intuitive, practical, and thus often desirable, to interactively select a subset of the data from within that high-dimensional value space for efficient visualization. This approach is straightforward to implement if the dataset is small enough to be stored entirely in-core. However, to handle datasets sized at hundreds of gigabytes and beyond, this simplistic approach becomes infeasible and thus, more sophisticated solutions are needed. In this work, we developed a system that supports efficient visualization of an arbitrary subset, selected by range-queries, of a large multivariate time-varying dataset. By employing specialized data structures and schemes of data distribution, our system can leverage a large number of networked computers as parallel data servers, and guarantees a near optimal load-balance. We demonstrate our system of scalable data servers using two large time-varying simulation datasets",Markus Glatter;Jian Huang 0007;Jinzhu Gao;Colin Mollenhour,Markus Glatter;Jian Huang;Jinzhu Gao;Colin Mollenhour,The University of Tennessee;The University of Tennessee;The University of Tennessee;Oak Ridge National Lab,10.1109/VISUAL.2005.1532792;10.1109/VISUAL.2005.1532794;10.1109/VISUAL.1999.809910;10.1109/VISUAL.1996.568121;10.1109/VISUAL.2003.1250412;10.1109/VISUAL.2001.964519;10.1109/VISUAL.1998.745311;10.1109/VISUAL.2000.885698,"Parallel and distributed volume visualization, large Data Set Visualization, multi-variate Visualization, volume Visualization",18,15,25,
VAST,2007,Analyzing Large-Scale News Video Databases to Support Knowledge Visualization and Intuitive Retrieval,10.1109/VAST.2007.4389003,http://dx.doi.org/10.1109/VAST.2007.4389003,107,114,C,"In this paper, we have developed a novel framework to enable more effective investigation of large-scale news video database via knowledge visualization. To relieve users from the burdensome exploration of well-known and uninteresting knowledge of news reports, a novel interestingness measurement for video news reports is presented to enable users to find news stories of interest at first glance and capture the relevant knowledge in large-scale video news databases efficiently. Our framework takes advantage of both automatic semantic video analysis and human intelligence by integrating with visualization techniques on semantic video retrieval systems. Our techniques on intelligent news video analysis and knowledge discovery have the capacity to enable more effective visualization and exploration of large-scale news video collections. In addition, news video visualization and exploration can provide valuable feedback to improve our techniques for intelligent news video analysis and knowledge discovery.",Hangzai Luo;Jianping Fan 0001;Jing Yang 0001;William Ribarsky;Shin'ichi Satoh,Hangzai Luo;Jianping Fan;Jing Yang;William Ribarsky;Shin'ichi Satoh,"Software Engineering Institute, East China Normal University, Shanghai, China. e-mail: memcache@gmail.com;Department of Computer Science, UNC-Charlotte, Charlotte, NC, USA. e-mail: jfan@uncc.edu;Department of Computer Science, UNC-Charlotte, Charlotte, NC, USA. e-mail: jyang13@uncc.edu;Department of Computer Science, UNC-Charlotte, Charlotte, NC, USA. e-mail: ribarsky@uncc.edu;National Institute of Informatics, Tokyo, Japan. e-mail: satoh@nii.ac.jp",10.1109/INFVIS.1998.729570;10.1109/TVCG.2006.179;10.1109/INFVIS.1995.528686;10.1109/INFVIS.2000.885098;10.1109/VAST.2006.261433,"Semantic Video Classification, Knowledge Discovery, Knowledge Visualization",18,14,16,
VAST,2008,Multivariate visual explanation for high dimensional datasets,10.1109/VAST.2008.4677368,http://dx.doi.org/10.1109/VAST.2008.4677368,147,154,C,"Understanding multivariate relationships is an important task in multivariate data analysis. Unfortunately, existing multivariate visualization systems lose effectiveness when analyzing relationships among variables that span more than a few dimensions. We present a novel multivariate visual explanation approach that helps users interactively discover multivariate relationships among a large number of dimensions by integrating automatic numerical differentiation techniques and multidimensional visualization techniques. The result is an efficient workflow for multivariate analysis model construction, interactive dimension reduction, and multivariate knowledge discovery leveraging both automatic multivariate analysis and interactive multivariate data visual exploration. Case studies and a formal user study with a real dataset illustrate the effectiveness of this approach.",Scott Barlowe;Tianyi Zhang;Yujie Liu;Jing Yang 0001;Donald J. Jacobs,Scott Barlowe;Tianyi Zhang;Yujie Liu;Jing Yang;Donald Jacobs,"Dept of Computer Science, University of North Carolina at Charlotte, USA;Dept of Computer Science, University of North Carolina at Charlotte, USA;Dept of Computer Science, University of North Carolina at Charlotte, USA;Dept of Computer Science, University of North Carolina at Charlotte, USA;Dept of Physics and Optical Science, University of North Carolina at Charlotte, USA",10.1109/INFVIS.2005.1532142;10.1109/INFVIS.2004.10;10.1109/VISUAL.1995.485140;10.1109/VISUAL.1995.485139;10.1109/INFVIS.2004.3;10.1109/INFVIS.2004.71,"visual analysis, multivariate analysis, dimension reduction, multivariate model construction, multivariate visualization",18,12,30,
Vis,2008,Text Scaffolds for Effective Surface Labeling,10.1109/TVCG.2008.168,http://dx.doi.org/10.1109/TVCG.2008.168,1675,1682,J,"In this paper we introduce a technique for applying textual labels to 3D surfaces. An effective labeling must balance the conflicting goals of conveying the shape of the surface while being legible from a range of viewing directions. Shape can be conveyed by placing the text as a texture directly on the surface, providing shape cues, meaningful landmarks and minimally obstructing the rest of the model. But rendering such surface text is problematic both in regions of high curvature, where text would be warped, and in highly occluded regions, where it would be hidden. Our approach achieves both labeling goals by applying surface labels to a psilatext scaffoldpsila, a surface explicitly constructed to hold the labels. Text scaffolds conform to the underlying surface whenever possible, but can also float above problem regions, allowing them to be smooth while still conveying the overall shape. This paper provides methods for constructing scaffolds from a variety of input sources, including meshes, constructive solid geometry, and scalar fields. These sources are first mapped into a distance transform, which is then filtered and used to construct a new mesh on which labels are either manually or automatically placed. In the latter case, annotated regions of the input surface are associated with proximal regions on the new mesh, and labels placed using cartographic principles.",Gregory Cipriano;Michael Gleicher,Gregory Cipriano;Michael Gleicher,University of Wisconsin-Madison;University of Wisconsin-Madison,10.1109/VISUAL.2000.885705,"surface labeling, computational cartography, text authoring, annotation",18,13,40,
VAST,2010,NetClinic: Interactive visualization to enhance automated fault diagnosis in enterprise networks,10.1109/VAST.2010.5652910,http://dx.doi.org/10.1109/VAST.2010.5652910,131,138,C,"Diagnosing faults in an operational computer network is a frustrating, time-consuming exercise. Despite advances, automatic diagnostic tools are far from perfect: they occasionally miss the true culprit and are mostly only good at narrowing down the search to a few potential culprits. This uncertainty and the inability to extract useful sense from tool output renders most tools not usable to administrators. To bridge this gap, we present NetClinic, a visual analytics system that couples interactive visualization with an automated diagnostic tool for enterprise networks. It enables administrators to verify the output of the automatic analysis at different levels of detail and to move seamlessly across levels while retaining appropriate context. A qualitative user study shows that NetClinic users can accurately identify the culprit, even when it is not present in the suggestions made by the automated component. We also find that supporting a variety of sensemaking strategies is a key to the success of systems that enhance automated diagnosis.",Zhicheng Liu;Bongshin Lee;Srikanth Kandula;Ratul Mahajan,Zhicheng Liu;Bongshin Lee;Srikanth Kandula;Ratul Mahajan,"Microsoft Research, Georgia Institute of Technology;Microsoft Research;Microsoft Research;Microsoft Research",10.1109/TVCG.2006.122;10.1109/TVCG.2007.70522;10.1109/VAST.2009.5333878;10.1109/VAST.2007.4389006;10.1109/VAST.2006.261429,"Sensemaking, Semantic Graph Layout, Visual Analytics, Network Diagnosis, Information Visualization",18,9,28,
Vis,2010,Direct Interval Volume Visualization,10.1109/TVCG.2010.145,http://dx.doi.org/10.1109/TVCG.2010.145,1505,1514,J,"We extend direct volume rendering with a unified model for generalized isosurfaces, also called interval volumes, allowing a wider spectrum of visual classification. We generalize the concept of scale-invariant opacity-typical for isosurface rendering-to semi-transparent interval volumes. Scale-invariant rendering is independent of physical space dimensions and therefore directly facilitates the analysis of data characteristics. Our model represents sharp isosurfaces as limits of interval volumes and combines them with features of direct volume rendering. Our objective is accurate rendering, guaranteeing that all isosurfaces and interval volumes are visualized in a crack-free way with correct spatial ordering. We achieve simultaneous direct and interval volume rendering by extending preintegration and explicit peak finding with data-driven splitting of ray integration and hybrid computation in physical and data domains. Our algorithm is suitable for efficient parallel processing for interactive applications as demonstrated by our CUDA implementation.",Marco Ament;Daniel Weiskopf;Hamish A. Carr,Marco Ament;Daniel Weiskopf;Hamish Carr,VISUS;VISUS;University of Leeds,10.1109/VISUAL.1998.745713;10.1109/VISUAL.1997.663886;10.1109/VISUAL.2004.85;10.1109/VISUAL.1995.480789;10.1109/VISUAL.2002.1183762;10.1109/TVCG.2009.149;10.1109/TVCG.2006.113;10.1109/TVCG.2008.186;10.1109/VISUAL.2000.885683;10.1109/VISUAL.2005.1532808;10.1109/TVCG.2008.160;10.1109/VISUAL.2003.1250384;10.1109/TVCG.2009.204;10.1109/VISUAL.1995.480807,"Direct volume rendering, interval volume, isosurface, ray casting, preintegration, scale-invariant opacity",18,14,41,
Vis,2010,On the Fractal Dimension of Isosurfaces,10.1109/TVCG.2010.182,http://dx.doi.org/10.1109/TVCG.2010.182,1198,1205,J,"A (3D) scalar grid is a regular n<sub>1</sub>× n<sub>2</sub>× n<sub>3</sub>grid of vertices where each vertex v is associated with some scalar value s<sub>v</sub>. Applying trilinear interpolation, the scalar grid determines a scalar function g where g(v) = s<sub>v</sub>for each grid vertex v. An isosurface with isovalue σ is a triangular mesh which approximates the level set g<sup>-1</sup>(σ). The fractal dimension of an isosurface represents the growth in the isosurface as the number of grid cubes increases. We define and discuss the fractal isosurface dimension. Plotting the fractal dimension as a function of the isovalues in a data set provides information about the isosurfaces determined by the data set. We present statistics on the average fractal dimension of 60 publicly available benchmark data sets. We also show the fractal dimension is highly correlated with topological noise in the benchmark data sets, measuring the topological noise by the number of connected components in the isosurface. Lastly, we present a formula predicting the fractal dimension as a function of noise and validate the formula with experimental results.",Marc Khoury;Rephael Wenger,Marc Khoury;Rephael Wenger,Computer and Information Science Department at The Ohio State University;Computer and Information Science Department at The Ohio State University,10.1109/TVCG.2006.168;10.1109/TVCG.2008.160;10.1109/VISUAL.2004.28;10.1109/VISUAL.1996.568103;10.1109/VISUAL.2001.964515;10.1109/VISUAL.1991.175782;10.1109/VISUAL.1997.663875,"Isosurfaces, scalar data, fractal dimension",18,15,20,
VAST,2011,A two-stage framework for designing visual analytics system in organizational environments,10.1109/VAST.2011.6102463,http://dx.doi.org/10.1109/VAST.2011.6102463,251,260,C,"A perennially interesting research topic in the field of visual analytics is how to effectively develop systems that support organizational users' decision-making and reasoning processes. The problem is, however, most domain analytical practices generally vary from organization to organization. This leads to diverse designs of visual analytics systems in incorporating domain analytical processes, making it difficult to generalize the success from one domain to another. Exacerbating this problem is the dearth of general models of analytical workflows available to enable such timely and effective designs. To alleviate these problems, we present a two-stage framework for informing the design of a visual analytics system. This design framework builds upon and extends current practices pertaining to analytical workflow and focuses, in particular, on incorporating both general domain analysis processes as well as individual's analytical activities. We illustrate both stages and their design components through examples, and hope this framework will be useful for designing future visual analytics systems. We validate the soundness of our framework with two visual analytics systems, namely Entity Workspace [8] and PatViz [37].",Derek Xiaoyu Wang;Wenwen Dou;Thomas Butkiewicz;Eric A. Bier;William Ribarsky,Xiaoyu Wang;Wenwen Dou;Thomas Butkiewicz;Eric A. Bier;William Ribarsky,"UNC Charlotte, USA;UNC Charlotte, USA;University of New Hampshire, USA;Palo Alto Research Center, USA;UNC Charlotte, USA",10.1109/VAST.2008.4677362;10.1109/VAST.2009.5333020;10.1109/TVCG.2008.137;10.1109/VAST.2006.261416;10.1109/VAST.2007.4389009;10.1109/TVCG.2009.139;10.1109/VAST.2008.4677361;10.1109/TVCG.2009.111;10.1109/VISUAL.2005.1532781;10.1109/VAST.2008.4677352;10.1109/TVCG.2008.109;10.1109/TVCG.2007.70515;10.1109/VAST.2008.4677360;10.1109/VAST.2008.4677365;10.1109/VAST.2009.5333564,"Design Theory, Visual Analytics, HCI",18,8,66,
Vis,2011,Asymmetric Tensor field Visualization for Surfaces,10.1109/TVCG.2011.170,http://dx.doi.org/10.1109/TVCG.2011.170,1979,1988,J,"Asymmetric tensor field visualization can provide important insight into fluid flows and solid deformations. Existing techniques for asymmetric tensor fields focus on the analysis, and simply use evenly-spaced hyperstreamlines on surfaces following eigenvectors and dual-eigenvectors in the tensor field. In this paper, we describe a hybrid visualization technique in which hyperstreamlines and elliptical glyphs are used in real and complex domains, respectively. This enables a more faithful representation of flow behaviors inside complex domains. In addition, we encode tensor magnitude, an important quantity in tensor field analysis, using the density of hyperstreamlines and sizes of glyphs. This allows colors to be used to encode other important tensor quantities. To facilitate quick visual exploration of the data from different viewpoints and at different resolutions, we employ an efficient image-space approach in which hyperstreamlines and glyphs are generated quickly in the image plane. The combination of these techniques leads to an efficient tensor field visualization system for domain scientists. We demonstrate the effectiveness of our visualization technique through applications to complex simulated engine fluid flow and earthquake deformation data. Feedback from domain expert scientists, who are also co-authors, is provided.",Darrel Palke;Zhongzang Lin;Guoning Chen;Harry Yeh;Paul Vincent;Robert S. Laramee;Eugene Zhang,Darrel Palke;Zhongzang Lin;Guoning Chen;Harry Yeh;Paul Vincent;Robert Laramee;Eugene Zhang,"Oregon State University;Oregon State University;SCI, University of Utah;Oregon State University;Oregon State University;Swansea University;Oregon State University",10.1109/VISUAL.2003.1250379;10.1109/TVCG.2010.199;10.1109/VISUAL.2004.105;10.1109/VISUAL.1993.398849;10.1109/VISUAL.2005.1532773;10.1109/VISUAL.2005.1532770;10.1109/TVCG.2006.134;10.1109/VISUAL.2005.1532850;10.1109/TVCG.2006.116;10.1109/VISUAL.2005.1532841;10.1109/VISUAL.2003.1250363;10.1109/VISUAL.1998.745295;10.1109/VISUAL.2004.80;10.1109/VISUAL.1998.745294;10.1109/VISUAL.2005.1532832;10.1109/VISUAL.1999.809905;10.1109/VISUAL.2000.885690;10.1109/VISUAL.1994.346326,"Aasymmetric tensor fields, vector fields, glyph packing, hyperstreamline placement, view-dependent",18,16,47,
InfoVis,2012,Comparing Clusterings Using Bertin's Idea,10.1109/TVCG.2012.207,http://dx.doi.org/10.1109/TVCG.2012.207,2506,2515,J,"Classifying a set of objects into clusters can be done in numerous ways, producing different results. They can be visually compared using contingency tables [27], mosaicplots [13], fluctuation diagrams [15], tableplots [20] , (modified) parallel coordinates plots [28], Parallel Sets plots [18] or circos diagrams [19]. Unfortunately the interpretability of all these graphical displays decreases rapidly with the numbers of categories and clusterings. In his famous book A Semiology of Graphics [5] Bertin writes “the discovery of an ordered concept appears as the ultimate point in logical simplification since it permits reducing to a single instant the assimilation of series which previously required many instants of study”. Or in more everyday language, if you use good orderings you can see results immediately that with other orderings might take a lot of effort. This is also related to the idea of effect ordering [12], that data should be organised to reflect the effect you want to observe. This paper presents an efficient algorithm based on Bertin's idea and concepts related to Kendall's t [17], which finds informative joint orders for two or more nominal classification variables. We also show how these orderings improve the various displays and how groups of corresponding categories can be detected using a top-down partitioning algorithm. Different clusterings based on data on the environmental performance of cars sold in Germany are used for illustration. All presented methods are available in the R package extracat which is used to compute the optimized orderings for the example dataset.",Alexander Pilhofer;Alexander Gribov;Antony Unwin,Alexander Pilhöfer;Alexander Gribov;Antony Unwin,University of Augsburg;University of Augsburg;University of Augsburg,10.1109/TVCG.2010.184;10.1109/TVCG.2010.138,"Order optimization, fluctuation diagrams, classification, seriation",18,15,37,
SciVis,2012,Generalized Topological Simplification of Scalar fields on Surfaces,10.1109/TVCG.2012.228,http://dx.doi.org/10.1109/TVCG.2012.228,2005,2013,J,"We present a combinatorial algorithm for the general topological simplification of scalar fields on surfaces. Given a scalar field f, our algorithm generates a simplified field g that provably admits only critical points from a constrained subset of the singularities of f, while guaranteeing a small distance ||f - g||<sub>∞</sub>for data-fitting purpose. In contrast to previous algorithms, our approach is oblivious to the strategy used for selecting features of interest and allows critical points to be removed arbitrarily. When topological persistence is used to select the features of interest, our algorithm produces a standard ϵ-simplification. Our approach is based on a new iterative algorithm for the constrained reconstruction of sub- and sur-level sets. Extensive experiments show that the number of iterations required for our algorithm to converge is rarely greater than 2 and never greater than 5, yielding O(n log(n)) practical time performances. The algorithm handles triangulated surfaces with or without boundary and is robust to the presence of multi-saddles in the input. It is simple to implement, fast in practice and more general than previous techniques. Practically, our approach allows a user to arbitrarily simplify the topology of an input function and robustly generate the corresponding simplified function. An appealing application area of our algorithm is in scalar field design since it enables, without any threshold parameter, the robust pruning of topological noise as selected by the user. This is needed for example to get rid of inaccuracies introduced by numerical solvers, thereby providing topological guarantees needed for certified geometry processing. Experiments show this ability to eliminate numerical noise as well as validate the time efficiency and accuracy of our algorithm. We provide a lightweight C++ implementation as supplemental material that can be used for topological cleaning on surface meshes.",Julien Tierny;Valerio Pascucci,Julien Tierny;Valerio Pascucci,CNRS;SCI Institute,10.1109/TVCG.2008.110;10.1109/TVCG.2009.163;10.1109/VISUAL.2004.96;10.1109/TVCG.2011.244,"Scalar field visualization, scalar field design, topological simplification",18,20,23,
SciVis,2012,Visualization of Temporal Similarity in field Data,10.1109/TVCG.2012.284,http://dx.doi.org/10.1109/TVCG.2012.284,2023,2032,J,"This paper presents a visualization approach for detecting and exploring similarity in the temporal variation of field data. We provide an interactive technique for extracting correlations from similarity matrices which capture temporal similarity of univariate functions. We make use of the concept to extract periodic and quasiperiodic behavior at single (spatial) points as well as similarity between different locations within a field and also between different data sets. The obtained correlations are utilized for visual exploration of both temporal and spatial relationships in terms of temporal similarity. Our entire pipeline offers visual interaction and inspection, allowing for the flexibility that in particular time-dependent data analysis techniques require. We demonstrate the utility and versatility of our approach by applying our implementation to data from both simulation and measurement.",Steffen Frey;Filip Sadlo;Thomas Ertl,Steffen Frey;Filip Sadlo;Thomas Ertl,University of Stuttgart;University of Stuttgart;University of Stuttgart,10.1109/TVCG.2008.139;10.1109/TVCG.2006.199;10.1109/TVCG.2006.165;10.1109/TVCG.2010.213;10.1109/TVCG.2010.133;10.1109/TVCG.2010.223;10.1109/TVCG.2009.199;10.1109/TVCG.2008.140;10.1109/TVCG.2010.216;10.1109/TVCG.2009.200;10.1109/TVCG.2011.159;10.1109/TVCG.2009.197,"Time-dependent fields, similarity analysis, interactive recurrence analysis, comparative visualization",18,15,42,
VAST,2012,The Deshredder: A visual analytic approach to reconstructing shredded documents,10.1109/VAST.2012.6400560,http://dx.doi.org/10.1109/VAST.2012.6400560,113,122,C,"Reconstruction of shredded documents remains a significant challenge. Creating a better document reconstruction system enables not just recovery of information accidentally lost but also understanding our limitations against adversaries' attempts to gain access to information. Existing approaches to reconstructing shredded documents adopt either a predominantly manual (e.g., crowd-sourcing) or a near automatic approach. We describe Deshredder, a visual analytic approach that scales well and effectively incorporates user input to direct the reconstruction process. Deshredder represents shredded pieces as time series and uses nearest neighbor matching techniques that enable matching both the contours of shredded pieces as well as the content of shreds themselves. More importantly, Deshred-der's interface support visual analytics through user interaction with similarity matrices as well as higher level assembly through more complex stitching functions. We identify a functional task taxonomy leading to design considerations for constructing deshredding solutions, and describe how Deshredder applies to problems from the DARPA Shredder Challenge through expert evaluations.",Patrick Butler;Prithwish Chakraborty;Naren Ramakrishnan,Patrick Butler;Prithwish Chakraborty;Naren Ramakrishan,"Department of Computer Science and Discovery Analytics Center, Virginia Tech, Blacksburg, VA 24061;Department of Computer Science and Discovery Analytics Center, Virginia Tech, Blacksburg, VA 24061;Department of Computer Science and Discovery Analytics Center, Virginia Tech, Blacksburg, VA 24061",,,18,16,37,
InfoVis,2013,"Interactive Visualizations on Large and Small Displays: The Interrelation of Display Size, Information Space, and Scale",10.1109/TVCG.2013.170,http://dx.doi.org/10.1109/TVCG.2013.170,2336,2345,J,"In controlled experiments on the relation of display size (i.e., the number of pixels) and the usability of visualizations, the size of the information space can either be kept constant or varied relative to display size. Both experimental approaches have limitations. If the information space is kept constant then the scale ratio between an overview of the entire information space and the lowest zoom level varies, which can impact performance; if the information space is varied then the scale ratio is kept constant, but performance cannot be directly compared. In other words, display size, information space, and scale ratio are interrelated variables. We investigate this relation in two experiments with interfaces that implement classic information visualization techniques-focus+context, overview+detail, and zooming-for multi-scale navigation in maps. Display size varied between 0.17, 1.5, and 13.8 megapixels. Information space varied relative to display size in one experiment and was constant in the other. Results suggest that for tasks where users navigate targets that are visible at all map scales the interfaces do not benefit from a large display: With a constant map size, a larger display does not improve performance with the interfaces; with map size varied relative to display size, participants found interfaces harder to use with a larger display and task completion times decrease only when they are normalized to compensate for the increase in map size. The two experimental approaches show different interaction effects between display size and interface. In particular, focus+context performs relatively worse at a large display size with variable map size, and relatively worse at a small display size with a fixed map size. Based on a theoretical analysis of the interaction with the visualization techniques, we examine individual task actions empirically so as to understand the relative impact of display size and scale ratio on the visualization techniques' performance and to discuss differences between the two experimental approaches.",Mikkel Rønne Jakobsen;Kasper Hornbæk,Mikkel R. Jakobsen;Kasper Hornbæk,University of Copenhagen;University of Copenhagen,10.1109/TVCG.2006.184;10.1109/TVCG.2006.187,"Information visualization, multi-scale navigation, interaction techniques, experimental method, user studies",18,13,32,
SciVis,2013,An Exploration Framework to Identify and Track Movement of Cloud Systems,10.1109/TVCG.2013.131,http://dx.doi.org/10.1109/TVCG.2013.131,2896,2905,J,"We describe a framework to explore and visualize the movement of cloud systems. Using techniques from computational topology and computer vision, our framework allows the user to study this movement at various scales in space and time. Such movements could have large temporal and spatial scales such as the Madden Julian Oscillation (MJO), which has a spatial scale ranging from 1000 km to 10000 km and time of oscillation of around 40 days. Embedded within these larger scale oscillations are a hierarchy of cloud clusters which could have smaller spatial and temporal scales such as the Nakazawa cloud clusters. These smaller cloud clusters, while being part of the equatorial MJO, sometimes move at speeds different from the larger scale and in a direction opposite to that of the MJO envelope. Hitherto, one could only speculate about such movements by selectively analysing data and a priori knowledge of such systems. Our framework automatically delineates such cloud clusters and does not depend on the prior experience of the user to define cloud clusters. Analysis using our framework also shows that most tropical systems such as cyclones also contain multi-scale interactions between clouds and cloud systems. We show the effectiveness of our framework to track organized cloud system during one such rainfall event which happened at Mumbai, India in July 2005 and for cyclone Aila which occurred in Bay of Bengal during May 2009.",Harish Doraiswamy;Vijay Natarajan;Ravi S. Nanjundiah,Harish Doraiswamy;Vijay Natarajan;Ravi S. Nanjundiah,Polytechnic Institute of New York University;Indian Institute of Science;Indian Institute of Science,10.1109/TVCG.2007.70519;10.1109/TVCG.2006.186;10.1109/VISUAL.2003.1250383,"Cloud clusters, tracking, computational topology, split tree, weather and climate simulations",18,23,50,
SciVis,2013,Interactive Patient-Specific Vascular Modeling with Sweep Surfaces,10.1109/TVCG.2013.169,http://dx.doi.org/10.1109/TVCG.2013.169,2828,2837,J,"The precise modeling of vascular structures plays a key role in medical imaging applications, such as diagnosis, therapy planning and blood flow simulations. For the simulation of blood flow in particular, high-precision models are required to produce accurate results. It is thus common practice to perform extensive manual data polishing on vascular segmentations prior to simulation. This usually involves a complex tool chain which is highly impractical for clinical on-site application. To close this gap in current blood flow simulation pipelines, we present a novel technique for interactive vascular modeling which is based on implicit sweep surfaces. Our method is able to generate and correct smooth high-quality models based on geometric centerline descriptions on the fly. It supports complex vascular free-form contours and consequently allows for an accurate and fast modeling of pathological structures such as aneurysms or stenoses. We extend the concept of implicit sweep surfaces to achieve increased robustness and applicability as required in the medical field. We finally compare our method to existing techniques and provide case studies that confirm its contribution to current simulation pipelines.",Jan Kretschmer;Christian Godenschwager;Bernhard Preim;Marc Stamminger,Jan Kretschmer;Christian Godenschwager;Bernhard Preim;Marc Stamminger,"Computer Science Department, FAU Erlangen, and Siemens Healthcare, Computed Tomography;Computer Science Department, FAU Erlangen, and Siemens Healthcare, Computed Tomography;University of Magdeburg;Department of Computer Graphics, FAU Erlangen",10.1109/VISUAL.2001.964538;10.1109/VISUAL.1994.346339,"Surface modeling, vascular visualization, centerline-based modeling",18,19,52,
VAST,2013,Transformation of an Uncertain Video Search Pipeline to a Sketch-Based Visual Analytics Loop,10.1109/TVCG.2013.207,http://dx.doi.org/10.1109/TVCG.2013.207,2109,2118,J,"Traditional sketch-based image or video search systems rely on machine learning concepts as their core technology. However, in many applications, machine learning alone is impractical since videos may not be semantically annotated sufficiently, there may be a lack of suitable training data, and the search requirements of the user may frequently change for different tasks. In this work, we develop a visual analytics systems that overcomes the shortcomings of the traditional approach. We make use of a sketch-based interface to enable users to specify search requirement in a flexible manner without depending on semantic annotation. We employ active machine learning to train different analytical models for different types of search requirements. We use visualization to facilitate knowledge discovery at the different stages of visual analytics. This includes visualizing the parameter space of the trained model, visualizing the search space to support interactive browsing, visualizing candidature search results to support rapid interaction for active learning while minimizing watching videos, and visualizing aggregated information of the search results. We demonstrate the system for searching spatiotemporal attributes from sports video to identify key instances of the team and player performance.",Philip A. Legg;David H. S. Chung;Matthew L. Parry;Rhodri Bown;Mark W. Jones;Iwan W. Griffiths;Min Chen 0001,Philip A. Legg;David H.S. Chung;Matthew L. Parry;Rhodri Bown;Mark W. Jones;Iwan W. Griffiths;Min Chen,"Department of Computer Science, Swansea University, University of Oxford;Department of Computer Science, Swansea University;Department of Computer Science, Swansea University;Welsh Rugby Union;Department of Computer Science, Swansea University;Department of Engineering, Swansea University;e-Research Centre, University of Oxford",10.1109/TVCG.2006.138;10.1109/VISUAL.2003.1250401;10.1109/VAST.2009.5332628;10.1109/TVCG.2010.184;10.1109/VAST.2007.4389001;10.1109/TVCG.2008.131;10.1109/INFVIS.1998.729559;10.1109/TVCG.2006.194;10.1109/TVCG.2011.208,"Visual knowledge discovery, data clustering, machine learning, multimedia visualization",18,18,42,
InfoVis,2014,LiveGantt: Interactively Visualizing a Large Manufacturing Schedule,10.1109/TVCG.2014.2346454,http://dx.doi.org/10.1109/TVCG.2014.2346454,2329,2338,J,"In this paper, we introduce LiveGantt as a novel interactive schedule visualization tool that helps users explore highly-concurrent large schedules from various perspectives. Although a Gantt chart is the most common approach to illustrate schedules, currently available Gantt chart visualization tools suffer from limited scalability and lack of interactions. LiveGantt is built with newly designed algorithms and interactions to improve conventional charts with better scalability, explorability, and reschedulability. It employs resource reordering and task aggregation to display the schedules in a scalable way. LiveGantt provides four coordinated views and filtering techniques to help users explore and interact with the schedules in more flexible ways. In addition, LiveGantt is equipped with an efficient rescheduler to allow users to instantaneously modify their schedules based on their scheduling experience in the fields. To assess the usefulness of the application of LiveGantt, we conducted a case study on manufacturing schedule data with four industrial engineering researchers. Participants not only grasped an overview of a schedule but also explored the schedule from multiple perspectives to make enhancements.",Jaemin Jo;Jaeseok Huh;Jonghun Park;Bo Hyoung Kim;Jinwook Seo,Jaemin Jo;Jaeseok Huh;Jonghun Park;Bohyoung Kim;Jinwook Seo,Seoul National University;Seoul National University;Seoul National University;Seoul National University Bundang Hospital;Seoul National University,10.1109/TVCG.2013.200;10.1109/TVCG.2012.213;10.1109/TVCG.2009.117;10.1109/TVCG.2012.225,"Schedule visualization, event sequence visualization, simplification, exploratory interactions, simulation",18,20,42,
SciVis,2014,Interactive Progressive Visualization with Space-Time Error Control,10.1109/TVCG.2014.2346319,http://dx.doi.org/10.1109/TVCG.2014.2346319,2397,2406,J,"We present a novel scheme for progressive rendering in interactive visualization. Static settings with respect to a certain image quality or frame rate are inherently incapable of delivering both high frame rates for rapid changes and high image quality for detailed investigation. Our novel technique flexibly adapts by steering the visualization process in three major degrees of freedom: when to terminate the refinement of a frame in the background and start a new one, when to display a frame currently computed, and how much resources to consume. We base these decisions on the correlation of the errors due to insufficient sampling and response delay, which we estimate separately using fast yet expressive heuristics. To automate the configuration of the steering behavior, we employ offline video quality analysis. We provide an efficient implementation of our scheme for the application of volume raycasting, featuring integrated GPU-accelerated image reconstruction and error estimation. Our implementation performs an integral handling of the changes due to camera transforms, transfer function adaptations, as well as the progression of the data to in time. Finally, the overall technique is evaluated with an expert study.",Steffen Frey;Filip Sadlo;Kwan-Liu Ma;Thomas Ertl,Steffen Frey;Filip Sadlo;Kwan-Liu Ma;Thomas Ertl,University of Stuttgart;University of Stuttgart;UC Davis;University of Stuttgart,10.1109/VISUAL.1994.346321;10.1109/TVCG.2013.126;10.1109/VISUAL.2000.885702;10.1109/TVCG.2009.114,"Progressive visualization, error-based frame control, interactive volume raycasting",18,16,36,
VAST,2014,Visual Analytics for Complex Engineering Systems: Hybrid Visual Steering of Simulation Ensembles,10.1109/TVCG.2014.2346744,http://dx.doi.org/10.1109/TVCG.2014.2346744,1803,1812,J,"In this paper we propose a novel approach to hybrid visual steering of simulation ensembles. A simulation ensemble is a collection of simulation runs of the same simulation model using different sets of control parameters. Complex engineering systems have very large parameter spaces so a naïve sampling can result in prohibitively large simulation ensembles. Interactive steering of simulation ensembles provides the means to select relevant points in a multi-dimensional parameter space (design of experiment). Interactive steering efficiently reduces the number of simulation runs needed by coupling simulation and visualization and allowing a user to request new simulations on the fly. As system complexity grows, a pure interactive solution is not always sufficient. The new approach of hybrid steering combines interactive visual steering with automatic optimization. Hybrid steering allows a domain expert to interactively (in a visualization) select data points in an iterative manner, approximate the values in a continuous region of the simulation space (by regression) and automatically find the “best” points in this continuous region based on the specified constraints and objectives (by optimization). We argue that with the full spectrum of optimization options, the steering process can be improved substantially. We describe an integrated system consisting of a simulation, a visualization, and an optimization component. We also describe typical tasks and propose an interactive analysis workflow for complex engineering systems. We demonstrate our approach on a case study from automotive industry, the optimization of a hydraulic circuit in a high pressure common rail Diesel injection system.",Kresimir Matkovic;Denis Gracanin;Rainer Splechtna;Mario Jelovic;Benedikt Stehno;Helwig Hauser;Werner Purgathofer,Kreŝimir Matković;Denis Gračanin;Rainer Splechtna;Mario Jelović;Benedikt Stehno;Helwig Hauser;Werner Purgathofer,"VRVis Research Center, Vienna, Austria;Virginia Tech, Blacksburg, VA, USA;VRVis Research Center, Vienna, Austria;AVL-AST Zagreb, Croatia;VRVis Research Center, Vienna, Austria;University of Bergen, Norway;Vienna University of Technology, Austria",10.1109/TVCG.2010.223;10.1109/TVCG.2012.280;10.1109/TVCG.2008.145;10.1109/TVCG.2009.110;10.1109/TVCG.2010.171,"Interactive Visual Analysis, Integrated Design Environment, Simulation, Visual Steering, Automatic Optimization",18,16,42,
VAST,2014,Visual Analysis of Public Utility Service Problems in a Metropolis,10.1109/TVCG.2014.2346898,http://dx.doi.org/10.1109/TVCG.2014.2346898,1843,1852,J,"Issues about city utility services reported by citizens can provide unprecedented insights into the various aspects of such services. Analysis of these issues can improve living quality through evidence-based decision making. However, these issues are complex, because of the involvement of spatial and temporal components, in addition to having multi-dimensional and multivariate natures. Consequently, exploring utility service problems and creating visual representations are difficult. To analyze these issues, we propose a visual analytics process based on the main tasks of utility service management. We also propose an aggregate method that transforms numerous issues into legible events and provide visualizations for events. In addition, we provide a set of tools and interaction techniques to explore such issues. Our approach enables administrators to make more informed decisions.",Jiawan Zhang;E. Yanli;Jing Ma;Yahui Zhao;Binghan Xu;Liting Sun;Jinyan Chen;Xiaoru Yuan,Jiawan Zhang;E Yanli;Jing Ma;Yahui Zhao;Binghan Xu;Liting Sun;Jinyan Chen;Xiaoru Yuan,"School of Computer Science and Technology;School of Computer Science and Technology;SCS, Tianjin University;SCS, Tianjin University;SCS, Tianjin University;SCS, Tianjin University;SCS, Tianjin University;School of EECS",10.1109/VAST.2012.6400557;10.1109/VAST.2012.6400556;10.1109/TVCG.2013.228;10.1109/TVCG.2009.111;10.1109/VAST.2008.4677356;10.1109/TVCG.2012.291;10.1109/TVCG.2013.132;10.1109/TVCG.2013.226;10.1109/VAST.2011.6102455;10.1109/VAST.2011.6102460;10.1109/TVCG.2009.122,"utility services, evidence-based decision making, visual analytics, aggregate",18,17,43,
SciVis,2015,CAST: Effective and Efficient User Interaction for Context-Aware Selection in 3D Particle Clouds,10.1109/TVCG.2015.2467202,http://dx.doi.org/10.1109/TVCG.2015.2467202,886,895,J,"We present a family of three interactive Context-Aware Selection Techniques (CAST) for the analysis of large 3D particle datasets. For these datasets, spatial selection is an essential prerequisite to many other analysis tasks. Traditionally, such interactive target selection has been particularly challenging when the data subsets of interest were implicitly defined in the form of complicated structures of thousands of particles. Our new techniques SpaceCast, TraceCast, and PointCast improve usability and speed of spatial selection in point clouds through novel context-aware algorithms. They are able to infer a user's subtle selection intention from gestural input, can deal with complex situations such as partially occluded point clusters or multiple cluster layers, and can all be fine-tuned after the selection interaction has been completed. Together, they provide an effective and efficient tool set for the fast exploratory analysis of large datasets. In addition to presenting Cast, we report on a formal user study that compares our new techniques not only to each other but also to existing state-of-the-art selection methods. Our results show that Cast family members are virtually always faster than existing methods without tradeoffs in accuracy. In addition, qualitative feedback shows that PointCast and TraceCast were strongly favored by our participants for intuitiveness and efficiency.",Lingyun Yu;Konstantinos Efstathiou 0001;Petra Isenberg;Tobias Isenberg 0001,Lingyun Yu;Konstantinos Efstathiou;Petra Isenberg;Tobias Isenberg,"Hangrhou Dianzi University, Zhejiang, China;University of Groningen, The Netherlands;Inria, France;Inria, France",10.1109/TVCG.2008.153;10.1109/VISUAL.1999.809932;10.1109/TVCG.2013.126;10.1109/TVCG.2012.292;10.1109/INFVIS.1996.559216;10.1109/TVCG.2012.217;10.1109/TVCG.2010.157,"Selection, spatial selection, structure-aware selection, context-aware selection, exploratory data visualization and analysis, 3D interaction, user interaction",18,21,58,
SciVis,2015,Interstitial and Interlayer Ion Diffusion Geometry Extraction in Graphitic Nanosphere Battery Materials,10.1109/TVCG.2015.2467432,http://dx.doi.org/10.1109/TVCG.2015.2467432,916,925,J,"Large-scale molecular dynamics (MD) simulations are commonly used for simulating the synthesis and ion diffusion of battery materials. A good battery anode material is determined by its capacity to store ion or other diffusers. However, modeling of ion diffusion dynamics and transport properties at large length and long time scales would be impossible with current MD codes. To analyze the fundamental properties of these materials, therefore, we turn to geometric and topological analysis of their structure. In this paper, we apply a novel technique inspired by discrete Morse theory to the Delaunay triangulation of the simulated geometry of a thermally annealed carbon nanosphere. We utilize our computed structures to drive further geometric analysis to extract the interstitial diffusion structure as a single mesh. Our results provide a new approach to analyze the geometry of the simulated carbon nanosphere, and new insights into the role of carbon defect size and distribution in determining the charge capacity and charge dynamics of these carbon based battery materials.",Attila Gyulassy;Aaron Knoll;Kah Chun Lau;Bei Wang 0001;Peer-Timo Bremer;Michael E. Papka;Larry A. Curtiss;Valerio Pascucci,Attila Gyulassy;Aaron Knoll;Kah Chun Lau;Bei Wang;Peer-Timo Bremer;Michael E. Papka;Larry A. Curtiss;Valerio Pascucci,"SCI Institute;SCI Institute;Materials Science Division, Argonne National Laboratory;SCI Institute;Lawrence Livermore National Laboratory;Materials Science Division, Argonne National Laboratory;Materials Science Division, Argonne National Laboratory;SCI Institute",10.1109/VISUAL.2005.1532795;10.1109/TVCG.2011.244;10.1109/TVCG.2014.2346403;10.1109/VISUAL.2005.1532839;10.1109/TVCG.2011.259,"materials science, morse-smale, topology, Delaunay, computational geometry",18,8,56,
SciVis,2015,NeuroBlocks - Visual Tracking of Segmentation and Proofreading for Large Connectomics Projects,10.1109/TVCG.2015.2467441,http://dx.doi.org/10.1109/TVCG.2015.2467441,738,746,J,"In the field of connectomics, neuroscientists acquire electron microscopy volumes at nanometer resolution in order to reconstruct a detailed wiring diagram of the neurons in the brain. The resulting image volumes, which often are hundreds of terabytes in size, need to be segmented to identify cell boundaries, synapses, and important cell organelles. However, the segmentation process of a single volume is very complex, time-intensive, and usually performed using a diverse set of tools and many users. To tackle the associated challenges, this paper presents NeuroBlocks, which is a novel visualization system for tracking the state, progress, and evolution of very large volumetric segmentation data in neuroscience. NeuroBlocks is a multi-user web-based application that seamlessly integrates the diverse set of tools that neuroscientists currently use for manual and semi-automatic segmentation, proofreading, visualization, and analysis. NeuroBlocks is the first system that integrates this heterogeneous tool set, providing crucial support for the management, provenance, accountability, and auditing of large-scale segmentations. We describe the design of NeuroBlocks, starting with an analysis of the domain-specific tasks, their inherent challenges, and our subsequent task abstraction and visual representation. We demonstrate the utility of our design based on two case studies that focus on different user roles and their respective requirements for performing and tracking the progress of segmentation and proofreading in a large real-world connectomics project.",Ali K. Al-Awami;Johanna Beyer;Daniel Haehn;Narayanan Kasthuri;Jeff Lichtman;Hanspeter Pfister;Markus Hadwiger,Ali K. Ai-Awami;Johanna Beyer;Daniel Haehn;Narayanan Kasthuri;Jeff W. Lichtman;Hanspeter Pfister;Markus Hadwiger,King Abdullah University of Science and Technology (KAUST);School of Engineering and Applied Sciences;School of Engineering and Applied Sciences;School of Medicine;Center for Brain Science;School of Engineering and Applied Sciences;King Abdullah University of Science and Technology (KAUST),10.1109/TVCG.2014.2346312;10.1109/VISUAL.2005.1532788;10.1109/TVCG.2013.142;10.1109/TVCG.2009.121;10.1109/TVCG.2012.240;10.1109/TVCG.2014.2346371;10.1109/TVCG.2013.174;10.1109/TVCG.2014.2346249;10.1109/TVCG.2007.70584,"Neuroscience, Segmentation, Proofreading, Data and Provenance Tracking",18,19,40,
VAST,2015,SensePath: Understanding the Sensemaking Process Through Analytic Provenance,10.1109/TVCG.2015.2467611,http://dx.doi.org/10.1109/TVCG.2015.2467611,41,50,J,"Sensemaking is described as the process of comprehension, finding meaning and gaining insight from information, producing new knowledge and informing further action. Understanding the sensemaking process allows building effective visual analytics tools to make sense of large and complex datasets. Currently, it is often a manual and time-consuming undertaking to comprehend this: researchers collect observation data, transcribe screen capture videos and think-aloud recordings, identify recurring patterns, and eventually abstract the sensemaking process into a general model. In this paper, we propose a general approach to facilitate such a qualitative analysis process, and introduce a prototype, SensePath, to demonstrate the application of this approach with a focus on browser-based online sensemaking. The approach is based on a study of a number of qualitative research sessions including observations of users performing sensemaking tasks and post hoc analyses to uncover their sensemaking processes. Based on the study results and a follow-up participatory design session with HCI researchers, we decided to focus on the transcription and coding stages of thematic analysis. SensePath automatically captures user's sensemaking actions, i.e., analytic provenance, and provides multi-linked views to support their further analysis. A number of other requirements elicited from the design session are also implemented in SensePath, such as easy integration with existing qualitative analysis workflow and non-intrusive for participants. The tool was used by an experienced HCI researcher to analyze two sensemaking sessions. The researcher found the tool intuitive and considerably reduced analysis time, allowing better understanding of the sensemaking process.",Phong H. Nguyen;Kai Xu 0003;Ashley Wheat;B. L. William Wong;Simon Attfield;Bob Fields,Phong H. Nguyen;Kai Xu;Ashley Wheat;B.L. William Wong;Simon Attfield;Bob Fields,Middlesex University;Middlesex University;Middlesex University;Middlesex University;Middlesex University;Middlesex University,10.1109/VISUAL.2005.1532788;10.1109/TVCG.2011.185;10.1109/TVCG.2014.2346575;10.1109/VAST.2008.4677365;10.1109/TVCG.2008.137;10.1109/VAST.2009.5333020;10.1109/TVCG.2013.132,"Sensemaking, analytic provenance, transcription, coding, qualitative research, timeline visualization",18,15,42,
SciVis,2016,Time-Hierarchical Clustering and Visualization of Weather Forecast Ensembles,10.1109/TVCG.2016.2598868,http://dx.doi.org/10.1109/TVCG.2016.2598868,831,840,J,"We propose a new approach for analyzing the temporal growth of the uncertainty in ensembles of weather forecasts which are started from perturbed but similar initial conditions. As an alternative to traditional approaches in meteorology, which use juxtaposition and animation of spaghetti plots of iso-contours, we make use of contour clustering and provide means to encode forecast dynamics and spread in one single visualization. Based on a given ensemble clustering in a specified time window, we merge clusters in time-reversed order to indicate when and where forecast trajectories start to diverge. We present and compare different visualizations of the resulting time-hierarchical grouping, including space-time surfaces built by connecting cluster representatives over time, and stacked contour variability plots. We demonstrate the effectiveness of our visual encodings with forecast examples of the European Centre for Medium-Range Weather Forecasts, which convey the evolution of specific features in the data as well as the temporally increasing spatial variability.",Florian Ferstl;Mathias Kanzler;Marc Rautenhaus;Rüdiger Westermann,Florian Ferstl;Mathias Kanzler;Marc Rautenhaus;Rüdiger Westermann,Technical University of Munich;Technical University of Munich;Technical University of Munich;Technical University of Munich,10.1109/TVCG.2015.2467204;10.1109/TVCG.2010.181;10.1109/INFVIS.1999.801851;10.1109/TVCG.2015.2467754;10.1109/TVCG.2013.143;10.1109/TVCG.2013.141;10.1109/TVCG.2011.203;10.1109/TVCG.2014.2346332;10.1109/TVCG.2006.168,Ensemble visualization;uncertainty visualization;meteorological visualization;iso-contours;time-varying data;clustering,18,36,52,
SciVis,2016,In Situ Distribution Guided Analysis and Visualization of Transonic Jet Engine Simulations,10.1109/TVCG.2016.2598604,http://dx.doi.org/10.1109/TVCG.2016.2598604,811,820,J,"Study of flow instability in turbine engine compressors is crucial to understand the inception and evolution of engine stall. Aerodynamics experts have been working on detecting the early signs of stall in order to devise novel stall suppression technologies. A state-of-the-art Navier-Stokes based, time-accurate computational fluid dynamics simulator, TURBO, has been developed in NASA to enhance the understanding of flow phenomena undergoing rotating stall. Despite the proven high modeling accuracy of TURBO, the excessive simulation data prohibits post-hoc analysis in both storage and I/O time. To address these issues and allow the expert to perform scalable stall analysis, we have designed an in situ distribution guided stall analysis technique. Our method summarizes statistics of important properties of the simulation data in situ using a probabilistic data modeling scheme. This data summarization enables statistical anomaly detection for flow instability in post analysis, which reveals the spatiotemporal trends of rotating stall for the expert to conceive new hypotheses. Furthermore, the verification of the hypotheses and exploratory visualization using the summarized data are realized using probabilistic visualization techniques such as uncertain isocontouring. Positive feedback from the domain scientist has indicated the efficacy of our system in exploratory stall analysis.",Soumya Dutta;Chun-Ming Chen;Gregory Heinlein;Han-Wei Shen;Jen-Ping Chen,Soumya Dutta;Chun-Ming Chen;Gregory Heinlein;Han-Wei Shen;Jen-Ping Chen,"The Department of Computer Science and Engineering, GRAVITY research group, The Ohio State University;The Department of Computer Science and Engineering, GRAVITY research group, The Ohio State University;The Department of Mechanical and Aerospace Engineering, The Ohio State University;The Department of Computer Science and Engineering, GRAVITY research group, The Ohio State University;The Department of Mechanical and Aerospace Engineering, The Ohio State University",10.1109/TVCG.2008.140;10.1109/TVCG.2013.152;10.1109/TVCG.2015.2467436;10.1109/TVCG.2007.70615;10.1109/TVCG.2015.2467952;10.1109/TVCG.2015.2467958;10.1109/TVCG.2015.2467411,In situ analysis;rotating stall analysis;Gaussian mixture model;incremental distribution modeling;feature analysis;high performance computing;collaborative development,18,15,52,HM
InfoVis,2017,"Exploring Multivariate Event Sequences Using Rules, Aggregations, and Selections",10.1109/TVCG.2017.2745278,http://dx.doi.org/10.1109/TVCG.2017.2745278,532,541,J,"Multivariate event sequences are ubiquitous: travel history, telecommunication conversations, and server logs are some examples. Besides standard properties such as type and timestamp, events often have other associated multivariate data. Current exploration and analysis methods either focus on the temporal analysis of a single attribute or the structural analysis of the multivariate data only. We present an approach where users can explore event sequences at multivariate and sequential level simultaneously by interactively defining a set of rewrite rules using multivariate regular expressions. Users can store resulting patterns as new types of events or attributes to interactively enrich or simplify event sequences for further investigation. In Eventpad we provide a bottom-up glyph-oriented approach for multivariate event sequence analysis by searching, clustering, and aligning them according to newly defined domain specific properties. We illustrate the effectiveness of our approach with real-world data sets including telecommunication traffic and hospital treatments.",Bram C. M. Cappers;Jarke J. van Wijk,Bram C.M. Cappers;Jarke J. van Wijk,Eindhoven University of Technology;Eindhoven University of Technology,10.1109/TVCG.2013.124;10.1109/VAST.2006.261421;10.1109/TVCG.2014.2346682;10.1109/TVCG.2015.2467622;10.1109/VAST.2007.4389008;10.1109/TVCG.2016.2598797;10.1109/TVCG.2013.200;10.1109/TVCG.2012.225,"Event Visualization,Multivariate Events,Regular Expressions,Sequence Alignment,Interaction",18,17,50,
VAST,2017,Visual Diagnosis of Tree Boosting Methods,10.1109/TVCG.2017.2744378,http://dx.doi.org/10.1109/TVCG.2017.2744378,163,173,J,"Tree boosting, which combines weak learners (typically decision trees) to generate a strong learner, is a highly effective and widely used machine learning method. However, the development of a high performance tree boosting model is a time-consuming process that requires numerous trial-and-error experiments. To tackle this issue, we have developed a visual diagnosis tool, BOOSTVis, to help experts quickly analyze and diagnose the training process of tree boosting. In particular, we have designed a temporal confusion matrix visualization, and combined it with a t-SNE projection and a tree visualization. These visualization components work together to provide a comprehensive overview of a tree boosting model, and enable an effective diagnosis of an unsatisfactory training process. Two case studies that were conducted on the Otto Group Product Classification Challenge dataset demonstrate that BOOSTVis can provide informative feedback and guidance to improve understanding and diagnosis of tree boosting algorithms.",Shixia Liu;Jiannan Xiao;Junlin Liu;Xiting Wang;Jing Wu;Jun Zhu 0001,Shixia Liu;Jiannan Xiao;Junlin Liu;Xiting Wang;Jing Wu;Jun Zhu,Tsinghua University and National Engineering Lab for Big Data Software;Tsinghua University and National Engineering Lab for Big Data Software;Tsinghua University and National Engineering Lab for Big Data Software;Microsoft Research;Cardiff University;Tsinghua University and National Engineering Lab for Big Data Software,10.1109/TVCG.2014.2346660;10.1109/VAST.2010.5652443;10.1109/TVCG.2012.277;10.1109/VAST.2012.6400492;10.1109/TVCG.2016.2598831;10.1109/TVCG.2016.2598838;10.1109/TVCG.2016.2598828;10.1109/VISUAL.2000.885740;10.1109/VISUAL.2005.1532820;10.1109/VAST.2011.6102453,"tree boosting,model analysis,temporal confusion matrix,tree visualization",18,12,68,
VAST,2018,RetainVis: Visual Analytics with Interpretable and Interactive Recurrent Neural Networks on Electronic Medical Records,10.1109/TVCG.2018.2865027,http://dx.doi.org/10.1109/TVCG.2018.2865027,299,309,J,"We have recently seen many successful applications of recurrent neural networks (RNNs) on electronic medical records (EMRs), which contain histories of patients' diagnoses, medications, and other various events, in order to predict the current and future states of patients. Despite the strong performance of RNNs, it is often challenging for users to understand why the model makes a particular prediction. Such black-box nature of RNNs can impede its wide adoption in clinical practice. Furthermore, we have no established methods to interactively leverage users' domain expertise and prior knowledge as inputs for steering the model. Therefore, our design study aims to provide a visual analytics solution to increase interpretability and interactivity of RNNs via a joint effort of medical experts, artificial intelligence scientists, and visual analytics researchers. Following the iterative design process between the experts, we design, implement, and evaluate a visual analytics tool called RetainVis, which couples a newly improved, interpretable, and interactive RNN-based model called RetainEX and visualizations for users' exploration of EMR data in the context of prediction tasks. Our study shows the effective use of RetainVis for gaining insights into how individual medical codes contribute to making risk predictions, using EMRs of patients with heart failure and cataract symptoms. Our study also demonstrates how we made substantial changes to the state-of-the-art RNN model called RETAIN in order to make use of temporal information and increase interactivity. This study will provide a useful guideline for researchers that aim to design an interpretable and interactive visual analytics tool for RNNs.",Bum Chul Kwon;Min-Je Choi;Joanne Taery Kim;Edward Choi;Young-bin Kim;Soonwook Kwon;Jimeng Sun;Jaegul Choo,Bum Chul Kwon;Min-Je Choi;Joanne Taery Kim;Edward Choi;Young Bin Kim;Soonwook Kwon;Jimeng Sun;Jaegul Choo,"IBM T.J. Watson Research CenterKorea University;Georgia Institute of Technology;Georgia Institute of Technology;Chung-Ang University;IBM T.J. Watson Research CenterKorea University;Catholic University, Daegu;IBM T.J. Watson Research CenterKorea University;Georgia Institute of Technology",10.1109/TVCG.2013.212;10.1109/TVCG.2017.2745080;10.1109/TVCG.2012.277;10.1109/TVCG.2017.2744718;10.1109/TVCG.2017.2745085;10.1109/TVCG.2016.2598446;10.1109/TVCG.2015.2467555;10.1109/TVCG.2016.2598831;10.1109/VAST.2017.8585721;10.1109/TVCG.2017.2744358;10.1109/TVCG.2016.2598838;10.1109/TVCG.2012.213;10.1109/TVCG.2017.2744158;10.1109/TVCG.2017.2744878,"Interactive Artificial Intelligence,XAI (Explainable Artificial Intelligence),Interpretable Deep Learning,Healthcare",18,13,85,
Vis,1990,Visualizing computer memory architectures,10.1109/VISUAL.1990.146371,http://dx.doi.org/10.1109/VISUAL.1990.146371,107,113,C,"The authors describe a conceptual model, the memory hierarchy framework, and a visual language for using the model. The model is more faithful to the structure of computers than the Von Neumann and Turing models. It addresses the issues of data movement and exposes and unifies storage mechanisms such as cache, translation lookaside buffers, main memory, and disks. The visual language presents the details of a computer's memory hierarchy in a concise drawing composed of rectangles and connecting segments. Using this framework, the authors improved the performance of a matrix multiplication algorithm by more than an order of magnitude. The framework gives insight into computer architecture and performance bottlenecks by making effective use of human visual abilities.&lt;&lt;ETX&gt;&gt;",Bowen Alpern;Larry Carter;Ted Selker,B. Alpern;L. Carter;T. Selker,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",,,17,11,7,
Vis,1991,Golf green visualization,10.1109/VISUAL.1991.175787,http://dx.doi.org/10.1109/VISUAL.1991.175787,116,"123, 416",C,"Television coverage of golf fails to bring the viewer an appreciation of the complex topography of a golf green and how that topography affects the putting of golf balls. A computer graphics simulation that enhances the viewer's perception of these features using shaded polygonal models of the actual golf green used in tournaments is presented. Mathematical modeling of the golf ball's trajectory on its way toward the hole further enhances viewer understanding. A putting difficulty map assesses the relative difficulty of putting from each location on the green to a given pin position. The object-oriented system is written in C and runs on a variety of 3D graphics workstations. As an experiment, the system was used at a professional golf tournament and correctly simulated all putts during the final round.&lt;&lt;ETX&gt;&gt;",William E. Lorensen;Boris Yamrom,W.E. Lorensen;B. Yamron,"General Electric Co., Schenectady, NY, USA;General Electric Co., Schenectady, NY, USA",,,17,1,14,
Vis,1992,Virtual spacetime: an environment for the visualization of curved spacetimes via geodesic flows,10.1109/VISUAL.1992.235196,http://dx.doi.org/10.1109/VISUAL.1992.235196,291,298,C,"An implementation of a virtual environment for visualizing the geometry of curved spacetime by the display of interactive geodesics is described. This technique displays the paths of particles under the influence of gravity as described by the general theory of relativity and is useful in the investigation of solutions to the field equations of that theory. A boom-mounted six-degree-of-freedom head-position-sensitive stereo CRT system is used for display. A hand-position-sensitive glove controller is used to control the initial positions and directions of geodesics in spacetime. A multiprocessor graphics workstation is used for computation and rendering. Several techniques for visualizing the geometry of spacetime using geodesics are discussed. Although this work is described exclusively in the context of physical four-dimensional spacetimes, it extends to arbitrary geometries in arbitrary dimensions. While this work is intended for researchers, it is also useful for the teaching of general relativity.&lt;&lt;ETX&gt;&gt;",Steve Bryson,S. Bryson,"NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1991.175771,,17,5,14,
Vis,1992,Generalized focal surfaces: a new method for surface interrogation,10.1109/VISUAL.1992.235224,http://dx.doi.org/10.1109/VISUAL.1992.235224,70,76,C,"The generation of smooth surfaces from a mesh of three-dimensional data points is an important problem in geometric modeling. Apart from the pure construction of these curves and surfaces, the analysis of their quality is equally important in the design and manufacturing process. Generalized focal surfaces are presented as a new surface interrogation tool.&lt;&lt;ETX&gt;&gt;",Hans Hagen;Stefanie Hahmann,H. Hagen;S. Hahmann,"Kaiserslautern Univ., Germany;Kaiserslautern Univ., Germany",,,17,6,6,
Vis,1995,High-speed volume rendering using redundant block compression,10.1109/VISUAL.1995.480810,http://dx.doi.org/10.1109/VISUAL.1995.480810,176,"183, 451",C,"Presents a novel volume rendering method which offers high rendering speed on standard workstations. It is based on a lossy data compression scheme which drastically reduces the memory bandwidth and computing requirements of perspective raycasting. Starting from classified and shaded data sets, we use block truncation coding or color cell compression to compress a block of 12 voxels into 32 bits. All blocks of the data set are processed redundantly, yielding a data structure which avoids multiple memory accesses per raypoint. As a side effect, the tri-linear interpolation of data coded in such a way is very much simplified. These techniques allow us to perform walkthroughs at interactive frame rates. Furthermore, the algorithm provides depth-cueing and the semi-transparent display of different materials. The algorithm achieves a sustained frame generation rate of about 2 Hz for large data sets (/spl sim/200/sup 3/) at an acceptable image quality on an SGI Indy workstation. A number of examples are shown.",Günter Knittel,G. Knittel,"Wilhelm-Schickard-Inst. fur Inf., Tubingen Univ., Germany",10.1109/VISUAL.1993.398845;10.1109/VISUAL.1993.398852;10.1109/VISUAL.1992.235231,,17,10,19,
Vis,1995,Authenticity analysis of wavelet approximations in visualization,10.1109/VISUAL.1995.480811,http://dx.doi.org/10.1109/VISUAL.1995.480811,184,"191, 452",C,"Wavelet transforms include data decompositions and reconstructions. This paper is concerned with the authenticity issues of the data decomposition, particularly for data visualization. A total of six datasets are used to clarify the approximation characteristics of compactly supported orthogonal wavelets. We present an error tracking mechanism, which uses the available wavelet resources to measure the quality of the wavelet approximations.",Pak Chung Wong;R. Daniel Bergeron,Pak Chung Wong;R.D. Bergeron,"Dept. of Comput. Sci., New Hampshire Univ., Durham, NH, USA;Dept. of Comput. Sci., New Hampshire Univ., Durham, NH, USA",10.1109/VISUAL.1994.346333;10.1109/VISUAL.1994.346332,,17,7,19,
InfoVis,1996,Rapid prototyping of information visualizations using VANISH,10.1109/INFVIS.1996.559212,http://dx.doi.org/10.1109/INFVIS.1996.559212,21,"28, 118",C,"Discusses a software tool called VANISH (Visualizing And Navigating Information Structured Hierarchically), which supports the rapid prototyping of interactive 2D and 3D information visualizations. VANISH supports rapid prototyping through a special-purpose visual language called VaPL (VANISH Programming Language) tailored for visualizations, through a software architecture that insulates visualization-specific code from changes in both the domain being visualized and the presentation toolkit used, and through the reuse of visualization techniques between application domains. The generality of VANISH is established by showing how it is able to re-create a wide variety of ""standard"" visualization techniques. VANISH's support for prototyping is shown through an extended example, where we build a C++ class browser, exploring many visualization alternatives in the process.",Rick Kazman;S. Jeromy Carrière,R. Kazman;J. Carriere,"Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",10.1109/INFVIS.1995.528688;10.1109/INFVIS.1995.528689;10.1109/VISUAL.1991.175815,"information visualization, software tools, visual programming languages",17,5,12,
Vis,1996,FEL: The Field Encapsulation Library,10.1109/VISUAL.1996.568115,http://doi.ieeecomputersociety.org/10.1109/VISUAL.1996.568115,241,247,C,"The paper describes the Field Encapsulation Library (FEL), which provides a grid independent application programmer's interface to gridded three dimensional field data. The C++ implementation of FEL is described, stressing the way in which the class hierarchy hides the underlying grid structure in a way that allows visualization algorithms to be written in a completely grid independent manner. Appropriately defined coordinate classes play an important role in providing this grid independence. High performance point location routines for data access are described and performance times are provided.",Steve Bryson;David N. Kenwright;Michael J. Gerald-Yamasaki,S. Bryson;D. Kenwright;M. Gerald-Yamasaki,"NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1995.485145;10.1109/VISUAL.1991.175771;10.1109/VISUAL.1992.235202,,17,7,0,
Vis,1996,Three Dimensional Visualization of Proteins in Cellular Interactions,10.1109/VISUAL.1996.568133,http://doi.ieeecomputersociety.org/10.1109/VISUAL.1996.568133,363,366,C,"In researching the communication mechanisms between cells of the immune system, visualization of proteins in three dimensions can be used to determine which proteins are capable of interacting with one another at a given time by showing their spatial colocality. Volume data sets are created using digital confocal immunofluorescence microscopy. A variety of visualization approaches are then used to examine the interactions. These include volume rendering, isosurface extraction, and virtual reality. Based on our experiences, we have concluded that no single one of these approaches provides a complete solution for visualizing biological data. However, in combination, their respective strengths complement one another to provide an understanding of the data.",Colin R. F. Monks;Patricia Crossno;George S. Davidson;Constantine J. Pavlakos;Abraham Kupfer;Cláudio T. Silva;Brian N. Wylie,C.R.F. Monks;P.J. Crossno;G. Davidson;C. Pavlakos;A. Kupfer;C. Silva;B. Wylie,"Dept. of Pediatrics, Nat. Jewish Center for Immunology & Respiratory Med., USA",10.1109/VISUAL.1994.346340,,17,4,0,
Vis,1998,Extremal feature extraction from 3-D vector and noisy scalar fields,10.1109/VISUAL.1998.745290,http://dx.doi.org/10.1109/VISUAL.1998.745290,95,102,C,"We are interested in feature extraction from volume data in terms of coherent surfaces and 3D space curves. The input can be an inaccurate scalar or vector field, sampled densely or sparsely on a regular 3D grid, in which poor resolution and the presence of spurious noisy samples make traditional iso-surface techniques inappropriate. In this paper, we present a general-purpose methodology to extract surfaces or curves from a digital 3D potential vector field {(s,v~)}, in which each voxel holds a scalar s designating the strength and a vector v~ indicating the direction. For scalar, sparse or low-resolution data, we ""vectorize"" and ""densify"" the volume by tensor voting to produce dense vector fields that are suitable as input to our algorithms, the extremal surface and curve algorithms. Both algorithms extract, with sub-voxel precision, coherent features representing local extrema in the given vector field. These coherent features are a hole-free triangulation mesh (in the surface case), and a set of connected, oriented and non-intersecting polyline segments (in the curve case). We demonstrate the general usefulness of both extremal algorithms on a variety of real data by properly extracting their inherent extremal properties, such as (a) shock waves induced by abrupt velocity or direction changes in a flow field, (b) interacting vortex cores and vorticity lines in a velocity field, (c) crest-lines and ridges implicit in a digital terrain map, and (d) grooves, anatomical lines and complex surfaces from noisy dental data.",Chi-Keung Tang;Gérard G. Medioni,C.-K. Tang;G. Medioni,"Univ. of Southern California, Los Angeles, CA, USA",10.1109/VISUAL.1991.175782;10.1109/VISUAL.1994.346327;10.1109/VISUAL.1994.346329;10.1109/VISUAL.1994.346328,"Surface and curve extremality, surface fitting, scalar and vector field visualization, Marching Cubes",17,7,20,
Vis,1998,Interactive deformations from tensor fields,10.1109/VISUAL.1998.745316,http://dx.doi.org/10.1109/VISUAL.1998.745316,297,304,C,"This paper presents techniques for interactively visualizing tensor fields using deformations. The conceptual idea behind this approach is to allow the tensor field to manifest its influence on idealized objects placed within the tensor field. This is similar, though not exactly the same, to surfaces deforming under load in order to relieve built up stress and strain. We illustrate the effectiveness of the Deviator-Isotropic tensor decomposition in deformation visualizations of CFD strain rate. We also investigate how directional flow techniques can be extended to distinguish between regions of tensile versus compressive forces.",Ed Boring;Alex T. Pang,E. Boring;A. Pang,"Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA",10.1109/VISUAL.1997.663929;10.1109/VISUAL.1996.567752;10.1109/VISUAL.1993.398849;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1992.235193;10.1109/VISUAL.1995.485141;10.1109/VISUAL.1994.346330;10.1109/VISUAL.1991.175789;10.1109/VISUAL.1994.346326;10.1109/VISUAL.1997.663857;10.1109/VISUAL.1992.235224;10.1109/VISUAL.1996.568139;10.1109/VISUAL.1994.346315,"tensor,stress, strain, shear, normal,directional flow, symmetric, antisymmetric, deviator, isotropic",17,11,32,
Vis,1998,Hierarchical volume analysis and visualization based on morphological operators,10.1109/VISUAL.1998.745321,http://dx.doi.org/10.1109/VISUAL.1998.745321,335,341,C,"One common problem in the practical application of volume visualization is the proper choice of transfer functions in order to color different parts of the volume meaningfully. This interactive process can be very complicated and time consuming. An alternative to the adjustment of transfer functions is the application of segmentation algorithms. These algorithms are often dedicated to a limited range of data sets and tend to be very compute intensive. We propose a morphology based hierarchical analysis to estimate the optical properties of the volume to be rendered. This approach requires fewer parameters and incorporates also spatial information, but it is far less compute intensive than most of the segmentation methods. The hierarchical analysis is constructed in analogy to the wavelet analysis, except for the fact, that nonlinear filters are used in our case. These morphological operators have a lower distortional influence on the analyzed structures than the usual linear filters. A special decomposition of the morphological operators is discussed, which leads to an efficient implementation of this approach. This technique reduces the three dimensional analysis to a one dimensional computation, as it is done in tensor product based linear filters. The resulting decomposition may also be parallelized easily. We demonstrate the usefulness of the proposed technique by applying it to medical and technical data sets.",Christoph Lürig;Thomas Ertl,C. Lurig;T. Ertl,"Comput. Graphics Group, Erlangen-Nurnberg Univ., Germany",,,17,5,20,
Vis,1999,Structured spatial domain image and data comparison metrics,10.1109/VISUAL.1999.809873,http://dx.doi.org/10.1109/VISUAL.1999.809873,97,515,C,"Often, images or datasets have to be compared to facilitate choices of visualization and simulation parameters respectively. Common comparison techniques include side-by-side viewing and juxtaposition, in order to facilitate visual verification of verisimilitude. We propose quantitative techniques which accentuate differences in images and datasets. The comparison is enabled through a collection of partial metrics which, essentially, measure the lack of correlation between the datasets or images being compared. That is, they attempt to expose and measure the extent of the inherent structures in the difference between images or datasets. Besides yielding numerical attributes, the metrics also produce images which can visually highlight differences. Our metrics are simple to compute and operate in the spatial domain. We demonstrate the effectiveness of our metrics through examples for comparing images and datasets.",Nivedita Sahasrabudhe;John E. West;Raghu Machiraju;Mark Janus,N. Sahasrabudhe;J.E. West;R. Machiraju;M. Janus,"NSF Eng. Res. Center, Mississippi State Univ., MS, USA",10.1109/VISUAL.1997.663848;10.1109/VISUAL.1990.146360,"metrics, steering, rendering, correlation measure",17,13,20,
Vis,1999,Interactive lens visualization techniques,10.1109/VISUAL.1999.809882,http://dx.doi.org/10.1109/VISUAL.1999.809882,155,521,C,"The paper describes new techniques for minimally immersive visualization of 3D scalar and vector fields, and visualization of document corpora. In our glyph based visualization system, the user interacts with the 3D volume of glyphs using a pair of button-enhanced 3D position and orientation trackers. The user may also examine the volume using an interactive lens, which is a rectangle that slices through the 3D volume and displays scalar information on its surface. A lens allows the display of scalar data in the 3D volume using a contour diagram, and a texture based volume rendering.",Chris Shaw 0002;James A. Hall;David S. Ebert;D. Aaron Roberts,C.D. Shaw;J.A. Hall;D.S. Ebert;D.A. Roberts,"Regina Univ., Sask., Canada",10.1109/VISUAL.1995.485141;10.1109/VISUAL.1996.568109,"Volumetric Data, Glyphs, Two-Handed Interfaces, Interactive Volume Rendering, Contour Diagrams, Stereoscopic Field Analyzer SFA, Seed Fill, Over Blending",17,4,19,
Vis,2000,Real-world relativity: image-based special relativistic visualization,10.1109/VISUAL.2000.885709,http://dx.doi.org/10.1109/VISUAL.2000.885709,303,310,C,"This paper describes a novel rendering technique for special relativistic visualization. It is an image-based method which allows to render high speed flights through real-world scenes filmed by a standard camera. The relativistic effects on image generation are determined by the relativistic aberration of light, the Doppler effect, and the searchlight effect. These account for changes of apparent geometry, color and brightness of the objects. It is shown how the relativistic effects can be taken into account by a modification of the plenoptic function. Therefore, all known image-based nonrelativistic rendering methods can easily be extended to incorporate relativistic rendering. Our implementation allows interactive viewing of relativistic panoramas and the production of movies which show super-fast travel. Examples in the form of snapshots and film sequences are included.",Daniel Weiskopf;Daniel Kobras;Hanns Ruder,D. Weiskopf;D. Kobras;H. Ruder,"Inst. of Astron. & Astrophys., Tubingen Univ., Germany",10.1109/VISUAL.1990.146368,"image-based rendering, plenoptic function, scientific visualization, special relativity",17,6,38,
Vis,2000,Interactive visualization of protein dynamics,10.1109/VISUAL.2000.885733,http://dx.doi.org/10.1109/VISUAL.2000.885733,465,468,C,"The study of time dependent characteristics of proteins is important for gaining insight into many biological processes. However, visualizing protein dynamics by animating atom trajectories does not provide satisfactory results. When the trajectory is sampled with large times steps, the impression of smooth motion will be destroyed due to the effects of temporal aliasing. Sampling with small time steps will result in the camouflage of interesting motions. In this case study, we discuss techniques for the interactive 3D visualization of the dynamics of the photoactive yellow protein. We use essential dynamics methods to filter out uninteresting atom motions from the larger concerted motions. In this way, clear and concise 3D animations of protein motions can be produced. In addition, we discuss various interactive techniques that allow exploration of the essential subspace of the protein. We discuss the merits of these techniques when applied to the analysis of the yellow protein.",Henk Huitema;Robert van Liere,H. Huitema;R. Van Liere,"Center for Math. & Comput. Sci., Amsterdam, Netherlands",,"molecular graphics, essential dynamics,animation, interactive exploration",17,8,7,
Vis,2000,Visual data fusion for applications of high-resolution numerical weather prediction,10.1109/VISUAL.2000.885736,http://dx.doi.org/10.1109/VISUAL.2000.885736,477,480,C,Non-traditional applications of scientific data challenge the typical approaches to visualization. In particular popular scientific visualization strategies fail when the expertise of the data consumer is in a different field than the one that generated the data and data from the user's domain must be utilized as well. This problem occurs when predictive weather simulations are used for a number of weather-sensitive applications. A data fusion approach is adopted for visualization design and utilized for specific example problems.,Lloyd Treinish,L.A. Treinish,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.1995.480821;10.1109/VISUAL.1998.745331,"visualization, data fusion, user tasks, graphics design, meteorology, weather forecasting, demographics, energy demand prediction",17,9,13,
Vis,2001,A virtual environment for simulated rat dissection: a case study of visualization for astronaut training,10.1109/VISUAL.2001.964564,http://dx.doi.org/10.1109/VISUAL.2001.964564,509,601,C,"Animal dissection for the scientific examination of organ subsystems is a delicate procedure. Performing this procedure under the complex environment of microgravity presents additional challenges because of the limited training opportunities available that can recreate the altered gravity environment. Traditional astronaut crew training often occurs several months in advance of experimentation, provides limited realism, and involves complicated logistics. We have developed an interactive virtual environment that can simulate several common tasks performed during animal dissection. In this paper, we describe the imaging modality used to reconstruct the rat, provide an overview of the simulation environment and briefly discuss some of the techniques used to manipulate the virtual rat.",Kevin Montgomery;Wm. LeRoy Heinrichs;Cynthia Bruyns;Simon Wildermuth,K. Montgomery;C. Bruyns;S. Wildermuth,"Nat. Biocomputation Center, Stanford Univ., CA, USA;Nat. Biocomputation Center, Stanford Univ., CA, USA;Nat. Biocomputation Center, Stanford Univ., CA, USA",,,17,4,5,
Vis,2002,Rendering the first star in the Universe - A case study,10.1109/VISUAL.2002.1183824,http://dx.doi.org/10.1109/VISUAL.2002.1183824,537,540,C,"For quantitative examination of phenomena that simultaneously occur on very different spatial and temporal scales, adaptive hierarchical schemes are required. A special numerical multilevel technique, associated with a particular hierarchical data structure, is so-called adaptive mesh refinement (AMR). It allows one to bridge a wide range of spatial and temporal resolutions and therefore gains increasing popularity. We describe the interplay of several visualization and VR software packages for rendering time dependent AMR simulations of the evolution of the first star in the universe. The work was done in the framework of a television production for Discovery Channel television, ""The Unfolding Universe."". Parts of the data were taken from one of the most complex AMR simulation ever carried out: It contained up to 27 levels of resolution, requiring modifications to the texture based AMR volume rendering algorithm that was used to depict the density distribution of the gaseous interstellar matter. A voice and gesture controlled CAVE application was utilized to define camera paths following the interesting features deep inside the computational domains. Background images created from cosmological computational data were combined with the final renderings.",Ralf Kähler;Donna J. Cox;Robert Patterson;Stuart Levy;Hans-Christian Hege;Tom Abel,R. Kahler;D. Cox;R. Patterson;S. Levy;H.-C. Hege;T. Abel,"Zuse Inst., Berlin, Germany",10.1109/VISUAL.2002.1183820,"3D texture based volume rendering, adaptive mesh refinement data, CAVE applications, data visualization",17,12,18,
Vis,2003,Visibility based methods and assessment for detail-recovery,10.1109/VISUAL.2003.1250407,http://dx.doi.org/10.1109/VISUAL.2003.1250407,457,464,C,"In this paper we propose a new method for the creation of normal maps for recovering the detail on simplified meshes and a set of objective techniques to metrically evaluate the quality of different recovering techniques. The proposed techniques, that automatically produces a normal-map texture for a simple 3D model that ""imitates"" the high frequency detail originally present in a second, much higher resolution one, is based on the computation of per-texel visibility and self-occlusion information. This information is used to define a point-to-point correspondence between simplified and hires meshes. Moreover, we introduce a number of criteria for measuring the quality (visual or otherwise) of a given mapping method, and provide efficient algorithms to implement them. Lastly, we apply them to rate different mapping methods, including the widely used ones and the new one proposed here.",Marco Tarini;Paolo Cignoni;Roberto Scopigno,M. Tarini;P. Cignoni;R. Scopigno,"ISTI, CNR, Pisa, Italy;ISTI, CNR, Pisa, Italy;ISTI, CNR, Pisa, Italy",10.1109/VISUAL.2002.1183784;10.1109/VISUAL.1998.745285,"simplification, texture mapping, detail recovery, normal mapping, texture for geometry",17,4,18,
Vis,2005,Scale-invariant volume rendering,10.1109/VISUAL.2005.1532808,http://dx.doi.org/10.1109/VISUAL.2005.1532808,295,302,C,"As standard volume rendering is based on an integral in physical space (or ""coordinate space""), it is inherently dependent on the scaling of this space. Although this dependency is appropriate for the realistic rendering of semitransparent volumetric objects, it has several unpleasant consequences for volume visualization. In order to overcome these disadvantages, a new variant of the volume rendering integral is proposed, which is defined in data space instead of physical space. Apart from achieving scale invariance, this new method supports the rendering of isosurfaces of uniform opacity and color, independently of the local gradient or"" the visualized scalar field. Moreover, it reveals certain structures in scalar fields even with constant transfer functions. Furthermore, it can be defined as the limit of infinitely many semitransparent isosurfaces, and is therefore based on an intuitive and at the same time precise definition. In addition to the discussion of these features of scale-invariant volume rendering, efficient adaptations of existing volume rendering algorithms and extensions for silhouette enhancement and local illumination by transmitted light are presented.",Martin Kraus,M. Kraus,,10.1109/VISUAL.2000.885683;10.1109/VISUAL.2000.885694;10.1109/VISUAL.1994.346331,"volume visualization, volume rendering, isosurfaces, silhouette enhancement, volume shading, translucence",17,2,12,
Vis,2005,Visualizing the tightening of knots,10.1109/VISUAL.2005.1532844,http://dx.doi.org/10.1109/VISUAL.2005.1532844,575,582,C,"The study of physical models for knots has recently received much interest in the mathematics community. In this paper, we consider the ropelength model, which considers knots tied in an idealized rope. This model is interesting in pure mathematics, and has been applied to the study of a variety of problems in the natural sciences as well. Modeling and visualizing the tightening of knots in this idealized rope poses some interesting challenges in computer graphics. In particular, self-contact in a deformable rope model is a difficult problem which cannot be handled by standard techniques. In this paper, we describe a solution based on reformulating the contact problem and using constrained-gradient techniques from nonlinear optimization. The resulting animations reveal new properties of the tightening flow and provide new insights into the geometric structure of tight knots and links.",Jason Cantarella;Michael Piatek;Eric J. Rawdon,J. Cantarella;M. Piatek;E. Rawdon,"Georgia Univ., Athens, GA, USA",,"collision detection, contact, flexible models, tight knots, ideal knots, ropelength, nonlinear optimization, constrained least squares",17,3,41,
Vis,2006,Subjective Quantification of Perceptual Interactions among some 2D Scientific Visualization Methods,10.1109/TVCG.2006.180,http://dx.doi.org/10.1109/TVCG.2006.180,1133,1140,J,"We present an evaluation of a parameterized set of 2D icon-based visualization methods where we quantified how perceptual interactions among visual elements affect effective data exploration. During the experiment, subjects quantified three different design factors for each method: the spatial resolution it could represent, the number of data values it could display at each point, and the degree to which it is visually linear. The class of visualization methods includes Poisson-disk distributed icons where icon size, icon spacing, and icon brightness can be set to a constant or coupled to data values from a 2D scalar field. By only coupling one of those visual components to data, we measured filtering interference for all three design factors. Filtering interference characterizes how different levels of the constant visual elements affect the evaluation of the data-coupled element. Our novel experimental methodology allowed us to generalize this perceptual information, gathered using ad-hoc artificial datasets, onto quantitative rules for visualizing real scientific datasets. This work also provides a framework for evaluating visualizations of multi-valued data that incorporate additional visual cues, such as icon orientation or color",Daniel Acevedo Feliz;David H. Laidlaw,Daniel Acevedo;David Laidlaw,,10.1109/INFVIS.1997.636792;10.1109/INFVIS.2000.885092,"Perception models, 2D visualization methods, visualization evaluation, perceptual interactions, visual design",17,11,36,
VAST,2007,LAHVA: Linked Animal-Human Health Visual Analytics,10.1109/VAST.2007.4388993,http://dx.doi.org/10.1109/VAST.2007.4388993,27,34,C,"Coordinated animal-human health monitoring can provide an early warning system with fewer false alarms for naturally occurring disease outbreaks, as well as biological, chemical and environmental incidents. This monitoring requires the integration and analysis of multi-field, multi-scale and multi-source data sets. In order to better understand these data sets, models and measurements at different resolutions must be analyzed. To facilitate these investigations, we have created an application to provide a visual analytics framework for analyzing both human emergency room data and veterinary hospital data. Our integrated visual analytic tool links temporally varying geospatial visualization of animal and human patient health information with advanced statistical analysis of these multi-source data. Various statistical analysis techniques have been applied in conjunction with a spatio-temporal viewing window. Such an application provides researchers with the ability to visually search the data for clusters in both a statistical model view and a spatio-temporal view. Our interface provides a factor specification/filtering component to allow exploration of causal factors and spread patterns. In this paper, we will discuss the application of our linked animal-human visual analytics (LAHVA) tool to two specific case studies. The first case study is the effect of seasonal influenza and its correlation with different companion animals (e.g., cats, dogs) syndromes. Here we use data from the Indiana Network for Patient Care (INPC) and Banfield Pet Hospitals in an attempt to determine if there are correlations between respiratory syndromes representing the onset of seasonal influenza in humans and general respiratory syndromes in cats and dogs. Our second case study examines the effect of the release of industrial wastewater in a community through companion animal surveillance.",Ross Maciejewski;Benjamin Tyner;Yun Jang;Cheng Zheng;Rimma V. Nehme;David S. Ebert;William S. Cleveland;Mourad Ouzzani;Shaun J. Grannis;Lawrence T. Glickman,Ross Maciejewski;Benjamin Tyner;Yun Jang;Cheng Zheng;Rimma V. Nehme;David S. Ebert;William S. Cleveland;Mourad Ouzzani;Shaun J. Grannis;Lawrence T. Glickman,Purdue University Regional Visualization and Analytics Center (PURVAC);Purdue University Regional Visualization and Analytics Center (PURVAC);Purdue University Regional Visualization and Analytics Center (PURVAC);Purdue University Regional Visualization and Analytics Center (PURVAC);Purdue University Regional Visualization and Analytics Center (PURVAC);Purdue University Regional Visualization and Analytics Center (PURVAC);Purdue University Regional Visualization and Analytics Center (PURVAC);Purdue University Regional Visualization and Analytics Center (PURVAC);Regenstrief Institute and Indiana University School of Medicine;Purdue University School of Veterinary Medicine Clinical Epidemiology Group,,,17,12,27,
VAST,2007,Visual Analytics Approach to User-Controlled Evacuation Scheduling,10.1109/VAST.2007.4388995,http://dx.doi.org/10.1109/VAST.2007.4388995,43,50,C,"Application of the ideas of visual analytics is a promising approach to supporting decision making, in particular, where the problems have geographic (or spatial) and temporal aspects. Visual analytics may be especially helpful in time-critical applications, which pose hard challenges to decision support. We have designed a suite of tools to support transportation-planning tasks such as emergency evacuation of people from a disaster- affected area. The suite combines a tool for automated scheduling based on a genetic algorithm with visual analytics techniques allowing the user to evaluate tool results and direct its work. A transportation schedule, which is generated by the tool, is a complex construct involving geographical space, time, and heterogeneous objects (people and vehicles) with states and positions varying in time. We apply task-analytical approach to design techniques that could effectively support a human planner in the analysis of this complex information H. 1.2 [User/Machine Systems]: Human information processing - Visual Analytics; 1.6.9 [Visualization]: information visualization.",Gennady L. Andrienko;Natalia V. Andrienko;Ulrich Bartling,Gennady Andrienko;Natalia Andrienko;Ulrich Bartling,"Fraunhofer Institute IAIS (Intelligent Analysis and Information Systems), Germany;Fraunhofer Institute IAIS (Intelligent Analysis and Information Systems), Germany;Fraunhofer Institute IAIS (Intelligent Analysis and Information Systems), Germany",,"Geovisualization, transportation planning, vehicle scheduling, task-centered design, coordinated multiple views",17,3,16,
Vis,2007,Interactive Isosurface Ray Tracing of Time-Varying Tetrahedral Volumes,10.1109/TVCG.2007.70566,http://dx.doi.org/10.1109/TVCG.2007.70566,1727,1734,J,"We describe a system for interactively rendering isosurfaces of tetrahedral finite-element scalar fields using coherent ray tracing techniques on the CPU. By employing state-of-the art methods in polygonal ray tracing, namely aggressive packet/frustum traversal of a bounding volume hierarchy, we can accommodate large and time-varying unstructured data. In conjunction with this efficiency structure, we introduce a novel technique for intersecting ray packets with tetrahedral primitives. Ray tracing is flexible, allowing for dynamic changes in isovalue and time step, visualization of multiple isosurfaces, shadows, and depth-peeling transparency effects. The resulting system offers the intuitive simplicity of isosurfacing, guaranteed-correct visual results, and ultimately a scalable, dynamic and consistently interactive solution for visualizing unstructured volumes.",Ingo Wald;Heiko Friedrich;Aaron Knoll;Charles D. Hansen,Ingo Wald;Heiko Friedrich;Aaron Knoll;Charles D. Hansen,"SCI Institute, University of Utah, as well as with Intel Corp, Santa Clara, CA;Computer Graphics Group at Saarland University, Saarbrücken, Germany;SCI Institute, University of Utah;SCI Institute, University of Utah",10.1109/VISUAL.2005.1532796;10.1109/TVCG.2006.171;10.1109/VISUAL.2003.1250390;10.1109/TVCG.2006.110;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.1998.745713;10.1109/VISUAL.1998.745300,"Ray Tracing, Isosurfaces, Unstructured meshes, Tetrahedra, Scalar Fields, Time-varying data",17,14,41,
VAST,2008,The Scalable Reasoning System: Lightweight visualization for distributed analytics,10.1109/VAST.2008.4677366,http://dx.doi.org/10.1109/VAST.2008.4677366,131,138,C,"A central challenge in visual analytics is the creation of accessible, widely distributable analysis applications that bring the benefits of visual discovery to as broad a user base as possible. Moreover, to support the role of visualization in the knowledge creation process, it is advantageous to allow users to describe the reasoning strategies they employ while interacting with analytic environments. We introduce an application suite called the scalable reasoning system (SRS), which provides Web-based and mobile interfaces for visual analysis. The service-oriented analytic framework that underlies SRS provides a platform for deploying pervasive visual analytic environments across an enterprise. SRS represents a ldquolightweightrdquo approach to visual analytics whereby thin client analytic applications can be rapidly deployed in a platform-agnostic fashion. Client applications support multiple coordinated views while giving analysts the ability to record evidence, assumptions, hypotheses and other reasoning artifacts. We describe the capabilities of SRS in the context of a real-world deployment at a regional law enforcement organization.",William A. Pike;Joe Bruce;Bob Baddeley;Daniel M. Best;Lyndsey Franklin;Richard May;Douglas M. Rice;Roderick M. Riensche;Katarina Younkin,William A. Pike;Joe Bruce;Bob Baddeley;Daniel Best;Lyndsey Franklin;Richard May;Douglas M. Rice;Rick Riensche;Katarina Younkin,"Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA",10.1109/TVCG.2007.70577;10.1109/TVCG.2006.142;10.1109/VAST.2007.4388996;10.1109/INFVIS.2005.1532133;10.1109/VISUAL.1993.398874;10.1109/VAST.2007.4389006;10.1109/VAST.2007.4388991,"Web visualization, mobile visualization, analytic reasoning, law enforcement, multiple views",17,8,21,
Vis,2008,Smooth Surface Extraction from Unstructured Point-based Volume Data Using PDEs,10.1109/TVCG.2008.164,http://dx.doi.org/10.1109/TVCG.2008.164,1531,1546,J,"Smooth surface extraction using partial differential equations (PDEs) is a well-known and widely used technique for visualizing volume data. Existing approaches operate on gridded data and mainly on regular structured grids. When considering unstructured point-based volume data where sample points do not form regular patterns nor are they connected in any form, one would typically resample the data over a grid prior to applying the known PDE-based methods. We propose an approach that directly extracts smooth surfaces from unstructured point-based volume data without prior resampling or mesh generation. When operating on unstructured data one needs to quickly derive neighborhood information. The respective information is retrieved by partitioning the 3D domain into cells using a fed-tree and operating on its cells. We exploit neighborhood information to estimate gradients and mean curvature at every sample point using a four-dimensional least-squares fitting approach. Gradients and mean curvature are required for applying the chosen PDE-based method that combines hyperbolic advection to an isovalue of a given scalar field and mean curvature flow. Since we are using an explicit time-integration scheme, time steps and neighbor locations are bounded to ensure convergence of the process. To avoid small global time steps, one can use asynchronous local integration. We extract a smooth surface by successively fitting a smooth auxiliary function to the data set. This auxiliary function is initialized as a signed distance function. For each sample and for every time step we compute the respective gradient, the mean curvature, and a stable time step. With these informations the auxiliary function is manipulated using an explicit Euler time integration. The process successively continues with the next sample point in time. If the norm of the auxiliary function gradient in a sample exceeds a given threshold at some time, the auxiliary function is reinitialized to a signed distance function. After convergence of the evolvution, the resulting smooth surface is obtained by extracting the zero isosurface from the auxiliary function using direct isosurface extraction from unstructured point-based volume data and rendering the extracted surface using point-based rendering methods.",Paul Rosenthal;Lars Linsen,Paul Rosenthal;Lars Linsen,Jacobs University;Jacobs University,10.1109/VISUAL.2002.1183773;10.1109/VISUAL.2003.1250357,"PDEs, surface extraction, level sets, point-based visualization",17,10,34,
Vis,2008,Visualizing Particle/Flow Structure Interactions in the Small Bronchial Tubes,10.1109/TVCG.2008.183,http://dx.doi.org/10.1109/TVCG.2008.183,1412,1427,J,"Particle deposition in the small bronchial tubes (generations six through twelve) is strongly influenced by the vortex-dominated secondary flows that are induced by axial curvature of the tubes. In this paper, we employ particle destination maps in conjunction with two-dimensional, finite-time Lyapunov exponent maps to illustrate how the trajectories of finite-mass particles are influenced by the presence of vortices. We consider two three-generation bronchial tube models: a planar, asymmetric geometry and a non-planar, asymmetric geometry. Our visualizations demonstrate that these techniques, coupled with judiciously seeded particle trajectories, are effective tools for studying particle/flow structure interactions.",Bela Soni;David S. Thompson;Raghu Machiraju,Bela Soni;David Thompson;Raghu Machiraju,Mississippi State University;Mississippi State University;The Ohio State University,10.1109/TVCG.2007.70551;10.1109/TVCG.2007.70554,"FTLE, particle trajectory, visualization, bronchial tube",17,14,30,
Vis,2009,"High-Quality, Semi-Analytical Volume Rendering for AMR Data",10.1109/TVCG.2009.149,http://dx.doi.org/10.1109/TVCG.2009.149,1611,1618,J,"This paper presents a pipeline for high quality volume rendering of adaptive mesh refinement (AMR) datasets. We introduce a new method allowing high quality visualization of hexahedral cells in this context; this method avoids artifacts like discontinuities in the isosurfaces. To achieve this, we choose the number and placement of sampling points over the cast rays according to the analytical properties of the reconstructed signal inside each cell. We extend our method to handle volume shading of such cells. We propose an interpolation scheme that guarantees continuity between adjacent cells of different AMR levels. We introduce an efficient hybrid CPU-GPU mesh traversal technique. We present an implementation of our AMR visualization method on current graphics hardware, and show results demonstrating both the quality and performance of our method.",Stéphane Marchesin;Guillaume Colin de Verdière,Stephane Marchesin;Guillaume Colin De Verdiere,,10.1109/VISUAL.2000.885683;10.1109/VISUAL.2004.85;10.1109/VISUAL.2005.1532793;10.1109/TVCG.2008.157;10.1109/VISUAL.2003.1250384;10.1109/TVCG.2008.186,"Volume rendering, AMR data, Volume shading",17,14,20,
Vis,2009,Verifiable Visualization for Isosurface Extraction,10.1109/TVCG.2009.194,http://dx.doi.org/10.1109/TVCG.2009.194,1227,1234,J,"Visual representations of isosurfaces are ubiquitous in the scientific and engineering literature. In this paper, we present techniques to assess the behavior of isosurface extraction codes. Where applicable, these techniques allow us to distinguish whether anomalies in isosurface features can be attributed to the underlying physical process or to artifacts from the extraction process. Such scientific scrutiny is at the heart of verifiable visualization - subjecting visualization algorithms to the same verification process that is used in other components of the scientific pipeline. More concretely, we derive formulas for the expected order of accuracy (or convergence rate) of several isosurface features, and compare them to experimentally observed results in the selected codes. This technique is practical: in two cases, it exposed actual problems in implementations. We provide the reader with the range of responses they can expect to encounter with isosurface techniques, both under ldquonormal operating conditionsrdquo and also under adverse conditions. Armed with this information - the results of the verification process - practitioners can judiciously select the isosurface extraction technique appropriate for their problem of interest, and have confidence in its behavior.",Tiago Etiene;Carlos Scheidegger;Luis Gustavo Nonato;Robert Michael Kirby;Cláudio T. Silva,Tiago Etiene;Carlos Scheidegger;Luis Gustavo Nonato;Robert Mike Kirby;Cláudio Silva,University of Utah;University of Utah;Universidade de São Paulo;University of Utah;University of Utah,10.1109/TVCG.2006.149;10.1109/VISUAL.1994.346331,"Verification, V&V, Isosurface Extraction, Marching Cubes",17,16,29,
Vis,2010,Edge Aware Anisotropic Diffusion for 3D Scalar Data,10.1109/TVCG.2010.147,http://dx.doi.org/10.1109/TVCG.2010.147,1376,1385,J,In this paper we present a novel anisotropic diffusion model targeted for 3D scalar field data. Our model preserves material boundaries as well as fine tubular structures while noise is smoothed out. One of the major novelties is the use of the directional second derivative to define material boundaries instead of the gradient magnitude for thresholding. This results in a diffusion model that has much lower sensitivity to the diffusion parameter and smoothes material boundaries consistently compared to gradient magnitude based techniques. We empirically analyze the stability and convergence of the proposed diffusion and demonstrate its de-noising capabilities for both analytic and real data. We also discuss applications in the context of volume rendering.,Zahid Hossain 0001;Torsten Möller,Zahid Hosssain;Torsten Moller,Simon Fraser University;Simon Fraser University,10.1109/VISUAL.2002.1183766;10.1109/VISUAL.2003.1250414;10.1109/VISUAL.2004.96;10.1109/VISUAL.2001.964516,"Anisotropic diffusion, PDE, De-noising, Scale-Space, Principal Curvatures",17,13,40,
Vis,2011,A Scale Space Based Persistence Measure for Critical Points in 2D Scalar fields,10.1109/TVCG.2011.159,http://dx.doi.org/10.1109/TVCG.2011.159,2045,2052,J,"This paper introduces a novel importance measure for critical points in 2D scalar fields. This measure is based on a combination of the deep structure of the scale space with the well-known concept of homological persistence. We enhance the noise robust persistence measure by implicitly taking the hill-, ridge- and outlier-like spatial extent of maxima and minima into account. This allows for the distinction between different types of extrema based on their persistence at multiple scales. Our importance measure can be computed efficiently in an out-of-core setting. To demonstrate the practical relevance of our method we apply it to a synthetic and a real-world data set and evaluate its performance and scalability.",Jan Reininghaus;Natallia Kotava;David Günther;Jens Kasten;Hans Hagen;Ingrid Hotz,Jan Reininghaus;Natallia Kotava;David Guenther;Jens Kasten;Hans Hagen;Ingrid Hotz,"Zuse Institute Berlin, Germany;University of Kaiserslautern, Germany;Zuse Institute Berlin, Germany;Zuse Institute Berlin, Germany;University of Kaiserslautern, Germany;Zuse Institute Berlin, Germany",10.1109/TVCG.2008.110;10.1109/TVCG.2008.162;10.1109/TVCG.2007.70603;10.1109/TVCG.2009.177;10.1109/TVCG.2006.186,"Scale space, persistence, discrete Morse theory",17,19,40,
Vis,2011,iView: A Feature Clustering Framework for Suggesting Informative Views in Volume Visualization,10.1109/TVCG.2011.218,http://dx.doi.org/10.1109/TVCG.2011.218,1959,1968,J,"The unguided visual exploration of volumetric data can be both a challenging and a time-consuming undertaking. Identifying a set of favorable vantage points at which to start exploratory expeditions can greatly reduce this effort and can also ensure that no important structures are being missed. Recent research efforts have focused on entropy-based viewpoint selection criteria that depend on scalar values describing the structures of interest. In contrast, we propose a viewpoint suggestion pipeline that is based on feature-clustering in high-dimensional space. We use gradient/normal variation as a metric to identify interesting local events and then cluster these via k-means to detect important salient composite features. Next, we compute the maximum possible exposure of these composite feature for different viewpoints and calculate a 2D entropy map parameterized in longitude and latitude to point out promising view orientations. Superimposed onto an interactive track-ball interface, users can then directly use this entropy map to quickly navigate to potentially interesting viewpoints where visibility-based transfer functions can be employed to generate volume renderings that minimize occlusions. To give full exploration freedom to the user, the entropy map is updated on the fly whenever a view has been selected, pointing to new and promising but so far unseen view directions. Alternatively, our system can also use a set-cover optimization algorithm to provide a minimal set of views needed to observe all features. The views so generated could then be saved into a list for further inspection or into a gallery for a summary presentation.",Ziyi Zheng;Nafees Ahmed;Klaus Mueller,Ziyi Zheng;Nafees Ahmed;Klaus Mueller,Stony Brook University;Stony Brook University;Stony Brook University,10.1109/TVCG.2009.156;10.1109/TVCG.2007.70576;10.1109/TVCG.2008.162;10.1109/TVCG.2008.159;10.1109/TVCG.2010.214;10.1109/TVCG.2009.172;10.1109/VISUAL.2005.1532833;10.1109/VISUAL.2005.1532818;10.1109/TVCG.2006.124;10.1109/TVCG.2009.185;10.1109/TVCG.2009.189;10.1109/VISUAL.2003.1250414;10.1109/VISUAL.2005.1532834,"Direct volume rendering, k-means, entropy, view suggestion, set-cover problem, ant colony optimization",17,14,42,
InfoVis,2013,Variant View: Visualizing Sequence Variants in their Gene Context,10.1109/TVCG.2013.214,http://dx.doi.org/10.1109/TVCG.2013.214,2546,2555,J,"Scientists use DNA sequence differences between an individual's genome and a standard reference genome to study the genetic basis of disease. Such differences are called sequence variants, and determining their impact in the cell is difficult because it requires reasoning about both the type and location of the variant across several levels of biological context. In this design study, we worked with four analysts to design a visualization tool supporting variant impact assessment for three different tasks. We contribute data and task abstractions for the problem of variant impact assessment, and the carefully justified design and implementation of the Variant View tool. Variant View features an information-dense visual encoding that provides maximal information at the overview level, in contrast to the extensive navigation required by currently-prevalent genome browsers. We provide initial evidence that the tool simplified and accelerated workflows for these three tasks through three case studies. Finally, we reflect on the lessons learned in creating and refining data and task abstractions that allow for concise overviews of sprawling information spaces that can reduce or remove the need for the memory-intensive use of navigation.",Joel A. Ferstay;Cydney B. Nielsen;Tamara Munzner,Joel A. Ferstay;Cydney B. Nielsen;Tamara Munzner,University of British Columbia;University of British Columbia;University of British Columbia,10.1109/TVCG.2009.111;10.1109/TVCG.2008.109;10.1109/TVCG.2012.213;10.1109/TVCG.2011.185;10.1109/INFVIS.2003.1249023;10.1109/TVCG.2009.116;10.1109/TVCG.2009.167;10.1109/TVCG.2011.209,"Information visualization, design study, bioinformatics, genetic variants",17,14,36,
VAST,2014,Visual Analytics for Comparison of Ocean Model Output with Reference Data: Detecting and Analyzing Geophysical Processes Using Clustering Ensembles,10.1109/TVCG.2014.2346751,http://dx.doi.org/10.1109/TVCG.2014.2346751,1893,1902,J,"Researchers assess the quality of an ocean model by comparing its output to that of a previous model version or to observations. One objective of the comparison is to detect and to analyze differences and similarities between both data sets regarding geophysical processes, such as particular ocean currents. This task involves the analysis of thousands or hundreds of thousands of geographically referenced temporal profiles in the data. To cope with the amount of data, modelers combine aggregation of temporal profiles to single statistical values with visual comparison. Although this strategy is based on experience and a well-grounded body of expert knowledge, our discussions with domain experts have shown that it has two limitations: (1) using a single statistical measure results in a rather limited scope of the comparison and in significant loss of information, and (2) the decisions modelers have to make in the process may lead to important aspects being overlooked.",Patrick Köthur;Mike Sips;Henryk Dobslaw;Doris Dransch,Patrick Köthur;Mike Sips;Henryk Dobslaw;Doris Dransch,"GFZ German Research Centre for Geosciences, Potsdam, Germany;GFZ German Research Centre for Geosciences, Potsdam, Germany;GFZ German Research Centre for Geosciences, Potsdam, Germany;GFZ German Research Centre for Geosciences, Potsdam, Germany",10.1109/TVCG.2012.190;10.1109/TVCG.2012.284;10.1109/TVCG.2008.139,"Ocean modeling, model assessment, geospatial time series, cluster ensembles, visual comparison, visual analytics",17,17,43,
SciVis,2015,Occlusion-free Blood Flow Animation with Wall Thickness Visualization,10.1109/TVCG.2015.2467961,http://dx.doi.org/10.1109/TVCG.2015.2467961,728,737,J,"We present the first visualization tool that combines pathlines from blood flow and wall thickness information. Our method uses illustrative techniques to provide occlusion-free visualization of the flow. We thus offer medical researchers an effective visual analysis tool for aneurysm treatment risk assessment. Such aneurysms bear a high risk of rupture and significant treatment-related risks. Therefore, to get a fully informed decision it is essential to both investigate the vessel morphology and the hemodynamic data. Ongoing research emphasizes the importance of analyzing the wall thickness in risk assessment. Our combination of blood flow visualization and wall thickness representation is a significant improvement for the exploration and analysis of aneurysms. As all presented information is spatially intertwined, occlusion problems occur. We solve these occlusion problems by dynamic cutaway surfaces. We combine this approach with a glyph-based blood flow representation and a visual mapping of wall thickness onto the vessel surface. We developed a GPU-based implementation of our visualizations which facilitates wall thickness analysis through real-time rendering and flexible interactive data exploration mechanisms. We designed our techniques in collaboration with domain experts, and we provide details about the evaluation of the technique and tool.",Kai Lawonn;Sylvia Saalfeld;Anna Vilanova;Bernhard Preim;Tobias Isenberg 0001,Kai Lawonn;Sylvia Glaßer;Anna Vilanova;Bernhard Preim;Tobias Isenberg,"University of Magdeburg, Germany;University of Magdeburg, Germany;TU Delft, Netherlands;University of Magdeburg, Germany;Inria, France",10.1109/TVCG.2009.138;10.1109/TVCG.2011.243;10.1109/TVCG.2014.2346406;10.1109/TVCG.2010.153;10.1109/TVCG.2011.215;10.1109/VISUAL.2004.48,"Medical visualization, aneurysms, blood flow, wall thickness, illustrative visualization",17,17,43,
VAST,2015,Urbane: A 3D framework to support data driven decision making in urban development,10.1109/VAST.2015.7347636,http://dx.doi.org/10.1109/VAST.2015.7347636,97,104,C,"Architects working with developers and city planners typically rely on experience, precedent and data analyzed in isolation when making decisions that impact the character of a city. These decisions are critical in enabling vibrant, sustainable environments but must also negotiate a range of complex political and social forces. This requires those shaping the built environment to balance maximizing the value of a new development with its impact on the character of a neighborhood. As a result architects are focused on two issues throughout the decision making process: a) what defines the character of a neighborhood? and b) how will a new development change its neighborhood? In the first, character can be influenced by a variety of factors and understanding the interplay between diverse data sets is crucial; including safety, transportation access, school quality and access to entertainment. In the second, the impact of a new development is measured, for example, by how it impacts the view from the buildings that surround it. In this paper, we work in collaboration with architects to design Urbane, a 3-dimensional multi-resolution framework that enables a data-driven approach for decision making in the design of new urban development. This is accomplished by integrating multiple data layers and impact analysis techniques facilitating architects to explore and assess the effect of these attributes on the character and value of a neighborhood. Several of these data layers, as well as impact analysis, involve working in 3-dimensions and operating in real time. Efficient computation and visualization is accomplished through the use of techniques from computer graphics. We demonstrate the effectiveness of Urbane through a case study of development in Manhattan depicting how a data-driven understanding of the value and impact of speculative buildings can benefit the design-development process between architects, planners and developers.",Nivan Ferreira;Marcos Lage;Harish Doraiswamy;Huy T. Vo;Luc Wilson;Heidi Werner;Muchan Park;Cláudio T. Silva,Nivan Ferreira;Marcos Lage;Harish Doraiswamy;Huy Vo;Luc Wilson;Heidi Werner;Muchan Park;Cláudio Silva,"New York University, USA;Universidade Federal Fluminense, Brazil;New York University, USA;New York University, USA;Kohn Pedersen Fox Associates PC, USA;Kohn Pedersen Fox Associates PC, USA;Kohn Pedersen Fox Associates PC, USA;New York University, USA",10.1109/VAST.2008.4677356;10.1109/TVCG.2014.2346446;10.1109/TVCG.2007.70574;10.1109/TVCG.2013.226;10.1109/TVCG.2007.70523;10.1109/TVCG.2013.228;10.1109/TVCG.2014.2346893;10.1109/TVCG.2014.2346898,,17,12,39,
InfoVis,2016,Evaluation of Graph Sampling: A Visualization Perspective,10.1109/TVCG.2016.2598867,http://dx.doi.org/10.1109/TVCG.2016.2598867,401,410,J,"Graph sampling is frequently used to address scalability issues when analyzing large graphs. Many algorithms have been proposed to sample graphs, and the performance of these algorithms has been quantified through metrics based on graph structural properties preserved by the sampling: degree distribution, clustering coefficient, and others. However, a perspective that is missing is the impact of these sampling strategies on the resultant visualizations. In this paper, we present the results of three user studies that investigate how sampling strategies influence node-link visualizations of graphs. In particular, five sampling strategies widely used in the graph mining literature are tested to determine how well they preserve visual features in node-link diagrams. Our results show that depending on the sampling strategy used different visual features are preserved. These results provide a complimentary view to metric evaluations conducted in the graph mining literature and provide an impetus to conduct future visualization studies.",Yanhong Wu;Nan Cao;Daniel Archambault;Qiaomu Shen;Huamin Qu;Weiwei Cui,Yanhong Wu;Nan Cao;Daniel Archambault;Qiaomu Shen;Huamin Qu;Weiwei Cui,"Hong Kong University of Science and Technology;New York University, Shanghai;Swansea University;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Microsoft Research Asia",10.1109/TVCG.2015.2468151;10.1109/VISUAL.2005.1532819;10.1109/TVCG.2008.151;10.1109/TVCG.2006.147;10.1109/TVCG.2006.120;10.1109/INFVIS.2004.1;10.1109/TVCG.2007.70535;10.1109/TVCG.2008.135;10.1109/TVCG.2012.238;10.1109/TVCG.2013.232,Graph visualization;graph sampling;empirical evaluation,17,27,52,
VAST,2016,Blockwise Human Brain Network Visual Comparison Using NodeTrix Representation,10.1109/TVCG.2016.2598472,http://dx.doi.org/10.1109/TVCG.2016.2598472,181,190,J,"Visually comparing human brain networks from multiple population groups serves as an important task in the field of brain connectomics. The commonly used brain network representation, consisting of nodes and edges, may not be able to reveal the most compelling network differences when the reconstructed networks are dense and homogeneous. In this paper, we leveraged the block information on the Region Of Interest (ROI) based brain networks and studied the problem of blockwise brain network visual comparison. An integrated visual analytics framework was proposed. In the first stage, a two-level ROI block hierarchy was detected by optimizing the anatomical structure and the predictive comparison performance simultaneously. In the second stage, the NodeTrix representation was adopted and customized to visualize the brain network with block information. We conducted controlled user experiments and case studies to evaluate our proposed solution. Results indicated that our visual analytics method outperformed the commonly used node-link graph and adjacency matrix design in the blockwise network comparison tasks. We have shown compelling findings from two real-world brain network data sets, which are consistent with the prior connectomics studies.",Xinsong Yang;Lei Shi 0002;Madelaine Daianu;Hanghang Tong;Qingsong Liu;Paul M. Thompson,Xinsong Yang;Lei Shi;Madelaine Daianu;Hanghang Tong;Qingsong Liu;Paul Thompson,"Chinese Academy of Sciences, SKLCSInstitute of Software;Chinese Academy of Sciences, SKLCSInstitute of Software;Imaging Genetics CenterMark &#x0026; Mary Stevens Institute for Neuroimaging &#x0026; InformaticsUniversity of Southern California;School of Computing, Informatics and Decision Systems EngineeringArizona State University;Chinese Academy of Sciences, SKLCSInstitute of Software;Imaging Genetics CenterMark &#x0026; Mary Stevens Institute for Neuroimaging &#x0026; InformaticsUniversity of Southern California",10.1109/TVCG.2014.2346312;10.1109/VISUAL.2005.1532773;10.1109/TVCG.2007.70582,Brain Network;Visual Comparison;Hybrid Representation,17,16,42,
SciVis,2017,"The Good, the Bad, and the Ugly: A Theoretical Framework for the Assessment of Continuous Colormaps",10.1109/TVCG.2017.2743978,http://dx.doi.org/10.1109/TVCG.2017.2743978,923,933,J,"A myriad of design rules for what constitutes a “good” colormap can be found in the literature. Some common rules include order, uniformity, and high discriminative power. However, the meaning of many of these terms is often ambiguous or open to interpretation. At times, different authors may use the same term to describe different concepts or the same rule is described by varying nomenclature. These ambiguities stand in the way of collaborative work, the design of experiments to assess the characteristics of colormaps, and automated colormap generation. In this paper, we review current and historical guidelines for colormap design. We propose a specified taxonomy and provide unambiguous mathematical definitions for the most common design rules.",Roxana Bujack;Terece L. Turton;Francesca Samsel;Colin Ware;David H. Rogers;James P. Ahrens,Roxana Bujack;Terece L. Turton;Francesca Samsel;Colin Ware;David H. Rogers;James Ahrens,"Los Alamos National Laboratory;University of Texas, Austin;University of Texas, Austin;University of New Hampshire;Los Alamos National Laboratory;Los Alamos National Laboratory",10.1109/VISUAL.1995.480803;10.1109/TVCG.2014.2346978;10.1109/TVCG.2016.2599214;10.1109/VISUAL.2002.1183788;10.1109/TVCG.2014.2346325;10.1109/TVCG.2016.2599106;10.1109/VISUAL.1990.146383;10.1109/VISUAL.1990.146372;10.1109/VISUAL.2001.964510,"colormap,survey,taxonomy,order,uniformity,discriminative power,smoothness,monotonicity,linearity,speed",17,11,90,
VAST,2017,Visualizing Confidence in Cluster-Based Ensemble Weather Forecast Analyses,10.1109/TVCG.2017.2745178,http://dx.doi.org/10.1109/TVCG.2017.2745178,109,119,J,"In meteorology, cluster analysis is frequently used to determine representative trends in ensemble weather predictions in a selected spatio-temporal region, e.g., to reduce a set of ensemble members to simplify and improve their analysis. Identified clusters (i.e., groups of similar members), however, can be very sensitive to small changes of the selected region, so that clustering results can be misleading and bias subsequent analyses. In this article, we - a team of visualization scientists and meteorologists-deliver visual analytics solutions to analyze the sensitivity of clustering results with respect to changes of a selected region. We propose an interactive visual interface that enables simultaneous visualization of a) the variation in composition of identified clusters (i.e., their robustness), b) the variability in cluster membership for individual ensemble members, and c) the uncertainty in the spatial locations of identified trends. We demonstrate that our solution shows meteorologists how representative a clustering result is, and with respect to which changes in the selected region it becomes unstable. Furthermore, our solution helps to identify those ensemble members which stably belong to a given cluster and can thus be considered similar. In a real-world application case we show how our approach is used to analyze the clustering behavior of different regions in a forecast of “Tropical Cyclone Karl”, guiding the user towards the cluster robustness information required for subsequent ensemble analysis.",Alexander Kumpf;Bianca Tost;Marlene Baumgart;Michael Riemer;Rüdiger Westermann;Marc Rautenhaus,Alexander Kumpf;Bianca Tost;Marlene Baumgart;Michael Riemer;Rüdiger Westermann;Marc Rautenhaus,"Computer Graphics & Visualization Group, Technische Universität München, Garching, Germany;Computer Graphics & Visualization Group, Technische Universität München, Garching, Germany;Institute of Atmospheric Physics, Johannes Gutenberg Universität Mainz, Mainz, Germany;Institute of Atmospheric Physics, Johannes Gutenberg Universität Mainz, Mainz, Germany;Computer Graphics & Visualization Group, Technische Universität München, Garching, Germany;Computer Graphics & Visualization Group, Technische Universität München, Garching, Germany",10.1109/TVCG.2014.2346626;10.1109/TVCG.2010.190;10.1109/TVCG.2006.168;10.1109/TVCG.2015.2467204;10.1109/TVCG.2016.2598868;10.1109/VISUAL.1999.809866;10.1109/INFVIS.2002.1173157;10.1109/TVCG.2013.141;10.1109/TVCG.2010.138;10.1109/TVCG.2006.170;10.1109/TVCG.2012.207;10.1109/TVCG.2013.177;10.1109/TVCG.2014.2346332;10.1109/TVCG.2013.143,"Uncertainty visualization,ensemble visualization,clustering,meteorology",17,11,72,
InfoVis,2018,What Do We Talk About When We Talk About Dashboards?,10.1109/TVCG.2018.2864903,http://dx.doi.org/10.1109/TVCG.2018.2864903,682,692,J,"Dashboards are one of the most common use cases for data visualization, and their design and contexts of use are considerably different from exploratory visualization tools. In this paper, we look at the broad scope of how dashboards are used in practice through an analysis of dashboard examples and documentation about their use. We systematically review the literature surrounding dashboard use, construct a design space for dashboards, and identify major dashboard types. We characterize dashboards by their design goals, levels of interaction, and the practices around them. Our framework and literature review suggest a number of fruitful research directions to better support dashboard design, implementation and use.",Alper Sarikaya;Michael Correll;Lyn Bartram;Melanie Tory;Danyel Fisher,Alper Sarikaya;Michael Correll;Lyn Bartram;Melanie Tory;Danyel Fisher,Microsoft Corporation;Tableau Research;Simon Fraser University;Tableau Research;Honeycomb.io,10.1109/TVCG.2013.124;10.1109/TVCG.2017.2744198;10.1109/TVCG.2013.120,"Dashboards,literature review,survey,design space,open coding",17,13,66,
Vis,1990,Extracting geometric models through constraint minimization,10.1109/VISUAL.1990.146367,http://dx.doi.org/10.1109/VISUAL.1990.146367,74,"82, 464-5",C,"The authors propose a methodology that will extract a topologically closed geometric model from a two-dimensional image. This is accomplished by starting with a simple model that is already topologically closed and deforming the model, based on a set of constraints, so that the model grows (shrinks) to fit the feature within the image while maintaining its closed and locally simple nature. The initial model is a non-self-intersecting polygon that is either embedded in the feature or surrounds the feature. There is a cost function associated with every vertex that quantifies its deformation, the properties of simple polygons, and the relationship between noise and feature. The constraints embody local properties of simple polygons and the nature of the relationship between noise and the features in the image.&lt;&lt;ETX&gt;&gt;",James V. Miller;David E. Breen;Michael J. Wozny,J.V. Miller;D.E. Breen;M.J. Wozny,"Rensselaer Design. Res. Center, Rensselaer Polytech Inst., Troy, NY, USA;Rensselaer Design. Res. Center, Rensselaer Polytech Inst., Troy, NY, USA;Rensselaer Design. Res. Center, Rensselaer Polytech Inst., Troy, NY, USA",,,16,6,14,
Vis,1990,Wide-band relativistic Doppler effect visualization,10.1109/VISUAL.1990.146368,http://dx.doi.org/10.1109/VISUAL.1990.146368,83,"92, 465-7",C,"The authors present a flexible and efficient method to simulate the Doppler shift. In this new method the spectral curves of surface properties and light composition are represented by spline functions of wavelength. These functions can cover the entire electromagnetic (EM) waves bandwidth, and incorporate the thermal radiation of objects into the surface property description. In particular, a temperature-dependent emission spectral distribution can be assigned to each object for imaging the nonvisible thermal spectra which may become visible due to blue shift. The Doppler shift and shading operations are performed through the manipulation of spline coefficients. The evaluation of the spline functions, which is computationally expensive, is only carried out once-at the end of each shading loop for generating the display RGB values.&lt;&lt;ETX&gt;&gt;",Ping-Kang Hsiung;Robert H. Thibadeau;Christopher B. Cox;Robert H. P. Dunn;Michael Wu;Paul Andrew Olbrich,P.-K. Hsiung;R.H. Thibadeau;C.B. Cox;R.H.P. Dunn;M. Wu;P.A. Olbrich,"Carnegie Mellon Univ., Pittsburgh, PA, USA;Carnegie Mellon Univ., Pittsburgh, PA, USA;Carnegie Mellon Univ., Pittsburgh, PA, USA;Carnegie Mellon Univ., Pittsburgh, PA, USA;Carnegie Mellon Univ., Pittsburgh, PA, USA;Carnegie Mellon Univ., Pittsburgh, PA, USA",,,16,5,8,
Vis,1991,Integration of visualization and scientific calculation in a software system,10.1109/VISUAL.1991.175812,http://dx.doi.org/10.1109/VISUAL.1991.175812,268,"274, 428",C,The problems and advantages of integrating scientific computations and visualization into one common program system are examined. An important point is the direct feedback of information from the visualization into an ongoing simulation. Some strong and weak points of the varying approaches in different software packages are shown. The visualization component of the authors' program system and the advantages of its integration into the overall system are explained. The weak points in their system and the work remaining to deal with them are described.&lt;&lt;ETX&gt;&gt;,Ulrich Lang;Ruth E. Lang;Roland Rühle,U. Lang;R. Lang;R. Ruhle,"Stuttgart Univ. Comput. Center, Germany;Stuttgart Univ. Comput. Center, Germany;Stuttgart Univ. Comput. Center, Germany",,,16,6,8,
Vis,1994,A library for visualizing combinatorial structures,10.1109/VISUAL.1994.346323,http://dx.doi.org/10.1109/VISUAL.1994.346323,164,"171, C18",C,"Describes ANIM3D, a 3D animation library targeted at visualizing combinatorial structures. In particular, we are interested in algorithm animation. Constructing a new view for an algorithm typically takes dozens of design iterations, and can be very time-consuming. Our library eases the programmer's burden by providing high-level constructs for performing animations, and by offering an interpretive environment that eliminates the need for recompilations. We also illustrate ANIM3D's expressiveness by developing a 3D animation of Dijkstra's shortest-path algorithm in just 70 lines of code.&lt;&lt;ETX&gt;&gt;",Marc Najork;Marc H. Brown,M.A. Najork;M.H. Brown,"DEC Syst. Res. Center, Palo Alto, CA, USA;DEC Syst. Res. Center, Palo Alto, CA, USA",,,16,3,19,
InfoVis,1996,DEPICT: Documents Evaluated as Pictures. Visualizing information using context vectors and self-organizing maps,10.1109/INFVIS.1996.559228,http://dx.doi.org/10.1109/INFVIS.1996.559228,100,"107, 131",C,"HNC Software, Inc. has developed a system called DEPICT for visualizing the information content of large textual corpora. The system is built around two separate neural network methodologies: context vectors and self-organizing maps. Context vectors (CVs) are high dimensional information representations that encode the semantic content of the textual entities they represent. Self-organizing maps (SOMs) are capable of transforming an input, high dimensional signal space into a much lower (usually two or three) dimensional output space useful for visualization. Neither process requires human intervention, nor an external knowledge base. Together, these neural network techniques can be utilized to automatically identify the relevant information themes present in a corpus, and present those themes to the user in a intuitive visual form.",David A. Rushall;Marc R. Ilgen,D.A. Rushall;M.R. Ilgen,"HNC Software Inc., San Diego, CA, USA",,,16,10,10,
Vis,1996,Raycasting vector fields,10.1109/VISUAL.1996.567780,http://dx.doi.org/10.1109/VISUAL.1996.567780,115,120,C,"Direct Volume Rendering (DVR) allows the holistic visualization of huge volumetric data sets in a single image. Computational fluid dynamics data is in principle well suited for DVR. But efficient mappings of the directional information of vector fields are still to be found. We investigate how the raycasting technique can be used to directly render vector fields. Our approach is based on the perception that other flow visualization techniques use visualization objects that are locally tangential to the vector field together with directed light sources. From this, we developed the idea to shade streamlines at sampling points when raycasting a vector field. We extended this approach further to more abstract mappings where pseudo color is used. Combining opacity mapping, pseudo color mapping, and streamline shading we can express flow speed and flow direction together in one single image.",Thomas Frühauf,T. Fruhauf,"Fraunhofer Inst. for Comput. Graphics, Darmstadt, Germany",10.1109/VISUAL.1993.398875;10.1109/VISUAL.1993.398853;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1992.235228;10.1109/VISUAL.1995.480818,,16,3,26,
Vis,1996,Real-time slicing of data space,10.1109/VISUAL.1996.568119,http://dx.doi.org/10.1109/VISUAL.1996.568119,271,277,C,"Real time rendering of iso contour surfaces is problematic for large complex data sets. An algorithm is presented that allows very rapid representation of an interval set surrounding an iso contour surface. The algorithm draws upon three main ideas. A fast indexing scheme is used to select only those data points near the contour surface. Hardware assisted splatting is then employed on these data points to produce a volume rendering of the interval set. Finally, by shifting a small window through the indexing scheme or data space, animated volumes are produced showing the changing contour values. In addition to allowing fast selection and rendering of the data, the indexing scheme allows a much compressed representation of the data by eliminating ""noise"" data points.",Roger Crawfis,R.A. Crawfis,"Lawrence Livermore Nat. Lab., CA, USA",10.1109/VISUAL.1993.398852;10.1109/VISUAL.1995.480796;10.1109/VISUAL.1995.480806;10.1109/VISUAL.1993.398846;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1991.175782;10.1109/VISUAL.1995.480807;10.1109/VISUAL.1995.480797;10.1109/VISUAL.1995.480789,"Isocontour, iso-surface, contour surface, volume rendering, splatting, animation, data partitioning, interactive, real-time, scientific visualization, compression",16,4,30,
InfoVis,1997,Cacti: a front end for program visualization,10.1109/INFVIS.1997.636785,http://dx.doi.org/10.1109/INFVIS.1997.636785,46,49,C,"We describe a system that allows the user to rapidly construct program visualizations over a variety of data sources. Such a system is a necessary foundation for using visualization as an aid to software understanding. The system supports an arbitrary set of data sources so that information from both static and dynamic analysis can be combined to offer meaningful software visualizations. It provides the user with a visual universal-relation front end that supports the definition of queries over multiple data sources without knowledge of the structure or contents of the sources. It uses a flexible back end with a range of different visualizations, most geared to the efficient display of large amounts of data. The result is a high-quality, easy-to-define program visualization that can address specific problems and hence is useful for software understanding. The overall system is flexible and extensible in that both the underlying data model and the set of visualizations are defined in resource files.",Steven P. Reiss,S.P. Reiss,"Dept. of Comput. Sci., Brown Univ., Providence, RI, USA",10.1109/INFVIS.1996.559210,,16,4,24,
InfoVis,1998,BiblioMapper: a cluster-based information visualization technique,10.1109/INFVIS.1998.729569,http://dx.doi.org/10.1109/INFVIS.1998.729569,130,136,C,"The purpose of the paper is to develop a visualization system of a document space, called BiblioMapper, for CISI collections, one of the bibliographic databases available on the Internet. The major function of BiblioMapper is to visualize the document space with a cluster-based visualization technique. The cluster-based visualization technique assembles a set of documents according to semantic similarities. One advantage of this technique is that users are able to focus on and assess each cluster and the documents which the cluster comprises according to their information needs.",Min Song,Min Song,"Sch. of Libr. & Inf. Sci., Indiana Univ., Bloomington, IN, USA",10.1109/INFVIS.1996.559228;10.1109/INFVIS.1995.528686,"Visualization, Information Retrieval,Clustering Algorithms, Textual Information",16,2,17,
Vis,1998,Production visualization for the ASCI One TeraFLOPS machine,10.1109/VISUAL.1998.745343,http://dx.doi.org/10.1109/VISUAL.1998.745343,459,462,C,"The delivery of the first one tera-operations/sec computer has significantly impacted production data visualization, affecting data transfer, post processing, and rendering. Terascale computing has motivated a need to consider the entire data visualization system; improving a single algorithm is not sufficient. This paper presents a systems approach to decrease by a factor of four the time required to prepare large data sets for visualization. For daily production use, all stages in the processing pipeline from physics simulation code to pixels on a screen, must be balanced to yield good overall performance. Performance of the initial visualization system is compared with recent improvements. ""Lessons learned"" from the coordinated deployment of improved algorithms also are discussed, including the need for 64 bit addressing and a fully parallel data visualization pipeline.",Philip D. Heermann,P.D. Heermann,"Sandia Nat. Labs., Albuquerque, NM, USA",,,16,10,5,BCS
Vis,1998,A case study using the virtual environment for reconstructive surgery,10.1109/VISUAL.1998.745336,http://dx.doi.org/10.1109/VISUAL.1998.745336,431,434,C,"The paper details the use of a Virtual Environment for Reconstructive Surgery (VERS) in the case of a 17 year-old boy with a severe facial defect, arising from the removal of a soft tissue tumor. Computed tomography (CT) scans were taken of the patient, the data were segmented, a mesh was generated, and this patient-specific mesh was used in a virtual environment by the surgeons for preoperative visualization of the defect, planning of the surgery, and production of a custom surgical template to aid in repairing the defect. The paper details the case of this patient, provides a background on the virtual environment technology used, discusses the difficulties encountered, and describes the lessons learned.",Kevin Montgomery;Michael Stephanides;Stephen Schendel;Muriel Ross,K. Montgomery;M. Stephanides;S. Schendel;M. Ross,"Nat. Biocomput. Center, Stanford Univ., CA, USA",,,16,3,14,
Vis,1998,Three-dimensional visualization of microstructures,10.1109/VISUAL.1998.745350,http://dx.doi.org/10.1109/VISUAL.1998.745350,487,490,C,"This case study describes a technique for the three-dimensional analysis of the internal microscopic structure (microstructure) of materials. This technique consists of incrementally polishing through a thin layer (approximately 0.2 /spl mu/m) of material, chemically etching the polished surface, applying reference marks, and performing optical or scanning electron microscopy on selected areas. The series of images are then processed employing AVS and other visualization software to obtain a 3D reconstruction of the material. We describe how we applied this technique to an alloy steel to study the morphology, connectivity, and distribution of cementite precipitates formed during thermal processing. The results showed microstructural features not previously identified with traditional 2D techniques.",Marco Lanzagorta;Milo V. Kral;J. Edward Swan;George Spanos;Robert Rosenberg;Eddy Kuo,M. Lanzagorta;M.V. Kral;J.E. Swan;G. Spanos;R. Rosenberg;E. Kuo,"Naval Res. Lab., Washington, DC, USA",,,16,5,13,
InfoVis,2000,Visualizing massive multi-digraphs,10.1109/INFVIS.2000.885089,http://dx.doi.org/10.1109/INFVIS.2000.885089,39,47,C,"We describe MGV, an integrated visualization and exploration system for massive multi-digraph navigation. MGV's only assumption is that the vertex set of the underlying digraph corresponds to the set of leaves of a predetermined tree T. MGV builds an out-of-core graph hierarchy and provides mechanisms to plug in arbitrary visual representations for each graph hierarchy slice. Navigation from one level to another of the hierarchy corresponds to the implementation of a drill-down interface. In order to provide the user with navigation control and interactive response, MGV incorporates a number of visualization techniques like interactive pixel-oriented 2D and 3D maps, statistical displays, multi-linked views, and a zoomable label based interface. This makes the association of geographic information and graph data very natural. MGV follows the client-server paradigm and it is implemented in C and Java-3D. We highlight the main algorithmic and visualization techniques behind the tools and point out along the way several possible application scenarios. Our techniques are being applied to multi-graphs defined on vertex sets with sizes ranging from 100 million to 250 million vertices.",James Abello;Jeffrey L. Korn,J. Abello;J. Korn,,10.1109/INFVIS.1998.729557;10.1109/VISUAL.1995.480803;10.1109/VISUAL.1993.398870,"visualization,massive data sets,graphs,hierarchies,out-of-core algorithms",16,6,17,
Vis,2000,Navigating high-dimensional spaces to support design steering,10.1109/VISUAL.2000.885707,http://dx.doi.org/10.1109/VISUAL.2000.885707,291,296,C,"Throughout the design cycle, visualization, whether a sketch scribbled on the back of a spare piece of paper or a fully detailed drawing, has been the mainstay of design: we need to see the product. One of the most important stages of the design cycle is the initial, or concept, stage and it is here that design variants occur in large numbers to be vetted quickly. At this initial stage the human element, the designer is crucial to the success of the product. We describe an interactive environment for concept design which recognises the needs of the designer, not only to see the product and make rapid modifications, but also to monitor the progress of their design towards some preferred solution. This leads to the notion of a design parameter space, typically high-dimensional, which must also be visualized in addition to the product itself. Using a module developed for IRIS Explorer design steering is presented as a navigation of this space in order to search for optimal designs, either manually or by local optimisation.",Helen Wright;Ken Brodlie;Tim David,H. Wright;K. Brodlie;T. David,"Dept. of Comput. Sci., Hull Univ., UK",10.1109/VISUAL.1999.809921;10.1109/VISUAL.1995.485157;10.1109/VISUAL.1998.745351;10.1109/VISUAL.1993.398895;10.1109/VISUAL.1993.398857;10.1109/VISUAL.1995.485143,"Computational steering, design steering, concept design, multidimensional visualization, scientific data visualization",16,7,17,
Vis,2001,User-centric viewpoint computation for haptic exploration and manipulation,10.1109/VISUAL.2001.964526,http://dx.doi.org/10.1109/VISUAL.2001.964526,311,318,C,"We present several techniques for user-centric viewing of the virtual objects or datasets under haptic exploration and manipulation. Depending on the type of tasks performed by the user, our algorithms compute automatic placement of the user viewpoint to navigate through the scene, to display the near-optimal views, and to reposition the viewpoint for haptic visualization. This is accomplished by conjecturing the user's intent based on the user's actions, the object geometry, and intra- and inter-object occlusion relationships. These algorithms have been implemented and interfaced with both a 3-DOF and a 6-DOF PHANToM arms. We demonstrate their application on haptic exploration and visualization of a complex structure, as well as multiresolution modeling and 3D painting with a haptic interface.",Miguel A. Otaduy;Ming C. Lin,M.A. Otaduy;M.C. Lin,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.2000.885686;10.1109/VISUAL.1996.568108,,16,10,33,
Vis,2002,Interactive spectral volume rendering,10.1109/VISUAL.2002.1183763,http://dx.doi.org/10.1109/VISUAL.2002.1183763,101,108,C,"We describe a method for volume rendering using a spectral representation of colour instead of the traditional RGB model. It is shown how to use this framework for a novel exploration of datasets through enhanced transfer function design. Furthermore, our framework is extended to allow real-time re-lighting of the scene created with any rendering method. The technique of post-illumination is introduced to generate new spectral images for arbitrary light colours in real-time. Also a tool is described to design a palette of lights and materials having certain properties such as selective metamerism or colour constancy. Applied to spectral transfer functions, different light colours can accentuate or hide specific qualities of the data. In connection with post-illumination this provides a new degree of freedom for guided exploration of volumetric data, which cannot be achieved using the RGB model.",Steven Bergner;Torsten Möller;Mark S. Drew;Graham D. Finlayson,S. Bergner;T. Moller;M.S. Drew;G.D. Finlayson,"Dept. of Simulation & Graphics, Magdeburg Univ., Germany",10.1109/VISUAL.2001.964519;10.1109/VISUAL.2001.964515;10.1109/VISUAL.1997.663875,"spectral volume rendering, post-illumination, interactive re-lighting",16,4,30,
Vis,2002,Evaluation of a multimodal interface for 3D terrain visualization,10.1109/VISUAL.2002.1183802,http://dx.doi.org/10.1109/VISUAL.2002.1183802,411,418,C,"Novel speech and/or gesture interfaces are candidates for use in future mobile or ubiquitous applications. This paper describes an evaluation of various interfaces for visual navigation of a whole Earth 3D terrain model. A mouse driven interface, a speech interface, a gesture interface, and a multimodal speech and gesture interface were used to navigate to targets placed at various points on the Earth. This study measured each participant's recall of target identity, order, and location as a measure of cognitive load. Timing information as well as a variety of subjective measures including discomfort and user preference were taken. While the familiar and mature mouse interface scored best by most measures, the speech interface also performed well. The gesture and multimodal interface suffered from weaknesses in the gesture modality. Weaknesses in the speech and multimodal modalities are identified and areas for improvement are discussed.",David M. Krum;Olugbenga Omoteso;William Ribarsky;Thad Starner;Larry F. Hodges,D.M. Krum;O. Omoteso;W. Ribarsky;T. Starner;L.F. Hodges,"Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA;Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA",,"multimodal interaction, evaluation, navigation, speech recognition, gesture recognition, virtual reality, mobile visualization, GIS",16,5,15,
InfoVis,2003,A model of multi-scale perceptual organization in information graphics,10.1109/INFVIS.2003.1249005,http://dx.doi.org/10.1109/INFVIS.2003.1249005,23,30,C,"We propose a new method for assessing the perceptual organization of information graphics, based on the premise that the visual structure of an image should match the structure of the data it is intended to convey. The core of our method is a new formal model of one type of perceptual structure, based on classical machine vision techniques for analyzing an image at multiple resolutions. The model takes as input an arbitrary grayscale image and returns a lattice structure describing the visual organization of the image. We show how this model captures several aspects of traditional design aesthetics, and we describe a software tool that implements the model to help designers analyze and refine visual displays. Our emphasis here is on demonstrating the model's potential as a design aid rather than as a description of human perception, but given its initial promise we propose a variety of ways in which the model could be extended and validated.",Martin Wattenberg;Danyel Fisher,M. Wattenberg;D. Fisher,"Collaborative User Experience Group, IBM Res., White Plains, NY, USA",,"Visualization, Perceptual Organization, Scale Space, Design Methodology",16,5,39,
Vis,2003,Feature-space analysis of unstructured meshes,10.1109/VISUAL.2003.1250371,http://dx.doi.org/10.1109/VISUAL.2003.1250371,185,192,C,"Unstructured meshes are often used in simulations and imaging applications. They provide advanced flexibility in modeling abilities but are more difficult to manipulate and analyze than regular data. This work provides a novel approach for the analysis of unstructured meshes using feature-space clustering and feature-detection. Analyzing and revealing underlying structures in data involve operators on both spatial and functional domains. Slicing concentrates more on the spatial domain, while iso-surfacing or volume rendering concentrate more on the functional domain. Nevertheless, many times it is the combination of the two domains which provides real insight on the structure of the data. In this work, a combined feature-space is defined on top of unstructured meshes in order to search for structure in the data. A point in feature-space includes the spatial coordinates of the point in the mesh domain and all chosen attributes defined on the mesh. A distance measures between points in feature-space is defined enabling the utilization of clustering using the mean shift procedure (previously used for images) on unstructured meshes. Feature space analysis is shown to be useful for feature-extraction, for data exploration and partitioning.",Ariel Shamir,A. Shamir,"The Interdisciplinary Center, Herzliya, Israel",10.1109/VISUAL.1999.809869;10.1109/VISUAL.1998.745312;10.1109/VISUAL.2001.964519;10.1109/VISUAL.1997.663875,"unstructured meshes, segmentation, clustering, feature-extraction, mean-shift",16,7,33,
InfoVis,2004,Expand-Ahead: A Space-Filling Strategy for Browsing Trees,10.1109/INFVIS.2004.21,http://dx.doi.org/10.1109/INFVIS.2004.21,119,126,C,"Many tree browsers allow subtrees under a node to be collapsed or expanded, enabling the user to control screen space usage and selectively drill-down. However, explicit expansion of nodes can be tedious. Expand-ahead is a space-filling strategy by which some nodes are automatically expanded to fill available screen space, without expanding so far that nodes are shown at a reduced size or outside the viewport. This often allows a user exploring the tree to see further down the tree without the effort required in a traditional browser. It also means the user can sometimes drill-down a path faster, by skipping over levels of the tree that are automatically expanded for them. Expand-ahead differs from many detail-in-context techniques in that there is no scaling or distortion involved. We present 1D and 2D prototype implementations of expand-ahead, and identify various design issues and possible enhancements to our designs. Our prototypes support smooth, animated transitions between different views of a tree. We also present the results of a controlled experiment which show that, under certain conditions, users are able to drill-down faster with expand-ahead than without",Michael J. McGuffin;Gord Davison;Ravin Balakrishnan,M.J. McGuffin;G. Davison;R. Balakrishnan,University of Toronto,10.1109/INFVIS.2002.1173148;10.1109/INFVIS.2002.1173152,"tree browsing and navigation, focus+context, expand-ahead, automatic expansion, space filling, adaptive user interfaces",16,9,16,
Vis,2004,Vol-a-Tile - A Tool for Interactive Exploration of Large Volumetric Data on Scalable Tiled Displays,10.1109/VISUAL.2004.126,http://dx.doi.org/10.1109/VISUAL.2004.126,19,19,M,"We present the current state of Vol-a-Tile, an interactive tool for exploring large volumetric data on scalable tiled displays. Vol-a-Tile presents a variety of features employed by scientists at the Scripps Institution of Oceanography on data collected from the Anatomy of a Ridge-Axis Discontinuity seismic experiment. Hardware texture mapping and level-of-detail techniques provide interactivity. A high-performance network protocol is used to connect remote data sources over high-bandwidth photonic networks.",Nicholas Schwarz;Shalini Venkataraman;Luc Renambot;Naveen K. Krishnaprasad;Venkatram Vishwanath;Jason Leigh;Andrew E. Johnson;Graham Kent;Atul Nayak,N. Schwarz;S. Venkataraman;Luc Renambot;N. Krishnaprasad;V. Vishwanath;J. Leigh;A. Johnson;G. Kent;A. Nayak,University of Illinois at Chicago,,,16,4,16,
Vis,2004,Compatible triangulations of spatial decompositions,10.1109/VISUAL.2004.15,http://dx.doi.org/10.1109/VISUAL.2004.15,211,217,C,"We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solving several problems in graphics and visualization including the crack problem found in adaptive isosurface generation, triangulation of arbitrary grids (including unstructured grids), clipping, and the interval tetrahedrization problem. The algorithm produces compatible triangulations on a cell-by-cell basis, using a modified Delaunay triangulation with a simple point ordering rule to resolve degenerate cases and produce unique triangulations across cell boundaries. The algorithm is naturally parallel since it requires no neighborhood cell information, only a unique, global point numbering. We show application of this algorithm to adaptive contour generation; tetrahedrization of unstructured meshes; clipping and interval volume mesh generation.",William J. Schroeder;Berk Geveci;Mathieu Malaterre,W.J. Schroeder;B. Geveci;M. Malaterre,,10.1109/VISUAL.1996.568127;10.1109/VISUAL.1997.663869;10.1109/VISUAL.1997.663886,"triangulation, tetrahedrization, adaptive grid, clipping, contouring, template, Delaunay, parallel",16,6,33,
Vis,2004,Generating sub-resolution detail in images and volumes using constrained texture synthesis,10.1109/VISUAL.2004.35,http://dx.doi.org/10.1109/VISUAL.2004.35,75,82,C,"A common deficiency of discretized datasets is that detail beyond the resolution of the dataset has been irrecoverably lost. This lack of detail becomes immediately apparent once one attempts to zoom into the dataset and only recovers blur. We describe a method that generates the missing detail from any available and plausible high-resolution data, using texture synthesis. Since the detail generation process is guided by the underlying image or volume data and is designed to fill in plausible detail in accordance with the coarse structure and properties of the zoomed-in neighborhood, we refer to our method as constrained texture synthesis. Regular zooms become ""semantic zooms"", where each level of detail stems from a data source attuned to that resolution. We demonstrate our approach by a medical application - the visualization of a human liver - but its principles readily apply to any scenario, as long as data at all resolutions are available. We first present a 2D viewing application, called the ""virtual microscope"", and then extend our technique to 3D volumetric viewing.",Lujin Wang;Klaus Mueller,Lujin Wang;K. Mueller,,,"texture synthesis, semantic zoom",16,1,27,
Vis,2004,Non-linear model fitting to parameterize diseased blood vessels,10.1109/VISUAL.2004.72,http://dx.doi.org/10.1109/VISUAL.2004.72,393,400,C,"Accurate estimation of vessel parameters is a prerequisite for automated visualization and analysis of healthy and diseased blood vessels. The objective of this research is to estimate the dimensions of lower extremity arteries, imaged by computed tomography (CT). These parameters are required to get a good quality visualization of healthy as well as diseased arteries using a visualization technique such as curved planar reformation (CPR). The vessel is modeled using an elliptical or cylindrical structure with specific dimensions, orientation and blood vessel mean density. The model separates two homogeneous regions: its inner side represents a region of density for vessels, and its outer side a region for background. Taking into account the point spread function (PSF) of a CT scanner, a function is modeled with a Gaussian kernel, in order to smooth the vessel boundary in the model. A new strategy for vessel parameter estimation is presented. It stems from vessel model and model parameter optimization by a nonlinear optimization procedure, i.e., the Levenberg-Marquardt technique. The method provides center location, diameter and orientation of the vessel as well as blood and background mean density values. The method is tested on synthetic data and real patient data with encouraging results.",Alexandra La Cruz;Matús Straka;Arnold Köchl;Milos Srámek;M. Eduard Gröller;Dominik Fleischmann,A. La Cruz;M. Straka;A. Kochl;M. Sramek;E. Groller;D. Fleischmann,"Vienna Univ. of Technol., Austria",10.1109/VISUAL.2001.964555,"Visualization, Segmentation, Blood Vessel Detection",16,5,11,
InfoVis,2005,Simple 3D glyphs for spatial multivariate data,10.1109/INFVIS.2005.1532137,http://dx.doi.org/10.1109/INFVIS.2005.1532137,119,124,C,"We present an effort to evaluate the possible utility of a new type of 3D glyphs intended for visualizations of multivariate spatial data. They are based on results from vision research suggesting that our perception of metric 3D structure is distorted and imprecise relative to the actual scene before us (e.g., ""metric 3D structure in visualizations"" by M. Lind et al. (2003)); only a class of qualitative properties of the scene is perceived with accuracy. These properties are best characterized as being invariant over affine but not Euclidean transformations. They are related, but not identical to, the non-accidental properties (NAPs) described by Lowe in ""perceptual organization and visual recognition"" (1984) on which the notion of geons is based in ""recognition by components - a theory of image understanding"" by I. Biederman (1987). A large number of possible 3D glyphs for the visualization of spatial data can be constructed using such properties. One group is based on the local sign of surface curvature. We investigated these properties in a visualization experiment. The results are promising and the implications for visualization are discussed.",Camilla Forsell;Stefan Seipel;Mats Lind,C. Forsell;S. Seipel;M. Lind,"Dept. of Inf. Sci., Uppsala Univ., Sweden",,"multidimensional visualization, perception, 3D glyphs",16,6,15,
Vis,2005,Multimodal exploration of the fourth dimension,10.1109/VISUAL.2005.1532804,http://dx.doi.org/10.1109/VISUAL.2005.1532804,263,270,C,"We present a multimodal paradigm for exploring topological surfaces embedded in four dimensions; we exploit haptic methods in particular to overcome the intrinsic limitations of 3D graphics images and 3D physical models. The basic problem is that, just as 2D shadows of 3D curves lose structure where lines cross, 3D graphics projections of smooth 4D topological surfaces are interrupted where one surface intersects another. Furthermore, if one attempts to trace real knotted ropes or a plastic models of self-intersecting surfaces with a fingertip, one inevitably collides with parts of the physical artifact. In this work, we exploit the free motion of a computer-based haptic probe to support a continuous motion that follows the local continuity of the object being explored. For our principal test case of 4D-embedded surfaces projected to 3D, this permits us to follow the full local continuity of the surface as though in fact we were touching an actual 4D object. We exploit additional sensory cues to provide supplementary or redundant information. For example, we can use audio tags to note the relative 4D depth of illusory 3D surface intersections produced by projection from 4D, as well as providing automated refinement of the tactile exploration path to eliminate jitter and snagging, resulting in a much cleaner exploratory motion than a bare uncorrected motion. Visual enhancements provide still further improvement to the feedback: by opening a view-direction-defined cutaway into the interior of the 3D surface projection, we allow the viewer to keep the haptic probe continuously in view as it traverses any touchable part of the object. Finally, we extend the static tactile exploration framework using a dynamic mode that links each stylus motion to a change in orientation that creates at each instant a maximal-area screen projection of a neighborhood of the current point of interest. This minimizes 4D distortion and permits true metric sizes to be deduced locally at any point. All these methods combine to reveal the full richness of the complex spatial relationships of the target shapes, and to overcome many expected perceptual limitations in 4D visualization.",Andrew J. Hanson;Hui Zhang 0006,A.J. Hanson;H. Zhang,"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA;Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA",10.1109/VISUAL.1995.480804," multimodal, haptics, visualization",16,4,31,
Vis,2005,Reconstructing manifold and non-manifold surfaces from point clouds,10.1109/VISUAL.2005.1532824,http://dx.doi.org/10.1109/VISUAL.2005.1532824,415,422,C,"This paper presents a novel approach for surface reconstruction from point clouds. The proposed technique is general in the sense that it naturally handles both manifold and non-manifold surfaces, providing a consistent way for reconstructing closed surfaces as well as surfaces with boundaries. It is also robust in the presence of noise, irregular sampling and surface gaps. Furthermore, it is fast, parallelizable and easy to implement because it is based on simple local operations. In this approach, surface reconstruction consists of three major steps: first, the space containing the point cloud is subdivided, creating a voxel representation. Then, a voxel surface is computed using gap filling and topological thinning operations. Finally, the resulting voxel surface is converted into a polygonal mesh. We demonstrate the effectiveness of our approach by reconstructing polygonal models from range scans of real objects as well as from synthetic data.",Jianning Wang;Manuel Menezes de Oliveira Neto;Arie E. Kaufman,J. Wang;M.M. Oliveira;A.E. Kaufman,"Stony Brook Univ., NY, USA",10.1109/VISUAL.2001.964489;10.1109/VISUAL.2001.964528,"surface reconstruction, non-manifold surfaces, topological thinning",16,1,25,
InfoVis,2006,Visualization of Barrier Tree Sequences,10.1109/TVCG.2006.196,http://dx.doi.org/10.1109/TVCG.2006.196,781,788,J,"Dynamical models that explain the formation of spatial structures of RNA molecules have reached a complexity that requires novel visualization methods that help to analyze the validity of these models. We focus on the visualization of so-called folding landscapes of a growing RNA molecule. Folding landscapes describe the energy of a molecule as a function of its spatial configuration; thus they are huge and high dimensional. Their most salient features, however, are encapsulated by their so-called barrier tree that reflects the local minima and their connecting saddle points. For each length of the growing RNA chain there exists a folding landscape. We visualize the sequence of folding landscapes by an animation of the corresponding barrier trees. To generate the animation, we adapt the foresight layout with tolerance algorithm for general dynamic graph layout problems. Since it is very general, we give a detailed description of each phase: constructing a supergraph for the trees, layout of that supergraph using a modified DOT algorithm, and presentation techniques for the final animation",Christian Heine 0002;Gerik Scheuermann;Christoph Flamm;Ivo L. Hofacker;Peter F. Stadler,Christian Heine;Gerik Scheuermann;Christoph Flamm;Ivo L. Hofacker;Peter F. Stadler,,10.1109/INFVIS.2004.18,"Graph drawing, dynamic graph, RNA folding, energy landscape, fitness landscape, barrier tree",16,12,25,
Vis,2008,Visualizing Multiwavelength Astrophysical Data,10.1109/TVCG.2008.182,http://dx.doi.org/10.1109/TVCG.2008.182,1555,1562,J,"With recent advances in the measurement technology for allsky astrophysical imaging, our view of the sky is no longer limited to the tiny visible spectral range over the 2D Celestial sphere. We now can access a third dimension corresponding to a broad electromagnetic spectrum with a wide range of allsky surveys; these surveys span frequency bands including long long wavelength radio, microwaves, very short X-rays, and gamma rays. These advances motivate us to study and examine multiwavelength visualization techniques to maximize our capabilities to visualize and exploit these informative image data sets. In this work, we begin with the processing of the data themselves, uniformizing the representations and units of raw data obtained from varied detector sources. Then we apply tools to map, convert, color-code, and format the multiwavelength data in forms useful for applications. We explore different visual representations for displaying the data, including such methods as textured image stacks, the horseshoe representation, and GPU-based volume visualization. A family of visual tools and analysis methods are introduced to explore the data, including interactive data mapping on the graphics processing unit (GPU), the mini-map explorer, and GPU-based interactive feature analysis.",Hongwei Li;Chi-Wing Fu;Andrew J. Hanson,Hongwei Li;Chi-Wing Fu;Andrew Hanson,"The Hong Kong University of Science and Technology;Nanyang Technological University, Singapore;Indiana University, Bloomington",10.1109/VISUAL.2003.1250404;10.1109/TVCG.2006.155;10.1109/VISUAL.1995.485155;10.1109/TVCG.2006.176;10.1109/VISUAL.1992.235222;10.1109/VISUAL.2002.1183824;10.1109/TVCG.2007.70530;10.1109/VISUAL.2003.1250401;10.1109/VISUAL.2005.1532803;10.1109/VISUAL.2004.18;10.1109/TVCG.2007.70526,"Astrophysical visualization, multiwavelength data, astronomy",16,10,54,
VAST,2009,LSAView: A tool for visual exploration of latent semantic modeling,10.1109/VAST.2009.5333428,http://dx.doi.org/10.1109/VAST.2009.5333428,83,90,C,"Latent Semantic Analysis (LSA) is a commonly-used method for automated processing, modeling, and analysis of unstructured text data. One of the biggest challenges in using LSA is determining the appropriate model parameters to use for different data domains and types of analyses. Although automated methods have been developed to make rank and scaling parameter choices, these approaches often make choices with respect to noise in the data, without an understanding of how those choices impact analysis and problem solving. Further, no tools currently exist to explore the relationships between an LSA model and analysis methods. Our work focuses on how parameter choices impact analysis and problem solving. In this paper, we present LSAView, a system for interactively exploring parameter choices for LSA models. We illustrate the use of LSAView's small multiple views, linked matrix-graph views, and data views to analyze parameter selection and application in the context of graph layout and clustering.",Patricia Crossno;Daniel M. Dunlavy;Timothy M. Shead,Patricia J. Crossno;Daniel M. Dunlavy;Timothy M. Shead,"Sandia National Laboratories, USA;Sandia National Laboratories, USA;Sandia National Laboratories, USA",,,16,11,27,
InfoVis,2010,Visualizations everywhere: A Multiplatform Infrastructure for Linked Visualizations,10.1109/TVCG.2010.222,http://dx.doi.org/10.1109/TVCG.2010.222,1157,1163,J,"In order to use new visualizations, most toolkits require application developers to rebuild their applications and distribute new versions to users. The WebCharts Framework take a different approach by hosting Javascript from within an application and providing a standard data and events interchange.. In this way, applications can be extended dynamically, with a wide variety of visualizations. We discuss the benefits of this architectural approach, contrast it to existing techniques, and give a variety of examples and extensions of the basic system.",Danyel Fisher;Steven Mark Drucker;Roland Fernandez;Scott Ruble,Danyel Fisher;Steven Drucker;Roland Fernandez;Scott Ruble,Microsoft Research;Microsoft Research;Microsoft Research;Microsoft,10.1109/INFVIS.2004.12;10.1109/TVCG.2009.148;10.1109/TVCG.2008.175;10.1109/TVCG.2009.174;10.1109/TVCG.2007.70577;10.1109/INFVIS.2000.885086,"Visualization systems, toolkit design, data transformation and representation",16,12,23,
VAST,2010,A closer look at note taking in the co-located collaborative visual analytics process,10.1109/VAST.2010.5652879,http://dx.doi.org/10.1109/VAST.2010.5652879,171,178,C,"This paper highlights the important role that record-keeping (i.e. taking notes and saving charts) plays in collaborative data analysis within the business domain. The discussion of record-keeping is based on observations from a user study in which co-located teams worked on collaborative visual analytics tasks using large interactive wall and tabletop displays. Part of our findings is a collaborative data analysis framework that encompasses note taking as one of the main activities. We observed that record-keeping was a critical activity within the analysis process. Based on our observations, we characterize notes according to their content, scope, and usage, and describe how they fit into a process of collaborative data analysis. We then discuss suggestions for the design of collaborative visual analytics tools.",Narges Mahyar;Ali Sarvghad;Melanie Tory,Narges Mahyar;Ali Sarvghad;Melanie Tory,University of Victoria;University of Victoria;University of Victoria,10.1109/TVCG.2008.137;10.1109/VAST.2008.4677358;10.1109/TVCG.2007.70568;10.1109/VAST.2009.5333020;10.1109/VAST.2008.4677365;10.1109/VAST.2009.5333023;10.1109/TVCG.2007.70577,"note taking, recording, collaboration, tabletop, wall display, history, provenance",16,8,33,
Vis,2010,Scalable Multi-variate Analytics of Seismic and Satellite-based Observational Data,10.1109/TVCG.2010.192,http://dx.doi.org/10.1109/TVCG.2010.192,1413,1420,J,"Over the past few years, large human populations around the world have been affected by an increase in significant seismic activities. For both conducting basic scientific research and for setting critical government policies, it is crucial to be able to explore and understand seismic and geographical information obtained through all scientific instruments. In this work, we present a visual analytics system that enables explorative visualization of seismic data together with satellite-based observational data, and introduce a suite of visual analytical tools. Seismic and satellite data are integrated temporally and spatially. Users can select temporal ;and spatial ranges to zoom in on specific seismic events, as well as to inspect changes both during and after the events. Tools for designing high dimensional transfer functions have been developed to enable efficient and intuitive comprehension of the multi-modal data. Spread-sheet style comparisons are used for data drill-down as well as presentation. Comparisons between distinct seismic events are also provided for characterizing event-wise differences. Our system has been designed for scalability in terms of data size, complexity (i.e. number of modalities), and varying form factors of display environments.",Xiaoru Yuan;He Xiao;Hanqi Guo 0001;Peihong Guo;Wesley Kendall;Jian Huang 0007;Yongxian Zhang,Xiaoru Yuan;He Xiao;Hanqi Guo;Peihong Guo;Wesley Kendall;Jian Huang;Yongxian Zhang,Peking University;Peking University;Peking University;Peking University;University of Tennessee;University of Tennessee;China Earthquake Networks Center,10.1109/TVCG.2009.179;10.1109/VISUAL.2003.1250412;10.1109/VISUAL.1990.146402;10.1109/VISUAL.2002.1183814;10.1109/TVCG.2008.170;10.1109/TVCG.2008.184,"Earth Science Visualization, Multivariate Visualization, Seismic Data, Scalable Visualization",16,11,36,
Vis,2010,Spatial Conditioning of Transfer Functions Using Local Material Distributions,10.1109/TVCG.2010.195,http://dx.doi.org/10.1109/TVCG.2010.195,1301,1310,J,"In many applications of Direct Volume Rendering (DVR) the importance of a certain material or feature is highly dependent on its relative spatial location. For instance, in the medical diagnostic procedure, the patient's symptoms often lead to specification of features, tissues and organs of particular interest. One such example is pockets of gas which, if found inside the body at abnormal locations, are a crucial part of a diagnostic visualization. This paper presents an approach that enhances DVR transfer function design with spatial localization based on user specified material dependencies. Semantic expressions are used to define conditions based on relations between different materials, such as only render iodine uptake when close to liver. The underlying methods rely on estimations of material distributions which are acquired by weighing local neighborhoods of the data against approximations of material likelihood functions. This information is encoded and used to influence rendering according to the user's specifications. The result is improved focus on important features by allowing the user to suppress spatially less-important data. In line with requirements from actual clinical DVR practice, the methods do not require explicit material segmentation that would be impossible or prohibitively time-consuming to achieve in most real cases. The scheme scales well to higher dimensions which accounts for multi-dimensional transfer functions and multivariate data. Dual-Energy Computed Tomography, an important new modality in radiology, is used to demonstrate this scalability. In several examples we show significantly improved focus on clinically important aspects in the rendered images.",Stefan Lindholm;Patric Ljung;Claes Lundström;Anders Persson;Anders Ynnerman,Stefan Lindholm;Patric Ljung;Claes Lundstrom;Anders Persson;Anders Ynnerman,"C-Research - Link&#x0F6;ping University, Sweden and Siemens Corporate Research, USA;Siemens Corporate Research, USA;Sectra Imtec AB, Sweden;CMIV - Link &#x0F6;ping University - Link&#x0F6;ping University Hospital, Sweden;C-Research - Link&#x0F6;ping University, Sweden",10.1109/TVCG.2009.185;10.1109/TVCG.2009.120;10.1109/TVCG.2008.147;10.1109/VISUAL.2003.1250412;10.1109/TVCG.2007.70591;10.1109/VISUAL.2001.964516;10.1109/TVCG.2009.189;10.1109/TVCG.2008.162;10.1109/VISUAL.2003.1250413;10.1109/VISUAL.1999.809932;10.1109/TVCG.2006.148,"Direct Volume Rendering, Transfer Function, Spatial Conditioning, Neighborhood Meta-Data",16,13,39,
Vis,2010,Visual Optimality and Stability Analysis of 3DCT Scan Positions,10.1109/TVCG.2010.214,http://dx.doi.org/10.1109/TVCG.2010.214,1477,1486,J,"Industrial cone-beam X-Ray computed tomography (CT) systems often face problems due to artifacts caused by a bad placement of the specimen on the rotary plate. This paper presents a visual-analysis tool for CT systems, which provides a simulation-based preview and estimates artifacts and deviations of a specimen's placement using the corresponding 3D geometrical surface model as input. The presented tool identifies potentially good or bad placements of a specimen and regions of a specimen, which cause the major portion of artefacts. The tool can be used for a preliminary analysis of the specimen before CT scanning, in order to determine the optimal way of placing the object. The analysis includes: penetration lengths, placement stability and an investigation in Radon space. Novel visualization techniques are applied to the simulation data. A stability widget is presented for determining the placement parameters' robustness. The performance and the comparison of results provided by the tool compared with real world data is demonstrated using two specimens.",Artem Amirkhanov;Christoph Heinzl;Michael Reiter;M. Eduard Gröller,Artem Amirkhanov;Christoph Heinzl;Michael Reiter;Eduard Groller,"Institute of Computer Graphics and Algorithms, Vienna University of Technology;Upper Austrian University of Applied Sciences, Wels Campus;Upper Austrian University of Applied Sciences, Wels Campus;Institute of Computer Graphics and Algorithms, Vienna University of Technology",10.1109/TVCG.2006.152;10.1109/VISUAL.2005.1532834;10.1109/VISUAL.2005.1532833,,16,16,25,
Vis,2011,Crepuscular Rays for Tumor Accessibility Planning,10.1109/TVCG.2011.184,http://dx.doi.org/10.1109/TVCG.2011.184,2163,2172,J,"In modern clinical practice, planning access paths to volumetric target structures remains one of the most important and most complex tasks, and a physician's insufficient experience in this can lead to severe complications or even the death of the patient. In this paper, we present a method for safety evaluation and the visualization of access paths to assist physicians during preoperative planning. As a metaphor for our method, we employ a well-known, and thus intuitively perceivable, natural phenomenon that is usually called crepuscular rays. Using this metaphor, we propose several ways to compute the safety of paths from the region of interest to all tumor voxels and show how this information can be visualized in real-time using a multi-volume rendering system. Furthermore, we show how to estimate the extent of connected safe areas to improve common medical 2D multi-planar reconstruction (MPR) views. We evaluate our method by means of expert interviews, an online survey, and a retrospective evaluation of 19 real abdominal radio-frequency ablation (RFA) interventions, with expert decisions serving as a gold standard. The evaluation results show clear evidence that our method can be successfully applied in clinical practice without introducing substantial overhead work for the acting personnel. Finally, we show that our method is not limited to medical applications and that it can also be useful in other fields.",Rostislav Khlebnikov;Bernhard Kainz;Judith Muehl;Dieter Schmalstieg,Rostislav Khlebnikov;Bernhard Kainz;Judith Muehl;Dieter Schmalstieg,Graz University of Technology;Graz University of Technology;Graz University of Technology;Graz University of Technology,10.1109/TVCG.2007.70560,"Accessibility, ray casting, medical visualization",16,15,39,
Vis,2011,Distance Visualization for Interactive 3D Implant Planning,10.1109/TVCG.2011.189,http://dx.doi.org/10.1109/TVCG.2011.189,2173,2182,J,"An instant and quantitative assessment of spatial distances between two objects plays an important role in interactive applications such as virtual model assembly, medical operation planning, or computational steering. While some research has been done on the development of distance-based measures between two objects, only very few attempts have been reported to visualize such measures in interactive scenarios. In this paper we present two different approaches for this purpose, and we investigate the effectiveness of these approaches for intuitive 3D implant positioning in a medical operation planning system. The first approach uses cylindrical glyphs to depict distances, which smoothly adapt their shape and color to changing distances when the objects are moved. This approach computes distances directly on the polygonal object representations by means of ray/triangle mesh intersection. The second approach introduces a set of slices as additional geometric structures, and uses color coding on surfaces to indicate distances. This approach obtains distances from a precomputed distance field of each object. The major findings of the performed user study indicate that a visualization that can facilitate an instant and quantitative analysis of distances between two objects in interactive 3D scenarios is demanding, yet can be achieved by including additional monocular cues into the visualization.",Christian Dick;Rainer Burgkart;Rüdiger Westermann,Christian Dick;Rainer Burgkart;Rudiger Westermann,Technische Universität München;Technische Universität München;Technische Universität München,10.1109/VISUAL.2002.1183752;10.1109/TVCG.2009.184,"Distance visualization, biomedical visualization, implant planning, glyphs, distance fields",16,18,19,
Vis,2011,Projection-Based Metal-Artifact Reduction for Industrial 3D X-ray Computed Tomography,10.1109/TVCG.2011.228,http://dx.doi.org/10.1109/TVCG.2011.228,2193,2202,J,"Multi-material components, which contain metal parts surrounded by plastic materials, are highly interesting for inspection using industrial 3D X-ray computed tomography (3DXCT). Examples of this application scenario are connectors or housings with metal inlays in the electronic or automotive industry. A major problem of this type of components is the presence of metal, which causes streaking artifacts and distorts the surrounding media in the reconstructed volume. Streaking artifacts and dark-band artifacts around metal components significantly influence the material characterization (especially for the plastic components). In specific cases these artifacts even prevent a further analysis. Due to the nature and the different characteristics of artifacts, the development of an efficient artifact-reduction technique in reconstruction-space is rather complicated. In this paper we present a projection-space pipeline for metal-artifacts reduction. The proposed technique first segments the metal in the spatial domain of the reconstructed volume in order to separate it from the other materials. Then metal parts are forward-projected on the set of projections in a way that metal-projection regions are treated as voids. Subsequently the voids, which are left by the removed metal, are interpolated in the 2D projections. Finally, the metal is inserted back into the reconstructed 3D volume during the fusion stage. We present a visual analysis tool, allowing for interactive parameter estimation of the metal segmentation. The results of the proposed artifact-reduction technique are demonstrated on a test part as well as on real world components. For these specimens we achieve a significant reduction of metal artifacts, allowing an enhanced material characterization.",Artem Amirkhanov;Christoph Heinzl;Michael Reiter;Johann Kastner;M. Eduard Gröller,Artem Amirkhanov;Christoph Heinzl;Michael Reiter;Johann Kastner;Eduard Groller,"Institute of Computer Graphics and Algorithms, Vienna University of Technology;Upper Austrian University of Applied Sciences, Wels Campus;Upper Austrian University of Applied Sciences, Wels Campus;Upper Austrian University of Applied Sciences, Wels Campus;Institute of Computer Graphics and Algorithms, Vienna University of Technology",10.1109/TVCG.2008.147;10.1109/VISUAL.2003.1250418,"Metal-artifact reduction, multi-material components, visual analysis, 3D X-ray computed tomography",16,13,34,
InfoVis,2012,RelEx: Visualization for Actively Changing Overlay Network Specifications,10.1109/TVCG.2012.255,http://dx.doi.org/10.1109/TVCG.2012.255,2729,2738,J,"We present a network visualization design study focused on supporting automotive engineers who need to specify and optimize traffic patterns for in-car communication networks. The task and data abstractions that we derived support actively making changes to an overlay network, where logical communication specifications must be mapped to an underlying physical network. These abstractions are very different from the dominant use case in visual network analysis, namely identifying clusters and central nodes, that stems from the domain of social network analysis. Our visualization tool RelEx was created and iteratively refined through a full user-centered design process that included a full problem characterization phase before tool design began, paper prototyping, iterative refinement in close collaboration with expert users for formative evaluation, deployment in the field with real analysts using their own data, usability testing with non-expert users, and summative evaluation at the end of the deployment. In the summative post-deployment study, which entailed domain experts using the tool over several weeks in their daily practice, we documented many examples where the use of RelEx simplified or sped up their work compared to previous practices.",Michael Sedlmair;Annika Frank;Tamara Munzner;Andreas Butz,Michael Sedlmair;Annika Frank;Tamara Munzner;Andreas Butz,"University of British Columbia;Bertrand AG, Munich;University of British Columbia;University of Munich (LMU)",10.1109/TVCG.2006.160;10.1109/INFVIS.2004.12;10.1109/VAST.2011.6102443;10.1109/TVCG.2007.70582;10.1109/TVCG.2009.111;10.1109/TVCG.2009.116;10.1109/INFVIS.1999.801869;10.1109/TVCG.2008.141;10.1109/TVCG.2008.117;10.1109/INFVIS.2005.1532126;10.1109/TVCG.2012.213;10.1109/INFVIS.2003.1249030;10.1109/VAST.2006.261426,"Network visualization, change management, traffic routing, traffic optimization, automotive, design study",16,15,49,
VAST,2012,Watch this: A taxonomy for dynamic data visualization,10.1109/VAST.2012.6400552,http://dx.doi.org/10.1109/VAST.2012.6400552,193,202,C,"Visualizations embody design choices about data access, data transformation, visual representation, and interaction. To interpret a static visualization, a person must identify the correspondences between the visual representation and the underlying data. These correspondences become moving targets when a visualization is dynamic. Dynamics may be introduced in a visualization at any point in the analysis and visualization process. For example, the data itself may be streaming, shifting subsets may be selected, visual representations may be animated, and interaction may modify presentation. In this paper, we focus on the impact of dynamic data. We present a taxonomy and conceptual framework for understanding how data changes influence the interpretability of visual representations. Visualization techniques are organized into categories at various levels of abstraction. The salient characteristics of each category and task suitability are discussed through examples from the scientific literature and popular practices. Examining the implications of dynamically updating visualizations warrants attention because it directly impacts the interpretability (and thus utility) of visualizations. The taxonomy presented provides a reference point for further exploration of dynamic data visualization techniques.",Joseph A. Cottam;Andrew Lumsdaine;Chris Weaver,Joseph A. Cottam;Andrew Lumsdaine;Chris Weaver,Indiana University;Indiana University;University of Oklahoma,10.1109/TVCG.2009.123;10.1109/INFVIS.2004.65;10.1109/TVCG.2007.70539;10.1109/TVCG.2008.125;10.1109/INFVIS.2000.885092,"Dynamic Data, Interpretation",16,10,49,
InfoVis,2013,Using Concrete Scales: A Practical Framework for Effective Visual Depiction of Complex Measures,10.1109/TVCG.2013.210,http://dx.doi.org/10.1109/TVCG.2013.210,2426,2435,J,"From financial statistics to nutritional values, we are frequently exposed to quantitative information expressed in measures of either extreme magnitudes or unfamiliar units, or both. A common practice used to comprehend such complex measures is to relate, re-express, and compare them through visual depictions using magnitudes and units that are easier to grasp. Through this practice, we create a new graphic composition that we refer to as a concrete scale. To the best of our knowledge, there are no design guidelines that exist for concrete scales despite their common use in communication, educational, and decision-making settings. We attempt to fill this void by introducing a novel framework that would serve as a practical guide for their analysis and design. Informed by a thorough analysis of graphic compositions involving complex measures and an extensive literature review of scale cognition mechanisms, our framework outlines the design space of various measure relations-specifically relations involving the re-expression of complex measures to more familiar concepts-and their visual representations as graphic compositions.",Fanny Chevalier;Romain Vuillemot;Guia Gali,Fanny Chevalier;Romain Vuillemot;Guia Gali,University of Toronto &amp; OCAD University;INRIA;independant graphic designer and researcher,10.1109/TVCG.2012.199,"Concrete scale, scale cognition, visual comparison, graphic composition, visual notation",16,12,41,
SciVis,2013,Characterizing and Visualizing Predictive Uncertainty in Numerical Ensembles Through Bayesian Model Averaging,10.1109/TVCG.2013.138,http://dx.doi.org/10.1109/TVCG.2013.138,2703,2712,J,"Numerical ensemble forecasting is a powerful tool that drives many risk analysis efforts and decision making tasks. These ensembles are composed of individual simulations that each uniquely model a possible outcome for a common event of interest: e.g., the direction and force of a hurricane, or the path of travel and mortality rate of a pandemic. This paper presents a new visual strategy to help quantify and characterize a numerical ensemble's predictive uncertainty: i.e., the ability for ensemble constituents to accurately and consistently predict an event of interest based on ground truth observations. Our strategy employs a Bayesian framework to first construct a statistical aggregate from the ensemble. We extend the information obtained from the aggregate with a visualization strategy that characterizes predictive uncertainty at two levels: at a global level, which assesses the ensemble as a whole, as well as a local level, which examines each of the ensemble's constituents. Through this approach, modelers are able to better assess the predictive strengths and weaknesses of the ensemble as a whole, as well as individual models. We apply our method to two datasets to demonstrate its broad applicability.",Luke J. Gosink;Kevin Bensema;Trenton Pulsipher;Harald Obermaier;Michael Henry;Hank Childs;Kenneth I. Joy,Luke Gosink;Kevin Bensema;Trenton Pulsipher;Harald Obermaier;Michael Henry;Hank Childs;Kenneth I. Joy,Pacific Northwest National Laboratory;University of California at Davis;Pacific Northwest National Laboratory;University of California at Davis;Pacific Northwest National Laboratory;University of Oregon;University of California at Davis,10.1109/VISUAL.2002.1183769;10.1109/VISUAL.2005.1532853;10.1109/VISUAL.1996.568116;10.1109/TVCG.2010.208;10.1109/TVCG.2010.181,"Uncertainty visualization, numerical ensembles, statistical visualization",16,18,49,
VAST,2013,TimeBench: A Data Model and Software Library for Visual Analytics of Time-Oriented Data,10.1109/TVCG.2013.206,http://dx.doi.org/10.1109/TVCG.2013.206,2247,2256,J,"Time-oriented data play an essential role in many Visual Analytics scenarios such as extracting medical insights from collections of electronic health records or identifying emerging problems and vulnerabilities in network traffic. However, many software libraries for Visual Analytics treat time as a flat numerical data type and insufficiently tackle the complexity of the time domain such as calendar granularities and intervals. Therefore, developers of advanced Visual Analytics designs need to implement temporal foundations in their application code over and over again. We present TimeBench, a software library that provides foundational data structures and algorithms for time-oriented data in Visual Analytics. Its expressiveness and developer accessibility have been evaluated through application examples demonstrating a variety of challenges with time-oriented data and long-term developer studies conducted in the scope of research and student projects.",Alexander Rind;Tim Lammarsch;Wolfgang Aigner;Bilal Alsallakh;Silvia Miksch,Alexander Rind;Tim Lammarsch;Wolfgang Aigner;Bilal Alsallakh;Silvia Miksch,"Vienna University of Technology, Institute of Software Technology & Interactive Systems;Vienna University of Technology, Institute of Software Technology & Interactive Systems;Vienna University of Technology, Institute of Software Technology & Interactive Systems;Vienna University of Technology, Institute of Software Technology & Interactive Systems;Vienna University of Technology, Institute of Software Technology & Interactive Systems",10.1109/TVCG.2009.174;10.1109/INFVIS.2004.12;10.1109/VAST.2011.6102446;10.1109/VAST.2006.261428;10.1109/INFVIS.2000.885086;10.1109/TVCG.2010.144;10.1109/TVCG.2006.178;10.1109/INFVIS.2004.64;10.1109/TVCG.2013.222;10.1109/INFVIS.2002.1173155;10.1109/TVCG.2011.185;10.1109/TVCG.2010.126;10.1109/INFVIS.1997.636792,"Visual Analytics, information visualization, toolkits, software infrastructure, time, temporal data",16,13,52,
InfoVis,2014,Moving beyond sequential design: Reflections on a rich multi-channel approach to data visualization,10.1109/TVCG.2014.2346323,http://dx.doi.org/10.1109/TVCG.2014.2346323,2171,2180,J,"We reflect on a four-year engagement with transport authorities and others involving a large dataset describing the use of a public bicycle-sharing scheme. We describe the role visualization of these data played in fostering engagement with policy makers, transport operators, the transport research community, the museum and gallery sector and the general public. We identify each of these as `channels'-evolving relationships between producers and consumers of visualization-where traditional roles of the visualization expert and domain expert are blurred. In each case, we identify the different design decisions that were required to support each of these channels and the role played by the visualization process. Using chauffeured interaction with a flexible visual analytics system we demonstrate how insight was gained by policy makers into gendered spatio-temporal cycle behaviors, how this led to further insight into workplace commuting activity, group cycling behavior and explanations for street navigation choice. We demonstrate how this supported, and was supported by, the seemingly unrelated development of narrative-driven visualization via TEDx, of the creation and the setting of an art installation and the curating of digital and physical artefacts. We assert that existing models of visualization design, of tool/technique development and of insight generation do not adequately capture the richness of parallel engagement via these multiple channels of communication. We argue that developing multiple channels in parallel opens up opportunities for visualization design and analysis by building trust and authority and supporting creativity. This rich, non-sequential approach to visualization design is likely to foster serendipity, deepen insight and increase impact.",Jo Wood;Roger Beecham;Jason Dykes,Jo Wood;Roger Beecham;Jason Dykes,"giCentre, City University London;giCentre, City University London;giCentre, City University London",10.1109/TVCG.2012.272;10.1109/TVCG.2012.262;10.1109/TVCG.2012.213;10.1109/TVCG.2011.175;10.1109/TVCG.2013.134;10.1109/TVCG.2010.179;10.1109/TVCG.2013.132;10.1109/INFVIS.2004.59;10.1109/TVCG.2011.209;10.1109/TVCG.2013.145;10.1109/TVCG.2008.127,"Movement visualization, visual analytics, bikeshare, impact, visualization models, design study",16,17,59,
SciVis,2014,Fast and Memory-Efficienty Topological Denoising of 2D and 3D Scalar Fields,10.1109/TVCG.2014.2346432,http://dx.doi.org/10.1109/TVCG.2014.2346432,2585,2594,J,"Data acquisition, numerical inaccuracies, and sampling often introduce noise in measurements and simulations. Removing this noise is often necessary for efficient analysis and visualization of this data, yet many denoising techniques change the minima and maxima of a scalar field. For example, the extrema can appear or disappear, spatially move, and change their value. This can lead to wrong interpretations of the data, e.g., when the maximum temperature over an area is falsely reported being a few degrees cooler because the denoising method is unaware of these features. Recently, a topological denoising technique based on a global energy optimization was proposed, which allows the topology-controlled denoising of 2D scalar fields. While this method preserves the minima and maxima, it is constrained by the size of the data. We extend this work to large 2D data and medium-sized 3D data by introducing a novel domain decomposition approach. It allows processing small patches of the domain independently while still avoiding the introduction of new critical points. Furthermore, we propose an iterative refinement of the solution, which decreases the optimization energy compared to the previous approach and therefore gives smoother results that are closer to the input. We illustrate our technique on synthetic and real-world 2D and 3D data sets that highlight potential applications.",David Günther;Alec Jacobson;Jan Reininghaus;Hans-Peter Seidel;Olga Sorkine-Hornung;Tino Weinkauf,David Günther;Alec Jacobson;Jan Reininghaus;Hans-Peter Seidel;Olga Sorkine-Hornung;Tino Weinkauf,"Institut Mines-Télécom, Paris, France;Columbia University, New York, USA;IST Austria, Vienna, Austria;Max Planck Institute for Informatics, Saarbrücken, Germany;ETH Zürich, Zürich, Switzerland;Max Planck Institute for Informatics, Saarbrücken, Germany",10.1109/TVCG.2012.228;10.1109/VISUAL.2001.964507,"Numerical optimization, topology, scalar fields",16,17,26,
VAST,2014,"Towards Interactive, Intelligent, and Integrated Multimedia Analytics",10.1109/VAST.2014.7042476,http://dx.doi.org/10.1109/VAST.2014.7042476,3,12,C,"The size and importance of visual multimedia collections grew rapidly over the last years, creating a need for sophisticated multimedia analytics systems enabling large-scale, interactive, and insightful analysis. These systems need to integrate the human's natural expertise in analyzing multimedia with the machine's ability to process large-scale data. The paper starts off with a comprehensive overview of representation, learning, and interaction techniques from both the human's and the machine's point of view. To this end, hundreds of references from the related disciplines (visual analytics, information visualization, computer vision, multimedia information retrieval) have been surveyed. Based on the survey, a novel general multimedia analytics model is synthesized. In the model, the need for semantic navigation of the collection is emphasized and multimedia analytics tasks are placed on the exploration-search axis. The axis is composed of both exploration and search in a certain proportion which changes as the analyst progresses towards insight. Categorization is proposed as a suitable umbrella task realizing the exploration-search axis in the model. Finally, the pragmatic gap, defined as the difference between the tight machine categorization model and the flexible human categorization model is identified as a crucial multimedia analytics topic.",Jan Zahálka;Marcel Worring,Jan Zahálka;Marcel Worring,University of Amsterdam;University of Amsterdam,10.1109/VAST.2006.261425;10.1109/VAST.2007.4389003;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2010.136;10.1109/TVCG.2007.70515;10.1109/TVCG.2007.70541;10.1109/TVCG.2013.168,"Multimedia (image/video/music) visualization, machine learning",16,10,100,
VAST,2014,LoyalTracker: Visualizing Loyalty Dynamics in Search Engines,10.1109/TVCG.2014.2346912,http://dx.doi.org/10.1109/TVCG.2014.2346912,1733,1742,J,"The huge amount of user log data collected by search engine providers creates new opportunities to understand user loyalty and defection behavior at an unprecedented scale. However, this also poses a great challenge to analyze the behavior and glean insights into the complex, large data. In this paper, we introduce LoyalTracker, a visual analytics system to track user loyalty and switching behavior towards multiple search engines from the vast amount of user log data. We propose a new interactive visualization technique (flow view) based on a flow metaphor, which conveys a proper visual summary of the dynamics of user loyalty of thousands of users over time. Two other visualization techniques, a density map and a word cloud, are integrated to enable analysts to gain further insights into the patterns identified by the flow view. Case studies and the interview with domain experts are conducted to demonstrate the usefulness of our technique in understanding user loyalty and switching behavior in search engines.",Conglei Shi;Yingcai Wu;Shixia Liu;Hong Zhou;Huamin Qu,Conglei Shi;Yingcai Wu;Shixia Liu;Hong Zhou;Huamin Qu,Hong Kong University of Science and Technology;Microsoft Research Asia;Microsoft Research Asia;Shenzhen University;Hong Kong University of Science and Technology,10.1109/VAST.2010.5652931;10.1109/TVCG.2009.171;10.1109/VAST.2007.4389008;10.1109/TVCG.2012.253;10.1109/INFVIS.1996.559227;10.1109/TVCG.2012.212;10.1109/TVCG.2010.129;10.1109/TVCG.2012.225;10.1109/TVCG.2011.239;10.1109/VAST.2012.6400494;10.1109/INFVIS.2005.1532150;10.1109/TVCG.2008.166,"Time-series visualization, stacked graphs, log data visualization, text visualization",16,18,48,HM
SciVis,2015,Distribution Driven Extraction and Tracking of Features for Time-varying Data Analysis,10.1109/TVCG.2015.2467436,http://dx.doi.org/10.1109/TVCG.2015.2467436,837,846,J,"Effective analysis of features in time-varying data is essential in numerous scientific applications. Feature extraction and tracking are two important tasks scientists rely upon to get insights about the dynamic nature of the large scale time-varying data. However, often the complexity of the scientific phenomena only allows scientists to vaguely define their feature of interest. Furthermore, such features can have varying motion patterns and dynamic evolution over time. As a result, automatic extraction and tracking of features becomes a non-trivial task. In this work, we investigate these issues and propose a distribution driven approach which allows us to construct novel algorithms for reliable feature extraction and tracking with high confidence in the absence of accurate feature definition. We exploit two key properties of an object, motion and similarity to the target feature, and fuse the information gained from them to generate a robust feature-aware classification field at every time step. Tracking of features is done using such classified fields which enhances the accuracy and robustness of the proposed algorithm. The efficacy of our method is demonstrated by successfully applying it on several scientific data sets containing a wide range of dynamic time-varying features.",Soumya Dutta;Han-Wei Shen,Soumya Dutta;Han-Wei Shen,GRAVITY group;GRAVITY group,10.1109/TVCG.2007.70599;10.1109/VISUAL.1993.398877;10.1109/VISUAL.2004.107;10.1109/TVCG.2011.246;10.1109/TVCG.2007.70615;10.1109/VISUAL.2003.1250374;10.1109/TVCG.2013.152;10.1109/TVCG.2014.2346423;10.1109/TVCG.2007.70579;10.1109/VISUAL.1996.567807;10.1109/VISUAL.1998.745288;10.1109/TVCG.2008.163;10.1109/TVCG.2008.140,"Gaussian mixture model (GMM), Incremental learning, Feature extraction and tracking, Time-varying data analysis",16,19,45,
VAST,2016,Visualizing Dimension Coverage to Support Exploratory Analysis,10.1109/TVCG.2016.2598466,http://dx.doi.org/10.1109/TVCG.2016.2598466,21,30,J,"Data analysis involves constantly formulating and testing new hypotheses and questions about data. When dealing with a new dataset, especially one with many dimensions, it can be cumbersome for the analyst to clearly remember which aspects of the data have been investigated (i.e., visually examined for patterns, trends, outliers etc.) and which combinations have not. Yet this information is critical to help the analyst formulate new questions that they have not already answered. We observe that for tabular data, questions are typically comprised of varying combinations of data dimensions (e.g., what are the trends of Sales and Profit for different Regions?). We propose representing analysis history from the angle of dimension coverage (i.e., which data dimensions have been investigated and in which combinations). We use scented widgets to incorporate dimension coverage of the analysts' past work into interaction widgets of a visualization tool. We demonstrate how this approach can assist analysts with the question formation process. Our approach extends the concept of scented widgets to reveal aspects of one's own analysis history, and offers a different perspective on one's past work than typical visualization history tools. Results of our empirical study showed that participants with access to embedded dimension coverage information relied on this information when formulating questions, asked more questions about the data, generated more top-level findings, and showed greater breadth of their analysis without sacrificing depth.",Ali Sarvghad;Melanie Tory;Narges Mahyar,Ali Sarvghad;Melanie Tory;Narges Mahyar,University of Victoria;Tableau Research;University of British Columbia,10.1109/TVCG.2015.2467191;10.1109/TVCG.2006.120;10.1109/INFVIS.1999.801862;10.1109/INFVIS.2000.885086;10.1109/VISUAL.2005.1532788;10.1109/TVCG.2014.2346452;10.1109/VAST.2009.5333020;10.1109/INFVIS.2001.963289;10.1109/TVCG.2008.137;10.1109/TVCG.2015.2467611;10.1109/VISUAL.1993.398857;10.1109/TVCG.2007.70589;10.1109/TVCG.2013.167;10.1109/TVCG.2008.109,Dimension coverage;Tabular data;History;Empirical laboratory study;Exploratory data analysis;Scented widgets,16,16,33,
VAST,2016,Visual Analytics for Mobile Eye Tracking,10.1109/TVCG.2016.2598695,http://dx.doi.org/10.1109/TVCG.2016.2598695,301,310,J,"The analysis of eye tracking data often requires the annotation of areas of interest (AOIs) to derive semantic interpretations of human viewing behavior during experiments. This annotation is typically the most time-consuming step of the analysis process. Especially for data from wearable eye tracking glasses, every independently recorded video has to be annotated individually and corresponding AOIs between videos have to be identified. We provide a novel visual analytics approach to ease this annotation process by image-based, automatic clustering of eye tracking data integrated in an interactive labeling and analysis system. The annotation and analysis are tightly coupled by multiple linked views that allow for a direct interpretation of the labeled data in the context of the recorded video stimuli. The components of our analytics environment were developed with a user-centered design approach in close cooperation with an eye tracking expert. We demonstrate our approach with eye tracking data from a real experiment and compare it to an analysis of the data by manual annotation of dynamic AOIs. Furthermore, we conducted an expert user study with 6 external eye tracking researchers to collect feedback and identify analysis strategies they used while working with our application.",Kuno Kurzhals;Marcel Hlawatsch;Christof Seeger;Daniel Weiskopf,Kuno Kurzhals;Marcel Hlawatsch;Christof Seeger;Daniel Weiskopf,University of Stuttgart;University of Stuttgart;Stuttgart Media University;University of Stuttgart,10.1109/TVCG.2010.149;10.1109/TVCG.2015.2468091;10.1109/VAST.2006.261433;10.1109/TVCG.2009.111,Eye tracking;visual analytics;video visualization,16,21,34,
InfoVis,2017,VisTiles: Coordinating and Combining Co-located Mobile Devices for Visual Data Exploration,10.1109/TVCG.2017.2744019,http://dx.doi.org/10.1109/TVCG.2017.2744019,626,636,J,"We present VisTiles, a conceptual framework that uses a set of mobile devices to distribute and coordinate visualization views for the exploration of multivariate data. In contrast to desktop-based interfaces for information visualization, mobile devices offer the potential to provide a dynamic and user-defined interface supporting co-located collaborative data exploration with different individual workflows. As part of our framework, we contribute concepts that enable users to interact with coordinated &amp; multiple views (CMV) that are distributed across several mobile devices. The major components of the framework are: (i) dynamic and flexible layouts for CMV focusing on the distribution of views and (ii) an interaction concept for smart adaptations and combinations of visualizations utilizing explicit side-by-side arrangements of devices. As a result, users can benefit from the possibility to combine devices and organize them in meaningful spatial layouts. Furthermore, we present a web-based prototype implementation as a specific instance of our concepts. This implementation provides a practical application case enabling users to explore a multivariate data collection. We also illustrate the design process including feedback from a preliminary user study, which informed the design of both the concepts and the final prototype.",Ricardo Langner;Tom Horak;Raimund Dachselt,Ricardo Langner;Tom Horak;Raimund Dachselt,"Interactive Media Lab, Technische Universität Dresden, Germany;Interactive Media Lab, Technische Universität Dresden, Germany;Interactive Media Lab, Technische Universität Dresden, Germany",10.1109/VAST.2015.7347628;10.1109/TVCG.2007.70568;10.1109/TVCG.2012.204;10.1109/TVCG.2016.2598586;10.1109/TVCG.2014.2346573;10.1109/TVCG.2009.162;10.1109/TVCG.2012.237;10.1109/TVCG.2007.70515,"Mobile devices,coordinated & multiple views,multi-display environment,cross-device interaction",16,9,59,
InfoVis,2017,Orko: Facilitating Multimodal Interaction for Visual Exploration and Analysis of Networks,10.1109/TVCG.2017.2745219,http://dx.doi.org/10.1109/TVCG.2017.2745219,511,521,J,"Data visualization systems have predominantly been developed for WIMP-based direct manipulation interfaces. Only recently have other forms of interaction begun to appear, such as natural language or touch-based interaction, though usually operating only independently. Prior evaluations of natural language interfaces for visualization have indicated potential value in combining direct manipulation and natural language as complementary interaction techniques. We hypothesize that truly multimodal interfaces for visualization, those providing users with freedom of expression via both natural language and touch-based direct manipulation input, may provide an effective and engaging user experience. Unfortunately, however, little work has been done in exploring such multimodal visualization interfaces. To address this gap, we have created an architecture and a prototype visualization system called Orko that facilitates both natural language and direct manipulation input. Specifically, Orko focuses on the domain of network visualization, one that has largely relied on WIMP-based interfaces and direct manipulation interaction, and has little or no prior research exploring natural language interaction. We report results from an initial evaluation study of Orko, and use our observations to discuss opportunities and challenges for future work in multimodal network visualization interfaces.",Arjun Srinivasan;John T. Stasko,Arjun Srinivasan;John Stasko,Georgia Institute of Technology;Georgia Institute of Technology,10.1109/INFVIS.2005.1532136;10.1109/TVCG.2011.185;10.1109/TVCG.2013.124;10.1109/TVCG.2010.164;10.1109/TVCG.2012.204;10.1109/TVCG.2009.108,"Multimodal interaction,network visualization,natural language input,direct manipulation,multitouch input",16,16,70,
SciVis,2017,Instant Construction and Visualization of Crowded Biological Environments,10.1109/TVCG.2017.2744258,http://dx.doi.org/10.1109/TVCG.2017.2744258,862,872,J,"We present the first approach to integrative structural modeling of the biological mesoscale within an interactive visual environment. These complex models can comprise up to millions of molecules with defined atomic structures, locations, and interactions. Their construction has previously been attempted only within a non-visual and non-interactive environment. Our solution unites the modeling and visualization aspect, enabling interactive construction of atomic resolution mesoscale models of large portions of a cell. We present a novel set of GPU algorithms that build the basis for the rapid construction of complex biological structures. These structures consist of multiple membrane-enclosed compartments including both soluble molecules and fibrous structures. The compartments are defined using volume voxelization of triangulated meshes. For membranes, we present an extension of the Wang Tile concept that populates the bilayer with individual lipids. Soluble molecules are populated within compartments distributed according to a Halton sequence. Fibrous structures, such as RNA or actin filaments, are created by self-avoiding random walks. Resulting overlaps of molecules are resolved by a forced-based system. Our approach opens new possibilities to the world of interactive construction of cellular compartments. We demonstrate its effectiveness by showcasing scenes of different scale and complexity that comprise blood plasma, mycoplasma, and HIV.",Tobias Klein;Ludovic Autin;Barbora Kozlíková;David S. Goodsell;Arthur J. Olson;M. Eduard Gröller;Ivan Viola,Tobias Klein;Ludovic Autin;Barbora Kozlíková;David S. Goodsell;Arthur Olson;M. Eduard Gröller;Ivan Viola,"TU Wien, Austria;The Scripps Research Institute, California, USA;Masaryk University, Brno, Czech Republic;The Scripps Research Institute, California, USA;The Scripps Research Institute, California, USA;TU Wien, VRVis Research Center, Austria;TU Wien, Austria",,"Interactive modeling,population,biological data,interactive visualization",16,3,49,HM
VAST,2017,Clustering Trajectories by Relevant Parts for Air Traffic Analysis,10.1109/TVCG.2017.2744322,http://dx.doi.org/10.1109/TVCG.2017.2744322,34,44,J,"Clustering of trajectories of moving objects by similarity is an important technique in movement analysis. Existing distance functions assess the similarity between trajectories based on properties of the trajectory points or segments. The properties may include the spatial positions, times, and thematic attributes. There may be a need to focus the analysis on certain parts of trajectories, i.e., points and segments that have particular properties. According to the analysis focus, the analyst may need to cluster trajectories by similarity of their relevant parts only. Throughout the analysis process, the focus may change, and different parts of trajectories may become relevant. We propose an analytical workflow in which interactive filtering tools are used to attach relevance flags to elements of trajectories, clustering is done using a distance function that ignores irrelevant elements, and the resulting clusters are summarized for further analysis. We demonstrate how this workflow can be useful for different analysis tasks in three case studies with real data from the domain of air traffic. We propose a suite of generic techniques and visualization guidelines to support movement data analysis by means of relevance-aware trajectory clustering.",Gennady L. Andrienko;Natalia V. Andrienko;Georg Fuchs;Jose Manuel Cordero Garcia,Gennady Andrienko;Natalia Andrienko;Georg Fuchs;Jose Manuel Cordero Garcia,"Fraunhofer IAIS, City University, London;Fraunhofer IAIS, City University, London;Fraunhofer Institute IAIS;CRIDA (Reference Center for Research, Development and Innovation in ATM)",10.1109/VAST.2009.5332584;10.1109/TVCG.2013.193;10.1109/TVCG.2011.233;10.1109/TVCG.2015.2468292;10.1109/VAST.2008.4677350,"Visual analytics,movement data analysis,trajectory clustering,air traffic",16,15,53,
VAST,2017,Voila: Visual Anomaly Detection and Monitoring with Streaming Spatiotemporal Data,10.1109/TVCG.2017.2744419,http://dx.doi.org/10.1109/TVCG.2017.2744419,23,33,J,"The increasing availability of spatiotemporal data continuously collected from various sources provides new opportunities for a timely understanding of the data in their spatial and temporal context. Finding abnormal patterns in such data poses significant challenges. Given that there is often no clear boundary between normal and abnormal patterns, existing solutions are limited in their capacity of identifying anomalies in large, dynamic and heterogeneous data, interpreting anomalies in their multifaceted, spatiotemporal context, and allowing users to provide feedback in the analysis loop. In this work, we introduce a unified visual interactive system and framework, Voila, for interactively detecting anomalies in spatiotemporal data collected from a streaming data source. The system is designed to meet two requirements in real-world applications, i.e., online monitoring and interactivity. We propose a novel tensor-based anomaly analysis algorithm with visualization and interaction design that dynamically produces contextualized, interpretable data summaries and allows for interactively ranking anomalous patterns based on user input. Using the “smart city” as an example scenario, we demonstrate the effectiveness of the proposed framework through quantitative evaluation and qualitative case studies.",Nan Cao;Chaoguang Lin;Qiuhan Zhu;Yu-Ru Lin;Xian Teng;Xidao Wen,Nan Cao;Chaoguang Lin;Qiuhan Zhu;Yu-Ru Lin;Xian Teng;Xidao Wen,Intelligent Big Data Visualization (iDVx) LabTongji University;Intelligent Big Data Visualization (iDVx) LabTongji University;Intelligent Big Data Visualization (iDVx) LabTongji University;University of Pittsburgh;University of Pittsburgh;University of Pittsburgh,10.1109/TVCG.2015.2467196;10.1109/VAST.2012.6400557;10.1109/TVCG.2013.226;10.1109/VAST.2011.6102438;10.1109/VAST.2010.5652467;10.1109/TVCG.2016.2598432;10.1109/TVCG.2016.2598829;10.1109/TVCG.2015.2467194;10.1109/TVCG.2014.2346922,"Anomaly Detection,Visual Analysis",16,14,61,
VAST,2017,Progressive Learning of Topic Modeling Parameters: A Visual Analytics Framework,10.1109/TVCG.2017.2745080,http://dx.doi.org/10.1109/TVCG.2017.2745080,382,391,J,"Topic modeling algorithms are widely used to analyze the thematic composition of text corpora but remain difficult to interpret and adjust. Addressing these limitations, we present a modular visual analytics framework, tackling the understandability and adaptability of topic models through a user-driven reinforcement learning process which does not require a deep understanding of the underlying topic modeling algorithms. Given a document corpus, our approach initializes two algorithm configurations based on a parameter space analysis that enhances document separability. We abstract the model complexity in an interactive visual workspace for exploring the automatic matching results of two models, investigating topic summaries, analyzing parameter distributions, and reviewing documents. The main contribution of our work is an iterative decision-making technique in which users provide a document-based relevance feedback that allows the framework to converge to a user-endorsed topic distribution. We also report feedback from a two-stage study which shows that our technique results in topic model quality improvements on two independent measures.",Mennatallah El-Assady;Rita Sevastjanova;Fabian Sperrle;Daniel A. Keim;Christopher Collins 0001,Mennatallah El-Assady;Rita Sevastjanova;Fabian Sperrle;Daniel Keim;Christopher Collins,"University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;University of Ontario Institute of Technology, Canada",10.1109/TVCG.2015.2467618;10.1109/VAST.2014.7042493;10.1109/TVCG.2013.212;10.1109/VAST.2009.5333443;10.1109/TVCG.2011.239;10.1109/TVCG.2014.2346433;10.1109/TVCG.2010.129;10.1109/VAST.2011.6102461;10.1109/TVCG.2013.162;10.1109/TVCG.2013.126;10.1109/TVCG.2014.2346321,"Topic Model Configuration,Reinforcement Learning,Feature Detection and Tracking,Iterative Optimization",16,14,43,HM
VAST,2018,GAN Lab: Understanding Complex Deep Generative Models using Interactive Visual Experimentation,10.1109/TVCG.2018.2864500,http://dx.doi.org/10.1109/TVCG.2018.2864500,310,320,J,"Recent success in deep learning has generated immense interest among practitioners and students, inspiring many to learn about this new technology. While visual and interactive approaches have been successfully developed to help people more easily learn deep learning, most existing tools focus on simpler models. In this work, we present GAN Lab, the first interactive visualization tool designed for non-experts to learn and experiment with Generative Adversarial Networks (GANs), a popular class of complex deep learning models. With GAN Lab, users can interactively train generative models and visualize the dynamic training process's intermediate results. GAN Lab tightly integrates an model overview graph that summarizes GAN's structure, and a layered distributions view that helps users interpret the interplay between submodels. GAN Lab introduces new interactive experimentation features for learning complex deep learning models, such as step-by-step training at multiple levels of abstraction for understanding intricate training dynamics. Implemented using TensorFlow.js, GAN Lab is accessible to anyone via modern web browsers, without the need for installation or specialized hardware, overcoming a major practical challenge in deploying interactive tools for deep learning.",Minsuk Kahng;Nikhil Thorat;Duen Horng Chau;Fernanda B. Viégas;Martin Wattenberg,Minsuk Kahng;Nikhil Thorat;Duen Horng (Polo) Chau;Fernanda B. Viégas;Martin Wattenberg,Georgia Institute of Technology;Google Brain;Georgia Institute of Technology;Google Brain;Google Brain,10.1109/TVCG.2008.119;10.1109/TVCG.2017.2744683;10.1109/TVCG.2017.2744718;10.1109/TVCG.2017.2744938;10.1109/TVCG.2016.2598831;10.1109/TVCG.2010.177;10.1109/VAST.2017.8585721;10.1109/TVCG.2017.2744358;10.1109/TVCG.2017.2744158;10.1109/TVCG.2017.2744878,"Deep learning,information visualization,visual analytics,generative adversarial networks,machine learning,interactive experimentation,explorable explanations",16,14,44,
VAST,2018,RuleMatrix: Visualizing and Understanding Classifiers with Rules,10.1109/TVCG.2018.2864812,http://dx.doi.org/10.1109/TVCG.2018.2864812,342,352,J,"With the growing adoption of machine learning techniques, there is a surge of research interest towards making machine learning systems more transparent and interpretable. Various visualizations have been developed to help model developers understand, diagnose, and refine machine learning models. However, a large number of potential but neglected users are the domain experts with little knowledge of machine learning but are expected to work with machine learning systems. In this paper, we present an interactive visualization technique to help users with little expertise in machine learning to understand, explore and validate predictive models. By viewing the model as a black box, we extract a standardized rule-based knowledge representation from its input-output behavior. Then, we design RuleMatrix, a matrix-based visualization of rules to help users navigate and verify the rules and the black-box model. We evaluate the effectiveness of RuleMatrix via two use cases and a usability study.",Yao Ming;Huamin Qu;Enrico Bertini,Yao Ming;Huamin Qu;Enrico Bertini,University of Science and Technology;University of Science and Technology;New York University,10.1109/TVCG.2017.2744683;10.1109/TVCG.2017.2744718;10.1109/VAST.2017.8585720;10.1109/TVCG.2016.2598831;10.1109/VAST.2017.8585721;10.1109/TVCG.2017.2744358;10.1109/TVCG.2016.2598838;10.1109/TVCG.2016.2598828;10.1109/TVCG.2017.2744158;10.1109/VISUAL.2005.1532820;10.1109/VAST.2011.6102453;10.1109/TVCG.2017.2744878,"explainable machine learning,rule visualization,visual analytics",16,20,48,
VAST,2018,Evaluating Multi-Dimensional Visualizations for Understanding Fuzzy Clusters,10.1109/TVCG.2018.2865020,http://dx.doi.org/10.1109/TVCG.2018.2865020,12,21,J,"Fuzzy clustering assigns a probability of membership for a datum to a cluster, which veritably reflects real-world clustering scenarios but significantly increases the complexity of understanding fuzzy clusters. Many studies have demonstrated that visualization techniques for multi-dimensional data are beneficial to understand fuzzy clusters. However, no empirical evidence exists on the effectiveness and efficiency of these visualization techniques in solving analytical tasks featured by fuzzy clusters. In this paper, we conduct a controlled experiment to evaluate the ability of fuzzy clusters analysis to use four multi-dimensional visualization techniques, namely, parallel coordinate plot, scatterplot matrix, principal component analysis, and Radviz. First, we define the analytical tasks and their representative questions specific to fuzzy clusters analysis. Then, we design objective questionnaires to compare the accuracy, time, and satisfaction in using the four techniques to solve the questions. We also design subjective questionnaires to collect the experience of the volunteers with the four techniques in terms of ease of use, informativeness, and helpfulness. With a complete experiment process and a detailed result analysis, we test against four hypotheses that are formulated on the basis of our experience, and provide instructive guidance for analysts in selecting appropriate and efficient visualization techniques to analyze fuzzy clusters.",Ying Zhao 0001;Feng Luo;Minghui Chen;Yingchao Wang;Jiazhi Xia;Fangfang Zhou;Yunhai Wang;Yi Chen 0007;Wei Chen 0001,Ying Zhao;Feng Luo;Minghui Chen;Yingchao Wang;Jiazhi Xia;Fangfang Zhou;Yunhai Wang;Yi Chen;Wei Chen,Central South University;Central South University;Central South University;Central South University;Central South University;Central South University;Shandong University;Beijing TechnologyBusiness University;State Key Lab of CAD & CGZhejiang University,10.1109/INFVIS.2005.1532136;10.1109/INFVIS.1998.729559;10.1109/TVCG.2017.2745138;10.1109/VAST.2010.5652450;10.1109/VISUAL.1997.663916;10.1109/TVCG.2009.153;10.1109/TVCG.2016.2598831;10.1109/INFVIS.2004.15;10.1109/TVCG.2017.2744198;10.1109/TVCG.2015.2467324;10.1109/TVCG.2013.153;10.1109/TVCG.2008.173;10.1109/VISUAL.1990.146375;10.1109/TVCG.2017.2744098;10.1109/TVCG.2016.2598479;10.1109/INFVIS.2003.1249015,"Evaluation,multi-dimensional visualization,fuzzy clustering,parallel coordinate plot,scatterplot matrix,principal component analysis,radviz",16,10,63,
Vis,1990,"Spline-based color sequences for univariate, bivariate and trivariate mapping",10.1109/VISUAL.1990.146383,http://dx.doi.org/10.1109/VISUAL.1990.146383,202,"208, 474-5",C,"Alternative models that use B-spline curves and surfaces for generating color sequences for univariate, bivariate, and trivariate mapping are introduced. The main aim is to break away from simple geometric representation in order to provide more flexibility and control over color selection. This facilitates the task of constructing a customized color scheme for a particular map. The author gives a brief description of existing color schemes and their characteristics, and provides some background for B-spline curves and surfaces.&lt;&lt;ETX&gt;&gt;",Binh Pham 0001,B. Pham,"Dept. of Comput. Sci., Monash Univ., Melbourne, Vic., Australia",,,15,9,15,
Vis,1991,NetV: an experimental network-based volume visualization system,10.1109/VISUAL.1991.175807,http://dx.doi.org/10.1109/VISUAL.1991.175807,239,245,C,"An experimental volume visualization system, NetV, that distributes volume imaging tasks to appropriate network resources is described. NetV gives offsite scientists easy access to high-end volume imaging software and hardware. The system allows a user to submit volume imaging jobs to an imaging spooler on a visualization-server. Remote high-power compute engines process rendering tasks, while local workstations run the user-interface. The time required to submit a job, render the job on a mini-supercomputer-class machine, and return the volume imaging to the offsite scientist is far less than the time it would take to create a similar image on a local workstation-class machine.&lt;&lt;ETX&gt;&gt;",T. Todd Elvins;David R. Nadeau,T.T. Elvins;D.R. Nadeau,"San Diego Supercomput. Center, Adv. Sci. Visualization Lab., CA, USA;San Diego Supercomput. Center, Adv. Sci. Visualization Lab., CA, USA",10.1109/VISUAL.1990.146362;10.1109/VISUAL.1990.146397;10.1109/VISUAL.1990.146382;10.1109/VISUAL.1991.175814,,15,9,16,
Vis,1993,Bridging the gap between visualization and data management: A simple visualization management system,10.1109/VISUAL.1993.398856,http://dx.doi.org/10.1109/VISUAL.1993.398856,94,101,C,A prototype visualization management system is described which merges the capabilities of a database management system with any number of existing visualization packages such as AVS or IDL. The prototype uses the Postgres database management system to store and access Earth science data through a simple graphical browser. Data located in the database is visualized by automatically invoking a desired visualization package and downloading an appropriate script or program. The central idea underlying the system is that information on how to visualize a data set is stored in the database with the data set itself.&lt;&lt;ETX&gt;&gt;,Peter Kochevar;Zahid Ahmed;J. Shade;Colin Sharp,P. Kochevar;Z. Ahmed;J. Shade;C. Sharp,"Digital Equipment Corp., San Diego, CA, USA;Digital Equipment Corp., San Diego, CA, USA",10.1109/VISUAL.1992.235219;10.1109/VISUAL.1992.235197,,15,5,12,
Vis,1993,Fine-grain visualization algorithms in dataflow environments,10.1109/VISUAL.1993.398860,http://dx.doi.org/10.1109/VISUAL.1993.398860,126,133,C,"Most of the current dataflow visualization systems are based on coarse-grain dataflow computing models. In this paper we propose a fine-grain dataflow model that takes advantage of data locality properties of many visualization algorithms. A fine-grain module works on small chunks of data one at a time by keeping a dynamically adjusted moving window on the input data stream. It is more memory efficient and has the potential of handling very large data sets without taking up all the memory resources. Two popular visualization algorithms, an iso-surface extraction algorithm and a volume rendering algorithm, are implemented using the fine-grain model. The performance measurements showed faster speed, reduced memory usage, and improved CPU utilization over a typical coarse-grain system.&lt;&lt;ETX&gt;&gt;",D. Song;Eric J. Golin,D. Song;E. Golin,"Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA;Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA",10.1109/VISUAL.1992.235219,,15,10,27,
Vis,1993,"Towards interactive steering, visualization and animation of unsteady finite element simulations",10.1109/VISUAL.1993.398895,http://dx.doi.org/10.1109/VISUAL.1993.398895,374,377,C,"Progress towards interactive steering of the time-accurate, unsteady finite-element simulation program DYNA3D is reported. Rudimentary steering has been demonstrated in a distributed computational environment encompassing a supercomputer, multiple graphics workstations, and a single frame animation recorder. The coroutine facility of AVS (application visualization system from AVS Inc.) and software produced in-house has been coordinated to prove the concept. This work also applies to other large batch-oriented FORTRAN simulations (""dusty decks"") presently in production use.&lt;&lt;ETX&gt;&gt;",G. David Kerlick;E. Kirby,G.D. Kerlick;E. Kirby,"Boeing Computer Services Res. & Technology, Bellevue, WA, USA;Boeing Computer Services Res. & Technology, Bellevue, WA, USA",,,15,7,5,
Vis,1993,3D simulation of delivery,10.1109/VISUAL.1993.398903,http://dx.doi.org/10.1109/VISUAL.1993.398903,416,419,C,We show how to create 3D models of maternal pelvis and fetal head from magnetic resonance images (MRI). The models are used to simulate the progress of delivery in order to give a prognosis of successful labor.&lt;&lt;ETX&gt;&gt;,Jean-Daniel Boissonnat;Bernhard Geiger,J.-D. Boissonnat;B. Geiger,"I.N.R.I.A., Sophia-Antipolis, France;I.N.R.I.A., Sophia-Antipolis, France",,,15,6,9,
Vis,1994,Parallel performance measures for volume ray casting,10.1109/VISUAL.1994.346319,http://dx.doi.org/10.1109/VISUAL.1994.346319,196,203,C,"Describes a technique for achieving fast volume ray-casting on parallel machines, using a load-balancing scheme and an efficient pipelined approach to compositing. We propose a new model for measuring the amount of work one needs to perform in order to render a given volume, and we use this model to obtain a better load-balancing scheme for distributed memory machines. We also discuss in detail the design trade-offs of our technique. In order to validate our model, we have implemented it on the Intel iPSC/860 and the Intel Paragon, and conducted a detailed performance analysis.&lt;&lt;ETX&gt;&gt;",Cláudio T. Silva;Arie E. Kaufman,C.T. Silva;A.E. Kaufman,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1992.235231;10.1109/VISUAL.1991.175777;10.1109/VISUAL.1994.346340,,15,6,13,
Vis,1994,Virtual reality performance for virtual geometry,10.1109/VISUAL.1994.346324,http://dx.doi.org/10.1109/VISUAL.1994.346324,156,"163, C17",C,"We describe the theoretical and practical visualization issues solved in the implementation of an interactive real-time four-dimensional geometry interface for the CAVE, an immersive virtual reality environment. While our specific task is to produce a ""virtual geometry"" experience by approximating physically correct rendering of manifolds embedded in four dimensions, the general principles exploited by our approach reflect requirements common to many immersive virtual reality applications, especially those involving volume rendering. Among the issues we address are the classification of rendering tasks, the specialized hardware support required to attain interactivity, specific techniques required to render 4D objects, and interactive methods appropriate for our 4D virtual world application.&lt;&lt;ETX&gt;&gt;",Robert A. Cross;Andrew J. Hanson,R.A. Cross;A.J. Hanson,"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA;Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA",10.1109/VISUAL.1994.346330;10.1109/VISUAL.1993.398869;10.1109/VISUAL.1991.175821;10.1109/VISUAL.1992.235222,,15,6,20,
Vis,1996,Clinical evaluation of interactive volume visualization,10.1109/VISUAL.1996.568134,http://dx.doi.org/10.1109/VISUAL.1996.568134,367,370,C,"The case study describes a system that allows the use of interactive volume rendering for routine clinical diagnosis. In this setup, a SGI RealityStation acts like a remote rendering system which is controlled by a user interface that was added to an existing clinical system. The paper describes some implementation aspects, including several system optimizations that were carried out in order to optimize rendering speed. Initial results are very promising; the authors present three examples of clinical findings that were made using this system. Because of the setup, clinicians are now much more aware of the possibilities that modern hardware offers for interactive volume visualization.",Karel J. Zuiderveld;Peter M. A. van Ooijen;John W. C. Chin-A-Woeng;Pieter C. Buijs;Marco Olree;Frits H. Post,K.J. Zuiderveld;P.M.A. van Ooijen;J.W.C. Chin-A-Woeng;P.C. Buijs;M. Olree;F.H. Posti,"Inst. of Med. Image Sci., Univ. Hospital Utrecht, Netherlands",,"Volume Rendering, Texture Mapping, MR Angiography, Visualization, Clinical Evaluation",15,4,4,
InfoVis,1997,Adaptive information visualization based on the user's multiple viewpoints - interactive 3D visualization of the WWW,10.1109/INFVIS.1997.636778,http://dx.doi.org/10.1109/INFVIS.1997.636778,25,28,C,"We introduce the adaptive information visualization method for hypermedia and the WWW based on the user's multiple viewpoints. We propose two graphical interfaces, the CVI and the RF-Cone. The CVI is the interface for interactive viewpoint selection. We can select a viewpoint reflecting our interests by using the CVI. According to the given viewpoint, the RF-Cone adaptively organizes the 3D representation of the hypermedia so that we can understand the semantic and structural relationship of the hypermedia and easily retrieve the information. Combining these methods, we have developed the WWW visualization system which can provide highly efficient navigation.",Teruhiko Teraoka;Minoru Maruyama,T. Teraoka;M. Maruyama,"Adv. Technol. R&D Center, Mitsubishi Electr. Corp., Amagasaki, Japan",,,15,3,10,
Vis,1997,Brushing techniques for exploring volume datasets,10.1109/VISUAL.1997.663914,http://dx.doi.org/10.1109/VISUAL.1997.663914,429,432,C,"Describes several visualization techniques based on the notion of multi-resolution brushing to browse large 3D volume datasets. Our software is implemented using public-domain libraries, and is designed to run on average-equipped desktop computers such as a Linux machine with 32 MBytes of memory. Empirically, our system allows scientists to obtain information from a large dataset with over 8.3 million numbers in interactive time. We show that very large scientific volume datasets can be accessed and utilized without expensive hardware and software.",Pak Chung Wong;R. Daniel Bergeron,Pak Chung Wong;R.D. Bergeron,"Dept. of Comput. Sci., New Hampshire Univ., Durham, NH, USA",10.1109/VISUAL.1995.480811;10.1109/VISUAL.1996.567800,,15,4,12,
InfoVis,1998,Traversal-based visualization of data structures,10.1109/INFVIS.1998.729554,http://dx.doi.org/10.1109/INFVIS.1998.729554,11,18,C,"Algorithm animation systems and graphical debuggers perform the task of translating program state into visual representations. While algorithm animations typically rely on user augmented source code to produce visualizations, debuggers make use of symbolic information in the target program. As a result, visualizations produced by debuggers often lack important semantic content, making them inferior to algorithm animation systems. The paper presents a method to provide higher level, more informative visualizations in a debugger using a technique called traversal based visualization. The debugger traverses a data structure using a set of user supplied patterns to identify parts of the data structure to be drawn a similar way. A declarative language is used to specify the patterns and the actions to take when the patterns are encountered. Alternatively, the user can construct traversal specifications through a graphical user interface to the declarative language. Furthermore, the debugger supports modification of data. Changes made to the on-screen representation are reflected in the underlying data.",Jeffrey L. Korn;Andrew W. Appel,J.L. Korn;A.W. Appel,"Dept. of Comput. Sci., Princeton Univ., NJ, USA",,,15,4,19,
Vis,1998,Wavelets over curvilinear grids,10.1109/VISUAL.1998.745318,http://dx.doi.org/10.1109/VISUAL.1998.745318,313,317,C,"We develop multiresolution models for analyzing and visualizing two-dimensional flows over curvilinear grids. Our models are based upon nested spaces of piecewise defined functions defined over nested curvilinear grid domains. The nested domains are selected so as to maintain the original geometry of the inner boundary. We first give the refinement and decomposition equations for Haar wavelets over these domains. Next, using lifting techniques we develop and show examples of piecewise linear wavelets over curvilinear grids.",Gregory M. Nielson;Il-Hong Jung;Junwon Sung,G.M. Nielson;Il.-H. Jung;J. Sung,"Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA",10.1109/VISUAL.1997.663883;10.1109/VISUAL.1997.663872;10.1109/VISUAL.1997.663871,,15,3,11,
Vis,1998,Visual presentation of magnetic resonance images,10.1109/VISUAL.1998.745334,http://dx.doi.org/10.1109/VISUAL.1998.745334,423,426,C,"Medical image analysis is shifting from current film oriented light screen environments to computer environments that involve viewing and analyzing large sets of images on a computer screen. Magnetic resonance imaging (MRI) studies, in particular, can involve many images. The paper examines how best to meet the needs of radiologists in a computational environment. To this end, a field study was conducted to observe radiologists' interactions during MRI analysis in the traditional light screen environment. Key issues uncovered involve control over focus and context, dynamic grouping of images and retrieval of images and image groups. To address the problem of focus and context, existing layout adjustment and magnification techniques are explored to provide the most appropriate solution. Our interest is in combining the methodologies of human computer interaction studies with computational presentation possibilities to design a visual environment for the crucial field of medical image analysis.",Johanna E. van der Heyden;Sheelagh Carpendale;Kevin B. Inkpen;M. Stella Atkins,J.E. van der Heyden;M.S.T. Carpendale;K. Inkpen;M.S. Atkins,"Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada",10.1109/INFVIS.1996.559214,,15,3,10,
InfoVis,1999,Domain analysis: a technique to design a user-centered visualization framework,10.1109/INFVIS.1999.801856,http://dx.doi.org/10.1109/INFVIS.1999.801856,44,"52, 144",C,"Domain Analysis for Data Visualization (DADV) is a technique to use when investigating a domain where data visualizations are going to be designed and added to existing software systems. DADV was used to design the data visualization in VisEIO-LCA, which is a framework to visualize environmental data about products. Most of the visualizations are designed using the following stages: formatting data in tables, selecting visual structures, and rendering the data on the screen. Although many visualization authors perform implicit domain analysis, in this paper domain analysis is added explicitly to the process of designing visualizations with the goal of producing move usable software tools. Environmental Life-Cycle Assessment (LCA) is used as a test bed for this technique.",Octavio Juarez Espinosa;Chris Hendrickson;James H. Garrett Jr.,O.J. Espinosa;C. Hendrickson;J.H. Garrett,"Dept. of Civil & Environ. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA",10.1109/INFVIS.1996.559210;10.1109/VISUAL.1991.175815,"Visualization framework, Life-Cycle Assessment, user tasks, computer-human interaction, domain analysis, economic input-output",15,5,25,
InfoVis,2001,Graph sketches,10.1109/INFVIS.2001.963282,http://dx.doi.org/10.1109/INFVIS.2001.963282,67,70,C,,James Abello;Irene Finocchi;Jeffrey L. Korn,J. Abello;I. Finocchi;J. Korn,AT&T Labs-Research,10.1109/INFVIS.2000.885089,"visualization, massive data sets, graphs, hierarchies",15,8,13,
Vis,2001,Transport and anisotropic diffusion in time-dependent flow visualization,10.1109/VISUAL.2001.964494,http://dx.doi.org/10.1109/VISUAL.2001.964494,61,68,C,"The visualization of time-dependent flow is an important and challenging topic in scientific visualization. Its aim is to represent transport phenomena governed by time-dependent vector fields in an intuitively understandable way, using images and animations. Here we pick up the recently presented anisotropic diffusion method, expand and generalize it to allow a multiscale visualization of long-term, complex transport problems. Instead of streamline type patterns generated by the original method now streakline patterns are generated and advected. This process obeys a nonlinear transport diffusion equation with typically dominant transport. Starting from some noisy initial image, the diffusion actually generates and enhances patterns which are then transported in the direction of the flow field. Simultaneously the image is again sharpened in the direction orthogonal to the flow field. A careful adjustment of the models parameters is derived to balance diffusion and transport effects in a reasonable way. Properties of the method can be discussed for the continuous model, which is solved by an efficient upwind finite element discretization. As characteristic for the class of multiscale image processing methods, we can in advance select a suitable scale for representing the flow field.",David Bürkle;Tobias Preußer;Martin Rumpf,D. Burkle;T. Preusser;M. Rumpf,"Inst. fur Angewandte Math., Freiburg Univ., Germany",10.1109/VISUAL.1995.480817;10.1109/VISUAL.1994.346312;10.1109/VISUAL.1999.809894;10.1109/VISUAL.1997.663898;10.1109/VISUAL.1999.809904;10.1109/VISUAL.1997.663912,"flow visualization, multiscale image processing, non-linear diffusion, transport diffusion, upwind method",15,5,20,
Vis,2001,Volume Rendering of Fine Details Within Medical Data,10.1109/VISUAL.2001.964537,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2001.964537,387,394,C,"Presents a method concerning the volume rendering of fine details, such as blood vessels and nerves, from medical data. The realistic and efficient visualization of such structures is often of great medical interest, and conventional rendering techniques do not always deal with them adequately. Our method uses preprocessing to reconstruct fine details that are difficult to segment and label. It detects the presence of fine geometrical structures, such as cracks or cylinders that suggest the existence of, for example, blood vessels or nerves; the subsequent volume rendering then displays fine geometrical objects that lie on a surface. The method can also show structures within the volume, using a special ""integration sampling"" scheme to portray reconstructed volume texture, such as that exhibited by muscle fibers. By combining the surface structure and volume texture in the rendering, realistic results can be produced; examples are provided.",Feng Dong;Gordon Clapworthy;Meleagros A. Krokos,Feng Dong;G.J. Clapworthy;M. Krokos,"Dept. of Comput. & Inf. Sci., De Montfort Univ., Leicester, UK;Dept. of Comput. & Inf. Sci., De Montfort Univ., Leicester, UK;Dept. of Comput. & Inf. Sci., De Montfort Univ., Leicester, UK",10.1109/VISUAL.1997.663882;10.1109/VISUAL.1994.346340;10.1109/VISUAL.1999.809911;10.1109/VISUAL.1998.745309;10.1109/VISUAL.1999.809909;10.1109/VISUAL.1998.745311;10.1109/VISUAL.1997.663848,"Volume Rendering, Fine Details, Medical Visualization, Image Processing, Volume Textures",15,1,24,
Vis,2002,Volumetric shadows using splatting,10.1109/VISUAL.2002.1183761,http://dx.doi.org/10.1109/VISUAL.2002.1183761,85,92,C,"This paper describes an efficient algorithm to model the light attenuation due to a participating media with low albedo. The light attenuation is modeled using splatting volume renderer for both the viewer and the light source. During the rendering, a 2D shadow buffer attenuates the light for each pixel. When the contribution of a footprint is added to the image buffer, as seen from the eye, we add the contribution to the shadow buffer, as seen from the light source. We have generated shadows for point lights and parallel lights using this algorithm. The shadow algorithm has been extended to deal with multiple light sources and projective textured lights.",Caixia Zhang;Roger Crawfis,Caixia Zhang;R. Crawfis,"Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA;Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA",10.1109/VISUAL.1998.745309;10.1109/VISUAL.1999.809909;10.1109/VISUAL.2000.885698;10.1109/VISUAL.2002.1183764,"visualization, volume rendering, shadows, illumination",15,5,24,
InfoVis,2003,A virtual workspace for hybrid multidimensional scaling algorithms,10.1109/INFVIS.2003.1249013,http://dx.doi.org/10.1109/INFVIS.2003.1249013,91,96,C,"In visualising multidimensional data, it is well known that different types of algorithms to process them. Data sets might be distinguished according to volume, variable types and distribution, and each of these characteristics imposes constraints upon the choice of applicable algorithms for their visualization. Previous work has shown that a hybrid algorithmic approach can be successful in addressing the impact of data volume on the feasibility of multidimensional scaling (MDS). This suggests that hybrid combinations of appropriate algorithms might also successfully address other characteristics of data. This paper presents a system and framework in which a user can easily explore hybrid algorithms and the data flowing through them. Visual programming and a novel algorithmic architecture let the user semi-automatically define data flows and the co-ordination of multiple views.",Greg Ross;Matthew Chalmers,G. Ross;M. Chalmers,"Dept. of Comput. Sci., Glasgow Univ., UK;Dept. of Comput. Sci., Glasgow Univ., UK",10.1109/INFVIS.2003.1249012;10.1109/VISUAL.1996.567787,"Data-flow, visual programming, multidimensional scaling, multiple views, hybrid algorithms, complexity",15,1,18,
Vis,2004,Pixel-exact rendering of spacetime finite element solutions,10.1109/VISUAL.2004.81,http://dx.doi.org/10.1109/VISUAL.2004.81,425,432,C,"Computational simulation of time-varying physical processes is of fundamental importance for many scientific and engineering applications. Most frequently, time-varying simulations are performed over multiple spatial grids at discrete points in time. We investigate a new approach to time-varying simulation: spacetime discontinuous Galerkin finite element methods. The result of this simulation method is a simplicial tessellation of spacetime with per-element polynomial solutions for physical quantities such as strain, stress, and velocity. To provide accurate visualizations of the resulting solutions, we have developed a method for per-pixel evaluation of solution data on the GPU. We demonstrate the importance of per-pixel rendering versus simple linear interpolation for producing high quality visualizations. We also show that our system can accommodate reasonably large datasets - spacetime meshes containing up to 20 million tetrahedra are not uncommon in this domain.",Yuan Zhou;Michael Garland;Robert Haber,Yuan Zhou;M. Garland;R. Haber,"Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA;Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA",10.1109/VISUAL.2000.885704;10.1109/VISUAL.1990.146361;10.1109/VISUAL.2003.1250354;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2003.1250386,"pixel-exact visualization, pixel shaders, spacetime finite elements, discontinuous Galerkin methods",15,6,31,
Vis,2004,Rendering implicit flow volumes,10.1109/VISUAL.2004.90,http://dx.doi.org/10.1109/VISUAL.2004.90,99,106,C,"Traditional flow volumes construct an explicit geometrical or parametrical representation from the vector field. The geometry is updated interactively and then rendered using an unstructured volume rendering technique. Unless a detailed refinement of the flow volume is specified for the interior, information inside the underlying flow volume is lost in the linear interpolation. These disadvantages can be avoided and/or alleviated using an implicit flow model. An implicit flow is a scalar field constructed such that any point in the field is associated with a termination surface using an advection operator on the flow. We present two techniques, a slice-based three-dimensional texture mapping and an interval volume segmentation coupled with a tetrahedron projection-based renderer, to render implicit stream flows. In the first method, the implicit flow representation is loaded as a 3D texture and manipulated using a dynamic texture operation that allows the flow to be investigated interactively. In our second method, a geometric flow volume is extracted from the implicit flow using a high dimensional isocontouring or interval volume routine. This provides a very detailed flow volume or set of flow volumes that can easily change topology, while retaining accurate characteristics within the flow volume. The advantages and disadvantages of these two techniques are compared with traditional explicit flow volumes.",Daqing Xue;Caixia Zhang;Roger Crawfis,D. Xue;C. Zhang;R. Crawfis,"Dept. of Comput. Sci. & Eng., Ohio State Univ., Columbus, OH, USA;Dept. of Comput. Sci. & Eng., Ohio State Univ., Columbus, OH, USA;Dept. of Comput. Sci. & Eng., Ohio State Univ., Columbus, OH, USA",10.1109/VISUAL.2001.964519;10.1109/VISUAL.1993.398846;10.1109/VISUAL.2000.885688;10.1109/VISUAL.1991.175789;10.1109/VISUAL.2003.1250364;10.1109/VISUAL.1992.235211;10.1109/VISUAL.1996.567777;10.1109/VISUAL.2000.885704;10.1109/VISUAL.1999.809909;10.1109/VISUAL.2003.1250376;10.1109/VISUAL.2003.1250377;10.1109/VISUAL.1993.398875;10.1109/VISUAL.2003.1250378;10.1109/VISUAL.1999.809892,"interval volume rendering, implicit stream flow, flow visualization, graphics hardware",15,6,35,
Vis,2005,2D asymmetric tensor analysis,10.1109/VISUAL.2005.1532770,http://dx.doi.org/10.1109/VISUAL.2005.1532770,3,10,C,"Analysis of degenerate tensors is a fundamental step in finding the topological structures and separatrices in tensor fields. Previous work in this area have been limited to analyzing symmetric second order tensor fields. In this paper, we extend the topological analysis to 2D general (asymmetric) second order tensor fields. We show that it is not sufficient to define degeneracies based on eigenvalues alone, but one must also include the eigenvectors in the analysis. We also study the behavior of these eigenvectors as they cross from one topological region into another.",Xiaoqiang Zheng;Alex T. Pang,X. Zheng;A. Pang,"Comput. Sci. Dept., California Univ., Santa Cruz, CA, USA;Comput. Sci. Dept., California Univ., Santa Cruz, CA, USA",10.1109/VISUAL.1997.663929;10.1109/VISUAL.1998.745291;10.1109/VISUAL.1994.346326;10.1109/VISUAL.1994.346326;10.1109/VISUAL.2004.80;10.1109/VISUAL.1998.745294;10.1109/VISUAL.1999.809886,"critical points, general tensors, symmetric tensors,degenerate tensors, tensor topology, topological lines, hyperstream-lines",15,6,18,
Vis,2005,Dataset traversal with motion-controlled transfer functions,10.1109/VISUAL.2005.1532817,http://dx.doi.org/10.1109/VISUAL.2005.1532817,359,366,C,"In this paper, we describe a methodology and implementation for interactive dataset traversal using motion-controlled transfer functions. Dataset traversal here refers lo the process of translating a transfer function along a specific path. In scientific visualization, it is often necessary to manipulate transfer functions in order to visualize datasets more effectively. This manipulation of transfer functions is usually performed globally, i.e., a new transfer function is applied to the entire dataset. Our approach allows one to locally manipulate transfer functions while controling its movement along a traversal path. The method we propose allows the user to select a traversal path within the dataset, based on the shape of the volumetric model and manipulate a transfer function along this path. Examples of dataset traversal include the animation of transfer functions along a pre-defined path, the simulation of flow in vascular structures, and the visualization of convoluted shapes. For example, this type of traversal is often used in medical illustration to highlight flow in blood vessels. We present an interactive implementation of our method using graphics hardware, based on the decomposition of the volume. We show examples of our approach using a variety of volumetric datasets, and we also demonstrate that with our novel decomposition, the rendering process is faster.",Carlos D. Correa;Deborah Silver,C.D. Correa;D. Silver,"Dept. of Electr. & Comput. Eng., State Univ. of New Jersey, Newark, NJ, USA;Dept. of Electr. & Comput. Eng., State Univ. of New Jersey, Newark, NJ, USA",10.1109/VISUAL.2003.1250388;10.1109/VISUAL.2002.1183820;10.1109/VISUAL.2002.1183777;10.1109/VISUAL.2003.1250386;10.1109/VISUAL.2004.48;10.1109/VISUAL.2001.964517,"Dataset traversal, illustrative visualization, volume manipulation, animation, transfer functions",15,8,29,
InfoVis,2006,Smashing Peacocks Further: Drawing Quasi-Trees from Biconnected Components,10.1109/TVCG.2006.177,http://dx.doi.org/10.1109/TVCG.2006.177,813,820,J,"Quasi-trees, namely graphs with tree-like structure, appear in many application domains, including bioinformatics and computer networks. Our new SPF approach exploits the structure of these graphs with a two-level approach to drawing, where the graph is decomposed into a tree of biconnected components. The low-level biconnected components are drawn with a force-directed approach that uses a spanning tree skeleton as a starting point for the layout. The higher-level structure of the graph is a true tree with meta-nodes of variable size that contain each biconnected component. That tree is drawn with a new area-aware variant of a tree drawing algorithm that handles high-degree nodes gracefully, at the cost of allowing edge-node overlaps. SPF performs an order of magnitude faster than the best previous approaches, while producing drawings of commensurate or improved quality.",Daniel Archambault;Tamara Munzner;David Auber,Daniel Archambault;Tamara Munzner;David Auber,University of British Columbia;University of British Columbia;Universite de Bordeaux,10.1109/INFVIS.1997.636718,"Graph and network visualization, quasi-tree",15,12,23,
Vis,2006,An Atmospheric Visual Analysis and Exploration System,10.1109/TVCG.2006.117,http://dx.doi.org/10.1109/TVCG.2006.117,1157,1164,J,"Meteorological research involves the analysis of multi-field, multi-scale, and multi-source data sets. Unfortunately, traditional atmospheric visualization systems only provide tools to view a limited number of variables and small segments of the data. These tools are often restricted to 2D contour or vector plots or 3D isosurfaces. The meteorologist must mentally synthesize the data from multiple plots to glean the information needed to produce a coherent picture of the weather phenomenon of interest. In order to provide better tools to meteorologists and reduce system limitations, we have designed an integrated atmospheric visual analysis and exploration system for interactive analysis of weather data sets. Our system allows for the integrated visualization of 1D, 2D, and 3D atmospheric data sets in common meteorological grid structures and utilizes a variety of rendering techniques. These tools provide meteorologists with new abilities to analyze their data and answer questions on regions of interest, ranging from physics-based atmospheric rendering to illustrative rendering containing particles and glyphs. In this paper, we discuss the use and performance of our visual analysis for two important meteorological applications. The first application is warm rain formation in small cumulus clouds. In this, our three-dimensional, interactive visualization of modeled drop trajectories within spatially correlated fields from a cloud simulation has provided researchers with new insight. Our second application is improving and validating severe storm models, specifically the weather research and forecasting (WRF) model. This is done through correlative visualization of WRF model and experimental Doppler storm data",Yuyan Song;Jing Ye;Nikolai A. Svakhine;Sonia Lasher-Trapp;Mike Baldwin;David S. Ebert,Yuyan Song;Jing Ye;Nikolai Svakhine;Sonia Lasher-Trapp;Mike Baldwin;David Ebert,student at Purdue University;Microsoft Co.;student at Purdue University;assistant professor at Purdue University;assistant professor at Purdue University;professor at Purdue University,10.1109/VISUAL.2000.885745;10.1109/VISUAL.2003.1250390;10.1109/VISUAL.1998.745330;10.1109/VISUAL.1992.235215;10.1109/VISUAL.1996.568113;10.1109/VISUAL.2003.1250383;10.1109/VISUAL.1990.146361,"weather visualization, grid structures, transfer function, volume rendering, volume visualization, glyph rendering, warm rain entrainment process",15,13,36,
VAST,2007,Activity Analysis Using Spatio-Temporal Trajectory Volumes in Surveillance Applications,10.1109/VAST.2007.4388990,http://dx.doi.org/10.1109/VAST.2007.4388990,3,10,C,"In this paper, we present a system to analyze activities and detect anomalies in a surveillance application, which exploits the intuition and experience of security and surveillance experts through an easy- to-use visual feedback loop. The multi-scale and location specific nature of behavior patterns in space and time is captured using a wavelet-based feature descriptor. The system learns the fundamental descriptions of the behavior patterns in a semi-supervised fashion by the higher order singular value decomposition of the space described by the training data. This training process is guided and refined by the users in an intuitive fashion. Anomalies are detected by projecting the test data into this multi-linear space and are visualized by the system to direct the attention of the user to potential problem spots. We tested our system on real-world surveillance data, and it satisfied the security concerns of the environment.",Firdaus Janoos;Shantanu Singh;M. Okan Irfanoglu;Raghu Machiraju;Richard E. Parent,Firdaus Janoos;Shantanu Singh;Okan Irfanoglu;Raghu Machiraju;Richard Parent,"Dept. of Computer Science and Engineering, Ohio State University. e-mail: janoos@cse.ohio-state.edu;Dept. of Computer Science and Engineering, Ohio State University. e-mail: singhsh@cse.ohio-state.edu;Dept. of Computer Science and Engineering, Ohio State University. e-mail: irfanogl@cse.ohio-state.edu;Dept. of Computer Science and Engineering, Ohio State University. e-mail: raghu@cse.ohio-state.edu;Dept. of Computer Science and Engineering, Ohio State University. e-mail: parent@cse.ohio-state.edu",10.1109/TVCG.2006.194,"wavelets, HOSVD, surveillance, anomaly detection, trajectory",15,7,29,
Vis,2008,Glyph-Based SPECT Visualization for the Diagnosis of Coronary Artery Disease,10.1109/TVCG.2008.136,http://dx.doi.org/10.1109/TVCG.2008.136,1499,1506,J,"Myocardial perfusion imaging with single photon emission computed tomography (SPECT) is an established method for the detection and evaluation of coronary artery disease (CAD). State-of-the-art SPECT scanners yield a large number of regional parameters of the left-ventricular myocardium (e.g., blood supply at rest and during stress, wall thickness, and wall thickening during heart contraction) that all need to be assessed by the physician. Today, the individual parameters of this multivariate data set are displayed as stacks of 2D slices, bull's eye plots, or, more recently, surfaces in 3D, which depict the left-ventricular wall. In all these visualizations, the data sets are displayed side-by-side rather than in an integrated manner, such that the multivariate data have to be examined sequentially and need to be fused mentally. This is time consuming and error-prone. In this paper we present an interactive 3D glyph visualization, which enables an effective integrated visualization of the multivariate data. Results from semiotic theory are used to optimize the mapping of different variables to glyph properties. This facilitates an improved perception of important information and thus an accelerated diagnosis. The 3D glyphs are linked to the established 2D views, which permit a more detailed inspection, and to relevant meta-information such as known stenoses of coronary vessels supplying the myocardial region. Our method has demonstrated its potential for clinical routine use in real application scenarios assessed by nuclear physicians.",Jennis Meyer-Spradow;Lars Stegger;Christian Döring;Timo Ropinski;Klaus H. Hinrichs,Jennis Meyer-Spradow;Lars Stegger;Christian Döring;Timo Ropinski;Klaus Hinrichs,"Visualization and Computer Graphics Research Group (VisCG), University of Münster;Department of Nuclear Medicine, University Hospital of Münster;Visualization and Computer Graphics Research Group (VisCG), University of Münster;Visualization and Computer Graphics Research Group (VisCG), University of Münster;Visualization and Computer Graphics Research Group (VisCG), University of Münster",10.1109/VISUAL.2003.1250425;10.1109/TVCG.2006.134;10.1109/TVCG.2007.70550;10.1109/VISUAL.1998.745294,"Multivariate visualization, glyph techniques, SPECT, myocardial perfusion imaging",15,12,24,
Vis,2008,Relation-Aware Volume Exploration Pipeline,10.1109/TVCG.2008.159,http://dx.doi.org/10.1109/TVCG.2008.159,1683,1690,J,"Volume exploration is an important issue in scientific visualization. Research on volume exploration has been focused on revealing hidden structures in volumetric data. While the information of individual structures or features is useful in practice, spatial relations between structures are also important in many applications and can provide further insights into the data. In this paper, we systematically study the extraction, representation,exploration, and visualization of spatial relations in volumetric data and propose a novel relation-aware visualization pipeline for volume exploration. In our pipeline, various relations in the volume are first defined and measured using region connection calculus (RCC) and then represented using a graph interface called relation graph. With RCC and the relation graph, relation query and interactive exploration can be conducted in a comprehensive and intuitive way. The visualization process is further assisted with relation-revealing viewpoint selection and color and opacity enhancement. We also introduce a quality assessment scheme which evaluates the perception of spatial relations in the rendered images. Experiments on various datasets demonstrate the practical use of our system in exploratory visualization.",Ming-Yuen Chan;Huamin Qu;Ka-Kei Chung;Wai-Ho Mak;Yingcai Wu,Ming-Yuen Chan;Huamin Qu;Ka-Kei Chung;Wai-Ho Mak;Yingcai Wu,The Hong Kong University of Science and Technolgoy;The Hong Kong University of Science and Technolgoy;The Hong Kong University of Science and Technolgoy;The Hong Kong University of Science and Technolgoy;The Hong Kong University of Science and Technolgoy,10.1109/TVCG.2007.70584;10.1109/TVCG.2007.70515;10.1109/TVCG.2006.144;10.1109/VISUAL.1999.809871;10.1109/TVCG.2007.70535;10.1109/TVCG.2007.70576;10.1109/VISUAL.2000.885694;10.1109/INFVIS.2003.1249009;10.1109/TVCG.2007.70555;10.1109/VISUAL.2005.1532835;10.1109/VISUAL.2005.1532788;10.1109/TVCG.2007.70591;10.1109/VISUAL.2005.1532834;10.1109/VISUAL.2005.1532856;10.1109/TVCG.2007.70572;10.1109/VISUAL.2005.1532833,"Exploratory Visualization, Relation-Based Visualization, Visualization Pipeline",15,10,28,
Vis,2008,Visibility-driven Mesh Analysis and Visualization through Graph Cuts,10.1109/TVCG.2008.176,http://dx.doi.org/10.1109/TVCG.2008.176,1667,1674,J,"In this paper we present an algorithm that operates on a triangular mesh and classifies each face of a triangle as either inside or outside. We present three example applications of this core algorithm: normal orientation, inside removal, and layer-based visualization. The distinguishing feature of our algorithm is its robustness even if a difficult input model that includes holes, coplanar triangles, intersecting triangles, and lost connectivity is given. Our algorithm works with the original triangles of the input model and uses sampling to construct a visibility graph that is then segmented using graph cut.",Kaichi Zhou;Eugene Zhang;Jirí Bittner;Peter Wonka,Kaichi Zhou;Eugene Zhang;Jiˇr´ı Bittner;Peter Wonka,Arizona State University;Oregon State University;Czech Technical University in Prague;Arizona State University,10.1109/VISUAL.2002.1183784,"Interior/Exterior Classification, Normal Orientation, Layer Classification, Inside Removal, Graph Cut",15,4,21,
InfoVis,2010,Laws of Attraction: From Perceptual Forces to Conceptual Similarity,10.1109/TVCG.2010.174,http://dx.doi.org/10.1109/TVCG.2010.174,1009,1016,J,"Many of the pressing questions in information visualization deal with how exactly a user reads a collection of visual marks as information about relationships between entities. Previous research has suggested that people see parts of a visualization as objects, and may metaphorically interpret apparent physical relationships between these objects as suggestive of data relationships. We explored this hypothesis in detail in a series of user experiments. Inspired by the concept of implied dynamics in psychology, we first studied whether perceived gravity acting on a mark in a scatterplot can lead to errors in a participant's recall of the mark's position. The results of this study suggested that such position errors exist, but may be more strongly influenced by attraction between marks. We hypothesized that such apparent attraction may be influenced by elements used to suggest relationship between objects, such as connecting lines, grouping elements, and visual similarity. We further studied what visual elements are most likely to cause this attraction effect, and whether the elements that best predicted attraction errors were also those which suggested conceptual relationships most strongly. Our findings show a correlation between attraction errors and intuitions about relatedness, pointing towards a possible mechanism by which the perception of visual marks becomes an interpretation of data relationships.",Caroline Ziemkiewicz;Robert Kosara,Caroline Ziemkiewicz;Robert Kosara,UNC Charlotte;UNC Charlotte,10.1109/TVCG.2008.125,"Perceptual cognition, visualization models, laboratory studies, cognition theory",15,7,17,
VAST,2011,Pointwise local pattern exploration for sensitivity analysis,10.1109/VAST.2011.6102450,http://dx.doi.org/10.1109/VAST.2011.6102450,131,140,C,"Sensitivity analysis is a powerful method for discovering the significant factors that contribute to targets and understanding the interaction between variables in multivariate datasets. A number of sensitivity analysis methods fall into the class of local analysis, in which the sensitivity is defined as the partial derivatives of a target variable with respect to a group of independent variables. Incorporating sensitivity analysis in visual analytic tools is essential for multivariate phenomena analysis. However, most current multivariate visualization techniques do not allow users to explore local patterns individually for understanding the sensitivity from a pointwise view. In this paper, we present a novel pointwise local pattern exploration system for visual sensitivity analysis. Using this system, analysts are able to explore local patterns and the sensitivity at individual data points, which reveals the relationships between a focal point and its neighbors. During exploration, users are able to interactively change the derivative coefficients to perform sensitivity analysis based on different requirements as well as their domain knowledge. Each local pattern is assigned an outlier factor, so that users can quickly identify anomalous local patterns that do not conform with the global pattern. Users can also compare the local pattern with the global pattern both visually and statistically. Finally, the local pattern is integrated into the original attribute space using color mapping and jittering, which reveals the distribution of the partial derivatives. Case studies with real datasets are used to investigate the effectiveness of the visualizations and interactions.",Zhenyu Guo;Matthew O. Ward;Elke A. Rundensteiner;Carolina Ruiz,Zhenyu Guo;Matthew O. Ward;Elke A. Rundensteiner;Carolina Ruiz,"Computer Science Department, Worcester Polytechnic Institute, USA;Computer Science Department, Worcester Polytechnic Institute, USA;Computer Science Department, Worcester Polytechnic Institute, USA;Computer Science Department, Worcester Polytechnic Institute, USA",10.1109/VISUAL.2005.1532821;10.1109/VAST.2008.4677368;10.1109/VAST.2010.5652460;10.1109/VAST.2009.5332611;10.1109/INFVIS.2004.71;10.1109/VAST.2009.5333431,"Knowledge discovery, sensitivity analysis, local pattern visualizations",15,11,26,
SciVis,2012,Visualization of Electrostatic Dipoles in Molecular Dynamics of Metal Oxides,10.1109/TVCG.2012.282,http://dx.doi.org/10.1109/TVCG.2012.282,2061,2068,J,"Metal oxides are important for many technical applications. For example alumina (aluminum oxide) is the most commonly-used ceramic in microelectronic devices thanks to its excellent properties. Experimental studies of these materials are increasingly supplemented with computer simulations. Molecular dynamics (MD) simulations can reproduce the material behavior very well and are now reaching time scales relevant for interesting processes like crack propagation. In this work we focus on the visualization of induced electric dipole moments on oxygen atoms in crack propagation simulations. The straightforward visualization using glyphs for the individual atoms, simple shapes like spheres or arrows, is insufficient for providing information about the data set as a whole. As our contribution we show for the first time that fractional anisotropy values computed from the local neighborhood of individual atoms of MD simulation data depict important information about relevant properties of the field of induced electric dipole moments. Iso surfaces in the field of fractional anisotropy as well as adjustments of the glyph representation allow the user to identify regions of correlated orientation. We present novel and relevant findings for the application domain resulting from these visualizations, like the influence of mechanical forces on the electrostatic properties.",Sebastian Grottel;Philipp Beck;Christoph Müller 0001;Guido Reina;Johannes Roth;Hans-Rainer Trebin;Thomas Ertl,Sebastian Grottel;Philipp Beck;Christoph Müller;Guido Reina;Johannes Roth;Hans-Rainer Trebin;Thomas Ertl,"Computer Graphics and Visualization, TU Dresden;Institute for Theoretical and Applied Physics of the University of Stuttgart (ITAP);Visualization Research Center of the University of Stuttgart (VISUS);Visualization Research Center of the University of Stuttgart (VISUS);Institute for Theoretical and Applied Physics of the University of Stuttgart (ITAP);Institute for Theoretical and Applied Physics of the University of Stuttgart (ITAP);Visualization Research Center of the University of Stuttgart (VISUS)",10.1109/TVCG.2006.186;10.1109/VISUAL.2005.1532781;10.1109/VISUAL.1999.809886,"Visualization in physical sciences and engineering, glyph-based techniques, time-varying data, point-based data",15,12,42,
VAST,2012,AlVis: Situation awareness in the surveillance of road tunnels,10.1109/VAST.2012.6400556,http://dx.doi.org/10.1109/VAST.2012.6400556,153,162,C,"In the surveillance of road tunnels, video data plays an important role for a detailed inspection and as an input to systems for an automated detection of incidents. In disaster scenarios like major accidents, however, the increased amount of detected incidents may lead to situations where human operators lose a sense of the overall meaning of that data, a problem commonly known as a lack of situation awareness. The primary contribution of this paper is a design study of AlVis, a system designed to increase situation awareness in the surveillance of road tunnels. The design of AlVis is based on a simplified tunnel model which enables an overview of the spatiotemporal development of scenarios in real-time. The visualization explicitly represents the present state, the history, and predictions of potential future developments. Concepts for situation-sensitive prioritization of information ensure scalability from normal operation to major disaster scenarios. The visualization enables an intuitive access to live and historic video for any point in time and space. We illustrate AlVis by means of a scenario and report qualitative feedback by tunnel experts and operators. This feedback suggests that AlVis is suitable to save time in recognizing dangerous situations and helps to maintain an overview in complex disaster scenarios.",Harald Piringer;Matthias Buchetics;Rudolf Benedik,Harald Piringer;Matthias Buchetics;Rudolf Benedik,VRVis Research Center;VRVis Research Center;Kapsch TrafficCom AG,10.1109/INFVIS.2002.1173149;10.1109/INFVIS.2005.1532134;10.1109/VAST.2011.6102456;10.1109/TVCG.2007.70544;10.1109/TVCG.2007.70521;10.1109/TVCG.2007.70621;10.1109/INFVIS.2004.27;10.1109/INFVIS.1995.528685;10.1109/TVCG.2008.185;10.1109/VAST.2007.4388994;10.1109/VAST.2007.4388998;10.1109/VAST.2008.4677353,,15,14,40,
SciVis,2013,Efficient Local Statistical Analysis via Integral Histograms with Discrete Wavelet Transform,10.1109/TVCG.2013.152,http://dx.doi.org/10.1109/TVCG.2013.152,2693,2702,J,"Histograms computed from local regions are commonly used in many visualization applications, and allowing the user to query histograms interactively in regions of arbitrary locations and sizes plays an important role in feature identification and tracking. Computing histograms in regions with arbitrary location and size, nevertheless, can be time consuming for large data sets since it involves expensive I/O and scan of data elements. To achieve both performance- and storage-efficient query of local histograms, we present a new algorithm called WaveletSAT, which utilizes integral histograms, an extension of the summed area tables (SAT), and discrete wavelet transform (DWT). Similar to SAT, an integral histogram is the histogram computed from the area between each grid point and the grid origin, which can be be pre-computed to support fast query. Nevertheless, because one histogram contains multiple bins, it will be very expensive to store one integral histogram at each grid point. To reduce the storage cost for large integral histograms, WaveletSAT treats the integral histograms of all grid points as multiple SATs, each of which can be converted into a sparse representation via DWT, allowing the reconstruction of axis-aligned region histograms of arbitrary sizes from a limited number of wavelet coefficients. Besides, we present an efficient wavelet transform algorithm for SATs that can operate on each grid point separately in logarithmic time complexity, which can be extended to parallel GPU-based implementation. With theoretical and empirical demonstration, we show that WaveletSAT can achieve fast preprocessing and smaller storage overhead than the conventional integral histogram approach with close query performance.",Teng-Yok Lee;Han-Wei Shen,Teng-Yok Lee;Han-Wei Shen,The Ohio State University;The Ohio State University,10.1109/VISUAL.1999.809910;10.1109/TVCG.2010.131;10.1109/TVCG.2011.246;10.1109/VISUAL.2001.964516;10.1109/TVCG.2011.198;10.1109/TVCG.2009.197,"WaveletSAT, integral histograms, discrete wavelet transform",15,15,38,
InfoVis,2014,Nmap: A Novel Neighborhood Preservation Space-filling Algorithm,10.1109/TVCG.2014.2346276,http://dx.doi.org/10.1109/TVCG.2014.2346276,2063,2071,J,"Space-filling techniques seek to use as much as possible the visual space to represent a dataset, splitting it into regions that represent the data elements. Amongst those techniques, Treemaps have received wide attention due to its simplicity, reduced visual complexity, and compact use of the available space. Several different Treemap algorithms have been proposed, however the core idea is the same, to divide the visual space into rectangles with areas proportional to some data attribute or weight. Although pleasant layouts can be effectively produced by the existing techniques, most of them do not take into account relationships that might exist between different data elements when partitioning the visual space. This violates the distance-similarity metaphor, that is, close rectangles do not necessarily represent similar data elements. In this paper, we propose a novel approach, called Neighborhood Treemap (Nmap), that seeks to solve this limitation by employing a slice and scale strategy where the visual space is successively bisected on the horizontal or vertical directions and the bisections are scaled until one rectangle is defined per data element. Compared to the current techniques with the same similarity preservation goal, our approach presents the best results while being two to three orders of magnitude faster. The usefulness of Nmap is shown by two applications involving the organization of document collections and the construction of cartograms illustrating its effectiveness on different scenarios.",Felipe S. L. G. Duarte;Fabio Sikansi;Francisco M. Fatore;Samuel G. Fadel;Fernando Vieira Paulovich,Felipe S. L. G. Duarte;Fabio Sikansi;Francisco M. Fatore;Samuel G. Fadel;Fernando V. Paulovich,"Institute of Mathematics and Computer Science, São Carlos, Sp, Brazil;Institute of Mathematics and Computer Science, São Carlos, Sp, Brazil;Institute of Mathematics and Computer Science, São Carlos, Sp, Brazil;Institute of Mathematics and Computer Science, São Carlos, Sp, Brazil;Institute of Mathematics and Computer Science, São Carlos, Sp, Brazil",10.1109/INFVIS.2000.885091;10.1109/INFVIS.2005.1532145;10.1109/TVCG.2007.70522;10.1109/TVCG.2009.128;10.1109/TVCG.2007.70529;10.1109/VISUAL.1991.175815;10.1109/TVCG.2008.165,"Space-filling techniques, treemaps, distance-similarity preservation",15,17,24,
SciVis,2014,Low-Pass Filtered Volumetric Shadows,10.1109/TVCG.2014.2346333,http://dx.doi.org/10.1109/TVCG.2014.2346333,2437,2446,J,"We present a novel and efficient method to compute volumetric soft shadows for interactive direct volume visualization to improve the perception of spatial depth. By direct control of the softness of volumetric shadows, disturbing visual patterns due to hard shadows can be avoided and users can adapt the illumination to their personal and application-specific requirements. We compute the shadowing of a point in the data set by employing spatial filtering of the optical depth over a finite area patch pointing toward each light source. Conceptually, the area patch spans a volumetric region that is sampled with shadow rays; afterward, the resulting optical depth values are convolved with a low-pass filter on the patch. In the numerical computation, however, to avoid expensive shadow ray marching, we show how to align and set up summed area tables for both directional and point light sources. Once computed, the summed area tables enable efficient evaluation of soft shadows for each point in constant time without shadow ray marching and the softness of the shadows can be controlled interactively. We integrated our method in a GPU-based volume renderer with ray casting from the camera, which offers interactive control of the transfer function, light source positions, and viewpoint, for both static and time-dependent data sets. Our results demonstrate the benefit of soft shadows for visualization to achieve user-controlled illumination with many-point lighting setups for improved perception combined with high rendering speed.",Marco Ament;Filip Sadlo;Carsten Dachsbacher;Daniel Weiskopf,Marco Ament;Filip Sadlo;Carsten Dachsbacher;Daniel Weiskopf,"Karlsruhe Institute of Technology, Germany;University of Stuttgart, Germany;Karlsruhe Institute of Technology, Germany;University of Stuttgart, Germany",10.1109/TVCG.2013.172;10.1109/TVCG.2013.129;10.1109/TVCG.2011.211;10.1109/VISUAL.2003.1250394;10.1109/TVCG.2012.232;10.1109/TVCG.2011.161;10.1109/TVCG.2011.198;10.1109/VISUAL.2002.1183764,"Direct volume rendering, volume illumination, soft shadows, filtered shadows, summed area table",15,15,49,
VAST,2014,DIA2: Web-based Cyberinfrastructure for Visual Analysis of Funding Portfolios,10.1109/TVCG.2014.2346747,http://dx.doi.org/10.1109/TVCG.2014.2346747,1823,1832,J,"We present a design study of the Deep Insights Anywhere, Anytime (DIA2) platform, a web-based visual analytics system that allows program managers and academic staff at the U.S. National Science Foundation to search, view, and analyze their research funding portfolio. The goal of this system is to facilitate users' understanding of both past and currently active research awards in order to make more informed decisions of their future funding. This user group is characterized by high domain expertise yet not necessarily high literacy in visualization and visual analytics-they are essentially casual experts-and thus require careful visual and information design, including adhering to user experience standards, providing a self-instructive interface, and progressively refining visualizations to minimize complexity. We discuss the challenges of designing a system for casual experts and highlight how we addressed this issue by modeling the organizational structure and workflows of the NSF within our system. We discuss each stage of the design process, starting with formative interviews, prototypes, and finally live deployments and evaluation with stakeholders.",Krishna P. C. Madhavan;Niklas Elmqvist;Mihaela Vorvoreanu;Xin Chen;Yuet Ling Wong;Hanjun Xian;Zhihua Dong;Aditya Johri,Krishna Madhavan;Niklas Elmqvist;Mihaela Vorvoreanu;Xin Chen;Yuetling Wong;Hanjun Xian;Zhihua Dong;Aditya Johri,Purdue University;Purdue University;Purdue University;Purdue University;Purdue University;Microsoft Corporation;Microsoft Corporation;George Mason University,10.1109/TVCG.2007.70541;10.1109/TVCG.2011.174;10.1109/TVCG.2010.177;10.1109/TVCG.2012.255;10.1109/TVCG.2009.123;10.1109/TVCG.2013.223;10.1109/INFVIS.2001.963283;10.1109/TVCG.2012.213;10.1109/VAST.2008.4677361,"visual analytics, portfolio mining, web-based visualization, casual visualization, design study",15,15,40,
InfoVis,2015,Speculative Practices: Utilizing InfoVis to Explore Untapped Literary Collections,10.1109/TVCG.2015.2467452,http://dx.doi.org/10.1109/TVCG.2015.2467452,429,438,J,"In this paper we exemplify how information visualization supports speculative thinking, hypotheses testing, and preliminary interpretation processes as part of literary research. While InfoVis has become a buzz topic in the digital humanities, skepticism remains about how effectively it integrates into and expands on traditional humanities research approaches. From an InfoVis perspective, we lack case studies that show the specific design challenges that make literary studies and humanities research at large a unique application area for information visualization. We examine these questions through our case study of the Speculative W@nderverse, a visualization tool that was designed to enable the analysis and exploration of an untapped literary collection consisting of thousands of science fiction short stories. We present the results of two empirical studies that involved general-interest readers and literary scholars who used the evolving visualization prototype as part of their research for over a year. Our findings suggest a design space for visualizing literary collections that is defined by (1) their academic and public relevance, (2) the tension between qualitative vs. quantitative methods of interpretation, (3) result-vs. process-driven approaches to InfoVis, and (4) the unique material and visual qualities of cultural collections. Through the Speculative W@nderverse we demonstrate how visualization can bridge these sometimes contradictory perspectives by cultivating curiosity and providing entry points into literary collections while, at the same time, supporting multiple aspects of humanities research processes.",Uta Hinrichs;Stefania Forlini;Bridget Moynihan,Uta Hinrichs;Stefania Forlini;Bridget Moynihan,"SACHI Group, University of St Andrews, UK;Department of English, University of Calgary;Department of English, University of Calgary",10.1109/TVCG.2012.272;10.1109/TVCG.2014.2346431;10.1109/TVCG.2008.175;10.1109/TVCG.2008.127;10.1109/TVCG.2007.70541;10.1109/TVCG.2012.213;10.1109/VAST.2007.4389006;10.1109/TVCG.2009.165;10.1109/TVCG.2007.70577;10.1109/TVCG.2009.171;10.1109/TVCG.2008.172;10.1109/VAST.2008.4677370,"Digital Humanities, Interlinked Visualization, Literary Studies, Cultural Collections, Science Fiction",15,17,54,
SciVis,2015,Diderot: a Domain-Specific Language for Portable Parallel Scientific Visualization and Image Analysis,10.1109/TVCG.2015.2467449,http://dx.doi.org/10.1109/TVCG.2015.2467449,867,876,J,"Many algorithms for scientific visualization and image analysis are rooted in the world of continuous scalar, vector, and tensor fields, but are programmed in low-level languages and libraries that obscure their mathematical foundations. Diderot is a parallel domain-specific language that is designed to bridge this semantic gap by providing the programmer with a high-level, mathematical programming notation that allows direct expression of mathematical concepts in code. Furthermore, Diderot provides parallel performance that takes advantage of modern multicore processors and GPUs. The high-level notation allows a concise and natural expression of the algorithms and the parallelism allows efficient execution on real-world datasets.",Gordon L. Kindlmann;Charisee Chiw;Nicholas Seltzer;Lamont Samuels;John H. Reppy,Gordon Kindlmann;Charisee Chiw;Nicholas Seltzer;Lamont Samuels;John Reppy,"Department of Computer Science, University of Chicago;Department of Computer Science, University of Chicago;Department of Computer Science, University of Chicago;Department of Computer Science, University of Chicago;Department of Computer Science, University of Chicago",10.1109/TVCG.2009.174;10.1109/TVCG.2011.185;10.1109/VISUAL.2005.1532856;10.1109/TVCG.2014.2346322;10.1109/TVCG.2012.240;10.1109/VISUAL.2003.1250414;10.1109/VISUAL.1999.809896;10.1109/TVCG.2007.70534;10.1109/TVCG.2014.2346318;10.1109/VISUAL.1998.745290;10.1109/TVCG.2008.148;10.1109/TVCG.2008.163,"Domain specific language, portable parallel programming, scientific visualization, tensor fields",15,17,53,
VAST,2015,Exploring Evolving Media Discourse Through Event Cueing,10.1109/TVCG.2015.2467991,http://dx.doi.org/10.1109/TVCG.2015.2467991,220,229,J,"Online news, microblogs and other media documents all contain valuable insight regarding events and responses to events. Underlying these documents is the concept of framing, a process in which communicators act (consciously or unconsciously) to construct a point of view that encourages facts to be interpreted by others in a particular manner. As media discourse evolves, how topics and documents are framed can undergo change, shifting the discussion to different viewpoints or rhetoric. What causes these shifts can be difficult to determine directly; however, by linking secondary datasets and enabling visual exploration, we can enhance the hypothesis generation process. In this paper, we present a visual analytics framework for event cueing using media data. As discourse develops over time, our framework applies a time series intervention model which tests to see if the level of framing is different before or after a given date. If the model indicates that the times before and after are statistically significantly different, this cues an analyst to explore related datasets to help enhance their understanding of what (if any) events may have triggered these changes in discourse. Our framework consists of entity extraction and sentiment analysis as lenses for data exploration and uses two different models for intervention analysis. To demonstrate the usage of our framework, we present a case study on exploring potential relationships between climate change framing and conflicts in Africa.",Yafeng Lu;Michael Steptoe;Sarah Burke;Hong Wang;Jiun-Yi Tsai;Hasan Davulcu;Douglas C. Montgomery;Steven R. Corman;Ross Maciejewski,Yafeng Lu;Michael Steptoe;Sarah Burke;Hong Wang;Jiun-Yi Tsai;Hasan Davulcu;Douglas Montgomery;Steven R. Corman;Ross Maciejewski,Arizona State University;Arizona State University;Arizona State University;Arizona State University;Arizona State University;Arizona State University;Arizona State University;Arizona State University;Arizona State University,10.1109/TVCG.2013.222;10.1109/VAST.2011.6102488;10.1109/VAST.2012.6400557;10.1109/VAST.2012.6400485;10.1109/TVCG.2013.162;10.1109/VAST.2008.4677364;10.1109/TVCG.2014.2346682;10.1109/VAST.2014.7042484;10.1109/TVCG.2011.179;10.1109/VAST.2014.7042494;10.1109/VAST.2012.6400491;10.1109/VAST.2009.5333919;10.1109/INFVIS.1999.801851;10.1109/TVCG.2012.225;10.1109/TVCG.2014.2346913,"Media Analysis, Time Series Analysis, Event Detection",15,20,43,
VAST,2015,LiteVis: Integrated Visualization for Simulation-Based Decision Support in Lighting Design,10.1109/TVCG.2015.2468011,http://dx.doi.org/10.1109/TVCG.2015.2468011,290,299,J,"State-of-the-art lighting design is based on physically accurate lighting simulations of scenes such as offices. The simulation results support lighting designers in the creation of lighting configurations, which must meet contradicting customer objectives regarding quality and price while conforming to industry standards. However, current tools for lighting design impede rapid feedback cycles. On the one side, they decouple analysis and simulation specification. On the other side, they lack capabilities for a detailed comparison of multiple configurations. The primary contribution of this paper is a design study of LiteVis, a system for efficient decision support in lighting design. LiteVis tightly integrates global illumination-based lighting simulation, a spatial representation of the scene, and non-spatial visualizations of parameters and result indicators. This enables an efficient iterative cycle of simulation parametrization and analysis. Specifically, a novel visualization supports decision making by ranking simulated lighting configurations with regard to a weight-based prioritization of objectives that considers both spatial and non-spatial characteristics. In the spatial domain, novel concepts support a detailed comparison of illumination scenarios. We demonstrate LiteVis using a real-world use case and report qualitative feedback of lighting designers. This feedback indicates that LiteVis successfully supports lighting designers to achieve key tasks more efficiently and with greater certainty.",Johannes Sorger;Thomas Ortner;Christian Luksch;Michael Schwärzler;M. Eduard Gröller;Harald Piringer,Johannes Sorger;Thomas Ortner;Christian Luksch;Michael Schwärzler;Eduard Gröller;Harald Piringer,VRVis Research Center;VRVis Research Center;VRVis Research Center;VRVis Research Center;TU Wien;VRVis Research Center,10.1109/TVCG.2014.2346626;10.1109/TVCG.2011.185;10.1109/TVCG.2010.190;10.1109/TVCG.2013.147;10.1109/INFVIS.2003.1249032;10.1109/TVCG.2013.173;10.1109/TVCG.2009.110;10.1109/TVCG.2014.2346321,"Integrating Spatial and Non-Spatial Data Visualization, Visualization in Physical Sciences and Engineering, Coordinated and Multiple Views, Visual Knowledge Discovery",15,13,34,
InfoVis,2017,Bubble Treemaps for Uncertainty Visualization,10.1109/TVCG.2017.2743959,http://dx.doi.org/10.1109/TVCG.2017.2743959,719,728,J,"We present a novel type of circular treemap, where we intentionally allocate extra space for additional visual variables. With this extended visual design space, we encode hierarchically structured data along with their uncertainties in a combined diagram. We introduce a hierarchical and force-based circle-packing algorithm to compute Bubble Treemaps, where each node is visualized using nested contour arcs. Bubble Treemaps do not require any color or shading, which offers additional design choices. We explore uncertainty visualization as an application of our treemaps using standard error and Monte Carlo-based statistical models. To this end, we discuss how uncertainty propagates within hierarchies. Furthermore, we show the effectiveness of our visualization using three different examples: the package structure of Flare, the S&amp;P 500 index, and the US consumer expenditure survey.",Jochen Görtler;Christoph Schulz;Daniel Weiskopf;Oliver Deussen,Jochen Görtler;Christoph Schulz;Daniel Weiskopf;Oliver Deussen,University of Konstanz;VISUSUniversity of Stuttgart;VISUSUniversity of Stuttgart;University of Konstanz,10.1109/TVCG.2012.220;10.1109/TVCG.2009.122;10.1109/VAST.2009.5332611;10.1109/TVCG.2014.2346298;10.1109/TVCG.2015.2467752;10.1109/VISUAL.1991.175815;10.1109/TVCG.2013.180;10.1109/TVCG.2012.279;10.1109/TVCG.2010.210;10.1109/TVCG.2016.2598919;10.1109/TVCG.2015.2467992;10.1109/TVCG.2013.232,"Uncertainty visualization,hierarchy visualization,treemaps,tree layout,circle packing,contours",15,10,46,
VAST,2017,Podium: Ranking Data Using Mixed-Initiative Visual Analytics,10.1109/TVCG.2017.2745078,http://dx.doi.org/10.1109/TVCG.2017.2745078,288,297,J,"People often rank and order data points as a vital part of making decisions. Multi-attribute ranking systems are a common tool used to make these data-driven decisions. Such systems often take the form of a table-based visualization in which users assign weights to the attributes representing the quantifiable importance of each attribute to a decision, which the system then uses to compute a ranking of the data. However, these systems assume that users are able to quantify their conceptual understanding of how important particular attributes are to a decision. This is not always easy or even possible for users to do. Rather, people often have a more holistic understanding of the data. They form opinions that data point A is better than data point B but do not necessarily know which attributes are important. To address these challenges, we present a visual analytic application to help people rank multi-variate data points. We developed a prototype system, Podium, that allows users to drag rows in the table to rank order data points based on their perception of the relative value of the data. Podium then infers a weighting model using Ranking SVM that satisfies the user's data preferences as closely as possible. Whereas past systems help users understand the relationships between data points based on changes to attribute weights, our approach helps users to understand the attributes that might inform their understanding of the data. We present two usage scenarios to describe some of the potential uses of our proposed technique: (1) understanding which attributes contribute to a user's subjective preferences for data, and (2) deconstructing attributes of importance for existing rankings. Our proposed approach makes powerful machine learning techniques more usable to those who may not have expertise in these areas.",Emily Wall;Subhajit Das;Ravish Chawla;Bharath Kalidindi;Eli T. Brown;Alex Endert,Emily Wall;Subhajit Das;Ravish Chawla;Bharath Kalidindi;Eli T. Brown;Alex Endert,"Georgia Institute of Technology, Atlanta, GA, USA;Georgia Institute of Technology, Atlanta, GA, USA;Georgia Institute of Technology, Atlanta, GA, USA;Georgia Institute of Technology, Atlanta, GA, USA;DePaul University, Chicago, IL, USA;Georgia Institute of Technology, Atlanta, GA, USA",10.1109/INFVIS.2005.1532136;10.1109/VAST.2012.6400486;10.1109/TVCG.2014.2346575;10.1109/VAST.2015.7347625;10.1109/TVCG.2016.2598594;10.1109/VAST.2011.6102449;10.1109/TVCG.2013.173;10.1109/TVCG.2015.2467615;10.1109/TVCG.2016.2598446;10.1109/TVCG.2015.2467551;10.1109/TVCG.2016.2598839;10.1109/TVCG.2012.253;10.1109/VAST.2017.8585669,"Mixed-initiative visual analytics,multi-attribute ranking,user interaction",15,9,48,
VAST,2017,Towards a Systematic Combination of Dimension Reduction and Clustering in Visual Analytics,10.1109/TVCG.2017.2745258,http://dx.doi.org/10.1109/TVCG.2017.2745258,131,141,J,"Dimension reduction algorithms and clustering algorithms are both frequently used techniques in visual analytics. Both families of algorithms assist analysts in performing related tasks regarding the similarity of observations and finding groups in datasets. Though initially used independently, recent works have incorporated algorithms from each family into the same visualization systems. However, these algorithmic combinations are often ad hoc or disconnected, working independently and in parallel rather than integrating some degree of interdependence. A number of design decisions must be addressed when employing dimension reduction and clustering algorithms concurrently in a visualization system, including the selection of each algorithm, the order in which they are processed, and how to present and interact with the resulting projection. This paper contributes an overview of combining dimension reduction and clustering into a visualization system, discussing the challenges inherent in developing a visualization system that makes use of both families of algorithms.",John E. Wenskovitch;Ian Crandell;Naren Ramakrishnan;Leanna House;Scotland Leman;Chris North 0001,John Wenskovitch;Ian Crandell;Naren Ramakrishnan;Leanna House;Scotland Leman;Chris North,Virginia Tech Department of Computer Science;Virginia Tech Department of Statistics;Virginia Tech Department of Computer Science;Virginia Tech Department of Statistics;Virginia Tech Department of Statistics;Virginia Tech Department of Computer Science,10.1109/TVCG.2006.120;10.1109/TVCG.2011.186;10.1109/INFVIS.2005.1532136;10.1109/VAST.2014.7042492;10.1109/TVCG.2013.124;10.1109/VAST.2012.6400486;10.1109/TVCG.2014.2346594;10.1109/VAST.2009.5332629;10.1109/TVCG.2013.212;10.1109/TVCG.2009.122;10.1109/TVCG.2006.156;10.1109/VAST.2011.6102449;10.1109/INFVIS.2005.1532126;10.1109/TVCG.2013.188;10.1109/VAST.2012.6400487;10.1109/VAST.2007.4388999;10.1109/TVCG.2014.2346422;10.1109/TVCG.2011.178;10.1109/TVCG.2007.70515,"Dimension reduction,clustering,algorithms,visual analytics",15,10,94,
Vis,1992,Visual query specification in a multimedia database system,10.1109/VISUAL.1992.235208,http://dx.doi.org/10.1109/VISUAL.1992.235208,194,201,C,"A visual interface for a multimedia database management system (MDBMS) is described. DBMS query languages are linear in syntax. Although natural language interfaces have been found to be useful, natural language is ambiguous and difficult to process. For queries on standard (relational) data, these difficulties can be avoided with the use of a visual, graphical interface to guide the user in specifying the query. For image and other media data which are ambiguous in nature, natural language processing, combined with direct graphical access to the domain knowledge, is used to interpret and evaluate the natural language query. The system fully supports graphical and image input/output in different formats. The combination of visual effect and natural language specification, the support of media data, and the allowance of incremental query specification simplify the process of query specification not only for image or multimedia databases but also for all databases.&lt;&lt;ETX&gt;&gt;",Daniel A. Keim;Vincent Y. Lum,D.A. Keim;V. Lum,"Inst. fuer Inf., Munchen Univ., Germany",,"Visual Query Specijication, Graphical User Interface, Multimedia Database System, Natural-Language Interface, Information Retrieval, Image Data Management",14,1,15,
Vis,1993,Interactive shading for surface and volume visualization on graphics workstations,10.1109/VISUAL.1993.398881,http://dx.doi.org/10.1109/VISUAL.1993.398881,291,298,C,"Shading is an effective exploratory visualization tool widely used in scientific visualization. Interactive, or close to interactive, shading of images offers significant benefit, but is generally too computationally expensive for graphics workstations. A novel method for providing interactive diffuse and specular shading capability on low-cost graphics workstations is described. Application to digital elevation models, iso-surfaces in volumetric images, and color-coded aspect maps are illustrated and an analysis of artifacts, and of ways of minimizing artifacts, is given.&lt;&lt;ETX&gt;&gt;",Peter A. Fletcher;Philip K. Robertson,P.A. Fletcher;P.K. Robertson,"CSIRO, Canberra, ACT, Australia;CSIRO, Canberra, ACT, Australia",,,14,2,9,
Vis,1994,Volume rendering methods for computational fluid dynamics visualization,10.1109/VISUAL.1994.346314,http://dx.doi.org/10.1109/VISUAL.1994.346314,232,"239, C26",C,"The paper describes three alternative volume rendering approaches to visualizing computational fluid dynamics (CFD) data. One new approach uses realistic volumetric gas rendering techniques to produce photo-realistic images and animations from scalar CFD data. The second uses ray casting that is based an a sampler illumination model and is mainly centered around a versatile new tool for the design of transfer functions. The third method employs a simple illumination model and rapid rendering mechanisms to provide efficient preview capabilities. These tools provide a large range of volume rendering capabilities to be used by the CFD explorer to render rapidly for navigation through the data, to emphasize data features (e.g., shock waves) with a specific transfer function, or to present a realistic rendition of the model.&lt;&lt;ETX&gt;&gt;",David S. Ebert;Roni Yagel;James N. Scott;Yair Kurzion,D.S. Ebert;R. Yagel;J. Scott;Y. Kurzion,"Dept. of Comput. Sci., Maryland Univ., Baltimore, MD, USA",,,14,7,18,
Vis,1994,3D visualization of unsteady 2D airplane wake vortices,10.1109/VISUAL.1994.346328,http://dx.doi.org/10.1109/VISUAL.1994.346328,124,"131, C13",C,"Air flowing around the wing tips of an airplane forms horizontal tornado-like vortices that can be dangerous to following aircraft. The dynamics of such vortices, including ground and atmospheric effects, can be predicted by numerical simulation, allowing the safety and capacity of airports to be improved. We introduce three-dimensional techniques for visualizing time-dependent, two-dimensional wake vortex computations, and the hazard strength of such vortices near the ground. We describe a vortex core tracing algorithm and a local tiling method to visualize the vortex evolution. The tiling method converts time-dependent, two-dimensional vortex cores into three-dimensional vortex tubes. Finally, a novel approach is used to calculate the induced rolling moment on the following airplane at each grid point within a region near the vortex tubes and thus allows three-dimensional visualization of the hazard strength of the vortices.&lt;&lt;ETX&gt;&gt;",Kwan-Liu Ma;Z. C. Zheng,Kwan-Liu Ma;Z.C. Zheng,"Inst. for Comput. Applications in Sci. & Eng., NASA Langley Res. Center, Hampton, VA, USA",,,14,6,13,
Vis,1995,Fast Algorithms for Visualizing Fluid Motion in Steady Flow on Unstructured Grids,10.1109/VISUAL.1995.485144,http://dx.doi.org/10.1109/VISUAL.1995.485144,313,,C,,Shyh-Kuang Ueng;Kris Sikorski;Kwan-Liu Ma,S.K. Ueng;K. Sikorski;Kwan-Liu Ma,,10.1109/VISUAL.1992.235211;10.1109/VISUAL.1994.346329;10.1109/VISUAL.1991.175789;10.1109/VISUAL.1993.398876,,14,11,12,
Vis,1996,A fast Gibbs sampler for synthesizing constrained fractals,10.1109/VISUAL.1996.567598,http://dx.doi.org/10.1109/VISUAL.1996.567598,29,35,C,"It is well known that the spatial frequency spectra of membrane and thin-plate splines exhibit self-affine characteristics and hence behave as fractals. This behavior was exploited in generating the constrained fractal surfaces in the work of Szeliski and Terzopoulos (1989), which were generated by using a Gibbs sampler algorithm. The algorithm involves locally perturbing a constrained spline surface with white noise until the spline surface reaches an equilibrium state. In this paper, we introduce a very fast generalized Gibbs sampler that combines two novel techniques, namely a preconditioning technique in a wavelet basis for constraining the splines and a perturbation scheme in which, unlike the traditional Gibbs sampler, all sites (surface nodes) that do not share a common neighbor are updated simultaneously. In addition, we demonstrate the capability to generate arbitrary-order fractal surfaces without resorting to blending techniques. Using this fast Gibbs sampler algorithm, we demonstrate the synthesis of realistic terrain models from sparse elevation data.",Baba C. Vemuri;Chhandomay Mandal,B.C. Vemuri;C. Mandal,"Dept. of Comput. & Inf. Sci., Florida Univ., Gainesville, FL, USA",,,14,0,26,
Vis,1996,Untangling Knots by Stochastic Energy Optimization,10.1109/VISUAL.1996.568120,http://doi.ieeecomputersociety.org/10.1109/VISUAL.1996.568120,279,286,C,"A method for visualizing unknottedness of mathematical knots via energy optimization with simulated annealing is presented. In this method a potential field is formed around a tangled rope that causes it to self-repel. By allowing the rope to evolve in this field in search of an energy minimizing configuration we can determine the knot type of the initial configuration. In particular, it is natural to conjecture that if such a ""charged rope"" was not initially knotted, it will reach its minimal potential in a circular configuration, given a suitable energy functional. Because situations potentially arise in which the functional may not be strictly unimodal, we suggest it to be advantageous to use a robust stochastic optimization technique (simulated annealing), rather than a deterministic hill climber common in physically based approaches, to make sure that the evolving rope does not settle in a suboptimal configuration. The same method is applicable to simplifying arbitrary knots and links and for establishing knot equivalence. Aside from its theoretical appeal, the method promises to solve practical problems common in genetic research and polymer design.",Milana Huang;Robert P. Grzeszczuk;Louis H. Kauffman,Milana Huang;R.P. Grzeszczuk;L.H. Kauffman,"Dept. of Electr. Eng. & Comput. Sci., Illinois Univ., Chicago, IL, USA",,,14,3,0,
Vis,1997,exVis: developing a wind tunnel data visualization tool,10.1109/VISUAL.1997.663911,http://dx.doi.org/10.1109/VISUAL.1997.663911,417,420,C,"Software has been developed to apply visualization techniques to aeronautics data collected during wind tunnel experiments. Interaction between the software developers and the aeroscientists has been crucial in making the software. The interaction has also been important in building the scientists' confidence in the use of interactive, computer-mediated analysis tools.",Samuel P. Uselton,S.P. Uselton,"MRJ Technol. Solutions, NASA Ames Res. Center, Moffett Field, CA, USA",,,14,6,0,
Vis,1998,A concept for virtual reality tools for design reviews,10.1109/VISUAL.1998.745304,http://dx.doi.org/10.1109/VISUAL.1998.745304,205,210,C,"The paper discusses a concept for virtual reality tools for use in design reviews of mechanical products. In this discussion, the special requirements of a virtual environment are given consideration. The focus of this paper is on suggestions for the visualization and arrangement of a product, its structure, its components and their alternatives together in one environment. The realization of these concepts results in a 3D-interface that allows users, especially engineers, to evaluate different configurations of a product and gives them direct access to the product structure. By applying various visualization techniques, product components and their attributes, e.g., their price, can be brought together into one visualization. Thus, in contrast to state-of-the-art software, the product structure, three-dimensional, real-sized components, and attribute values can be combined together in 3D-visualizations. This research was done in cooperation with Christoph Brandt, member of the Heinz Nixdorf Institute's virtual reality group.",Klaus Kremer,K. Kremer,"Heinz Nixdorf Inst., Paderborn Univ., Germany",,"virtual reality, virtual environments, visualization, design reviews, product configuration, product structures, product attributes, CAD, PDM, EDM",14,4,18,
Vis,1999,Visualizing Planar Vector Fields with Normal Component Using Line Integral Convolution,10.1109/VISUAL.1999.809895,http://doi.ieeecomputersociety.org/10.1109/VISUAL.1999.809895,255,261,C,"We present a method for visualizing three dimensional vector fields which are defined on a two dimensional manifold only. These vector fields do exist in real application, as we show by an example of an optical measuring instrument which can gauge the displacement at the surface of a mechanical part. The general idea is to compute LIC textures in the manifold's tangent space and to deform the manifold according to the normal information. The resulting LIC texture is mapped onto the deformed manifold and is rendered as a three dimensional scene. Due to the light's reflection on the deformed manifold, one can interactively explore the result of the deformation.",Gerik Scheuermann;Holger Burbach;Hans Hagen,G. Scheuermann;H. Barbach;H. Hagen,"Dept. of Comput. Sci., Kaiserslautern Univ., Germany",10.1109/VISUAL.1994.346312;10.1109/VISUAL.1994.346313;10.1109/VISUAL.1990.146360;10.1109/VISUAL.1998.745324,"LIC, vector field visualization, deformation",14,3,0,
Vis,1999,Cracking the cracking problem with Coons patches,10.1109/VISUAL.1999.809899,http://dx.doi.org/10.1109/VISUAL.1999.809899,285,535,C,"We present a novel approach to solving the cracking problem. The cracking problem arises in many contexts in scientific visualization and computer graphics modeling where there is need for an approximation based upon domain decomposition that is fine in certain regions and coarse in others. This includes surface rendering approximation of images and multiresolution terrain visualization. In general, algorithms based upon adaptive refinement strategies must deal with this problem. The approach presented here is simple and general. It is based upon the use of a triangular Coons patch. Both the basic idea of using a triangular Coons patch in this context and the particular Coons patch that is used constitute the novel contributions of the paper.",Gregory M. Nielson;Dave J. Holliday;Tom Roxborough,G.M. Nielson;D. Holliday;T. Roxborough,"Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA",10.1109/VISUAL.1998.745328;10.1109/VISUAL.1997.663860,,14,4,11,
Vis,1999,"Visualization of conflicts and resolutions in a ""Free Flight"" scenario",10.1109/VISUAL.1999.809923,http://dx.doi.org/10.1109/VISUAL.1999.809923,433,557,C,"""Free Flight"" will change today's air traffic control system by giving pilots increased flexibility to choose and modify their routes in real time, reducing costs and increasing system capacity. This increased flexibility comes at the price of increased complexity. If Free Flight is to become a reality, future air traffic controllers, pilots, and airline managers will require new conflict detection, resolution and visualization decision support tools. The paper describes a testbed system for building and evaluating such tools, including its current capabilities, lessons we learned and feedback received from expert users. The visualization system provides an overall plan view supplemented with a detailed perspective view, allowing a user to examine highlighted conflicts and select from a list of proposed solutions, as the scenario runs in real time. Future steps needed to improve this system are described.",Ronald T. Azuma;Howard Neely;Michael J. Daily;Mario Correa,R. Azuma;H. Neely;M. Daily;M. Correa,"HRL Labs., USA",10.1109/INFVIS.1997.636786,,14,6,12,
InfoVis,2000,Interactive problem solving via algorithm visualization,10.1109/INFVIS.2000.885103,http://dx.doi.org/10.1109/INFVIS.2000.885103,145,153,C,"COMIND is a tool for conceptual design of industrial products. It helps designers define and evaluate the initial design space by using search algorithms to generate sets of feasible solutions. Two algorithm visualization techniques, Kaleidoscope and Lattice, and one visualization of n-dimensional data, MAP, are used to externalize the machine's problem solving strategies and the tradeoffs as a result of using these strategies. After a short training period, users are able to discover tactics to explore design space effectively, evaluate new design solutions, and learn important relationships among design criteria, search speed and solution quality. We thus propose that visualization can serve as a tool for interactive intelligence, ie., human-machine collaboration for solving complex problems.",Pearl Pu;Denis Lalanne,P. Pu;D. Lalanne,"Dept. of Comput. Sci., Swiss Federal Inst. of Technol., Lausanne, Switzerland",10.1109/INFVIS.1998.729557,,14,2,24,
InfoVis,2001,Technical note: visually encoding program test information to find faults in software,10.1109/INFVIS.2001.963277,http://dx.doi.org/10.1109/INFVIS.2001.963277,33,36,C,,James R. Eagan;Mary Jean Harrold;James A. Jones;John T. Stasko,J. Eagan;M.J. Harrold;J.A. Jones;J. Stasko,Georgia Institute of Technology Atlanta,,,14,8,5,
InfoVis,2002,Efficient cartogram generation: a comparison,10.1109/INFVIS.2002.1173144,http://dx.doi.org/10.1109/INFVIS.2002.1173144,33,36,C,"Cartograms are a well-known technique for showing geography-related statistical information, such as population demographics and epidemiological data. The basic idea is to distort a map by resizing its regions according to a statistical parameter, but in a way that keeps the map recognizable. We deal with the problem of making continuous cartograms that strictly retain the topology of the input mesh. We compare two algorithms to solve the continuous cartogram problem. The first one uses an iterative relocation of the vertices based on scanlines. The second one is based on the Gridfit technique, which uses pixel-based distortion based on a quadtree-like data structure.",Daniel A. Keim;Stephen C. North;Christian Panse;Jörn Schneidewind,D.A. Keim;S.C. North;C. Panse;J. Schneidewind,"AT&T Shannon Lab., Florham Park, NJ, USA;AT&T Shannon Lab., Florham Park, NJ, USA",10.1109/VISUAL.1998.745301;10.1109/VISUAL.1998.745303,,14,5,8,
Vis,2002,PRIMA: A case study of using information visualization techniques for patient record analysis,10.1109/VISUAL.2002.1183817,http://dx.doi.org/10.1109/VISUAL.2002.1183817,509,512,C,"We have created an application, called PRIMA (Patient Record intelligent Monitoring and Analysis), which can be used to visualize and understand patient record data. It was developed to better understand a large collection of patient records of bone marrow transplants at Hadassah Hospital in Jerusalem, Israel. It is based on an information visualization toolkit, Opal, which has been developed at the IBM T.J. Watson Research Center. Opal allows intelligent, interactive visualization of a wide variety of different types of data. The PRIMA application is generally applicable to a wide range of patient record data, as the underlying toolkit is flexible with regard to the form of the input data. This application is a good example of the usefulness of information visualization techniques in the bioinformatics domain, as these techniques have been developed specifically to deal with diverse sets of often unfamiliar data. We illustrate several unanticipated findings which resulted from the use of a flexible and interactive information visualization environment.",Donna L. Gresh;David A. Rabenhorst;Amnon Shabo;Shimon Slavin,D.L. Gresh;D.A. Rabenhorst;A. Shabo;S. Slavin,"IBM Thomas J. Watson Res. Center, NY, USA;IBM Thomas J. Watson Res. Center, NY, USA",,"visualization, information visualization, bioinformatics, medical records",14,3,3,
Vis,2003,Real-time refinement and simplification of adaptive triangular meshes,10.1109/VISUAL.2003.1250367,http://dx.doi.org/10.1109/VISUAL.2003.1250367,155,162,C,"In this paper we present a generic method for incremental mesh adaptation based on hierarchy of semi-regular meshes. Our method supports any refinement rule mapping vertices onto vertices such as 1-to-4 split or /spl radic/3-subdivision. Resulting adaptive mesh has subdivision connectivity and hence good aspect ratio of triangles. Hierarchic representation of the mesh allows incremental local refinement and simplification operations exploiting frame-to-frame coherence. We also present an out-of-core storage layout scheme designed for semi-regular meshes of arbitrary subdivision connectivity. It provides high cache coherency in the data retrieval and relies on the interleaved storage of resolution levels and maintaining good geometrical proximity within each level. The efficiency of the proposed method is demonstrated with applications in physically-based cloth simulation, real-time terrain visualization and procedural modeling.",Vasily Volkov;Ling Li 0006,V. Volkov;Ling Li,"Moscow Inst. of Phys. & Technol., Russia",10.1109/VISUAL.2002.1183796;10.1109/VISUAL.2000.885705;10.1109/VISUAL.1997.663860;10.1109/VISUAL.2001.964533;10.1109/VISUAL.1996.568126;10.1109/VISUAL.1998.745282,"adaptive meshes, refinement and simplification, subdivision, multiresoluton, level of detail, frame-to-frame coherence, out-of-core visualization",14,3,33,
InfoVis,2007,AdaptiviTree: Adaptive Tree Visualization for Tournament-Style Brackets,10.1109/TVCG.2007.70537,http://dx.doi.org/10.1109/TVCG.2007.70537,1113,1120,J,"Online pick'em games, such as the recent NCAA college basketball March Madness tournament, form a large and rapidly growing industry. In these games, players make predictions on a tournament bracket that defines which competitors play each other and how they proceed toward a single champion. Throughout the course of the tournament, players monitor the brackets to track progress and to compare predictions made by multiple players. This is often a complex sense making task. The classic bracket visualization was designed for use on paper and utilizes an incrementally additive system in which the winner of each match-up is rewritten in the next round as the tournament progresses. Unfortunately, this representation requires a significant amount of space and makes it relatively difficult to get a quick overview of the tournament state since competitors take arbitrary paths through the static bracket. In this paper, we present AdaptiviTree, a novel visualization that adaptively deforms the representation of the tree and uses its shape to convey outcome information. AdaptiviTree not only provides a more compact and understandable representation, but also allows overlays that display predictions as well as other statistics. We describe results from a lab study we conducted to explore the efficacy of AdaptiviTree, as well as from a deployment of the system in a recent real-world sports tournament.",Desney S. Tan;Greg Smith;Bongshin Lee;George G. Robertson,Desney Tan;Greg Smith;Bongshin Lee;George Robertson,,10.1109/INFVIS.2002.1173148;10.1109/INFVIS.2002.1173158;10.1109/INFVIS.1997.636718;10.1109/VAST.2006.261450,"Online fantasy sports, tournament, bracket, picks, adaptive tree visualization",14,10,20,
VAST,2008,Using visual analytics to maintain situation awareness in astrophysics,10.1109/VAST.2008.4677353,http://dx.doi.org/10.1109/VAST.2008.4677353,27,34,C,"We present a novel collaborative visual analytics application for cognitively overloaded users in the astrophysics domain. The system was developed for scientists needing to analyze heterogeneous, complex data under time pressure, and then make predictions and time-critical decisions rapidly and correctly under a constant influx of changing data. The Sunfall Data Taking system utilizes several novel visualization and analysis techniques to enable a team of geographically distributed domain specialists to effectively and remotely maneuver a custom-built instrument under challenging operational conditions. Sunfall Data Taking has been in use for over eighteen months by a major international astrophysics collaboration (the largest data volume supernova search currently in operation), and has substantially improved the operational efficiency of its users. We describe the system design process by an interdisciplinary team, the system architecture, and the results of an informal usability evaluation of the production system by domain experts in the context of Endsleypsilas three levels of situation awareness.",Cecilia R. Aragon;Sarah S. Poon;Gregory S. Aldering;Rollin C. Thomas;Robert Quimby,Cecilia R. Aragon;Sarah S. Poon;Gregory S. Aldering;Rollin C. Thomas;Robert Quimby,"Lawrence Berkeley National Laboratory, CA 94720, USA;Space Sciences Laboratory, Berkeley, CA 94720, USA;Lawrence Berkeley National Laboratory, CA 94720, USA;Lawrence Berkeley National Laboratory, CA 94720, USA;California Institute of Technology, Pasadena, 91125, USA",10.1109/VAST.2007.4388997;10.1109/VAST.2007.4388998;10.1109/VAST.2007.4388993;10.1109/VAST.2006.261416;10.1109/VAST.2007.4388991;10.1109/VAST.2007.4388996;10.1109/VAST.2007.4388994;10.1109/VAST.2006.261434;10.1109/TVCG.2006.176;10.1109/INFVIS.2004.27,"Data and knowledge visualization, scientific visualization, visual analytics, situation awareness, astrophysics",14,7,39,
Vis,2009,A Visual Approach to Efficient Analysis and Quantification of Ductile Iron and Reinforced Sprayed Concrete,10.1109/TVCG.2009.115,http://dx.doi.org/10.1109/TVCG.2009.115,1343,1350,J,"This paper describes advanced volume visualization and quantification for applications in non-destructive testing (NDT), which results in novel and highly effective interactive workflows for NDT practitioners. We employ a visual approach to explore and quantify the features of interest, based on transfer functions in the parameter spaces of specific application scenarios. Examples are the orientations of fibres or the roundness of particles. The applicability and effectiveness of our approach is illustrated using two specific scenarios of high practical relevance. First, we discuss the analysis of Steel Fibre Reinforced Sprayed Concrete (SFRSpC). We investigate the orientations of the enclosed steel fibres and their distribution, depending on the concrete's application direction. This is a crucial step in assessing the material's behavior under mechanical stress, which is still in its infancy and therefore a hot topic in the building industry. The second application scenario is the designation of the microstructure of ductile cast irons with respect to the contained graphite. This corresponds to the requirements of the ISO standard 945-1, which deals with 2D metallographic samples. We illustrate how the necessary analysis steps can be carried out much more efficiently using our system for 3D volumes. Overall, we show that a visual approach with custom transfer functions in specific application domains offers significant benefits and has the potential of greatly improving and optimizing the workflows of domain scientists and engineers.",Laura Fritz;Markus Hadwiger;Georg Geier;Gerhard Pittino;M. Eduard Gröller,Laura Fritz;Markus Hadwiger;Georg Geier;Gerhard Pittino;M. Eduard Groller,"VRVis Research Center, Vienna, Austriastill involve a considerable amount of manual work due to insufficient;VRVis Research Center, Vienna, Austriastill involve a considerable amount of manual work due to insufficient;{|}Austrian Foundry Research Institute, Leoben, Austriatomized for specific applications with a high relevance for NDT prac-;Institute for Subsurface Engineering, University of Leoben, Austriaexpert users from this domain, both from a more practical engineer-;Vienna University of Technology, Vienna, Austriaof view. The first application scenario that we describe (Section 3) is",10.1109/TVCG.2008.147;10.1109/VISUAL.2003.1250418;10.1109/TVCG.2008.162;10.1109/VISUAL.2001.964519;10.1109/VISUAL.2003.1250384;10.1109/TVCG.2007.70603,"Non-Destructive Testing, Multi-Dimensional Transfer Functions, Direction Visualization, Volume Rendering",14,11,22,
Vis,2009,Quantitative Texton Sequences for Legible Bivariate Maps,10.1109/TVCG.2009.175,http://dx.doi.org/10.1109/TVCG.2009.175,1523,1530,J,"Representing bivariate scalar maps is a common but difficult visualization problem. One solution has been to use two dimensional color schemes, but the results are often hard to interpret and inaccurately read. An alternative is to use a color sequence for one variable and a texture sequence for another. This has been used, for example, in geology, but much less studied than the two dimensional color scheme, although theory suggests that it should lead to easier perceptual separation of information relating to the two variables. To make a texture sequence more clearly readable the concept of the quantitative texton sequence (QTonS) is introduced. A QTonS is defined a sequence of small graphical elements, called textons, where each texton represents a different numerical value and sets of textons can be densely displayed to produce visually differentiable textures. An experiment was carried out to compare two bivariate color coding schemes with two schemes using QTonS for one bivariate map component and a color sequence for the other. Two different key designs were investigated (a key being a sequence of colors or textures used in obtaining quantitative values from a map). The first design used two separate keys, one for each dimension, in order to measure how accurately subjects could independently estimate the underlying scalar variables. The second key design was two dimensional and intended to measure the overall integral accuracy that could be obtained. The results show that the accuracy is substantially higher for the QTonS/color sequence schemes. A hypothesis that texture/color sequence combinations are better for independent judgments of mapped quantities was supported. A second experiment probed the limits of spatial resolution for QTonSs.",Colin Ware,Colin Ware,"Center for Coastal and Ocean Mapping, University of New Hampshire",10.1109/VISUAL.1995.480803;10.1109/VISUAL.1998.745292;10.1109/TVCG.2007.70623;10.1109/VISUAL.2000.885679;10.1109/VISUAL.1997.663874;10.1109/VISUAL.1990.146383,"Bivariate maps, texture, texton, legibility, quantitative texton sequence, QTonS",14,8,29,
InfoVis,2010,Evaluating the impact of task demands and block resolution on the effectiveness of pixel-based visualization,10.1109/TVCG.2010.150,http://dx.doi.org/10.1109/TVCG.2010.150,963,972,J,"Pixel-based visualization is a popular method of conveying large amounts of numerical data graphically. Application scenarios include business and finance, bioinformatics and remote sensing. In this work, we examined how the usability of such visual representations varied across different tasks and block resolutions. The main stimuli consisted of temporal pixel-based visualization with a white-red color map, simulating monthly temperature variation over a six-year period. In the first study, we included 5 separate tasks to exert different perceptual loads. We found that performance varied considerably as a function of task, ranging from 75% correct in low-load tasks to below 40% in high-load tasks. There was a small but consistent effect of resolution, with the uniform patch improving performance by around 6% relative to higher block resolution. In the second user study, we focused on a high-load task for evaluating month-to-month changes across different regions of the temperature range. We tested both CIE L*u*v* and RGB color spaces. We found that the nature of the change-evaluation errors related directly to the distance between the compared regions in the mapped color space. We were able to reduce such errors by using multiple color bands for the same data range. In a final study, we examined more fully the influence of block resolution on performance, and found block resolution had a limited impact on the effectiveness of pixel-based visualization.",Rita Borgo;Karl J. Proctor;Min Chen 0001;Heike Leitte;Tavi Murray;Ian M. Thornton,Rita Borgo;Karl Proctor;Min Chen;Heike Janicke;Tavi Murray;Ian Thornton,Swansea University;Swansea University;Swansea University;Heidelberg University;Swansea University;Swansea University,10.1109/VISUAL.1995.480803,"Pixel-based visualization, evaluation, user study, visual search, change detection",14,14,38,
Vis,2010,Exploded View Diagrams of Mathematical Surfaces,10.1109/TVCG.2010.151,http://dx.doi.org/10.1109/TVCG.2010.151,1311,1318,J,"We present a technique for visualizing complicated mathematical surfaces that is inspired by hand-designed topological illustrations. Our approach generates exploded views that expose the internal structure of such a surface by partitioning it into parallel slices, which are separated from each other along a single linear explosion axis. Our contributions include a set of simple, prescriptive design rules for choosing an explosion axis and placing cutting planes, as well as automatic algorithms for applying these rules. First we analyze the input shape to select the explosion axis based on the detected rotational and reflective symmetries of the input model. We then partition the shape into slices that are designed to help viewers better understand how the shape of the surface and its cross-sections vary along the explosion axis. Our algorithms work directly on triangle meshes, and do not depend on any specific parameterization of the surface. We generate exploded views for a variety of mathematical surfaces using our system.",Olga A. Karpenko;Wilmot Li;Niloy J. Mitra;Maneesh Agrawala,Olga Karpenko;Wilmot Li;Niloy Mitra;Maneesh Agrawala,UC Berkeley;Adobe Systems;KAUST / IIT Delhi;UC Berkeley,10.1109/TVCG.2006.140;10.1109/VISUAL.2003.1250400;10.1109/VISUAL.2005.1532856,"Exploded view diagrams, mathematical visualization, symmetry",14,12,33,
Vis,2011,GPU-Based Interactive Cut-Surface Extraction From High-Order finite Element fields,10.1109/TVCG.2011.206,http://dx.doi.org/10.1109/TVCG.2011.206,1803,1811,J,"We present a GPU-based ray-tracing system for the accurate and interactive visualization of cut-surfaces through 3D simulations of physical processes created from spectral/hp high-order finite element methods. When used by the numerical analyst to debug the solver, the ability for the imagery to precisely reflect the data is critical. In practice, the investigator interactively selects from a palette of visualization tools to construct a scene that can answer a query of the data. This is effective as long as the implicit contract of image quality between the individual and the visualization system is upheld. OpenGL rendering of scientific visualizations has worked remarkably well for exploratory visualization for most solver results. This is due to the consistency between the use of first-order representations in the simulation and the linear assumptions inherent in OpenGL (planar fragments and color-space interpolation). Unfortunately, the contract is broken when the solver discretization is of higher-order. There have been attempts to mitigate this through the use of spatial adaptation and/or texture mapping. These methods do a better job of approximating what the imagery should be but are not exact and tend to be view-dependent. This paper introduces new rendering mechanisms that specifically deal with the kinds of native data generated by high-order finite element solvers. The exploratory visualization tools are reassessed and cast in this system with the focus on image accuracy. This is accomplished in a GPU setting to ensure interactivity.",Blake Nelson;Robert Michael Kirby;Robert Haimes,Blake Nelson;Robert M. Kirby;Robert Haimes,University of Utah;University of Utah;MIT,10.1109/VISUAL.2005.1532776;10.1109/VISUAL.2004.91;10.1109/TVCG.2006.154,"High-order finite elements, spectral/hp elements, cut-plane extraction, GPU-based root-finding, GPU ray-tracing, cut-surface extraction",14,15,24,
Vis,2011,Interactive Volume Visualization of General Polyhedral Grids,10.1109/TVCG.2011.216,http://dx.doi.org/10.1109/TVCG.2011.216,2115,2124,J,"This paper presents a novel framework for visualizing volumetric data specified on complex polyhedral grids, without the need to perform any kind of a priori tetrahedralization. These grids are composed of polyhedra that often are non-convex and have an arbitrary number of faces, where the faces can be non-planar with an arbitrary number of vertices. The importance of such grids in state-of-the-art simulation packages is increasing rapidly. We propose a very compact, face-based data structure for representing such meshes for visualization, called two-sided face sequence lists (TSFSL), as well as an algorithm for direct GPU-based ray-casting using this representation. The TSFSL data structure is able to represent the entire mesh topology in a 1D TSFSL data array of face records, which facilitates the use of efficient 1D texture accesses for visualization. In order to scale to large data sizes, we employ a mesh decomposition into bricks that can be handled independently, where each brick is then composed of its own TSFSL array. This bricking enables memory savings and performance improvements for large meshes. We illustrate the feasibility of our approach with real-world application results, by visualizing highly complex polyhedral data from commercial state-of-the-art simulation packages.",Philipp Muigg;Markus Hadwiger;Helmut Doleisch;M. Eduard Gröller,Philipp Muigg;Markus Hadwiger;Helmut Doleisch;Eduard Groller,"Vienna University of Technology, Austria;King Abdullah University of Science and Technology, Saudi Arabia;SimVis GmbH, Vienna, Austria;Vienna University of Technology, Austria",10.1109/VISUAL.2005.1532796;10.1109/TVCG.2006.171;10.1109/TVCG.2007.70588;10.1109/VISUAL.2003.1250390;10.1109/VISUAL.2001.964514;10.1109/TVCG.2006.154;10.1109/VISUAL.2005.1532850;10.1109/VISUAL.2001.964511;10.1109/VISUAL.1999.809908,"Volume rendering, unstructured grids, polyhedral grids, GPU-based visualization",14,11,48,
Vis,2011,Symmetry in Scalar field Topology,10.1109/TVCG.2011.236,http://dx.doi.org/10.1109/TVCG.2011.236,2035,2044,J,"Study of symmetric or repeating patterns in scalar fields is important in scientific data analysis because it gives deep insights into the properties of the underlying phenomenon. Though geometric symmetry has been well studied within areas like shape processing, identifying symmetry in scalar fields has remained largely unexplored due to the high computational cost of the associated algorithms. We propose a computationally efficient algorithm for detecting symmetric patterns in a scalar field distribution by analysing the topology of level sets of the scalar field. Our algorithm computes the contour tree of a given scalar field and identifies subtrees that are similar. We define a robust similarity measure for comparing subtrees of the contour tree and use it to group similar subtrees together. Regions of the domain corresponding to subtrees that belong to a common group are extracted and reported to be symmetric. Identifying symmetry in scalar fields finds applications in visualization, data exploration, and feature detection. We describe two applications in detail: symmetry-aware transfer function design and symmetry-aware isosurface extraction.",Dilip Mathew Thomas;Vijay Natarajan,Dilip Mathew Thomas;Vijay Natarajan,"Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India;Department of Computer Science and Automation, Supercomputer Education and Research Centre, Indian Institute of Science, Bangalore, India",10.1109/TVCG.2008.143;10.1109/TVCG.2009.120;10.1109/TVCG.2007.70601,"Scalar field symmetry, contour tree, similarity measure, persistence, isosurface extraction, transfer function design",14,15,53,
SciVis,2012,Fuzzy Volume Rendering,10.1109/TVCG.2012.227,http://dx.doi.org/10.1109/TVCG.2012.227,2335,2344,J,"In order to assess the reliability of volume rendering, it is necessary to consider the uncertainty associated with the volume data and how it is propagated through the volume rendering algorithm, as well as the contribution to uncertainty from the rendering algorithm itself. In this work, we show how to apply concepts from the field of reliable computing in order to build a framework for management of uncertainty in volume rendering, with the result being a self-validating computational model to compute a posteriori uncertainty bounds. We begin by adopting a coherent, unifying possibility-based representation of uncertainty that is able to capture the various forms of uncertainty that appear in visualization, including variability, imprecision, and fuzziness. Next, we extend the concept of the fuzzy transform in order to derive rules for accumulation and propagation of uncertainty. This representation and propagation of uncertainty together constitute an automated framework for management of uncertainty in visualization, which we then apply to volume rendering. The result, which we call fuzzy volume rendering, is an uncertainty-aware rendering algorithm able to produce more complete depictions of the volume data, thereby allowing more reliable conclusions and informed decisions. Finally, we compare approaches for self-validated computation in volume rendering, demonstrating that our chosen method has the ability to handle complex uncertainty while maintaining efficiency.",Nathaniel Fout;Kwan-Liu Ma,Nathaniel Fout;Kwan-Liu Ma,"University of California, Davis;University of California, Davis",10.1109/TVCG.2007.70518;10.1109/TVCG.2010.211;10.1109/VISUAL.2005.1532807;10.1109/VAST.2009.5332611,"Uncertainty visualization, verifiable visualization, volume rendering",14,12,39,
VAST,2012,Scatter/Gather Clustering: Flexibly Incorporating User Feedback to Steer Clustering Results,10.1109/TVCG.2012.258,http://dx.doi.org/10.1109/TVCG.2012.258,2829,2838,J,"Significant effort has been devoted to designing clustering algorithms that are responsive to user feedback or that incorporate prior domain knowledge in the form of constraints. However, users desire more expressive forms of interaction to influence clustering outcomes. In our experiences working with diverse application scientists, we have identified an interaction style scatter/gather clustering that helps users iteratively restructure clustering results to meet their expectations. As the names indicate, scatter and gather are dual primitives that describe whether clusters in a current segmentation should be broken up further or, alternatively, brought back together. By combining scatter and gather operations in a single step, we support very expressive dynamic restructurings of data. Scatter/gather clustering is implemented using a nonlinear optimization framework that achieves both locality of clusters and satisfaction of user-supplied constraints. We illustrate the use of our scatter/gather clustering approach in a visual analytic application to study baffle shapes in the bat biosonar (ears and nose) system. We demonstrate how domain experts are adept at supplying scatter/gather constraints, and how our framework incorporates these constraints effectively without requiring numerous instance-level constraints.",Mahmud Shahriar Hossain;Praveen Kumar Reddy Ojili;Cindy Grimm;Rolf Müller;Layne T. Watson;Naren Ramakrishnan,M. Shahriar Hossain;Praveen Kumar Reddy Ojili;Cindy Grimm;Rolf Müller;Layne T. Watson;Naren Ramakrishnan,,10.1109/VAST.2009.5332584;10.1109/VAST.2007.4388999;10.1109/VAST.2008.4677350;10.1109/INFVIS.1998.729559;10.1109/VAST.2009.5332629,"Scatter/gather clustering, alternative clustering, constrained clustering",14,16,64,
VAST,2013,Supporting Awareness through Collaborative Brushing and Linking of Tabular Data,10.1109/TVCG.2013.197,http://dx.doi.org/10.1109/TVCG.2013.197,2189,2197,J,"Maintaining an awareness of collaborators' actions is critical during collaborative work, including during collaborative visualization activities. Particularly when collaborators are located at a distance, it is important to know what everyone is working on in order to avoid duplication of effort, share relevant results in a timely manner and build upon each other's results. Can a person's brushing actions provide an indication of their queries and interests in a data set? Can these actions be revealed to a collaborator without substantially disrupting their own independent work? We designed a study to answer these questions in the context of distributed collaborative visualization of tabular data. Participants in our study worked independently to answer questions about a tabular data set, while simultaneously viewing brushing actions of a fictitious collaborator, shown directly within a shared workspace. We compared three methods of presenting the collaborator's actions: brushing &amp;amp; linking (i.e. highlighting exactly what the collaborator would see), selection (i.e. showing only a selected item), and persistent selection (i.e. showing only selected items but having them persist for some time). Our results demonstrated that persistent selection enabled some awareness of the collaborator's activities while causing minimal interference with independent work. Other techniques were less effective at providing awareness, and brushing &amp;amp; linking caused substantial interference. These findings suggest promise for the idea of exploiting natural brushing actions to provide awareness in collaborative work.",Amir Hossein Hajizadeh;Melanie Tory;Rock Leung,Amir Hossein Hajizadeh;Melanie Tory;Rock Leung,University of Victoria;University of Victoria;SAP,10.1109/TVCG.2011.196;10.1109/TVCG.2007.70541;10.1109/TVCG.2011.185;10.1109/VAST.2010.5652880;10.1109/INFVIS.2003.1249020;10.1109/VAST.2007.4389011;10.1109/VAST.2011.6102447,"Collaboration, awareness, attentionally ambient visualization, brushing and linking, linked views, user study",14,12,36,
VAST,2013,Using Interactive Visual Reasoning to Support Sense-Making: Implications for Design,10.1109/TVCG.2013.211,http://dx.doi.org/10.1109/TVCG.2013.211,2217,2226,J,"This research aims to develop design guidelines for systems that support investigators and analysts in the exploration and assembly of evidence and inferences. We focus here on the problem of identifying candidate 'influencers' within a community of practice. To better understand this problem and its related cognitive and interaction needs, we conducted a user study using a system called INVISQUE (INteractive Visual Search and QUery Environment) loaded with content from the ACM Digital Library. INVISQUE supports search and manipulation of results over a freeform infinite 'canvas'. The study focuses on the representations user create and their reasoning process. It also draws on some pre-established theories and frameworks related to sense-making and cognitive work in general, which we apply as a 'theoretical lenses' to consider findings and articulate solutions. Analysing the user-study data in the light of these provides some understanding of how the high-level problem of identifying key players within a domain can translate into lower-level questions and interactions. This, in turn, has informed our understanding of representation and functionality needs at a level of description which abstracts away from the specifics of the problem at hand to the class of problems of interest. We consider the study outcomes from the perspective of implications for design.",Neesha Kodagoda;Simon Attfield;B. L. William Wong;Chris Rooney;Sharmin (Tinni) Choudhury,Neesha Kodagoda;Simon Attfield;B.L. William Wong;Chris Rooney;Sharmin Choudhury,"School of Science and Technology, Middlesex University;School of Science and Technology, Middlesex University;School of Science and Technology, Middlesex University;School of Science and Technology, Middlesex University;School of Science and Technology, Middlesex University",10.1109/VAST.2009.5333020;10.1109/VAST.2007.4389006;10.1109/TVCG.2012.252,"Visual analytics, sense-making, dataframe mode, evaluation, reasoning, analysis, interaction, interface design",14,8,36,
InfoVis,2014,"The relation between visualization size, grouping, and user performance",10.1109/TVCG.2014.2346983,http://dx.doi.org/10.1109/TVCG.2014.2346983,1953,1962,J,"In this paper we make the following contributions: (1) we describe how the grouping, quantity, and size of visual marks affects search time based on the results from two experiments; (2) we report how search performance relates to self-reported difficulty in finding the target for different display types; and (3) we present design guidelines based on our findings to facilitate the design of effective visualizations. Both Experiment 1 and 2 asked participants to search for a unique target in colored visualizations to test how the grouping, quantity, and size of marks affects user performance. In Experiment 1, the target square was embedded in a grid of squares and in Experiment 2 the target was a point in a scatterplot. Search performance was faster when colors were spatially grouped than when they were randomly arranged. The quantity of marks had little effect on search time for grouped displays (“pop-out”), but increasing the quantity of marks slowed reaction time for random displays. Regardless of color layout (grouped vs. random), response times were slowest for the smallest mark size and decreased as mark size increased to a point, after which response times plateaued. In addition to these two experiments we also include potential application areas, as well as results from a small case study where we report preliminary findings that size may affect how users infer how visualizations should be used. We conclude with a list of design guidelines that focus on how to best create visualizations based on grouping, quantity, and size of visual marks.",Connor Gramazio;Karen B. Schloss;David H. Laidlaw,Connor C. Gramazio;Karen B. Schloss;David H. Laidlaw,"Department of Computer Science, Brown University;Department of Cognitive, Linguistic, Psychological Sciences at Brown University;Department of Computer Science, Brown University",10.1109/TVCG.2012.233;10.1109/TVCG.2012.196;10.1109/TVCG.2011.185;10.1109/VAST.2007.4389009;10.1109/TVCG.2013.187;10.1109/TVCG.2011.175;10.1109/TVCG.2013.183;10.1109/TVCG.2006.184;10.1109/TVCG.2010.186;10.1109/VISUAL.1996.568118;10.1109/TVCG.2012.220;10.1109/TVCG.2013.170;10.1109/TVCG.2013.234,"information visualization, graphical perception, size, layout",14,12,51,
SciVis,2014,Vivaldi: A Domain-Specific Language for Volume Processing and Visualization on Distributed Heterogeneous Systems,10.1109/TVCG.2014.2346322,http://dx.doi.org/10.1109/TVCG.2014.2346322,2407,2416,J,"As the size of image data from microscopes and telescopes increases, the need for high-throughput processing and visualization of large volumetric data has become more pressing. At the same time, many-core processors and GPU accelerators are commonplace, making high-performance distributed heterogeneous computing systems affordable. However, effectively utilizing GPU clusters is difficult for novice programmers, and even experienced programmers often fail to fully leverage the computing power of new parallel architectures due to their steep learning curve and programming complexity. In this paper, we propose Vivaldi, a new domain-specific language for volume processing and visualization on distributed heterogeneous computing systems. Vivaldi's Python-like grammar and parallel processing abstractions provide flexible programming tools for non-experts to easily write high-performance parallel computing code. Vivaldi provides commonly used functions and numerical operators for customized visualization and high-throughput image processing applications. We demonstrate the performance and usability of Vivaldi on several examples ranging from volume rendering to image segmentation.",Hyungsuk Choi;Woohyuk Choi;Tran Minh Quan;David G. C. Hildebrand;Hanspeter Pfister;Won-Ki Jeong,Hyungsuk Choi;Woohyuk Choi;Tran Minh Quan;David G. C. Hildebrand;Hanspeter Pfister;Won-Ki Jeong,Ulsan National Institute of Science and Technology (UNIST);Ulsan National Institute of Science and Technology (UNIST);Ulsan National Institute of Science and Technology (UNIST);Harvard University;Harvard University;Ulsan National Institute of Science and Technology (UNIST),10.1109/VISUAL.2004.95,"Domain-specific language, volume rendering, GPU computing, distributed heterogeneous systems",14,18,30,
SciVis,2014,Ligand Excluded Surface: A New Type of Molecular Surface,10.1109/TVCG.2014.2346404,http://dx.doi.org/10.1109/TVCG.2014.2346404,2486,2495,J,"The most popular molecular surface in molecular visualization is the solvent excluded surface (SES). It provides information about the accessibility of a biomolecule for a solvent molecule that is geometrically approximated by a sphere. During a period of almost four decades, the SES has served for many purposes - including visualization, analysis of molecular interactions and the study of cavities in molecular structures. However, if one is interested in the surface that is accessible to a molecule whose shape differs significantly from a sphere, a different concept is necessary. To address this problem, we generalize the definition of the SES by replacing the probe sphere with the full geometry of the ligand defined by the arrangement of its van der Waals spheres. We call the new surface ligand excluded surface (LES) and present an efficient, grid-based algorithm for its computation. Furthermore, we show that this algorithm can also be used to compute molecular cavities that could host the ligand molecule. We provide a detailed description of its implementation on CPU and GPU. Furthermore, we present a performance and convergence analysis and compare the LES for several molecules, using as ligands either water or small organic molecules.",Norbert Lindow;Daniel Baum;Hans-Christian Hege,Norbert Lindow;Daniel Baum;Hans-Christian Hege,Zuse Institute Berlin;Zuse Institute Berlin;Zuse Institute Berlin,10.1109/TVCG.2009.157;10.1109/TVCG.2011.259;10.1109/TVCG.2013.158,"Molecular visualization, solvent excluded surface, ligand excluded surface, cavity analysis",14,11,48,
SciVis,2014,Combined Visualization of Wall Thickness and Wall Shear Stress for the Evaluation of Aneurysms,10.1109/TVCG.2014.2346406,http://dx.doi.org/10.1109/TVCG.2014.2346406,2506,2515,J,"For an individual rupture risk assessment of aneurysms, the aneurysm's wall morphology and hemodynamics provide valuable information. Hemodynamic information is usually extracted via computational fluid dynamic (CFD) simulation on a previously extracted 3D aneurysm surface mesh or directly measured with 4D phase-contrast magnetic resonance imaging. In contrast, a noninvasive imaging technique that depicts the aneurysm wall in vivo is still not available. Our approach comprises an experiment, where intravascular ultrasound (IVUS) is employed to probe a dissected saccular aneurysm phantom, which we modeled from a porcine kidney artery. Then, we extracted a 3D surface mesh to gain the vessel wall thickness and hemodynamic information from a CFD simulation. Building on this, we developed a framework that depicts the inner and outer aneurysm wall with dedicated information about local thickness via distance ribbons. For both walls, a shading is adapted such that the inner wall as well as its distance to the outer wall is always perceivable. The exploration of the wall is further improved by combining it with hemodynamic information from the CFD simulation. Hence, the visual analysis comprises a brushing and linking concept for individual highlighting of pathologic areas. Also, a surface clustering is integrated to provide an automatic division of different aneurysm parts combined with a risk score depending on wall thickness and hemodynamic information. In general, our approach can be employed for vessel visualization purposes where an inner and outer wall has to be adequately represented.",Sylvia Saalfeld;Kai Lawonn;Thomas Hoffmann 0002;Martin Skalej;Bernhard Preim,Sylvia Glaßer;Kai Lawonn;Thomas Hoffmann;Martin Skalej;Bernhard Preim,"Department for Simulation and Graphics, University of Magdeburg, Germany;Department for Simulation and Graphics, University of Magdeburg, Germany;Neuroradiology Department, University hospital of Magdeburg, Germany;Neuroradiology Department, University hospital of Magdeburg, Germany;Department for Simulation and Graphics, University of Magdeburg, Germany",10.1109/TVCG.2012.202;10.1109/TVCG.2007.70550;10.1109/VISUAL.1995.480795;10.1109/TVCG.2011.189,"Aneurysm, IVUS, Wall Thickness, Wall Shear Stress, Brushing and Linking, Focus + Context",14,11,43,
SciVis,2014,Advection-Based Sparse Data Management for Visualizing Unsteady Flow,10.1109/TVCG.2014.2346418,http://dx.doi.org/10.1109/TVCG.2014.2346418,2555,2564,J,"When computing integral curves and integral surfaces for large-scale unsteady flow fields, a major bottleneck is the widening gap between data access demands and the available bandwidth (both I/O and in-memory). In this work, we explore a novel advection-based scheme to manage flow field data for both efficiency and scalability. The key is to first partition flow field into blocklets (e.g. cells or very fine-grained blocks of cells), and then (pre)fetch and manage blocklets on-demand using a parallel key-value store. The benefits are (1) greatly increasing the scale of local-range analysis (e.g. source-destination queries, streak surface generation) that can fit within any given limit of hardware resources; (2) improving memory and I/O bandwidth-efficiencies as well as the scalability of naive task-parallel particle advection. We demonstrate our method using a prototype system that works on workstation and also in supercomputing environments. Results show significantly reduced I/O overhead compared to accessing raw flow data, and also high scalability on a supercomputer for a variety of applications.",Hanqi Guo 0001;Jiang Zhang 0002;Richen Liu;Lu Liu 0017;Xiaoru Yuan;Jian Huang 0007;Xiangfei Meng;Jingshan Pan,Hanqi Guo;Jiang Zhang;Richen Liu;Lu Liu;Xiaoru Yuan;Jian Huang;Xiangfei Meng;Jingshan Pan,"Key Laboratory of Machine Perception (Ministry of Education), School of EECS;Key Laboratory of Machine Perception (Ministry of Education), School of EECS;Key Laboratory of Machine Perception (Ministry of Education), School of EECS;Key Laboratory of Machine Perception (Ministry of Education), School of EECS;Key Laboratory of Machine Perception (Ministry of Education), School of EECS;Department of Electrical Engineering and Computer Science, University of Tennessee, Knoxville;National Supercomputer Center in Tianjin, Binhai, Tianjin, China;National Supercomputer Center in Jinan, Shandong, China",10.1109/TVCG.2009.154;10.1109/TVCG.2011.219;10.1109/VISUAL.1997.663898;10.1109/TVCG.2013.144;10.1109/TVCG.2013.128;10.1109/TVCG.2007.70551,"Flow visualization, Data management, High performance visualization, Key-value store",14,12,37,
VAST,2014,Vismate: Interactive Visual Analysis of Station-Based Observation Data on Climate Changes,10.1109/VAST.2014.7042489,http://dx.doi.org/10.1109/VAST.2014.7042489,133,142,C,"We present a new approach to visualizing the climate data of multi-dimensional, time-series, and geo-related characteristics. Our approach integrates three new highly interrelated visualization techniques, and uses the same input data types as in the traditional model-based analysis methods. As the main visualization view, Global Radial Map is used to identify the overall state of climate changes and provide users with a compact and intuitive view for analyzing spatial and temporal patterns at the same time. Other two visualization techniques, providing complementary views, are specialized in analysing time trend and detecting abnormal cases, which are two important analysis tasks in any climate change study. Case studies and expert reviews have been conducted, through which the effectiveness and scalability of the proposed approach has been confirmed.",Jie Li 0006;Kang Zhang 0001;Zhaopeng Meng,Jie Li;Kang Zhang;Zhao-Peng Meng,"School of Computer Science and Technology, Tianjin University, and National Ocean Technology Center, Tianjin, China;Department of Computer Science, The University of Texas at Dallas, USA;School of Computer Software, Tianjin University, China",10.1109/VAST.2012.6400491;10.1109/TVCG.2010.194;10.1109/INFVIS.2000.885098;10.1109/TVCG.2007.70523;10.1109/TVCG.2009.199;10.1109/TVCG.2010.183;10.1109/VAST.2012.6400553;10.1109/TVCG.2010.180;10.1109/TVCG.2009.197,"climate changes, spatiotemporal visualization, station-based observation data, radial layout, visual analytics",14,10,54,
VAST,2014,BoundarySeer: Visual Analysis of 2D Boundary Changes,10.1109/VAST.2014.7042490,http://dx.doi.org/10.1109/VAST.2014.7042490,143,152,C,"Boundary changes exist ubiquitously in our daily life. From the Antarctic ozone hole to the land desertification, and from the territory of a country to the area within one-hour reach from a downtown location, boundaries change over time. With a large number of time-varying boundaries recorded, people often need to analyze the changes, detect their similarities or differences, and find out spatial and temporal patterns of the evolution for various applications. In this paper, we present a comprehensive visual analytics system, BoundarySeer, to help users gain insight into the changes of boundaries. Our system consists of four major viewers: 1) a global viewer to show boundary groups based on their similarity and the distribution of boundary attributes such as smoothness and perimeter; 2) a region viewer to display the regions encircled by the boundaries and how they are affected by boundary changes; 3) a trend viewer to reveal the temporal patterns in the boundary evolution and potential spatio-temporal correlations; 4) a directional change viewer to encode movements of boundary segments in different directions. Quantitative analyses of boundaries (e.g., similarity measurement and adaptive clustering) and intuitive visualizations (e.g., density map and ThemeRiver) are integrated into these viewers, which enable users to explore boundary changes from different aspects and at different scales. Case studies with two real-world datasets have been carried out to demonstrate the effectiveness of our system.",Wenchao Wu;Yixian Zheng;Huamin Qu;Wei Chen 0001;M. Eduard Gröller;Lionel M. Ni,Wenchao Wu;Yixian Zheng;Huamin Qu;Wei Chen;Eduard Gröller;Lionel M. Ni,"Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;State Key Lab of CAD&CG, Zhejiang University;Institute of Computer Graphics and Algorithms, Vienna University of Technology and VRVis Research Center, Austria;Hong Kong University of Science and Technology",10.1109/TVCG.2013.230;10.1109/INFVIS.2004.27;10.1109/INFVIS.2001.963273;10.1109/TVCG.2011.239;10.1109/TVCG.2008.166;10.1109/INFVIS.2005.1532149;10.1109/TVCG.2013.213;10.1109/TVCG.2012.265;10.1109/TVCG.2007.70535;10.1109/TVCG.2008.125;10.1109/TVCG.2007.70561,"Boundary change, visual analytics, scatter plot, ThemeRiver, contour map, radial visualization",14,8,40,
VAST,2014,YMCA - Your Mesh Comparison Application,10.1109/VAST.2014.7042491,http://dx.doi.org/10.1109/VAST.2014.7042491,153,162,C,"Polygonal meshes can be created in several different ways. In this paper we focus on the reconstruction of meshes from point clouds, which are sets of points in 3D. Several algorithms that tackle this task already exist, but they have different benefits and drawbacks, which leads to a large number of possible reconstruction results (i.e., meshes). The evaluation of those techniques requires extensive comparisons between different meshes which is up to now done by either placing images of rendered meshes side-by-side, or by encoding differences by heat maps. A major drawback of both approaches is that they do not scale well with the number of meshes. This paper introduces a new comparative visual analysis technique for 3D meshes which enables the simultaneous comparison of several meshes and allows for the interactive exploration of their differences. Our approach gives an overview of the differences of the input meshes in a 2D view. By selecting certain areas of interest, the user can switch to a 3D representation and explore the spatial differences in detail. To inspect local variations, we provide a magic lens tool in 3D. The location and size of the lens provide further information on the variations of the reconstructions in the selected area. With our comparative visualization approach, differences between several mesh reconstruction algorithms can be easily localized and inspected.",Johanna Schmidt;Reinhold Preiner;Thomas Auzinger;Michael Wimmer;M. Eduard Gröller;Stefan Bruckner,Johanna Schmidt;Reinhold Preiner;Thomas Auzinger;Michael Wimmer;M. Eduard Gröller;Stefan Bruckner,"Vienna University of Technology, Austria;Vienna University of Technology, Austria;Vienna University of Technology, Austria;Vienna University of Technology, Austria;Vienna University of Technology, Vienna, Austria;University of Bergen, Norway",10.1109/INFVIS.2002.1173157;10.1109/VISUAL.1990.146402;10.1109/TVCG.2013.213;10.1109/VISUAL.2002.1183790,"Visual analysis, comparative visualization, 3D data exploration, focus+context, mesh comparison",14,11,33,
InfoVis,2015,"Matches, Mismatches, and Methods: Multiple-View Workflows for Energy Portfolio Analysis",10.1109/TVCG.2015.2466971,http://dx.doi.org/10.1109/TVCG.2015.2466971,449,458,J,"The energy performance of large building portfolios is challenging to analyze and monitor, as current analysis tools are not scalable or they present derived and aggregated data at too coarse of a level. We conducted a visualization design study, beginning with a thorough work domain analysis and a characterization of data and task abstractions. We describe generalizable visual encoding design choices for time-oriented data framed in terms of matches and mismatches, as well as considerations for workflow design. Our designs address several research questions pertaining to scalability, view coordination, and the inappropriateness of line charts for derived and aggregated data due to a combination of data semantics and domain convention. We also present guidelines relating to familiarity and trust, as well as methodological considerations for visualization design studies. Our designs were adopted by our collaborators and incorporated into the design of an energy analysis software application that will be deployed to tens of thousands of energy workers in their client base.",Matthew Brehmer;Jocelyn Ng;Kevin Tate;Tamara Munzner,Matthew Brehmer;Jocelyn Ng;Kevin Tate;Tamara Munzner,"University of British Columbia;EnerNOC, Inc.;EnerNOC, Inc.;University of British Columbia",10.1109/TVCG.2011.185;10.1109/TVCG.2013.124;10.1109/TVCG.2008.166;10.1109/TVCG.2013.145;10.1109/TVCG.2013.173;10.1109/TVCG.2010.162;10.1109/TVCG.2007.70583;10.1109/TVCG.2011.209;10.1109/TVCG.2014.2346331;10.1109/TVCG.2014.2346578;10.1109/TVCG.2009.111;10.1109/TVCG.2011.196;10.1109/TVCG.2012.213;10.1109/INFVIS.1999.801851;10.1109/INFVIS.2005.1532122,"Design study, design methodologies, time series data, task and requirements analysis, coordinated and multiple views",14,15,46,
SciVis,2015,Effective Visualization of Temporal Ensembles,10.1109/TVCG.2015.2468093,http://dx.doi.org/10.1109/TVCG.2015.2468093,787,796,J,"An ensemble is a collection of related datasets, called members, built from a series of runs of a simulation or an experiment. Ensembles are large, temporal, multidimensional, and multivariate, making them difficult to analyze. Another important challenge is visualizing ensembles that vary both in space and time. Initial visualization techniques displayed ensembles with a small number of members, or presented an overview of an entire ensemble, but without potentially important details. Recently, researchers have suggested combining these two directions, allowing users to choose subsets of members to visualization. This manual selection process places the burden on the user to identify which members to explore. We first introduce a static ensemble visualization system that automatically helps users locate interesting subsets of members to visualize. We next extend the system to support analysis and visualization of temporal ensembles. We employ 3D shape comparison, cluster tree visualization, and glyph based visualization to represent different levels of detail within an ensemble. This strategy is used to provide two approaches for temporal ensemble analysis: (1) segment based ensemble analysis, to capture important shape transition time-steps, clusters groups of similar members, and identify common shape changes over time across multiple members; and (2) time-step based ensemble analysis, which assumes ensemble members are aligned in time by combining similar shapes at common time-steps. Both approaches enable users to interactively visualize and analyze a temporal ensemble from different perspectives at different levels of detail. We demonstrate our techniques on an ensemble studying matter transition from hadronic gas to quark-gluon plasma during gold-on-gold particle collisions.",Lihua Hao;Christopher G. Healey;Steffen A. Bass,Lihua Hao;Christopher G. Healey;Steffen A. Bass,NC State University;NC State University;Duke University,10.1109/TVCG.2014.2346448;10.1109/VISUAL.2005.1532839;10.1109/VISUAL.2005.1532838;10.1109/TVCG.2014.2346751;10.1109/TVCG.2009.155;10.1109/TVCG.2014.2346455;10.1109/TVCG.2010.181;10.1109/TVCG.2013.143,Ensemble visualization,14,13,28,
VAST,2015,3D Regression Heat Map Analysis of Population Study Data,10.1109/TVCG.2015.2468291,http://dx.doi.org/10.1109/TVCG.2015.2468291,81,90,J,"Epidemiological studies comprise heterogeneous data about a subject group to define disease-specific risk factors. These data contain information (features) about a subject's lifestyle, medical status as well as medical image data. Statistical regression analysis is used to evaluate these features and to identify feature combinations indicating a disease (the target feature). We propose an analysis approach of epidemiological data sets by incorporating all features in an exhaustive regression-based analysis. This approach combines all independent features w.r.t. a target feature. It provides a visualization that reveals insights into the data by highlighting relationships. The 3D Regression Heat Map, a novel 3D visual encoding, acts as an overview of the whole data set. It shows all combinations of two to three independent features with a specific target disease. Slicing through the 3D Regression Heat Map allows for the detailed analysis of the underlying relationships. Expert knowledge about disease-specific hypotheses can be included into the analysis by adjusting the regression model formulas. Furthermore, the influences of features can be assessed using a difference view comparing different calculation results. We applied our 3D Regression Heat Map method to a hepatic steatosis data set to reproduce results from a data mining-driven analysis. A qualitative analysis was conducted on a breast density data set. We were able to derive new hypotheses about relations between breast density and breast lesions with breast cancer. With the 3D Regression Heat Map, we present a visual overview of epidemiological data that allows for the first time an interactive regression-based analysis of large feature sets with respect to a disease.",Paul Klemm;Kai Lawonn;Sylvia Saalfeld;Uli Niemann;Katrin Hegenscheid;Henry Völzke;Bernhard Preim,Paul Klemm;Kai Lawonn;Sylvia Glaßer;Uli Niemann;Katrin Hegenscheid;Henry Völzke;Bernhard Preim,"Otto-von-Guericke University Magdeburg, Germany;Otto-von-Guericke University Magdeburg, Germany;Otto-von-Guericke University Magdeburg, Germany;Otto-von-Guericke University Magdeburg, Germany;Ernst-Moritz-Arndt University Greifswald, Germany;Ernst-Moritz-Arndt University Greifswald, Germany;Otto-von-Guericke University Magdeburg, Germany",10.1109/TVCG.2011.229;10.1109/TVCG.2011.185;10.1109/VAST.2009.5333431;10.1109/TVCG.2013.160;10.1109/TVCG.2014.2346591;10.1109/TVCG.2013.161;10.1109/TVCG.2013.125;10.1109/TVCG.2014.2346321,"Interactive Visual Analysis, Regression Analysis, Heat Map, Epidemiology, Breast Cancer, Hepatic Steatosis",14,20,43,
InfoVis,2016,Visualizing Social Media Content with SentenTree,10.1109/TVCG.2016.2598590,http://dx.doi.org/10.1109/TVCG.2016.2598590,621,630,J,"We introduce SentenTree, a novel technique for visualizing the content of unstructured social media text. SentenTree displays frequent sentence patterns abstracted from a corpus of social media posts. The technique employs design ideas from word clouds and the Word Tree, but overcomes a number of limitations of both those visualizations. SentenTree displays a node-link diagram where nodes are words and links indicate word co-occurrence within the same sentence. The spatial arrangement of nodes gives cues to the syntactic ordering of words while the size of nodes gives cues to their frequency of occurrence. SentenTree can help people gain a rapid understanding of key concepts and opinions in a large social media text collection. It is implemented as a lightweight application that runs in the browser.",Mengdie Hu;Krist Wongsuphasawat;John T. Stasko,Mengdie Hu;Krist Wongsuphasawat;John Stasko,Georgia Institute of Technology;Twitter Inc.;Georgia Institute of Technology,10.1109/TVCG.2009.171;10.1109/TVCG.2008.172;10.1109/VAST.2009.5333443;10.1109/INFVIS.1995.528686;10.1109/TVCG.2010.154;10.1109/VAST.2012.6400485;10.1109/TVCG.2011.179;10.1109/TVCG.2010.194;10.1109/TVCG.2013.221;10.1109/TVCG.2006.156;10.1109/TVCG.2009.165;10.1109/VAST.2011.6102488;10.1109/TVCG.2014.2346920;10.1109/TVCG.2015.2467991;10.1109/TVCG.2011.239,text visualization;social media;natural language processing;word cloud;Twitter,14,20,46,
InfoVis,2016,Probabilistic Graph Layout for Uncertain Network Visualization,10.1109/TVCG.2016.2598919,http://dx.doi.org/10.1109/TVCG.2016.2598919,531,540,J,"We present a novel uncertain network visualization technique based on node-link diagrams. Nodes expand spatially in our probabilistic graph layout, depending on the underlying probability distributions of edges. The visualization is created by computing a two-dimensional graph embedding that combines samples from the probabilistic graph. A Monte Carlo process is used to decompose a probabilistic graph into its possible instances and to continue with our graph layout technique. Splatting and edge bundling are used to visualize point clouds and network topology. The results provide insights into probability distributions for the entire network-not only for individual nodes and edges. We validate our approach using three data sets that represent a wide range of network types: synthetic data, protein-protein interactions from the STRING database, and travel times extracted from Google Maps. Our approach reveals general limitations of the force-directed layout and allows the user to recognize that some nodes of the graph are at a specific position just by chance.",Christoph Schulz;Arlind Nocaj;Jochen Görtler;Oliver Deussen;Ulrik Brandes;Daniel Weiskopf,Christoph Schulz;Arlind Nocaj;Jochen Goertler;Oliver Deussen;Ulrik Brandes;Daniel Weiskopf,VISUSUniversity of Stuttgart;University of Konstanz;University of Konstanz;University of Konstanz;University of Konstanz;VISUSUniversity of Stuttgart,10.1109/TVCG.2006.147;10.1109/TVCG.2010.176;10.1109/TVCG.2009.150;10.1109/TVCG.2009.127;10.1109/TVCG.2015.2467691;10.1109/TVCG.2015.2467591;10.1109/VAST.2009.5332611;10.1109/TVCG.2009.122;10.1109/TVCG.2013.232,Uncertainty visualization;graph layout;graph visualization;edge bundling;Monte Carlo method,14,15,45,
VAST,2016,A Visual Analytics Approach for Understanding Reasons behind Snowballing and Comeback in MOBA Games,10.1109/TVCG.2016.2598415,http://dx.doi.org/10.1109/TVCG.2016.2598415,211,220,J,"To design a successful Multiplayer Online Battle Arena (MOBA) game, the ratio of snowballing and comeback occurrences to all matches played must be maintained at a certain level to ensure its fairness and engagement. Although it is easy to identify these two types of occurrences, game developers often find it difficult to determine their causes and triggers with so many game design choices and game parameters involved. In addition, the huge amounts of MOBA game data are often heterogeneous, multi-dimensional and highly dynamic in terms of space and time, which poses special challenges for analysts. In this paper, we present a visual analytics system to help game designers find key events and game parameters resulting in snowballing or comeback occurrences in MOBA game data. We follow a user-centered design process developing the system with game analysts and testing with real data of a trial version MOBA game from NetEase Inc. We apply novel visualization techniques in conjunction with well-established ones to depict the evolution of players' positions, status and the occurrences of events. Our system can reveal players' strategies and performance throughout a single match and suggest patterns, e.g., specific player' actions and game events, that have led to the final occurrences. We further demonstrate a workflow of leveraging human analyzed patterns to improve the scalability and generality of match data analysis. Finally, we validate the usability of our system by proving the identified patterns are representative in snowballing or comeback matches in a one-month-long MOBA tournament dataset.",Quan Li;Peng Xu;Yeukyin Chan;Yun Wang 0012;Zhipeng Wang;Huamin Qu;Xiaojuan Ma,Quan Li;Peng Xu;Yeuk Yin Chan;Yun Wang;Zhipeng Wang;Huamin Qu;Xiaojuan Ma,"Hong Kong University of Science and Technology;NetEase, Inc.;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;China Academy of Art;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology",10.1109/TVCG.2014.2346445;10.1109/VISUAL.2004.120;10.1109/VAST.2015.7347633;10.1109/VAST.2014.7042477;10.1109/VAST.2014.7042478;10.1109/TVCG.2013.192;10.1109/TVCG.2012.263,Game play data visualization;visual knowledge discovery;visual knowledge representation;and game reconstruction,14,13,41,
VAST,2016,Familiarity Vs Trust: A Comparative Study of Domain Scientists' Trust in Visual Analytics and Conventional Analysis Methods,10.1109/TVCG.2016.2598544,http://dx.doi.org/10.1109/TVCG.2016.2598544,271,280,J,"Combining interactive visualization with automated analytical methods like statistics and data mining facilitates data-driven discovery. These visual analytic methods are beginning to be instantiated within mixed-initiative systems, where humans and machines collaboratively influence evidence-gathering and decision-making. But an open research question is that, when domain experts analyze their data, can they completely trust the outputs and operations on the machine-side? Visualization potentially leads to a transparent analysis process, but do domain experts always trust what they see? To address these questions, we present results from the design and evaluation of a mixed-initiative, visual analytics system for biologists, focusing on analyzing the relationships between familiarity of an analysis medium and domain experts' trust. We propose a trust-augmented design of the visual analytics system, that explicitly takes into account domain-specific tasks, conventions, and preferences. For evaluating the system, we present the results of a controlled user study with 34 biologists where we compare the variation of the level of trust across conventional and visual analytic mediums and explore the influence of familiarity and task complexity on trust. We find that despite being unfamiliar with a visual analytic medium, scientists seem to have an average level of trust that is comparable with the same in conventional analysis medium. In fact, for complex sense-making tasks, we find that the visual analytic system is able to inspire greater trust than other mediums. We summarize the implications of our findings with directions for future research on trustworthiness of visual analytic systems.",Aritra Dasgupta;Joon-Yong Lee;Ryan Wilson;Robert A. Lafrance;Nick Cramer;Kristin A. Cook;Samuel H. Payne,Aritra Dasgupta;Joon-Yong Lee;Ryan Wilson;Robert A. Lafrance;Nick Cramer;Kristin Cook;Samuel Payne,Pacific Northwest National Laboratory;Pacific Northwest National Laboratory;Pacific Northwest National Laboratory;Pacific Northwest National Laboratory;Pacific Northwest National Laboratory;Pacific Northwest National Laboratory;Pacific Northwest National Laboratory,10.1109/TVCG.2015.2467591;10.1109/VAST.2015.7347625;10.1109/TVCG.2012.224;10.1109/INFVIS.2005.1532136;10.1109/VAST.2006.261416;10.1109/TVCG.2013.124;10.1109/TVCG.2013.120,trust;transparency;familiarity;uncertainty;biological data analysis,14,13,41,
InfoVis,2017,iTTVis: Interactive Visualization of Table Tennis Data,10.1109/TVCG.2017.2744218,http://dx.doi.org/10.1109/TVCG.2017.2744218,709,718,J,"The rapid development of information technology paved the way for the recording of fine-grained data, such as stroke techniques and stroke placements, during a table tennis match. This data recording creates opportunities to analyze and evaluate matches from new perspectives. Nevertheless, the increasingly complex data poses a significant challenge to make sense of and gain insights into. Analysts usually employ tedious and cumbersome methods which are limited to watching videos and reading statistical tables. However, existing sports visualization methods cannot be applied to visualizing table tennis competitions due to different competition rules and particular data attributes. In this work, we collaborate with data analysts to understand and characterize the sophisticated domain problem of analysis of table tennis data. We propose iTTVis, a novel interactive table tennis visualization system, which to our knowledge, is the first visual analysis system for analyzing and exploring table tennis data. iTTVis provides a holistic visualization of an entire match from three main perspectives, namely, time-oriented, statistical, and tactical analyses. The proposed system with several well-coordinated views not only supports correlation identification through statistics and pattern detection of tactics with a score timeline but also allows cross analysis to gain insights. Data analysts have obtained several new insights by using iTTVis. The effectiveness and usability of the proposed system are demonstrated with four case studies.",Yingcai Wu;Ji Lan;Xinhuan Shu;Chenyang Ji;Kejian Zhao;Jiachen Wang;Hui Zhang,Yingcai Wu;Ji Lan;Xinhuan Shu;Chenyang Ji;Kejian Zhao;Jiachen Wang;Hui Zhang,State Key Lab of CAD &#x0026; CGZhejiang University;State Key Lab of CAD &#x0026; CGZhejiang University;State Key Lab of CAD &#x0026; CGZhejiang University;State Key Lab of CAD &#x0026; CGZhejiang University;State Key Lab of CAD &#x0026; CGZhejiang University;State Key Lab of CAD &#x0026; CGZhejiang University;Department of Physical EducationCollege of EducationZhejiang University,10.1109/VAST.2014.7042478;10.1109/VAST.2014.7042477;10.1109/INFVIS.1996.559229;10.1109/TVCG.2011.208;10.1109/TVCG.2013.192;10.1109/TVCG.2012.263;10.1109/TVCG.2014.2346445;10.1109/TVCG.2012.213,"Sports visualization,visual knowledge discovery,sports analytics,visual knowledge representation",14,8,35,
InfoVis,2017,HiPiler: Visual Exploration of Large Genome Interaction Matrices with Interactive Small Multiples,10.1109/TVCG.2017.2745978,http://dx.doi.org/10.1109/TVCG.2017.2745978,522,531,J,"This paper presents an interactive visualization interface-HiPiler-for the exploration and visualization of regions-of-interest in large genome interaction matrices. Genome interaction matrices approximate the physical distance of pairs of regions on the genome to each other and can contain up to 3 million rows and columns with many sparse regions. Regions of interest (ROIs) can be defined, e.g., by sets of adjacent rows and columns, or by specific visual patterns in the matrix. However, traditional matrix aggregation or pan-and-zoom interfaces fail in supporting search, inspection, and comparison of ROIs in such large matrices. In HiPiler, ROIs are first-class objects, represented as thumbnail-like “snippets”. Snippets can be interactively explored and grouped or laid out automatically in scatterplots, or through dimension reduction methods. Snippets are linked to the entire navigable genome interaction matrix through brushing and linking. The design of HiPiler is based on a series of semi-structured interviews with 10 domain experts involved in the analysis and interpretation of genome interaction matrices. We describe six exploration tasks that are crucial for analysis of interaction matrices and demonstrate how HiPiler supports these tasks. We report on a user study with a series of data exploration sessions with domain experts to assess the usability of HiPiler as well as to demonstrate respective findings in the data.",Fritz Lekschas;Benjamin Bach;Peter Kerpedjiev;Nils Gehlenborg;Hanspeter Pfister,Fritz Lekschas;Benjamin Bach;Peter Kerpedjiev;Nils Gehlenborg;Hanspeter Pfister,Harvard University;Harvard University;Harvard Medical School;Harvard Medical School;Harvard University,10.1109/TVCG.2015.2467851;10.1109/TVCG.2016.2598467;10.1109/TVCG.2012.208;10.1109/TVCG.2007.70582;10.1109/VAST.2009.5333893,"Interactive Small Multiples,Matrix Comparison,Biomedical Visualization,Genomics",14,4,45,
InfoVis,2017,"Keeping Multiple Views Consistent: Constraints, Validations, and Exceptions in Visualization Authoring",10.1109/TVCG.2017.2744198,http://dx.doi.org/10.1109/TVCG.2017.2744198,468,477,J,"Visualizations often appear in multiples, either in a single display (e.g., small multiples, dashboard) or across time or space (e.g., slideshow, set of dashboards). However, existing visualization design guidelines typically focus on single rather than multiple views. Solely following these guidelines can lead to effective yet inconsistent views (e.g., the same field has different axes domains across charts), making interpretation slow and error-prone. Moreover, little is known how consistency balances with other design considerations, making it difficult to incorporate consistency mechanisms in visualization authoring software. We present a wizard-of-oz study in which we observed how Tableau users achieve and sacrifice consistency in an exploration-to-presentation visualization design scenario. We extend (from our prior work) a set of encoding-specific constraints defining consistency across multiple views. Using the constraints as a checklist in our study, we observed cases where participants spontaneously maintained consistent encodings and warned cases where consistency was overlooked. In response to the warnings, participants either revised views for consistency or stated why they thought consistency should be overwritten. We categorize participants' actions and responses as constraint validations and exceptions, depicting the relative importance of consistency and other design considerations under various circumstances (e.g., data cardinality, available encoding resources, chart layout). We discuss automatic consistency checking as a constraint-satisfaction problem and provide design implications for communicating inconsistencies to users.",Zening Qu;Jessica Hullman,Zening Qu;Jessica Hullman,University of Washington;University of Washington,10.1109/TVCG.2009.174;10.1109/TVCG.2011.185;10.1109/TVCG.2013.119;10.1109/TVCG.2014.2346325;10.1109/TVCG.2007.70594;10.1109/TVCG.2016.2599030;10.1109/INFVIS.2000.885086;10.1109/TVCG.2012.275;10.1109/TVCG.2015.2467191,"Visualization Design,Qualitative Study,Evaluation",14,21,34,HM
SciVis,2017,StreetVizor: Visual Exploration of Human-Scale Urban Forms Based on Street Views,10.1109/TVCG.2017.2744159,http://dx.doi.org/10.1109/TVCG.2017.2744159,1004,1013,J,"Urban forms at human-scale, i.e., urban environments that individuals can sense (e.g., sight, smell, and touch) in their daily lives, can provide unprecedented insights on a variety of applications, such as urban planning and environment auditing. The analysis of urban forms can help planners develop high-quality urban spaces through evidence-based design. However, such analysis is complex because of the involvement of spatial, multi-scale (i.e., city, region, and street), and multivariate (e.g., greenery and sky ratios) natures of urban forms. In addition, current methods either lack quantitative measurements or are limited to a small area. The primary contribution of this work is the design of StreetVizor, an interactive visual analytics system that helps planners leverage their domain knowledge in exploring human-scale urban forms based on street view images. Our system presents two-stage visual exploration: 1) an AOI Explorer for the visual comparison of spatial distributions and quantitative measurements in two areas-of-interest (AOIs) at city- and region-scales; 2) and a Street Explorer with a novel parallel coordinate plot for the exploration of the fine-grained details of the urban forms at the street-scale. We integrate visualization techniques with machine learning models to facilitate the detection of street view patterns. We illustrate the applicability of our approach with case studies on the real-world datasets of four cities, i.e., Hong Kong, Singapore, Greater London and New York City. Interviews with domain experts demonstrate the effectiveness of our system in facilitating various analytical tasks.",Qiaomu Shen;Wei Zeng 0004;Yu Ye;Stefan Müller Arisona;Simon Schubiger-Banz;Remo Aslak Burkhard;Huamin Qu,Qiaomu Shen;Wei Zeng;Yu Ye;Stefan Müller Arisona;Simon Schubiger;Remo Burkhard;Huamin Qu,Hong Kong University of Science and Technology;Future Cities LaboratoryETH Zurich;Tongji University;University of Applied Sciences and Arts Northwestern Switzerland FHNW;University of Applied Sciences and Arts Northwestern Switzerland FHNW;Future Cities LaboratoryETH Zurich;Hong Kong University of Science and Technology,10.1109/TVCG.2014.2346446;10.1109/TVCG.2008.166;10.1109/TVCG.2014.2346594;10.1109/TVCG.2015.2467619;10.1109/TVCG.2011.176;10.1109/TVCG.2013.226;10.1109/VISUAL.1999.809866;10.1109/TVCG.2015.2467199;10.1109/TVCG.2013.179;10.1109/TVCG.2016.2598432;10.1109/TVCG.2007.70523;10.1109/TVCG.2011.181;10.1109/TVCG.2014.2346265;10.1109/TVCG.2016.2598694;10.1109/TVCG.2013.228;10.1109/TVCG.2013.221;10.1109/TVCG.2016.2598472,"Urban forms,human scale,street view,visual analytics",14,5,47,
VAST,2017,SOMFlow: Guided Exploratory Cluster Analysis with Self-Organizing Maps and Analytic Provenance,10.1109/TVCG.2017.2744805,http://dx.doi.org/10.1109/TVCG.2017.2744805,120,130,J,"Clustering is a core building block for data analysis, aiming to extract otherwise hidden structures and relations from raw datasets, such as particular groups that can be effectively related, compared, and interpreted. A plethora of visual-interactive cluster analysis techniques has been proposed to date, however, arriving at useful clusterings often requires several rounds of user interactions to fine-tune the data preprocessing and algorithms. We present a multi-stage Visual Analytics (VA) approach for iterative cluster refinement together with an implementation (SOMFlow) that uses Self-Organizing Maps (SOM) to analyze time series data. It supports exploration by offering the analyst a visual platform to analyze intermediate results, adapt the underlying computations, iteratively partition the data, and to reflect previous analytical activities. The history of previous decisions is explicitly visualized within a flow graph, allowing to compare earlier cluster refinements and to explore relations. We further leverage quality and interestingness measures to guide the analyst in the discovery of useful patterns, relations, and data partitions. We conducted two pair analytics experiments together with a subject matter expert in speech intonation research to demonstrate that the approach is effective for interactive data analysis, supporting enhanced understanding of clustering results as well as the interactive process itself.",Dominik Sacha;Matthias Kraus;Jürgen Bernard;Michael Behrisch 0001;Tobias Schreck;Yuki Asano;Daniel A. Keim,Dominik Sacha;Matthias Kraus;Jürgen Bernard;Michael Behrisch;Tobias Schreck;Yuki Asano;Daniel A. Keim,"University of Konstanz, Germany;University of Konstanz, Germany;TU Darmstadt, Germany;University of Konstanz, Germany;Graz University of Technology;University of Tübingen;University of Konstanz, Germany",10.1109/VAST.2009.5332584;10.1109/VAST.2014.7042480;10.1109/TVCG.2013.178;10.1109/TVCG.2011.229;10.1109/TVCG.2011.188;10.1109/TVCG.2016.2598468;10.1109/VAST.2010.5652443;10.1109/VAST.2015.7347625;10.1109/VAST.2007.4389013;10.1109/TVCG.2014.2346260;10.1109/TVCG.2007.70582;10.1109/VAST.2007.4388999;10.1109/TVCG.2014.2346481;10.1109/TVCG.2016.2598495;10.1109/VAST.2011.6102453,"Visual Analytics,Interaction,Visual Cluster Analysis,Quality Metrics,Guidance,Self-Organizing Maps,Time Series",14,10,58,
VAST,2017,EventThread: Visual Summarization and Stage Analysis of Event Sequence Data,10.1109/TVCG.2017.2745320,http://dx.doi.org/10.1109/TVCG.2017.2745320,56,65,J,"Event sequence data such as electronic health records, a person's academic records, or car service records, are ordered series of events which have occurred over a period of time. Analyzing collections of event sequences can reveal common or semantically important sequential patterns. For example, event sequence analysis might reveal frequently used care plans for treating a disease, typical publishing patterns of professors, and the patterns of service that result in a well-maintained car. It is challenging, however, to visually explore large numbers of event sequences, or sequences with large numbers of event types. Existing methods focus on extracting explicitly matching patterns of events using statistical analysis to create stages of event progression over time. However, these methods fail to capture latent clusters of similar but not identical evolutions of event sequences. In this paper, we introduce a novel visualization system named EventThread which clusters event sequences into threads based on tensor analysis and visualizes the latent stage categories and evolution patterns by interactively grouping the threads by similarity into time-specific clusters. We demonstrate the effectiveness of EventThread through usage scenarios in three different application domains and via interviews with an expert user.",Shunan Guo;Ke Xu;Rongwen Zhao;David Gotz;Hongyuan Zha;Nan Cao,Shunan Guo;Ke Xu;Rongwen Zhao;David Gotz;Hongyuan Zha;Nan Cao,"East China Normal University;Hong Kong University of Science and Technology;iDV<sup>x</sup> LabTongji University;University of North Carolina, Chapel Hill;East China Normal University;iDV<sup>x</sup> LabTongji University",10.1109/TVCG.2011.188;10.1109/TVCG.2014.2346682;10.1109/INFVIS.2003.1249017;10.1109/TVCG.2011.179;10.1109/TVCG.2013.200,"Visual Knowledge Representation,Visual Knowledge Discovery,Data Clustering,Time Series Data,Illustrative Visualization",14,15,39,
VAST,2017,A Workflow for Visual Diagnostics of Binary Classifiers using Instance-Level Explanations,10.1109/VAST.2017.8585720,http://dx.doi.org/10.1109/VAST.2017.8585720,162,172,C,"Human-in-the-loop data analysis applications necessitate greater transparency in machine learning models for experts to understand and trust their decisions. To this end, we propose a visual analytics workflow to help data scientists and domain experts explore, diagnose, and understand the decisions made by a binary classifier. The approach leverages “instance-level explanations”, measures of local feature relevance that explain single instances, and uses them to build a set of visual representations that guide the users in their investigation. The workflow is based on three main visual representations and steps: one based on aggregate statistics to see how data distributes across correct / incorrect decisions; one based on explanations to understand which features are used to make these decisions; and one based on raw data, to derive insights on potential root causes for the observed patterns. The workflow is derived from a long-term collaboration with a group of machine learning and healthcare professionals who used our method to make sense of machine learning models they developed. The case study from this collaboration demonstrates that the proposed workflow helps experts derive useful knowledge about the model and the phenomena it describes, thus experts can generate useful hypotheses on how a model can be improved.",Josua Krause;Aritra Dasgupta;Jordan Swartz;Yindalon Aphinyanagphongs;Enrico Bertini,Josua Krause;Aritra Dasgupta;Jordan Swartz;Yindalon Aphinyanaphongs;Enrico Bertini,NYU Tandon School of Engineering;Pacific Northwest National Laboratory;NYU School of Medicine;NYU School of Medicine;NYU Tandon School of Engineering,10.1109/TVCG.2014.2346660;10.1109/TVCG.2016.2598544;10.1109/TVCG.2014.2346482;10.1109/TVCG.2016.2598828;10.1109/TVCG.2016.2598829,"Machine Learning,Interpretation,Visual Analytics",14,9,33,
VAST,2018,Manifold: A Model-Agnostic Framework for Interpretation and Diagnosis of Machine Learning Models,10.1109/TVCG.2018.2864499,http://dx.doi.org/10.1109/TVCG.2018.2864499,364,373,J,"Interpretation and diagnosis of machine learning models have gained renewed interest in recent years with breakthroughs in new approaches. We present Manifold, a framework that utilizes visual analysis techniques to support interpretation, debugging, and comparison of machine learning models in a more transparent and interactive manner. Conventional techniques usually focus on visualizing the internal logic of a specific model type (i.e., deep neural networks), lacking the ability to extend to a more complex scenario where different model types are integrated. To this end, Manifold is designed as a generic framework that does not rely on or access the internal logic of the model and solely observes the input (i.e., instances or features) and the output (i.e., the predicted result and probability distribution). We describe the workflow of Manifold as an iterative process consisting of three major phases that are commonly involved in the model development and diagnosis process: inspection (hypothesis), explanation (reasoning), and refinement (verification). The visual components supporting these tasks include a scatterplot-based visual summary that overviews the models' outcome and a customizable tabular view that reveals feature discrimination. We demonstrate current applications of the framework on the classification and regression tasks and discuss other potential machine learning use scenarios where Manifold can be applied.",Jiawei Zhang 0003;Yang Wang;Piero Molino;Lezhi Li;David S. Ebert,Jiawei Zhang;Yang Wang;Piero Molino;Lezhi Li;David S. Ebert,"Purdue University;Uber Technologies, Inc;Uber AI Labs;Uber Technologies, Inc;Purdue University",10.1109/TVCG.2014.2346660;10.1109/VAST.2015.7347637;10.1109/TVCG.2014.2346594;10.1109/TVCG.2013.212;10.1109/TVCG.2017.2744718;10.1109/TVCG.2017.2744938;10.1109/TVCG.2017.2744378;10.1109/TVCG.2013.125;10.1109/TVCG.2014.2346578;10.1109/TVCG.2009.111;10.1109/TVCG.2016.2598838;10.1109/TVCG.2016.2598828;10.1109/INFVIS.2000.885086;10.1109/TVCG.2017.2744158;10.1109/TVCG.2016.2598829;10.1109/TVCG.2017.2744878,"Interactive machine learning,performance analysis,model comparison,model debugging",14,18,43,
Vis,1990,A procedural interface for volume rendering,10.1109/VISUAL.1990.146362,http://dx.doi.org/10.1109/VISUAL.1990.146362,36,"44, 462",C,"The author presents a simple, procedural interface for volume rendering. The interface is built on three types of objects: volumes, which contain the data to be visualized, environments, which set up viewing and lighting, and image objects, which convert results to a user-definable format. A volume is rendered against a particular environment with the results sent to an image object for conversion. By defining volume qualities such as color, opacity, and gradient in terms of user-definable transfer functions, the rendering process is made independent of the data set's underlying representation.&lt;&lt;ETX&gt;&gt;",James L. Montine,J.L. Montine,"Alliant Comput. Syst., Littleton, MA, USA",,,13,3,9,
Vis,1991,In vivo blood flow visualization with magnetic resonance imaging,10.1109/VISUAL.1991.175801,http://dx.doi.org/10.1109/VISUAL.1991.175801,202,"209, 423",C,"Blood movement investigated by magnetic resonance (MR) velocity mapping is generally presented in the form of velocity components in one or more chosen velocity encoding directions. By viewing these components separately, it is difficult for MR practitioners to conceptualize and comprehend the underlying flow structures, especially when the image data have strong background noise. A flow visualization technique that adapts the idea of particle tracing used in classical fluid dynamics for visualizing flow is presented. The flow image processing relies on the strong correlation between the principal flow direction estimated from the distribution of the modulus of the velocity field and the direction derived from the raw image data. By correlation calculation, severe background noise can be eliminated. Flow pattern rendering and animation provide an efficient way for representing internal flow structures.&lt;&lt;ETX&gt;&gt;",Guang-Zhong Yang;Peter Burger;Philip J. Kilner;Raad Mohiaddin,G.Z. Yang;P. Burger;P.J. Kilner;R.H. Mohiaddin,"Dept. of Comput., Imperial Coll., London Univ., UK;Dept. of Comput., Imperial Coll., London Univ., UK",,,13,7,10,
Vis,1991,"Cooperative, computer-aided design of scientific visualizations",10.1109/VISUAL.1991.175819,http://dx.doi.org/10.1109/VISUAL.1991.175819,306,"313, 430",C,"Partial automation of the task of designing graphical displays that effectively depict the data to be visualized through cooperative computer-aided design (CCAD) is described. This paradigm combines the strengths of manual and automated design by interspersing guiding design operations by the human user with the exploration of design alternatives by the computer. The approach is demonstrated in the context of the IVE design system, a CCAD environment for the design of scientific visualizations using a set of design rules that combine primitive visualization components in different ways. These alternatives are presented graphically to the user, who can browse through them, select the most promising visualization, and refine it manually.&lt;&lt;ETX&gt;&gt;",Sandeep Kochhar;Mark Friedell;Mark Vincent LaPolla,S. Kochhar;M. Friedell;M. LaPolla,"Harvard Univ., Cambridge, MA, USA;Harvard Univ., Cambridge, MA, USA",,"Grammar-directed design, cooperative design and modeling, design automation, human-computer interaction, automated design of graphical displays",13,6,22,
Vis,1993,An environment for telecollaborative data exploration,10.1109/VISUAL.1993.398858,http://dx.doi.org/10.1109/VISUAL.1993.398858,110,117,C,"This paper presents an environment for telecollaborative data exploration. It provides the following capabilities essential to data exploration: (1) users can probe the data, defining regions of interest with arbitrary shapes. (2) The selected data can be transformed and displayed in many different ways. (3) Linked cursors can be established between several windows showing data sets with arbitrary relationships. (4) Data can be displayed on any screen across a computer network, allowing for telecollaboration arrangements with linked cursors around the world. (5) Our system is user-extensible, allowing programmers to change any component of it while keeping the remaining functionality. We demonstrate how the system can be used in several applications, such as biomedical imaging, robotics, and wood classification.&lt;&lt;ETX&gt;&gt;",Gudrun Klinker,G.J. Klinker,"Digital Equipment Corp., Cambridge, MA, USA",10.1109/VISUAL.1992.235215,,13,2,28,
InfoVis,1995,Towards a generative theory of diagram design,10.1109/INFVIS.1995.528681,http://dx.doi.org/10.1109/INFVIS.1995.528681,11,18,C,"We describe the theoretical background for AVE, an automatic visualization engine for semantic networks. We have a functional notion of aesthetics and therefore understand meaningfulness as a central issue for information visualization. This implies that the diagrams should communicate the characteristics of the data as effectively as possible. In this generative theory of diagram design, we include data characterization, systematic use of graphical means of expression and the combination of graphical means of expression. After giving a brief introduction and an application scenario we discuss these aspects in detail. Finally, a process model of an automatic visualization process is sketched and directions for further research are outlined.",Klaus Reichenberger;Thomas Kamps;Gene Golovchinsky,K. Reichenberger;T. Kamps;G. Golovchinsky,"GMD-Inst. for Integrated Publication & Inf. Sci., Darmstadt, Germany;GMD-Inst. for Integrated Publication & Inf. Sci., Darmstadt, Germany;GMD-Inst. for Integrated Publication & Inf. Sci., Darmstadt, Germany",10.1109/VISUAL.1995.480815,,13,4,18,
InfoVis,1995,VRMosaic: WEB access from within a virtual environment,10.1109/INFVIS.1995.528687,http://dx.doi.org/10.1109/INFVIS.1995.528687,59,64,C,"Virtual reality can aid in designing large and complex structures such as ships, skyscrapers, factories, and aircraft. But before VR can realize this potential, we need to solve a number of problems. One of these problems: the user's need to see and interact with non-geometric information is examined. Our VR environment, RealEyes, can display large-scale and detailed geometry at reasonable frame rates (&gt;20 Hz) allowing a user to see and navigate within a design from a first person perspective. However, much (if not most) of the information associated with a particular design has no geometric representation. This includes information such as schematics of electrical, hydraulic, and plumbing systems; information describing materials or processes; and descriptive (textual) information of other types. Many researchers have developed a wealth of techniques for presenting such data on flat-screen displays, but until recently, we have not had a means for naturally displaying such information within a VR environment. To make non-geometric data more available, we have implemented a version of Mosaic that functions within a fully immersive VR system. Our system, VRMosaic, allows a user of VR to access and display most of the data available using flat screen Mosaic. Moreover, we have made it extensible to allow for the seamless integration of specialized forms of data and interaction. This paper describes how we implemented VRMosaic using a VR-capable version of Interviews, It also describes some Mosaic-like uses of that system and some ""non-Mosaic-like"" extensions.",Ian G. Angus;Henry Sowizral,I.G. Angus;H.A. Sowizral,"Inf. & Support Services, Boeing Co., Seattle, WA, USA;Inf. & Support Services, Boeing Co., Seattle, WA, USA",,"Virtual Reality, Mosaic, User Interface Components",13,1,13,
Vis,1995,Space walking,10.1109/VISUAL.1995.480804,http://dx.doi.org/10.1109/VISUAL.1995.480804,126,"133, 445",C,"Proposes an interactive method for exploring topological spaces based on the natural local geometry of the space. Examples of spaces appropriate for this visualization approach occur in abundance in mathematical visualization, surface and volume visualization problems, and scientific applications such as general relativity. Our approach is based on using a controller to choose a direction in which to ""walk"" a manifold along a local geodesic path. The method automatically generates orientation changes that produce a maximal viewable region with each step of the walk. The proposed interaction framework has many natural properties to help the user develop a useful cognitive map of a space and is well-suited to haptic interfaces that may be incorporated into desktop virtual reality systems.",Andrew J. Hanson;Hui Ma,A.J. Hanson;Hui Ma,"Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA;Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA",10.1109/VISUAL.1994.346324;10.1109/VISUAL.1992.235222,,13,6,19,
Vis,1997,Volume rendering of abdominal aortic aneurysms,10.1109/VISUAL.1997.663855,http://dx.doi.org/10.1109/VISUAL.1997.663855,43,50,C,"One well known application area of volume rendering is the reconstruction and visualization of output from medical scanners like computed tomography (CT). 2D greyscale slices produced by these scanners can be reconstructed and displayed onscreen as a 3D model. Volume visualization of medical images must address two important issues. First, it is difficult to segment medical scans into individual materials based only on intensity values. Second, although greyscale images are the normal method for displaying medical volumes, these types of images are not necessarily appropriate for highlighting regions of interest within the volume. Studies of the human visual system have shown that individual intensity values are difficult to detect in a greyscale image. In these situations colour is a more effective visual feature. We addressed both problems during the visualization of CT scans of abdominal aortic aneurysms. We have developed a classification method that empirically segments regions of interest in each of the 2D slices. We use a perceptual colour selection technique to identify each region of interest in both the 2D slices and the 3D reconstructed volumes. The result is a colourized volume that the radiologists are using to rapidly and accurately identify the locations and spatial interactions of different materials from their scans. Our technique is being used in an experimental post operative environment to help to evaluate the results of surgery designed to prevent the rupture of the aneurysm. In the future, we hope to use the technique during the planning of placement of support grafts prior to the actual operation.",Roger C. Tam;Christopher G. Healey;Borys Flak;Peter Cahoon,R.C. Tam;C.G. Healey;B. Flak;P. Cahoon,"Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada",10.1109/VISUAL.1996.568118;10.1109/VISUAL.1993.398874,"aneurysm, colourization, computed tomography, CT, image processing, medical imaging, scientific visualization, segmentation, volume rendering",13,1,13,
Vis,1997,Principal stream surfaces,10.1109/VISUAL.1997.663859,http://dx.doi.org/10.1109/VISUAL.1997.663859,75,80,C,"The use of stream surfaces and streamlines is well established in vector visualization. However, the proper placement of starting points is critical for these constructs to clearly illustrate the flow topology. In this paper, we present the principal stream surface algorithm, which automatically generates stream surfaces that properly depict the topology of an irrotational flow. For each velocity point in the fluid field, we construct the normal to the principal stream surface through the point. The set of all such normal vectors is used to construct the principal stream function, which is a scalar field describing the direction of velocity in the fluid field. Volume rendering can then be used to visualize the principal stream function, which is directly related to the flow topology. Thus, topology in a fluid field can be easily modeled and rendered.",Wenli Cai;Pheng-Ann Heng,Wenli Cai;Pheng-Ann Heng,"Fraunhofer Inst. for Comput. Graphics, Germany",10.1109/VISUAL.1993.398875;10.1109/VISUAL.1996.567780;10.1109/VISUAL.1992.235211;10.1109/VISUAL.1992.235225,"flow field, visualization, volume rendering, filtering",13,3,17,
Vis,1997,Image synthesis from a sparse set of views,10.1109/VISUAL.1997.663892,http://dx.doi.org/10.1109/VISUAL.1997.663892,269,275,C,"The authors present an image synthesis methodology and a system built around it. Given a sparse set of photographs taken from unknown viewpoints, the system generates images from new, different viewpoints with correct perspective, and handles occlusion. It achieves this without requiring any knowledge about the 3D structure of the scene nor the intrinsic camera parameters. The photo-realistic rendering process is polygon based and can be potentially implemented as real time texture mapping. The system is robust to noise by taking advantage of duplicate information from multiple views. They present results on several example scenes.",Qian Chen 0022;Gérard G. Medioni,Qian Chen;G. Medioni,"Univ. of Southern California, Los Angeles, CA, USA",,"image-based rendering, epipolar geometry, projective invariant, homography, Constrained Delaunay Triangulation",13,0,16,
Vis,1998,A unified approach for simplifying polygonal and spline models,10.1109/VISUAL.1998.745313,http://dx.doi.org/10.1109/VISUAL.1998.745313,271,278,C,"We present a new approach for simplifying models composed of polygons or spline patches. Given an input model, the algorithm computes a new representation of the model in terms of triangular Bezier patches. It performs a series of geometric operations, consisting of patch merging and swapping diagonals, and makes use of batch connectivity information to generate C-LODs (curved levels-of-detail). Each C-LOD is represented using cubic triangular Bezier patches. The C-LODs provide a compact representation for storing the model. The algorithm tries to minimize the surface deviation error and maintains continuity at patch boundaries. Given the CLODs, the algorithm can generate their polygonal approximations using static and dynamic tessellation schemes. It has been implemented and we highlight its performance on a number of polygonal and spline models.",Meenakshisundaram Gopi;Dinesh Manocha,M. Gopi;D. Manocha,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.1997.663909;10.1109/VISUAL.1997.663908;10.1109/VISUAL.1997.663883,"model simplification, levels-of-detail, surface approximation, spline patches, surface fitting, dynamic tessellation",13,2,32,
Vis,1998,POPTEX: Interactive ocean model visualization using texture mapping hardware,10.1109/VISUAL.1998.745346,http://dx.doi.org/10.1109/VISUAL.1998.745346,471,474,C,"Global circulation models are used to gain an understanding of the processes that affect the Earth's climate and may ultimately be used to assess the impact of humanity's activities on it. The POP ocean model developed at Los Alamos is an example of such a global circulation model that is being used to investigate the role of the ocean in the climate system. Data output from POP has traditionally been visualized using video technology which precludes rapid modification of visualization parameters and techniques. This paper describes a visualization system that leverages high speed graphics hardware, specifically texture mapping hardware, to accelerate data exploration to interactive rates. We describe the design of the system, the specific hardware features used, and provide examples of its use. The system is capable of viewing ocean circulation simulation results at up to 60 frames per second while loading texture memory at approximately 72 million texels per second.",Allen McPherson;Mathew Maltrud,A. McPherson;M. Maltrud,"Adv. Comput. Lab., Los Alamos Nat. Lab., NM, USA",10.1109/VISUAL.1990.146361;10.1109/VISUAL.1996.568149,,13,6,8,
Vis,1999,Visual debugging of visualization software: a case study for particle systems,10.1109/VISUAL.1999.809919,http://dx.doi.org/10.1109/VISUAL.1999.809919,417,554,C,"Visualization systems are complex dynamic software systems. Debugging such systems is difficult using conventional debuggers because the programmer must try to imagine the three-dimensional geometry based on a list of positions and attributes. In addition, the programmer must be able to mentally animate changes in those positions and attributes to grasp dynamic behaviors within the algorithm. We show that representing geometry, attributes, and relationships graphically permits visual pattern recognition skills to be applied to the debugging problem. The particular application is a particle system used for isosurface extraction from volumetric data. Coloring particles based on individual attributes is especially helpful when these colorings are viewed as animations over successive iterations in the program. Although we describe a particular application, the types of tools that we discuss can be applied to a variety of problems.",Patricia Crossno;Edward Angel,P. Crossno;E. Angel,"Sandia Nat. Labs., CA, USA",10.1109/VISUAL.1996.568120;10.1109/VISUAL.1997.663930,,13,7,17,
Vis,2000,A visibility determination algorithm for interactive virtual endoscopy,10.1109/VISUAL.2000.885673,http://dx.doi.org/10.1109/VISUAL.2000.885673,29,36,C,"We present a new visibility determination algorithm for interactive virtual endoscopy. The algorithm uses a modified version of template-based ray casting to extract a view dependent set of potentially visible voxels from volume data. The voxels are triangulated by Marching Cubes and the triangles are rendered onto the display by a graphics accelerator. Early ray termination and space leaping are used to accelerate the ray casting step and a quadtree subdivision algorithm is used to reduce the number of cast rays. Compared to other recently proposed rendering algorithms for virtual endoscopy, our rendering algorithm does not require a long preprocessing step or a high-end graphics workstation, but achieves interactive frame rates on a standard PC equipped with a low-cost graphics accelerator.",Rami Hietala;Jarkko Oikarinen,R. Hietala;J. Oikarinen,"Dept. of Diagnostic Radiol., Oulu Univ., Finland",10.1109/VISUAL.1997.663915;10.1109/VISUAL.1998.745337;10.1109/VISUAL.1998.745713;10.1109/VISUAL.1999.809912;10.1109/VISUAL.1999.809914,"volume visualization, template, visiblity, isosurface extraction, surface rendering",13,5,17,
Vis,2000,Interior/exterior classification of polygonal models,10.1109/VISUAL.2000.885723,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2000.885723,415,422,C,"We present an algorithm for automatically classifying the interior and exterior parts of a polygonal model. The need for visualizing the interiors of objects frequently arises in medical visualization and CAD modeling. The goal of such visualizations is to display the model in a way that the human observer can easily understand the relationship between the different parts of the surface. While there exist excellent methods for visualizing surfaces that are inside one another (nested surfaces), the determination of which parts of the surface are interior is currently done manually. Our automatic method for interior classification takes a sampling approach using a collection of direction vectors. Polygons are said to be interior to the model if they are not visible in any of these viewing directions from a point outside the model. Once we have identified polygons as being inside or outside the model, these can be textured or have different opacities applied to them so that the whole model can be rendered in a more comprehensible manner. An additional consideration for some models is that they may have holes or tunnels running through them that are connected to the exterior surface. Although an external observer can see into these holes, it is often desirable to mark the walls of such tunnels as being part of the interior of a model. In order to allow this modified classification of the interior, we use morphological operators to close all the holes of the model. An input model is used together with its closed version to provide a better classification of the portions of the original model.",Fakir S. Nooruddin;Greg Turk,F.S. Nooruddin;G. Turk,"Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA",10.1109/VISUAL.1997.663909;10.1109/VISUAL.1995.480795;10.1109/VISUAL.1996.568111,"Visibility, Surface Classification, Rendering,Interior Surfaces",13,5,0,
Vis,2000,Case study: a methodology for plume visualization with application to real-time acquisition and navigation,10.1109/VISUAL.2000.885737,http://dx.doi.org/10.1109/VISUAL.2000.885737,481,484,C,"Applications of visualization techniques that facilitate comparison of simulation and field datasets of seafloor hydrothermal plumes are demonstrated in order to explore and confirm theories of plume behavior. In comparing these datasets, there is no one-to-one correspondence. We show the comparison by performing quantitative capturing of large scale observable features. The comparisons are needed not only to improve the relevance of the simulations to the field observations, but also to enable real time adjustment of shipboard data collection systems. Our approach for comparing simulation and field datasets is to use skeletonization and centerline representation. Features representing plumes are skeletonized. Skeleton points are used to construct a centerline and to quantify plume properties on planes normal to the centerline. These skeleton points are further used to construct an idealized cone representing a plume isosurface. The difference between the plume feature and the cone is identified as protrusions of turbulent eddies. Comparison of the simulation and field data sets through these abstractions illustrates how these abstractions characterize a plume.",Karen G. Bemis;Deborah Silver;Peter A. Rona;Chengwei Feng,K.G. Bemis;D. Silver;P.A. Rona;Chengwei Feng,"Inst. of Marine & Coastal Sci., Rutgers Univ., New Brunswick, NJ, USA",10.1109/VISUAL.1998.745347;10.1109/VISUAL.1995.480789;10.1109/VISUAL.1994.346297;10.1109/VISUAL.1993.398901;10.1109/VISUAL.1996.567807,"oceanographic visualization, plume, acoustic imaging, centerlines",13,4,22,
Vis,2000,Visualizing DIII-D Tokamak magnetic field lines,10.1109/VISUAL.2000.885742,http://dx.doi.org/10.1109/VISUAL.2000.885742,501,504,C,"We demonstrate the use of a combination of perceptually effective techniques for visualizing magnetic field data from the DIII-D Tokamak. These techniques can be implemented to run very efficiently on machines with hardware support for OpenGL. Interactive speeds facilitate clear communication of magnetic field structure, enhancing fusion scientists' understanding of their data, and thereby accelerating their research.",Gregory L. Schussman;Kwan-Liu Ma;David P. Schissel;Todd Evans,G. Schussman;Kwan-Liu Ma;D. Schissel;T. Evans,"Dept. of Comput. Sci., California Univ., Davis, CA, USA",10.1109/VISUAL.1996.567777,"graphics hardware, haloed lines, illuminated lines, interactive visualization, magnetic field, plasma physics, tokamak",13,6,8,
InfoVis,2001,Case study: visualization for decision tree analysis in data mining,10.1109/INFVIS.2001.963292,http://dx.doi.org/10.1109/INFVIS.2001.963292,149,152,C,,S. Todd Barlow;Padraic Neville,T. Barlow;P. Neville,SAS Institute Inc.,,,13,8,4,
Vis,2001,Enridged Contour Maps,10.1109/VISUAL.2001.964495,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2001.964495,69,74,C,"The visualization of scalar functions of two variables is a classic and ubiquitous application. We present a new method to visualize such data. The method is based on a nonlinear mapping of the function to a height field, followed by visualization as a shaded mountain landscape. The method is easy to implement and efficient, and leads to intriguing and insightful images: The visualization is enriched by adding ridges. Three types of applications are discussed: visualization of iso-levels, clusters (multivariate data visualization), and dense contours (flow visualization).",Jarke J. van Wijk;Alexandru Telea,J.J. van Wijk;A. Telea,"Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands;Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands",10.1109/INFVIS.1995.528686;10.1109/INFVIS.1999.801860;10.1109/VISUAL.1993.398875,"Contours, mapping, height fields, multivariate visualization, flow visualization",13,4,12,
Vis,2002,GeneVis: visualization tools for genetic regulatory network dynamics,10.1109/VISUAL.2002.1183781,http://dx.doi.org/10.1109/VISUAL.2002.1183781,243,250,C,"GeneVis provides a visual environment for exploring the dynamics of genetic regulatory networks. At present time, genetic regulation is the focus of intensive research worldwide, and computational aids are being called for to help in the research of factors that are difficult to observe directly. GeneVis provides a particle-based simulation of genetic networks and visualizes the process of this simulation as it occurs. Two dynamic visualization techniques are provided, a visualization of the movement of the regulatory proteins and a visualization of the relative concentrations of these proteins. Several interactive tools relate the dynamic visualizations to the underlying genetic network structure.",Charles A. H. Baker;Sheelagh Carpendale;Przemyslaw Prusinkiewicz;Michael G. Surette,C.A.H. Baker;M.S.T. Carpendale;P. Prusinkiewicz;M.G. Surette,"Dept. of Comput. Sci., Calgary Univ., Alta., Canada;Dept. of Comput. Sci., Calgary Univ., Alta., Canada;Dept. of Comput. Sci., Calgary Univ., Alta., Canada",,"biological visualization, visualization, multi-representation, genetic networks, lenses, focus and context",13,7,19,
Vis,2002,Case study: Interactive rendering of adaptive mesh refinement data,10.1109/VISUAL.2002.1183820,http://dx.doi.org/10.1109/VISUAL.2002.1183820,521,524,C,"Adaptive mesh refinement (AMR) is a popular computational simulation technique used in various scientific and engineering fields. Although AMR data is organized in a hierarchical multi-resolution data structure, the traditional volume visualization algorithms such as ray-casting and splatting cannot handle the form without converting it to a sophisticated data structure. In this paper, we present a hierarchical multi-resolution splatting technique using k-d trees and octrees for AMR data that is suitable for implementation on the latest consumer PC graphics hardware. We describe a graphical user interface to set transfer function and viewing/rendering parameters interactively. Experimental results obtained on a general purpose PC equipped with NVIDIA GeForce card are presented to demonstrate that the technique can interactively render AMR data (over 20 frames per second). Our scheme can easily be applied to parallel rendering of time-varying AMR data.",Sanghun Park;Chandrajit L. Bajaj;Vinay Siddavanahalli,Sanghun Park;C.L. Bajaj;V. Siddavanahalli,"Texas Univ., Austin, TX, USA",10.1109/VISUAL.1993.398877,"AMR, K-d trees, Octree, Hierarchical splatting, Texture mapping",13,5,10,
Vis,2004,Generating realistic images from hydrothermal plume data,10.1109/VISUAL.2004.34,http://dx.doi.org/10.1109/VISUAL.2004.34,91,98,C,"Most data used in the study of seafloor hydrothermal plumes consists of sonar (acoustic) scans and sensor readings. Visual data captures only a portion of the sonar data range due to the prohibitive cost and physical infeasibility of taking sufficient lighting and video equipment to such extreme depths. However, visual images are available from research dives and from the recent IMAX movie, volcanoes of the deep sea. In this application paper, we apply existing lighting models with forward scattering and light attenuation to the 3D sonar data in order to mimic the visual images available. These generated images are compared to existing visual images. This can help the geoscientists understand the relationship between these different data modalities and elucidate some of the mechanisms used to capture the data.",Kristina Santilli;Karen G. Bemis;Deborah Silver;Jamshed Dastur;Peter A. Rona,K. Santilli;K. Bemis;D. Silver;J. Dastur;P. Rona,"Rutgers Univ., NJ, USA;Rutgers Univ., NJ, USA;Rutgers Univ., NJ, USA;Rutgers Univ., NJ, USA;Rutgers Univ., NJ, USA",10.1109/VISUAL.2000.885737;10.1109/VISUAL.2003.1250383;10.1109/VISUAL.1998.745347,"Applications of volume graphics and volume visualization, Earth / Space / and Environmental Sciences Visualization, PC-based volume graphics, Volume Rendering",13,9,27,
Vis,2004,ImageSurfer: a tool for visualizing correlations between two volume scalar fields,10.1109/VISUAL.2004.46,http://dx.doi.org/10.1109/VISUAL.2004.46,529,536,C,"ImageSurfer is a tool designed to explore correlations between two 3D scalar fields. Our scientific goal was to determine where a protein is located, and how much its concentration varies along the membrane of a neuronal dendrite. The 3D scalar field data sets fall into two categories: dendritic plasma membranes (defining the structure) and immunofluorescent staining (defining protein concentration along the structure). ImageSurfer enables scientists to analyze relationships between multiple data sets obtained with confocal microscopy by providing 3D surface view, height field, and graphing tools. Each tool reduces the complexity of the problem by extracting a restricted subset of data: finding a region of interest in 3D; getting a sense of relative concentrations in 2D, and getting exact concentration values in 1D. The current design is presented, along with the rationale for each design decision. The tool is already proving useful for data exploration, analysis, and presentation.",Dennis Jen;Peter Parente;Jonathan Robbins;Chris Weigle;Russell M. Taylor II;Alain Burette;Richard Weinberg,D. Jen;P. Parente;J. Robbins;C. Weigle;R.M. Taylor;A. Burette;R. Weinberg,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.2001.964519;10.1109/VISUAL.1996.568133;10.1109/VISUAL.2000.885735,"scientific visualization, volume visualization, data exploration, biology, confocal microscopy, immunofluorescence",13,4,17,
Vis,2004,Interactive thickness visualization of articular cartilage,10.1109/VISUAL.2004.56,http://dx.doi.org/10.1109/VISUAL.2004.56,521,527,C,"This work describes a method to visualize the thickness of curved thin objects. Given the MRI volume data of articular cartilage, medical doctors investigate pathological changes of the thickness. Since the tissue is very thin, it is impossible to reliably map the thickness information by direct volume rendering. Our idea is based on unfolding of such structures preserving their thickness. This allows to perform anisotropic geometrical operations (e.g., scaling the thickness). However, flattening of a curved structure implies a distortion of its surface. The distortion problem is alleviated through a focus-and-context minimization approach. Distortion is smallest close to a focal point which can be interactively selected by the user.",Matej Mlejnek;Anna Vilanova;M. Eduard Gröller,M. Mlejnek;A. Vilanova;M.E. Groller,"ICGA, Vienna Univ. of Technol., Austria",10.1109/VISUAL.2002.1183795;10.1109/VISUAL.2002.1183754;10.1109/VISUAL.2001.964540,"visualization in medicine, applications of visualization",13,7,23,
Vis,2005,Hardware-accelerated simulated radiography,10.1109/VISUAL.2005.1532815,http://dx.doi.org/10.1109/VISUAL.2005.1532815,343,350,C,"We present the application of hardware accelerated volume rendering algorithms to the simulation of radiographs as an aid to scientists designing experiments, validating simulation codes, and understanding experimental data. The techniques presented take advantage of 32-bit floating point texture capabilities to obtain solutions to the radiative transport equation for X-rays. The hardware accelerated solutions are accurate enough to enable scientists to explore the experimental design space with greater efficiency than the methods currently in use. An unsorted hexahedron projection algorithm is presented for curvilinear hexahedral meshes that produces simulated radiographs in the absorption-only regime. A sorted tetrahedral projection algorithm is presented that simulates radiographs of emissive materials. We apply the tetrahedral projection algorithm to the simulation of experimental diagnostics for inertial confinement fusion experiments on a laser at the University of Rochester.",Daniel E. Laney;Steven P. Callahan;Nelson L. Max;Cláudio T. Silva;Steven Langer;Randall Frank,D. Laney;S.P. Callahan;N. Max;C.T. Silva;S. Langer;R. Frank,"Lawrence Livermore Nat. Lab., Berkeley, CA, USA",10.1109/VISUAL.2000.885683;10.1109/VISUAL.2004.85;10.1109/VISUAL.2003.1250390," volume rendering, hardware acceleration",13,6,20,
Vis,2005,Profile Flags: a novel metaphor for probing of T₂ maps,10.1109/VISUAL.2005.1532847,http://dx.doi.org/10.1109/VISUAL.2005.1532847,599,606,C,"This paper describes a tool for the visualization of T/sub 2/ maps of knee cartilage. Given the anatomical scan, and the T/sub 2/ map of the cartilage, we combine the information on the shape and the quality of the cartilage in a single image. The Profile Flag is an intuitive 3D glyph for probing and annotating of the underlying data. It comprises a bulletin board pin-like shape with a small flag on top of it. While moving the glyph along the reconstructed surface of an object, the curve data measured along the pin's needle and in its neighborhood are shown on the flag. The application area of the Profile Flag is manifold, enabling the visualization of profile data of dense but in-homogeneous objects. Furthermore, it extracts the essential part of the data without removing or even reducing the context information. By sticking Profile Flags into the investigated structure, one or more significant locations can be annotated by showing the local characteristics of the data at that locations. In this paper we are demonstrating the properties of the tool by visualizing T/sub 2/ maps of knee cartilage.",Matej Mlejnek;Pierre Ermes;Anna Vilanova;Rob van der Rijt;Harrie van den Bosch;Frans A. Gerritsen;M. Eduard Gröller,M. Mlejnek;P. Ermest;A. Vilanova;R. van der Rijt;H. van den Bosch;F. Gerritsen;M.E. Groller,"Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria",10.1109/VISUAL.2000.885733;10.1109/VISUAL.1993.398849;10.1109/VISUAL.2002.1183752;10.1109/VISUAL.2004.56,"visualization in medicine, applications of visualization",13,4,19,
VAST,2006,Scentindex: Conceptually Reorganizing Subject Indexes for Reading,10.1109/VAST.2006.261418,http://dx.doi.org/10.1109/VAST.2006.261418,159,166,C,"A great deal of analytical work is done in the context of reading, in digesting the semantics of the material, the identification of important entities, and capturing the relationship between entities. Visual analytic environments, therefore, must encompass reading tools that enable the rapid digestion of large amount of reading material. Other than plain text search, subject indexes, and basic highlighting, tools are needed for rapid foraging of text. In this paper, we describe a technique that presents an enhanced subject index for a book by conceptually reorganizing it to suit particular expressed user information needs. Users first enter information needs via keywords describing the concepts they are trying to retrieve and comprehend. Then our system, called ScentIndex, computes what index entries are conceptually related and reorganizes and displays these index entries on a single page. We also provide a number of navigational cues to help users peruse over this list of index entries and find relevant passages quickly. Compared to regular reading of a paper book, our study showed that users are more efficient and more accurate in finding, comparing, and comprehending material in our system",Ed H. Chi;Lichan Hong;Julie Heiser;Stuart K. Card,Ed H. Chi;Lichan Hong;Julie Heiser;Stuart K. Card,"Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA 94304. echi@parc.com;Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA 94304. hong@parc.com;Adobe Systems, 321 Park Ave., San Jose, CA 95110, julie.heiser@adobe.com;Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA 94304. card@parc.com",,"Book Index, eBooks, Information Scent, contextualization, personalized information access",13,1,37,
VAST,2006,User Interfaces for the Exploration of Hierarchical Multi-dimensional Data,10.1109/VAST.2006.261422,http://dx.doi.org/10.1109/VAST.2006.261422,175,182,C,"A variety of user interfaces have been developed to support the querying of hierarchical multi-dimensional data in an OLAP setting such as pivot tables and Polaris. They are used to regularly check portions of a dataset and to explore a new dataset for the first time. In this paper, we establish criteria for OLAP user interface capabilities to facilitate comparison. Two criteria are the number of displayed dimensions along which comparisons can be made and the number of dimensions that are viewable at once - visual comparison depth and width. We argue that interfaces with greater visual comparison depth support regular checking of known data by users that know roughly where to look, while interfaces with greater comparison width support exploration of new data by users that have no a priori starting point and need to scan all dimensions. Pivot tables and Polaris are examples of the former. The main contribution of this paper is to introduce a new scalable interface that uses parallel dimension axis which supports the latter, greater visual comparison width. We compare our approach to both table based and parallel coordinate based interfaces. We present an implementation of our interface SGViewer, user scenarios and provide an evaluation that supports the usability of our interface",Mark Sifer,Mark Sifer,"School of Economics & Information Systems, University of Wollongong, Australia. msifer@uow.edu.au",10.1109/INFVIS.2002.1173157;10.1109/INFVIS.2005.1532139,"Data exploration, OLAP, visualization, parallel coordinates",13,6,20,
VAST,2007,Balancing Interactive Data Management of Massive Data with Situational Awareness through Smart Aggregation,10.1109/VAST.2007.4388998,http://dx.doi.org/10.1109/VAST.2007.4388998,67,74,C,"Designing a visualization system capable of processing, managing, and presenting massive data sets while maximizing the user's situational awareness (SA) is a challenging, but important, research question in visual analytics. Traditional data management and interactive retrieval approaches have often focused on solving the data overload problem at the expense of the user's SA. This paper discusses various data management strategies and the strengths and limitations of each approach in providing the user with SA. A new data management strategy, coined Smart Aggregation, is presented as a powerful approach to overcome the challenges of both massive data sets and maintaining SA. By combining automatic data aggregation with user-defined controls on what, how, and when data should be aggregated, we present a visualization system that can handle massive amounts of data while affording the user with the best possible SA. This approach ensures that a system is always usable in terms of both system resources and human perceptual resources. We have implemented our Smart Aggregation approach in a visual analytics system called VIAssist (Visual Assistant for Information Assurance Analysis) to facilitate exploration, discovery, and SA in the domain of Information Assurance.",Daniel R. Tesone;John R. Goodall,Daniel R. Tesone;John R. Goodall,"Secure Decisions, a division of Applied Visions Inc. e-mail: dant@securedecisions.avi.com;Secure Decisions, a division of Applied Visions Inc. e-mail: johng@securedecisions.avi.com",10.1109/VAST.2006.261437;10.1109/VISUAL.2005.1532792;10.1109/INFVIS.2004.10,"Data management, visual analytics, data retrieval, information visualization, smart aggregation, situational awareness",13,11,9,
VAST,2007,Jigsaw meets Blue Iguanodon - The VAST 2007 Contest,10.1109/VAST.2007.4389034,http://dx.doi.org/10.1109/VAST.2007.4389034,235,236,M,"This article describes our use of the Jigsaw system in working on the VAST 2007 contest. Jigsaw provides multiple views of a document collection and the individual entities within those documents, with a particular focus on exposing connections between entities. We describe how we refined the identified entities in order to better facilitate Jigsaw's use and how the different views helped us to uncover key parts of the underlying plot.",Carsten Görg;Zhicheng Liu;Neel Parekh;Kanupriyah Singhal;John T. Stasko,Carsten Gorg;Zhicheng Liu;Neel Parekh;Kanupriya Singhal;John Stasko,"School of Interactive Computing & GVU Center, Georgia Institute of Technology. e-mail: goerg@cc.gatech.edu;School of Interactive Computing & GVU Center, Georgia Institute of Technology. e-mail: zcliu@cc.gatech.edu;School of Interactive Computing & GVU Center, Georgia Institute of Technology. e-mail: justneel@gmail.com;School of Interactive Computing & GVU Center, Georgia Institute of Technology. e-mail: ksinghal@cc.gatech.edu;School of Interactive Computing & GVU Center, Georgia Institute of Technology. e-mail: stasko@cc.gatech.edu",,,13,10,2,
Vis,2007,Construction of Simplified Boundary Surfaces from Serial-sectioned Metal Micrographs,10.1109/TVCG.2007.70543,http://dx.doi.org/10.1109/TVCG.2007.70543,1528,1535,J,We present a method for extracting boundary surfaces from segmented cross-section image data. We use a constrained Potts model to interpolate an arbitrary number of region boundaries between segmented images. This produces a segmented volume from which we extract a triangulated boundary surface using well-known marching tetrahedra methods. This surface contains staircase-like artifacts and an abundance of unnecessary triangles. We describe an approach that addresses these problems with a voxel-accurate simplification algorithm that reduces surface complexity by an order of magnitude. Our boundary interpolation and simplification methods are novel contributions to the study of surface extraction from segmented cross-sections. We have applied our method to construct polycrystal grain boundary surfaces from micrographs of a sample of the metal tantalum.,Scott E. Dillard;John Bingert;Dan Thoma;Bernd Hamann,Scott Dillard;John Bingert;Dan Thoma;Bernd Hamann,"Institute for Data Analysis and Visualization (IDAV), University of California, Davis;Materials Science and Technology Division, Los Alamos National Laboratory;Materials Design Institute, Los Alamos National Laboratory;Institute for Data Analysis and Visualization (IDAV), and the Department of Computer Science, University of California, Davis",10.1109/VISUAL.2000.885706;10.1109/VISUAL.2005.1532823;10.1109/VISUAL.1997.663887,"Surface extraction, Polygonal meshes, Visualization in Physical Sciences, Life Sciences and Engineering",13,17,31,
Vis,2008,Effective Visualization of Short Routes,10.1109/TVCG.2008.124,http://dx.doi.org/10.1109/TVCG.2008.124,1452,1458,J,"In this work we develop a new alternative to conventional maps for visualization of relatively short paths as they are frequently encountered in hotels, resorts or museums. Our approach is based on a warped rendering of a 3D model of the environment such that the visualized path appears to be straight even though it may contain several junctions. This has the advantage that the beholder of the image gains a realistic impression of the surroundings along the way which makes it easy to retrace the route in practice. We give an intuitive method for generation of such images and present results from user studies undertaken to evaluate the benefit of the warped images for orientation in unknown environments.",Patrick Degener;Ruwen Schnabel;Christopher Schwartz;Reinhard Klein,Patrick Degener;Ruwen Schnabel;Christopher Schwartz;Reinhard Klein,University of Bonn;University of Bonn;University of Bonn;University of Bonn,,"Maps, Route visualization, Space deformation",13,10,32,
VAST,2010,A visual analytics approach to model learning,10.1109/VAST.2010.5652484,http://dx.doi.org/10.1109/VAST.2010.5652484,67,74,C,"The process of learning models from raw data typically requires a substantial amount of user input during the model initialization phase. We present an assistive visualization system which greatly reduces the load on the users and makes the process of model initialization and refinement more efficient, problem-driven, and engaging. Utilizing a sequence segmentation task with a Hidden Markov Model as an example, we assign each token in the sequence a feature vector based on its various properties within the sequence. These vectors are then clustered according to similarity, generating a layout of the individual tokens in form of a node link diagram where the length of the links is determined by the feature vector similarity. Users may then tune the weights of the feature vector components to improve the segmentation, which is visualized as a better separation of the clusters. Also, as individual clusters represent different classes, the user can now work at the cluster level to define token classes, instead of labelling one entry at time. Inconsistent entries visually identify themselves by locating at the periphery of clusters, and the user then helps refine the model by resolving these inconsistencies. Our system therefore makes efficient use of the knowledge of its users, only requesting user assistance for non-trivial data items. It so allows users to visually analyse data at a higher, more abstract level, improving scalability.",Supriya Garg;I. V. Ramakrishnan;Klaus Mueller,Supriya Garg;I. V. Ramakrishnan;Klaus Mueller,"Computer Science Department, Stony Brook University;Computer Science Department, Stony Brook University;Computer Science Department, Stony Brook University",10.1109/VAST.2008.4677352;10.1109/VAST.2008.4677350;10.1109/VAST.2009.5332584;10.1109/VAST.2007.4388990;10.1109/VAST.2009.5333428;10.1109/TVCG.2007.70592,"Visual Knowledge Discovery, Visual Knowledge Representation, Data Clustering, Human-Computer Interaction",13,9,20,
VAST,2010,Multidimensional data dissection using attribute relationship graphs,10.1109/VAST.2010.5652520,http://dx.doi.org/10.1109/VAST.2010.5652520,75,82,C,"Visual exploration and analysis is a process of discovering and dissecting the abundant and complex attribute relationships that pervade multidimensional data. Recent research has identified and characterized patterns of multiple coordinated views, such as cross-filtered views, in which rapid sequences of simple interactions can be used to express queries on subsets of attribute values. In visualizations designed around these patterns, for the most part, distinct views serve to visually isolate each attribute from the others. Although the brush-and-click simplicity of visual isolation facilitates discovery of many-to-many relationships between attributes, dissecting these relationships into more fine-grained one-to-many relationships is interactively tedious and, worse, visually fragmented over prolonged sequences of queries. This paper describes: (1) a method for interactively dissecting multidimensional data by iteratively slicing and manipulating a multigraph representation of data values and value co-occurrences; and (2) design strategies for extending the construction of coordinated multiple view interfaces for dissection as well as discovery of attribute relationships in multidimensional data sets. Using examples from different domains, we describe how attribute relationship graphs can be combined with cross-filtered views, modularized for reuse across designs, and integrated into broader visual analysis tools. The exploratory and analytic utility of these examples suggests that an attribute relationship graph would be a useful addition to a wide variety of visual analysis tools.",Chris Weaver,Chris Weaver,School of Computer Science and Center for Spatial Analysis The University of Oklahoma,10.1109/TVCG.2008.137;10.1109/TVCG.2006.122;10.1109/VAST.2006.261432;10.1109/INFVIS.2004.12;10.1109/TVCG.2006.178;10.1109/INFVIS.2002.1173158;10.1109/VISUAL.1994.346302;10.1109/INFVIS.1998.729560;10.1109/TVCG.2007.70582;10.1109/TVCG.2007.70594;10.1109/VAST.2007.4389006;10.1109/INFVIS.2005.1532129;10.1109/INFVIS.2004.64,,13,10,37,
VAST,2010,"Geo-historical context support for information foraging and sensemaking: Conceptual model, implementation, and assessment",10.1109/VAST.2010.5652895,http://dx.doi.org/10.1109/VAST.2010.5652895,139,146,C,"Information foraging and sensemaking with heterogeneous information are context-dependent activities. Thus visual analytics tools to support these activities must incorporate context. But, context is a difficult concept to define, model, and represent. Creating and representing context in support of visually-enabled reasoning about complex problems with complex information is a complementary but different challenge than that addressed in context-aware computing. In the latter, the goal is automated adaptation of the system to meet user needs for applications such as mobile location-based services where information about the location, the user, and the user goals filters what gets presented on a small mobile device. In contrast, for visual analytics-enabled information foraging and sensemaking, the user is likely to take an active role in foraging for the contextual information needed to support sensemaking in relation to some multifaceted problem. In this paper, we address the challenges of constructing and representing context within visual interfaces that support analytical reasoning in crisis management and humanitarian relief. The challenges stem from the diverse forms of information that can provide context and difficulty in defining and operationalizing context itself. Here, we pay particular attention to document foraging to support construction of the geographic and historical context within which monitoring and sensemaking can be carried out. Specifically, we present the concept of geo-historical context (GHC) and outline an empirical assessment of both the concept and its implementation in the Context Discovery Application, a web-based tool that supports document foraging and sensemaking.",Brian M. Tomaszewski;Alan M. MacEachren,Brian Tomaszewski;Alan M. MacEachren,"Department of Information Sciences and Technologies, Rochester Institute of Technology;GeoVISTA Center, Dept. of Geography, The Pennsylvania State University",,"context, foraging, sensemaking, mapping, text analysis, geographic information retrieval",13,7,32,
Vis,2010,Fast High-Quality Volume Ray Casting with Virtual Samplings,10.1109/TVCG.2010.155,http://dx.doi.org/10.1109/TVCG.2010.155,1525,1532,J,"Volume ray-casting with a higher order reconstruction filter and/or a higher sampling rate has been adopted in direct volume rendering frameworks to provide a smooth reconstruction of the volume scalar and/or to reduce artifacts when the combined frequency of the volume and transfer function is high. While it enables high-quality volume rendering, it cannot support interactive rendering due to its high computational cost. In this paper, we propose a fast high-quality volume ray-casting algorithm which effectively increases the sampling rate. While a ray traverses the volume, intensity values are uniformly reconstructed using a high-order convolution filter. Additional samplings, referred to as virtual samplings, are carried out within a ray segment from a cubic spline curve interpolating those uniformly reconstructed intensities. These virtual samplings are performed by evaluating the polynomial function of the cubic spline curve via simple arithmetic operations. The min max blocks are refined accordingly for accurate empty space skipping in the proposed method. Experimental results demonstrate that the proposed algorithm, also exploiting fast cubic texture filtering supported by programmable GPUs, offers renderings as good as a conventional ray-casting algorithm using high-order reconstruction filtering at the same sampling rate, while delivering 2.5x to 3.3x rendering speed-up.",Byeonghun Lee;Jihye Yun;Jinwook Seo;Byonghyo Shim;Yeong-Gil Shin;Bo Hyoung Kim,Byeonghun Lee;Jihye Yun;Jinwook Seo;Byonghyo Shim;Yeong-Gil Shin;Bohyoung Kim,"Seoul National University, Seoul, Korea;Seoul National University, Seoul, Korea;Seoul National University, Seoul, Korea;Korea University, Seoul, Korea;Seoul National University, Seoul, Korea;Seoul National University, Seoul, Korea",10.1109/VISUAL.1994.346331;10.1109/VISUAL.2004.70;10.1109/VISUAL.2005.1532810;10.1109/TVCG.2009.204;10.1109/VISUAL.2003.1250384,"Direct volume rendering, GPU, high quality, curve interpolation",13,12,23,
VAST,2011,Obvious: A meta-toolkit to encapsulate information visualization toolkits - One toolkit to bind them all,10.1109/VAST.2011.6102446,http://dx.doi.org/10.1109/VAST.2011.6102446,91,100,C,"This article describes “Obvious”: a meta-toolkit that abstracts and encapsulates information visualization toolkits implemented in the Java language. It intends to unify their use and postpone the choice of which concrete toolkit(s) to use later-on in the development of visual analytics applications. We also report on the lessons we have learned when wrapping popular toolkits with Obvious, namely Prefuse, the InfoVis Toolkit, partly Improvise, JUNG and other data management libraries. We show several examples on the uses of Obvious, how the different toolkits can be combined, for instance sharing their data models. We also show how Weka and Rapid-Miner, two popular machine-learning toolkits, have been wrapped with Obvious and can be used directly with all the other wrapped toolkits. We expect Obvious to start a co-evolution process: Obvious is meant to evolve when more components of Information Visualization systems will become consensual. It is also designed to help information visualization systems adhere to the best practices to provide a higher level of interoperability and leverage the domain of visual analytics.",Jean-Daniel Fekete;Pierre-Luc Hemery;Thomas Baudel;Jo Wood,Jean-Daniel Fekete;Pierre-Luc Hémery;Thomas Baudel;Jo Wood,"INRIA, France;INRIA, France;IBM, USA;City University, London, USA",10.1109/INFVIS.2004.12;10.1109/TVCG.2009.152;10.1109/TVCG.2009.174;10.1109/TVCG.2006.178;10.1109/TVCG.2010.159;10.1109/INFVIS.2004.64;10.1109/INFVIS.1998.729560;10.1109/INFVIS.2002.1173148,,13,7,42,
InfoVis,2012,Capturing the Design Space of Sequential Space-filling Layouts,10.1109/TVCG.2012.205,http://dx.doi.org/10.1109/TVCG.2012.205,2593,2602,J,"We characterize the design space of the algorithms that sequentially tile a rectangular area with smaller, fixed-surface, rectangles. This space consist of five independent dimensions: Order, Size, Score, Recurse and Phrase. Each of these dimensions describe a particular aspect of such layout tasks. This class of layouts is interesting, because, beyond encompassing simple grids, tables and trees, it also includes all kinds of treemaps involving the placement of rectangles. For instance, Slice and dice, Squarified, Strip and Pivot layouts are various points in this five dimensional space. Many classic statistics visualizations, such as 100% stacked bar charts, mosaic plots and dimensional stacking, are also instances of this class. A few new and potentially interesting points in this space are introduced, such as spiral treemaps and variations on the strip layout. The core algorithm is implemented as a JavaScript prototype that can be used as a layout component in a variety of InfoViz toolkits.",Thomas Baudel;Bertjan Broeksema,Thomas Baudel;Bertjan Broeksema,IBM;IBM,10.1109/VISUAL.1991.175815;10.1109/TVCG.2006.178;10.1109/VISUAL.1990.146386;10.1109/TVCG.2006.200;10.1109/TVCG.2011.227;10.1109/INFVIS.1998.729560;10.1109/TVCG.2010.186;10.1109/TVCG.2008.165;10.1109/TVCG.2009.128,"Layout, visualization models, tables & tree layouts, grids, treemaps, mosaic plots, dimensional stacking",13,15,29,
SciVis,2012,A Visual Analysis Concept for the Validation of Geoscientific Simulation Models,10.1109/TVCG.2012.190,http://dx.doi.org/10.1109/TVCG.2012.190,2216,2225,J,"Geoscientific modeling and simulation helps to improve our understanding of the complex Earth system. During the modeling process, validation of the geoscientific model is an essential step. In validation, it is determined whether the model output shows sufficient agreement with observation data. Measures for this agreement are called goodness of fit. In the geosciences, analyzing the goodness of fit is challenging due to its manifold dependencies: 1) The goodness of fit depends on the model parameterization, whose precise values are not known. 2) The goodness of fit varies in space and time due to the spatio-temporal dimension of geoscientific models. 3) The significance of the goodness of fit is affected by resolution and preciseness of available observational data. 4) The correlation between goodness of fit and underlying modeled and observed values is ambiguous. In this paper, we introduce a visual analysis concept that targets these challenges in the validation of geoscientific models - specifically focusing on applications where observation data is sparse, unevenly distributed in space and time, and imprecise, which hinders a rigorous analytical approach. Our concept, developed in close cooperation with Earth system modelers, addresses the four challenges by four tailored visualization components. The tight linking of these components supports a twofold interactive drill-down in model parameter space and in the set of data samples, which facilitates the exploration of the numerous dependencies of the goodness of fit. We exemplify our visualization concept for geoscientific modeling of glacial isostatic adjustments in the last 100,000 years, validated against sea levels indicators - a prominent example for sparse and imprecise observation data. An initial use case and feedback from Earth system modelers indicate that our visualization concept is a valuable complement to the range of validation methods.",Andrea Unger;Sven Schulte;Volker Klemann;Doris Dransch,Andrea Unger;Sven Schulte;Volker Klemann;Doris Dransch,"GFZ German Reserach Center For Geosciences, Potsdam, Germany;Magdeburg-Stendal University of Applied Sciences, Germany;National Oceanography Centre, Liverpool, UK;GFZ German Reserach Center For Geosciences, Potsdam, Germany",10.1109/TVCG.2010.192;10.1109/VAST.2010.5652895;10.1109/TVCG.2011.248;10.1109/TVCG.2008.145;10.1109/TVCG.2011.225;10.1109/TVCG.2010.223;10.1109/TVCG.2010.171;10.1109/TVCG.2010.190;10.1109/VISUAL.1993.398859;10.1109/TVCG.2010.181;10.1109/TVCG.2008.139,"Earth science visualization, model validation, coordinated multiple views, spatio-temporal visualization, sea level indicators",13,19,41,
SciVis,2012,Evaluation of Fast-Forward Video Visualization,10.1109/TVCG.2012.222,http://dx.doi.org/10.1109/TVCG.2012.222,2095,2103,J,"We evaluate and compare video visualization techniques based on fast-forward. A controlled laboratory user study (n = 24) was conducted to determine the trade-off between support of object identification and motion perception, two properties that have to be considered when choosing a particular fast-forward visualization. We compare four different visualizations: two representing the state-of-the-art and two new variants of visualization introduced in this paper. The two state-of-the-art methods we consider are frame-skipping and temporal blending of successive frames. Our object trail visualization leverages a combination of frame-skipping and temporal blending, whereas predictive trajectory visualization supports motion perception by augmenting the video frames with an arrow that indicates the future object trajectory. Our hypothesis was that each of the state-of-the-art methods satisfies just one of the goals: support of object identification or motion perception. Thus, they represent both ends of the visualization design. The key findings of the evaluation are that object trail visualization supports object identification, whereas predictive trajectory visualization is most useful for motion perception. However, frame-skipping surprisingly exhibits reasonable performance for both tasks. Furthermore, we evaluate the subjective performance of three different playback speed visualizations for adaptive fast-forward, a subdomain of video fast-forward.",Markus Höferlin;Kuno Kurzhals;Benjamin Höferlin;Gunther Heidemann;Daniel Weiskopf,Markus Höferlin;Kuno Kurzhals;Benjamin Höferlin;Gunther Heidemann;Daniel Weiskopf,"Visualization Research Center (VISUS), University of Stuttgart;Visualization Research Center (VISUS), University of Stuttgart;Computer Vision Group, Institute of Cognitive Science, University of Osnabrück;Computer Vision Group, Institute of Cognitive Science, University of Osnabrück;Visualization Research Center (VISUS), University of Stuttgart",10.1109/TVCG.2007.70542;10.1109/TVCG.2007.70617;10.1109/TVCG.2008.125;10.1109/TVCG.2007.70539;10.1109/TVCG.2006.194,"Video visualization, adaptive fast-forward, controlled laboratory user study",13,12,38,
SciVis,2012,Structure-Aware Lighting Design for Volume Visualization,10.1109/TVCG.2012.267,http://dx.doi.org/10.1109/TVCG.2012.267,2372,2381,J,"Lighting design is a complex, but fundamental, problem in many fields. In volume visualization, direct volume rendering generates an informative image without external lighting, as each voxel itself emits radiance. However, external lighting further improves the shape and detail perception of features, and it also determines the effectiveness of the communication of feature information. The human visual system is highly effective in extracting structural information from images, and to assist it further, this paper presents an approach to structure-aware automatic lighting design by measuring the structural changes between the images with and without external lighting. Given a transfer function and a viewpoint, the optimal lighting parameters are those that provide the greatest enhancement to structural information - the shape and detail information of features are conveyed most clearly by the optimal lighting parameters. Besides lighting goodness, the proposed metric can also be used to evaluate lighting similarity and stability between two sets of lighting parameters. Lighting similarity can be used to optimize the selection of multiple light sources so that different light sources can reveal distinct structural information. Our experiments with several volume data sets demonstrate the effectiveness of the structure-aware lighting design approach. It is well suited to use by novices as it requires little technical understanding of the rendering parameters associated with direct volume rendering.",Yubo Tao;Hai Lin 0003;Feng Dong;Chao Wang 0063;Gordon Clapworthy;Hujun Bao,Yubo Tao;Hai Lin;Feng Dong;Chao Wang;Gordon Clapworthy;Hujun Bao,"State Key Lab of CAD&CG, Zhejiang University, P.R. China;State Key Lab of CAD&CG, Zhejiang University, P.R. China;University of Bedfordshire, UK;University of Bedfordshire, UK;University of Bedfordshire, UK;State Key Lab of CAD&CG, Zhejiang University, P.R. China",10.1109/TVCG.2006.137;10.1109/TVCG.2011.218;10.1109/VISUAL.2004.62;10.1109/VISUAL.2005.1532834;10.1109/VISUAL.2005.1532833;10.1109/VISUAL.2003.1250395;10.1109/VISUAL.2002.1183785,"Automatic lighting design, structural dissimilarity, lighting similarity, lighting stability, volume rendering",13,10,29,
SciVis,2013,Adaptive Refinement of the Flow Map Using Sparse Samples,10.1109/TVCG.2013.128,http://dx.doi.org/10.1109/TVCG.2013.128,2753,2762,J,"We present a new efficient and scalable method for the high quality reconstruction of the flow map from sparse samples. The flow map describes the transport of massless particles along the flow. As such, it is a fundamental concept in the analysis of transient flow phenomena and all so-called Lagrangian flow visualization techniques require its approximation. The flow map is generally obtained by integrating a dense 1D, 2D, or 3D set of particles across the domain of definition of the flow. Despite its embarrassingly parallel nature, this computation creates a performance bottleneck in the analysis of large-scale datasets that existing adaptive techniques alleviate only partially. Our iterative approximation method significantly improves upon the state of the art by precisely modeling the flow behavior around automatically detected geometric structures embedded in the flow, thus effectively restricting the sampling effort to interesting regions. Our data reconstruction is based on a modified version of Sibson's scattered data interpolation and allows us at each step to offer an intermediate dense approximation of the flow map and to seamlessly integrate regions that will be further refined in subsequent steps. We present a quantitative and qualitative evaluation of our method on different types of flow datasets and offer a detailed comparison with existing techniques.",Samer S. Barakat;Xavier Tricoche,Samer S. Barakat;Xavier Tricoche,Purdue University;Purdue University,10.1109/TVCG.2009.190;10.1109/TVCG.2008.133;10.1109/TVCG.2007.70554;10.1109/TVCG.2007.70551,"Lagrangian flow visualization, flow map, edge features, scattered data interpolation, sparse sampling, adaptive refinement, parallel reconstruction",13,16,40,HM
VAST,2013,The Impact of Physical Navigation on Spatial Organization for Sensemaking,10.1109/TVCG.2013.205,http://dx.doi.org/10.1109/TVCG.2013.205,2207,2216,J,"Spatial organization has been proposed as a compelling approach to externalizing the sensemaking process. However, there are two ways in which space can be provided to the user: by creating a physical workspace that the user can interact with directly, such as can be provided by a large, high-resolution display, or through the use of a virtual workspace that the user navigates using virtual navigation techniques such as zoom and pan. In this study we explicitly examined the use of spatial sensemaking techniques within these two environments. The results demonstrate that these two approaches to providing sensemaking space are not equivalent, and that the greater embodiment afforded by the physical workspace changes how the space is perceived and used, leading to increased externalization of the sensemaking process.",Christopher Andrews;Chris North 0001,Christopher Andrews;Chris North,Middlebury College;Virginia Tech,10.1109/VAST.2012.6400559;10.1109/VAST.2008.4677358;10.1109/VAST.2009.5333878,"Sensemaking, visual analytics, physical navigation, embodiment, large and high-resolution displays",13,9,32,
SciVis,2014,Sparse PDF Volumes for Consistent Multi-Resolution Volume Rendering,10.1109/TVCG.2014.2346324,http://dx.doi.org/10.1109/TVCG.2014.2346324,2417,2426,J,"This paper presents a new multi-resolution volume representation called sparse pdf volumes, which enables consistent multi-resolution volume rendering based on probability density functions (pdfs) of voxel neighborhoods. These pdfs are defined in the 4D domain jointly comprising the 3D volume and its 1D intensity range. Crucially, the computation of sparse pdf volumes exploits data coherence in 4D, resulting in a sparse representation with surprisingly low storage requirements. At run time, we dynamically apply transfer functions to the pdfs using simple and fast convolutions. Whereas standard low-pass filtering and down-sampling incur visible differences between resolution levels, the use of pdfs facilitates consistent results independent of the resolution level used. We describe the efficient out-of-core computation of large-scale sparse pdf volumes, using a novel iterative simplification procedure of a mixture of 4D Gaussians. Finally, our data structure is optimized to facilitate interactive multi-resolution volume rendering on GPUs.",Ronell Sicat;Jens H. Krüger;Torsten Möller;Markus Hadwiger,Ronell Sicat;Jens Krüger;Torsten Möller;Markus Hadwiger,King Abdullah University of Science and Technology (KAUST);University of Duisburg-Essen;University of Vienna;King Abdullah University of Science and Technology (KAUST),10.1109/TVCG.2006.143;10.1109/TVCG.2012.240;10.1109/VISUAL.1999.809908,"Multi-resolution representations, sparse approximation, pursuit algorithms, large-scale volume rendering",13,16,40,
SciVis,2014,Attractive Flicker: Guiding Attention in Dynamic Narrative Visualizations,10.1109/TVCG.2014.2346352,http://dx.doi.org/10.1109/TVCG.2014.2346352,2456,2465,J,"Focus-context techniques provide visual guidance in visualizations by giving strong visual prominence to elements of interest while the context is suppressed. However, finding a visual feature to enhance for the focus to pop out from its context in a large dynamic scene, while leading to minimal visual deformation and subjective disturbance, is challenging. This paper proposes Attractive Flicker, a novel technique for visual guidance in dynamic narrative visualizations. We first show that flicker is a strong visual attractor in the entire visual field, without distorting, suppressing, or adding any scene elements. The novel aspect of our Attractive Flicker technique is that it consists of two signal stages: The first “orientation stage” is a short but intensive flicker stimulus to attract the attention to elements of interest. Subsequently, the intensive flicker is reduced to a minimally disturbing luminance oscillation (“engagement stage”) as visual support to keep track of the focus elements. To find a good trade-off between attraction effectiveness and subjective annoyance caused by flicker, we conducted two perceptual studies to find suitable signal parameters. We showcase Attractive Flicker with the parameters obtained from the perceptual statistics in a study of molecular interactions. With Attractive Flicker, users were able to easily follow the narrative of the visualization on a large display, while the flickering of focus elements was not disturbing when observing the context.",Manuela Waldner;Mathieu Le Muzic;Matthias Bernhard;Werner Purgathofer;Ivan Viola,Manuela Waldner;Mathieu Le Muzic;Matthias Bernhard;Werner Purgathofer;Ivan Viola,Vienna University of Technology;Vienna University of Technology;Vienna University of Technology;Vienna University of Technology;Vienna University of Technology,10.1109/TVCG.2009.185;10.1109/VISUAL.1995.480802;10.1109/VISUAL.2005.1532838;10.1109/TVCG.2010.179;10.1109/TVCG.2011.183;10.1109/TVCG.2006.174,"Visual attention, flicker, narrative visualization",13,12,48,
VAST,2014,Visual Reconciliation of Alternative Similarity Spaces in Climate Modeling,10.1109/TVCG.2014.2346755,http://dx.doi.org/10.1109/TVCG.2014.2346755,1923,1932,J,"Visual data analysis often requires grouping of data objects based on their similarity. In many application domains researchers use algorithms and techniques like clustering and multidimensional scaling to extract groupings from data. While extracting these groups using a single similarity criteria is relatively straightforward, comparing alternative criteria poses additional challenges. In this paper we define visual reconciliation as the problem of reconciling multiple alternative similarity spaces through visualization and interaction. We derive this problem from our work on model comparison in climate science where climate modelers are faced with the challenge of making sense of alternative ways to describe their models: one through the output they generate, another through the large set of properties that describe them. Ideally, they want to understand whether groups of models with similar spatio-temporal behaviors share similar sets of criteria or, conversely, whether similar criteria lead to similar behaviors. We propose a visual analytics solution based on linked views, that addresses this problem by allowing the user to dynamically create, modify and observe the interaction among groupings, thereby making the potential explanations apparent. We present case studies that demonstrate the usefulness of our technique in the area of climate science.",Jorge Poco;Aritra Dasgupta;Yaxing Wei;William W. Hargrove;Christopher R. Schwalm;Deborah N. Huntzinger;Robert B. Cook;Enrico Bertini;Cláudio T. Silva,Jorge Poco;Aritra Dasgupta;Yaxing Wei;William Hargrove;Christopher R. Schwalm;Deborah N. Huntzinger;Robert Cook;Enrico Bertini;Claudio T. Silva,New York University;New York University and DataONE;Oak Ridge National Laboratory;USDA Forest Service;Northern Arizona University;Northern Arizona University;Oak Ridge National Laboratory;New York University;New York University,10.1109/TVCG.2008.139;10.1109/TVCG.2012.256;10.1109/VISUAL.2005.1532821;10.1109/TVCG.2013.157;10.1109/VAST.2012.6400486;10.1109/TVCG.2013.188;10.1109/TVCG.2013.224;10.1109/VAST.2008.4677350;10.1109/TVCG.2013.120,"Similarity, clustering, matrix, optimization, climate model",13,13,42,
InfoVis,2015,High-Quality Ultra-Compact Grid Layout of Grouped Networks,10.1109/TVCG.2015.2467251,http://dx.doi.org/10.1109/TVCG.2015.2467251,339,348,J,"Prior research into network layout has focused on fast heuristic techniques for layout of large networks, or complex multi-stage pipelines for higher quality layout of small graphs. Improvements to these pipeline techniques, especially for orthogonal-style layout, are difficult and practical results have been slight in recent years. Yet, as discussed in this paper, there remain significant issues in the quality of the layouts produced by these techniques, even for quite small networks. This is especially true when layout with additional grouping constraints is required. The first contribution of this paper is to investigate an ultra-compact, grid-like network layout aesthetic that is motivated by the grid arrangements that are used almost universally by designers in typographical layout. Since the time when these heuristic and pipeline-based graph-layout methods were conceived, generic technologies (MIP, CP and SAT) for solving combinatorial and mixed-integer optimization problems have improved massively. The second contribution of this paper is to reassess whether these techniques can be used for high-quality layout of small graphs. While they are fast enough for graphs of up to 50 nodes we found these methods do not scale up. Our third contribution is a large-neighborhood search meta-heuristic approach that is scalable to larger networks.",Vahan Yoghourdjian;Tim Dwyer;Graeme Gange;Steve Kieffer;Karsten Klein 0001;Kim Marriott,Vahan Yoghourdjian;Tim Dwyer;Graeme Gange;Steve Kieffer;Karsten Klein;Kim Marriott,Monash University;Monash University;The University of Melbourne;Monash University;Monash University;Monash University,10.1109/TVCG.2008.117;10.1109/TVCG.2013.151;10.1109/TVCG.2006.156;10.1109/TVCG.2009.109;10.1109/INFVIS.2003.1249009;10.1109/TVCG.2015.2467451;10.1109/TVCG.2012.245,"Network visualization, graph drawing, power graph, optimization, large-neighborhood search",13,15,50,
VAST,2015,Visually Exploring Transportation Schedules,10.1109/TVCG.2015.2467592,http://dx.doi.org/10.1109/TVCG.2015.2467592,170,179,J,"Public transportation schedules are designed by agencies to optimize service quality under multiple constraints. However, real service usually deviates from the plan. Therefore, transportation analysts need to identify, compare and explain both eventual and systemic performance issues that must be addressed so that better timetables can be created. The purely statistical tools commonly used by analysts pose many difficulties due to the large number of attributes at tripand station-level for planned and real service. Also challenging is the need for models at multiple scales to search for patterns at different times and stations, since analysts do not know exactly where or when relevant patterns might emerge and need to compute statistical summaries for multiple attributes at different granularities. To aid in this analysis, we worked in close collaboration with a transportation expert to design TR-EX, a visual exploration tool developed to identify, inspect and compare spatio-temporal patterns for planned and real transportation service. TR-EX combines two new visual encodings inspired by Marey's Train Schedule: Trips Explorer for trip-level analysis of frequency, deviation and speed; and Stops Explorer for station-level study of delay, wait time, reliability and performance deficiencies such as bunching. To tackle overplotting and to provide a robust representation for a large numbers of trips and stops at multiple scales, the system supports variable kernel bandwidths to achieve the level of detail required by users for different tasks. We justify our design decisions based on specific analysis needs of transportation analysts. We provide anecdotal evidence of the efficacy of TR-EX through a series of case studies that explore NYC subway service, which illustrate how TR-EX can be used to confirm hypotheses and derive new insights through visual exploration.",Cesar Palomo;Zhan Guo;Cláudio T. Silva;Juliana Freire,Cesar Palomo;Zhan Guo;Cláudio T. Silva;Juliana Freire,New York University;New York University;New York University;New York University,10.1109/INFVIS.2004.68;10.1109/TVCG.2014.2346449;10.1109/TVCG.2007.70535;10.1109/TVCG.2011.176;10.1109/TVCG.2013.226;10.1109/VISUAL.1999.809866;10.1109/TVCG.2008.137;10.1109/TVCG.2009.131;10.1109/INFVIS.2005.1532138;10.1109/TVCG.2011.179;10.1109/TVCG.2006.170;10.1109/INFVIS.2003.1249005,"Transportation, schedules, kernel density estimation, visual exploration",13,17,44,
VAST,2015,PhenoBlocks: Phenotype Comparison Visualizations,10.1109/TVCG.2015.2467733,http://dx.doi.org/10.1109/TVCG.2015.2467733,101,110,J,"The differential diagnosis of hereditary disorders is a challenging task for clinicians due to the heterogeneity of phenotypes that can be observed in patients. Existing clinical tools are often text-based and do not emphasize consistency, completeness, or granularity of phenotype reporting. This can impede clinical diagnosis and limit their utility to genetics researchers. Herein, we present PhenoBlocks, a novel visual analytics tool that supports the comparison of phenotypes between patients, or between a patient and the hallmark features of a disorder. An informal evaluation of PhenoBlocks with expert clinicians suggested that the visualization effectively guides the process of differential diagnosis and could reinforce the importance of complete, granular phenotypic reporting.",Michael Glueck;Peter Hamilton;Fanny Chevalier;Simon Breslav;Azam Khan;Daniel J. Wigdor;Michael Brudno,Michael Glueck;Peter Hamilton;Fanny Chevalier;Simon Breslav;Azam Khan;Daniel Wigdor;Michael Brudno,Autodesk Research;University of Toronto;INRIA;Autodesk Research;Autodesk Research;University of Toronto;University of Toronto,10.1109/VAST.2011.6102439;10.1109/TVCG.2013.214;10.1109/TVCG.2013.231;10.1109/VAST.2011.6102438;10.1109/TVCG.2008.121;10.1109/TVCG.2009.167;10.1109/TVCG.2009.116;10.1109/INFVIS.2000.885091;10.1109/TVCG.2007.70529;10.1109/INFVIS.2003.1249030;10.1109/TVCG.2012.226,"Clinical diagnosis, differential hierarchy comparison, ontology, genomics, phenomics, phenotype",13,12,60,
VAST,2015,EgoNetCloud: Event-based egocentric dynamic network visualization,10.1109/VAST.2015.7347632,http://dx.doi.org/10.1109/VAST.2015.7347632,65,72,C,"Event-based egocentric dynamic networks are an important class of networks widely seen in many domains. In this paper, we present a visual analytics approach for these networks by combining data-driven network simplifications with a novel visualization design - EgoNetCloud. In particular, an integrated data processing pipeline is proposed to prune, compress and filter the networks into smaller but salient abstractions. To accommodate the simplified network into the visual design, we introduce a constrained graph layout algorithm on the dynamic network. Through a real-life case study as well as conversations with the domain expert, we demonstrate the effectiveness of the EgoNetCloud design and system in completing analysis tasks on event-based dynamic networks. The user study comparing EgoNetCloud with a working system on academic search confirms the effectiveness and convenience of our visual analytics based approach.",Qingsong Liu;Yifan Hu;Lei Shi 0002;Xinzhu Mu;Yutao Zhang;Jie Tang 0001,Qingsong Liu;Yifan Hu;Lei Shi;Xinzhu Mu;Yutao Zhang;Jie Tang,"SKLCS, Institute of Software, Chinese Academy of Sciences, China;Yahoo Labs, New York, USA;SKLCS, Institute of Software, Chinese Academy of Sciences, China;Academy of Art and Design, Tsinghua University, China;Department of Computer Science and Technology, Tsinghua University, China;Department of Computer Science and Technology, Tsinghua University, China",10.1109/TVCG.2010.159;10.1109/TVCG.2011.226;10.1109/TVCG.2011.213,,13,1,31,
InfoVis,2016,Small Multiples with Gaps,10.1109/TVCG.2016.2598542,http://dx.doi.org/10.1109/TVCG.2016.2598542,381,390,J,"Small multiples enable comparison by providing different views of a single data set in a dense and aligned manner. A common frame defines each view, which varies based upon values of a conditioning variable. An increasingly popular use of this technique is to project two-dimensional locations into a gridded space (e.g. grid maps), using the underlying distribution both as the conditioning variable and to determine the grid layout. Using whitespace in this layout has the potential to carry information, especially in a geographic context. Yet, the effects of doing so on the spatial properties of the original units are not understood. We explore the design space offered by such small multiples with gaps. We do so by constructing a comprehensive suite of metrics that capture properties of the layout used to arrange the small multiples for comparison (e.g. compactness and alignment) and the preservation of the original data (e.g. distance, topology and shape). We study these metrics in geographic data sets with varying properties and numbers of gaps. We use simulated annealing to optimize for each metric and measure the effects on the others. To explore these effects systematically, we take a new approach, developing a system to visualize this design space using a set of interactive matrices. We find that adding small amounts of whitespace to small multiple arrays improves some of the characteristics of 2D layouts, such as shape, distance and direction. This comes at the cost of other metrics, such as the retention of topology. Effects vary according to the input maps, with degree of variation in size of input regions found to be a factor. Optima exist for particular metrics in many cases, but at different amounts of whitespace for different maps. We suggest multiple metrics be used in optimized layouts, finding topology to be a primary factor in existing manually-crafted solutions, followed by a trade-off between shape and displacement. But the rich range of possible optimized layouts leads us to challenge single-solution thinking; we suggest to consider alternative optimized layouts for small multiples with gaps. Key to our work is the systematic, quantified and visual approach to exploring design spaces when facing a trade-off between many competing criteria-an approach likely to be of value to the analysis of other design spaces.",Wouter Meulemans;Jason Dykes;Aidan Slingsby;Cagatay Turkay;Jo Wood,Wouter Meulemans;Jason Dykes;Aidan Slingsby;Cagatay Turkay;Jo Wood,"giCentre, City University, London;giCentre, City University, London;giCentre, City University, London;giCentre, City University, London;giCentre, City University, London",10.1109/TVCG.2014.2346276;10.1109/TVCG.2011.174;10.1109/TVCG.2016.2598862;10.1109/TVCG.2008.165,Geographic visualization;small multiples;whitespace;design space;metrics;optimization,13,12,41,
InfoVis,2016,Authoring Data-Driven Videos with DataClips,10.1109/TVCG.2016.2598647,http://dx.doi.org/10.1109/TVCG.2016.2598647,501,510,J,"Data videos, or short data-driven motion graphics, are an increasingly popular medium for storytelling. However, creating data videos is difficult as it involves pulling together a unique combination of skills. We introduce DataClips, an authoring tool aimed at lowering the barriers to crafting data videos. DataClips allows non-experts to assemble data-driven “clips” together to form longer sequences. We constructed the library of data clips by analyzing the composition of over 70 data videos produced by reputable sources such as The New York Times and The Guardian. We demonstrate that DataClips can reproduce over 90% of our data videos corpus. We also report on a qualitative study comparing the authoring process and outcome achieved by (1) non-experts using DataClips, and (2) experts using Adobe Illustrator and After Effects to create data-driven clips. Results indicated that non-experts are able to learn and use DataClips with a short training period. In the span of one hour, they were able to produce more videos than experts using a professional editing tool, and their clips were rated similarly by an independent audience.",Fereshteh Amini;Nathalie Henry Riche;Bongshin Lee;Andrés Monroy-Hernández;Pourang Irani,Fereshteh Amini;Nathalie Henry Riche;Bongshin Lee;Andres Monroy-Hernandez;Pourang Irani,"University of Manitoba, Canada;Microsoft;Microsoft;Microsoft;University of Manitoba, Canada",10.1109/TVCG.2007.70539;10.1109/TVCG.2008.137;10.1109/VAST.2007.4388992;10.1109/TVCG.2013.234;10.1109/TVCG.2013.119;10.1109/TVCG.2011.255;10.1109/TVCG.2010.179;10.1109/VAST.2012.6400487,data video;narrative visualization;data storytelling;authoring tools;visualization systems,13,23,44,
InfoVis,2016,Map LineUps: Effects of spatial structure on graphical inference,10.1109/TVCG.2016.2598862,http://dx.doi.org/10.1109/TVCG.2016.2598862,391,400,J,"Fundamental to the effective use of visualization as an analytic and descriptive tool is the assurance that presenting data visually provides the capability of making inferences from what we see. This paper explores two related approaches to quantifying the confidence we may have in making visual inferences from mapped geospatial data. We adapt Wickham et al.'s `Visual Line-up' method as a direct analogy with Null Hypothesis Significance Testing (NHST) and propose a new approach for generating more credible spatial null hypotheses. Rather than using as a spatial null hypothesis the unrealistic assumption of complete spatial randomness, we propose spatially autocorrelated simulations as alternative nulls. We conduct a set of crowdsourced experiments (n=361) to determine the just noticeable difference (JND) between pairs of choropleth maps of geographic units controlling for spatial autocorrelation (Moran's I statistic) and geometric configuration (variance in spatial unit area). Results indicate that people's abilities to perceive differences in spatial autocorrelation vary with baseline autocorrelation structure and the geometric configuration of geographic units. These results allow us, for the first time, to construct a visual equivalent of statistical power for geospatial data. Our JND results add to those provided in recent years by Klippel et al. (2011), Harrison et al. (2014) and Kay &amp;amp; Heer (2015) for correlation visualization. Importantly, they provide an empirical basis for an improved construction of visual line-ups for maps and the development of theory to inform geospatial tests of graphical inference.",Roger Beecham;Jason Dykes;Wouter Meulemans;Aidan Slingsby;Cagatay Turkay;Jo Wood,Roger Beecham;Jason Dykes;Wouter Meulemans;Aidan Slingsby;Cagatay Turkay;Jo Wood,"giCentre, City University London;giCentre, City University London;giCentre, City University London;giCentre, City University London;giCentre, City University London;giCentre, City University London",10.1109/TVCG.2015.2467671;10.1109/TVCG.2015.2469125;10.1109/TVCG.2014.2346979;10.1109/TVCG.2010.161,Graphical inference;spatial autocorrelation;just noticeable difference;geovisualization;statistical significance,13,17,20,HM
VAST,2016,TextTile: An Interactive Visualization Tool for Seamless Exploratory Analysis of Structured Data and Unstructured Text,10.1109/TVCG.2016.2598447,http://dx.doi.org/10.1109/TVCG.2016.2598447,161,170,J,"We describe TextTile, a data visualization tool for investigation of datasets and questions that require seamless and flexible analysis of structured data and unstructured text. TextTile is based on real-world data analysis problems gathered through our interaction with a number of domain experts and provides a general purpose solution to such problems. The system integrates a set of operations that can interchangeably be applied to the structured as well as to unstructured text part of the data to generate useful data summaries. Such summaries are then organized in visual tiles in a grid layout to allow their analysis and comparison. We validate TextTile with task analysis, use cases and a user study showing the system can be easily learned and proficiently used to carry out nontrivial tasks.",Cristian Felix;Anshul Vikram Pandey;Enrico Bertini,Cristian Felix;Anshul Vikram Pandey;Enrico Bertini,New York University;New York University;New York University,10.1109/TVCG.2011.176;10.1109/INFVIS.2000.885098;10.1109/VAST.2012.6400485;10.1109/VAST.2009.5333443;10.1109/TVCG.2015.2467191;10.1109/TVCG.2009.128;10.1109/INFVIS.2000.885086;10.1109/TVCG.2010.183;10.1109/TVCG.2014.2346919,Exploratory Text Analysis;Knowledge Discovery;Text Visualization,13,10,43,
VAST,2016,Magnostics: Image-Based Search of Interesting Matrix Views for Guided Network Exploration,10.1109/TVCG.2016.2598467,http://dx.doi.org/10.1109/TVCG.2016.2598467,31,40,J,"In this work we address the problem of retrieving potentially interesting matrix views to support the exploration of networks. We introduce Matrix Diagnostics (or Magnostics), following in spirit related approaches for rating and ranking other visualization techniques, such as Scagnostics for scatter plots. Our approach ranks matrix views according to the appearance of specific visual patterns, such as blocks and lines, indicating the existence of topological motifs in the data, such as clusters, bi-graphs, or central nodes. Magnostics can be used to analyze, query, or search for visually similar matrices in large collections, or to assess the quality of matrix reordering algorithms. While many feature descriptors for image analyzes exist, there is no evidence how they perform for detecting patterns in matrices. In order to make an informed choice of feature descriptors for matrix diagnostics, we evaluate 30 feature descriptors-27 existing ones and three new descriptors that we designed specifically for MAGNOSTICS-with respect to four criteria: pattern response, pattern variability, pattern sensibility, and pattern discrimination. We conclude with an informed set of six descriptors as most appropriate for Magnostics and demonstrate their application in two scenarios; exploring a large collection of matrices and analyzing temporal networks.",Michael Behrisch 0001;Benjamin Bach;Michael Blumenschein;Michael Delz;Laura von Rüden;Jean-Daniel Fekete;Tobias Schreck,Michael Behrisch;Benjamin Bach;Michael Hund;Michael Delz;Laura Von Rüden;Jean-Daniel Fekete;Tobias Schreck,"University of Konstanz, Germany;Microsoft Research-Inria Joint Centre, Saclay, France;University of Konstanz, Germany;University of Konstanz, Germany;Capgemini, RWTH Aachen University;Inria, Saclay, France;Graz University of Technology, Austria",10.1109/VAST.2012.6400488;10.1109/INFVIS.2004.15;10.1109/VAST.2014.7042480;10.1109/VAST.2010.5652433;10.1109/TVCG.2010.184;10.1109/VAST.2006.261423;10.1109/TVCG.2007.70582;10.1109/TVCG.2007.70535;10.1109/TVCG.2011.229;10.1109/VAST.2010.5652392;10.1109/INFVIS.2005.1532142;10.1109/INFVIS.2004.3,Matrix Visualization;Visual Quality Measures;Quality Metrics;Feature Detection/Selection;Relational Data,13,13,49,
VAST,2016,DimScanner: A Relation-based Visual Exploration Approach Towards Data Dimension Inspection,10.1109/VAST.2016.7883514,http://dx.doi.org/10.1109/VAST.2016.7883514,81,90,C,"Exploring multi-dimensional datasets can be cumbersome if data analysts have little knowledge about the data. Various dimension relation inspection tools and dimension exploration tools have been proposed for efficient data examining and understanding. However, the needed workload varies largely with respect to data complexity and user expertise, which can only be reduced with rich background knowledge over the data. In this paper we address the workload challenge with a data structuring and exploration scheme that affords dimension relation detection and that serves as the background knowledge for further investigation. We contribute a novel data structuring scheme that leverages an information-theoretic view structuring algorithm to uncover information-aware relations among different data views, and thereby discloses redundancy and other relation patterns among dimensions. The integrated system, DimScanner, empowers analysts with rich user controls and assistance widgets to interactively detect the relations of multi-dimensional data.",Jing Xia;Wei Chen 0001;Yumeng Hou;Wanqi Hu;Xinxin Huang;David S. Ebert,Jing Xia;Wei Chen;Yumeng Hou;Wanqi Hu;Xinxin Huang;David S. Ebertk,"State Key Lab of CAD&amp;CG, Zhejiang University, China;State Key Lab of CAD&amp;CG, Zhejiang University, China;State Key Lab of CAD&amp;CG, Zhejiang University, China;State Key Lab of CAD&amp;CG, Zhejiang University, China;State Key Lab of CAD&amp;CG, Zhejiang University, China;Purdue University, United States of America",10.1109/TVCG.2015.2467191;10.1109/TVCG.2009.153;10.1109/INFVIS.1998.729559;10.1109/VAST.2009.5332628;10.1109/TVCG.2010.184;10.1109/VAST.2010.5652450;10.1109/VAST.2006.261423;10.1109/TVCG.2013.160;10.1109/TVCG.2013.150;10.1109/TVCG.2011.229;10.1109/INFVIS.2005.1532142;10.1109/INFVIS.2004.3,,13,4,35,
InfoVis,2017,Taking Word Clouds Apart: An Empirical Investigation of the Design Space for Keyword Summaries,10.1109/TVCG.2017.2746018,http://dx.doi.org/10.1109/TVCG.2017.2746018,657,666,J,"In this paper we present a set of four user studies aimed at exploring the visual design space of what we call keyword summaries: lists of words with associated quantitative values used to help people derive an intuition of what information a given document collection (or part of it) may contain. We seek to systematically study how different visual representations may affect people's performance in extracting information out of keyword summaries. To this purpose, we first create a design space of possible visual representations and compare the possible solutions in this design space through a variety of representative tasks and performance metrics. Other researchers have, in the past, studied some aspects of effectiveness with word clouds, however, the existing literature is somewhat scattered and do not seem to address the problem in a sufficiently systematic and holistic manner. The results of our studies showed a strong dependency on the tasks users are performing. In this paper we present details of our methodology, the results, as well as, guidelines on how to design effective keyword summaries based in our discoveries.",Cristian Felix;Steven Franconeri;Enrico Bertini,Cristian Felix;Steven Franconeri;Enrico Bertini,New York University;Northwestern University;New York University,10.1109/VAST.2009.5333443;10.1109/TVCG.2016.2598447;10.1109/TVCG.2011.176;10.1109/TVCG.2010.194;10.1109/TVCG.2009.165;10.1109/TVCG.2009.171,"Word Clouds,Tag Clouds,Text Visualization,Keyword Summaries",13,9,27,
SciVis,2017,Abstractocyte: A Visual Tool for Exploring Nanoscale Astroglial Cells,10.1109/TVCG.2017.2744278,http://dx.doi.org/10.1109/TVCG.2017.2744278,853,861,J,"This paper presents Abstractocyte, a system for the visual analysis of astrocytes and their relation to neurons, in nanoscale volumes of brain tissue. Astrocytes are glial cells, i.e., non-neuronal cells that support neurons and the nervous system. The study of astrocytes has immense potential for understanding brain function. However, their complex and widely-branching structure requires high-resolution electron microscopy imaging and makes visualization and analysis challenging. Furthermore, the structure and function of astrocytes is very different from neurons, and therefore requires the development of new visualization and analysis tools. With Abstractocyte, biologists can explore the morphology of astrocytes using various visual abstraction levels, while simultaneously analyzing neighboring neurons and their connectivity. We define a novel, conceptual 2D abstraction space for jointly visualizing astrocytes and neurons. Neuroscientists can choose a specific joint visualization as a point in this space. Interactively moving this point allows them to smoothly transition between different abstraction levels in an intuitive manner. In contrast to simply switching between different visualizations, this preserves the visual context and correlations throughout the transition. Users can smoothly navigate from concrete, highly-detailed 3D views to simplified and abstracted 2D views. In addition to investigating astrocytes, neurons, and their relationships, we enable the interactive analysis of the distribution of glycogen, which is of high importance to neuroscientists. We describe the design of Abstractocyte, and present three case studies in which neuroscientists have successfully used our system to assess astrocytic coverage of synapses, glycogen distribution in relation to synapses, and astrocytic-mitochondria coverage.",Haneen Mohammed;Ali K. Al-Awami;Johanna Beyer;Corrado Calì;Pierre J. Magistretti;Hanspeter Pfister;Markus Hadwiger,Haneen Mohammed;Ali K. Al-Awami;Johanna Beyer;Corrado Cali;Pierre Magistretti;Hanspeter Pfister;Markus Hadwiger,"King Abdullah University of Science and Technology (KAUST), Saudi Arabia;King Abdullah University of Science and Technology (KAUST), Saudi Arabia;John A. Paulson School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA;King Abdullah University of Science and Technology (KAUST), Saudi Arabia;King Abdullah University of Science and Technology (KAUST), Saudi Arabia;John A. Paulson School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA;King Abdullah University of Science and Technology (KAUST), Saudi Arabia",10.1109/TVCG.2015.2467441;10.1109/TVCG.2014.2346312;10.1109/TVCG.2013.142;10.1109/TVCG.2009.121;10.1109/TVCG.2008.153;10.1109/TVCG.2007.70539;10.1109/TVCG.2016.2598472,"Connectomics,Neuroscience,Data Abstraction,Interactive 3D Visualization",13,4,39,
VAST,2017,The Interactive Visualization Gap in Initial Exploratory Data Analysis,10.1109/TVCG.2017.2743990,http://dx.doi.org/10.1109/TVCG.2017.2743990,278,287,J,"Data scientists and other analytic professionals often use interactive visualization in the dissemination phase at the end of a workflow during which findings are communicated to a wider audience. Visualization scientists, however, hold that interactive representation of data can also be used during exploratory analysis itself. Since the use of interactive visualization is optional rather than mandatory, this leaves a “visualization gap” during initial exploratory analysis that is the onus of visualization researchers to fill. In this paper, we explore areas where visualization would be beneficial in applied research by conducting a design study using a novel variation on contextual inquiry conducted with professional data analysts. Based on these interviews and experiments, we propose a set of interactive initial exploratory visualization guidelines which we believe will promote adoption by this type of user.",Andrea Batch;Niklas Elmqvist,Andrea Batch;Niklas Elmqvist,"College Park, University of Maryland, MD, USA;College Park, University of Maryland, MD, USA",10.1109/TVCG.2011.185;10.1109/TVCG.2013.124;10.1109/TVCG.2008.166;10.1109/TVCG.2016.2598545;10.1109/TVCG.2012.219;10.1109/TVCG.2014.2346747;10.1109/TVCG.2014.2346578;10.1109/TVCG.2016.2599030;10.1109/TVCG.2014.2346321;10.1109/INFVIS.2000.885086;10.1109/TVCG.2009.171,"Data science,visualization,visual analytics,contextual inquiry,semi-structured interviews",13,8,62,
VAST,2017,LDSScanner: Exploratory Analysis of Low-Dimensional Structures in High-Dimensional Datasets,10.1109/TVCG.2017.2744098,http://dx.doi.org/10.1109/TVCG.2017.2744098,236,245,J,"Many approaches for analyzing a high-dimensional dataset assume that the dataset contains specific structures, e.g., clusters in linear subspaces or non-linear manifolds. This yields a trial-and-error process to verify the appropriate model and parameters. This paper contributes an exploratory interface that supports visual identification of low-dimensional structures in a high-dimensional dataset, and facilitates the optimized selection of data models and configurations. Our key idea is to abstract a set of global and local feature descriptors from the neighborhood graph-based representation of the latent low-dimensional structure, such as pairwise geodesic distance (GD) among points and pairwise local tangent space divergence (LTSD) among pointwise local tangent spaces (LTS). We propose a new LTSD-GD view, which is constructed by mapping LTSD and GD to the<inline-formula><tex-math notation=""LaTeX"">$x$</tex-math><alternatives><inline-graphic xlink:href=""24tvcg01-xia-2744098-ieq-1-source.tif"" xmlns:xlink=""http://www.w3.org/1999/xlink""/></alternatives></inline-formula>axis and<inline-formula><tex-math notation=""LaTeX"">$y$</tex-math><alternatives><inline-graphic xlink:href=""24tvcg01-xia-2744098-ieq-2-source.tif"" xmlns:xlink=""http://www.w3.org/1999/xlink""/></alternatives></inline-formula>axis using 1D multidimensional scaling, respectively. Unlike traditional dimensionality reduction methods that preserve various kinds of distances among points, the LTSD-GD view presents the distribution of pointwise LTS (<inline-formula><tex-math notation=""LaTeX"">$x$</tex-math><alternatives><inline-graphic xlink:href=""24tvcg01-xia-2744098-ieq-3-source.tif"" xmlns:xlink=""http://www.w3.org/1999/xlink""/></alternatives></inline-formula>axis) and the variation of LTS in structures (the combination of<inline-formula><tex-math notation=""LaTeX"">$x$</tex-math><alternatives><inline-graphic xlink:href=""24tvcg01-xia-2744098-ieq-4-source.tif"" xmlns:xlink=""http://www.w3.org/1999/xlink""/></alternatives></inline-formula>axis and<inline-formula><tex-math notation=""LaTeX"">$y$</tex-math><alternatives><inline-graphic xlink:href=""24tvcg01-xia-2744098-ieq-5-source.tif"" xmlns:xlink=""http://www.w3.org/1999/xlink""/></alternatives></inline-formula>axis). We design and implement a suite of visual tools for navigating and reasoning about intrinsic structures of a high-dimensional dataset. Three case studies verify the effectiveness of our approach.",Jiazhi Xia;Fenjin Ye;Wei Chen 0001;Yusi Wang;Weifeng Chen 0002;Yuxin Ma;Anthony K. H. Tung,Jiazhi Xia;Fenjin Ye;Wei Chen;Yusi Wang;Weifeng Chen;Yuxin Ma;Anthony K.H. Tung,Central South University;Central South University;Zhejiang University;Central South University;Zhejiang University of Finance & Economics;Zhejiang University;National University of Singapore,10.1109/TVCG.2011.229;10.1109/VAST.2010.5652450;10.1109/VISUAL.1997.663916;10.1109/TVCG.2013.160;10.1109/VAST.2010.5652392;10.1109/VISUAL.1990.146402;10.1109/INFVIS.2003.1249013;10.1109/TVCG.2015.2467324;10.1109/TVCG.2016.2598495;10.1109/TVCG.2016.2598466;10.1109/INFVIS.2004.3;10.1109/TVCG.2015.2467717;10.1109/VAST.2009.5332628;10.1109/VAST.2012.6400488;10.1109/TVCG.2015.2467191;10.1109/VAST.2016.7883514;10.1109/TVCG.2013.150,"High-dimensional data,low-dimensional structure,subspace,manifold,visual exploration",13,15,44,
VAST,2017,Visualizing Big Data Outliers Through Distributed Aggregation,10.1109/TVCG.2017.2744685,http://dx.doi.org/10.1109/TVCG.2017.2744685,256,266,J,"Visualizing outliers in massive datasets requires statistical pre-processing in order to reduce the scale of the problem to a size amenable to rendering systems like D3, Plotly or analytic systems like R or SAS. This paper presents a new algorithm, called<monospace>hdoutliers</monospace>, for detecting multidimensional outliers. It is unique for a) dealing with a mixture of categorical and continuous variables, b) dealing with big-p (many columns of data), c) dealing with big-<inline-formula><tex-math notation=""LaTeX"">$n$</tex-math><alternatives><inline-graphic xlink:href=""24tvcg01-wilkinson-2744685-ieq-1-source.tif"" xmlns:xlink=""http://www.w3.org/1999/xlink""/></alternatives></inline-formula>(many rows of data), d) dealing with outliers that mask other outliers, and e) dealing consistently with unidimensional and multidimensional datasets. Unlike ad hoc methods found in many machine learning papers,<monospace>hdoutliers</monospace>is based on a distributional model that allows outliers to be tagged with a probability. This critical feature reduces the likelihood of false discoveries.",Leland Wilkinson,Leland Wilkinson,H2O.aiUIC,10.1109/INFVIS.2004.68;10.1109/TVCG.2010.197;10.1109/TVCG.2014.2346572;10.1109/INFVIS.2005.1532138;10.1109/VAST.2012.6400487;10.1109/TVCG.2006.170;10.1109/INFVIS.2003.1249016;10.1109/INFVIS.2005.1532142,"Outliers,Anomalies",13,7,84,
VAST,2017,VIGOR: Interactive Visual Exploration of Graph Query Results,10.1109/TVCG.2017.2744898,http://dx.doi.org/10.1109/TVCG.2017.2744898,215,225,J,"Finding patterns in graphs has become a vital challenge in many domains from biological systems, network security, to finance (e.g., finding money laundering rings of bankers and business owners). While there is significant interest in graph databases and querying techniques, less research has focused on helping analysts make sense of underlying patterns within a group of subgraph results. Visualizing graph query results is challenging, requiring effective summarization of a large number of subgraphs, each having potentially shared node-values, rich node features, and flexible structure across queries. We present VIGOR, a novel interactive visual analytics system, for exploring and making sense of query results. VIGOR uses multiple coordinated views, leveraging different data representations and organizations to streamline analysts sensemaking process. VIGOR contributes: (1) an exemplar-based interaction technique, where an analyst starts with a specific result and relaxes constraints to find other similar results or starts with only the structure (i.e., without node value constraints), and adds constraints to narrow in on specific results; and (2) a novel feature-aware subgraph result summarization. Through a collaboration with Symantec, we demonstrate how VIGOR helps tackle real-world problems through the discovery of security blindspots in a cybersecurity dataset with over 11,000 incidents. We also evaluate VIGOR with a within-subjects study, demonstrating VIGOR's ease of use over a leading graph database management system, and its ability to help analysts understand their results at higher speed and make fewer errors.",Robert Pienta;Fred Hohman;Alex Endert;Acar Tamersoy;Kevin A. Roundy;Christopher Gates 0002;Shamkant B. Navathe;Duen Horng Chau,Robert Pienta;Fred Hohman;Alex Endert;Acar Tamersoy;Kevin Roundy;Chris Gates;Shamkant Navathe;Duen Horng Chau,,10.1109/TVCG.2015.2467717;10.1109/TVCG.2015.2468078,"graph querying,subgraph results,query result visualization",13,5,49,
VAST,2018,TPFlow: Progressive Partition and Multidimensional Pattern Extraction for Large-Scale Spatio-Temporal Data Analysis,10.1109/TVCG.2018.2865018,http://dx.doi.org/10.1109/TVCG.2018.2865018,1,11,J,"Consider a multi-dimensional spatio-temporal (ST) dataset where each entry is a numerical measure defined by the corresponding temporal, spatial and other domain-specific dimensions. A typical approach to explore such data utilizes interactive visualizations with multiple coordinated views. Each view displays the aggregated measures along one or two dimensions. By brushing on the views, analysts can obtain detailed information. However, this approach often cannot provide sufficient guidance for analysts to identify patterns hidden within subsets of data. Without a priori hypotheses, analysts need to manually select and iterate through different slices to search for patterns, which can be a tedious and lengthy process. In this work, we model multidimensional ST data as tensors and propose a novel piecewise rank-one tensor decomposition algorithm which supports automatically slicing the data into homogeneous partitions and extracting the latent patterns in each partition for comparison and visual summarization. The algorithm optimizes a quantitative measure about how faithfully the extracted patterns visually represent the original data. Based on the algorithm we further propose a visual analytics framework that supports a top-down, progressive partitioning workflow for level-of-detail multidimensional ST data exploration. We demonstrate the general applicability and effectiveness of our technique on three datasets from different application domains: regional sales trend analysis, customer traffic analysis in department stores, and taxi trip analysis with origin-destination (OD) data. We further interview domain experts to verify the usability of the prototype.",Dongyu Liu;Panpan Xu;Ren Liu,Dongyu Liu;Panpan Xu;Liu Ren,"Hong Kong University of Science and Technology;Bosch Research North America, Sunnyvale, CA;Bosch Research North America, Sunnyvale, CA",10.1109/TVCG.2016.2598862;10.1109/TVCG.2017.2744419;10.1109/TVCG.2006.161;10.1109/TVCG.2014.2346449;10.1109/TVCG.2013.226;10.1109/TVCG.2013.179;10.1109/TVCG.2016.2598432;10.1109/TVCG.2016.2598831;10.1109/TVCG.2016.2598624;10.1109/TVCG.2017.2744805;10.1109/TVCG.2015.2467112;10.1109/TVCG.2014.2346574;10.1109/INFVIS.2003.1249018;10.1109/INFVIS.1999.801851;10.1109/TVCG.2015.2468111;10.1109/TVCG.2018.2865126;10.1109/TVCG.2007.70515,"Spatio-temporal data,tensor decomposition,interactive exploration,automatic pattern discoveries",13,6,67,BP
Vis,1990,Interactive visualization of quaternion Julia sets,10.1109/VISUAL.1990.146384,http://dx.doi.org/10.1109/VISUAL.1990.146384,209,"218, 475-6",C,"The first half of a two-step quaternion Julia set visualization system is described. This step uses a quarternion square root function to adapt the classic inverse iteration algorithm to the quaternions. The augmented version produces a 3-D Julia set defined by a point cloud that can be interactively manipulated on a graphics workstation. Several cues are assigned to the point cloud to increase depth perception. Finally, a short theorem is proven that extends the domain of the inverse iteration method to a rotational family of quadratic quaternion Julia sets.&lt;&lt;ETX&gt;&gt;",John C. Hart;Louis H. Kauffman;Dan Sandin,J.C. Hart;L.H. Kauffman;D.J. Sandim,"Electron. Visualization Lab., Illinois Univ., Chicago, IL, USA;Electron. Visualization Lab., Illinois Univ., Chicago, IL, USA;Electron. Visualization Lab., Illinois Univ., Chicago, IL, USA",,,12,5,11,
Vis,1994,Mix&Match: a construction kit for visualization,10.1109/VISUAL.1994.346305,http://dx.doi.org/10.1109/VISUAL.1994.346305,302,"309, C34",C,"We present an environment in which users can interactively create different visualization methods. This modular and extensible environment encapsulates most of the existing visualization algorithms. Users can easily construct new visualization methods by combining simple, fine grain building blocks. These components operate on a local subset of the data and generally either look for target features or produce visual objects. Intermediate compositions may also be used to build more complex visualizations. This environment provides a foundation for building and exploring novel visualization methods.&lt;&lt;ETX&gt;&gt;",Alex T. Pang;Naim Alper,A. Pang;N. Alper,"Baskin Center for Comput. Eng. & Inf. Sci., California Univ., Santa Cruz, CA, USA;Baskin Center for Comput. Eng. & Inf. Sci., California Univ., Santa Cruz, CA, USA",10.1109/VISUAL.1993.398860;10.1109/VISUAL.1990.146373;10.1109/VISUAL.1991.175804;10.1109/VISUAL.1992.235207;10.1109/VISUAL.1992.235219;10.1109/VISUAL.1993.398880;10.1109/VISUAL.1993.398879,,12,7,18,
Vis,1994,Restorer: a visualization technique for handling missing data,10.1109/VISUAL.1994.346317,http://dx.doi.org/10.1109/VISUAL.1994.346317,212,"216, C23",C,"Pseudocoloring is a frequently used technique in scientific visualization for mapping a color to a data value. When using pseudocolor and animation to visualize data that contain missing regions displayed as black or transparent, the missing regions popping in and out can distract the viewer from the more relevant information. Filling these gaps with interpolated data could lead to a misinterpretation of the data. The paper presents a method for combining pseudocoloring and grayscale in the same colormap. Valid data are mapped to colors in the colormap. The luminance values of the colors bounding areas of missing data are used in interpolating over these regions. The missing data are mapped to the grayscale portion of the colormap. This approach has the advantages of eliminating distracting gaps caused by missing data and distinguishing between those areas that represent valid data and those areas that do not. This approach was inspired by a technique used in the restoration of paintings.&lt;&lt;ETX&gt;&gt;",Ray Twiddy;John Cavallo;Shahram M. Shiri,R. Twiddy;J. Cavallo;S.M. Shiri,"Hughes STX Corp., NASA Goddard Space Flight Center, Greenbelt, MD, USA;Hughes STX Corp., NASA Goddard Space Flight Center, Greenbelt, MD, USA;Hughes STX Corp., NASA Goddard Space Flight Center, Greenbelt, MD, USA",,,12,7,17,
Vis,1995,Interactive realism for visualization using ray tracing,10.1109/VISUAL.1995.480791,http://dx.doi.org/10.1109/VISUAL.1995.480791,19,"26, 434",C,"Visual realism is necessary for many virtual reality applications. In order to convince the user that the virtual environment is real, the scene presented should faithfully model the expected actual environment. A highly accurate, fully modeled, interactive environment is thus seen as ""virtually real"". The paper addresses the problem of interactive visual realism and discusses a possible solution: a hybrid rendering paradigm that ties distributed graphics hardware and ray tracing systems together for use in interactive, high visual realism applications. This new paradigm is examined in the context of a working rendering system. This system is capable of producing images of higher fidelity than possible through the use of graphics hardware alone, able both to render images at speeds useful for interactive systems and to progressively refine static, high quality snapshots.",Robert A. Cross,R.A. Cross,"Naval Res. Lab., Washington, DC, USA",,,12,3,12,
Vis,1995,Subverting structure: data-driven diagram generation,10.1109/VISUAL.1995.480815,http://dx.doi.org/10.1109/VISUAL.1995.480815,217,"223, 455",C,"Diagrams are data representations that convey information predominantly through combinations of graphical elements rather than through other channels such as text or interaction. We have implemented a prototype called AVE (Automatic Visualization Environment) that generates diagrams automatically based on a generative theory of diagram design. According to this theory, diagrams are constructed based on the data to be visualized rather than by selection from a predefined set of diagrams. This approach can be applied to knowledge represented by semantic networks. We give a brief introduction to the underlying theory, then describe the implementation and finally discuss strategies for extending the algorithm.",Gene Golovchinsky;Klaus Reichenberger;Thomas Kamps,G. Golovchinsky;T. Kamps;K. Reichenberger,"Dept. of Ind. Eng., Toronto Univ., Ont., Canada",10.1109/INFVIS.1995.528681,,12,2,11,
Vis,1995,Qualitative analysis of invariant tori in a dynamical system,10.1109/VISUAL.1995.485148,http://dx.doi.org/10.1109/VISUAL.1995.485148,342,"345, 471",C,"Invariant tori are examples of invariant manifolds in dynamical systems. Usual tools in dynamical systems such as analysis and numerical simulations alone are often not sufficient to understand the complicated mechanisms that cause changes in these manifolds. Computer-graphical visualization is a natural and powerful addition to these tools used for the qualitative study of dynamical systems, especially for the study of invariant manifolds. The dynamics of two linearly coupled oscillators is the focus of this case study. With little or no coupling between the oscillators, an invariant torus is present but it breaks down for strong coupling. Visualization has been employed to gain a qualitative understanding of this breakdown process. The visualization has allowed key features of the tori to be recognized, and it has proven to be indispensable in developing and testing hypotheses about the tori.",Daryl H. Hepting;Gianne Derks;Kossi D. Edoh;Robert D. Russell,D.H. Hepting;G. Derks;K.D. Edoh;R.D. Russell,"Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada",,,12,4,10,
InfoVis,1996,Minimally-immersive interactive volumetric information visualization,10.1109/INFVIS.1996.559220,http://dx.doi.org/10.1109/INFVIS.1996.559220,66,"67, 123",M,"This paper describes a minimally immersive volumetric interactive system for information visualization. The system, SFA, uses glyph-based volume rendering, enabling more information attributes to be visualized than traditional 2D and surface-based information visualization systems. Two-handed interaction and stereoscopic viewing combine to produce a minimally immersive interactive system that enhances the user's three-dimensional perception of the information space, capitalizing on the human visual system's pre-attentive learning capabilities to quickly analyze the displayed information. The paper describes the usefulness of this system for the visualization of document similarity within a corpus of textual documents. SFA allows the three-dimensional volumetric visualization, manipulation, navigation, and analysis of multivariate, time-varying information spaces, increasing the quantity and clarity of information conveyed from the visualization as compared to traditional 2D information systems.",David S. Ebert;Chris Shaw 0002;Amen Zwa;Ethan L. Miller;D. Aaron Roberts,D.S. Ebert;C. Shaw;A. Zwa;E.L. Miller;D.A. Roberts,"Maryland Univ., Baltimore, MD, USA",,,12,7,6,
InfoVis,1996,Visualizing usability log data,10.1109/INFVIS.1996.559227,http://dx.doi.org/10.1109/INFVIS.1996.559227,93,"98, 130",C,"Our approach to testing graphical user interfaces involves logging large amounts of data. These logs capture information at the key press and mouse click level about how an application is used. Since the raw data is voluminous and not at a useful level of detail, we use analysis and visualization to find information that is interesting and useful to a usability analyst but was previously buried in the data. We call some of our custom visualizations ""contextual"" meaning they use key elements of the context the data was collected in as an organizing structure. We expect this type of visualization to be easier and faster to understand and more helpful than traditional charts. We hope that our finding a natural geometry for these visualizations will inspire others whose data apparently has no inherent geometry to find natural ways to visualize their data.",Mark Gray;Albert N. Badre;Mark Guzdial,M. Gray;A. Badre;M. Guzdial,"Coll. of Comput., Georgia Univ., Athens, GA, USA",,,12,6,8,
InfoVis,1996,Visualizing a tennis match,10.1109/INFVIS.1996.559229,http://dx.doi.org/10.1109/INFVIS.1996.559229,108,"114, 132",C,"This paper describes our work on visualizing the information of a tennis match. We use competition trees to organize the information of a tennis match and visualize the competition trees by the top-nesting layered maps with translucent colored layers. We create iconic representations to describe the detailed information of athletic events in an intuitive manner. Specialized views of the information are displayed by applying multiple Magic Lens filters on the top-nesting layered maps. The dynamic nature of the tennis match is depicted by the time-varying display. The approach we present in this paper can be used to visualize other sports information, information with competition property, or information with hierarchical structure.",Liqun Jin;David C. Banks,Liqun Jin;D.C. Banks,"Dept. of Comput. Sci., Mississippi State Univ., MS, USA",10.1109/VISUAL.1991.175815,,12,2,11,
Vis,1998,Volumetric modeling of acoustic fields in CNMAT's sound spatialization theatre,10.1109/VISUAL.1998.745338,http://dx.doi.org/10.1109/VISUAL.1998.745338,439,442,C,"A new tool for real time visualization of acoustic sound fields has been developed for a new sound spatialization theatre. The theatre is described and several applications of the acoustic and volumetric modeling software are presented. The visualization system described is a valuable tool for spatial sound researchers, sound engineers and composers using CNMAT's sound spatialization theatre. Further work is in progress on the adaptation of better acoustic simulation methods (M. Monks et al., 1996) for more accurate display of the quality of the reverberant field. The room database will be automatically extracted from a model built with 3D modeling software. Volume visualization strategies are being explored to display sounds in spectral and impulse response form.",Sami Khoury;Adrian Freed;David Wessel,S. Khoury;A. Freed;D. Wessel,"CNMAT, Berkeley, CA, USA",10.1109/VISUAL.1996.567752,,12,3,18,
InfoVis,1999,VisageWeb: visualizing WWW data in Visage,10.1109/INFVIS.1999.801864,http://dx.doi.org/10.1109/INFVIS.1999.801864,100,"107, 150",C,"VisageWeb is an information-centric user interface to the World Wide Web built within the Visage data visualization environment. This paper traces the development of the VisageWeb project, using it to motivate an exploration of how an information-centric architecture copes with new visualization challenges. We conclude with a presentation of the VisageWeb prototype itself.",Michael Higgins;Peter Lucas 0002;Jeffrey Senn,M. Higgins;P. Lucas;J. Sean,"MAYA Design Group Inc., Pittsburgh, PA, USA",,"World Wide Web, Information Visualization, User Interface",12,3,15,
Vis,1999,Visualizing gridded datasets with large number of missing values,10.1109/VISUAL.1999.809916,http://dx.doi.org/10.1109/VISUAL.1999.809916,405,551,C,"Much of the research in scientific visualization has focused on complete sets of gridded data. The paper presents our experience dealing with gridded data sets with a large number of missing or invalid data, and some of our experiments in addressing the shortcomings of standard off-the-shelf visualization algorithms. In particular, we discuss the options in modifying known algorithms to adjust to the specifics of sparse datasets, and provide a new technique to smooth out the side-effects of the operations. We apply our findings to data acquired from NEXRAD (NEXt generation RADars) weather radars, which usually have no more than 3 to 4 percent of all possible cell points filled.",Suzana Djurcilov;Alex T. Pang,S. Djurcilov;A. Pang,"Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA",10.1109/VISUAL.1996.568145,,12,8,12,
Vis,2000,Enabling level-of-detail matching for exterior scene synthesis,10.1109/VISUAL.2000.885691,http://dx.doi.org/10.1109/VISUAL.2000.885691,171,178,C,"The work presents a method to enable matching of level-of-detail (LOD) models to image-plane resolution over large variations in viewing distances often present in exterior images. A relationship is developed between image sampling rate, viewing distance, object projection, and expected image error due to LOD approximations. This is employed in an error metric to compute error profiles for LOD models. Multirate filtering in the frequency space of a reference object image is utilized to approximate multiple distant views over a range of orientations. An importance sampling method is described to better characterize perspective projection over view distance. A contrast sensitivity function (CSF) is employed to approximate the response of the vision system. Examples are presented for multiresolution spheres and a terrain height field feature. Future directions for extending this method are described.",Randy K. Scoggins;Robert J. Moorhead II;Raghu Machiraju,R.K. Scoggins;R. Machiraju;R.J. Moorhead,"Eng. Res. & Dev. Center, US Army Corp. of Eng., Vicksburg, MS, USA",10.1109/VISUAL.1996.568126;10.1109/VISUAL.1998.745282,"multiresolution model, level-of-detail, rendering, image metrics, perception, terrain visualization",12,3,23,
Vis,2000,Visualizing geodesics,10.1109/VISUAL.2000.885710,http://dx.doi.org/10.1109/VISUAL.2000.885710,311,318,C,"One of the main research topics in scientific visualization is to ""visualize the appropriate features"" of a certain structure or data set. Geodesics are very important in geometry and physics, but there is one major problem which prevents scientists from using them as a visualization tool: the differential equations for geodesics are very complicated and in most cases numerical algorithms must be used. There is always a certain approximation error involved. How can you be sure to visualize the features and not only the approximation quality. The paper presents an algorithm to overcome this problem. It consists of two parts. In the first, a geometric method for the construction of geodesics of arbitrary surfaces is introduced. This method is based on the fundamental property that geodesics are a generalization of straight lines on plains. In the second part these geodesics are used to generate local nets on the surfaces.",Ingrid Hotz;Hans Hagen,I. Hotz;H. Hagen,"Dept. of Comput. Sci., Kaiserslautern Univ., Germany",10.1109/VISUAL.1992.235196,"geodesics, visualization features",12,5,6,
Vis,2001,Circular incident edge lists: a data structure for rendering complex unstructured grids,10.1109/VISUAL.2001.964511,http://dx.doi.org/10.1109/VISUAL.2001.964511,191,198,C,"We present the circular incident edge lists (CIEL), a new data structure and a high-performance algorithm for generating a series of iso-surfaces in a highly unstructured grid. Slicing-based volume rendering is also considered. The CIEL data structure represents all the combinatorial information of the grid, making it possible to optimize the classical propagation from local minima paradigm. The usual geometric structures are replaced by a more efficient combinatorial structure. An active edges list is maintained, and iteratively propagated from an iso-surface to the next one in a very efficient way. The intersected cells incident to each active edge are retrieved, and the intersection polygons are generated by circulating around their facets. This latter feature enables arbitrary irregular cells to be treated, such as those encountered in certain computational fluid dynamics (CFD) simulations. Since the CIEL data structure solely depends on the connections between the cells, it is possible to take into account dynamic changes in the geometry of the mesh and in property values, which only requires the sorted extrema list to be updated. Experiments have shown that our approach is significantly faster than classical methods. The major drawback of our method is its memory consumption, higher than most classical methods. However, experimental results show that it stays within a practical range.",Bruno Lévy;Guillaume Caumon;Stephane Conreaux;Xavier Cavin,B. Levy;G. Caumon;S. Conreaux;X. Cavin,"ISA (INRIA Lorraine), Vandoeuvre-les-Nancy, France;ISA (INRIA Lorraine), Vandoeuvre-les-Nancy, France;ISA (INRIA Lorraine), Vandoeuvre-les-Nancy, France;ISA (INRIA Lorraine), Vandoeuvre-les-Nancy, France",10.1109/VISUAL.1996.567606,"Volume Rendering, Iso-Surfaces, Unstructured Grids, Combinatorial Topology",12,5,28,
Vis,2001,Case study: application of feature tracking to analysis of autoignition simulation data,10.1109/VISUAL.2001.964551,http://dx.doi.org/10.1109/VISUAL.2001.964551,461,464,C,The focus of this paper is to evaluate the usefulness of some basic feature tracking algorithms as analysis tools for combustion datasets by application to a dataset modeling autoignition. Features defined as areas of high intermediate concentrations were examined to explore the initial phases in the autoignition process.,Wendy S. Koegler,W.S. Koegler,"Sandia Nat. Labs., Livermore, CA, USA",10.1109/VISUAL.1998.745288,"feature detection, feature tracking, combustion, autoignition",12,5,9,
Vis,2002,Immersive volume visualization of seismic simulations: A case study of techniques invented and lessons learned,10.1109/VISUAL.2002.1183814,http://dx.doi.org/10.1109/VISUAL.2002.1183814,497,500,C,"This paper is a documentation of techniques invented, results obtained and lessons learned while creating visualization algorithms to render outputs of large-scale seismic simulations. The objective is the development of techniques for a collaborative simulation and visualization shared between structural engineers, seismologists, and computer scientists. The computer graphics research community has been witnessing a large number of exemplary publications addressing the challenges faced while trying to visualize both large-scale surface and volumetric datasets lately. From a visualization perspective, issues like data preprocessing (simplification, sampling, filtering, etc.); rendering algorithms (surface and volume), and interaction paradigms (large-scale, highly interactive, highly immersive, etc.) have been areas of study. In this light, we outline and describe the milestones achieved in a large-scale simulation and visualization project, which opened the scope for combining existing techniques with new methods, especially in those cases where no existing methods were suitable. We elucidate the data simplification and reorganization schemes that we used, and discuss the problems we encountered and the solutions we found. We describe both desktop (high-end local as well as remote) interfaces and immersive visualization systems that we developed to employ interactive surface and volume rendering algorithms. Finally, we describe the results obtained, challenges that still need to be addressed, and ongoing efforts to meet the challenges of large-scale visualization.",Prashant Chopra;Jörg Meyer 0003;Antonio Fernandez,P. Chopra;J. Meyer;A. Fernandez,"Eng. Res. Center, Mississippi State Univ., MS, USA;Eng. Res. Center, Mississippi State Univ., MS, USA",10.1109/VISUAL.1998.745329;10.1109/VISUAL.1997.663883;10.1109/VISUAL.2000.885680;10.1109/VISUAL.1998.745315,"mesh simplification, multi resolution, level-of-detail, unstructured meshes",12,8,16,
Vis,2003,MC*: star functions for marching cubes,10.1109/VISUAL.2003.1250355,http://dx.doi.org/10.1109/VISUAL.2003.1250355,59,66,C,"We describe a modification of the widely used marching cubes method that leads to the useful property that the resulting isosurfaces are locally single valued functions. This implies that conventional interpolation and approximation methods can be used to locally represent the surface. These representations can be used for computing approximations for local surface properties. We utilize this possibility in order to develop algorithms for locally approximating Gaussian and mean curvature, methods for constrained smoothing of isosurface, and techniques for the parameterization of isosurfaces.",Gregory M. Nielson,G.M. Nielson,"Arizona State Univ., Tempe, AZ, USA",10.1109/VISUAL.1991.175782," Marching Cubes, isosurfaces, triangular mesh",12,3,20,
Vis,2003,Visualization of noisy and biased volume data using first and second order derivative techniques,10.1109/VISUAL.2003.1250397,http://dx.doi.org/10.1109/VISUAL.2003.1250397,379,385,C,"The quality of volume visualization depends strongly on the quality of the underlying data. In virtual colonoscopy, CT data should be acquired at a low radiation dose that results in a low signal-to-noise ratio. Alternatively, MRI data is acquired without ionizing radiation, but suffers from noise and bias (global signal fluctuations). Current volume visualization techniques often do not produce good results with noisy or biased data. This paper describes methods for volume visualization that deal with these imperfections. The techniques are based on specially adapted edge detectors using first and second order derivative filters. The filtering is integrated into the visualization process. The first order derivative method results in good quality images but suffers from localization bias. The second order method has better surface localization, especially in highly curved areas. It guarantees minimal detail smoothing resulting in a better visualization of polyps.",Marc P. Persoon;Iwo Serlie;Frits H. Post;Roel Truyen;Frans Vos,M.P. Persoon;I.W.O. Serlie;F.H. Post;R. Truyen;F.M. Vos,"Comput. Graphics & CAD/CAM Group, Delft Univ. of Technol., Netherlands",,"virtual colonoscopy, bias field, medical imaging, surface extraction, direct volume rendering",12,6,11,
Vis,2003,Visualization of volume data with quadratic super splines,10.1109/VISUAL.2003.1250399,http://dx.doi.org/10.1109/VISUAL.2003.1250399,393,400,C,"We develop a new approach to reconstruct non-discrete models from gridded volume samples. As a model, we use quadratic trivariate super splines on a uniform tetrahedral partition /spl Delta/. The approximating splines are determined in a natural and completely symmetric way by averaging local data samples, such that appropriate smoothness conditions are automatically satisfied. On each tetra-hedron of /spl Delta/ , the quasi-interpolating spline is a polynomial of total degree two which provides several advantages including efficient computation, evaluation and visualization of the model. We apply Bernstein-Bezier techniques well-known in CAGD to compute and evaluate the trivariate spline and its gradient. With this approach the volume data can be visualized efficiently e.g., with isosurface ray-casting. Along an arbitrary ray the splines are univariate, piecewise quadratics and thus the exact intersection for a prescribed isovalue can be easily determined in an analytic and exact way. Our results confirm the efficiency of the quasi-interpolating method and demonstrate high visual quality for rendered isosurfaces.",Christian Rössl;Frank Zeilfelder;Günther Nürnberger;Hans-Peter Seidel,C. Rossl;F. Zeilfelder;G. Nurnberger;H.-P. Seidel,"Max-Planck-Inst. fur Informatik, Saarbrucken, Germany",10.1109/VISUAL.1998.745713;10.1109/VISUAL.1997.663907;10.1109/VISUAL.1996.567602;10.1109/VISUAL.1994.346331;10.1109/VISUAL.2001.964530;10.1109/VISUAL.2001.964499,"volume rendering, reconstruction, quadratic super splines, tetrahedral partition, Bernstein-Bezier techniques, isosurface rendering, ray-casting",12,5,44,
InfoVis,2004,Exploring and Visualizing the History of InfoVis,10.1109/INFVIS.2004.22,http://dx.doi.org/10.1109/INFVIS.2004.22,r6,r6,M,,Daniel A. Keim;Helmut Barro;Christian Panse;Jörn Schneidewind;Mike Sips,D.A. Keim;H. Barro;C. Panse;J. Schneidewind;M. Sips,University of Konstanz,,,12,4,2,
Vis,2004,Depth Enhanced Panoramas,10.1109/VISUAL.2004.22,http://dx.doi.org/10.1109/VISUAL.2004.22,11,11,M,,Gleb Bahmutov;Voicu Popescu;Elisha Sacks,G. Bahmutov;V. Popescu;E. Sacks,Purdue University,,,12,2,3,
Vis,2004,Light weight space leaping using ray coherence,10.1109/VISUAL.2004.63,http://dx.doi.org/10.1109/VISUAL.2004.63,19,26,C,"We present a space leaping technique for accelerating volume rendering with very low space and run-time complexity. Our technique exploits the ray coherence during ray casting by using the distance a ray traverses in empty space to leap its neighboring rays. Our technique works with parallel as well as perspective volume rendering, does not require any preprocessing or 3D data structures, and is independent of the transfer function. Being an image-space technique, it is independent of the complexity of the data being rendered. It can be used to accelerate both time-coherent and noncoherent animation sequences.",Sarang Lakare;Arie E. Kaufman,S. Lakare;A. Kaufman,"Dept. of Comput. Sci., Stony Brook Univ., NY, USA;Dept. of Comput. Sci., Stony Brook Univ., NY, USA",10.1109/VISUAL.1993.398852;10.1109/VISUAL.1999.809914;10.1109/VISUAL.1990.146377;10.1109/VISUAL.1998.745713;10.1109/VISUAL.2002.1183775,"Direct Volume Rendering, Space Leaping, Empty Space Skipping, Ray Coherence, Volume Rendering Acceleration",12,7,13,
Vis,2004,Panel 1: Can We Determine the Top Unresolved Problems of Visualization?,10.1109/VISUAL.2004.76,http://dx.doi.org/10.1109/VISUAL.2004.76,563,566,M,"Many of us working in visualization have our own list of our top 5 or 10 unresolved problems in visualization. We have assembled a group of panelists to debate and perhaps reach concensus on the top problems in visualization that still need to be explored. We include panelists from both the information and scientific visualization domains. After our presentations, we encourage interaction with the audience to see if we can further formulate and perhaps finalize our list of top unresolved problems in visualization.",Theresa-Marie Rhyne;William L. Hibbard;Christopher R. Johnson 0001;Chaomei Chen;Steve Eick,T. Rhyne;B. Hibbard;C. Johnson;Chaomei Chen;S. Eick,North Carolina State University,,,12,6,0,
Vis,2005,Framework for visualizing higher-order basis functions,10.1109/VISUAL.2005.1532776,http://dx.doi.org/10.1109/VISUAL.2005.1532776,43,50,C,"Techniques in numerical simulation such as the finite element method depend on basis functions for approximating the geometry and variation of the solution over discrete regions of a domain. Existing visualization systems can visualize these basis functions if they are linear, or for a small set of simple non-linear bases. However, newer numerical approaches often use basis functions of elevated and mixed order or complex form; hence existing visualization systems cannot directly process them. In this paper we describe an approach that supports automatic, adaptive tessellation of general basis functions using a flexible and extensible software architecture in conjunction with an on demand, edge-based recursive subdivision algorithm. The framework supports the use of functions implemented in external simulation packages, eliminating the need to reimplement the bases within the visualization system. We demonstrate our method on several examples, and have implemented the framework in the open-source visualization system VTK.",William J. Schroeder;François Bertel;Mathieu Malaterre;David C. Thompson 0001;Philippe P. Pébay;Robert M. O'Bara;Saurabh Tendulkar,W.J. Schroeder;F. Bertel;M. Malaterre;D. Thompson;P.P. Pebay;R. O'Barall;Saurabh Tendulkar,,10.1109/VISUAL.1997.663886;10.1109/VISUAL.2004.15;10.1109/VISUAL.1991.175818;10.1109/VISUAL.1995.480821," finite element, basis function, tessellation, framework",12,3,28,
Vis,2005,Visualization of time-dependent remote adaptive mesh refinement data,10.1109/VISUAL.2005.1532793,http://dx.doi.org/10.1109/VISUAL.2005.1532793,175,182,C,"Analysis of phenomena that simultaneously occur on different spatial and temporal scales requires adaptive, hierarchical schemes to reduce computational and storage demands. Adaptive mesh refinement (AMR) schemes support both refinement in space that results in a time-dependent grid topology, as well as refinement in time that results in updates at higher rates for refined levels. Visualization of AMR data requires generating data for absent refinement levels at specific time steps. We describe a solution starting from a given set of ""key frames"" with potentially different grid topologies. The presented work was developed in a project involving several research institutes that collaborate in the field of cosmology and numerical relativity. AMR data results from simulations that are run on dedicated compute machines and is thus stored centrally, whereas the analysis of the data is performed on the local computers of the scientists. We built a distributed solution using remote procedure calls (RPC). To keep the application responsive, we split the bulk data transfer from the RPC response and deliver it asynchronously as a binary stream. The number of network round-trips is minimized by using high level operations. In summary, we provide an application for exploratory visualization of remotely stored AMR data.",Ralf Kähler;Steffen Prohaska;Andrei Hutanu;Hans-Christian Hege,R. Kaehler;S. Prohaska;A. Hutanu;H.-C. Hege,"Zuse-lnstitute Berlin, Germany;Zuse-lnstitute Berlin, Germany",10.1109/VISUAL.2002.1183820;10.1109/VISUAL.2004.51;10.1109/VISUAL.2002.1183824,"Time-Varying Data Visualization, Visualization over Networks, Multiresolution Visualization",12,1,40,
Vis,2005,Eyelet particle tracing - steady visualization of unsteady flow,10.1109/VISUAL.2005.1532848,http://dx.doi.org/10.1109/VISUAL.2005.1532848,607,614,C,"It is a challenging task to visualize the behavior of time-dependent 3D vector fields. Most of the time an overview of unsteady fields is provided via animations, but, unfortunately, animations provide only transient impressions of momentary flow. In this paper we present two approaches to visualize time varying fields with fixed geometry. Path lines and streak lines represent such a steady visualization of unsteady vector fields, but because of occlusion and visual clutter it is useless to draw them all over the spatial domain. A selection is needed. We show how bundles of streak lines and path lines, running at different times through one point in space, like through an eyelet, yield an insightful visualization of flow structure (""eyelet lines""). To provide a more intuitive and appealing visualization we also explain how to construct a surface from these lines. As second approach, we use a simple measurement of local changes of a field over time to determine regions with strong changes. We visualize these regions with isosurfaces to give an overview of the activity in the dataset. Finally we use the regions as a guide for placing eyelets.",Alexander Wiebel;Gerik Scheuermann,A. Wiebel;G. Scheuermann,"Dept. of Comput. Sci., Leipzig Univ., Germany;Dept. of Comput. Sci., Leipzig Univ., Germany",10.1109/VISUAL.2001.964493;10.1109/VISUAL.1995.485146;10.1109/VISUAL.2004.107;10.1109/VISUAL.1992.235211;10.1109/VISUAL.1993.398848;10.1109/VISUAL.2004.113;10.1109/VISUAL.1993.398850;10.1109/VISUAL.2003.1250372;10.1109/VISUAL.1996.568121;10.1109/VISUAL.2004.99,"3D Vector Field Visualization, Time-Varying Data Visualization, Flow Visualization, Vector/Tensor Visualization",12,1,21,
VAST,2006,Visual Analytics of Paleoceanographic Conditions,10.1109/VAST.2006.261452,http://dx.doi.org/10.1109/VAST.2006.261452,19,26,C,"Decade scale oceanic phenomena like El Nino are correlated with weather anomalies all over the globe. Only by understanding the events that produced the climatic conditions in the past will it be possible to forecast abrupt climate changes and prevent disastrous consequences for human beings and their environment. Paleoceanography research is a collaborative effort that requires the analysis of paleo time-series, which are obtained from a number of independent techniques and instruments and produced by a variety of different researchers and/or laboratories. The complexity of these phenomena that consist of massive, dynamic and often conflicting data can only be faced by means of analytical reasoning supported by a highly interactive visual interface. This paper presents an interactive visual analysis environment for paleoceanography that permits to gain insight into the paleodata and allow the control and steering of the analytical methods involved in the reconstruction of the climatic conditions of the past",Roberto Therón,Roberto Theron,"Departamento de Informática y Automática, Universidad de Salamanca, e-mail: theron@usal.es",,"Infovis, parallel coordinates, multiple linked views,exploratory analysis",12,6,23,
Vis,2006,Techniques for the Visualization of Topological Defect Behavior in Nematic Liquid Crystals,10.1109/TVCG.2006.182,http://dx.doi.org/10.1109/TVCG.2006.182,1323,1328,J,"We present visualization tools for analyzing molecular simulations of liquid crystal (LC) behavior. The simulation data consists of terabytes of data describing the position and orientation of every molecule in the simulated system over time. Condensed matter physicists study the evolution of topological defects in these data, and our visualization tools focus on that goal. We first convert the discrete simulation data to a sampled version of a continuous second-order tensor field and then use combinations of visualization methods to simultaneously display combinations of contractions of the tensor data, providing an interactive environment for exploring these complicated data. The system, built using AVS, employs colored cutting planes, colored isosurfaces, and colored integral curves to display fields of tensor contractions including Westin's scalar c&lt;sub&gt;l&lt;/sub&gt;, c&lt;sub&gt;p &lt;/sub&gt;, and c&lt;sub&gt;s&lt;/sub&gt; metrics and the principal eigenvector. Our approach has been in active use in the physics lab for over a year. It correctly displays structures already known; it displays the data in a spatially and temporally smoother way than earlier approaches, avoiding confusing grid effects and facilitating the study of multiple time steps; it extends the use of tools developed for visualizing diffusion tensor data, re-interpreting them in the context of molecular simulations; and it has answered long-standing questions regarding the orientation of molecules around defects and the conformational changes of the defects",Vadim A. Slavin;Robert Pelcovits;George Loriot;Andrew Callan-Jones;David H. Laidlaw,Vadim Slavin;Robert Pelcovits;George Loriot;Andrew Callan-Jones;David Laidlaw,,10.1109/VISUAL.1998.745294;10.1109/VISUAL.2004.23,"Tensor Visualization, Case Studies, Liquid Crystals, Molecular Modeling",12,12,16,
Vis,2007,Tile-based Level of Detail for the Parallel Age ,10.1109/TVCG.2007.70587,http://dx.doi.org/10.1109/TVCG.2007.70587,1352,1359,J,"Today's PCs incorporate multiple CPUs and GPUs and are easily arranged in clusters for high-performance, interactive graphics. We present an approach based on hierarchical, screen-space tiles to parallelizing rendering with level of detail. Adapt tiles, render tiles, and machine tiles are associated with CPUs, GPUs, and PCs, respectively, to efficiently parallelize the workload with good resource utilization. Adaptive tile sizes provide load balancing while our level of detail system allows total and independent management of the load on CPUs and GPUs. We demonstrate our approach on parallel configurations consisting of both single PCs and a cluster of PCs.",Krzysztof Niski;Jonathan D. Cohen 0001,Krzysztof Niski;Jonathan D. Cohen,NVIDIA Corporation;Lawrence Livermore National Laboratory,10.1109/VISUAL.2005.1532786,"Geometric calibration, photometric calibration, tiled displays",12,6,22,
VAST,2008,Configurable Spaces: Temporal analysis in diagrammatic contexts,10.1109/VAST.2008.4677355,http://dx.doi.org/10.1109/VAST.2008.4677355,43,50,C,"Social network graphs, concept maps, and process charts are examples of diagrammatic representations employed by intelligence analysts to understand complex systems. Unfortunately, these 2D representations currently do not easily convey the flow, sequence, tempo and other important dynamic behaviors within these systems. In this paper we present Configurable Spaces, a novel analytical method for visualizing patterns of activity over time in complex diagrammatically- represented systems. Configurable Spaces extends GeoTime's X, Y, T coordinate workspace space for temporal analysis to any arbitrary diagrammatic work space by replacing a geographic map with a diagram. This paper traces progress from concept to prototype, and discusses how diagrams can be created, transformed and leveraged for analysis, including generating diagrams from knowledge bases, visualizing temporal concept maps, and the use of linked diagrams for exploring complex, multi-dimensional, sequences of events. An evaluation of the prototype by the National Institute of Standards and Technology showed intelligence analysts believed they were able to attain an increased level of insight, were able to explore data more efficiently, and that Configurable Spaces would help them work faster.",Thomas Kapler;Ryan Eccles;Robert Harper 0002;William Wright,Thomas Kapler;Ryan Eccles;Robert Harper;William Wright,"Oculus Info Inc., USA;Oculus Info Inc., USA;Oculus Info Inc., USA;Oculus Info Inc., USA",10.1109/VAST.2006.261450;10.1109/INFVIS.2001.963281;10.1109/INFVIS.2004.27;10.1109/INFVIS.2002.1173160,"human information interaction, visual analytics, graph visualization, geo-temporal analysis, concept maps",12,7,28,
Vis,2008,Effects of Video Placement and Spatial Context Presentation on Path Reconstruction Tasks with Contextualized Videos,10.1109/TVCG.2008.126,http://dx.doi.org/10.1109/TVCG.2008.126,1755,1762,J,"Many interesting and promising prototypes for visualizing video data have been proposed, including those that combine videos with their spatial context (contextualized videos). However, relatively little work has investigated the fundamental design factors behind these prototypes in order to provide general design guidance. Focusing on real-time video data visualization, we evaluated two important design factors - video placement method and spatial context presentation method - through a user study. In addition, we evaluated the effect of spatial knowledge of the environment. Participantspsila performance was measured through path reconstruction tasks, where the participants followed a target through simulated surveillance videos and marked the target paths on the environment model. We found that embedding videos inside the model enabled realtime strategies and led to faster performance. With the help of contextualized videos, participants not familiar with the real environment achieved similar task performance to participants that worked in that environment. We discuss design implications and provide general design recommendations for traffic and security surveillance system interfaces.",Yi Wang;Doug A. Bowman;David M. Krum;Enylton Machado Coelho;Tonya L. Smith-Jackson;David Bailey;Sarah Peck;Swethan Anand;Trevor Kennedy;Yernar Abdrazakov,Yi Wang;Doug Bowman;David Krum;Enylton Coalho;Tonya Smith-Jackson;David Bailey;Sarah Peck;Swethan Anand;Trevor Kennedy;Yernar Abdrazakov,Virginia Tech;Virginia Tech;Bosch RTC;Bosch RTC;Virginia Tech;Virginia Tech;Virginia Tech;Virginia Tech;Virginia Tech;Virginia Tech,10.1109/TVCG.2007.70621;10.1109/TVCG.2007.70544;10.1109/VISUAL.2003.1250400,"contextualized videos, design factors, user study, video placement, spatial context, tracking, path reconstruction",12,7,21,
Vis,2008,Visualization of Cellular and Microvascular Relationships,10.1109/TVCG.2008.179,http://dx.doi.org/10.1109/TVCG.2008.179,1611,1618,J,"Understanding the structure of microvasculature structures and their relationship to cells in biological tissue is an important and complex problem. Brain microvasculature in particular is known to play an important role in chronic diseases. However, these networks are only visible at the microscopic level and can span large volumes of tissue. Due to recent advances in microscopy, large volumes of data can be imaged at the resolution necessary to reconstruct these structures. Due to the dense and complex nature of microscopy data sets, it is important to limit the amount of information displayed. In this paper, we describe methods for encoding the unique structure of microvascular data, allowing researchers to selectively explore microvascular anatomy. We also identify the queries most useful to researchers studying microvascular and cellular relationships. By associating cellular structures with our microvascular framework, we allow researchers to explore interesting anatomical relationships in dense and complex data sets.",David Mayerich;Louise C. Abbott;John Keyser,David Mayerich;Louise Abbott;John Keyser,Texas A&MUniversity;Texas A&MUniversity;Texas A&MUniversity,10.1109/VISUAL.2005.1532859;10.1109/VISUAL.1997.663917;10.1109/TVCG.2006.197;10.1109/TVCG.2007.70532,"microscopy, biomedical, medical, blood vessels, cells",12,13,35,
InfoVis,2009,GeneShelf: A Web-based Visual Interface for Large Gene Expression Time-Series Data Repositories,10.1109/TVCG.2009.146,http://dx.doi.org/10.1109/TVCG.2009.146,905,912,J,"A widespread use of high-throughput gene expression analysis techniques enabled the biomedical research community to share a huge body of gene expression datasets in many public databases on the web. However, current gene expression data repositories provide static representations of the data and support limited interactions. This hinders biologists from effectively exploring shared gene expression datasets. Responding to the growing need for better interfaces to improve the utility of the public datasets, we have designed and developed a new web-based visual interface entitled GeneShelf (http://bioinformatics.cnmcresearch.org/GeneShelf). It builds upon a zoomable grid display to represent two categorical dimensions. It also incorporates an augmented timeline with expandable time points that better shows multiple data values for the focused time point by embedding bar charts. We applied GeneShelf to one of the largest microarray datasets generated to study the progression and recovery process of injuries at the spinal cord of mice and rats. We present a case study and a preliminary qualitative user study with biologists to show the utility and usability of GeneShelf.",Bo Hyoung Kim;Bongshin Lee;Susan Knoblach;Eric P. Hoffman;Jinwook Seo,Bohyoung Kim;Bongshin Lee;Susan Knoblach;Eric Hoffman;Jinwook Seo,Seoul National University;Microsoft Research;Children's National Medical Center;Children's National Medical Center;Seoul National University,,"bioinformatics visualization, augmented timeline, animation, zoomable grid, gene expression profiling",12,9,26,
InfoVis,2011,Developing and Evaluating Quilts for the Depiction of Large Layered Graphs,10.1109/TVCG.2011.187,http://dx.doi.org/10.1109/TVCG.2011.187,2268,2275,J,"Traditional layered graph depictions such as flow charts are in wide use. Yet as graphs grow more complex, these depictions can become difficult to understand. Quilts are matrix-based depictions for layered graphs designed to address this problem. In this research, we first improve Quilts by developing three design alternatives, and then compare the best of these alternatives to better-known node-link and matrix depictions. A primary weakness in Quilts is their depiction of skip links, links that do not simply connect to a succeeding layer. Therefore in our first study, we compare Quilts using color-only, text-only, and mixed (color and text) skip link depictions, finding that path finding with the color-only depiction is significantly slower and less accurate, and that in certain cases, the mixed depiction offers an advantage over the text-only depiction. In our second study, we compare Quilts using the mixed depiction to node-link diagrams and centered matrices. Overall results show that users can find paths through graphs significantly faster with Quilts (46.6 secs) than with node-link (58.3 secs) or matrix (71.2 secs) diagrams. This speed advantage is still greater in large graphs (e.g. in 200 node graphs, 55.4 secs vs. 71.1 secs for node-link and 84.2 secs for matrix depictions).",Juhee Bae;Benjamin Watson,Juhee Bae;Benjamin Watson,North Carolina State University;North Carolina State University,10.1109/TVCG.2010.159;10.1109/INFVIS.2004.1;10.1109/TVCG.2007.70582,"Graph drawing, layered graphs, matrix based depiction, node-link diagram",12,12,16,
VAST,2011,Supporting effective common ground construction in Asynchronous Collaborative Visual Analytics,10.1109/VAST.2011.6102447,http://dx.doi.org/10.1109/VAST.2011.6102447,101,110,C,"Asynchronous Collaborative Visual Analytics (ACVA) leverages group sensemaking by releasing the constraints on when, where, and who works collaboratively. A significant task to be addressed before ACVA can reach its full potential is effective common ground construction, namely the process in which users evaluate insights from individual work to develop a shared understanding of insights and collectively pool them. This is challenging due to the lack of instant communication and scale of collaboration in ACVA. We propose a novel visual analytics approach that automatically gathers, organizes, and summarizes insights to form common ground with reduced human effort. The rich set of visualization and interaction techniques provided in our approach allows users to effectively and flexibly control the common ground construction and review, explore, and compare insights in detail. A working prototype of the approach has been implemented. We have conducted a case study and a user study to demonstrate its effectiveness.",Yang Chen;Jamal Alsakran;Scott Barlowe;Jing Yang 0001;Ye Zhao,Yang Chen;Jamal Alsakran;Scott Barlowe;Jing Yang;Ye Zhao,"University of North Carolina at Charlotte, USA;Kent State University, USA;University of North Carolina at Charlotte, USA;University of North Carolina at Charlotte, USA;Kent State University, USA",10.1109/TVCG.2007.70541;10.1109/VAST.2009.5333023;10.1109/TVCG.2007.70577;10.1109/VAST.2010.5652879;10.1109/VAST.2008.4677358;10.1109/VAST.2010.5652932;10.1109/VAST.2007.4389011;10.1109/VAST.2008.4677365;10.1109/TVCG.2006.166;10.1109/VAST.2010.5652885,"Visual analytics, asynchronous collaboration, insight, multidimensional visualization",12,10,30,
Vis,2011,An Interactive Local Flattening Operator to Support Digital Investigations on Artwork Surfaces,10.1109/TVCG.2011.165,http://dx.doi.org/10.1109/TVCG.2011.165,1989,1996,J,"Analyzing either high-frequency shape detail or any other 2D fields (scalar or vector) embedded over a 3D geometry is a complex task, since detaching the detail from the overall shape can be tricky. An alternative approach is to move to the 2D space, resolving shape reasoning to easier image processing techniques. In this paper we propose a novel framework for the analysis of 2D information distributed over 3D geometry, based on a locally smooth parametrization technique that allows us to treat local 3D data in terms of image content. The proposed approach has been implemented as a sketch-based system that allows to design with a few gestures a set of (possibly overlapping) parameterizations of rectangular portions of the surface. We demonstrate that, due to the locality of the parametrization, the distortion is under an acceptable threshold, while discontinuities can be avoided since the parametrized geometry is always homeomorphic to a disk. We show the effectiveness of the proposed technique to solve specific Cultural Heritage (CH) tasks: the analysis of chisel marks over the surface of a unfinished sculpture and the local comparison of multiple photographs mapped over the surface of an artwork. For this very difficult task, we believe that our framework and the corresponding tool are the first steps toward a computer-based shape reasoning system, able to support CH scholars with a medium they are more used to.",Nico Pietroni;Massimiliano Corsini;Paolo Cignoni;Roberto Scopigno,Nico Pietroni;Corsini Massimiliano;Paolo Cignoni;Roberto Scopigno,ISTI-CNR;ISTI-CNR;ISTI-CNR;ISTI-CNR,10.1109/VISUAL.2004.75,"Surface Characterization, Interactive Inspection, Cultural Heritage, Mesh Parameterization, Image Processing",12,10,27,
Vis,2011,Features in Continuous Parallel Coordinates,10.1109/TVCG.2011.200,http://dx.doi.org/10.1109/TVCG.2011.200,1912,1921,J,"Continuous Parallel Coordinates (CPC) are a contemporary visualization technique in order to combine several scalar fields, given over a common domain. They facilitate a continuous view for parallel coordinates by considering a smooth scalar field instead of a finite number of straight lines. We show that there are feature curves in CPC which appear to be the dominant structures of a CPC. We present methods to extract and classify them and demonstrate their usefulness to enhance the visualization of CPCs. In particular, we show that these feature curves are related to discontinuities in Continuous Scatterplots (CSP). We show this by exploiting a curve-curve duality between parallel and Cartesian coordinates, which is a generalization of the well-known point-line duality. Furthermore, we illustrate the theoretical considerations. Concluding, we discuss relations and aspects of the CPC's/CSP's features concerning the data analysis.",Dirk J. Lehmann;Holger Theisel,Dirk J. Lehmann;Holger Theisel,"Department of Simulation and Graphics, University of Magdeburg, Germany;Department of Simulation and Graphics, University of Magdeburg, Germany",10.1109/TVCG.2008.119;10.1109/TVCG.2010.146;10.1109/VISUAL.1998.745284;10.1109/TVCG.2009.131;10.1109/VISUAL.1999.809896,"Features, Parallel Coordinates, Topology, Visualization",12,10,28,
SciVis,2012,Automatic Tuning of Spatially Varying Transfer Functions for Blood Vessel Visualization,10.1109/TVCG.2012.203,http://dx.doi.org/10.1109/TVCG.2012.203,2345,2354,J,"Computed Tomography Angiography (CTA) is commonly used in clinical routine for diagnosing vascular diseases. The procedure involves the injection of a contrast agent into the blood stream to increase the contrast between the blood vessels and the surrounding tissue in the image data. CTA is often visualized with Direct Volume Rendering (DVR) where the enhanced image contrast is important for the construction of Transfer Functions (TFs). For increased efficiency, clinical routine heavily relies on preset TFs to simplify the creation of such visualizations for a physician. In practice, however, TF presets often do not yield optimal images due to variations in mixture concentration of contrast agent in the blood stream. In this paper we propose an automatic, optimization-based method that shifts TF presets to account for general deviations and local variations of the intensity of contrast enhanced blood vessels. Some of the advantages of this method are the following. It computationally automates large parts of a process that is currently performed manually. It performs the TF shift locally and can thus optimize larger portions of the image than is possible with manual interaction. The method is based on a well known vesselness descriptor in the definition of the optimization criterion. The performance of the method is illustrated by clinically relevant CT angiography datasets displaying both improved structural overviews of vessel trees and improved adaption to local variations of contrast concentration.",Gunnar Läthén;Stefan Lindholm;Reiner Lenz;Anders Persson;Magnus Borga,Gunnar Läthén;Stefan Lindholm;Reiner Lenz;Anders Persson;Magnus Borga,Linköping University;Linköping University;Linköping University;Linköping University;Linköping University,10.1109/VISUAL.2003.1250414;10.1109/TVCG.2009.120;10.1109/VISUAL.2001.964516;10.1109/VISUAL.1996.568113;10.1109/TVCG.2008.162;10.1109/TVCG.2010.195;10.1109/TVCG.2008.123,"Direct volume rendering, transfer functions, vessel visualization",12,10,34,
SciVis,2012,Human Computation in Visualization: Using Purpose Driven Games for Robust Evaluation of Visualization Algorithms,10.1109/TVCG.2012.234,http://dx.doi.org/10.1109/TVCG.2012.234,2104,2113,J,"Due to the inherent characteristics of the visualization process, most of the problems in this field have strong ties with human cognition and perception. This makes the human brain and sensory system the only truly appropriate evaluation platform for evaluating and fine-tuning a new visualization method or paradigm. However, getting humans to volunteer for these purposes has always been a significant obstacle, and thus this phase of the development process has traditionally formed a bottleneck, slowing down progress in visualization research. We propose to take advantage of the newly emerging field of Human Computation (HC) to overcome these challenges. HC promotes the idea that rather than considering humans as users of the computational system, they can be made part of a hybrid computational loop consisting of traditional computation resources and the human brain and sensory system. This approach is particularly successful in cases where part of the computational problem is considered intractable using known computer algorithms but is trivial to common sense human knowledge. In this paper, we focus on HC from the perspective of solving visualization problems and also outline a framework by which humans can be easily seduced to volunteer their HC resources. We introduce a purpose-driven game titled “Disguise” which serves as a prototypical example for how the evaluation of visualization algorithms can be mapped into a fun and addicting activity, allowing this task to be accomplished in an extensive yet cost effective way. Finally, we sketch out a framework that transcends from the pure evaluation of existing visualization methods to the design of a new one.",Nafees Ahmed;Ziyi Zheng;Klaus Mueller,Nafees Ahmed;Ziyi Zheng;Klaus Mueller,Stony Brook University;Stony Brook University;Stony Brook University,10.1109/TVCG.2009.172;10.1109/TVCG.2011.218;10.1109/TVCG.2009.189;10.1109/VISUAL.2005.1532781;10.1109/TVCG.2012.186;10.1109/TVCG.2008.118;10.1109/TVCG.2009.150,"Human computation, perception, evaluation, color blending",12,9,46,
SciVis,2013,Vessel Visualization using Curved Surface Reformation,10.1109/TVCG.2013.215,http://dx.doi.org/10.1109/TVCG.2013.215,2858,2867,J,"Visualizations of vascular structures are frequently used in radiological investigations to detect and analyze vascular diseases. Obstructions of the blood flow through a vessel are one of the main interests of physicians, and several methods have been proposed to aid the visual assessment of calcifications on vessel walls. Curved Planar Reformation (CPR) is a wide-spread method that is designed for peripheral arteries which exhibit one dominant direction. To analyze the lumen of arbitrarily oriented vessels, Centerline Reformation (CR) has been proposed. Both methods project the vascular structures into 2D image space in order to reconstruct the vessel lumen. In this paper, we propose Curved Surface Reformation (CSR), a technique that computes the vessel lumen fully in 3D. This offers high-quality interactive visualizations of vessel lumina and does not suffer from problems of earlier methods such as ambiguous visibility cues or premature discretization of centerline data. Our method maintains exact visibility information until the final query of the 3D lumina data. We also present feedback from several domain experts.",Thomas Auzinger;Gabriel Mistelbauer;Ivan Baclija;Rüdiger Schernthaner;Arnold Köchl;Michael Wimmer;M. Eduard Gröller;Stefan Bruckner,Thomas Auzinger;Gabriel Mistelbauer;Ivan Baclija;Rüdiger Schernthaner;Arnold Köchl;Michael Wimmer;M. Eduard Gröller;Stefan Bruckner,Vienna University of Technology;Vienna University of Technology;Kaiser-Franz-Josef Hospital Vienna;Medical University of Vienna;Landesklinikum Tulln;Vienna University of Technology;Vienna University of Technology;University of Bergen,10.1109/TVCG.2009.138;10.1109/VISUAL.2004.104;10.1109/VISUAL.2003.1250353;10.1109/VISUAL.2003.1250400;10.1109/TVCG.2006.152;10.1109/TVCG.2009.136;10.1109/VISUAL.2002.1183754;10.1109/TVCG.2011.244;10.1109/VISUAL.2003.1250351;10.1109/TVCG.2006.201;10.1109/VISUAL.2001.964555,"Reformation, volume rendering, surface approximation",12,7,40,
InfoVis,2014,Axis Calibration for Improving Data Attribute Estimation in Star Coordinates Plots,10.1109/TVCG.2014.2346258,http://dx.doi.org/10.1109/TVCG.2014.2346258,2013,2022,J,"Star coordinates is a well-known multivariate visualization method that produces linear dimensionality reduction mappings through a set of radial axes defined by vectors in an observable space. One of its main drawbacks concerns the difficulty to recover attributes of data samples accurately, which typically lie in the [0], [1] interval, given the locations of the low-dimensional embeddings and the vectors. In this paper we show that centering the data can considerably increase attribute estimation accuracy, where data values can be read off approximately by projecting embedded points onto calibrated (i.e., labeled) axes, similarly to classical statistical biplots. In addition, this idea can be coupled with a recently developed orthonormalization process on the axis vectors that prevents unnecessary distortions. We demonstrate that the combination of both approaches not only enhances the estimates, but also provides more faithful representations of the data.",Manuel Rubio-Sánchez;Alberto Sánchez 0001,Manuel Rubio-Sánchez;Alberto Sanchez,URJC;URJC,10.1109/TVCG.2010.209;10.1109/TVCG.2013.182;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1997.663916,"Star Coordinates, RadViz, Biplots, Axis calibration, Attribute value estimation, Data centering, Orthographic projection",12,11,25,
InfoVis,2014,Order of Magnitude Markers: An Empirical Study on Large Magnitude Number Detection,10.1109/TVCG.2014.2346428,http://dx.doi.org/10.1109/TVCG.2014.2346428,2261,2270,J,"In this paper we introduce Order of Magnitude Markers (OOMMs) as a new technique for number representation. The motivation for this work is that many data sets require the depiction and comparison of numbers that have varying orders of magnitude. Existing techniques for representation use bar charts, plots and colour on linear or logarithmic scales. These all suffer from related problems. There is a limit to the dynamic range available for plotting numbers, and so the required dynamic range of the plot can exceed that of the depiction method. When that occurs, resolving, comparing and relating values across the display becomes problematical or even impossible for the user. With this in mind, we present an empirical study in which we compare logarithmic, linear, scale-stack bars and our new markers for 11 different stimuli grouped into 4 different tasks across all 8 marker types.",Rita Borgo;Joel Dearden;Mark W. Jones,Rita Borgo;Joel Dearden;Mark W. Jones,Swansea University;Swansea University;Swansea University,10.1109/TVCG.2013.187;10.1109/TVCG.2012.229;10.1109/INFVIS.2004.59;10.1109/TVCG.2012.197;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2011.160;10.1109/TVCG.2010.130;10.1109/TVCG.2013.234,"Orders of magnitude, bar charts, logarithmic scale",12,10,26,
SciVis,2014,ViSlang: A System for Interpreted Domain-Specific Languages for Scientific Visualization,10.1109/TVCG.2014.2346318,http://dx.doi.org/10.1109/TVCG.2014.2346318,2388,2396,J,"Researchers from many domains use scientific visualization in their daily practice. Existing implementations of algorithms usually come with a graphical user interface (high-level interface), or as software library or source code (low-level interface). In this paper we present a system that integrates domain-specific languages (DSLs) and facilitates the creation of new DSLs. DSLs provide an effective interface for domain scientists avoiding the difficulties involved with low-level interfaces and at the same time offering more flexibility than high-level interfaces. We describe the design and implementation of ViSlang, an interpreted language specifically tailored for scientific visualization. A major contribution of our design is the extensibility of the ViSlang language. Novel DSLs that are tailored to the problems of the domain can be created and integrated into ViSlang. We show that our approach can be added to existing user interfaces to increase the flexibility for expert users on demand, but at the same time does not interfere with the user experience of novice users. To demonstrate the flexibility of our approach we present new DSLs for volume processing, querying and visualization. We report the implementation effort for new DSLs and compare our approach with Matlab and Python implementations in terms of run-time performance.",Peter Rautek;Stefan Bruckner;M. Eduard Gröller;Markus Hadwiger,Peter Rautek;Stefan Bruckner;M. Eduard Gröller;Markus Hadwiger,KAUST;University of Bergen;Vienna University of Technology;KAUST,10.1109/VISUAL.2005.1532792;10.1109/VISUAL.1992.235219;10.1109/TVCG.2009.174;10.1109/TVCG.2014.2346322;10.1109/VISUAL.2004.95;10.1109/TVCG.2011.185;10.1109/VISUAL.2005.1532788;10.1109/VISUAL.1992.235202;10.1109/TVCG.2008.184,"Domain-specific languages, Volume visualization, Volume visualization framework",12,14,42,
VAST,2014,Transforming Scagnostics to Reveal Hidden Features,10.1109/TVCG.2014.2346572,http://dx.doi.org/10.1109/TVCG.2014.2346572,1624,1632,J,"Scagnostics (Scatterplot Diagnostics) were developed by Wilkinson et al. based on an idea of Paul and John Tukey, in order to discern meaningful patterns in large collections of scatterplots. The Tukeys' original idea was intended to overcome the impediments involved in examining large scatterplot matrices (multiplicity of plots and lack of detail). Wilkinson's implementation enabled for the first time scagnostics computations on many points as well as many plots. Unfortunately, scagnostics are sensitive to scale transformations. We illustrate the extent of this sensitivity and show how it is possible to pair statistical transformations with scagnostics to enable discovery of hidden structures in data that are not discernible in untransformed visualizations.",Tommy Dang;Leland Wilkinson,Tuan Nhon Dang;Leland Wilkinson,"Department of Computer Science, University of Illinois at Chicago;Department of Computer Science, Skytree Software Inc.",10.1109/TVCG.2006.163;10.1109/INFVIS.2005.1532142;10.1109/TVCG.2013.187;10.1109/TVCG.2011.167;10.1109/VAST.2006.261423;10.1109/TVCG.2010.184;10.1109/VAST.2011.6102437;10.1109/VAST.2007.4389006,"Scagnostics, Scatterplot matrix, Transformation, High-Dimensional Visual Analytics",12,16,44,
VAST,2014,ConTour: Data-Driven Exploration of Multi-Relational Datasets for Drug Discovery,10.1109/TVCG.2014.2346752,http://dx.doi.org/10.1109/TVCG.2014.2346752,1883,1892,J,"Large scale data analysis is nowadays a crucial part of drug discovery. Biologists and chemists need to quickly explore and evaluate potentially effective yet safe compounds based on many datasets that are in relationship with each other. However, there is a lack of tools that support them in these processes. To remedy this, we developed ConTour, an interactive visual analytics technique that enables the exploration of these complex, multi-relational datasets. At its core ConTour lists all items of each dataset in a column. Relationships between the columns are revealed through interaction: selecting one or multiple items in one column highlights and re-sorts the items in other columns. Filters based on relationships enable drilling down into the large data space. To identify interesting items in the first place, ConTour employs advanced sorting strategies, including strategies based on connectivity strength and uniqueness, as well as sorting based on item attributes. ConTour also introduces interactive nesting of columns, a powerful method to show the related items of a child column for each item in the parent column. Within the columns, ConTour shows rich attribute data about the items as well as information about the connection strengths to other datasets. Finally, ConTour provides a number of detail views, which can show items from multiple datasets and their associated data at the same time. We demonstrate the utility of our system in case studies conducted with a team of chemical biologists, who investigate the effects of chemical compounds on cells and need to understand the underlying mechanisms.",Christian Partl;Alexander Lex;Marc Streit;Hendrik Strobelt;Anne Mai Wassermann;Hanspeter Pfister;Dieter Schmalstieg,Christian Partl;Alexander Lex;Marc Streit;Hendrik Strobelt;Anne-Mai Wassermann;Hanspeter Pfister;Dieter Schmalstieg,Graz University of Technology;Harvard University;Johannes Kepler University Linz;Harvard University;Novartis Institutes for BicMedical Research;Harvard University;Graz University of Technology,10.1109/TVCG.2013.167;10.1109/TVCG.2012.213;10.1109/TVCG.2012.252;10.1109/VAST.2007.4389006;10.1109/TVCG.2006.166;10.1109/TVCG.2013.223,"Multi-relational data, visual data analysis, drug discovery",12,15,30,
VAST,2014,Baseball4D: A Tool for Baseball Game Reconstruction & Visualization,10.1109/VAST.2014.7042478,http://dx.doi.org/10.1109/VAST.2014.7042478,23,32,C,"While many sports use statistics and video to analyze and improve game play, baseball has led the charge throughout its history. With the advent of new technologies that allow all players and the ball to be tracked across the entire field, it is now possible to bring this understanding to another level. From discrete positions across time, we present techniques to reconstruct entire baseball games and visually explore each play. This provides opportunities to not only derive new metrics for the game, but also allow us to investigate existing measures with targeted visualizations. In addition, our techniques allow users to filter on demand so specific situations can be analyzed both in general and according to those situations. We show that gameplay can be accurately reconstructed from the raw position data and discuss how visualization and statistical methods can combine to better inform baseball analyses.",Carlos A. Dietrich;David Koop;Huy T. Vo;Cláudio T. Silva,Carlos Dietrich;David Koop;Huy T. Vo;Cláudio T. Silva,NYU;NYU;NYU,10.1109/TVCG.2012.263;10.1109/TVCG.2013.192;10.1109/TVCG.2012.225;10.1109/VISUAL.2001.964496,"sports visualization, sports analytics, baseball, game reconstruction, baseball metrics, event data",12,15,35,
InfoVis,2015,A Psychophysical Investigation of Size as a Physical Variable,10.1109/TVCG.2015.2467951,http://dx.doi.org/10.1109/TVCG.2015.2467951,479,488,J,"Physical visualizations, or data physicalizations, encode data in attributes of physical shapes. Despite a considerable body of work on visual variables, “physical variables” remain poorly understood. One of them is physical size. A difficulty for solid elements is that “size” is ambiguous - it can refer to either length/diameter, surface, or volume. Thus, it is unclear for designers of physicalizations how to effectively encode quantities in physical size. To investigate, we ran an experiment where participants estimated ratios between quantities represented by solid bars and spheres. Our results suggest that solid bars are compared based on their length, consistent with previous findings for 2D and 3D bars on flat media. But for spheres, participants' estimates are rather proportional to their surface. Depending on the estimation method used, judgments are rather consistent across participants, thus the use of perceptually-optimized size scales seems possible. We conclude by discussing implications for the design of data physicalizations and the need for more empirical studies on physical variables.",Yvonne Jansen;Kasper Hornbæk,Yvonne Jansen;Kasper Hornbæk,University of Copenhagen;University of Copenhagen,10.1109/TVCG.2012.251;10.1109/TVCG.2013.234;10.1109/TVCG.2012.220;10.1109/TVCG.2013.134;10.1109/TVCG.2007.70541;10.1109/TVCG.2014.2352953;10.1109/TVCG.2014.2346320,"Data physicalization, physical visualization, psychophysics, experiment, physical variable",12,8,65,
SciVis,2015,CPU Ray Tracing Large Particle Data with Balanced P-k-d Trees,10.1109/SciVis.2015.7429492,http://dx.doi.org/10.1109/SciVis.2015.7429492,57,64,C,"We present a novel approach to rendering large particle data sets from molecular dynamics, astrophysics and other sources. We employ a new data structure adapted from the original balanced k-d tree, which allows for representation of data with trivial or no overhead. In the OSPRay visualization framework, we have developed an efficient CPU algorithm for traversing, classifying and ray tracing these data. Our approach is able to render up to billions of particles on a typical workstation, purely on the CPU, without any approximations or level-of-detail techniques, and optionally with attribute-based color mapping, dynamic range query, and advanced lighting models such as ambient occlusion and path tracing.",Ingo Wald;Aaron Knoll;Gregory P. Johnson;William Usher;Valerio Pascucci;Michael E. Papka,Ingo Wald;Aaron Knoll;Gregory P. Johnson;Will Usher;Valerio Pascucci;Michael E. Papka,"Intel Corporation;SCI Institute, University of Utah;Intel Corporation;SCI Institute, University of Utah;SCI Institute, University of Utah;Argonne National Laboratory, Northern Illinois University",10.1109/TVCG.2010.148;10.1109/TVCG.2009.142;10.1109/TVCG.2012.282,"Ray tracing, Visualization, Particle Data, k-d Trees",12,14,27,
SciVis,2015,Intuitive Exploration of Volumetric Data Using Dynamic Galleries,10.1109/TVCG.2015.2467294,http://dx.doi.org/10.1109/TVCG.2015.2467294,896,905,J,"In this work we present a volume exploration method designed to be used by novice users and visitors to science centers and museums. The volumetric digitalization of artifacts in museums is of rapidly increasing interest as enhanced user experience through interactive data visualization can be achieved. This is, however, a challenging task since the vast majority of visitors are not familiar with the concepts commonly used in data exploration, such as mapping of visual properties from values in the data domain using transfer functions. Interacting in the data domain is an effective way to filter away undesired information but it is difficult to predict where the values lie in the spatial domain. In this work we make extensive use of dynamic previews instantly generated as the user explores the data domain. The previews allow the user to predict what effect changes in the data domain will have on the rendered image without being aware that visual parameters are set in the data domain. Each preview represents a subrange of the data domain where overview and details are given on demand through zooming and panning. The method has been designed with touch interfaces as the target platform for interaction. We provide a qualitative evaluation performed with visitors to a science center to show the utility of the approach.",Daniel Jönsson;Martin Falk;Anders Ynnerman,Daniel Jönsson;Martin Falk;Anders Ynnerman,"Linköping University, Sweden;Linköping University, Sweden;Linköping University, Sweden",10.1109/TVCG.2008.162;10.1109/TVCG.2011.261;10.1109/VISUAL.1996.568113;10.1109/TVCG.2012.231;10.1109/TVCG.2010.195;10.1109/TVCG.2011.224;10.1109/TVCG.2006.148;10.1109/TVCG.2011.218,"Transfer function, scalar fields, volume rendering, touch interaction, visualization, user interfaces",12,12,34,
SciVis,2015,Visualization-by-Sketching: An Artist's Interface for Creating Multivariate Time-Varying Data Visualizations,10.1109/TVCG.2015.2467153,http://dx.doi.org/10.1109/TVCG.2015.2467153,877,885,J,"We present Visualization-by-Sketching, a direct-manipulation user interface for designing new data visualizations. The goals are twofold: First, make the process of creating real, animated, data-driven visualizations of complex information more accessible to artists, graphic designers, and other visual experts with traditional, non-technical training. Second, support and enhance the role of human creativity in visualization design, enabling visual experimentation and workflows similar to what is possible with traditional artistic media. The approach is to conceive of visualization design as a combination of processes that are already closely linked with visual creativity: sketching, digital painting, image editing, and reacting to exemplars. Rather than studying and tweaking low-level algorithms and their parameters, designers create new visualizations by painting directly on top of a digital data canvas, sketching data glyphs, and arranging and blending together multiple layers of animated 2D graphics. This requires new algorithms and techniques to interpret painterly user input relative to data “under” the canvas, balance artistic freedom with the need to produce accurate data visualizations, and interactively explore large (e.g., terabyte-sized) multivariate datasets. Results demonstrate a variety of multivariate data visualization techniques can be rapidly recreated using the interface. More importantly, results and feedback from artists support the potential for interfaces in this style to attract new, creative users to the challenging task of designing more effective data visualizations and to help these users stay “in the creative zone” as they work.",David Schroeder;Daniel F. Keefe,David Schroeder;Daniel F. Keefe,"University of Minnesota;Department of Computer Science & Engineering, University of Minnesota",10.1109/VAST.2008.4677356;10.1109/TVCG.2009.181;10.1109/TVCG.2013.124;10.1109/TVCG.2011.202;10.1109/TVCG.2008.153;10.1109/TVCG.2013.226;10.1109/TVCG.2014.2346271;10.1109/INFVIS.2002.1173157;10.1109/TVCG.2009.145;10.1109/TVCG.2010.162;10.1109/INFVIS.2001.963286;10.1109/TVCG.2011.181;10.1109/TVCG.2012.265;10.1109/TVCG.2014.2346441,"Visualization design, multivariate, art, sketch, color map, glyph",12,14,31,BP
VAST,2015,Mixed-initiative visual analytics using task-driven recommendations,10.1109/VAST.2015.7347625,http://dx.doi.org/10.1109/VAST.2015.7347625,9,16,C,"Visual data analysis is composed of a collection of cognitive actions and tasks to decompose, internalize, and recombine data to produce knowledge and insight. Visual analytic tools provide interactive visual interfaces to data to support discovery and sensemaking tasks, including forming hypotheses, asking questions, and evaluating and organizing evidence. Myriad analytic models can be incorporated into visual analytic systems at the cost of increasing complexity in the analytic discourse between user and system. Techniques exist to increase the usability of interacting with analytic models, such as inferring data models from user interactions to steer the underlying models of the system via semantic interaction, shielding users from having to do so explicitly. Such approaches are often also referred to as mixed-initiative systems. Sensemaking researchers have called for development of tools that facilitate analytic sensemaking through a combination of human and automated activities. However, design guidelines do not exist for mixed-initiative visual analytic systems to support iterative sensemaking. In this paper, we present candidate design guidelines and introduce the Active Data Environment (ADE) prototype, a spatial workspace supporting the analytic process via task recommendations invoked by inferences about user interactions within the workspace. ADE recommends data and relationships based on a task model, enabling users to co-reason with the system about their data in a single, spatial workspace. This paper provides an illustrative use case, a technical description of ADE, and a discussion of the strengths and limitations of the approach.",Kristin A. Cook;Nick Cramer;David J. Israel;Michael Wolverton;Joe Bruce;Russ Burtner;Alex Endert,Kristin Cook;Nick Cramer;David Israel;Michael Wolverton;Joe Bruce;Russ Burtner;Alex Endert,"Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA;SRI International, USA;SRI International, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA;Georgia Institute of Technology, USA",10.1109/VAST.2012.6400486;10.1109/VAST.2011.6102438;10.1109/VAST.2012.6400559;10.1109/TVCG.2014.2346573;10.1109/VAST.2014.7042492;10.1109/TVCG.2008.174;10.1109/TVCG.2013.225,"mixed-initiative visual analytics, task modeling, recommender systems, sensemaking",12,12,36,
VAST,2015,iVizTRANS: Interactive visual learning for home and work place detection from massive public transportation data,10.1109/VAST.2015.7347630,http://dx.doi.org/10.1109/VAST.2015.7347630,49,56,C,"Using transport smart card transaction data to understand the homework dynamics of a city for urban planning is emerging as an alternative to traditional surveys which may be conducted every few years are no longer effective and efficient for the rapidly transforming modern cities. As commuters travel patterns are highly diverse, existing rule-based methods are not fully adequate. In this paper, we present iVizTRANS - a tool which combines an interactive visual analytics (VA) component to aid urban planners to analyse complex travel patterns and decipher activity locations for single public transport commuters. It is coupled with a machine learning component that iteratively learns from the planners classifications to train a classifier. The classifier is then applied to the city-wide smart card data to derive the dynamics for all public transport commuters. Our evaluation shows it outperforms the rule-based methods in previous work.",Liang Yu;Wei Wu 0020;Xiaohui Li 0002;Guangxia Li;Wee Siong Ng;See-Kiong Ng;Zhongwen Huang;Anushiya Arunan;Hui Min Watt,Liang Yu;Wei Wu;Xiaohui Li;Guangxia Li;Wee Siong Ng;See-Kiong Ng;Zhongwen Huang;Anushiya Arunan;Hui Min Watt,"Institute for Infocomm Research, Singapore;Institute for Infocomm Research, Singapore;Institute for Infocomm Research, Singapore;Institute for Infocomm Research, Singapore;Institute for Infocomm Research, Singapore;Institute for Infocomm Research, Singapore;Urban Redevelopment Authority, Singapore;Urban Redevelopment Authority, Singapore;Urban Redevelopment Authority, Singapore",10.1109/INFVIS.2004.27;10.1109/INFVIS.2002.1173155,"Smart card data, origin-destination (OD), spatiotemporal visualization, clustering, machine learning",12,3,21,
InfoVis,2016,Investigating the Use of a Dynamic Physical Bar Chart for Data Exploration and Presentation,10.1109/TVCG.2016.2598498,http://dx.doi.org/10.1109/TVCG.2016.2598498,451,460,J,"Physical data representations, or data physicalizations, are a promising new medium to represent and communicate data. Previous work mostly studied passive physicalizations which require humans to perform all interactions manually. Dynamic shape-changing displays address this limitation and facilitate data exploration tasks such as sorting, navigating in data sets which exceed the fixed size of a given physical display, or preparing “views” to communicate insights about data. However, it is currently unclear how people approach and interact with such data representations. We ran an exploratory study to investigate how non-experts made use of a dynamic physical bar chart for an open-ended data exploration and presentation task. We asked 16 participants to explore a data set on European values and to prepare a short presentation of their insights using a physical display. We analyze: (1) users' body movements to understand how they approach and react to the physicalization, (2) their hand-gestures to understand how they interact with physical data, (3) system interactions to understand which subsets of the data they explored and which features they used in the process, and (4) strategies used to explore the data and present observations. We discuss the implications of our findings for the use of dynamic data physicalizations and avenues for future work.",Faisal Taher;Yvonne Jansen;Jonathan Woodruff;John Hardy;Kasper Hornbæk;Jason Alexander,Faisal Taher;Yvonne Jansen;Jonathan Woodruff;John Hardy;Kasper Hornbæk;Jason Alexander,Lancaster University;University of Copenhagen;Lancaster University;Lancaster University;University of Copenhagen;Lancaster University,10.1109/TVCG.2014.2346292;10.1109/TVCG.2014.2352953;10.1109/TVCG.2013.124,Shape-changing displays;physicalization;physical visualization;bar charts;user behaviour;data presentation,12,13,33,
InfoVis,2016,VizItCards: A Card-Based Toolkit for Infovis Design Education,10.1109/TVCG.2016.2599338,http://dx.doi.org/10.1109/TVCG.2016.2599338,561,570,J,"Shifts in information visualization practice are forcing a reconsideration of how infovis is taught. Traditional curricula that focused on conveying research-derived knowledge are slowly integrating design thinking as a key learning objective. In part, this is motivated by the realization that infovis is a wicked design problem, requiring a different kind of design work. In this paper we describe, VizItCards, a card-driven workshop developed for our graduate infovis class. The workshop is intended to provide practice with good design techniques and to simultaneously reinforce key concepts. VizItCards relies on principles of collaborative-learning and research on parallel design to generate positive collaborations and high-quality designs. From our experience of simulating a realistic design scenario in a classroom setting, we find that our students were able to meet key learning objectives and their design performance improved during the class. We describe variants of the workshop, discussing which techniques we think match to which learning goals.",Shiqing He;Eytan Adar,Shiqing He;Eytan Adar,School of Information at the University of Michigan;School of Information at the University of Michigan,10.1109/TVCG.2015.2467271;10.1109/TVCG.2012.213;10.1109/VAST.2009.5333245;10.1109/TVCG.2014.2346331;10.1109/INFVIS.1996.559229;10.1109/TVCG.2007.70515;10.1109/TVCG.2013.184;10.1109/TVCG.2009.111,information visualization education;peer learning;toolkit;card;design workshop,12,8,69,
SciVis,2016,Visualization of Time-Varying Weather Ensembles across Multiple Resolutions,10.1109/TVCG.2016.2598869,http://dx.doi.org/10.1109/TVCG.2016.2598869,841,850,J,"Uncertainty quantification in climate ensembles is an important topic for the domain scientists, especially for decision making in the real-world scenarios. With powerful computers, simulations now produce time-varying and multi-resolution ensemble data sets. It is of extreme importance to understand the model sensitivity given the input parameters such that more computation power can be allocated to the parameters with higher influence on the output. Also, when ensemble data is produced at different resolutions, understanding the accuracy of different resolutions helps the total time required to produce a desired quality solution with improved storage and computation cost. In this work, we propose to tackle these non-trivial problems on the Weather Research and Forecasting (WRF) model output. We employ a moment independent sensitivity measure to quantify and analyze parameter sensitivity across spatial regions and time domain. A comparison of clustering structures across three resolutions enables the users to investigate the sensitivity variation over the spatial regions of the five input parameters. The temporal trend in the sensitivity values is explored via an MDS view linked with a line chart for interactive brushing. The spatial and temporal views are connected to provide a full exploration system for complete spatio-temporal sensitivity analysis. To analyze the accuracy across varying resolutions, we formulate a Bayesian approach to identify which regions are better predicted at which resolutions compared to the observed precipitation. This information is aggregated over the time domain and finally encoded in an output image through a custom color map that guides the domain experts towards an adaptive grid implementation given a cost model. Users can select and further analyze the spatial and temporal error patterns for multi-resolution accuracy analysis via brushing and linking on the produced image. In this work, we collaborate with a domain expert whose feedback shows the effectiveness of our proposed exploration work-flow.",Ayan Biswas;Guang Lin;Xiaotong Liu;Han-Wei Shen,Ayan Biswas;Guang Lin;Xiaotong Liu;Han-Wei Shen,"GRAVITY group, The Ohio State University;Purdue University;GRAVITY group, The Ohio State University;GRAVITY group, The Ohio State University",10.1109/TVCG.2015.2467204;10.1109/TVCG.2010.181;10.1109/SciVis.2015.7429487;10.1109/TVCG.2013.138;10.1109/TVCG.2015.2468093;10.1109/TVCG.2013.143;10.1109/TVCG.2014.2346448;10.1109/VAST.2015.7347634;10.1109/TVCG.2012.249;10.1109/TVCG.2014.2346455;10.1109/TVCG.2013.144,Ensemble;time-varying;multi-resolution;sensitivity analysis,12,16,46,
VAST,2016,A Grammar-based Approach for Modeling User Interactions and Generating Suggestions During the Data Exploration Process,10.1109/TVCG.2016.2598471,http://dx.doi.org/10.1109/TVCG.2016.2598471,41,50,J,"Despite the recent popularity of visual analytics focusing on big data, little is known about how to support users that use visualization techniques to explore multi-dimensional datasets and accomplish specific tasks. Our lack of models that can assist end-users during the data exploration process has made it challenging to learn from the user's interactive and analytical process. The ability to model how a user interacts with a specific visualization technique and what difficulties they face are paramount in supporting individuals with discovering new patterns within their complex datasets. This paper introduces the notion of visualization systems understanding and modeling user interactions with the intent of guiding a user through a task thereby enhancing visual data exploration. The challenges faced and the necessary future steps to take are discussed; and to provide a working example, a grammar-based model is presented that can learn from user interactions, determine the common patterns among a number of subjects using a K-Reversible algorithm, build a set of rules, and apply those rules in the form of suggestions to new users with the goal of guiding them along their visual analytic process. A formal evaluation study with 300 subjects was performed showing that our grammar-based model is effective at capturing the interactive process followed by users and that further research in this area has the potential to positively impact how users interact with a visualization system.",Filip Dabek;Jesus J. Caban,Filip Dabek;Jesus J Caban,"National Intrepid Center of Excellence, Walter Reed National Military Medical Center, Bethesda, MD;National Intrepid Center of Excellence, Walter Reed National Military Medical Center, Bethesda, MD",10.1109/TVCG.2014.2346575;10.1109/TVCG.2015.2467613;10.1109/VAST.2010.5650854;10.1109/TVCG.2015.2467871;10.1109/VISUAL.2005.1532788;10.1109/TVCG.2012.219;10.1109/VAST.2009.5333020;10.1109/VAST.2006.261436;10.1109/TVCG.2015.2467611;10.1109/TVCG.2015.2467551;10.1109/VAST.2008.4677365;10.1109/TVCG.2007.70589,Machine Learning;Visual Analytics;User Interactions;Analytic Provenance,12,11,41,
VAST,2016,D-Map: Visual Analysis of Ego-centric Information Diffusion Patterns in Social Media,10.1109/VAST.2016.7883510,http://dx.doi.org/10.1109/VAST.2016.7883510,41,50,C,"Popular social media platforms could rapidly propagate vital information over social networks among a significant number of people. In this work we present D-Map (Diffusion Map), a novel visualization method to support exploration and analysis of social behaviors during such information diffusion and propagation on typical social media through a map metaphor. In D-Map, users who participated in reposting (i.e., resending a message initially posted by others) one central user's posts (i.e., a series of original tweets) are collected and mapped to a hexagonal grid based on their behavior similarities and in chronological order of the repostings. With additional interaction and linking, D-Map is capable of providing visual portraits of the influential users and describing their social behaviors. A comprehensive visual analysis system is developed to support interactive exploration with D-Map. We evaluate our work with real world social media data and find interesting patterns among users. Key players, important information diffusion paths, and interactions among social communities can be identified.",Siming Chen 0001;Shuai Chen 0001;Zhenhuang Wang;Jie Liang 0004;Xiaoru Yuan;Nan Cao;Yadong Wu,Siming Chen;Shuai Chen;Zhenhuang Wang;Jie Liang;Xiaoru Yuan;Nan Cao;Yadong Wu,"Key Laboratory of Machine Perception (Ministry of Education), Peking University, China;Key Laboratory of Machine Perception (Ministry of Education), Peking University, China;Key Laboratory of Machine Perception (Ministry of Education), Peking University, China;Faculty of Engineer and Information Technology, The University of Technology, Sydney, Australia;Key Laboratory of Machine Perception (Ministry of Education), Peking University, China;New York University, Shanghai, China;Southwest University of Science and Technology, China",10.1109/TVCG.2015.2467196;10.1109/TVCG.2014.2346922;10.1109/TVCG.2012.291;10.1109/TVCG.2010.154;10.1109/TVCG.2007.70582;10.1109/TVCG.2014.2346433;10.1109/INFVIS.2005.1532126;10.1109/TVCG.2013.221;10.1109/TVCG.2014.2346919;10.1109/TVCG.2014.2346920;10.1109/TVCG.2011.185;10.1109/TVCG.2014.2346277,,12,22,52,
VAST,2016,How ideas flow across multiple social groups,10.1109/VAST.2016.7883511,http://dx.doi.org/10.1109/VAST.2016.7883511,51,60,C,"Tracking how correlated ideas flow within and across multiple social groups facilitates the understanding of the transfer of information, opinions, and thoughts on social media. In this paper, we present IdeaFlow, a visual analytics system for analyzing the lead-lag changes within and across pre-defined social groups regarding a specific set of correlated ideas, each of which is described by a set of words. To model idea flows accurately, we develop a random-walk-based correlation model and integrate it with Bayesian conditional cointegration and a tensor-based technique. To convey complex lead-lag relationships over time, IdeaFlow combines the strengths of a bubble tree, a flow map, and a timeline. In particular, we develop a Voronoi-treemap-based bubble tree to help users get an overview of a set of ideas quickly. A correlated-clustering-based layout algorithm is used to simultaneously generate multiple flow maps with less ambiguity. We also introduce a focus+context timeline to explore huge amounts of temporal data at different levels of time granularity. Quantitative evaluation and case studies demonstrate the accuracy and effectiveness of IdeaFlow.",Xiting Wang;Shixia Liu;Yang Chen;Tai-Quan Peng;Jing Su;Jing Yang;Baining Guo,Xiting Wang;Shixia Liu;Yang Chen;Tai-Quan Peng;Jing Su;Jing Yang;Baining Guo,"School of Software, Tsinghua University, China;School of Software, Tsinghua University, China;School of Software, Tsinghua University, China;Michigan State University, United States of America;Tsinghua University, China;UNCC, United States of America;Microsoft Research, United States of America",10.1109/VAST.2011.6102461;10.1109/VAST.2010.5652931;10.1109/TVCG.2015.2467554;10.1109/TVCG.2014.2346433;10.1109/TVCG.2015.2467992;10.1109/TVCG.2015.2467691;10.1109/TVCG.2011.202;10.1109/VAST.2012.6400485;10.1109/TVCG.2013.196;10.1109/TVCG.2015.2467757;10.1109/TVCG.2012.212;10.1109/TVCG.2010.129;10.1109/TVCG.2013.162;10.1109/TVCG.2013.221;10.1109/TVCG.2014.2346919;10.1109/INFVIS.2005.1532152;10.1109/TVCG.2014.2346920;10.1109/TVCG.2015.2467991;10.1109/TVCG.2011.239;10.1109/INFVIS.2005.1532150;10.1109/TVCG.2009.111;10.1109/INFVIS.2005.1532128,,12,19,56,
VAST,2018,Visual Abstraction of Large Scale Geospatial Origin-Destination Movement Data,10.1109/TVCG.2018.2864503,http://dx.doi.org/10.1109/TVCG.2018.2864503,43,53,J,"A variety of human movement datasets are represented in an Origin-Destination(OD) form, such as taxi trips, mobile phone locations, etc. As a commonly-used method to visualize OD data, flow map always fails to discover patterns of human mobility, due to massive intersections and occlusions of lines on a 2D geographical map. A large number of techniques have been proposed to reduce visual clutter of flow maps, such as filtering, clustering and edge bundling, but the correlations of OD flows are often neglected, which makes the simplified OD flow map present little semantic information. In this paper, a characterization of OD flows is established based on an analogy between OD flows and natural language processing (NPL) terms. Then, an iterative multi-objective sampling scheme is designed to select OD flows in a vectorized representation space. To enhance the readability of sampled OD flows, a set of meaningful visual encodings are designed to present the interactions of OD flows. We design and implement a visual exploration system that supports visual inspection and quantitative evaluation from a variety of perspectives. Case studies based on real-world datasets and interviews with domain experts have demonstrated the effectiveness of our system in reducing the visual clutter and enhancing correlations of OD flows.",Zhiguang Zhou;Linhao Meng;Cheng Tang;Ying Zhao 0001;Zhiyong Guo;Miaoxin Hu;Wei Chen 0001,Zhiguang Zhou;Linhao Meng;Cheng Tang;Ying Zhao;Zhiyong Guo;Miaoxin Hu;Wei Chen,School of InformationZhejiang University of Finance and Economics;State Key Lab of CAD & CGZhejiang University;Information SchoolZhejiang Sci-tech University;Central South University;School of InformationZhejiang University of Finance and Economics;School of InformationZhejiang University of Finance and Economics;State Key Lab of CAD & CGZhejiang University,10.1109/TVCG.2017.2744322;10.1109/TVCG.2016.2598667;10.1109/TVCG.2011.202;10.1109/TVCG.2014.2346594;10.1109/TVCG.2008.135;10.1109/TVCG.2011.233;10.1109/TVCG.2013.226;10.1109/TVCG.2009.143;10.1109/TVCG.2014.2346271;10.1109/TVCG.2016.2598432;10.1109/TVCG.2013.196;10.1109/INFVIS.2005.1532150;10.1109/TVCG.2015.2467691;10.1109/TVCG.2014.2346746;10.1109/TVCG.2016.2598885,"Visual abstraction,human mobility,origin-destination,flow map,representation learning",12,19,51,
VAST,2018,VIS4ML: An Ontology for Visual Analytics Assisted Machine Learning,10.1109/TVCG.2018.2864838,http://dx.doi.org/10.1109/TVCG.2018.2864838,385,395,J,"While many VA workflows make use of machine-learned models to support analytical tasks, VA workflows have become increasingly important in understanding and improving Machine Learning (ML) processes. In this paper, we propose an ontology (VIS4ML) for a subarea of VA, namely “VA-assisted ML”. The purpose of VIS4ML is to describe and understand existing VA workflows used in ML as well as to detect gaps in ML processes and the potential of introducing advanced VA techniques to such processes. Ontologies have been widely used to map out the scope of a topic in biology, medicine, and many other disciplines. We adopt the scholarly methodologies for constructing VIS4ML, including the specification, conceptualization, formalization, implementation, and validation of ontologies. In particular, we reinterpret the traditional VA pipeline to encompass model-development workflows. We introduce necessary definitions, rules, syntaxes, and visual notations for formulating VIS4ML and make use of semantic web technologies for implementing it in the Web Ontology Language (OWL). VIS4ML captures the high-level knowledge about previous workflows where VA is used to assist in ML. It is consistent with the established VA concepts and will continue to evolve along with the future developments in VA and ML. While this ontology is an effort for building the theoretical foundation of VA, it can be used by practitioners in real-world applications to optimize model-development workflows by systematically examining the potential benefits that can be brought about by either machine or human capabilities. Meanwhile, VIS4ML is intended to be extensible and will continue to be updated to reflect future advancements in using VA for building high-quality data-analytical models or for building such models rapidly.",Dominik Sacha;Matthias Kraus;Daniel A. Keim;Min Chen 0001,Dominik Sacha;Matthias Kraus;Daniel A. Keim;Min Chen,University of Konstanz;University of Konstanz;University of Konstanz;University of Oxford,10.1109/TVCG.2017.2744683;10.1109/VISUAL.2004.10;10.1109/VAST.2008.4677361;10.1109/TVCG.2017.2744718;10.1109/TVCG.2017.2745178;10.1109/TVCG.2017.2745085;10.1109/TVCG.2017.2744938;10.1109/TVCG.2016.2598831;10.1109/TVCG.2017.2744378;10.1109/TVCG.2017.2745158;10.1109/TVCG.2017.2744358;10.1109/TVCG.2016.2598838;10.1109/TVCG.2016.2598828;10.1109/TVCG.2017.2744805;10.1109/TVCG.2014.2346481;10.1109/TVCG.2016.2598495;10.1109/TVCG.2017.2744158;10.1109/TVCG.2016.2598829;10.1109/VISUAL.2005.1532781;10.1109/TVCG.2016.2598830;10.1109/TVCG.2017.2744878,"Visual Analytics,Visualization,Machine Learning,Human-Computer Interaction,Ontology,VIS4ML",12,11,71,
Vis,1990,Dynamic graphics for network visualization,10.1109/VISUAL.1990.146369,http://dx.doi.org/10.1109/VISUAL.1990.146369,93,"96, 467",C,"The authors describe several dynamic graphics tools for visualizing network data involving statistics associated with the nodes or links in a network. The authors suggest a number of ideas for the static display of network data, while motivating the need for interaction through dynamic graphics. A brief discussion of dynamic graphics in general is presented. The authors specialize this to the case of network data. An example is presented.&lt;&lt;ETX&gt;&gt;",Richard A. Becker;Stephen G. Eick;Eileen O. Miller;Allan R. Wilks,R.A. Becker;S.G. Eick;E.O. Miller;A.R. Wilks,"AT&T Bell Lab., Murray Hill, NJ, USA;AT&T Bell Lab., Murray Hill, NJ, USA;AT&T Bell Lab., Murray Hill, NJ, USA;AT&T Bell Lab., Murray Hill, NJ, USA",,,11,3,3,
Vis,1990,A three-dimensional/stereoscopic display and model control system for Great Lakes forecasts,10.1109/VISUAL.1990.146382,http://dx.doi.org/10.1109/VISUAL.1990.146382,194,"201, 473-4",C,"A forecasting system for the Great Lakes in which the data generated by a three-dimensional numerical model is visualized by a 3-D/stereoscopic display module is discussed. The module consists of a control panel and a display window with the capability of interactively rendering the results. The event scheduling for scenario testing to steer the 3-D numerical model is achieved by a similar panel. These panels set up the simulation and control the data flow between the graphics workstation and supercomputer. Rendering methods, stereo imagery, and animation are incorporated to display the results. Interaction between the user, the workstation, and the supercomputer allows steering of the simulation and tracing of the simulation output. Distributed software for postprocessing and volume rendering are used to enhance the representation.&lt;&lt;ETX&gt;&gt;",Chieh-Cheng Yen;Keith W. Bedford;Jill Kempf;Robert E. Marshall,C.-C.J. Yen;K.W. Bedford;J.L. Kempf;R.E. Marshall,"Dept. of Civil Eng., Ohio State Univ., OH, USA;Dept. of Civil Eng., Ohio State Univ., OH, USA",,,11,4,12,
Vis,1990,Superposing images with shadow casting,10.1109/VISUAL.1990.146394,http://dx.doi.org/10.1109/VISUAL.1990.146394,298,"306, 484-5",C,"Algorithms for rendering complex and shaded animation sequences are described. The target display device for these image rendering algorithms is a multichannel display based on the superposing technique realized in hardware. An animation sequence is displayed by superposing a dynamic foreground on a static background. The static background can be a very complex scene, and the dynamic foreground can be an image with a simple to medium complexity. These two algorithms were developed based on raytracing.&lt;&lt;ETX&gt;&gt;",Philip C. Hsu;John Staudhammer,P. Hsu;J. Staudhammer,"Dept. of Electr. Eng., Florida Univ., Gainesville, FL, USA;Dept. of Electr. Eng., Florida Univ., Gainesville, FL, USA",,,11,1,15,
Vis,1991,Image handling in a multi-vendor environment,10.1109/VISUAL.1991.175814,http://dx.doi.org/10.1109/VISUAL.1991.175814,276,283,C,"Software developed to deal with differing image file formats, mismatched byte order and word sizes, and confusing hardcopy device interfaces is described. The SDSC Image Tool suite provides a simple, extensible, and portable mechanism for the support of a variety of common image formats so that tool-writers can concentrate on the task in hand, rather than on the quirks of a particular image file format. Users of such tools are able to work with images generated from a variety of sources, without being restricted to an arbitrary standard format. The SDSC Visualization Printing suite creates a unified view of hardcopy devices.&lt;&lt;ETX&gt;&gt;",David R. Nadeau;T. Todd Elvins;Michael J. Bailey,D.R. Nadeau;T.T. Elvins;M.J. Bailey,"San Diego Supercomput. Center, CA, USA;San Diego Supercomput. Center, CA, USA;San Diego Supercomput. Center, CA, USA",10.1109/VISUAL.1991.175807,,11,5,29,
Vis,1992,Visualization of simulated airflow in a clean room,10.1109/VISUAL.1992.235213,http://dx.doi.org/10.1109/VISUAL.1992.235213,156,163,C,"Techniques for visualizing a simulated air flow in a clean room are developed by using an efficient cell traverse of tetrahedral cells generated from irregular volumes. The proposed techniques, probing and stream line display, are related to the measurement techniques used in actual clean rooms. The efficient traverse makes it possible to move freely around a given irregular volume and to spawn off stream lines. A successful application of these techniques to a problem in a clean room is also described.&lt;&lt;ETX&gt;&gt;",Koji Koyamada,K. Koyamada,"Tokyo Res. Lab., Japan",10.1109/VISUAL.1991.175771,,11,7,9,
Vis,1996,Mathematical Vkualization: Standing at the Crossroads,10.1109/VISUAL.1996.568165,http://dx.doi.org/10.1109/VISUAL.1996.568165,451,453,M,,David Banks;George Francis;Andrew J. Hanson;Loki Jörgenson,T. Munzner;D. Banks;G. Francis;A.J. Hanson;L. Jorgenson,Stanford University (co-organizer),,,11,1,4,
Vis,1997,Wavelet-based multiresolutional representation of computational field simulation datasets,10.1109/VISUAL.1997.663872,http://dx.doi.org/10.1109/VISUAL.1997.663872,151,158,C,"The paper addresses multiresolutional representation of datasets arising from a computational field simulation. The approach determines the regions of interest, breaks the volume into variable size blocks to localize the information, and then codes each block using a wavelet transform. The blocks are then ranked by visual information content so that the most informative wavelet coefficients can be embedded in a bit stream for progressive transmission or access. The technique is demonstrated on a widely-used computational field simulation dataset.",Zhifan Zhu;Raghu Machiraju;Bryan Fry;Robert J. Moorhead II,Zhifan Zhu;R. Machiraju;B. Fry;R. Moorhead,"NSF Eng. Res. Center for Comput. Field Simulation, Mississippi State Univ., MS, USA",10.1109/VISUAL.1994.346332;10.1109/VISUAL.1995.480810;10.1109/VISUAL.1996.568138;10.1109/VISUAL.1995.480812,"wavelet transform, structure detection, human visual system, progressive transmission",11,3,37,
Vis,1997,Dynamic color mapping of bivariate qualitative data,10.1109/VISUAL.1997.663874,http://dx.doi.org/10.1109/VISUAL.1997.663874,159,166,C,"Color is widely and reliably used to display the value of a single scalar variable. It is more rarely, and far less reliably, used to display multivariate data. Dynamic control over the parameters of the color mapping results in a more effective environment for the exploration of multivariate spatial distributions. The paper describes an empirical study comparing the effectiveness of static versus dynamic representations for the exploration of qualitative aspects of bivariate distributions. In this experiment, subjects made judgments about the correspondence of the shape, location, and magnitude of two patterns under conditions with varying amounts of random noise. Subjects made significantly more correct judgements (p&lt;0.001) about feature shape and relative positions using the dynamic representation, on average forty-five percent more. The differences between static and dynamic representations were greater in the presence of noise.",Penny Rheingans,P. Rheingans,"Dept. of Comput. & Inf. Sci., Mississippi Univ., MS, USA",10.1109/VISUAL.1992.235201;10.1109/VISUAL.1995.480803;10.1109/VISUAL.1991.175795;10.1109/VISUAL.1992.235219,,11,7,28,
Vis,1997,Towards efficient visualization support for single-block and multi-block datasets,10.1109/VISUAL.1997.663913,http://dx.doi.org/10.1109/VISUAL.1997.663913,425,428,C,"Large simulation grids and multi-grid configurations impose many constraints on commercial visualization software. When available RAM is limited and graphics primitives are numbered in millions, alternative techniques for data access and processing are necessary. In this case study, we present our contributions to a visualization environment based on the AVS/Express software. We demonstrate how the efficient visualization of large datasets relies upon several forms of resource sharing, and alternate and efficient data access techniques.",Jean-Marie Favre,J.M. Favre,"Swiss Center for Sci. Comput., Switzerland",,,11,5,5,
Vis,1998,Visualizing Hilbert curves,10.1109/VISUAL.1998.745340,http://dx.doi.org/10.1109/VISUAL.1998.745340,447,450,C,"A computer animated movie was produced, illustrating both 2D and 3D Hilbert curves, and showing the transition from 2D to 3D with the help of volume rendering.",Nelson L. Max,N. Max,"Lawrence Livermore Nat. Lab., CA, USA",,,11,5,4,
Vis,1998,Visualization for multiparameter aircraft designs,10.1109/VISUAL.1998.745351,http://dx.doi.org/10.1109/VISUAL.1998.745351,491,494,C,"We describe an aircraft design problem in high dimensional space, with D typically being 10 to 30. In some respects this is a classic optimization problem, where the goal is to find the point that minimizes an objective function while satisfying a set of constraints. However, evaluating an individual point is expensive, and the high dimensionality makes many approaches to solving the problem infeasible. The difficulty of the problem means that aircraft designers would benefit from any insights that can be provided. We discuss how simple visualizations have already proved beneficial, and then describe how visualization might be of further help in the future.",Clifford A. Shaffer;Duane L. Knill;Layne T. Watson,C.A. Shaffer;D.L. Knill;L.T. Watson,"Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA",10.1109/VISUAL.1997.663866;10.1109/VISUAL.1997.663868;10.1109/VISUAL.1990.146402,,11,6,13,
Vis,1999,Multi-resolution multi-field ray tracing: a mathematical overview,10.1109/VISUAL.1999.809888,http://dx.doi.org/10.1109/VISUAL.1999.809888,199,206,C,"A rigorous mathematical review of ray tracing is presented. The concept of a generic voxel decoder acting on flexible voxel formats is introduced. The necessity of interpolating opacity weighted colors is proved, using a new definition of the blending process in terms of functional integrals. The continuum limit of the discrete opacity accumulation formula is presented, and its convexity properties are investigated. The issues pertaining to interpolation/classification order are discussed. The lighting equation is expressed in terms of opacity weighted colors. The multi-resolution (along the ray) correction of the opacity-weighted color is derived. The mathematics of filtering on the image plane are studied, and an upper limit of the local pixel size on the image plane is obtained. Interpolation of pixel values on the image plane is shown to be in-equivalent to blending of interpolated samples.",Charidimos E. Gasparakis,C. Gasparakis,"Mitsubishi Electr. Inf. Technol. Center, USA",,,11,0,15,
Vis,1999,Detecting vortical phenomena in vector data by medium-scale correlation,10.1109/VISUAL.1999.809917,http://dx.doi.org/10.1109/VISUAL.1999.809917,409,552,C,"The detection of vortical phenomena in vector data is one of the key issues in many technical applications, in particular in flow visualization. Many existing approaches rely on purely local evaluation of the vector data. In order to overcome the limits of a local approach, we choose to combine a local method with a correlation of a pre-defined generic vortex with the data in a medium-scale region. Two different concepts of generic vortices were tested on various sets of flow velocity vector data. The approach is not limited to the two generic patterns suggested here. The method was found to successfully detect vortices in cases were other methods fail.",Hans-Georg Pagendarm;Birgit Henne;Markus Rütten,H.-G. Pagendarm;B. Henne;M. Rutten,"DLR, Gottingen, Germany",10.1109/VISUAL.1993.398849;10.1109/VISUAL.1997.663910;10.1109/VISUAL.1994.346327;10.1109/VISUAL.1996.568137,,11,5,8,
InfoVis,2000,Getting portals to behave,10.1109/INFVIS.2000.885087,http://dx.doi.org/10.1109/INFVIS.2000.885087,15,25,C,"Data visualization environments help users understand and analyze their data by permitting interactive browsing of graphical representations of the data. To further facilitate understanding and analysis, many visualization environments have special features known as portals, which are sub-windows of a data canvas. Portals provide a way to display multiple graphical representations simultaneously, in a nested fashion. This makes portals an extremely powerful and flexible paradigm for data visualization. Unfortunately, with this flexibility comes complexity. There are over a hundred possible ways each portal can be configured to exhibit different behaviors. Many of these behaviors are confusing and certain behaviors can be inappropriate for a particular setting. It is desirable to eliminate confusing and inappropriate behaviors. The authors construct a taxonomy of portal behaviors and give recommendations to help designers of visualization systems decide which behaviors are intuitive and appropriate for a particular setting. They apply these recommendations to an example setting that is fully visually programmable and analyze the resulting reduced set of behaviors. Finally, the authors consider a real visualization environment and demonstrate some problems associated with behaviors that do not follow their recommendations.",Christopher Olston;Allison Woodruff,C. Olston;A. Woodruff,"Stanford Univ., CA, USA",10.1109/INFVIS.1995.528688,"Portals, Multiple Views, Data Visualization",11,5,16,
Vis,2000,Visualization of time dependent confocal microscopy data,10.1109/VISUAL.2000.885735,http://dx.doi.org/10.1109/VISUAL.2000.885735,473,476,C,"The microscopic analysis of time dependent 3D live cells provides considerable challenges to visualization. Effective visualization can provide insight into the structure and functioning of living cells. The paper presents a case study in which a number of visualization techniques were applied to analyze a specific problem in cell biology: the condensation and de-condensation of chromosomes during cell division. The spatial complexity of the data required sophisticated presentation techniques. The interactive virtual reality enabled visualization system, proteus, specially equipped for time dependent 3D data sets is described. An important feature of proteus is that it is extendible to cope with application-specific demands.",Wim C. de Leeuw;Robert van Liere;Pernette J. Verschure;Roel van Driel;Astrid E. Visser;Erik M. M. Manders,W.C. De Leeuw;R. Van Liere;P.J. Verschure;A.E. Visser;E.M.M. Manders;R. Van Drielf,"Centre for Math. & Comput. Sci., Amsterdam, Netherlands",10.1109/VISUAL.1990.146378;10.1109/VISUAL.1996.568136,"biomedical imaging, volume visualization,virtual reality",11,1,11,
Vis,2001,Attribute preserving dataset simplification,10.1109/VISUAL.2001.964501,http://dx.doi.org/10.1109/VISUAL.2001.964501,113,120,C,"The paper describes a novel application of feature preserving mesh simplification to the problem of managing large, multidimensional datasets during scientific visualization. To allow this, we view a scientific dataset as a triangulated mesh of data elements, where the attributes embedded in each element form a set of properties arrayed across the surface of the mesh. Existing simplification techniques were not designed to address the high dimensionality that exists in these types of datasets. In addition, vertex operations that relocate, insert, or remove data elements may need to be modified or restricted. Principal component analysis provides an algorithm-independent method for compressing a dataset's dimensionality during simplification. Vertex locking forces certain data elements to maintain their spatial locations; this technique is also used to guarantee a minimum density in the simplified dataset. The result is a visualization that significantly reduces the number of data elements to display, while at the same time ensuring that high-variance regions of potential interest remain intact. We apply our techniques to a number of well-known feature preserving algorithms, and demonstrate their applicability in a real-world context by simplifying a multidimensional weather dataset. Our results show a significant improvement in execution time with only a small reduction in accuracy; even when the dataset was simplified to 10% of its original size, average per attribute error was less than 1%.",Jason D. Walter;Christopher G. Healey,J.D. Walter;C.G. Healey,"Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA;Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA",10.1109/VISUAL.1998.745296;10.1109/VISUAL.1998.745312;10.1109/VISUAL.1999.809869,"dataset management, mesh simplification, principal component analysis, scientific visualization",11,4,14,
Vis,2002,Christmas tree case study: computed tomography as a tool for mastering complex real world objects with applications in computer graphics,10.1109/VISUAL.2002.1183812,http://dx.doi.org/10.1109/VISUAL.2002.1183812,489,492,C,"We report on using computed tomography (CT) as a model acquisition tool for complex objects in computer graphics. Unlike other modeling and scanning techniques the complexity of the object is irrelevant in CT, which naturally enables to model objects with, for example, concavities, holes, twists or fine surface details. Once the data is scanned, one can apply post-processing techniques for data enhancement, modification or presentation. For demonstration purposes we chose to scan a Christmas tree which exhibits high complexity which is difficult or even impossible to handle with other techniques. However, care has to be taken to achieve good scanning results with CT. Further, we illustrate post-processing by means of data segmentation and photorealistic as well as non-photorealistic surface and volume rendering techniques.",Armin Kanitsar;Thomas Theußl;Lukas Mroz;Milos Srámek;Anna Vilanova;Balázs Csébfalvi;Jirí Hladuvka;Dominik Fleischmann;Michael Knapp;Rainer Wegenkittl;Petr Felkel;Stefan Guthe;Werner Purgathofer;M. Eduard Gröller,A. Kanitsar;P. Felkel;S. Rottger;S. Guthe;W. Purgathofer;M.E. Groller;T. Theussl;L. Mroz;M. Sramek;A.V. Bartroli;B. Csebfalvi;J. Hladuvka;D. Fleischmann;M. Knapp;R. Wegenkittl,"Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria;Inst. of Comput. Graphics & Algorithms, Vienna Univ. of Technol., Austria",10.1109/VISUAL.2001.964522;10.1109/VISUAL.2001.964555;10.1109/VISUAL.2001.964531;10.1109/VISUAL.1994.346320,"modeling, computed tomography, volume visualization",11,4,14,
InfoVis,2003,Constant density displays using diversity sampling,10.1109/INFVIS.2003.1249019,http://dx.doi.org/10.1109/INFVIS.2003.1249019,137,144,C,"The Informedia Digital Video Library user interface summarizes query results with a collage of representative keyframes. We present a user study in which keyframe occlusion caused difficulties. To use the screen space most efficiently to display images, both occlusion and wasted whitespace should be minimized. Thus optimal choices will tend toward constant density displays. However, previous constant density algorithms are based on global density, which leads to occlusion and empty space if the density is not uniform. We introduce an algorithm that considers the layout of individual objects and avoids occlusion altogether. Efficiency concerns are important for dynamic summaries of the Informedia Digital Video Library, which has hundreds of thousands of shots. Posting multiple queries that take into account parameters of the visualization as well as the original query reduces the amount of work required. This greedy algorithm is then compared to an optimal one. The approach is also applicable to visualizations containing complex graphical objects other than images, such as text, icons, or trees.",Mark Derthick;Michael G. Christel;Alexander G. Hauptmann;Howard D. Wactlar,M. Derthick;M.G. Christel;A.G. Hauptmann;H.D. Wactlar,"Human-Comput. Interaction Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA;Human-Comput. Interaction Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA",10.1109/INFVIS.1998.729570,"Information Visualization, Collage",11,8,17,
InfoVis,2003,Visualization of large-scale customer satisfaction surveys using a parallel coordinate tree,10.1109/INFVIS.2003.1249026,http://dx.doi.org/10.1109/INFVIS.2003.1249026,197,201,C,"Satisfaction surveys are an important measurement tool in fields such as market research or human resources management. Serious studies consist of numerous questions and contain answers from large population samples. Aggregation on both sides, the questions asked as well as the answers received, turns the multidimensional problem into a complex system of interleaved hierarchies. Traditional ways of presenting the results are limited to one-dimensional charts and cross-tables. We developed a visualization method called the Parallel Coordinate Tree that combines multidimensional analysis with a tree structure representation. Distortion-oriented focus+context techniques are used to facilitate interaction with the visualization. In this paper we present a design study of a commercial application that we built, using this method to analyze and communicate results from large-scale customer satisfaction surveys.",Dominique Brodbeck;Luc Girardin,D. Brodbeck;L. Girardin,"Macrofocus GmbH, Zurich, Switzerland;Macrofocus GmbH, Zurich, Switzerland",10.1109/VISUAL.1991.175815;10.1109/VISUAL.1990.146402;10.1109/INFVIS.2001.963274;10.1109/INFVIS.2001.963285,"parallel coordinates,focus+context, hierarchical data, satisfaction survey",11,8,13,
Vis,2003,A frequency-sensitive point hierarchy for images and volumes,10.1109/VISUAL.2003.1250403,http://dx.doi.org/10.1109/VISUAL.2003.1250403,425,432,C,"This paper introduces a method for converting an image or volume sampled on a regular grid into a space-efficient irregular point hierarchy. The conversion process retains the original frequency characteristics of the dataset by matching the spatial distribution of sample points with the required frequency. To achieve good blending, the spherical points commonly used in volume rendering are generalized to ellipsoidal point primitives. A family of multiresolution, oriented Gabor wavelets provide the frequency-space analysis of the dataset. The outcome of this frequency analysis is the reduced set of points, in which the sampling rate is decreased in originally oversampled areas. During rendering, the traversal of the hierarchy can be controlled by any suitable error metric or quality criteria. The local level of refinement is also sensitive to the transfer function. Areas with density ranges mapped to high transfer function variability are rendered at higher point resolution than others. Our decomposition is flexible and can be used for iso-surface rendering, alpha compositing and X-ray rendering of volumes. We demonstrate our hierarchy with an interactive splatting volume renderer, in which the traversal of the point hierarchy for rendering is modulated by a user-specified frame rate.",Tomihisa Welsh;Klaus Mueller,T. Welsh;K. Mueller,"Center for Visual Comput., Comput. Sci., Stony Brook Univ., USA;Center for Visual Comput., Comput. Sci., Stony Brook Univ., USA",10.1109/VISUAL.2002.1183770;10.1109/VISUAL.2001.964498;10.1109/VISUAL.2002.1183776;10.1109/VISUAL.2001.964492;10.1109/VISUAL.2001.964491;10.1109/VISUAL.2002.1183757,"volume rendering, point-based rendering, splatting",11,4,32,
Vis,2003,Producing high-quality visualizations of large-scale simulation,10.1109/VISUAL.2003.1250422,http://dx.doi.org/10.1109/VISUAL.2003.1250422,575,580,C,"This paper describes the work of a team of researchers in computer graphics, geometric computing, and civil engineering to produce a visualization of the September 2001 attack on the Pentagon. The immediate motivation for the project was to understand the behavior of the building under the impact. The longer term motivation was to establish a path for producing high-quality visualizations of large scale simulations. The first challenge was managing the enormous complexity of the scene to fit within the limits of state-of-the art simulation software systems and supercomputing resources. The second challenge was to integrate the simulation results into a high-quality visualization. To meet this challenge, we implemented a custom importer that simplifies and loads the massive simulation data in a commercial animation system. The surrounding scene is modeled using image-based techniques and is also imported in the animation system where the visualization is produced. A specific issue for us was to federate the simulation and the animation systems, both commercial systems not under our control and following internally different conceptualizations of geometry and animation. This had to be done such that scalability was achieved. The reusable link created between the two systems allows communicating the results to non-specialists and the public at large, as well as facilitating communication in teams with members having diverse technical backgrounds.",Voicu Popescu;Christoph M. Hoffmann;Sami Kilic;Mete Sozen;Scott Meador,V. Popescu;C. Hoffmann;S. Kilic;M. Sozen;S. Meador,"Purdue Univ., USA;Purdue Univ., USA;Purdue Univ., USA;Purdue Univ., USA;Purdue Univ., USA",,,11,3,19,
Vis,2004,Visualizing gyrokinetic simulations,10.1109/VISUAL.2004.122,http://dx.doi.org/10.1109/VISUAL.2004.122,59,66,C,"The continuing advancement of plasma science is central to realizing fusion as an inexpensive and safe energy source. Gryokinetic simulations of plasmas are fundamental to the understanding of turbulent transport in fusion plasma. This work discusses the visualization challenges presented by gyrokinetic simulations using magnetic field line following coordinates, and presents an effective solution exploiting programmable graphics hardware to enable interactive volume visualization of 3D plasma flow on a toroidal coordinate system. The new visualization capability can help scientists better understand three-dimensional structures of the modeled phenomena. Both the limitations and future promise of the hardware-accelerated approach are also discussed.",David Crawford;Kwan-Liu Ma;Min-Yu Huang;Scott Klasky;Stéphane Ethier,D. Crawford;K.-L. Ma;Min-Yu Huang;S. Klasky;S. Ethier,"Dept. of Comput. Sci., California Univ., Davis, CA, USA;Dept. of Comput. Sci., California Univ., Davis, CA, USA;Dept. of Comput. Sci., California Univ., Davis, CA, USA",10.1109/VISUAL.2001.964520;10.1109/VISUAL.2003.1250402;10.1109/VISUAL.2003.1250385,"graphics hardware, non-rectilinear mesh, plasma physics, scientific visualization, texture methods, volume visualization",11,3,15,
Vis,2004,A graphics hardware-based vortex detection and visualization system,10.1109/VISUAL.2004.3,http://dx.doi.org/10.1109/VISUAL.2004.3,195,202,C,"Feature detection in flow fields is a well-researched area, but practical application is often difficult due to the numerical complexity of the algorithms preventing interactive use and due to noise in experimental or high-resolution simulation data sets. We present an integrated system that provides interactive denoising, vortex detection, and visualisation of vector data on Cartesian grids. All three major phases are implemented in such a way that the system runs completely on a modern GPU once the vector field is downloaded into graphics memory. The application aspect of our paper is twofold. First, we show how recently presented, prototypical GPU-based algorithms for filtering, numerical computation, and volume rendering can be combined into one productive system by handling all idiosyncrasies of a chosen graphics card. Second, we demonstrate that the significant speedup achieved compared to an optimized software implementation now allows interactive exploration of characteristic structures in turbulent flow fields.",Simon Stegmaier;Thomas Ertl,S. Stegmaier;T. Ertl,"Inst. of Visualization & Interactive Syst., Stuttgart Univ., Germany;Inst. of Visualization & Interactive Syst., Stuttgart Univ., Germany",10.1109/VISUAL.2003.1250361;10.1109/VISUAL.1998.745288;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.1999.809934;10.1109/VISUAL.1998.745296,"Features in Volume Data Sets, Flow Visualization, Hardware Acceleration, 3D Vector Field Visualization",11,7,25,
InfoVis,2005,Multivariate glyphs for multi-object clusters,10.1109/INFVIS.2005.1532140,http://dx.doi.org/10.1109/INFVIS.2005.1532140,141,148,C,"Aggregating items can simplify the display of huge quantities of data values at the cost of losing information about the attribute values of the individual items. We propose a distribution glyph, in both two- and three-dimensional forms, which specifically addresses the concept of how the aggregated data is distributed over the possible range of values. It is capable of displaying distribution, variability and extent information for up to four attributes at a time of multivariate, clustered data. User studies validate the concept, showing that both glyphs are just as good as raw data and the 3D glyph is better for answering some questions.",Eleanor Boyle Chlan;Penny Rheingans,E.B. Chlan;P. Rheingans,"Whiting Sch. of Eng., Johns Hopkins Univ., Baltiomore, MD, USA",10.1109/INFVIS.1995.528691;10.1109/VISUAL.1996.568111;10.1109/VISUAL.1999.809866;10.1109/VISUAL.2000.885677,"information visualization, multivariate visualization, distribution, aggregated data",11,3,16,
Vis,2005,Visualizing tensor fields in geomechanics,10.1109/VISUAL.2005.1532774,http://dx.doi.org/10.1109/VISUAL.2005.1532774,35,42,C,"The study of stress and strains in soils and structures (solids) help us gain a better understanding of events such as failure of bridges, dams and buildings, or accumulated stresses and strains in geological subduction zones that could trigger earthquakes and subsequently tsunamis. In such domains, the key feature of interest is the location and orientation of maximal shearing planes. This paper describes a method that highlights this feature in stress tensor fields. It uses a plane-in-a-box glyph which provides a global perspective of shearing planes based on local analysis of tensors. The analysis can be performed over the entire domain, or the user can interactively specify where to introduce these glyphs. Alternatively, they can also be placed depending on the threshold level of several physical relevant parameters such as double couple and compensated linear vector dipole. Both methods are tested on stress tensor fields from geomechanics.",Alisa Neeman;Boris Jeremic;Alex T. Pang,A. Neeman;B. Jeremic;A. Pang,"Comput. Sci. Dept., UCSC, CA, USA",10.1109/VISUAL.1998.745294;10.1109/VISUAL.1999.809886,"symmetric tensors, stress tensor, seismic moment tensor, anisotropic, deviatoric, double couple, compensated linear vector dipole",11,0,27,
Vis,2005,Differential protein expression analysis via liquid-chromatography/mass-spectrometry data visualization,10.1109/VISUAL.2005.1532828,http://dx.doi.org/10.1109/VISUAL.2005.1532828,447,454,C,"Differential protein expression analysis is one of the main challenges in proteomics. It denotes the search for proteins, whose encoding genes are differentially expressed under a given experimental setup. An important task in this context is to identify the differentially expressed proteins or, more generally, all proteins present in the sample. One of the most promising and recently widely used approaches for protein identification is to cleave proteins into peptides, separate the peptides using liquid chromatography, and determine the masses of the separated peptides using mass spectrometry. The resulting data needs to be analyzed and matched against protein sequence databases. The analysis step is typically done by searching for intensity peaks in a large number of 2D graphs. We present an interactive visualization tool for the exploration of liquid-chromatography/mass-spectrometry data in a 3D space, which allows for the understanding of the data in its entirety and a detailed analysis of regions of interest. We compute differential expression over the liquid-chromatography/mass-spectrometry domain and embed it visually in our system. Our exploration tool can treat single liquid-chromatography/mass-spectrometry data sets as well as data acquired using multi-dimensional protein identification technology. For efficiency purposes we perform a peak-preserving data resampling and multiresolution hierarchy generation prior to visualization.",Lars Linsen;Julia Löcherbach;Matthias Berth;Jörg Bernhardt,L. Linsen;J. Locherbach;M. Berth;J. Bernhardt;D. Becher,"Dept. of Math. & Comput. Sci., Ernst-Moritz-Arndt-Univ., Greifswald, Germany;Dept. of Math. & Comput. Sci., Ernst-Moritz-Arndt-Univ., Greifswald, Germany",10.1109/VISUAL.1997.663907,"interactive visual exploration, hierarchical data representation, visualization in bioinformatics, proteomics",11,4,22,
VAST,2006,Interactive Wormhole Detection in Large Scale Wireless Networks,10.1109/VAST.2006.261435,http://dx.doi.org/10.1109/VAST.2006.261435,99,106,C,"Wormhole attacks in wireless networks can severely deteriorate the network performance and compromise the security through spoiling the routing protocols and weakening the security enhancements. This paper develops an approach, interactive visualization of wormholes (IVoW), to monitor and detect such attacks in large scale wireless networks in real time. We characterize the topology features of a network under wormhole attacks through the node position changes and visualize the information at dynamically adjusted scales. We integrate an automatic detection algorithm with appropriate user interactions to handle complicated scenarios that include a large number of moving nodes and multiple worm-hole attackers. Various visual forms have been adopted to assist the understanding and analysis of the reconstructed network topology and improve the detection accuracy. Extended simulation has demonstrated that the proposed approach can effectively locate the fake neighbor connections without introducing many false alarms. IVoW does not require the wireless nodes to be equipped with any special hardware, thus avoiding any additional cost. The proposed approach demonstrates that interactive visualization can be successfully combined with network security mechanisms to greatly improve the intrusion detection capabilities",Weichao Wang;Aidong Lu,Weichao Wang;Aidong Lu,"University of Kansas, e-mail: weichaow@eecs.ku.edu;University of North Carolina at Charlotte, e-mail: alul1@uncc.edu",10.1109/VISUAL.1996.567787;10.1109/VISUAL.2005.1532819;10.1109/INFVIS.2002.1173161;10.1109/INFVIS.2004.60,"Interactive Detection, Wormhole Attacks, Visualization on Network Security, Wireless Networks, Topology Visualization",11,6,43,
Vis,2006,Caricaturistic Visualization,10.1109/TVCG.2006.123,http://dx.doi.org/10.1109/TVCG.2006.123,1085,1092,J,"Caricatures are pieces of art depicting persons or sociological conditions in a non-veridical way. In both cases caricatures are referring to a reference model. The deviations from the reference model are the characteristic features of the depicted subject. Good caricatures exaggerate the characteristics of a subject in order to accent them. The concept of caricaturistic visualization is based on the caricature metaphor. The aim of caricaturistic visualization is an illustrative depiction of characteristics of a given dataset by exaggerating deviations from the reference model. We present the general concept of caricaturistic visualization as well as a variety of examples. We investigate different visual representations for the depiction of caricatures. Further, we present the caricature matrix, a technique to make differences between datasets easily identifiable",Peter Rautek;Ivan Viola;M. Eduard Gröller,Peter Rautek;Ivan Viola;M. Eduard Groller,"Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria",10.1109/VISUAL.2005.1532856;10.1109/VISUAL.2004.48;10.1109/VISUAL.2005.1532857;10.1109/VISUAL.2005.1532835,"Illustrative Visualization, Focus+Context Techniques, Volume Visualization",11,10,26,
Vis,2006,Isosurface Extraction and Spatial filtering using Persistent Octree (POT),10.1109/TVCG.2006.157,http://dx.doi.org/10.1109/TVCG.2006.157,1283,1290,J,"We propose a novel persistent octree (POT) indexing structure for accelerating isosurface extraction and spatial filtering from volumetric data. This data structure efficiently handles a wide range of visualization problems such as the generation of view-dependent isosurfaces, ray tracing, and isocontour slicing for high dimensional data. POT can be viewed as a hybrid data structure between the interval tree and the branch-on-need octree (BONO) in the sense that it achieves the asymptotic bound of the interval tree for identifying the active cells corresponding to an isosurface and is more efficient than BONO for handling spatial queries. We encode a compact octree for each isovalue. Each such octree contains only the corresponding active cells, in such a way that the combined structure has linear space. The inherent hierarchical structure associated with the active cells enables very fast filtering of the active cells based on spatial constraints. We demonstrate the effectiveness of our approach by performing view-dependent isosurfacing on a wide variety of volumetric data sets and 4D isocontour slicing on the time-varying Richtmyer-Meshkov instability dataset",Qingmin Shi;Joseph JáJá,Qingmin Shi;Joseph JaJa,"Institute for Advanced Computer Studies and the Department of Electrical and Computer Engineering at the University of Maryland, College Park;Institute for Advanced Computer Studies and the Department of Electrical and Computer Engineering at the University of Maryland, College Park",10.1109/VISUAL.1998.745713;10.1109/VISUAL.1991.175780;10.1109/VISUAL.1998.745299;10.1109/VISUAL.1996.568121;10.1109/VISUAL.1999.809910;10.1109/VISUAL.2002.1183810;10.1109/VISUAL.1998.745298;10.1109/VISUAL.1999.809879;10.1109/VISUAL.2004.52;10.1109/VISUAL.1998.745300;10.1109/VISUAL.2003.1250373,"scientific visualization, isosurface extraction, indexing",11,9,30,
VAST,2007,VAST 2007 Contest - Blue Iguanodon,10.1109/VAST.2007.4389032,http://dx.doi.org/10.1109/VAST.2007.4389032,231,232,M,Visual analytics experts realize that one effective way to push the field forward and to develop metrics for measuring the performance of various visual analytics components is to hold an annual competition. The second visual analytics science and technology (VAST) contest was held in conjunction with the 2007 IEEE VAST symposium. In this contest participants were to use visual analytic tools to explore a large heterogeneous data collection to construct a scenario and find evidence buried in the data of illegal and terrorist activities that were occurring. A synthetic data set was made available as well as tasks. In this paper we describe some of the advances we have made from the first competition held in 2006.,Georges G. Grinstein;Catherine Plaisant;Sharon J. Laskowski;Theresa A. O'Connell;Jean Scholtz;Mark A. Whiting,Georges Grinstein;Catherine Plaisant;Sharon Laskowski;Theresa O'Connell;Jean Scholtz;Mark Whiting,"University of Massachusetts, Lowell. grinstein@cs.uml.edu;University of Maryland. plaisant@cs.umd.edu;National Institute of Standards and Technology. sharon.laskowski@nist.gov;National Institute of Standards and Technology. toconnell@nist.gov;Pacific Northwest National Laboratory. jean.scholtz@pnl.com;Pacific Northwest National Laboratory. mark.a.whiting@pnl.gov",,,11,7,6,
VAST,2008,Visual mining of multimedia data for social and behavioral studies,10.1109/VAST.2008.4677369,http://dx.doi.org/10.1109/VAST.2008.4677369,155,162,C,"With advances in computing techniques, a large amount of high-resolution high-quality multimedia data (video and audio, etc.) has been collected in research laboratories in various scientific disciplines, particularly in social and behavioral studies. How to automatically and effectively discover new knowledge from rich multimedia data poses a compelling challenge since state-of-the-art data mining techniques can most often only search and extract pre-defined patterns or knowledge from complex heterogeneous data. In light of this, our approach is to take advantages of both the power of human perception system and the power of computational algorithms. More specifically, we propose an approach that allows scientists to use data mining as a first pass, and then forms a closed loop of visual analysis of current results followed by more data mining work inspired by visualization, the results of which can be in turn visualized and lead to the next round of visual exploration and analysis. In this way, new insights and hypotheses gleaned from the raw data and the current level of analysis can contribute to further analysis. As a first step toward this goal, we implement a visualization system with three critical components: (1) A smooth interface between visualization and data mining. The new analysis results can be automatically loaded into our visualization tool. (2) A flexible tool to explore and query temporal data derived from raw multimedia data. We represent temporal data into two forms - continuous variables and event variables. We have developed various ways to visualize both temporal correlations and statistics of multiple variables with the same type, and conditional and high-order statistics between continuous and event variables. (3) A seamless interface between raw multimedia data and derived data. Our visualization tool allows users to explore, compare, and analyze multi-stream derived variables and simultaneously switch to access raw multimedia data. We demonstrate various functions in our visualization program using a set of multimedia data including video, audio and motion tracking data.",Chen Yu;Yiwen Zhong;Thomas G. Smith 0002;Ikhyun Park;Weixia Huang,Chen Yu;Yiwen Zhong;Thomas Smith;Ikhyun Park;Weixia Huang,"Indiana University, USA;Indiana University, USA;Indiana University, USA;Indiana University, USA;Indiana University, USA",10.1109/INFVIS.2001.963273;10.1109/INFVIS.1999.801851,"visual data mining, multimedia data",11,0,12,
VAST,2008,Grand challenge award: Interactive visual analytics palantir: The future of analysis,10.1109/VAST.2008.4677386,http://dx.doi.org/10.1109/VAST.2008.4677386,,,M,"Palantir is a world-class analytic platform used worldwide by governmental and financial analysts. This paper provides an introduction to the platform contextualized by its application to the 2008 IEEE VAST contest. In this challenge, we explored a notional dataset about a fabricated religious movement, Catalanopsilas Paraiso Manifesto Movement.",Jason Payne;Jake Solomon;Ravi Sankar;Bob McGrew,Jason Payne;Jake Solomon;Ravi Sankar;Bob McGrew,"100 Hamilton Ave Suite 300 Palo Alto CA 94301, USA;100 Hamilton Ave Suite 300 Palo Alto CA 94301, USA;100 Hamilton Ave Suite 300 Palo Alto CA 94301, USA;100 Hamilton Ave Suite 300 Palo Alto CA 94301, USA",,,11,3,0,
Vis,2009,Coloring 3D Line fields Using Boy's Real Projective Plane Immersion,10.1109/TVCG.2009.125,http://dx.doi.org/10.1109/TVCG.2009.125,1457,1464,J,"We introduce a new method for coloring 3D line fields and show results from its application in visualizing orientation in DTI brain data sets. The method uses Boy's surface, an immersion of RP2 in 3D. This coloring method is smooth and one-to-one except on a set of measure zero, the double curve of Boy's surface.",Çagatay Demiralp;John F. Hughes;David H. Laidlaw,Çağatay Demiralp;John F. Hughes;David H. Laidlaw,Brown University;Brown University;Brown University,10.1109/VISUAL.1994.346338;10.1109/VISUAL.1993.398867,"Line field, colormapping, orientation, real projective plane, tensor field, DTI",11,13,16,
Vis,2010,Special Relativistic Visualization by Local Ray Tracing,10.1109/TVCG.2010.196,http://dx.doi.org/10.1109/TVCG.2010.196,1243,1250,J,"Special relativistic visualization offers the possibility of experiencing the optical effects of traveling near the speed of light, including apparent geometric distortions as well as Doppler and searchlight effects. Early high-quality computer graphics images of relativistic scenes were created using offline, computationally expensive CPU-side 4D ray tracing. Alternate approaches such as image-based rendering and polygon-distortion methods are able to achieve interactivity, but exhibit inferior visual quality due to sampling artifacts. In this paper, we introduce a hybrid rendering technique based on polygon distortion and local ray tracing that facilitates interactive high-quality visualization of multiple objects moving at relativistic speeds in arbitrary directions. The method starts by calculating tight image-space footprints for the apparent triangles of the 3D scene objects. The final image is generated using a single image-space ray tracing step incorporating Doppler and searchlight effects. Our implementation uses GPU shader programming and hardware texture filtering to achieve high rendering speed.",Thomas Müller 0005;Sebastian Grottel;Daniel Weiskopf,Thomas Muller;Sebastian Grottel;Daniel Weiskopf,VISUS;VISUS;VISUS,10.1109/VISUAL.2000.885709,"Poincare transformation, aberration of light, Doppler effect, illumination, searchlight effect, special relativity, GPU ray tracing",11,10,31,
VAST,2011,G-PARE: A visual analytic tool for comparative analysis of uncertain graphs,10.1109/VAST.2011.6102442,http://dx.doi.org/10.1109/VAST.2011.6102442,61,70,C,"There are a growing number of machine learning algorithms which operate on graphs. Example applications for these algorithms include predicting which customers will recommend products to their friends in a viral marketing campaign using a customer network, predicting the topics of publications in a citation network, or predicting the political affiliations of people in a social network. It is important for an analyst to have tools to help compare the output of these machine learning algorithms. In this work, we present G-PARE, a visual analytic tool for comparing two uncertain graphs, where each uncertain graph is produced by a machine learning algorithm which outputs probabilities over node labels. G-PARE provides several different views which allow users to obtain a global overview of the algorithms output, as well as focused views that show subsets of nodes of interest. By providing an adaptive exploration environment, G-PARE guides the users to places in the graph where two algorithms predictions agree and places where they disagree. This enables the user to follow cascades of misclassifications by comparing the algorithms outcome with the ground truth. After describing the features of G-PARE, we illustrate its utility through several use cases based on networks from different domains.",Hossam Sharara;Awalin Sopan;Galileo Namata;Lise Getoor;Lisa Singh,Hossam Sharara;Awalin Sopan;Galileo Namata;Lise Getoor;Lisa Singh,"Computer Science Department, University of Maryland, College Park, USA;Computer Science Department, University of Maryland, College Park, USA;Computer Science Department, University of Maryland, College Park, USA;Computer Science Department, University of Maryland, College Park, USA;Computer Science Department, Georgetown University, Washington DC, USA",10.1109/TVCG.2006.122;10.1109/VAST.2010.5652398;10.1109/VAST.2010.5652910;10.1109/VAST.2006.261429;10.1109/VAST.2010.5652443;10.1109/TVCG.2007.70582,"Uncertain Graphs, Comparative Analysis, Model Comparison, Visualizing Uncertainty",11,9,38,
VAST,2011,Interactive decision making using dissimilarity to visually represented prototypes,10.1109/VAST.2011.6102451,http://dx.doi.org/10.1109/VAST.2011.6102451,141,149,C,"To make informed decisions, an expert has to reason with multi-dimensional, heterogeneous data and analysis results of these. Items in such datasets are typically represented by features. However, as argued in cognitive science, features do not yield an optimal space for human reasoning. In fact, humans tend to organize complex information in terms of prototypes or known cases rather than in absolute terms. When confronted with unknown data items, humans assess them in terms of similarity to these prototypical elements. Interestingly, an analogues similarity-to-prototype approach, where prototypes are taken from the data, has been successfully applied in machine learning. Combining such a machine learning approach with human prototypical reasoning in a Visual Analytics context requires to integrate similarity-based classification with interactive visualizations. To that end, the data prototypes should be visually represented to trigger direct associations to cases familiar to the domain experts. In this paper, we propose a set of highly interactive visualizations to explore data and classification results in terms of dissimilarities to visually represented prototypes. We argue that this approach not only supports human reasoning processes, but is also suitable to enhance understanding of heterogeneous data. The proposed framework is applied to a risk assessment case study in Forensic Psychiatry.",Gosia Migut;Jan C. van Gemert;Marcel Worring,M.A. Migut;J.C. van Gemert;M. Worring,"Intelligent Systems Lab Amsterdam, University of Amsterdam, The Netherlands;Expertise Center Forensic Psychiatry, Utrecht, The Netherlands;Intelligent Systems Lab Amsterdam, University of Amsterdam, The Netherlands",10.1109/TVCG.2007.70515;10.1109/TVCG.2009.174;10.1109/TVCG.2009.199;10.1109/VAST.2010.5652398;10.1109/VISUAL.1994.346302;10.1109/INFVIS.1998.729559;10.1109/INFVIS.2000.885086,"dissimilarity based classication, dissimilarity based visualization, prototypes, interactive visualization, visual analytics",11,6,35,
VAST,2011,Geovisual analytics for cyber security: Adopting the GeoViz Toolkit,10.1109/VAST.2011.6102491,http://dx.doi.org/10.1109/VAST.2011.6102491,315,316,M,"For the VAST 2011 Network Security Mini-Challenge, we adopted geovisual analytic methods and applied them in the field of network security. We used the GeoViz Toolkit [1] to represent cyber security events, by fabricating a simple “geography” of several sets of blocks (one for the workstations, one for the servers, and one for the Internet) using ArcGIS 10 (by ESRI - Environmental System Research Institute). Security data was tabulated using Perl scripts to parse the logs in order to create representations of event frequency and where they occurred on the network. The tabulated security data was then added as attributes of the geography. Exploration of the data and subsequent analysis of the meaning and impact of the cyber security events was made possible using the GeoViz Toolkit.",Nicklaus A. Giacobe;Sen Xu,Nicklaus A. Giacobe;Sen Xu,"College of Information Sciences and Technology, The Pennsylvania State University, USA;Department of Geography and GeoVISTA Center, The Pennsylvania State University, USA",,,11,6,6,
Vis,2011,Evaluation of Trend Localization with Multi-Variate Visualizations,10.1109/TVCG.2011.194,http://dx.doi.org/10.1109/TVCG.2011.194,2053,2062,J,"Multi-valued data sets are increasingly common, with the number of dimensions growing. A number of multi-variate visualization techniques have been presented to display such data. However, evaluating the utility of such techniques for general data sets remains difficult. Thus most techniques are studied on only one data set. Another criticism that could be levied against previous evaluations of multi-variate visualizations is that the task doesn't require the presence of multiple variables. At the same time, the taxonomy of tasks that users may perform visually is extensive. We designed a task, trend localization, that required comparison of multiple data values in a multi-variate visualization. We then conducted a user study with this task, evaluating five multivariate visualization techniques from the literature (Brush Strokes, Data-Driven Spots, Oriented Slivers, Color Blending, Dimensional Stacking) and juxtaposed grayscale maps. We report the results and discuss the implications for both the techniques and the task.",Mark A. Livingston;Jonathan W. Decker,Mark Livingston;Jonathan Decker,Naval Research Laboratory;Naval Research Laboratory,10.1109/TVCG.2009.126;10.1109/VISUAL.1998.745292;10.1109/VISUAL.1990.146387;10.1109/VISUAL.1990.146386;10.1109/TVCG.2007.70623;10.1109/VISUAL.1991.175795;10.1109/VISUAL.1999.809905;10.1109/VISUAL.2003.1250362;10.1109/VISUAL.1998.745294;10.1109/VISUAL.2003.1250362,"User study, multi-variate visualization, visual task design, visual analytics",11,8,25,
SciVis,2012,Evaluation of Multivariate Visualization on a Multivariate Task,10.1109/TVCG.2012.223,http://dx.doi.org/10.1109/TVCG.2012.223,2114,2121,J,"Multivariate visualization techniques have attracted great interest as the dimensionality of data sets grows. One premise of such techniques is that simultaneous visual representation of multiple variables will enable the data analyst to detect patterns amongst multiple variables. Such insights could lead to development of new techniques for rigorous (numerical) analysis of complex relationships hidden within the data. Two natural questions arise from this premise: Which multivariate visualization techniques are the most effective for high-dimensional data sets? How does the analysis task change this utility ranking? We present a user study with a new task to answer the first question. We provide some insights to the second question based on the results of our study and results available in the literature. Our task led to significant differences in error, response time, and subjective workload ratings amongst four visualization techniques. We implemented three integrated techniques (Data-driven Spots, Oriented Slivers, and Attribute Blocks), as well as a baseline case of separate grayscale images. The baseline case fared poorly on all three measures, whereas Datadriven Spots yielded the best accuracy and was among the best in response time. These results differ from comparisons of similar techniques with other tasks, and we review all the techniques, tasks, and results (from our work and previous work) to understand the reasons for this discrepancy.",Mark A. Livingston;Jonathan W. Decker;Zhuming Ai,Mark A. Livingston;Jonathan W. Decker;Zhuming Ai,Naval Research Laboratory;Naval Research Laboratory;Naval Research Laboratory,10.1109/TVCG.2011.194;10.1109/TVCG.2009.126;10.1109/VISUAL.1998.745292;10.1109/VISUAL.1990.146387;10.1109/TVCG.2007.70623;10.1109/VISUAL.1990.146386;10.1109/VISUAL.1991.175795;10.1109/VISUAL.1998.745294;10.1109/VISUAL.2003.1250362,"Quantitative evaluation, multivariate visualization, visual task design, texture perception",11,8,23,
SciVis,2013,Detecting Symmetry in Scalar fields Using Augmented Extremum Graphs,10.1109/TVCG.2013.148,http://dx.doi.org/10.1109/TVCG.2013.148,2663,2672,J,Visualizing symmetric patterns in the data often helps the domain scientists make important observations and gain insights about the underlying experiment. Detecting symmetry in scalar fields is a nascent area of research and existing methods that detect symmetry are either not robust in the presence of noise or computationally costly. We propose a data structure called the augmented extremum graph and use it to design a novel symmetry detection method based on robust estimation of distances. The augmented extremum graph captures both topological and geometric information of the scalar field and enables robust and computationally efficient detection of symmetry. We apply the proposed method to detect symmetries in cryo-electron microscopy datasets and the experiments demonstrate that the algorithm is capable of detecting symmetry even in the presence of significant noise. We describe novel applications that use the detected symmetry to enhance visualization of scalar field data and facilitate their exploration.,Dilip Mathew Thomas;Vijay Natarajan,Dilip Mathew Thomas;Vijay Natarajan,Indian Institute of Science;Indian Institute of Science,10.1109/VISUAL.2004.68;10.1109/TVCG.2009.120;10.1109/TVCG.2011.236;10.1109/TVCG.2008.143;10.1109/TVCG.2011.244;10.1109/TVCG.2007.70603;10.1109/TVCG.2012.200;10.1109/TVCG.2006.186,"Scalar field visualization, extremum graph, Morse decomposition, symmetry detection, data exploration",11,11,44,
VAST,2013,SketchPadN-D: WYDIWYG Sculpting and Editing in High-Dimensional Space,10.1109/TVCG.2013.190,http://dx.doi.org/10.1109/TVCG.2013.190,2060,2069,J,"High-dimensional data visualization has been attracting much attention. To fully test related software and algorithms, researchers require a diverse pool of data with known and desired features. Test data do not always provide this, or only partially. Here we propose the paradigm WYDIWYGS (What You Draw Is What You Get). Its embodiment, SketchPad&lt;sup&gt;ND&lt;/sup&gt;, is a tool that allows users to generate high-dimensional data in the same interface they also use for visualization. This provides for an immersive and direct data generation activity, and furthermore it also enables users to interactively edit and clean existing high-dimensional data from possible artifacts. SketchPad&lt;sup&gt;ND&lt;/sup&gt; offers two visualization paradigms, one based on parallel coordinates and the other based on a relatively new framework using an N-D polygon to navigate in high-dimensional space. The first interface allows users to draw arbitrary profiles of probability density functions along each dimension axis and sketch shapes for data density and connections between adjacent dimensions. The second interface embraces the idea of sculpting. Users can carve data at arbitrary orientations and refine them wherever necessary. This guarantees that the data generated is truly high-dimensional. We demonstrate our tool's usefulness in real data visualization scenarios.",Bing Wang 0007;Puripant Ruchikachorn;Klaus Mueller,Bing Wang;Puripant Ruchikachorn;Klaus Mueller,"Visual Analytics and Imaging Laboratory, Computer Science Department, Stony Brook University;Visual Analytics and Imaging Laboratory, Computer Science Department, Stony Brook University, and Chulalongkorn Business School, Chulalongkorn University;Visual Analytics and Imaging Laboratory, Computer Science Department, Stony Brook University, and SUNY Korea",10.1109/TVCG.2011.237;10.1109/VAST.2012.6400489,"Synthetic data generation, data editing, data acquisition and management, multivariate data, high-dimensional data, interaction, user interface, parallel coordinates, scatterplot, N-D navigation, multiple views",11,10,25,
SciVis,2014,Vortex Cores of Inertial Particles,10.1109/TVCG.2014.2346415,http://dx.doi.org/10.1109/TVCG.2014.2346415,2535,2544,J,"The cores of massless, swirling particle motion are an indicator for vortex-like behavior in vector fields and to this end, a number of coreline extractors have been proposed in the literature. Though, many practical applications go beyond the study of the vector field. Instead, engineers seek to understand the behavior of inertial particles moving therein, for instance in sediment transport, helicopter brownout and pulverized coal combustion. In this paper, we present two strategies for the extraction of the corelines that inertial particles swirl around, which depend on particle density, particle diameter, fluid viscosity and gravity. The first is to deduce the local swirling behavior from the autonomous inertial motion ODE, which eventually reduces to a parallel vectors operation. For the second strategy, we use a particle density estimation to locate inertial attractors. With this, we are able to extract the cores of swirling inertial particle motion for both steady and unsteady 3D vector fields. We demonstrate our techniques in a number of benchmark data sets, and elaborate on the relation to traditional massless corelines.",Tobias Günther;Holger Theisel,Tobias Günther;Holger Theisel,Visual Computing Group at the University of Magdeburg;Visual Computing Group at the University of Magdeburg,10.1109/VISUAL.2005.1532851;10.1109/TVCG.2007.70545;10.1109/TVCG.2010.198;10.1109/VISUAL.1999.809896;10.1109/VISUAL.1998.745296,"Inertial particles, flow visualization, vortex cores",11,12,36,
SciVis,2014,Visualization of Brain Microstructure Through Spherical Harmonics Illumination of High Fidelity Spatio-Angular Fields,10.1109/TVCG.2014.2346411,http://dx.doi.org/10.1109/TVCG.2014.2346411,2516,2525,J,"Diffusion kurtosis imaging (DKI) is gaining rapid adoption in the medical imaging community due to its ability to measure the non-Gaussian property of water diffusion in biological tissues. Compared to traditional diffusion tensor imaging (DTI), DKI can provide additional details about the underlying microstructural characteristics of the neural tissues. It has shown promising results in studies on changes in gray matter and mild traumatic brain injury where DTI is often found to be inadequate. The DKI dataset, which has high-fidelity spatio-angular fields, is difficult to visualize. Glyph-based visualization techniques are commonly used for visualization of DTI datasets; however, due to the rapid changes in orientation, lighting, and occlusion, visually analyzing the much more higher fidelity DKI data is a challenge. In this paper, we provide a systematic way to manage, analyze, and visualize high-fidelity spatio-angular fields from DKI datasets, by using spherical harmonics lighting functions to facilitate insights into the brain microstructure.",Sujal Bista;Jiachen Zhuo;Rao P. Gullapalli;Amitabh Varshney,Sujal Bista;Jiachen Zhuo;Rao P. Gullapalli;Amitabh Varshney,"University of Maryland, College Park;University of Maryland School of Medicine at Baltimore;University of Maryland School of Medicine at Baltimore;University of Maryland, College Park",10.1109/TVCG.2013.172;10.1109/TVCG.2007.70602;10.1109/TVCG.2010.199;10.1109/TVCG.2012.231;10.1109/VISUAL.1999.809886;10.1109/VISUAL.2004.62;10.1109/TVCG.2008.162;10.1109/VISUAL.2004.64;10.1109/VISUAL.2004.5;10.1109/TVCG.2011.198;10.1109/TVCG.2008.148,"Diffusion Kurtosis Imaging, Diffusion Tensor Imaging, Spatio-Angular Fields, Spherical Harmonics Fields, Tensor Fields",11,10,51,BP
VAST,2014,"Analyzing High-dimensional Multivariate Network Links with Integrated Anomaly Detection, Highlighting and Exploration",10.1109/VAST.2014.7042484,http://dx.doi.org/10.1109/VAST.2014.7042484,83,92,C,"This paper focuses on the integration of a family of visual analytics techniques for analyzing high-dimensional, multivariate network data that features spatial and temporal information, network connections, and a variety of other categorical and numerical data types. Such data types are commonly encountered in transportation, shipping, and logistics industries. Due to the scale and complexity of the data, it is essential to integrate techniques for data analysis, visualization, and exploration. We present new visual representations, Petal and Thread, to effectively present many-to-many network data including multi-attribute vectors. In addition, we deploy an information-theoretic model for anomaly detection across varying dimensions, displaying highlighted anomalies in a visually consistent manner, as well as supporting a managed process of exploration. Lastly, we evaluate the proposed methodology through data exploration and an empirical study.",Sungahn Ko;Shehzad Afzal;Simon J. Walton;Yang Yang;Junghoon Chae;Abish Malik;Yun Jang;Min Chen 0001;David S. Ebert,Sungahnn Ko;Shehzad Afzal;Simon Walton;Yang Yang;Junghoon Chae;Abish Malik;Yun Jang;Min Chen;David Ebert,Purdue University;Purdue University;Oxford University;Purdue University;Purdue University;Purdue University;Sejong University;Oxford University;Purdue University,10.1109/VAST.2012.6400554;10.1109/TVCG.2010.150;10.1109/TVCG.2007.70582;10.1109/TVCG.2011.190;10.1109/VAST.2011.6102440;10.1109/TVCG.2009.143;10.1109/INFVIS.1999.801851;10.1109/TVCG.2006.166;10.1109/VAST.2007.4389013,,11,10,47,
InfoVis,2015,Vials: Visualizing Alternative Splicing of Genes,10.1109/TVCG.2015.2467911,http://dx.doi.org/10.1109/TVCG.2015.2467911,399,408,J,"Alternative splicing is a process by which the same DNA sequence is used to assemble different proteins, called protein isoforms. Alternative splicing works by selectively omitting some of the coding regions (exons) typically associated with a gene. Detection of alternative splicing is difficult and uses a combination of advanced data acquisition methods and statistical inference. Knowledge about the abundance of isoforms is important for understanding both normal processes and diseases and to eventually improve treatment through targeted therapies. The data, however, is complex and current visualizations for isoforms are neither perceptually efficient nor scalable. To remedy this, we developed Vials, a novel visual analysis tool that enables analysts to explore the various datasets that scientists use to make judgments about isoforms: the abundance of reads associated with the coding regions of the gene, evidence for junctions, i.e., edges connecting the coding regions, and predictions of isoform frequencies. Vials is scalable as it allows for the simultaneous analysis of many samples in multiple groups. Our tool thus enables experts to (a) identify patterns of isoform abundance in groups of samples and (b) evaluate the quality of the data. We demonstrate the value of our tool in case studies using publicly available datasets.",Hendrik Strobelt;Bilal Alsallakh;Joseph Botros;Brant Peterson;Mark Borowsky;Hanspeter Pfister;Alexander Lex,Hendrik Strobelt;Bilal Alsallakh;Joseph Botros;Brant Peterson;Mark Borowsky;Hanspeter Pfister;Alexander Lex,Harvard University;Vienna University of Technology;Harvard University;Institute of BioMedical Research;Institute of BioMedical Research;Harvard University;Harvard University,10.1109/TVCG.2013.214;10.1109/TVCG.2013.223;10.1109/TVCG.2014.2346248,"Biology visualization, protein isoforms, mRNA-seq, directed acyclic graphs, multivariate networks",11,12,30,
SciVis,2015,"Inviwo ??? An extensible, multi-purpose visualization framework",10.1109/SciVis.2015.7429514,http://dx.doi.org/10.1109/SciVis.2015.7429514,163,164,M,"To enable visualization research impacting other scientific domains, the availability of easy-to-use visualization frameworks is essential. Nevertheless, an easy-to-use system also has to be adapted to the capabilities of modern hardware architectures, as only this allows for realizing interactive visualizations. With this trade-off in mind, we have designed and realized the cross-platform Inviwo (Interactive Visualization Workshop) visualization framework, that supports both interactive visualization research as well as efficient visualization application development and deployment. In this poster we give an overview of the architecture behind Inviwo, and show how its design enables us and other researchers to realize their visualization ideas efficiently. Inviwo consists of a modern and lightweight, graphics independent core, which is extended by optional modules that encapsulate visualization algorithms, well-known utility libraries and commonly used parallel-processing APIs (such as OpenGL and OpenCL). The core enables a simplistic structure for creating bridges between the different modules regarding data transfer across architecture and devices with an easy-to-use screen graph and minimalistic programming. Making the base structures in a modern way while providing intuitive methods of extending the functionality and creating modules based on other modules, we hope that Inviwo can help the visualization community to perform research through a rapid-prototyping design and GUI, while at the same time allowing users to take advantage of the results implemented in the system in any way they desire later on. Inviwo is publicly available at www.inviwo.org, and can be used freely by anyone under a permissive free software license (Simplified BSD).",Erik Sundén;Peter Steneteg;Sathish Kottravel;Daniel Jönsson;Rickard Englund;Martin Falk;Timo Ropinski,Erik Sunden;Peter Steneteg;Sathish Kottravel;Daniel Jonsson;Rickard Englund;Martin Falk;Timo Ropinski,Linkoping University;Linkoping University;Linkoping University;Linkoping University;Linkoping University;Linkoping University;Ulm University,,,11,10,10,
SciVis,2015,Planar Visualization of Treelike Structures,10.1109/TVCG.2015.2467413,http://dx.doi.org/10.1109/TVCG.2015.2467413,906,915,J,"We present a novel method to create planar visualizations of treelike structures (e.g., blood vessels and airway trees) where the shape of the object is well preserved, allowing for easy recognition by users familiar with the structures. Based on the extracted skeleton within the treelike object, a radial planar embedding is first obtained such that there are no self-intersections of the skeleton which would have resulted in occlusions in the final view. An optimization procedure which adjusts the angular positions of the skeleton nodes is then used to reconstruct the shape as closely as possible to the original, according to a specified view plane, which thus preserves the global geometric context of the object. Using this shape recovered embedded skeleton, the object surface is then flattened to the plane without occlusions using harmonic mapping. The boundary of the mesh is adjusted during the flattening step to account for regions where the mesh is stretched over concavities. This parameterized surface can then be used either as a map for guidance during endoluminal navigation or directly for interrogation and decision making. Depth cues are provided with a grayscale border to aid in shape understanding. Examples are presented using bronchial trees, cranial and lower limb blood vessels, and upper aorta datasets, and the results are evaluated quantitatively and with a user study.",Joseph Marino;Arie E. Kaufman,Joseph Marino;Arie Kaufman,"Computer Science Department, Stony Brook University;Computer Science Department, Stony Brook University",10.1109/TVCG.2011.235;10.1109/VISUAL.2001.964540;10.1109/TVCG.2011.192;10.1109/TVCG.2014.2346406;10.1109/VISUAL.2001.964538;10.1109/VISUAL.2004.75;10.1109/VISUAL.2002.1183754;10.1109/VISUAL.2003.1250353;10.1109/TVCG.2011.182;10.1109/TVCG.2006.172,"Geometry-based techniques, view-dependent visualization, medical visualization, planar embedding",11,8,41,
VAST,2015,Wavelet-based visualization of time-varying data on graphs,10.1109/VAST.2015.7347624,http://dx.doi.org/10.1109/VAST.2015.7347624,1,8,C,"Visualizing time-varying data defined on the nodes of a graph is a challenging problem that has been faced with different approaches. Although techniques based on aggregation, topology, and topic modeling have proven their usefulness, the visual analysis of smooth and/or abrupt data variations as well as the evolution of such variations over time are aspects not properly tackled by existing methods. In this work we propose a novel visualization methodology that relies on graph wavelet theory and stacked graph metaphor to enable the visual analysis of time-varying data defined on the nodes of a graph. The proposed method is able to identify regions where data presents abrupt and mild spacial and/or temporal variation while still been able to show how such changes evolve over time, making the identification of events an easier task. The usefulness of our approach is shown through a set of results using synthetic as well as a real data set involving taxi trips in downtown Manhattan. The methodology was able to reveal interesting phenomena and events such as the identification of specific locations with abrupt variation in the number of taxi pickups.",Paola Valdivia;Fabio Dias;Fabiano Petronetto;Cláudio T. Silva;Luis Gustavo Nonato,Paola Valdivia;Fabio Dias;Fabiano Petronetto;Cláudio T. Silva;L. G. Nonato,"University of São Paulo, Brazil;University of São Paulo, Brazil;UFES, Brazil;New York University, USA;University of São Paulo, Brazil",10.1109/VAST.2008.4677356;10.1109/TVCG.2014.2346449;10.1109/TVCG.2013.226;10.1109/INFVIS.2000.885098;10.1109/TVCG.2013.228,"Time-varying data, graph wavelets, stacked graph visualization",11,11,22,
InfoVis,2016,Visplause: Visual Data Quality Assessment of Many Time Series Using Plausibility Checks,10.1109/TVCG.2016.2598592,http://dx.doi.org/10.1109/TVCG.2016.2598592,641,650,J,"Trends like decentralized energy production lead to an exploding number of time series from sensors and other sources that need to be assessed regarding their data quality (DQ). While the identification of DQ problems for such routinely collected data is typically based on existing automated plausibility checks, an efficient inspection and validation of check results for hundreds or thousands of time series is challenging. The main contribution of this paper is the validated design of Visplause, a system to support an efficient inspection of DQ problems for many time series. The key idea of Visplause is to utilize meta-information concerning the semantics of both the time series and the plausibility checks for structuring and summarizing results of DQ checks in a flexible way. Linked views enable users to inspect anomalies in detail and to generate hypotheses about possible causes. The design of Visplause was guided by goals derived from a comprehensive task analysis with domain experts in the energy sector. We reflect on the design process by discussing design decisions at four stages and we identify lessons learned. We also report feedback from domain experts after using Visplause for a period of one month. This feedback suggests significant efficiency gains for DQ assessment, increased confidence in the DQ, and the applicability of Visplause to summarize indicators also outside the context of DQ.",Clemens Arbesser;Florian Spechtenhauser;Thomas Mühlbacher;Harald Piringer,Clemens Arbesser;Florian Spechtenhauser;Thomas Mühlbacher;Harald Piringer,"VrVis Research Center, Vienna, Austria;VrVis Research Center, Vienna, Austria;VrVis Research Center, Vienna, Austria;VrVis Research Center, Vienna, Austria",10.1109/TVCG.2014.2346248;10.1109/TVCG.2012.213;10.1109/TVCG.2012.256;10.1109/TVCG.2014.2346260;10.1109/VAST.2011.6102458;10.1109/TVCG.2009.110;10.1109/TVCG.2015.2466971,Data Quality Assessment;High-Dimensional Data;Hierarchical Aggregation;Linked Views,11,18,49,
SciVis,2016,Jacobi Fiber Surfaces for Bivariate Reeb Space Computation,10.1109/TVCG.2016.2599017,http://dx.doi.org/10.1109/TVCG.2016.2599017,960,969,J,"This paper presents an efficient algorithm for the computation of the Reeb space of an input bivariate piecewise linear scalar function f defined on a tetrahedral mesh. By extending and generalizing algorithmic concepts from the univariate case to the bivariate one, we report the first practical, output-sensitive algorithm for the exact computation of such a Reeb space. The algorithm starts by identifying the Jacobi set of f, the bivariate analogs of critical points in the univariate case. Next, the Reeb space is computed by segmenting the input mesh along the new notion of Jacobi Fiber Surfaces, the bivariate analog of critical contours in the univariate case. We additionally present a simplification heuristic that enables the progressive coarsening of the Reeb space. Our algorithm is simple to implement and most of its computations can be trivially parallelized. We report performance numbers demonstrating orders of magnitude speedups over previous approaches, enabling for the first time the tractable computation of bivariate Reeb spaces in practice. Moreover, unlike range-based quantization approaches (such as the Joint Contour Net), our algorithm is parameter-free. We demonstrate the utility of our approach by using the Reeb space as a semi-automatic segmentation tool for bivariate data. In particular, we introduce continuous scatterplot peeling, a technique which enables the reduction of the cluttering in the continuous scatterplot, by interactively selecting the features of the Reeb space to project. We provide a VTK-based C++ implementation of our algorithm that can be used for reproduction purposes or for the development of new Reeb space based visualization techniques.",Julien Tierny;Hamish A. Carr,Julien Tierny;Hamish Carr,"Sorbonne Universites, UPMC UnivParis06, CNRS, LIP6 UMR 7606, France;University of Leeds",10.1109/TVCG.2009.163;10.1109/TVCG.2007.70603;10.1109/TVCG.2006.186;10.1109/TVCG.2010.146;10.1109/TVCG.2006.165;10.1109/VISUAL.2004.96;10.1109/TVCG.2015.2467432;10.1109/TVCG.2008.116;10.1109/TVCG.2008.119;10.1109/TVCG.2014.2346332;10.1109/TVCG.2008.110,Topological data analysis;multivariate data;data segmentation,11,12,48,BP
VAST,2016,PhenoStacks: Cross-Sectional Cohort Phenotype Comparison Visualizations,10.1109/TVCG.2016.2598469,http://dx.doi.org/10.1109/TVCG.2016.2598469,191,200,J,"Cross-sectional phenotype studies are used by genetics researchers to better understand how phenotypes vary across patients with genetic diseases, both within and between cohorts. Analyses within cohorts identify patterns between phenotypes and patients (e.g., co-occurrence) and isolate special cases (e.g., potential outliers). Comparing the variation of phenotypes between two cohorts can help distinguish how different factors affect disease manifestation (e.g., causal genes, age of onset, etc.). PhenoStacks is a novel visual analytics tool that supports the exploration of phenotype variation within and between cross-sectional patient cohorts. By leveraging the semantic hierarchy of the Human Phenotype Ontology, phenotypes are presented in context, can be grouped and clustered, and are summarized via overviews to support the exploration of phenotype distributions. The design of PhenoStacks was motivated by formative interviews with genetics researchers: we distil high-level tasks, present an algorithm for simplifying ontology topologies for visualization, and report the results of a deployment evaluation with four expert genetics researchers. The results suggest that PhenoStacks can help identify phenotype patterns, investigate data quality issues, and inform data collection design.",Michael Glueck;Alina Gvozdik;Fanny Chevalier;Azam Khan;Michael Brudno;Daniel J. Wigdor,Michael Glueck;Alina Gvozdik;Fanny Chevalier;Azam Khan;Michael Brudno;Daniel Wigdor,"Autodesk ResearchUniversity of Toronto;University of Toronto;Inria;Autodesk Research;Hospital for Sick Children, University of Toronto, Toronto;University of Toronto",10.1109/TVCG.2014.2346248;10.1109/TVCG.2011.185;10.1109/TVCG.2014.2346279;10.1109/TVCG.2009.167;10.1109/TVCG.2013.124;10.1109/TVCG.2015.2467622;10.1109/TVCG.2015.2467733;10.1109/TVCG.2009.116,Cross-sectional cohort analysis;Phenotypes;Human Phenotype Ontology (HPO),11,10,45,
VAST,2016,Annotation Graphs: A Graph-Based Visualization for Meta-Analysis of Data Based on User-Authored Annotations,10.1109/TVCG.2016.2598543,http://dx.doi.org/10.1109/TVCG.2016.2598543,261,270,J,"User-authored annotations of data can support analysts in the activity of hypothesis generation and sensemaking, where it is not only critical to document key observations, but also to communicate insights between analysts. We present annotation graphs, a dynamic graph visualization that enables meta-analysis of data based on user-authored annotations. The annotation graph topology encodes annotation semantics, which describe the content of and relations between data selections, comments, and tags. We present a mixed-initiative approach to graph layout that integrates an analyst's manual manipulations with an automatic method based on similarity inferred from the annotation semantics. Various visual graph layout styles reveal different perspectives on the annotation semantics. Annotation graphs are implemented within C8, a system that supports authoring annotations during exploratory analysis of a dataset. We apply principles of Exploratory Sequential Data Analysis (ESDA) in designing C8, and further link these to an existing task typology in the visualization literature. We develop and evaluate the system through an iterative user-centered design process with three experts, situated in the domain of analyzing HCI experiment data. The results suggest that annotation graphs are effective as a method of visually extending user-authored annotations to data meta-analysis for discovery and organization of ideas.",Jian Zhao 0010;Michael Glueck;Simon Breslav;Fanny Chevalier;Azam Khan,Jian Zhao;Michael Glueck;Simon Breslav;Fanny Chevalier;Azam Khan,Autodesk Research;Autodesk Research;Autodesk Research;INRIA;Autodesk Research,10.1109/VAST.2009.5333878;10.1109/TVCG.2015.2467871;10.1109/VAST.2009.5333023;10.1109/VAST.2011.6102447;10.1109/TVCG.2008.137;10.1109/TVCG.2014.2346573;10.1109/VAST.2008.4677365;10.1109/TVCG.2013.124;10.1109/TVCG.2007.70577;10.1109/VAST.2010.5652879,Externalization user-authored annotation;exploratory sequential data analysis;graph-based visualization,11,12,39,
VAST,2016,DocuCompass: Effective exploration of document landscapes,10.1109/VAST.2016.7883507,http://dx.doi.org/10.1109/VAST.2016.7883507,11,20,C,"The creation of interactive visualization to analyze text documents has gained an impressive momentum in recent years. This is not surprising in the light of massive and still increasing amounts of available digitized texts. Websites, social media, news wire, and digital libraries are just few examples of the diverse text sources whose visual analysis and exploration offers new opportunities to effectively mine and manage the information and knowledge hidden within them. A popular visualization method for large text collections is to represent each document by a glyph in 2D space. These landscapes can be the result of optimizing pairwise distances in 2D to represent document similarities, or they are provided directly as meta data, such as geo-locations. For well-defined information needs, suitable interaction methods are available for these spatializations. However, free exploration and navigation on a level of abstraction between a labeled document spatialization and reading single documents is largely unsupported. As a result, vital foraging steps for task-tailored actions, such as selecting subgroups of documents for detailed inspection, or subsequent sense-making steps are hampered. To fill in this gap, we propose DocuCompass, a focus+context approach based on the lens metaphor. It comprises multiple methods to characterize local groups of documents, and to efficiently guide exploration based on users' requirements. DocuCompass thus allows for effective interactive exploration of document landscapes without disrupting the mental map of users by changing the layout itself. We discuss the suitability of multiple navigation and characterization methods for different spatializations and texts. Finally, we provide insights generated through user feedback and discuss the effectiveness of our approach.",Florian Heimerl;Markus John;Qi Han 0006;Steffen Koch;Thomas Ertl,Florian Heimerl;Markus John;Qi Han;Steffen Koch;Thomas Ertl,,10.1109/INFVIS.1995.528686;10.1109/VAST.2009.5333443;10.1109/TVCG.2012.277;10.1109/VAST.2007.4389006;10.1109/VAST.2011.6102449;10.1109/TVCG.2013.186;10.1109/VAST.2012.6400487;10.1109/TVCG.2014.2346433;10.1109/TVCG.2008.152;10.1109/TVCG.2013.212;10.1109/TVCG.2013.162;10.1109/TVCG.2015.2467717;10.1109/VAST.2011.6102488;10.1109/VAST.2011.6102456,,11,10,54,
VAST,2016,DropoutSeer: Visualizing learning patterns in Massive Open Online Courses for dropout reasoning and prediction,10.1109/VAST.2016.7883517,http://dx.doi.org/10.1109/VAST.2016.7883517,111,120,C,"Aiming at massive participation and open access education, Massive Open Online Courses (MOOCs) have attracted millions of learners over the past few years. However, the high dropout rate of learners is considered to be one of the most crucial factors that may hinder the development of MOOCs. To tackle this problem, statistical models have been developed to predict dropout behavior based on learner activity logs. Although predictive models can foresee the dropout behavior, it is still difficult for users to understand the reasons behind the predicted results and further design interventions to prevent dropout. In addition, with a better understanding of dropout, researchers in the area of predictive modeling in turn can improve the models. In this paper, we introduce DropoutSeer, a visual analytics system which not only helps instructors and education experts understand the reasons for dropout, but also allows researchers to identify crucial features which can further improve the performance of the models. Both the heterogeneous data extracted from three different kinds of learner activity logs (i.e., clickstream, forum posts and assignment records) and the predicted results are visualized in the proposed system. Case studies and expert interviews have been conducted to demonstrate the usefulness and effectiveness of DropoutSeer.",Yuanzhe Chen;Qing Chen 0001;Mingqian Zhao;Sebastien Boyer;Kalyan Veeramachaneni;Huamin Qu,Yuanzhe Chen;Qing Chen;Mingqian Zhao;Sebastien Boyer;Kalyan Veeramachaneni;Huamin Qu,"Hong Kong University of Science and Technology, China;Hong Kong University of Science and Technology, China;Hong Kong University of Science and Technology, China;Massachusetts Institute of Technology, United States of America;Massachusetts Institute of Technology, United States of America;Hong Kong University of Science and Technology, China",10.1109/INFVIS.1999.801851;10.1109/TVCG.2015.2468151;10.1109/INFVIS.2000.885098;10.1109/VAST.2010.5652931;10.1109/TVCG.2010.129;10.1109/VAST.2012.6400557;10.1109/INFVIS.2001.963273;10.1109/TVCG.2013.221;10.1109/TVCG.2007.70515;10.1109/TVCG.2011.239,,11,15,41,
InfoVis,2017,What Would a Graph Look Like in this Layout? A Machine Learning Approach to Large Graph Visualization,10.1109/TVCG.2017.2743858,http://dx.doi.org/10.1109/TVCG.2017.2743858,478,488,J,"Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a “good” layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to selecting a good layout is to use aesthetic criteria and visual inspection. However, fully calculating various layouts and their associated aesthetic metrics is computationally expensive. In this paper, we present a machine learning approach to large graph visualization based on computing the topological similarity of graphs using graph kernels. For a given graph, our approach can show what the graph would look like in different layouts and estimate their corresponding aesthetic metrics. An important contribution of our work is the development of a new framework to design graph kernels. Our experimental study shows that our estimation calculation is considerably faster than computing the actual layouts and their aesthetic metrics. Also, our graph kernels outperform the state-of-the-art ones in both time and accuracy. In addition, we conducted a user study to demonstrate that the topological similarity computed with our graph kernel matches perceptual similarity assessed by human users.",Oh-Hyun Kwon;Tarik Crnovrsanin;Kwan-Liu Ma,Oh-Hyun Kwon;Tarik Crnovrsanin;Kwan-Liu Ma,"University of California, Davis;University of California, Davis;University of California, Davis",10.1109/TVCG.2016.2598467;10.1109/TVCG.2007.70580;10.1109/TVCG.2015.2467451;10.1109/INFVIS.2002.1173159;10.1109/TVCG.2008.158;10.1109/TVCG.2008.155;10.1109/TVCG.2016.2598867,"Graph visualization,graph layout,aesthetics,machine learning,graph kernel,graphlet",11,13,92,
InfoVis,2017,CyteGuide: Visual Guidance for Hierarchical Single-Cell Analysis,10.1109/TVCG.2017.2744318,http://dx.doi.org/10.1109/TVCG.2017.2744318,739,748,J,"Single-cell analysis through mass cytometry has become an increasingly important tool for immunologists to study the immune system in health and disease. Mass cytometry creates a high-dimensional description vector for single cells by time-of-flight measurement. Recently, t-Distributed Stochastic Neighborhood Embedding (t-SNE) has emerged as one of the state-of-the-art techniques for the visualization and exploration of single-cell data. Ever increasing amounts of data lead to the adoption of Hierarchical Stochastic Neighborhood Embedding (HSNE), enabling the hierarchical representation of the data. Here, the hierarchy is explored selectively by the analyst, who can request more and more detail in areas of interest. Such hierarchies are usually explored by visualizing disconnected plots of selections in different levels of the hierarchy. This poses problems for navigation, by imposing a high cognitive load on the analyst. In this work, we present an interactive summary-visualization to tackle this problem. CyteGuide guides the analyst through the exploration of hierarchically represented single-cell data, and provides a complete overview of the current state of the analysis. We conducted a two-phase user study with domain experts that use HSNE for data exploration. We first studied their problems with their current workflow using HSNE and the requirements to ease this workflow in a field study. These requirements have been the basis for our visual design. In the second phase, we verified our proposed solution in a user evaluation.",Thomas Höllt;Nicola Pezzotti;Vincent van Unen;Frits Koning;Boudewijn P. F. Lelieveldt;Anna Vilanova,Thomas Höllt;Nicola Pezzotti;Vincent van Unen;Frits Koning;Boudewijn P.F. Lelieveldt;Anna Vilanova,"Computer Graphics and Visualization Group, Delft University of Technology, The Netherlands;Computer Graphics and Visualization Group, Delft University of Technology, The Netherlands;Department of Immunohematology and Blood Transfusion, Leiden University Medical Center, The Netherlands;Department of Immunohematology and Blood Transfusion, Leiden University Medical Center, The Netherlands;Department of Radiology, Division of Image Processing, Leiden University Medical Center, The Netherlands;Computer Graphics and Visualization Group, Delft University of Technology, The Netherlands",10.1109/TVCG.2007.70540;10.1109/TVCG.2011.185;10.1109/VISUAL.1991.175815;10.1109/TVCG.2014.2346578;10.1109/TVCG.2008.138;10.1109/INFVIS.2001.963283;10.1109/INFVIS.2000.885091;10.1109/TVCG.2014.2346574;10.1109/TVCG.2016.2598470;10.1109/INFVIS.1999.801860;10.1109/TVCG.2006.200,"Hierarchical Data,HSNE,Single-Cell Analysis,Visual Guidance",11,5,43,
InfoVis,2017,CasCADe: A Novel 4D Visualization System for Virtual Construction Planning,10.1109/TVCG.2017.2745105,http://dx.doi.org/10.1109/TVCG.2017.2745105,687,697,J,"Building Information Modeling (BIM) provides an integrated 3D environment to manage large-scale engineering projects. The Architecture, Engineering and Construction (AEC) industry explores 4D visualizations over these datasets for virtual construction planning. However, existing solutions lack adequate visual mechanisms to inspect the underlying schedule and make inconsistencies readily apparent. The goal of this paper is to apply best practices of information visualization to improve 4D analysis of construction plans. We first present a review of previous work that identifies common use cases and limitations. We then consulted with AEC professionals to specify the main design requirements for such applications. These guided the development of CasCADe, a novel 4D visualization system where task sequencing and spatio-temporal simultaneity are immediately apparent. This unique framework enables the combination of diverse analytical features to create an information-rich analysis environment. We also describe how engineering collaborators used CasCADe to review the real-world construction plans of an Oil &amp;amp; Gas process plant. The system made evident schedule uncertainties, identified work-space conflicts and helped analyze other constructability issues. The results and contributions of this paper suggest new avenues for future research in information visualization for the AEC industry.",Paulo Ivson 0001;Daniel Nascimento;Waldemar Celes Filho;Simone D. J. Barbosa,Paulo Ivson;Daniel Nascimento;Waldemar Celes;Simone DJ Barbosa,Tecgraf InstitutePUC-Rio;Tecgraf InstitutePUC-Rio;Tecgraf InstitutePUC-Rio;Informatics DepartmentPUC-Rio,10.1109/VISUAL.1995.480803;10.1109/TVCG.2006.140;10.1109/TVCG.2007.70574;10.1109/TVCG.2007.70535;10.1109/VISUAL.1997.663876;10.1109/VISUAL.1996.568118;10.1109/TVCG.2007.70539;10.1109/TVCG.2013.126;10.1109/TVCG.2009.152;10.1109/TVCG.2012.213;10.1109/TVCG.2006.115;10.1109/TVCG.2012.265;10.1109/TVCG.2016.2599041;10.1109/TVCG.2007.70570;10.1109/TVCG.2007.70515,"Visualization in physical sciences and engineering,design studies,integrating spatial and non-spatial data visualization,task and requirements analysis",11,3,119,
InfoVis,2017,Conceptual and Methodological Issues in Evaluating Multidimensional Visualizations for Decision Support,10.1109/TVCG.2017.2745138,http://dx.doi.org/10.1109/TVCG.2017.2745138,749,759,J,"We explore how to rigorously evaluate multidimensional visualizations for their ability to support decision making. We first define multi-attribute choice tasks, a type of decision task commonly performed with such visualizations. We then identify which of the existing multidimensional visualizations are compatible with such tasks, and set out to evaluate three elementary visualizations: parallel coordinates, scatterplot matrices and tabular visualizations. Our method consists in first giving participants low-level analytic tasks, in order to ensure that they properly understood the visualizations and their interactions. Participants are then given multi-attribute choice tasks consisting of choosing holiday packages. We assess decision support through multiple objective and subjective metrics, including a decision accuracy metric based on the consistency between the choice made and self-reported preferences for attributes. We found the three visualizations to be comparable on most metrics, with a slight advantage for tabular visualizations. In particular, tabular visualizations allow participants to reach decisions faster. Thus, although decision time is typically not central in assessing decision support, it can be used as a tie-breaker when visualizations achieve similar decision accuracy. Our results also suggest that indirect methods for assessing choice confidence may allow to better distinguish between visualizations than direct ones. We finally discuss the limitations of our methods and directions for future work, such as the need for more sensitive metrics of decision support.",Evanthia Dimara;Anastasia Bezerianos;Pierre Dragicevic,Evanthia Dimara;Anastasia Bezerianos;Pierre Dragicevic,"Inria, France;Univ. Paris-Sud, CNRS, Inria, Universit&#x00E9; Paris-Saclay, France;Inria, France",10.1109/VAST.2011.6102457;10.1109/INFVIS.2005.1532136;10.1109/INFVIS.2004.10;10.1109/TVCG.2015.2467552;10.1109/TVCG.2016.2598594;10.1109/TVCG.2008.153;10.1109/INFVIS.2004.64;10.1109/VISUAL.1999.809866;10.1109/TVCG.2013.173;10.1109/TVCG.2014.2346979;10.1109/TVCG.2006.160;10.1109/TVCG.2013.160;10.1109/TVCG.2015.2466992;10.1109/TVCG.2015.2467671;10.1109/TVCG.2016.2598589;10.1109/TVCG.2014.2346279;10.1109/VAST.2009.5333920;10.1109/TVCG.2015.2468011;10.1109/TVCG.2014.2346320;10.1109/TVCG.2010.205;10.1109/VISUAL.1997.663867;10.1109/INFVIS.2003.1249015,"decision making,multidimensional visualization,parallel coordinates,scatterplot matrix,tabular visualization,evaluation",11,4,91,
InfoVis,2017,Stable Treemaps via Local Moves,10.1109/TVCG.2017.2745140,http://dx.doi.org/10.1109/TVCG.2017.2745140,729,738,J,"Treemaps are a popular tool to visualize hierarchical data: items are represented by nested rectangles and the area of each rectangle corresponds to the data being visualized for this item. The visual quality of a treemap is commonly measured via the aspect ratio of the rectangles. If the data changes, then a second important quality criterion is the stability of the treemap: how much does the treemap change as the data changes. We present a novel stable treemapping algorithm that has very high visual quality. Whereas existing treemapping algorithms generally recompute the treemap every time the input changes, our algorithm changes the layout of the treemap using only local modifications. This approach not only gives us direct control over stability, but it also allows us to use a larger set of possible layouts, thus provably resulting in treemaps of higher visual quality compared to existing algorithms. We further prove that we can reach all possible treemap layouts using only our local modifications. Furthermore, we introduce a new measure for stability that better captures the relative positions of rectangles. We finally show via experiments on real-world data that our algorithm outperforms existing treemapping algorithms also in practice on either visual quality and/or stability. Our algorithm scores high on stability regardless of whether we use an existing stability measure or our new measure.",Max Sondag;Bettina Speckmann;Kevin Verbeek,Max Sondag;Bettina Speckmann;Kevin Verbeek,TU Eindhoven;TU Eindhoven;TU Eindhoven,10.1109/INFVIS.2001.963283;10.1109/TVCG.2007.70529;10.1109/INFVIS.2005.1532145,"Treemap,Stability,Local Moves",11,9,20,
InfoVis,2017,Bridging from Goals to Tasks with Design Study Analysis Reports,10.1109/TVCG.2017.2744319,http://dx.doi.org/10.1109/TVCG.2017.2744319,435,445,J,"Visualization researchers and practitioners engaged in generating or evaluating designs are faced with the difficult problem of transforming the questions asked and actions taken by target users from domain-specific language and context into more abstract forms. Existing abstract task classifications aim to provide support for this endeavour by providing a carefully delineated suite of actions. Our experience is that this bottom-up approach is part of the challenge: low-level actions are difficult to interpret without a higher-level context of analysis goals and the analysis process. To bridge this gap, we propose a framework based on analysis reports derived from open-coding 20 design study papers published at IEEE InfoVis 2009-2015, to build on the previous work of abstractions that collectively encompass a broad variety of domains. The framework is organized in two axes illustrated by nine analysis goals. It helps situate the analysis goals by placing each goal under axes of specificity (Explore, Describe, Explain, Confirm) and number of data populations (Single, Multiple). The single-population types are Discover Observation, Describe Observation, Identify Main Cause, and Collect Evidence. The multiple-population types are Compare Entities, Explain Differences, and Evaluate Hypothesis. Each analysis goal is scoped by an input and an output and is characterized by analysis steps reported in the design study papers. We provide examples of how we and others have used the framework in a top-down approach to abstracting domain problems: visualization designers or researchers first identify the analysis goals of each unit of analysis in an analysis stream, and then encode the individual steps using existing task classifications with the context of the goal, the level of specificity, and the number of populations involved in the analysis.",Heidi Lam;Melanie Tory;Tamara Munzner,Heidi Lam;Melanie Tory;Tamara Munzner,Tableau Research;Tableau Research;University of British Columbia,10.1109/TVCG.2014.2346312;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2013.124;10.1109/TVCG.2011.176;10.1109/TVCG.2013.214;10.1109/VAST.2008.4677365;10.1109/TVCG.2010.164;10.1109/TVCG.2014.2346456;10.1109/TVCG.2013.126;10.1109/TVCG.2010.193;10.1109/TVCG.2012.286;10.1109/TVCG.2013.154;10.1109/TVCG.2009.180;10.1109/TVCG.2014.2346573;10.1109/TVCG.2015.2467811;10.1109/TVCG.2010.137;10.1109/TVCG.2009.111;10.1109/TVCG.2009.116;10.1109/TVCG.2014.2346311;10.1109/TVCG.2013.192;10.1109/TVCG.2012.263;10.1109/TVCG.2014.2346445;10.1109/TVCG.2011.253;10.1109/TVCG.2015.2467754;10.1109/TVCG.2013.130;10.1109/TVCG.2013.120;10.1109/TVCG.2014.2346321;10.1109/TVCG.2015.2467911;10.1109/VISUAL.1990.146375;10.1109/TVCG.2011.174;10.1109/TVCG.2012.226,"Framework,Data Analysis,Analysis Goals,Design Studies,Open Coding,Task Classifications",11,9,53,HM
SciVis,2017,Clique Community Persistence: A Topological Visual Analysis Approach for Complex Networks,10.1109/TVCG.2017.2744321,http://dx.doi.org/10.1109/TVCG.2017.2744321,822,831,J,"Complex networks require effective tools and visualizations for their analysis and comparison. Clique communities have been recognized as a powerful concept for describing cohesive structures in networks. We propose an approach that extends the computation of clique communities by considering persistent homology, a topological paradigm originally introduced to characterize and compare the global structure of shapes. Our persistence-based algorithm is able to detect clique communities and to keep track of their evolution according to different edge weight thresholds. We use this information to define comparison metrics and a new centrality measure, both reflecting the relevance of the clique communities inherent to the network. Moreover, we propose an interactive visualization tool based on nested graphs that is capable of compactly representing the evolving relationships between communities for different thresholds and clique degrees. We demonstrate the effectiveness of our approach on various network types.",Bastian Rieck;Ulderico Fugacci;Jonas Lukasczyk;Heike Leitte,Bastian Rieck;Ulderico Fugacci;Jonas Lukasczyk;Heike Leitte,TU Kaiserslautern;TU Kaiserslautern;TU Kaiserslautern;TU Kaiserslautern,10.1109/INFVIS.2004.66;10.1109/TVCG.2008.151,"Persistent homology,topological persistence,cliques,complex networks,visual analysis",11,4,49,
VAST,2017,Supporting Handoff in Asynchronous Collaborative Sensemaking Using Knowledge-Transfer Graphs,10.1109/TVCG.2017.2745279,http://dx.doi.org/10.1109/TVCG.2017.2745279,340,350,J,"During asynchronous collaborative analysis, handoff of partial findings is challenging because externalizations produced by analysts may not adequately communicate their investigative process. To address this challenge, we developed techniques to automatically capture and help encode tacit aspects of the investigative process based on an analyst's interactions, and streamline explicit authoring of handoff annotations. We designed our techniques to mediate awareness of analysis coverage, support explicit communication of progress and uncertainty with annotation, and implicit communication through playback of investigation histories. To evaluate our techniques, we developed an interactive visual analysis system, KTGraph, that supports an asynchronous investigative document analysis task. We conducted a two-phase user study to characterize a set of handoff strategies and to compare investigative performance with and without our techniques. The results suggest that our techniques promote the use of more effective handoff strategies, help increase an awareness of prior investigative process and insights, as well as improve final investigative outcomes.",Jian Zhao 0010;Michael Glueck;Petra Isenberg;Fanny Chevalier;Azam Khan,Jian Zhao;Michael Glueck;Petra Isenberg;Fanny Chevalier;Azam Khan,FX Palo Alto Laboratory;Autodesk Research;Inria;Inria;Autodesk Research,10.1109/VAST.2007.4389009;10.1109/VAST.2011.6102447;10.1109/VAST.2010.5652932;10.1109/VAST.2006.261420;10.1109/VAST.2007.4389011;10.1109/TVCG.2008.137;10.1109/TVCG.2007.70568;10.1109/VAST.2009.5333020;10.1109/VAST.2009.5333878;10.1109/VAST.2011.6102438;10.1109/VAST.2006.261415;10.1109/TVCG.2014.2346573;10.1109/TVCG.2015.2467551;10.1109/VAST.2008.4677358;10.1109/TVCG.2016.2598466;10.1109/VAST.2007.4389006;10.1109/TVCG.2007.70577;10.1109/TVCG.2007.70589;10.1109/TVCG.2016.2598543,"Collaboration,sensemaking,handoff,handover,structured externalizations,interactive visual analysis",11,9,55,HM
VAST,2018,Clustrophile 2: Guided Visual Clustering Analysis,10.1109/TVCG.2018.2864477,http://dx.doi.org/10.1109/TVCG.2018.2864477,267,276,J,"Data clustering is a common unsupervised learning method frequently used in exploratory data analysis. However, identifying relevant structures in unlabeled, high-dimensional data is nontrivial, requiring iterative experimentation with clustering parameters as well as data features and instances. The number of possible clusterings for a typical dataset is vast, and navigating in this vast space is also challenging. The absence of ground-truth labels makes it impossible to define an optimal solution, thus requiring user judgment to establish what can be considered a satisfiable clustering result. Data scientists need adequate interactive tools to effectively explore and navigate the large clustering space so as to improve the effectiveness of exploratory clustering analysis. We introduce Clustrophile 2, a new interactive tool for guided clustering analysis. Clustrophile 2 guides users in clustering-based exploratory analysis, adapts user feedback to improve user guidance, facilitates the interpretation of clusters, and helps quickly reason about differences between clusterings. To this end, Clustrophile 2 contributes a novel feature, the Clustering Tour, to help users choose clustering parameters and assess the quality of different clustering results in relation to current analysis goals and user expectations. We evaluate Clustrophile 2 through a user study with 12 data scientists, who used our tool to explore and interpret sub-cohorts in a dataset of Parkinson's disease patients. Results suggest that Clustrophile 2 improves the speed and effectiveness of exploratory clustering analysis for both experts and non-experts.",Marco Cavallo;Çagatay Demiralp,Marco Cavallo;Çağatay Demiralp,IBM Research;MIT CSAIL & Fitnescity Labs,10.1109/TVCG.2011.188;10.1109/TVCG.2013.119;10.1109/TVCG.2012.219;10.1109/TVCG.2017.2745085;10.1109/TVCG.2010.138;10.1109/VAST.2007.4388999;10.1109/TVCG.2012.207;10.1109/TVCG.2017.2744805;10.1109/VAST.2008.4677350;10.1109/INFVIS.2004.3;10.1109/TVCG.2015.2467191,"Clustering tour,Guided data analysis,Unsupervised learning,Exploratory data analysis,Interactive clustering analysis,Interpretability,Explainability,Visual data exploration recommendation,Dimensionality reduction,What-if analysis,Clustrophile",11,8,46,
VAST,2018,ForVizor: Visualizing Spatio-Temporal Team Formations in Soccer,10.1109/TVCG.2018.2865041,http://dx.doi.org/10.1109/TVCG.2018.2865041,65,75,J,"Regarded as a high-level tactic in soccer, a team formation assigns players different tasks and indicates their active regions on the pitch, thereby influencing the team performance significantly. Analysis of formations in soccer has become particularly indispensable for soccer analysts. However, formations of a team are intrinsically time-varying and contain inherent spatial information. The spatio-temporal nature of formations and other characteristics of soccer data, such as multivariate features, make analysis of formations in soccer a challenging problem. In this study, we closely worked with domain experts to characterize domain problems of formation analysis in soccer and formulated several design goals. We design a novel spatio-temporal visual representation of changes in team formation, allowing analysts to visually analyze the evolution of formations and track the spatial flow of players within formations over time. Based on the new design, we further design and develop ForVizor, a visual analytics system, which empowers users to track the spatio-temporal changes in formation and understand how and why such changes occur. With ForVizor, domain experts conduct formation analysis of two games. Analysis results with insights and useful feedback are summarized in two case studies.",Yingcai Wu;Xiao Xie;Jiachen Wang;Dazhen Deng;Hongye Liang;Hui Zhang;Shoubin Cheng;Wei Chen 0001,Yingcai Wu;Xiao Xie;Jiachen Wang;Dazhen Deng;Hongye Liang;Hui Zhang;Shoubin Cheng;Wei Chen,State Key Lab of CAD&CGZhejiang University;State Key Lab of CAD&CGZhejiang University;State Key Lab of CAD&CGZhejiang University;State Key Lab of CAD&CGZhejiang University;State Key Lab of CAD&CGZhejiang University;Department of Sport ScienceZhejiang University;Department of Sport ScienceZhejiang University;State Key Lab of CAD&CGZhejiang University,10.1109/VAST.2008.4677356;10.1109/TVCG.2011.239;10.1109/TVCG.2014.2346433;10.1109/VAST.2014.7042477;10.1109/TVCG.2018.2865018;10.1109/TVCG.2016.2598831;10.1109/TVCG.2013.192;10.1109/TVCG.2014.2346445;10.1109/TVCG.2017.2745181;10.1109/TVCG.2017.2744218,"Soccer data,formation analysis,spatio-temporal visualization",11,8,48,
VAST,2018,DQNViz: A Visual Analytics Approach to Understand Deep Q-Networks,10.1109/TVCG.2018.2864504,http://dx.doi.org/10.1109/TVCG.2018.2864504,288,298,J,"Deep Q-Network (DQN), as one type of deep reinforcement learning model, targets to train an intelligent agent that acquires optimal actions while interacting with an environment. The model is well known for its ability to surpass professional human players across many Atari 2600 games. Despite the superhuman performance, in-depth understanding of the model and interpreting the sophisticated behaviors of the DQN agent remain to be challenging tasks, due to the long-time model training process and the large number of experiences dynamically generated by the agent. In this work, we propose DQNViz, a visual analytics system to expose details of the blind training process in four levels, and enable users to dive into the large experience space of the agent for comprehensive analysis. As an initial attempt in visualizing DQN models, our work focuses more on Atari games with a simple action space, most notably the Breakout game. From our visual analytics of the agent's experiences, we extract useful action/reward patterns that help to interpret the model and control the training. Through multiple case studies conducted together with deep learning experts, we demonstrate that DQNViz can effectively help domain experts to understand, diagnose, and potentially improve DQN models.",Junpeng Wang;Liang Gou;Han-Wei Shen;Hao Yang,Junpeng Wang;Liang Gou;Han-Wei Shen;Hao Yang,The Ohio State University;Visa Research;The Ohio State University;Visa Research,10.1109/TVCG.2017.2744683;10.1109/TVCG.2014.2346682;10.1109/TVCG.2017.2745320;10.1109/TVCG.2017.2744718;10.1109/TVCG.2011.179;10.1109/TVCG.2017.2744938;10.1109/TVCG.2016.2598831;10.1109/VAST.2017.8585721;10.1109/TVCG.2013.200;10.1109/TVCG.2017.2744358;10.1109/TVCG.2017.2744158,"Deep Q-Network (DQN),reinforcement learning,model interpretation,visual analytics",11,17,55,HM
Vis,1990,Design of an end-user data visualization system,10.1109/VISUAL.1990.146397,http://dx.doi.org/10.1109/VISUAL.1990.146397,323,"328, 487",C,"The authors describe the architecture of an end-user visualization system that supports interactive analysis of three-dimensional scalar and vector data in a heterogeneous hardware environment. The system supports a variety of visualization methods with applicability in disciplines such as computational fluid dynamics, earth, and space sciences, and finite-element analysis. The authors discuss how design goals and hardware constraints lead to a simple, cohesive paradigm for implementing a powerful, flexible, and portable visualization system. To assure efficient operation across a broad range of hardware platforms, the tools were implemented so that their interactivity is largely independent of data complexity. To gain portability, the system was built on a platform-independent graphics layer and user interface management system. The authors outline general concerns with current visualization methods and show how the approach simplifies the visualization process.&lt;&lt;ETX&gt;&gt;",Donald L. Brittain;Josh Aller;Michael Wilson;Sue-Ling C. Wang,D.L. Brittain;J. Aller;M. Wilson;S.-L.C. Wang,"Wavefront Technol. Inc., Santa Barbara, CA, USA;Wavefront Technol. Inc., Santa Barbara, CA, USA;Wavefront Technol. Inc., Santa Barbara, CA, USA;Wavefront Technol. Inc., Santa Barbara, CA, USA",,,10,4,8,
Vis,1992,Logical time in visualizations produced by parallel programs,10.1109/VISUAL.1992.235209,http://dx.doi.org/10.1109/VISUAL.1992.235209,186,193,C,"Techniques that manipulate logical time in order to produce coherent animations of parallel program behavior despite the presence of asynchrony are presented. The techniques interpret program behavior in light of user-defined abstractions and generate animations based on a logical, rather than a physical, view of time. If this interpretation succeeds, the resulting animation is easily understood. If it fails, the programmer can be assured that the failure was not an artifact of the visualization. It is shown that these techniques can be generally applied to enhance visualizations of a variety of types of data as they are produced by parallel, MIMD (multiple instruction stream, multiple data stream) computations.&lt;&lt;ETX&gt;&gt;",Janice E. Cuny;Alfred Hough;Joydip Kunda,J.E. Cuny;A.A. Hough;J. Kundu,"Dept. of Comput. Sci., Massachusetts Univ., Amherst, MA, USA;Dept. of Comput. Sci., Massachusetts Univ., Amherst, MA, USA;Dept. of Comput. Sci., Massachusetts Univ., Amherst, MA, USA",,,10,5,18,
Vis,1994,An object oriented design for the visualization of multi-variable data objects,10.1109/VISUAL.1994.346303,http://dx.doi.org/10.1109/VISUAL.1994.346303,318,"325, C35",C,"This paper presents an object-oriented system design supporting the composition of scientific data visualization techniques based on the definition of hierarchies of typed data objects and tools. Traditional visualization systems focus on creating graphical objects which often cannot be re-used for further processing. Our approach provides objects of different topological dimension to offer a natural way of describing the results of visualization mappings. Serial composition of data extraction tools is allowed, while each intermediate visualization object shares a common description and behavior. Visualization objects can be re-used, facilitating the data exploration process by expanding the available analysis and correlation functions provided. This design offers an open-ended architecture for the development of new visualization techniques. It promotes data and software re-use, eliminates the need for writing special purpose software and reduces processing requirements during interactive visualization sessions.&lt;&lt;ETX&gt;&gt;",Jean-Marie Favre;James K. Hahn,J.M. Favre;J. Hahn,"Dept. of Electr. Eng. & Comput. Sci., George Washington Univ., Washington, DC, USA;Dept. of Electr. Eng. & Comput. Sci., George Washington Univ., Washington, DC, USA",10.1109/VISUAL.1991.175804;10.1109/VISUAL.1992.235219;10.1109/VISUAL.1990.146373;10.1109/VISUAL.1992.235205,,10,2,15,
Vis,1995,Volume-based reasoning and visualization of diecastability,10.1109/VISUAL.1995.485152,http://dx.doi.org/10.1109/VISUAL.1995.485152,359,"362, 474",C,"Because of the nature of the die casting process, the part geometry severely restricts the die geometry and hence affects the quality of the part. However, as is often the case in other manufacturing processes, diecastings are currently designed purely based on their function. The manufacturability of the diecastings is not considered until the design has been nearly completed and detailed. This is due to the design support limitations of current CAE tools. We present a new volume-based approach to support diecastability evaluation, especially in preliminary design. Our approach can be applied to arbitrarily shaped parts without pre-defined feature libraries. The focus is on the identification of geometric characteristics, e.g. heavy mass regions, that could be responsible for thermal-related part defects. A distance transform with city-block metric is used to extract this geometric property. Volume visualization techniques are also adopted to allow users to visualize the results in a clear and precise way.",Roni Yagel;Shao-Chiung Lu;Alec B. Rebello;R. A. Miller,R. Yagel;S.C. Lu;A.B. Rebello;R.A. Miller,"Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA",,,10,5,9,
Vis,1996,Electrical energy absorption in the human head from a cellular telephone,10.1109/VISUAL.1996.568135,http://dx.doi.org/10.1109/VISUAL.1996.568135,371,374,C,"The antenna of a cellular telephone in close proximity to the human head for a variety of time periods raises questions. This research uses the finite-difference time-domain (FDTD) method to calculate the power deposition from a cellular telephone on a high-resolution model of a human head as measured by the specific absorption rates (SAR) in W/kg. Visualization has been used to verify the modeling for simulation, assisted in analyzing the data and understanding the physical aspects controlling the power absorption.",Vishram Pandit;Robert McDermott;Gianluca Lazzi;Cynthia M. Furse;Om Gandhi,V. Pandit;R. McDermott;G. Lazzi;C. Furse;O. Gandhi,"Dept. of Electr. Eng., Utah Univ., Salt Lake City, UT, USA",,,10,7,3,
Vis,1996,Interactive visualization of ocean circulation models,10.1109/VISUAL.1996.568149,http://dx.doi.org/10.1109/VISUAL.1996.568149,429,432,C,Visualization of computational oceanography is traditionally a post-processing step. This batch orientation is clumsy if one wants to observe the effect of a wide range of parameters on the solution. This paper describes the conversion of an ocean circulation model from this traditional design to an interactive program in which the computed solution is viewed in real-time over a wide-area network and the user is given the ability to change the model parameters and immediately observe the impact this has on the solution.,Scott Nations;Robert J. Moorhead II;Kelly P. Gaither;Steve Aukstakalnis;Rhonda Vickery;Warren Carl Couvillion Jr.;Daniel N. Fox;Peter Flynn;Alan J. Wallcraft;Patrick Hogan;Ole Martin Smedstad,S. Nations;O.M. Smedstad;R. Moorhead;K. Gaither;S. Aukstakalnis;R. Vickery;W.C. Couvillion;D.N. Fox;P. Flynn;A. Wallcraft;P. Hogan,"Mississippi State Univ., MS, USA",,,10,6,4,
InfoVis,1997,Managing software with new visual representations,10.1109/INFVIS.1997.636782,http://dx.doi.org/10.1109/INFVIS.1997.636782,30,37,C,"Managing large projects is a very challenging task requiring the tracking and scheduling of many resources. Although new technologies have made it possible to automatically collect data on project resources, it is very difficult to access this data because of its size and lack of structure. We present three novel glyphs for simplifying this process and apply them to visualizing statistics from a multi-million line software project. These glyphs address four important needs in project management: viewing time dependent data; managing large data volumes; dealing with diverse data types; and correspondence of data to real-world concepts.",Mei C. Chuah;Stephen G. Eick,M.C. Chuah;S.G. Eick,"Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA",10.1109/VISUAL.1993.398874,,10,4,14,
Vis,1997,Information Exploration Shootout Project And Benchmark Data Sets: Evaluating How Visualization Does In Analyzing Real-World Data Analysis Problems,10.1109/VISUAL.1997.663933,http://dx.doi.org/10.1109/VISUAL.1997.663933,511,513,M,,Georges G. Grinstein;Sharon J. Laskowski;Graham J. Wills;Bernice E. Rogowitz,S. Laskowski;G. Wills;B. Rogowitz,National Institute for Standards and Technology,,,10,1,7,
Vis,1997,Perceptual Measures For Effective Visualizations,10.1109/VISUAL.1997.663934,http://dx.doi.org/10.1109/VISUAL.1997.663934,515,517,M,,Holly E. Rushmeier;Harrison H. Barrett;Penny Rheingans;Samuel P. Uselton;Andrew Watson,H. Barrett;P. Rheingans;S. Uselton;A. Watson,University of Arizona,,,10,0,10,
Vis,1998,Acoustic imaging and visualization of plumes discharging from black smoker vents on the deep seafloor,10.1109/VISUAL.1998.745347,http://dx.doi.org/10.1109/VISUAL.1998.745347,475,478,C,"Visualization and quantification methods are being developed to analyze our acoustic images of thermal plumes containing metallic mineral particles that discharge from hot springs on the deep seafloor. The acoustic images record intensity of backscattering from the particulate matter suspended in the plumes. The visualization methods extract, classify, visualize, measure and track reconstructions of the plumes, depicted by isointensity surfaces as 3D volume objects and 2D slices. The parameters measured, including plume volume, cross sectional area, centerline location (trajectory), surface area and isosurfaces at percentages of maximum backscatter intensity, are being used to derive elements of plume behavior including expansion with height, dilution, and mechanisms of entrainment of surrounding seawater. Our aim is to compare the observational data with predictions of plume theory to test and advance models of the behavior of hydrothermal plumes through the use of multiple representations.",Peter A. Rona;Karen G. Bemis;Deepak R. Kenchammana-Hosekote;Deborah Silver,P. Rona;K. Bemis;D. Kenchammana-Hosekote;D. Silver,"Inst. of Marine & Coastal Sci., Rutgers Univ., New Brunswick, NJ, USA",10.1109/VISUAL.1995.485141,,10,7,12,
Vis,1999,VizCraft: a multidimensional visualization tool for aircraft configuration design,10.1109/VISUAL.1999.809921,http://dx.doi.org/10.1109/VISUAL.1999.809921,425,555,C,"We describe a visualization tool to aid aircraft designers during the conceptual design stage. The conceptual design for an aircraft is defined by a vector of 10-30 parameters. The goal is to find a vector that minimizes an objective function while meeting a series of constraints. VizCraft integrates the simulation code that evaluates the design with visualizations for analyzing the design individually or in contrast to other designs. VizCraft allows the designer to easily switch between the view of a design in the form of a parameter set, and a visualization of the corresponding aircraft. The user can easily see which, if any, constraints are violated. VizCraft also allows the user to view a database of designs using parallel coordinates.",Amit Goel;Chuck Baker;Clifford A. Shaffer;Bernard Grossman;Raphael T. Haftka;William H. Mason;Layne T. Watson,A. Goel;C. Baker;C.A. Shaffer;B. Grossman;R.T. Haftka;W.H. Mason;L.T. Watson,"Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA",10.1109/VISUAL.1995.485139;10.1109/VISUAL.1998.745351;10.1109/INFVIS.1997.636793;10.1109/INFVIS.1998.729559;10.1109/VISUAL.1996.567800,,10,4,8,
Vis,2000,Creating reusable visualizations with the relational visualization notation,10.1109/VISUAL.2000.885676,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2000.885676,53,60,C,"Richly expressive information visualizations are difficult to design and rarely found. Few software tools can generate multidimensional visualizations at all, let alone incorporate artistic detail. Although, it is a great efficiency to reuse these visualizations with new data, the associated artistic detail is rarely reusable. The Relational Visualization Notation is a new technique and toolkit for specifying highly expressive graphical representations of data without traditional programming. We seek to discover the accessible power of this notation, both its graphical expressiveness and its ease of re-use. Towards this end we have used the system to reconstruct Minard's visualization of Napoleon's Russian campaign of 1812. The resulting image is strikingly similar to the original, and the design is straightforward to construct. Furthermore, the design permitted by the notation can be directly reused to visualize Hitler's WWII defeat before Moscow. This experience leads us to believe that artistically expressive visualizations can be made to be reusable.",Matthew C. Humphrey,M.C. Humphrey,"11 Wild Plum Court, Stafford, CA, USA",,"information visualization, graphic design, visual design",10,3,0,
Vis,2000,Basic research for coloring multichannel MRI data,10.1109/VISUAL.2000.885693,http://dx.doi.org/10.1109/VISUAL.2000.885693,187,194,C,"This is basic research for assigning color values to voxels of multichannel MRI volume data. The MRI volume data sets obtained under different scanning conditions are transformed into their components by independent component analysis (ICA), which enhances the physical characteristics of the tissue. The transfer functions for generating color values from independent components are obtained using a radial basis function network, a kind of neural net, by training the network with sample data chosen from the Visible Female data set. The resultant color volume data sets correspond well with the full-color cross-sections of the Visible Human data sets.",Shigeru Muraki;Toshiharu Nakai;Yasuyo Kita,S. Muraki;T. Nakai;Y. Kita,"MITI, Electrotech. Lab., Ibaraki, Japan",10.1109/VISUAL.1996.568113,"color MRI, independent component analysis, transfer function",10,2,26,
Vis,2000,Interactive visualization of particle-in-cell simulations,10.1109/VISUAL.2000.885734,http://dx.doi.org/10.1109/VISUAL.2000.885734,469,472,C,"The authors present a visualization system for interactive real time animation and visualization of simulation results from a parallel Particle-in-Cell code. The system was designed and implemented for the Onyx2 Infinite Reality hardware. A number of different visual objects, such as volume rendered particle density functionals were implemented. To provide sufficient frame rates for interactive visualization, the system was designed to provide performance close to the hardware specifications both in terms of the I/O and graphics subsystems. The presented case study applies the developed system to the evolution of an instability that gives rise to a plasma surfatron, a mechanism which rapidly can accelerate particles to very high velocities and thus be of great importance in the context of electron acceleration in astrophysical shocks, in the solar corona and in particle accelerators. The produced visualizations have allowed us to identify a previously unknown saturation mechanism for the surfatron and direct research efforts into new areas of interest.",Patric Ljung;Mark Dieckmann;Niclas Andersson;Anders Ynnerman,P. Ljung;M. Dieckmann;N. Andersson;A. Ynnerman,"Dept. of Sci. & Technol., Linkopings Univ., Sweden",,"scientific visualization, interaction animation, volume rendering, texture maps, data streaming, plasma physics",10,5,16,
Vis,2001,Undersampling and oversampling in sample based shape modeling,10.1109/VISUAL.2001.964497,http://dx.doi.org/10.1109/VISUAL.2001.964497,83,90,C,"Shape modeling is an integral part of many visualization problems. Recent advances in scanning technology and a number of surface reconstruction algorithms have opened up a new paradigm for modeling shapes from samples. Many of the problems currently faced in this modeling paradigm can be traced back to two anomalies in sampling, namely undersampling and oversampling. Boundaries, non-smoothness and small features create undersampling problems, whereas oversampling leads to too many triangles. We use Voronoi cell geometry as a unified guide to detect undersampling and oversampling. We apply these detections in surface reconstruction and model simplification. Guarantees of the algorithms can be proved. The authors show the success of the algorithms empirically on a number of interesting data sets.",Tamal K. Dey;Joachim Giesen;Samrat Goswami;James Hudson;Rephael Wenger;Wulue Zhao,T.K. Dey;J. Giesen;S. Goswami;J. Hudson;R. Wenger;Wulue Zhao,"Ohio State Univ., Columbus, OH, USA;Ohio State Univ., Columbus, OH, USA;Ohio State Univ., Columbus, OH, USA;Ohio State Univ., Columbus, OH, USA;Ohio State Univ., Columbus, OH, USA;Ohio State Univ., Columbus, OH, USA",10.1109/VISUAL.1997.663909;10.1109/VISUAL.2000.885718,"Computational Geometry, Surface Reconstruction, Geometric Modeling, Mesh Generation, Polygonal Mesh Reduction, Polygonal Modeling, Shape Recognition",10,6,35,
InfoVis,2002,Building a visual database for example-based graphics generation,10.1109/INFVIS.2002.1173143,http://dx.doi.org/10.1109/INFVIS.2002.1173143,23,30,C,"Example-based graphics generation systems automatically create new information visualizations by learning from existing graphic examples. As part of the effort on developing a general-purpose example-based generation system, we are building a visual database of graphic examples. In this paper, we address two main issues involved in constructing such a database: example selection and example modeling. As a result, our work offers three unique contributions: First, we build a visual database that contains a diverse collection of well-designed examples. Second, we develop a feature-based scheme to model all examples uniformly and accurately. Third, our visual database brings several important implications to the area of information visualization.",Michelle X. Zhou;Min Chen;Ying Feng,M.X. Zhou;Min Chen;Ying Feng,"IBM Thomas J. Watson Res. Center, Hawthorne, NY, USA;IBM Thomas J. Watson Res. Center, Hawthorne, NY, USA",10.1109/INFVIS.1996.559211,,10,5,23,
Vis,2004,DTI Fiber Clustering in the Whole Brain,10.1109/VISUAL.2004.26,http://dx.doi.org/10.1109/VISUAL.2004.26,28,28,M,,Song Zhang 0004;David H. Laidlaw,Song Zhang;D.H. Laidlaw,Brown University,,,10,4,4,
Vis,2004,Rendering planar cuts through quadratic and cubic finite elements,10.1109/VISUAL.2004.91,http://dx.doi.org/10.1109/VISUAL.2004.91,409,416,C,"Coloring higher order scientific data is problematic using standard linear methods as found in OpenGL. The visual results are inaccurate when there is a large scalar gradient over an element or when the scalar field is nonlinear. In addition to shading nonlinear data, last and accurate rendering of planar cuts through parametric elements can be implemented using programmable shaders on current graphics hardware. The intersection of a planar cut with geometrically curved volume elements can be rendered using a combination of selective refinement and programmable shaders. This hybrid algorithm also handles curved 2D planar triangles.",Michael Brasher;Robert Haimes,M. Brasher;R. Haimes,"Aerosp. Computational Design Lab., MIT, MA, USA;Aerosp. Computational Design Lab., MIT, MA, USA",,"Higher Order Elements, Programmable Shaders, Cut-planes",10,8,13,
InfoVis,2005,PRISAD: a partitioned rendering infrastructure for scalable accordion drawing,10.1109/INFVIS.2005.1532127,http://dx.doi.org/10.1109/INFVIS.2005.1532127,41,48,C,"We present PRISAD, the first generic rendering infrastructure for information visualization applications that use the accordion drawing technique: rubber sheet navigation with guaranteed visibility for marked areas of interest. Our new rendering algorithms are based on the partitioning of screen space, which allows us to handle dense dataset regions correctly. The algorithms in previous work led to incorrect visual representations because of overculling, and to inefficiencies due to overdrawing multiple items in the same region. Our pixel based drawing infrastructure guarantees correctness by eliminating overculling, and improves rendering performance with tight bounds on overdrawing. PRITree and PRISeq are applications built on PRISAD, with the feature sets of TreeJuxtaposer and SequenceJuxtaposer, respectively. We describe our PRITree and PRISeq dataset traversal algorithms, which are used for efficient rendering, culling, and layout of datasets within the PRISAD framework. We also discuss PRITree node marking techniques, which offer order-of-magnitude improvements to both memory and time performance versus previous range storage and retrieval techniques. Our PRITree implementation features a five fold increase in rendering speed for nontrivial tree structures, and also reduces memory requirements in some real world datasets by up to eight times, so we are able to handle trees of several million nodes. PRISeq renders fifteen times faster and handles datasets twenty times larger than previous work.",James Slack;Kristian Hildebrand;Tamara Munzner,J. Slack;K. Hildebrand;T. Munzner,"British Columbia Univ., Vancouver, BC, Canada",10.1109/INFVIS.2002.1173156;10.1109/INFVIS.2004.64,"Focus+Context, Information Visualization, Real Time Rendering, Progressive Rendering",10,2,14,
InfoVis,2005,An optimization-based approach to dynamic visual context management,10.1109/INFVIS.2005.1532146,http://dx.doi.org/10.1109/INFVIS.2005.1532146,187,194,C,"We are building an intelligent multimodal conversation system to aid users in exploring large and complex data sets. To tailor to diverse user queries introduced during a conversation, we automate the generation of system responses, including both spoken and visual outputs. In this paper, we focus on the problem of visual context management, a process that dynamically updates an existing visual display to effectively incorporate new information requested by subsequent user queries. Specifically, we develop an optimization based approach to visual context management. Compared to existing approaches, which normally handle predictable visual context updates, our work offers two unique contributions. First, we provide a general computational framework that can effectively manage a visual context for diverse, unanticipated situations encountered in a user system conversation. Moreover, we optimize the satisfaction of both semantic and visual constraints, which otherwise are difficult to balance using simple heuristics. Second, we present an extensible representation model that uses feature based metrics to uniformly define all constraints. We have applied our work to two different applications and our evaluation has shown the promise of this work.",Zhen Wen;Michelle X. Zhou;Vikram Aggarwal,Zhen Wen;M.X. Zhou;V. Aggarwal,"IBM T. J. Watson Res. Center, Hawthorne, NY, USA;IBM T. J. Watson Res. Center, Hawthorne, NY, USA;IBM T. J. Watson Res. Center, Hawthorne, NY, USA",10.1109/INFVIS.2000.885091;10.1109/INFVIS.2000.885093;10.1109/INFVIS.1997.636718,"intelligent multimodal interfaces, visual context management, automated generation of visualization, visual momentum",10,1,21,
Vis,2006,Interactive Visualization of Intercluster Galaxy Structures in the Horologium-Reticulum Supercluster,10.1109/TVCG.2006.155,http://dx.doi.org/10.1109/TVCG.2006.155,1149,1156,J,"We present GyVe, an interactive visualization tool for understanding structure in sparse three-dimensional (3D) point data. The scientific goal driving the tool's development is to determine the presence of filaments and voids as defined by inferred 3D galaxy positions within the horologium-reticulum supercluster (HRS). GyVe provides visualization techniques tailored to examine structures defined by the intercluster galaxies. Specific techniques include: interactive user control to move between a global overview and local viewpoints, labelled axes and curved drop lines to indicate positions in the astronomical RA-DEC-cz coordinate system, torsional rocking and stereo to enhance 3D perception, and geometrically distinct glyphs to show potential correlation between intercluster galaxies and known clusters. We discuss the rationale for each design decision and review the success of the techniques in accomplishing the scientific goals. In practice, GyVe has been useful for gaining intuition about structures that were difficult to perceive with 2D projection techniques alone. For example, during their initial session with GyVe, our collaborators quickly confirmed scientific conclusions regarding the large-scale structure of the HRS previously obtained over months of study with 2D projections and statistical techniques. Further use of GyVe revealed the spherical shape of voids and showed that a presumed filament was actually two disconnected structures",Jameson Miller;Cory Quammen;Matthew Fleenor,Jameson Miller;Cory Quammen;Matthew Fleenor,,10.1109/VISUAL.1992.235181;10.1109/VISUAL.2002.1183824;10.1109/VISUAL.2003.1250404,"Sparse point visualization, astronomy, cosmology",10,9,24,
Vis,2006,Visualization and Analysis of Large Data Collections: a Case Study Applied to Confocal Microscopy Data,10.1109/TVCG.2006.195,http://dx.doi.org/10.1109/TVCG.2006.195,1251,1258,J,"In this paper we propose an approach in which interactive visualization and analysis are combined with batch tools for the processing of large data collections. Large and heterogeneous data collections are difficult to analyze and pose specific problems to interactive visualization. Application of the traditional interactive processing and visualization approaches as well as batch processing encounter considerable drawbacks for such large and heterogeneous data collections due to the amount and type of data. Computing resources are not sufficient for interactive exploration of the data and automated analysis has the disadvantage that the user has only limited control and feedback on the analysis process. In our approach, an analysis procedure with features and attributes of interest for the analysis is defined interactively. This procedure is used for offline processing of large collections of data sets. The results of the batch process along with ""visual summaries"" are used for further analysis. Visualization is not only used for the presentation of the result, but also as a tool to monitor the validity and quality of the operations performed during the batch process. Operations such as feature extraction and attribute calculation of the collected data sets are validated by visual inspection. This approach is illustrated by an extensive case study, in which a collection of confocal microscopy data sets is analyzed",Wim C. de Leeuw;Pernette J. Verschure;Robert van Liere,Wim De Leeuw;Pernette Verschure;Robert Van Liere,Swammerdam Institute for Life Sciences (SILS);Swammerdam Institute for Life Sciences (SILS);Center for Mathematics and Computer Science (CWI),10.1109/VISUAL.1998.745319;10.1109/VISUAL.1990.146378;10.1109/VISUAL.2000.885735;10.1109/VISUAL.2000.885678;10.1109/VISUAL.2005.1532788;10.1109/VISUAL.1996.568136,"Biomedical visualization, features in volume data sets, large data set visualization",10,8,30,
VAST,2007,Visual Analytics with Jigsaw,10.1109/VAST.2007.4389017,http://dx.doi.org/10.1109/VAST.2007.4389017,201,202,M,This article briefly introduces the Jigsaw system and describes how we used it in analysis activities for the VAST '07 Contest. Jigsaw is a visual analytic system that provides multiple coordinated views to show connections between entities that are extracted from a collection of documents.,Carsten Görg;Zhicheng Liu;Neel Parekh;Kanupriya Singhal;John T. Stasko,Carsten Gorg;Zhicheng Liu;Neel Parekh;Kanupriya Singhal;John Stasko,"School of Interactive Computing & GVU Center, Georgia Institute of Technology. e-mail: goerg@cc.gatech.edu;School of Interactive Computing & GVU Center, Georgia Institute of Technology. e-mail: zcliu@cc.gatech.edu;School of Interactive Computing & GVU Center, Georgia Institute of Technology. e-mail: justneel@gmail.com;School of Interactive Computing & GVU Center, Georgia Institute of Technology. e-mail: ksinghal@cc.gatech.edu;School of Interactive Computing & GVU Center, Georgia Institute of Technology. e-mail: stasko@cc.gatech.edu",,,10,2,3,
VAST,2008,Evacuation Traces Mini Challenge award: Innovative trace visualization staining for information discovery,10.1109/VAST.2008.4677395,http://dx.doi.org/10.1109/VAST.2008.4677395,,,M,"Staining is a technique for categorizing time-varying spatial data; that is, data of things moving through space over time. In Staining, a stain is applied in either time or space, and the objects which move through the stain become marked. This technique and a research prototype demonstrating the technique were developed in response to the VAST 2008 Contest Mini-challenge: Evacuation Traces.",Dennis J. Bouvier;Britian Oates,Dennis J. Bouvier;Britain Oates,"Southern Illinois University Edwardsville, USA;Southern Illinois University Edwardsville, USA",,,10,5,1,
Vis,2008,Edge Groups: An Approach to Understanding the Mesh Quality of Marching Methods,10.1109/TVCG.2008.122,http://dx.doi.org/10.1109/TVCG.2008.122,1651,1666,J,"Marching cubes is the most popular isosurface extraction algorithm due to its simplicity, efficiency and robustness. It has been widely studied, improved, and extended. While much early work was concerned with efficiency and correctness issues, lately there has been a push to improve the quality of marching cubes meshes so that they can be used in computational codes. In this work we present a new classification of MC cases that we call edge groups, which helps elucidate the issues that impact the triangle quality of the meshes that the method generates. This formulation allows a more systematic way to bound the triangle quality, and is general enough to extend to other polyhedral cell shapes used in other polygonization algorithms. Using this analysis, we also discuss ways to improve the quality of the resulting triangle mesh, including some that require only minor modifications of the original algorithm.",Carlos A. Dietrich;Carlos Scheidegger;João Luiz Dihl Comba;Luciana Porcher Nedel;Cláudio T. Silva,carlos dietrich;Carlos Scheidegger;João Comba;Luciana Nedel;Cláudio Silva,Universidade Federal do Rio Grande do Sul;University of Utah;Universidade Federal do Rio Grande do Sul;Universidade Federal do Rio Grande do Sul;University of Utah,10.1109/TVCG.2006.168;10.1109/VISUAL.2000.885704;10.1109/VISUAL.1994.346308;10.1109/VISUAL.2004.28;10.1109/VISUAL.2003.1250355;10.1109/TVCG.2006.149;10.1109/VISUAL.2002.1183808;10.1109/TVCG.2007.70604,"Isosurface extraction, Marching Cubes",10,10,35,
VAST,2009,A visual analytics system for radio frequency fingerprinting-based localization,10.1109/VAST.2009.5332596,http://dx.doi.org/10.1109/VAST.2009.5332596,35,42,C,"Radio frequency (RF) fingerprinting-based techniques for localization are a promising approach for ubiquitous positioning systems, particularly indoors. By finding unique fingerprints of RF signals received at different locations within a predefined area beforehand, whenever a similar fingerprint is subsequently seen again, the localization system will be able to infer a user's current location. However, developers of these systems face the problem of finding reliable RF fingerprints that are unique enough and adequately stable over time. We present a visual analytics system that enables developers of these localization systems to visually gain insight on whether their collected datasets and chosen fingerprint features have the necessary properties to enable a reliable RF fingerprinting-based localization system. The system was evaluated by testing and debugging an existing localization system.",Yi Han 0005;Erich P. Stuntebeck;John T. Stasko;Gregory D. Abowd,Yi Han;Erich P. Stuntebeck;John T. Stasko;Gregory D. Abowd,"School of Interactive Computing & GVU Center, Georgia Institute of Technology, USA;School of Interactive Computing & GVU Center, Georgia Institute of Technology, USA;School of Interactive Computing & GVU Center, Georgia Institute of Technology, USA;School of Interactive Computing & GVU Center, Georgia Institute of Technology, USA",10.1109/INFVIS.1997.636793,,10,6,15,
Vis,2009,Isosurface Extraction and View-Dependent filtering from Time-Varying fields Using Persistent Time-Octree (PTOT),10.1109/TVCG.2009.160,http://dx.doi.org/10.1109/TVCG.2009.160,1367,1374,J,"We develop a new algorithm for isosurface extraction and view-dependent filtering from large time-varying fields, by using a novel persistent time-octree (PTOT) indexing structure. Previously, the persistent octree (POT) was proposed to perform isosurface extraction and view-dependent filtering, which combines the advantages of the interval tree (for optimal searches of active cells) and of the branch-on-need octree (BONO, for view-dependent filtering), but it only works for steady-state(i.e., single time step) data. For time-varying fields, a 4D version of POT, 4D-POT, was proposed for 4D isocontour slicing, where slicing on the time domain gives all active cells in the queried timestep and isovalue. However, such slicing is not output sensitive and thus the searching is sub-optimal. Moreover, it was not known how to support view-dependent filtering in addition to time-domain slicing.In this paper, we develop a novel persistent time-octree (PTOT) indexing structure, which has the advantages of POT and performs 4D isocontour slicing on the time domain with an output-sensitive and optimal searching. In addition, when we query the same iso value q over m consecutive time steps, there is no additional searching overhead (except for reporting the additional active cells) compared to querying just the first time step. Such searching performance for finding active cells is asymptotically optimal, with asymptotically optimal space and preprocessing time as well. Moreover, our PTOT supports view-dependent filtering in addition to time-domain slicing. We propose a simple and effective out-of-core scheme, where we integrate our PTOT with implicit occluders, batched occlusion queries and batched CUDA computing tasks, so that we can greatly reduce the I/O cost as well as increase the amount of data being concurrently computed in GPU.This results in an efficient algorithm for isosurface extraction with view-dependent filtering utilizing a state-of-the-art programmable GPU for time-varying fields larger than main memory. Our experiments on datasets as large as 192 GB (with 4 GB per time step) having no more than 870 MB of memory footprint in both preprocessing and run-time phases demonstrate the efficacy of our new technique.",Cong Wang;Yi-Jen Chiang,Cong Wang;Yi-Jen Chiang,Polytechnic Institute of New York University;Polytechnic Institute of New York University,10.1109/VISUAL.2003.1250375;10.1109/VISUAL.1998.745299;10.1109/VISUAL.1997.663895;10.1109/VISUAL.1998.745300;10.1109/VISUAL.2003.1250373,"Isosurface extraction, time-varying fields, persistent data structure, view-dependent filtering, out-of-core methods",10,8,30,
Vis,2010,Gradient Estimation Revitalized,10.1109/TVCG.2010.160,http://dx.doi.org/10.1109/TVCG.2010.160,1495,1504,J,"We investigate the use of a Fourier-domain derivative error kernel to quantify the error incurred while estimating the gradient of a function from scalar point samples on a regular lattice. We use the error kernel to show that gradient reconstruction quality is significantly enhanced merely by shifting the reconstruction kernel to the centers of the principal lattice directions. Additionally, we exploit the algebraic similarities between the scalar and derivative error kernels to design asymptotically optimal gradient estimation filters that can be factored into an infinite impulse response interpolation prefilter and a finite impulse response directional derivative filter. This leads to a significant performance gain both in terms of accuracy and computational efficiency. The interpolation prefilter provides an accurate scalar approximation and can be re-used to cheaply compute directional derivatives on-the-fly without the need to store gradients. We demonstrate the impact of our filters in the context of volume rendering of scalar data sampled on the Cartesian and Body-Centered Cubic lattices. Our results rival those obtained from other competitive gradient estimation methods while incurring no additional computational or storage overhead.",Usman R. Alim;Torsten Möller;Laurent Condat,Usman Alim;Torsten Moller;Laurent Condat,"Simon Fraser University,Burnaby, BC, Canada;Simon Fraser University, Burnaby, BC, Canada;GREYC, A joint CNRS-UCBN-ENSICAEN Research Unit, Cedex,France",10.1109/VISUAL.2001.964498;10.1109/VISUAL.1994.346331;10.1109/VISUAL.1997.663848;10.1109/VISUAL.2004.65,"Derivative, Gradient, Reconstruction, Sampling, Lattice, Interpolation, Approximation, Frequency Error Kernel",10,7,37,
Vis,2010,Pre-Integrated Volume Rendering with Non-Linear Gradient Interpolation,10.1109/TVCG.2010.187,http://dx.doi.org/10.1109/TVCG.2010.187,1487,1494,J,"Shading is an important feature for the comprehension of volume datasets, but is difficult to implement accurately. Current techniques based on pre-integrated direct volume rendering approximate the volume rendering integral by ignoring non-linear gradient variations between front and back samples, which might result in cumulated shading errors when gradient variations are important and / or when the illumination function features high frequencies. In this paper, we explore a simple approach for pre-integrated volume rendering with non-linear gradient interpolation between front and back samples. We consider that the gradient smoothly varies along a quadratic curve instead of a segment in-between consecutive samples. This not only allows us to compute more accurate shaded pre-integrated look-up tables, but also allows us to more efficiently process shading amplifying effects, based on gradient filtering. An interesting property is that the pre-integration tables we use remain two-dimensional as for usual pre-integrated classification. We conduct experiments using a full hardware approach with the Blinn-Phong illumination model as well as with a non-photorealistic illumination model.",Amel Guetat;Alexandre Ancel;Stéphane Marchesin;Jean-Michel Dischler,Amel Guetat;Alexandre Ancel;Stephane Marchesin;Jean-Michel Dischler,University of Strasbourg;University of Strasbourg;UC Davis;University of Strasbourg,10.1109/VISUAL.2000.885683;10.1109/VISUAL.2000.885694;10.1109/VISUAL.1990.146391;10.1109/TVCG.2009.149,"Ray casting, pre-integration, Phong shading, volume rendering",10,8,21,
Vis,2010,Projector Placement Planning for High Quality Visualizations on Real-World Colored Objects,10.1109/TVCG.2010.189,http://dx.doi.org/10.1109/TVCG.2010.189,1633,1641,J,"Many visualization applications benefit from displaying content on real-world objects rather than on a traditional display (e.g., a monitor). This type of visualization display is achieved by projecting precisely controlled illumination from multiple projectors onto the real-world colored objects. For such a task, the placement of the projectors is critical in assuring that the desired visualization is possible. Using ad hoc projector placement may cause some appearances to suffer from color shifting due to insufficient projector light radiance being exposed onto the physical surface. This leads to an incorrect appearance and ultimately to a false and potentially misleading visualization. In this paper, we present a framework to discover the optimal position and orientation of the projectors for such projection-based visualization displays. An optimal projector placement should be able to achieve the desired visualization with minimal projector light radiance. When determining optimal projector placement, object visibility, surface reflectance properties, and projector-surface distance and orientation need to be considered. We first formalize a theory for appearance editing image formation and construct a constrained linear system of equations that express when a desired novel appearance or visualization is possible given a geometric and surface reflectance model of the physical surface. Then, we show how to apply this constrained system in an adaptive search to efficiently discover the optimal projector placement which achieves the desired appearance. Constraints can be imposed on the maximum radiance allowed by the projectors and the projectors' placement to support specific goals of various visualization applications. We perform several real-world and simulated appearance edits and visualizations to demonstrate the improvement obtained by our discovered projector placement over ad hoc projector placement.",Alvin J. Law;Daniel G. Aliaga;Aditi Majumder,Alvin J. Law;Daniel G. Aliaga;Aditi Majumder,,10.1109/TVCG.2009.124;10.1109/VISUAL.2002.1183793;10.1109/TVCG.2006.121;10.1109/TVCG.2007.70586;10.1109/VISUAL.2000.885684,"Large and High-resolution Displays, Interaction Design, Mobile and Ubiquitous Visualization ",10,8,34,
Vis,2011,"Interactive, Graph-based Visual Analysis of High-dimensional, Multi-parameter Fluorescence Microscopy Data in Toponomics",10.1109/TVCG.2011.217,http://dx.doi.org/10.1109/TVCG.2011.217,1882,1891,J,"In Toponomics, the function protein pattern in cells or tissue (the toponome) is imaged and analyzed for applications in toxicology, new drug development and patient-drug-interaction. The most advanced imaging technique is robot-driven multi-parameter fluorescence microscopy. This technique is capable of co-mapping hundreds of proteins and their distribution and assembly in protein clusters across a cell or tissue sample by running cycles of fluorescence tagging with monoclonal antibodies or other affinity reagents, imaging, and bleaching in situ. The imaging results in complex multi-parameter data composed of one slice or a 3D volume per affinity reagent. Biologists are particularly interested in the localization of co-occurring proteins, the frequency of co-occurrence and the distribution of co-occurring proteins across the cell. We present an interactive visual analysis approach for the evaluation of multi-parameter fluorescence microscopy data in toponomics. Multiple, linked views facilitate the definition of features by brushing multiple dimensions. The feature specification result is linked to all views establishing a focus+context visualization in 3D. In a new attribute view, we integrate techniques from graph visualization. Each node in the graph represents an affinity reagent while each edge represents two co-occurring affinity reagent bindings. The graph visualization is enhanced by glyphs which encode specific properties of the binding. The graph view is equipped with brushing facilities. By brushing in the spatial and attribute domain, the biologist achieves a better understanding of the function protein patterns of a cell. Furthermore, an interactive table view is integrated which summarizes unique fluorescence patterns. We discuss our approach with respect to a cell probe containing lymphocytes and a prostate tissue section.",Steffen Oeltze-Jafra;Wolfgang Freiler;Reyk Hillert;Helmut Doleisch;Bernhard Preim;Walter Schubert,Steffen Oeltze;Wolfgang Freiler;Reyk Hillert;Helmut Doleisch;Bernhard Preim;Walter Schubert,"Universit&#x0E4;t Magdeburg;SimVis GmbH, Vienna;University of Magdeburg;SimVis GmbH, Vienna;University of Magdeburg;University of Magdeburg",10.1109/VAST.2009.5333911;10.1109/TVCG.2006.195;10.1109/TVCG.2006.147;10.1109/TVCG.2007.70569;10.1109/TVCG.2009.167,"Visual Analytics, Fluorescence Microscopy, Toponomics, Protein Interaction, Graph Visualization",10,10,38,
Vis,2011,Visualization of AMR Data With Multi-Level Dual-Mesh Interpolation,10.1109/TVCG.2011.252,http://dx.doi.org/10.1109/TVCG.2011.252,1862,1871,J,"We present a new technique for providing interpolation within cell-centered Adaptive Mesh Refinement (AMR) data that achieves C&lt;sup&gt;0&lt;/sup&gt; continuity throughout the 3D domain. Our technique improves on earlier work in that it does not require that adjacent patches differ by at most one refinement level. Our approach takes the dual of each mesh patch and generates ""stitching cells"" on the fly to fill the gaps between dual meshes. We demonstrate applications of our technique with data from Enzo, an AMR cosmological structure formation simulation code. We show ray-cast visualizations that include contributions from particle data (dark matter and stars, also output by Enzo) and gridded hydrodynamic data. We also show results from isosurface studies, including surfaces in regions where adjacent patches differ by more than one refinement level.",Patrick J. Moran;David Ellsworth,Patrick Moran;David Ellsworth,"NASA Ames Research Center;Computer Sciences Corporation, NASA Ames Research Center",10.1109/VISUAL.1991.175782;10.1109/TVCG.2009.149;10.1109/VISUAL.2002.1183820,"Adaptive mesh refinement, AMR, Enzo, interpolation, ray casting, isosurfaces, dual meshes, stitching cells",10,7,22,
InfoVis,2012,Visualizing Student Histories Using Clustering and Composition,10.1109/TVCG.2012.288,http://dx.doi.org/10.1109/TVCG.2012.288,2809,2818,J,"While intuitive time-series visualizations exist for common datasets, student course history data is difficult to represent using traditional visualization techniques due its concurrent nature. A visual composition process is developed and applied to reveal trends across various groupings. By working closely with educators, analytic strategies and techniques are developed to leverage the visualization composition to reveal unknown trends in the data. Furthermore, clustering algorithms are developed to group common course-grade histories for further analysis. Lastly, variations of the composition process are implemented to reveal subtle differences in the underlying data. These analytic tools and techniques enabled educators to confirm expected trends and to discover new ones.",David Trimm;Penny Rheingans;Marie desJardins,David Trimm;Penny Rheingans;Marie desJardins,"The University of Maryland, Baltimore County;The University of Maryland, Baltimore County;The University of Maryland, Baltimore County",10.1109/INFVIS.2005.1532140;10.1109/TVCG.2007.70623;10.1109/TVCG.2009.131,"Clustering, aggregate visualization, student performance analysis, visualization composition",10,10,17,
SciVis,2013,GRACE: A Visual Comparison Framework for Integrated Spatial and Non-Spatial Geriatric Data,10.1109/TVCG.2013.161,http://dx.doi.org/10.1109/TVCG.2013.161,2916,2925,J,"We present the design of a novel framework for the visual integration, comparison, and exploration of correlations in spatial and non-spatial geriatric research data. These data are in general high-dimensional and span both the spatial, volumetric domain - through magnetic resonance imaging volumes - and the non-spatial domain, through variables such as age, gender, or walking speed. The visual analysis framework blends medical imaging, mathematical analysis and interactive visualization techniques, and includes the adaptation of Sparse Partial Least Squares and iterated Tikhonov Regularization algorithms to quantify potential neurologymobility connections. A linked-view design geared specifically at interactive visual comparison integrates spatial and abstract visual representations to enable the users to effectively generate and refine hypotheses in a large, multidimensional, and fragmented space. In addition to the domain analysis and design description, we demonstrate the usefulness of this approach on two case studies. Last, we report the lessons learned through the iterative design and evaluation of our approach, in particular those relevant to the design of comparative visualization of spatial and non-spatial data.",Adrian Maries;Nathan Mays;MeganOlson Hunt;Kim F. Wong;William J. Layton;Robert Boudreau;Caterina Rosano;G. Elisabeta Marai,Adrian Maries;Nathan Mays;MeganOlson Hunt;Kim F. Wong;William Layton;Robert Boudreau;Caterina Rosano;G. Elisabeta Marai,University of Pittsburgh;Wheeling Jesuit University;University of Pittsburgh;University of Pittsburgh;University of Pittsburgh;University of Pittsburgh;University of Pittsburgh;University of Pittsburgh,10.1109/TVCG.2009.141;10.1109/VISUAL.2000.885739;10.1109/VAST.2006.261438;10.1109/TVCG.2009.111;10.1109/TVCG.2010.137;10.1109/TVCG.2009.114;10.1109/VISUAL.1991.175815;10.1109/TVCG.2010.162,"Design studies, methodology design, task and requirements analysis, integrating spatial and non-spatial data visualization, visual comparison, high-dimensional data, applications of visualization",10,12,49,
VAST,2013,Vis4Heritage: Visual Analytics Approach on Grotto Wall Painting Degradations,10.1109/TVCG.2013.219,http://dx.doi.org/10.1109/TVCG.2013.219,1982,1991,J,"For preserving the grotto wall paintings and protecting these historic cultural icons from the damage and deterioration in nature environment, a visual analytics framework and a set of tools are proposed for the discovery of degradation patterns. In comparison with the traditional analysis methods that used restricted scales, our method provides users with multi-scale analytic support to study the problems on site, cave, wall and particular degradation area scales, through the application of multidimensional visualization techniques. Several case studies have been carried out using real-world wall painting data collected from a renowned World Heritage site, to verify the usability and effectiveness of the proposed method. User studies and expert reviews were also conducted through by domain experts ranging from scientists such as microenvironment researchers, archivists, geologists, chemists, to practitioners such as conservators, restorers and curators.",Jiawan Zhang;Kai Kang;Dajian Liu;Ye Yuan;E. Yanli,Jiawan Zhang;Kai Kang;Dajian Liu;Ye Yuan;Yanli E.,"School of Computer Software and Information Technology Research Center for Cultural Heritage Conservation and Promotion, Tianjin University;School of Computer Software, Tianjin University;School of Computer Software, Tianjin University;School of Computer Software, Tianjin University;School of Computer Software, Tianjin University",10.1109/TVCG.2011.239;10.1109/INFVIS.2004.1;10.1109/TVCG.2008.173;10.1109/INFVIS.2005.1532138;10.1109/TVCG.2006.147;10.1109/TVCG.2012.244;10.1109/VAST.2007.4389013;10.1109/TVCG.2008.153;10.1109/INFVIS.2000.885098,"Cultural heritage, wall paintings, degradation, visual analytics",10,7,46,
InfoVis,2014,MovExp: A Versatile Visualization Tool for Human-Computer Interaction Studies with 3D Performance and Biomechanical Data,10.1109/TVCG.2014.2346311,http://dx.doi.org/10.1109/TVCG.2014.2346311,2359,2368,J,"In Human-Computer Interaction (HCI), experts seek to evaluate and compare the performance and ergonomics of user interfaces. Recently, a novel cost-efficient method for estimating physical ergonomics and performance has been introduced to HCI. It is based on optical motion capture and biomechanical simulation. It provides a rich source for analyzing human movements summarized in a multidimensional data set. Existing visualization tools do not sufficiently support the HCI experts in analyzing this data. We identified two shortcomings. First, appropriate visual encodings are missing particularly for the biomechanical aspects of the data. Second, the physical setup of the user interface cannot be incorporated explicitly into existing tools. We present MovExp, a versatile visualization tool that supports the evaluation of user interfaces. In particular, it can be easily adapted by the HCI experts to include the physical setup that is being evaluated, and visualize the data on top of it. Furthermore, it provides a variety of visual encodings to communicate muscular loads, movement directions, and other specifics of HCI studies that employ motion capture and biomechanical simulation. In this design study, we follow a problem-driven research approach. Based on a formalization of the visualization needs and the data structure, we formulate technical requirements for the visualization tool and present novel solutions to the analysis needs of the HCI experts. We show the utility of our tool with four case studies from the daily work of our HCI experts.",Gregorio Palmas;Myroslav Bachynskyi;Antti Oulasvirta;Hans-Peter Seidel;Tino Weinkauf,Gregorio Palmas;Myroslav Bachynskyi;Antti Oulasvirta;Hans-Peter Seidel;Tina Weinkauf,Max Planck Institute for Informatics;Max Planck Institute for Informatics;Max Planck Institute for Informatics;Max Planck Institute for Informatics;Max Planck Institute for Informatics,10.1109/TVCG.2009.152;10.1109/TVCG.2012.213;10.1109/TVCG.2012.204;10.1109/INFVIS.2000.885086;10.1109/VISUAL.1994.346302;10.1109/INFVIS.2004.12,"Information visualization, Design study, Human-Computer Interaction",10,11,64,
SciVis,2014,Trajectory-Based Flow Feature Tracking in Joint Particle/Volume Datasets,10.1109/TVCG.2014.2346423,http://dx.doi.org/10.1109/TVCG.2014.2346423,2565,2574,J,"Studying the dynamic evolution of time-varying volumetric data is essential in countless scientific endeavors. The ability to isolate and track features of interest allows domain scientists to better manage large complex datasets both in terms of visual understanding and computational efficiency. This work presents a new trajectory-based feature tracking technique for use in joint particle/volume datasets. While traditional feature tracking approaches generally require a high temporal resolution, this method utilizes the indexed trajectories of corresponding Lagrangian particle data to efficiently track features over large jumps in time. Such a technique is especially useful for situations where the volume dataset is either temporally sparse or too large to efficiently track a feature through all intermediate timesteps. In addition, this paper presents a few other applications of this approach, such as the ability to efficiently track the internal properties of volumetric features using variables from the particle data. We demonstrate the effectiveness of this technique using real world combustion and atmospheric datasets and compare it to existing tracking methods to justify its advantages and accuracy.",Franz Sauer;Hongfeng Yu;Kwan-Liu Ma,Franz Sauer;Hongfeng Yu;Kwan-Liu Ma,"University of California, Davis;University of Nebraska, Lincoln;University of California, Davis",10.1109/VISUAL.1997.663930;10.1109/VISUAL.1996.567807;10.1109/TVCG.2007.70599;10.1109/VISUAL.2003.1250374;10.1109/VISUAL.1990.146391;10.1109/VISUAL.1998.745288,"Feature extraction and tracking, particle data, volume data, particle trajectories, flow visualization",10,15,26,
VAST,2014,An Insight- and Task-based Methodology for Evaluating Spatiotemporal Visual Analytics,10.1109/VAST.2014.7042482,http://dx.doi.org/10.1109/VAST.2014.7042482,63,72,C,"We present a method for evaluating visualizations using both tasks and exploration, and demonstrate this method in a study of spatiotemporal network designs for a visual analytics system. The method is well suited for studying visual analytics applications in which users perform both targeted data searches and analyses of broader patterns. In such applications, an effective visualization design is one that helps users complete tasks accurately and efficiently, and supports hypothesis generation during open-ended exploration. To evaluate both of these aims in a single study, we developed an approach called layered insight- and task-based evaluation (LITE) that interposes several prompts for observations about the data model between sequences of predefined search tasks. We demonstrate the evaluation method in a user study of four network visualizations for spatiotemporal data in a visual analytics application. Results include findings that might have been difficult to obtain in a single experiment using a different methodology. For example, with one dataset we studied, we found that on average participants were faster on search tasks using a force-directed layout than using our other designs; at the same time, participants found this design least helpful in understanding the data. Our contributions include a novel evaluation method that combines well-defined tasks with exploration and observation, an evaluation of network visualization designs for spatiotemporal visual analytics, and guidelines for using this evaluation method.",Steven R. Gomez;Hua Guo;Caroline Ziemkiewicz;David H. Laidlaw,Steven R. Gomez;Hua Guo;Caroline Ziemkiewicz;David H. Laidlaw,"Brown University;Brown University;Aptima, Inc;Brown University",10.1109/TVCG.2012.233;10.1109/TVCG.2007.70617;10.1109/TVCG.2013.124;10.1109/TVCG.2010.154;10.1109/TVCG.2013.126;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2009.128;10.1109/TVCG.2011.185;10.1109/TVCG.2010.163;10.1109/TVCG.2013.120,"Evaluation methodology, insight-based evaluation, visual analytics, network visualization, information visualization",10,11,31,
InfoVis,2015,Automatic Selection of Partitioning Variables for Small Multiple Displays,10.1109/TVCG.2015.2467323,http://dx.doi.org/10.1109/TVCG.2015.2467323,669,677,J,"Effective small multiple displays are created by partitioning a visualization on variables that reveal interesting conditional structure in the data. We propose a method that automatically ranks partitioning variables, allowing analysts to focus on the most promising small multiple displays. Our approach is based on a randomized, non-parametric permutation test, which allows us to handle a wide range of quality measures for visual patterns defined on many different visualization types, while discounting spurious patterns. We demonstrate the effectiveness of our approach on scatterplots of real-world, multidimensional datasets.",Anushka Anand;Justin Talbot,Anushka Anand;Justin Talbot,Tableau Research;Tableau Research,10.1109/VAST.2010.5652433;10.1109/INFVIS.1998.729559;10.1109/TVCG.2011.229;10.1109/TVCG.2006.161;10.1109/TVCG.2010.184;10.1109/TVCG.2009.153;10.1109/INFVIS.2003.1249006;10.1109/TVCG.2007.70594;10.1109/VAST.2006.261423;10.1109/INFVIS.2000.885086;10.1109/VAST.2009.5332628;10.1109/TVCG.2010.161;10.1109/INFVIS.2005.1532142,"Small multiple displays, Visualization selection, Multidimensional data",10,8,49,
InfoVis,2015,A Simple Approach for Boundary Improvement of Euler Diagrams,10.1109/TVCG.2015.2467992,http://dx.doi.org/10.1109/TVCG.2015.2467992,678,687,J,"General methods for drawing Euler diagrams tend to generate irregular polygons. Yet, empirical evidence indicates that smoother contours make these diagrams easier to read. In this paper, we present a simple method to smooth the boundaries of any Euler diagram drawing. When refining the diagram, the method must ensure that set elements remain inside their appropriate boundaries and that no region is removed or created in the diagram. Our approach uses a force system that improves the diagram while at the same time ensuring its topological structure does not change. We demonstrate the effectiveness of the approach through case studies and quantitative evaluations.",Paolo Simonetto;Daniel Archambault;Carlos Scheidegger,Paolo Simonetto;Daniel Archambault;Carlos Scheidegger,University of Arizona;University of Arizona;University of Arizona,10.1109/TVCG.2011.186;10.1109/TVCG.2013.184;10.1109/TVCG.2009.122;10.1109/TVCG.2014.2346248;10.1109/TVCG.2010.210,"Euler diagrams, Boundary Improvement, Force-Directed Approaches",10,9,35,
InfoVis,2015,Spatial Reasoning and Data Displays,10.1109/TVCG.2015.2469125,http://dx.doi.org/10.1109/TVCG.2015.2469125,459,468,J,"Graphics convey numerical information very efficiently, but rely on a different set of mental processes than tabular displays. Here, we present a study relating demographic characteristics and visual skills to perception of graphical lineups. We conclude that lineups are essentially a classification test in a visual domain, and that performance on the lineup protocol is associated with general aptitude, rather than specific tasks such as card rotation and spatial manipulation. We also examine the possibility that specific graphical tasks may be associated with certain visual skills and conclude that more research is necessary to understand which visual skills are required in order to understand certain plot types.",Susan VanderPlas;Heike Hofmann,Susan VanderPlas;Heike Hofmann,"Post Doc in the Department of Statistics, Iowa State University;Member of the faculty in the Human Computer Interaction program, Statistics at Iowa State University",10.1109/TVCG.2012.230;10.1109/TVCG.2014.2346320;10.1109/TVCG.2010.161,"Data visualization, Perception, Statistical graphics, Statistical computing",10,8,37,
SciVis,2015,JiTTree: A Just-in-Time Compiled Sparse GPU Volume Data Structure,10.1109/TVCG.2015.2467331,http://dx.doi.org/10.1109/TVCG.2015.2467331,1025,1034,J,"Sparse volume data structures enable the efficient representation of large but sparse volumes in GPU memory for computation and visualization. However, the choice of a specific data structure for a given data set depends on several factors, such as the memory budget, the sparsity of the data, and data access patterns. In general, there is no single optimal sparse data structure, but a set of several candidates with individual strengths and drawbacks. One solution to this problem are hybrid data structures which locally adapt themselves to the sparsity. However, they typically suffer from increased traversal overhead which limits their utility in many applications. This paper presents JiTTree, a novel sparse hybrid volume data structure that uses just-in-time compilation to overcome these problems. By combining multiple sparse data structures and reducing traversal overhead we leverage their individual advantages. We demonstrate that hybrid data structures adapt well to a large range of data sets. They are especially superior to other sparse data structures for data sets that locally vary in sparsity. Possible optimization criteria are memory, performance and a combination thereof. Through just-in-time (JIT) compilation, JiTTree reduces the traversal overhead of the resulting optimal data structure. As a result, our hybrid volume data structure enables efficient computations on the GPU, while being superior in terms of memory usage when compared to non-hybrid data structures.",Matthias Labschutz;Stefan Bruckner;M. Eduard Gröller;Markus Hadwiger;Peter Rautek,Matthias Labschütz;Stefan Bruckner;M. Eduard Gröller;Markus Hadwiger;Peter Rautek,KAUST;University of Bergen;TU Wien and VrVis Research Center;KAUST;KAUST,10.1109/TVCG.2012.240,"Data Transformation and Representation, GPUs and Multi-core Architectures, Volume Rendering",10,11,30,
SciVis,2015,AnimoAminoMiner: Exploration of Protein Tunnels and their Properties in Molecular Dynamics,10.1109/TVCG.2015.2467434,http://dx.doi.org/10.1109/TVCG.2015.2467434,747,756,J,"In this paper we propose a novel method for the interactive exploration of protein tunnels. The basic principle of our approach is that we entirely abstract from the 3D/4D space the simulated phenomenon is embedded in. A complex 3D structure and its curvature information is represented only by a straightened tunnel centerline and its width profile. This representation focuses on a key aspect of the studied geometry and frees up graphical estate to key chemical and physical properties represented by surrounding amino acids. The method shows the detailed tunnel profile and its temporal aggregation. The profile is interactively linked with a visual overview of all amino acids which are lining the tunnel over time. In this overview, each amino acid is represented by a set of colored lines depicting the spatial and temporal impact of the amino acid on the corresponding tunnel. This representation clearly shows the importance of amino acids with respect to selected criteria. It helps the biochemists to select the candidate amino acids for mutation which changes the protein function in a desired way. The AnimoAminoMiner was designed in close cooperation with domain experts. Its usefulness is documented by their feedback and a case study, which are included.",Jan Byska;Mathieu Le Muzic;M. Eduard Gröller;Ivan Viola;Barbora Kozlíková,Jan Byška;Mathieu Le Muzic;M. Eduard Gröller;Ivan Viola;Barbora Kozlíková,"Masaryk University, Czech Republic;TU Wien, Austria;TU Wien, Austria;TU Wien, Austria;Masaryk University, Czech Republic",10.1109/VISUAL.2002.1183754;10.1109/TVCG.2009.136;10.1109/TVCG.2011.259;10.1109/VISUAL.2001.964540,"Protein, tunnel, molecular dynamics, aggregation, interaction",10,14,25,
SciVis,2015,Rotation Invariant Vortices for Flow Visualization,10.1109/TVCG.2015.2467200,http://dx.doi.org/10.1109/TVCG.2015.2467200,817,826,J,"We propose a new class of vortex definitions for flows that are induced by rotating mechanical parts, such as stirring devices, helicopters, hydrocyclones, centrifugal pumps, or ventilators. Instead of a Galilean invariance, we enforce a rotation invariance, i.e., the invariance of a vortex under a uniform-speed rotation of the underlying coordinate system around a fixed axis. We provide a general approach to transform a Galilean invariant vortex concept to a rotation invariant one by simply adding a closed form matrix to the Jacobian. In particular, we present rotation invariant versions of the well-known Sujudi-Haimes, Lambda-2, and Q vortex criteria. We apply them to a number of artificial and real rotating flows, showing that for these cases rotation invariant vortices give better results than their Galilean invariant counterparts.",Tobias Günther;Maik Schulze;Holger Theisel,Tobias Günther;Maik Schulze;Holger Theisel,"Visual Computing Group, University of Magdeburg;MAXON Computer;Visual Computing Group, University of Magdeburg",10.1109/TVCG.2014.2346415;10.1109/VISUAL.2002.1183789;10.1109/TVCG.2014.2346412;10.1109/TVCG.2011.249;10.1109/TVCG.2013.189;10.1109/VISUAL.1999.809917;10.1109/VISUAL.1999.809896;10.1109/VISUAL.1998.745296;10.1109/VISUAL.2005.1532851;10.1109/TVCG.2007.70545;10.1109/TVCG.2010.198,"Vortex cores, rotation invariance, Galilean invariance, scientific visualization, flow visualization, line fields",10,18,49,HM
VAST,2015,Interactive Visual Profiling of Musicians,10.1109/TVCG.2015.2467620,http://dx.doi.org/10.1109/TVCG.2015.2467620,200,209,J,"Determining similar objects based upon the features of an object of interest is a common task for visual analytics systems. This process is called profiling, if the object of interest is a person with individual attributes. The profiling of musicians similar to a musician of interest with the aid of visual means became an interesting research question for musicologists working with the Bavarian Musicians Encyclopedia Online. This paper illustrates the development of a visual analytics profiling system that is used to address such research questions. Taking musicological knowledge into account, we outline various steps of our collaborative digital humanities project, priority (1) the definition of various measures to determine the similarity of musicians' attributes, and (2) the design of an interactive profiling system that supports musicologists in iteratively determining similar musicians. The utility of the profiling system is emphasized by various usage scenarios illustrating current research questions in musicology.",Stefan Jänicke;Josef Focht;Gerik Scheuermann,Stefan Jänicke;Josef Focht;Gerik Scheuermann,"Image and Signal Processing Group, Germany;Museum of Musical Instruments, Germany;Image and Signal Processing Group, Germany",10.1109/VAST.2011.6102454;10.1109/TVCG.2010.159;10.1109/TVCG.2014.2346431;10.1109/TVCG.2007.70617;10.1109/VAST.2009.5333443;10.1109/TVCG.2014.2346433;10.1109/TVCG.2008.175;10.1109/TVCG.2012.252;10.1109/VAST.2012.6400485;10.1109/INFVIS.2005.1532126;10.1109/TVCG.2012.277;10.1109/VAST.2012.6400491;10.1109/VAST.2007.4389004;10.1109/TVCG.2014.2346677;10.1109/TVCG.2009.111;10.1109/TVCG.2006.122;10.1109/VAST.2010.5652931;10.1109/VAST.2009.5333023;10.1109/VAST.2007.4389006;10.1109/VAST.2009.5333248;10.1109/VAST.2008.4677370;10.1109/VAST.2010.5652520,"visual analytics, profiling system, musicians database visualization, digital humanities, musicology",10,12,54,
VAST,2015,DemographicVis: Analyzing demographic information based on user generated content,10.1109/VAST.2015.7347631,http://dx.doi.org/10.1109/VAST.2015.7347631,57,64,C,"The wide-spread of social media provides unprecedented sources of written language that can be used to model and infer online demographics. In this paper, we introduce a novel visual text analytics system, DemographicVis, to aid interactive analysis of such demographic information based on user-generated content. Our approach connects categorical data (demographic information) with textual data, allowing users to understand the characteristics of different demographic groups in a transparent and exploratory manner. The modeling and visualization are based on ground truth demographic information collected via a survey conducted on Reddit.com. Detailed user information is taken into our modeling process that connects the demographic groups with features that best describe the distinguishing characteristics of each group. Features including topical and linguistic are generated from the user-generated contents. Such features are then analyzed and ranked based on their ability to predict the users' demographic information. To enable interactive demographic analysis, we introduce a web-based visual interface that presents the relationship of the demographic groups, their topic interests, as well as the predictive power of various features. We present multiple case studies to showcase the utility of our visual analytics approach in exploring and understanding the interests of different demographic groups. We also report results from a comparative evaluation, showing that the DemographicVis is quantitatively superior or competitive and subjectively preferred when compared to a commercial text analysis tool.",Wenwen Dou;Isaac Cho;Omar ElTayeby;Jaegul Choo;Derek Xiaoyu Wang;William Ribarsky,Wenwen Dou;Isaac Cho;Omar ElTayeby;Jaegul Choo;Xiaoyu Wang;William Ribarsky,"UNC Charlotte, USA;UNC Charlotte, USA;UNC Charlotte, USA;Korea University, South Korea;Taste Analytics, USA;UNC Charlotte, USA",10.1109/VAST.2014.7042493;10.1109/TVCG.2013.212;10.1109/TVCG.2014.2346433;10.1109/VAST.2011.6102461;10.1109/TVCG.2014.2346920,"Visual Text Analysis, User Interface, Social Media, Demographic Analysis",10,8,24,
InfoVis,2016,An Evaluation of Visual Search Support in Maps,10.1109/TVCG.2016.2598898,http://dx.doi.org/10.1109/TVCG.2016.2598898,421,430,J,"Visual search can be time-consuming, especially if the scene contains a large number of possibly relevant objects. An instance of this problem is present when using geographic or schematic maps with many different elements representing cities, streets, sights, and the like. Unless the map is well-known to the reader, the full map or at least large parts of it must be scanned to find the elements of interest. In this paper, we present a controlled eye-tracking study (30 participants) to compare four variants of map annotation with labels: within-image annotations, grid reference annotation, directional annotation, and miniature annotation. Within-image annotation places labels directly within the map without any further search support. Grid reference annotation corresponds to the traditional approach known from atlases. Directional annotation utilizes a label in combination with an arrow pointing in the direction of the label within the map. Miniature annotation shows a miniature grid to guide the reader to the area of the map in which the label is located. The study results show that within-image annotation is outperformed by all other annotation approaches. Best task completion times are achieved with miniature annotation. The analysis of eye-movement data reveals that participants applied significantly different visual task solution strategies for the different visual annotations.",Rudolf Netzel;Marcel Hlawatsch;Michael Burch;Sanjeev Balakrishnan;Hansjörg Schmauder;Daniel Weiskopf,Rudolf Netzel;Marcel Hlawatsch;Michael Burch;Sanjeev Balakrishnan;Hansjörg Schmauder;Daniel Weiskopf,"VISUS, University of Stuttgart;VISUS, University of Stuttgart;VISUS, University of Stuttgart;VISUS, University of Stuttgart;VISUS, University of Stuttgart;VISUS, University of Stuttgart",10.1109/TVCG.2014.2346420;10.1109/TVCG.2010.191,Visual search;laboratory study;eye tracking;map visualization,10,10,37,
SciVis,2016,GlyphLens: View-Dependent Occlusion Management in the Interactive Glyph Visualization,10.1109/TVCG.2016.2599049,http://dx.doi.org/10.1109/TVCG.2016.2599049,891,900,J,"Glyph as a powerful multivariate visualization technique is used to visualize data through its visual channels. To visualize 3D volumetric dataset, glyphs are usually placed on 2D surface, such as the slicing plane or the feature surface, to avoid occluding each other. However, the 3D spatial structure of some features may be missing. On the other hand, placing large number of glyphs over the entire 3D space results in occlusion and visual clutter that make the visualization ineffective. To avoid the occlusion, we propose a view-dependent interactive 3D lens that removes the occluding glyphs by pulling the glyphs aside through the animation. We provide two space deformation models and two lens shape models to displace the glyphs based on their spatial distributions. After the displacement, the glyphs around the user-interested region are still visible as the context information, and their spatial structures are preserved. Besides, we attenuate the brightness of the glyphs inside the lens based on their depths to provide more depth cue. Furthermore, we developed an interactive glyph visualization system to explore different glyph-based visualization applications. In the system, we provide a few lens utilities that allows users to pick a glyph or a feature and look at it from different view directions. We compare different display/interaction techniques to visualize/manipulate our lens and glyphs.",Xin Tong;Cheng Li;Han-Wei Shen,Xin Tong;Cheng Li;Han-Wei Shen,The Ohio State University;The Ohio State University;The Ohio State University,10.1109/TVCG.2013.121;10.1109/INFVIS.1996.559215;10.1109/TVCG.2010.199;10.1109/TVCG.2010.127;10.1109/VISUAL.2003.1250400;10.1109/VISUAL.1993.398849;10.1109/TVCG.2015.2467202;10.1109/TVCG.2006.167;10.1109/TVCG.2010.157,View-dependent visualization;focus + context techniques;manipulation and deformation;glyph-based techniques;human-computer interaction,10,13,48,
InfoVis,2017,MyBrush: Brushing and Linking with Personal Agency,10.1109/TVCG.2017.2743859,http://dx.doi.org/10.1109/TVCG.2017.2743859,605,615,J,"We extend the popular brushing and linking technique by incorporating personal agency in the interaction. We map existing research related to brushing and linking into a design space that deconstructs the interaction technique into three components: source (what is being brushed), link (the expression of relationship between source and target), and target (what is revealed as related to the source). Using this design space, we created MyBrush, a unified interface that offers personal agency over brushing and linking by giving people the flexibility to configure the source, link, and target of multiple brushes. The results of three focus groups demonstrate that people with different backgrounds leveraged personal agency in different ways, including performing complex tasks and showing links explicitly. We reflect on these results, paving the way for future research on the role of personal agency in information visualization.",Philipp Koytek;Charles Perin;Jo Vermeulen;Elisabeth André;Sheelagh Carpendale,Philipp Koytek;Charles Perin;Jo Vermeulen;Elisabeth André;Sheelagh Carpendale,"University of CalgaryAugsburg University;City, University of LondonUniversity of Calgary;University of Calgary;Augsburg University;University of Calgary",10.1109/TVCG.2011.185;10.1109/VISUAL.1991.175794;10.1109/INFVIS.2003.1249024;10.1109/TVCG.2011.201;10.1109/TVCG.2007.70521;10.1109/VAST.2009.5333443;10.1109/TVCG.2008.153;10.1109/INFVIS.2004.64;10.1109/INFVIS.1999.801858;10.1109/TVCG.2014.2346260;10.1109/VISUAL.2000.885739;10.1109/INFVIS.2002.1173157;10.1109/VAST.2007.4389011;10.1109/TVCG.2006.147;10.1109/TVCG.2008.116;10.1109/TVCG.2013.154;10.1109/TVCG.2010.138;10.1109/VISUAL.1995.485139;10.1109/TVCG.2011.183;10.1109/TVCG.2009.162;10.1109/VISUAL.1994.346302;10.1109/INFVIS.2004.12;10.1109/VISUAL.1996.567800,"Brushing,linking,personal agency,coordinated multiple views,interaction,design space,information visualization",10,5,82,
InfoVis,2017,Imagining Replications: Graphical Prediction & Discrete Visualizations Improve Recall & Estimation of Effect Uncertainty,10.1109/TVCG.2017.2743898,http://dx.doi.org/10.1109/TVCG.2017.2743898,446,456,J,"People often have erroneous intuitions about the results of uncertain processes, such as scientific experiments. Many uncertainty visualizations assume considerable statistical knowledge, but have been shown to prompt erroneous conclusions even when users possess this knowledge. Active learning approaches been shown to improve statistical reasoning, but are rarely applied in visualizing uncertainty in scientific reports. We present a controlled study to evaluate the impact of an interactive, graphical uncertainty prediction technique for communicating uncertainty in experiment results. Using our technique, users sketch their prediction of the uncertainty in experimental effects prior to viewing the true sampling distribution from an experiment. We find that having a user graphically predict the possible effects from experiment replications is an effective way to improve one's ability to make predictions about replications of new experiments. Additionally, visualizing uncertainty as a set of discrete outcomes, as opposed to a continuous probability distribution, can improve recall of a sampling distribution from a single experiment. Our work has implications for various applications where it is important to elicit peoples' estimates of probability distributions and to communicate uncertainty effectively.",Jessica Hullman;Matthew Kay 0001;Yea-Seul Kim;Samana Shrestha,Jessica Hullman;Matthew Kay;Yea-Seul Kim;Samana Shrestha,University of Washington;University of Michigan;University of Washington;Vassar College,10.1109/TVCG.2012.199,"Graphical prediction,interactive uncertainty visualization,replication crisis,probability distribution",10,9,67,
InfoVis,2017,Extracting and Retargeting Color Mappings from Bitmap Images of Visualizations,10.1109/TVCG.2017.2744320,http://dx.doi.org/10.1109/TVCG.2017.2744320,637,646,J,"Visualization designers regularly use color to encode quantitative or categorical data. However, visualizations “in the wild” often violate perceptual color design principles and may only be available as bitmap images. In this work, we contribute a method to semi-automatically extract color encodings from a bitmap visualization image. Given an image and a legend location, we classify the legend as describing either a discrete or continuous color encoding, identify the colors used, and extract legend text using OCR methods. We then combine this information to recover the specific color mapping. Users can also correct interpretation errors using an annotation interface. We evaluate our techniques using a corpus of images extracted from scientific papers and demonstrate accurate automatic inference of color mappings across a variety of chart types. In addition, we present two applications of our method: automatic recoloring to improve perceptual effectiveness, and interactive overlays to enable improved reading of static visualizations.",Jorge Poco;Angela Mayhua;Jeffrey Heer,Jorge Poco;Angela Mayhua;Jeffrey Heer,University of Washington;Universidad Católica San Pablo;University of Washington,10.1109/TVCG.2011.192;10.1109/TVCG.2011.185;10.1109/TVCG.2016.2598918;10.1109/TVCG.2012.229,"Visualization,color,chart understanding,information extraction,redesign,computer vision",10,10,27,
InfoVis,2017,Data Through Others' Eyes: The Impact of Visualizing Others' Expectations on Visualization Interpretation,10.1109/TVCG.2017.2745240,http://dx.doi.org/10.1109/TVCG.2017.2745240,760,769,J,"In addition to visualizing input data, interactive visualizations have the potential to be social artifacts that reveal other people's perspectives on the data. However, how such social information embedded in a visualization impacts a viewer's interpretation of the data remains unknown. Inspired by recent interactive visualizations that display people's expectations of data against the data, we conducted a controlled experiment to evaluate the effect of showing social information in the form of other people's expectations on people's ability to recall the data, the degree to which they adjust their expectations to align with the data, and their trust in the accuracy of the data. We found that social information that exhibits a high degree of consensus lead participants to recall the data more accurately relative to participants who were exposed to the data alone. Additionally, participants trusted the accuracy of the data less and were more likely to maintain their initial expectations when other people's expectations aligned with their own initial expectations but not with the data. We conclude by characterizing the design space for visualizing others' expectations alongside data.",Yea-Seul Kim;Katharina Reinecke;Jessica Hullman,Yea-Seul Kim;Katharina Reinecke;Jessica Hullman,University of Washington;University of Washington;University of Washington,10.1109/VAST.2007.4389011;10.1109/INFVIS.2005.1532126;10.1109/TVCG.2011.255;10.1109/TVCG.2014.2346419;10.1109/TVCG.2007.70577;10.1109/INFVIS.2005.1532122;10.1109/TVCG.2007.70589,"Social influence,Social visualization,Data interpretation",10,6,40,
InfoVis,2017,Active Reading of Visualizations,10.1109/TVCG.2017.2745958,http://dx.doi.org/10.1109/TVCG.2017.2745958,770,780,J,"We investigate whether the notion of active reading for text might be usefully applied to visualizations. Through a qualitative study we explored whether people apply observable active reading techniques when reading paper-based node-link visualizations. Participants used a range of physical actions while reading, and from these we synthesized an initial set of active reading techniques for visualizations. To learn more about the potential impact such techniques may have on visualization reading, we implemented support for one type of physical action from our observations (making freeform marks) in an interactive node-link visualization. Results from our quantitative study of this implementation show that interactive support for active reading techniques can improve the accuracy of performing low-level visualization tasks. Together, our studies suggest that the active reading space is ripe for research exploration within visualization and can lead to new interactions that make for a more flexible and effective visualization reading experience.",Jagoda Walny;Samuel Huron;Charles Perin;Tiffany Wun;Richard Pusch;Sheelagh Carpendale,Jagoda Walny;Samuel Huron;Charles Perin;Tiffany Wun;Richard Pusch;Sheelagh Carpendale,University of Calgary;University of Calgary;University of Calgary;University of Calgary;University of Calgary;University of Calgary,10.1109/INFVIS.2005.1532136;10.1109/TVCG.2011.185;10.1109/TVCG.2015.2467201;10.1109/TVCG.2014.2346984;10.1109/TVCG.2016.2598594;10.1109/INFVIS.2004.1;10.1109/TVCG.2014.2346435;10.1109/TVCG.2010.164;10.1109/TVCG.2008.141;10.1109/TVCG.2015.2467452;10.1109/TVCG.2015.2467671;10.1109/TVCG.2015.2467195;10.1109/TVCG.2014.2346573;10.1109/TVCG.2015.2467811;10.1109/TVCG.2014.2346422;10.1109/TVCG.2010.179;10.1109/TVCG.2013.164;10.1109/TVCG.2012.189,"active reading of visualizations,active reading,information visualization,spectrum of physical engagement",10,12,74,
VAST,2017,Applying Pragmatics Principles for Interaction with Visual Analytics,10.1109/TVCG.2017.2744684,http://dx.doi.org/10.1109/TVCG.2017.2744684,309,318,J,"Interactive visual data analysis is most productive when users can focus on answering the questions they have about their data, rather than focusing on how to operate the interface to the analysis tool. One viable approach to engaging users in interactive conversations with their data is a natural language interface to visualizations. These interfaces have the potential to be both more expressive and more accessible than other interaction paradigms. We explore how principles from language pragmatics can be applied to the flow of visual analytical conversations, using natural language as an input modality. We evaluate the effectiveness of pragmatics support in our system Evizeon, and present design considerations for conversation interfaces to visual analytics tools.",Enamul Hoque;Vidya Setlur;Melanie Tory;Isaac Dykeman,Enamul Hoque;Vidya Setlur;Melanie Tory;Isaac Dykeman,Stanford University;Tableau Research;Tableau Research;Rice University,10.1109/TVCG.2014.2346435;10.1109/TVCG.2010.164;10.1109/TVCG.2007.70594;10.1109/INFVIS.2005.1532146,"natural language,interaction,language pragmatics,visual analytics,ambiguity,feedback",10,10,41,
VAST,2017,The Anchoring Effect in Decision-Making with Visual Analytics,10.1109/VAST.2017.8585665,http://dx.doi.org/10.1109/VAST.2017.8585665,116,126,C,"Anchoring effect is the tendency to focus too heavily on one piece of information when making decisions. In this paper, we present a novel, systematic study and resulting analyses that investigate the effects of anchoring effect on human decision-making using visual analytic systems. Visual analytics interfaces typically contain multiple views that present various aspects of information such as spatial, temporal, and categorical. These views are designed to present complex, heterogeneous data in accessible forms that aid decision-making. However, human decision-making is often hindered by the use of heuristics, or cognitive biases, such as anchoring effect. Anchoring effect can be triggered by the order in which information is presented or the magnitude of information presented. Through carefully designed laboratory experiments, we present evidence of anchoring effect in analysis with visual analytics interfaces when users are primed by representation of different pieces of information. We also describe detailed analyses of users' interaction logs which reveal the impact of anchoring bias on the visual representation preferred and paths of analysis. We discuss implications for future research to possibly detect and alleviate anchoring bias.",Isaac Cho;Ryan Wesslen;Alireza Karduni;Sashank Santhanam;Samira Shaikh;Wenwen Dou,Isaac Cho;Ryan Wesslen;Alireza Karduni;Sashank Santhanam;Samira Shaikh;Wenwen Dou,University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte,10.1109/TVCG.2015.2467971;10.1109/VAST.2017.8585658;10.1109/TVCG.2016.2598594;10.1109/VAST.2011.6102491;10.1109/TVCG.2009.152;10.1109/TVCG.2015.2467591,"Visual Analytics,Anchoring Effect,Sense Making,Cognitive Bias,Interaction Log Analysis",10,6,46,
InfoVis,2018,Augmenting Visualizations with Interactive Data Facts to Facilitate Interpretation and Communication,10.1109/TVCG.2018.2865145,http://dx.doi.org/10.1109/TVCG.2018.2865145,672,681,J,"Recently, an increasing number of visualization systems have begun to incorporate natural language generation (NLG) capabilities into their interfaces. NLG-based visualization systems typically leverage a suite of statistical functions to automatically extract key facts about the underlying data and surface them as natural language sentences alongside visualizations. With current systems, users are typically required to read the system-generated sentences and mentally map them back to the accompanying visualization. However, depending on the features of the visualization (e.g., visualization type, data density) and the complexity of the data fact, mentally mapping facts to visualizations can be a challenging task. Furthermore, more than one visualization could be used to illustrate a single data fact. Unfortunately, current tools provide little or no support for users to explore such alternatives. In this paper, we explore how system-generated data facts can be treated as interactive widgets to help users interpret visualizations and communicate their findings. We present Voder, a system that lets users interact with automatically-generated data facts to explore both alternative visualizations to convey a data fact as well as a set of embellishments to highlight a fact within a visualization. Leveraging data facts as interactive widgets, Voder also facilitates data fact-based visualization search. To assess Voder's design and features, we conducted a preliminary user study with 12 participants having varying levels of experience with visualization tools. Participant feedback suggested that interactive data facts aided them in interpreting visualizations. Participants also stated that the suggestions surfaced through the facts helped them explore alternative visualizations and embellishments to communicate individual data facts.",Arjun Srinivasan;Steven Mark Drucker;Alex Endert;John T. Stasko,Arjun Srinivasan;Steven M. Drucker;Alex Endert;John Stasko,Georgia Institute of Technology;Microsoft Research;Georgia Institute of Technology;Georgia Institute of Technology,10.1109/INFVIS.2005.1532136;10.1109/TVCG.2013.124;10.1109/TVCG.2010.164;10.1109/TVCG.2013.119;10.1109/TVCG.2012.229;10.1109/TVCG.2007.70594;10.1109/VISUAL.1992.235203;10.1109/TVCG.2017.2744843;10.1109/TVCG.2017.2745219;10.1109/VISUAL.1990.146375;10.1109/TVCG.2015.2467191,"Natural Language Generation,Mixed-initiative Interaction,Visualization Recommendation,Data-driven Communication",10,12,50,
Vis,1990,A journey into the fourth dimension,10.1109/VISUAL.1990.146385,http://dx.doi.org/10.1109/VISUAL.1990.146385,219,"229, 476-477",C,"It is shown that by a simple (one-way) mapping from quaternions to complex numbers, the problem of generating a four-dimensional Mandelbrot set by iteration of a quadratic function in quaternions can be reduced to iteration of the same function in the complex domain, and thus, the function values in 4-D can be obtained by a simple table lookup. The computations are cut down by an order. Simple ways of displaying the fractal without shading and ways of fast ray tracing such a fractal using the table so generated are discussed. Further speedup in ray tracing can be achieved by estimates of a distance of a point from the Mandelbrot set. Animation is a key factor in visualizing 4-D objects. Three types of animation are attempted: translation in 4-D, rotation in 4-D, and fly-through in 3-D.&lt;&lt;ETX&gt;&gt;",Yan Ke;E. S. Panduranga,Y. Ke;E.S. Panduranga,"Dept. of Comput. Sci., Saskatchewan Univ., Saskatoon, Sask., Canada",,,9,1,9,
Vis,1990,Accurate display of tensor product isosurfaces,10.1109/VISUAL.1990.146401,http://dx.doi.org/10.1109/VISUAL.1990.146401,353,"360, 489",C,"A general method for rendering isosurfaces of multivariate rational and polynomial tensor products is described. The method is robust up to degree 15, handling singularities without introducing spurious rendering artifacts. The approach does not solve the problem of singularities in general, but it removes the problem from the rendering domain to the interpolation/approximation domain. It is based on finding real roots of a polynomial in Bernstein form. This makes it particularly suitable for parallel and pipelined processing. It is envisioned that the tensor products will be used as approximants or interpolants for empirical data or scalar fields. An interpolation scheme is given as an example.&lt;&lt;ETX&gt;&gt;",Alyn P. Rockwood,A. Rockwood,"Silicon Graphics Comput. Syst., Mountain View, CA, USA",,,9,6,19,
Vis,1990,Interactive investigation of fluid mechanics data sets,10.1109/VISUAL.1990.146416,http://dx.doi.org/10.1109/VISUAL.1990.146416,435,"439, 490",C,"FIELDVIEW, a visual analysis tool designed to facilitate the interactive investigation of fluid mechanics data sets by providing an easy-to-use interface to the flow field data, is presented. Operating on NASA Plot three-dimensional format data, FIELDVIEW computes scalar and vector flow quantities and displays them using a variety of representations, including animation. An interactive viewing interface allows free motion around the data under study to allow the researcher to locate and study the interesting flow features of three-dimensional fluid dynamic data.&lt;&lt;ETX&gt;&gt;",Steve M. Legensky,S.M. Legensky,,,,9,6,5,
Vis,1991,Visualizing causal effects in 4D space-time vector fields,10.1109/VISUAL.1991.175770,http://dx.doi.org/10.1109/VISUAL.1991.175770,12,"16, 406",C,"A method is presented for juxtaposing 4D space-time vector fields, of which one contains a source variable and the other the response field. Thresholding, ellipsoid fitting, and vortex line generation are used to reduce the amount of information and help analyze the relationship between two 3D vector variables evolving in time. The technique helps to highlight the topological relationship between the two in an effort to understand the causal connection. These concepts are applied to on-going research in evolving fluid dynamics problems.&lt;&lt;ETX&gt;&gt;",Deborah Silver;M. Gao;Norman J. Zabusky,D. Silver;M. Gao;N. Zabusky,"Rutgers Univ., Piscataway, NJ, USA;Rutgers Univ., Piscataway, NJ, USA;Rutgers Univ., Piscataway, NJ, USA",,,9,5,8,
Vis,1994,Triangulation and display of rational parametric surfaces,10.1109/VISUAL.1994.346335,http://dx.doi.org/10.1109/VISUAL.1994.346335,69,"76, C6",C,"We present a comprehensive algorithm to construct a topologically correct triangulation of the real affine part of a rational parametric surface with few restrictions on the defining rational functions. The rational functions are allowed to be undefined on domain curves (pole curves) and at certain special points (base points), and the surface is allowed to have nodal or cuspidal self-intersections. We also recognize that for a complete display, some real points on the parametric surface may be generated only by complex parameter values, and that some finite points on the surface may be generated only by infinite parameter values; we show how to compensate for these conditions. Our techniques for handling these problems have applications in scientific visualization, rendering non-standard NURBS, and in finite-element mesh generation.&lt;&lt;ETX&gt;&gt;",Chandrajit L. Bajaj;Andrew V. Royappa,C.L. Bajaj;A. Royappa,"Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA;Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA",,,9,5,25,
InfoVis,1995,Case study: fishing for information on the Internet,10.1109/INFVIS.1995.528693,http://dx.doi.org/10.1109/INFVIS.1995.528693,105,111,C,"As the Internet continues to grow, the amount of accessible information becomes increasingly vast. Search tools exist that allow users to find relevant information. However, a search can often produce such a large amount of data that it becomes hard to ferret out the most appropriate and highest quality information. In addition, some search tools lose valuable information when displaying the results to the user. The paper describes a search visualization tool, called FISH, for viewing hierarchically structured information and managing information overload. FISH (Forager for the Information Super Highway) allows users to visualize the results of search requests across large document spaces in a way that preserves the structure of the information space. FISH displays the returned documents as rectangles, using a combination of order, indentation, size, and color to denote document hierarchy, the score of the documents with respect to the search, and other data attributes. In addition, the user can navigate through the document space for in-depth probing and refinement.",R. Mitchell;David S. Day;Lynette Hirschman,R. Mitchell;D. Day;L. Hirschman,"Mitre Corp., Bedford, MA, USA;Mitre Corp., Bedford, MA, USA;Mitre Corp., Bedford, MA, USA",10.1109/VISUAL.1991.175815,,9,4,4,
InfoVis,1995,Case study: an empirical investigation of thumbnail image recognition,10.1109/INFVIS.1995.528695,http://dx.doi.org/10.1109/INFVIS.1995.528695,115,121,C,"The use of thumbnails (i.e., miniatures) in the user-interface of image databases allows searching and selection of images without the need for naming policies. Treating parent images prior to reduction with edge-detecting smoothing, lossy image compression, or static codebook compression resulted in thumbnails where the distortion caused by reduction was lessened. An experiment assessing these techniques found resulting thumbnails could be recognised more quickly and accurately than thumbnails of the same parent images that had been reduced without treatment. This pretreatment in thumbnail creation is offered as an improvement.",C. A. Burton;L. J. Johnston;E. A. Sonenberg,C.A. Burton;L.J. Johnston;E.A. Sonenberg,"Melbourne Univ., Parkville, Vic., Australia;Melbourne Univ., Parkville, Vic., Australia;Melbourne Univ., Parkville, Vic., Australia",,,9,4,15,
Vis,1995,Tensor product surfaces guided by minimal surface area triangulations,10.1109/VISUAL.1995.480820,http://dx.doi.org/10.1109/VISUAL.1995.480820,254,"261, 460",C,"Presents a method for constructing tensor product Bezier surfaces from contour (cross-section) data. Minimal area triangulations are used to guide the surface construction, and the final surface reflects the optimality of the triangulation. The resulting surface differs from the initial triangulation in two important ways: it is smooth (as opposed to the piecewise planar triangulation), and it is in tensor product form (as opposed to the irregular triangular mesh). The surface reconstruction is efficient because we do not require an exact minimal surface. The triangulations are used as strong hints, but no more than that. The method requires the computation of both open and closed isoparametric curves of the surface, using triangulations as a guide. These isoparametric curves form a tensor product Bezier surface. We show how to control sampling density by filling and pruning isoparametric curves, for accuracy and economy. A rectangular grid of points is produced that is compatible with the expected format for a tensor product surface interpolation, so that a host of well-supported methods are available to generate and manipulate the surface.",John K. Johnstone;Kenneth R. Sloan,J.K. Johnstone;K.R. Sloan,"Dept. of Comput. & Inf. Sci., Alabama Univ., Birmingham, AL, USA;Dept. of Comput. & Inf. Sci., Alabama Univ., Birmingham, AL, USA",,"surface reconstruction, contour data, minimum area triangulation, Bezier surface, biomedical visualization",9,5,7,
Vis,1996,The challenges of visualizing and modeling environmental data,10.1109/VISUAL.1996.568145,http://dx.doi.org/10.1109/VISUAL.1996.568145,413,416,C,Existing volume visualization techniques are typically applied to a three-dimensional grid. This presents some challenging problems in the visualization of environmental data. This data often consists of unevenly distributed samples. Typically a two-step approach is used to visualize environmental data. First the unevenly distributed sample data are modeled onto a uniform 3-D grid. This grid model is subsequently rendered using conventional grid-based visualization techniques. This paper discusses some of the limitations of this approach and highlights areas where further research is needed to improve the accuracy of visualization for environmental applications.,Yingcai Xiao;John P. Ziebarth;Chuck Woodbury;Eric Bayer;Bruce Rundell;Jeroen van der Zijp,Yingcai Xiao;J.P. Ziebarth;C. Woodbury;E. Bayer;B. Rundell;J. van der Zijp,"Dept. of Math., Akron Univ., OH, USA",,,9,3,9,
Vis,2000,Visualization of multi-dimensional data with vector-fusion,10.1109/VISUAL.2000.885708,http://dx.doi.org/10.1109/VISUAL.2000.885708,297,302,C,"Multi-dimensional entities are modeled, displayed and understood with a new algorithm vectorizing data of any dimensionality. This algorithm is called SBP; it is a vectorized generalization of parallel coordinates. Classic geometries of any dimensionality can be demonstrated to facilitate perception and understanding of the shapes generated by this algorithm. SBP images of a 4D line, a circle and 3D and 4D spherical helices are shown. A strategy for synthesizing multi-dimensional models matching multi-dimensional data is presented. Current applications include data mining; modeling data-defined structures of scientific interest such as protein structure and Calabi-Yau figures as multi-dimensional geometric entities; generating vector-fused data signature fingerprints of classic frequency spectra that identify substances; and treating complex targets as multi-dimensional entities for automatic target recognition. SBP vector data signatures apply to all pattern recognition problems.",R. R. Johnson,R.R. Johnson,"Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA",,"Multidimensional Visualization, Vector Data Fusion, Multidimensional Geometry",9,4,6,
Vis,2000,Scientific visualization of water quality in the Chesapeake bay,10.1109/VISUAL.2000.885744,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2000.885744,509,512,C,"This paper describes our experience in designing and building a tool for visualizing the results of the CE-QUAL-ICM Three-Dimensional Eutrophication Model, as applied to water quality in the Chesapeake Bay. This model outputs a highly multidimensional dataset over very many timesteps – outstripping the capabilities of the visualization tools available to the research team. As part of the Army Engineer Research and Development Center (ERDC) Programming Environment and Training (PET) project, a special visualization tool was developed. Some problematic issues in efficiently handling and processing the data format from the computational model were resolved through this work. Also, a sophisticated system for dynamically generating visualizations of the data has been implemented. In addition, the development of the VisGen library allows for high-level, flexible control of the VTK graphics pipeline. Coupled with an easy-to-use interface to the application, this allows the user a lot of control over the graphical representation of the data. Once the user has a representation he/she is pleased with, a wide variety of options are provided for how this can be used in presentation, or for sharing with remote colleagues. This paper includes discussions on how the simulation data are handled efficiently, as well as how the issues of usability, flexibility and collaboration are addressed.",Robert Stein;Alan M. Shih;M. Pauline Baker;Carl F. Cerco;Mark R. Noel,R. Stein;A.M. Shih;M.P. Baker;C.F. Cerco;M.R. Noel,,10.1109/VISUAL.1996.567752,,9,0,0,
InfoVis,2001,Graphic data display for cardiovascular system,10.1109/INFVIS.2001.963295,http://dx.doi.org/10.1109/INFVIS.2001.963295,163,166,C,,James Agutter;Noah Syroid;Frank Drews;Dwayne R. Westenskow;Julio C. Bermudez;David L. Strayer,J. Agutter;N. Syroid;F. Drews;D. Westenskow;J. Bermudez;D. Strayer,University of Utah,,,9,3,13,
Vis,2001,Wavelet representation of contour sets,10.1109/VISUAL.2001.964525,http://dx.doi.org/10.1109/VISUAL.2001.964525,303,310,C,"We present a new wavelet compression and multiresolution modeling approach for sets of contours (level sets). In contrast to previous wavelet schemes, our algorithm creates a parametrization of a scalar field induced by its contours and compactly stores this parametrization rather than function values sampled on a regular grid. Our representation is based on hierarchical polygon meshes with subdivision connectivity whose vertices are transformed into wavelet coefficients. From this sparse set of coefficients, every set of contours can be efficiently reconstructed at multiple levels of resolution. When applying lossy compression, introducing high quantization errors, our method preserves contour topology, in contrast to compression methods applied to the corresponding field function. We provide numerical results for scalar fields defined on planar domains. Our approach generalizes to volumetric domains, time-varying contours, and level sets of vector fields.",Martin Hering-Bertram;Daniel E. Laney;Mark A. Duchaineau;Charles D. Hansen;Bernd Hamann;Kenneth I. Joy,M. Bertram;D.E. Laney;M.A. Duchaineau;C.D. Hansen;B. Hamann;K.I. Joy,"SCI Inst., Utah Univ., Salt Lake City, UT, USA",10.1109/VISUAL.1994.346332;10.1109/VISUAL.2000.885720;10.1109/VISUAL.2000.885716;10.1109/VISUAL.2000.885705,"Contours, Geometry Compression, Iso-surfaces, Level Sets, Multiresolution Methods, Wavelets",9,3,21,
Vis,2001,The MetVR case study: meteorological visualization in an immersive virtual environment,10.1109/VISUAL.2001.964559,http://dx.doi.org/10.1109/VISUAL.2001.964559,489,492,C,"Traditional methods for displaying weather products are generally two-dimensional (2D) plots or just text format. It is hard for forecasters to get the entire picture of the atmosphere using these methods. The problems apparent in 2D with comparing and correlating multiple layers are overcome simply by adding a dimension. This is important because pertinent features in the data sets may lie in multiple layers and span several time steps. However, simply using a three-dimensional (3D) approach is not enough. The capacity for analysis of small-scale, but important, features in 2D are lost when transitioning to 3D. We propose that 3D's advantages can be incorporated with 2D's small-scale analysis by using an immersive virtual environment. In this case study, we evaluate our current standing with the project: have we met our goals, and how should we proceed from this point? To evaluate our application, we invited meteorologists to use the application to explore a data set. Then we presented our goals and asked which ones had we met, from a meteorologist's perspective. The results qualitatively reflected that our application was effective and further research would be worthwhile.",Sean Ziegeler;Robert J. Moorhead II;Paul J. Croft;Duanjun Lu,S. Ziegeler;R.J. Moorhead;P.J. Croft;Duanjun Lu,"NSF Eng. Res. Center, Mississippi State Univ., MS, USA;NSF Eng. Res. Center, Mississippi State Univ., MS, USA",,"virtual environments, virtual reality, immersion, visualization, meteorology",9,3,15,
Vis,2002,Case study: A look of performance expression,10.1109/VISUAL.2002.1183815,http://dx.doi.org/10.1109/VISUAL.2002.1183815,501,504,C,"For most of the time, we enjoy and appreciate music performances as they are. Once we try to understand the performance not in subjective terms but in an objective way and share it with other people, visualizing the performance parameters is indispensable. In this paper, a figure for visualizing performance expressions is described. This figure helps people understand the cause and position of the performance expression as it has expressive cues, which coincide with the cognitive meaning of musical performance, and not by using only MIDI parameter values. The differences we hear between performances are clarified by visualized figures.",Rumi Hiraga,R. Hiraga,"Bunkyo Univ., Japan",10.1109/VISUAL.1997.663931,"Music Performance, Expressive Cue, Performance Visualization, Understanding Performance",9,4,15,
InfoVis,2003,BARD: A visualization tool for biological sequence analysis,10.1109/INFVIS.2003.1249029,http://doi.ieeecomputersociety.org/10.1109/INFVIS.2003.1249029,219,225,C,"We present BARD (biological arc diagrams), a visualization tool for biological sequence analysis. The development of BARD began with the application of Wattenberg's arc diagrams (Wattenberg, 2002) to results from sequence analysis programs, such as BLAST (Atschul et al., 1990). In this paper, we extend the initial arc diagram concept in two ways: 1) by separating the visualization method from the underlying matching algorithm and 2) by expanding the types of matches to include inexact matches, complemented palindrome matches, and inter-sequence matches. BARD renders each type of match distinctly, resulting in a powerful tool to quickly understand sequence similarities and differences. We illustrate the power of BARD by applying the technique to a comparative sequence analysis of the human pathogenic fungi Cryptococcus neoformans.",Rhazes Spell;Rachael Brady;Fred Dietrich,R. Spell;R. Brady;F. Dierich,"Dept. of Biomed. Eng., Duke Univ., USA",10.1109/INFVIS.2002.1173155,"sequence analysis, comparative genomics, visualization, arc diagram, BARD",9,2,16,
InfoVis,2004,Exploring InfoVis Publication History with Tulip,10.1109/INFVIS.2004.23,http://dx.doi.org/10.1109/INFVIS.2004.23,r10,r10,M,"We show the structure of the InfoVis publications dataset using Tulip, a scalable open-source visualization system for graphs and trees. Tulip supports interactive navigation and many options for layout. Subgraphs of the full dataset can be created interactively or using a wide set of algorithms based on graph theory and combinatorics, including several kinds of clustering. We found that convolution clustering and small world clustering were particularly effective at showing the structure of the InfoVis publications dataset, as was coloring by the Strahler metric.",Maylis Delest;Tamara Munzner;David Auber;Jean-Philippe Domenger,M. Delest;T. Munzner;D. Auber;J.-P. Domenger,Universit&#233; de Bordeaux I,,,9,4,5,
InfoVis,2004,Non-Euclidean Spring Embedders,10.1109/INFVIS.2004.49,http://dx.doi.org/10.1109/INFVIS.2004.49,207,214,C,"We present a method by which force-directed algorithms for graph layouts can be generalized to calculate the layout of a graph in an arbitrary Riemannian geometry. The method relies on extending the Euclidean notions of distance, angle, and force-interactions to smooth nonEuclidean geometries via projections to and from appropriately chosen tangent spaces. In particular, we formally describe the calculations needed to extend such algorithms to hyperbolic and spherical geometries",Stephen G. Kobourov;Kevin Wampler,S.G. Kobourov;K. Wampler,University of Arizona,10.1109/INFVIS.1997.636718;10.1109/INFVIS.2002.1173159,"force-directed algorithms, spring embedders, non-Euclidean geometry, hyperbolic space, spherical space, graph drawing, information visualization",9,3,16,
Vis,2004,TetSplat: real-time rendering and volume clipping of large unstructured tetrahedral meshes,10.1109/VISUAL.2004.102,http://dx.doi.org/10.1109/VISUAL.2004.102,433,440,C,"We present a novel approach to interactive visualization and exploration of large unstructured tetrahedral meshes. These massive 3D meshes are used in mission-critical CFD and structural mechanics simulations, and typically sample multiple field values on several millions of unstructured grid points. Our method relies on the preprocessing of the tetrahedral mesh to partition it into nonconvex boundaries and internal fragments that are subsequently encoded into compressed multiresolution data representations. These compact hierarchical data structures are then adaptively rendered and probed in real-time on a commodity PC. Our point-based rendering algorithm, which is inspired by QSplat, employs a simple but highly efficient splatting technique that guarantees interactive frame-rates regardless of the size of the input mesh and the available rendering hardware. It furthermore allows for real-time probing of the volumetric data-set through constructive solid geometry operations as well as interactive editing of color transfer functions for an arbitrary number of field values. Thus, the presented visualization technique allows end-users for the first time to interactively render and explore very large unstructured tetrahedral meshes on relatively inexpensive hardware.",Ken Museth;Santiago V. Lombeyda,K. Museth;S. Lombeyda,"Linkoping Inst. of Technol., Sweden",10.1109/VISUAL.2000.885703;10.1109/VISUAL.1998.745329;10.1109/VISUAL.2000.885680;10.1109/VISUAL.1997.663869,"Large volumetric data, tetrahedral meshes, real-time visualization, point-based rendering, constructive solid geometry",9,4,22,
Vis,2004,Topology visualization of the optical power flow through a novel C-shaped nano-aperture,10.1109/VISUAL.2004.106,http://dx.doi.org/10.1109/VISUAL.2004.106,337,344,C,"An ideal visualization tool that has not been used before in studying the optical behavior of near-field apertures is three-dimensional vector field topology. The global view of the vector field structure is deduced by locating singularities (critical points) within the field and augmenting these points with nearby streamlines. We have used for the first time, to the best of our knowledge, three-dimensional topology to analyze the topological differences between a resonant C-shaped nano-aperture and various nonresonant conventional apertures. The topological differences between these apertures are related to the superiority in power throughput of the C-aperture versus conventional round and square sub-wavelength apertures. We demonstrate how topological visualization techniques provide significant insight into the energy enhancement mechanism of the C aperture, and also shed light on critical issues related to the interaction between multiple apertures located in close proximity to each other, which gives rise to cross-talk, for example as a function of distance. Topological techniques allow us to develop design rules for the geometry of these apertures and their desired spot sizes and brightness. The performance of various sub-wavelength apertures can also be compared quantitatively based on their topology. Since topological methods are generically applicable to tensor and vector fields, our approach can be readily extended to provide insight into the broader category of finite-difference-time-domain nano-photonics and nano-science problems.",Liying Sun;Rajesh Batra;Xiaolei Shi;Lambertus Hesselink,L. Sun;R.K. Batra;Xiaolei Shi;L. Hesselink,"Dept. of Phys., Stanford Univ., CA, USA",10.1109/VISUAL.1999.809874,"energy flow topology, Finite-Difference-Time-Domain (fdtd), C-aperture, vector field visualization",9,2,20,
Vis,2005,Marching diamonds for unstructured meshes,10.1109/VISUAL.2005.1532825,http://dx.doi.org/10.1109/VISUAL.2005.1532825,423,429,C,"We present a higher-order approach to the extraction of isosurfaces from unstructured meshes. Existing methods use linear interpolation along each mesh edge to find isosurface intersections. In contrast, our method determines intersections by performing barycentric interpolation over diamonds formed by the tetrahedra incident to each edge. Our method produces smoother, more accurate isosurfaces. Additionally, interpolating over diamonds, rather than linearly interpolating edge endpoints. enables us to identify up to two isosurface intersections per edge. This paper details how our new technique extracts isopoints, and presents a simple connection strategy for forming a triangle mesh isosurface.",John C. Anderson;Janine Bennett;Kenneth I. Joy,J.C. Anderson;J.C. Bennett;K.I. Joy,"Comput. Sci. Dept., California Univ., Davis, CA, USA;Comput. Sci. Dept., California Univ., Davis, CA, USA;Comput. Sci. Dept., California Univ., Davis, CA, USA",10.1109/VISUAL.1994.346331;10.1109/VISUAL.1991.175782,"isosurface extraction, interpolation, unstructured mesh",9,1,24,
Vis,2006,fine-grained Visualization Pipelines and Lazy Functional Languages,10.1109/TVCG.2006.145,http://dx.doi.org/10.1109/TVCG.2006.145,973,980,J,"The pipeline model in visualization has evolved from a conceptual model of data processing into a widely used architecture for implementing visualization systems. In the process, a number of capabilities have been introduced, including streaming of data in chunks, distributed pipelines, and demand-driven processing. Visualization systems have invariably built on stateful programming technologies, and these capabilities have had to be implemented explicitly within the lower layers of a complex hierarchy of services. The good news for developers is that applications built on top of this hierarchy can access these capabilities without concern for how they are implemented. The bad news is that by freezing capabilities into low-level services expressive power and flexibility is lost. In this paper we express visualization systems in a programming language that more naturally supports this kind of processing model. Lazy functional languages support fine-grained demand-driven processing, a natural form of streaming, and pipeline-like function composition for assembling applications. The technology thus appears well suited to visualization applications. Using surface extraction algorithms as illustrative examples, and the lazy functional language Haskell, we argue the benefits of clear and concise expression combined with fine-grained, demand-driven computation. Just as visualization provides insight into data, functional abstraction provides new insight into visualization",David J. Duke;Malcolm Wallace;Rita Borgo;Colin Runciman,David Duke;Malcolm Wallace;Rita Borgo;Colin Runciman,,10.1109/VISUAL.1994.346311;10.1109/VISUAL.1999.809864;10.1109/VISUAL.1993.398880;10.1109/VISUAL.1999.809891;10.1109/VISUAL.2005.1532800;10.1109/VISUAL.1997.663888,"Pipeline model, laziness, functional programming",9,6,29,
VAST,2007,Sunfall: A Collaborative Visual Analytics System for Astrophysics,10.1109/VAST.2007.4389026,http://dx.doi.org/10.1109/VAST.2007.4389026,219,220,M,"Computational and experimental sciences produce and collect ever- larger and complex datasets, often in large-scale, multi-institution projects. The inability to gain insight into complex scientific phenomena using current software tools is a bottleneck facing virtually all endeavors of science. In this paper, we introduce Sunfall, a collaborative visual analytics system developed for the Nearby Supernova Factory, an international astrophysics experiment and the largest data volume supernova search currently in operation. Sunfall utilizes novel interactive visualization and analysis techniques to facilitate deeper scientific insight into complex, noisy, high-dimensional, high-volume, time-critical data. The system combines novel image processing algorithms, statistical analysis, and machine learning with highly interactive visual interfaces to enable collaborative, user-driven scientific exploration of supernova image and spectral data. Sunfall is currently in operation at the Nearby Supernova Factory; it is the first visual analytics system in production use at a major astrophysics project.",Cecilia R. Aragon;Stephen J. Bailey;Sarah S. Poon;Karl J. Runge;Rollin C. Thomas,Cecilia R. Aragon;Stephen J. Bailey;Sarah Poon;Karl J. Runge;Rollin C. Thomas,Lawrence Berkeley National Laboratory. E-Mail: aragon@hpcrd.lbl.gov;Lawrence Berkeley National Laboratory. E-Mail: sjbailey@lbl.gov;Space Sciences Laboratory. E-Mail: sspoon@lbl.gov;Space Sciences Laboratory. E-Mail: kjrunge@lbl.gov;Lawrence Berkeley National Laboratory. E-Mail: rcthomas@lbl.gov,,,9,1,4,
Vis,2007,Shadow-Driven 4D Haptic Visualization,10.1109/TVCG.2007.70593,http://dx.doi.org/10.1109/TVCG.2007.70593,1688,1695,J,"Just as we can work with two-dimensional floor plans to communicate 3D architectural design, we can exploit reduced- dimension shadows to manipulate the higher-dimensional objects generating the shadows. In particular, by taking advantage of physically reactive 3D shadow-space controllers, we can transform the task of interacting with 4D objects to a new level of physical reality. We begin with a teaching tool that uses 2D knot diagrams to manipulate the geometry of 3D mathematical knots via their projections; our unique 2D haptic interface allows the user to become familiar with sketching, editing, exploration, and manipulation of 3D knots rendered as projected images on a 2D shadow space. By combining graphics and collision-sensing haptics, we can enhance the 2D shadow-driven editing protocol to successfully leverage 2D pen-and-paper or blackboard skills. Building on the reduced-dimension 2D editing tool for manipulating 3D shapes, we develop the natural analogy to produce a reduced-dimension 3D tool for manipulating 4D shapes. By physically modeling the correct properties of 4D surfaces, their bending forces, and their collisions in the 3D haptic controller interface, we can support full-featured physical exploration of 4D mathematical objects in a manner that is otherwise far beyond the experience accessible to human beings. As far as we are aware, this paper reports the first interactive system with force-feedback that provides ""4D haptic visualization"" permitting the user to model and interact with 4D cloth-like objects.",Hui Zhang 0006;Andrew J. Hanson,Hui Zhang;Andrew Hanson,"Computer Science Department, Indiana University, Bloomington.;Computer Science Department, Indiana University, Bloomington",10.1109/VISUAL.1996.568120;10.1109/VISUAL.2005.1532804,"knot theory, haptics, visualization",9,13,38,
VAST,2009,"Professional analysts using a large, high-resolution display",10.1109/VAST.2009.5332485,http://dx.doi.org/10.1109/VAST.2009.5332485,,,M,"Professional cyber analysts were observed as they attempted to solve the VAST 2009 Traffic Mini Challenge using basic visualization tools and a large, high-resolution display. We discuss some of the lessons we learned about how analysts actually work and potential roles for visualization and large, high-resolution displays.",Alex Endert;Christopher Andrews;Glenn A. Fink;Chris North 0001,Alex Endert;Christopher Andrews;Glenn A. Fink;Chris North,"Virginia Polytechnic Institute and State University, USA;Virginia Polytechnic Institute and State University, USA;Pacific Northwest National Laboratory, USA;Virginia Polytechnic Institute and State University, USA",,,9,6,2,
Vis,2009,Predictor-Corrector Schemes for Visualization ofSmoothed Particle Hydrodynamics Data,10.1109/TVCG.2009.173,http://dx.doi.org/10.1109/TVCG.2009.173,1243,1250,J,"In this paper we present a method for vortex core line extraction which operates directly on the smoothed particle hydrodynamics (SPH) representation and, by this, generates smoother and more (spatially and temporally) coherent results in an efficient way. The underlying predictor-corrector scheme is general enough to be applied to other line-type features and it is extendable to the extraction of surfaces such as isosurfaces or Lagrangian coherent structures. The proposed method exploits temporal coherence to speed up computation for subsequent time steps. We show how the predictor-corrector formulation can be specialized for several variants of vortex core line definitions including two recent unsteady extensions, and we contribute a theoretical and practical comparison of these. In particular, we reveal a close relation between unsteady extensions of Fuchs et al. and Weinkauf et al. and we give a proof of the Galilean invariance of the latter. When visualizing SPH data, there is the possibility to use the same interpolation method for visualization as has been used for the simulation. This is different from the case of finite volume simulation results, where it is not possible to recover from the results the spatial interpolation that was used during the simulation. Such data are typically interpolated using the basic trilinear interpolant, and if smoothness is required, some artificial processing is added. In SPH data, however, the smoothing kernels are specified from the simulation, and they provide an exact and smooth interpolation of data or gradients at arbitrary points in the domain.",Benjamin Schindler;Raphael Fuchs;John Biddiscombe;Ronald Peikert,Benjamin Schindler;Raphael Fuchs;John Biddiscombe;Ronald Peikert,ETH Zurich;ETH Zurich;CSCS Manno;ETH Zurich,10.1109/VISUAL.1999.809896;10.1109/TVCG.2007.70595;10.1109/VISUAL.2005.1532851;10.1109/VISUAL.1998.745296;10.1109/VISUAL.2004.59;10.1109/TVCG.2007.70545;10.1109/TVCG.2008.164,"Smoothed particle hydrodynamics, flow visualization, unsteady flow, feature extraction, vortex core lines",9,6,27,
Vis,2009,Supercubes: A High-Level Primitive for Diamond Hierarchies,10.1109/TVCG.2009.186,http://dx.doi.org/10.1109/TVCG.2009.186,1603,1610,J,"Volumetric datasets are often modeled using a multiresolution approach based on a nested decomposition of the domain into a polyhedral mesh. Nested tetrahedral meshes generated through the longest edge bisection rule are commonly used to decompose regular volumetric datasets since they produce highly adaptive crack-free representations. Efficient representations for such models have been achieved by clustering the set of tetrahedra sharing a common longest edge into a structure called a diamond. The alignment and orientation of the longest edge can be used to implicitly determine the geometry of a diamond and its relations to the other diamonds within the hierarchy. We introduce the supercube as a high-level primitive within such meshes that encompasses all unique types of diamonds. A supercube is a coherent set of edges corresponding to three consecutive levels of subdivision. Diamonds are uniquely characterized by the longest edge of the tetrahedra forming them and are clustered in supercubes through the association of the longest edge of a diamond with a unique edge in a supercube. Supercubes are thus a compact and highly efficient means of associating information with a subset of the vertices, edges and tetrahedra of the meshes generated through longest edge bisection. We demonstrate the effectiveness of the supercube representation when encoding multiresolution diamond hierarchies built on a subset of the points of a regular grid. We also show how supercubes can be used to efficiently extract meshes from diamond hierarchies and to reduce the storage requirements of such variable-resolution meshes.",Kenneth Weiss 0001;Leila De Floriani,Kenneth Weiss;Leila De Floriani,"University of Maryland, College Park;University of Genova",10.1109/VISUAL.2002.1183810;10.1109/VISUAL.2000.885681;10.1109/VISUAL.2000.885703;10.1109/VISUAL.1997.663860;10.1109/VISUAL.1997.663869,"Longest edge bisection, diamonds, hierarchy of diamonds, multiresolution models, selective refinement",9,7,31,
InfoVis,2010,Visualization of Graph Products,10.1109/TVCG.2010.217,http://dx.doi.org/10.1109/TVCG.2010.217,1082,1089,J,"Graphs are a versatile structure and abstraction for binary relationships between objects. To gain insight into such relationships, their corresponding graph can be visualized. In the past, many classes of graphs have been defined, e.g. trees, planar graphs, directed acyclic graphs, and visualization algorithms were proposed for these classes. Although many graphs may only be classified as ""general"" graphs, they can contain substructures that belong to a certain class. Archambault proposed the TopoLayout framework: rather than draw any arbitrary graph using one method, split the graph into components that are homogeneous with respect to one graph class and then draw each component with an algorithm best suited for this class. Graph products constitute a class that arises frequently in graph theory, but for which no visualization algorithm has been proposed until now. In this paper, we present an algorithm for drawing graph products and the aesthetic criterion graph product's drawings are subject to. We show that the popular High-Dimensional Embedder approach applied to cartesian products already respects this aestetic criterion, but has disadvantages. We also present how our method is integrated as a new component into the TopoLayout framework. Our implementation is used for further research of graph products in a biological context.",Stefan Jänicke;Christian Heine 0002;Marc Hellmuth;Peter F. Stadler;Gerik Scheuermann,Stefan Janicke;Christian Heine;Marc Hellmuth;Peter F. Stadler;Gerik Scheuermann,"Institute for Computer Science, University of Leipzig, Germany;Institute for Computer Science, University of Leipzig, Germany;Institute for Computer Science, University of Leipzig, Germany;Institute for Computer Science, University of Leipzig, Germany;Institute for Computer Science, University of Leipzig, Germany",10.1109/TVCG.2007.70580,"Graph drawing, graph products, TopoLayout",9,8,35,
VAST,2010,Interactive visual analysis of multiobjective optimizations,10.1109/VAST.2010.5651694,http://dx.doi.org/10.1109/VAST.2010.5651694,215,216,M,"Optimization problems are typically addressed by purely automatic approaches. For multi-objective problems, however, a single best solution often does not exist. In this case, it is necessary to analyze trade-offs between many conflicting goals within a given application context. This poster describes an approach that tightly integrates automatic algorithms for multi-objective optimization and interactive multivariate visualizations. Ad-hoc selections support a flexible definition of input data for subsequent algorithms. These algorithms in turn represent their result as derived data attributes that can be assigned to visualizations or be used as a basis for further selections (e.g., to constrain the result set). This enables a guided search that still involves the knowledge of domain experts. We describe our approach in the context of multi-run simulation data from the application domain of car engine design.",Wolfgang Berger;Harald Piringer,Wolfgang Berger;Harald Piringer,"VRVis Research Center, Vienna, Austria;VRVis Research Center, Vienna, Austria",,,9,5,7,
VAST,2010,EmailTime: Visual analytics of emails,10.1109/VAST.2010.5652968,http://dx.doi.org/10.1109/VAST.2010.5652968,233,234,M,"Although the discovery and analysis of communication patterns in large and complex email datasets are difficult tasks, they can be a valuable source of information. This paper presents EmailTime's capabilities through several examples. EmailTime is a visual analysis of email correspondence patterns over the course of time that interactively portrays personal and interpersonal networks using the correspondence in the email dataset. We suggest that integrating both statistics and visualizations in order to display information about the email datasets may simplify its evaluation.",Minoo Erfani Joorabchi;Ji-Dong Yim;Chris Shaw 0002,Minoo Erfani Joorabchi;Ji-Dong Yim;Christopher D. Shaw,Simon Fraser University;Simon Fraser University;Simon Fraser University,,"Email, Enron, EmailTime, Email Correspondents, Visual Analysis",9,4,2,
VAST,2010,Comparing different levels of interaction constraints for deriving visual problem isomorphs,10.1109/VAST.2010.5653599,http://dx.doi.org/10.1109/VAST.2010.5653599,195,202,C,"Interaction and manual manipulation have been shown in the cognitive science literature to play a critical role in problem solving. Given different types of interactions or constraints on interactions, a problem can appear to have different degrees of difficulty. While this relationship between interaction and problem solving has been well studied in the cognitive science literatures, the visual analytics community has yet to exploit this understanding for analytical problem solving. In this paper, we hypothesize that constraints on interactions and constraints encoded in visual representations can lead to strategies of varying effectiveness during problem solving. To test our hypothesis, we conducted a user study in which participants were given different levels of interaction constraints when solving a simple math game called Number Scrabble. Number Scrabble is known to have an optimal visual problem isomorph, and the goal of this study is to learn if and how the participants could derive the isomorph and to analyze the strategies that the participants utilize in solving the problem. Our results indicate that constraints on interactions do affect problem solving, and that while the optimal visual isomorph is difficult to derive, certain interaction constraints can lead to a higher chance of deriving the isomorph.",Wenwen Dou;Caroline Ziemkiewicz;Lane Harrison;Dong Hyun Jeong;Roxanne Ryan;William Ribarsky;Derek Xiaoyu Wang;Remco Chang,Wenwen Dou;Caroline Ziemkiewicz;Lane Harrison;Dong Hyun Jeong;Roxanne Ryan;William Ribarsky;Xiaoyu Wang;Remco Chang,University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte;University of North Carolina at Charlotte,10.1109/TVCG.2007.70515;10.1109/TVCG.2008.121,"Interaction, Visual Isomorph, Problem Solving",9,4,21,
VAST,2011,Analysis of large digital collections with interactive visualization,10.1109/VAST.2011.6102462,http://dx.doi.org/10.1109/VAST.2011.6102462,241,250,C,"To make decisions about the long-term preservation and access of large digital collections, archivists gather information such as the collections' contents, their organizational structure, and their file format composition. To date, the process of analyzing a collection - from data gathering to exploratory analysis and final conclusions - has largely been conducted using pen and paper methods. To help archivists analyze large-scale digital collections for archival purposes, we developed an interactive visual analytics application. The application narrows down different kinds of information about the collection, and presents them as meaningful data views. Multiple views and analysis features can be linked or unlinked on demand to enable researchers to compare and contrast different analyses, and to identify trends. We describe and present two user scenarios to show how the application allowed archivists to learn about a collection with accuracy, facilitated decision-making, and helped them arrive at conclusions.",Weijia Xu;Maria Esteva;Suyog Dott Jain;Varun Jain,Weijia Xu;Maria Esteva;Suyog Dutt Jain;Varun Jain,"The University of Texas at Austin, USA;The University of Texas at Austin, USA;The University of Texas at Austin, USA;The University of Texas at Austin, USA",10.1109/INFVIS.2000.885091;10.1109/TVCG.2008.172;10.1109/TVCG.2009.176;10.1109/VAST.2007.4389006;10.1109/INFVIS.2004.64;10.1109/VAST.2010.5652931;10.1109/INFVIS.1999.801860,"Digital collections, archival analysis, visual anaytics, data curation",9,7,34,
Vis,2011,Visualization of Topological Structures in Area-Preserving Maps,10.1109/TVCG.2011.254,http://dx.doi.org/10.1109/TVCG.2011.254,1765,1774,J,"Area-preserving maps are found across a wide range of scientific and engineering problems. Their study is made challenging by the significant computational effort typically required for their inspection but more fundamentally by the fractal complexity of salient structures. The visual inspection of these maps reveals a remarkable topological picture consisting of fixed (or periodic) points embedded in so-called island chains, invariant manifolds, and regions of ergodic behavior. This paper is concerned with the effective visualization and precise topological analysis of area-preserving maps with two degrees of freedom from numerical or analytical data. Specifically, a method is presented for the automatic extraction and characterization of fixed points and the computation of their invariant manifolds, also known as separatrices, to yield a complete picture of the structures present within the scale and complexity bounds selected by the user. This general approach offers a significant improvement over the visual representations that are so far available for area-preserving maps. The technique is demonstrated on a numerical simulation of magnetic confinement in a fusion reactor.",Xavier Tricoche;Christoph Garth;Allen R. Sanderson,Xavier Tricoche;Christoph Garth;Allen Sanderson,Purdue University;UC Davis;University of Utah,10.1109/VISUAL.2005.1532839;10.1109/VISUAL.2003.1250376;10.1109/VISUAL.2004.107;10.1109/VISUAL.2000.885716;10.1109/TVCG.2007.70601;10.1109/TVCG.2010.133;10.1109/VISUAL.2005.1532770;10.1109/VISUAL.2002.1183786;10.1109/VISUAL.1994.346326,"Poincare map, dynamical systems, topology, chaos, area-preserving maps, invariant manifolds",9,12,52,
SciVis,2012,A Data-Driven Approach to Hue-Preserving Color-Blending,10.1109/TVCG.2012.186,http://dx.doi.org/10.1109/TVCG.2012.186,2122,2129,J,"Color mapping and semitransparent layering play an important role in many visualization scenarios, such as information visualization and volume rendering. The combination of color and transparency is still dominated by standard alpha-compositing using the Porter-Duff over operator which can result in false colors with deceiving impact on the visualization. Other more advanced methods have also been proposed, but the problem is still far from being solved. Here we present an alternative to these existing methods specifically devised to avoid false colors and preserve visual depth ordering. Our approach is data driven and follows the recently formulated knowledge-assisted visualization (KAV) paradigm. Preference data, that have been gathered in web-based user surveys, are used to train a support-vector machine model for automatically predicting an optimized hue-preserving blending. We have applied the resulting model to both volume rendering and a specific information visualization technique, illustrative parallel coordinate plots. Comparative renderings show a significant improvement over previous approaches in the sense that false colors are completely removed and important properties such as depth ordering and blending vividness are better preserved. Due to the generality of the defined data-driven blending operator, it can be easily integrated also into other visualization frameworks.",Lars Kuehne;Joachim Giesen;Zhiyuan Zhang;Sungsoo Ha;Klaus Mueller,Lars Kühne;Joachim Giesen;Zhiyuan Zhang;Sungsoo Ha;Klaus Mueller,Friedrich-Schiller-Universität Jena;Friedrich-Schiller-Universität Jena;Stony Brook University;Stony Brook University;Stony Brook University,10.1109/TVCG.2009.150;10.1109/TVCG.2008.118;10.1109/TVCG.2007.70623;10.1109/TVCG.2012.234;10.1109/VISUAL.2003.1250362,"Color blending, hue preservation, knowledge-assisted visualization, volume rendering, parallel coordinates",9,10,24,
SciVis,2013,A Multi-Criteria Approach to Camera Motion Design for Volume Data Animation,10.1109/TVCG.2013.123,http://dx.doi.org/10.1109/TVCG.2013.123,2792,2801,J,"We present an integrated camera motion design and path generation system for building volume data animations. Creating animations is an essential task in presenting complex scientific visualizations. Existing visualization systems use an established animation function based on keyframes selected by the user. This approach is limited in providing the optimal in-between views of the data. Alternatively, computer graphics and virtual reality camera motion planning is frequently focused on collision free movement in a virtual walkthrough. For semi-transparent, fuzzy, or blobby volume data the collision free objective becomes insufficient. Here, we provide a set of essential criteria focused on computing camera paths to establish effective animations of volume data. Our dynamic multi-criteria solver coupled with a force-directed routing algorithm enables rapid generation of camera paths. Once users review the resulting animation and evaluate the camera motion, they are able to determine how each criterion impacts path generation. In this paper, we demonstrate how incorporating this animation approach with an interactive volume visualization system reduces the effort in creating context-aware and coherent animations. This frees the user to focus on visualization tasks with the objective of gaining additional insight from the volume data.",Wei-Hsien Hsu;Yubo Zhang;Kwan-Liu Ma,Wei-Hsien Hsu;Yubo Zhang;Kwan-Liu Ma,"University of California, Davis;University of California, Davis;University of California, Davis",10.1109/TVCG.2006.152;10.1109/TVCG.2006.140;10.1109/TVCG.2009.189;10.1109/INFVIS.2003.1249004;10.1109/VISUAL.2005.1532834;10.1109/TVCG.2012.292;10.1109/VISUAL.2005.1532787;10.1109/VISUAL.2005.1532833;10.1109/VISUAL.2001.964517,"Camera motion planning, volume rendering, visualization, animation",9,7,39,
SciVis,2013,Colon Flattening Using Heat Diffusion Riemannian Metric,10.1109/TVCG.2013.139,http://dx.doi.org/10.1109/TVCG.2013.139,2848,2857,J,"We propose a new colon flattening algorithm that is efficient, shape-preserving, and robust to topological noise. Unlike previous approaches, which require a mandatory topological denoising to remove fake handles, our algorithm directly flattens the colon surface without any denoising. In our method, we replace the original Euclidean metric of the colon surface with a heat diffusion metric that is insensitive to topological noise. Using this heat diffusion metric, we then solve a Laplacian equation followed by an integration step to compute the final flattening. We demonstrate that our method is shape-preserving and the shape of the polyps are well preserved. The flattened colon also provides an efficient way to enhance the navigation and inspection in virtual colonoscopy. We further show how the existing colon registration pipeline is made more robust by using our colon flattening. We have tested our method on several colon wall surfaces and the experimental results demonstrate the robustness and the efficiency of our method.",Krishna Chaitanya Gurijala;Rui Shi;Wei Zeng 0002;Xianfeng Gu;Arie E. Kaufman,Krishna Chaitanya Gurijala;Rui Shi;Wei Zeng;Xianfeng Gu;Arie Kaufman,Stony Brook University;Stony Brook University;Florida International University;Stony Brook University;Stony Brook University,10.1109/VISUAL.2001.964540;10.1109/TVCG.2006.112;10.1109/VISUAL.2001.964540;10.1109/TVCG.2010.200,"Colon flattening, heat diffusion, virtual colonoscopy, volume rendering, topological noise, shape-preserving mapping",9,11,46,
VAST,2013,Visual Analysis of Higher-Order Conjunctive Relationships in Multidimensional Data Using a Hypergraph Query System,10.1109/TVCG.2013.220,http://dx.doi.org/10.1109/TVCG.2013.220,2070,2079,J,"Visual exploration and analysis of multidimensional data becomes increasingly difficult with increasing dimensionality. We want to understand the relationships between dimensions of data, but lack flexible techniques for exploration beyond low-order relationships. Current visual techniques for multidimensional data analysis focus on binary conjunctive relationships between dimensions. Recent techniques, such as cross-filtering on an attribute relationship graph, facilitate the exploration of some higher-order conjunctive relationships, but require a great deal of care and precision to do so effectively. This paper provides a detailed analysis of the expressive power of existing visual querying systems and describes a more flexible approach in which users can explore n-ary conjunctive inter- and intra- dimensional relationships by interactively constructing queries as visual hypergraphs. In a hypergraph query, nodes represent subsets of values and hyperedges represent conjunctive relationships. Analysts can dynamically build and modify the query using sequences of simple interactions. The hypergraph serves not only as a query specification, but also as a compact visual representation of the interactive state. Using examples from several domains, focusing on the digital humanities, we describe the design considerations for developing the querying system and incorporating it into visual analysis tools. We analyze query expressiveness with regard to the kinds of questions it can and cannot pose, and describe how it simultaneously expands the expressiveness of and is complemented by cross-filtering.",Rachel Shadoan;Chris Weaver,Rachel Shadoan;Chris Weaver,Akashic Labs LLC;School of Computer Science and the Center for Spatial Analysis at University of Oklahoma,10.1109/TVCG.2006.160;10.1109/INFVIS.2004.12;10.1109/VAST.2011.6102440;10.1109/VAST.2007.4389006;10.1109/TVCG.2006.166;10.1109/VAST.2010.5652520,"Graph search, graph query language, multidimensional data, attribute relationship graphs, multivariate data analysis, higher-order conjunctive queries, visual query language, digital humanities",9,9,30,
VAST,2013,Visual Analytics for Spatial Clustering: Using a Heuristic Approach for Guided Exploration,10.1109/TVCG.2013.224,http://dx.doi.org/10.1109/TVCG.2013.224,2179,2188,J,"We propose a novel approach of distance-based spatial clustering and contribute a heuristic computation of input parameters for guiding users in the search of interesting cluster constellations. We thereby combine computational geometry with interactive visualization into one coherent framework. Our approach entails displaying the results of the heuristics to users, as shown in Figure 1, providing a setting from which to start the exploration and data analysis. Addition interaction capabilities are available containing visual feedback for exploring further clustering options and is able to cope with noise in the data. We evaluate, and show the benefits of our approach on a sophisticated artificial dataset and demonstrate its usefulness on real-world data.",Eli Packer;Peter Bak;Mikko Nikkilä;Valentin Polishchuk;Harold J. Ship,Eli Packer;Peter Bak;Mikko Nikkilä;Valentin Polishchuk;Harold J. Ship,"IBM Research – Haifa / Israel, Smarter Decision Solutions Group;IBM Research – Haifa / Israel, Smarter Decision Solutions Group;Helsinki Institute for Information Technology, Computer Science Department, University of Helsinki, Finland;Helsinki Institute for Information Technology, Computer Science Department, University of Helsinki, Finland;IBM Research – Haifa / Israel, Smarter Decision Solutions Group",10.1109/VAST.2011.6102449;10.1109/INFVIS.2003.1249015;10.1109/VAST.2012.6400486;10.1109/TVCG.2009.122;10.1109/VAST.2010.5652443;10.1109/TVCG.2011.186,"Heuristic-based spatial clustering, interactive visual clustering, k-order a-(alpha)-shapes",9,9,38,
InfoVis,2014,GLO-STIX: Graph-Level Operations for Specifying Techniques and Interactive eXploration,10.1109/TVCG.2014.2346444,http://dx.doi.org/10.1109/TVCG.2014.2346444,2320,2328,J,"The field of graph visualization has produced a wealth of visualization techniques for accomplishing a variety of analysis tasks. Therefore analysts often rely on a suite of different techniques, and visual graph analysis application builders strive to provide this breadth of techniques. To provide a holistic model for specifying network visualization techniques (as opposed to considering each technique in isolation) we present the Graph-Level Operations (GLO) model. We describe a method for identifying GLOs and apply it to identify five classes of GLOs, which can be flexibly combined to re-create six canonical graph visualization techniques. We discuss advantages of the GLO model, including potentially discovering new, effective network visualization techniques and easing the engineering challenges of building multi-technique graph visualization applications. Finally, we implement the GLOs that we identified into the GLO-STIX prototype system that enables an analyst to interactively explore a graph by applying GLOs.",Charles D. Stolper;Minsuk Kahng;Zhiyuan Lin 0001;Florian Foerster;Aakash Goel;John T. Stasko;Duen Horng Chau,Charles D. Stolper;Minsuk Kahng;Zhiyuan Lin;Florian Foerster;Aakash Goel;John Stasko;Duen Horng Chau,"College of Computing, Georgia Institute of Technology;College of Computing, Georgia Institute of Technology;College of Computing, Georgia Institute of Technology;College of Computing, Georgia Institute of Technology;College of Computing, Georgia Institute of Technology;College of Computing, Georgia Institute of Technology;College of Computing, Georgia Institute of Technology",10.1109/TVCG.2008.137;10.1109/VAST.2011.6102441;10.1109/TVCG.2010.144;10.1109/TVCG.2008.135;10.1109/TVCG.2007.70582;10.1109/VAST.2011.6102440;10.1109/INFVIS.2002.1173155;10.1109/TVCG.2006.147;10.1109/TVCG.2010.205;10.1109/INFVIS.1997.636793;10.1109/TVCG.2011.233;10.1109/TVCG.2011.185;10.1109/TVCG.2006.166;10.1109/TVCG.2009.108;10.1109/TVCG.2013.192,"Graph-level operations, graph visualization, visualization technique specification, graph analysis, information visualization",9,8,30,
VAST,2014,VASA: Interactive Computational Steering of Large Asynchronous Simulation Pipelines for Societal Infrastructure,10.1109/TVCG.2014.2346911,http://dx.doi.org/10.1109/TVCG.2014.2346911,1853,1862,J,"We present VASA, a visual analytics platform consisting of a desktop application, a component model, and a suite of distributed simulation components for modeling the impact of societal threats such as weather, food contamination, and traffic on critical infrastructure such as supply chains, road networks, and power grids. Each component encapsulates a high-fidelity simulation model that together form an asynchronous simulation pipeline: a system of systems of individual simulations with a common data and parameter exchange format. At the heart of VASA is the Workbench, a visual analytics application providing three distinct features: (1) low-fidelity approximations of the distributed simulation components using local simulation proxies to enable analysts to interactively configure a simulation run; (2) computational steering mechanisms to manage the execution of individual simulation components; and (3) spatiotemporal and interactive methods to explore the combined results of a simulation run. We showcase the utility of the platform using examples involving supply chains during a hurricane as well as food contamination in a fast food restaurant chain.",Sungahn Ko;Jieqiong Zhao;Jing Xia;Shehzad Afzal;Derek Xiaoyu Wang;Greg Abram;Niklas Elmqvist;Len Kne;David Van Riper;Kelly P. Gaither;Shaun Kennedy;William J. Tolone;William Ribarsky;David S. Ebert,Sungahn Ko;Shaun Kennedy;William Tolone;William Ribarsky;David S. Ebert;Jieqiong Zhao;Jing Xia;Shehzad Afzal;Xiaoyu Wang;Greg Abram;Niklas Elmqvist;Len Kne;David Van Riper;Kelly Gaither,"Purdue University in West Lafayette, IN, USA;University of Minnesota in Minneapolis, MN, USA;University of North Carolina at Charlotte in Charlotte, NC, USA;University of North Carolina at Charlotte in Charlotte, NC, USA;Purdue University in West Lafayette, IN, USA;Purdue University in West Lafayette, IN, USA;State Key Lab of CAD&CG, China;Purdue University in West Lafayette, IN, USA;University of North Carolina at Charlotte in Charlotte, NC, USA;University of Texas at Austin in Austin, TX, USA;Purdue University in West Lafayette, IN, USA;University of Minnesota in Minneapolis, MN, USA;University of Minnesota in Minneapolis, MN, USA;University of Texas at Austin in Austin, TX, USA",10.1109/INFVIS.2000.885098;10.1109/TVCG.2011.225;10.1109/TVCG.2012.260;10.1109/TVCG.2007.70541;10.1109/TVCG.2010.223;10.1109/TVCG.2013.146;10.1109/TVCG.2010.171;10.1109/VAST.2011.6102460;10.1109/VAST.2011.6102457,"Computational steering, visual analytics, critical infrastructure, homeland security",9,8,42,
VAST,2014,Weaving a Carpet from Log Entries: A Network Security Visualization Built with Co-Creation,10.1109/VAST.2014.7042483,http://dx.doi.org/10.1109/VAST.2014.7042483,73,82,C,"We created a pixel map for multivariate data based on an analysis of the needs of network security engineers. Parameters of a log record are shown as pixels and these pixels are stacked to represent a record. This allows a broad view of a data set on one screen while staying very close to the raw data and to expose common and rare patterns of user behavior through the visualization itself (the ""Carpet""). Visualizations that immediately point to areas of suspicious activity without requiring extensive filtering, help network engineers investigating unknown computer security incidents. Most of them, however, have limited knowledge of advanced visualization techniques, while many designers and data scientists are unfamiliar with computer security topics. To bridge this gap, we developed visualizations together with engineers, following a co-creative process. We will show how we explored the scope of the engineers' tasks and how we jointly developed ideas and designs. Our expert evaluation indicates that this visualization helps to scan large parts of log files quickly and to define areas of interest for closer inspection.",Johannes Landstorfer;Ivo Herrmann;Jan-Erik Stange;Marian Dörk;Reto Wettach,Johannes Landstorfer;Ivo Herrmann;Jan-Erik Stange;Marian Dörk;Reto Wettach,"Department of Design at the University of Applied Sciences Potsdam, Germany;Department of Design at the University of Applied Sciences Potsdam, Germany;Department of Design at the University of Applied Sciences Potsdam, Germany;Department of Design at the University of Applied Sciences Potsdam, Germany;Department of Design at the University of Applied Sciences Potsdam, Germany",10.1109/TVCG.2006.160;10.1109/INFVIS.2005.1532134;10.1109/VISUAL.1991.175795;10.1109/VAST.2006.261436;10.1109/TVCG.2009.111;10.1109/INFVIS.1995.528685,"Pixel-oriented techniques, task and requirements analysis, multidimensional data, network security and intrusion",9,9,35,
InfoVis,2015,AggreSet: Rich and Scalable Set Exploration using Visualizations of Element Aggregations,10.1109/TVCG.2015.2467051,http://dx.doi.org/10.1109/TVCG.2015.2467051,688,697,J,"Datasets commonly include multi-value (set-typed) attributes that describe set memberships over elements, such as genres per movie or courses taken per student. Set-typed attributes describe rich relations across elements, sets, and the set intersections. Increasing the number of sets results in a combinatorial growth of relations and creates scalability challenges. Exploratory tasks (e.g. selection, comparison) have commonly been designed in separation for set-typed attributes, which reduces interface consistency. To improve on scalability and to support rich, contextual exploration of set-typed data, we present AggreSet. AggreSet creates aggregations for each data dimension: sets, set-degrees, set-pair intersections, and other attributes. It visualizes the element count per aggregate using a matrix plot for set-pair intersections, and histograms for set lists, set-degrees and other attributes. Its non-overlapping visual design is scalable to numerous and large sets. AggreSet supports selection, filtering, and comparison as core exploratory tasks. It allows analysis of set relations inluding subsets, disjoint sets and set intersection strength, and also features perceptual set ordering for detecting patterns in set matrices. Its interaction is designed for rich and rapid data exploration. We demonstrate results on a wide range of datasets from different domains with varying characteristics, and report on expert reviews and a case study using student enrollment and degree data with assistant deans at a major public university.",Mehmet Adil Yalçin;Niklas Elmqvist;Benjamin B. Bederson,M. Adil Yalçin;Niklas Elmqvist;Benjamin B. Bederson,"University of Maryland, College Park;University of Maryland, College Park;University of Maryland, College Park",10.1109/TVCG.2011.186;10.1109/TVCG.2013.184;10.1109/TVCG.2011.185;10.1109/TVCG.2009.122;10.1109/TVCG.2007.70535;10.1109/TVCG.2008.144;10.1109/INFVIS.2004.1;10.1109/TVCG.2007.70539;10.1109/TVCG.2008.141;10.1109/TVCG.2014.2346248;10.1109/TVCG.2010.210;10.1109/TVCG.2014.2346249,"Multi-valued attributes, sets, visualization, set visualization, data exploration, interaction, design, scalability",9,7,36,
InfoVis,2015,Orientation-Enhanced Parallel Coordinate Plots,10.1109/TVCG.2015.2467872,http://dx.doi.org/10.1109/TVCG.2015.2467872,589,598,J,"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.",Renata G. Raidou;Martin Eisemann;Marcel Breeuwer;Elmar Eisemann;Anna Vilanova,Renata Georgia Raidou;Martin Eisemann;Marcel Breeuwer;Elmar Eisemann;Anna Vilanova,Eindhoven University of Technology;Delft University of Technology;Eindhoven University of Technology;Delft University of Technology;Delft University of Technology,10.1109/INFVIS.1998.729559;10.1109/INFVIS.2004.68;10.1109/TVCG.2006.138;10.1109/TVCG.2007.70535;10.1109/INFVIS.2005.1532141;10.1109/VISUAL.1999.809866;10.1109/TVCG.2011.166;10.1109/TVCG.2014.2346979;10.1109/INFVIS.2002.1173157;10.1109/INFVIS.2005.1532138;10.1109/TVCG.2009.153;10.1109/VISUAL.1995.485139;10.1109/TVCG.2006.170;10.1109/INFVIS.2004.15;10.1109/VISUAL.1994.346302;10.1109/INFVIS.2003.1249008;10.1109/VISUAL.1996.567800;10.1109/INFVIS.2003.1249015;10.1109/TVCG.2009.179,"Parallel Coordinates, Orientation-enhanced Parallel Coordinates, Brushing, Orientation-enhanced Brushing, Data Readability, Data Selection",9,13,45,
SciVis,2015,Visualizing Tensor Normal Distributions at Multiple Levels of Detail,10.1109/TVCG.2015.2467031,http://dx.doi.org/10.1109/TVCG.2015.2467031,975,984,J,"Despite the widely recognized importance of symmetric second order tensor fields in medicine and engineering, the visualization of data uncertainty in tensor fields is still in its infancy. A recently proposed tensorial normal distribution, involving a fourth order covariance tensor, provides a mathematical description of how different aspects of the tensor field, such as trace, anisotropy, or orientation, vary and covary at each point. However, this wealth of information is far too rich for a human analyst to take in at a single glance, and no suitable visualization tools are available. We propose a novel approach that facilitates visual analysis of tensor covariance at multiple levels of detail. We start with a visual abstraction that uses slice views and direct volume rendering to indicate large-scale changes in the covariance structure, and locations with high overall variance. We then provide tools for interactive exploration, making it possible to drill down into different types of variability, such as in shape or orientation. Finally, we allow the analyst to focus on specific locations of the field, and provide tensor glyph animations and overlays that intuitively depict confidence intervals at those points. Our system is demonstrated by investigating the effects of measurement noise on diffusion tensor MRI, and by analyzing two ensembles of stress tensor fields from solid mechanics.",Amin Abbasloo;Vitalis Wiens;Max Hermann;Thomas Schultz 0001,Amin Abbasloo;Vitalis Wiens;Max Hermann;Thomas Schultz,University of Bonn;University of Bonn;University of Bonn;University of Bonn,10.1109/TVCG.2009.170;10.1109/TVCG.2009.184;10.1109/VISUAL.2005.1532773;10.1109/TVCG.2006.181;10.1109/TVCG.2006.134;10.1109/TVCG.2010.199;10.1109/TVCG.2008.128;10.1109/TVCG.2007.70602;10.1109/TVCG.2015.2467435,"Uncertainty visualization, tensor visualization, direct volume rendering, interaction, glyph based visualization",9,10,60,
SciVis,2015,Accurate Interactive Visualization of Large Deformations and Variability in Biomedical Image Ensembles,10.1109/TVCG.2015.2467198,http://dx.doi.org/10.1109/TVCG.2015.2467198,708,717,J,"Large image deformations pose a challenging problem for the visualization and statistical analysis of 3D image ensembles which have a multitude of applications in biology and medicine. Simple linear interpolation in the tangent space of the ensemble introduces artifactual anatomical structures that hamper the application of targeted visual shape analysis techniques. In this work we make use of the theory of stationary velocity fields to facilitate interactive non-linear image interpolation and plausible extrapolation for high quality rendering of large deformations and devise an efficient image warping method on the GPU. This does not only improve quality of existing visualization techniques, but opens up a field of novel interactive methods for shape ensemble analysis. Taking advantage of the efficient non-linear 3D image warping, we showcase four visualizations: 1) browsing on-the-fly computed group mean shapes to learn about shape differences between specific classes, 2) interactive reformation to investigate complex morphologies in a single view, 3) likelihood volumes to gain a concise overview of variability and 4) streamline visualization to show variation in detail, specifically uncovering its component tangential to a reference surface. Evaluation on a real world dataset shows that the presented method outperforms the state-of-the-art in terms of visual quality while retaining interactive frame rates. A case study with a domain expert was performed in which the novel analysis and visualization methods are applied on standard model structures, namely skull and mandible of different rodents, to investigate and compare influence of phylogeny, diet and geography on shape. The visualizations enable for instance to distinguish (population-)normal and pathological morphology, assist in uncovering correlation to extrinsic factors and potentially support assessment of model quality.",Max Hermann;Anja C. Schunke;Thomas Schultz 0001;Reinhard Klein,Max Hermann;Anja C. Schunke;Thomas Schultz;Reinhard Klein,"Institut für Informatik II;Max Planck Institute for Evolutionary Biology, Pl&#x00F6;n;Institut für Informatik II;Institut für Informatik II",10.1109/TVCG.2006.140;10.1109/VISUAL.2002.1183754;10.1109/TVCG.2014.2346591;10.1109/TVCG.2014.2346405;10.1109/TVCG.2006.123,"Statistical deformation model, stationary velocity fields, image warping, interactive visual analysis",9,11,46,
SciVis,2015,Mining Graphs for Understanding Time-Varying Volumetric Data,10.1109/TVCG.2015.2468031,http://dx.doi.org/10.1109/TVCG.2015.2468031,965,974,J,"A notable recent trend in time-varying volumetric data analysis and visualization is to extract data relationships and represent them in a low-dimensional abstract graph view for visual understanding and making connections to the underlying data. Nevertheless, the ever-growing size and complexity of data demands novel techniques that go beyond standard brushing and linking to allow significant reduction of cognition overhead and interaction cost. In this paper, we present a mining approach that automatically extracts meaningful features from a graph-based representation for exploring time-varying volumetric data. This is achieved through the utilization of a series of graph analysis techniques including graph simplification, community detection, and visual recommendation. We investigate the most important transition relationships for time-varying data and evaluate our solution with several time-varying data sets of different sizes and characteristics. For gaining insights from the data, we show that our solution is more efficient and effective than simply asking users to extract relationships via standard interaction techniques, especially when the data set is large and the relationships are complex. We also collect expert feedback to confirm the usefulness of our approach.",Yi Gu;Chaoli Wang 0001;Tom Peterka;Robert L. Jacob;Seung Hyun Kim,Yi Gu;Chaoli Wang;Tom Peterka;Robert Jacob;Seung Hyun Kim,"Department Computer Science and Engineering, University of Notre Dame, Notre Dame, IN;Department Computer Science and Engineering, University of Notre Dame, Notre Dame, IN;Division of Mathematics and Computer Science, Argonne National Laboratory, Argonne, IL;Division of Mathematics and Computer Science, Argonne National Laboratory, Argonne, IL;Department of Mechanical and Aerospace Engineering, The Ohio State University, Columbus, OH",10.1109/TVCG.2009.122;10.1109/TVCG.2013.151;10.1109/TVCG.2011.246;10.1109/TVCG.2008.116;10.1109/VISUAL.1999.809871;10.1109/TVCG.2006.165;10.1109/TVCG.2009.165;10.1109/TVCG.2006.159,"Time-varying data visualization, graph simplification, community detection, visual recommendation",9,12,28,
InfoVis,2016,PowerSet: A Comprehensive Visualization of Set Intersections,10.1109/TVCG.2016.2598496,http://dx.doi.org/10.1109/TVCG.2016.2598496,361,370,J,"When analyzing a large amount of data, analysts often define groups over data elements that share certain properties. Using these groups as the unit of analysis not only reduces the data volume, but also allows detecting various patterns in the data. This involves analyzing intersection relations between these groups, and how the element attributes vary between these intersections. This kind of set-based analysis has various applications in a variety of domains, due to the generic and powerful notion of sets. However, visualizing intersections relations is challenging because their number grows exponentially with the number of sets. We present a novel technique based on Treemaps to provide a comprehensive overview of non-empty intersections in a set system in a scalable way. It enables gaining insight about how elements are distributed across these intersections as well as performing fine-grained analysis to explore and compare their attributes both in overview and in detail. Interaction allows querying and filtering these elements based on their set memberships. We demonstrate how our technique supports various use cases in data exploration and analysis by providing insights into set-based data, beyond the limits of state-of-the-art techniques.",Bilal Alsallakh;Ren Liu,Bilal Alsallakh;Liu Ren,BOSCH Research;BOSCH Research,10.1109/TVCG.2014.2346248;10.1109/TVCG.2015.2467051;10.1109/TVCG.2006.142;10.1109/INFVIS.2001.963283;10.1109/TVCG.2010.186;10.1109/VISUAL.1991.175815;10.1109/TVCG.2012.233;10.1109/VISUAL.1993.398863;10.1109/TVCG.2011.227;10.1109/TVCG.2009.122;10.1109/TVCG.2014.2346249;10.1109/TVCG.2012.205;10.1109/TVCG.2008.144;10.1109/TVCG.2011.185;10.1109/TVCG.2013.184;10.1109/TVCG.2011.186,scalability;Set visualization;treemaps;interaction,9,13,47,
SciVis,2016,PelVis: Atlas-based Surgical Planning for Oncological Pelvic Surgery,10.1109/TVCG.2016.2598826,http://dx.doi.org/10.1109/TVCG.2016.2598826,741,750,J,"Due to the intricate relationship between the pelvic organs and vital structures, such as vessels and nerves, pelvic anatomy is often considered to be complex to comprehend. In oncological pelvic surgery, a trade-off has to be made between complete tumor resection and preserving function by preventing damage to the nerves. Damage to the autonomic nerves causes undesirable post-operative side-effects such as fecal and urinal incontinence, as well as sexual dysfunction in up to 80 percent of the cases. Since these autonomic nerves are not visible in pre-operative MRI scans or during surgery, avoiding nerve damage during such a surgical procedure becomes challenging. In this work, we present visualization methods to represent context, target, and risk structures for surgical planning. We employ distance-based and occlusion management techniques in an atlas-based surgical planning tool for oncological pelvic surgery. Patient-specific pre-operative MRI scans are registered to an atlas model that includes nerve information. Through several interactive linked views, the spatial relationships and distances between the organs, tumor and risk zones are visualized to improve understanding, while avoiding occlusion. In this way, the surgeon can examine surgically relevant structures and plan the procedure before going into the operating theater, thus raising awareness of the autonomic nerve zone regions and potentially reducing post-operative complications. Furthermore, we present the results of a domain expert evaluation with surgical oncologists that demonstrates the advantages of our approach.",Noeska N. Smit;Kai Lawonn;Annelot Kraima;Marco C. DeRuiter;Hessam Sokooti;Stefan Bruckner;Elmar Eisemann;Anna Vilanova,Noeska Smit;Kai Lawonn;Annelot Kraima;Marco DeRuiter;Hessam Sokooti;Stefan Bruckner;Elmar Eisemann;Anna Vilanova,"Delft University of TechnologyUniversity of Bergen;University of Koblenz, Landau;Leiden University Medical Center;Leiden University Medical Center;Leiden University Medical Center;University of Bergen;Delft University of Technology;Delft University of Technology",10.1109/TVCG.2008.180;10.1109/VISUAL.2002.1183769;10.1109/TVCG.2011.207;10.1109/TVCG.2015.2467961;10.1109/TVCG.2011.189;10.1109/TVCG.2013.143;10.1109/VISUAL.2003.1250400,Atlas;surgical planning;medical visualization,9,9,51,
SciVis,2016,Decal-Maps: Real-Time Layering of Decals on Surfaces for Multivariate Visualization,10.1109/TVCG.2016.2598866,http://dx.doi.org/10.1109/TVCG.2016.2598866,821,830,J,"We introduce the use of decals for multivariate visualization design. Decals are visual representations that are used for communication; for example, a pattern, a text, a glyph, or a symbol, transferred from a 2D-image to a surface upon contact. By creating what we define as decal-maps, we can design a set of images or patterns that represent one or more data attributes. We place decals on the surface considering the data pertaining to the locations we choose. We propose a (texture mapping) local parametrization that allows placing decals on arbitrary surfaces interactively, even when dealing with a high number of decals. Moreover, we extend the concept of layering to allow the co-visualization of an increased number of attributes on arbitrary surfaces. By combining decal-maps, color-maps and a layered visualization, we aim to facilitate and encourage the creative process of designing multivariate visualizations. Finally, we demonstrate the general applicability of our technique by providing examples of its use in a variety of contexts.",Allan Rocha;Usman R. Alim;Julio Daniel Silva;Mario Costa Sousa,Allan Rocha;Usman Alim;Julio Daniel Silva;Mario Costa Sousa,University of Calgary;University of Calgary;University of Calgary;University of Calgary,10.1109/VISUAL.1991.175811;10.1109/TVCG.2010.181;10.1109/TVCG.2011.243;10.1109/VISUAL.1998.745294;10.1109/TVCG.2015.2467153;10.1109/VISUAL.2003.1250362;10.1109/VISUAL.1999.809905;10.1109/TVCG.2011.170,Multivariate;Visualization;Real-time;Decal;Surface;Layering;Design,9,8,60,
VAST,2016,NameClarifier: A Visual Analytics System for Author Name Disambiguation,10.1109/TVCG.2016.2598465,http://dx.doi.org/10.1109/TVCG.2016.2598465,141,150,J,"In this paper, we present a novel visual analytics system called NameClarifier to interactively disambiguate author names in publications by keeping humans in the loop. Specifically, NameClarifier quantifies and visualizes the similarities between ambiguous names and those that have been confirmed in digital libraries. The similarities are calculated using three key factors, namely, co-authorships, publication venues, and temporal information. Our system estimates all possible allocations, and then provides visual cues to users to help them validate every ambiguous case. By looping users in the disambiguation process, our system can achieve more reliable results than general data mining models for highly ambiguous cases. In addition, once an ambiguous case is resolved, the result is instantly added back to our system and serves as additional cues for all the remaining unidentified names. In this way, we open up the black box in traditional disambiguation processes, and help intuitively and comprehensively explain why the corresponding classifications should hold. We conducted two use cases and an expert review to demonstrate the effectiveness of NameClarifier.",Qiaomu Shen;Tongshuang Wu;Haiyan Yang;Yanhong Wu;Huamin Qu;Weiwei Cui,Qiaomu Shen;Tongshuang Wu;Haiyan Yang;Yanhong Wu;Huamin Qu;Weiwei Cui,Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Microsoft Research,10.1109/TVCG.2012.252;10.1109/TVCG.2011.188;10.1109/VAST.2006.261429,Name disambiguation;analytical reasoning,9,16,41,
VAST,2016,A Visual Analytics Approach for Categorical Joint Distribution Reconstruction from Marginal Projections,10.1109/TVCG.2016.2598479,http://dx.doi.org/10.1109/TVCG.2016.2598479,51,60,J,"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.",Cong Xie;Wen Zhong;Klaus Mueller,Cong Xie;Wen Zhong;Klaus Mueller,"Computer Science Department, Stony Brook University;Computer Science Department, Stony Brook University;Computer Science Department, Stony Brook University",10.1109/TVCG.2010.181;10.1109/TVCG.2013.190;10.1109/VAST.2009.5332586;10.1109/TVCG.2015.2467552;10.1109/VAST.2009.5332611;10.1109/TVCG.2010.183;10.1109/TVCG.2011.248,Parallel Coordinates;Joint Distribution Reconstruction;Solution Space;High-dimensional Data;Multivariate Data,9,9,35,HM
VAST,2017,Dynamic Influence Networks for Rule-Based Models,10.1109/TVCG.2017.2745280,http://dx.doi.org/10.1109/TVCG.2017.2745280,184,194,J,"We introduce the Dynamic Influence Network (DIN), a novel visual analytics technique for representing and analyzing rule-based models of protein-protein interaction networks. Rule-based modeling has proved instrumental in developing biological models that are concise, comprehensible, easily extensible, and that mitigate the combinatorial complexity of multi-state and multi-component biological molecules. Our technique visualizes the dynamics of these rules as they evolve over time. Using the data produced by KaSim, an open source stochastic simulator of rule-based models written in the Kappa language, DINs provide a node-link diagram that represents the influence that each rule has on the other rules. That is, rather than representing individual biological components or types, we instead represent the rules about them (as nodes) and the current influence of these rules (as links). Using our interactive DIN-Viz software tool, researchers are able to query this dynamic network to find meaningful patterns about biological processes, and to identify salient aspects of complex rule-based models. To evaluate the effectiveness of our approach, we investigate a simulation of a circadian clock model that illustrates the oscillatory behavior of the KaiC protein phosphorylation cycle.",Angus G. Forbes;Andrew Thomas Burks;Kristine Lee;Xing Li;Pierre Boutillier;Jean Krivine;Walter Fontana,Angus G. Forbes;Andrew Burks;Kristine Lee;Xing Li;Pierre Boutillier;Jean Krivine;Walter Fontana,"University of California, Santa Cruz;University of Illinois, Chicago;University of Illinois, Chicago;University of Illinois, Chicago;Harvard Medical School;Universit&#x00E9; Paris Diderot;Harvard Medical School",10.1109/TVCG.2011.185;10.1109/TVCG.2010.126;10.1109/TVCG.2013.198;10.1109/TVCG.2007.70528;10.1109/TVCG.2013.154;10.1109/TVCG.2012.189,"Dynamic networks,biological data visualization,rule-based modeling,protein-protein interaction networks",9,3,67,
InfoVis,2018,Mapping Color to Meaning in Colormap Data Visualizations,10.1109/TVCG.2018.2865147,http://dx.doi.org/10.1109/TVCG.2018.2865147,810,819,J,"To interpret data visualizations, people must determine how visual features map onto concepts. For example, to interpret colormaps, people must determine how dimensions of color (e.g., lightness, hue) map onto quantities of a given measure (e.g., brain activity, correlation magnitude). This process is easier when the encoded mappings in the visualization match people's predictions of how visual features will map onto concepts, their inferred mappings. To harness this principle in visualization design, it is necessary to understand what factors determine people's inferred mappings. In this study, we investigated how inferred color-quantity mappings for colormap data visualizations were influenced by the background color. Prior literature presents seemingly conflicting accounts of how the background color affects inferred color-quantity mappings. The present results help resolve those conflicts, demonstrating that sometimes the background has an effect and sometimes it does not, depending on whether the colormap appears to vary in opacity. When there is no apparent variation in opacity, participants infer that darker colors map to larger quantities (dark-is-more bias). As apparent variation in opacity increases, participants become biased toward inferring that more opaque colors map to larger quantities (opaque-is-more bias). These biases work together on light backgrounds and conflict on dark backgrounds. Under such conflicts, the opaque-is-more bias can negate, or even supersede the dark-is-more bias. The results suggest that if a design goal is to produce colormaps that match people's inferred mappings and are robust to changes in background color, it is beneficial to use colormaps that will not appear to vary in opacity on any background color, and to encode larger quantities in darker colors.",Karen B. Schloss;Connor Gramazio;Allison T. Silverman;Madeline L. Parker;Audrey S. Wang,Karen B. Schloss;Connor C. Gramazio;Allison T. Silverman;Madeline L. Parker;Audrey S. Wang,Department of Psychology and Wisconsin Institute for DiscoveryUniversity of Wisconsin-Madison;Department of Computer ScienceBrown University;School of Public HealthBrown University;Department of Psychology and Wisconsin Institute for DiscoveryUniversity of Wisconsin-Madison;Department of Applied and Computational MathematicsCalifornia Institute of Technology,10.1109/TVCG.2017.2743978;10.1109/TVCG.2016.2598918;10.1109/TVCG.2010.162;10.1109/TVCG.2007.70583;10.1109/TVCG.2017.2744359,"Visual Reasoning,Visual Communication,Colormaps,Color Perception,Visual Encoding,Visual Design",9,4,49,HM
Vis,1991,Visualizing 4-D medical ultrasound data,10.1109/VISUAL.1991.175802,http://dx.doi.org/10.1109/VISUAL.1991.175802,210,215,C,"Different standard rendering methods applied to 4-D medical ultrasound data are discussed. In particular, maximum value projection, sum of values projection, transparent gray level gradient shading, and surface shading have been tested. Due to the fact that ultrasound data suffer from a low signal to noise ratio, image processing and image analysis are used to enhance and classify the volumetric data set.&lt;&lt;ETX&gt;&gt;",Nils Thune;Bjørn Olstad,N. Thune;B. Olstad,"Dept. of Sci. & Technol., Christian Michelsen Inst., Fantoft, Norway",,,8,1,10,
Vis,1992,Surface curvature analysis using color,10.1109/VISUAL.1992.235200,http://dx.doi.org/10.1109/VISUAL.1992.235200,260,267,C,"In the automotive industry, it is highly important that the exterior body panels be esthetically pleasing. One aspect of creating esthetically pleasing surfaces is to require that they be fair. A system that has proven useful for diagnosis of surface fairness problems is presented. How to choose a set of colors with perceptually uniform spacing is described, and the usefulness of a logarithmic scale for relating curvature to colors is shown.&lt;&lt;ETX&gt;&gt;",L. R. Seidenberg;Robert B. Jerard;J. Megewick,L.R. Seidenberg;R.B. Jerard;J. Magewick,"Dept. of Mech. Eng., New Hampshire Univ., Durham, NH, USA;Dept. of Mech. Eng., New Hampshire Univ., Durham, NH, USA",,,8,2,17,
Vis,1992,Anatomical atlases based on volume visualization,10.1109/VISUAL.1992.235218,http://dx.doi.org/10.1109/VISUAL.1992.235218,115,122,C,"A framework for the generation of atlases of the human body based on the linkage of volume data to a knowledge base is presented. The model has a two layer structure. The lower level is a volume model with a set of semantic attributes belonging to each voxel. Its spatial representation is derived from data sets of magnetic resonance imaging (MRI) and computer tomography. The semantic attributes are assigned by an anatomist using a volume editor. The upper level is a set of relations between these attributes which are also specified by the expert. Interactive visualization tools, such as multiple surface display, transparent rendering, and cutting, are provided. It is shown that the combination of this object-oriented data structure with advanced volume visualization tools provides the look and feel of a real dissection.&lt;&lt;ETX&gt;&gt;",Karl Heinz Höhne;Andreas Pommert;Martin Riemer;Thomas Schiemann;Rainer Schubert;Ulf Tiede;Werner Lierse,K.H. Hohne;A. Pommert;M. Riemer;T. Schiemann;R. Schubert;U. Tiede;W. Lierse,,,,8,1,24,
Vis,1994,"Visualization and geographic information system integration: what are the needs and the requirements, if any?",10.1109/VISUAL.1994.346284,http://dx.doi.org/10.1109/VISUAL.1994.346284,400,403,M,"Addresses the needs and requirements of integrating visualization and geographic information system technologies. There are three levels of integration methods: rudimentary, operational and functional. The rudimentary approach uses the minimum amount of data sharing and exchange between these two technologies. The operational level attempts to provide consistency of the data while removing redundancies between the two technologies. The functional form attempts to provide transparent communication between these respective software environments. At this level, the user only needs to request information and the integrated system retrieves or generates the information depending upon the request. This paper examines the role and impact of these three levels of integration. Stepping further into the future, the paper also questions the long-term survival of these separate disciplines.&lt;&lt;ETX&gt;&gt;",Theresa-Marie Rhyne;William Ivey;Loey Knapp;Peter Kochevar;Tom Mace,T.M. Rhyne;W. Ivey;L. Knapp;P. Kochevar;T. Mace,"Martin Marietta/US EPA Visualization Center, USA",,,8,2,3,
Vis,1994,Piecewise-linear surface approximation from noisy scattered samples,10.1109/VISUAL.1994.346336,http://dx.doi.org/10.1109/VISUAL.1994.346336,61,68,C,"We consider the problem of approximating a smooth surface f(x, y), based on n scattered samples {(x/sub i/, y/sub i/, z/sub i/)/sub i=1//sup n/} where the sample values {z/sub i/} are contaminated with noise: z/sub i/=f(x/sub i/, y/sub i/)=/spl epsiv//sub i/. We present an algorithm that generates a PLS (piecewise linear surface) f', defined on a triangulation of the sample locations V={(x/sub i/, y/sub i/)/sub i=1//sup n/}, approximating f well. Constructing the PLS involves specifying both the triangulation of V and the values of f' at the points of V. We demonstrate that even when the sampling process is not noisy, a better approximation for f is obtained using our algorithm, compared to existing methods. This algorithm is useful for DTM (digital terrain map) manipulation by polygon-based graphics engines for visualization applications.&lt;&lt;ETX&gt;&gt;",Michael Margaliot;Craig Gotsman,M. Margaliot;C. Gotsman,"Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel",,,8,3,16,
Vis,1995,Interactive visualization of mixed scalar and vector fields,10.1109/VISUAL.1995.480818,http://dx.doi.org/10.1109/VISUAL.1995.480818,240,"247, 458",C,"This paper describes an approach for interactive visualization of mixed scalar and vector fields, in which vector icons are generated from pre-voxelized icon templates and volume-rendered together with the volumetric scalar data. This approach displays simultaneously the global structure of the scalar field and the detailed features of the vector field. Interactive visualization is achieved with incremental image update, by re-rendering only a small portion of the image wherever and whenever a change occurs. This technique supports a set of interactive visualization tools, including change of vector field visualization parameters, real-time animation of vector icons advected within the scalar field, a zooming lens, and a local probe.",Lichan Hong;Xiaoyang Mao;Arie E. Kaufman,Lichan Hong;Xiaoyang Mao;A. Kaufman,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/VISUAL.1993.398849;10.1109/VISUAL.1994.346340;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1992.235227;10.1109/VISUAL.1992.235210;10.1109/VISUAL.1994.346321;10.1109/VISUAL.1991.175789,,8,2,18,
InfoVis,1996,Geospatial metadata querying and visualization on the WWW using Java™ applets,10.1109/INFVIS.1996.559225,http://dx.doi.org/10.1109/INFVIS.1996.559225,77,"84, 128",C,"This paper presents the query and visualization interfaces of the Master Environmental Library (MEL) system. MEL uses the World Wide Web (WWW) to make accessible distributed data whose metadata conform to the Federal Geographic Data Committee's (FGDC) content standards for digital geospatial metadata. The interfaces are implemented as Java/sup TM/ applets and are more intuitive, interactive and possess greater functionality than their Hypertext Markup Language (HTML) counterparts. As well as querying, the interface allows users to visualize and manage the list of query results so that users can more quickly discover the datasets of real interest. Several new tools used to visualize attributes of the metadata are presented.",Naim Alper;Chuck Stein,N. Alper;C. Stein,"Mar Inc., USA",10.1109/INFVIS.1995.528686;10.1109/INFVIS.1995.528682,,8,4,11,
Vis,1997,Viewing IGES files through VRML,10.1109/VISUAL.1997.663924,http://dx.doi.org/10.1109/VISUAL.1997.663924,471,474,C,This paper describes our experiences with using the Virtual Reality Modeling Language (VRML) to view files in the Initial Graphics Exchange Specification (IGES) format using a Java-based translator from IGES to VRML and HTML (Hypertext Markup Language). The paper examines the conversion problems between IGES and VRML and presents some results of the process.,Jed Marti,J. Marti,"Defense Group Inc., Salt Lake City, UT, USA",,"Computer-aided Design, Applications of Visualization",8,1,10,
Vis,1998,"Supporting detail-in-context for the DNA representation, H-curves",10.1109/VISUAL.1998.745339,http://dx.doi.org/10.1109/VISUAL.1998.745339,443,446,C,"This paper presents a tool for the visual exploration of DNA sequences represented as H-curves. Although very long sequences can be plotted using H-curves, micro-features are lost as sequences get longer. We present a new three-dimensional distortion algorithm to allow the magnification of a sub-segment of an H-curve while preserving a global view of the curve. This is particularly appropriate for H-curves as they provide useful visual information at several resolutions. Our approach also extends the current possibilities of detail-in-context viewing in 3D. It provides a non-occluding, orthogonal technique that preserves uniform scaling within regions and maintains geometric continuity between regions.",M. L. Lantin;Sheelagh Carpendale,M.L. Lantin;M.S.T. Carpendale,"Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada",,,8,0,14,
Vis,1999,An interactive framework for visualizing foreign currency exchange options,10.1109/VISUAL.1999.809929,http://dx.doi.org/10.1109/VISUAL.1999.809929,453,562,C,"Analyzing options is a complex, multi-variate process. Option behavior depends on a variety of market conditions which vary over the time course of the option. The goal of this project is to provide an interactive visual environment which allows the analyst to explore these complex interactions, and to select and construct specific views for communicating information to non-analysts (e.g., marketing managers and customers). In this paper we describe an environment for exploring 2- and 3-dimensional representations of options data, dynamically varying parameters, examining how multi-variate relationships develop over time, and exploring the likelihood of the development of different outcomes over the life of the option. We also demonstrate how this tool has been used by analysts to communicate to non-analysts how particular options no longer deliver the behavior they were originally intended to provide.",Donna L. Gresh;Bernice E. Rogowitz;M. S. Tignor;E. J. Mayland,D.L. Gresh;B.E. Rogowitz;M.S. Tignor;E.J. Mayland,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.1995.480821,,8,3,7,
Vis,2000,Vector fields simplification-a case study of visualizing climate modeling and simulation data sets,10.1109/VISUAL.2000.885738,http://dx.doi.org/10.1109/VISUAL.2000.885738,485,488,C,"In our study of regional climate modeling and simulation, we frequently encounter vector fields that are crowded with large numbers of critical points. A critical point in a flow is where the vector field vanishes. While these critical points accurately reflect the topology of the vector fields, in our study only a subset of them is worth further investigation. We present a filtering technique based on the vorticity of the vector fields to eliminate the less interesting and sometimes sporadic critical points in a multiresolution fashion. The neighboring regions of the preserved features, which are characterized by strong shear and circulation, are potential locations of weather instability. We apply our feature filtering technique to a regional climate modeling data set covering East Asia in the summer of 1991.",Pak Chung Wong;Harlan Foote;L. Ruby Leung;Elizabeth Jurrus;Dan Adams;James J. Thomas,Pak Chung Wong;H. Foote;R. Leung;E. Jurrus;D. Adams;J. Thomas,"Pacific Northwest Lab., Richland, WA, USA",10.1109/VISUAL.1999.809907;10.1109/VISUAL.1999.809865,"vector field visualization, time-varying fields, meteorology",8,0,8,
InfoVis,2002,Visual path analysis,10.1109/INFVIS.2002.1173163,http://dx.doi.org/10.1109/INFVIS.2002.1173163,165,168,C,"We describe a system for analyzing the flow of traffic through Web sites. We decomposed the general path analysis problem into a set of distinct subproblems, and created a visual metaphor for analyzing each of them. Our system works off of multiple representations of the clickstream, and exposes the path extraction algorithms and data to the visual metaphors as Web services. We have combined the visual metaphors into a Web-based ""path analysis portal"" that lets the user easily switch between the different modes of analysis.",Alan Keahey;Stephen G. Eick,T.A. Keahey;S.G. Eick,,10.1109/INFVIS.2001.963293,,8,3,13,
Vis,2002,Isometric embedding by surface reconstruction from distances,10.1109/VISUAL.2002.1183782,http://dx.doi.org/10.1109/VISUAL.2002.1183782,251,257,C,"To display the intuitive meaning of an abstract metric it is helpful to look on an embedded surface with the same inner geometry as the given metric. The resulting partial differential equations have no standard solution. Only for some special cases satisfactory methods are known. I present a new algorithmic approach which is not based on differential equations. In contrast to other methods this technique also works if the embedding exists only locally. The fundamental idea is to estimate Euclidean distances, from which the surface is built up. In this paper I focus on the reconstruction of a surface from these estimated distances. Particular the influence of a perturbation of the distances on the shape of the resulting surface is investigated.",Ingrid Hotz,I. Hotz,"Dept. of Comput. Sci., Kaiserslautern Univ., Germany",10.1109/VISUAL.1992.235193;10.1109/VISUAL.1998.745316,"isometric embedding, metric, tensor fields",8,3,10,
Vis,2002,Case study: Visualization and analysis of high Rayleigh number - 3D convection in the Earth's mantle,10.1109/VISUAL.2002.1183813,http://dx.doi.org/10.1109/VISUAL.2002.1183813,493,496,C,Data sets from large-scale simulations (up to 501/sup 3/ grid points) of mantle convection are analyzed with volume rendering of the temperature field and a new critical point analysis of the velocity field. As the Rayleigh number Ra is increased the thermal field develops increasingly thin plume-like structures along which heat is convected. These eventually break down and become turbulent. Visualization methods are used to distinguish between various models of heat conductivity and to develop an intuitive understanding of the structure of the flow.,Gordon Erlebacher;David A. Yuen;Fabien Dubuffet,G. Erlebacher;D.A. Yuen;F. Dubuffet,"Sch. of Computational Sci. & Inf. Technol., Florida State Univ., Tallahassee, FL, USA",10.1109/VISUAL.1990.146359,"mantle convection, plumes, volume rendering, unsteady flow, feature extraction, critical points",8,3,16,
InfoVis,2004,Metric-Based Network Exploration and Multiscale Scatterplot,10.1109/INFVIS.2004.47,http://dx.doi.org/10.1109/INFVIS.2004.47,135,142,C,"We describe an exploratory technique based on the direct interaction with a 2D modified scatterplot computed from two different metrics calculated over the elements of a network. The scatterplot is transformed into an image by applying standard image processing techniques resulting into blurring effects. Segmentation of the image allow to easily select patches on the image as a way to extract subnetworks. We were inspired by the work of Wattenberg and Fisher [M. Wattenberg et al. (2003)] showing that the blurring process builds into a multiscale perceptual scheme, making this type of interaction intuitive to the user. We explain how the exploration of the network can be guided by the visual analysis of the blurred scatterplot and by its possible interpretations",Yves Chiricota;Fabien Jourdan;Guy Melançon,Y. Chiricota;F. Jourdan;G. Melancon,Universit&#233; du Qu&#233;bec &#224; Chicoutimi,10.1109/VISUAL.1995.485139;10.1109/INFVIS.1999.801858;10.1109/INFVIS.1997.636791;10.1109/INFVIS.2003.1249005;10.1109/INFVIS.2003.1249011;10.1109/INFVIS.2000.885090,"Graph navigation, exploration, scatterplot, multiscale perceptual organization, clustering, filtering, blurring",8,6,24,
Vis,2004,2D Maps for Visual Analysis and Retrieval in Large Multi-Feature 3D Model Databases,10.1109/VISUAL.2004.2,http://dx.doi.org/10.1109/VISUAL.2004.2,2,2,M,"Multimedia objects are often described by high-dimensional feature vectors which can be used for retrieval and clustering tasks. We have built an interactive retrieval system for 3D model databases that implements a variety of different feature transforms. Recently, we have enhanced the functionality of our system by integrating a SOM-based visualization module. In this poster demo, we show how 2D maps can be used to improve the effectiveness of retrieval, clustering, and over-viewing tasks in a 3D multimedia system.",Benjamin Bustos;Daniel A. Keim;Christian Panse;Tobias Schreck,B. Bustos;D.A. Keim;C. Panse;T. Schreck,University of Konstanz,,,8,4,6,
InfoVis,2005,A sky dome visualisation for identification of astronomical orientations,10.1109/INFVIS.2005.1532123,http://dx.doi.org/10.1109/INFVIS.2005.1532123,8,15,C,"It has long been known that ancient temples were frequently oriented along the cardinal directions or to certain points along the horizon where Sun or Moon rise or set on special days of the year. In the last decades, archaeologists have found evidence of even older building structures buried in the soil, with doorways that also appear to have distinct orientations. This paper presents a novel diagram combining archaeological maps with a folded-apart, flattened view of the whole sky, showing the local horizon and the daily paths of Sun, Moon and brighter stars. By use of this diagram, interesting groupings of astronomical orientation directions, e.g. to certain Sunrise and Sunset points could be identified, which were evidently used to mark certain days of the year. Orientations to a few significant stars very likely indicated the beginning of the agricultural year in the middle neolithic period",Georg Zotti;M. Eduard Gröller,G. Zotti;M.E. Groller,,," Archaeology, Astronomy, data mining",8,2,12,
Vis,2005,Sort-middle multi-projector immediate-mode rendering in Chromium,10.1109/VISUAL.2005.1532784,http://dx.doi.org/10.1109/VISUAL.2005.1532784,103,110,C,"Traditionally, sort-middle is a technique that has been difficult to attain on clusters because of the tight coupling of geometry and rasterization processes on commodity graphics hardware. In this paper, we describe the implementation of a new sort-middle approach for performing immediate-mode rendering in Chromium. The Chromium Rendering System is used extensively to drive multi-projector displays on PC clusters with inexpensive commodity graphics components. By default, Chromium uses a sort-first approach to distribute rendering work to individual nodes in a PC cluster. While this sort-first approach works effectively in retained-mode rendering, it suffers from various network bottlenecks when rendering in immediate-mode. Current techniques avoid these bottlenecks by sorting vertex data as a pre-processing step and grouping vertices into specific bounding boxes, using Chromium's bounding box extension. These steps may be expensive, especially if the dataset is dynamic. In our approach, we utilize standard programmable graphics hardware and extend standard APIs to achieve a separation in the rendering pipeline. The pre-processing of vertex data or the grouping of vertices into bounding boxes are not required. Additionally, the amount of OpenGL state commands transmitted through the network are reduced. Our results indicate that the approach can attain twice the frame rates as compared to Chromium's sort-first approach when rendering in immediate-mode.",Jorge Luis Williams;Robert E. Hiromoto,J.L. Williams;R.E. Hiromoto,"Dept. of Comput. Sci., Idaho Univ., Moscow, ID, USA;Dept. of Comput. Sci., Idaho Univ., Moscow, ID, USA",,"Cluster Rendering, Sort-Middle, Multi-Projector, Tile Displays, Immediate-Mode Rendering",8,3,18,
Vis,2005,Hardware-accelerated 3D visualization of mass spectrometry data,10.1109/VISUAL.2005.1532827,http://dx.doi.org/10.1109/VISUAL.2005.1532827,439,446,C,"We present a system for three-dimensional visualization of complex liquid chromatography-mass spectrometry (LCMS) data. Every LCMS data point has three attributes: time, mass, and intensity. Instead of the traditional visualization of two-dimensional subsets of the data, we visualize it as a height field or terrain in 3D. Unlike traditional terrains, LCMS data has non-linear sampling and consists mainly of tall needle-like features. We adapt the level-of-detail techniques of geometry clipmaps for hardware-accelerated rendering of LCMS data. The data is cached in video memory as a set of nested rectilinear grids centered about the view frustum. We introduce a simple compression scheme and dynamically stream data from the CPU to the GPU as the viewpoint moves. Our system allows interactive investigation of complex LCMS data with close to one billion data points at up to 130 frames per second, depending on the view conditions.",Jose De Corral;Hanspeter Pfister,J. de Corral;H. Pfister,"Waters Corp., Milford, MA, USA",10.1109/VISUAL.1996.567600;10.1109/VISUAL.1998.745282;10.1109/VISUAL.1997.663860,"Mass Spectrometry, Terrain Rendering, GPU Rendering",8,3,18,
Vis,2005,Visualization of the genus of knots,10.1109/VISUAL.2005.1532843,http://dx.doi.org/10.1109/VISUAL.2005.1532843,567,574,C,"The genus of a knot or link can be defined via Seifert surfaces. A Seifert surface of a knot or link is an oriented surface whose boundary coincides with that, knot or link. Schematic images of these surfaces are shown in every text book on knot theory, but from these it is hard to understand their shape and structure. In this paper the visualization of such surfaces is discussed. A method is presented to produce different styles of surfaces for knots and links, starting from the so-called braid representation. Also, it is shown how closed oriented surfaces can be generated in which the knot is embedded, such that the knot subdivides the surface into two parts. These closed surfaces provide a direct visualization of the genus of a knot.",Jarke J. van Wijk;Arjeh M. Cohen,J.J. van Wijk;A.M. Cohen,"Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands;Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands",,"Visualization, knot theory, topology, genus, Seifert surfaces",8,4,13,
VAST,2007,IMAS: The Interactive Multigenomic Analysis System,10.1109/VAST.2007.4388997,http://dx.doi.org/10.1109/VAST.2007.4388997,59,66,C,"This paper introduces a new Visual Analysis tool named IMAS (Interactive Multigenomic Analysis System), which combines common analysis tools such as Glimmer, BLAST, and Clustal-W into a unified Visual Analytic framework. IMAS displays the primary DNA sequence being analyzed by the biologist in a highly interactive, zoomable visual display. The user may analyze the sequence in a number of ways, and visualize these analyses in a coherent, sequence aligned form, with all related analysis products grouped together. This enables the user to rapidly perform analyses of DNA sequences without the need for tedious and error-prone cutting and pasting of sequence data from text files to and from web-based databases and data analysis services, as is now common practice.",Chris Shaw 0002;Greg A. Dasch;Marina E. Eremeeva,Christopher D. Shaw;Gregory A. Dasch;Marina E. Eremeeva,"School of Interactive Arts & Technology, Simon Fraser University Surrey, Surrey, BC, Canada. shaw@sfu.ca;Viral and Rickettsial Zoonoses Branch, National Center for Infectious Diseases, Centers for Disease Control and Prevention, Atlanta, Georgia 30333. ged4@cdc.gov;Viral and Rickettsial Zoonoses Branch, National Center for Infectious Diseases, Centers for Disease Control and Prevention, Atlanta, Georgia 30333. mge6@cdc.gov",,"Bioinformatics, Visual Analytics",8,5,18,
VAST,2008,Crystal structures classifier for an evolutionary algorithm structure predictor,10.1109/VAST.2008.4677351,http://dx.doi.org/10.1109/VAST.2008.4677351,11,18,C,"USPEX is a crystal structure predictor based on an evolutionary algorithm. Every USPEX run produces hundreds or thousands of crystal structures, some of which may be identical. To ease the extraction of unique and potentially interesting structures we applied usual high-dimensional classification concepts to the unusual field of crystallography. We experimented with various crystal structure descriptors, distinct distance measures and tried different clustering methods to identify groups of similar structures. These methods are already applied in combinatorial chemistry to organic molecules for a different goal and in somewhat different forms, but are not widely used for crystal structures classification. We adopted a visual design and validation method in the development of a library (CrystalFp) and an end-user application to select and validate method choices, to gain userspsila acceptance and to tap into their domain expertise. The use of the classifier has already accelerated the analysis of USPEX output by at least one order of magnitude, promoting some new crystallographic insight and discovery. Furthermore the visual display of key algorithm indicators has led to diverse, unexpected discoveries that will improve the USPEX algorithms.",Mario Valle;Artem R. Oganov,Mario Valle;Artem R. Oganov,"Data Analysis and Visualization Services, Swiss National Supercomputing Centre (CSCS), Switzerland;Laboratory of Crystallography, Department of Materials, ETH Zürich, Switzerland",,,8,7,31,
VAST,2008,A 3D treemap approach for analyzing the classificatory distribution in patent portfolios,10.1109/VAST.2008.4677380,http://dx.doi.org/10.1109/VAST.2008.4677380,189,190,M,"Due to the complexity of the patent domain and the huge amount of data, advanced interactive visual techniques are needed to support the analysis of large patent collections and portfolios. In this paper we present a new approach for visualizing the classificatory distribution of patent collections among the International Patent Classification (IPC) - todaypsilas most important internationally agreed patent classification system with about 70.000 categories. Our approach is based on an interactive three-dimensional treemap overlaid with adjacency edge bundles.",Mark Giereth;Harald Bosch;Thomas Ertl,Mark Giereth;Harald Bosch;Thomas Ertl,"Visualization and Interactive Systems Institute (VIS), University of Stuttgart, Germany;Visualization and Interactive Systems Institute (VIS), University of Stuttgart, Germany;Visualization and Interactive Systems Institute (VIS), University of Stuttgart, Germany",,,8,4,8,
VAST,2009,VAST contest dataset use in education,10.1109/VAST.2009.5333245,http://dx.doi.org/10.1109/VAST.2009.5333245,115,122,C,"The IEEE Visual Analytics Science and Technology (VAST) Symposium has held a contest each year since its inception in 2006. These events are designed to provide visual analytics researchers and developers with analytic challenges similar to those encountered by professional information analysts. The VAST contest has had an extended life outside of the symposium, however, as materials are being used in universities and other educational settings, either to help teachers of visual analytics-related classes or for student projects. We describe how we develop VAST contest datasets that results in products that can be used in different settings and review some specific examples of the adoption of the VAST contest materials in the classroom. The examples are drawn from graduate and undergraduate courses at Virginia Tech and from the Visual Analytics ldquoSummer Camprdquo run by the National Visualization and Analytics Center in 2008. We finish with a brief discussion on evaluation metrics for education.",Mark A. Whiting;Chris North 0001;Alex Endert;Jean Scholtz;Jereme Haack;Carrie Varley;James J. Thomas,Mark A. Whiting;Chris North;Alex Endert;Jean Scholtz;Jereme Haack;Carrie Varley;Jim Thomas,"Pacific Northwest National Laboratory, USA;Virginia Tech, Department of Computer Science, USA;Virginia Tech, Department of Computer Science, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA",10.1109/VAST.2006.261416,"education, evaluation, synthetic data",8,4,24,
VAST,2009,A multi-level middle-out cross-zooming approach for large graph analytics,10.1109/VAST.2009.5333880,http://dx.doi.org/10.1109/VAST.2009.5333880,147,154,C,"This paper presents a working graph analytics model that embraces the strengths of the traditional top-down and bottom-up approaches with a resilient crossover concept to exploit the vast middle-ground information overlooked by the two extreme analytical approaches. Our graph analytics model is co-developed by users and researchers, who carefully studied the functional requirements that reflect the critical thinking and interaction pattern of a real-life intelligence analyst. To evaluate the model, we implement a system prototype, known as GreenHornet, which allows our analysts to test the theory in practice, identify the technological and usage-related gaps in the model, and then adapt the new technology in their work space. The paper describes the implementation of GreenHornet and compares its strengths and weaknesses against the other prevailing models and tools.",Pak Chung Wong;Patrick Mackey;Kristin A. Cook;Randall M. Rohrer;Harlan Foote;Mark A. Whiting,Pak Chung Wong;Patrick Mackey;Kristin A. Cook;Randall M. Rohrer;Harlan Foote;Mark A. Whiting,"Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA;U.S. Department of Defense, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA",10.1109/VAST.2007.4389006;10.1109/INFVIS.2004.43;10.1109/INFVIS.2004.66;10.1109/TVCG.2007.70582,"Graph analytics, information visualization",8,5,26,
VAST,2009,Innovative filtering techniques and customized analytics tools,10.1109/VAST.2009.5334300,http://dx.doi.org/10.1109/VAST.2009.5334300,,,M,"The VAST 2009 Challenge consisted of three heterogeneous synthetic data sets organized into separate mini-challenges with minimal correspondence information. The challenge task was the identification of a suspected data theft from cyber and real-world traces. The grand challenge required integrating the findings from the mini challenges into a plausible, consistent scenario. A mixture of linked, customized tools based on queryable models and rapid prototyping as well as generic analysis tools (developed in-house) helped us correctly solve all of the mini challenges. A collaborative analytic process was employed to reconstruct the scenario and to propose the correct steps for the reliable identification of the criminal organization based on activity traces of its members.",Harald Bosch;Julian Heinrich;Christoph Müller 0001;Benjamin Höferlin;Guido Reina;Markus Höferlin;Michael Wörner 0001;Steffen Koch,Harald Bosch;Julian Heinrich;Christoph Muller;Benjamin Hoferlin;Guido Reina;Markus Hoferlin;Michael Worner;Steffen Koch,"Visualization and Interactive Systems Institute and Visualization Research Center, Universität Stuttgart, Germany;Visualization and Interactive Systems Institute and Visualization Research Center, Universität Stuttgart, Germany;Visualization and Interactive Systems Institute and Visualization Research Center, Universität Stuttgart, Germany;Visualization and Interactive Systems Institute and Visualization Research Center, Universität Stuttgart, Germany;Visualization and Interactive Systems Institute and Visualization Research Center, Universität Stuttgart, Germany;Visualization and Interactive Systems Institute and Visualization Research Center, Universität Stuttgart, Germany;Visualization and Interactive Systems Institute and Visualization Research Center, Universität Stuttgart, Germany;Visualization and Interactive Systems Institute and Visualization Research Center, Universität Stuttgart, Germany",,,8,4,3,
VAST,2009,VAST 2009 challenge: An insider threat,10.1109/VAST.2009.5334454,http://dx.doi.org/10.1109/VAST.2009.5334454,,,M,"The 4&lt;sup&gt;th&lt;/sup&gt; VAST Challenge centered on a cyber analytics scenario and offered three mini-challenges with datasets of badge and network traffic data, a social network including geospatial information, and security video. Teams could also enter the Grand challenge which combined all three datasets. In this paper, we summarize the dataset, the overall scenario and the questions asked in the challenges. We describe the judging process and new infrastructure developed to manage the submissions and compute accuracy measures in the social network mini challenge. We received 49 entries from 30 teams, and gave 23 different awards to a total of 16 teams.",Georges G. Grinstein;Jean Scholtz;Mark A. Whiting;Catherine Plaisant,Georges Grinstein;Jean Scholtz;Mark Whiting;Catherine Plaisant,"University of Massachusetts Lowell, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA;University of Maryland, USA",,,8,0,7,
Vis,2009,Interactive Volume Rendering of Functional Representations in Quantum Chemistry,10.1109/TVCG.2009.158,http://dx.doi.org/10.1109/TVCG.2009.158,1579,5186,J,"Simulation and computation in chemistry studies have been improved as computational power has increased over decades. Many types of chemistry simulation results are available, from atomic level bonding to volumetric representations of electron density. However, tools for the visualization of the results from quantum chemistry computations are still limited to showing atomic bonds and isosurfaces or isocontours corresponding to certain isovalues. In this work, we study the volumetric representations of the results from quantum chemistry computations, and evaluate and visualize the representations directly on the GPU without resampling the result in grid structures. Our visualization tool handles the direct evaluation of the approximated wavefunctions described as a combination of Gaussian-like primitive basis functions. For visualizations, we use a slice based volume rendering technique with a 2D transfer function, volume clipping, and illustrative rendering in order to reveal and enhance the quantum chemistry structure. Since there is no need of resampling the volume from the functional representations, two issues, data transfer and resampling resolution, can be ignored, therefore, it is possible to interactively explore large amount of different information in the computation results.",Yun Jang;Ugo Varetto,Yun Jang;Ugo Varetto,ETH Z&#x0FC;rich;Swiss National Supercomputing Center(CSCS),10.1109/TVCG.2007.70614;10.1109/TVCG.2007.70517;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2002.1183780;10.1109/TVCG.2006.133;10.1109/VISUAL.2005.1532811;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2004.23;10.1109/TVCG.2007.70578;10.1109/TVCG.2006.150;10.1109/VISUAL.2004.36;10.1109/TVCG.2006.115;10.1109/VISUAL.2005.1532858;10.1109/VISUAL.2004.103,"Quantum Chemistry, GTO, Volume Rendering, GPU",8,8,32,
VAST,2010,Real-time aggregation of Wikipedia data for visual analytics,10.1109/VAST.2010.5652896,http://dx.doi.org/10.1109/VAST.2010.5652896,147,154,C,"Wikipedia has been built to gather encyclopedic knowledge using a collaborative social process that has proved its effectiveness. However, the workload required for raising the quality and increasing the coverage of Wikipedia is exhausting the community. Based on several participatory design sessions with active Wikipedia contributors (a.k.a. Wikipedians), we have collected a set of measures related to Wikipedia activity that, if available and visualized effectively, could spare a lot of monitoring time to these Wikipedians, allowing them to focus on quality and coverage of Wikipedia instead of spending their time navigating heavily to track vandals and copyright infringements. However, most of these measures cannot be computed on the fly using the available Wikipedia API. Therefore, we have designed an open architecture called WikiReactive to compute incrementally and maintain several aggregated measures on the French Wikipedia. This aggregated data is available as a Web Service and can be used to overlay information on Wikipedia articles through Wikipedia Skins or for new services for Wikipedians or people studying Wikipedia. This article describes the architecture, its performance and some of its uses.",Nadia Boukhelifa;Fanny Chevalier;Jean-Daniel Fekete,Nadia Boukhelifa;Fanny Chevalier;Jean-Daniel Fekete,Microsoft Research - INRIA Joint Centre;Microsoft Research - INRIA Joint Centre;INRIA,,,8,5,23,
Vis,2011,An Efficient Direct Volume Rendering Approach for Dichromats,10.1109/TVCG.2011.164,http://dx.doi.org/10.1109/TVCG.2011.164,2144,2152,J,"Color vision deficiency (CVD) affects a high percentage of the population worldwide. When seeing a volume visualization result, persons with CVD may be incapable of discriminating the classification information expressed in the image if the color transfer function or the color blending used in the direct volume rendering is not appropriate. Conventional methods used to address this problem adopt advanced image recoloring techniques to enhance the rendering results frame-by-frame; unfortunately, problematic perceptual results may still be generated. This paper proposes an alternative solution that complements the image recoloring scheme by reconfiguring the components of the direct volume rendering (DVR) pipeline. Our approach optimizes the mapped colors of a transfer function to simulate CVD-friendly effect that is generated by applying the image recoloring to the results with the initial transfer function. The optimization process has a low computational complexity, and only needs to be performed once for a given transfer function. To achieve detail-preserving and perceptually natural semi-transparent effects, we introduce a new color composition mode that works in the color space of dichromats. Experimental results and a pilot study demonstrates that our approach can yield dichromats-friendly and consistent volume visualization in real-time.",Weifeng Chen 0002;Wei Chen 0001;Hujun Bao,Weifeng Chen;Wei Chen;Hujun Bao,Zhejiang University;Zhejiang University;Zhejiang University,10.1109/TVCG.2008.118;10.1109/TVCG.2009.172;10.1109/TVCG.2008.112;10.1109/TVCG.2009.150;10.1109/VISUAL.2005.1532833;10.1109/TVCG.2009.113,"Dichromacy, direct volume rendering, volume classification, image recoloring",8,8,28,
Vis,2011,Context Preserving Maps of Tubular Structures,10.1109/TVCG.2011.182,http://dx.doi.org/10.1109/TVCG.2011.182,1997,2004,J,"When visualizing tubular 3D structures, external representations are often used for guidance and display, and such views in 2D can often contain occlusions. Virtual dissection methods have been proposed where the entire 3D structure can be mapped to the 2D plane, though these will lose context by straightening curved sections. We present a new method of creating maps of 3D tubular structures that yield a succinct view while preserving the overall geometric structure. Given a dominant view plane for the structure, its curve skeleton is first projected to a 2D skeleton. This 2D skeleton is adjusted to account for distortions in length, modified to remove intersections, and optimized to preserve the shape of the original 3D skeleton. Based on this shaped 2D skeleton, a boundary for the map of the object is obtained based on a slicing path through the structure and the radius around the skeleton. The sliced structure is conformally mapped to a rectangle and then deformed via harmonic mapping to match the boundary placement. This flattened map preserves the general geometric context of a 3D object in a 2D display, and rendering of this flattened map can be accomplished using volumetric ray casting. We have evaluated our method on real datasets of human colon models.",Joseph Marino,Joseph Marino;Wei Zeng;Xianfeng Gu;Arie Kaufman,Stony Brook University,10.1109/TVCG.2006.112;10.1109/TVCG.2010.200;10.1109/VISUAL.2001.964540,"Geometry-based technique, volume rendering, biomedical visualization, medical visualization, conformal mapping",8,6,23,
SciVis,2012,A Perceptual-Statistics Shading Model,10.1109/TVCG.2012.188,http://dx.doi.org/10.1109/TVCG.2012.188,2265,2274,J,"The process of surface perception is complex and based on several influencing factors, e.g., shading, silhouettes, occluding contours, and top down cognition. The accuracy of surface perception can be measured and the influencing factors can be modified in order to decrease the error in perception. This paper presents a novel concept of how a perceptual evaluation of a visualization technique can contribute to its redesign with the aim of improving the match between the distal and the proximal stimulus. During analysis of data from previous perceptual studies, we observed that the slant of 3D surfaces visualized on 2D screens is systematically underestimated. The visible trends in the error allowed us to create a statistical model of the perceived surface slant. Based on this statistical model we obtained from user experiments, we derived a new shading model that uses adjusted surface normals and aims to reduce the error in slant perception. The result is a shape-enhancement of visualization which is driven by an experimentally-founded statistical model. To assess the efficiency of the statistical shading model, we repeated the evaluation experiment and confirmed that the error in perception was decreased. Results of both user experiments are publicly-available datasets.",Veronika Soltészová;Cagatay Turkay;Mark C. Price;Ivan Viola,Veronika Šoltészová;Cagatay Turkay;Mark C. Price;Ivan Viola,"Department of Informatics, University of Bergen;Department of Informatics, University of Bergen;Faculty of Psychology, University of Bergen;Department of Informatics, University of Bergen and Christian Michelsen Research, Norway",10.1109/TVCG.2011.161,"Shading, perception, evaluation, surface slant, statistical analysis",8,8,40,
SciVis,2012,Lagrangian Coherent Structures for Design Analysis of Revolving Doors,10.1109/TVCG.2012.243,http://dx.doi.org/10.1109/TVCG.2012.243,2159,2168,J,"Room air flow and air exchange are important aspects for the design of energy-efficient buildings. As a result, simulations are increasingly used prior to construction to achieve an energy-efficient design. We present a visual analysis of air flow generated at building entrances, which uses a combination of revolving doors and air curtains. The resulting flow pattern is challenging because of two interacting flow patterns: On the one hand, the revolving door acts as a pump, on the other hand, the air curtain creates a layer of uniformly moving warm air between the interior of the building and the revolving door. Lagrangian coherent structures (LCS), which by definition are flow barriers, are the method of choice for visualizing the separation and recirculation behavior of warm and cold air flow. The extraction of LCS is based on the finite-time Lyapunov exponent (FTLE) and makes use of a ridge definition which is consistent with the concept of weak LCS. Both FTLE computation and ridge extraction are done in a robust and efficient way by making use of the fast Fourier transform for computing scale-space derivatives.",Benjamin Schindler;Raphael Fuchs;Stefan Barp;Jürgen Waser;Armin Pobitzer;Robert Carnecky;Kresimir Matkovic;Ronald Peikert,Benjamin Schindler;Raphael Fuchs;Stefan Barp;Jürgen Waser;Armin Pobitzer;Robert Carnecky;Krešimir Matković;Ronald Peikert,"ETH Zurich;ETH Zurich;Air Flow Consulting AG Zurich;VRVis Research Center, Austria;University of Bergen;ETH Zurich;VRVis Research Center, Austria;ETH Zurich",10.1109/TVCG.2007.70551;10.1109/TVCG.2010.223;10.1109/TVCG.2007.70554;10.1109/TVCG.2010.156;10.1109/VISUAL.2005.1532813,"Visualization in physical sciences and engineering, topology-based techniques, vector field data",8,9,38,
SciVis,2012,Sketching Uncertainty into Simulations,10.1109/TVCG.2012.261,http://dx.doi.org/10.1109/TVCG.2012.261,2255,2264,J,"In a variety of application areas, the use of simulation steering in decision making is limited at best. Research focusing on this problem suggests that most user interfaces are too complex for the end user. Our goal is to let users create and investigate multiple, alternative scenarios without the need for special simulation expertise. To simplify the specification of parameters, we move from a traditional manipulation of numbers to a sketch-based input approach. Users steer both numeric parameters and parameters with a spatial correspondence by sketching a change onto the rendering. Special visualizations provide immediate visual feedback on how the sketches are transformed into boundary conditions of the simulation models. Since uncertainty with respect to many intertwined parameters plays an important role in planning, we also allow the user to intuitively setup complete value ranges, which are then automatically transformed into ensemble simulations. The interface and the underlying system were developed in collaboration with experts in the field of flood management. The real-world data they have provided has allowed us to construct scenarios used to evaluate the system. These were presented to a variety of flood response personnel, and their feedback is discussed in detail in the paper. The interface was found to be intuitive and relevant, although a certain amount of training might be necessary.",Hrvoje Ribicic;Jürgen Waser;Roman Gurbat;Bernhard Sadransky;M. Eduard Gröller,Hrvoje Ribicic;Juergen Waser;Roman Gurbat;Bernhard Sadransky;M. Eduard Gröller,"VRVis Research Center, Austria;VRVis Research Center, Austria;TU Wien;VRVis Research Center, Austria;TU Wien",10.1109/TVCG.2010.223;10.1109/TVCG.2011.225;10.1109/TVCG.2010.223;10.1109/TVCG.2010.202;10.1109/VAST.2011.6102457,"Emergency/disaster management, interaction design, uncertainty visualization, sketch-based steering, ensemble simulation steering, integrated visualization system, flood management",8,6,31,
VAST,2012,Relative N-gram signatures: Document visualization at the level of character N-grams,10.1109/VAST.2012.6400484,http://dx.doi.org/10.1109/VAST.2012.6400484,103,112,C,The Common N-Gram (CNG) classifier is a text classification algorithm based on the comparison of frequencies of character n-grams (strings of characters of length n) that are the most common in the considered documents and classes of documents. We present a text analytic visualization system that employs the CNG approach for text classification and uses the differences in frequency values of common n-grams in order to visually compare documents at the sub-word level. The visualization method provides both an insight into n-gram characteristics of documents or classes of documents and a visual interpretation of the workings of the CNG classifier.,Magdalena Jankowska;Vlado Keselj;Evangelos E. Milios,Magdalena Jankowska;Vlado Kešelj;Evangelos Milios,"Faculty of Computer Science, Dalhousie University;Faculty of Computer Science, Dalhousie University;Faculty of Computer Science, Dalhousie University",10.1109/VAST.2009.5333443;10.1109/VAST.2007.4389004,"Visual analytics, visual text analysis, text classification",8,6,36,
InfoVis,2013,Common Angle Plots as Perception-True Visualizations of Categorical Associations,10.1109/TVCG.2013.140,http://dx.doi.org/10.1109/TVCG.2013.140,2297,2305,J,"Visualizations are great tools of communications-they summarize findings and quickly convey main messages to our audience. As designers of charts we have to make sure that information is shown with a minimum of distortion. We have to also consider illusions and other perceptual limitations of our audience. In this paper we discuss the effect and strength of the line width illusion, a Muller-Lyer type illusion, on designs related to displaying associations between categorical variables. Parallel sets and hammock plots are both affected by line width illusions. We introduce the common-angle plot as an alternative method for displaying categorical data in a manner that minimizes the effect from perceptual illusions. Results from user studies both highlight the need for addressing line-width illusions in displays and provide evidence that common angle charts successfully resolve this issue.",Heike Hofmann;Marie Vendettuoli,Heike Hofmann;Marie Vendettuoli,Iowa State University;Iowa State University,10.1109/INFVIS.2000.885091;10.1109/INFVIS.2005.1532128;10.1109/TVCG.2010.186;10.1109/TVCG.2011.185;10.1109/TVCG.2009.128,"Linewidth illusion, data visualization, high-dimensional displays, parallel sets, hammock plots, Muller-Lyer illusion",8,9,37,
SciVis,2013,Fast Blending Scheme for Molecular Surface Representation,10.1109/TVCG.2013.158,http://dx.doi.org/10.1109/TVCG.2013.158,2653,2662,J,"Representation of molecular surfaces is a well established way to study the interaction of molecules. The state-of-theart molecular representation is the SES model, which provides a detailed surface visualization. Nevertheless, it is computationally expensive, so the less accurate Gaussian model is traditionally preferred. We introduce a novel surface representation that resembles the SES and approaches the rendering performance of the Gaussian model. Our technique is based on the iterative blending of implicit functions and avoids any pre-computation. Additionally, we propose a GPU-based ray-casting algorithm that efficiently visualize our molecular representation. A qualitative and quantitative comparison of our model with respect to the Gaussian and SES models is presented. As showcased in the paper, our technique is a valid and appealing alternative to the Gaussian representation. This is especially relevant in all the applications where the cost of the SES is prohibitive.",Július Parulek;Andrea Brambilla,Julius Parulek;Andrea Brambilla,University of Bergen;University of Bergen,10.1109/TVCG.2009.157;10.1109/VISUAL.2003.1250414;10.1109/TVCG.2006.115,"Molecular visualization, geometry-based techniques, implicit surfaces",8,10,44,
SciVis,2013,Noise-Based Volume Rendering for the Visualization of Multivariate Volumetric Data,10.1109/TVCG.2013.180,http://dx.doi.org/10.1109/TVCG.2013.180,2926,2935,J,"Analysis of multivariate data is of great importance in many scientific disciplines. However, visualization of 3D spatially-fixed multivariate volumetric data is a very challenging task. In this paper we present a method that allows simultaneous real-time visualization of multivariate data. We redistribute the opacity within a voxel to improve the readability of the color defined by a regular transfer function, and to maintain the see-through capabilities of volume rendering. We use predictable procedural noise - random-phase Gabor noise - to generate a high-frequency redistribution pattern and construct an opacity mapping function, which allows to partition the available space among the displayed data attributes. This mapping function is appropriately filtered to avoid aliasing, while maintaining transparent regions. We show the usefulness of our approach on various data sets and with different example applications. Furthermore, we evaluate our method by comparing it to other visualization techniques in a controlled user study. Overall, the results of our study indicate that users are much more accurate in determining exact data values with our novel 3D volume visualization method. Significantly lower error rates for reading data values and high subjective ranking of our method imply that it has a high chance of being adopted for the purpose of visualization of multivariate 3D data.",Rostislav Khlebnikov;Bernhard Kainz;Markus Steinberger;Dieter Schmalstieg,Rostislav Khlebnikov;Bernhard Kainz;Markus Steinberger;Dieter Schmalstieg,Graz University of Technology;Imperial College London;Graz University of Technology;Graz University of Technology,10.1109/VISUAL.1990.146373;10.1109/VISUAL.2003.1250412;10.1109/TVCG.2006.113;10.1109/VISUAL.2005.1532807;10.1109/TVCG.2007.70623;10.1109/TVCG.2012.223;10.1109/VISUAL.2003.1250362,"Volume rendering, multi-variate data visualization, multi-volume rendering, scientific visualization",8,9,29,
SciVis,2014,Decomposition and Simplification of Multivariate Data using Pareto Sets,10.1109/TVCG.2014.2346447,http://dx.doi.org/10.1109/TVCG.2014.2346447,2684,2693,J,"Topological and structural analysis of multivariate data is aimed at improving the understanding and usage of such data through identification of intrinsic features and structural relationships among multiple variables. We present two novel methods for simplifying so-called Pareto sets that describe such structural relationships. Such simplification is a precondition for meaningful visualization of structurally rich or noisy data. As a framework for simplification operations, we introduce a decomposition of the data domain into regions of equivalent structural behavior and the reachability graph that describes global connectivity of Pareto extrema. Simplification is then performed as a sequence of edge collapses in this graph; to determine a suitable sequence of such operations, we describe and utilize a comparison measure that reflects the changes to the data that each operation represents. We demonstrate and evaluate our methods on synthetic and real-world examples.",Lars Huettenberger;Christian Heine 0002;Christoph Garth,Lars Huettenberger;Christian Heine;Christoph Garth,TU Kaiserslautern;ETH Zurich;TU Kaiserslautern,10.1109/TVCG.2012.228;10.1109/VISUAL.2005.1532839;10.1109/TVCG.2009.120;10.1109/VISUAL.2002.1183774;10.1109/VISUAL.2000.885716;10.1109/TVCG.2008.110,"Multivariate Topology, Pareto Set, Simplification, Decomposition",8,8,22,
SciVis,2014,Stent Maps - Comparative Visualization for the Prediction of Adverse Events of Transcatheter Aortic Valve Implantations,10.1109/TVCG.2014.2346459,http://dx.doi.org/10.1109/TVCG.2014.2346459,2704,2713,J,"Transcatheter aortic valve implantation (TAVI) is a minimally-invasive method for the treatment of aortic valve stenosis in patients with high surgical risk. Despite the success of TAVI, side effects such as paravalvular leakages can occur postoperatively. The goal of this project is to quantitatively analyze the co-occurrence of this complication and several potential risk factors such as stent shape after implantation, implantation height, amount and distribution of calcifications, and contact forces between stent and surrounding structure. In this paper, we present a two-dimensional visualization (stent maps), which allows (1) to comprehensively display all these aspects from CT data and mechanical simulation results and (2) to compare different datasets to identify patterns that are typical for adverse effects. The area of a stent map represents the surface area of the implanted stent - virtually straightened and uncoiled. Several properties of interest, like radial forces or stent compression, are displayed in this stent map in a heatmap-like fashion. Important anatomical landmarks and calcifications are plotted to show their spatial relation to the stent and possible correlations with the color-coded parameters. To provide comparability, the maps of different patient datasets are spatially adjusted according to a corresponding anatomical landmark. Also, stent maps summarizing the characteristics of different populations (e.g. with or without side effects) can be generated. Up to this point several interesting patterns have been observed with our technique, which remained hidden when examining the raw CT data or 3D visualizations of the same data. One example are obvious radial force maxima between the right and non-coronary valve leaflet occurring mainly in cases without leakages. These observations confirm the usefulness of our approach and give starting points for new hypotheses and further analyses. Because of its reduced dimensionality, the stent map data is an appropriate input for statistical group evaluation and machine learning methods.",Silvia Born;Simon H. Sündermann;Christoph Russ;Raoul Hopf;Carlos E. Ruiz;Volkmar Falk;Michael Gessat,Silvia Born;Simon H. Sündermann;Christoph Russ;Raoul Hopf;Carlos E. Ruiz;Volkmar Falk;Michael Gessat,"University of Zurich, Switzerland;Division of Cardiovascular Surgery, University Hospital of Zurich, Switzerland;Swiss Federal Institute of Technology (ETH) Zurich, Switzerland;Swiss Federal Institute of Technology (ETH) Zurich, Switzerland;Structural and Congenital Heart Division, Lenox Hill Hospital;Division of Cardiovascular Surgery, University Hospital of Zurich, Switzerland;University of Zurich, Switzerland",10.1109/TVCG.2009.169;10.1109/TVCG.2007.70550;10.1109/VISUAL.2001.964540;10.1109/TVCG.2011.235;10.1109/TVCG.2013.139;10.1109/VISUAL.2003.1250353,"Comparative visualization, medical visualization, vessel flattening, transcatheter aortic valve implantation (TAVI)",8,8,31,
VAST,2014,Genotet: An Interactive Web-based Visual Exploration Framework to Support Validation of Gene Regulatory Networks,10.1109/TVCG.2014.2346753,http://dx.doi.org/10.1109/TVCG.2014.2346753,1903,1912,J,"Elucidation of transcriptional regulatory networks (TRNs) is a fundamental goal in biology, and one of the most important components of TRNs are transcription factors (TFs), proteins that specifically bind to gene promoter and enhancer regions to alter target gene expression patterns. Advances in genomic technologies as well as advances in computational biology have led to multiple large regulatory network models (directed networks) each with a large corpus of supporting data and gene-annotation. There are multiple possible biological motivations for exploring large regulatory network models, including: validating TF-target gene relationships, figuring out co-regulation patterns, and exploring the coordination of cell processes in response to changes in cell state or environment. Here we focus on queries aimed at validating regulatory network models, and on coordinating visualization of primary data and directed weighted gene regulatory networks. The large size of both the network models and the primary data can make such coordinated queries cumbersome with existing tools and, in particular, inhibits the sharing of results between collaborators. In this work, we develop and demonstrate a web-based framework for coordinating visualization and exploration of expression data (RNA-seq, microarray), network models and gene-binding data (ChIP-seq). Using specialized data structures and multiple coordinated views, we design an efficient querying model to support interactive analysis of the data. Finally, we show the effectiveness of our framework through case studies for the mouse immune system (a dataset focused on a subset of key cellular functions) and a model bacteria (a small genome with high data-completeness).",Bowen Yu 0004;Harish Doraiswamy;Xi Chen;Emily R. Miraldi;Mario Luis Arrieta-Ortiz;Christoph Hafemeister;Aviv Madar;Richard Bonneau;Cláudio T. Silva,Bowen Yu;Harish Doraiswamy;Xi Chen;Emily Miraldi;Mario Luis Arrieta-Ortiz;Christoph Hafemeister;Aviv Madar;Richard Bonneau;Cláudio T. Silva,NYU Polytechnic School of Engineering;NYU Polytechnic School of Engineering;NYU Center for Genomics and Systems Biology;NYU Center for Genomics and Systems Biology;NYU Center for Genomics and Systems Biology;NYU Center for Genomics and Systems Biology;Cornell University;NYU Center for Genomics and Systems Biology;NYU Polytechnic School of Engineering,10.1109/TVCG.2008.117;10.1109/TVCG.2009.146;10.1109/TVCG.2011.185;10.1109/TVCG.2009.167,"Web-based visualization, gene regulatory network",8,9,32,
VAST,2014,Visual Analysis of Patterns in Multiple Amino Acid Mutation Graphs,10.1109/VAST.2014.7042485,http://dx.doi.org/10.1109/VAST.2014.7042485,93,102,C,"Proteins are essential parts in all living organisms. They consist of sequences of amino acids. An interaction with reactive agent can stimulate a mutation at a specific position in the sequence. This mutation may set off a chain reaction, which effects other amino acids in the protein. Chain reactions need to be analyzed, as they may invoke unwanted side effects in drug treatment. A mutation chain is represented by a directed acyclic graph, where amino acids are connected by their mutation dependencies. As each amino acid may mutate individually, many mutation graphs exist. To determine important impacts of mutations, experts need to analyze and compare common patterns in these mutations graphs. Experts, however, lack suitable tools for this purpose. We present a new system for the search and the exploration of frequent patterns (i.e., motifs) in mutation graphs. We present a fast pattern search algorithm specifically developed for finding biologically relevant patterns in many mutation graphs (i.e., many labeled acyclic directed graphs). Our visualization system allows an interactive exploration and comparison of the found patterns. It enables locating the found patterns in the mutation graphs and in the 3D protein structures. In this way, potentially interesting patterns can be discovered. These patterns serve as starting point for a further biological analysis. In cooperation with biologists, we use our approach for analyzing a real world data set based on multiple HIV protease sequences.",Olav Lenz;Frank Keul;Sebastian Bremm;Kay Hamacher;Tatiana von Landesberger,Olav Lenz;Frank Keul;Sebastian Bremm;Kay Hamacher;Tatiana von Landesberger,"GRIS, TU Darmstadt;Computational Biology, TU Darmstadt;GRIS, TU Darmstadt;Computational Biology, TU Darmstadt;GRIS, TU Darmstadt",10.1109/TVCG.2013.225;10.1109/VAST.2011.6102439;10.1109/VAST.2009.5333893;10.1109/TVCG.2009.167;10.1109/TVCG.2007.70521;10.1109/TVCG.2009.122;10.1109/TVCG.2007.70529,"Biologic Visualization, Graph Visualization, Motif Search, Motif Visualization, Biology, Mutations, Pattern Visualization",8,6,51,
InfoVis,2015,SchemeLens: A Content-Aware Vector-Based Fisheye Technique for Navigating Large Systems Diagrams,10.1109/TVCG.2015.2467035,http://dx.doi.org/10.1109/TVCG.2015.2467035,330,338,J,"System schematics, such as those used for electrical or hydraulic systems, can be large and complex. Fisheye techniques can help navigate such large documents by maintaining the context around a focus region, but the distortion introduced by traditional fisheye techniques can impair the readability of the diagram. We present SchemeLens, a vector-based, topology-aware fisheye technique which aims to maintain the readability of the diagram. Vector-based scaling reduces distortion to components, but distorts layout. We present several strategies to reduce this distortion by using the structure of the topology, including orthogonality and alignment, and a model of user intention to foster smooth and predictable navigation. We evaluate this approach through two user studies: Results show that (1) SchemeLens is 16-27% faster than both round and rectangular flat-top fisheye lenses at finding and identifying a target along one or several paths in a network diagram; (2) augmenting SchemeLens with a model of user intentions aids in learning the network topology.",Aurélie Cohé;Bastien Liutkus;Gilles Bailly;James R. Eagan;Eric Lecolinet,Aurélie Cohé;Bastien Liutkus;Gilles Bailly;James Eagan;Eric Lecolinet,Télécom ParisTech;Télécom ParisTech;CNRS LTCI & Télécom ParisTech;Télécom ParisTech;Télécom ParisTech,10.1109/INFVIS.2004.66;10.1109/TVCG.2012.245;10.1109/INFVIS.2003.1249008,"Fisheye, vector-scaling, content-aware, network schematics, interactive zoom, navigation, information visualization",8,5,33,
InfoVis,2015,Acquired Codes of Meaning in Data Visualization and Infographics: Beyond Perceptual Primitives,10.1109/TVCG.2015.2467321,http://dx.doi.org/10.1109/TVCG.2015.2467321,509,518,J,"While information visualization frameworks and heuristics have traditionally been reluctant to include acquired codes of meaning, designers are making use of them in a wide variety of ways. Acquired codes leverage a user's experience to understand the meaning of a visualization. They range from figurative visualizations which rely on the reader's recognition of shapes, to conventional arrangements of graphic elements which represent particular subjects. In this study, we used content analysis to codify acquired meaning in visualization. We applied the content analysis to a set of infographics and data visualizations which are exemplars of innovative and effective design. 88% of the infographics and 71% of data visualizations in the sample contain at least one use of figurative visualization. Conventions on the arrangement of graphics are also widespread in the sample. In particular, a comparison of representations of time and other quantitative data showed that conventions can be specific to a subject. These results suggest that there is a need for information visualization research to expand its scope beyond perceptual channels, to include social and culturally constructed meaning. Our paper demonstrates a viable method for identifying figurative techniques and graphic conventions and integrating them into heuristics for visualization design.",Lydia Byrne;Daniel Angus;Janet Wiles,Lydia Byrne;Daniel Angus;Janet Wiles,The University of Queensland;The University of Queensland;The University of Queensland,10.1109/TVCG.2013.234;10.1109/TVCG.2010.126;10.1109/INFVIS.2005.1532122;10.1109/TVCG.2011.255;10.1109/TVCG.2007.70594;10.1109/TVCG.2010.179;10.1109/INFVIS.2004.59;10.1109/TVCG.2012.221;10.1109/TVCG.2008.171,"Visual Design, Taxonomies, Illustrative Visualization, Design Methodologies",8,9,62,
SciVis,2015,Real-Time Molecular Visualization Supporting Diffuse Interreflections and Ambient Occlusion,10.1109/TVCG.2015.2467293,http://dx.doi.org/10.1109/TVCG.2015.2467293,718,727,J,"Today molecular simulations produce complex data sets capturing the interactions of molecules in detail. Due to the complexity of this time-varying data, advanced visualization techniques are required to support its visual analysis. Current molecular visualization techniques utilize ambient occlusion as a global illumination approximation to improve spatial comprehension. Besides these shadow-like effects, interreflections are also known to improve the spatial comprehension of complex geometric structures. Unfortunately, the inherent computational complexity of interreflections would forbid interactive exploration, which is mandatory in many scenarios dealing with static and time-varying data. In this paper, we introduce a novel analytic approach for capturing interreflections of molecular structures in real-time. By exploiting the knowledge of the underlying space filling representations, we are able to reduce the required parameters and can thus apply symbolic regression to obtain an analytic expression for interreflections. We show how to obtain the data required for the symbolic regression analysis, and how to exploit our analytic solution to enhance interactive molecular visualizations.",Robin Skånberg;Pere-Pau Vázquez;Victor Guallar;Timo Ropinski,Robin Skånberg;Pere-Pau Vázquez;Victor Guallar;Timo Ropinski,Visual Computing Group;MOVING Group;Barcelona Supercomputing Center;Visual Computing Group,10.1109/TVCG.2007.70578;10.1109/TVCG.2009.168;10.1109/TVCG.2007.70517;10.1109/TVCG.2012.282;10.1109/TVCG.2009.157;10.1109/TVCG.2014.2346404;10.1109/TVCG.2006.115,"Molecular visualization, diffuse interreflections, ambient occlusion",8,10,48,
InfoVis,2016,booc.io: An Education System with Hierarchical Concept Maps and Dynamic Non-linear Learning Plans,10.1109/TVCG.2016.2598518,http://dx.doi.org/10.1109/TVCG.2016.2598518,571,580,J,"Information hierarchies are difficult to express when real-world space or time constraints force traversing the hierarchy in linear presentations, such as in educational books and classroom courses. We present booc.io, which allows linear and non-linear presentation and navigation of educational concepts and material. To support a breadth of material for each concept, booc.io is Web based, which allows adding material such as lecture slides, book chapters, videos, and LTIs. A visual interface assists the creation of the needed hierarchical structures. The goals of our system were formed in expert interviews, and we explain how our design meets these goals. We adapt a real-world course into booc.io, and perform introductory qualitative evaluation with students.",Michail Schwab;Hendrik Strobelt;James Tompkin;Colin Fredericks;Connor Huff;Dana Higgins;Anton Strezhnev;Mayya Komisarchik;Gary King;Hanspeter Pfister,Michail Schwab;Hendrik Strobelt;James Tompkin;Colin Fredericks;Connor Huff;Dana Higgins;Anton Strezhnev;Mayya Komisarchik;Gary King;Hanspeter Pfister,Harvard Paulson SEAS;Harvard Paulson SEAS;Harvard Paulson SEAS;HarvardX;Harvard Institute for Quantitative Social Sciences;Harvard Institute for Quantitative Social Sciences;Harvard Institute for Quantitative Social Sciences;Harvard Institute for Quantitative Social Sciences;Harvard Institute for Quantitative Social Sciences;Harvard Paulson SEAS,;10.1109/TVCG.2006.147,education;Hierarchies;information visualization,8,7,37,
InfoVis,2016,Exploring the Possibilities of Embedding Heterogeneous Data Attributes in Familiar Visualizations,10.1109/TVCG.2016.2598586,http://dx.doi.org/10.1109/TVCG.2016.2598586,581,590,J,"Heterogeneous multi-dimensional data are now sufficiently common that they can be referred to as ubiquitous. The most frequent approach to visualizing these data has been to propose new visualizations for representing these data. These new solutions are often inventive but tend to be unfamiliar. We take a different approach. We explore the possibility of extending well-known and familiar visualizations through including Heterogeneous Embedded Data Attributes (HEDA) in order to make familiar visualizations more powerful. We demonstrate how HEDA is a generic, interactive visualization component that can extend common visualization techniques while respecting the structure of the familiar layout. HEDA is a tabular visualization building block that enables individuals to visually observe, explore, and query their familiar visualizations through manipulation of embedded multivariate data. We describe the design space of HEDA by exploring its application to familiar visualizations in the D3 gallery. We characterize these familiar visualizations by the extent to which HEDA can facilitate data queries based on attribute reordering.",Mona Hosseinkhani Loorak;Charles Perin;Christopher Collins 0001;Sheelagh Carpendale,Mona Hosseinkhani Loorak;Charles Perin;Christopher Collins;Sheelagh Carpendale,"Department of Computer Science, University of Calgary;Department of Computer Science, University of Calgary;University of Ontario;Department of Computer Science, University of Calgary",10.1109/TVCG.2014.2346248;10.1109/TVCG.2014.2346260;10.1109/INFVIS.2005.1532151;10.1109/INFVIS.2005.1532129;10.1109/TVCG.2007.70582;10.1109/TVCG.2009.179;10.1109/INFVIS.2003.1249016;10.1109/TVCG.2010.205;10.1109/TVCG.2013.227;10.1109/TVCG.2013.210;10.1109/TVCG.2011.201;10.1109/TVCG.2015.2467325;10.1109/TVCG.2009.122;10.1109/TVCG.2014.2346279;10.1109/TVCG.2013.192;10.1109/TVCG.2013.167;10.1109/VISUAL.1990.146386;10.1109/TVCG.2011.185;10.1109/TVCG.2011.186,Multi-dimensional data;Hybrid visualization,8,10,54,
InfoVis,2016,Surprise! Bayesian Weighting for De-Biasing Thematic Maps,10.1109/TVCG.2016.2598618,http://dx.doi.org/10.1109/TVCG.2016.2598618,651,660,J,"Thematic maps are commonly used for visualizing the density of events in spatial data. However, these maps can mislead by giving visual prominence to known base rates (such as population densities) or to artifacts of sample size and normalization (such as outliers arising from smaller, and thus more variable, samples). In this work, we adapt Bayesian surprise to generate maps that counter these biases. Bayesian surprise, which has shown promise for modeling human visual attention, weights information with respect to how it updates beliefs over a space of models. We introduce Surprise Maps, a visualization technique that weights event data relative to a set of spatia-temporal models. Unexpected events (those that induce large changes in belief over the model space) are visualized more prominently than those that follow expected patterns. Using both synthetic and real-world datasets, we demonstrate how Surprise Maps overcome some limitations of traditional event maps.",Michael Correll;Jeffrey Heer,Michael Correll;Jeffrey Heer,University of Washington;University of Washington,10.1109/TVCG.2014.2346248;10.1109/TVCG.2007.70561;10.1109/TVCG.2014.2346594;10.1109/TVCG.2014.2346325;10.1109/TVCG.2011.179;10.1109/TVCG.2014.2346298;10.1109/TVCG.2012.199;10.1109/INFVIS.2001.963274;10.1109/TVCG.2015.2467758;10.1109/TVCG.2013.184,Thematic Maps;Bayesian Surprise;Event Visualization;Spatia-temporal data,8,8,47,
SciVis,2016,Corresponding Supine and Prone Colon Visualization Using Eigenfunction Analysis and Fold Modeling,10.1109/TVCG.2016.2598791,http://dx.doi.org/10.1109/TVCG.2016.2598791,751,760,J,"We present a method for registration and visualization of corresponding supine and prone virtual colonoscopy scans based on eigenfunction analysis and fold modeling. In virtual colonoscopy, CT scans are acquired with the patient in two positions, and their registration is desirable so that physicians can corroborate findings between scans. Our algorithm performs this registration efficiently through the use of Fiedler vector representation (the second eigenfunction of the Laplace-Beltrami operator). This representation is employed to first perform global registration of the two colon positions. The registration is then locally refined using the haustral folds, which are automatically segmented using the 3D level sets of the Fiedler vector. The use of Fiedler vectors and the segmented folds presents a precise way of visualizing corresponding regions across datasets and visual modalities. We present multiple methods of visualizing the results, including 2D flattened rendering and the corresponding 3D endoluminal views. The precise fold modeling is used to automatically find a suitable cut for the 2D flattening, which provides a less distorted visualization. Our approach is robust, and we demonstrate its efficiency and efficacy by showing matched views on both the 2D flattened colons and in the 3D endoluminal view. We analytically evaluate the results by measuring the distance between features on the registered colons, and we also assess our fold segmentation against 20 manually labeled datasets. We have compared our results analytically to previous methods, and have found our method to achieve superior results. We also prove the hot spots conjecture for modeling cylindrical topology using Fiedler vector representation, which allows our approach to be used for general cylindrical geometry modeling and feature extraction.",Saad Nadeem;Joseph Marino;Xianfeng Gu;Arie E. Kaufman,Saad Nadeem;Joseph Marino;Xianfeng Gu;Arie Kaufman,"Computer Science Department, Stony Brook University, Stony Brook, NY;Computer Science Department, Stony Brook University, Stony Brook, NY;Computer Science Department, Stony Brook University, Stony Brook, NY;Computer Science Department, Stony Brook University, Stony Brook, NY",10.1109/TVCG.2006.112;10.1109/TVCG.2010.200;10.1109/VISUAL.2001.964540;10.1109/TVCG.2006.158;10.1109/TVCG.2013.139;10.1109/TVCG.2015.2467413;10.1109/TVCG.2011.182;10.1109/VISUAL.2005.1532806,Medical visualization;colon registration;geometry-based techniques;mathematical foundations for visualization,8,10,38,
SciVis,2016,Combined Visualization of Vessel Deformation and Hemodynamics in Cerebral Aneurysms,10.1109/TVCG.2016.2598795,http://dx.doi.org/10.1109/TVCG.2016.2598795,761,770,J,"We present the first visualization tool that combines patient-specific hemodynamics with information about the vessel wall deformation and wall thickness in cerebral aneurysms. Such aneurysms bear the risk of rupture, whereas their treatment also carries considerable risks for the patient. For the patient-specific rupture risk evaluation and treatment analysis, both morphological and hemodynamic data have to be investigated. Medical researchers emphasize the importance of analyzing correlations between wall properties such as the wall deformation and thickness, and hemodynamic attributes like the Wall Shear Stress and near-wall flow. Our method uses a linked 2.5D and 3D depiction of the aneurysm together with blood flow information that enables the simultaneous exploration of wall characteristics and hemodynamic attributes during the cardiac cycle. We thus offer medical researchers an effective visual exploration tool for aneurysm treatment risk assessment. The 2.5D view serves as an overview that comprises a projection of the vessel surface to a 2D map, providing an occlusion-free surface visualization combined with a glyph-based depiction of the local wall thickness. The 3D view represents the focus upon which the data exploration takes place. To support the time-dependent parameter exploration and expert collaboration, a camera path is calculated automatically, where the user can place landmarks for further exploration of the properties. We developed a GPU-based implementation of our visualizations with a flexible interactive data exploration mechanism. We designed our techniques in collaboration with domain experts, and provide details about the evaluation.",Monique Meuschke;Samuel Voß;Oliver Beuing;Bernhard Preim;Kai Lawonn,Monique Meuschke;Samuel Voss;Oliver Beuing;Bernhard Preim;Kai Lawonn,"University of Magdeburg, Germany;University of Magdeburg, Germany;University of Magdeburg, Germany;University of Magdeburg, Germany;University of Koblenz-Landau, Germany",10.1109/TVCG.2011.215;10.1109/TVCG.2011.243;10.1109/TVCG.2014.2346406;10.1109/TVCG.2010.153;10.1109/TVCG.2015.2467961;10.1109/TVCG.2013.189;10.1109/TVCG.2012.202,Medical visualizations;aneurysms;blood flow;wall thickness;wall deformation;projections,8,9,47,
SciVis,2016,Molecular Surface Maps,10.1109/TVCG.2016.2598824,http://dx.doi.org/10.1109/TVCG.2016.2598824,701,710,J,"We present Molecular Surface Maps, a novel, view-independent, and concise representation for molecular surfaces. It transfers the well-known world map metaphor to molecular visualization. Our application maps the complex molecular surface to a simple 2D representation through a spherical intermediate, the Molecular Surface Globe. The Molecular Surface Map concisely shows arbitrary attributes of the original molecular surface, such as biochemical properties or geometrical features. This results in an intuitive overview, which allows researchers to assess all molecular surface attributes at a glance. Our representation can be used as a visual summarization of a molecule's interface with its environment. In particular, Molecular Surface Maps simplify the analysis and comparison of different data sets or points in time. Furthermore, the map representation can be used in a Space-time Cube to analyze time-dependent data from molecular simulations without the need for animation. We show the feasibility of Molecular Surface Maps for different typical analysis tasks of biomolecular data.",Michael Krone;Florian Friess;Katrin Scharnowski;Guido Reina;Silvia Fademrecht;Tobias Kulschewski;Jürgen Pleiss;Thomas Ertl,Michael Krone;Florian Frieß;Katrin Scharnowski;Guido Reina;Silvia Fademrecht;Tobias Kulschewski;Jürgen Pleiss;Thomas Ertl,"Visualization Research Center (VISUS), University of Stuttgart, Germany;Visualization Research Center (VISUS), University of Stuttgart, Germany;Visualization Research Center (VISUS), University of Stuttgart, Germany;Visualization Research Center (VISUS), University of Stuttgart, Germany;Institute of Technical Biochemistry (ITB), University of Stuttgart, Germany;Institute of Technical Biochemistry (ITB), University of Stuttgart, Germany;Institute of Technical Biochemistry (ITB), University of Stuttgart, Germany;Visualization Research Center (VISUS), University of Stuttgart, Germany",10.1109/TVCG.2013.194;10.1109/VISUAL.2003.1250384;10.1109/TVCG.2015.2467413,Molecular Visualization;Maps;Cartography;Data Aggregation;Dimensionality Reduction;Space-time Cube,8,8,64,
SciVis,2016,Physics-Based Visual Characterization of Molecular Interaction Forces,10.1109/TVCG.2016.2598825,http://dx.doi.org/10.1109/TVCG.2016.2598825,731,740,J,"Molecular simulations are used in many areas of biotechnology, such as drug design and enzyme engineering. Despite the development of automatic computational protocols, analysis of molecular interactions is still a major aspect where human comprehension and intuition are key to accelerate, analyze, and propose modifications to the molecule of interest. Most visualization algorithms help the users by providing an accurate depiction of the spatial arrangement: the atoms involved in inter-molecular contacts. There are few tools that provide visual information on the forces governing molecular docking. However, these tools, commonly restricted to close interaction between atoms, do not consider whole simulation paths, long-range distances and, importantly, do not provide visual cues for a quick and intuitive comprehension of the energy functions (modeling intermolecular interactions) involved. In this paper, we propose visualizations designed to enable the characterization of interaction forces by taking into account several relevant variables such as molecule-ligand distance and the energy function, which is essential to understand binding affinities. We put emphasis on mapping molecular docking paths obtained from Molecular Dynamics or Monte Carlo simulations, and provide time-dependent visualizations for different energy components and particle resolutions: atoms, groups or residues. The presented visualizations have the potential to support domain experts in a more efficient drug or enzyme design process.",Pedro Hermosilla;Jorge Estrada;Victor Guallar;Timo Ropinski;Àlvar Vinacua;Pere-Pau Vázquez,Pedro Hermosilla;Jorge Estrada;Victor Guallar;Timo Ropinski;Àlvar Vinacua;Pere-Pau Vázquez,"ViRVIG Group, Barcelona Supercomputing Center;Barcelona Supercomputing Center;Barcelona Supercomputing Center;Visual Computing Group, Ulm University;ViRVIG Group, UPC, Barcelona;ViRVIG Group, UPC, Barcelona",10.1109/TVCG.2009.168;10.1109/TVCG.2012.282;10.1109/TVCG.2015.2467293;10.1109/TVCG.2007.70578;10.1109/TVCG.2006.115;10.1109/TVCG.2007.70517;10.1109/TVCG.2014.2346403;10.1109/TVCG.2009.157,Molecular visualization;binding analysis,8,10,52,
SciVis,2016,Topological Analysis of Inertial Dynamics,10.1109/TVCG.2016.2599018,http://dx.doi.org/10.1109/TVCG.2016.2599018,950,959,J,"Traditional vector field visualization has a close focus on velocity, and is typically constrained to the dynamics of massless particles. In this paper, we present a novel approach to the analysis of the force-induced dynamics of inertial particles. These forces can arise from acceleration fields such as gravitation, but also be dependent on the particle dynamics itself, as in the case of magnetism. Compared to massless particles, the velocity of an inertial particle is not determined solely by its position and time in a vector field. In contrast, its initial velocity can be arbitrary and impacts the dynamics over its entire lifetime. This leads to a four-dimensional problem for 2D setups, and a six-dimensional problem for the 3D case. Our approach avoids this increase in dimensionality and tackles the visualization by an integrated topological analysis approach. We demonstrate the utility of our approach using a synthetic time-dependent acceleration field, a system of magnetic dipoles, and N-body systems both in 2D and 3D.",Antoni Sagristà;Stefan Jordan;Andreas Just;Fabio Dias;Luis Gustavo Nonato;Filip Sadlo,Antoni Sagristà;Stefan Jordan;Andreas Just;Fabio Dias;Luis Gustavo Nonato;Filip Sadlo,"Heidelberg University, Germany;Heidelberg University, Germany;ZAH, Heidelberg University, Germany;Universidade de Såo Paulo, Såo Carlos, Brazil;Universidade de Såo Paulo, Såo Carlos, Brazil;Heidelberg University, Germany",10.1109/VISUAL.1993.398859;10.1109/TVCG.2014.2346415;10.1109/VISUAL.1990.146386,Visualization of inertial dynamics;N-body systems;magnetism;acceleration,8,7,30,
VAST,2016,Toward Theoretical Techniques for Measuring the Use of Human Effort in Visual Analytic Systems,10.1109/TVCG.2016.2598460,http://dx.doi.org/10.1109/TVCG.2016.2598460,121,130,J,"Visual analytic systems have long relied on user studies and standard datasets to demonstrate advances to the state of the art, as well as to illustrate the efficiency of solutions to domain-specific challenges. This approach has enabled some important comparisons between systems, but unfortunately the narrow scope required to facilitate these comparisons has prevented many of these lessons from being generalized to new areas. At the same time, advanced visual analytic systems have made increasing use of human-machine collaboration to solve problems not tractable by machine computation alone. To continue to make progress in modeling user tasks in these hybrid visual analytic systems, we must strive to gain insight into what makes certain tasks more complex than others. This will require the development of mechanisms for describing the balance to be struck between machine and human strengths with respect to analytical tasks and workload. In this paper, we argue for the necessity of theoretical tools for reasoning about such balance in visual analytic systems and demonstrate the utility of the Human Oracle Model for this purpose in the context of sensemaking in visual analytics. Additionally, we make use of the Human Oracle Model to guide the development of a new system through a case study in the domain of cybersecurity.",R. Jordan Crouser;Lyndsey Franklin;Alex Endert;Kristin A. Cook,R. Jordan Crouser;Lyndsey Franklin;Alex Endert;Kris Cook,Smith College;Smith College;Smith College;Smith College,10.1109/VAST.2011.6102467;10.1109/VAST.2010.5652910;10.1109/VAST.2011.6102438;10.1109/TVCG.2012.195;10.1109/VAST.2015.7347625;10.1109/VAST.2007.4389009;10.1109/VAST.2011.6102449;10.1109/VAST.2012.6400486,Theoretical models;human oracle;visual analytics;mixed initiative systems;semantic interaction;sensemaking,8,8,87,
VAST,2016,VisFlow - Web-based Visualization Framework for Tabular Data with a Subset Flow Model,10.1109/TVCG.2016.2598497,http://dx.doi.org/10.1109/TVCG.2016.2598497,251,260,J,"Data flow systems allow the user to design a flow diagram that specifies the relations between system components which process, filter or visually present the data. Visualization systems may benefit from user-defined data flows as an analysis typically consists of rendering multiple plots on demand and performing different types of interactive queries across coordinated views. In this paper, we propose VisFlow, a web-based visualization framework for tabular data that employs a specific type of data flow model called the subset flow model. VisFlow focuses on interactive queries within the data flow, overcoming the limitation of interactivity from past computational data flow systems. In particular, VisFlow applies embedded visualizations and supports interactive selections, brushing and linking within a visualization-oriented data flow. The model requires all data transmitted by the flow to be a data item subset (i.e. groups of table rows) of some original input table, so that rendering properties can be assigned to the subset unambiguously for tracking and comparison. VisFlow features the analysis flexibility of a flow diagram, and at the same time reduces the diagram complexity and improves usability. We demonstrate the capability of VisFlow on two case studies with domain experts on real-world datasets showing that VisFlow is capable of accomplishing a considerable set of visualization and analysis tasks. The VisFlow system is available as open source on GitHub.",Bowen Yu 0004;Cláudio T. Silva,Bowen Yu;Cláudio T. Silva,New York University;New York University,10.1109/TVCG.2009.195;10.1109/INFVIS.2004.12;10.1109/VAST.2011.6102440;10.1109/INFVIS.1998.729560;10.1109/TVCG.2014.2346260;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2011.225;10.1109/INFVIS.2003.1249013;10.1109/VISUAL.2005.1532788;10.1109/TVCG.2014.2346753;10.1109/TVCG.2011.185;10.1109/TVCG.2014.2346291,Visualization framework;data flow;subset flow model;tabular data,8,11,47,
VAST,2016,What do Constraint Programming Users Want to See? Exploring the Role of Visualisation in Profiling of Models and Search,10.1109/TVCG.2016.2598545,http://dx.doi.org/10.1109/TVCG.2016.2598545,281,290,J,"Constraint programming allows difficult combinatorial problems to be modelled declaratively and solved automatically. Advances in solver technologies over recent years have allowed the successful use of constraint programming in many application areas. However, when a particular solver's search for a solution takes too long, the complexity of the constraint program execution hinders the programmer's ability to profile that search and understand how it relates to their model. Therefore, effective tools to support such profiling and allow users of constraint programming technologies to refine their model or experiment with different search parameters are essential. This paper details the first user-centred design process for visual profiling tools in this domain. We report on: our insights and opportunities identified through an on-line questionnaire and a creativity workshop with domain experts carried out to elicit requirements for analytical and visual profiling techniques; our designs and functional prototypes realising such techniques; and case studies demonstrating how these techniques shed light on the behaviour of the solvers in practice.",Sarah Goodwin;Christopher Mears;Tim Dwyer;Maria Garcia de la Banda;Guido Tack;Mark Wallace 0001,Sarah Goodwin;Christopher Mears;Tim Dwyer;Maria Garcia de la Banda;Guido Tack;Mark Wallace,"Adaptive Visualisation LabMonash University;Faculty of Information Technology, Monash University;Adaptive Visualisation LabMonash University;Faculty of Information Technology, Monash University;Faculty of Information Technology, Monash University;Faculty of Information Technology, Monash University",10.1109/TVCG.2013.145;10.1109/TVCG.2014.2346321;10.1109/TVCG.2015.2467751;10.1109/INFVIS.2004.70;10.1109/TVCG.2014.2346578;10.1109/TVCG.2013.151;10.1109/TVCG.2015.2467851;10.1109/INFVIS.2000.885103,visual analytics;user-centred design;profiling;constraint programming;tree visualisations,8,12,39,
InfoVis,2017,Data Visualization Saliency Model: A Tool for Evaluating Abstract Data Visualizations,10.1109/TVCG.2017.2743939,http://dx.doi.org/10.1109/TVCG.2017.2743939,563,573,J,"Evaluating the effectiveness of data visualizations is a challenging undertaking and often relies on one-off studies that test a visualization in the context of one specific task. Researchers across the fields of data science, visualization, and human-computer interaction are calling for foundational tools and principles that could be applied to assessing the effectiveness of data visualizations in a more rapid and generalizable manner. One possibility for such a tool is a model of visual saliency for data visualizations. Visual saliency models are typically based on the properties of the human visual cortex and predict which areas of a scene have visual features (e.g. color, luminance, edges) that are likely to draw a viewer's attention. While these models can accurately predict where viewers will look in a natural scene, they typically do not perform well for abstract data visualizations. In this paper, we discuss the reasons for the poor performance of existing saliency models when applied to data visualizations. We introduce the Data Visualization Saliency (DVS) model, a saliency model tailored to address some of these weaknesses, and we test the performance of the DVS model and existing saliency models by comparing the saliency maps produced by the models to eye tracking data obtained from human viewers. Finally, we describe how modified saliency models could be used as general tools for assessing the effectiveness of visualizations, including the strengths and weaknesses of this approach.",Laura E. Matzen;Michael J. Haass;Kristin Divis;Zhiyuan Wang;Andrew T. Wilson,Laura E. Matzen;Michael J. Haass;Kristin M. Divis;Zhiyuan Wang;Andrew T. Wilson,"Sandia National Laboratories;Sandia National Laboratories;Sandia National Laboratories;University of Illinois, Urbana-Champaign;Sandia National Laboratories",10.1109/TVCG.2015.2467732,"Visual saliency,evaluation,eye tracking",8,2,49,
InfoVis,2017,Visualizing Nonlinear Narratives with Story Curves,10.1109/TVCG.2017.2744118,http://dx.doi.org/10.1109/TVCG.2017.2744118,595,604,J,"In this paper, we present story curves, a visualization technique for exploring and communicating nonlinear narratives in movies. A nonlinear narrative is a storytelling device that portrays events of a story out of chronological order, e.g., in reverse order or going back and forth between past and future events. Many acclaimed movies employ unique narrative patterns which in turn have inspired other movies and contributed to the broader analysis of narrative patterns in movies. However, understanding and communicating nonlinear narratives is a difficult task due to complex temporal disruptions in the order of events as well as no explicit records specifying the actual temporal order of the underlying story. Story curves visualize the nonlinear narrative of a movie by showing the order in which events are told in the movie and comparing them to their actual chronological order, resulting in possibly meandering visual patterns in the curve. We also present Story Explorer, an interactive tool that visualizes a story curve together with complementary information such as characters and settings. Story Explorer further provides a script curation interface that allows users to specify the chronological order of events in movies. We used Story Explorer to analyze 10 popular nonlinear movies and describe the spectrum of narrative patterns that we discovered, including some novel patterns not previously described in the literature. Feedback from experts highlights potential use cases in screenplay writing and analysis, education and film production. A controlled user study shows that users with no expertise are able to understand visual patterns of nonlinear narratives using story curves.",Nam Wook Kim;Benjamin Bach;Hyejin Im;Sasha Schriber;Markus H. Gross;Hanspeter Pfister,Nam Wook Kim;Benjamin Bach;Hyejin Im;Sasha Schriber;Markus Gross;Hanspeter Pfister,"John A. Paulson School of Engineering and Applied SciencesHarvard University;John A. Paulson School of Engineering and Applied SciencesHarvard University;Independent scholar;Disney Research, Z&#x00FC;rich;Disney Research, Z&#x00FC;rich;John A. Paulson School of Engineering and Applied SciencesHarvard University",10.1109/TVCG.2016.2598920;10.1109/TVCG.2013.196;10.1109/TVCG.2015.2467811;10.1109/TVCG.2009.167;10.1109/TVCG.2012.212;10.1109/TVCG.2015.2468151,"Nonlinear narrative,storytelling,visualization",8,2,54,
InfoVis,2017,Functional Decomposition for Bundled Simplification of Trail Sets,10.1109/TVCG.2017.2744338,http://dx.doi.org/10.1109/TVCG.2017.2744338,500,510,J,"Bundling visually aggregates curves to reduce clutter and help finding important patterns in trail-sets or graph drawings. We propose a new approach to bundling based on functional decomposition of the underling dataset. We recover the functional nature of the curves by representing them as linear combinations of piecewise-polynomial basis functions with associated expansion coefficients. Next, we express all curves in a given cluster in terms of a centroid curve and a complementary term, via a set of so-called principal component functions. Based on the above, we propose a two-fold contribution: First, we use cluster centroids to design a new bundling method for 2D and 3D curve-sets. Secondly, we deform the cluster centroids and generate new curves along them, which enables us to modify the underlying data in a statistically-controlled way via its simplified (bundled) view. We demonstrate our method by applications on real-world 2D and 3D datasets for graph bundling, trajectory analysis, and vector field and tensor field visualization.",Christophe Hurter;Stéphane Puechmorel;Florence Nicol;Alexandru Telea,Christophe Hurter;Stéphane Puechmorel;Florence Nicol;Alexandru Telea,ENAC;ENAC;ENAC;University of Groningen,10.1109/TVCG.2013.124;10.1109/TVCG.2011.202;10.1109/TVCG.2008.135;10.1109/TVCG.2011.233;10.1109/TVCG.2009.138;10.1109/VAST.2008.4677380;10.1109/VISUAL.2004.32;10.1109/TVCG.2006.147;10.1109/TVCG.2011.223;10.1109/VISUAL.2005.1532832;10.1109/VISUAL.2005.1532779;10.1109/INFVIS.2005.1532150;10.1109/TVCG.2011.181;10.1109/TVCG.2011.190,"path visualization,trajectory visualization,edge bundles,functional decomposition,path generation,streamlines",8,4,74,
InfoVis,2017,TACO: Visualizing Changes in Tables Over Time,10.1109/TVCG.2017.2745298,http://dx.doi.org/10.1109/TVCG.2017.2745298,677,686,J,"Multivariate, tabular data is one of the most common data structures used in many different domains. Over time, tables can undergo changes in both structure and content, which results in multiple versions of the same table. A challenging task when working with such derived tables is to understand what exactly has changed between versions in terms of additions/deletions, reorder, merge/split, and content changes. For textual data, a variety of commonplace “diff” tools exist that support the task of investigating changes between revisions of a text. Although there are some comparison tools which assist users in inspecting differences between multiple table instances, the resulting visualizations are often difficult to interpret or do not scale to large tables with thousands of rows and columns. To address these challenges, we developed TACO, an interactive comparison tool that visualizes the differences between multiple tables at various levels of detail. With TACO we show (1) the aggregated differences between multiple table versions over time, (2) the aggregated changes between two selected table versions, and (3) detailed changes between the selected tables. To demonstrate the effectiveness of our approach, we show its application by means of two usage scenarios.",Christina Stoiber;Holger Stitz;Reem Hourieh;Florian Grassinger;Wolfgang Aigner;Marc Streit,Christina Niederer;Holger Stitz;Reem Hourieh;Florian Grassinger;Wolfgang Aigner;Marc Streit,"St. Pölten University of Applied Sciences, Austria;Johannes Kepler University, Linz, Austria;Johannes Kepler University, Linz, Austria;St. Pölten University of Applied Sciences, Austria;TU Wien, Austria;Johannes Kepler University, Linz, Austria",10.1109/TVCG.2012.233;10.1109/TVCG.2010.138;10.1109/TVCG.2013.213;10.1109/TVCG.2012.237,"Table comparison,matrix,difference visualization",8,5,30,
InfoVis,2017,Revisiting Stress Majorization as a Unified Framework for Interactive Constrained Graph Visualization,10.1109/TVCG.2017.2745919,http://dx.doi.org/10.1109/TVCG.2017.2745919,489,499,J,"We present an improved stress majorization method that incorporates various constraints, including directional constraints without the necessity of solving a constraint optimization problem. This is achieved by reformulating the stress function to impose constraints on both the edge vectors and lengths instead of just on the edge lengths (node distances). This is a unified framework for both constrained and unconstrained graph visualizations, where we can model most existing layout constraints, as well as develop new ones such as the star shapes and cluster separation constraints within stress majorization. This improvement also allows us to parallelize computation with an efficient GPU conjugant gradient solver, which yields fast and stable solutions, even for large graphs. As a result, we allow the constraint-based exploration of large graphs with 10K nodes - an approach which previous methods cannot support.",Yunhai Wang;Yanyan Wang;Yinqi Sun;Lifeng Zhu;Kecheng Lu;Chi-Wing Fu;Michael Sedlmair;Oliver Deussen;Baoquan Chen,Yunhai Wang;Yanyan Wang;Yinqi Sun;Lifeng Zhu;Kecheng Lu;Chi-Wing Fu;Michael Sedlmair;Oliver Deussen;Baoquan Chen,"Shandong University;Shandong University;Shandong University;Southeast University;Shandong University;VRHIT SIATChinese University of Hong Kong;University of Vienna, Austria;Konstanz University, VCC SIAT, China;Shandong University",10.1109/INFVIS.2005.1532130;10.1109/TVCG.2006.156;10.1109/TVCG.2009.109;10.1109/TVCG.2008.130;10.1109/INFVIS.2004.66;10.1109/TVCG.2009.108;10.1109/TVCG.2012.236,"Graph visualization,stress majorization,constraints",8,10,51,
SciVis,2017,Robust Detection and Visualization of Jet-Stream Core Lines in Atmospheric Flow,10.1109/TVCG.2017.2743989,http://dx.doi.org/10.1109/TVCG.2017.2743989,893,902,J,"Jet-streams, their core lines and their role in atmospheric dynamics have been subject to considerable meteorological research since the first half of the twentieth century. Yet, until today no consistent automated feature detection approach has been proposed to identify jet-stream core lines from 3D wind fields. Such 3D core lines can facilitate meteorological analyses previously not possible. Although jet-stream cores can be manually analyzed by meteorologists in 2D as height ridges in the wind speed field, to the best of our knowledge no automated ridge detection approach has been applied to jet-stream core detection. In this work, we -a team of visualization scientists and meteorologists-propose a method that exploits directional information in the wind field to extract core lines in a robust and numerically less involved manner than traditional 3D ridge detection. For the first time, we apply the extracted 3D core lines to meteorological analysis, considering real-world case studies and demonstrating our method's benefits for weather forecasting and meteorological research.",Michael Kern;Tim Hewson;Filip Sadlo;Rüdiger Westermann;Marc Rautenhaus,Michael Kern;Tim Hewson;Filip Sadlo;Rüdiger Westermann;Marc Rautenhaus,"Computer Graphics & Visualization Group, Technische Universität, München, Garching, Germany;European Centre for Medium-Range Weather Forecasts, Reading, UK;Visual Computing Group, Heidelberg University, Heidelberg, Germany;Computer Graphics & Visualization Group, Technische Universität, München, Garching, Germany;Computer Graphics & Visualization Group, Technische Universität, München, Garching, Germany",10.1109/TVCG.2007.70554,"Meteorology,weather forecast,jet-stream,feature detection",8,10,54,
SciVis,2017,On the Treatment of Field Quantities and Elemental Continuity in FEM Solutions,10.1109/TVCG.2017.2744058,http://dx.doi.org/10.1109/TVCG.2017.2744058,903,912,J,"As the finite element method (FEM) and the finite volume method (FVM), both traditional and high-order variants, continue their proliferation into various applied engineering disciplines, it is important that the visualization techniques and corresponding data analysis tools that act on the results produced by these methods faithfully represent the underlying data. To state this in another way: the interpretation of data generated by simulation needs to be consistent with the numerical schemes that underpin the specific solver technology. As the verifiable visualization literature has demonstrated: visual artifacts produced by the introduction of either explicit or implicit data transformations, such as data resampling, can sometimes distort or even obfuscate key scientific features in the data. In this paper, we focus on the handling of elemental continuity, which is often only<inline-formula><tex-math notation=""LaTeX"">$C^{0}$</tex-math><alternatives><inline-graphic xlink:href=""24tvcg01-jallepalli-2744058-ieq-1-source.tif"" xmlns:xlink=""http://www.w3.org/1999/xlink""/></alternatives></inline-formula>continuous or piecewise discontinuous, when visualizing primary or derived fields from FEM or FVM simulations. We demonstrate that traditional data handling and visualization of these fields introduce visual errors. In addition, we show how the use of the recently proposed line-SIAC filter provides a way of handling elemental continuity issues in an accuracy-conserving manner with the added benefit of casting the data in a smooth context even if the representation is element discontinuous.",Ashok Jallepalli;Julia Docampo-Sánchez;Jennifer K. Ryan;Robert Haimes;Robert Michael Kirby,Ashok Jallepalli;Julia Docampo-Sánchez;Jennifer K. Ryan;Robert Haimes;Robert M. Kirby,SCI InstituteUniversity of Utah;School of MathematicsUniversity of East Anglia;School of MathematicsUniversity of East Anglia;Department of AeronauticsMIT;SCI InstituteUniversity of Utah,10.1109/VISUAL.2004.65;10.1109/TVCG.2011.206;10.1109/TVCG.2012.218,"Flow Visualization,discontinuous Galerkin (dG) methods,continuous Galerkin (cG) methods,finite element methods (FEM),finite volume methods,filtering techniques,Scalar Field Data,Irregular and Unstructured Grids,Extraction of Surfaces((Isosurfaces)",8,3,30,
SciVis,2017,SparseLeap: Efficient Empty Space Skipping for Large-Scale Volume Rendering,10.1109/TVCG.2017.2744238,http://dx.doi.org/10.1109/TVCG.2017.2744238,974,983,J,"Recent advances in data acquisition produce volume data of very high resolution and large size, such as terabyte-sized microscopy volumes. These data often contain many fine and intricate structures, which pose huge challenges for volume rendering, and make it particularly important to efficiently skip empty space. This paper addresses two major challenges: (1) The complexity of large volumes containing fine structures often leads to highly fragmented space subdivisions that make empty regions hard to skip efficiently. (2) The classification of space into empty and non-empty regions changes frequently, because the user or the evaluation of an interactive query activate a different set of objects, which makes it unfeasible to pre-compute a well-adapted space subdivision. We describe the novel SparseLeap method for efficient empty space skipping in very large volumes, even around fine structures. The main performance characteristic of SparseLeap is that it moves the major cost of empty space skipping out of the ray-casting stage. We achieve this via a hybrid strategy that balances the computational load between determining empty ray segments in a rasterization (object-order) stage, and sampling non-empty volume data in the ray-casting (image-order) stage. Before ray-casting, we exploit the fast hardware rasterization of GPUs to create a ray segment list for each pixel, which identifies non-empty regions along the ray. The ray-casting stage then leaps over empty space without hierarchy traversal. Ray segment lists are created by rasterizing a set of fine-grained, view-independent bounding boxes. Frame coherence is exploited by re-using the same bounding boxes unless the set of active objects changes. We show that SparseLeap scales better to large, sparse data than standard octree empty space skipping.",Markus Hadwiger;Ali K. Al-Awami;Johanna Beyer;Marco Agus;Hanspeter Pfister,Markus Hadwiger;Ali K. Al-Awami;Johanna Beyer;Marco Agus;Hanspeter Pfister,"King Abdullah University of Science and Technology (KAUST), Saudi Arabia;King Abdullah University of Science and Technology (KAUST), Saudi Arabia;John A. Paulson School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA;King Abdullah University of Science and Technology (KAUST), Saudi Arabia;John A. Paulson School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA",10.1109/VISUAL.1992.235231;10.1109/TVCG.2013.142;10.1109/TVCG.2012.240;10.1109/TVCG.2009.161;10.1109/VISUAL.2005.1532793;10.1109/VISUAL.2005.1532799;10.1109/VISUAL.2003.1250384;10.1109/TVCG.2015.2467331;10.1109/VISUAL.2004.63;10.1109/VISUAL.1999.809908;10.1109/VISUAL.2003.1250388;10.1109/TVCG.2006.197;10.1109/TVCG.2007.70532;10.1109/VISUAL.1995.480792;10.1109/VISUAL.1990.146377;10.1109/VISUAL.2002.1183775;10.1109/VISUAL.1999.809911;10.1109/VISUAL.2001.964521,"Empty Space Skipping,Volume Rendering,Segmented Volume Data,Hybrid Image/Object-Order Approaches",8,9,50,
SciVis,2017,Activity-Centered Domain Characterization for Problem-Driven Scientific Visualization,10.1109/TVCG.2017.2744459,http://dx.doi.org/10.1109/TVCG.2017.2744459,913,922,J,"Although visualization design models exist in the literature in the form of higher-level methodological frameworks, these models do not present a clear methodological prescription for the domain characterization step. This work presents a framework and end-to-end model for requirements engineering in problem-driven visualization application design. The framework and model are based on the activity-centered design paradigm, which is an enhancement of human-centered design. The proposed activity-centered approach focuses on user tasks and activities, and allows an explicit link between the requirements engineering process with the abstraction stage - and its evaluation - of existing, higher-level visualization design models. In a departure from existing visualization design models, the resulting model: assigns value to a visualization based on user activities; ranks user tasks before the user data; partitions requirements in activity-related capabilities and nonfunctional characteristics and constraints; and explicitly incorporates the user workflows into the requirements process. A further merit of this model is its explicit integration of functional specifications, a concept this work adapts from the software engineering literature, into the visualization design nested model. A quantitative evaluation using two sets of interdisciplinary projects supports the merits of the activity-centered model. The result is a practical roadmap to the domain characterization step of visualization design for problem-driven data visualization. Following this domain characterization model can help remove a number of pitfalls that have been identified multiple times in the visualization design literature.",G. Elisabeta Marai,G. Elisabeta Marai,"Electronic Visualization Laboratory, University of Illinois, Chicago",10.1109/TVCG.2013.124;10.1109/TVCG.2013.145;10.1109/TVCG.2011.209;10.1109/TVCG.2013.161;10.1109/TVCG.2014.2346331;10.1109/TVCG.2009.111;10.1109/TVCG.2013.120;10.1109/TVCG.2012.213;10.1109/VISUAL.1992.235203;10.1109/INFVIS.2004.59;10.1109/VISUAL.2005.1532781;10.1109/TVCG.2014.2346323,"Design studies,Tasks and requirements analysis,Visualization models,Domain characterization,Activity-centered design,Functional specifications",8,9,61,
VAST,2017,EVA: Visual Analytics to Identify Fraudulent Events,10.1109/TVCG.2017.2744758,http://dx.doi.org/10.1109/TVCG.2017.2744758,330,339,J,"Financial institutions are interested in ensuring security and quality for their customers. Banks, for instance, need to identify and stop harmful transactions in a timely manner. In order to detect fraudulent operations, data mining techniques and customer profile analysis are commonly used. However, these approaches are not supported by Visual Analytics techniques yet. Visual Analytics techniques have potential to considerably enhance the knowledge discovery process and increase the detection and prediction accuracy of financial fraud detection systems. Thus, we propose EVA, a Visual Analytics approach for supporting fraud investigation, fine-tuning fraud detection algorithms, and thus, reducing false positive alarms.",Roger A. Leite;Theresia Gschwandtner;Silvia Miksch;Simone Kriglstein;Margit Pohl;Erich Gstrein;Johannes Kuntner,Roger A. Leite;Theresia Gschwandtner;Silvia Miksch;Simone Kriglstein;Margit Pohl;Erich Gstrein;Johannes Kuntner,"Vienna University of Technology;Vienna University of Technology;Vienna University of Technology;Faculty of Computer Science, University of Vienna, Austria;Vienna University of Technology;Erste Group IT International, Austria;Erste Group IT International, Austria",10.1109/VAST.2007.4389009;10.1109/TVCG.2013.126;10.1109/VAST.2015.7347678;10.1109/TVCG.2013.200;10.1109/TVCG.2009.111;10.1109/TVCG.2012.273,"Visual Knowledge Discovery,Time Series Data,Business and Finance Visualization,Financial Fraud Detection",8,7,36,
VAST,2017,A Utility-Aware Visual Approach for Anonymizing Multi-Attribute Tabular Data,10.1109/TVCG.2017.2745139,http://dx.doi.org/10.1109/TVCG.2017.2745139,351,360,J,"Sharing data for public usage requires sanitization to prevent sensitive information from leaking. Previous studies have presented methods for creating privacy preserving visualizations. However, few of them provide sufficient feedback to users on how much utility is reduced (or preserved) during such a process. To address this, we design a visual interface along with a data manipulation pipeline that allows users to gauge utility loss while interactively and iteratively handling privacy issues in their data. Widely known and discussed types of privacy models, i.e., syntactic anonymity and differential privacy, are integrated and compared under different use case scenarios. Case study results on a variety of examples demonstrate the effectiveness of our approach.",Xumeng Wang;Jia-Kai Chou;Wei Chen 0001;Huihua Guan;Wenlong Chen;Tianyi Lao;Kwan-Liu Ma,Xumeng Wang;Jia-Kai Chou;Wei Chen;Huihua Guan;Wenlong Chen;Tianyi Lao;Kwan-Liu Ma,"Zhejiang University;University of California, Davis;Zhejiang University;Zhejiang University;Zhejiang University;Zhejiang University;University of California, Davis",10.1109/TVCG.2011.163;10.1109/TVCG.2015.2467671,"Privacy preserving visualization,utility aware anonymization,syntactic anonymity,differential privacy",8,9,38,
VAST,2017,TreePOD: Sensitivity-Aware Selection of Pareto-Optimal Decision Trees,10.1109/TVCG.2017.2745158,http://dx.doi.org/10.1109/TVCG.2017.2745158,174,183,J,"Balancing accuracy gains with other objectives such as interpretability is a key challenge when building decision trees. However, this process is difficult to automate because it involves know-how about the domain as well as the purpose of the model. This paper presents TreePOD, a new approach for sensitivity-aware model selection along trade-offs. TreePOD is based on exploring a large set of candidate trees generated by sampling the parameters of tree construction algorithms. Based on this set, visualizations of quantitative and qualitative tree aspects provide a comprehensive overview of possible tree characteristics. Along trade-offs between two objectives, TreePOD provides efficient selection guidance by focusing on Pareto-optimal tree candidates. TreePOD also conveys the sensitivities of tree characteristics on variations of selected parameters by extending the tree generation process with a full-factorial sampling. We demonstrate how TreePOD supports a variety of tasks involved in decision tree selection and describe its integration in a holistic workflow for building and selecting decision trees. For evaluation, we illustrate a case study for predicting critical power grid states, and we report qualitative feedback from domain experts in the energy sector. This feedback suggests that TreePOD enables users with and without statistical background a confident and efficient identification of suitable decision trees.",Thomas Mühlbacher;Lorenz Linhardt;Torsten Möller;Harald Piringer,Thomas Mühlbacher;Lorenz Linhardt;Torsten Möller;Harald Piringer,VRVis Research Center;ETH Zurich;University of Vienna;VRVis Research Center,10.1109/VAST.2011.6102457;10.1109/TVCG.2010.190;10.1109/TVCG.2008.145;10.1109/TVCG.2014.2346578;10.1109/TVCG.2016.2598589;10.1109/TVCG.2009.110;10.1109/TVCG.2014.2346321;10.1109/TVCG.2010.130;10.1109/TVCG.2011.248;10.1109/VAST.2011.6102453,"Model selection,classification trees,visual parameter search,sensitivity analysis,Pareto optimality",8,7,51,
InfoVis,2018,DXR: A Toolkit for Building Immersive Data Visualizations,10.1109/TVCG.2018.2865152,http://dx.doi.org/10.1109/TVCG.2018.2865152,715,725,J,"This paper presents DXR, a toolkit for building immersive data visualizations based on the Unity development platform. Over the past years, immersive data visualizations in augmented and virtual reality (AR, VR) have been emerging as a promising medium for data sense-making beyond the desktop. However, creating immersive visualizations remains challenging, and often require complex low-level programming and tedious manual encoding of data attributes to geometric and visual properties. These can hinder the iterative idea-to-prototype process, especially for developers without experience in 3D graphics, AR, and VR programming. With DXR, developers can efficiently specify visualization designs using a concise declarative visualization grammar inspired by Vega-Lite. DXR further provides a GUI for easy and quick edits and previews of visualization designs in-situ, i.e., while immersed in the virtual world. DXR also provides reusable templates and customizable graphical marks, enabling unique and engaging visualizations. We demonstrate the flexibility of DXR through several examples spanning a wide range of applications.",Ronell Sicat;Jiabao Li;Junyoung Choi;Maxime Cordeil;Won-Ki Jeong;Benjamin Bach;Hanspeter Pfister,Ronell Sicat;Jiabao Li;Junyoung Choi;Maxime Cordeil;Won-Ki Jeong;Benjamin Bach;Hanspeter Pfister,Harvard Visual Computing Group;Harvard Graduate School of Design;Ulsan National Institute of Science and Technology;Immersive Analytics LabMonash University;Ulsan National Institute of Science and Technology;School of InformaticsEdinburgh University;Harvard Visual Computing Group,10.1109/TVCG.2017.2745941;10.1109/TVCG.2016.2598609;10.1109/TVCG.2009.174;10.1109/TVCG.2011.185;10.1109/TVCG.2014.2346322;10.1109/TVCG.2016.2599107;10.1109/INFVIS.2004.64;10.1109/TVCG.2010.144;10.1109/TVCG.2016.2598620;10.1109/TVCG.2015.2467449;10.1109/TVCG.2014.2346318;10.1109/TVCG.2016.2599030;10.1109/TVCG.2015.2467091;10.1109/TVCG.2017.2744079;10.1109/TVCG.2016.2598608,"Augmented Reality,Virtual Reality,Immersive Visualization,Immersive Analytics,Visualization Toolkit",8,12,72,
InfoVis,2018,Origin-Destination Flow Maps in Immersive Environments,10.1109/TVCG.2018.2865192,http://dx.doi.org/10.1109/TVCG.2018.2865192,693,703,J,"Immersive virtual- and augmented-reality headsets can overlay a flat image against any surface or hang virtual objects in the space around the user. The technology is rapidly improving and may, in the long term, replace traditional flat panel displays in many situations. When displays are no longer intrinsically flat, how should we use the space around the user for abstract data visualisation? In this paper, we ask this question with respect to origin-destination flow data in a global geographic context. We report on the findings of three studies exploring different spatial encodings for flow maps. The first experiment focuses on different 2D and 3D encodings for flows on flat maps. We find that participants are significantly more accurate with raised flow paths whose height is proportional to flow distance but fastest with traditional straight line 2D flows. In our second and third experiment we compared flat maps, 3D globes and a novel interactive design we call<i>MapsLink</i>, involving a pair of linked flat maps. We find that participants took significantly more time with MapsLink than other flow maps while the 3D globe with raised flows was the fastest, most accurate, and most preferred method. Our work suggests that<i>careful</i>use of the third spatial dimension can resolve visual clutter in complex flow maps.",Yalong Yang 0001;Tim Dwyer;Bernhard Jenny;Kim Marriott;Maxime Cordeil;Haohui Chen,Yalong Yang;Tim Dwyer;Bernhard Jenny;Kim Marriott;Maxime Cordeil;Haohui Chen,"Monash University;Monash University;Monash University;Monash University;Monash University;Data61, CSIRO, Australia",10.1109/TVCG.2016.2598958;10.1109/TVCG.2011.202;10.1109/TVCG.2007.70521;10.1109/INFVIS.1995.528697;10.1109/INFVIS.1996.559226;10.1109/INFVIS.2005.1532150;10.1109/TVCG.2011.181;10.1109/TVCG.2014.2346441;10.1109/INFVIS.2003.1249008;10.1109/TVCG.2016.2598885,"Origin-destination,Flow Map,Virtual Reality,Cartographic Information Visualisation,Immersive Analytics",8,5,67,
InfoVis,2018,Charticulator: Interactive Construction of Bespoke Chart Layouts,10.1109/TVCG.2018.2865158,http://dx.doi.org/10.1109/TVCG.2018.2865158,789,799,J,"We present Charticulator, an interactive authoring tool that enables the creation of bespoke and reusable chart layouts. Charticulator is our response to most existing chart construction interfaces that require authors to choose from predefined chart layouts, thereby precluding the construction of novel charts. In contrast, Charticulator transforms a chart specification into mathematical layout constraints and automatically computes a set of layout attributes using a constraint-solving algorithm to realize the chart. It allows for the articulation of compound marks or glyphs as well as links between these glyphs, all without requiring any coding or knowledge of constraint satisfaction. Furthermore, thanks to the constraint-based layout approach, Charticulator can export chart designs into reusable templates that can be imported into other visualization tools. In addition to describing Charticulator's conceptual framework and design, we present three forms of evaluation: a gallery to illustrate its expressiveness, a user study to verify its usability, and a click-count comparison between Charticulator and three existing tools. Finally, we discuss the limitations and potentials of Charticulator as well as directions for future research. Charticulator is available with its source code at https://charticulator.com.",Donghao Ren;Bongshin Lee;Matthew Brehmer,Donghao Ren;Bongshin Lee;Matthew Brehmer,"University of California, Santa Barbara;Microsoft Research;Microsoft Research",10.1109/TVCG.2016.2598609;10.1109/TVCG.2015.2467732;10.1109/TVCG.2009.174;10.1109/TVCG.2011.185;10.1109/TVCG.2006.147;10.1109/TVCG.2016.2598620;10.1109/TVCG.2014.2346291;10.1109/TVCG.2016.2599030;10.1109/TVCG.2015.2467091;10.1109/INFVIS.2000.885086;10.1109/TVCG.2015.2467191,"Interactive visualization authoring,Chart layout design,Glyph design,Constraint-based design,Reusable chart layout",8,11,68,HM
VAST,2018,Visual Analytics for Topic Model Optimization based on User-Steerable Speculative Execution,10.1109/TVCG.2018.2864769,http://dx.doi.org/10.1109/TVCG.2018.2864769,374,384,J,"To effectively assess the potential consequences of human interventions in model-driven analytics systems, we establish the concept of speculative execution as a visual analytics paradigm for creating user-steerable preview mechanisms. This paper presents an explainable, mixed-initiative topic modeling framework that integrates speculative execution into the algorithmic decision-making process. Our approach visualizes the model-space of our novel incremental hierarchical topic modeling algorithm, unveiling its inner-workings. We support the active incorporation of the user's domain knowledge in every step through explicit model manipulation interactions. In addition, users can initialize the model with expected topic seeds, the backbone priors. For a more targeted optimization, the modeling process automatically triggers a speculative execution of various optimization strategies, and requests feedback whenever the measured model quality deteriorates. Users compare the proposed optimizations to the current model state and preview their effect on the next model iterations, before applying one of them. This supervised human-in-the-Ioop process targets maximum improvement for minimum feedback and has proven to be effective in three independent studies that confirm topic model quality improvements.",Mennatallah El-Assady;Fabian Sperrle;Oliver Deussen;Daniel A. Keim;Christopher Collins 0001,Mennatallah El-Assady;Fabian Sperrle;Oliver Deussen;Daniel Keim;Christopher Collins,"University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;University of Ontario Institute of Technology, Canada",10.1109/VAST.2014.7042493;10.1109/VAST.2011.6102461;10.1109/TVCG.2013.162;10.1109/TVCG.2017.2745080;10.1109/TVCG.2017.2744199;10.1109/TVCG.2017.2743959;10.1109/TVCG.2013.231;10.1109/TVCG.2013.212;10.1109/TVCG.2016.2598445;10.1109/TVCG.2014.2346578;10.1109/TVCG.2013.232,"User-Steerable Topic Modeling,Speculative Execution,Mixed-Initiative Visual Analytics,Explainable Machine Learning",8,7,69,
VAST,2018,Seq2Seq-Vis: A Visual Debugging Tool for Sequence-to-Sequence Models,10.1109/TVCG.2018.2865044,http://dx.doi.org/10.1109/TVCG.2018.2865044,353,363,J,"Neural sequence-to-sequence models have proven to be accurate and robust for many sequence prediction tasks, and have become the standard approach for automatic translation of text. The models work with a five-stage blackbox pipeline that begins with encoding a source sequence to a vector space and then decoding out to a new target sequence. This process is now standard, but like many deep learning methods remains quite difficult to understand or debug. In this work, we present a visual analysis tool that allows interaction and “what if”-style exploration of trained sequence-to-sequence models through each stage of the translation process. The aim is to identify which patterns have been learned, to detect model errors, and to probe the model with counterfactual scenario. We demonstrate the utility of our tool through several real-world sequence-to-sequence use cases on large-scale models.",Hendrik Strobelt;Sebastian Gehrmann;Michael Behrisch 0001;Adam Perer;Hanspeter Pfister;Alexander M. Rush,Hendrik Strobelt;Sebastian Gehrmann;Michael Behrisch;Adam Perer;Hanspeter Pfister;Alexander M. Rush,IBM ReseatchMIT-IBM Watson AI Lab.;Harvard NLP group;Hatvatd Visual Computing group;IBM ReseatchMIT-IBM Watson AI Lab.;Hatvatd Visual Computing group;Harvard NLP group,10.1109/TVCG.2017.2744718;10.1109/TVCG.2017.2744478;10.1109/TVCG.2017.2744158,"Explainable AI,Visual Debugging,Visual Analytics,Machine Learning,Deep Learning,NLP",8,22,55,HM
Vis,1991,Volume rendering of flow-visualization point data,10.1109/VISUAL.1991.175772,http://dx.doi.org/10.1109/VISUAL.1991.175772,25,32,C,"A survey of 2D and 3D flow visualization techniques is provided. The approach is based on applying volume rendering to flow-visualization data. Linear interpolation and B-spline approximation are used, and several views are given for both. Suggestions for efficient volume rendering are provided.&lt;&lt;ETX&gt;&gt;",Paul Gene Swann;Sudhanshu Kumar Semwal,P.G. Swann;S.K. Semwal,"Dept. of Comput. Sci., Colorado Univ., Colorado Springs, CO, USA;Dept. of Comput. Sci., Colorado Univ., Colorado Springs, CO, USA",,,7,4,27,
Vis,1991,Acoustic imaging: the reconstruction of underwater objects,10.1109/VISUAL.1991.175784,http://dx.doi.org/10.1109/VISUAL.1991.175784,94,"101, 414",C,"Reconstruction of 3D scenes using data from an acoustic imaging sonar is addressed. The acoustic lens is described, and issues concerning underwater 3D scene reconstruction from the lens data are examined. Two methods for visualizing objects in an acoustic snapshot of the ocean are discussed: mathematical morphology and a synthesis of 3D digital imaging with volume rendering.&lt;&lt;ETX&gt;&gt;",Lawrence J. Rosenblum;Behzad Kamgar-Parsi;Edward O. Belcher;Ola Engelsen,L. Rosenblum;B. Kamgar-Parsi;E. Belcher;O. Engelsen,"US Naval Res. Lab., Washington, DC, USA;US Naval Res. Lab., Washington, DC, USA",,,7,6,11,
Vis,1991,Topographical mapping of brain electrical activity,10.1109/VISUAL.1991.175800,http://dx.doi.org/10.1109/VISUAL.1991.175800,194,201,C,"Current topographical mapping methods and problems associated with mapping are reviewed, and one approach for improving the spatial resolution of scalp recorded EEGs is detailed. In particular, techniques for interpolating the potential distribution and estimating the surface Laplacian from multichannel data are presented and applied to human evoked potential data. Although developed for electroencephalographic data, these spline algorithms can be applied to a variety of fields where visualization of spatial information is desired.&lt;&lt;ETX&gt;&gt;",S. K. Law;P. L. Nunez;A. F. Westdorp;A. V. Nelson;K. L. Pilgreen,S.K. Law;P.L. Nunez;A.F. Westdorp;A.V. Nelson;K.L. Pilgreen,"Dept. of Biomed. Eng., Tulane Univ., New Orleans, LA, USA;Dept. of Biomed. Eng., Tulane Univ., New Orleans, LA, USA;Dept. of Biomed. Eng., Tulane Univ., New Orleans, LA, USA;Dept. of Biomed. Eng., Tulane Univ., New Orleans, LA, USA;Dept. of Biomed. Eng., Tulane Univ., New Orleans, LA, USA",,,7,3,20,
Vis,1991,Multi-valued volumetric visualization,10.1109/VISUAL.1991.175804,http://dx.doi.org/10.1109/VISUAL.1991.175804,218,"225, 424",C,"Effective methods for visualizing several sets of volumetric data simultaneously are presented. The methods involve the composition of multiple volumetric rendering techniques. These techniques include contour curves, color-blended contour regions, projection graphs on surfaces, isovalue surface construction, and hypersurface projection graphs.&lt;&lt;ETX&gt;&gt;",Thomas A. Foley;David A. Lane,T.A. Foley;D.A. Lane,"Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA;Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA",10.1109/VISUAL.1990.146388;10.1109/VISUAL.1990.146373;10.1109/VISUAL.1990.146362;10.1109/VISUAL.1991.175782;10.1109/VISUAL.1990.146363,,7,5,23,
Vis,1992,Volume warping,10.1109/VISUAL.1992.235194,http://dx.doi.org/10.1109/VISUAL.1992.235194,308,315,C,"Volume warping, a technique for deforming sampled volumetric data using B-splines that is related to image warping and to the free-form deformations of T.W. Sederberg and S.R. Parry (1986) and S. Coquillart (1990), is presented. The process is accelerated to near-real-time speed, and the compromises that are made to effect such speeds are explained. This technique expands the repertoire of volumetric modeling techniques and can be applied to any form of volumetric data.&lt;&lt;ETX&gt;&gt;",T. J. True;J. F. Hughes,T.J. True;J.F. Hughes,"Digital Equipment Corp., Maynard, MA, USA",,,7,3,15,
Vis,1993,Feature extraction for oceanographic data using a 3D edge operator,10.1109/VISUAL.1993.398901,http://dx.doi.org/10.1109/VISUAL.1993.398901,402,405,C,"The features of greatest interest in ocean modeling in the Gulf of Mexico and along the Gulf Stream are the fronts and eddies. Resolving, modeling, and tracking these eddies over time is of great importance for climatological studies and economic advancement. In this paper we present a novel technique for automatically locating, contouring, and tracking oceanic features such as eddies and fronts. The models and resultant visualizations exhibit excellent correlation with observed data.&lt;&lt;ETX&gt;&gt;",R. J. Moorehead;Z. Zhu,R.J. Moorehead;Z. Zhu,"NSF Eng. Res. Center for Computational Field Simulation, Mississippi State Univ., MS, USA;NSF Eng. Res. Center for Computational Field Simulation, Mississippi State Univ., MS, USA",,,7,6,7,
Vis,1995,Visualization of high speed aerodynamic configuration design,10.1109/VISUAL.1995.485151,http://dx.doi.org/10.1109/VISUAL.1995.485151,355,"358, 473",C,"Three topics of aerodynamic research at DLR are chosen to illustrate the need for visualization. These include aircraft configuration design variations, adaptation devices and unsteady flow simulation in the transonic, the supersonic and the hypersonic speed regime call for the combined use of a geometry generator, a powerful graphic system and video technology. Projects currently under investigation are illustrated and generic case studies are presented.",Monika Hannemann;Helmut Sobieczky,M. Hannemann;H. Sobieczky,"German Aerosp. Res. Establ., Gottingen, Germany;German Aerosp. Res. Establ., Gottingen, Germany",10.1109/VISUAL.1993.398894,,7,4,11,
Vis,1996,A system for the complementary visualization of 3D volume images using 2D and 3D binaurally processed sonification representations,10.1109/VISUAL.1996.568129,http://dx.doi.org/10.1109/VISUAL.1996.568129,351,354,C,"Typically, feedback from analysis of three-dimensional volume image structures are presented in the visual domain. This ignores the potential for complementary analysis of feedback in the aural domain. This paper presents a system in which visualization of a volume image may be enhanced through representation of the voxel structure by a sound sequence (termed a 'sonification') in which a sequence of sound signals is generated by the mapping of voxel values to pitch, amplitude, timing and other acoustic parameters according to the design of the selected sound instrument(s). Stereo audio or spatial audio processing techniques are employed to enhance the perception of the representative sonification as emanating from the visual loci of the associated voxel.",David Rossiter;Wai-Yin Ng,D. Rossiter;Wai-Yin Ng,"Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Shatin, Hong Kong",10.1109/VISUAL.1990.146398;10.1109/VISUAL.1995.480802,,7,1,8,
InfoVis,1997,Coordinating declarative queries with a direct manipulation data exploration environment,10.1109/INFVIS.1997.636788,http://dx.doi.org/10.1109/INFVIS.1997.636788,65,72,C,"Interactive visualization techniques allow data exploration to be a continuous process, rather than a discrete sequence of queries and results as in traditional database systems. However limitations in expressive power of current visualization systems force users to go outside the system and form a new dataset in order to perform certain operations, such as those involving the relationship among multiple objects. Further, there is no support for integrating data from the new dataset into previous visualizations, so users must recreate them. Visage's information centric paradigm provides an architectural hook for linking data across multiple queries, removing this overhead. This paper describes the addition to Visage of a visual query language, called VQE, which allows users to express more complicated queries than in previous interactive visualization systems. Visualizations can be created from queries and vice versa. When either is updated, the other changes to maintain consistency.",Mark Derthick;Steven F. Roth;John Kolojejchick,M. Derthick;S.F. Roth;J. Kolojejchick,"Robotics Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA",10.1109/INFVIS.1995.528688;10.1109/INFVIS.1996.559210,,7,3,15,
Vis,1997,Visualization of geometric algorithms in an electronic classroom,10.1109/VISUAL.1997.663920,http://dx.doi.org/10.1109/VISUAL.1997.663920,455,458,C,"This paper investigates the visualization and animation of geometric computing in a distributed electronic classroom. We show how focusing in a well-defined domain makes it possible to develop a compact system that is accessible to even naive users. We present a conceptual model and a system, GASP-II (Geometric Animation System, Princeton, II), that realizes this model in the geometric domain. The system allows the presentation and interactive exploration of 3D geometric algorithms over a network.",Maria Shneerson;Ayellet Tal,M. Shneerson;A. Tal,"Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel",,"Algorithm animation, Visualization in Education, Geometric algorithms ",7,1,13,
Vis,1998,Level of detail visualization of scalar data sets on irregular surface meshes,10.1109/VISUAL.1998.745287,http://dx.doi.org/10.1109/VISUAL.1998.745287,73,77,C,"In this article, we build a multi-resolution framework intended to be used for the visualization of continuous piecewise linear functions defined over triangular planar or spherical meshes. In particular, the data set can be viewed at different level of detail, that's to say as a piecewise linear function defined over any simplification of the base mesh. In his multi-resolution form, the function requires strictly the same volume of data than the original input: It is then possible to go through consecutive levels by the use of so-called detail coefficients, with exact reconstruction if desired. We also show how to choose a decimation sequence that leads to a good compromise between the resulting approximation error and the number of removed vertices. The theoretical tools used here are inspired from wavelet-based techniques and extended in the sense that they can handle non-nested approximation spaces.",Georges-Pierre Bonneau;Alexandre Gerussi,G.-P. Bonneau;A. Gerussi,"CNRS, Grenoble, France",10.1109/VISUAL.1996.567602,"wavelets, non-regular triangulations,compression, visualization",7,1,8,
Vis,1998,Interpolation of triangle hierarchies,10.1109/VISUAL.1998.745328,http://dx.doi.org/10.1109/VISUAL.1998.745328,391,396,C,"We consider interpolation between keyframe hierarchies. We impose a set of weak constraints that allows smooth interpolation between two keyframe hierarchies in an animation or, more generally, allows the interpolation in an n-parameter family of hierarchies. We use hierarchical triangulations obtained by the Rivara element bisection algorithm (M. Rivara, 1984) and impose a weak compatibility constraint on the set of root elements of all keyframe hierarchies. We show that the introduced constraints are rather weak. The strength of our approach is that the interpolation works in the class of conforming triangulations and simplifies the task of finding the intermediate hierarchy, which is the union of the two (or more) keyframe hierarchies involved in the interpolation process. This allows for an efficient generation of the intermediate connectivity and additionally ensures that the intermediate hierarchy is again a conforming hierarchy satisfying the same constraints.",Axel Friedrich;Konrad Polthier;Markus Schmies,A. Friedrich;K. Polthier;M. Schmies,"Tech. Univ. Berlin, Germany",,"animation, shape interpolation, adaptive refinement,level-of-detail, multiresolutional representation",7,4,15,
Vis,1998,Key Problems and Thorny Issues in Multidimensional Visualization,10.1109/VISUAL.1998.745354,http://dx.doi.org/10.1109/VISUAL.1998.745354,505,506,M,,Georges G. Grinstein;Sharon J. Laskowski;Alfred Inselberg,G. Grinstein;A. Inselberg;S. Laskowski,University of Massachusetts Lowell,,,7,1,0,
Vis,2000,multi-user view-dependent rendering,10.1109/VISUAL.2000.885713,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2000.885713,335,342,C,"We present a novel architecture which allows rendering of a large-shared dataset at interactive rates on an inexpensive workstation. The idea is based on view-dependent rendering on a client-server network. The server stores the large dataset and manages the selection of the various levels of detail while the inexpensive clients receive a stream of update operations that generate the appropriate level of detail in an incremental fashion. These update operations are based on changes in the clients' view-parameters. Our approach dramatically reduces the amount of memory needed by each client and the entire computing system since the dataset is stored only once on the server's local memory. In addition, it decreases the load on the network as results of the incremental update contributed by view-dependent rendering.",Jihad El-Sana,J. El-Sana,"Dept. of Comput. Sci., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel",10.1109/VISUAL.1999.809877;10.1109/VISUAL.1995.480805,,7,0,0,
Vis,2001,Case study: visualization of particle track data,10.1109/VISUAL.2001.964552,http://dx.doi.org/10.1109/VISUAL.2001.964552,465,468,C,"The Relativistic Heavy Ion Collider (RHIC) experiment at the Brookhaven National Lab is designed to study how the universe came into being. It is believed that after the Big Bang, the universe expanded and cooled, consisting of a soup of quarks, gluons, electrons and neutrinos. As the temperature lowered, electrons combined with protons and formed neutral atoms. Later, clouds of atoms contracted into stars. In this paper, we describe how techniques of volume rendering and information visualization are used to visualize the large particle track data set generated from this high energy physics experiment. The system, called TrackVis, is based on our earlier work of VolVis - Volume Visualization software. Example images of real particle collision data are shown, which are helpful to physicists in investigating the behavior of strongly interacting matter at high energy density.",Xiaoming Wei;Arie E. Kaufman;Timothy J. Hallman,Xiaoming Wei;A.E. Kaufman;T.J. Hallman,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",10.1109/INFVIS.1997.636786;10.1109/INFVIS.1996.559214;10.1109/VISUAL.1994.346340,,7,4,11,
Vis,2001,Case study: interacting with cortical flat maps of the human brain,10.1109/VISUAL.2001.964553,http://dx.doi.org/10.1109/VISUAL.2001.964553,469,472,C,"The complex geometry of the human brain contains many folds and fissures, making it impossible to view the entire surface at once. Since most of the cortical activity occurs on these folds, it is desirable to be able to view the entire surface of the brain in a single view. This can be achieved using quasi-conformal flat maps of the cortical surface. Computational and visualization tools are now needed to be able to interact with these flat maps of the brain to gain information about spatial and functional relationships that might not otherwise be apparent. Such information can contribute to earlier diagnostic tools for diseases and improved treatment. Our group is developing visualization and analysis tools that will help elucidate new information about the human brain through the interaction between a cortical surface and its corresponding quasiconformal flat map.",Monica K. Hurdal;Kevin W. Kurtz;David C. Banks,M.K. Hurdal;K.W. Kurtz;D.C. Banks,"Int. Neuroimaging Consortium, Univ. of Minneapolis, MN, USA",,"Conformal, Cortical Features, Human Brain, Flat Map, Interaction, MRI, Neuroscience, Surface",7,2,17,
Vis,2001,Wind Tunnel Data Fusion and Immersive Visualization: A Case Study,10.1109/VISUAL.2001.964563,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2001.964563,505,508,C,"This case study describes the process of fusing the data from several wind tunnel experiments into a single coherent visualization. Each experiment was conducted independently and was designed to explore different flow features around airplane landing gear. In the past, it would have been very difficult to correlate results from the different experiments. However, with a single 3-D visualization representing the fusion of the three experiments, significant insight into the composite flowfield was observed that would have been extremely difficult to obtain by studying its component parts. The results are even more compelling when viewed in an immersive environment.",Kurt Severance;Paul Brewster;Barry Lazos;Daniel F. Keefe,K. Severance;P. Brewster;B. Lazos;D. Keefe,"NASA Langley Res. Center, Hampton, VA, USA;NASA Langley Res. Center, Hampton, VA, USA;NASA Langley Res. Center, Hampton, VA, USA",10.1109/VISUAL.1998.745331,"Data fusion, Photogrammetry, Line Integral Convolution, Reconstruction, Oil flow, Particle Image Velocimetry, Wind tunnel, Landing gear, Texture mapping, Image-based rendering, VRML",7,1,11,
Vis,2002,BM3D: motion estimation in time dependent volume data,10.1109/VISUAL.2002.1183804,http://dx.doi.org/10.1109/VISUAL.2002.1183804,427,433,C,This paper describes BM3D: a method for the analysis of motion in time dependent volume data. From a sequence of volume data sets a sequence of vector data sets representing the movement of the data is computed. A block matching technique is used for the reconstruction of data movement. The derived vector field can be used for the visualization of time dependent volume data. The method is illustrated in two applications.,Wim C. de Leeuw;Robert van Liere,W. de Leeuw;R. van Liere,"Center for Math. & Comput. Sci., CWI, Amsterdam, Netherlands;Center for Math. & Comput. Sci., CWI, Amsterdam, Netherlands",10.1109/VISUAL.2001.964546,"feature tracking, vector fields, volume visualization, biomedical imaging",7,3,11,
Vis,2002,Case study: A virtual environment for genomic data visualization,10.1109/VISUAL.2002.1183818,http://dx.doi.org/10.1109/VISUAL.2002.1183818,513,516,C,"With the completion of the human genome sequence, and with the proliferation of genome-related annotation data, the need for scalable and more intuitive means for analysis becomes critical, At Variagenics and Small Design Firm, we have addressed this problem with a coherent three-dimensional space in which all data can be seen in a single context. This tool aids in integrating information at vastly divergent scales while maintaining accurate spatial and size relationships. Our visualization was successful in communicating to project teams with diverse backgrounds the magnitude and biological implication of genetic variation.",R. Mark Adams;Blaze Stancampiano;Michael McKenna;David Small,R.M. Adams;B. Stancampiano;M. McKenna;D. Small,"Variagenics Inc., Cambridge, MA, USA;Variagenics Inc., Cambridge, MA, USA",,"Bioinformatics, Human Factors, 3-Dimensional Interaction, Multi-scale Model, Data Navigation, Virtual Environment",7,3,2,
Vis,2002,Case study: Visual debugging of finite element codes,10.1109/VISUAL.2002.1183819,http://dx.doi.org/10.1109/VISUAL.2002.1183819,517,520,C,"We present an innovative application developed at Sandia National Laboratories for visual debugging of unstructured finite element physics codes. Our tool automatically locates anomalous regions, such as inverted elements or nodes whose variable values lie outside a prescribed range, then extracts mesh subsets around these features for detailed examination. The subsets are viewed using color coding of variable values superimposed on the mesh structure. This allows the values and their relative spatial locations within the mesh to be correlated at a glance. Both topological irregularities and hot spots within the data stand out visually, allowing the user to explore the exact numeric values of the grid at surrounding points over time. We demonstrate the utility of this approach by debugging a cell inversion in a simulation of an exploding wire.",Patricia Crossno;David H. Rogers;Christopher J. Garasi,P. Crossno;D.H. Rogers;C.J. Garasi,"Sandia Nat. Labs., USA",10.1109/VISUAL.1999.809919;10.1109/VISUAL.2001.964543,"visual debugging, parallel finite element codes and simulations",7,5,9,
Vis,2002,Case study: Visualizing ocean flow vertical motions using Lagrangian-Eulerian time surfaces,10.1109/VISUAL.2002.1183822,http://dx.doi.org/10.1109/VISUAL.2002.1183822,529,532,C,"Ocean model simulations commonly assume the ocean is hydrostatic, resulting in near zero vertical motion. The vertical motion found is typically associated with the variations of the thermocline depth over time, which are mainly a result of the development and movement of ocean fronts, eddies, and internal waves. A new technique, extended from Lagrangian-Eulerian Advection, is presented to help understand the variation of vertical motion associated with the change in thermocline depth over time. A time surface is correctly deformed in a single direction according to the flow. The evolution of the time surface is computed via a mixture of Eulerian and Lagrangian techniques. The dominant horizontal motion is textured onto the surface using texture advection, while both the horizontal and vertical motions are used to displace the surface. The resulting surface is shaded for enhanced contrast. Timings indicate that the overhead over standard 2D texture advection is no more than 12%.",Josh Grant;Gordon Erlebacher;James F. O'Brien,J. Grant;G. Erlebacher;J. O'Brien,"Center for Ocean-Atmos. Prediction Studies, Florida State Univ., Tallahassee, FL, USA",10.1109/VISUAL.1999.809895;10.1109/VISUAL.2001.964493;10.1109/VISUAL.2000.885688;10.1109/VISUAL.1996.568149,"unsteady vector fields, time surfaces, ocean currents, vertical velocity",7,5,16,
Vis,2002,A case study on multiresolution visualization of local rainfall from weather radar measurements,10.1109/VISUAL.2002.1183823,http://dx.doi.org/10.1109/VISUAL.2002.1183823,533,536,C,"Weather radars can measure the backscatter from rain drops in the atmosphere. A complete radar scan provides three-dimensional precipitation information. For the understanding of the underlying atmospheric processes interactive visualization of these data sets is necessary. This is a challenging task due to the size, structure and required context of the data. In this case study, a multiresolution approach for real-time simultaneous visualization of radar measurements together with the corresponding terrain data is illustrated.",Thomas Gerstner;Dirk Meetschen;Susanne Crewell;Michael Griebel;Clemens Simmer,T. Gerstner;D. Meetschen;S. Crewel;M. Griebel;C. Simmer,"Dept. for Appl. Math., Bonn Univ., Germany",10.1109/VISUAL.1995.480800;10.1109/VISUAL.1997.663869;10.1109/VISUAL.2000.885745,"triangular and tetrahedral grid refinement, multiresolution isosurface extraction, level-of-detail",7,6,16,
Vis,2003,A framework for sample-based rendering with O-buffers,10.1109/VISUAL.2003.1250405,http://dx.doi.org/10.1109/VISUAL.2003.1250405,441,448,C,"We present an innovative modeling and rendering primitive, called the O-buffer, for sample-based graphics, such as images, volumes and points. The 2D or 3D O-buffer is in essence a conventional image or a volume, respectively, except that samples are not restricted to a regular grid. A sample position in the O-buffer is recorded as an offset to the nearest grid point of a regular base grid (hence the name O-buffer). The offset is typically quantized for compact representation and efficient rendering. The O-buffer emancipates pixels and voxels from the regular grids and can greatly improve the modeling power of images and volumes. It is a semi-regular structure which lends itself to efficient construction and rendering. Image quality can be improved by storing more spatial information with samples and by avoiding multiple resamplings and delaying reconstruction to the final rendering stage. Using O-buffers, more accurate multi-resolution representations can be developed for images and volumes. It can also be exploited to represent and render unstructured primitives, such as points, particles, curvilinear or irregular volumes. The O-buffer is therefore a uniform representation for a variety of graphics primitives and supports mixing them in the same scene. We demonstrate the effectiveness of the O-buffer with hierarchical O-buffers, layered depth O-buffers, and hybrid volume rendering with O-buffers.",Huamin Qu;Arie E. Kaufman;Ran Shao;Ankush Kumar,Huamin Qu;A. Kaufman;Ran Shao;A. Kumar,"Dept. of Comput. Sci., Stony Brook Univ., NY, USA;Dept. of Comput. Sci., Stony Brook Univ., NY, USA;Dept. of Comput. Sci., Stony Brook Univ., NY, USA;Dept. of Comput. Sci., Stony Brook Univ., NY, USA",10.1109/VISUAL.2001.964492;10.1109/VISUAL.1999.809869;10.1109/VISUAL.1998.745312;10.1109/VISUAL.2000.885680;10.1109/VISUAL.2001.964491;10.1109/VISUAL.2000.885702,"Sample-based rendering, image-based rendering, hybrid rendering, irregular sampling, hierarchy, offset, frame buffer, layered depth image",7,3,28,
Vis,2004,"Visualization of Topological Defects in Nematic Liquid Crystals Using Streamtubes, Streamsurfaces and Ellipsoids",10.1109/VISUAL.2004.117,http://dx.doi.org/10.1109/VISUAL.2004.117,21,21,M,"Researchers in computational condensed matter physics deal with complex data sets consisting of time varying 3D tensor, vector, and scalar quantities. Particularly, in the research of topological defects in nematic liquid crystals (LC) displaying the results of the computer simulation of molecular dynamics presents a challenge. Combining existing immersive and interactive visualization methods we developed new methods that attempt to provide a clear, efficient, and intuitive way to visualize and explore LC data. In addition, the visualization of the data has presented us with a novel method of obtaining the locations of the topological defects present in a liquid crystal system.",Vadim A. Slavin;David H. Laidlaw;Robert Pelcovits;Song Zhang 0004;George Loriot;Andrew Callan-Jones,V.A. Slavin;D.H. Laidlaw;R. Pelcovits;Song Zhang;G. Loriot;A. Callan-Jones,Brown University,,,7,3,6,
Vis,2004,Context-Adaptive Mobile Visualization and Information Management,10.1109/VISUAL.2004.19,http://dx.doi.org/10.1109/VISUAL.2004.19,8,8,M,"This poster abstract presents a scalable information visualization system for mobile devices and desktop systems. It is designed to support the operation and the workflow of wastewater systems. The regarded information data includes general information about buildings and units, process data, occupational safety regulations, work directions and first aid instructions in case of an accident. Technically, the presented framework combines visualization with agent technology in order to automatically scale various visualization types to fit on different platforms like PDAs (Personal Digital Assistants) or Tablet PCs. The implementation is based on but not limited to SQL, JSP, HTML and VRML.",Jochen Ehret;Achim Ebert;Lars Schuchardt;Heidrun Steinmetz;Hans Hagen,J. Ehret;A. Ebert;L. Schuchardt;H. Steinmetz;H. Hagen,German Research Center for Artificial Intelligence,,,7,1,4,
Vis,2005,Volume rendering of smoke propagation CFD data,10.1109/VISUAL.2005.1532813,http://dx.doi.org/10.1109/VISUAL.2005.1532813,335,341,C,"The evacuation of buildings in the event of a fire requires careful planning of ventilation and evacuation routes during early architectural design stages. Different designs are evaluated by simulating smoke propagation using computational fluid dynamics (CFD). Visibility plays a decisive role in finding the nearest fire exit. This paper presents real-time volume rendering of transient smoke propagation conforming to standardized visibility distances. We visualize time dependent smoke particle concentration on unstructured tetrahedral meshes using a direct volume rendering approach. Due to the linear transfer function of the optical model commonly used in fire protection engineering, accurate pre-integration of diffuse color across tetrahedra can be carried out with a single 2D texture lookup. We reduce rounding errors during frame buffer blending by applying randomized dithering if high accuracy frame buffers are unavailable on the target platform. A simple absorption-based lighting model is evaluated in a preprocessing step using the same rendering approach. Back-illuminated exit signs are commonly used to indicate the escape route. As light emitting objects are visible further than reflective objects, the transfer function in front of illuminated exit signs must be adjusted with a deferred rendering pass.",Oliver Staubli;Christian Sigg;Ronald Peikert;Markus H. Gross;Daniel Gubler,O. Staubli;C. Sigg;R. Peikert;D. Gubler;M. Gross,"Eidgenossische Tech. Hochschule, Zurich, Switzerland;Eidgenossische Tech. Hochschule, Zurich, Switzerland;Eidgenossische Tech. Hochschule, Zurich, Switzerland",10.1109/VISUAL.2000.885683;10.1109/VISUAL.2003.1250390;10.1109/VISUAL.1993.398846;10.1109/VISUAL.2004.85;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.2003.1250385," volume rendering, flow visualization",7,2,22,
Vis,2005,Visualization in the Einstein Year 2005: a case study on explanatory and illustrative visualization of relativity and astrophysics,10.1109/VISUAL.2005.1532845,http://dx.doi.org/10.1109/VISUAL.2005.1532845,583,590,C,"In this application paper, we report on over fifteen years of experience with relativistic and astrophysical visualization, which has been culminating in a substantial engagement for visualization in the Einstein Year 2005 - the 100/sup th/ anniversary of Einstein's publications on special relativity, the photoelectric effect, and Brownian motion. This paper focuses on explanatory and illustrative visualizations used to communicate aspects of the difficult theories of special and general relativity, their geometric structure, and of the related fields of cosmology and astrophysics. We discuss visualization strategies, motivated by physics education and didactics of mathematics, and describe what kind of visualization methods have proven to be useful for different types of media, such as still images in popular-science magazines, film contributions to TV shows, oral presentations, or interactive museum installations. Although our visualization tools build upon existing methods and implementations, these techniques have been improved by several novel technical contributions like image-based special relativistic rendering on GPUs, an extension of general relativistic ray tracing to manifolds described by multiple charts, GPU-based interactive visualization of gravitational light deflection, as well as planetary terrain rendering. The usefulness and effectiveness of our visualizations are demonstrated by reporting on experiences with, and feedback from, recipients of visualizations and collaborators.",Daniel Weiskopf;Marc Borchers;Thomas Ertl;Martin Falk;Oliver Fechtig;Regine Frank;Frank Grave;Andreas King;Ute Kraus;Thomas Müller 0005;Hans-Peter Nollert;Isabel Rica Mendez;Hanns Ruder;Corvin Zahn;Michael Zatloukal;Tobias Schafhitzel;Sonja Schär,D. Weiskopf;H.-P. Nollert;I.R. Mendez;H. Ruder;T. Schafhitzel;S. Schar;C. Zahn;M. Zatloukal;M. Borchers;T. Ertl;M. Falk;O. Fechtig;R. Frank;F. Grave;A. King;U. Kraus;T. Muller,"Graphics, Visualisation, & Usability Lab., Simon Fraser Univ., Burnaby, BC, Canada",10.1109/VISUAL.2000.885709;10.1109/VISUAL.2000.885728;10.1109/VISUAL.2000.885694;10.1109/VISUAL.2003.1250366;10.1109/VISUAL.2004.18,"Visualization, explanatory computer graphics, illustrative visualization, special relativity, general relativity, astrophysics, visualization of mathematics, terrain rendering",7,3,47,
Vis,2007,Listener-based Analysis of Surface Importance for Acoustic Metrics,10.1109/TVCG.2007.70575,http://dx.doi.org/10.1109/TVCG.2007.70575,1680,1687,J,"Acoustic quality in room acoustics is measured by well defined quantities, like definition, which can be derived from simulated impulse response filters or measured values. These take into account the intensity and phase shift of multiple reflections due to a wave front emanating from a sound source. Definition (D&lt;sub&gt;50&lt;/sub&gt;) and clarity (C&lt;sub&gt;50&lt;/sub&gt;) for example correspond to the fraction of the energy received in total to the energy received in the first 50 ms at a certain listener position. Unfortunately, the impulse response measured at a single point does not provide any information about the direction of reflections, and about the reflection surfaces which contribute to this measure. For the visualization of room acoustics, however, this information is very useful since it allows to discover regions with high contribution and provides insight into the influence of all reflecting surfaces to the quality measure. We use the phonon tracing method to calculate the contribution of the reflection surfaces to the impulse response for different listener positions. This data is used to compute importance values for the geometry taking a certain acoustic metric into account. To get a visual insight into the directional aspect, we map the importance to the reflecting surfaces of the geometry. This visualization indicates which parts of the surfaces need to be changed to enhance the chosen acoustic quality measure. We apply our method to the acoustic improvement of a lecture hall by means of enhancing the overall speech comprehensibility (clarity) and evaluate the results using glyphs to visualize the clarity (C&lt;sub&gt;50&lt;/sub&gt;) values at listener positions throughout the room.",Frank Michel 0001;Eduard Deines;Martin Hering-Bertram;Christoph Garth;Hans Hagen,Frank Michel;Eduard Deines;Martin Hering-Bertram;Christoph Garth;Hans Hagen,IRTG Kaiserslautern;IRTG Kaiserslautern;Fraunhofer ITWM Kaiserslautern;University of Kaiserslautern and the Institute for Data Analysis and Visualization at the University of California in Davis;University of Kaiserslautern,10.1109/TVCG.2006.125;10.1109/VISUAL.2005.1532790,"Sound analytics, Applications of Visualization, Room Acoustics, Phonon Tracing, Acoustic Metric",7,3,26,
Vis,2008,Visiting the Gödel Universe,10.1109/TVCG.2008.177,http://dx.doi.org/10.1109/TVCG.2008.177,1563,1570,J,"Visualization of general relativity illustrates aspects of Einstein's insights into the curved nature of space and time to the expert as well as the layperson. One of the most interesting models which came up with Einstein's theory was developed by Kurt Godel in 1949. The Godel universe is a valid solution of Einstein's field equations, making it a possible physical description of our universe. It offers remarkable features like the existence of an optical horizon beyond which time travel is possible. Although we know that our universe is not a Godel universe, it is interesting to visualize physical aspects of a world model resulting from a theory which is highly confirmed in scientific history. Standard techniques to adopt an egocentric point of view in a relativistic world model have shortcomings with respect to the time needed to render an image as well as difficulties in applying a direct illumination model. In this paper we want to face both issues to reduce the gap between common visualization standards and relativistic visualization. We will introduce two techniques to speed up recalculation of images by means of preprocessing and lookup tables and to increase image quality through a special optimization applicable to the Godel universe. The first technique allows the physicist to understand the different effects of general relativity faster and better by generating images from existing datasets interactively. By using the intrinsic symmetries of Godel's spacetime which are expressed by the Killing vector field, we are able to reduce the necessary calculations to simple cases using the second technique. This even makes it feasible to account for a direct illumination model during the rendering process. Although the presented methods are applied to Godel's universe, they can also be extended to other manifolds, for example light propagation in moving dielectric media. Therefore, other areas of research can benefit from these generic improvements.",Frank Grave;Michael Buser,Frank Grave;Michael Buser,VISUS and ITP1;Institute of Quantum Physics,10.1109/TVCG.2006.176;10.1109/VISUAL.2005.1532803;10.1109/TVCG.2007.70530,"General relativity, Godel universe, nonlinear ray tracing, time travel",7,8,27,
InfoVis,2009,Conjunctive Visual Forms,10.1109/TVCG.2009.129,http://dx.doi.org/10.1109/TVCG.2009.129,929,936,J,"Visual exploration of multidimensional data is a process of isolating and extracting relationships within and between dimensions. Coordinated multiple view approaches are particularly effective for visual exploration because they support precise expression of heterogeneous multidimensional queries using simple interactions. Recent visual analytics research has made significant progress in identifying and understanding patterns of composed views and coordinations that support fast, flexible, and open-ended data exploration. What is missing is formalization of the space of expressible queries in terms of visual representation and interaction. This paper introduces the conjunctive visual form model in which visual exploration consists of interactively-driven sequences of transitions between visual states that correspond to conjunctive normal forms in boolean logic. The model predicts several new and useful ways to extend the space of rapidly expressible queries through addition of simple interactive capabilities to existing compositional patterns. Two recent related visual tools offer a subset of these capabilities, providing a basis for conjecturing about such extensions.",Chris Weaver,Chris Weaver,University of Oklahoma,10.1109/VAST.2006.261427;10.1109/INFVIS.2001.963287;10.1109/INFVIS.2003.1249024;10.1109/TVCG.2007.70577;10.1109/VISUAL.1995.485139;10.1109/TVCG.2007.70594;10.1109/INFVIS.1996.559216;10.1109/VAST.2007.4389006;10.1109/VAST.2008.4677370;10.1109/TVCG.2008.153,"Boolean query, brushing, conjunctive normal form, exploratory visualization, multiple views, visual abstraction",7,5,26,
VAST,2009,Poster: Visual prediction of time series,10.1109/VAST.2009.5333420,http://dx.doi.org/10.1109/VAST.2009.5333420,229,230,M,"Many well-known time series prediction methods have been used daily by analysts making decisions. To reach a good prediction, we introduce several new visual analysis techniques of smoothing, multi-scaling, and weighted average with the involvement of human expert knowledge. We combine them into a well-fitted method to perform prediction. We have applied this approach to predict resource consumption in data center for next day planning.",Ming C. Hao;Halldór Janetzko;Ratnesh K. Sharma;Umeshwar Dayal;Daniel A. Keim;Malú Castellanos,Ming C. Hao;Halldor Janetzko;Ratnesh K. Sharma;Umeshwar Dayal;Daniel A. Keim;Malu Castellanos,"Hewlett-Packard Labs, USA;University of Konstanz, Germany;Hewlett-Packard Labs, USA;Hewlett-Packard Labs, USA;University of Konstanz, Germany;Hewlett-Packard Labs, USA",,,7,2,4,
VAST,2009,MassVis: Visual analysis of protein complexes using mass spectrometry,10.1109/VAST.2009.5333895,http://dx.doi.org/10.1109/VAST.2009.5333895,163,170,C,"Protein complexes are formed when two or more proteins non-covalently interact to form a larger three dimensional structure with specific biological function. Understanding the composition of such complexes is vital to understanding cell biology at the molecular level. MassVis is a visual analysis tool designed to assist the interpretation of data from a new workflow for detecting the composition of such protein complexes in biological samples. The data generated by the laboratory workflow naturally lends itself to a scatter plot visualization. However, characteristics of this data give rise to some unique aspects not typical of a standard scatter plot. We are able to take the output from tandem mass spectrometry and render the data in such a way that it mimics more traditional two-dimensional gel techniques and at the same time reveals the correlated behavior indicative of protein complexes. By computationally measuring these correlated patterns in the data, membership in putative complexes can be inferred. User interactions are provided to support both an interactive discovery mode as well as an unsupervised clustering of likely complexes. The specific analysis tasks led us to design a unique arrangement of item selection and coordinated detail views in order to simultaneously view different aspects of the selected item.",Robert Kincaid;Kurt Dejgaard,Robert Kincaid;Kurt Dejgaard,"Agilent Laboratories, USA;McGill University, Canada",10.1109/VISUAL.2005.1532827;10.1109/VISUAL.2005.1532828;10.1109/VAST.2007.4389006,"information visualization, visual analysis, correlation analysis, mass spectrometry, proteomics, interactome",7,8,27,
Vis,2009,Decoupling Illumination from Isosurface Generation Using 4D Light Transport,10.1109/TVCG.2009.137,http://dx.doi.org/10.1109/TVCG.2009.137,1595,1602,J,"One way to provide global illumination for the scientist who performs an interactive sweep through a 3D scalar dataset is to pre-compute global illumination, resample the radiance onto a 3D grid, then use it as a 3D texture. The basic approach of repeatedly extracting isosurfaces, illuminating them, and then building a 3D illumination grid suffers from the non-uniform sampling that arises from coupling the sampling of radiance with the sampling of isosurfaces. We demonstrate how the illumination step can be decoupled from the isosurface extraction step by illuminating the entire 3D scalar function as a 3-manifold in 4-dimensional space. By reformulating light transport in a higher dimension, one can sample a 3D volume without requiring the radiance samples to aggregate along individual isosurfaces in the pre-computed illumination grid.",David C. Banks;Kevin Beason,David C. Banks;Kevin Beason,University of Tennessee;Rhythm and Hues Studios,10.1109/TVCG.2008.108;10.1109/VISUAL.2000.885692;10.1109/VISUAL.2003.1250394,"physically-based illumination, isosurface, level set, light transport",7,5,18,
Vis,2009,Interactive Visual Optimization and Analysis for RfiD Benchmarking,10.1109/TVCG.2009.156,http://dx.doi.org/10.1109/TVCG.2009.156,1335,1342,J,"Radiofrequency identification (RFID) is a powerful automatic remote identification technique that has wide applications. To facilitate RFID deployment, an RFID benchmarking instrument called aGate has been invented to identify the strengths and weaknesses of different RFID technologies in various environments. However, the data acquired by aGate are usually complex time varying multidimensional 3D volumetric data, which are extremely challenging for engineers to analyze. In this paper, we introduce a set of visualization techniques, namely, parallel coordinate plots, orientation plots, a visual history mechanism, and a 3D spatial viewer, to help RFID engineers analyze benchmark data visually and intuitively. With the techniques, we further introduce two workflow procedures (a visual optimization procedure for finding the optimum reader antenna configuration and a visual analysis procedure for comparing the performance and identifying the flaws of RFID devices) for the RFID benchmarking, with focus on the performance analysis of the aGate system. The usefulness and usability of the system are demonstrated in the user evaluation.",Yingcai Wu;Ka-Kei Chung;Huamin Qu;Xiaoru Yuan;Shing-Chi Cheung,Yingcai Wu;Ka-Kei Chung;Huamin Qu;Xiaoru Yuan;S.C. Cheung,"The Department of Computer Science and Engineering at The Hong Kong University of Science and Technology, Clear Water Bay,Kowloon, Hong Kong.;The Department of Computer Science and Engineering at The Hong Kong University of Science and Technology, Clear Water Bay,Kowloon, Hong Kong.;The Department of Computer Science and Engineering at The Hong Kong University of Science and Technology, Clear Water Bay,Kowloon, Hong Kong.;The Key Laboratory of Machine Perceptio (Ministry of Education) and School of EECS, Peking University, Beijing, P.R. China;The Department of Computer Science and Engineering at The Hong Kong University of Science and Technology, Clear Water Bay,Kowloon, Hong Kong.",10.1109/TVCG.2008.131;10.1109/VISUAL.1990.146402;10.1109/TVCG.2007.70535;10.1109/INFVIS.2005.1532141;10.1109/VISUAL.1996.567800;10.1109/INFVIS.2004.2,"RfiD Visualization, Visual analytics, Visual Optimization",7,8,23,
VAST,2010,Visually representing geo-temporal differences,10.1109/VAST.2010.5652951,http://dx.doi.org/10.1109/VAST.2010.5652951,229,230,M,"Data sets that contain geospatial and temporal elements can be challenging to analyze. In particular, it can be difficult to determine how the data have changed over spatial and temporal ranges. In this poster, we present a visual approach for representing the pair-wise differences between geographically and temporally binned data. In addition to providing a novel method for visualizing such geo-temporal differences, GTdiff provides a high degree of interactivity that supports the exploration and analysis of the data.",Orland Hoeber;Garnett Carl Wilson;Simon Harding;René Enguehard;Rodolphe Devillers,Orland Hoeber;Garnett Wilson;Simon Harding;René Enguehard;Rodolphe Devillers,"Department of Computer Science, Memorial University;Department of Computer Science, Memorial University;Department of Computer Science, Memorial University;Department of Geography, Memorial University;Department of Geography, Memorial University",,,7,4,5,
Vis,2010,Visualizing Flow Trajectories Using Locality-based Rendering and Warped Curve Plots,10.1109/TVCG.2010.218,http://dx.doi.org/10.1109/TVCG.2010.218,1587,1594,J,"In flow simulations the behavior and properties of particle trajectories often depend on the physical geometry contained in the simulated environment. Understanding the flow in and around the geometry itself is an important part of analyzing the data. Previous work has often utilized focus+context rendering techniques, with an emphasis on showing trajectories while simplifying or illustratively rendering the physical areas. Our research instead emphasizes the local relationship between particle paths and geometry by using a projected multi-field visualization technique. The correlation between a particle path and its surrounding area is calculated on-the-fly and displayed in a non-intrusive manner. In addition, we support visual exploration and comparative analysis through the use of linked information visualization, such as manipulatable curve plots and one-on-one similarity plots. Our technique is demonstrated on particle trajectories from a groundwater simulation and a computer room airflow simulation, where the flow of particles is highly influenced by the dense geometry.",Chad Jones;Kwan-Liu Ma,Chad Jones;Kwan-Liu Ma,,10.1109/TVCG.2009.136;10.1109/VISUAL.2005.1532850;10.1109/TVCG.2009.145;10.1109/TVCG.2008.186,"Flow visualization, Multi-field visualization, Focus+context visualization, Coordinated linked views",7,5,20,
VAST,2011,Query-based coordinated multiple views with Feature Similarity Space for visual analysis of MRI repositories,10.1109/VAST.2011.6102467,http://dx.doi.org/10.1109/VAST.2011.6102467,267,268,M,"It is a laborious process to quantify relationship patterns within a feature-rich archive. For example, understanding the degree of neuroanatomical similarity between the scanned subjects of a Magnetic Resonance Imaging (MRI) repository is a nontrivial task. In this work we present a Coordinated Multiple View (CMV) system for visually analyzing collections of feature-rich datasets. A query-based user interface operates on a feature-respective data scheme, and is geared towards domain experts that are non-specialists in informatics and analytics. We employ multi-dimensional scaling (MDS) to project feature surface representations into three-dimensions, where proximity in location is proportional to the feature similarity. Through query feedback and environment navigation, the user groups clusters that exhibit probable trends across feature and attribute. The system provides supervised classification methods for determining attribute classes within the user selected groups. Finally, using visual or analytical feature-wise exploration the user determines intra-group feature commonality.",Ian Bowman;Shantanu H. Joshi;John D. Van Horn,Ian Bowman;Shantanu H. Joshi;John Darrell Van Horn,"Laboratory of Neuro Imaging, University of California Los Angeles, 90034, USA;Laboratory of Neuro Imaging, University of California Los Angeles, 90034, USA;Laboratory of Neuro Imaging, University of California Los Angeles, 90034, USA",,,7,5,2,
VAST,2011,TreeVersity: Comparing tree structures by topology and node's attributes differences,10.1109/VAST.2011.6102471,http://dx.doi.org/10.1109/VAST.2011.6102471,275,276,M,"It is common to classify data in hierarchies, they provide a comprehensible way of understanding big amounts of data. From budgets to organizational charts or even the stock market, trees are everywhere and people find them easy to use. However when analysts need to compare two versions of the same tree structure, or two related taxonomies, the task is not so easy. Much work has been done on this topic, but almost all of it has been restricted to either compare the trees by topology, or by the node attribute values. With this project we are proposing TreeVersity, a framework for comparing tree structures, both by structural changes and by differences in the node attributes. This paper is based on our previous work on comparing traffic agencies using LifeFlow [1, 2] and on a first prototype of TreeVersity.",John Alexis Guerra Gómez;Audra Buck-Coleman;Catherine Plaisant;Ben Shneiderman,John Alexis Guerra Gómez;Audra Buck-Coleman;Catherine Plaisant;Ben Shneiderman,"HCIL & Department of Computer Science, University of Maryland, USA;Department of Art, University of Maryland, USA;HCIL & UMIACS, University of Maryland, USA;HCIL & Department of Computer Science, University of Maryland, USA",,,7,0,9,
VAST,2011,Visual analytics of terrorist activities related to epidemics,10.1109/VAST.2011.6102498,http://dx.doi.org/10.1109/VAST.2011.6102498,329,330,M,"The task of the VAST 2011 Grand Challenge was to investigate potential terrorist activities and their relation to the spread of an epidemic. Three different data sets were provided as part of three Mini Challenges (MCs). MC 1 was about analyzing geo-tagged microblogging (Twitter) messages to characterize the spread of an epidemic. MC 2 required analyzing threats to a computer network using a situational awareness approach. In MC 3 possible criminal and terrorist activities were to be analyzed based on a collection of news articles. To solve the Grand Challenge, insight from each of the individual MCs had to be integrated appropriately.",Enrico Bertini;Juri Buchmüller;Fabian Fischer 0001;Stephan Huber;Thomas Lindemeier;Fabian Maass;Florian Mansmann;Thomas Ramm;Michael Regenscheit;Christian Rohrdantz;Christian Scheible;Tobias Schreck;Stephan Sellien;Florian Stoffel;Mark Tautzenberger;Matthias Zieker;Daniel A. Keim,Enrico Bertini;Christian Scheible;Tobias Schreck;Stephan Sellien;Florian Stoffel;Mark Tautzenberger;Matthias Zieker;Daniel A. Keim;Juri Buchmüller;Fabian Fischer;Stephan Huber;Thomas Lindemeier;Fabian Maaß;Florian Mansmann;Thomas Ramm;Michael Regenscheit;Christian Rohrdantz,"Data Analysis and Visualization Group, University of Konstanz, Germany;Data Analysis and Visualization Group, University of Konstanz, Germany;Data Analysis and Visualization Group, University of Konstanz, Germany;Data Analysis and Visualization Group, University of Konstanz, Germany;Data Analysis and Visualization Group, University of Konstanz, Germany;Data Analysis and Visualization Group, University of Konstanz, Germany;Data Analysis and Visualization Group, University of Konstanz, Germany;Data Analysis and Visualization Group, University of Konstanz, Germany;Data Analysis and Visualization Group, University of Konstanz, Germany;Data Analysis and Visualization Group, University of Konstanz, Germany;Data Analysis and Visualization Group, University of Konstanz, Germany;Data Analysis and Visualization Group, University of Konstanz, Germany;Data Analysis and Visualization Group, University of Konstanz, Germany;Data Analysis and Visualization Group, University of Konstanz, Germany;Data Analysis and Visualization Group, University of Konstanz, Germany;Data Analysis and Visualization Group, University of Konstanz, Germany;Data Analysis and Visualization Group, University of Konstanz, Germany",,,7,3,13,
Vis,2011,FoamVis: Visualization of 2D Foam Simulation Data,10.1109/TVCG.2011.204,http://dx.doi.org/10.1109/TVCG.2011.204,2096,2105,J,"Research in the field of complex fluids such as polymer solutions, particulate suspensions and foams studies how the flow of fluids with different material parameters changes as a result of various constraints. Surface Evolver, the standard solver software used to generate foam simulations, provides large, complex, time-dependent data sets with hundreds or thousands of individual bubbles and thousands of time steps. However this software has limited visualization capabilities, and no foam specific visualization software exists. We describe the foam research application area where, we believe, visualization has an important role to play. We present a novel application that provides various techniques for visualization, exploration and analysis of time-dependent 2D foam simulation data. We show new features in foam simulation data and new insights into foam behavior discovered using our application.",Dan R. Lipsa;Robert S. Laramee;Simon J. Cox;Tudur Davies,Dan Lipsa;Robert Laramee;Simon Cox;Tudur Davies,Swansea University;Swansea University;Aberystwyth University;Aberystwyth University,10.1109/TVCG.2008.147;10.1109/TVCG.2008.139,"Surface Evolver, bubble-scale simulation, time-dependent visualizations",7,6,32,
Vis,2011,Quasi Interpolation With Voronoi Splines,10.1109/TVCG.2011.230,http://dx.doi.org/10.1109/TVCG.2011.230,1832,1841,J,"We present a quasi interpolation framework that attains the optimal approximation-order of Voronoi splines for reconstruction of volumetric data sampled on general lattices. The quasi interpolation framework of Voronoi splines provides an unbiased reconstruction method across various lattices. Therefore this framework allows us to analyze and contrast the sampling-theoretic performance of general lattices, using signal reconstruction, in an unbiased manner. Our quasi interpolation methodology is implemented as an efficient FIR filter that can be applied online or as a preprocessing step. We present visual and numerical experiments that demonstrate the improved accuracy of reconstruction across lattices, using the quasi interpolation framework.",Mahsa Mirzargar;Alireza Entezari,Mahsa Mirzargar;Alireza Entezari,University of FLorida;University of Florida,10.1109/TVCG.2008.115;10.1109/VISUAL.2004.65;10.1109/TVCG.2007.70573;10.1109/VISUAL.2001.964498;10.1109/VISUAL.2005.1532810;10.1109/VISUAL.1997.663848;10.1109/VISUAL.1994.346331,"Voronoi Spline, Quasi Interpolation, Volume Visualization, Box spline",7,4,49,
Vis,2011,The Effect of Colour and Transparency on the Perception of Overlaid Grids,10.1109/TVCG.2011.242,http://dx.doi.org/10.1109/TVCG.2011.242,1942,1948,J,"Overlaid reference elements need to be sufficiently visible to effectively relate to the underlying information, but not so obtrusive that they clutter the presentation. We seek to create guidelines for presenting such structures through experimental studies to define boundary conditions for visual intrusiveness. We base our work on the practice of designers, who use transparency to integrate overlaid grids with their underlying imagery. Previous work discovered a useful range of alpha values for black or white grids overlayed on scatterplot images rendered in shades of gray over gray backgrounds of different lightness values. This work compares black grids to blue and red ones on different image types of scatterplots and maps. We expected that the coloured grids over grayscale images would be more visually salient than black ones, resulting in lower alpha values. Instead, we found that there was no significant difference between the boundaries set for red and black grids, but that the boundaries for blue grids were set consistently higher (more opaque). As in our previous study, alpha values are affected by image density rather than image type, and are consistently lower than many default settings. These results have implications for the design of subtle reference structures.",Lyn Bartram;Billy Cheung;Maureen C. Stone,Lyn Bartram;Billy Cheung;Maureen Stone,"School of Interactive Art + Technology, Simon Fraser University;School of Interactive Art + Technology, Simon Fraser University;StoneSoup Consulting / School of Interactive Art + Technology, Simon Fraser University",10.1109/TVCG.2007.70559;10.1109/TVCG.2006.180,"Information visualization, automated presentation, applied perception, visual design, computational aesthetics",7,5,26,
SciVis,2012,Derived Metric Tensors for Flow Surface Visualization,10.1109/TVCG.2012.211,http://dx.doi.org/10.1109/TVCG.2012.211,2149,2158,J,"Integral flow surfaces constitute a widely used flow visualization tool due to their capability to convey important flow information such as fluid transport, mixing, and domain segmentation. Current flow surface rendering techniques limit their expressiveness, however, by focusing virtually exclusively on displacement visualization, visually neglecting the more complex notion of deformation such as shearing and stretching that is central to the field of continuum mechanics. To incorporate this information into the flow surface visualization and analysis process, we derive a metric tensor field that encodes local surface deformations as induced by the velocity gradient of the underlying flow field. We demonstrate how properties of the resulting metric tensor field are capable of enhancing present surface visualization and generation methods and develop novel surface querying, sampling, and visualization techniques. The provided results show how this step towards unifying classic flow visualization and more advanced concepts from continuum mechanics enables more detailed and improved flow analysis.",Harald Obermaier;Kenneth I. Joy,Harald Obermaier;Kenneth I. Joy,"University of California, Davis;University of California, Davis",10.1109/TVCG.2008.163;10.1109/TVCG.2010.173;10.1109/TVCG.2011.170;10.1109/TVCG.2006.134;10.1109/TVCG.2008.133;10.1109/VISUAL.1992.235211;10.1109/TVCG.2007.70551;10.1109/VISUAL.2004.80;10.1109/TVCG.2009.190;10.1109/TVCG.2010.166;10.1109/TVCG.2009.154;10.1109/TVCG.2007.70554,"Vector field, integral surfaces, metric tensor, deformation, velocity gradient, continuum mechanics",7,8,29,
SciVis,2012,SeiVis: An Interactive Visual Subsurface Modeling Application,10.1109/TVCG.2012.259,http://dx.doi.org/10.1109/TVCG.2012.259,2226,2235,J,"The most important resources to fulfill today's energy demands are fossil fuels, such as oil and natural gas. When exploiting hydrocarbon reservoirs, a detailed and credible model of the subsurface structures is crucial in order to minimize economic and ecological risks. Creating such a model is an inverse problem: reconstructing structures from measured reflection seismics. The major challenge here is twofold: First, the structures in highly ambiguous seismic data are interpreted in the time domain. Second, a velocity model has to be built from this interpretation to match the model to depth measurements from wells. If it is not possible to obtain a match at all positions, the interpretation has to be updated, going back to the first step. This results in a lengthy back and forth between the different steps, or in an unphysical velocity model in many cases. This paper presents a novel, integrated approach to interactively creating subsurface models from reflection seismics. It integrates the interpretation of the seismic data using an interactive horizon extraction technique based on piecewise global optimization with velocity modeling. Computing and visualizing the effects of changes to the interpretation and velocity model on the depth-converted model on the fly enables an integrated feedback loop that enables a completely new connection of the seismic data in time domain and well data in depth domain. Using a novel joint time/depth visualization, depicting side-by-side views of the original and the resulting depth-converted data, domain experts can directly fit their interpretation in time domain to spatial ground truth data. We have conducted a domain expert evaluation, which illustrates that the presented workflow enables the creation of exact subsurface models much more rapidly than previous approaches.",Thomas Höllt;Wolfgang Freiler;Fritz Gschwantner;Helmut Doleisch;Gabor Heinemann;Markus Hadwiger,Thomas Höllt;Wolfgang Freiler;Fritz-M. Gschwantner;Helmut Doleisch;Gabor Heinemann;Markus Hadwiger,"King Adbullah University of Science and Technology, Saudi Arabia;SimVis GmbH, Austria;VRVis Research Center, Austria;SimVis GmbH, Austria;Heinemann Oil GmbH, Austria;King Adbullah University of Science and Technology, Saudi Arabia",10.1109/TVCG.2009.136;10.1109/TVCG.2006.140;10.1109/VISUAL.2005.1532802;10.1109/VISUAL.2003.1250400,"Seismic visualization, volume deformation, exploded views, seismic interpretation",7,8,23,
SciVis,2012,Visualization of Astronomical Nebulae via Distributed Multi-GPU Compressed Sensing Tomography,10.1109/TVCG.2012.281,http://dx.doi.org/10.1109/TVCG.2012.281,2188,2197,J,"The 3D visualization of astronomical nebulae is a challenging problem since only a single 2D projection is observable from our fixed vantage point on Earth. We attempt to generate plausible and realistic looking volumetric visualizations via a tomographic approach that exploits the spherical or axial symmetry prevalent in some relevant types of nebulae. Different types of symmetry can be implemented by using different randomized distributions of virtual cameras. Our approach is based on an iterative compressed sensing reconstruction algorithm that we extend with support for position-dependent volumetric regularization and linear equality constraints. We present a distributed multi-GPU implementation that is capable of reconstructing high-resolution datasets from arbitrary projections. Its robustness and scalability are demonstrated for astronomical imagery from the Hubble Space Telescope. The resulting volumetric data is visualized using direct volume rendering. Compared to previous approaches, our method preserves a much higher amount of detail and visual variety in the 3D visualization, especially for objects with only approximate symmetry.",Stephan Wenger;Marco Ament;Stefan Guthe;Dirk A. Lorenz;Andreas M. Tillmann;Daniel Weiskopf;Marcus A. Magnor,Stephan Wenger;Marco Ament;Stefan Guthe;Dirk Lorenz;Andreas Tillmann;Daniel Weiskopf;Marcus Magnor,"Institut für Computergraphik, TU Braunschweig, Germany;Visualization Research Center, Universität Stuttgart, Germany;Institut für Computergraphik, TU Braunschweig, Germany;Institute for Analysis and Algebra, TU Braunschweig, Germany;Research Group Optimization, TU Darmstadt, Germany;Visualization Research Center, Universität Stuttgart, Germany;Institut für Computergraphik, TU Braunschweig, Germany",10.1109/VISUAL.2005.1532803;10.1109/VISUAL.2004.18;10.1109/VISUAL.1994.346331,"Astronomical visualization, distributed volume reconstruction, direct volume rendering",7,7,38,
VAST,2012,An adaptive parameter space-filling algorithm for highly interactive cluster exploration,10.1109/VAST.2012.6400493,http://dx.doi.org/10.1109/VAST.2012.6400493,13,22,C,"For a user to perceive continuous interactive response time in a visualization tool, the rule of thumb is that it must process, deliver, and display rendered results for any given interaction in under 100 milliseconds. In many visualization systems, successive interactions trigger independent queries and caching of results. Consequently, computationally expensive queries like multidimensional clustering cannot keep up with rapid sequences of interactions, precluding visual benefits such as motion parallax. In this paper, we describe a heuristic prefetching technique to improve the interactive response time of KMeans clustering in dynamic query visualizations of multidimensional data. We address the tradeoff between high interaction and intense query computation by observing how related interactions on overlapping data subsets produce similar clustering results, and characterizing these similarities within a parameter space of interaction. We focus on the two-dimensional parameter space defined by the minimum and maximum values of a time range manipulated by dragging and stretching a one-dimensional filtering lens over a plot of time series data. Using calculation of nearest neighbors of interaction points in parameter space, we reuse partial query results from prior interaction sequences to calculate both an immediate best-effort clustering result and to schedule calculation of an exact result. The method adapts to user interaction patterns in the parameter space by reprioritizing the interaction neighbors of visited points in the parameter space. A performance study on Mesonet meteorological data demonstrates that the method is a significant improvement over the baseline scheme in which interaction triggers on-demand, exact-range clustering with LRU caching. We also present initial evidence that approximate, temporary clustering results are sufficiently accurate (compared to exact results) to convey useful cluster structure during rapid and protracted interaction.",Zafar Ahmed;Chris Weaver,Zafar Ahmed;Chris Weaver,School of Computer Science and Center for Spatial Analysis The University of Oklahoma;School of Computer Science and Center for Spatial Analysis The University of Oklahoma,10.1109/TVCG.2007.70515;10.1109/INFVIS.2004.12;10.1109/VAST.2009.5332629;10.1109/VAST.2008.4677357;10.1109/TVCG.2011.188;10.1109/VISUAL.1994.346302;10.1109/INFVIS.1998.729559;10.1109/VAST.2007.4388999,,7,5,31,
VAST,2012,A generic model for the integration of interactive visualization and statistical computing using R,10.1109/VAST.2012.6400537,http://dx.doi.org/10.1109/VAST.2012.6400537,233,234,M,"This poster describes general concepts of integrating the statistical computation package R into a coordinated multiple views framework. The integration is based on a cyclic analysis workflow. In this model, interactive selections are a key aspect to trigger and control computations in R. Dynamic updates of data columns are a generic mechanism to transfer computational results back to the interactive visualization. Further aspects include the integration of the R console and an R object browser as views in our system. We illustrate our approach by means of an interactive modeling process.",Johannes Kehrer;Roland N. Boubela;Peter Filzmoser;Harald Piringer,Johannes Kehrer;Roland N. Boubela;Peter Filzmoser;Harald Piringer,"VRVis Research Center, Vienna, Austria;Dept. of Statistics and Probability Theory, Vienna University of Technology, Austria;Dept. of Statistics and Probability Theory, Vienna University of Technology, Austria;VRVis Research Center, Vienna, Austria",,,7,6,7,
InfoVis,2013,Automatic Layout of Structured Hierarchical Reports,10.1109/TVCG.2013.137,http://dx.doi.org/10.1109/TVCG.2013.137,2586,2595,J,"Domain-specific database applications tend to contain a sizable number of table-, form-, and report-style views that must each be designed and maintained by a software developer. A significant part of this job is the necessary tweaking of low-level presentation details such as label placements, text field dimensions, list or table styles, and so on. In this paper, we present a horizontally constrained layout management algorithm that automates the display of structured hierarchical data using the traditional visual idioms of hand-designed database UIs: tables, multi-column forms, and outline-style indented lists. We compare our system with pure outline and nested table layouts with respect to space efficiency and readability, the latter with an online user study on 27 subjects. Our layouts are 3.9 and 1.6 times more compact on average than outline layouts and horizontally unconstrained table layouts, respectively, and are as readable as table layouts even for large datasets.",Eirik Bakke;David R. Karger;Rob Miller 0001,Eirik Bakke;David R. Karger;Robert C. Miller,MIT Computer Science and Artificial Intelligence Laboratory (CSAIL);MIT Computer Science and Artificial Intelligence Laboratory (CSAIL);MIT Computer Science and Artificial Intelligence Laboratory (CSAIL),10.1109/VAST.2011.6102445;10.1109/INFVIS.2004.1;10.1109/INFVIS.1995.528693;10.1109/TVCG.2007.70594;10.1109/VISUAL.1991.175815;10.1109/INFVIS.2005.1532129;10.1109/INFVIS.1997.636761,"Hierarchy data, tabular data, nested relations, layout management",7,2,31,
SciVis,2013,Acuity-Driven Gigapixel Visualization,10.1109/TVCG.2013.127,http://dx.doi.org/10.1109/TVCG.2013.127,2886,2895,J,"We present a framework for acuity-driven visualization of super-high resolution image data on gigapixel displays. Tiled display walls offer a large workspace that can be navigated physically by the user. Based on head tracking information, the physical characteristics of the tiled display and the formulation of visual acuity, we guide an out-of-core gigapixel rendering scheme by delivering high levels of detail only in places where it is perceivable to the user. We apply this principle to gigapixel image rendering through adaptive level of detail selection. Additionally, we have developed an acuity-driven tessellation scheme for high-quality Focus-and-Context (F+C) lenses that significantly reduces visual artifacts while accurately capturing the underlying lens function. We demonstrate this framework on the Reality Deck, an immersive gigapixel display. We present the results of a user study designed to quantify the impact of our acuity-driven rendering optimizations in the visual exploration process. We discovered no evidence suggesting a difference in search task performance between our framework and naive rendering of gigapixel resolution data, while realizing significant benefits in terms of data transfer overhead. Additionally, we show that our acuity-driven tessellation scheme offers substantially increased frame rates when compared to naive pre-tessellation, while providing indistinguishable image quality.",Charilaos Papadopoulos;Arie E. Kaufman,Charilaos Papadopoulos;Arie E. Kaufman,Stony Brook University;Stony Brook University,10.1109/TVCG.2011.231;10.1109/INFVIS.2004.66,"Gigapixel visualization, visual acuity, focus and context, Reality Deck, gigapixel display",7,7,45,
SciVis,2014,FLDA: Latent Dirichlet Allocation Based Unsteady Flow Analysis,10.1109/TVCG.2014.2346416,http://dx.doi.org/10.1109/TVCG.2014.2346416,2545,2554,J,"In this paper, we present a novel feature extraction approach called FLDA for unsteady flow fields based on Latent Dirichlet allocation (LDA) model. Analogous to topic modeling in text analysis, in our approach, pathlines and features in a given flow field are defined as documents and words respectively. Flow topics are then extracted based on Latent Dirichlet allocation. Different from other feature extraction methods, our approach clusters pathlines with probabilistic assignment, and aggregates features to meaningful topics at the same time. We build a prototype system to support exploration of unsteady flow field with our proposed LDA-based method. Interactive techniques are also developed to explore the extracted topics and to gain insight from the data. We conduct case studies to demonstrate the effectiveness of our proposed approach.",Fan Hong;Chufan Lai;Hanqi Guo 0001;Enya Shen;Xiaoru Yuan;Sikun Li,Fan Hong;Chufan Lai;Hanqi Guo;Enya Shen;Xiaoru Yuan;Sikun Li,"Key Laboratory of Machine Perception (Ministry of Education), School of EECS;Key Laboratory of Machine Perception (Ministry of Education), School of EECS;Key Laboratory of Machine Perception (Ministry of Education), School of EECS;School of Computer Science, National University of Defense Technology, Changsha, China;Key Laboratory of Machine Perception (Ministry of Education), School of EECS;School of Computer Science, National University of Defense Technology, Changsha, China",10.1109/TVCG.2008.131;10.1109/TVCG.2010.131;10.1109/TVCG.2011.239;10.1109/TVCG.2006.165;10.1109/TVCG.2008.116;10.1109/TVCG.2006.164;10.1109/TVCG.2010.190;10.1109/TVCG.2011.246;10.1109/TVCG.2008.167;10.1109/TVCG.2009.112;10.1109/TVCG.2010.170;10.1109/TVCG.2013.133,"Flow visualization, Topic model, Latent Dirichlet allocation (LDA)",7,12,47,
SciVis,2014,Trend-Centric Motion Visualization: Designing and Applying a New Strategy for Analyzing Scientific Motion Collections,10.1109/TVCG.2014.2346451,http://dx.doi.org/10.1109/TVCG.2014.2346451,2644,2653,J,"In biomechanics studies, researchers collect, via experiments or simulations, datasets with hundreds or thousands of trials, each describing the same type of motion (e.g., a neck flexion-extension exercise) but under different conditions (e.g., different patients, different disease states, pre- and post-treatment). Analyzing similarities and differences across all of the trials in these collections is a major challenge. Visualizing a single trial at a time does not work, and the typical alternative of juxtaposing multiple trials in a single visual display leads to complex, difficult-to-interpret visualizations. We address this problem via a new strategy that organizes the analysis around motion trends rather than trials. This new strategy matches the cognitive approach that scientists would like to take when analyzing motion collections. We introduce several technical innovations making trend-centric motion visualization possible. First, an algorithm detects a motion collection's trends via time-dependent clustering. Second, a 2D graphical technique visualizes how trials leave and join trends. Third, a 3D graphical technique, using a median 3D motion plus a visual variance indicator, visualizes the biomechanics of the set of trials within each trend. These innovations are combined to create an interactive exploratory visualization tool, which we designed through an iterative process in collaboration with both domain scientists and a traditionally-trained graphic designer. We report on insights generated during this design process and demonstrate the tool's effectiveness via a validation study with synthetic data and feedback from expert musculoskeletal biomechanics researchers who used the tool to analyze the effects of disc degeneration on human spinal kinematics.",David Schroeder;Fedor Korsakov;Carissa Mai-Ping Knipe;Lauren Thorson;Arin M. Ellingson;David J. Nuckley;John V. Carlis;Daniel F. Keefe,David Schroeder;Fedor Korsakov;Carissa Mai-Ping Knipe;Lauren Thorson;Arin M. Ellingson;David Nuckley;John Carlis;Daniel F Keefe,University of Minnesota;University of Minnesota;University of Minnesota;Minneapolis College of Art and Design;University of Minnesota;Zimmer Spine;University of Minnesota;University of Minnesota,10.1109/TVCG.2013.178;10.1109/TVCG.2009.152;10.1109/VAST.2011.6102454;10.1109/TVCG.2010.223;10.1109/VISUAL.2001.964496;10.1109/TVCG.2007.70518;10.1109/VAST.2009.5332593;10.1109/VISUAL.2005.1532857,"Design studies, focus + context techniques, integrating spatial and non-spatial data visualization, visual design, biomedical and medical visualization",7,8,38,
VAST,2014,Run Watchers: Automatic Simulation-Based Decision Support in Flood Management,10.1109/TVCG.2014.2346930,http://dx.doi.org/10.1109/TVCG.2014.2346930,1873,1882,J,"In this paper, we introduce a simulation-based approach to design protection plans for flood events. Existing solutions require a lot of computation time for an exhaustive search, or demand for a time-consuming expert supervision and steering. We present a faster alternative based on the automated control of multiple parallel simulation runs. Run Watchers are dedicated system components authorized to monitor simulation runs, terminate them, and start new runs originating from existing ones according to domain-specific rules. This approach allows for a more efficient traversal of the search space and overall performance improvements due to a re-use of simulated states and early termination of failed runs. In the course of search, Run Watchers generate large and complex decision trees. We visualize the entire set of decisions made by Run Watchers using interactive, clustered timelines. In addition, we present visualizations to explain the resulting response plans. Run Watchers automatically generate storyboards to convey plan details and to justify the underlying decisions, including those which leave particular buildings unprotected. We evaluate our solution with domain experts.",Artem Konev;Jürgen Waser;Bernhard Sadransky;Daniel Cornel;Rui A. P. Perdigão;Zsolt Horváth;M. Eduard Gröller,Artem Konev;Jürgen Waser;Bernhard Sadransky;Daniel Cornel;Rui A.P. Perdigão;Zsolt Horváth;M. Eduard Gröller,VRVis Vienna;VRVis Vienna;VRVis Vienna;VRVis Vienna;TU Vienna;TU Vienna;TU Vienna,10.1109/INFVIS.2002.1173149;10.1109/VISUAL.2000.885727;10.1109/TVCG.2010.190;10.1109/TVCG.2011.248;10.1109/TVCG.2010.223;10.1109/TVCG.2008.145,"Disaster management, simulation control, decision making, visual evidence, storytelling",7,6,36,
SciVis,2015,Anisotropic Ambient Volume Shading,10.1109/TVCG.2015.2467963,http://dx.doi.org/10.1109/TVCG.2015.2467963,1015,1024,J,"We present a novel method to compute anisotropic shading for direct volume rendering to improve the perception of the orientation and shape of surface-like structures. We determine the scale-aware anisotropy of a shading point by analyzing its ambient region. We sample adjacent points with similar scalar values to perform a principal component analysis by computing the eigenvectors and eigenvalues of the covariance matrix. In particular, we estimate the tangent directions, which serve as the tangent frame for anisotropic bidirectional reflectance distribution functions. Moreover, we exploit the ratio of the eigenvalues to measure the magnitude of the anisotropy at each shading point. Altogether, this allows us to model a data-driven, smooth transition from isotropic to strongly anisotropic volume shading. In this way, the shape of volumetric features can be enhanced significantly by aligning specular highlights along the principal direction of anisotropy. Our algorithm is independent of the transfer function, which allows us to compute all shading parameters once and store them with the data set. We integrated our method in a GPU-based volume renderer, which offers interactive control of the transfer function, light source positions, and viewpoint. Our results demonstrate the benefit of anisotropic shading for visualization to achieve data-driven local illumination for improved perception compared to isotropic shading.",Marco Ament;Carsten Dachsbacher,Marco Ament;Carsten Dachsbacher,"Karlsruhe Institute of Technology, Germany;Karlsruhe Institute of Technology, Germany",10.1109/TVCG.2014.2346333;10.1109/TVCG.2013.129;10.1109/TVCG.2014.2346411;10.1109/TVCG.2012.232;10.1109/VISUAL.1999.809886;10.1109/VISUAL.2003.1250414;10.1109/TVCG.2011.161;10.1109/VISUAL.2005.1532772;10.1109/VISUAL.1994.346331;10.1109/VISUAL.2002.1183771;10.1109/TVCG.2011.198;10.1109/VISUAL.2004.5;10.1109/TVCG.2012.267;10.1109/VISUAL.1996.567777,"Direct volume rendering, volume illumination, anisotropic shading",7,10,52,
VAST,2015,MotionFlow: Visual Abstraction and Aggregation of Sequential Patterns in Human Motion Tracking Data,10.1109/TVCG.2015.2468292,http://dx.doi.org/10.1109/TVCG.2015.2468292,21,30,J,"Pattern analysis of human motions, which is useful in many research areas, requires understanding and comparison of different styles of motion patterns. However, working with human motion tracking data to support such analysis poses great challenges. In this paper, we propose MotionFlow, a visual analytics system that provides an effective overview of various motion patterns based on an interactive flow visualization. This visualization formulates a motion sequence as transitions between static poses, and aggregates these sequences into a tree diagram to construct a set of motion patterns. The system also allows the users to directly reflect the context of data and their perception of pose similarities in generating representative pose states. We provide local and global controls over the partition-based clustering process. To support the users in organizing unstructured motion data into pattern groups, we designed a set of interactions that enables searching for similar motion sequences from the data, detailed exploration of data subsets, and creating and modifying the group of motion patterns. To evaluate the usability of MotionFlow, we conducted a user study with six researchers with expertise in gesture-based interaction design. They used MotionFlow to explore and organize unstructured motion tracking data. Results show that the researchers were able to easily learn how to use MotionFlow, and the system effectively supported their pattern analysis activities, including leveraging their perception and domain knowledge.",Sujin Jang;Niklas Elmqvist;Karthik Ramani,Sujin Jang;Niklas Elmqvist;Karthik Ramani,"Purdue University, West Lafayette, IN, USA;University of Maryland, College Park, MD, USA;Purdue University, West Lafayette, IN, USA",10.1109/TVCG.2013.178;10.1109/TVCG.2009.181;10.1109/TVCG.2011.239;10.1109/TVCG.2014.2346682;10.1109/TVCG.2012.258;10.1109/TVCG.2013.196;10.1109/TVCG.2013.200;10.1109/TVCG.2006.192;10.1109/INFVIS.2005.1532152;10.1109/TVCG.2013.181;10.1109/TVCG.2010.149;10.1109/VISUAL.2002.1183778;10.1109/TVCG.2008.172;10.1109/TVCG.2012.225;10.1109/TVCG.2014.2346920,"Human motion visualization, interactive clustering, motion tracking data, expert reviews, user study",7,9,46,
VAST,2015,Integrating predictive analytics into a spatiotemporal epidemic simulation,10.1109/VAST.2015.7347626,http://dx.doi.org/10.1109/VAST.2015.7347626,17,24,C,"The Epidemic Simulation System (EpiSimS) is a scalable, complex modeling tool for analyzing disease within the United States. Due to its high input dimensionality, time requirements, and resource constraints, simulating over the entire parameter space is unfeasible. One solution is to take a granular sampling of the input space and use simpler predictive models (emulators) in between. The quality of the implemented emulator depends on many factors: robustness, sophistication, configuration, and suitability to the input data. Visual analytics can be leveraged to provide guidance and understanding of these things to the user. In this paper, we have implemented a novel interface and workflow for emulator building and use. We introduce a workflow to build emulators, make predictions, and then analyze the results. Our prediction process first predicts temporal time series, and uses these to derive predicted spatial densities. Integrated into the EpiSimS framework, we target users who are non-experts at statistical modeling. This approach allows for a high level of analysis into the state of the built emulators and their resultant predictions. We present our workflow, models, the associated system, and evaluate the overall utility with feedback from EpiSimS scientists.",Chris Bryan;Xue Wu;Susan M. Mniszewski;Kwan-Liu Ma,Chris Bryan;Xue Wu;Susan Mniszewski;Kwan-Liu Ma,"VIDi @ U.C. Davis, USA;VIDi @ U.C. Davis, USA;Los Alamos National Lab, USA;VIDi @ U.C. Davis, USA",10.1109/VAST.2011.6102457;10.1109/INFVIS.1998.729563;10.1109/TVCG.2014.2346926;10.1109/TVCG.2013.125;10.1109/TVCG.2010.181;10.1109/TVCG.2014.2346321;10.1109/TVCG.2011.248;10.1109/TVCG.2012.190,"Predictive Modeling, Visual Analytics, Epidemic Visualization, Spatial-Temporal Systems",7,8,36,
VAST,2015,Four considerations for supporting visual analysis in display ecologies,10.1109/VAST.2015.7347628,http://dx.doi.org/10.1109/VAST.2015.7347628,33,40,C,"The current proliferation of large displays and mobile devices presents a number of exciting opportunities for visual analytics and information visualization. The display ecology enables multiple displays to function in concert within a broader technological environment to accomplish visual analysis tasks. Based on a comprehensive survey of multi-display systems from a variety of fields, we propose four key considerations for visual analysis in display ecologies: 1) Display Composition, 2) Information Coordination/Transfer, 3) Information Connection, and 4) Display Membership. Different aspects of display ecologies stemming from these design considerations will enable users to transform and empower multiple displays as a display ecology for visual analysis.",Haeyong Chung;Chris North 0001;Sarang Joshi;Jian Chen,Haeyong Chung;Chris North;Sarang Joshi;Jian Chen,"University of Alabama Huntsville, USA;Virginia Tech, USA;Virginia Tech, USA;University of Maryland Baltimore County, USA",10.1109/VAST.2008.4677358,,7,6,51,
VAST,2015,TimeStitch: Interactive multi-focus cohort discovery and comparison,10.1109/VAST.2015.7347682,http://dx.doi.org/10.1109/VAST.2015.7347682,209,210,M,"Whereas event-based timelines for healthcare enable users to visualize the chronology of events surrounding events of interest, they are often not designed to aid the discovery, construction, or comparison of associated cohorts. We present TimeStitch, a system that helps health researchers discover and understand events that may cause abstinent smokers to lapse. TimeStitch extracts common sequences of events performed by abstinent smokers from large amounts of mobile health sensor data, and offers a suite of interactive and visualization techniques to enable cohort discovery, construction, and comparison, using extracted sequences as interactive elements. We are extending TimeStitch to support more complex health conditions with high mortality risk, such as reducing hospital readmission in congestive heart failure.",Peter J. Polack Jr.;Shang-Tse Chen;Minsuk Kahng;Moushumi Sharmin;Duen Horng Chau,Peter J. Polack;Shang-Tse Chen;Minsuk Kahng;Moushumi Sharmin;Duen Horng Chau,"Georgia Tech., USA;Georgia Tech., USA;Georgia Tech., USA;University of Memphis., USA;Georgia Tech., USA",,,7,7,7,
VAST,2016,Supporting visual exploration for multiple users in large display environments,10.1109/VAST.2016.7883506,http://dx.doi.org/10.1109/VAST.2016.7883506,1,10,C,"We present a design space exploration of interaction techniques for supporting multiple collaborators exploring data on a shared large display. Our proposed solution is based on users controlling individual lenses using both explicit gestures as well as proxemics: the spatial relations between people and physical artifacts such as their distance, orientation, and movement. We discuss different design considerations for implicit and explicit interactions through the lens, and evaluate the user experience to find a balance between the implicit and explicit interaction styles. Our findings indicate that users favor implicit interaction through proxemics for navigation and collaboration, but prefer using explicit mid-air gestures to perform actions that are perceived to be direct, such as terminating a lens composition. Based on these results, we propose a hybrid technique utilizing both proxemics and mid-air gestures, along with examples applying this technique to other datasets. Finally, we performed a usability evaluation of the hybrid technique and observed user performance improvements in the presence of both implicit and explicit interaction styles.",Sriram Karthik Badam;Fereshteh Amini;Niklas Elmqvist;Pourang Irani,Sriram Karthik Badam;Fereshteh Amini;Niklas Elmqvist;Pourang Irani,"University of Maryland, College Park, USA;University of Manitoba, Winnipeg, Canada;University of Maryland, College Park, USA;University of Manitoba, Winnipeg, Canada",10.1109/TVCG.2013.166;10.1109/TVCG.2009.162;10.1109/TVCG.2013.163;10.1109/TVCG.2011.185,,7,6,41,
VAST,2016,SenseMap: Supporting browser-based online sensemaking through analytic provenance,10.1109/VAST.2016.7883515,http://dx.doi.org/10.1109/VAST.2016.7883515,91,100,C,"Sensemaking is described as the process in which people collect, organize and create representations of information, all centered around some problem they need to understand. People often get lost when solving complicated tasks using big datasets over long periods of exploration and analysis. They may forget what they have done, are unaware of where they are in the context of the overall task, and are unsure where to continue. In this paper, we introduce a tool, SenseMap, to address these issues in the context of browser-based online sensemaking. We conducted a semi-structured interview with nine participants to explore their behaviors in online sensemaking with existing browser functionality. A simplified sensemaking model based on Pirolli and Card's model is derived to better represent the behaviors we found: users iteratively collect information sources relevant to the task, curate them in a way that makes sense, and finally communicate their findings to others. SenseMap automatically captures provenance of user sensemaking actions and provides multi-linked views to visualize the collected information and enable users to curate and communicate their findings. To explore how SenseMap is used, we conducted a user study in a naturalistic work setting with five participants completing the same sensemaking task related to their daily work activities. All participants found the visual representation and interaction of the tool intuitive to use. Three of them engaged with the tool and produced successful outcomes. It helped them to organize information sources, to quickly find and navigate to the sources they wanted, and to effectively communicate their findings.",Phong H. Nguyen;Kai Xu 0003;Andy Bardill;Betul Salman;Kate Herd;B. L. William Wong,Phong H. Nguyen;Kai Xu;Andy Bardill;Betul Salman;Kate Herd;B.L. William Wong,"Middlesex University, London, UK;Middlesex University, London, UK;Middlesex University, London, UK;Middlesex University, London, UK;Middlesex University, London, UK;Middlesex University, London, UK",10.1109/TVCG.2008.137;10.1109/TVCG.2015.2467611;10.1109/VAST.2008.4677365;10.1109/TVCG.2013.132;10.1109/VISUAL.2005.1532788;10.1109/TVCG.2013.124;10.1109/TVCG.2011.185,,7,7,41,
VAST,2016,The semantics of sketch: Flexibility in visual query systems for time series data,10.1109/VAST.2016.7883519,http://dx.doi.org/10.1109/VAST.2016.7883519,131,140,C,"Sketching allows analysts to specify complex and free-form patterns of interest. Visual query systems can make use of sketches to locate these patterns of interest in large datasets. However, sketching is ambiguous: the same drawing could represent a multitude of potential queries. In this work, we investigate these ambiguities as they apply to visual query systems for time series data. We define a class of “invariants” - the properties of a time series that the analyst wishes to ignore when performing a sketch-based query. We present the results of a crowd-sourced study, showing that these invariants are key components of how people rate the strength of match between sketch and target. We adapt a number of algorithms for time series matching to support invariants in sketches. Lastly, we present a web-deployed prototype sketch-based visual query system that relies on these invariants. We apply the prototype to data from finance, the digital humanities, and political science.",Michael Correll;Michael Gleicher,Michael Correll;Michael Gleicher,"University of Washington, United States of America;University of Wisconsin-Madison, United States of America",10.1109/TVCG.2014.2346455;10.1109/INFVIS.2005.1532144;10.1109/TVCG.2013.191;10.1109/TVCG.2012.204;10.1109/TVCG.2014.2346452;10.1109/TVCG.2010.162,,7,12,35,
VAST,2016,Visual analysis and coding of data-rich user behavior,10.1109/VAST.2016.7883520,http://dx.doi.org/10.1109/VAST.2016.7883520,141,150,C,"Investigating user behavior involves abstracting low-level events to higher-level concepts. This requires an analyst to study individual user activities, assign codes which categorize behavior, and develop a consistent classification scheme. To better support this reasoning process of an analyst, we suggest a novel visual analytics approach which integrates rich user data including transcripts, videos, eye movement data, and interaction logs. Word-sized visualizations embedded into a tabular representation provide a space-efficient and detailed overview of user activities. An analyst assigns codes, grouped into code categories, as part of an interactive process. Filtering and searching helps to select specific activities and focus an analysis. A comparison visualization summarizes results of coding and reveals relationships between codes. Editing features support efficient assignment, refinement, and aggregation of codes. We demonstrate the practical applicability and usefulness of our approach in a case study and describe expert feedback.",Tanja Blascheck;Fabian Beck 0001;Sebastian Baltes;Thomas Ertl;Daniel Weiskopf,Tanja Blascheck;Fabian Beck;Sebastian Baltes;Thomas Ertl;Daniel Weiskopf,"University of Stuttgart, Germany;University of Stuttgart, Germany;University of Trier, Germany;University of Stuttgart, Germany;University of Stuttgart, Germany",10.1109/VAST.2009.5333443;10.1109/VISUAL.1990.146402;10.1109/TVCG.2011.226;10.1109/TVCG.2014.2346452;10.1109/TVCG.2008.137;10.1109/TVCG.2015.2467611;10.1109/TVCG.2015.2467757;10.1109/TVCG.2010.194;10.1109/TVCG.2014.2346677;10.1109/VAST.2008.4677365;10.1109/TVCG.2013.124,,7,7,58,
SciVis,2017,Multiscale Visualization and Scale-Adaptive Modification of DNA Nanostructures,10.1109/TVCG.2017.2743981,http://dx.doi.org/10.1109/TVCG.2017.2743981,1014,1024,J,"We present an approach to represent DNA nanostructures in varying forms of semantic abstraction, describe ways to smoothly transition between them, and thus create a continuous multiscale visualization and interaction space for applications in DNA nanotechnology. This new way of observing, interacting with, and creating DNA nanostructures enables domain experts to approach their work in any of the semantic abstraction levels, supporting both low-level manipulations and high-level visualization and modifications. Our approach allows them to deal with the increasingly complex DNA objects that they are designing, to improve their features, and to add novel functions in a way that no existing single-scale approach offers today. For this purpose we collaborated with DNA nanotechnology experts to design a set of ten semantic scales. These scales take the DNA's chemical and structural behavior into account and depict it from atoms to the targeted architecture with increasing levels of abstraction. To create coherence between the discrete scales, we seamlessly transition between them in a well-defined manner. We use special encodings to allow experts to estimate the nanoscale object's stability. We also add scale-adaptive interactions that facilitate the intuitive modification of complex structures at multiple scales. We demonstrate the applicability of our approach on an experimental use case. Moreover, feedback from our collaborating domain experts confirmed an increased time efficiency and certainty for analysis and modification tasks on complex DNA structures. Our method thus offers exciting new opportunities with promising applications in medicine and biotechnology.",Haichao Miao;Elisa De Llano;Johannes Sorger;Yasaman Ahmadi;Tadija Kekic;Tobias Isenberg 0001;M. Eduard Gröller;Ivan Barisic;Ivan Viola,Haichao Miao;Elisa De Llano;Johannes Sorger;Yasaman Ahmadi;Tadija Kekic;Tobias Isenberg;M. Eduard Gröller;Ivan Barišić;Ivan Viola,"TU Wien, Austria;Austrian Institute of Technology;TU Wien, Austria;Austrian Institute of Technology;Austrian Institute of Technology;Université Paris-Saclay, France;TU Wien, Austria;Austrian Institute of Technology;TU Wien, Austria",10.1109/VISUAL.2004.103;10.1109/TVCG.2007.70578;10.1109/TVCG.2009.168;10.1109/TVCG.2013.126;10.1109/TVCG.2009.111,"Nano,nanotechnology,assembly,multiscale,abstraction,DNA,origami,scale-adaptive modification",7,2,54,
VAST,2017,SkyLens: Visual Analysis of Skyline on Multi-Dimensional Data,10.1109/TVCG.2017.2744738,http://dx.doi.org/10.1109/TVCG.2017.2744738,246,255,J,"Skyline queries have wide-ranging applications in fields that involve multi-criteria decision making, including tourism, retail industry, and human resources. By automatically removing incompetent candidates, skyline queries allow users to focus on a subset of superior data items (i.e., the skyline), thus reducing the decision-making overhead. However, users are still required to interpret and compare these superior items manually before making a successful choice. This task is challenging because of two issues. First, people usually have fuzzy, unstable, and inconsistent preferences when presented with multiple candidates. Second, skyline queries do not reveal the reasons for the superiority of certain skyline points in a multi-dimensional space. To address these issues, we propose SkyLens, a visual analytic system aiming at revealing the superiority of skyline points from different perspectives and at different scales to aid users in their decision making. Two scenarios demonstrate the usefulness of SkyLens on two datasets with a dozen of attributes. A qualitative study is also conducted to show that users can efficiently accomplish skyline understanding and comparison tasks with SkyLens.",Xun Zhao;Yanhong Wu;Weiwei Cui;Xinnan Du;Yuan Chen;Yong Wang 0021;Dik Lun Lee;Huamin Qu,Xun Zhao;Yanhong Wu;Weiwei Cui;Xinnan Du;Yuan Chen;Yong Wang;Dik Lun Lee;Huamin Qu,Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Microsoft Research Asia;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology,10.1109/TVCG.2013.173;10.1109/TVCG.2016.2598432;10.1109/TVCG.2016.2598589;10.1109/TVCG.2015.2468011,"Skyline query,skyline visualization,multi-dimensional data,visual analytics,multi-criteria decision making",7,5,49,
VAST,2017,PhenoLines: Phenotype Comparison Visualizations for Disease Subtyping via Topic Models,10.1109/TVCG.2017.2745118,http://dx.doi.org/10.1109/TVCG.2017.2745118,371,381,J,"PhenoLines is a visual analysis tool for the interpretation of disease subtypes, derived from the application of topic models to clinical data. Topic models enable one to mine cross-sectional patient comorbidity data (e.g., electronic health records) and construct disease subtypes-each with its own temporally evolving prevalence and co-occurrence of phenotypes-without requiring aligned longitudinal phenotype data for all patients. However, the dimensionality of topic models makes interpretation challenging, and de facto analyses provide little intuition regarding phenotype relevance or phenotype interrelationships. PhenoLines enables one to compare phenotype prevalence within and across disease subtype topics, thus supporting subtype characterization, a task that involves identifying a proposed subtype's dominant phenotypes, ages of effect, and clinical validity. We contribute a data transformation workflow that employs the Human Phenotype Ontology to hierarchically organize phenotypes and aggregate the evolving probabilities produced by topic models. We introduce a novel measure of phenotype relevance that can be used to simplify the resulting topology. The design of PhenoLines was motivated by formative interviews with machine learning and clinical experts. We describe the collaborative design process, distill high-level tasks, and report on initial evaluations with machine learning experts and a medical domain expert. These results suggest that PhenoLines demonstrates promising approaches to support the characterization and optimization of topic models.",Michael Glueck;Mahdi Pakdaman Naeini;Finale Doshi-Velez;Fanny Chevalier;Azam Khan;Daniel J. Wigdor;Michael Brudno,Michael Glueck;Mahdi Pakdaman Naeini;Finale Doshi-Velez;Fanny Chevalier;Azam Khan;Daniel Wigdor;Michael Brudno,"Autodesk Research and University, Toronto;Harvard University;Harvard University;Inria;Autodesk Research;University of Toronto;Hospital for Sick ChildrenUniversity of Toronto",10.1109/TVCG.2011.185;10.1109/TVCG.2013.124;10.1109/TVCG.2009.140;10.1109/TVCG.2011.239;10.1109/TVCG.2014.2346433;10.1109/VAST.2011.6102461;10.1109/TVCG.2013.162;10.1109/TVCG.2016.2598469;10.1109/TVCG.2015.2467733;10.1109/TVCG.2015.2467622;10.1109/VAST.2014.7042494;10.1109/TVCG.2009.111;10.1109/TVCG.2012.213;10.1109/TVCG.2016.2598591,"Developmental disorder,Human Phenotype Ontology (HPO),Phenotypes,Topic models,Topology simplification",7,4,57,
VAST,2017,The Role of Explicit Knowledge: A Conceptual Model of Knowledge-Assisted Visual Analytics,10.1109/VAST.2017.8585498,http://dx.doi.org/10.1109/VAST.2017.8585498,92,103,C,"Visual Analytics (VA) aims to combine the strengths of humans and computers for effective data analysis. In this endeavor, humans' tacit knowledge from prior experience is an important asset that can be leveraged by both human and computer to improve the analytic process. While VA environments are starting to include features to formalize, store, and utilize such knowledge, the mechanisms and degree in which these environments integrate explicit knowledge varies widely. Additionally, this important class of VA environments has never been elaborated on by existing work on VA theory. This paper proposes a conceptual model of Knowledge-assisted VA conceptually grounded on the visualization model by van Wijk. We apply the model to describe various examples of knowledge-assisted VA from the literature and elaborate on three of them in finer detail. Moreover, we illustrate the utilization of the model to compare different design alternatives and to evaluate existing approaches with respect to their use of knowledge. Finally, the model can inspire designers to generate novel VA environments using explicit knowledge effectively.",Paolo Federico 0001;Markus Wagner 0008;Alexander Rind;Albert Amor-Amoros;Silvia Miksch;Wolfgang Aigner,Paolo Federico;Markus Wagner;Alexander Rind;Albert Amor-Amorós;Silvia Miksch;Wolfgang Aigner,"TU Wien, Austria;St. Poelten University of Applied Sciences, Austria and TU Wien, Austria;St. Poelten University of Applied Sciences, Austria and TU Wien, Austria;TU Wien, Austria;TU Wien, Austria;TU Wien, Austria",10.1109/TVCG.2013.146;10.1109/TVCG.2014.2346575;10.1109/INFVIS.1997.636792;10.1109/TVCG.2016.2598468;10.1109/INFVIS.2000.885092;10.1109/INFVIS.1998.729560;10.1109/TVCG.2016.2598460;10.1109/TVCG.2016.2598471;10.1109/VAST.2008.4677352;10.1109/TVCG.2008.109;10.1109/VAST.2012.6400555;10.1109/VAST.2010.5654451;10.1109/TVCG.2014.2346481;10.1109/TVCG.2016.2598839;10.1109/VAST.2007.4389021;10.1109/TVCG.2014.2346574;10.1109/TVCG.2016.2598829;10.1109/VISUAL.2005.1532781,"Automated analysis,tacit knowledge,explicit knowledge,visual analytics,information visualization,theory and model",7,3,81,
InfoVis,2018,Hypothetical Outcome Plots Help Untrained Observers Judge Trends in Ambiguous Data,10.1109/TVCG.2018.2864909,http://dx.doi.org/10.1109/TVCG.2018.2864909,892,902,J,"Animated representations of outcomes drawn from distributions (hypothetical outcome plots, or HOPs) are used in the media and other public venues to communicate uncertainty. HOPs greatly improve multivariate probability estimation over conventional static uncertainty visualizations and leverage the ability of the visual system to quickly, accurately, and automatically process the summary statistical properties of ensembles. However, it is unclear how well HOPs support applied tasks resembling real world judgments posed in uncertainty communication. We identify and motivate an appropriate task to investigate realistic judgments of uncertainty in the public domain through a qualitative analysis of uncertainty visualizations in the news. We contribute two crowdsourced experiments comparing the effectiveness of HOPs, error bars, and line ensembles for supporting perceptual decision-making from visualized uncertainty. Participants infer which of two possible underlying trends is more likely to have produced a sample of time series data by referencing uncertainty visualizations which depict the two trends with variability due to sampling error. By modeling each participant's accuracy as a function of the level of evidence presented over many repeated judgments, we find that observers are able to correctly infer the underlying trend in samples conveying a lower level of evidence when using HOPs rather than static aggregate uncertainty visualizations as a decision aid. Modeling approaches like ours contribute theoretically grounded and richly descriptive accounts of user perceptions to visualization evaluation.",Alex Kale;Francis Nguyen;Matthew Kay 0001;Jessica Hullman,Alex Kale;Francis Nguyen;Matthew Kay;Jessica Hullman,University of Washington;University of Washington;University of Michigan;Northwestern University,10.1109/TVCG.2017.2743898;10.1109/TVCG.2007.70518;10.1109/TVCG.2017.2744359,"uncertainty visualization,hypothetical outcome plots,psychometric functions",7,10,66,
InfoVis,2018,Glanceable Visualization: Studies of Data Comparison Performance on Smartwatches,10.1109/TVCG.2018.2865142,http://dx.doi.org/10.1109/TVCG.2018.2865142,630,640,J,"We present the results of two perception studies to assess how quickly people can perform a simple data comparison task for small-scale visualizations on a smartwatch. The main goal of these studies is to extend our understanding of design constraints for smartwatch visualizations. Previous work has shown that a vast majority of smartwatch interactions last under 5 s. It is still unknown what people can actually perceive from visualizations during such short glances, in particular with such a limited display space of smartwatches. To shed light on this question, we conducted two perception studies that assessed the lower bounds of task time for a simple data comparison task. We tested three chart types common on smartwatches: bar charts, donut charts, and radial bar charts with three different data sizes: 7, 12, and 24 data values. In our first study, we controlled the differences of the two target bars to be compared, while the second study varied the difference randomly. For both studies, we found that participants performed the task on average in &lt;;300 ms for the bar chart, &lt;;220 ms for the donut chart, and in &lt;; 1780 ms for the radial bar chart. Thresholds in the second study per chart type were on average 1.14-1.35× higher than in the first study. Our results show that bar and donut charts should be preferred on smartwatch displays when quick data comparisons are necessary.",Tanja Blascheck;Lonni Besançon;Anastasia Bezerianos;Bongshin Lee;Petra Isenberg,Tanja Blascheck;Lonni Besançon;Anastasia Bezerianos;Bongshin Lee;Petra Isenberg,Inria;Université Paris Saclay;Université Paris SudInriaCNRSUniversité Paris Saclay;Microsoft Research;Inria,10.1109/TVCG.2014.2346435;10.1109/TVCG.2012.233;10.1109/TVCG.2010.162;10.1109/TVCG.2013.192;10.1109/INFVIS.2005.1532144;10.1109/TVCG.2012.196;10.1109/TVCG.2014.2346320;10.1109/TVCG.2007.70589,"Glanceable visualization,smartwatch,perception,quantitative evaluation,data comparison",7,4,52,
InfoVis,2018,FiberClay: Sculpting Three Dimensional Trajectories to Reveal Structural Insights,10.1109/TVCG.2018.2865191,http://dx.doi.org/10.1109/TVCG.2018.2865191,704,714,J,"Visualizing 3D trajectories to extract insights about their similarities and spatial configuration is a critical task in several domains. Air traffic controllers for example deal with large quantities of aircrafts routes to optimize safety in airspace and neuroscientists attempt to understand neuronal pathways in the human brain by visualizing bundles of fibers from DTI images. Extracting insights from masses of 3D trajectories is challenging as the multiple three dimensional lines have complex geometries, may overlap, cross or even merge with each other, making it impossible to follow individual ones in dense areas. As trajectories are inherently spatial and three dimensional, we propose FiberClay: a system to display and interact with 3D trajectories in immersive environments. FiberClay renders a large quantity of trajectories in real time using GP-GPU techniques. FiberClay also introduces a new set of interactive techniques for composing complex queries in 3D space leveraging immersive environment controllers and user position. These techniques enable an analyst to select and compare sets of trajectories with specific geometries and data properties. We conclude by discussing insights found using FiberClay with domain experts in air traffic control and neurology.",Christophe Hurter;Nathalie Henry Riche;Steven Mark Drucker;Maxime Cordeil;Richard Alligier;Romain Vuillemot,Christophe Hurter;Nathalie Henry Riche;Steven M. Drucker;Maxime Cordeil;Richard Alligier;Romain Vuillemot,"ENAC, The French Civil Aviation University, Toulouse University, France;Microsoft Research;Microsoft Research;Monash University;ENAC, The French Civil Aviation University, Toulouse University, France;Univ Lyon, École Centrale de Lyon, CNRS UMR52 05, LIRIS, France",10.1109/TVCG.2016.2599217;10.1109/TVCG.2011.192;10.1109/VISUAL.1991.175794;10.1109/TVCG.2008.153;10.1109/TVCG.2011.233;10.1109/TVCG.2013.226;10.1109/TVCG.2017.2744338;10.1109/TVCG.2009.145;10.1109/INFVIS.2004.27;10.1109/TVCG.2011.224;10.1109/TVCG.2015.2467112;10.1109/TVCG.2013.153;10.1109/TVCG.2012.265;10.1109/TVCG.2017.2744079;10.1109/TVCG.2012.217,"Immersive Analytics,3D Visualization,Dynamic Queries,Bimanual Interaction,Multidimensional Data",7,11,58,
VAST,2018,Futzing and Moseying: Interviews with Professional Data Analysts on Exploration Practices,10.1109/TVCG.2018.2865040,http://dx.doi.org/10.1109/TVCG.2018.2865040,22,31,J,"We report the results of interviewing thirty professional data analysts working in a range of industrial, academic, and regulatory environments. This study focuses on participants' descriptions of exploratory activities and tool usage in these activities. Highlights of the findings include: distinctions between exploration as a precursor to more directed analysis versus truly open-ended exploration; confirmation that some analysts see “finding something interesting” as a valid goal of data exploration while others explicitly disavow this goal; conflicting views about the role of intelligent tools in data exploration; and pervasive use of visualization for exploration, but with only a subset using direct manipulation interfaces. These findings provide guidelines for future tool development, as well as a better understanding of the meaning of the term “data exploration” based on the words of practitioners “in the wild”.",Sara Alspaugh;Nava Zokaei;Andrea Liu;Cindy Jin;Marti A. Hearst,Sara Alspaugh;Nava Zokaei;Andrea Liu;Cindy Jin;Marti A. Hearst,"UC, Berkeley;UC, Berkeley;UC, Berkeley;UC, Berkeley;UC, Berkeley",10.1109/VAST.2008.4677365;10.1109/INFVIS.1997.636793;10.1109/TVCG.2012.219;10.1109/VAST.2011.6102438;10.1109/TVCG.2006.122;10.1109/TVCG.2015.2467191,"EDA,exploratory data analysis,interview study,visual analytics tools",7,5,26,
Vis,1990,Volume microscopy of biological specimens based on non-confocal imaging techniques,10.1109/VISUAL.1990.146413,http://dx.doi.org/10.1109/VISUAL.1990.146413,424,428,C,An approach that uses advanced computer graphics workstations and volume rendering algorithms for accurate reconstruction of volumetric microscopy data is described. It has been found that excellent reconstructions can be made from serial sections acquired using a charge-coupled device and a conventional light microscope. Both confocal and nonconfocal reconstructions are examined. The effects of differing light sources are considered 3D image processing results are presented.&lt;&lt;ETX&gt;&gt;,Stephen L. Senft;Vincent J. Argio;William L. van Zandt,S.L. Senft;V.J. Argiro;W.L. VanZandt,"Washington Univ. Sch. of Med., St. Louis, MO, USA",,,6,2,10,
Vis,1991,Advanced visualization on desktop workstations,10.1109/VISUAL.1991.175833,http://dx.doi.org/10.1109/VISUAL.1991.175833,372,"378, 435",C,"The author explores some of the primary problems that face designers of hardware and software for visualization who are attempting to create tools that will be used and widely accepted. He describes possible solutions to some of these challenges that have been incorporated into Fieldview, a commercial tool for increasing engineering productivity in computational fluid dynamics (CFD).&lt;&lt;ETX&gt;&gt;",Steve M. Legensky,S.M. Legensky,"Intelligent Light, Fair Lawn, NJ, USA",,,6,6,5,
Vis,1993,The vision camera: An interactive tool for volume data exploration and navigation,10.1109/VISUAL.1993.398847,http://dx.doi.org/10.1109/VISUAL.1993.398847,25,30,C,"In this work we focus on one of the key problems of scientific visualization, the object recognition dilemma. The necessity to pre-interpret application data in order to classify object surface voxels prior to rendering has prevented many visualization methods from becoming practical. We propose the concept of vision by visualization which integrates computer vision methods into the visualization process. Based on this, we present the vision camera, a new tool allowing for interactive object recognition during volume data walkthroughs. This camera model is characterized by a flexible front-plane which, under the control of user-specified parameters and image features elastically matches to object surfaces, while shifted through a data volume. Thus, objects are interactively carved out and can be visualized by standard volume visualization methods. Implementation and application of the model are described. Our results suggest that by the integration of human and machine vision new perspectives for data exploration are opened up.&lt;&lt;ETX&gt;&gt;",Hans-Heino Ehricke;Gerhard Daiber;Wolfgang Straßer,H.-H. Ehricke;G. Daiber;W. Strasser,"Wilhelm-Schickard-Inst. fuer Inf., Tubingen Univ., Germany;Wilhelm-Schickard-Inst. fuer Inf., Tubingen Univ., Germany;Wilhelm-Schickard-Inst. fuer Inf., Tubingen Univ., Germany",,,6,4,9,
Vis,1993,"DIVIDE: Distributed visual display of the execution of asynchronous, distributed algorithms on loosely-coupled parallel processors",10.1109/VISUAL.1993.398865,http://dx.doi.org/10.1109/VISUAL.1993.398865,166,173,C,"The issue of monitoring the execution of asynchronous, distributed algorithms on loosely-coupled parallel processor systems, is important for the purposes of (i) detecting inconsistencies and flaws in the algorithm, (ii) obtaining important performance parameters for the algorithm, and (iii) developing a conceptual understanding of the algorithm's behavior, for given input stimulus, through visualization. For a particular class of asynchronous distributed algorithms that may be characterized by independent and concurrent entities that execute asynchronously on multiple processors and interact with one another through explicit messages, the following reasoning applies. Information about the flow of messages and the activity of the processors may contribute significantly towards the conceptual understanding of the algorithm's behavior and the functional correctness of the implementation. The computation and subsequent display of important parameters, based upon the execution of the algorithm, is an important objective of DIVIDE. For instance, the mean and standard deviation values for the propagation delay of ATM cells between any two given Broadband-ISDN (BISDN) nodes in a simulation of BISDN network under stochastic input stimulus, as a function of time, are important clues to the degree of congestion in the Broadband-ISDN network. Although the execution of the algorithm typically generates high resolution data, often, a coarse-level visual representation of the data may be useful in facilitating the conceptual understanding of the behavior of the algorithm. DIVIDE permits a user to specify a resolution less than that of the data from the execution of the algorithm, which is then utilized to coalesce the data appropriately. Given that this process requires significant computational power, for efficiency, DIVIDE distributes the overall task of visual display into a number of user specified workstations that are configured as a loosely-coupled parallel processor. DIVIDE has been implemented on a heterogeneous network of SUN sparc 1 + , sparc 2, and 3/60 workstations and performance measurements indicate significant improvement over that of a uniprocessor-based visual display.&lt;&lt;ETX&gt;&gt;",Tom M. Morrow;Sumit Ghosh,T.M. Morrow;S. Ghosh,"Oracle Corp., Redwood Shores, CA, USA;Oracle Corp., Redwood Shores, CA, USA",,,6,0,24,
Vis,1993,Performance visualization of parallel programs,10.1109/VISUAL.1993.398866,http://dx.doi.org/10.1109/VISUAL.1993.398866,174,181,C,The user of a parallel computer system would like to know the performance of a program in terms of how optimally it uses the system resources. This task is increasingly performed by program performance visualization. The limitations of conventional performance data analysis techniques necessitate better visual analysis methods that are scalable with the problem and system sizes and extensible. They should represent some physical and logical structure of the parallel system and program. The analysis techniques presented here have been motivated by the use of signal and (two- and three-dimensional) image processing techniques being applied in some areas of scientific visualization. Results of applying selected techniques are shown. These techniques and tools have advantages and disadvantages when applied in this area.&lt;&lt;ETX&gt;&gt;,Abdul Waheed;Diane T. Rover,A. Waheed;D.T. Rover,"Dept. of Electr. Eng., Michigan State Univ., E. Lansing, MI, USA;Dept. of Electr. Eng., Michigan State Univ., E. Lansing, MI, USA",,,6,2,20,
Vis,1993,Visualization of stratospheric ozone depletion and the polar vortex,10.1109/VISUAL.1993.398899,http://dx.doi.org/10.1109/VISUAL.1993.398899,391,396,C,"Direct analysis of spacecraft observations of stratospheric ozone yields information about the morphology of annual austral depletion. Visual correlation of ozone with other atmospheric data illustrates the diurnal dynamics of the polar vortex and contributions from the upper troposphere, including the formation and breakup of the depletion region each spring. These data require care in their presentation to minimize the introduction of visualization artifacts that are erroneously interpreted as data features. Non-geographically registered data of differing mesh structures can be visually correlated via cartographic warping of underlying geometries without interpolation. Since this approach is independent of realization technique, it provides a framework for experimenting with different visualization strategies. This methodology preserves the fidelity of the original data sets in a coordinate system suitable for three-dimensional, dynamic examination of upper atmospheric phenomena.&lt;&lt;ETX&gt;&gt;",Lloyd Treinish,L.A. Treinish,"IBM T.J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.1992.235219,,6,1,10,
Vis,1993,The virtual restoration of the Visir tomb,10.1109/VISUAL.1993.398904,http://dx.doi.org/10.1109/VISUAL.1993.398904,420,423,C,"In the field of computer applications to archaeology, data visualization is one of the most recent and promising activity. The visual reconstruction obtained from partially or totally ruined data is a problem that archaeologists often face with during their work. The case we present here is the simulated reconstruction of a great Egyptian tomb of the VII century B.C. excavated in the rocky cliff of the desert. The visualization method is fundamental for testing the hypotheses made and as a strategic solution in the concrete reconstruction. The hundreds of magnificent decorated blocks saved by museums will never be positioned again on its walls. Moreover, in front of the stress and pollution caused to ancient monuments by a massive tourism, the ever-growing improving of visualization and animation techniques, like the ones presented in this paper, makes of considerable interest the modeling and the exploration inside the virtual monuments through realistic tours.&lt;&lt;ETX&gt;&gt;",Patrizia Palamidese;M. Betro;G. Muccioli,P. Palamidese;M. Betro;G. Muccioli,"CNUCE CNR, Pisa, Italy;CNUCE CNR, Pisa, Italy",,,6,4,13,
Vis,1994,GASP-a system for visualizing geometric algorithms,10.1109/VISUAL.1994.346325,http://dx.doi.org/10.1109/VISUAL.1994.346325,149,"155, C16",C,"This paper describes a system, GASP, that facilitates the visualization of geometric algorithms. The user need not have any knowledge of computer graphics in order to quickly generate a visualization. The system is also intended to facilitate the task of implementing and debugging geometric algorithms. The viewer is provided with a comfortable user interface enhancing the exploration of an algorithm's functionality. We describe the underlying concepts of the system as well as a variety of examples which illustrate its use.&lt;&lt;ETX&gt;&gt;",Ayellet Tal;David P. Dobkin,A. Tal;D. Dobkin,"Dept. of Comput. Sci., Princeton Univ., NJ, USA;Dept. of Comput. Sci., Princeton Univ., NJ, USA",,,6,3,29,
Vis,1996,Visualization of water quality data for the Chesapeake Bay,10.1109/VISUAL.1996.568146,http://dx.doi.org/10.1109/VISUAL.1996.568146,417,420,C,"We discuss a visualization system for the comparison of simulated and measured water quality. The system extends SCIRT (Site Characterization Interactive Research Toolkit), an interactive system originally developed at the NSF Engineering Research Center for Computational Field Simulation at Mississippi State University. The ongoing study of the Chesapeake Bay presents research in 3D visualization of model-data comparisons.",Adam B. Forgang;Bernd Hamann;Carl F. Cerco,A.B. Forgang;B. Hamann;C.F. Cerco,"Dept. of Comput. Eng., California Univ., Davis, CA, USA",10.1109/VISUAL.1995.485141,,6,2,5,
Vis,1997,Visualization of height field data with physical models and texture photomapping,10.1109/VISUAL.1997.663862,http://dx.doi.org/10.1109/VISUAL.1997.663862,89,94,C,"The paper discusses a unique way to visualize height field data-the use of solid fabricated parts with a photomapped texture to display scalar information. In this process, the data in a height field are turned into a 3D solid representation through solid freeform fabrication techniques, in this case laminated object manufacturing. Next, that object is used as a 3D ""photographic plate"" to allow a texture image representing scalar data to be permanently mapped onto it. The paper discusses this process and how it can be used in different visualization situations.",Dru Clark;Michael J. Bailey,D. Clark;M. Bailey,"California Univ., San Diego, La Jolla, CA, USA",10.1109/VISUAL.1991.175814,"Computer graphics, object modeling, scientific visualization",6,2,15,
Vis,1997,Visualization of rotation fields,10.1109/VISUAL.1997.663929,http://dx.doi.org/10.1109/VISUAL.1997.663929,491,494,C,"We define a rotation field by extending the notion of a vector field to rotations. A vector field has a vector as a value at each point of its domain; a rotation field has a rotation as a value at each point of its domain. Rotation fields result from mapping the orientation error of tracking systems. We build upon previous methods for the visualization of vector fields, tensor fields and rotations at a point, to visualize a rotation field resulting from calibration of a commonly-used magnetic tracking system.",Mark A. Livingston,M.A. Livingston,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.1992.235211;10.1109/VISUAL.1994.346330;10.1109/VISUAL.1992.235193;10.1109/VISUAL.1992.235227;10.1109/VISUAL.1994.346315;10.1109/VISUAL.1991.175789;10.1109/VISUAL.1993.398867;10.1109/VISUAL.1994.346338;10.1109/VISUAL.1993.398846,"Scientific visualization, tufts, streamlines, stream surfaces",6,5,22,
Vis,1998,Image-based rendering with occlusions via cubist images,10.1109/VISUAL.1998.745320,http://dx.doi.org/10.1109/VISUAL.1998.745320,327,334,C,"We attack the problem of image based rendering with occlusions and general camera motions by using distorted multiperspective images; such images provide multiple viewpoint photometry similar to the paintings of cubist artists. We take scene geometry, in contrast, to be embodied in mappings of viewing rays from their original 3D intercepts into the warped multiperspective image space. This approach allows us to render approximations of scenes with occlusions using time dense and spatially sparse sequences of camera rays, which is a significant improvement over the storage requirements of an equivalent animation sequence. Additional data compression can be achieved using sparse time keyframes as well. Interpolating the paths of sparse time key rays correctly in image space requires singular interpolation functions with spatial discontinuities. While there are many technical questions yet to be resolved, the employment of these singular interpolation functions in the multiperspective image space appears to be of potential interest for generating general viewpoint scene renderings with minimal data storage.",Andrew J. Hanson;Eric A. Wernert,A.J. Hanson;E.A. Wernert,"Indiana Univ., Bloomington, IN, USA",10.1109/VISUAL.1997.663876,"Image Based Rendering, Occlusions",6,3,17,
Vis,1998,Size preserving pattern mapping,10.1109/VISUAL.1998.745325,http://dx.doi.org/10.1109/VISUAL.1998.745325,367,373,C,"We introduce a new approach for mapping texture on volumetric iso-surfaces and parametric surfaces. Our approach maps 2D images on surfaces while maintaining continuity and preserving the size of the mapped images on the models. Our approach is fully automatic. It eliminates the need for manual mapping of texture maps. We use the curvature of a surface at a point in order to continuously vary the scale of the mapped image. This makes our approach dependent only on local attributes of a point (position, normal and its derivatives) and independent of the global shape and topology of an object. Our method can map high resolution images on low resolution volumes, hence enhancing the visual appearance of rendered volume data. We describe a general framework useful for all surface types that have a C/sup 1/ continuous normal. We demonstrate the new method for painting volume data and for mapping cavities on volume data.",Yair Kurzion;Torsten Möller;Roni Yagel,Y. Kurzion;T. Moller;R. Yagel,"Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA",,,6,4,17,
Vis,1998,Scientific visualization and data modeling of scattered sediment contaminant data in New York/New Jersey estuaries,10.1109/VISUAL.1998.745345,http://dx.doi.org/10.1109/VISUAL.1998.745345,467,470,C,"Sediments in many parts of the New York and New Jersey estuary system are contaminated with toxic organic and inorganic compounds by different sources. Because of the potential environmental consequences, detailed information on the spatial distribution of sediment contaminants is essential in order to carry out routine shipping channel dredging in an environmentally responsible way, and to remediate hot spots cost-effectively and safely. Scientific visualization and scatter data modeling techniques have been successfully applied in analyzing the sparse sampling data of sediment contaminants in New York and New Jersey estuaries, the underlying spatial characteristics of which are otherwise difficult to comprehend. Continuous realizations of contaminant concentrations in the region were obtained by using a spectral domain-decomposition scattered data model and IBM Data Explorer which is a software package for scientific data visualization.",Hong Ma;Keith W. Jones;Eric A. Stern,H. Ma;K.W. Jones;E.A. Stern,"Brookhaven Nat. Lab., Upton, NY, USA",,,6,2,9,
Vis,1998,Seabed visualization,10.1109/VISUAL.1998.745348,http://dx.doi.org/10.1109/VISUAL.1998.745348,479,481,C,"The development of a high speed multi-frequency continuous scan sonar at Sonar Research &amp; Development Ltd has resulted in the acquisition of extremely accurate, high resolution bathymetric data. This rich underwater data provides new challenges and possibilities within the field of seabed visualization. This paper introduces the reader to seabed visualization by describing two example case studies which use the Seabed Visualization System developed at SRD. Both case studies, harbour wall and shipwreck visualization, are implemented using real survey data. The high resolution of the data obtained means slight changes in the seabed topography are easily distinguishable. Annual survey inspections in both case studies enable comparisons to be made between the data sets making the visualization system an important tool for management and planning.",Paul Chapman;Peter Stevens;Derek Wills;Graham R. Brookes,P. Chapman;P. Stevens;D. Wills;G. Brookes,"Dept. of Comput. Sci., Hull Univ., UK",,,6,6,5,
InfoVis,1999,"The sunflower visual metaphor, a new paradigm for dimensional compression",10.1109/INFVIS.1999.801868,http://dx.doi.org/10.1109/INFVIS.1999.801868,128,131,C,"This paper introduces the Sunflower visual metaphor for information visualization. The visual metaphor is presented as an alternative to current techniques of dimensional compression and the visualization tools that employ them. The paper discusses the motivation for the Sunflower paradigm, its implementation and critical factors for producing an effective visualization. A primary driver in this research effort has been to develop a visualization tool that facilitates browsing, knowledge discovery, and that supports learning through sense making and integration of new information.",Stuart J. Rose,S.J. Rose,"Dept. of Manage. Inf. Syst., Arizona Univ., Tucson, AZ, USA",10.1109/INFVIS.1998.729569;10.1109/INFVIS.1996.559228;10.1109/INFVIS.1998.729570;10.1109/INFVIS.1998.729559,"information visualization, text visualization, visualization, knowledge management, information retrieval",6,1,11,
Vis,1999,Design and implementation of an immersive geoscience toolkit,10.1109/VISUAL.1999.809922,http://dx.doi.org/10.1109/VISUAL.1999.809922,429,556,C,"Having a better way to represent and to interact with large geological models are topics of high interest in geoscience, and especially for oil and gas companies. We present the design and implementation of a visualization program that involves two main features. It is based on the central data model, in order to display in real time the modifications caused by the modeler. Furthermore, it benefits from the different immersive environments which give the user a much more accurate insight of the model than a regular computer screen. Then, we focus on the difficulties that come in the way of performance.",Christophe Winkler;Fabien Bosquet;Xavier Cavin;Jean-Claude Paul,C. Winkler;F. Bosquet;X. Cavin;J.-C. Paul,"Inst. Nat. de Recherche en Inf. et Autom., Nancy, France",,,6,4,17,
InfoVis,2000,"Creativity, complexity, and precision: information visualization for (landscape) architecture",10.1109/INFVIS.2000.885105,http://dx.doi.org/10.1109/INFVIS.2000.885105,167,171,C,"Drawing on ethnographic studies of (landscape) architects at work, this paper presents a human-centered approach to information visualization. A 3D collaborative electronic workspace allows people to configure, save and browse arrangements of heterogeneous work materials. Spatial arrangements and links are created and maintained as an integral part of ongoing work with 'live' documents and objects. The result is an extension of the physical information space of the architects' studio that utilizes the potential of electronic data storage, visualization and network technologies to support work with information in context.",Monika Büscher;Dan Shapiro;Michael Christensen 0002;Preben Holst Mogensen;Peter Ørbæk,M. Buscher;D. Shapiro;M. Christensen;P. Mogensen;P. Orbaek,"Dept. of Sociology, Lancaster Univ., UK",,"Information visualization, architecture,work materials, context,spatio-temporal order, electronic workspace ",6,2,11,
Vis,2000,A computational steering system for studying microwave interactions with missile bodies,10.1109/VISUAL.2000.885727,http://dx.doi.org/10.1109/VISUAL.2000.885727,441,444,C,"The paper describes a computer modeling and simulation system that supports computational steering, which is an effort to make the typical simulation workflow more efficient. Our system provides an interface that allows scientists to perform all of the steps in the simulation process in parallel and online. It uses a standard network flow visualization package, which has been extended to display graphical output in an immersive virtual environment such as a CAVE. Our system allows scientists to interactively manipulate simulation parameters and observe the results. It also supports inverse steering, where the user specifies the desired simulation result, and the system searches for the simulation parameters that achieve this result. Taken together, these capabilities allow scientists to more efficiently and effectively understand model behavior, as well as to search through simulation parameter space. The paper is also a case study of applying our system to the problem of simulating microwave interactions with missile bodies. Because these interactions are difficult to study experimentally, and have important effects on missile electronics, there is a strong desire to develop and validate simulation models of this phenomena.",J. Edward Swan;Marco Lanzagorta;Doug Maxwell;Eddy Kuo;Jeffrey K. Uhlmann;Wendell Anderson;Haw-Jye Shyu;William Smith,J.E. Swan;M. Lanzagorta;D. Maxwell;E. Kuo;J. Uhlmann;W. Anderson;Haw-Jye Shyu;W. Smith,"Virtual Reality Lab., Naval Res. Lab., Washington, DC, USA",,"Modeling and Simulation, Scientific Visualization, Computational Steering, Inverse Steering, Virtual Reality",6,3,10,
Vis,2000,Visualizing volume data using physical models,10.1109/VISUAL.2000.885741,http://dx.doi.org/10.1109/VISUAL.2000.885741,497,500,C,"Visualization techniques enable scientists to interactively explore 3D data sets, segmenting and cutting them to reveal inner structure. While powerful, these techniques suffer from one serious flaw-the images they create are displayed on a flat piece of glass or paper. It is not really 3D-it can only be made to appear 3D. We describe the construction of 3D physical models from volumetric data. Using solid freeform fabrication equipment, these models are built as separate interlocking pieces that express in physical form the segmentation and cutting operations common in display-based visualization.",David R. Nadeau;Michael J. Bailey,D.R. Nadeau;M.J. Bailey,"Supercomput. Center, California Univ., San Diego, La Jolla, CA, USA",,"scene graphs, volume graphics, volume visualization, physical models",6,1,8,
Vis,2001,A case study on interactive exploration and guidance aids for visualizing historical data,10.1109/VISUAL.2001.964557,http://dx.doi.org/10.1109/VISUAL.2001.964557,485,488,C,"In this paper, we address the problem of historical data visualization. We describe the data acquisition, preparation, and visualization. Since the data contain four dimensions, the standard 3D exploration techniques have to be extended or appropriately adapted in order to enable interactive exploration. We discuss in detail two interaction concepts: (1) navigation with one fixed dimension, and (2) quasi 4D navigation allowing to simultaneously explore the four-dimensional space. In addition, we also present a picture-in-picture display mode, enabling the user to interactively view the data, while ""flying with"" a particular event, tracking its motion in time and space. Finally, we present a technique for guided exploration and animation generation, allowing for a vivid gain of insight into the historical data.",Stanislav L. Stoev;Wolfgang Straßer,S.L. Stoev;W. Strasser,"Tubingen Univ., Germany;Tubingen Univ., Germany",10.1109/VISUAL.1993.398847,"Visualization, Historical Data, Interaction, Time-dependent Data, Visualization Techniques",6,1,11,
Vis,2002,Case study: hardware-accelerated selective LIC volume rendering,10.1109/VISUAL.2002.1183811,http://dx.doi.org/10.1109/VISUAL.2002.1183811,485,488,C,"Line Integral Convolution (LIC) is a promising method for visualizing 2D dense flow fields. Direct extensions of the LIC method to 3D have not been considered very effective, because optical integration in viewing directions tends to spoil the coherent structures along 3D local streamlines. In our previous reports, we have proposed a selective approach to volume rendering of LIC solid texture using 3D significance map (S-map), derived from the characteristics of flow structures, and a specific illumination model for 3D streamlines. In this paper, we take full advantage of scalar volume rendering hardware, such as VolumePro, to realize a realtime 3D flow field visualization environment with the LIC volume rendering method.",Yasuko Suzuki;Issei Fujishiro;Li Chen;Hiroko Nakamura,Y. Suzuki;I. Fujishiro;L. Chen;H. Nakamura,"Mitsubishi Electr. Corp., Japan",10.1109/VISUAL.1996.567777;10.1109/VISUAL.1999.809906;10.1109/VISUAL.1997.663912;10.1109/VISUAL.1999.809892,"Flow visualization, flow topology, significance map, illumination model",6,6,16,
InfoVis,2003,Developing architectural lighting representations,10.1109/INFVIS.2003.1249032,http://doi.ieeecomputersociety.org/10.1109/INFVIS.2003.1249032,241,248,C,"This paper reports on the development of a visualization system for architectural lighting designers. It starts by motivating the problem as both complex in its physics and social organization. Three iterations of prototypes for displaying time and space varying phenomena are discussed. Fieldwork is presented to identify where in practice they will be most effective. A set of user studies, one of which is analyzed in fine-grained detail, show how building designers incorporate visualization on hypothetical design problems. This has positive implications for both energy efficiency and lighting quality in buildings.",Daniel C. Glaser;Roger Tan;John F. Canny;Ellen Yi-Luen Do,D.C. Glaser;R. Tan;J. Canny;E. Yi-Luen Do,"Interdisciplinary Doctoral Program, California Univ., Berkeley, CA, USA",,"information visualization, qualitative analysis, ethnographic fieldwork, architectural lighting design, energy efficiency",6,3,33,
Vis,2003,Appearance-preserving view-dependent visualization,10.1109/VISUAL.2003.1250409,http://dx.doi.org/10.1109/VISUAL.2003.1250409,473,480,C,"In this paper a new quadric-based view-dependent simplification scheme is presented. The scheme provides a method to connect mesh simplification controlled by a quadric error metric with a level-of-detail hierarchy that is accessed continuously and efficiently based on current view parameters. A variety of methods for determining the screen-space metric for the view calculation are implemented and evaluated, including an appearance-preserving method that has both geometry- and texture-preserving aspects. Results are presented and compared for a variety of models.",Justin Jang;William Ribarsky;Chris Shaw 0002;Peter Wonka,J. Jang;W. Ribarsky;C. Shaw;P. Wonka,"GVU Center, Georgia Inst. of Technol., Atlanta, Georgia;GVU Center, Georgia Inst. of Technol., Atlanta, Georgia;GVU Center, Georgia Inst. of Technol., Atlanta, Georgia;GVU Center, Georgia Inst. of Technol., Atlanta, Georgia",10.1109/VISUAL.1998.745342;10.1109/VISUAL.1999.809869;10.1109/VISUAL.1998.745312;10.1109/VISUAL.1999.809924;10.1109/VISUAL.2002.1183760," view-dependent, level of detail, mesh simplification, appearance-preserving, multiresolution models",6,4,27,
Vis,2003,"Visualization, optimization, business strategy: a case study",10.1109/VISUAL.2003.1250416,http://dx.doi.org/10.1109/VISUAL.2003.1250416,531,538,C,"We describe a visualization application intended for operational use in formulating business strategy in the customer service arena. The visualization capability provided in this application implicitly allows the user to better formulate the objective function for large optimization runs which act to minimize costs based on certain input parameters. Visualization is necessary because many of the inputs to the optimization runs are themselves strategic business decisions which are not pre-ordained. Both information visualization presentations and three-dimensional visualizations are included to help users better understand the cost/benefit tradeoffs of these strategic business decisions. Here, visualization explicitly provides value not possible algorithmically, as the perceived benefit of different combinations of service level does not have an a priori mathematical formulation. Thus, we take advantage of the fundamental power of visualization, bringing the user's intuition and pattern recognition skills into the solution, while simultaneously taking advantage of the strength of algorithmic approaches to quickly and accurately find an optimal solution to a well-defined problem.",Donna L. Gresh;Eugene I. Kelton,D.L. Gresh;E.I. Kelton,"IBM T.J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/INFVIS.2000.885086;10.1109/VISUAL.2002.1183817,"visualization, information visualization, optimization, VisAD",6,5,14,
Vis,2003,Interactive 3D visualization of rigid body systems,10.1109/VISUAL.2003.1250417,http://dx.doi.org/10.1109/VISUAL.2003.1250417,539,546,C,"Simulation of rigid body dynamics has been a field of active research for quite some time. However, the presentation of simulation results has received far less attention so far. We present an interactive and intuitive 3D visualization framework for rigid body simulation data. We introduce various glyphs representing vector attributes such as force and velocity as well as angular attributes including angular velocity and torque. We have integrated our visualization method into an application developed at one of the leading companies in automotive engine design and simulation. We apply our principles to visualization of chain and belt driven timing drives in engines.",Zoltan Konyha;Kresimir Matkovic;Helwig Hauser,Z. Konyha;K. Matkovic;H. Hauser,"VRVis Res. Center, Austria;VRVis Res. Center, Austria;VRVis Res. Center, Austria",10.1109/VISUAL.1993.398849;10.1109/VISUAL.1995.485141,"rigid body dynamics, rigid body simulation, glyph based visualization, iconic visualization, automotive industry",6,3,14,
Vis,2003,Holographic video display of time-series volumetric medical data,10.1109/VISUAL.2003.1250424,http://dx.doi.org/10.1109/VISUAL.2003.1250424,589,596,C,"We describe an animated electro-holographic visualization of brain lesions due to the progression of multiple sclerosis. A research case study is used which documents the expression of visible brain lesions in a series of magnetic resonance imaging (MRI) volumes collected over the interval of one year. Some of the salient information resident within this data is described, and the motivation for using a dynamic spatial display to explore its spatial and temporal characteristics is stated. We provide a brief overview of spatial displays in medical imaging applications, and then describe our experimental visualization pipeline, from the processing of MRI datasets, through model construction, computer graphic rendering, and hologram encoding. The utility, strengths and shortcomings of the electro-holographic visualization are described and future improvements are suggested.",Wendy Plesniak;Michael Halle;Steven D. Pieper;William M. Wells III;Marianna Jakab;Dominik S. Meier;Stephen A. Benton;Charles R. G. Guttmann;Ron Kikinis,W. Plesniak;M. Halle;S.D. Pieper;W. Wells;M. Jakab;D.S. Meier;S.A. Benton;R.G. Guttmann;R. Kikinis,"Surg. Planning Lab., MIT, USA;Surg. Planning Lab., MIT, USA",,"electro-holography, holographic video, computer generated holograms, autostereoscopic display, medical imaging",6,0,29,
InfoVis,2004,An Associative Information Visualizer,10.1109/INFVIS.2004.4,http://dx.doi.org/10.1109/INFVIS.2004.4,r8,r8,M,,Howard D. White;Xia Lin;Jan W. Buzydlowski,H.D. White;Xia Lin;J. Buzydlowski,Drexel University,,,6,1,4,
InfoVis,2004,Visualizing E-mail with a Semantically Zoomable Interface,10.1109/INFVIS.2004.75,http://dx.doi.org/10.1109/INFVIS.2004.75,6,6,M,"We introduce a semantically zoomable interface that displays emails as interactive objects rather than files containing lines of text, as in traditional e-mail interfaces. In this system, e-mails are displayed as node objects called e-mail nodes within a 2.5-dimensional world. The e-mail nodes are semantically zoomable and each may be rearranged to different locations within the plane to organize threads, topics, or projects. The prototype for this system was built using the Piccolo toolkit, the successor of Pad++ and Jazz [2, 3].",Ellen Diep;Robert J. K. Jacob,E. Diep;R.J.K. Jacob,Tufts University,,,6,2,9,
Vis,2004,Real-Time Volume Rendering of Four Channel Data Sets,10.1109/VISUAL.2004.89,http://dx.doi.org/10.1109/VISUAL.2004.89,34,34,M,"We present a novel method to encode four data channels in a volumetric data set, and render it at interactive frame rates with maximum intensity projection (MIP) using textured polygons. The first three channels are stored in the volume texture’s red, green, and blue components. The fourth channel is stored in the alpha channel. To achieve real-time rendering speed we are using a pixel shader.",Jürgen P. Schulze;Alexander Rice,J.P. Schulze;A. Rice,Brown University,,,6,2,3,
Vis,2006,Analyzing Vortex Breakdown Flow Structures by Assignment of Colors to Tensor Invariants,10.1109/TVCG.2006.119,http://dx.doi.org/10.1109/TVCG.2006.119,1189,1196,J,"Topological methods are often used to describe flow structures in fluid dynamics and topological flow field analysis usually relies on the invariants of the associated tensor fields. A visual impression of the local properties of tensor fields is often complex and the search of a suitable technique for achieving this is an ongoing topic in visualization. This paper introduces and assesses a method of representing the topological properties of tensor fields and their respective flow patterns with the use of colors. First, a tensor norm is introduced, which preserves the properties of the tensor and assigns the tensor invariants to values of the RGB color space. Secondly, the RGB colors of the tensor invariants are transferred to corresponding hue values as an alternative color representation. The vectorial tensor invariants field is reduced to a scalar hue field and visualization of iso-surfaces of this hue value field allows us to identify locations with equivalent flow topology. Additionally highlighting by the maximum of the eigenvalue difference field reflects the magnitude of the structural change of the flow. The method is applied on a vortex breakdown flow structure inside a cylinder with a rotating lid",Markus Rütten;Min S. Chong,Markus Rutten;Min S. Chong,,10.1109/VISUAL.2003.1250379;10.1109/VISUAL.1997.663858;10.1109/VISUAL.2004.99;10.1109/VISUAL.2004.80;10.1109/VISUAL.2004.113;10.1109/VISUAL.1994.346326;10.1109/VISUAL.1993.398849,"Flow visualization, Tensor field Topology, Invariants",6,2,26,
Vis,2006,Detection and Visualization of Defects in 3D Unstructured Models of Nematic Liquid Crystals,10.1109/TVCG.2006.133,http://dx.doi.org/10.1109/TVCG.2006.133,1045,1052,J,"A method for the semi-automatic detection and visualization of defects in models of nematic liquid crystals (NLCs) is introduced; this method is suitable for unstructured models, a previously unsolved problem. The detected defects - also known as disclinations - are regions were the alignment of the liquid crystal rapidly changes over space; these defects play a large role in the physical behavior of the NLC substrate. Defect detection is based upon a measure of total angular change of crystal orientation (the director) over a node neighborhood via the use of a nearest neighbor path. Visualizations based upon the detection algorithm clearly identify complete defect regions as opposed to incomplete visual descriptions provided by cutting-plane and isosurface approaches. The introduced techniques are currently in use by scientists studying the dynamics of defect change",Ketan Mehta;T. J. Jankun-Kelly,Ketan Mehta;T.j. Jankun-Kelly,"Vital Images, 5850 Opus Parkway, Suite 300, Minnetonka, MN 55343. Work completed at Mississippi State University;Department of Computer Science and Engineering, James Worth Bagley College of Engineering, Mississippi State University, Mississippi State, MS, 39762",10.1109/TVCG.2006.181;10.1109/TVCG.2006.182;10.1109/VISUAL.1997.663894;10.1109/VISUAL.2004.23;10.1109/VISUAL.2001.964507,"scientific visualization, disclination, nematic liquid crystal, defects, unstructured grid, feature extraction",6,6,34,
Vis,2006,Interactive Point-based Isosurface Exploration and High-quality Rendering,10.1109/TVCG.2006.153,http://dx.doi.org/10.1109/TVCG.2006.153,1267,1274,J,"We present an efficient point-based isosurface exploration system with high quality rendering. Our system incorporates two point-based isosurface extraction and visualization methods: edge splatting and the edge kernel method. In a volume, two neighboring voxels define an edge. The intersection points between the active edges and the isosurface are used for exact isosurface representation. The point generation is incorporated in the GPU-based hardware-accelerated rendering, thus avoiding any overhead when changing the isovalue in the exploration. We call this method edge splatting. In order to generate high quality isosurface rendering regardless of the volume resolution and the view, we introduce an edge kernel method. The edge kernel upsamples the isosurface by subdividing every active cell of the volume data. Enough sample points are generated to preserve the exact shape of the isosurface defined by the trilinear interpolation of the volume data. By employing these two methods, we can achieve interactive isosurface exploration with high quality rendering",Haitao Zhang;Arie E. Kaufman,Haitao Zhang;Arie Kaufman,Stony Brook University;Stony Brook University,10.1109/VISUAL.1998.745713;10.1109/VISUAL.2004.29;10.1109/VISUAL.1996.568121;10.1109/VISUAL.2004.52;10.1109/VISUAL.1998.745300,"Isosurface, point-based visualization, isosurface extraction, hardware acceleration, GPU acceleration",6,5,29,
Vis,2006,Using Difference Intervals for Time-Varying Isosurface Visualization,10.1109/TVCG.2006.188,http://dx.doi.org/10.1109/TVCG.2006.188,1275,1282,J,"We present a novel approach to out-of-core time-varying isosurface visualization. We attempt to interactively visualize time-varying datasets which are too large to fit into main memory using a technique which is dramatically different from existing algorithms. Inspired by video encoding techniques, we examine the data differences between time steps to extract isosurface information. We exploit span space extraction techniques to retrieve operations necessary to update isosurface geometry from neighboring time steps. Because only the changes between time steps need to be retrieved from disk, I/O bandwidth requirements are minimized. We apply temporal compression to further reduce disk access and employ a point-based previewing technique that is refined in idle interaction cycles. Our experiments on computational simulation data indicate that this method is an extremely viable solution to large time-varying isosurface visualization. Our work advances the state-of-the-art by enabling all isosurfaces to be represented by a compact set of operations",Kenneth W. Waters;Christopher S. Co;Kenneth I. Joy,Kenneth W. Waters;Christopher S. Co;Kenneth I. Joy,"Institute for Data Analysis and Visualization at the University of California, Davis;Institute for Data Analysis and Visualization at the University of California, Davis;Institute for Data Analysis and Visualization at the University of California, Davis",10.1109/VISUAL.1996.568121;10.1109/VISUAL.1998.745298;10.1109/VISUAL.2004.52;10.1109/VISUAL.2004.29;10.1109/VISUAL.1997.663895;10.1109/VISUAL.1999.809879,"Isosurface, time-varying, span space, out-of-core, point-based rendering",6,4,15,
VAST,2007,C-GROUP: A Visual Analytic Tool for Pairwise Analysis of Dynamic Group Membership,10.1109/VAST.2007.4389022,http://dx.doi.org/10.1109/VAST.2007.4389022,211,212,M,"C-GROUP is a tool for analyzing dynamic group membership in social networks over time. Unlike most network visualization tools, which show the group structure within an entire network, or the group membership for a single actor, C-GROUP allows users to focus their analysis on a pair of individuals of interest. And unlike most dynamic social network visualization tools, which focus on the addition and deletion of nodes (actors) and edges (relationships) over time, C-GROUP focuses on changing group memberships over time. C-GROUP provides users with a flexible interface for defining (and redefining) groups interactively, and allows users to view the changing group memberships for the pair over time. This helps to highlight the similarities and differences between the individuals and their evolving group memberships. C-GROUP allows users to dynamically select the time granularity of the temporal evolution and supports two novel visual representations of the evolving group memberships. This flexibility gives users alternate views that are appropriate for different network sizes and provides users with different insights into the grouping behavior.",Hyunmo Kang;Lise Getoor;Lisa Singh,Hyunmo Kang;Lise Getoor;Lisa Singh,"University of Maryland, College Park, MD 20742. kang@cs.umd.edu;University of Maryland, College Park, MD 20742. getoor@cs.umd.edu;Georgetown University, Washington, DC 20052. singh@cs.georgetown.edu",,,6,2,1,
InfoVis,2008,Evaluating the Use of Data Transformation for Information Visualization,10.1109/TVCG.2008.129,http://dx.doi.org/10.1109/TVCG.2008.129,1309,1316,J,"Data transformation, the process of preparing raw data for effective visualization, is one of the key challenges in information visualization. Although researchers have developed many data transformation techniques, there is little empirical study of the general impact of data transformation on visualization. Without such study, it is difficult to systematically decide when and which data transformation techniques are needed. We thus have designed and conducted a two-part empirical study that examines how the use of common data transformation techniques impacts visualization quality, which in turn affects user task performance. Our first experiment studies the impact of data transformation on user performance in single-step, typical visual analytic tasks. The second experiment assesses the impact of data transformation in multi-step analytic tasks. Our results quantify the benefits of data transformation in both experiments. More importantly, our analyses reveal that (1) the benefits of data transformation vary significantly by task and by visualization, and (2) the use of data transformation depends on a user's interaction context. Based on our findings, we present a set of design recommendations that help guide the development and use of data transformation techniques.",Zhen Wen;Michelle X. Zhou,Zhen Wen;Michelle Zhou,IBM T. J. Watson Research Center;IBM T. J. Watson Research Center,10.1109/INFVIS.2005.1532136;10.1109/INFVIS.2004.70;10.1109/TVCG.2006.161;10.1109/INFVIS.2000.885092;10.1109/INFVIS.2003.1249015;10.1109/VISUAL.1990.146375;10.1109/TVCG.2007.70577,"data transformation, data cleaning, empirical evaluation, user studies",6,3,24,
VAST,2008,Supporting exploration awareness for visual analytics,10.1109/VAST.2008.4677378,http://dx.doi.org/10.1109/VAST.2008.4677378,185,186,M,"While exploring data using information visualization, analysts try to make sense of the data, build cases, and present them to others. However, if the exploration is long or done in multiple sessions, it can be hard for analysts to remember all interesting visualizations and the relationships among them they have seen. Often, they will see the same or similar visualizations, and are unable to recall when, why and how they have seen something similar. Recalling and retrieving interesting visualizations are important tasks for the analysis processes such as problem solving, reasoning, and conceptualization. In this paper, we argue that offering support for thinking based on past analysis processes is important, and present a solution for this.",Yedendra Babu Shrinivasan;Jarke J. van Wijk,Yedendra B. Shrinivasan;Jarke J. van Wijk,"Eindhoven University of Technology, The Netherlands;Eindhoven University of Technology, The Netherlands",,,6,3,4,
VAST,2008,Cell phone mini challenge award: Intuitive social network graphs visual analytics of cell phone data using mobivis and ontovis,10.1109/VAST.2008.4677391,http://dx.doi.org/10.1109/VAST.2008.4677391,,,M,"MobiVis is a visual analytics tools to aid in the process of processing and understanding complex relational data, such as social networks. At the core of these tools is the ability to filter complex networks structurally and semantically, which helps us discover clusters and patterns in the organization of social networks. Semantic filtering is obtained via an ontology graph, based on another visual analytics tool, called OntoVis. In this summary, we describe how these tools where used to analyze one of the mini-challenges of the 2008 VAST challenge.",Carlos D. Correa;Tarik Crnovrsanin;Chris Muelder;Zeqian Shen;Ryan Armstrong;James Shearer;Kwan-Liu Ma,Carlos D. Correa;Tarik Crnovrsanin;Christopher Muelder;Zeqian Shen;Ryan Armstrong;James Shearer;Kwan-Liu Ma,"Visualization and Interface Design Innovation (VIDI) Group, University of California, Davis, USA;Visualization and Interface Design Innovation (VIDI) Group, University of California, Davis, USA;Visualization and Interface Design Innovation (VIDI) Group, University of California, Davis, USA;Visualization and Interface Design Innovation (VIDI) Group, University of California, Davis, USA;Visualization and Interface Design Innovation (VIDI) Group, University of California, Davis, USA;Visualization and Interface Design Innovation (VIDI) Group, University of California, Davis, USA;Visualization and Interface Design Innovation (VIDI) Group, University of California, Davis, USA",,,6,3,2,
VAST,2008,Award: Efficient toolkit integration solving the cell phone calls challenge with the Prajna Project,10.1109/VAST.2008.4677396,http://dx.doi.org/10.1109/VAST.2008.4677396,,,M,"The Prajna Project is a Java toolkit designed to provide various capabilities for visualization, knowledge representation, geographic displays, semantic reasoning, and data fusion. Rather than attempt to recreate the significant capabilities provided in other tools, Prajna instead provides software bridges to incorporate other toolkits where appropriate. This challenge required the development of a custom application for visual analysis. By applying the utilities within the Prajna project, I developed a robust and diverse set of capabilities to solve the analytical challenge.",Edward Swing,Edward Swing,"Vision Systems & Technology, Inc., USA",,,6,2,5,
Vis,2008,Interactive Visualization and Analysis of Transitional Flow,10.1109/TVCG.2008.146,http://dx.doi.org/10.1109/TVCG.2008.146,1420,1427,J,"A stand-alone visualization application has been developed by a multi-disciplinary, collaborative team with the sole purpose of creating an interactive exploration environment allowing turbulent flow researchers to experiment and validate hypotheses using visualization. This system has specific optimizations made in data management, caching computations, and visualization allowing for the interactive exploration of datasets on the order of 1TB in size. Using this application, the user (co-author Calo) is able to interactively visualize and analyze all regions of a transitional flow volume, including the laminar, transitional and fully turbulent regions. The underlying goal of the visualizations produced from these transitional flow simulations is to localize turbulent spots in the laminar region of the boundary layer, determine under which conditions they form, and follow their evolution. The initiation of turbulent spots, which ultimately lead to full turbulence, was located via a proposed feature detection condition and verified by experimental results. The conditions under which these turbulent spots form and coalesce are validated and presented.",Gregory P. Johnson;Victor M. Calo;Kelly P. Gaither,"Gregory P. Johnson,;Victor M. Calo;Kelly P. Gaither",INRIA,10.1109/VISUAL.2005.1532792;10.1109/VISUAL.1993.398850;10.1109/VISUAL.2005.1532794;10.1109/VISUAL.1991.175818;10.1109/VISUAL.2004.55,"Applications of Visualization, Flow Visualization, Transitional Flow, Turbulence",6,5,31,
VAST,2009,Articulate: a conversational interface for visual analytics,10.1109/VAST.2009.5333099,http://dx.doi.org/10.1109/VAST.2009.5333099,233,234,M,"While many visualization tools exist that offer sophisticated functions for charting complex data, they still expect users to possess a high degree of expertise in wielding the tools to create an effective visualization. This poster presents Articulate, an attempt at a semi-automated visual analytic model that is guided by a conversational user interface. The goal is to relieve the user of the physical burden of having to directly craft a visualization through the manipulation of a complex user-interface, by instead being able to verbally articulate what the user wants to see, and then using natural language processing and heuristics to semi-automatically create a suitable visualization.",Yiwen Sun;Jason Leigh;Andrew E. Johnson;Dennis Chau,Yiwen Sun;Jason Leigh;Andrew Johnson;Dennis Chau,"Electronic Visualization Laboratory, University of Illinois at Chicago, USA;Electronic Visualization Laboratory, University of Illinois at Chicago, USA;Electronic Visualization Laboratory, University of Illinois at Chicago, USA;Electronic Visualization Laboratory, University of Illinois at Chicago, USA",,,6,1,9,
Vis,2010,VDVR: Verifiable Volume Visualization of Projection-Based Data,10.1109/TVCG.2010.211,http://dx.doi.org/10.1109/TVCG.2010.211,1515,1524,J,"Practical volume visualization pipelines are never without compromises and errors. A delicate and often-studied component is the interpolation of off-grid samples, where aliasing can lead to misleading artifacts and blurring, potentially hiding fine details of critical importance. The verifiable visualization framework we describe aims to account for these errors directly in the volume generation stage, and we specifically target volumetric data obtained via computed tomography (CT) reconstruction. In this case the raw data are the X-ray projections obtained from the scanner and the volume data generation process is the CT algorithm. Our framework informs the CT reconstruction process of the specific filter intended for interpolation in the subsequent visualization process, and this in turn ensures an accurate interpolation there at a set tolerance. Here, we focus on fast trilinear interpolation in conjunction with an octree-type mixed resolution volume representation without T-junctions. Efficient rendering is achieved by a space-efficient and locality-optimized representation, which can straightforwardly exploit fast fixed-function pipelines on GPUs.",Ziyi Zheng;Wei Xu 0020;Klaus Mueller,Ziyi Zheng;Wei Xu;Klaus Mueller,Stony Brook University;Stony Brook University;Stony Brook University,10.1109/VISUAL.1999.809908;10.1109/VISUAL.1991.175805;10.1109/TVCG.2009.194;10.1109/TVCG.2006.141;10.1109/VISUAL.1994.346331;10.1109/VISUAL.2004.70;10.1109/TVCG.2009.149,"Direct volume rendering, computed tomography, filtered back-projection, verifiable visualization ",6,5,36,
VAST,2012,Visualising variations in household energy consumption,10.1109/VAST.2012.6400545,http://dx.doi.org/10.1109/VAST.2012.6400545,217,218,M,"There is limited understanding of the relationship between neighbourhoods, demographic characteristics and domestic energy consumption habits. We report upon research that combines datasets relating to household energy use with geodemographics to enable better understanding of UK energy user types. A novel interactive interface is planned to evaluate the performance of specifically created energy-based data classifications. The research aims to help local governments and the energy industry in targeting households and populations for new energy saving schemes and in improving efforts to promote sustainable energy consumption. The new classifications may also stimulate consumption awareness amongst domestic users. This poster reports on initial visual findings and describes the research methodology, data sources and future visualisation requirements.",Sarah Goodwin;Jason Dykes,Sarah Goodwin;Jason Dykes,"giCentre, City University London, UK;giCentre, City University London, UK",,,6,2,10,
VAST,2012,SocialNetSense: Supporting sensemaking of social and structural features in networks with interactive visualization,10.1109/VAST.2012.6400558,http://dx.doi.org/10.1109/VAST.2012.6400558,133,142,C,"Increasingly, social network datasets contain social attribute information about actors and their relationship. Analyzing such network with social attributes requires making sense of not only its structural features, but also the relationship between social features in attributes and network structures. Existing social network analysis tools are usually weak in supporting complex analytical tasks involving both structural and social features, and often overlook users' needs for sensemaking tools that help to gather, synthesize, and organize information of these features. To address these challenges, we propose a sensemaking framework of social-network visual analytics in this paper. This framework considers both bottom-up processes, which are about constructing new understandings based on collected information, and top-down processes, which concern using prior knowledge to guide information collection, in analyzing social networks from both social and structural perspectives. The framework also emphasizes the externalization of sensemaking processes through interactive visualization. Guided by the framework, we develop a system, SocialNetSense, to support the sensemaking in visual analytics of social networks with social attributes. The example of using our system to analyze a scholar collaboration network shows that our approach can help users gain insight into social networks both structurally and socially, and enhance their process awareness in visual analytics.",Liang Gou;Xiaolong Zhang 0001;Airong Luo;Patricia F. Anderson,Liang Gou;Xiaolong Zhang;Airong Luo;Patricia F. Anderson,The Pennsylvania State University;The Pennsylvania State University;University of Michigan;University of Michigan,10.1109/INFVIS.1999.801853;10.1109/TVCG.2011.247;10.1109/INFVIS.2005.1532126;10.1109/VISUAL.2005.1532788;10.1109/TVCG.2007.70582;10.1109/TVCG.2006.192;10.1109/VAST.2009.5333020;10.1109/VAST.2011.6102440;10.1109/VAST.2006.261426;10.1109/INFVIS.2004.2;10.1109/TVCG.2008.137;10.1109/TVCG.2006.166;10.1109/TVCG.2006.160;10.1109/VAST.2008.4677365;10.1109/TVCG.2006.147;10.1109/VAST.2007.4389006,"Social network, visualization, sensemaking, visual analytics, SocialNetSense",6,0,48,
VAST,2013,Decision Exploration Lab: A Visual Analytics Solution for Decision Management,10.1109/TVCG.2013.146,http://dx.doi.org/10.1109/TVCG.2013.146,1972,1981,J,"We present a visual analytics solution designed to address prevalent issues in the area of Operational Decision Management (ODM). In ODM, which has its roots in Artificial Intelligence (Expert Systems) and Management Science, it is increasingly important to align business decisions with business goals. In our work, we consider decision models (executable models of the business domain) as ontologies that describe the business domain, and production rules that describe the business logic of decisions to be made over this ontology. Executing a decision model produces an accumulation of decisions made over time for individual cases. We are interested, first, to get insight in the decision logic and the accumulated facts by themselves. Secondly and more importantly, we want to see how the accumulated facts reveal potential divergences between the reality as captured by the decision model, and the reality as captured by the executed decisions. We illustrate the motivation, added value for visual analytics, and our proposed solution and tooling through a business case from the car insurance industry.",Bertjan Broeksema;Thomas Baudel;Arthur G. Telea;Paolo Crisafulli,Bertjan Broeksema;Thomas Baudel;Alex Telea;Paolo Crisafulli,"IBM France Center for Advanced Studies, Institute Johann Bernoulli, University of Groningen, The Netherlands andINRIA, University of Bordeaux, France;IBM France Center for Advanced Studies;Institute Johann Bernoulli, University of Groningen, The Netherlands;IBM France",10.1109/VISUAL.1991.175815;10.1109/VAST.2011.6102463;10.1109/VAST.2010.5652398;10.1109/VAST.2008.4677361;10.1109/VAST.2008.4677363;10.1109/TVCG.2011.185;10.1109/VAST.2011.6102457,"Decision support systems, model validation and analysis, multivariate Statistics, program analysis",6,7,49,
InfoVis,2014,Visualizing Statistical Mix Effects and Simpson's Paradox,10.1109/TVCG.2014.2346297,http://dx.doi.org/10.1109/TVCG.2014.2346297,2132,2141,J,"We discuss how “mix effects” can surprise users of visualizations and potentially lead them to incorrect conclusions. This statistical issue (also known as “omitted variable bias” or, in extreme cases, as “Simpson's paradox”) is widespread and can affect any visualization in which the quantity of interest is an aggregated value such as a weighted sum or average. Our first contribution is to document how mix effects can be a serious issue for visualizations, and we analyze how mix effects can cause problems in a variety of popular visualization techniques, from bar charts to treemaps. Our second contribution is a new technique, the “comet chart,” that is meant to ameliorate some of these issues.",Zan Armstrong;Martin Wattenberg,Zan Armstrong;Martin Wattenberg,"Google at the time of research, currently unaffiliated;Google",10.1109/TVCG.2012.213;10.1109/TVCG.2007.70577,"Mix effects, Omitted variable bias, Simpson's paradox, Statistics",6,5,34,
InfoVis,2014,Reinforcing Visual Grouping Cues to Communicate Complex Informational Structure,10.1109/TVCG.2014.2346998,http://dx.doi.org/10.1109/TVCG.2014.2346998,1973,1982,J,"In his book Multimedia Learning [7], Richard Mayer asserts that viewers learn best from imagery that provides them with cues to help them organize new information into the correct knowledge structures. Designers have long been exploiting the Gestalt laws of visual grouping to deliver viewers those cues using visual hierarchy, often communicating structures much more complex than the simple organizations studied in psychological research. Unfortunately, designers are largely practical in their work, and have not paused to build a complex theory of structural communication. If we are to build a tool to help novices create effective and well structured visuals, we need a better understanding of how to create them. Our work takes a first step toward addressing this lack, studying how five of the many grouping cues (proximity, color similarity, common region, connectivity, and alignment) can be effectively combined to communicate structured text and imagery from real world examples. To measure the effectiveness of this structural communication, we applied a digital version of card sorting, a method widely used in anthropology and cognitive science to extract cognitive structures. We then used tree edit distance to measure the difference between perceived and communicated structures. Our most significant findings are: 1) with careful design, complex structure can be communicated clearly; 2) communicating complex structure is best done with multiple reinforcing grouping cues; 3) common region (use of containers such as boxes) is particularly effective at communicating structure; and 4) alignment is a weak structural communicator.",Juhee Bae;Benjamin Watson,Juhee Bae;Benjamin Watson,North Carolina State University;North Carolina State University,10.1109/TVCG.2010.174;10.1109/INFVIS.2003.1249005,"Visual grouping, visual hierarchy, gestalt principles, perception, visual communication",6,7,18,
SciVis,2014,Boundary Aware Reconstruction of Scalar Fields,10.1109/TVCG.2014.2346351,http://dx.doi.org/10.1109/TVCG.2014.2346351,2447,2455,J,"In visualization, the combined role of data reconstruction and its classification plays a crucial role. In this paper we propose a novel approach that improves classification of different materials and their boundaries by combining information from the classifiers at the reconstruction stage. Our approach estimates the targeted materials' local support before performing multiple material-specific reconstructions that prevent much of the misclassification traditionally associated with transitional regions and transfer function (TF) design. With respect to previously published methods our approach offers a number of improvements and advantages. For one, it does not rely on TFs acting on derivative expressions, therefore it is less sensitive to noisy data and the classification of a single material does not depend on specialized TF widgets or specifying regions in a multidimensional TF. Additionally, improved classification is attained without increasing TF dimensionality, which promotes scalability to multivariate data. These aspects are also key in maintaining low interaction complexity. The results are simple-to-achieve visualizations that better comply with the user's understanding of discrete features within the studied object.",Stefan Lindholm;Daniel Jönsson;Charles D. Hansen;Anders Ynnerman,Stefan Lindholm;Daniel Jönsson;Charles Hansen;Anders Ynnerman,"Department of Science and Technology, Linköping University;Department of Science and Technology, Linköping University;Scientific Computing and Imaging Institute, University of Utah;Department of Science and Technology, Linköping University",10.1109/TVCG.2007.70518;10.1109/TVCG.2008.186;10.1109/VISUAL.2003.1250386;10.1109/VISUAL.2005.1532807;10.1109/VISUAL.1998.745311;10.1109/VISUAL.2003.1250387,"Reconstruction, signal processing, kernel regression, volume rendering",6,7,27,
SciVis,2014,ADR - Anatomy-Driven Reformation,10.1109/TVCG.2014.2346405,http://dx.doi.org/10.1109/TVCG.2014.2346405,2496,2505,J,"Dedicated visualization methods are among the most important tools of modern computer-aided medical applications. Reformation methods such as Multiplanar Reformation or Curved Planar Reformation have evolved as useful tools that facilitate diagnostic and therapeutic work. In this paper, we present a novel approach that can be seen as a generalization of Multiplanar Reformation to curved surfaces. The main concept is to generate reformatted medical volumes driven by the individual anatomical geometry of a specific patient. This process generates flat views of anatomical structures that facilitate many tasks such as diagnosis, navigation and annotation. Our reformation framework is based on a non-linear as-rigid-as-possible volumetric deformation scheme that uses generic triangular surface meshes as input. To manage inevitable distortions during reformation, we introduce importance maps which allow controlling the error distribution and improving the overall visual quality in areas of elevated interest. Our method seamlessly integrates with well-established concepts such as the slice-based inspection of medical datasets and we believe it can improve the overall efficiency of many medical workflows. To demonstrate this, we additionally present an integrated visualization system and discuss several use cases that substantiate its benefits.",Jan Kretschmer;Grzegorz Soza;Christian Tietjen;Michael Sühling;Bernhard Preim;Marc Stamminger,Jan Kretschmer;Grzegorz Soza;Christian Tietjen;Michael Suehling;Bernhard Preim;Marc Stamminger,"Department of Computer Graphics, FAU Erlangen, and Siemens Healthcare Computed Tomography, Forchheim, Germany;Siemens Healthcare Computed Tomography, Forchheim, Germany;Siemens Healthcare Computed Tomography, Forchheim, Germany;Siemens Healthcare Computed Tomography, Forchheim, Germany;Department of Simulation and Graphics, Otto-von-Guericke University of Magdeburg, Germany;Department of Computer Graphics, FAU Erlangen, Germany",10.1109/VISUAL.2003.1250353;10.1109/TVCG.2013.215;10.1109/VISUAL.2001.964540;10.1109/TVCG.2007.70550;10.1109/VISUAL.2002.1183754;10.1109/VISUAL.2003.1250351,"Medical Visualization, Volume Reformation, Viewing Algorithms",6,5,47,
VAST,2014,The Spinel Explorer - Interactive Visual Analysis of Spinel Group Minerals,10.1109/TVCG.2014.2346754,http://dx.doi.org/10.1109/TVCG.2014.2346754,1913,1922,J,"Geologists usually deal with rocks that are up to several thousand million years old. They try to reconstruct the tectonic settings where these rocks were formed and the history of events that affected them through the geological time. The spinel group minerals provide useful information regarding the geological environment in which the host rocks were formed. They constitute excellent indicators of geological environments (tectonic settings) and are of invaluable help in the search for mineral deposits of economic interest. The current workflow requires the scientists to work with different applications to analyze spine data. They do use specific diagrams, but these are usually not interactive. The current workflow hinders domain experts to fully exploit the potentials of tediously and expensively collected data. In this paper, we introduce the Spinel Explorer-an interactive visual analysis application for spinel group minerals. The design of the Spinel Explorer and of the newly introduced interactions is a result of a careful study of geologists' tasks. The Spinel Explorer includes most of the diagrams commonly used for analyzing spinel group minerals, including 2D binary plots, ternary plots, and 3D Spinel prism plots. Besides specific plots, conventional information visualization views are also integrated in the Spinel Explorer. All views are interactive and linked. The Spinel Explorer supports conventional statistics commonly used in spinel minerals exploration. The statistics views and different data derivation techniques are fully integrated in the system. Besides the Spinel Explorer as newly proposed interactive exploration system, we also describe the identified analysis tasks, and propose a new workflow. We evaluate the Spinel Explorer using real-life data from two locations in Argentina: the Frontal Cordillera in Central Andes and Patagonia. We describe the new findings of the geologists which would have been much more difficult to achieve using the current workflow only. Very positive feedback from geologists confirms the usefulness of the Spinel Explorer.",Maria Luján Ganuza;Gabriela Ferracutti;Maria Florencia Gargiulo;Silvia Mabel Castro;Ernesto A. Bjerg;M. Eduard Gröller;Kresimir Matkovic,María Luján Ganuza;Gabriela Ferracutti;María Florencia Gargiulo;Silvia Mabel Castro;Ernesto Bjerg;Eduard Gröller;Krešimir Matković,"VyGLab Research Laboratory at the Universidad Nacional del Sur, Bahía Blanca, Argentina;Departamento de GeologíaINGEOSUR CCT CONICET, Universidad Nacional del Sur, Bahía Blanca, Argentina;Departamento de Geología, Universidad Nacional del Sur, Bahía Blanca, Argentina;VyGLab Research Laboratory at the Universidad Nacional del Sur, Bahía Blanca, Argentina;Departamento de GeologíaINGEOSUR CCT CONICET, Universidad Nacional del Sur, Bahía Blanca, Argentina;Vienna University of Technology, Austria;VRVis Research Center, Vienna, Austria",10.1109/INFVIS.2000.885086;10.1109/TVCG.2009.155;10.1109/VISUAL.1995.485139,"Interactive visual analysis, visualization in earth/space/ and environmental sciences, coordinated and multiple views, design studies",6,6,29,
VAST,2014,HydroQual: Visual Analysis of River Water Quality,10.1109/VAST.2014.7042488,http://dx.doi.org/10.1109/VAST.2014.7042488,123,132,C,"Economic development based on industrialization, intensive agriculture expansion and population growth places greater pressure on water resources through increased water abstraction and water quality degradation [40], River pollution is now a visible issue, with emblematic ecological disasters following industrial accidents such as the pollution of the Rhine river in 1986 [31]. River water quality is a pivotal public health and environmental issue that has prompted governments to plan initiatives for preserving or restoring aquatic ecosystems and water resources [56], Water managers require operational tools to help interpret the complex range of information available on river water quality functioning. Tools based on statistical approaches often fail to resolve some tasks due to the sparse nature of the data. Here we describe HydroQual, a tool to facilitate visual analysis of river water quality. This tool combines spatiotemporal data mining and visualization techniques to perform tasks defined by water experts. We illustrate the approach with a case study that illustrates how the tool helps experts analyze water quality. We also perform a qualitative evaluation with these experts.",Pierre Accorsi;Nathalie Lalande;Mickaël Fabrègue;Agnès Braud;Pascal Poncelet;Arnaud Sallaberry;Sandra Bringay;Maguelonne Teisseire;Flavie Cernesson;Florence Le Ber,Pierre Accorsi;Nathalie Lalande;Mickäel Fabrègue;Agnès Braud;Pascal Poncelet;Arnaud Sallaberry;Sandra Bringay;Maguelonne Teisseire;Flavie Cernesson;Florence Le Ber,LIRMM Univ. Montpellier 2;IRSTEA Montpellier;IRSTEA Montpellier Univ. Strasbourg/ENGEES;ICube Univ. Strasbourg;LIRMM Univ. Montpellier 2;LIRMM Univ. Montpellier 3;LIRMM Univ. Montpellier 3;IRSTEA Montpellier;AgroParisTech Montpellier;ICube Univ. Strasbourg/ENGEES,10.1109/VISUAL.1996.568146;10.1109/INFVIS.2000.885097,"Visual Analytics, Spatiotemporal Data Mining and Visualization, Water Quality",6,4,60,
SciVis,2015,Visual Verification of Space Weather Ensemble Simulations,10.1109/SciVis.2015.7429487,http://dx.doi.org/10.1109/SciVis.2015.7429487,17,24,C,"We propose a system to analyze and contextualize simulations of coronal mass ejections. As current simulation techniques require manual input, uncertainty is introduced into the simulation pipeline leading to inaccurate predictions that can be mitigated through ensemble simulations. We provide the space weather analyst with a multi-view system providing visualizations to: 1. compare ensemble members against ground truth measurements, 2. inspect time-dependent information derived from optical flow analysis of satellite images, and 3. combine satellite images with a volumetric rendering of the simulations. This three-tier workflow provides experts with tools to discover correlations between errors in predictions and simulation parameters, thus increasing knowledge about the evolution and propagation of coronal mass ejections that pose a danger to Earth and interplanetary travel.",Alexander Bock;Asher Pembroke;M. Leila Mays;Lutz Rastaetter;Timo Ropinski;Anders Ynnerman,Alexander Bock;Asher Pembroke;M. Leila Mays;Lutz Rastaetter;Timo Ropinski;Anders Ynnerman,Linkoping University;NASA Goddard Space Flight Center;NASA Goddard Space Flight Center;NASA Goddard Space Flight Center;Ulm University;Linköping University,10.1109/TVCG.2010.190;10.1109/TVCG.2010.181;10.1109/TVCG.2013.143,"Visual Verification, Space Weather, Coronal Mass Ejections, Ensemble",6,8,25,
SciVis,2015,Visualization and Analysis of Rotating Stall for Transonic Jet Engine Simulation,10.1109/TVCG.2015.2467952,http://dx.doi.org/10.1109/TVCG.2015.2467952,847,856,J,"Identification of early signs of rotating stall is essential for the study of turbine engine stability. With recent advancements of high performance computing, high-resolution unsteady flow fields allow in depth exploration of rotating stall and its possible causes. Performing stall analysis, however, involves significant effort to process large amounts of simulation data, especially when investigating abnormalities across many time steps. In order to assist scientists during the exploration process, we present a visual analytics framework to identify suspected spatiotemporal regions through a comparative visualization so that scientists are able to focus on relevant data in more detail. To achieve this, we propose efficient stall analysis algorithms derived from domain knowledge and convey the analysis results through juxtaposed interactive plots. Using our integrated visualization system, scientists can visually investigate the detected regions for potential stall initiation and further explore these regions to enhance the understanding of this phenomenon. Positive feedback from scientists demonstrate the efficacy of our system in analyzing rotating stall.",Chun-Ming Chen;Soumya Dutta;Xiaotong Liu;Gregory Heinlein;Han-Wei Shen;Jen-Ping Chen,Chun-Ming Chen;Soumya Dutta;Xiaotong Liu;Gregory Heinlein;Han-Wei Shen;Jen-Ping Chen,"The Department of Computer Science and Engineering, The Ohio State University;The Department of Computer Science and Engineering, The Ohio State University;The Department of Computer Science and Engineering, The Ohio State University;The Department of Mechanical and Aerospace Engineering, The Ohio State University;The Department of Computer Science and Engineering, The Ohio State University;The Department of Mechanical and Aerospace Engineering, The Ohio State University",10.1109/VISUAL.1991.175794;10.1109/TVCG.2007.70599;10.1109/VISUAL.2000.885739;10.1109/TVCG.2013.122;10.1109/TVCG.2013.189;10.1109/VISUAL.2004.128;10.1109/VISUAL.2005.1532830;10.1109/TVCG.2014.2346265,"Turbine flow visualization, vortex extraction, anomaly detection, juxtaposition, brushing and linking, time series",6,7,49,
VAST,2015,"VEEVVIE: Visual Explorer for Empirical Visualization, VR and Interaction Experiments",10.1109/TVCG.2015.2467954,http://dx.doi.org/10.1109/TVCG.2015.2467954,111,120,J,"Empirical, hypothesis-driven, experimentation is at the heart of the scientific discovery process and has become commonplace in human-factors related fields. To enable the integration of visual analytics in such experiments, we introduce VEEVVIE, the Visual Explorer for Empirical Visualization, VR and Interaction Experiments. VEEVVIE is comprised of a back-end ontology which can model several experimental designs encountered in these fields. This formalization allows VEEVVIE to capture experimental data in a query-able form and makes it accessible through a front-end interface. This front-end offers several multi-dimensional visualization widgets with built-in filtering and highlighting functionality. VEEVVIE is also expandable to support custom experimental measurements and data types through a plug-in visualization widget architecture. We demonstrate VEEVVIE through several case studies of visual analysis, performed on the design and data collected during an experiment on the scalability of high-resolution, immersive, tiled-display walls.",Charilaos Papadopoulos;Ievgeniia Gutenko;Arie E. Kaufman,C. Papadopoulos;I. Gutenko;A. E. Kaufman,"Dept. of Computer Science, Stony Brook University, Stony Brook, NY;Dept. of Computer Science, Stony Brook University, Stony Brook, NY;Dept. of Computer Science, Stony Brook University, Stony Brook, NY",10.1109/TVCG.2012.276;10.1109/TVCG.2012.251;10.1109/TVCG.2014.2346591;10.1109/TVCG.2010.157;10.1109/TVCG.2014.2346311;10.1109/INFVIS.2000.885086;10.1109/INFVIS.2004.12,"Visual Analytics, Evaluation, User Studies, Ontology, Experiments, Interaction, Virtual Reality, Visualization",6,5,32,
VAST,2015,Supporting activity recognition by visual analytics,10.1109/VAST.2015.7347629,http://dx.doi.org/10.1109/VAST.2015.7347629,41,48,C,"Recognizing activities has become increasingly relevant in many application domains, such as security or ambient assisted living. To handle different scenarios, the underlying automated algorithms are configured using multiple input parameters. However, the influence and interplay of these parameters is often not clear, making exhaustive evaluations necessary. On this account, we propose a visual analytics approach to supporting users in understanding the complex relationships among parameters, recognized activities, and associated accuracies. First, representative parameter settings are determined. Then, the respective output is computed and statistically analyzed to assess parameters' influence in general. Finally, visualizing the parameter settings along with the activities provides overview and allows to investigate the computed results in detail. Coordinated interaction helps to explore dependencies, compare different settings, and examine individual activities. By integrating automated, visual, and interactive means users can select parameter values that meet desired quality criteria. We demonstrate the application of our solution in a use case with realistic complexity, involving a study of human protagonists in daily living with respect to hundreds of parameter settings.",Martin Röhlig;Martin Luboschik;Frank Krüger 0001;Thomas Kirste;Heidrun Schumann;Markus Bögl;Bilal Alsallakh;Silvia Miksch,Martin Röhlig;Martin Luboschik;Frank Krüger;Thomas Kirste;Heidrun Schumann;Markus Bögl;Bilal Alsallakh;Silvia Miksch,"University of Rostock, Germany;University of Rostock, Germany;University of Rostock, Germany;University of Rostock, Germany;University of Rostock, Germany;Vienna University of Technology, Austria;Vienna University of Technology, Austria;Vienna University of Technology, Austria",10.1109/TVCG.2014.2346454;10.1109/TVCG.2011.253;10.1109/TVCG.2014.2346321;10.1109/TVCG.2011.248;10.1109/TVCG.2009.187;10.1109/VAST.2009.5332595,,6,6,23,
VAST,2015,Interactive visual steering of hierarchical simulation ensembles,10.1109/VAST.2015.7347635,http://dx.doi.org/10.1109/VAST.2015.7347635,89,96,C,"Multi-level simulation models, i.e., models where different components are simulated using sub-models of varying levels of complexity, belong to the current state-of-the-art in simulation. The existing analysis practice for multi-level simulation results is to manually compare results from different levels of complexity, amounting to a very tedious and error-prone, trial-and-error exploration process. In this paper, we introduce hierarchical visual steering, a new approach to the exploration and design of complex systems. Hierarchical visual steering makes it possible to explore and analyze hierarchical simulation ensembles at different levels of complexity. At each level, we deal with a dynamic simulation ensemble - the ensemble grows during the exploration process. There is at least one such ensemble per simulation level, resulting in a collection of dynamic ensembles, analyzed simultaneously. The key challenge is to map the multi-dimensional parameter space of one ensemble to the multi-dimensional parameter space of another ensemble (from another level). In order to support the interactive visual analysis of such complex data we propose a novel approach to interactive and semi-automatic parameter space segmentation and comparison. The approach combines a novel interaction technique and automatic, computational methods - clustering, concave hull computation, and concave polygon overlapping - to support the analysts in the cross-ensemble parameter space mapping. In addition to the novel parameter space segmentation we also deploy coordinated multiple views with standard plots. We describe the abstract analysis tasks, identified during a case study, i.e., the design of a variable valve actuation system of a car engine. The study is conducted in cooperation with experts from the automotive industry. Very positive feedback indicates the usefulness and efficiency of the newly proposed approach.",Rainer Splechtna;Kresimir Matkovic;Denis Gracanin;Mario Jelovic;Helwig Hauser,Rainer Splechtna;Krešimir Matković;Denis Gračanin;Mario Jelović;Helwig Hauser,"VRVis Research Center in Vienna, Austria;VRVis Research Center in Vienna, Austria;Virginia Tech, Blacksburg, VA, USA;AVL-AST Zagreb, Croatia;University of Bergen, Norway",10.1109/TVCG.2008.145;10.1109/TVCG.2014.2346744;10.1109/TVCG.2014.2346321;10.1109/VAST.2009.5333081;10.1109/TVCG.2010.223,"Interactive Visual Analysis, Simulation-Ensemble Steering, Multi-resolution simulation",6,7,20,
InfoVis,2016,PROACT: Iterative Design of a Patient-Centered Visualization for Effective Prostate Cancer Health Risk Communication,10.1109/TVCG.2016.2598588,http://dx.doi.org/10.1109/TVCG.2016.2598588,601,610,J,"Prostate cancer is the most common cancer among men in the US, and yet most cases represent localized cancer for which the optimal treatment is unclear. Accumulating evidence suggests that the available treatment options, including surgery and conservative treatment, result in a similar prognosis for most men with localized prostate cancer. However, approximately 90% of patients choose surgery over conservative treatment, despite the risk of severe side effects like erectile dysfunction and incontinence. Recent medical research suggests that a key reason is the lack of patient-centered tools that can effectively communicate personalized risk information and enable them to make better health decisions. In this paper, we report the iterative design process and results of developing the PROgnosis Assessment for Conservative Treatment (PROACT) tool, a personalized health risk communication tool for localized prostate cancer patients. PROACT utilizes two published clinical prediction models to communicate the patients' personalized risk estimates and compare treatment options. In collaboration with the Maine Medical Center, we conducted two rounds of evaluations with prostate cancer survivors and urologists to identify the design elements and narrative structure that effectively facilitate patient comprehension under emotional distress. Our results indicate that visualization can be an effective means to communicate complex risk information to patients with low numeracy and visual literacy. However, the visualizations need to be carefully chosen to balance readability with ease of comprehension. In addition, due to patients' charged emotional state, an intuitive narrative structure that considers the patients' information need is critical to aid the patients' comprehension of their risk information.",Anzu Hakone;Lane Harrison;Alvitta Ottley;Nathan Winters;Caitlin Gutheil;Paul K. J. Han;Remco Chang,Anzu Hakone;Lane Harrison;Alvitta Ottley;Nathan Winters;Caitlin Gutheil;Paul K. J. Han;Remco Chang,Tufts University;Worcester Polytechnic Institute;Tufts University;Tufts University;Maine Medical Center;Maine Medical Center;Tufts University,10.1109/TVCG.2012.225;10.1109/TVCG.2013.200;10.1109/TVCG.2014.2346984;10.1109/TVCG.2015.2467758;10.1109/TVCG.2012.219;10.1109/TVCG.2014.2346682,Design studies;task and requirement analysis;presentation;production;and dissemination;medical visualization,6,7,54,
InfoVis,2016,Optimizing Hierarchical Visualizations with the Minimum Description Length Principle,10.1109/TVCG.2016.2598591,http://dx.doi.org/10.1109/TVCG.2016.2598591,631,640,J,"In this paper we examine how the Minimum Description Length (MDL) principle can be used to efficiently select aggregated views of hierarchical datasets that feature a good balance between clutter and information. We present MDL formulae for generating uneven tree cuts tailored to treemap and sunburst diagrams, taking into account the available display space and information content of the data. We present the results of a proof-of-concept implementation. In addition, we demonstrate how such tree cuts can be used to enhance drill-down interaction in hierarchical visualizations by implementing our approach in an existing visualization tool. Validation is done with the feature congestion measure of clutter in views of a subset of the current DMOZ web directory, which contains nearly half million categories. The results show that MDL views achieve near constant clutter level across display resolutions. We also present the results of a crowdsourced user study where participants were asked to find targets in views of DMOZ generated by our approach and a set of baseline aggregation methods. The results suggest that, in some conditions, participants are able to locate targets (in particular, outliers) faster using the proposed approach.",Rafael Veras;Christopher Collins 0001,Rafael Veras;Christopher Collins,University of OntarioInstitute of Technology;University of OntarioInstitute of Technology,10.1109/TVCG.2006.120;10.1109/TVCG.2007.70535;10.1109/INFVIS.1998.729557;10.1109/TVCG.2006.184;10.1109/TVCG.2012.233;10.1109/TVCG.2006.161,antichain;Hierarchy data;data aggregation;multiscale visualization;tree cut,6,7,33,
SciVis,2016,Visualization and Extraction of Carvings for Heritage Conservation,10.1109/TVCG.2016.2598603,http://dx.doi.org/10.1109/TVCG.2016.2598603,801,810,J,"We present novel techniques for visualizing, illustrating, analyzing, and generating carvings in surfaces. In particular, we consider the carvings in the plaster of the cloister of the Magdeburg cathedral, which dates to the 13th century. Due to aging and weathering, the carvings have flattened. Historians and restorers are highly interested in using digitalization techniques to analyze carvings in historic artifacts and monuments and to get impressions and illustrations of their original shape and appearance. Moreover, museums and churches are interested in such illustrations for presenting them to visitors. The techniques that we propose allow for detecting, selecting, and visualizing carving structures. In addition, we introduce an example-based method for generating carvings. The resulting tool, which integrates all techniques, was evaluated by three experienced restorers to assess the usefulness and applicability. Furthermore, we compared our approach with exaggerated shading and other state-of-the-art methods.",Kai Lawonn;Erik Trostmann;Bernhard Preim;Klaus Hildebrandt,Kai Lawonn;Erik Trostmann;Bernhard Preim;Klaus Hildebrandt,"University of Koblenz-Landau, Germany;Fraunhofer Institute for Factory Operation and Automation IFF, Germany;University of Magdeburg, Germany;Delft University of Technology, The Netherlands",10.1109/TVCG.2007.70538;10.1109/TVCG.2012.248,feature filtering;Feature extraction;heritage preservation;Frangi filter;surface analysis,6,7,42,
SciVis,2016,A Fractional Cartesian Composition Model for Semi-Spatial Comparative Visualization Design,10.1109/TVCG.2016.2598870,http://dx.doi.org/10.1109/TVCG.2016.2598870,851,860,J,"The study of spatial data ensembles leads to substantial visualization challenges in a variety of applications. In this paper, we present a model for comparative visualization that supports the design of according ensemble visualization solutions by partial automation. We focus on applications, where the user is interested in preserving selected spatial data characteristics of the data as much as possible-even when many ensemble members should be jointly studied using comparative visualization. In our model, we separate the design challenge into a minimal set of user-specified parameters and an optimization component for the automatic configuration of the remaining design variables. We provide an illustrated formal description of our model and exemplify our approach in the context of several application examples from different domains in order to demonstrate its generality within the class of comparative visualization problems for spatial data ensembles.",Ivan Kolesár;Stefan Bruckner;Ivan Viola;Helwig Hauser,Ivan Kolesár;Stefan Bruckner;Ivan Viola;Helwig Hauser,"Department of Informatics, University of Bergen, Norway;Department of Informatics, University of Bergen, Norway;TU Wien, Austria;Department of Informatics, University of Bergen, Norway",10.1109/TVCG.2014.2346591;10.1109/TVCG.2008.180;10.1109/TVCG.2009.153;10.1109/TVCG.2007.70550;10.1109/VISUAL.2003.1250401;10.1109/TVCG.2006.164;10.1109/TVCG.2013.120;10.1109/TVCG.2009.136;10.1109/TVCG.2014.2346325;10.1109/TVCG.2014.2346321;10.1109/TVCG.2011.227;10.1109/VISUAL.2005.1532781;10.1109/TVCG.2011.235;10.1109/VISUAL.2003.1250353;10.1109/TVCG.2009.111,Visualization Models;Integrating Spatial and Non-Spatial Data Visualization;Design Methodologies,6,5,41,
InfoVis,2017,Skeleton-Based Scagnostics,10.1109/TVCG.2017.2744339,http://dx.doi.org/10.1109/TVCG.2017.2744339,542,552,J,"Scatterplot matrices (SPLOMs) are widely used for exploring multidimensional data. Scatterplot diagnostics (scagnostics) approaches measure characteristics of scatterplots to automatically find potentially interesting plots, thereby making SPLOMs more scalable with the dimension count. While statistical measures such as regression lines can capture orientation, and graph-theoretic scagnostics measures can capture shape, there is no scatterplot characterization measure that uses both descriptors. Based on well-known results in shape analysis, we propose a scagnostics approach that captures both scatterplot shape and orientation using skeletons (or medial axes). Our representation can handle complex spatial distributions, helps discovery of principal trends in a multiscale way, scales visually well with the number of samples, is robust to noise, and is automatic and fast to compute. We define skeleton-based similarity metrics for the visual exploration and analysis of SPLOMs. We perform a user study to measure the human perception of scatterplot similarity and compare the outcome to our results as well as to graph-based scagnostics and other visual quality metrics. Our skeleton-based metrics outperform previously defined measures both in terms of closeness to perceptually-based similarity and computation time efficiency.",José Matute;Alexandru Telea;Lars Linsen,José Matute;Alexandru C. Telea;Lars Linsen,"Institute of Computer Science, Westfälische Wilhelms-Universität Münster, Germany;Johann Bernoulli Institute for Mathematics and Computer Science, University of Groningen, Groningen, The Netherlands;Institute of Computer Science, Westfälische Wilhelms-Universität Münster, Germany",10.1109/VAST.2011.6102437;10.1109/TVCG.2011.233;10.1109/TVCG.2010.213;10.1109/TVCG.2011.223;10.1109/TVCG.2011.220;10.1109/VAST.2008.4677367;10.1109/VAST.2009.5332628,"Multidimensional Data (primary keyword),High-Dimensional Data",6,7,65,
InfoVis,2017,EdWordle: Consistency-Preserving Word Cloud Editing,10.1109/TVCG.2017.2745859,http://dx.doi.org/10.1109/TVCG.2017.2745859,647,656,J,"We present EdWordle, a method for consistently editing word clouds. At its heart, EdWordle allows users to move and edit words while preserving the neighborhoods of other words. To do so, we combine a constrained rigid body simulation with a neighborhood-aware local Wordle algorithm to update the cloud and to create very compact layouts. The consistent and stable behavior of EdWordle enables users to create new forms of word clouds such as storytelling clouds in which the position of words is carefully edited. We compare our approach with state-of-the-art methods and show that we can improve user performance, user satisfaction, as well as the layout itself.",Yunhai Wang;Xiaowei Chu;Chen Bao;Lifeng Zhu;Oliver Deussen;Baoquan Chen;Michael Sedlmair,Yunhai Wang;Xiaowei Chu;Chen Bao;Lifeng Zhu;Oliver Deussen;Baoquan Chen;Michael Sedlmair,"Shandong University;Shandong University;Shandong University;Southeast University;Konstanz University, VCC SIAT, China;Shandong University;University of Vienna, Austria",10.1109/TVCG.2016.2598609;10.1109/TVCG.2011.201;10.1109/VAST.2009.5333443;10.1109/TVCG.2015.2467531;10.1109/TVCG.2014.2346292;10.1109/TVCG.2010.175;10.1109/TVCG.2010.194;10.1109/TVCG.2009.171,"Wordle,consistency,text visualization",6,4,41,
SciVis,2017,TopoAngler: Interactive Topology-Based Extraction of Fishes,10.1109/TVCG.2017.2743980,http://dx.doi.org/10.1109/TVCG.2017.2743980,812,821,J,"We present TopoAngler, a visualization framework that enables an interactive user-guided segmentation of fishes contained in a micro-CT scan. The inherent noise in the CT scan coupled with the often disconnected (and sometimes broken) skeletal structure of fishes makes an automatic segmentation of the volume impractical. To overcome this, our framework combines techniques from computational topology with an interactive visual interface, enabling the human-in-the-Ioop to effectively extract fishes from the volume. In the first step, the join tree of the input is used to create a hierarchical segmentation of the volume. Through the use of linked views, the visual interface then allows users to interactively explore this hierarchy, and gather parts of individual fishes into a coherent sub-volume, thus reconstructing entire fishes. Our framework was primarily developed for its application to CT scans of fishes, generated as part of the ScanAllFish project, through close collaboration with their lead scientist. However, we expect it to also be applicable in other biological applications where a single dataset contains multiple specimen; a common routine that is now widely followed in laboratories to increase throughput of expensive CT scanners.",Alexander Bock;Harish Doraiswamy;Adam Summers;Cláudio T. Silva,Alexander Bock;Harish Doraiswamy;Adam Summers;Cláudio Silva,New York University;New York University;University of Washington;New York University,10.1109/VISUAL.2004.96;10.1109/TVCG.2007.70565;10.1109/TVCG.2014.2346449;10.1109/TVCG.2009.178;10.1109/TVCG.2006.186;10.1109/TVCG.2014.2346351;10.1109/TVCG.2016.2598585;10.1109/TVCG.2009.111;10.1109/TVCG.2010.208,"Computational topology,join trees,branch decomposition,hierarchical segmentation,interaction,visualization system",6,8,48,
VAST,2017,How Do Ancestral Traits Shape Family Trees Over Generations?,10.1109/TVCG.2017.2744080,http://dx.doi.org/10.1109/TVCG.2017.2744080,205,214,J,"Whether and how does the structure of family trees differ by ancestral traits over generations? This is a fundamental question regarding the structural heterogeneity of family trees for the multi-generational transmission research. However, previous work mostly focuses on parent-child scenarios due to the lack of proper tools to handle the complexity of extending the research to multi-generational processes. Through an iterative design study with social scientists and historians, we develop TreeEvo that assists users to generate and test empirical hypotheses for multi-generational research. TreeEvo summarizes and organizes family trees by structural features in a dynamic manner based on a traditional Sankey diagram. A pixel-based technique is further proposed to compactly encode trees with complex structures in each Sankey Node. Detailed information of trees is accessible through a space-efficient visualization with semantic zooming. Moreover, TreeEvo embeds Multinomial Logit Model (MLM) to examine statistical associations between tree structure and ancestral traits. We demonstrate the effectiveness and usefulness of TreeEvo through an in-depth case-study with domain experts using a real-world dataset (containing 54,128 family trees of 126,196 individuals).",Siwei Fu;Hao Dong 0008;Weiwei Cui;Jian Zhao 0010;Huamin Qu,Siwei Fu;Hao Dong;Weiwei Cui;Jian Zhao;Huamin Qu,Hong Kong University of Science and Technology;Princeton University;Microsoft Research;FX Palo Alto Laboratory;Hong Kong University of Science and Technology,10.1109/INFVIS.2002.1173150;10.1109/TVCG.2010.159;10.1109/VAST.2006.261450;10.1109/TVCG.2014.2346433;10.1109/TVCG.2014.2346276;10.1109/TVCG.2007.70556;10.1109/INFVIS.2005.1532124;10.1109/TVCG.2013.200;10.1109/INFVIS.2005.1532152;10.1109/TVCG.2012.213;10.1109/TVCG.2012.226,"Quantitative social science,Design study,Multiple tree visualization,Sankey diagram",6,3,48,
VAST,2017,Understanding a Sequence of Sequences: Visual Exploration of Categorical States in Lake Sediment Cores,10.1109/TVCG.2017.2744686,http://dx.doi.org/10.1109/TVCG.2017.2744686,66,76,J,"This design study focuses on the analysis of a time sequence of categorical sequences. Such data is relevant for the geoscientific research field of landscape and climate development. It results from microscopic analysis of lake sediment cores. The goal is to gain hypotheses about landscape evolution and climate conditions in the past. To this end, geoscientists identify which categorical sequences are similar in the sense that they indicate similar conditions. Categorical sequences are similar if they have similar meaning (semantic similarity) and appear in similar time periods (temporal similarity). For data sets with many different categorical sequences, the task to identify similar sequences becomes a challenge. Our contribution is a tailored visual analysis concept that effectively supports the analytical process. Our visual interface comprises coupled visualizations of semantics and temporal context for the exploration and assessment of the similarity of categorical sequences. Integrated automatic methods reduce the analytical effort substantially. They (1) extract unique sequences in the data and (2) rank sequences by a similarity measure during the search for similar sequences. We evaluated our concept by demonstrations of our prototype to a larger audience and hands-on analysis sessions for two different lakes. According to geoscientists, our approach fills an important methodological gap in the application domain.",Andrea Unger;Nadine Drager;Mike Sips;Dirk J. Lehmann,Andrea Unger;Nadine Dräger;Mike Sips;Dirk J. Lehmann,GFZ German Research Centre for Geosciences;GFZ German Research Centre for Geosciences;GFZ German Research Centre for Geosciences;University of Magdeburg,10.1109/TVCG.2011.232;10.1109/VISUAL.1997.663916;10.1109/TVCG.2013.182;10.1109/TVCG.2013.200;10.1109/TVCG.2011.212;10.1109/TVCG.2009.117;10.1109/TVCG.2015.2467751;10.1109/VAST.2009.5332595,"Visualization in Earth Science,Time Series Data,Categorical Data,Design Study",6,3,46,
VAST,2017,CrystalBall: A Visual Analytic System for Future Event Discovery and Analysis from Social Media Data,10.1109/VAST.2017.8585658,http://dx.doi.org/10.1109/VAST.2017.8585658,25,35,C,"Social media data bear valuable insights regarding events that occur around the world. Events are inherently temporal and spatial. Existing visual text analysis systems have focused on detecting and analyzing past and ongoing events. Few have leveraged social media information to look for events that may occur in the future. In this paper, we present an interactive visual analytic system, CrystalBall, that automatically identifies and ranks future events from Twitter streams. CrystalBall integrates new methods to discover events with interactive visualizations that permit sensemaking of the identified future events. Our computational methods integrate seven different measures to identify and characterize future events, leveraging information regarding time, location, social networks, and the informativeness of the messages. A visual interface is tightly coupled with the computational methods to present a concise summary of the possible future events. A novel connection graph and glyphs are designed to visualize the characteristics of the future events. To demonstrate the efficacy of CrystalBall in identifying future events and supporting interactive analysis, we present multiple case studies and validation studies on analyzing events derived from Twitter data.",Isaac Cho;Ryan Wesslen;Svitlana Volkova;William Ribarsky;Wenwen Dou,Isaac Cho;Ryan Wesslen;Svitlana Volkova;William Ribarsky;Wenwen Dou,University of North Carolina at Charlotte;University of North Carolina at Charlotte;Pacific Northwest National Laboratory;University of North Carolina at Charlotte;University of North Carolina at Charlotte,10.1109/VAST.2012.6400485,"Social media analysis,Event detection and analysis,visual analytics",6,2,35,
InfoVis,2018,In Pursuit of Error: A Survey of Uncertainty Visualization Evaluation,10.1109/TVCG.2018.2864889,http://dx.doi.org/10.1109/TVCG.2018.2864889,903,913,J,"Understanding and accounting for uncertainty is critical to effectively reasoning about visualized data. However, evaluating the impact of an uncertainty visualization is complex due to the difficulties that people have interpreting uncertainty and the challenge of defining correct behavior with uncertainty information. Currently, evaluators of uncertainty visualization must rely on general purpose visualization evaluation frameworks which can be ill-equipped to provide guidance with the unique difficulties of assessing judgments under uncertainty. To help evaluators navigate these complexities, we present a taxonomy for characterizing decisions made in designing an evaluation of an uncertainty visualization. Our taxonomy differentiates six levels of decisions that comprise an uncertainty visualization evaluation: the behavioral targets of the study, expected effects from an uncertainty visualization, evaluation goals, measures, elicitation techniques, and analysis approaches. Applying our taxonomy to 86 user studies of uncertainty visualizations, we find that existing evaluation practice, particularly in visualization research, focuses on Performance and Satisfaction-based measures that assume more predictable and statistically-driven judgment behavior than is suggested by research on human judgment and decision making. We reflect on common themes in evaluation practice concerning the interpretation and semantics of uncertainty, the use of confidence reporting, and a bias toward evaluating performance as accuracy rather than decision quality. We conclude with a concrete set of recommendations for evaluators designed to reduce the mismatch between the conceptualization of uncertainty in visualization versus other fields.",Jessica Hullman;Xiaoli Qiao;Michael Correll;Alex Kale;Matthew Kay 0001,Jessica Hullman;Xiaoli Qiao;Michael Correll;Alex Kale;Matthew Kay,Northwestern University;University of Washington;Tableau Software;University of Washington;University of Michigan,10.1109/TVCG.2015.2467752;10.1109/TVCG.2017.2743898;10.1109/TVCG.2013.126;10.1109/TVCG.2007.70530;10.1109/TVCG.2007.70518;10.1109/TVCG.2009.111,"Uncertainty visualization,user study,subjective confidence,probability distribution",6,10,94,
InfoVis,2018,Where's My Data? Evaluating Visualizations with Missing Data,10.1109/TVCG.2018.2864914,http://dx.doi.org/10.1109/TVCG.2018.2864914,914,924,J,Many real-world datasets are incomplete due to factors such as data collection failures or misalignments between fused datasets. Visualizations of incomplete datasets should allow analysts to draw conclusions from their data while effectively reasoning about the quality of the data and resulting conclusions. We conducted a pair of crowdsourced studies to measure how the methods used to impute and visualize missing data may influence analysts' perceptions of data quality and their confidence in their conclusions. Our experiments used different design choices for line graphs and bar charts to estimate averages and trends in incomplete time series datasets. Our results provide preliminary guidance for visualization designers to consider when working with incomplete data in different domains and scenarios.,Hayeong Song;Danielle Albers Szafir,Hayeong Song;Danielle Albers Szafir,University of Colorado;University of Colorado,10.1109/TVCG.2016.2598592;10.1109/VAST.2015.7347672;10.1109/TVCG.2011.185;10.1109/TVCG.2012.220;10.1109/TVCG.2014.2346298;10.1109/VISUAL.1999.809916;10.1109/TVCG.2013.183;10.1109/TVCG.2015.2467752;10.1109/TVCG.2015.2467951;10.1109/TVCG.2012.279;10.1109/TVCG.2015.2467591;10.1109/TVCG.2012.256;10.1109/VISUAL.1994.346317;10.1109/TVCG.2012.262;10.1109/VAST.2006.261424,"Information Visualization,Graphical Perception,Time Series Data,Data Wrangling,Imputation",6,4,57,
InfoVis,2018,IDMVis: Temporal Event Sequence Visualization for Type 1 Diabetes Treatment Decision Support,10.1109/TVCG.2018.2865076,http://dx.doi.org/10.1109/TVCG.2018.2865076,512,522,J,"Type 1 diabetes is a chronic, incurable autoimmune disease affecting millions of Americans in which the body stops producing insulin and blood glucose levels rise. The goal of intensive diabetes management is to lower average blood glucose through frequent adjustments to insulin protocol, diet, and behavior. Manual logs and medical device data are collected by patients, but these multiple sources are presented in disparate visualization designs to the clinician-making temporal inference difficult. We conducted a design study over 18 months with clinicians performing intensive diabetes management. We present a data abstraction and novel hierarchical task abstraction for this domain. We also contribute IDMVis: a visualization tool for temporal event sequences with multidimensional, interrelated data. IDMVis includes a novel technique for folding and aligning records by dual sentinel events and scaling the intermediate timeline. We validate our design decisions based on our domain abstractions, best practices, and through a qualitative evaluation with six clinicians. The results of this study indicate that IDMVis accurately reflects the workflow of clinicians. Using IDMVis, clinicians are able to identify issues of data quality such as missing or conflicting data, reconstruct patient records when data is missing, differentiate between days with different patterns, and promote educational interventions after identifying discrepancies.",Yixuan Zhang;Kartik Chanana;Cody Dunne,Yixuan Zhang;Kartik Chanana;Cody Dunne,Northeastern University;Northeastern University;Northeastern University,10.1109/INFVIS.2005.1532136;10.1109/TVCG.2013.124;10.1109/TVCG.2017.2744319;10.1109/TVCG.2009.111;10.1109/TVCG.2012.213;10.1109/VISUAL.1992.235203,"Design study,task analysis,event sequence visualization,time series data,qualitative evaluation,health applications",6,11,60,
InfoVis,2018,Comparing Similarity Perception in Time Series Visualizations,10.1109/TVCG.2018.2865077,http://dx.doi.org/10.1109/TVCG.2018.2865077,523,533,J,"A common challenge faced by many domain experts working with time series data is how to identify and compare similar patterns. This operation is fundamental in high-level tasks, such as detecting recurring phenomena or creating clusters of similar temporal sequences. While automatic measures exist to compute time series similarity, human intervention is often required to visually inspect these automatically generated results. The visualization literature has examined similarity perception and its relation to automatic similarity measures for line charts, but has not yet considered if alternative visual representations, such as horizon graphs and colorfields, alter this perception. Motivated by how neuroscientists evaluate epileptiform patterns, we conducted two experiments that study how these three visualization techniques affect similarity perception in EEG signals. We seek to understand if the time series results returned from automatic similarity measures are perceived in a similar manner, irrespective of the visualization technique; and if what people perceive as similar with each visualization aligns with different automatic measures and their similarity constraints. Our findings indicate that horizon graphs align with similarity measures that allow local variations in temporal position or speed (i.e., dynamic time warping) more than the two other techniques. On the other hand, horizon graphs do not align with measures that are insensitive to amplitude and y-offset scaling (i.e., measures based on z-normalization), but the inverse seems to be the case for line charts and colorfields. Overall, our work indicates that the choice of visualization affects what temporal patterns we consider as similar, i.e., the notion of similarity in time series is not visualization independent.",Anna Gogolou;Theophanis Tsandilas;Themis Palpanas;Anastasia Bezerianos,Anna Gogolou;Theophanis Tsandilas;Themis Palpanas;Anastasia Bezerianos,"Inria, Univ. Paris-Sud, Univ. Paris-Saclay, France;Inria, Univ. Paris-Sud, CNRS, Univ. Paris-Saclay, France;Univ. Paris-Descartes, France;Inria, Univ. Paris-Sud, CNRS, Univ. Paris-Saclay, France",10.1109/TVCG.2011.232;10.1109/VAST.2007.4389007;10.1109/TVCG.2008.166;10.1109/VAST.2016.7883519;10.1109/TVCG.2010.162;10.1109/VAST.2016.7883518;10.1109/INFVIS.2005.1532144;10.1109/TVCG.2012.196;10.1109/INFVIS.1999.801851;10.1109/INFVIS.2001.963273;10.1109/TVCG.2011.195,"Time series,similarity perception,automatic similarity search,line charts,horizon graphs,colorfields,evaluation",6,12,70,
VAST,2018,A Visual Analytics Framework for the Detection of Anomalous Call Stack Trees in High Performance Computing Applications,10.1109/TVCG.2018.2865026,http://dx.doi.org/10.1109/TVCG.2018.2865026,215,224,J,"Anomalous runtime behavior detection is one of the most important tasks for performance diagnosis in High Performance Computing (HPC). Most of the existing methods find anomalous executions based on the properties of individual functions, such as execution time. However, it is insufficient to identify abnormal behavior without taking into account the context of the executions, such as the invocations of children functions and the communications with other HPC nodes. We improve upon the existing anomaly detection approaches by utilizing the call stack structures of the executions, which record rich temporal and contextual information. With our call stack tree (CSTree) representation of the executions, we formulate the anomaly detection problem as finding anomalous tree structures in a call stack forest. The CSTrees are converted to vector representations using our proposed stack2vec embedding. Structural and temporal visualizations of CSTrees are provided to support users in the identification and verification of the anomalies during an active anomaly detection process. Three case studies of real-world HPC applications demonstrate the capabilities of our approach.",Cong Xie;Wei Xu 0020;Klaus Mueller,Cong Xie;Wei Xu;Klaus Mueller,Department of Computer ScienceStony Brook University;Computational Science InitiativeBrookhaven National Laboratory;Department of Computer ScienceStony Brook University,10.1109/TVCG.2015.2467552;10.1109/TVCG.2012.277;10.1109/VAST.2016.7883514;10.1109/TVCG.2016.2598664,"Call Stack,Performance Visualization,Representation Learning,Active Learning,Anomaly Detection",6,9,55,HM
Vis,1990,Ray traced scalar fields with shaded polygonal output,10.1109/VISUAL.1990.146390,http://dx.doi.org/10.1109/VISUAL.1990.146390,263,"272, 480-481",C,An algorithm for rendering scalar field data that reduces rendering times by as much as two orders of magnitude over traditional full resolution images is presented. Less than full-resolution sampling of the scalar field is performed using a fast ray tracing method. The sampling grid points are output as a set of screen-based Gouraud shaded polygons which are rendered in hardware by a graphics workstation. A gradient-based variable resolution algorithm that further improves rendering speed is presented. Several examples are presented.&lt;&lt;ETX&gt;&gt;,Ray J. Meyers;Michael B. Stephenson,R.J. Meyers;M.B. Stephenson,"Sandia Nat. Lab., Albuquerque, NM, USA",,,5,2,17,
Vis,1991,Two widely-different architectural approaches to computer image generation,10.1109/VISUAL.1991.175776,http://dx.doi.org/10.1109/VISUAL.1991.175776,42,49,C,"A description is given of the computer graphics aspects of two architectures designed for imaging and graphics. The two systems use parallel and pipelined architectures for high-performance graphics operations. UWGPSP3 uses only commercially available off-the-shelf chips, and consists of a TM34020 graphics system processor and four TMS34082 floating point coprocessors that can be configured into pipelined or SIMD modes depending on the algorithm. UWGSP4 uses dedicated ASIC chips for higher performance, and consists of two main computational parts: a parallel vector processor with 16 vector processing units, used mainly for image processing, and a graphics subsystem which utilizes a parallel pipelined architecture for image synthesis.&lt;&lt;ETX&gt;&gt;",H. W. Park;K. S. Eo;D. L. Kim;B. K. Choi;Yongmin Kim 0001;T. Alexander,H.W. Park;K.S. Eo;D.L. Kim;B.K. Choi;Y. Kim;T. Alexander,"Dept. of Electr. Eng., Washington Univ., Seattle, WA, USA",,,5,0,8,
Vis,1992,Direct volumetric visualization,10.1109/VISUAL.1992.235220,http://dx.doi.org/10.1109/VISUAL.1992.235220,99,106,C,"The need for direct volume visualization display devices is discussed, as well as some specifics of the Texas Instruments OmniView technology. The topics discussed include the concept of operations, the rotating surface, the display volume, the transport theory model, the image quality in the display, and applications. The outlook for future volumetric displays is addressed.&lt;&lt;ETX&gt;&gt;",R. D. Williams;Fred L. Wefer;T. E. Clifton,R.D. Williams;F.L. Wefer;T.E. Clifton,,,,5,3,21,
Vis,1993,Orientation maps: Techniques for visualizing rotations (A  Consumer's Guide),10.1109/VISUAL.1993.398867,http://dx.doi.org/10.1109/VISUAL.1993.398867,183,188,C,"The set of possible orientations of a rigid three-dimensional object is a topological space with three degrees of freedom. This paper investigates the suitability of various techniques of visualizing this space. With a good technique the natural distance between orientations will be represented fairly accurately, and distortion to the ""shape"" of a collection of orientations induced by the change of reference orientation will be minor. The traditional Euler-angle parameterization fails on both counts. Less well-known techniques exploit the fact that there is a rotation that takes the reference orientation to a given one. The given orientation is represented as a point along the axis of this rotation. The distance of this point from the origin is determined by some scaling function of the magnitude of that rotation. Free natural scaling functions are studied. None is perfect, but several are satisfactory.&lt;&lt;ETX&gt;&gt;",Bowen Alpern;Larry Carter;Matt Grayson;Chris Pelkie,B. Alpern;L. Carter;M. Grayson;C. Pelkie,"IBM T. J. Watson Res. Center, Yorktown Heights, NY, USA;IBM T. J. Watson Res. Center, Yorktown Heights, NY, USA;IBM T. J. Watson Res. Center, Yorktown Heights, NY, USA;IBM T. J. Watson Res. Center, Yorktown Heights, NY, USA",,,5,6,10,
Vis,1993,Visualization and modeling of geophysical data,10.1109/VISUAL.1993.398892,http://dx.doi.org/10.1109/VISUAL.1993.398892,362,365,C,"We present the visualization and modeling techniques used in a case study to build feature-based computational models from geophysical data. Visualization was used to inspect the quality of the interpretation of the geophysical data. We describe the geophysical data graphical representation used to support rapid rendering and to enhance the perception differences between the interpretation of the data and the data itself. In addition, we present the modeling techniques used to convert the geophysical data into a feature-based computational model suitable for use by a numerical simulation package.&lt;&lt;ETX&gt;&gt;",G. Celniker;I. Chakravarty;J. Moorman,G. Celniker;I. Chakravarty;J. Moorman,"Schlumberger Lab. for Comput. Sci., Austin, TX, USA;Schlumberger Lab. for Comput. Sci., Austin, TX, USA",,,5,1,5,
Vis,1994,Integrating spatial data display with virtual reconstruction,10.1109/VISUAL.1994.346296,http://dx.doi.org/10.1109/VISUAL.1994.346296,359,"362, C40",C,"In the process of archaeological excavation, a vast amount of data, much of it three-dimensional in nature, is recorded. In recent years, computer graphics techniques have been applied to the task of visualizing such data. In particular, data visualization has been used to accomplish the virtual reconstruction of site architecture and to enable the display of spatial data distributions using three-dimensional models of site terrain. In the case we present here, these two approaches are integrated in the modeling of a prehistoric pithouse. In order to better visualize artifact distributions in the context of site architecture, surface data is displayed as a layer in a virtual reconstruction viewable at interactive rates. This integration of data display with the architectural model has proven valuable in identifying correlations between distributions of different artifact categories and their spatial proximity to significant architectural features.&lt;&lt;ETX&gt;&gt;",Philip Peterson;Brian Hayden;F. David Fracchia,P. Peterson;B. Hayden;F.D. Fracchia,"Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada",10.1109/VISUAL.1993.398904;10.1109/VISUAL.1992.235188;10.1109/VISUAL.1991.175771,,5,0,14,
Vis,1994,The design and implementation of the Cortex visualization system,10.1109/VISUAL.1994.346310,http://dx.doi.org/10.1109/VISUAL.1994.346310,265,"272, C30",C,"Cortex has been designed for interactive analysis and display of simulation data generated by CFD applications based on unstructured-grid solvers. Unlike post-processing visualization environments, Cortex is designed to work in co-processing mode with the CFD application. This significantly reduces data storage and data movement requirements for visualization and also allows users to interactively steer the application. Further, Cortex supports high-performance by running on massively parallel computers and workstation clusters. An important goal for Cortex, is to provide visualization to a variety of solvers which differ in their solution methodologies and supported flow models. Coupled with the co-processing requirement, this has required the development of a well defined programming interface to the CFD solver that lets the visualization system communicate efficiently with the solver, and requires minimal programming effort for porting to new solvers. Further, the requirement for targeting multiple solvers and application niches demands that the visualization system be rapidly and easily modifiable. Such flexibility is attained in Cortex by using the high-level, interpreted language Scheme for implementing user-interfaces and high-level visualization functions. By making the Scheme interpreter available from the Cortex text interface, the user can also customize and extend the visualization system.&lt;&lt;ETX&gt;&gt;",Deb Banerjee;Chris Morley;Wayne Smith,D. Banerjee;C. Morley;W. Smith,"Fluent Inc., Lebanon, NH, USA;Fluent Inc., Lebanon, NH, USA;Fluent Inc., Lebanon, NH, USA",10.1109/VISUAL.1992.235223;10.1109/VISUAL.1991.175833;10.1109/VISUAL.1990.146360,"interactive, extensible, spray rendering, smart particles, visualization environment",5,1,14,
Vis,1994,Introducing alpha shapes for the analysis of path integral Monte Carlo results,10.1109/VISUAL.1994.346337,http://dx.doi.org/10.1109/VISUAL.1994.346337,52,59,C,"We present a new technique for the visualization and analysis of the results from Monte Carlo simulations based on /spl alpha/-complexes and /spl alpha/-shapes. The specific application presented is the analysis of the quantum-mechanical behavior of hydrogen molecules and helium atoms on a surface at very low temperatures. The technique is an improvement over existing techniques in two respects. First, the approach allows one to visualize the points on a random walk at varying levels of detail and interactively select the level of detail that is most appropriate. Second, using /spl alpha/-shapes one can obtain quantitative measures of spatial properties of the system, such as the boundary length and interior area of clusters, that would be difficult to obtain otherwise.&lt;&lt;ETX&gt;&gt;",Patrick J. Moran;Marcus Wagner,P.J. Moran;M. Wagner,"Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA",,,5,2,12,
Vis,1994,Visualizing polycrystalline orientation microstructures with spherical color maps,10.1109/VISUAL.1994.346338,http://dx.doi.org/10.1109/VISUAL.1994.346338,46,"51, C5",C,Spherical color maps can be an effective tool in the microstructure visualization of polycrystals. Electron backscatter diffraction pattern analysis provides large arrays of the orientation data that can be visualized easily using the technique described in this paper. A combination of this technique with the traditional black and white scanning electron microscopy imaging will enable scientists to better understand the correlation between material properties and their polycrystalline structure.&lt;&lt;ETX&gt;&gt;,Boris Yamrom;John A. Sutliff;Andrew P. Woodfield,B. Yamrom;J.A. Sutliff;A.P. Woodfield,"Gen. Electr. Corp. Res. & Dev. Center, Schenectady, NY, USA;Gen. Electr. Corp. Res. & Dev. Center, Schenectady, NY, USA",10.1109/VISUAL.1993.398867;10.1109/VISUAL.1990.146380,,5,3,10,
InfoVis,1995,Research report: improving browsing in information by the automatic display layout,10.1109/INFVIS.1995.528683,http://dx.doi.org/10.1109/INFVIS.1995.528683,26,33,C,"It is well known that graphical representations could be very helpful to browse in graph structured information. But this promising approach requires the capability of an automatic layout system because the tedious and time consuming task of a manual layout leads to a rejection of this approach by the user. In our approach, we split the task of retrieving information into two phases that are getting the orientation within the network and reading currently visited information. We present layout algorithms for both phases which have the benefit of being flexible and adaptable to individual user requests and ensure the topological consistency, i.e. the stability of the topology of the information layout during a sequence of display layouts. The results show that especially the possibility of an animation of the layout process can assist the user essentially in maintaining the orientation in the information network.",Peter Lüders;Rolf Ernst,P. Luders;R. Ernst,"Tech. Univ. Braunschweig, Germany;Tech. Univ. Braunschweig, Germany",,,5,2,15,
Vis,1995,Astronomers and their shady algorithms,10.1109/VISUAL.1995.485155,http://dx.doi.org/10.1109/VISUAL.1995.485155,374,"377, 477",C,"The vast quantities of data which may be produced by modern radio telescopes have outstripped conventional visualisation techniques available to astronomers. While research in other areas of visualisation finds some application in astronomy, problems peculiar to the field require new techniques. This paper presents a brief overview of some of the problems of visualisation for astronomy and compares different shading algorithms. A more comprehensive overview may be found in Norris (1994) and Gooch (1995).",Richard Gooch,R.E. Gooch,"CSIRO Australia Telescope Nat. Facility, Sydney, NSW, Australia",,,5,3,3,
Vis,1996,Using visualization in the archaeological excavations of a pre-Inca temple in Peru,10.1109/VISUAL.1996.568132,http://dx.doi.org/10.1109/VISUAL.1996.568132,359,362,C,"We describe an on-going project that is using visualization as an indispensable tool for the restoration of the disintegrated ceiling of a ritual precinct that was discovered during archaeological excavations of a group of pre-Inca temples in Peru. This ceiling is unique-it is the only one ever found that has pictures painted on it, rather than being simply white-washed. The restoration of the ceiling, and the recovery of these iconographic figures will provide an unprecedented opportunity to study the culture of the Moche people who build and used these temples.",Alan D. Kalvin;Alfredo Remy;Orlando Ardito;Kim Morla;Eduardo Nolasco;Jorge Prado;Regulo Franco;Antonio Murga;Guillermo Wiese,A.D. Kalvin;A. Remy;O. Ardito;K. Morla;E. Nolasco;J. Prado;R. Franco;A. Murga;G. Wiese,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",,,5,3,2,
Vis,1996,Data level comparative visualization in aircraft design,10.1109/VISUAL.1996.568140,http://dx.doi.org/10.1109/VISUAL.1996.568140,393,396,C,"Comparative visualization has successfully been applied to a variety of fluid dynamic problems. Most applications rely on image level comparison such as experimental flow visualization versus computational flow imagery (CFI) which tries to simulate optical image acquisition in flow testing. When differences become difficult to distinguish or once a quantitative result is required, data level comparison provides powerful means to visualize data from multiple sources. Data level comparison and visualization turns out to be an essential tool in modern aircraft design projects. It is already successfully applied in the geometric preprocessing stage and the CFD analysis and will serve for comparison with experimental data as well.",Jens C. Trapp;Hans-Georg Pagendarm,J. Trapp;H.-G. Pagendarm,"DLR, German Aerosp. Res. Establ., Gottingen, Germany",10.1109/VISUAL.1995.485151;10.1109/VISUAL.1995.485156,,5,5,7,
Vis,1996,Case Study: Visual access for landscape event based temporal data,10.1109/VISUAL.1996.568148,http://dx.doi.org/10.1109/VISUAL.1996.568148,425,428,C,As ecological awareness increases there has been a shift towards more integrated forest management. Accurate modeling of future states of forested landscapes will allow better planning for safeguarding our forest resource for future generations. We present an initial exploration into providing visual access to information generated by SELES (Spatially Explicit Landscape Event Simulator). We explore the application of our visual access distortion technique to a block of temporal data created from a sequence of landscape event based information. This type of access extends the possibilities of visual exploration for temporal and spatial interrelations in a data set.,Sheelagh Carpendale;Andrew Fall;David J. Cowperthwaite;Joseph Fall;F. David Fracchia,M. Sheelagh T. Carpendale;A. Fall;D.J. Cowperthwaite;J. Fall;F.D. Fracchia,"Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada",,"distortion viewing, 3D interaction, information visualization, temporal data",5,4,4,
Vis,1997,Visualization of plant growth,10.1109/VISUAL.1997.663925,http://dx.doi.org/10.1109/VISUAL.1997.663925,475,478,C,"The measurement, analysis and visualization of plant growth is of primary interest to plant biologists. We are developing software tools to support such investigations. There are two parts in this investigation, namely growth visualization of (i) a plant root and (ii) a plant stem. For both domains, the input data is a stream of images taken by cameras. The tools being developed make it possible to measure various time-varying quantities, such as differential growth. For both domains, the plant is modeled by using flexible templates to represent non-rigid motions.",Jeremy J. Loomis;Xiuwen Liu;Zhaohua Ding;Kikuo Fujimura;Michael L. Evans;Hideo Ishikawa,J.J. Loomis;Xiuwen Liu;Zhaohua Ding;K. Fujimura;M.L. Evans;H. Ishikawa,"Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA",,"Shape representation, image sequence analysis, non-rigid motion, plant biology",5,1,14,
InfoVis,1998,Comparative visualization of protein structure-sequence alignments,10.1109/INFVIS.1998.729566,http://dx.doi.org/10.1109/INFVIS.1998.729566,106,"110, 158",C,"Protein fold recognition (threading) involves the prediction of a protein's three-dimensional shape based on its similarity to a protein whose structure is known. Fold predictions are low resolution; no effort is made to rotate the protein's component amino acid side chains into their correct spatial orientations. Rather, the goal is to recognize the protein family member that most closely resembles the target sequence of unknown structure and to create a sensible alignment of the target to the structure (i.e., a structure-sequence alignment). To complement this structure prediction method the authors have implemented a low resolution molecular graphics tool. Since amino acid side chain orientation is not relevant in fold recognition, amino acid residues are represented by abstract shapes or glyphs much like Lego/sup TM/ blocks. They also borrow techniques from comparative streamline visualization to provide clean depictions of the entire protein structure model. By creating a low resolution representation of protein structure, they are able to approximately double the amount of information on the screen. This implementation also possesses the advantage of eliminating distracting and possibly misleading visual clutter resulting from the mapping of protein alignment information onto a high resolution display of a known structure.",Marc D. Hansen;Doanna Meads;Alex T. Pang,M. Hansen;D. Meads;A. Pang,"Dept. of Comput. Sci., California Univ., CA, USA",10.1109/VISUAL.1996.567796;10.1109/VISUAL.1996.568116;10.1109/VISUAL.1995.480794,"proteins, structure, alignment, fold recognition, threading, similarity, glyphs, streamlines, ribbons,amino acids",5,3,17,
Vis,1998,Multi-Source Data Analysis Challenges,10.1109/VISUAL.1998.745353,http://dx.doi.org/10.1109/VISUAL.1998.745353,501,504,M,,Samuel P. Uselton;Lloyd Treinish;James P. Ahrens;E. Wes Bethel;Andrei State,S. Uselton;J. Ahrens;W. Bethel;L. Treinish;A. State,University of North Carolina at Chapel Hill,,,5,2,0,
Vis,1999,Automation or interaction: what's best for big data?,10.1109/VISUAL.1999.809940,http://dx.doi.org/10.1109/VISUAL.1999.809940,491,495,M,,David N. Kenwright;David C. Banks;Steve Bryson;Robert Haimes;Robert van Liere;Samuel P. Uselton,D. Kenwright,NASA Ames Research Center,,,5,0,0,
Vis,2000,Mastering interactive surface rendering for Java-based diagnostic applications,10.1109/VISUAL.2000.885726,http://dx.doi.org/10.1109/VISUAL.2000.885726,437,440,C,"The display of iso-surfaces in medical data sets is an important visualization technique used by radiologists for the diagnosis of volumetric density data sets. The demands put by radiologists on such a display technique are interactivity, multiple stacked transparent surfaces and cutting planes that allow an interactive clipping of the surfaces. This paper presents a Java based, platform independent implementation of a very fast surface rendering algorithm which combines the advantages of explicit surface representation, splatting, and shear-warp projection to fulfill all these requirements. The algorithm is implemented within the context of J-Vision, an application for viewing and diagnosing medical images which is currently in use at various hospitals.",Lukas Mroz;Rainer Wegenkittl;M. Eduard Gröller,L. Mroz;R. Wegenkittl;E. Groller,"Inst. of Comput. Graphics, Wien Univ. of Technol., Austria",10.1109/VISUAL.1999.809911,"volume visualization, surface rendering, medical applications, tomographic data",5,2,7,
Vis,2001,PingTV: A Case Study in Visual Network Monitoring,10.1109/VISUAL.2001.964541,http://doi.ieeecomputersociety.org/10.1109/VISUAL.2001.964541,421,424,C,"PingTV generates a logical map of a network that is used as an overlay on a physical geographical image of the location from the user perspective (buildings, floors within buildings, etc.). PingTV is used at Illinois State University as a visualization tool to communicate real-time network conditions to the university community via a dedicated channel on the campus cable TV system. Colored symbols allow students and staff to discern high-congestion ""rush hours"" and understand why their specific Internet connectivity is ""broken"" from the wide range of potential causes. Lessons learned include the use of color to visually convey confidence intervals using color shading and the visualization of cyclical network traffic patterns. Our implementation is general and flexible with potential for application for other domains.",Alexander Gubin;William Yurcik;Larry Brumbaugh,A. Gubin;W. Yurcik;L. Brumbaugh,"Lucent Technol., Naperville, IL, USA",,"network visualization, active network measurement, real-time television monitoring system",5,3,4,
Vis,2001,Case study: medical Web service for the automatic 3D documentation for neuroradiological diagnosis,10.1109/VISUAL.2001.964542,http://dx.doi.org/10.1109/VISUAL.2001.964542,425,428,C,"The case study presents a medical Web service for the automatic analysis of CTA (computer tomography angiography) datasets. It aims at the detection and evaluation of intracranial aneurysms which are malformations of cerebral blood vessels. To obtain a standardized 3D visualization, digital videos are automatically generated. The time-consuming video production caused by the manual delineation of structures, software based volume rendering, and the interactive definition of an optimized camera path is considerably improved with a fully automatic strategy. Therefore, a previously suggested approach (C. Rezk-Salama, 2000) is applied which uses an optimized transfer function as a template and automatically adapts it to an individual dataset. Furthermore, we introduce hardware-accelerated morphologic filtering in order to detect the location of mid-size and giant aneurysms. The actual generation of the video is finally integrated into a hardware accelerated off-screen rendering process based on 3D texture mapping, ensuring fast visualization of high quality. Overall, clinical routine can be considerably assisted by providing a Web based service combining automatic detection and standardized visualization.",Sabine Iserhardt-Bauer;Peter Hastreiter;Thomas Ertl;K. Eberhardt;Bernd Tomandl,S. Iserhardt-Bauer;P. Hastreiter;T. Ertl;K. Eberhardt;B. Tomandl,"Visualization & Interactive Syst. Group, Stuttgart Univ., Germany",10.1109/VISUAL.2000.885729,"Medical visualization, segmentation, automatic web service, video generation",5,1,11,
Vis,2001,Case study: visual debugging of cluster hardware,10.1109/VISUAL.2001.964543,http://dx.doi.org/10.1109/VISUAL.2001.964543,429,432,C,"This paper presents a novel use of visualization applied to debugging the Cplant/sup TM/ cluster hardware at Sandia National Laboratories. As commodity cluster systems grow in popularity and grow in size, tracking component failures within the hardware will become more and more difficult. We have developed a tool that facilitates visual debugging of errors within the switches and cables connecting the processors. Combining an abstract system model with color-coding for both error and job information enables failing components to be identified.",Patricia Crossno;Rena A. Haynes,P. Crossno;R. Haynes,"Sandia Nat. Labs., Albuquerque, NM, USA;Sandia Nat. Labs., Albuquerque, NM, USA",10.1109/VISUAL.1999.809919,"visual debugging, hardware modeling, design analysis, performance optimization",5,3,8,
Vis,2001,Case study: an environment for understanding protein simulations using game graphics,10.1109/VISUAL.2001.964547,http://dx.doi.org/10.1109/VISUAL.2001.964547,445,448,C,"We describe a visualization system designed for interactive study of proteins in the field of computational biology. Our system incorporates multiple, custom, three-dimensional and two-dimensional linked views of the proteins. We take advantage of modem commodity graphics cards, which are typically designed for games rather than scientific visualization applications, to provide instantaneous linking between views and three-dimensional interactivity on standard personal computers. Furthermore, we anticipate the usefulness of game techniques such as bump maps and skinning for scientific applications.",Donna L. Gresh;Frank Suits;Yuk Yin Sham,D. Gresh;F. Suits;Yuk Yin Sham,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.1995.480793,"visualization, proteins, computational biology, molecular modeling, molecular dynamics, game graphics, DirectX",5,1,12,
Vis,2002,Exploring surface characteristics with interactive Gaussian images (a case study),10.1109/VISUAL.2002.1183828,http://dx.doi.org/10.1109/VISUAL.2002.1183828,553,556,C,"The Gauss map projects surface normals to a unit sphere, providing a powerful visualization of the geometry of a graphical object. it can be used to predict visual events caused by changes in lighting, shading, and camera control. We present an interactive technique for portraying the Gauss map of polygonal models, mapping surface normals and the magnitudes of surface curvature using a spherical projection. Unlike other visualizations of surface curvature, we create our Gauss map directly from polygonal meshes without requiring any complex intermediate calculations of differential geometry. For anything other than simple shapes, surface information is densely mapped into the Gaussian normal image, inviting the use of visualization techniques to amplify and emphasize details hidden within the wealth of data. We present the use of interactive visualization tools such as brushing and linking to explore the surface properties of solid shapes. The Gauss map is shown to be simple to compute, easy to view dynamically, and effective at portraying important features of polygonal models.",Bradley C. Lowekamp;Penny Rheingans;Terry S. Yoo,B. Lowekamp;P. Rheingans;T.S. Yoo,"Maryland Univ., Baltimore, MD, USA;Maryland Univ., Baltimore, MD, USA",10.1109/VISUAL.2001.964529,"Computational Geometry, Gauss map, Illumination and shading, Interactive visualization",5,3,12,
InfoVis,2003,An experimental evaluation of continuous semantic zooming in program visualization,10.1109/INFVIS.2003.1249021,http://dx.doi.org/10.1109/INFVIS.2003.1249021,155,162,C,This paper presents the results of an experiment aimed at investigating how different methods of viewing visual programs affect users' understanding. The first two methods used traditional flat and semantic zooming models of program representation; the third is a new representation that uses semantic zooming combined with blending and proximity. The results of several search tasks performed by approximately 80 participants showed that the new method resulted in both faster and more accurate searches than the other methods.,Kenneth L. Summers;Timothy E. Goldsmith;Steve Kubica;Thomas P. Caudell,K.L. Summers;T.E. Goldsmith;S. Kubica;T.P. Caudell,"Center for High Performance Comput., New Mexico Univ., Albuquerque, NM, USA",10.1109/INFVIS.1997.636784,"Program visualization, Human subjects testing, Visual program languages",5,0,17,
InfoVis,2003,Conveying shape with texture: an experimental investigation of the impact of texture type on shape categorization judgments,10.1109/INFVIS.2003.1249022,http://dx.doi.org/10.1109/INFVIS.2003.1249022,163,170,C,"As visualization researchers, we are interested in gaining a better understanding of how to effectively use texture to facilitate shape perception. If we could design the ideal texture pattern to apply to an arbitrary smoothly curving shape to be most accurately and effectively perceived, what would the characteristics of that texture pattern be? In this paper we describe the results of a comprehensive controlled observer experiment intended to yield insight into that question. Here, we report the results of a new study comparing the relative accuracy of observers' judgments of shape type (elliptical, cylindrical, hyperbolic or flat) and shape orientation (convex, concave, both, or neither) for local views of boundary masked quadric surface patches under six different principal direction texture pattern conditions plus two texture conditions (an isotropic pattern and a non-principal direction oriented anisotropic pattern), under both perspective and orthographic projection conditions and from both head-on and oblique viewpoints. Our results confirm the hypothesis that accurate shape perception is facilitated to a statistically significantly greater extent by some principal direction texture patterns than by others. Specifically, we found that, for both views, under conditions of perspective projection, participants more often correctly identified the shape category and the shape orientation when the surface was textured with the pattern that contained oriented energy along both the first and second principal directions only than in the case of any other texture condition. Patterns containing markings following only one of the principal directions, or containing information along other directions in addition to the principal directions yielded poorer performance overall.",Sunghee Kim;Haleh Hagh-Shenas;Victoria Interrante,Sunghee Kim;H. Hagh-Shenas;V. Interrante,"Minnesota Univ., Minneapolis, MN, USA;Minnesota Univ., Minneapolis, MN, USA;Minnesota Univ., Minneapolis, MN, USA",,"shape perception, texture, principal directions",5,1,17,
Vis,2003,Visualizing spatial and temporal variability in coastal observatories,10.1109/VISUAL.2003.1250421,http://dx.doi.org/10.1109/VISUAL.2003.1250421,569,574,C,"In this paper, we describe a set of 3D and 4D visualization tools and techniques for CORIE, a complex environmental observation and forecasting system (EOFS) for the Columbia River. The Columbia River, a complex and highly variable estuary, is the target of numerous cross-disciplinary ecosystem research projects and is at the heart of multiple sustainable development issues with long reaching implications for the Pacific Northwest. However, there has been until recently no comprehensive and objective system available for modeling this environment, and as a consequence, researchers and agencies have had inadequate tools for evaluating the effects of natural resource management decisions. CORIE was designed to address this gap and is a major step towards the vision of a scalable, multi-use, real-time EOFS. Although CORIE already had a rich set of visualization tools, most of them produced 2D visualizations and did not allow for interactive visualization. Our work adds advanced interactive 3D tools to CORIE, which can be used for further inspection of the simulated and measured data.",Walter Jiménez;Wagner Toledo Corrêa;Cláudio T. Silva;António M. Baptista,W.H. Jimenez;W.T. Correa;C.T. Silva;A.M. Baptista,"OGI Sch. of Sci. & Eng., Oregon Health & Sci. Univ., Portland, OR, USA;OGI Sch. of Sci. & Eng., Oregon Health & Sci. Univ., Portland, OR, USA;OGI Sch. of Sci. & Eng., Oregon Health & Sci. Univ., Portland, OR, USA;OGI Sch. of Sci. & Eng., Oregon Health & Sci. Univ., Portland, OR, USA",10.1109/VISUAL.1999.809865;10.1109/VISUAL.1999.809908,"coastal observatories, environmental observation and forecasting systems, coasts, estuaries, Columbia River",5,1,19,
InfoVis,2004,EZEL: a Visual Tool for Performance Assessment of Peer-to-Peer File-Sharing Network,10.1109/INFVIS.2004.25,http://dx.doi.org/10.1109/INFVIS.2004.25,41,48,C,"In this paper we present EZEL, a visual tool we developed for the performance assessment of peer-to-peer file-sharing networks. We start by identifying the relevant data transferred in this kind of networks and the main performance assessment questions. Then we describe the visualization of data from two different points of view. First we take servers as focal points and we introduce a new technique, faded cushioning, which allows visualizing the same data from different perspectives. Secondly, we present the viewpoint of files, and we expose the correlations with the server stance via a special scatter plot. Finally, we discuss how our tool, based on the described techniques, is effective in the performance assessment of peer-to-peer file-sharing networks",Lucian Voinea;Alexandru Telea;Jarke J. van Wijk,L. Voinea;A. Telea;J.J. van Wijk,Technische Universiteit Eindhoven,10.1109/INFVIS.1999.801853;10.1109/INFVIS.1999.801860;10.1109/INFVIS.1999.801852;10.1109/INFVIS.2001.963279;10.1109/INFVIS.1999.801859;10.1109/INFVIS.2002.1173149,"process visualization, distributed file systems visualization, P2P file-sharing networks visualization, small displays",5,3,11,
InfoVis,2004,Keynote Address: From Information Visualization to Sensemaking: Connecting the Mind's Eye to the Mind's Muscle,10.1109/INFVIS.2004.44,http://dx.doi.org/10.1109/INFVIS.2004.44,xii,xii,M,Provides an abstract of the keynote presentation and a brief professional biography of the presenter. The complete presentation was not made available for publication as part of the conference proceedings.,Stuart K. Card,S. Card,Palo Alto Research Center,,,5,0,0,
InfoVis,2004,An Experimental Investigation of Magnification Lens Offset and Its Impact on Imagery Analysis,10.1109/INFVIS.2004.6,http://dx.doi.org/10.1109/INFVIS.2004.6,5,5,M,"A digital lens is a user interface mechanism that is a potential solution to information mangement problems. We investigated the use of digital lensing applied to imagery analysis. Participants completed three different types of tasks (locate, follow, and compare) using a magnification lens with three different degrees of offset (aligned, adjacent, and docked) over a high-resolution aerial photo. Although no lens offset mode was significantly better than another, most participants preferred the adjacent mode for the locate and compare tasks, and the docked mode for the follow tasks. This paper describes the results of a user study of magnification lenses and provides new insights into preferences of and interactions with digital lensing.",Erika Darling;Chris Newbern;Nikhil Kalghatgi;Aaron Burgman;Kristine Recktenwald,E. Darling;C. Newbern;N. Kalghatgi;A. Burgman;K. Recktenwald,The Mitre Corporation,,,5,1,7,
InfoVis,2004,TextPool: Visualizing Live Text Streams,10.1109/INFVIS.2004.63,http://dx.doi.org/10.1109/INFVIS.2004.63,1,1,M,"In today's fast-paced world it is becoming increasingly difficult to stay abreast of the public discourse. With the advent of hundreds of closed-captioned cable channels and internet-based channels such as news feeds, blogs, or email, knowing the ""buzz"" is a particular challenge. TextPool addresses this problem by quickly summarizing recent content in live text streams. The summarization is a dynamically changing textual collage that clusters related terms. We tested TextPool with the content of several RSS newswire feeds, which are updated roughly every five minutes. TextPool was able to handle this bandwidth well, and produced useful summarizations of feed content.",Conrad Albrecht-Buehler;Benjamin Watson;David A. Shamma,C. Albrecht-Buehler;B. Watson;D.A. Shamma,Northwestern University,,,5,2,9,
InfoVis,2004,ARNA: Interactive Comparison and Alignment of RNA Secondary Structure,10.1109/INFVIS.2004.7,http://dx.doi.org/10.1109/INFVIS.2004.7,8,8,M,"ARNA is an interactive visualization system that supports comparison and alignment of RNA secondary structure. We present a new approach to RNA alignment that exploits the complex structure of the Smith-Waterman local distance matrix, allowing people to explore the space of possible partial alignments to discover a good global solution. The modular software architecture separates the user interface from computation, allowing the possibility of incorporating different alignment algorithms into the same framework.",Gerald Gainant;David Auber,G. Gainant;D. Auber,University of Bordeaux 1,,,5,2,9,
InfoVis,2004,Visualizing High Dimensional Datasets Using Partiview,10.1109/INFVIS.2004.76,http://dx.doi.org/10.1109/INFVIS.2004.76,20,20,M,"A standard method of visualizing high-dimensional data is reducing its dimensionality to two or three using some algorithm, and then creating a scatterplot with data represented by labelled and/or colored dots. Two problems with this approach are (1) dots do not represent data well, (2) reducing to just three dimensions does not make full use of several dimensionality-reduction algorithms. We demonstrate how Partiview can be used to solve these problems, in the context of handwriting recognition and image retrieval.",Dinoj Surendran;Stuart Levy,D. Surendran;S. Levy,University of Chicago,,,5,1,4,
Vis,2004,Intuitive and interactive modification of large finite element models,10.1109/VISUAL.2004.58,http://dx.doi.org/10.1109/VISUAL.2004.58,361,368,C,"Virtual prototyping is increasingly replacing real mock-ups and experiments in industrial product development. Part of this process is the simulation of structural and functional properties, which is in many cases based on finite element analysis (FEA). One prominent example from the automotive industry is the safety improvement resulting from crash worthiness simulations. A simulation model for this purpose usually consists of up to one million finite elements and is assembled from many parts, which are individually meshed out of their CAD representation. In order to accelerate the development cycle, simulation engineers want to be able to modify their FE models without going back to the CAD department. Furthermore, valid CAD models might even not be available in preliminary design stages. However, in contrast to CAD, there is a lack of tools that offer the possibility of modification and processing of finite element components while maintaining the properties relevant to the simulation. In this application paper we present interactive algorithms for intuitive and fast editing of FE models and appropriate visualization techniques to support engineers in understating these models. This includes new kinds of manipulators, feedback mechanisms and facilities for virtual reality and immersion at the workplace, e.g. autostereoscopic displays and haptic devices.",Dirc Rose;Katrin Bidmon;Thomas Ertl,D. Rose;K. Bidmon;T. Ertl,"Visualization & Interactive Syst. Group, Stuttgart Univ., Germany;Visualization & Interactive Syst. Group, Stuttgart Univ., Germany;Visualization & Interactive Syst. Group, Stuttgart Univ., Germany",10.1109/VISUAL.2002.1183829,"finite element modeling, interaction, manipulators, autostereoscopy",5,3,36,
InfoVis,2005,Highlighting conflict dynamics in event data,10.1109/INFVIS.2005.1532135,http://dx.doi.org/10.1109/INFVIS.2005.1532135,103,110,C,"We present a method for visual summary of bilateral conflict structures embodied in event data. Such data consists of actors linked by time stamped events, and may be extracted from various sources such as news reports and dossiers. When analyzing political events, it is of particular importance to be able to recognize conflicts and actors involved in them. By projecting actors into a conflict space, we are able to highlight the main opponents in a series of tens of thousands of events, and provide a graphic overview of the conflict structure. Moreover, our method allows for smooth animation of the dynamics of a conflict.",Ulrik Brandes;Daniel Fleischer;Jürgen Lerner,U. Brandes;D. Fleischer;J. Lerner,"Dept. of Comput. & Inf. Sci., Konstanz Univ., Germany;Dept. of Comput. & Inf. Sci., Konstanz Univ., Germany;Dept. of Comput. & Inf. Sci., Konstanz Univ., Germany",,"information visualization, text mining, event analysis, time-dependent visualization",5,2,10,
Vis,2005,The software interface to the 3D-force microscope,10.1109/VISUAL.2005.1532829,http://dx.doi.org/10.1109/VISUAL.2005.1532829,455,462,C,"We have developed a real-time experiment-control and data-display system for a novel microscope, the 3D-force microscope (3DFM), which is designed for nanometer-scale and nanoNewton-force biophysical experiments. The 3DFM software suite synthesizes the several data sources from the 3DFM into a coherent view and provides control over data collection and specimen manipulation. Herein, we describe the system architecture designed to handle the several feedback loops and data flows present in the microscope and its control system. We describe the visualization techniques used in the 3DFM software suite, where used, and on which types of data. We present feedback from our scientist-users regarding the usefulness of these techniques, and we also present lessons learned from our successive implementations.",David Marshburn;Chris Weigle;Benjamin G. Wilde;Russell M. Taylor II;Kalpit Desai;J. K. Fisher;Jeremy Cribb;E. Timothy O'Brien;Richard Superfine,D. Marshburn;C. Weigle;B.G. Wilde;R.M. Taylor;K. Desai;J.K. Fisher;J. Cribb;E.T. O'Brien;R. Superfine,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",10.1109/VISUAL.1997.663923;10.1109/VISUAL.1996.568110;10.1109/VISUAL.1996.568136,"applications of visualization, multimodal visualization, haptics, force, scientific visualization, interactive graphics, virtual worlds, microscopy",5,0,23,
InfoVis,2006,Complex Logarithmic Views for Small Details in Large Contexts,10.1109/TVCG.2006.126,http://dx.doi.org/10.1109/TVCG.2006.126,845,852,J,"Commonly known detail in context techniques for the two-dimensional Euclidean space enlarge details and shrink their context using mapping functions that introduce geometrical compression. This makes it difficult or even impossible to recognize shapes for large differences in magnification factors. In this paper we propose to use the complex logarithm and the complex root functions to show very small details even in very large contexts. These mappings are conformal, which means they only locally rotate and scale, thus keeping shapes intact and recognizable. They allow showing details that are orders of magnitude smaller than their surroundings in combination with their context in one seamless visualization. We address the utilization of this universal technique for the interaction with complex two-dimensional data considering the exploration of large graphs and other examples",Joachim Böttger;Michael Balzer;Oliver Deussen,Joachim Bottger;Michael Balzer;Oliver Deussen,,10.1109/INFVIS.1997.636786;10.1109/INFVIS.2005.1532128;10.1109/INFVIS.1996.559214,"Detail in context, complex logarithm, conformal mappings, analytic functions, interaction",5,5,9,
VAST,2006,Visualizing the Performance of Computational Linguistics Algorithms,10.1109/VAST.2006.261417,http://dx.doi.org/10.1109/VAST.2006.261417,151,157,C,"We have built a visualization system and analysis portal for evaluating the performance of computational linguistics algorithms. Our system focuses on algorithms that classify and cluster documents by assigning weights to words and scoring each document against high dimensional reference concept vectors. The visualization and algorithm analysis techniques include confusion matrices, ROC curves, document visualizations showing word importance, and interactive reports. One of the unique aspects of our system is that the visualizations are thin-client Web-based components built using SVG visualization components",Stephen G. Eick;Justin Mauger;Alan Ratner,Stephen G. Eick;Justin Mauger;Alan Ratner,"SSS Research, Inc. eick@sss-research.com;SAIC Advanced Systems & Concepts, maugerj@saic.com;National Security Agency, asratne@nsa.gov",,"AJAX, thin-client, SVG, ROC curves, confusion matrices, document categorization",5,2,6,
VAST,2006,Visual Exploration of Spatio-temporal Relationships for Scientific Data,10.1109/VAST.2006.261451,http://dx.doi.org/10.1109/VAST.2006.261451,11,18,C,"Spatio-temporal relationships among features extracted from temporally-varying scientific datasets can provide useful information about the evolution of an individual feature and its interactions with other features. However, extracting such useful relationships without user guidance is cumbersome and often an error prone process. In this paper, we present a visual analysis system that interactively discovers such relationships from the trajectories of derived features. We describe analysis algorithms to derive various spatial and spatio-temporal relationships. A visual interface is presented using which the user can interactively select spatial and temporal extents to guide the knowledge discovery process. We show the usefulness of our proposed algorithms on datasets originating from computational fluid dynamics. We also demonstrate how the derived relationships can help in explaining the occurrence of critical events like merging and bifurcation of the vortices",Bryan Mehta;Srinivasan Parthasarathy 0001;Raghu Machiraju,Sameep Mehta;Srinivasan Parthasarathy;Raghu Machiraju,"Computer Science & Engineering, The Ohio State University, mehtas@cse.ohio-state.edu;Computer Science & Engineering, The Ohio State University, srini@cse.ohio-state.edu;Computer Science & Engineering, The Ohio State University, raghu@cse.ohio-state.edu",10.1109/VISUAL.2002.1183789,"Knowledge Discovery, Scientific Analytics, Trajectory Analysis, Feature Extraction, Spatio-temporal Predicates, Visual Analytics",5,4,28,
Vis,2006,Analyzing Complex FTMS Simulations: a Case Study in High-Level Visualization of Ion Motions,10.1109/TVCG.2006.118,http://dx.doi.org/10.1109/TVCG.2006.118,1037,1044,J,"Current practice in particle visualization renders particle position data directly onto the screen as points or glyphs. Using a camera placed at a fixed position, particle motions can be visualized by rendering trajectories or by animations. Applying such direct techniques to large, time dependent particle data sets often results in cluttered images in which the dynamic properties of the underlying system are difficult to interpret. In this case study we take an alternative approach to the visualization of ion motions. Instead of rendering ion position data directly, we first extract meaningful motion information from the ion position data and then map this information onto geometric primitives. Our goal is to produce high-level visualizations that reflect the physicists' way of thinking about ion dynamics. Parameterized geometric icons are defined to encode motion information of clusters of related ions. In addition, a parameterized camera control mechanism is used to analyze relative instead of only absolute ion motions. We apply the techniques to simulations of Fourier transform mass spectrometry (FTMS) experiments. The data produced by such simulations can amount to 5.10&lt;sup&gt;4&lt;/sup&gt; ions and 10&lt;sup&gt;5&lt;/sup&gt; timesteps. This paper discusses the requirements, design and informal evaluation of the implemented system",Wojciech Burakiewicz;Robert van Liere,Wojciech Burakiewicz;Robert Van Liere,"Center of Mathematics and Computer Science, Amsterdam;Center of Mathematics and Computer Science, Amsterdam",10.1109/VISUAL.2001.964552;10.1109/VISUAL.2004.121;10.1109/VISUAL.2000.885733;10.1109/VISUAL.2000.885734,"Particle visualization, motion, motion features",5,5,10,
Vis,2007,IStar: A Raster Representation for Scalable Image and Volume Data,10.1109/TVCG.2007.70572,http://dx.doi.org/10.1109/TVCG.2007.70572,1424,1431,J,"Topology has been an important tool for analyzing scalar data and flow fields in visualization. In this work, we analyze the topology of multivariate image and volume data sets with discontinuities in order to create an efficient, raster-based representation we call IStar. Specifically, the topology information is used to create a dual structure that contains nodes and connectivity information for every segmentable region in the original data set. This graph structure, along with a sampled representation of the segmented data set, is embedded into a standard raster image which can then be substantially downsampled and compressed. During rendering, the raster image is upsampled and the dual graph is used to reconstruct the original function. Unlike traditional raster approaches, our representation can preserve sharp discontinuities at any level of magnification, much like scalable vector graphics. However, because our representation is raster-based, it is well suited to the real-time rendering pipeline. We demonstrate this by reconstructing our data sets on graphics hardware at real-time rates.",Joe Michael Kniss;Warren A. Hunt;Kristin Potter;Pradeep Sen,Joe Kniss;Warren Hunt;Kristin Potter;Pradeep Sen,Advanced Graphics Lab at the University of New Mexico;Advanced Graphics Lab at the University of New Mexico;School of Computing at the University of Utah;Advanced Graphics Lab at the University of New Mexico,10.1109/VISUAL.2005.1532839;10.1109/VISUAL.2005.1532807,"Topology, Compression, Image Representation",5,4,28,
Vis,2007,Virtual Rheoscopic Fluids for Flow Visualization,10.1109/TVCG.2007.70610,http://dx.doi.org/10.1109/TVCG.2007.70610,1751,1758,J,"Physics-based flow visualization techniques seek to mimic laboratory flow visualization methods with virtual analogues. In this work we describe the rendering of a virtual rheoscopic fluid to produce images with results strikingly similar to laboratory experiments with real-world rheoscopic fluids using products such as Kalliroscope. These fluid additives consist of microscopic, anisotropic particles which, when suspended in the flow, align with both the flow velocity and the local shear to produce high-quality depictions of complex flow structures. Our virtual rheoscopic fluid is produced by defining a closed-form formula for the orientation of shear layers in the flow and using this orientation to volume render the flow as a material with anisotropic reflectance and transparency. Examples are presented for natural convection, thermocapillary convection, and Taylor-Couette flow simulations. The latter agree well with photographs of experimental results of Taylor-Couette flows from the literature.",William L. Barth;Christopher Burns,William Barth;Christopher Burns,Texas Advanced Computing Center;Texas Advanced Computing Center,10.1109/VISUAL.2004.5,"Flow visualization, rheoscopic fluids",5,6,29,
VAST,2009,Interactive poster: Interactive multiobjective optimization - a new application area for visual analytics,10.1109/VAST.2009.5333081,http://dx.doi.org/10.1109/VAST.2009.5333081,237,238,M,"The poster introduces interactive multiobjective optimization (IMO) as a field offering new application possibilities and challenges for visual analytics (VA), and aims at inspiring collaboration between the two fields. Our aim is to collect new ideas in order to be able to utilize VA techniques more effectively in our user interface development. Simulation-based IMO methods are developed for complex problem solving, where the expert decision maker (analyst) should be supported during the iterative process of eliciting preference information and examining the resulting output data. IMO is a subfield of multiple criteria decision making (MCDM). In simulation-based IMO, the optimization task is formulated in a mathematical model containing several conflicting objectives and constraints depending on decision variables. While using IMO methods the analyst progressively provides preference information in order to find the most satisfactory compromise between the conflicting objectives. In the poster, the implementations of two new IMO methods are used as examples to demonstrate concrete challenges of interaction design. One of them is described in this summary.",Suvi Tarkkanen;Kaisa Miettinen;Jussi Hakanen,Suvi Tarkkanen;Kaisa Miettinen;Jussi Hakanen,"Department of Mathematical Information Technology, University of Jyväskylä, Finland;Department of Mathematical Information Technology, University of Jyväskylä, Finland;Department of Mathematical Information Technology, University of Jyväskylä, Finland",,,5,5,6,
Vis,2009,Volume Illustration of Muscle from Diffusion Tensor Images,10.1109/TVCG.2009.203,http://dx.doi.org/10.1109/TVCG.2009.203,1425,1432,J,"Medical illustration has demonstrated its effectiveness to depict salient anatomical features while hiding the irrelevant details. Current solutions are ineffective for visualizing fibrous structures such as muscle, because typical datasets (CT or MRI) do not contain directional details. In this paper, we introduce a new muscle illustration approach that leverages diffusion tensor imaging (DTI) data and example-based texture synthesis techniques. Beginning with a volumetric diffusion tensor image, we reformulate it into a scalar field and an auxiliary guidance vector field to represent the structure and orientation of a muscle bundle. A muscle mask derived from the input diffusion tensor image is used to classify the muscle structure. The guidance vector field is further refined to remove noise and clarify structure. To simulate the internal appearance of the muscle, we propose a new two-dimensional example based solid texture synthesis algorithm that builds a solid texture constrained by the guidance vector field. Illustrating the constructed scalar field and solid texture efficiently highlights the global appearance of the muscle as well as the local shape and structure of the muscle fibers in an illustrative fashion. We have applied the proposed approach to five example datasets (four pig hearts and a pig leg), demonstrating plausible illustration and expressiveness.",Wei Chen 0001;Zhicheng Yan;Song Zhang 0004;John Allen Crow;David S. Ebert;Ronald M. McLaughlin;Katie B. Mullins;Robert Cooper;Zi'ang Ding;Jun Liao,Wei Chen;Zhicheng Yan;Song Zhang;John Allen Crow;David S. Ebert;Ronald M. McLaughlin;Katie B. Mullins;Robert Cooper;Zi'ang Ding;Jun Liao,"State Key Lab of CAD&CG, Zhejiang University;State Key Lab of CAD&CG, Zhejiang University;Department of Computer Science and Engineering, Mississippi State University;College of Veterinary Medicine, Mississippi State University;Purdue University;College of Veterinary Medicine, Mississippi State University;College of Veterinary Medicine, Mississippi State University;College of Veterinary Medicine, Mississippi State University;State Key Lab of CAD&CG,Zhejiang University;Department of Agriculture and Biomedical Engineering, Mississippi State University",10.1109/TVCG.2006.144;10.1109/VISUAL.2005.1532856;10.1109/TVCG.2006.134;10.1109/VISUAL.2005.1532777;10.1109/VISUAL.2003.1250425;10.1109/VISUAL.2005.1532854;10.1109/VISUAL.2000.885694,"Illustrative Visualization, Diffusion Tensor Image, Muscle, Solid Texture Synthesis",5,5,45,
VAST,2011,Automated measures for interpretable dimensionality reduction for visual classification: A user study,10.1109/VAST.2011.6102474,http://dx.doi.org/10.1109/VAST.2011.6102474,281,282,M,"This paper studies the interpretability of transformations of labeled higher dimensional data into a 2D representation (scatterplots) for visual classification.&lt;sup&gt;1&lt;/sup&gt;In this context, the term interpretability has two components: the interpretability of the visualization (the image itself) and the interpretability of the visualization axes (the data transformation functions). We define a data transformation function as any linear or non-linear function of the original variables mapping the data into 1D. Even for a small dataset, the space of possible data transformations is beyond the limit of manual exploration, therefore it is important to develop automated techniques that capture both aspects of interpretability so that they can be used to guide the search process without human intervention. The goal of the search process is to find a smaller number of interpretable data transformations for the users to explore. We briefly discuss how we used such automated measures in an evolutionary computing based data dimensionality reduction application for visual analytics. In this paper, we present a two-part user study in which we separately investigated how humans rated the visualizations of labeled data and comprehensibility of mathematical expressions that could be used as data transformation functions. In the first part, we compared human perception with a number of automated measures from the machine learning and visual analytics literature. In the second part, we studied how various structural properties of an expression related to its interpretability.",Ilknur Icke;Andrew Rosenberg,Ilknur Icke;Andrew Rosenberg,"The Graduate Center, The City University of New York, USA;The Graduate Center, The City University of New York, USA",,,5,0,8,
VAST,2011,epSpread - Storyboarding for visual analytics,10.1109/VAST.2011.6102489,http://dx.doi.org/10.1109/VAST.2011.6102489,311,312,M,"We present epSpread, an analysis and storyboarding tool for geolocated microblogging data. Individual time points and ranges are analysed through queries, heatmaps, word clouds and streamgraphs. The underlying narrative is shown on a storyboard-style timeline for discussion, refinement and presentation. The tool was used to analyse data from the VAST Challenge 2011 Mini-Challenge 1, tracking the spread of an epidemic using microblogging data. In this article we describe how the tool was used to identify the origin and track the spread of the epidemic.",Llyr ap Cenydd;Rick Walker;Serban R. Pop;Helen C. Miles;Chris J. Hughes;William John Teahan;Jonathan Roberts 0002,Llyr ap Cenydd;Rick Walker;Serban Pop;Helen Miles;Chris Hughes;William Teahan;Jonathan C. Roberts,"School of Computer Science, Bangor University, UK;School of Computer Science, Bangor University, UK;School of Computer Science, Bangor University, UK;School of Computer Science, Bangor University, UK;School of Computer Science, Bangor University, UK;School of Computer Science, Bangor University, UK;School of Computer Science, Bangor University, UK",,,5,2,3,
Vis,2011,Artificial Defocus for Displaying Markers in Microscopy Z-Stacks,10.1109/TVCG.2011.168,http://dx.doi.org/10.1109/TVCG.2011.168,1757,1764,J,"As microscopes have a very shallow depth of field, Z-stacks (i.e. sets of images shot at different focal planes) are often acquired to fully capture a thick sample. Such stacks are viewed by users by navigating them through the mouse wheel. We propose a new technique of visualizing 3D point, line or area markers in such focus stacks, by displaying them with a depth-dependent defocus, simulating the microscope's optics; this leverages on the microscopists' ability to continuously twiddle focus, while implicitly performing a shape-from-focus reconstruction of the 3D structure of the sample. User studies confirm that the approach is effective, and can complement more traditional techniques such as color-based cues. We provide two implementations, one of which computes defocus in real time on the GPU, and examples of their application.",Alessandro Giusti;Pierluigi Taddei;Giorgio Corani;Luca Maria Gambardella;Cristina Magli;Luca Gianaroli,Alessandro Giusti;Pierluigi Taddei;Giorgio Corani;Luca Gambardella;Cristina Magli;Luca Gianaroli,"Dalle Molle Institute for Artificial Intelligence, Lugano, Switzerland;JRC, Ispra;Dalle Molle Institute for Artificial Intelligence, Lugano, Switzerland;Dalle Molle Institute for Artificial Intelligence, Lugano, Switzerland;International Institute of Reproductive Medicine, Lugano, Switzerland;International Institute of Reproductive Medicine, Lugano, Switzerland",10.1109/VISUAL.1990.146378;10.1109/VISUAL.1996.568136,"Depth of field, Microscopy, Focus stacks",5,4,36,HM
SciVis,2012,Coherency-Based Curve Compression for High-Order finite Element Model Visualization,10.1109/TVCG.2012.206,http://dx.doi.org/10.1109/TVCG.2012.206,2315,2324,J,"Finite element (FE) models are frequently used in engineering and life sciences within time-consuming simulations. In contrast with the regular grid structure facilitated by volumetric data sets, as used in medicine or geosciences, FE models are defined over a non-uniform grid. Elements can have curved faces and their interior can be defined through high-order basis functions, which pose additional challenges when visualizing these models. During ray-casting, the uniformly distributed sample points along each viewing ray must be transformed into the material space defined within each element. The computational complexity of this transformation makes a straightforward approach inadequate for interactive data exploration. In this paper, we introduce a novel coherency-based method which supports the interactive exploration of FE models by decoupling the expensive world-to-material space transformation from the rendering stage, thereby allowing it to be performed within a precomputation stage. Therefore, our approach computes view-independent proxy rays in material space, which are clustered to facilitate data reduction. During rendering, these proxy rays are accessed, and it becomes possible to visually analyze high-order FE models at interactive frame rates, even when they are time-varying or consist of multiple modalities. Within this paper, we provide the necessary background about the FE data, describe our decoupling method, and introduce our interactive rendering algorithm. Furthermore, we provide visual results and analyze the error introduced by the presented approach.",Alexander Bock;Erik Sundén;Bingchen Liu;Burkhard Wünsche;Timo Ropinski,Alexander Bock;Erik Sundén;Bingchen Liu;Burkhard Wünsche;Timo Ropinski,Linköping University;Linköping University;University of Auckland;University of Auckland;Linköping University,10.1109/VISUAL.1998.745310;10.1109/VISUAL.2004.91;10.1109/TVCG.2011.206;10.1109/TVCG.2006.110,"finite element visualization, GPU-based ray-casting",5,4,35,
SciVis,2012,KnotPad: Visualizing and Exploring Knot Theory with Fluid Reidemeister Moves,10.1109/TVCG.2012.242,http://dx.doi.org/10.1109/TVCG.2012.242,2051,2060,J,"We present KnotPad, an interactive paper-like system for visualizing and exploring mathematical knots; we exploit topological drawing and math-aware deformation methods in particular to enable and enrich our interactions with knot diagrams. Whereas most previous efforts typically employ physically based modeling to simulate the 3D dynamics of knots and ropes, our tool offers a Reidemeister move based interactive environment that is much closer to the topological problems being solved in knot theory, yet without interfering with the traditional advantages of paper-based analysis and manipulation of knot diagrams. Drawing knot diagrams with many crossings and producing their equivalent is quite challenging and error-prone. KnotPad can restrict user manipulations to the three types of Reidemeister moves, resulting in a more fluid yet mathematically correct user experience with knots. For our principal test case of mathematical knots, KnotPad permits us to draw and edit their diagrams empowered by a family of interactive techniques. Furthermore, we exploit supplementary interface elements to enrich the user experiences. For example, KnotPad allows one to pull and drag on knot diagrams to produce mathematically valid moves. Navigation enhancements in KnotPad provide still further improvement: by remembering and displaying the sequence of valid moves applied during the entire interaction, KnotPad allows a much cleaner exploratory interface for the user to analyze and study knot equivalence. All these methods combine to reveal the complex spatial relationships of knot diagrams with a mathematically true and rich user experience.",Hui Zhang 0006;Jianguang Weng;Lin Jing;Yiwen Zhong,Hui Zhang;Jianguang Weng;Lin Jing;Yiwen Zhong,"Indiana University;Zhejiang University of Media and Communications, China;Fujian Agriculture and Forestry University, Fuzhou, China;Fujian Agriculture and Forestry University, Fuzhou, China",10.1109/VISUAL.2005.1532804;10.1109/VISUAL.2005.1532843;10.1109/TVCG.2007.70593,"Knot Theory, Math Visualization",5,8,33,
SciVis,2012,Visual Data Analysis as an Integral Part of Environmental Management,10.1109/TVCG.2012.278,http://dx.doi.org/10.1109/TVCG.2012.278,2088,2094,J,"The U.S. Department of Energy's (DOE) Office of Environmental Management (DOE/EM) currently supports an effort to understand and predict the fate of nuclear contaminants and their transport in natural and engineered systems. Geologists, hydrologists, physicists and computer scientists are working together to create models of existing nuclear waste sites, to simulate their behavior and to extrapolate it into the future. We use visualization as an integral part in each step of this process. In the first step, visualization is used to verify model setup and to estimate critical parameters. High-performance computing simulations of contaminant transport produces massive amounts of data, which is then analyzed using visualization software specifically designed for parallel processing of large amounts of structured and unstructured data. Finally, simulation results are validated by comparing simulation results to measured current and historical field data. We describe in this article how visual analysis is used as an integral part of the decision-making process in the planning of ongoing and future treatment options for the contaminated nuclear waste sites. Lessons learned from visually analyzing our large-scale simulation runs will also have an impact on deciding on treatment measures for other contaminated sites.",Jörg Meyer;E. Wes Bethel;Jennifer L. Horsman;Susan S. Hubbard;Harinarayan Krishnan;Alexandru Romosan;Elizabeth H. Keating;Laura Monroe;Richard Strelitz;Phil Moore;Glenn Taylor;Ben Torkian;Timothy C. Johnson;Ian Gorton,Joerg Meyer;Glenn Taylor;Ben Torkian;Timothy C. Johnson;Ian Gorton;E. Wes Bethel;Jennifer L. Horsman;Susan S. Hubbard;Harinarayan Krishnan;Alexandru Romosan;Elizabeth H. Keating;Laura Monroe;Richard Strelitz;Phil Moore,Lawrence Berkeley National Laboratory;Savannah River National Laboratory;Savannah River National Laboratory;Pacific Northwest National Laboratory;Pacific Northwest National Laboratory;Lawrence Berkeley National Laboratory;Lawrence Berkeley National Laboratory;Lawrence Berkeley National Laboratory;Lawrence Berkeley National Laboratory;Lawrence Berkeley National Laboratory;Los Alamos National Laboratory;Los Alamos National Laboratory;Los Alamos National Laboratory;Savannah River National Laboratory,,"Visual analytics, high-performance computing, data management, parallel rendering, environmental management",5,5,8,
SciVis,2012,Visual Steering and Verification of Mass Spectrometry Data Factorization in Air Quality Research,10.1109/TVCG.2012.280,http://dx.doi.org/10.1109/TVCG.2012.280,2275,2284,J,"The study of aerosol composition for air quality research involves the analysis of high-dimensional single particle mass spectrometry data. We describe, apply, and evaluate a novel interactive visual framework for dimensionality reduction of such data. Our framework is based on non-negative matrix factorization with specifically defined regularization terms that aid in resolving mass spectrum ambiguity. Thereby, visualization assumes a key role in providing insight into and allowing to actively control a heretofore elusive data processing step, and thus enabling rapid analysis meaningful to domain scientists. In extending existing black box schemes, we explore design choices for visualizing, interacting with, and steering the factorization process to produce physically meaningful results. A domain-expert evaluation of our system performed by the air quality research experts involved in this effort has shown that our method and prototype admits the finding of unambiguous and physically correct lower-dimensional basis transformations of mass spectrometry data at significantly increased speed and a higher degree of ease.",Daniel Engel;Klaus Greff;Christoph Garth;Keith Bein;Anthony S. Wexler;Bernd Hamann;Hans Hagen,Daniel Engel;Klaus Greff;Christoph Garth;Keith Bein;Anthony Wexler;Bernd Hamann;Hans Hagen,"University of Kaiserslautern, Germany;University of Kaiserslautern, Germany;University of Kaiserslautern, Germany;Air Quality Research Center (AQRC), University of California, Davis, CA, USA;Air Quality Research Center (AQRC), University of California, Davis, CA, USA;Institute for Data Analysis and Visualization (IDAV), University of California, Davis, CA, USA;University of Kaiserslautern, Germany",10.1109/INFVIS.2004.68;10.1109/INFVIS.2004.15;10.1109/INFVIS.2005.1532138;10.1109/TVCG.2008.116;10.1109/VISUAL.2000.885734;10.1109/INFVIS.2003.1249015;10.1109/TVCG.2010.223;10.1109/VISUAL.2005.1532850;10.1109/INFVIS.2002.1173157;10.1109/TVCG.2008.153,"Dimension reduction, mass spectrometry data, matrix factorization, visual encodings of numerical error metrics, multi-dimensional data visualization",5,5,44,
VAST,2012,A case study: Tracking and visualizing the evolution of dark matter halos and groups of satellite halos in cosmology simulations,10.1109/VAST.2012.6400532,http://dx.doi.org/10.1109/VAST.2012.6400532,243,244,M,"In this poster, we track the evolution of cosmic structures and higher level host structures in cosmological simulation as they interact with each other. The structures found in these simulations are made up of groups of dark matter tracer particles called satellite halos and groups of satellite halos called host halos. We implement a multilevel tracking model to track dark matter tracer particles, satellite halos and host halos to understand their behaviour and show how the different structures are formed over time. We also represent the evolution of halos in the form of merger trees for detailed analysis by cosmologists.",Jay Takle;Deborah Silver;Katrin Heitmann,Jay Takle;Deborah Silver;Katrin Heitmann,"Department of Electrical & Computer Engineering, Rutgers University;Department of Electrical & Computer Engineering, Rutgers University;High Energy Physics Division, Argonne National Laboratory",,,5,7,7,
VAST,2012,Visual exploration of local interest points in sets of time series,10.1109/VAST.2012.6400534,http://dx.doi.org/10.1109/VAST.2012.6400534,239,240,M,"Visual analysis of time series data is an important, yet challenging task with many application examples in fields such as financial or news stream data analysis. Many visual time series analysis approaches consider a global perspective on the time series. Fewer approaches consider visual analysis of local patterns in time series, and often rely on interactive specification of the local area of interest. We present initial results of an approach that is based on automatic detection of local interest points. We follow an overview-first approach to find useful parameters for the interest point detection, and details-on-demand to relate the found patterns. We present initial results and detail possible extensions of the approach.",Tobias Schreck;Lyubka Sharalieva;Franz Wanner;Jürgen Bernard;Tobias Ruppert;Tatiana von Landesberger;Benjamin Bustos,Tobias Schreck;Lyubka Sharalieva;Franz Wanner;Jürgen Bernard;Tobias Ruppert;Tatiana von Landesberger;Benjamin Bustos,"University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;Fraunhofer IGD Darmstadt, Germany;Fraunhofer IGD Darmstadt, Germany;TU Darmstadt Germany;Universidad de Chile Santiago de Chile",,,5,2,8,
VAST,2012,Exploring the impact of emotion on visual judgement,10.1109/VAST.2012.6400540,http://dx.doi.org/10.1109/VAST.2012.6400540,227,228,M,"Existing research suggests that individual personality differences can influence performance with visualizations. In addition to stable traits such as locus of control, research in psychology has found that temporary changes in affect (emotion) can significantly impact individual performance on cognitive tasks. We examine the relationship between fundamental visual judgement tasks and affect through a crowdsourced user study that combines affective-priming techniques from psychology with longstanding graphical perception experiments. Our results suggest that affective-priming can significantly influence accuracy in visual judgements, and that some chart types may be more affected than others.",Lane Harrison;Remco Chang;Aidong Lu,Lane Harrison;Remco Chang;Aidong Lu,UNC-Charlotte;Tufts University;UNC-Charlotte,,,5,2,8,
VAST,2012,Smart super views---A knowledge-assisted interface for medical visualization,10.1109/VAST.2012.6400555,http://dx.doi.org/10.1109/VAST.2012.6400555,163,172,C,"Due to the ever growing volume of acquired data and information, users have to be constantly aware of the methods for their exploration and for interaction. Of these, not each might be applicable to the data at hand or might reveal the desired result. Owing to this, innovations may be used inappropriately and users may become skeptical. In this paper we propose a knowledge-assisted interface for medical visualization, which reduces the necessary effort to use new visualization methods, by providing only the most relevant ones in a smart way. Consequently, we are able to expand such a system with innovations without the users to worry about when, where, and especially how they may or should use them. We present an application of our system in the medical domain and give qualitative feedback from domain experts.",Gabriel Mistelbauer;Hamed Bouzari;Rüdiger Schernthaner;Ivan Baclija;Arnold Köchl;Stefan Bruckner;Milos Srámek;M. Eduard Gröller,Gabriel Mistelbauer;Arnold Köchl;Rudiger Schernthaner;Ivan Baclija;Rüdiger Schernthaner;Stefan Bruckner;Milos Sramek;Meister Eduard Gröller,"Vienna University of Technology, Austria;Kaiser-Franz-Josef Hospital Vienna, Austria;Austrian Academy of Sciences;Vienna University of Technology Austria;Medical University of Vienna, Austria;Austrian Academy of Sciences;Kaiser-Franz-Josef Hospital Vienna, Austria;Vienna University of Technology, Austria",10.1109/VISUAL.2003.1250400;10.1109/TVCG.2006.152;10.1109/TVCG.2007.70576;10.1109/TVCG.2007.70591;10.1109/VISUAL.2002.1183754;10.1109/VISUAL.2005.1532856;10.1109/TVCG.2011.183;10.1109/VISUAL.2005.1532818;10.1109/TVCG.2006.148,"Visualization, Fuzzy Logic, Interaction",5,4,40,
InfoVis,2013,Visualizing Request-Flow Comparison to Aid Performance Diagnosis in Distributed Systems,10.1109/TVCG.2013.233,http://dx.doi.org/10.1109/TVCG.2013.233,2466,2475,J,"Distributed systems are complex to develop and administer, and performance problem diagnosis is particularly challenging. When performance degrades, the problem might be in any of the system's many components or could be a result of poor interactions among them. Recent research efforts have created tools that automatically localize the problem to a small number of potential culprits, but research is needed to understand what visualization techniques work best for helping distributed systems developers understand and explore their results. This paper compares the relative merits of three well-known visualization approaches (side-by-side, diff, and animation) in the context of presenting the results of one proven automated localization technique called request-flow comparison. Via a 26-person user study, which included real distributed systems developers, we identify the unique benefits that each approach provides for different problem types and usage modes.",Raja R. Sambasivan;Ilari Shafer;Michelle L. Mazurek;Gregory R. Ganger,Raja R. Sambasivan;Ilari Shafer;Michelle L. Mazurek;Gregory R. Ganger,Carnegie Mellon University;Carnegie Mellon University;Carnegie Mellon University;Carnegie Mellon University,10.1109/VAST.2010.5652910;10.1109/TVCG.2008.125;10.1109/TVCG.2007.70539;10.1109/VAST.2011.6102442,"Distributed systems, human factors, problem diagnosis, visualization",5,5,37,
SciVis,2013,Evaluation of Static and Dynamic Visualization Training Approaches for Users with Different Spatial Abilities,10.1109/TVCG.2013.156,http://dx.doi.org/10.1109/TVCG.2013.156,2810,2817,J,"Conflicting results are reported in the literature on whether dynamic visualizations are more effective than static visualizations for learning and mastering 3-D tasks, and only a few investigations have considered the influence of the spatial abilities of the learners. In a study with 117 participants, we compared the benefit of static vs. dynamic visualization training tools on learners with different spatial abilities performing a typical 3-D task (specifically, creating orthographic projections of a 3-D object). We measured the spatial abilities of the participants using the Mental Rotation Test (MRT) and classified participants into two groups (high and low abilities) to examine how the participants' abilities predicted change in performance after training with static versus dynamic training tools. Our results indicate that: 1) visualization training programs can help learners to improve 3-D task performance, 2) dynamic visualizations provide no advantages over static visualizations that show intermediate steps, 3) training programs are more beneficial for individuals with low spatial abilities than for individuals with high spatial abilities, and 4) training individuals with high spatial abilities using dynamic visualizations provides little benefit.",Maria-Elena Froese;Melanie Tory;Guy-Warwick Evans;Kedar Shrikhande,Maria-Elena Froese;Melanie Tory;Guy-Warwick Evans;Kedar Shrikhande,University of Victoria;University of Victoria;University of Victoria;University of Victoria,10.1109/VISUAL.2005.1532836;10.1109/VISUAL.2003.1250396,"Spatial ability, 3D visualization, training, evaluation, orthographic projection, CAD",5,5,48,
SciVis,2014,Predicate-Based Focus-and-Context Visualization for 3D Ultrasound,10.1109/TVCG.2014.2346317,http://dx.doi.org/10.1109/TVCG.2014.2346317,2379,2387,J,"Direct volume visualization techniques offer powerful insight into volumetric medical images and are part of the clinical routine for many applications. Up to now, however, their use is mostly limited to tomographic imaging modalities such as CT or MRI. With very few exceptions, such as fetal ultrasound, classic volume rendering using one-dimensional intensity-based transfer functions fails to yield satisfying results in case of ultrasound volumes. This is particularly due its gradient-like nature, a high amount of noise and speckle, and the fact that individual tissue types are rather characterized by a similar texture than by similar intensity values. Therefore, clinicians still prefer to look at 2D slices extracted from the ultrasound volume. In this work, we present an entirely novel approach to the classification and compositing stage of the volume rendering pipeline, specifically designed for use with ultrasonic images. We introduce point predicates as a generic formulation for integrating the evaluation of not only low-level information like local intensity or gradient, but also of high-level information, such as non-local image features or even anatomical models. Thus, we can successfully filter clinically relevant from non-relevant information. In order to effectively reduce the potentially high dimensionality of the predicate configuration space, we propose the predicate histogram as an intuitive user interface. This is augmented by a scribble technique to provide a comfortable metaphor for selecting predicates of interest. Assigning importance factors to the predicates allows for focus-and-context visualization that ensures to always show important (focus) regions of the data while maintaining as much context information as possible. Our method naturally integrates into standard ray casting algorithms and yields superior results in comparison to traditional methods in terms of visualizing a specific target anatomy in ultrasound volumes.",Christian Schulte zu Berge;Maximilian Baust;Ankur Kapoor;Nassir Navab,Christian Schulte zu Berge;Maximilian Baust;Ankur Kapoor;Nassir Navab,"Chair for Computer Aided Medical Procedures, Technische Universität, München, Germany;Chair for Computer Aided Medical Procedures, Technische Universität, München, Germany;Imaging and Computer Vision, Siemens Corporation, Corporate Technology, Princeton, NJ, USA;Chair for Computer Aided Medical Procedures, Technische Universität, München, Germany",10.1109/TVCG.2006.148;10.1109/TVCG.2006.124;10.1109/TVCG.2013.189;10.1109/VISUAL.2003.1250413;10.1109/VISUAL.2001.964539,"Direct Volume Rendering, Ultrasound, Classification, Predicate Function, User Interface",5,4,27,
VAST,2014,Footprints: A Visual Search Tool that Supports Discovery and Coverage Tracking,10.1109/TVCG.2014.2346743,http://dx.doi.org/10.1109/TVCG.2014.2346743,1793,1802,J,"Searching a large document collection to learn about a broad subject involves the iterative process of figuring out what to ask, filtering the results, identifying useful documents, and deciding when one has covered enough material to stop searching. We are calling this activity “discoverage,” discovery of relevant material and tracking coverage of that material. We built a visual analytic tool called Footprints that uses multiple coordinated visualizations to help users navigate through the discoverage process. To support discovery, Footprints displays topics extracted from documents that provide an overview of the search space and are used to construct searches visuospatially. Footprints allows users to triage their search results by assigning a status to each document (To Read, Read, Useful), and those status markings are shown on interactive histograms depicting the user's coverage through the documents across dates, sources, and topics. Coverage histograms help users notice biases in their search and fill any gaps in their analytic process. To create Footprints, we used a highly iterative, user-centered approach in which we conducted many evaluations during both the design and implementation stages and continually modified the design in response to feedback.",Ellen Isaacs;Kelly Domico;Shane Ahern;Eugene Bart;Mudita Singhal,Ellen Isaacs;Kelly Damico;Shane Ahern;Eugene Bart;Mudita Singhal,Palo Alto Research Center (PARC);Palo Alto Research Center (PARC);Palo Alto Research Center (PARC);Palo Alto Research Center (PARC);Palo Alto Research Center (PARC),10.1109/VAST.2009.5333443;10.1109/VAST.2008.4677365;10.1109/VAST.2007.4389006;10.1109/INFVIS.2001.963287;10.1109/TVCG.2007.70589;10.1109/VAST.2006.261426;10.1109/TVCG.2007.70577,"discovery search visualization, visual cues, discoverage, coverage tracking, document triage, interactive histograms",5,6,35,
SciVis,2015,A Classification of User Tasks in Visual Analysis of Volume Data,10.1109/SciVis.2015.7429485,http://dx.doi.org/10.1109/SciVis.2015.7429485,1,8,C,"Empirical findings from studies in one scientific domain have very limited applicability to other domains, unless we formally establish deeper insights on the generalizability of task types. We present a domain-independent classification of visual analysis tasks with volume visualizations. This taxonomy will help researchers design experiments, ensure coverage, and generate hypotheses in empirical studies with volume datasets. To develop our taxonomy, we first interviewed scientists working with spatial data in disparate domains. We then ran a survey to evaluate the design participants in which were scientists and professionals from around the world, working with volume data in various scientific domains. Respondents agreed substantially with our taxonomy design, but also suggested important refinements. We report the results in the form of a goal-based generic categorization of visual analysis tasks with volume visualizations. Our taxonomy covers tasks performed with a wide variety of volume datasets.",Bireswar Laha;Doug A. Bowman;David H. Laidlaw;John J. Socha,Bireswar Laha;Doug A. Bowman;David H. Laidlaw;John J. Socha,Stanford University;Virginia Tech;Brown University;Virginia Tech,10.1109/INFVIS.2004.10;10.1109/TVCG.2013.124;10.1109/TVCG.2012.216;10.1109/TVCG.2009.126;10.1109/TVCG.2013.130;10.1109/TVCG.2013.120;10.1109/TVCG.2014.2346321;10.1109/INFVIS.2004.59,"Task Taxonomy, Empirical Evaluation, Volume Visualization, Scientific Visualization, Virtual Reality, 3D Interaction",5,6,35,
SciVis,2015,Real-time Uncertainty Visualization for B-Mode Ultrasound,10.1109/SciVis.2015.7429489,http://dx.doi.org/10.1109/SciVis.2015.7429489,33,40,C,"B-mode ultrasound is a very well established imaging modality and is widely used in many of today's clinical routines. However, acquiring good images and interpreting them correctly is a challenging task due to the complex ultrasound image formation process depending on a large number of parameters. To facilitate ultrasound acquisitions, we introduce a novel framework for real-time uncertainty visualization in B-mode images. We compute real-time per-pixel ultrasound Confidence Maps, which we fuse with the original ultrasound image in order to provide the user with an interactive feedback on the quality and credibility of the image. In addition to a standard color overlay mode, primarily intended for educational purposes, we propose two perceptional visualization schemes to be used in clinical practice. Our mapping of uncertainty to chroma uses the perceptionally uniform L*a*b* color space to ensure that the perceived brightness of B-mode ultrasound remains the same. The alternative mapping of uncertainty to fuzziness keeps the B-mode image in its original grayscale domain and locally blurs or sharpens the image based on the uncertainty distribution. An elaborate evaluation of our system and user studies on both medical students and expert sonographers demonstrate the usefulness of our proposed technique. In particular for ultrasound novices, such as medical students, our technique yields powerful visual cues to evaluate the image quality and thereby learn the ultrasound image formation process. Furthermore, seeing the distribution of uncertainty adjust to the transducer positioning in real-time, provides also expert clinicians with a strong visual feedback on their actions. This helps them to optimize the acoustic window and can improve the general clinical value of ultrasound.",Christian Schulte zu Berge;Denis Declara;Christoph Hennersperger;Maximilian Baust;Nassir Navab,Christian Schulte Zu Berge;Denis Declara;Christoph Hennersperger;Maximilian Baust;Nassir Navab,,10.1109/VISUAL.2001.964550;10.1109/TVCG.2006.134;10.1109/TVCG.2007.70518;10.1109/TVCG.2012.279;10.1109/TVCG.2009.114,"Ultrasound, Uncertainty Visualization, Confidence Maps, Real-time",5,1,23,
SciVis,2015,"Extracting, Tracking, and Visualizing Magnetic Flux Vortices in 3D Complex-Valued Superconductor Simulation Data",10.1109/TVCG.2015.2466838,http://dx.doi.org/10.1109/TVCG.2015.2466838,827,836,J,"We propose a method for the vortex extraction and tracking of superconducting magnetic flux vortices for both structured and unstructured mesh data. In the Ginzburg-Landau theory, magnetic flux vortices are well-defined features in a complex-valued order parameter field, and their dynamics determine electromagnetic properties in type-II superconductors. Our method represents each vortex line (a 1D curve embedded in 3D space) as a connected graph extracted from the discretized field in both space and time. For a time-varying discrete dataset, our vortex extraction and tracking method is as accurate as the data discretization. We then apply 3D visualization and 2D event diagrams to the extraction and tracking results to help scientists understand vortex dynamics and macroscale superconductor behavior in greater detail than previously possible.",Hanqi Guo 0001;Carolyn L. Phillips;Tom Peterka;Dmitry A. Karpeyev;Andreas Glatz,Hanqi Guo;Carolyn L. Phillips;Tom Peterka;Dmitry Karpeyev;Andreas Glatz,"Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, USA;Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, USA;Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, USA;Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, USA;Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, USA",10.1109/VISUAL.1994.346327;10.1109/VISUAL.2005.1532795;10.1109/TVCG.2011.249;10.1109/VISUAL.1999.809896;10.1109/VISUAL.1996.568137;10.1109/VISUAL.1998.745288;10.1109/VISUAL.2004.3;10.1109/TVCG.2012.212;10.1109/VISUAL.2005.1532851;10.1109/TVCG.2007.70545,"Superconductor, Vortex extraction, Feature tracking, Unstructured grid",5,5,39,
VAST,2015,Visual Analytics for Development and Evaluation of Order Selection Criteria for Autoregressive Processes,10.1109/TVCG.2015.2467612,http://dx.doi.org/10.1109/TVCG.2015.2467612,151,159,J,"Order selection of autoregressive processes is an active research topic in time series analysis, and the development and evaluation of automatic order selection criteria remains a challenging task for domain experts. We propose a visual analytics approach, to guide the analysis and development of such criteria. A flexible synthetic model generator-combined with specialized responsive visualizations-allows comprehensive interactive evaluation. Our fast framework allows feedback-driven development and fine-tuning of new order selection criteria in real-time. We demonstrate the applicability of our approach in three use-cases for two general as well as a real-world example.",Thomas Löwe;Emmy-Charlotte Förster;Georgia Albuquerque;Jens-Peter Kreiss;Marcus A. Magnor,Thomas Löwe;Emmy-Charlotte Förster;Georgia Albuquerque;Jens-Peter Kreiss;Marcus Magnor,"Computer Graphics Lab, Germany;Computer Graphics Lab, Germany;Computer Graphics Lab, Germany;Institut für Mathematische Stochastik, Germany;Computer Graphics Lab, Germany",10.1109/TVCG.2013.222,"Visual analytics, time series analysis, order selection",5,6,44,
SciVis,2016,Synteny Explorer: An Interactive Visualization Application for Teaching Genome Evolution,10.1109/TVCG.2016.2598789,http://dx.doi.org/10.1109/TVCG.2016.2598789,711,720,J,"Rapid advances in biology demand new tools for more active research dissemination and engaged teaching. This paper presents Synteny Explorer, an interactive visualization application designed to let college students explore genome evolution of mammalian species. The tool visualizes synteny blocks: segments of homologous DNA shared between various extant species that can be traced back or reconstructed in extinct, ancestral species. We take a karyogram-based approach to create an interactive synteny visualization, leading to a more appealing and engaging design for undergraduate-level genome evolution education. For validation, we conduct three user studies: two focused studies on color and animation design choices and a larger study that performs overall system usability testing while comparing our karyogram-based designs with two more common genome mapping representations in an educational context. While existing views communicate the same information, study participants found the interactive, karyogram-based views much easier and likable to use. We additionally discuss feedback from biology and genomics faculty, who judge Synteny Explorer's fitness for use in classrooms.",Chris Bryan;Gregory Guterman;Kwan-Liu Ma;Harris A. Lewin;Denis M. Larkin;Jaebum Kim;Jian Ma 0004;Marta Farre,Chris Bryan;Gregory Guterman;Kwan-Liu Ma;Harris Lewin;Denis Larkin;Jaebum Kim;Jian Ma;Marta Farré,"University of California, Davis;University of California, Davis;University of California, Davis;University of California, Davis;Royal Veterinary College, University of London;Konkuk University, Seoul;Carnegie Mellon University;Royal Veterinary College, University of London",;10.1109/TVCG.2007.70539;10.1109/TVCG.2012.272;10.1109/TVCG.2010.163;10.1109/TVCG.2009.167;10.1109/TVCG.2011.232;10.1109/TVCG.2010.137;10.1109/TVCG.2013.214,Bioinformatic visualization;education;learning;genome evolution;chromosome;user study,5,4,53,
SciVis,2016,Glyphs for General Second-Order 2D and 3D Tensors,10.1109/TVCG.2016.2598998,http://dx.doi.org/10.1109/TVCG.2016.2598998,980,989,J,"Glyphs are a powerful tool for visualizing second-order tensors in a variety of scientic data as they allow to encode physical behavior in geometric properties. Most existing techniques focus on symmetric tensors and exclude non-symmetric tensors where the eigenvectors can be non-orthogonal or complex. We present a new construction of 2d and 3d tensor glyphs based on piecewise rational curves and surfaces with the following properties: invariance to (a) isometries and (b) scaling, (c) direct encoding of all real eigenvalues and eigenvectors, (d) one-to-one relation between the tensors and glyphs, (e) glyph continuity under changing the tensor. We apply the glyphs to visualize the Jacobian matrix fields of a number of 2d and 3d vector fields.",Tim Gerrits;Christian Rössl;Holger Theisel,Tim Gerrits;Christian Rössl;Holger Theisel,"Visual Computing group at the University of Magdeburg, Germany;Visual Computing group at the University of Magdeburg, Germany;Visual Computing group at the University of Magdeburg, Germany",10.1109/TVCG.2014.2346325;10.1109/TVCG.2010.199;10.1109/VISUAL.1991.175773;10.1109/VISUAL.2004.115;10.1109/VISUAL.2003.1250376;10.1109/VISUAL.1993.398849;10.1109/TVCG.2009.184,Glyph-based Techniques;Tensor Field Data;Flow Visualization,5,7,20,
SciVis,2016,Categorical Colormap Optimization with Visualization Case Studies,10.1109/TVCG.2016.2599214,http://dx.doi.org/10.1109/TVCG.2016.2599214,871,880,J,"Mapping a set of categorical values to different colors is an elementary technique in data visualization. Users of visualization software routinely rely on the default colormaps provided by a system, or colormaps suggested by software such as ColorBrewer. In practice, users often have to select a set of colors in a semantically meaningful way (e.g., based on conventions, color metaphors, and logological associations), and consequently would like to ensure their perceptual differentiation is optimized. In this paper, we present an algorithmic approach for maximizing the perceptual distances among a set of given colors. We address two technical problems in optimization, i.e., (i) the phenomena of local maxima that halt the optimization too soon, and (ii) the arbitrary reassignment of colors that leads to the loss of the original semantic association. We paid particular attention to different types of constraints that users may wish to impose during the optimization process. To demonstrate the effectiveness of this work, we tested this technique in two case studies. To reach out to a wider range of users, we also developed a web application called Colourmap Hospital.",Hui Fang;Simon J. Walton;E. Delahaye;J. Harris;D. A. Storchak;Min Chen 0001,H. Fang;S. Walton;E. Delahaye;J. Harris;D. A. Storchak;M. Chen,"University of Oxford and International Seismological Centre;University of Oxford, UK;International Seismological Centre, UK;International Seismological Centre, UK;International Seismological Centre, UK;University of Oxford, UK",10.1109/VISUAL.1996.568118;10.1109/TVCG.2014.2346978;10.1109/TVCG.2008.112;10.1109/VISUAL.1995.480803;10.1109/TVCG.2010.150;10.1109/VISUAL.2002.1183788;10.1109/TVCG.2008.118,London tube map;Color;categorical colormap;optimization;seismological data visualization,5,9,53,
SciVis,2016,Correlated Photon Mapping for Interactive Global Illumination of Time-Varying Volumetric Data,10.1109/TVCG.2016.2598430,http://dx.doi.org/10.1109/TVCG.2016.2598430,901,910,J,"We present a method for interactive global illumination of both static and time-varying volumetric data based on reduction of the overhead associated with re-computation of photon maps. Our method uses the identification of photon traces invariant to changes of visual parameters such as the transfer function (TF), or data changes between time-steps in a 4D volume. This lets us operate on a variant subset of the entire photon distribution. The amount of computation required in the two stages of the photon mapping process, namely tracing and gathering, can thus be reduced to the subset that are affected by a data or visual parameter change. We rely on two different types of information from the original data to identify the regions that have changed. A low resolution uniform grid containing the minimum and maximum data values of the original data is derived for each time step. Similarly, for two consecutive time-steps, a low resolution grid containing the difference between the overlapping data is used. We show that this compact metadata can be combined with the transfer function to identify the regions that have changed. Each photon traverses the low-resolution grid to identify if it can be directly transferred to the next photon distribution state or if it needs to be recomputed. An efficient representation of the photon distribution is presented leading to an order of magnitude improved performance of the raycasting step. The utility of the method is demonstrated in several examples that show visual fidelity, as well as performance. The examples show that visual quality can be retained when the fraction of retraced photons is as low as 40%-50%.",Daniel Jönsson;Anders Ynnerman,Daniel Jönsson;Anders Ynnerman,"Linköping University, Nörrköping, Sweden;Linköping University, Nörrköping, Sweden",10.1109/TVCG.2011.161;10.1109/TVCG.2014.2346333;10.1109/TVCG.2012.232;10.1109/TVCG.2007.70518;10.1109/TVCG.2011.198;10.1109/TVCG.2011.211,Volume rendering;photon mapping;global illumination;participating media,5,11,45,HM
InfoVis,2017,Blinded with Science or Informed by Charts? A Replication Study,10.1109/TVCG.2017.2744298,http://dx.doi.org/10.1109/TVCG.2017.2744298,781,790,J,"We provide a reappraisal of Tal and Wansink's study “Blinded with Science”, where seemingly trivial charts were shown to increase belief in drug efficacy, presumably because charts are associated with science. Through a series of four replications conducted on two crowdsourcing platforms, we investigate an alternative explanation, namely, that the charts allowed participants to better assess the drug's efficacy. Considered together, our experiments suggest that the chart seems to have indeed promoted understanding, although the effect is likely very small. Meanwhile, we were unable to replicate the original study's findings, as text with chart appeared to be no more persuasive - and sometimes less persuasive - than text alone. This suggests that the effect may not be as robust as claimed and may need specific conditions to be reproduced. Regardless, within our experimental settings and considering our study as a whole (<inline-formula><tex-math notation=""LaTeX"">$\mathrm{N}=623$</tex-math><alternatives><inline-graphic xlink:href=""24tvcg01-dragicevic-2744298-ieq-1-source.tif"" xmlns:xlink=""http://www.w3.org/1999/xlink""/></alternatives></inline-formula>), the chart's contribution to understanding was clearly larger than its contribution to persuasion.",Pierre Dragicevic;Yvonne Jansen,Pierre Dragicevic;Yvonne Jansen,Inria;Sorbonne UniversitésUPMC Univ Paris 6CNRSISIR,10.1109/TVCG.2014.2346984;10.1109/TVCG.2016.2598594;10.1109/TVCG.2014.2346435;10.1109/TVCG.2012.199;10.1109/TVCG.2014.2346419;10.1109/TVCG.2015.2467717,"Replication study,persuasion,charts,data comprehension,methodology",5,3,57,
SciVis,2017,Dynamic Load Balancing Based on Constrained K-D Tree Decomposition for Parallel Particle Tracing,10.1109/TVCG.2017.2744059,http://dx.doi.org/10.1109/TVCG.2017.2744059,954,963,J,"We propose a dynamically load-balanced algorithm for parallel particle tracing, which periodically attempts to evenly redistribute particles across processes based on k-d tree decomposition. Each process is assigned with (1) a statically partitioned, axis-aligned data block that partially overlaps with neighboring blocks in other processes and (2) a dynamically determined k-d tree leaf node that bounds the active particles for computation; the bounds of the k-d tree nodes are constrained by the geometries of data blocks. Given a certain degree of overlap between blocks, our method can balance the number of particles as much as possible. Compared with other load-balancing algorithms for parallel particle tracing, the proposed method does not require any preanalysis, does not use any heuristics based on flow features, does not make any assumptions about seed distribution, does not move any data blocks during the run, and does not need any master process for work redistribution. Based on a comprehensive performance study up to 8K processes on a Blue Gene/Q system, the proposed algorithm outperforms baseline approaches in both load balance and scalability on various flow visualization and analysis problems.",Jiang Zhang 0002;Hanqi Guo 0001;Fan Hong;Xiaoru Yuan;Tom Peterka,Jiang Zhang;Hanqi Guo;Fan Hong;Xiaoru Yuan;Tom Peterka,"Ministry of EducationKey Laboratory of Machine PerceptionSchool of EECSPeking University;Mathematics and Computer Science Division, Argonne National Laboratory, Lemont, IL, USA;Ministry of EducationKey Laboratory of Machine PerceptionSchool of EECSPeking University;Ministry of EducationKey Laboratory of Machine PerceptionSchool of EECSPeking University;Mathematics and Computer Science Division, Argonne National Laboratory, Lemont, IL, USA",10.1109/TVCG.2013.128;10.1109/TVCG.2007.70551;10.1109/TVCG.2013.144;10.1109/TVCG.2011.219;10.1109/VISUAL.1997.663898;10.1109/TVCG.2017.2744059,"Parallel particle tracing,dynamic load balancing,k-d trees,performance analysis",5,6,37,
SciVis,2017,An Intelligent System Approach for Probabilistic Volume Rendering Using Hierarchical 3D Convolutional Sparse Coding,10.1109/TVCG.2017.2744078,http://dx.doi.org/10.1109/TVCG.2017.2744078,964,973,J,"In this paper, we propose a novel machine learning-based voxel classification method for highly-accurate volume rendering. Unlike conventional voxel classification methods that incorporate intensity-based features, the proposed method employs dictionary based features learned directly from the input data using hierarchical multi-scale 3D convolutional sparse coding, a novel extension of the state-of-the-art learning-based sparse feature representation method. The proposed approach automatically generates high-dimensional feature vectors in up to 75 dimensions, which are then fed into an intelligent system built on a random forest classifier for accurately classifying voxels from only a handful of selection scribbles made directly on the input data by the user. We apply the probabilistic transfer function to further customize and refine the rendered result. The proposed method is more intuitive to use and more robust to noise in comparison with conventional intensity-based classification methods. We evaluate the proposed method using several synthetic and real-world volume datasets, and demonstrate the methods usability through a user study.",Tran Minh Quan;Junyoung Choi;Haejin Jeong;Won-Ki Jeong,Tran Minh Quan;Junyoung Choi;Haejin Jeong;Won-Ki Jeong,Ulsan Nat'l Inst. of Science and Technology (UNIST);Ulsan Nat'l Inst. of Science and Technology (UNIST);Ulsan Nat'l Inst. of Science and Technology (UNIST);Ulsan Nat'l Inst. of Science and Technology (UNIST),10.1109/TVCG.2008.162;10.1109/TVCG.2011.261;10.1109/TVCG.2012.231,"Volume Rendering,Machine Learning,Hierarchically Convolutional Sparse Coding",5,4,39,
SciVis,2017,Uncertainty Visualization Using Copula-Based Analysis in Mixed Distribution Models,10.1109/TVCG.2017.2744099,http://dx.doi.org/10.1109/TVCG.2017.2744099,934,943,J,"Distributions are often used to model uncertainty in many scientific datasets. To preserve the correlation among the spatially sampled grid locations in the dataset, various standard multivariate distribution models have been proposed in visualization literature. These models treat each grid location as a univariate random variable which models the uncertainty at that location. Standard multivariate distributions (both parametric and nonparametric) assume that all the univariate marginals are of the same type/family of distribution. But in reality, different grid locations show different statistical behavior which may not be modeled best by the same type of distribution. In this paper, we propose a new multivariate uncertainty modeling strategy to address the needs of uncertainty modeling in scientific datasets. Our proposed method is based on a statistically sound multivariate technique called Copula, which makes it possible to separate the process of estimating the univariate marginals and the process of modeling dependency, unlike the standard multivariate distributions. The modeling flexibility offered by our proposed method makes it possible to design distribution fields which can have different types of distribution (Gaussian, Histogram, KDE etc.) at the grid locations, while maintaining the correlation structure at the same time. Depending on the results of various standard statistical tests, we can choose an optimal distribution representation at each location, resulting in a more cost efficient modeling without significantly sacrificing on the analysis quality. To demonstrate the efficacy of our proposed modeling strategy, we extract and visualize uncertain features like isocontours and vortices in various real world datasets. We also study various modeling criterion to help users in the task of univariate model selection.",Subhashis Hazarika;Ayan Biswas;Han-Wei Shen,Subhashis Hazarika;Ayan Biswas;Han-Wei Shen,Department of Computer Science and EngineeringGRAVITY research groupThe Ohio State University;Los Alamos National Laboratory;Department of Computer Science and EngineeringGRAVITY research groupThe Ohio State University,10.1109/TVCG.2013.208;10.1109/TVCG.2015.2467958;10.1109/TVCG.2016.2598604;10.1109/TVCG.2015.2467436;10.1109/TVCG.2012.249;10.1109/TVCG.2013.143,"Uncertainty visualization,probability distribution,probabilistic feature,statistical modeling,copula",5,6,54,
SciVis,2017,Interactive Dynamic Volume Illumination with Refraction and Caustics,10.1109/TVCG.2017.2744438,http://dx.doi.org/10.1109/TVCG.2017.2744438,984,993,J,"In recent years, significant progress has been made in developing high-quality interactive methods for realistic volume illumination. However, refraction - despite being an important aspect of light propagation in participating media - has so far only received little attention. In this paper, we present a novel approach for refractive volume illumination including caustics capable of interactive frame rates. By interleaving light and viewing ray propagation, our technique avoids memory-intensive storage of illumination information and does not require any precomputation. It is fully dynamic and all parameters such as light position and transfer function can be modified interactively without a performance penalty.",Jens G. Magnus;Stefan Bruckner,Jens G. Magnus;Stefan Bruckner,"University of Bergen, Norway;University of Bergen, Norway",10.1109/TVCG.2014.2346333;10.1109/TVCG.2013.129;10.1109/TVCG.2011.161;10.1109/TVCG.2011.198;10.1109/TVCG.2011.211,"Interactive volume rendering,illumination,refraction,shadows,caustics",5,4,46,
SciVis,2017,Visualization Multi-Pipeline for Communicating Biology,10.1109/TVCG.2017.2744518,http://dx.doi.org/10.1109/TVCG.2017.2744518,883,892,J,"We propose a system to facilitate biology communication by developing a pipeline to support the instructional visualization of heterogeneous biological data on heterogeneous user-devices. Discoveries and concepts in biology are typically summarized with illustrations assembled manually from the interpretation and application of heterogenous data. The creation of such illustrations is time consuming, which makes it incompatible with frequent updates to the measured data as new discoveries are made. Illustrations are typically non-interactive, and when an illustration is updated, it still has to reach the user. Our system is designed to overcome these three obstacles. It supports the integration of heterogeneous datasets, reflecting the knowledge that is gained from different data sources in biology. After pre-processing the datasets, the system transforms them into visual representations as inspired by scientific illustrations. As opposed to traditional scientific illustration these representations are generated in real-time - they are interactive. The code generating the visualizations can be embedded in various software environments. To demonstrate this, we implemented both a desktop application and a remote-rendering server in which the pipeline is embedded. The remote-rendering server supports multi-threaded rendering and it is able to handle multiple users simultaneously. This scalability to different hardware environments, including multi-GPU setups, makes our system useful for efficient public dissemination of biological discoveries.",Peter Mindek;David Kouril;Johannes Sorger;Daniel Toloudis;Blair Lyons;Graham Johnson;M. Eduard Gröller;Ivan Viola,Peter Mindek;David Kouřil;Johannes Sorger;Daniel Toloudis;Blair Lyons;Graham Johnson;M. Eduard Gröller;Ivan Viola,TU Wien;TU Wien;TU Wien;Allen Institute for Cell Science;Allen Institute for Cell Science;Allen Institute for Cell Science;TU Wien;TU Wien,10.1109/VISUAL.2005.1532856;10.1109/VISUAL.2000.885729,"Biological visualization,remote rendering,public dissemination",5,4,33,
SciVis,2017,Globe Browsing: Contextualized Spatio-Temporal Planetary Surface Visualization,10.1109/TVCG.2017.2743958,http://dx.doi.org/10.1109/TVCG.2017.2743958,802,811,J,"Results of planetary mapping are often shared openly for use in scientific research and mission planning. In its raw format, however, the data is not accessible to non-experts due to the difficulty in grasping the context and the intricate acquisition process. We present work on tailoring and integration of multiple data processing and visualization methods to interactively contextualize geospatial surface data of celestial bodies for use in science communication. As our approach handles dynamic data sources, streamed from online repositories, we are significantly shortening the time between discovery and dissemination of data and results. We describe the image acquisition pipeline, the pre-processing steps to derive a 2.5D terrain, and a chunked level-of-detail, out-of-core rendering approach to enable interactive exploration of global maps and high-resolution digital terrain models. The results are demonstrated for three different celestial bodies. The first case addresses high-resolution map data on the surface of Mars. A second case is showing dynamic processes, such as concurrent weather conditions on Earth that require temporal datasets. As a final example we use data from the New Horizons spacecraft which acquired images during a single flyby of Pluto. We visualize the acquisition process as well as the resulting surface data. Our work has been implemented in the OpenSpace software [8], which enables interactive presentations in a range of environments such as immersive dome theaters, interactive touch tables, and virtual reality headsets.",Karl Bladin;Emil Axelsson;Erik Broberg;Carter Emmart;Patric Ljung;Alexander Bock;Anders Ynnerman,Karl Bladin;Emil Axelsson;Erik Broberg;Carter Emmart;Patric Ljung;Alexander Bock;Anders Ynnerman,Link&#x00F6;ping University;Link&#x00F6;ping University;Link&#x00F6;ping University;American Museum of Natural History;Link&#x00F6;ping University;New York UniversityLink&#x00F6;ping University;Link&#x00F6;ping University,10.1109/SciVis.2015.7429503;10.1109/VISUAL.2003.1250366;10.1109/VISUAL.1997.663860,"Astronomical visualization,globe rendering,public dissemination,science communication,space mission visualization",5,8,63,BP
VAST,2017,BiDots: Visual Exploration of Weighted Biclusters,10.1109/TVCG.2017.2744458,http://dx.doi.org/10.1109/TVCG.2017.2744458,195,204,J,"Discovering and analyzing biclusters, i.e., two sets of related entities with close relationships, is a critical task in many real-world applications, such as exploring entity co-occurrences in intelligence analysis, and studying gene expression in bio-informatics. While the output of biclustering techniques can offer some initial low-level insights, visual approaches are required on top of that due to the algorithmic output complexity. This paper proposes a visualization technique, called BiDots, that allows analysts to interactively explore biclusters over multiple domains. BiDots overcomes several limitations of existing bicluster visualizations by encoding biclusters in a more compact and cluster-driven manner. A set of handy interactions is incorporated to support flexible analysis of biclustering results. More importantly, BiDots addresses the cases of weighted biclusters, which has been underexploited in the literature. The design of BiDots is grounded by a set of analytical tasks derived from previous work. We demonstrate its usefulness and effectiveness for exploring computed biclusters with an investigative document analysis task, in which suspicious people and activities are identified from a text corpus.",Jian Zhao 0010;Maoyuan Sun;Francine Chen 0001;Patrick Chiu,Jian Zhao;Maoyuan Sun;Francine Chen;Patrick Chiu,"FX Palo Alto Laboratory;University of Massachusetts, Dartmouth;FX Palo Alto Laboratory;FX Palo Alto Laboratory",10.1109/TVCG.2012.252;10.1109/TVCG.2008.153;10.1109/TVCG.2013.223;10.1109/TVCG.2007.70582;10.1109/VISUAL.1990.146402;10.1109/TVCG.2011.250;10.1109/TVCG.2010.138;10.1109/TVCG.2016.2598831;10.1109/TVCG.2014.2346752;10.1109/VAST.2007.4389006;10.1109/TVCG.2015.2467813;10.1109/TVCG.2014.2346665;10.1109/TVCG.2013.167,"Biclustering,coordinated relationship analysis,visual analytics",5,5,41,
InfoVis,2018,Structure-Based Suggestive Exploration: A New Approach for Effective Exploration of Large Networks,10.1109/TVCG.2018.2865139,http://dx.doi.org/10.1109/TVCG.2018.2865139,555,565,J,"When analyzing a visualized network, users need to explore different sections of the network to gain insight. However, effective exploration of large networks is often a challenge. While various tools are available for users to explore the global and local features of a network, these tools usually require significant interaction activities, such as repetitive navigation actions to follow network nodes and edges. In this paper, we propose a structure-based suggestive exploration approach to support effective exploration of large networks by suggesting appropriate structures upon user request. Encoding nodes with vectorized representations by transforming information of surrounding structures of nodes into a high dimensional space, our approach can identify similar structures within a large network, enable user interaction with multiple similar structures simultaneously, and guide the exploration of unexplored structures. We develop a web-based visual exploration system to incorporate this suggestive exploration approach and compare performances of our approach under different vectorizing methods and networks. We also present the usability and effectiveness of our approach through a controlled user study with two datasets.",Wei Chen 0001;Fangzhou Guo;Dongming Han;Jacheng Pan;Xiaotao Nie;Jiazhi Xia;Xiaolong Zhang,Wei Chen;Fangzhou Guo;Dongming Han;Jacheng Pan;Xiaotao Nie;Jiazhi Xia;Xiaolong Zhang,State Key Lab of CAD and CGZhejiang University;State Key Lab of CAD and CGZhejiang University;State Key Lab of CAD and CGZhejiang University;State Key Lab of CAD and CGZhejiang University;State Key Lab of CAD and CGZhejiang University;Central South University;Pennsylvania State University,10.1109/TVCG.2006.120;10.1109/TVCG.2016.2598958;10.1109/INFVIS.2004.1;10.1109/INFVIS.2005.1532126;10.1109/TVCG.2007.70582;10.1109/TVCG.2006.147;10.1109/TVCG.2008.151;10.1109/TVCG.2017.2743858;10.1109/VAST.2014.7042485;10.1109/TVCG.2017.2744938;10.1109/TVCG.2016.2598831;10.1109/TVCG.2017.2744898;10.1109/TVCG.2017.2745219;10.1109/TVCG.2015.2468078;10.1109/TVCG.2009.108;10.1109/VAST.2009.5333893;10.1109/TVCG.2013.167,"Large Network Exploration,Structure-Based Exploration,Suggestive Exploration",5,5,80,
InfoVis,2018,A Declarative Rendering Model for Multiclass Density Maps,10.1109/TVCG.2018.2865141,http://dx.doi.org/10.1109/TVCG.2018.2865141,470,480,J,"Multiclass maps are scatterplots, multidimensional projections, or thematic geographic maps where data points have a categorical attribute in addition to two quantitative attributes. This categorical attribute is often rendered using shape or color, which does not scale when overplotting occurs. When the number of data points increases, multiclass maps must resort to data aggregation to remain readable. We present multiclass density maps: multiple 2D histograms computed for each of the category values. Multiclass density maps are meant as a building block to improve the expressiveness and scalability of multiclass map visualization. In this article, we first present a short survey of aggregated multiclass maps, mainly from cartography. We then introduce a declarative model-a simple yet expressive JSON grammar associated with visual semantics-that specifies a wide design space of visualizations for multiclass density maps. Our declarative model is expressive and can be efficiently implemented in visualization front-ends such as modern web browsers. Furthermore, it can be reconfigured dynamically to support data exploration tasks without recomputing the raw data. Finally, we demonstrate how our model can be used to reproduce examples from the past and support exploring data at scale.",Jaemin Jo;Frédéric Vernier;Pierre Dragicevic;Jean-Daniel Fekete,Jaemin Jo;Frédéric Vernier;Pierre Dragicevic;Jean-Daniel Fekete,"Seoul National University, Republic of Korea;LIMSICNRSUniv. Paris-SudUniversité Paris-Saclay;Inria;Inria",10.1109/TVCG.2011.185;10.1109/INFVIS.2002.1173156;10.1109/TVCG.2017.2744199;10.1109/TVCG.2007.70623;10.1109/TVCG.2013.179;10.1109/TVCG.2013.130;10.1109/TVCG.2017.2744184;10.1109/TVCG.2016.2599030;10.1109/TVCG.2011.197;10.1109/VISUAL.1993.398863;10.1109/TVCG.2009.175,"Scalability,multiclass scatterplots,density maps,aggregation,declarative specification,visualization grammar",5,9,54,
InfoVis,2018,A Framework for Creative Visualization-Opportunities Workshops,10.1109/TVCG.2018.2865241,http://dx.doi.org/10.1109/TVCG.2018.2865241,748,758,J,"Applied visualization researchers often work closely with domain collaborators to explore new and useful applications of visualization. The early stages of collaborations are typically time consuming for all stakeholders as researchers piece together an understanding of domain challenges from disparate discussions and meetings. A number of recent projects, however, report on the use of creative visualization-opportunities (CVO) workshops to accelerate the early stages of applied work, eliciting a wealth of requirements in a few days of focused work. Yet, there is no established guidance for how to use such workshops effectively. In this paper, we present the results of a 2-year collaboration in which we analyzed the use of 17 workshops in 10 visualization contexts. Its primary contribution is a framework for CVO workshops that: 1) identifies a process model for using workshops; 2) describes a structure of what happens within effective workshops; 3) recommends 25 actionable guidelines for future workshops; and 4) presents an example workshop and workshop methods. The creation of this framework exemplifies the use of critical reflection to learn about visualization in practice from diverse studies and experience.",Ethan Kerzner;Sarah Goodwin;Jason Dykes;Sara Jones 0001;Miriah D. Meyer,Ethan Kerzner;Sarah Goodwin;Jason Dykes;Sara Jones;Miriah Meyer,"University of Utah;Royal Melbourne Institute of TechnologyMonash University;City, University of London;City, University of London;University of Utah",10.1109/TVCG.2010.191;10.1109/TVCG.2013.145;10.1109/TVCG.2016.2598545;10.1109/TVCG.2016.2599338;10.1109/TVCG.2011.209;10.1109/TVCG.2017.2744459;10.1109/TVCG.2014.2346331;10.1109/TVCG.2009.111;10.1109/TVCG.2015.2467271;10.1109/TVCG.2016.2599030;10.1109/TVCG.2012.213;10.1109/TVCG.2013.132;10.1109/TVCG.2015.2467191,"User-centered visualization design,design studies,creativity workshops,critically reflective practice",5,8,90,
SciVis,2018,Persistence Atlas for Critical Point Variability in Ensembles,10.1109/TVCG.2018.2864432,http://dx.doi.org/10.1109/TVCG.2018.2864432,1152,1162,J,"This paper presents a new approach for the visualization and analysis of the spatial variability of features of interest represented by critical points in ensemble data. Our framework, called Persistence Atlas, enables the visualization of the dominant spatial patterns of critical points, along with statistics regarding their occurrence in the ensemble. The persistence atlas represents in the geometrical domain each dominant pattern in the form of a confidence map for the appearance of critical points. As a by-product, our method also provides 2-dimensional layouts of the entire ensemble, highlighting the main trends at a global level. Our approach is based on the new notion of Persistence Map, a measure of the geometrical density in critical points which leverages the robustness to noise of topological persistence to better emphasize salient features. We show how to leverage spectral embedding to represent the ensemble members as points in a low-dimensional Euclidean space, where distances between points measure the dissimilarities between critical point layouts and where statistical tasks, such as clustering, can be easily carried out. Further, we show how the notion of mandatory critical point can be leveraged to evaluate for each cluster confidence regions for the appearance of critical points. Most of the steps of this framework can be trivially parallelized and we show how to efficiently implement them. Extensive experiments demonstrate the relevance of our approach. The accuracy of the confidence regions provided by the persistence atlas is quantitatively evaluated and compared to a baseline strategy using an off-the-shelf clustering approach. We illustrate the importance of the persistence atlas in a variety of real-life datasets, where clear trends in feature layouts are identified and analyzed. We provide a lightweight VTK-based C++ implementation of our approach that can be used for reproduction purposes.",Guillaume Favelier;Noura Faraj;Brian Summa;Julien Tierny,Guillaume Favelier;Noura Faraj;Brian Summa;Julien Tierny,Sorbonne UniversitéCNRS (LIP6);Tulane University;Tulane University;Sorbonne UniversitéCNRS (LIP6),10.1109/TVCG.2013.208;10.1109/TVCG.2015.2467958;10.1109/TVCG.2015.2467204;10.1109/TVCG.2014.2346403;10.1109/TVCG.2008.110;10.1109/TVCG.2015.2467432;10.1109/TVCG.2013.141;10.1109/TVCG.2011.249;10.1109/TVCG.2006.186;10.1109/TVCG.2014.2346455;10.1109/TVCG.2015.2467754;10.1109/TVCG.2010.181;10.1109/VISUAL.1999.809897;10.1109/TVCG.2012.249;10.1109/TVCG.2014.2346332;10.1109/TVCG.2013.143,"Topological data analysis,scalar data,ensemble data",5,4,87,
SciVis,2018,Interactive Visualization of RNA and DNA Structures,10.1109/TVCG.2018.2864507,http://dx.doi.org/10.1109/TVCG.2018.2864507,967,976,J,"The analysis and visualization of nucleic acids (RNA and DNA) is playing an increasingly important role due to their fundamental importance for all forms of life and the growing number of known 3D structures of such molecules. The great complexity of these structures, in particular, those of RNA, demands interactive visualization to get deeper insights into the relationship between the 2D secondary structure motifs and their 3D tertiary structures. Over the last decades, a lot of research in molecular visualization has focused on the visual exploration of protein structures while nucleic acids have only been marginally addressed. In contrast to proteins, which are composed of amino acids, the ingredients of nucleic acids are nucleotides. They form structuring patterns that differ from those of proteins and, hence, also require different visualization and exploration techniques. In order to support interactive exploration of nucleic acids, the computation of secondary structure motifs as well as their visualization in 2D and 3D must be fast. Therefore, in this paper, we focus on the performance of both the computation and visualization of nucleic acid structure. We present a ray casting-based visualization of RNA and DNA secondary and tertiary structures, which enables for the first time real-time visualization of even large molecular dynamics trajectories. Furthermore, we provide a detailed description of all important aspects to visualize nucleic acid secondary and tertiary structures. With this, we close an important gap in molecular visualization.",Norbert Lindow;Daniel Baum;Morgan Leborgne;Hans-Christian Hege,Norbert Lindow;Daniel Baum;Morgan Leborgne;Hans-Christian Hege,"Zuse Institute, Berlin;Zuse Institute, Berlin;Zuse Institute, Berlin;Zuse Institute, Berlin",,"Ribonucleic acids,DNA,RNA,secondary & tertiary structures,interactive rendering,ray casting,brushing & linking",5,2,48,
SciVis,2018,Labels on Levels: Labeling of Multi-Scale Multi-Instance and Crowded 3D Biological Environments,10.1109/TVCG.2018.2864491,http://dx.doi.org/10.1109/TVCG.2018.2864491,977,986,J,"Labeling is intrinsically important for exploring and understanding complex environments and models in a variety of domains. We present a method for interactive labeling of crowded 3D scenes containing very many instances of objects spanning multiple scales in size. In contrast to previous labeling methods, we target cases where many instances of dozens of types are present and where the hierarchical structure of the objects in the scene presents an opportunity to choose the most suitable level for each placed label. Our solution builds on and goes beyond labeling techniques in medical 3D visualization, cartography, and biological illustrations from books and prints. In contrast to these techniques, the main characteristics of our new technique are: 1) a novel way of labeling objects as part of a bigger structure when appropriate, 2) visual clutter reduction by labeling only representative instances for each type of an object, and a strategy of selecting those. The appropriate level of label is chosen by analyzing the scene's depth buffer and the scene objects' hierarchy tree. We address the topic of communicating the parent-children relationship between labels by employing visual hierarchy concepts adapted from graphic design. Selecting representative instances considers several criteria tailored to the character of the data and is combined with a greedy optimization approach. We demonstrate the usage of our method with models from mesoscale biology where these two characteristics-multi-scale and multi-instance-are abundant, along with the fact that these scenes are extraordinarily dense.",David Kouril;Ladislav Cmolík;Barbora Kozlíková;Hsiang-Yun Wu;Graham Johnson;David S. Goodsell;Arthur J. Olson;M. Eduard Gröller;Ivan Viola,David Kouřil;Ladislav Čmolík;Barbora Kozlíková;Hslanc-Yun Wu;Graham Johnson;David S. Goodsell;Arthur Olson;M. Eduard Gröller;Ivan Viola,"TU Wien;Faculty of Electrical Engineering, Czech Technical University, Prague;Masaryk University;TU Wien;Allen Institute for Cell Science;The Scripps Research Institute;The Scripps Research Institute;TU Wien;TU Wien",10.1109/TVCG.2006.136;10.1109/TVCG.2008.168;10.1109/TVCG.2017.2744518,"labeling,multi-scale data,multi-instance data",5,1,54,HM
VAST,2018,iForest: Interpreting Random Forests via Visual Analytics,10.1109/TVCG.2018.2864475,http://dx.doi.org/10.1109/TVCG.2018.2864475,407,416,J,"As an ensemble model that consists of many independent decision trees, random forests generate predictions by feeding the input to internal trees and summarizing their outputs. The ensemble nature of the model helps random forests outperform any individual decision tree. However, it also leads to a poor model interpretability, which significantly hinders the model from being used in fields that require transparent and explainable predictions, such as medical diagnosis and financial fraud detection. The interpretation challenges stem from the variety and complexity of the contained decision trees. Each decision tree has its unique structure and properties, such as the features used in the tree and the feature threshold in each tree node. Thus, a data input may lead to a variety of decision paths. To understand how a final prediction is achieved, it is desired to understand and compare all decision paths in the context of all tree structures, which is a huge challenge for any users. In this paper, we propose a visual analytic system aiming at interpreting random forest models and predictions. In addition to providing users with all the tree information, we summarize the decision paths in random forests, which eventually reflects the working mechanism of the model and reduces users' mental burden of interpretation. To demonstrate the effectiveness of our system, two usage scenarios and a qualitative user study are conducted.",Xun Zhao;Yanhong Wu;Dik Lun Lee;Weiwei Cui,Xun Zhao;Yanhong Wu;Dik Lun Lee;Weiwei Cui,Hong Kong University of Science and Technology;Visa Research;Hong Kong University of Science and Technology;Microsoft Research Asia,10.1109/TVCG.2017.2744378;10.1109/TVCG.2017.2745158;10.1109/VAST.2011.6102453,"Interpretable Machine Learning,Random Forests,Random Forest Visualization,Visual Analytics",5,10,60,
VAST,2018,Analysis of Flight Variability: a Systematic Approach,10.1109/TVCG.2018.2864811,http://dx.doi.org/10.1109/TVCG.2018.2864811,54,64,J,"In movement data analysis, there exists a problem of comparing multiple trajectories of moving objects to common or distinct reference trajectories. We introduce a general conceptual framework for comparative analysis of trajectories and an analytical procedure, which consists of (1) finding corresponding points in pairs of trajectories, (2) computation of pairwise difference measures, and (3) interactive visual analysis of the distributions of the differences with respect to space, time, set of moving objects, trajectory structures, and spatio-temporal context. We propose a combination of visualisation, interaction, and data transformation techniques supporting the analysis and demonstrate the use of our approach for solving a challenging problem from the aviation domain.",Natalia V. Andrienko;Gennady L. Andrienko;Jose Manuel Cordero Garcia;David Scarlatti,Natalia Andrienko;Gennady Andrienko;Jose Manuel Cordero Garcia;David Scarlatti,"Fraunhofer IAISCity, University of London;Fraunhofer IAISCity, University of London;CRIDA (Reference Center for Research, Development and Innovation in ATM);Boeing Research & Development Europe",10.1109/VAST.2008.4677356;10.1109/VAST.2010.5653580;10.1109/TVCG.2017.2744322;10.1109/TVCG.2013.193;10.1109/TVCG.2015.2467851;10.1109/TVCG.2011.233;10.1109/TVCG.2012.265;10.1109/TVCG.2015.2468078,"Visual analytics,movement data,flight trajectories",5,2,55,
VAST,2018,MAQUI: Interweaving Queries and Pattern Mining for Recursive Event Sequence Exploration,10.1109/TVCG.2018.2864886,http://dx.doi.org/10.1109/TVCG.2018.2864886,396,406,J,"Exploring event sequences by defining queries alone or by using mining algorithms alone is often not sufficient to support analysis. Analysts often interweave querying and mining in a recursive manner during event sequence analysis: sequences extracted as query results are used for mining patterns, patterns generated are incorporated into a new query for segmenting the sequences, and the resulting segments are mined or queried again. To support flexible analysis, we propose a framework that describes the process of interwoven querying and mining. Based on this framework, we developed MAQUI, a Mining And Querying User Interface that enables recursive event sequence exploration. To understand the efficacy of MAQUI, we conducted two case studies with domain experts. The findings suggest that the capability of interweaving querying and mining helps the participants articulate their questions and gain novel insights from their data.",Po-Ming Law;Zhicheng Liu;Sana Malik;Rahul C. Basole,Po-Ming Law;Zhicheng Liu;Sana Malik;Rahul C. Basole,Georgia Institute of Technology;Adobe Research;Adobe Research;Georgia Institute of Technology,10.1109/TVCG.2017.2745278;10.1109/TVCG.2017.2745083;10.1109/VAST.2016.7883512;10.1109/VAST.2006.261421;10.1109/TVCG.2017.2744199;10.1109/TVCG.2014.2346682;10.1109/TVCG.2015.2467622;10.1109/TVCG.2014.2346452;10.1109/TVCG.2016.2598797;10.1109/TVCG.2013.200;10.1109/VAST.2015.7347682;10.1109/TVCG.2014.2346574;10.1109/TVCG.2009.117;10.1109/VAST.2009.5332595,"Sequential pattern mining,temporal query,event sequence exploration",5,4,46,
VAST,2018,MotionRugs: Visualizing Collective Trends in Space and Time,10.1109/TVCG.2018.2865049,http://dx.doi.org/10.1109/TVCG.2018.2865049,76,86,J,"Understanding the movement patterns of collectives, such as flocks of birds or fish swarms, is an interesting open research question. The collectives are driven by mutual objectives or react to individual direction changes and external influence factors and stimuli. The challenge in visualizing collective movement data is to show space and time of hundreds of movements at the same time to enable the detection of spatiotemporal patterns. In this paper, we propose MotionRugs, a novel space efficient technique for visualizing moving groups of entities. Building upon established space-partitioning strategies, our approach reduces the spatial dimensions in each time step to a one-dimensional ordered representation of the individual entities. By design, MotionRugs provides an overlap-free, compact overview of the development of group movements over time and thus, enables analysts to visually identify and explore group-specific temporal patterns. We demonstrate the usefulness of our approach in the field of fish swarm analysis and report on initial feedback of domain experts from the field of collective behavior.",Juri Buchmüller;Dominik Jäckle;Eren Cakmak;Ulrik Brandes;Daniel A. Keim,Juri Buchmüller;Dominik Jäckle;Eren Cakmak;Ulrik Brandes;Daniel A. Keim,"University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;ETH Zurich, Switzerland;University of Konstanz, Germany",10.1109/TVCG.2013.193;10.1109/TVCG.2011.226;10.1109/VAST.2009.5332593;10.1109/TVCG.2009.145;10.1109/VAST.2014.7042477;10.1109/TVCG.2006.193;10.1109/TVCG.2013.192;10.1109/TVCG.2008.125;10.1109/TVCG.2012.265,"Spatio-Temporal Visualization,Spatial Abstraction,Spatial Index Structures,Collective Movement",5,4,54,
VAST,2018,Drag and Track: A Direct Manipulation Interface for Contextualizing Data Instances within a Continuous Parameter Space,10.1109/TVCG.2018.2865051,http://dx.doi.org/10.1109/TVCG.2018.2865051,256,266,J,"We present a direct manipulation technique that allows material scientists to interactively highlight relevant parameterized simulation instances located in dimensionally reduced spaces, enabling a user-defined understanding of a continuous parameter space. Our goals are two-fold: first, to build a user-directed intuition of dimensionally reduced data, and second, to provide a mechanism for creatively exploring parameter relationships in parameterized simulation sets, called ensembles. We start by visualizing ensemble data instances in dimensionally reduced scatter plots. To understand these abstract views, we employ user-defined virtual data instances that, through direct manipulation, search an ensemble for similar instances. Users can create multiple of these direct manipulation queries to visually annotate the spaces with sets of highlighted ensemble data instances. User-defined goals are therefore translated into custom illustrations that are projected onto the dimensionally reduced spaces. Combined forward and inverse searches of the parameter space follow naturally allowing for continuous parameter space prediction and visual query comparison in the context of an ensemble. The potential for this visualization technique is confirmed via expert user feedback for a shock physics application and synthetic model analysis.",Daniel Orban;Daniel F. Keefe;Ayan Biswas;James P. Ahrens;David H. Rogers,Daniel Orban;Daniel F. Keefe;Ayan Biswas;James Ahrens;David Rogers,"University of Minnesota, USA;University of Minnesota, USA;Los Alamos National Labs;Los Alamos National Labs;Los Alamos National Labs",10.1109/TVCG.2013.133;10.1109/TVCG.2016.2598869;10.1109/VAST.2012.6400486;10.1109/TVCG.2010.190;10.1109/TVCG.2013.147;10.1109/VAST.2012.6400489;10.1109/TVCG.2015.2467436;10.1109/TVCG.2012.260;10.1109/VAST.2011.6102449;10.1109/TVCG.2015.2467204;10.1109/TVCG.2013.141;10.1109/TVCG.2017.2745178;10.1109/TVCG.2014.2346455;10.1109/TVCG.2016.2598589;10.1109/TVCG.2016.2598495;10.1109/TVCG.2016.2598839;10.1109/TVCG.2014.2346321;10.1109/TVCG.2011.248;10.1109/TVCG.2016.2598830,"Visual Parameter Space Analysis,Ensemble Visualization,Semantic Interaction,Direct Manipulation,Shock Physics",5,4,56,
Vis,1990,Techniques for visualizing 3-dimensional manifolds,10.1109/VISUAL.1990.146400,http://dx.doi.org/10.1109/VISUAL.1990.146400,342,"352, 487-8",C,"Computer graphics has long been concerned with representing and displaying surfaces in three-dimensional space. The author addresses the questions of representation and display in a higher dimensional setting, specifically, that of 3-manifolds immersed in four-dimensional space. The author describes techniques for visualizing the cross-section surfaces of a 3-manifold formed by a cutting hyperplane. The manifold is first triangulated, so that the cross-section may be computed on a per tetrahedron basis. The triangulated manifold is stored in a data structure which efficiently supports calculation of curvature. These techniques have been implemented on Personal IRIS.&lt;&lt;ETX&gt;&gt;",Michael J. Laszlo,M.J. Laszlo,"Dept. of Electr. Eng. & Comput. Sci., Illinois Univ., Chicago, IL, USA",,,4,1,27,
Vis,1990,A graphical interface for robotic remediation of underground storage tanks,10.1109/VISUAL.1990.146419,http://dx.doi.org/10.1109/VISUAL.1990.146419,449,456,C,"Experimental investigations into the application of intelligent robot control technology to the problem of removing waste stored in tanks is discussed. The authors describe the experimental environment used, with particular attention to the hardware and software control environment and the graphical interface. Intelligent system control is achieved through the integration of extensive geometric and kinematic world models with real-time sensor-based control. All operator interactions with the system are through fully animated graphical representations which validate all operator commands before execution to provide for safe operation. Sensing is used to add information to the robot system's world model and to allow sensor-based servo control during selected operations. The results of an initial critical features test are reported, and the potential to apply advanced intelligent control concepts to the removal of waste in storage tanks is discussed.&lt;&lt;ETX&gt;&gt;",Brian K. Christensen;Lisa M. Desjarlais,B.K. Christensen;L.M. Desjarlais,"Sandia Nat. Lab., Albuquerque, NM, USA;Sandia Nat. Lab., Albuquerque, NM, USA",,,4,2,4,
Vis,1991,The electronic structure of oxygen in silicon as revealed by volume visualization of Ab initio calculations,10.1109/VISUAL.1991.175786,http://dx.doi.org/10.1109/VISUAL.1991.175786,109,"115, 415",C,"Volumetric rendering is applied to the interpretation of atomic-scale data generated from quantum molecular dynamics computations. In particular, for silicon computations it is found that volumetric visualization of the computed 3D electronic charge density is a valuable tool for identifying defect states in silicon lattices in which oxygen atoms occur as impurities. Rendering of several judiciously selected ranges of charge density in translucent colors provides an effective means of identifying broken or altered molecular bonds and induced charge excesses in the lattice. The resulting 3D images reveal important features missed previously in 2D charge density contour maps. Stereoscopic 'blink comparison' of image pairs is an extremely valuable way to study the structural differences among various configurations, and animation provides significant insight into the molecular dynamics.&lt;&lt;ETX&gt;&gt;",Robert H. Wolfe;Mark Needels;John D. Joannopoulos,R.H. Wolfe;M. Needels;J.D. Joannopoulos,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA;IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",,,4,3,7,
Vis,1991,Visualizing environmental data for program decision support,10.1109/VISUAL.1991.175838,http://dx.doi.org/10.1109/VISUAL.1991.175838,398,404,C,"The McClellan Air Force Base Installation Restoration Program (IRP), which is responsible for identifying and remedying environmental contamination from past operation and disposal practices, is considered. Since 1979, the IRP has generated over 200 volumes of technical reports regarding the degree and extent of contamination at the base. The base is in the process of automating the storage, retrieval, and analysis of the technical data generated by the cleanup program. The requirements for the IRP technical information system are discussed, the development approach taken is presented, visualization results from the system prototype are illustrated, and future plans for development of the system are outlined.&lt;&lt;ETX&gt;&gt;",J. Burnetti;R. Manley;W. Mitchell;D. Varnadore,J. Burnetti;R. Manley;W. Mitchell;D. Varnadore,"Mitre Corp., McLean, VA, USA;Mitre Corp., McLean, VA, USA;Mitre Corp., McLean, VA, USA",,,4,0,6,
Vis,1992,Flow visualization as a basic tool to investigate the dynamics and topology of jets,10.1109/VISUAL.1992.235212,http://dx.doi.org/10.1109/VISUAL.1992.235212,164,170,C,"Issues and difficulties involved in the practical implementation of flow visualization techniques based on a database generated in numerical simulations of unsteady square jets are addressed. Instantaneous visualizations provide basic information on the topological features of the flow, while animation of these visualizations gives an insight into the detailed dynamics of formation, development, and interaction of the coherent structures controlling the entrainment and mixing processes.&lt;&lt;ETX&gt;&gt;",Fernando Grinstein;Upul Obeysekare;Gopal Patnaik,F.F. Grinstein;U.R. Obeysekare;G. Patnaik,"US Naval Res. Lab., Washington, DC, USA;US Naval Res. Lab., Washington, DC, USA",,,4,3,16,
Vis,1993,A climate simulation case study,10.1109/VISUAL.1993.398900,http://dx.doi.org/10.1109/VISUAL.1993.398900,397,401,C,"A supercomputing-visualization facility for science and engineering applications was used for processing and visualizing supercomputer-generated data. This facility includes a vector-processing supercomputer, a graphics workstation, a general purpose workstation, a high-resolution color printer, a scanner, a film recorder, a video tape recorder, and a video laser disc recorder. The facility is using a network system to connect computers, workstations, and graphical input/output devices. The supercomputer generates time-dependent multivariate data using a global climate simulation model. Visualization software systems are used for visualizing these model-produced data. Visualization techniques including: iso-contouring, iso-surface generation, vectors and streamlines generation are used.&lt;&lt;ETX&gt;&gt;",P. C. Chen,P.C. Chen,"Fujitsu America, Inc., San Jose, CA, USA",,,4,2,4,
Vis,1996,A 3D Contextual Shading Method for Visualization of Diecasting Defects,10.1109/VISUAL.1996.568143,http://doi.ieeecomputersociety.org/10.1109/VISUAL.1996.568143,405,407,C,"In many mechanical design-related activities, the visualization tool needs to convey not only the shape of the objects, but also their interior problem regions. Due to the binary nature of these models, existing shading models often fall short of supporting a realistic display. In this case study, we present several new contextual shading methods that we originally developed for our design visualization tools. The results are then compared with gray-scale shading applied to a gray-level version of the binary object. The comparison shows that our method can be applied to any binary object and yields promising results.",Shao-Chiung Lu;Alec B. Rebello;D. H. Cui;Roni Yagel;R. A. Miller;Gary L. Kinzel,S.C. Lu;A.B. Rebello;D.H. Cui;R. Yagel;R.A. Miller;G.L. Kinzel,"Center for Die Casting, Ohio State Univ., Columbus, OH, USA",,,4,1,0,
Vis,1998,Rear-projecting virtual data onto physical terrain: an exercise in two senses being better than one,10.1109/VISUAL.1998.745341,http://dx.doi.org/10.1109/VISUAL.1998.745341,451,454,C,"This paper describes a project that combined physical model fabrication and virtual computer-based data display to create a unique visualization presentation. USGS terrain information on Prince of Wales Island, Alaska was used to create a physical prototype in SDSC's TeleManufacturing Facility. This model was then used as a mold to create a translucent plate of the terrain. Finally, deforestation data from the island was color mapped and rear-projected onto the translucent plate within a light box. The result is a very compelling display in which both the senses of sight and touch are used to make relationships between terrain features and the data more readily apparent.",Dru Clark;Richard Marciano;Rosemarie McKeon;Michael J. Bailey,D. Clark;R. Marciano;R. McKeon;M. Bailey,"Supercomput. Center, California Univ., San Diego, La Jolla, CA, USA",10.1109/VISUAL.1997.663862,,4,2,5,
Vis,1999,DELTA's Virtual Physics Laboratory: a comprehensive learning platform on physics and astronomy,10.1109/VISUAL.1999.809920,http://dx.doi.org/10.1109/VISUAL.1999.809920,421,423,C,"Perhaps the most effective instrument to simplify and to clarify the comprehension of any complex mathematical or scientific theory is through visualisation. Moreover using interactivity and 3D real time representations, one can easily explore and hence learn quickly in the virtual environments. The concept of virtual and safe laboratories has vast potentials in education. With the aid of computer simulations and 3D visualisations, many dangerous or cumbersome experiments may be implemented in the virtual environments, with rather small effort. Nonetheless visualisation alone is of little use if the respective simulation is not scientifically accurate. Hence a rigorous combination of precise computation as well as sophisticated visualisation, presented through some intuitive user interface is required to realise a virtual laboratory for education. We introduce Delta's Virtual Physics Laboratory, comprising a wide range of applications in the field of physics and astronomy, which can be implemented and used as an interactive learning tool on the World Wide Web.",Sepideh Chakaveh;Udo Zlender;Detlef Skaley;Konstantinos Fostiropoulos;Dieter Breitschwerdt,S. Chakaveh;U. Zlender;D. Skaley;K. Fostiropoulos;D. Breitschwerdt,"IMK-DELTA, Nat. Res. Center for Inf. Technol., St. Augustin, Germany",,,4,2,6,
Vis,2000,An integrated visualization and design toolkit for flexible prosthetic heart valves,10.1109/VISUAL.2000.885730,http://dx.doi.org/10.1109/VISUAL.2000.885730,453,456,C,"We describe a toolkit for the design and visualization of flexible artificial heart valves. The toolkit consists of interlinked modules with a visual programming interface. The user of the toolkit can set the initial geometry and material properties of the valve leaflet, solve for the flexing of the leaflet and the flow of blood around it, and display the results using the visualization capabilities of the toolkit. The interactive nature of our environment is highlighted by the fact that changes in leaflet properties are immediately reflected in the flow field and response of the leaflet. Hence the user may, in a single session, investigate a broad range of designs, each one of which provides important information about the blood flow and motion of the valve during the cardiac cycle.",A. J. Fenlon;T. David;J. P. R. B. Walton,A.J. Fenlon;T. David;J.P.R.B. Walton,"Sch. of Mech. Eng., Leeds Univ., UK",,"Computational fluid dynamics, interactive design, prosthetic heart valves, visualization systems",4,1,20,
InfoVis,2001,Battlespace visualization: a grand challenge,10.1109/INFVIS.2001.963296,http://dx.doi.org/10.1109/INFVIS.2001.963296,169,170,M,,Jeffrey L. Posdamer,J.L. Posdamer;J. Dantone;N. Gershon;J. Dale;T. Hamburger;W. Page,Sarnoff Corporation,,,4,0,0,
Vis,2001,Approximate shading for the re-illumination of synthetic images,10.1109/VISUAL.2001.964535,http://dx.doi.org/10.1109/VISUAL.2001.964535,379,386,C,"Presents a method to estimate illumination dependent properties in image synthesis prior to rendering. A preprocessing step is described in which a linear image basis is developed and a lighting-independent formulation defined. A reflection function, similar to hemispherical reflectance, approximates normal Lambertian shading. Intensity errors resulting from this approximation are reduced by use of a polynomial gamma correction function and scaling to a normalized display range. This produces images that are similar to normal Lambertian shading without employing the maximum (max) function. For a single object view, images can then be expressed in a linear form so that lighting direction can be factored out. During normal rendering, image quantities for arbitrary light directions can be found without rendering. This method is demonstrated for estimating image intensity and level-of-detail error prior to rendering an object.",Randy K. Scoggins;Raghu Machiraju;Robert J. Moorhead II,R. Scoggins;R. Machiraju;R.J. Moorhead,"US Army Eng. R&D Center, Vicksburg, MS, USA",10.1109/VISUAL.1999.809869;10.1109/VISUAL.2000.885691,"rendering, level-of-detail, image metrics, perception",4,1,25,
Vis,2001,Graphical strategies to convey functional relationships in the human brain: a case study,10.1109/VISUAL.2001.964556,http://dx.doi.org/10.1109/VISUAL.2001.964556,481,484,C,"Brain imaging methods used in experimental brain research such as Positron Emission Tomography (PET) and Functional Magnetic Resonance (fMRI) require the analysis of large amounts of data. Exploratory statistical methods can be used to generate new hypotheses and to provide a reliable measure of a given effect. Typically, researchers report their findings by listing those regions which show significant statistical activity in a group of subjects under some experimental condition or task. A number of methods create statistical parametric maps (SPMs) of the brain on a voxel-basis. In our approach statistics are computed not on individual voxels but on predefined anatomical regions-of-interest (ROIs). A correlation coefficient is used to quantify similarity in response for various regions during an experimental setting. Since the functional inter-relationships can become rather complex and spatially widespread, they are best understood in the context of the underlying 3-D brain anatomy. However despite the power of the 3-D model, the relative location of ROIs in 3-D can be obscured due the inherent problem of presenting 3-D spatial information on a 2-D screen. In order to address this problem, we have explored a number of visualization techniques to aid the brain researcher in exploring the spatial relationships of brain activity. In this paper we present a novel 3-D interface that allows the interactive exploration of correlation datasets.",Tomihisa Welsh;Klaus Mueller;Wei Zhu 0008;Nora D. Volkow;Jeffrey Meade,T. Welsh;K. Mueller;Wei Zhu;N. Volkow;J. Meade,"State Univ. of New York, Stony Brook, NY, USA;State Univ. of New York, Stony Brook, NY, USA;State Univ. of New York, Stony Brook, NY, USA;State Univ. of New York, Stony Brook, NY, USA;State Univ. of New York, Stony Brook, NY, USA",,,4,0,12,
Vis,2001,"Semi-immersive space mission design and visualization: case study of the ""Terrestrial Planet Finder"" mission",10.1109/VISUAL.2001.964562,http://dx.doi.org/10.1109/VISUAL.2001.964562,501,504,C,"The paper addresses visualization issues of the Terrestrial Planet Finder Mission (C.A. Beichman et al., 1999). The goal of this mission is to search for chemical signatures of life in distant solar systems using five satellites flying in formation to simulate a large telescope. To design and visually verify such a delicate mission, one has to analyze and interact with many different 3D spacecraft trajectories, which is often difficult in 2D. We employ a novel trajectory design approach using invariant manifold theory, which is best understood and utilized in an immersive setting. The visualization also addresses multi-scale issues related to the vast differences in distance, velocity, and time at different phases of the mission. Additionally, the parameterization and coordinate frames used for numerical simulations may not be suitable for direct visualization. Relative motion presents a more serious problem where the patterns of the trajectories can only be viewed in particular rotating frames. Some of these problems are greatly relieved by using interactive, animated stereo 3D visualization in a semi-immersive environment such as a Responsive Workbench. Others were solved using standard techniques such as a stratify approach with multiple windows to address the multiscale issues, re-parameterizations of trajectories and associated 2D manifolds and relative motion of the camera to ""evoke"" the desired patterns.",Ken Museth;Alan H. Barr;Martin W. Lo,K. Museth;A. Barr;M.W. Lo,"Dept. of Comput. Sci., California Inst. of Technol., Pasadena, CA, USA",,,4,2,7,
InfoVis,2002,Visualizing biosequence data using texture mapping,10.1109/INFVIS.2002.1173154,http://dx.doi.org/10.1109/INFVIS.2002.1173154,103,109,C,"Data-mining of information by the process of pattern discovery in protein sequences has been predominantly algorithm based. We discuss a visualization approach, which uses texture mapping and blending techniques to perform visual data-mining on text data obtained from discovering patterns in protein sequences. This visual approach, investigates the possibilities of representing text data in three dimensions and provides new possibilities of representing more dimensions of information in text data visualization and analysis. We also present a generic framework derived from this visualization approach to visualize text in biosequence data.",Praveen R. Thiagarajan;Guang R. Gao,P.R. Thiagarajan;G.R. Gao,"Biotechnol. Inst., Delaware Univ., Newark, DE, USA;Biotechnol. Inst., Delaware Univ., Newark, DE, USA",10.1109/VISUAL.1998.745322;10.1109/INFVIS.2001.963278,,4,0,20,
InfoVis,2003,Exploding the frame: designing for wall-size computer displays,10.1109/INFVIS.2003.1249002,http://dx.doi.org/10.1109/INFVIS.2003.1249002,7,,M,"High-resolution wall-size digital displays present significant new and different visual space to show and see imagery. The author has been working with two wall-size digital displays at Princeton University for five years and directing and producing IMAX films for a decade, and he has noted some unique design considerations for creating effective visual images when they are spread across entire walls. The author suggests these ""frameless"" screens - where images are so large we need to look around to see the entire field - need different ways of thinking about image design and visualization. Presenting such things as scale and detail take on new meaning when they can be displayed life-size and not shown in the context of one or many small frames such as we see everywhere. These design ideas will be of use for pervasive computing, interface research and design, interactive design, control design, representations of massive data sets, and creating effective displays of data for research and education.",Ben Shedd,B. Shedd,"Princeton Univ., NJ, USA",,,4,0,0,
Vis,2003,Psychophysical scaling of a cardiovascular information display,10.1109/VISUAL.2003.1250352,http://dx.doi.org/10.1109/VISUAL.2003.1250352,35,42,C,"A new method was developed to increase the saliency of changing variables in a cardiovascular visualization for use by anesthesiologists in the operating room (OR). Clinically meaningful changes in patient physiology were identified and then mapped to the inherent psychophysical properties of the visualization. A long history of psychophysical research has provided an understanding of the parameters within which the human information processing system is able to detect changes in the size, shape and color of visual objects (Gescheider, 1976, Spence, 1990, and Baird, 1970). These detection thresholds are known as just noticeable differences (JNDs) which characterize the amount of change in an object's attribute that is recognizable 50% of the time. A prototype version of the display has been demonstrated to facilitate anesthesiologist's performance while reducing cognitive workload during simulated cardiac events (Agutter et al., 2002). In order to further improve the utility of the new cardiovascular visualization, the clinically relevant changes in cardiovascular variables are mapped to noticeable perceptual changes in the representational elements of the display. The results of the method described in this paper are used to merge information from the psychophysical properties of the cardiovascular visualization, with clinically relevant changes in the patient's cardiovascular physiology as measured by the clinical meaningfulness questionnaire. The result of this combination will create a visualization that is sensitive to changes in the cardiovascular health of the patient and communicates this information to the user in a meaningful, salient and intuitive manner.",Robert Albert;Noah Syroid;Yinqi Zhang;James Agutter;Frank Drews;David L. Strayer;George Hutchinson;Dwayne R. Westenskow,R. Albert;N. Syroid;Y. Zhang;J. Agutter;F. Drews;D. Strayer;G. Hutchinson;D. Westenskow,"Appl. Med. Visualizations, West Valley, UT, USA;Appl. Med. Visualizations, West Valley, UT, USA",10.1109/INFVIS.2001.963295,"Psychophysical Scaling, Anesthesia, Patient Vital Sign Monitor",4,1,20,
Vis,2003,Fairing scalar fields by variational modeling of contours,10.1109/VISUAL.2003.1250398,http://dx.doi.org/10.1109/VISUAL.2003.1250398,387,392,C,"Volume rendering and isosurface extraction from three-dimensional scalar fields are mostly based on piecewise trilinear representations. In regions of high geometric complexity such visualization methods often exhibit artifacts, due to trilinear interpolation. In this work, we present an iterative fairing method for scalar fields interpolating function values associated with grid points while smoothing the contours inside the grid cells based on variational principles. We present a local fairing method providing a piecewise bicubic representation of two-dimensional scalar fields. Our algorithm generalizes to the trivariate case and can be used to increase the resolution of data sets either locally or globally, reducing interpolation artifacts. In contrast to filtering methods, our algorithm does not reduce geometric detail supported by the data.",Martin Hering-Bertram,M. Bertram,"Univ. of Kaiserslautern, Germany",,"Contours, Fairing, Variational Modeling",4,3,14,
InfoVis,2004,Capstone Address: Visualization as a Medium for Capturing and Sharing Thoughts,10.1109/INFVIS.2004.13,http://dx.doi.org/10.1109/INFVIS.2004.13,xiii,xiii,M,,Steven F. Roth,S. Roth,"MAYA Viz, Ltd and Carnegi Mellon University",,,4,2,0,
InfoVis,2004,Hypothesis Visualization,10.1109/INFVIS.2004.29,http://dx.doi.org/10.1109/INFVIS.2004.29,4,4,M,"We have constructed an information visualization tool for understanding complex arguments. The tool enables analysts to construct structured arguments using judicial proof techniques, associate evidence with hypotheses, and set evidence parameters such as relevance and credibility. Users manipulate the hypotheses and their associated inference networks using visualization techniques. Our tool integrates concepts from structured argumentation, analysis of competing hypotheses, and hypothesis scoring with information visualization. It presents new metaphors for visualizing and manipulating structured arguments.",Diane Cluxton;Stephen G. Eick;Jie Yun,D. Cluxton;S.G. Eick;Jie Yun,"SSS Research, Inc.",,,4,2,4,
InfoVis,2004,MonkEllipse: Visualizing the History of Information Visualization,10.1109/INFVIS.2004.48,http://dx.doi.org/10.1109/INFVIS.2004.48,r9,r9,M,"In this paper, we describe the process and result of creating a visualization to capture the past 10 years of history in the field of Information Visualization, as part of the annual InfoVis Conference Contest. We began with an XML file containing data provided by the contest organizers, scrubbed and augmented the data, and created a database to hold the information. We designed a visualization and implemented it using Flash MX 2004 Professional with ActionScript 2.0, PHP, and PostgreSQL. The resulting visualization provides an overview of the field of Information Visualization, and allows users to see the connections between areas of the field, particular researchers, and documents.",Tzu-Wei Hsu;Lee Inman;Dave McColgin;Kevin Stamper,Tzu-Wei Hsu;L. Inman;D. McColgin;K. Stamper,Georgia Institute of Technology,,,4,2,4,
InfoVis,2004,Tracking User Interactions Within Visualizations,10.1109/INFVIS.2004.67,http://dx.doi.org/10.1109/INFVIS.2004.67,9,9,M,"We present a model and prototype system for tracking user interactions within a visualization. The history of the interactions are exposed to the user in a way that supports non-linear navigation of the visualization space. The interactions can be augmented with annotations, which, together with the interactions, can be shared with other users and applied to other data in a seamless way. The techniques constitute a novel approach for documenting information provenance.",Dennis P. Groth;Benjamin W. Murphy,D.P. Groth;B.W. Murphy,Indiana University,,,4,1,12,
Vis,2004,Visualizing cortical waves and timing from data,10.1109/VISUAL.2004.121,http://dx.doi.org/10.1109/VISUAL.2004.121,401,408,C,"Waves are a fundamental mechanism for conveying information in many physical problems. Direct visualization techniques are often used to display wave fronts. However, the information derived from such visualizations may not be as central to an investigation as an understanding of how the location, structure and time course of the wave change as key experimental parameters are varied. In experimental data, these questions are confounded by noise and incomplete data. Recognition of waves in networks of neurons is additionally complicated by the presence of long-range physical connections and recurrent excitation. This work applies visual techniques to analyze the structural details of waves in response data from the turtle visual cortex. We emphasize low-cost visualizations that allow comparisons across neural data sets and variables to reconstruct the choreography for a complex response.",Kay A. Robbins;Mark A. Robinson;David M. Senseman,K.A. Robbins;M. Robinson;D.M. Senseman,"Texas Univ., San Antonio, TX, USA;Texas Univ., San Antonio, TX, USA;Texas Univ., San Antonio, TX, USA",10.1109/VISUAL.2001.964493;10.1109/VISUAL.1990.146402;10.1109/VISUAL.2000.885686,"waves, neural networks, PCA, KL decomposition, wave subspaces, flow visualization",4,1,26,
Vis,2004,Volume refinement fairing isosurfaces,10.1109/VISUAL.2004.127,http://dx.doi.org/10.1109/VISUAL.2004.127,449,455,C,We propose an interpolating refinement method for two- and three-dimensional scalar fields defined on hexahedral grids. Iterative fairing of the underlying contours (isosurfaces) provides the function values of new grid points. Our method can be considered as a nonlinear variational subdivision scheme for volumes. It can be applied locally for adaptive mesh refinement in regions of high geometric complexity. We use our scheme to increase the quality of low-resolution data sets and to reduce interpolation artifacts in texture-based volume rendering.,Martin Hering-Bertram,M. Bertram,"TU Kaiserslautern, Germany",10.1109/VISUAL.2003.1250398;10.1109/VISUAL.2003.1250414;10.1109/VISUAL.2003.1250399;10.1109/VISUAL.2000.885721,"adaptive mesh refinement, isosurfaces, sub-division, variational modeling, volume fairing",4,1,17,
Vis,2004,Code Checking and Visualization of an Architecture Design,10.1109/VISUAL.2004.14,http://dx.doi.org/10.1109/VISUAL.2004.14,10,10,M,"Computer graphics has be successfully applied to architecture design. There is more demand to new applications. One of them, to be addressed in this work, is the code checking and visualization of the checking results.",Rong Xu;Wawan Solihin;Zhiyong Huang,Rong Xu;W. Solihin;Zhiyong Huang,National University of Singapore and novaCITYNETS Pte. Ltd.,,,4,0,8,
Vis,2004,Automatic Fast Detection of Tumor Suspect Areas on CT Scan,10.1109/VISUAL.2004.9,http://dx.doi.org/10.1109/VISUAL.2004.9,33,33,M,,Matei Mancas;Bernard Gosselin;Benoît Macq,M. Mancas;B. Gosselin;B. Macq,Polytechnique de Mons,,,4,0,0,
Vis,2005,Exploring 2D tensor fields using stress nets,10.1109/VISUAL.2005.1532771,http://dx.doi.org/10.1109/VISUAL.2005.1532771,11,18,C,"In this article we describe stress nets, a technique for exploring 2D tensor fields. Our method allows a user to examine simultaneously the tensors' eigenvectors (both major and minor) as well as scalar-valued tensor invariants. By avoiding noise-advection techniques, we are able to display both principal directions of the tensor field as well as the derived scalars without cluttering the display. We present a CPU-only implementation of stress nets as well as a hybrid CPU/GPU approach and discuss the relative strengths and weaknesses of each. Stress nets have been used as part of an investigation into crack propagation. They were used to display the directions of maximum shear in a slab of material under tension as well as the magnitude of the shear forces acting on each point. Our methods allowed users to find new features in the data that were not visible on standard plots of tensor invariants. These features disagree with commonly accepted analytical crack propagation solutions and have sparked renewed investigation. Though developed for a materials mechanics problem, our method applies equally well to any 2D tensor field having unique characteristic directions.",Andrew T. Wilson;Rebecca M. Brannon,A. Wilson;R. Brannon,"Sandia Nat. Labs., Albuquerque, NM, USA;Sandia Nat. Labs., Albuquerque, NM, USA",10.1109/VISUAL.1998.745316;10.1109/VISUAL.1992.235193;10.1109/VISUAL.2002.1183799;10.1109/VISUAL.1994.346326;10.1109/VISUAL.1999.809894;10.1109/VISUAL.2000.885690;10.1109/VISUAL.1993.398849,"tensor field, stress tensor, streamlines,controlled density streamlines, crack propagation",4,2,28,
Vis,2006,Composite Rectilinear Deformation for Stretch and Squish Navigation,10.1109/TVCG.2006.127,http://dx.doi.org/10.1109/TVCG.2006.127,901,908,J,"We present the first scalable algorithm that supports the composition of successive rectilinear deformations. Earlier systems that provided stretch and squish navigation could only handle small datasets. More recent work featuring rubber sheet navigation for large datasets has focused on rendering and on application-specific issues. However, no algorithm has yet been presented for carrying out such navigation methods; our paper addresses this problem. For maximum flexibility with large datasets, a stretch and squish navigation algorithm should allow for millions of potentially deformable regions. However, typical usage only changes the extents of a small subset k of these n regions at a time. The challenge is to avoid computations that are linear in n, because a single deformation can affect the absolute screen-space location of every deformable region. We provide an O(klogn) algorithm that supports any application that can lay out a dataset on a generic grid, and show an implementation that allows navigation of trees and gene sequences with millions of items in sub-millisecond time",James Slack;Tamara Munzner,James Slack;Tamara Munzner,Department of Computer Science at the University of British Columbia;Department of Computer Science at the University of British Columbia,10.1109/INFVIS.1997.636786;10.1109/INFVIS.2005.1532127;10.1109/INFVIS.2002.1173156;10.1109/INFVIS.2005.1532127;10.1109/VISUAL.2002.1183791,"Focus+Context, information visualization, real time rendering, navigation",4,1,14,
VAST,2007,InfoVis as Seen by the World Out There: 2007 in Review,10.1109/VAST.2007.4388989,http://dx.doi.org/10.1109/VAST.2007.4388989,x,x,M,"How we as insiders see and understand InfoVis is quite different from how it is seen by most people in the world out there. Most people get only glimpses of what we do, and those glimpses rarely tell the story clearly. Think about the view of InfoVis that has been created in 2007 through marketing, blogs, and articles. This view is peppered with misperception. In this presentation, I'll take you on a tour of InfoVis' exposure in 2007: the highlights and the failures that have shaped the world's perception of our beloved and important work. The world needs what we do, but this need remains largely unsatisfied.",Stephen Few,Stephen Few,"Perceptual Edge, University of California, Berkeley",,,4,1,0,
VAST,2007,Formalizing Analytical Discourse in Visual Analytics,10.1109/VAST.2007.4389025,http://dx.doi.org/10.1109/VAST.2007.4389025,217,218,M,"This paper presents a theory of analytical discourse and a formal model of the intentional structure of visual analytic reasoning process. Our model rests on the theory of collaborative discourse, and allows for cooperative human-machine communication in visual interactive dialogues. Using a sample discourse from a crisis management scenario, we demonstrated the utility of our theory in characterizing the discourse context and collaboration. In particular, we view analytical discourse as plans consisting of complex mental attitude towards analytical tasks and issues. Under this view, human reasoning and computational analysis become integral part of the collaborative plan that evolves through discourse.",Guoray Cai,Guoray Cai,"College of Information Sciences and Technology, Penn State University, University Park, PA. Email: cai@ist.psu.edu",,,4,2,6,
VAST,2007,Intelligence Analysis Using Titan,10.1109/VAST.2007.4389036,http://dx.doi.org/10.1109/VAST.2007.4389036,241,242,M,"The open source Titan informatics toolkit project, which extends the visualization toolkit (VTK) to include information visualization capabilities, is being developed by Sandia National Laboratories in collaboration with Kitware. The VAST Contest provided us with an opportunity to explore various ideas for constructing an analysis tool, while allowing us to exercise our architecture in the solution of a complex problem. As amateur analysts, we found the experience both enlightening and fun.",Patricia Crossno;Brian N. Wylie;Andrew T. Wilson;John A. Greenfield;Eric T. Stanton;Timothy M. Shead;Lisa G. Ice;Kenneth Moreland;Jeffrey Baumes;Berk Geveci,Patricia Crossno;Brian Wylie;Andrew Wilson;John Greenfield;Eric Stanton;Timothy Shead;Lisa Ice;Kenneth Moreland;Jeffrey Baumes;Berk Geveci,Sandia National Laboratories. Email: pjcross@sandia.gov;Sandia National Laboratories. Email: bnwylie@sandia.gov;Sandia National Laboratories. Email: atwilso@sandia.gov;Sandia National Laboratories. Email: jagreen@sandia.gov;Sandia National Laboratories. Email: etstant@sandia.gov;Sandia National Laboratories. Email: tshead@sandia.gov;Sandia National Laboratories. Email: lgice@sandia.gov;Sandia National Laboratories. Email: kmorel@sandia.gov;Kitware Inc. jeff.baumes@kitware.com;Kitware Inc. berk.geveci@kitware.com,,,4,3,3,
VAST,2008,Generating hypotheses of trends in high-dimensional data skeletons,10.1109/VAST.2008.4677367,http://dx.doi.org/10.1109/VAST.2008.4677367,139,146,C,"We seek an information-revealing representation for high-dimensional data distributions that may contain local trends in certain subspaces. Examples are data that have continuous support in simple shapes with identifiable branches. Such data can be represented by a graph that consists of segments of locally fit principal curves or surfaces summarizing each identifiable branch. We describe a new algorithm to find the optimal paths through such a principal graph. The paths are optimal in the sense that they represent the longest smooth trends through the data set, and jointly they cover the data set entirely with minimum overlap. The algorithm is suitable for hypothesizing trends in high-dimensional data, and can assist exploratory data analysis and visualization.",Chandan K. Reddy;Snehal Pokharkar;Tin Kam Ho,Chandan K. Reddy;Snehal Pokharkar;Tin Kam Ho,"Department of Computer Science, Wayne State University, USA;Department of Computer Science, Wayne State University, USA;Bell Labs, Alcatel-Lucent, USA",10.1109/VAST.2007.4388999,,4,3,13,
VAST,2008,Using SocialAction to uncover structure in social networks over time,10.1109/VAST.2008.4677392,http://dx.doi.org/10.1109/VAST.2008.4677392,,,M,"I describe how SocialAction was used to find insights in an evolving social structure VAST Challenge 2008psilas Mini-Challenge 3. This analysis and SocialAction were given the award, ldquoCell Phone Mini Challenge Award: Time Visualizations of Cell Phone Activityrdquo.",Adam Perer,Adam Perer,"Human-Computer Interaction Lab & Department of Computer Science, University of Maryland, USA",,,4,1,3,
InfoVis,2009,SpicyNodes: Radial Layout Authoring for the General Public,10.1109/TVCG.2009.183,http://dx.doi.org/10.1109/TVCG.2009.183,1089,1096,J,"Trees and graphs are relevant to many online tasks such as visualizing social networks, product catalogs, educational portals, digital libraries, the semantic web, concept maps and personalized information management. SpicyNodes is an information-visualization technology that builds upon existing research on radial tree layouts and graph structures. Users can browse a tree, clicking from node to node, as well as successively viewing a node, immediately related nodes and the path back to the ldquohomerdquo nodes. SpicyNodes' layout algorithms maintain balanced layouts using a hybrid mixture of a geometric layout (a succession of spanning radial trees) and force-directed layouts to minimize overlapping nodes, plus several other improvements over prior art. It provides XML-based API and GUI authoring tools. The goal of the SpicyNodes project is to implement familiar principles of radial maps and focus+context with an attractive and inviting look and feel in an open system that is accessible to virtually any Internet user.",Michael Douma;Grzegorz Ligierko;Ovidiu Ancuta;Pavel Gritsai;Sean Liu,Michael Douma;Grzegorz Ligierko;Ovidiu Ancuta;Pavel Gritsai;Sean Liu,IDEA;IDEA;IDEA;IDEA;IDEA,10.1109/INFVIS.2001.963279;10.1109/TVCG.2008.171;10.1109/INFVIS.2003.1249009;10.1109/INFVIS.2004.64,"Trees and network visualization, radial tree layout, information visualization, interaction, focus+context, hierarchy visualization, human-computer interaction",4,3,39,
VAST,2009,Geovisual analytics for self-organizing network data,10.1109/VAST.2009.5332610,http://dx.doi.org/10.1109/VAST.2009.5332610,43,50,C,"Cellular radio networks are continually growing in both node count and complexity. It therefore becomes more difficult to manage the networks and necessary to use time and cost effective automatic algorithms to organize the networks neighbor cell relations. There have been a number of attempts to develop such automatic algorithms. Network operators, however, may not trust them because they need to have an understanding of their behavior and of their reliability and performance, which is not easily perceived. This paper presents a novel Web-enabled geovisual analytics approach to exploration and understanding of self-organizing network data related to cells and neighbor cell relations. A demonstrator and case study are presented in this paper, developed in close collaboration with the Swedish telecom company Ericsson and based on large multivariate, time-varying and geospatial data provided by the company. It allows the operators to follow, interact with and analyze the evolution of a self-organizing network and enhance their understanding of how an automatic algorithm configures locally-unique physical cell identities and organizes neighbor cell relations of the network. The geovisual analytics tool is tested with a self-organizing network that is operated by the automatic neighbor relations (ANR) algorithm. The demonstrator has been tested with positive results by a group of domain experts from Ericsson and will be tested in production.",Ho Van Quan;Tobias Åström;Mikael Jern,Van Quan Ho;Tobias Astrom;Mikael Jern,"National Center for Visual Analytics, Dept. of Science and Technology, Linköping University, Sweden;National Center for Visual Analytics, Dept. of Science and Technology, Linköping University, Sweden;National Center for Visual Analytics, Dept. of Science and Technology, Linköping University, Sweden",10.1109/VISUAL.1999.809930,"Geovisual analytics, visualization, self-organizing network, multi-layer, multi-dimensional, time-varying, geospatial data sets",4,0,22,
VAST,2009,Multiple step social structure analysis with Cytoscape,10.1109/VAST.2009.5333961,http://dx.doi.org/10.1109/VAST.2009.5333961,,,M,Cytoscape is a popular open source tool for biologists to visualize interaction networks. We find that it offers most of the desired functionality for visual analytics on graph data to guide us in the identification of the underlying social structure. We demonstrate its utility in the identification of the social structure in the VAST 2009 Flitter Mini Challenge.,Hao Zhou;Anna A. Shaverdian;H. V. Jagadish;George Michailidis,Hao Zhou;Anna A. Shaverdian;H.V. Jagadish;George Michailidis,"Dept. of Statistics, University of Michigan, USA;Dept. of EECS, University of Michigan, USA;Dept. of EECS, University of Michigan, USA;Dept. of Statistics, University of Michigan, USA",,,4,1,3,
VAST,2009,Detecting and analyzing relationships among anomalies,10.1109/VAST.2009.5334426,http://dx.doi.org/10.1109/VAST.2009.5334426,,,M,"The HRL anomaly analysis tool was developed as part of the IEEE VAST Challenge 2009. One of the tasks involved processing badge and network traffic in order to detect and identify a fictitious embassy employee suspected of leaking information. The tool is designed to assist an analyst in detecting, analyzing, and visualizing anomalies and their relationships. Two key visualizations in our submission present how we identified the suspicious traffic using network visualization and how subsequently we connected that activity to an employee using an alibi table.",David Allen;Tsai-Ching Lu;David J. Huber,David Allen;Tsai-Ching Lu;Dave Huber,"HRL Laboratories, LLC, USA;HRL Laboratories, LLC, USA;HRL Laboratories, LLC, USA",,,4,0,1,
VAST,2009,Integrative visual analytics for suspicious behavior detection,10.1109/VAST.2009.5334430,http://dx.doi.org/10.1109/VAST.2009.5334430,,,M,"In the VAST Challenge 2009 suspicious behavior had to be detected applying visual analytics to heterogeneous data, such as network traffic, social network enriched with geo-spatial attributes, and finally video surveillance data. This paper describes some of the awarded parts from our solution entry.",Peter Bak;Christian Rohrdantz;Svenja Leifert;Christoph Granacher;Stefan Koch;Simon Butscher;Patrick Jungk;Daniel A. Keim,Peter Bak;Christian Rohrdantz;Svenja Leifert;Christoph Granacher;Stefan Koch;Simon Butscher;Patrick Jungk;Daniel A. Keim,"University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany",,,4,0,3,
VAST,2010,ALIDA: Using machine learning for intent discernment in visual analytics interfaces,10.1109/VAST.2010.5650854,http://dx.doi.org/10.1109/VAST.2010.5650854,223,224,M,"In this paper, we introduce ALIDA, an Active Learning Intent Discerning Agent for visual analytics interfaces. As users interact with and explore data in a visual analytics environment they are each developing their own unique analytic process. The goal of ALIDA is to observe and record the human-computer interactions and utilize these observations as a means of supporting user exploration; ALIDA does this by using interaction to make decision about user interest. As such, ALIDA is designed to track the decision history (interactions) of a user. This history is then utilized to enhance the user's decision-making process by allowing the user to return to previously visited search states, as well as providing suggestions of other search states that may be of interest based on past exploration modalities. The agent passes these suggestions (or decisions) back to an interactive visualization prototype, and these suggestions are used to guide the user, either by suggesting searches or changes to the visualization view. Current work has tested ALIDA under the exploration of homonyms for users wishing to explore word linkages within a dictionary. Ongoing work includes using ALIDA to guide users in transfer function design for volume rendering within scientific gateways.",Tera Marie Green;Ross Maciejewski;Steve DiPaola,Tera Marie Green;Ross Maciejewski;Steve DiPaola,School of Interactive Arts &#x002B; Technology - Simon Fraser University;Purdue Visual Analytics Center - Purdue University;School of Interactive Arts &#x002B; Technology - Simon Fraser University,,"artificial intelligence, cognition, intent discernment, volume rendering",4,2,6,
VAST,2010,Data representation and exploration with Geometric Wavelets,10.1109/VAST.2010.5653822,http://dx.doi.org/10.1109/VAST.2010.5653822,243,244,M,"Geometric Wavelets is a new multi-scale data representation technique which is useful for a variety of applications such as data compression, interpretation and anomaly detection. We have developed an interactive visualization with multiple linked views to help users quickly explore data sets and understand this novel construction. Currently the interface is being used by applied mathematicians to view results and gain new insights, speeding methods development.",Eric E. Monson;Guangliang Chen;Rachel Brady;Mauro Maggioni,Eric E. Monson;Guangliang Chen;Rachael Brady;Mauro Maggioni,"Duke Visualization Technology Group;Duke Mathematics;Duke Visualization Technology Group;Duke Mathematics and, Computer Science",,,4,1,7,
VAST,2011,KD-photomap: Exploring photographs in space and time,10.1109/VAST.2011.6102479,http://dx.doi.org/10.1109/VAST.2011.6102479,291,292,M,"KD-photomap is a web-based visual analytics system for browsing collections of geotagged Flickr photographs in search of interesting pictures, places, and events. Spatial filtering of the data is performed through zooming, moving or searching along the map. Temporal filtering is possible through defining time windows using interactive histograms and calendar controls. Information about the number and spatiotemporal distribution of photos captured in an explored area is continuously provided using various visual cues.",Iulian Peca;Haolin Zhi;Katerina Vrotsou;Natalia V. Andrienko;Gennady L. Andrienko,Iulian Peca;Haolin Zhi;Katerina Vrotsou;Natalia Andrienko;Gennady Andrienko,"University of Bonn and Fraunhofer Institute for Intelligent Analysis and Information Systems (IAIS), USA;University of Bonn and Fraunhofer Institute for Intelligent Analysis and Information Systems (IAIS), USA;University of Bonn and Fraunhofer Institute for Intelligent Analysis and Information Systems (IAIS), USA;University of Bonn and Fraunhofer Institute for Intelligent Analysis and Information Systems (IAIS), USA;University of Bonn and Fraunhofer Institute for Intelligent Analysis and Information Systems (IAIS), USA",,,4,3,6,
VAST,2011,"An integrated visualization on network events VAST 2011 mini challenge #2 award: ""Outstanding integrated overview display""",10.1109/VAST.2011.6102493,http://dx.doi.org/10.1109/VAST.2011.6102493,319,321,M,"To visualize security trends for the data set provided by the VAST 2011 Mini Challenge #2 a custom tool has been developed. Open source tools [1,2], web programming languages [4,7] and an open source database [3] has been used to work with the data and create a visualization for security log files containing network security trends. In this paper, the tools and methods used for the analysis are described. The methods include the log synchronization with different timezone and the development of heat maps and parallel coordinates charts. To develop the visualization, Processing and Canvas [4,7] was used.",Walter Marcelo Lamagna,Walter Marcelo Lamagna,"Universidad de Buenos Aires, Master on Datamining and Knowledge Discovery, Spain",,,4,1,8,
SciVis,2013,ManyVis: Multiple Applications in an Integrated Visualization Environment,10.1109/TVCG.2013.174,http://dx.doi.org/10.1109/TVCG.2013.174,2878,2885,J,"As the visualization field matures, an increasing number of general toolkits are developed to cover a broad range of applications. However, no general tool can incorporate the latest capabilities for all possible applications, nor can the user interfaces and workflows be easily adjusted to accommodate all user communities. As a result, users will often chose either substandard solutions presented in familiar, customized tools or assemble a patchwork of individual applications glued through ad-hoc scripts and extensive, manual intervention. Instead, we need the ability to easily and rapidly assemble the best-in-task tools into custom interfaces and workflows to optimally serve any given application community. Unfortunately, creating such meta-applications at the API or SDK level is difficult, time consuming, and often infeasible due to the sheer variety of data models, design philosophies, limits in functionality, and the use of closed commercial systems. In this paper, we present the ManyVis framework which enables custom solutions to be built both rapidly and simply by allowing coordination and communication across existing unrelated applications. ManyVis allows users to combine software tools with complementary characteristics into one virtual application driven by a single, custom-designed interface.",Atul Rungta;Brian Summa;Dogan Demir;Peer-Timo Bremer;Valerio Pascucci,Atul Rungta;Brian Summa;Dogan Demir;Peer-Timo Bremer;Valerio Pascucci,"SCI Institute, University of Utah;SCI Institute, University of Utah;SCI Institute, University of Utah;Lawrence Livermore National Laboratory;SCI Institute, University of Utah",10.1109/TVCG.2007.70552,"Visualization environments, integrated applications, macros, linked views",4,4,40,
VAST,2014,An Integrated Visual Analysis System for Fusing MR Spectroscopy and Multi-Modal Radiology Imaging,10.1109/VAST.2014.7042481,http://dx.doi.org/10.1109/VAST.2014.7042481,53,62,C,"For cancers such as glioblastoma multiforme, there is an increasing interest in defining ""biological target volumes"" (BTV), high tumour-burden regions which may be targeted with dose boosts in radiotherapy. The definition of a BTV requires insight into tumour characteristics going beyond conventionally defined radiological abnormalities and anatomical features. Molecular and biochemical imaging techniques, like positron emission tomography, the use of Magnetic Resonance (MR) Imaging contrast agents or MR Spectroscopy deliver this information and support BTV delineation. MR Spectroscopy Imaging (MRSI) is the only non-invasive technique in this list. Studies with MRSI have shown that voxels with certain metabolic signatures are more susceptible to predict the site of relapse. Nevertheless, the discovery of complex relationships between a high number of different metabolites, anatomical, molecular and functional features is an ongoing topic of research - still lacking appropriate tools supporting a smooth workflow by providing data integration and fusion of MRSI data with other imaging modalities. We present a solution bridging this gap which gives fast and flexible access to all data at once. By integrating a customized visualization of the multi-modal and multi-variate image data with a highly flexible visual analytics (VA) framework, it is for the first time possible to interactively fuse, visualize and explore user defined metabolite relations derived from MRSI in combination with markers delivered by other imaging modalities. Real-world medical cases demonstrate the utility of our solution. By making MRSI data available both in a VA tool and in a multi-modal visualization renderer we can combine insights from each side to arrive at a superior BTV delineation. We also report feedback from domain experts indicating significant positive impact in how this work can improve the understanding of MRSI data and its integration into radiotherapy planning.",Miguel Nunes;Benjamin Rowland;Matthias Schlachter;Soléakhéna Ken;Kresimir Matkovic;Anne Laprie;Katja Bühler,Miguel Nunes;Benjamin Rowland;Matthias Schlachter;Soléakhéna Ken;Kresimir Matkovic;Anne Laprie;Katja Bühler,"VRVis Research Center, Vienna, Austria;Institut Claudius Regaud, Toulouse, France;VRVis Research Center, Vienna, Austria;Institut Claudius Regaud, Toulouse, France;VRVis Research Center, Vienna, Austria;Institut Claudius Regaud, Toulouse, France;VRVis Research Center, Vienna, Austria",10.1109/TVCG.2007.70569;10.1109/TVCG.2013.180;10.1109/TVCG.2010.176,"MR spectroscopy, cancer, brain, visualization, multi-modality data, radiotherapy planning, medical decision support systems",4,4,29,
SciVis,2015,Feature-Based Tensor Field Visualization for Fiber Reinforced Polymers,10.1109/SciVis.2015.7429491,http://dx.doi.org/10.1109/SciVis.2015.7429491,49,56,C,"Virtual testing is an integral part of modern product development in mechanical engineering. Numerical structure simulations allow the computation of local stresses which are given as tensor fields. For homogeneous materials, the tensor information is usually reduced to a scalar field like the von Mises stress. A material-dependent threshold defines the material failure answering the key question of engineers. This leads to a rather simple feature-based visualisation. For composite materials like short fiber reinforced polymers, the situation is much more complex. The material property is determined by the fiber distribution at every position, often described as fiber orientation tensor field. Essentially, the material's ability to cope with stress becomes anisotropic and inhomogeneous. We show how to combine the stress field and the fiber orientation field in such cases, leading to a feature-based visualization of tensor fields for composite materials. The resulting features inform the engineer about potential improvements in the product development.",Valentin Zobel;Markus Stommel;Gerik Scheuermann,Valentin Zobel;Markus Stommel;Gerik Scheuermann,Leipzig University;TU Dortmund University;Leipzig University,10.1109/VISUAL.1994.346326;10.1109/TVCG.2009.184;10.1109/VISUAL.1995.485141;10.1109/TVCG.2010.199;10.1109/VISUAL.2004.105,"tensor visualization, feature-based visualisation, composite materials, structural mechanics",4,3,21,
SciVis,2015,OpenSpace: Public dissemination of space mission profiles,10.1109/SciVis.2015.7429503,http://dx.doi.org/10.1109/SciVis.2015.7429503,141,142,M,This work presents a visualization system and its application to space missions. The system allows the public to disseminate the scientific findings of space craft and gain a greater understanding thereof. Instruments' field-of-views and their measurements are embedded in an accurate 3 dimensional rendering of the solar system to provide context to past measurements or the planning of future events. We tested our system with NASA's New Horizons at the Pluto Pallooza event in New York and will expose it to the greater public on the upcoming July 14th Pluto flyby.,Alexander Bock;Michal Marcinkowski;Joakim Kilby;Carter Emmart;Anders Ynnerman,Alexander Bock;Michal Marcinkowski;Joakim Kilby;Carter Emmart;Anders Ynnerman,"Linköping University;American Museum of Natural History, Linköping University;Linköping University;American Museum of Natural History;Linköping University",,,4,4,7,
SciVis,2015,3D superquadric glyphs for visualizing myocardial motion,10.1109/SciVis.2015.7429504,http://dx.doi.org/10.1109/SciVis.2015.7429504,143,144,M,"Various cardiac diseases can be diagnosed by the analysis of myocardial motion. Relevant biomarkers are radial, longitudinal, and rotational velocities of the cardiac muscle computed locally from MR images. We designed a visual encoding that maps these three attributes to glyph shapes according to a barycentric space formed by 3D superquadric glyphs. The glyphs show aggregated myocardial motion information following the AHA model and are displayed in a respective 3D layout.",Teodora Chitiboi;Mathias Neugebauer;Susanne Schnell;Michael Markl;Lars Linsen,Teodora Chitiboi;Mathias Neugebauer;Susanne Schnell;Michael Markl;Lars Linsen,"FraunhoferMEVIS, Jacobs University Bremen;Fraunhofer MEVIS;Northwestern University;Northwestern University;Jacobs University Bremen",,,4,2,8,
SciVis,2015,Reconstruction and Visualization of Coordinated 3D Cell Migration Based on Optical Flow,10.1109/TVCG.2015.2467291,http://dx.doi.org/10.1109/TVCG.2015.2467291,995,1004,J,"Animal development is marked by the repeated reorganization of cells and cell populations, which ultimately determine form and shape of the growing organism. One of the central questions in developmental biology is to understand precisely how cells reorganize, as well as how and to what extent this reorganization is coordinated. While modern microscopes can record video data for every cell during animal development in 3D+t, analyzing these videos remains a major challenge: reconstruction of comprehensive cell tracks turned out to be very demanding especially with decreasing data quality and increasing cell densities. In this paper, we present an analysis pipeline for coordinated cellular motions in developing embryos based on the optical flow of a series of 3D images. We use numerical integration to reconstruct cellular long-term motions in the optical flow of the video, we take care of data validation, and we derive a LIC-based, dense flow visualization for the resulting pathlines. This approach allows us to handle low video quality such as noisy data or poorly separated cells, and it allows the biologists to get a comprehensive understanding of their data by capturing dynamic growth processes in stills. We validate our methods using three videos of growing fruit fly embryos.",Christopher P. Kappe;Lucas Schutz;Stefan Gunther;Lars Hufnagel;Steffen Lemke;Heike Leitte,Christopher P. Kappe;Lucas Schütz;Stefan Gunther;Lars Hufnagel;Steffen Lemke;Heike Leitte,"IWR, Heidelberg University;COS, Heidelberg University;EMBL, Heidelberg, Germany;EMBL, Heidelberg, Germany;COS, Heidelberg University;IWR, Heidelberg University",10.1109/TVCG.2010.169;10.1109/VISUAL.1996.567784;10.1109/TVCG.2009.190;10.1109/VISUAL.2003.1250364;10.1109/VISUAL.1997.663898;10.1109/VISUAL.2003.1250363,"Cell migration, vector field, 3D, timedependent,LIC, tracking, validation",4,6,56,
SciVis,2015,Multi-field Pattern Matching based on Sparse Feature Sampling,10.1109/TVCG.2015.2467292,http://dx.doi.org/10.1109/TVCG.2015.2467292,807,816,J,"We present an approach to pattern matching in 3D multi-field scalar data. Existing pattern matching algorithms work on single scalar or vector fields only, yet many numerical simulations output multi-field data where only a joint analysis of multiple fields describes the underlying phenomenon fully. Our method takes this into account by bundling information from multiple fields into the description of a pattern. First, we extract a sparse set of features for each 3D scalar field using the 3D SIFT algorithm (Scale-Invariant Feature Transform). This allows for a memory-saving description of prominent features in the data with invariance to translation, rotation, and scaling. Second, the user defines a pattern as a set of SIFT features in multiple fields by e.g. brushing a region of interest. Third, we locate and rank matching patterns in the entire data set. Experiments show that our algorithm is efficient in terms of required memory and computational efforts.",Zhongjie Wang 0001;Hans-Peter Seidel;Tino Weinkauf,Zhongjie Wang;Hans-Peter Seidel;Tino Weinkauf,"MPI for Informatics, Saarbr&#x00FC;cken, Germany;MPI for Informatics, Saarbr&#x00FC;cken, Germany;KTH Royal Institute of Technology, Stockholm, Sweden",10.1109/VISUAL.2003.1250372;10.1109/TVCG.2009.141;10.1109/TVCG.2006.165;10.1109/TVCG.2007.70579;10.1109/TVCG.2014.2346332;10.1109/TVCG.2011.236,"Pattern matching, multi-field visualization",4,5,36,
VAST,2015,Visually and statistically guided imputation of missing values in univariate seasonal time series,10.1109/VAST.2015.7347672,http://dx.doi.org/10.1109/VAST.2015.7347672,189,190,M,"Missing values are a problem in many real world applications, for example failing sensor measurements. For further analysis these missing values need to be imputed. Thus, imputation of such missing values is important in a wide range of applications. We propose a visually and statistically guided imputation approach, that allows applying different imputation techniques to estimate the missing values as well as evaluating and fine tuning the imputation by visual guidance. In our approach we include additional visual information about uncertainty and employ the cyclic structure of time inherent in the data. Including this cyclic structure enables visually judging the adequateness of the estimated values with respect to the uncertainty/error boundaries and according to the patterns of the neighbouring time points in linear and cyclic (e.g., the months of the year) time.",Markus Bögl;Peter Filzmoser;Theresia Gschwandtner;Silvia Miksch;Wolfgang Aigner;Alexander Rind;Tim Lammarsch,M. Bögl;P. Filzmoser;T. Gschwandtner;S. Miksch;W. Aigner;A. Rind;T. Lammarsch,"Vienna University of Technology, Austria;Vienna University of Technology, Austria;Vienna University of Technology, Austria;Vienna University of Technology, Austria;St. Pölten University of Applied Sciences, Germany;St. Pölten University of Applied Sciences, Germany;MODUL University Vienna, Austria",,,4,4,11,
VAST,2015,Visual Analytics for fraud detection and monitoring,10.1109/VAST.2015.7347678,http://dx.doi.org/10.1109/VAST.2015.7347678,201,202,M,"One of the primary concerns of financial institutions is to guarantee security and legitimacy in their services. Being able to detect and avoid fraudulent schemes also enhances the credibility of these institutions. Currently, fraud detection approaches still lack Visual Analytics techniques. We propose a Visual Analytics process that tackles the main challenges in the area of fraud detection.",Roger A. Leite;Theresia Gschwandtner;Silvia Miksch;Erich Gstrein;Johannes Kuntner,Roger A. Leite;Theresia Gschwandtner;Silvia Miksch;Erich Gstrein;Johannes Kuntner,"Vienna University of Technology, Austria;Vienna University of Technology, Austria;Vienna University of Technology, Austria;Erste Group IT, USA;Erste Group IT, USA",,,4,7,7,
InfoVis,2016,Quantifying the Visual Impact of Classification Boundaries in Choropleth Maps,10.1109/TVCG.2016.2598541,http://dx.doi.org/10.1109/TVCG.2016.2598541,371,380,J,"One critical visual task when using choropleth maps is to identify spatial clusters in the data. If spatial units have the same color and are in the same neighborhood, this region can be visually identified as a spatial cluster. However, the choice of classification method used to create the choropleth map determines the visual output. The critical map elements in the classification scheme are those that lie near the classification boundary as those elements could potentially belong to different classes with a slight adjustment of the classification boundary. Thus, these elements have the most potential to impact the visual features (i.e., spatial clusters) that occur in the choropleth map. We present a methodology to enable analysts and designers to identify spatial regions where the visual appearance may be the result of spurious data artifacts. The proposed methodology automatically detects the critical boundary cases that can impact the overall visual presentation of the choropleth map using a classification metric of cluster stability. The map elements that belong to a critical boundary case are then automatically assessed to quantify the visual impact of classification edge effects. Our results demonstrate the impact of boundary elements on the resulting visualization and suggest that special attention should be given to these elements during map design.",Yifan Zhang 0007;Ross Maciejewski,Yifan Zhang;Ross Maciejewski,Arizona State University;Arizona State University,10.1109/VAST.2009.5332584;10.1109/TVCG.2012.233;10.1109/TVCG.2011.197,Choropleth;Classification;Visualization;Geodemographics;Geovisualization,4,9,52,
SciVis,2016,Backward Finite-Time Lyapunov Exponents in Inertial Flows,10.1109/TVCG.2016.2599016,http://dx.doi.org/10.1109/TVCG.2016.2599016,970,979,J,"Inertial particles are finite-sized objects that are carried by fluid flows and in contrast to massless tracer particles they are subject to inertia effects. In unsteady flows, the dynamics of tracer particles have been extensively studied by the extraction of Lagrangian coherent structures (LCS), such as hyperbolic LCS as ridges of the Finite-Time Lyapunov Exponent (FTLE). The extension of the rich LCS framework to inertial particles is currently a hot topic in the CFD literature and is actively under research. Recently, backward FTLE on tracer particles has been shown to correlate with the preferential particle settling of small inertial particles. For larger particles, inertial trajectories may deviate strongly from (massless) tracer trajectories, and thus for a better agreement, backward FTLE should be computed on inertial trajectories directly. Inertial backward integration, however, has not been possible until the recent introduction of the influence curve concept, which - given an observation and an initial velocity - allows to recover all sources of inertial particles as tangent curves of a derived vector field. In this paper, we show that FTLE on the influence curve vector field is in agreement with preferential particle settling and more importantly it is not only valid for small (near-tracer) particles. We further generalize the influence curve concept to general equations of motion in unsteady spatio-velocity phase spaces, which enables backward integration with more general equations of motion. Applying the influence curve concept to tracer particles in the spatio-velocity domain emits streaklines in massless flows as tangent curves of the influence curve vector field. We demonstrate the correlation between inertial backward FTLE and the preferential particle settling in a number of unsteady vector fields",Tobias Günther;Holger Theisel,Tobias Günther;Holger Theisel,"Visual Computing Group, University of Magdeburg;Visual Computing Group, University of Magdeburg",10.1109/TVCG.2007.70551;10.1109/TVCG.2007.70554;10.1109/TVCG.2010.198;10.1109/TVCG.2014.2346415;10.1109/TVCG.2013.128,Inertial particles;finite-time Lyapunov exponents;backward integration;preferential particle settling,4,2,72,
SciVis,2016,Progressive Direct Volume-to-Volume Transformation,10.1109/TVCG.2016.2599042,http://dx.doi.org/10.1109/TVCG.2016.2599042,921,930,J,"We present a novel technique to generate transformations between arbitrary volumes, providing both expressive distances and smooth interpolates. In contrast to conventional morphing or warping approaches, our technique requires no user guidance, intermediate representations (like extracted features), or blending, and imposes no restrictions regarding shape or structure. Our technique operates directly on the volumetric data representation, and while linear programming approaches could solve the underlying problem optimally, their polynomial complexity makes them infeasible for high-resolution volumes. We therefore propose a progressive refinement approach designed for parallel execution that is able to quickly deliver approximate results that are iteratively improved toward the optimum. On this basis, we further present a new approach for the streaming selection of time steps in temporal data that allows for the reconstruction of the full sequence with a user-specified error bound. We finally demonstrate the utility of our technique for different applications, compare our approach against alternatives, and evaluate its characteristics with a variety of different data sets.",Steffen Frey;Thomas Ertl,Steffen Frey;Thomas Ertl,University of Stuttgart;University of Stuttgart,10.1109/TVCG.2008.140;10.1109/TVCG.2012.284;10.1109/VISUAL.1994.346333;10.1109/TVCG.2008.143;10.1109/TVCG.2009.200;10.1109/VISUAL.2002.1183809,Volume transformation;Volume visualization;progressive;automatic;parallel;time-varying data;streaming data,4,5,47,
VAST,2016,SocialBrands: Visual analysis of public perceptions of brands on social media,10.1109/VAST.2016.7883513,http://dx.doi.org/10.1109/VAST.2016.7883513,71,80,C,"Public perceptions of a brand is critical to its performance. While social media has demonstrated a huge potential to shape public perceptions of brands, existing tools are not intuitive and explanatory for domain users to use as they fail to provide a comprehensive analysis framework for perceptions of brands. In this paper, we present SocialBrands, a novel visual analysis tool for brand managers to understand public perceptions of brands on social media. Social-Brands leverages brand personality framework in marketing literature and social computing approaches to compute the personality of brands from three driving factors (user imagery, employee imagery, and official announcement) on social media, and construct an evidence network explaining the association between brand personality and driving factors. These computational results are then integrated with new interactive visualizations to help brand managers understand personality traits and their driving factors. We demonstrate the usefulness and effectiveness of SocialBrands through a series of user studies with brand managers in an enterprise context. Design lessons are also derived from our studies.",Xiaotong Liu;Anbang Xu;Liang Gou;Haibin Liu;Rama Akkiraju;Han-Wei Shen,Xiaotong Liu;Anbang Xu;Liang Gou;Haibin Liu;Rama Akkiraju;Han-Wei Shen,"Ohio State University, United States of America;IBM Research, United States of America;Visa Research, United States of America;IBM Research, United States of America;IBM Research, United States of America;Ohio State University, United States of America",10.1109/TVCG.2014.2346922;10.1109/VAST.2014.7042496;10.1109/TVCG.2013.227;10.1109/TVCG.2012.291;10.1109/TVCG.2010.129;10.1109/TVCG.2013.221;10.1109/INFVIS.2000.885091;10.1109/TVCG.2011.183,,4,3,42,
InfoVis,2017,Structuring Visualization Mock-Ups at the Graphical Level by Dividing the Display Space,10.1109/TVCG.2017.2743998,http://dx.doi.org/10.1109/TVCG.2017.2743998,424,434,J,"Mock-ups are rapid, low fidelity prototypes, that are used in many design-related fields to generate and share ideas. While their creation is supported by many mature methods and tools, surprisingly few are suited for the needs of information visualization. In this article, we introduce a novel approach to creating visualizations mock-ups, based on a dialogue between graphic design and parametric toolkit explorations. Our approach consists in iteratively subdividing the display space, while progressively informing each division with realistic data. We show that a wealth of mock-ups can easily be created using only temporary data attributes, as we wait for more realistic data to become available. We describe the implementation of this approach in a D3-based toolkit, which we use to highlight its generative power, and we discuss the potential for transitioning towards higher fidelity prototypes.",Romain Vuillemot;Jeremy Boy,Romain Vuillemot;Jeremy Boy,"LIRIS, Univ Lyon, &#x00C9;cole Centrale de Lyon, CNRS, UMR5205, France;UN Global Pulse",10.1109/TVCG.2011.185;10.1109/INFVIS.1997.636761;10.1109/TVCG.2010.197;10.1109/TVCG.2008.153;10.1109/TVCG.2013.187;10.1109/TVCG.2013.227;10.1109/TVCG.2013.160;10.1109/TVCG.2013.134;10.1109/VISUAL.1991.175815;10.1109/TVCG.2016.2598620;10.1109/TVCG.2012.229;10.1109/TVCG.2013.191;10.1109/TVCG.2014.2346248;10.1109/TVCG.2014.2346291;10.1109/TVCG.2015.2467271;10.1109/TVCG.2016.2599030;10.1109/TVCG.2006.166;10.1109/INFVIS.2000.885086;10.1109/VISUAL.1993.398859;10.1109/TVCG.2015.2467191,"Design Methodologies,Rapid Prototyping,Graphic Design,Mock-Ups,Toolkit Design",4,1,61,
VAST,2017,Understanding the Relationship Between Interactive Optimisation and Visual Analytics in the Context of Prostate Brachytherapy,10.1109/TVCG.2017.2744418,http://dx.doi.org/10.1109/TVCG.2017.2744418,319,329,J,"The fields of operations research and computer science have long sought to find automatic solver techniques that can find high-quality solutions to difficult real-world optimisation problems. The traditional workflow is to exactly model the problem and then enter this model into a general-purpose “black-box” solver. In practice, however, many problems cannot be solved completely automatically, but require a “human-in-the-loop” to iteratively refine the model and give hints to the solver. In this paper, we explore the parallels between this interactive optimisation workflow and the visual analytics sense-making loop. We assert that interactive optimisation is essentially a visual analytics task and propose a problem-solving loop analogous to the sense-making loop. We explore these ideas through an in-depth analysis of a use-case in prostate brachytherapy, an application where interactive optimisation may be able to provide significant assistance to practitioners in creating prostate cancer treatment plans customised to each patient's tumour characteristics. However, current brachytherapy treatment planning is usually a careful, mostly manual process involving multiple professionals. We developed a prototype interactive optimisation tool for brachytherapy that goes beyond current practice in supporting focal therapy - targeting tumour cells directly rather than simply seeking coverage of the whole prostate gland. We conducted semi-structured interviews, in two stages, with seven radiation oncology professionals in order to establish whether they would prefer to use interactive optimisation for treatment planning and whether such a tool could improve their trust in the novel focal therapy approach and in machine generated solutions to the problem.",Jie Liu;Tim Dwyer;Kim Marriott;Jeremy Millar;Annette Haworth,Jie Liu;Tim Dwyer;Kim Marriott;Jeremy Millar;Annette Haworth,Monash University and Data61;Monash University;Monash University and Data61;Monash University and Alfred Health;University of Sydney,10.1109/TVCG.2009.170;10.1109/TVCG.2010.190;10.1109/TVCG.2013.147;10.1109/TVCG.2016.2598545;10.1109/VAST.2014.7042481;10.1109/TVCG.2014.2346321;10.1109/TVCG.2011.248,"Visual analytics,interactive optimisation,interactive systems and tools,prostate brachytherapy",4,1,49,
VAST,2017,Graphiti: Interactive Specification of Attribute-Based Edges for Network Modeling and Visualization,10.1109/TVCG.2017.2744843,http://dx.doi.org/10.1109/TVCG.2017.2744843,226,235,J,"Network visualizations, often in the form of node-link diagrams, are an effective means to understand relationships between entities, discover entities with interesting characteristics, and to identify clusters. While several existing tools allow users to visualize pre-defined networks, creating these networks from raw data remains a challenging task, often requiring users to program custom scripts or write complex SQL commands. Some existing tools also allow users to both visualize and model networks. Interaction techniques adopted by these tools often assume users know the exact conditions for defining edges in the resulting networks. This assumption may not always hold true, however. In cases where users do not know much about attributes in the dataset or when there are several attributes to choose from, users may not know which attributes they could use to formulate linking conditions. We propose an alternate interaction technique to model networks that allows users to demonstrate to the system a subset of nodes and links they wish to see in the resulting network. The system, in response, recommends conditions that can be used to model networks based on the specified nodes and links. In this paper, we show how such a demonstration-based interaction technique can be used to model networks by employing it in a prototype tool, Graphiti. Through multiple usage scenarios, we show how Graphiti not only allows users to model networks from a tabular dataset but also facilitates updating a pre-defined network with additional edge types.",Arjun Srinivasan;Hyunwoo Park;Alex Endert;Rahul C. Basole,Arjun Srinivasan;Hyunwoo Park;Alex Endert;Rahul C. Basole,Georgia Institute of Technology;The Ohio State University;Georgia Institute of Technology;Georgia Institute of Technology,10.1109/VAST.2006.261429;10.1109/TVCG.2011.185;10.1109/VAST.2011.6102441;10.1109/VAST.2006.261426;10.1109/TVCG.2009.151;10.1109/TVCG.2006.122;10.1109/TVCG.2016.2598839;10.1109/TVCG.2006.166;10.1109/TVCG.2009.108;10.1109/VAST.2010.5652520,"Network modeling,visual analytics,user interaction",4,5,49,
VAST,2017,E-Map: A Visual Analytics Approach for Exploring Significant Event Evolutions in Social Media,10.1109/VAST.2017.8585638,http://dx.doi.org/10.1109/VAST.2017.8585638,36,47,C,"Significant events are often discussed and spread through social media, involving many people. Reposting activities and opinions expressed in social media offer good opportunities to understand the evolution of events. However, the dynamics of reposting activities and the diversity of user comments pose challenges to understand event-related social media data. We propose E-Map, a visual analytics approach that uses map-like visualization tools to help multi-faceted analysis of social media data on a significant event and in-depth understanding of the development of the event. E-Map transforms extracted keywords, messages, and reposting behaviors into map features such as cities, towns, and rivers to build a structured and semantic space for users to explore. It also visualizes complex posting and reposting behaviors as simple trajectories and connections that can be easily followed. By supporting multi-level spatial temporal exploration, E-Map helps to reveal the patterns of event development and key players in an event, disclosing the ways they shape and affect the development of the event. Two cases analysing real-world events confirm the capacities of E-Map in facilitating the analysis of event evolution with social media data.",Siming Chen 0001;Shuai Chen 0001;Lijing Lin;Xiaoru Yuan;Jie Liang 0004;Xiaolong Zhang 0001,Siming Chen;Shuai Chen;Lijing Lin;Xiaoru Yuan;Jie Liang;Xiaolong Zhang,"Key Laboratory of Machine Perception (Ministry of Education) and School of EECS, Peking University, China;Key Laboratory of Machine Perception (Ministry of Education) and School of EECS, Peking University, China;Key Laboratory of Machine Perception (Ministry of Education) and School of EECS, Peking University, China;Key Laboratory of Machine Perception (Ministry of Education) and School of EECS, Peking University, China;Faculty of Engineer and Information Technology, The University of Technology, Sydney, Australia;College of Information Sciences and Technology, Pennsylvania State University, USA",10.1109/VAST.2008.4677356;10.1109/TVCG.2013.186;10.1109/TVCG.2011.185;10.1109/TVCG.2012.291;10.1109/VAST.2012.6400557;10.1109/VAST.2016.7883510;10.1109/TVCG.2015.2467619;10.1109/TVCG.2014.2346433;10.1109/TVCG.2010.129;10.1109/VAST.2012.6400485;10.1109/TVCG.2013.162;10.1109/INFVIS.2005.1532126;10.1109/TVCG.2007.70582;10.1109/TVCG.2016.2598590;10.1109/TVCG.2015.2467554;10.1109/VAST.2015.7347632;10.1109/TVCG.2013.196;10.1109/VAST.2011.6102456;10.1109/TVCG.2016.2598919;10.1109/TVCG.2009.171;10.1109/VAST.2016.7883511;10.1109/TVCG.2015.2467691;10.1109/TVCG.2014.2346920;10.1109/TVCG.2013.221;10.1109/TVCG.2014.2346922;10.1109/VAST.2014.7042496,"Social Media,Event Analysis,Map-like Visual Metaphor,Spatial Temporal Visual Analytics",4,10,63,
VAST,2017,A Visual Analytics System for Optimizing Communications in Massively Parallel Applications,10.1109/VAST.2017.8585646,http://dx.doi.org/10.1109/VAST.2017.8585646,59,70,C,"Current and future supercomputers have tens of thousands of compute nodes interconnected with high-dimensional networks and complex network topologies for improved performance. Application developers are required to write scalable parallel programs in order to achieve high throughput on these machines. Application performance is largely determined by efficient inter-process communication. A common way to analyze and optimize performance is through profiling parallel codes to identify communication bottlenecks. However, understanding gigabytes of profiled at a is not a trivial task. In this paper, we present a visual analytics system for identifying the scalability bottlenecks and improving the communication efficiency of massively parallel applications. Visualization methods used in this system are designed to comprehend large-scale and varied communication patterns on thousands of nodes in complex networks such as the 5D torus and the dragonfly. We also present efficient rerouting and remapping algorithms that can be coupled with our interactive visual analytics design for performance optimization. We demonstrate the utility of our system with several case studies using three benchmark applications on two leading supercomputers. The mapping suggestion from our system led to 38% improvement in hop-bytes for Mini AMR application on 4,096 MPI processes.",Takanori Fujiwara;Preeti Malakar;Khairi Reda;Venkatram Vishwanath;Michael E. Papka;Kwan-Liu Ma,Takanori Fujiwara;Preeti Malakar;Khairi Reda;Venkatram Vishwanath;Michael E. Papka;Kwan-Liu Ma,"University of California, Davis;Argonne National Laboratory;Indiana University-Purdue University Indianapolis;Argonne National Laboratory;Argonne National Laboratory, Northern Illinois University;University of California, Davis",10.1109/INFVIS.2004.1;10.1109/TVCG.2012.286;10.1109/TVCG.2014.2346441,"Supercomputing,parallel communications,performance analysis,visual analytics,communication visualization",4,3,83,
InfoVis,2018,Face to Face: Evaluating Visual Comparison,10.1109/TVCG.2018.2864884,http://dx.doi.org/10.1109/TVCG.2018.2864884,861,871,J,"Data are often viewed as a single set of values, but those values frequently must be compared with another set. The existing evaluations of designs that facilitate these comparisons tend to be based on intuitive reasoning, rather than quantifiable measures. We build on this work with a series of crowdsourced experiments that use low-level perceptual comparison tasks that arise frequently in comparisons within data visualizations (e.g., which value changes the most between the two sets of data?). Participants completed these tasks across a variety of layouts: overlaid, two arrangements of juxtaposed small multiples, mirror-symmetric small multiples, and animated transitions. A staircase procedure sought the difficulty level (e.g., value change delta) that led to equivalent accuracy for each layout. Confirming prior intuition, we observe high levels of performance for overlaid versus standard small multiples. However, we also find performance improvements for both mirror symmetric small multiples and animated transitions. While some results are incongruent with common wisdom in data visualization, they align with previous work in perceptual psychology, and thus have potentially strong implications for visual comparison designs.",Brian D. Ondov;Nicole Jardine;Niklas Elmqvist;Steven Franconeri,Brian Ondov;Nicole Jardine;Niklas Elmqvist;Steven Franconeri,"National Institutes of Health, MD, USA;Northwestern University, Evanston, IL, USA;University of Maryland, College Park, MD, USA;Northwestern University, Evanston, IL, USA",10.1109/TVCG.2017.2744359;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2011.185;10.1109/TVCG.2015.2466971;10.1109/TVCG.2014.2346424;10.1109/TVCG.2017.2744199;10.1109/TVCG.2014.2346979;10.1109/TVCG.2007.70539;10.1109/TVCG.2010.162;10.1109/TVCG.2017.2744198;10.1109/TVCG.2008.125;10.1109/TVCG.2017.2745140;10.1109/INFVIS.2000.885091,"Graphical perception,visual perception,visual comparison,crowdsourced evaluation",4,11,70,
InfoVis,2018,A Framework for Externalizing Implicit Error Using Visualization,10.1109/TVCG.2018.2864913,http://dx.doi.org/10.1109/TVCG.2018.2864913,925,935,J,"This paper presents a framework for externalizing and analyzing expert knowledge about discrepancies in data through the use of visualization. Grounded in an 18-month design study with global health experts, the framework formalizes the notion of data discrepancies as implicit error, both in global health data and more broadly. We use the term implicit error to describe measurement error that is inherent to and pervasive throughout a dataset, but that isn't explicitly accounted for or defined. Instead, implicit error exists in the minds of experts, is mainly qualitative, and is accounted for subjectively during expert interpretation of the data. Externalizing knowledge surrounding implicit error can assist in synchronizing, validating, and enhancing interpretation, and can inform error analysis and mitigation. The framework consists of a description of implicit error components that are important for downstream analysis, along with a process model for externalizing and analyzing implicit error using visualization. As a second contribution, we provide a rich, reflective, and verifiable description of our research process as an exemplar summary toward the ongoing inquiry into ways of increasing the validity and transferability of design study research.",Nina McCurdy;Julie Gerdes;Miriah D. Meyer,Nina Mccurdy;Julie Gerdes;Miriah Meyer,University of UtahSchool of Computing;Texas Tech UniversityCollege of Arts … Sciences;University of UtahSchool of Computing,10.1109/VAST.2011.6102457;10.1109/VAST.2010.5652885;10.1109/TVCG.2017.2743898;10.1109/TVCG.2017.2745240;10.1109/INFVIS.2005.1532134;10.1109/TVCG.2015.2467551;10.1109/VISUAL.2005.1532781;10.1109/TVCG.2007.70577;10.1109/TVCG.2013.132;10.1109/TVCG.2007.70589;10.1109/TVCG.2016.2598543,"implicit error,knowledge externalization,design study",4,8,75,
InfoVis,2018,Juniper: A Tree+Table Approach to Multivariate Graph Visualization,10.1109/TVCG.2018.2865149,http://dx.doi.org/10.1109/TVCG.2018.2865149,544,554,J,"Analyzing large, multivariate graphs is an important problem in many domains, yet such graphs are challenging to visualize. In this paper, we introduce a novel, scalable, tree-table multivariate graph visualization technique, which makes many tasks related to multivariate graph analysis easier to achieve. The core principle we follow is to selectively query for nodes or subgraphs of interest and visualize these subgraphs as a spanning tree of the graph. The tree is laid out linearly, which enables us to juxtapose the nodes with a table visualization where diverse attributes can be shown. We also use this table as an adjacency matrix, so that the resulting technique is a hybrid node-link/adjacency matrix technique. We implement this concept in Juniper and complement it with a set of interaction techniques that enable analysts to dynamically grow, restructure, and aggregate the tree, as well as change the layout or show paths between nodes. We demonstrate the utility of our tool in usage scenarios for different multivariate networks: a bipartite network of scholars, papers, and citation metrics and a multitype network of story characters, places, books, etc.",Carolina Nobre;Marc Streit;Alexander Lex,Carolina Nobre;Marc Streit;Alexander Lex,"University of Utah;Johannes Kepler University, Linz;University of Utah",10.1109/TVCG.2011.247;10.1109/INFVIS.2005.1532126;10.1109/TVCG.2007.70582;10.1109/TVCG.2006.147;10.1109/INFVIS.2003.1249009;10.1109/VISUAL.1991.175815;10.1109/TVCG.2014.2346248;10.1109/TVCG.2017.2744898;10.1109/INFVIS.2000.885091;10.1109/TVCG.2015.2468078;10.1109/TVCG.2014.2346441;10.1109/TVCG.2009.108;10.1109/TVCG.2016.2598885;10.1109/INFVIS.2001.963279,"Multivariate graphs,networks,tree-based graph visualization,adjacency matrix,spanning trees,visualization",4,7,52,
InfoVis,2018,Visualizing Uncertain Tropical Cyclone Predictions using Representative Samples from Ensembles of Forecast Tracks,10.1109/TVCG.2018.2865193,http://dx.doi.org/10.1109/TVCG.2018.2865193,882,891,J,"A common approach to sampling the space of a prediction is the generation of an ensemble of potential outcomes, where the ensemble's distribution reveals the statistical structure of the prediction space. For example, the US National Hurricane Center generates multiple day predictions for a storm's path, size, and wind speed, and then uses a Monte Carlo approach to sample this prediction into a large ensemble of potential storm outcomes. Various forms of summary visualizations are generated from such an ensemble, often using spatial spread to indicate its statistical characteristics. However, studies have shown that changes in the size of such summary glyphs, representing changes in the uncertainty of the prediction, are frequently confounded with other attributes of the phenomenon, such as its size or strength. In addition, simulation ensembles typically encode multivariate information, which can be difficult or confusing to include in a summary display. This problem can be overcome by directly displaying the ensemble as a set of annotated trajectories, however this solution will not be effective if ensembles are densely overdrawn or structurally disorganized. We propose to overcome these difficulties by selectively sampling the original ensemble, constructing a smaller representative and spatially well organized ensemble. This can be drawn directly as a set of paths that implicitly reveals the underlying spatial uncertainty distribution of the prediction. Since this approach does not use a visual channel to encode uncertainty, additional information can more easily be encoded in the display without leading to visual confusion. To demonstrate our argument, we describe the development of a visualization for ensembles of tropical cyclone forecast tracks, explaining how their spatial and temporal predictions, as well as other crucial storm characteristics such as size and intensity, can be clearly revealed. We verify the effectiveness of this visualization approach through a cognitive study exploring how storm damage estimates are affected by the density of tracks drawn, and by the presence or absence of annotating information on storm size and intensity.",Le Liu 0007;Lace M. K. Padilla;Sarah H. Creem-Regehr;Donald H. House,Le Liu;Lace Padilla;Sarah H. Creem-Regehr;Donald H. House,"Magic Weaver Inc., Santa Clara, CA;Department of Psychology, Northwestern University, Evanston, IL;Department of Psychology, University of Utah, Salt Lake City, UT;School of Computing, Clemson University, Clemson, SC",10.1109/TVCG.2017.2743898;10.1109/TVCG.2010.181,"uncertainty visualization,hurricane forecasts,ensemble visualization,ensemble sampling,implicit uncertainty",4,4,32,
InfoVis,2018,NLIZE: A Perturbation-Driven Visual Interrogation Tool for Analyzing and Interpreting Natural Language Inference Models,10.1109/TVCG.2018.2865230,http://dx.doi.org/10.1109/TVCG.2018.2865230,651,660,J,"With the recent advances in deep learning, neural network models have obtained state-of-the-art performances for many linguistic tasks in natural language processing. However, this rapid progress also brings enormous challenges. The opaque nature of a neural network model leads to hard-to-debug-systems and difficult-to-interpret mechanisms. Here, we introduce a visualization system that, through a tight yet flexible integration between visualization elements and the underlying model, allows a user to interrogate the model by perturbing the input, internal state, and prediction while observing changes in other parts of the pipeline. We use the natural language inference problem as an example to illustrate how a perturbation-driven paradigm can help domain experts assess the potential limitation of a model, probe its inner states, and interpret and form hypotheses about fundamental model mechanisms such as attention.",Shusen Liu;Zhimin Li;Tao Li;Vivek Srikumar;Valerio Pascucci;Peer-Timo Bremer,Shusen Liu;Zhimin Li;Tao Li;Vivek Srikumar;Valerio Pascucci;Peer-Timo Bremer,Lawrence Livermore National Laboratory;SCI InstituteUniversity of Utah;School of ComputingUniversity of Utah;School of ComputingUniversity of Utah;SCI InstituteUniversity of Utah;Lawrence Livermore National Laboratory,10.1109/TVCG.2017.2744683;10.1109/TVCG.2017.2744718;10.1109/TVCG.2017.2744938;10.1109/TVCG.2016.2598831;10.1109/TVCG.2017.2745141;10.1109/TVCG.2017.2744358;10.1109/TVCG.2017.2744158;10.1109/VISUAL.2005.1532820;10.1109/TVCG.2017.2744878,"Natural Language Processing,Interpretable Machine Learning,Natural Language Inference,Attention Visualization",4,8,40,
InfoVis,2018,Mitigating the Attraction Effect with Visualizations,10.1109/TVCG.2018.2865233,http://dx.doi.org/10.1109/TVCG.2018.2865233,850,860,J,"Human decisions are prone to biases, and this is no less true for decisions made within data visualizations. Bias mitigation strategies often focus on the person, by educating people about their biases, typically with little success. We focus instead on the system, presenting the first evidence that altering the design of an interactive visualization tool can mitigate a strong bias - the attraction effect. Participants viewed 2D scatterplots where choices between superior alternatives were affected by the placement of other suboptimal points. We found that highlighting the superior alternatives weakened the bias, but did not eliminate it. We then tested an interactive approach where participants completely removed locally dominated points from the view, inspired by the elimination by aspects strategy in the decision-making literature. This approach strongly decreased the bias, leading to a counterintuitive suggestion: tools that allow removing inappropriately salient or distracting data from a view may help lead users to make more rational decisions.",Evanthia Dimara;Gilles Bailly;Anastasia Bezerianos;Steven Franconeri,Evanthia Dimara;Gilles Bailly;Anastasia Bezerianos;Steven Franconeri,ISIR;ISIR;Univ. Paris-Sud & CNRS (LRI)Inria;Northwestern Univ.,10.1109/INFVIS.2005.1532136;10.1109/VAST.2017.8585665;10.1109/INFVIS.1996.559213;10.1109/TVCG.2016.2598594;10.1109/TVCG.2017.2745138;10.1109/TVCG.2013.173;10.1109/VAST.2010.5652880;10.1109/TVCG.2012.199;10.1109/TVCG.2015.2467758;10.1109/TVCG.2016.2598589;10.1109/VISUAL.1992.235203;10.1109/TVCG.2017.2744138;10.1109/VAST.2017.8585669;10.1109/VISUAL.1990.146375;10.1109/TVCG.2010.161;10.1109/TVCG.2007.70515,"Decision making,cognitive bias,bias alleviation,bias mitigation,debiasing,information visualization,attraction effect",4,5,98,
InfoVis,2018,Visualizing Ranges over Time on Mobile Phones: A Task-Based Crowdsourced Evaluation,10.1109/TVCG.2018.2865234,http://dx.doi.org/10.1109/TVCG.2018.2865234,619,629,J,"In the first crowdsourced visualization experiment conducted exclusively on mobile phones, we compare approaches to visualizing ranges over time on small displays. People routinely consume such data via a mobile phone, from temperatures in weather forecasting apps to sleep and blood pressure readings in personal health apps. However, we lack guidance on how to effectively visualize ranges on small displays in the context of different value retrieval and comparison tasks, or with respect to different data characteristics such as periodicity, seasonality, or the cardinality of ranges. Central to our experiment is a comparison between two ways to lay out ranges: a more conventional linear layout strikes a balance between quantitative and chronological scale resolution, while a less conventional radial layout emphasizes the cyclicality of time and may prioritize discrimination between values at its periphery. With results from 87 crowd workers, we found that while participants completed tasks more quickly with linear layouts than with radial ones, there were few differences in terms of error rate between layout conditions. We also found that participants performed similarly with both layouts in tasks that involved comparing superimposed observed and average ranges.",Matthew Brehmer;Bongshin Lee;Petra Isenberg;Eun Kyoung Choe,Matthew Brehmer;Bongshin Lee;Petra Isenberg;Eun Kyoung Choe,"Microsoft Research;Microsoft Research;Inria;The University of Maryland, College Park",10.1109/TVCG.2011.185;10.1109/TVCG.2013.124;10.1109/TVCG.2010.209;10.1109/TVCG.2010.162;10.1109/VAST.2007.4388994,"Evaluation,graphical perception,mobile phones,range visualization,crowdsourcing",4,4,54,
InfoVis,2018,At a Glance: Pixel Approximate Entropy as a Measure of Line Chart Complexity,10.1109/TVCG.2018.2865264,http://dx.doi.org/10.1109/TVCG.2018.2865264,872,881,J,"When inspecting information visualizations under time critical settings, such as emergency response or monitoring the heart rate in a surgery room, the user only has a small amount of time to view the visualization “at a glance”. In these settings, it is important to provide a quantitative measure of the visualization to understand whether or not the visualization is too “complex” to accurately judge at a glance. This paper proposes Pixel Approximate Entropy (PAE), which adapts the approximate entropy statistical measure commonly used to quantify regularity and unpredictability in time-series data, as a measure of visual complexity for line charts. We show that PAE is correlated with user-perceived chart complexity, and that increased chart PAE correlates with reduced judgement accuracy. `We also find that the correlation between PAE values and participants' judgment increases when the user has less time to examine the line charts.",Gabriel Ryan;Abigail Mosca;Remco Chang;Eugene Wu 0002,Gabriel Ryan;Abigail Mosca;Remco Chang;Eugene Wu,Columbia University;Tufts University;Tufts University;Columbia University,10.1109/TVCG.2011.229;10.1109/TVCG.2013.133;10.1109/TVCG.2010.131;10.1109/TVCG.2010.184;10.1109/VAST.2010.5653598;10.1109/TVCG.2007.70594;10.1109/INFVIS.2004.15;10.1109/VAST.2006.261423;10.1109/TVCG.2008.140;10.1109/TVCG.2010.161;10.1109/INFVIS.2005.1532142,"Visualization,Graphical Perception,Entropy,At-a-glance",4,4,69,
InfoVis,2018,Temporal Treemaps: Static Visualization of Evolving Trees,10.1109/TVCG.2018.2865265,http://dx.doi.org/10.1109/TVCG.2018.2865265,534,543,J,"We consider temporally evolving trees with changing topology and data: tree nodes may persist for a time range, merge or split, and the associated data may change. Essentially, one can think of this as a time series of trees with a node correspondence per hierarchy level between consecutive time steps. Existing visualization approaches for such data include animated 2D treemaps, where the dynamically changing layout makes it difficult to observe the data in its entirety. We present a method to visualize this dynamic data in a static, nested, and space-filling visualization. This is based on two major contributions: First, the layout constitutes a graph drawing problem. We approach it for the entire time span at once using a combination of a heuristic and simulated annealing. Second, we propose a rendering that emphasizes the hierarchy through an adaption of the classic cushion treemaps. We showcase the wide range of applicability using data from feature tracking in time-dependent scalar fields, evolution of file system hierarchies, and world population.",Wiebke Köpp;Tino Weinkauf,Wiebke Köpp;Tino Weinkauf,"KTH Royal Institute of Technology, Stockholm, Sweden;KTH Royal Institute of Technology, Stockholm, Sweden",10.1109/INFVIS.2005.1532128;10.1109/TVCG.2011.226;10.1109/TVCG.2008.166;10.1109/TVCG.2014.2346433;10.1109/TVCG.2017.2743959;10.1109/VISUAL.1991.175815;10.1109/TVCG.2013.196;10.1109/INFVIS.2001.963283;10.1109/TVCG.2017.2745140;10.1109/TVCG.2007.70529;10.1109/INFVIS.1999.801860;10.1109/TVCG.2008.163,"Treemaps,Temporal trees",4,4,40,
InfoVis,2018,Design Exposition with Literate Visualization,10.1109/TVCG.2018.2864836,http://dx.doi.org/10.1109/TVCG.2018.2864836,759,768,J,"We propose a new approach to the visualization design and communication process, literate visualization, based upon and extending, Donald Knuth's idea of literate programming. It integrates the process of writing data visualization code with description of the design choices that led to the implementation (design exposition). We develop a model of design exposition characterised by four visualization designer architypes: the evaluator, the autonomist, the didacticist and the rationalist. The model is used to justify the key characteristics of literate visualization: `notebook' documents that integrate live coding input, rendered output and textual narrative; low cost of authoring textual narrative; guidelines to encourage structured visualization design and its documentation. We propose narrative schemas for structuring and validating a wide range of visualization design approaches and models, and branching narratives for capturing alternative designs and design views. We describe a new open source literate visualization environment, litvis, based on a declarative interface to Vega and Vega-Lite through the functional programming language Elm combined with markdown for formatted narrative. We informally assess the approach, its implementation and potential by considering three examples spanning a range of design abstractions: new visualization idioms; validation though visualization algebra; and feminist data visualization. We argue that the rich documentation of the design process provided by literate visualization offers the potential to improve the validity of visualization design and so benefit both academic visualization and visualization practice.",Jo Wood;Alexander Kachkaev;Jason Dykes,Jo Wood;Alexander Kachkaev;Jason Dykes,giCentreCity University of London;giCentreCity University of London;giCentreCity University of London,10.1109/TVCG.2013.145;10.1109/TVCG.2014.2346325;10.1109/TVCG.2017.2744319;10.1109/TVCG.2011.209;10.1109/TVCG.2014.2346331;10.1109/TVCG.2016.2598542;10.1109/TVCG.2009.111;10.1109/TVCG.2015.2467271;10.1109/TVCG.2016.2599030;10.1109/TVCG.2012.213;10.1109/TVCG.2014.2346323,"storytelling,design,literate programming,theory",4,6,41,HM
SciVis,2018,"Details-First, Show Context, Overview Last: Supporting Exploration of Viscous Fingers in Large-Scale Ensemble Simulations",10.1109/TVCG.2018.2864849,http://dx.doi.org/10.1109/TVCG.2018.2864849,1225,1235,J,"Visualization research often seeks designs that first establish an overview of the data, in accordance to the information seeking mantra: “Overview first, zoom and filter, then details on demand”. However, in computational fluid dynamics (CFD), as well as in other domains, there are many situations where such a spatial overview is not relevant or practical for users, for example when the experts already have a good mental overview of the data, or when an analysis of a large overall structure may not be related to the specific, information-driven tasks of users. Using scientific workflow theory and, as a vehicle, the problem of viscous finger evolution, we advocate an alternative model that allows domain experts to explore features of interest first, then explore the context around those features, and finally move to a potentially unfamiliar summarization overview. In a model instantiation, we show how a computational back-end can identify and track over time low-level, small features, then be used to filter the context of those features while controlling the complexity of the visualization, and finally to summarize and compare simulations. We demonstrate the effectiveness of this approach with an online web-based exploration of a total volume of data approaching half a billion seven-dimensional data points, and report supportive feedback provided by domain experts with respect to both the instantiation and the theoretical model.",Timothy Luciani;Andrew Thomas Burks;Cassiano Sugiyama;Jonathan Komperda;G. Elisabeta Marai,Timothy Luciani;Andrew Burks;Cassiano Sugiyama;Jonathan Komperda;G. Elisabeta Marai,"Electronic Visualization Laboratory, University of Illinois, Chicago;Electronic Visualization Laboratory, University of Illinois, Chicago;Favo Urban Agriculture, Brazil;Department of Mechanical & Industrial Engineering, University of Illinois, Chicago;Electronic Visualization Laboratory, University of Illinois, Chicago",10.1109/TVCG.2007.70599;10.1109/TVCG.2014.2346448;10.1109/TVCG.2015.2466838;10.1109/TVCG.2015.2468093;10.1109/TVCG.2009.141;10.1109/TVCG.2011.209;10.1109/TVCG.2017.2744459;10.1109/TVCG.2013.161;10.1109/TVCG.2014.2346744;10.1109/VAST.2006.261451;10.1109/TVCG.2009.111;10.1109/TVCG.2012.213;10.1109/TVCG.2009.108;10.1109/TVCG.2008.140,"theory,visualization design,details-first model,discourse paper,computational fluid dynamics",4,2,72,
SciVis,2018,Visualization of Large Molecular Trajectories,10.1109/TVCG.2018.2864851,http://dx.doi.org/10.1109/TVCG.2018.2864851,987,996,J,"The analysis of protein-ligand interactions is a time-intensive task. Researchers have to analyze multiple physico-chemical properties of the protein at once and combine them to derive conclusions about the protein-ligand interplay. Typically, several charts are inspected, and 3D animations can be played side-by-side to obtain a deeper understanding of the data. With the advances in simulation techniques, larger and larger datasets are available, with up to hundreds of thousands of steps. Unfortunately, such large trajectories are very difficult to investigate with traditional approaches. Therefore, the need for special tools that facilitate inspection of these large trajectories becomes substantial. In this paper, we present a novel system for visual exploration of very large trajectories in an interactive and user-friendly way. Several visualization motifs are automatically derived from the data to give the user the information about interactions between protein and ligand. Our system offers specialized widgets to ease and accelerate data inspection and navigation to interesting parts of the simulation. The system is suitable also for simulations where multiple ligands are involved. We have tested the usefulness of our tool on a set of datasets obtained from protein engineers, and we describe the expert feedback.",David Duran;Pedro Hermosilla;Timo Ropinski;Barbora Kozlíková;Àlvar Vinacua;Pere-Pau Vázquez,David Duran;Pedro Hermosilla;Timo Ropinski;Barbora Kozlíková;Álvar Vinacua;Pere-Pau Vázquez,"ViRVIG Group, UPC, Barcelona;Visual Computing GroupU. Ulm.;Visual Computing GroupU. Ulm.;Masaryk University;ViRVIG Group, UPC, Barcelona;ViRVIG Group, UPC, Barcelona",10.1109/TVCG.2015.2467434;10.1109/VISUAL.2005.1532792;10.1109/TVCG.2016.2598825;10.1109/TVCG.2016.2598797;10.1109/TVCG.2014.2346574;10.1109/TVCG.2012.225,"Molecular visualization,simulation inspection,long trajectories",4,1,43,
VAST,2018,Duet: Helping Data Analysis Novices Conduct Pairwise Comparisons by Minimal Specification,10.1109/TVCG.2018.2864526,http://dx.doi.org/10.1109/TVCG.2018.2864526,427,437,J,"Data analysis novices often encounter barriers in executing low-level operations for pairwise comparisons. They may also run into barriers in interpreting the artifacts (e.g., visualizations) created as a result of the operations. We developed Duet, a visual analysis system designed to help data analysis novices conduct pairwise comparisons by addressing execution and interpretation barriers. To reduce the barriers in executing low-level operations during pairwise comparison, Duet employs minimal specification: when one object group (i.e. a group of records in a data table) is specified, Duet recommends object groups that are similar to or different from the specified one; when two object groups are specified, Duet recommends similar and different attributes between them. To lower the barriers in interpreting its recommendations, Duet explains the recommended groups and attributes using both visualizations and textual descriptions. We conducted a qualitative evaluation with eight participants to understand the effectiveness of Duet. The results suggest that minimal specification is easy to use and Duet's explanations are helpful for interpreting the recommendations despite some usability issues.",Po-Ming Law;Rahul C. Basole;Yanhong Wu,Po-Ming Law;Rahul C. Basole;Yanhong Wu,Georgia Institute of Technology;Georgia Institute of Technology;Visa Research,10.1109/TVCG.2011.188;10.1109/TVCG.2016.2598468;10.1109/VAST.2011.6102435;10.1109/TVCG.2017.2744199;10.1109/TVCG.2010.164;10.1109/TVCG.2017.2744684;10.1109/TVCG.2008.109;10.1109/TVCG.2015.2467195;10.1109/TVCG.2017.2745219;10.1109/TVCG.2015.2467191,"Pairwise comparison,novices,data analysis,automatic insight generation",4,6,51,
VAST,2018,An Interactive Method to Improve Crowdsourced Annotations,10.1109/TVCG.2018.2864843,http://dx.doi.org/10.1109/TVCG.2018.2864843,235,245,J,"In order to effectively infer correct labels from noisy crowdsourced annotations, learning-from-crowds models have introduced expert validation. However, little research has been done on facilitating the validation procedure. In this paper, we propose an interactive method to assist experts in verifying uncertain instance labels and unreliable workers. Given the instance labels and worker reliability inferred from a learning-from-crowds model, candidate instances and workers are selected for expert validation. The influence of verified results is propagated to relevant instances and workers through the learning-from-crowds model. To facilitate the validation of annotations, we have developed a confusion visualization to indicate the confusing classes for further exploration, a constrained projection method to show the uncertain labels in context, and a scatter-plot-based visualization to illustrate worker reliability. The three visualizations are tightly integrated with the learning-from-crowds model to provide an iterative and progressive environment for data validation. Two case studies were conducted that demonstrate our approach offers an efficient method for validating and improving crowdsourced annotations.",Shixia Liu;Changjian Chen;Yafeng Lu;Fang-Xin Ou-Yang;Bin Wang 0021,Shixia Liu;Changjian Chen;Yafeng Lu;Fangxin Ouyang;Bin Wang,School of SoftwareTsinghua University;School of SoftwareTsinghua University;Arizona State University;School of SoftwareTsinghua University;School of SoftwareTsinghua University,10.1109/TVCG.2016.2598592;10.1109/VAST.2014.7042480;10.1109/TVCG.2017.2744818;10.1109/VAST.2016.7883520;10.1109/TVCG.2011.202;10.1109/TVCG.2014.2346594;10.1109/TVCG.2013.212;10.1109/TVCG.2011.239;10.1109/TVCG.2012.277;10.1109/VAST.2012.6400492;10.1109/TVCG.2016.2598445;10.1109/TVCG.2015.2467622;10.1109/TVCG.2015.2467554;10.1109/TVCG.2017.2744938;10.1109/TVCG.2016.2598831;10.1109/TVCG.2017.2744378;10.1109/VAST.2016.7883508;10.1109/TVCG.2009.139;10.1109/TVCG.2016.2598829;10.1109/TVCG.2017.2745078;10.1109/VAST.2014.7042494;10.1109/TVCG.2017.2744685;10.1109/TVCG.2013.164;10.1109/VAST.2016.7883514,"Crowdsourcing,learning-from-crowds,interactive visualization,focus + context",4,7,65,
VAST,2018,Visual Analysis of the Temporal Evolution of Ensemble Forecast Sensitivities,10.1109/TVCG.2018.2864901,http://dx.doi.org/10.1109/TVCG.2018.2864901,98,108,J,"Ensemble sensitivity analysis (ESA) has been established in the atmospheric sciences as a correlation-based approach to determine the sensitivity of a scalar forecast quantity computed by a numerical weather prediction model to changes in another model variable at a different model state. Its applications include determining the origin of forecast errors and placing targeted observations to improve future forecasts. We - a team of visualization scientists and meteorologists - present a visual analysis framework to improve upon current practice of ESA. We support the user in selecting regions to compute a meaningful target forecast quantity by embedding correlation-based grid-point clustering to obtain statistically coherent regions. The evolution of sensitivity features computed via ESA are then traced through time, by integrating a quantitative measure of feature matching into optical-flow-based feature assignment, and displayed by means of a swipe-path showing the geo-spatial evolution of the sensitivities. Visualization of the internal correlation structure of computed features guides the user towards those features robustly predicting a certain weather event. We demonstrate the use of our method by application to real-world 2D and 3D cases that occurred during the 2016 NAWDEX field campaign, showing the interactive generation of hypothesis chains to explore how atmospheric processes sensitive to each other are interrelated.",Alexander Kumpf;Marc Rautenhaus;Michael Riemer;Rüdiger Westermann,Alexander Kumpf;Marc Rautenhaus;Michael Riemer;Rüdiger Westermann,"Computer Graphics & Visualization Group, Technische Universitiit München, Garching, Germany;Computer Graphics & Visualization Group, Technische Universitiit München, Garching, Germany;Universität Hamburg, Regional Computing Center, Hamburg, Germany;Computer Graphics & Visualization Group, Technische Universitiit München, Garching, Germany",10.1109/TVCG.2013.131;10.1109/VISUAL.2004.46;10.1109/TVCG.2017.2743989;10.1109/TVCG.2017.2745178;10.1109/TVCG.2006.165,"Correlation,clustering,tracking,ensemble visualization",4,1,47,
VAST,2018,VIS Author Profiles: Interactive Descriptions of Publication Records Combining Text and Visualization,10.1109/TVCG.2018.2865022,http://dx.doi.org/10.1109/TVCG.2018.2865022,152,161,J,"Publication records and collaboration networks are important for assessing the expertise and experience of researchers. Existing digital libraries show the raw publication lists in author profiles, whereas visualization techniques focus on specific subproblems. Instead, we look at publication records from various perspectives mixing low-level publication data with high-level abstractions and background information. This work presents VIS Author Profiles, a novel approach to generate integrated textual and visual descriptions to highlight patterns in publication records. We leverage template-based natural language generation to summarize notable publication statistics, evolution of research topics, and collaboration relationships. Seamlessly integrated visualizations augment the textual description and are interactively connected with each other and the text. The underlying publication data and detailed explanations of the analysis are available on demand. We compare our approach to existing systems by taking into account information needs of users and demonstrate its usefulness in two realistic application examples.",Shahid Latif;Fabian Beck 0001,Shahid Latif;Fabian Beck,"Paluno, University of Duisburg, Essen, Germany;Paluno, University of Duisburg, Essen, Germany",10.1109/TVCG.2015.2467757;10.1109/TVCG.2012.252;10.1109/TVCG.2014.2346435;10.1109/TVCG.2007.70582;10.1109/VAST.2015.7347632;10.1109/TVCG.2015.2468151;10.1109/TVCG.2013.167,"Natural language generation,document visualization,interactive documents,sparklines,digital libraries",4,5,36,
VAST,2018,Identification of Temporally Varying Areas of Interest in Long-Duration Eye-Tracking Data Sets,10.1109/TVCG.2018.2865042,http://dx.doi.org/10.1109/TVCG.2018.2865042,87,97,J,"Eye-tracking has become an invaluable tool for the analysis of working practices in many technological fields of activity. Typically studies focus on short tasks and use static expected areas of interest (AoI) in the display to explore subjects' behaviour, making the analyst's task quite straightforward. In long-duration studies, where the observations may last several hours over a complete work session, the AoIs may change over time in response to altering workload, emergencies or other variables making the analysis more difficult. This work puts forward a novel method to automatically identify spatial AoIs changing over time through a combination of clustering and cluster merging in the temporal domain. A visual analysis system based on the proposed methods is also presented. Finally, we illustrate our approach within the domain of air traffic control, a complex task sensitive to prevailing conditions over long durations, though it is applicable to other domains such as monitoring of complex systems.",Prithiviraj K. Muthumanickam;Katerina Vrotsou;Aida Nordman;Jimmy Johansson;Matthew Cooper 0001,Prithiviraj K. Muthumanickam;Katerina Vrotsou;Aida Nordman;Jimmy Johansson;Matthew Cooper,Linköping University;Linköping University;Linköping University;Linköping University;Linköping University,10.1109/TVCG.2012.276;10.1109/TVCG.2015.2468091;10.1109/TVCG.2016.2598695;10.1109/TVCG.2013.194;10.1109/TVCG.2017.2743939;10.1109/TVCG.2009.117,"Eye-tracking data,areas of interest,clustering,minimum spanning tree,temporal data,spatio-temporal data",4,4,49,
Vis,1990,Animation techniques for chain-coded objects,10.1109/VISUAL.1990.146366,http://dx.doi.org/10.1109/VISUAL.1990.146366,67,73,C,"The animation of two-dimensional objects in a 2-D planar environment is discussed. The use of chain codes as a boundary representation for 2-D objects undergoing animation is shown to be practical for several typical transformations. Various methods for implementing the transformations are described. Quantized methods transform groups of chain code elements into other groups, while incremental methods construct the transformed chain code element by element. The low cost of quantized methods, which rely on table lookup and minimal arithmetic, are weighed against the increased accuracy offered by incremental methods, which maintain error indicators to ensure minimal differences between ideal and generated chain codes. Methods for scaling, rotation, and elastic deformation of objects based solely on chain code elements are discussed.&lt;&lt;ETX&gt;&gt;",Anthony J. Maeder,A.J. Maeder,"Dept. of Comput. Sci., Monash Univ., Clayton, Vic., Australia",,,3,0,6,
Vis,1990,Visualization of scalar data defined on a structured grid-applications to petroleum research,10.1109/VISUAL.1990.146392,http://dx.doi.org/10.1109/VISUAL.1990.146392,281,"288, 482-3",C,"The authors describe some simple visualization techniques that may be used to explore dynamic three-dimensional scalar fields in an interactive way. Scalar data are assumed to have been already computed, and graphic manipulations are done afterwards on a graphics workstation. Structured grids (finite-difference grids) are used, leading to an easy and fast exploration of the interior of a volume. Smooth animation and simultaneous visualization of two or three scalar fields is described. These methods were tested on various types of data from different fields of petroleum engineering, i.e. oil reservoir simulation, geophysics, geology, and combustion engine simulations.&lt;&lt;ETX&gt;&gt;",J. L. Pajon;V. Bui Tran,J.L. Pajon;V.B. Tran,"Inst. Francais due Petrole, Rueil Malmaison, France;Inst. Francais due Petrole, Rueil Malmaison, France",,,3,0,7,
Vis,1990,Scattered data interpolation tools in a microcomputer visualization environment,10.1109/VISUAL.1990.146396,http://dx.doi.org/10.1109/VISUAL.1990.146396,315,322,C,"A package that can bridge the connection between scattered data sets and the highly structured sets required by graphics algorithms is described. Although export of evaluation data is a necessary capability, it is very important that this package has a fully featured three-dimensional graphics subsystem to interactively guide the researcher toward the final visualization results. At that point the option exists of using more sophisticated and more powerful graphics tools to achieve the desired presentation. The application presented has been designed to effectively meet these needs and to promote the awareness of the value of interpolation tools in visualization. Full details of this design are presented.&lt;&lt;ETX&gt;&gt;",Keith Voegele,K. Voegele,"Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA",,,3,0,14,
Vis,1992,Representing medical images with partitioning trees,10.1109/VISUAL.1992.235214,http://dx.doi.org/10.1109/VISUAL.1992.235214,147,154,C,"The binary space partitioning tree is a method of converting a discrete space representation to a particular continuous space representation. The conversion is accomplished using standard discrete space operators developed for edge detection, followed by a Hough transform to generate candidate hyperplanes that are used to construct the partitioning tree. The result is a segmented and compressed image represented in continuous space suitable for elementary computer vision operations and improved image transmission/storage. Examples of 256*256 medical images for which the compression is estimated to range between 1 and 0.5 b/pixel are given.&lt;&lt;ETX&gt;&gt;",Kalpathi R. Subramanian;Bruce F. Naylor,K.R. Subramanian;B. Naylor,"AT&T Bell Lab., Murray Hill, NJ, USA;AT&T Bell Lab., Murray Hill, NJ, USA",10.1109/VISUAL.1990.146377,,3,2,15,
Vis,1993,Dichromatic color representations for complex display systems,10.1109/VISUAL.1993.398871,http://dx.doi.org/10.1109/VISUAL.1993.398871,212,219,C,"New display technologies have begun to provide more innovative and potentially powerful methods to present information to a viewer. However, many of these techniques struggle to deliver accurate full color. In this paper, we address this difficulty by employing the dichromatic theory of color reflection, which implies that many objects can be rendered accurately using only two primaries. Complex display systems with two primaries can be produced with significantly less work than is required for the traditional three primaries. We discuss methods for selecting objects that can be rendered accurately on two-color displays, and we present our experiments with a two-color display using monochromatic primaries.&lt;&lt;ETX&gt;&gt;",Mark S. Peercy;Lambertus Hesselink,M.S. Peercy;L. Hesselink,"Stanford Univ., CA, USA;Stanford Univ., CA, USA",,,3,0,22,
Vis,1994,Visualization of volcanic ash clouds,10.1109/VISUAL.1994.346290,http://dx.doi.org/10.1109/VISUAL.1994.346290,386,"390, C46",C,"Ash clouds resulting from volcanic eruptions are a serious hazard to aviation safety. In Alaska alone, there are over 40 active volcanoes whose eruptions may affect more than 40,000 flights using the great circle polar routes each year. The clouds are especially problematic because they are invisible to radar and nearly impossible to distinguish from weather clouds. The Arctic Region Supercomputing Center and the Alaska Volcano Observatory have collaborated to develop a system for predicting and visualizing the movement of volcanic ash clouds when an eruption occurs. The output from the model is combined with a digital elevation model to produce a realistic view of the ash cloud which may be examined interactively from any desired point of view at any time during the prediction period. This paper describes the visualization techniques employed in the system and includes a video animation of the 1989 Mount Redoubt eruption which caused complete engine failure on a 747 passenger jet.&lt;&lt;ETX&gt;&gt;",Mitchell Roth;Rick Guritz,M. Roth;R. Guritz,"Arctic Region Supercomput. Center, Alaska Univ., Fairbanks, AK, USA",,,3,0,3,
Vis,1995,Fast normal estimation using surface characteristics,10.1109/VISUAL.1995.480808,http://dx.doi.org/10.1109/VISUAL.1995.480808,159,"166, 449",C,"To visualize the volume data acquired from computation or sampling, it is necessary to estimate normals at the points corresponding to object surfaces. Volume data does not holds the geometric information for the surface comprising points, so it is necessary to calculate normals using local information at each point. The existing normal estimation methods have some problems of estimating incorrect normals at discontinuous, aliased or noisy points. Yagel et al. (1992) solved some of these problems using their context-sensitive method. However, this method requires too much processing time and it loses some information on detailed parts of the object surfaces. This paper proposes the surface-characteristic-sensitive normal estimation method which applies different operators according to characteristics of each surface for the normal calculation. This method has the same advantages of the context-sensitive method, and also some other advantages such as less processing time and the reduction of the information loss on detailed parts.",Byeong-Seok Shin;Yeong-Gil Shin,Byeong Seok Shin;Yeong Gil Shin,"Dept. of Comput. Eng., Seoul Nat. Univ., South Korea",10.1109/VISUAL.1990.146378;10.1109/VISUAL.1993.398848,,3,1,15,
Vis,1995,A visualization tool for studying the development of the moss Physcomitrella patens,10.1109/VISUAL.1995.485153,http://dx.doi.org/10.1109/VISUAL.1995.485153,364,"367, 475",C,"The investigation of mechanisms responsible for the morphogenesis of complex biological organisms is an important area in biology. P. patens is an especially suitable plant for this research because it is a rather simple organism, facilitating its observation, yet it possesses developmental phenomena analogous to those which occur in higher plants, allowing the extrapolation of hypotheses to more complex organisms. The visualization consists of three components: biological data collection, computer-modelling (using L-systems), and model verification. The simulated developmental process is quite realistic and provides an excellent means for verifying the underlying hypotheses of morphogenesis.",F. David Fracchia;Neil W. Ashton,F.D. Fracchia;N.W. Ashton,"Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada",,,3,1,6,
Vis,1995,Flow visualization in a hypersonic fin/ramp flow,10.1109/VISUAL.1995.485156,http://dx.doi.org/10.1109/VISUAL.1995.485156,379,"382, 478",C,"A recent study of a flow detail of an engine intake of future ground to orbit transport systems provided extremely complex data from numerical flow simulation and experimental flow visualization. The data posed a challenging problem to flow visualization, computational flow imaging (CFI), and the comparison of experimental imaging techniques versus computational imaging techniques. Some new visualization techniques have been implemented to provide compact representations of the complex features in the data. It turned out to be most useful to combine various specialized techniques for an icon-like representation of phenomena in a single image in order to study interaction of flow features. Some lessons were learned by simulating experimental visualization techniques on the numerical data.",Hans-Georg Pagendarm;Thomas Gerhold,H.-G. Pagendarm;T. Gerhold,"German Aerosp. Res. Establ., Gottingen, Germany;German Aerosp. Res. Establ., Gottingen, Germany",10.1109/VISUAL.1994.346329;10.1109/VISUAL.1993.398875,,3,2,12,
Vis,1995,Turbulent flow visualization in computational and experimental hydraulics,10.1109/VISUAL.1995.485158,http://dx.doi.org/10.1109/VISUAL.1995.485158,388,"391, 480",C,"Many practical problems in open channel hydraulics that were traditionally investigated in hydraulic model experiments, are nowadays being solved by using computational fluid dynamics. However, in order to interpret computational results, there is a clear preference among scientists and engineers for visualization in analogy with experimental techniques. One such technique, particle tracing, enables a dynamic (Lagrangian) interpretation of a statically (Eulerian) computed vector field. However, quite often the emphasis in particle tracing is only on the mean flow properties, while effects due to dispersion and mixing are often not accounted for. Hence turbulent flow characteristics have to be incorporated in a visualization system for practical hydraulic engineering problems. The particle tracing technique presented in this case study has been specifically developed to combine both mean and fluctuating velocity vectors, thus simulating stochastic perturbations around mean flow conditions. A number of cases are presented that demonstrate the practical applicability of advanced visualization techniques in realistic engineering studies.",Arthur E. Mynett;I. Ari Sadarjoen;A. J. S. Hin,A.E. Mynett;I.A. Sadarjoen;A.J.S. Hin,"Strategic Res. & Dev., Delft Hydraulics, Netherlands",,,3,3,6,
Vis,1996,Breaking the Myth: One Picture is Not (always) Worth a Thousand Words,10.1109/VISUAL.1996.569203,http://dx.doi.org/10.1109/VISUAL.1996.569203,441,443,M,,Robert Braham;F. David Fracchia;Andrew S. Glassner;Barbara Mones-Hattal;Russ Rose;Nahum D. Gershon,N.D. Gershon;N. Gershon;R. Braham;D. Fracchia;A. Glassner;B. Mones-Hattal;R. Rose,The MITRE Corporation,,,3,0,3,
Vis,1997,Instructional software for visualizing optical phenomena,10.1109/VISUAL.1997.663918,http://dx.doi.org/10.1109/VISUAL.1997.663918,447,450,C,"We describe a multidisciplinary effort for creating interactive 3D graphical modules for visualizing optical phenomena. These modules are designed for use in an upper-level undergraduate course. The modules are developed in Open Inventor, which allows them to run under both Unix and Windows. The work is significant in that it applies contemporary interactive 3D visualization techniques to instructional courseware, which represents a considerable advance compared to the current state of the practice.",David C. Banks;John T. Foley;Kiril Vidimce;Ming-Hoe Kiu,D.C. Banks;J.T. Foley;K.N. Vidimce;Ming-Hoe Kiu,"NSF Eng. Res. Center, Mississippi State Univ., MS, USA",,,3,2,8,
Vis,1998,Efficient co-triangulation of large data sets,10.1109/VISUAL.1998.745293,http://dx.doi.org/10.1109/VISUAL.1998.745293,119,126,C,"Presents an efficient algorithm for the reconstruction of a multivariate function from multiple sets of scattered data. Given N sets of scattered data representing N distinct dependent variables that have been sampled independently over a common domain and N error tolerance values, the algorithm constructs a triangulation of the domain of the data and associates multivariate values with the vertices of the triangulation. The resulting linear interpolation of these multivariate values yields a multivariate function, called a co-triangulation, that represents all of the dependent data up to the given error tolerance. A simple iterative algorithm for the construction of a co-triangulation from any number of data sets is presented and analyzed. The main contribution of this paper lies in the description of a highly efficient framework for the realization of this approximation algorithm. While the asymptotic time complexity of the algorithm certainly remains within the theoretical bounds, we demonstrate that it is possible to achieve running times that depend only linearly on the number of data even for very large problems with more than two million samples. This efficient realization of the algorithm uses adapted dynamic data structures and careful caching in an integrated framework.",Henrik Weimer;Joe D. Warren;Jane Troutner;Wendell Wiggins;John Shrout,H. Weimer;J. Warren;J. Troutner;W. Wiggins;J. Shrout,"Rice Univ., Houston, TX, USA",10.1109/VISUAL.1994.346336;10.1109/VISUAL.1996.568124;10.1109/VISUAL.1996.568122,"Delaunay triangulation, scattered data, multidimensional approximation, higher-dimensional approximation, computational geometry, data-structures",3,2,23,
Vis,1998,Development of a multi-source visualization prototype,10.1109/VISUAL.1998.745331,http://dx.doi.org/10.1109/VISUAL.1998.745331,411,414,C,"This case study describes the design and development of VISOR (Visual Integration of Simulated and Observed Results), a tool which supports the visualization and analysis of a wide variety of data relevant to aerospace engineering design. Integrating data from such disparate sources is challenging; overcoming the obstacles results in a powerful tool. The process has also been valuable in exposing requirements for the libraries of reusable software tools for visualization and data analysis being developed at NASA Ames.",Leslie Keely;Samuel P. Uselton,L. Keely;S. Uselton,"NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1997.663911;10.1109/VISUAL.1996.568115;10.1109/VISUAL.1998.745332,,3,2,8,
Vis,1998,Visualization in corneal topography,10.1109/VISUAL.1998.745335,http://dx.doi.org/10.1109/VISUAL.1998.745335,427,430,C,"The anterior surface of the eye ('cornea') is extremely important for good sight. Instruments measuring corneal shape conventionally visualize the surface characteristics by mapping the instantaneous radius of curvature onto a rainbow colour scale. This technique is known to have important drawbacks. Firstly, not corneal shape itself is visualized, but rather second order surface properties. Secondly, the type of colouring produces well documented artifacts. We discuss visualization techniques for a more direct representation of the data. In a three part display, shape deviations are presented as a height surface in one window, height lines superimposed over the input image in another, and a colour mapped representation of the mean normal radius of curvature in a third. With the aid of some typical examples, it is shown that these visualizations are easy to interpret by the physician and overcome the limitations of the conventional techniques.",Frans Vos;Hans J. W. Spoelder,F.M. Vos;H.J.W. Spoelder,"Delft Univ. of Technol., Netherlands",,,3,1,9,
Vis,1998,Configuration space visualization for mechanical design,10.1109/VISUAL.1998.745349,http://dx.doi.org/10.1109/VISUAL.1998.745349,483,486,C,"We are studying difficult geometric problems in computer-aided mechanical design where visualization plays a key role. The research addresses the fundamental design task of contact analysis: deriving the part contacts and the ensuing motion constraints in a mechanical system. We have automated contact analysis of general planar systems via configuration space computation. Configuration space is a geometric representation of rigid-body interaction that encodes quantitative information, such as part motion paths, and qualitative information, such as system failure modes. The configuration space dimension equals the number of degrees of freedom in the system. Three-dimensional spaces are most important, but higher-dimensions are often useful. The qualitative aspects, which relate to the topology of the configuration space, are best understood by visualization. We explain what configuration space is, how it encodes contact information, and what research challenges it poses for visualization.",Elisha Sacks;Leo Joskowicz,E. Sacks;L. Joskowicz,"Purdue Univ., West Lafayette, IN, USA",,,3,1,9,
Vis,1998,Art and Visualization: Oil and Water?,10.1109/VISUAL.1998.745355,http://dx.doi.org/10.1109/VISUAL.1998.745355,507,509,M,,David H. Laidlaw;David Kremers;Felica Frankel;Victoria Interrante;Thomas F. Banchoff,D. Laidlaw;D. Kremers;V. Interrante;F. Frankel;T. Banchoff,University of Minnesota Computer Scientist,,,3,1,2,
Vis,1999,Geo-spatial visualization for situational awareness,10.1109/VISUAL.1999.809925,http://dx.doi.org/10.1109/VISUAL.1999.809925,441,559,C,"Situational awareness applications require a highly detailed geospatial visualization covering a large geographic area. Conventional polygon based terrain modeling would exceed the capacity of current computer rendering. Terrain visualization techniques for a situational awareness application are described in this case study. Visualizing large amounts of terrain data has been achieved using very large texture maps. Sun shading is applied to the terrain texture map to enhance perception of relief features. Perception of submarine positions has been enhanced using a translucent, textured water surface.",Eliot Feibush;Nikhil Gagvani;Daniel Williams,E. Feibush;N. Gagvani;D. Williams,"Sarnoff Corp., Princeton, NJ, USA",,,3,0,12,
Vis,1999,Visualizing Simulated Room Fires,10.1109/VISUAL.1999.809936,http://doi.ieeecomputersociety.org/10.1109/VISUAL.1999.809936,475,478,C,"Recent advances in fire science and computer modeling of fires allow scientists to predict fire growth and spread through structures. In this paper we describe a variety of visualizations of simulated room fires for use by both fire protection engineers and fire suppression personnel. We also introduce the concept of fuzzy visualization, which results from the superposition of data from several separate simulations into a single visualization.",Jayesh Govindarajan;Matthew O. Ward;Jonathan Barnett,J. Govindarajan;M. Ward;J. Barnett,"Dept. of Comput. Sci., Worcester Polytech. Inst., MA, USA",10.1109/VISUAL.1994.346291;10.1109/VISUAL.1990.146392;10.1109/VISUAL.1993.398899;10.1109/VISUAL.1996.568110;10.1109/VISUAL.1995.480818,,3,1,0,
Vis,2000,Real-time visualization of the clear-up of a former US naval base,10.1109/VISUAL.2000.885743,http://dx.doi.org/10.1109/VISUAL.2000.885743,505,508,C,"The paper describes the effective real-time visualization of the clear-up operation of a former US nuclear submarine base, located in Holy Loch, Scotland. The Whole Field Modelling System has provided an extremely accurate real-time visualization of a large number of varying parameters such as remotely operated vehicles, cranes, barges, grabs, magnets, and detailed seabed topography. The system has improved the field staffs' spatial and temporal awareness of the underwater environment and facilitated decision-making within the complex offshore working environment.",Paul Chapman;Derek Wills;Peter Stevens;Graham R. Brookes,P. Chapman;D. Wills;P. Stevens;G. Brookes,"Sonar Res. & Dev. Ltd., Beverley, UK",10.1109/VISUAL.1999.809926;10.1109/VISUAL.1998.745348,"whole field modelling, seabed visualization, sonar technology",3,1,9,
InfoVis,2001,To draw a tree,10.1109/INFVIS.2001.963272,http://dx.doi.org/10.1109/INFVIS.2001.963272,3,3,M,,Pat Hanrahan,P. Hanrahan,Stanford University,,,3,0,0,
InfoVis,2002,Demystifying venture capital investing,10.1109/INFVIS.2002.1173162,http://dx.doi.org/10.1109/INFVIS.2002.1173162,161,164,C,"Since the crash of the dot.coms, investors have gotten a lot more careful with where they place their money. Now more than ever it becomes really important for venture capitalists (VCs) to monitor the state of the startups market and continually update their investment strategy to suit the rapidly changing market conditions. This paper presents three new visualization metaphors (Spiral Map, TimeTicker, and Double Histogram) for monitoring the startups market. While we are focusing on the VC domain, the visual metaphors developed are general and can be easily applied to other domains.",Mei C. Chuah,Mei Chuah,"Accenture Technol. Labs., Palo Alto, CA, USA",10.1109/INFVIS.2001.963273,,3,1,7,
Vis,2002,Case study on the adaptation of interactive visualization applications to Web-based production for operational mesoscale weather models,10.1109/VISUAL.2002.1183827,http://dx.doi.org/10.1109/VISUAL.2002.1183827,549,552,C,"Visualization is required for the effective utilization of data from a weather simulation. Appropriate mapping of user goals to the design of pictorial content has been useful in the development of interactive applications with sufficient bandwidth for timely access to the model data. When remote access to the model visualizations is required the limited bandwidth becomes the primary bottleneck. To help address these problems, visualizations are presented on a Web page as a meta-representation of the model output and serve as an index to simplify finding other visualizations of relevance. To provide consistency with extant interactive products and to leverage their cost of development, the aforementioned applications are adapted to automatically populate a Web site with images and interactions for an operational weather forecasting system.",Lloyd Treinish,L.A. Treinish,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.2000.885736;10.1109/VISUAL.1995.480821;10.1109/VISUAL.2000.885678;10.1109/VISUAL.2000.885745,"visualization, meteorology, world-wide-web",3,2,10,
Vis,2002,A case study on the applications of a generic library for low-cost polychromatic passive stereo,10.1109/VISUAL.2002.1183829,http://dx.doi.org/10.1109/VISUAL.2002.1183829,557,560,C,"Active stereo has been used by engineers and industrial designers for several years to enhance the perception of computer generated three-dimensional images. Unfortunately, active stereo requires specialized hardware. Therefore, as ubiquitous computing and teleworking gain importance, using active stereo becomes a problem. The goal of this case study is to examine the concept of a generic library for polychromatic passive stereo to make stereo vision available everywhere.",Simon Stegmaier;Dirc Rose;Thomas Ertl,S. Stegmaier;D. Rose;T. Ertl,"Visualization & Interactive Syst. Group, Stuttgart Univ., Germany;Visualization & Interactive Syst. Group, Stuttgart Univ., Germany;Visualization & Interactive Syst. Group, Stuttgart Univ., Germany",10.1109/VISUAL.1999.809918,"Stereo Graphics, OpenGL, Preloading",3,1,11,
InfoVis,2004,Information Visualization Research: Citation and Co-Citation Highlights,10.1109/INFVIS.2004.38,http://dx.doi.org/10.1109/INFVIS.2004.38,r11,r11,M,An overview of the entry is given. The techniques used to prepare the InfoVis contest entry are outlined. The strengths and weaknesses are briefly discussed.,Chaomei Chen,Chaomei Chen,Drexel University,,,3,0,4,
InfoVis,2004,One-For-All: Visualization of the Information Visualization Symposia,10.1109/INFVIS.2004.50,http://dx.doi.org/10.1109/INFVIS.2004.50,r12,r12,M,,Soon Tee Teoh;Kwan-Liu Ma,Soon Tee Teoh;Kwan-Liu Ma,University of California at Davis,,,3,1,0,
InfoVis,2004,VIM: A Framework for Intelligence Analysis,10.1109/INFVIS.2004.72,http://dx.doi.org/10.1109/INFVIS.2004.72,22,22,M,"Intelligence analysts receive thousands of facts from a variety of sources. In addition to the bare details of the fact — a particular person, for example — each fact may have provenance, reliability, weight, and other attributes. Each fact may also be associated with other facts, e.g. that one person met another at a particular location. The analyst’s task is to examine a huge collection of such loosely-structured facts, and try to ""connect the dots"" to perceive the underlying and unknown causes — and their possible future courses. We have designed and implemented a Java platform called VIM to support intelligence analysts in their work.",Alan Keahey;Kenneth C. Cox,T.A. Keahey;K.C. Cox,Visintuit LLC,,,3,0,5,
Vis,2004,Visualization of Vortices in Simulated Airflow around Bat Wings During Flight,10.1109/VISUAL.2004.118,http://dx.doi.org/10.1109/VISUAL.2004.118,20,20,M,,Eduardo Hueso;Igor Pivkin;Sharon Swartz;David H. Laidlaw;George E. Karniadakis;Kenneth Breuer,E. Hueso;I. Pivkin;S. Swartz;D.H. Laidlaw;G. Karniadakis;K. Breuer,Brown University,,,3,0,7,
Vis,2004,Linking Representation with Meaning,10.1109/VISUAL.2004.66,http://dx.doi.org/10.1109/VISUAL.2004.66,5,5,M,"The purpose of visualization is not just to depict data, but to gain or present insight into the domain represented in data. However in visualization systems, this link between features in the data and the meaning of those features is often missing or implicit. It is assumed that the user, through looking at the output, will close the loop between representation and insight. An alternative is to view visualization tools as interfaces between data and insight, and to enrich this interface with capabilities linked to users’ conceptual models of the data. Preliminary work has been carried out to develop such an interface as a modular component that can be installed in a pipelined architecture. This poster expands the motivation for this work, and describes the initial implementation carried out within the Visualization Toolkit (VTK).",David J. Duke,D.J. Duke,University of Leeds,,,3,1,8,
Vis,2004,Modeling Decomposing Objects under Combustion,10.1109/VISUAL.2004.71,http://dx.doi.org/10.1109/VISUAL.2004.71,14,14,M,"We present a simple yet effective method for modeling of object decomposition under combustion. A separate simulation models the flame production and generates heat from a combustion process, which is used to trigger pyrolysis of the solid object. The decomposition is modeled using level set methods, and can handle complex topological changes. Even with a very simple flame model on a coarse grid, we can achieve a plausible decomposition of the burning object.",Zeki Melek;John Keyser,Z. Melek;J. Keyser,Texas A&amp;M University,,,3,2,7,
Vis,2004,Panel 4: What Should We Teach in a Scientific Visualization Class?,10.1109/VISUAL.2004.79,http://dx.doi.org/10.1109/VISUAL.2004.79,573,575,M,"Scientific Visualization (SciVis) has evolved past the point where one undergraduate course can cover all of the necessary topics. So the question becomes ""how do we teach SciVis to this generation of students?"" Some examples of current courses are: A graduate Computer Science (CS) course that prepares the next generation of SciVis researchers. An undergraduate CS course that prepares the future software architects/developers of packages such as vtk, vis5D and AVS. A class that teaches students how to do SciVis with existing software packages and how to deal with the lack of interoperability between those packages (via either a CS service course or a supercomputing center training course). An inter-disciplinary course designed to prepare computer scientists to work with the ""real"" scientists (via either a CS or Computational Science course). In this panel, we will discuss these types of courses and the advantages and disadvantages of each. We will also talk about some issues that you have probably encountered at your university: How do we keep the graphics/vis-oriented students from going to industry? How does SciVis fit in with evolving Computational Science programs? Is SciVis destined to be a service course at most universities? How do we deal with the diverse backgrounds of students that need SciVis?",Jon D. Genetti;Michael J. Bailey;David H. Laidlaw;Robert J. Moorhead II;Ross T. Whitaker,J.D. Genetti;M.J. Bailey;D.H. Laidlaw;R.J. Moorhead;R.T. Whitaker,University of Alaska Fairbanks,,,3,1,0,
Vis,2004,PQuad: visualization of predicted peptides and proteins,10.1109/VISUAL.2004.82,http://dx.doi.org/10.1109/VISUAL.2004.82,473,480,C,"New high-throughput proteomic techniques generate data faster than biologists can analyze it. Hidden within this massive and complex data are answers to basic questions about how cells function. The data afford an opportunity to take a global or systems approach studying whole proteomes comprising all the proteins in an organism. However, the tremendous size and complexity of the high-throughput data make it difficult to process and interpret. Existing tools for studying a few proteins at a time are not suitable for global analysis. Visualization provides powerful analysis capabilities for enormous, complex data at multiple resolutions. We developed a novel interactive visualization tool, PQuad, for the visual analysis of proteins and peptides identified from high-throughput data on biological samples. PQuad depicts the peptides in the context of their source protein and DNA, thereby integrating proteomic and genomic information. A wrapped line metaphor is applied across key resolutions of the data, from a compressed view of an entire chromosome to the actual nucleotide sequence. PQuad provides a difference visualization for comparing peptides from samples prepared under different experimental conditions. We describe the requirements for such a visual analysis tool, the design decisions, and the novel aspects of PQuad.",Susan L. Havre;Mudita Singhal;Deborah A. Payne;Bobbie-Jo M. Webb-Robertson,S.L. Havre;M. Singhal;D.A. Payne;B.-J.M. Webb-Robertson,"Pacific Northwest Nat. Lab., Richland, WA, USA;Pacific Northwest Nat. Lab., Richland, WA, USA;Pacific Northwest Nat. Lab., Richland, WA, USA;Pacific Northwest Nat. Lab., Richland, WA, USA",10.1109/INFVIS.1995.528685,"visualization, metaphor, context, proteomics, differential proteomics, difference visualization",3,2,24,
Vis,2005,Interpolation and visualization for advected scalar fields,10.1109/VISUAL.2005.1532849,http://dx.doi.org/10.1109/VISUAL.2005.1532849,615,622,C,"Doppler radars are useful facilities for weather forecasting. The data sampled by using Doppler radars are used to measure the distributions and densities of rain drops, snow crystals, hail stones, or even insects in the atmosphere. In this paper, we propose to build up a graphics-based software system for visualizing Doppler radar data. In the system, the reflectivity data gathered by using Doppler radars are post-processed to generate virtual cloud images which reveal the densities of precipitation in the air. An optical flow based method is adopted to compute the velocities of clouds, advected by winds. Therefore, the movement of clouds is depicted. The cloud velocities are also used to interpolate reflectivities for arbitrary time steps. Therefore, the reflectivities at any time can be produced. Our system composes of three stages. At the first stage, the raw radar data are re-sampled and filtered to create a multiple resolution data structure, based on a pyramid structure. At the second stage, a numeric method is employed to compute cloud velocities in the air and to interpolate radar reflectivity data at given time steps. The radar reflectivity data and cloud velocities are displayed at the last stage. The reflectivities are rendered by using splatting methods to produce semi-transparent cloud images. Two kinds of media are created for analyzing the reflectivity data. The first kind media consists of a group of still images of clouds which displays the distribution and density of water in the air. The second type media is a short animation of cloud images to show the formation and movement of the clouds. To show the advection of clouds, the cloud velocities are displayed by using two dimensional images. In these images, the velocities are represented by arrows and superimposed on cloud images. To enhance image quality, gradients and diffusion of the radar data are computed and used in the rendering process. Therefore the cloud structures are better portrayed. In order to achieve interactive visualization, our system is also comprised with a view-dependent visualization module. The radar data at far distance are rendered in lower resolutions, while the data closer to the eye position is rendered in details.",Shyh-Kuang Ueng;Sheng-Chuan Wang,Shyh-Kuang Ueng;Sheng-Chuan Wang,"Dept. of Comput. Sci., Nat. Taiwan Ocean Univ., Taipei, Taiwan;Dept. of Comput. Sci., Nat. Taiwan Ocean Univ., Taipei, Taiwan",10.1109/VISUAL.2004.69;10.1109/VISUAL.2001.964490;10.1109/VISUAL.1999.809916;10.1109/VISUAL.2002.1183823,"Doppler radar, volume rendering, optical flow, level of details, vector field visualization",3,1,42,
VAST,2007,VAST to Knowledge: Combining tools for exploration and mining,10.1109/VAST.2007.4389015,http://dx.doi.org/10.1109/VAST.2007.4389015,197,198,M,"The investigation of the VAST Contest collection provided a valuable test for text mining techniques. Our group has focused on creating analytical tools to unveil relevant patterns and to aid with the content navigation in such text collections. Our results show how such an approach, in combination with visualization techniques, can ease the discovery process especially when multiple tools founded on the same approach to data mining are used in complement to and in concert with one another.",Loretta Auvil;Xavier Llorà;Duane Searsmith;Kelly Searsmith,Loretta Auvil;Xavier Llora;Duane Searsmith;Kelly Searsmith,"Automated Learning Group, National Center for Supercomputing Applications, University of Illinois at Urbana-Champaign. e-mail: lauvil@uiuc.edu;Data Intensive Technologies and Applications, National Center for Supercomputing Applications, University of Illinois at Urbana-Champaign. e-mail: xllora@ncsa.uiuc.edu;Automated Learning Group, National Center for Supercomputing Applications, University of Illinois at Urbana-Champaign. e-mail: dsears@ncsa.uiuc.edu;Automated Learning Group, National Center for Supercomputing Applications, University of Illinois at Urbana-Champaign. e-mail: ksearsmi@ncsa.uiuc.edu",,,3,1,4,
VAST,2008,Grand challenge award: Data integration visualization and collaboration in the VAST 2008 Challenge,10.1109/VAST.2008.4677384,http://dx.doi.org/10.1109/VAST.2008.4677384,,,M,The VAST 2008 Challenge consisted of four heterogeneous synthetic data sets each organized into separate mini-challenges. The Grand Challenge required integrating the raw data from these four data sets as well as integrating results and findings from team members working on specific mini-challenges. Modeling the problem with a semantic network provided a means for integrating both the raw data and the subjective findings.,Donald A. Pellegrino;Chi-Chun Pan;Anthony C. Robinson;Michael Stryker;Junyan Luo;Chris Weaver;Prasenjit Mitra;Chaomei Chen;Ian Turton;Alan M. MacEachren,Donald Pellegrino;Chi-Chun Pan;Anthony Robinson;Michael Stryker;Junyan Luo;Chris Weaver;Prasenjit Mitra;Chaomei Chen;Ian Turton;Alan MacEachren,"Drexel University, USA;Penn State University, USA;Penn State University, USA;Penn State University, USA;Penn State University, USA;Penn State University, USA;Penn State University, USA;Drexel University, USA;Penn State University, USA;Penn State University, USA",,,3,1,7,
VAST,2008,Grand challenge award 2008: Support for diverse analytic techniques - nSpace2 and GeoTime visual analytics,10.1109/VAST.2008.4677385,http://dx.doi.org/10.1109/VAST.2008.4677385,,,M,"GeoTime and nSpace2 are interactive visual analytics tools that were used to examine and interpret all four of the 2008 VAST Challenge datasets. GeoTime excels in visualizing event patterns in time and space, or in time and any abstract landscape, while nSpace2 is a web-based analytical tool designed to support every step of the analytical process. nSpace2 is an integrating analytic environment. This paper highlights the VAST analytical experience with these tools that contributed to the success of these tools and this team for the third consecutive year.",Lynn Chien;Annie Tat;Pascale Proulx;Adeel Khamisa;William Wright,Lynn Chien;Annie Tat;Pascale Proulx;Adeel Khamisa;William Wright,"Oculus Info Inc., USA;Oculus Info Inc., USA;Oculus Info Inc., USA;Oculus Info Inc., USA;Oculus Info Inc., USA",,,3,3,4,
VAST,2009,Using projection and 2D plots to visually reveal genetic mechanisms of complex human disorders,10.1109/VAST.2009.5333917,http://dx.doi.org/10.1109/VAST.2009.5333917,171,178,C,"Gene mapping is a statistical method used to localize human disease genes to particular regions of the human genome. When performing such analysis, a genetic likelihood space is generated and sampled, which results in a multidimensional scalar field. Researchers are interested in exploring this likelihood space through the use of visualization. Previous efforts at visualizing this space, though, were slow and cumbersome, only showing a small portion of the space at a time, thus requiring the user to keep a mental picture of several views. We have developed a new technique that displays much more data at once by projecting the multidimensional data into several 2D plots. One plot is created for each parameter that shows the change along that parameter. A radial projection is used to create another plot that provides an overview of the high dimensional surface from the perspective of a single point. Linking and brushing between all the plots are used to determine relationships between parameters. We demonstrate our techniques on real world autism data, showing how to visually examine features of the high dimensional space.",Boonthanome Nouanesengsy;Sang-Cheol Seok;Han-Wei Shen;Veronica J. Vieland,Boonthanome Nouanesengsy;Sang-Cheol Seok;Han-Wei Shen;Veronica J Vieland,"Battelle Center for Mathematical Medicine, Nationwide Childrens Hospital & The Ohio State University, USA;Battelle Center for Mathematical Medicine, Nationwide Childrens Hospital, USA;The Ohio State University, USA;Battelle Center for Mathematical Medicine, Nationwide Childrens Hospital & The Ohio State University, USA",10.1109/VISUAL.1993.398859,"Visualization, Multidimensional data, Linkage Analysis, Posterior Probability of Linkage, PPL, PPLD, LD analysis, Linkage disequilibrium, Autism",3,2,14,
VAST,2009,Palantir: A visualization platform for real-world analysis,10.1109/VAST.2009.5334462,http://dx.doi.org/10.1109/VAST.2009.5334462,,,M,"Palantir is an analytic platform currently used worldwide by both governmental and financial analysts. This paper provides a brief overview of the platform, examines our 2009 IEEE VAST Challenge submission, and highlights several key analytic and visualization features we used in our analysis.",Brandon Wright;Jason Payne;Matthew Steckman;Scott Stevson,Brandon Wright;Jason Payne;Matthew Steckman;Scott Stevson,"Palantir Technologies, USA;Palantir Technologies, USA;Palantir Technologies, USA;Palantir Technologies, USA",,,3,1,0,
VAST,2011,Analysts aren't machines: Inferring frustration through visualization interaction,10.1109/VAST.2011.6102473,http://dx.doi.org/10.1109/VAST.2011.6102473,279,280,M,"Recent work in visual analytics has explored the extent to which information regarding analyst action and reasoning can be inferred from interaction. However, these methods typically rely on humans instead of automatic extraction techniques. Furthermore, there is little discussion regarding the role of user frustration when interacting with a visual interface. We demonstrate that automatic extraction of user frustration is possible given action-level visualization interaction logs. An experiment is described which collects data that accurately reflects user emotion transitions and corresponding interaction sequences. This data is then used in building HiddenMarkov Models (HMMs) which statistically connect interaction events with frustration. The capabilities of HMMs in predicting user frustration are tested using standard machine learning evaluation methods. The resulting classifier serves as a suitable predictor of user frustration that performs similarly across different users and datasets.",Lane Harrison;Wenwen Dou;Aidong Lu;William Ribarsky;Derek Xiaoyu Wang,Lane Harrison;Wenwen Dou;Aidong Lu;William Ribarsky;Xiaoyu Wang,"Computer Science, UNC-Charlotte, USA;Computer Science, UNC-Charlotte, USA;Computer Science, UNC-Charlotte, USA;Computer Science, UNC-Charlotte, USA;Computer Science, UNC-Charlotte, USA",,,3,3,7,
VAST,2011,"Find distance function, hide model inference",10.1109/VAST.2011.6102478,http://dx.doi.org/10.1109/VAST.2011.6102478,289,290,M,"Faced with a large, high-dimensional dataset, many turn to data analysis approaches that they understand less well than the domain of their data. An expert's knowledge can be leveraged into many types of analysis via a domain-specific distance function, but creating such a function is not intuitive to do by hand. We have created a system that shows an initial visualization, adapts to user feedback, and produces a distance function as a result. Specifically, we present a multidimensional scaling (MDS) visualization and an iterative feedback mechanism for a user to affect the distance function that informs the visualization without having to adjust the parameters of the visualization directly. An encouraging experimental result suggests that using this tool, data attributes with useless data are given low importance in the distance function.",Jingjing Liu;Eli T. Brown;Remco Chang,Jingjing Liu;Eli T. Brown;Remco Chang,"Tufts University, USA;Tufts University, USA;Tufts University, USA",,,3,3,4,
VAST,2011,Exploring proportions: Comparative visualization of categorical data,10.1109/VAST.2011.6102481,http://dx.doi.org/10.1109/VAST.2011.6102481,295,296,M,"This poster describes an approach to facilitate comparisons in multi-dimensional categorical data. The key idea is to represent over- or under-proportional relationships explicitly. On an overview level, the visualization of various measures conveys pair-wise relationships between categorical dimensions. For more details, interaction supports to relate a single category to all categories of multiple dimensions. We discuss methods for representing relationships and visualization-driven strategies for ordering dimensions and categories, and we illustrate the approach by means of data from a social survey.",Harald Piringer;Matthias Buchetics,Harald Piringer;Matthias Buchetics,"VRVis Research Center, Vienna, Austria;VRVis Research Center, Vienna, Austria",,,3,2,4,
VAST,2011,Guiding security analysis through visualization,10.1109/VAST.2011.6102492,http://dx.doi.org/10.1109/VAST.2011.6102492,317,318,M,"We present a multiple views visualization for the security data in the VAST 2010 Mini Challenge 2. The visualization is used to monitor log event activity on the network log data included in the challenge. Interactions are provided that allow analysts to investigate suspicious activity and escalate events as needed. Additionally, a database application is used to allow SQL queries for more detailed investigation.",Lane Harrison;Wenwen Dou;Aidong Lu;William Ribarsky;Derek Xiaoyu Wang,Lane Harrison;Wenwen Dou;Aidong Lu;William Ribarsky;Xiaoyu Wang,"Computer Science, UNC-Charlotte, USA;Computer Science, UNC-Charlotte, USA;Computer Science, UNC-Charlotte, USA;Computer Science, UNC-Charlotte, USA;Computer Science, UNC-Charlotte, USA",,,3,0,3,
InfoVis,2012,Different Strokes for Different Folks: Visual Presentation Design between Disciplines,10.1109/TVCG.2012.214,http://dx.doi.org/10.1109/TVCG.2012.214,2411,2420,J,"We present an ethnographic study of design differences in visual presentations between academic disciplines. Characterizing design conventions between users and data domains is an important step in developing hypotheses, tools, and design guidelines for information visualization. In this paper, disciplines are compared at a coarse scale between four groups of fields: social, natural, and formal sciences; and the humanities. Two commonplace presentation types were analyzed: electronic slideshows and whiteboard “chalk talks”. We found design differences in slideshows using two methods - coding and comparing manually-selected features, like charts and diagrams, and an image-based analysis using PCA called eigenslides. In whiteboard talks with controlled topics, we observed design behaviors, including using representations and formalisms from a participant's own discipline, that suggest authors might benefit from novel assistive tools for designing presentations. Based on these findings, we discuss opportunities for visualization ethnography and human-centered authoring tools for visual information.",Steven R. Gomez;Radu Jianu;Caroline Ziemkiewicz;Hua Guo;David H. Laidlaw,Steven R. Gomez;Radu Jianu;Caroline Ziemkiewicz;Hua Guo;David Laidlaw,Brown University;Brown University;Brown University;Brown University;Brown University,10.1109/TVCG.2011.251;10.1109/TVCG.2010.177;10.1109/TVCG.2010.179;10.1109/TVCG.2011.255,"Presentations, information visualization, design, visual analysis",3,3,18,
SciVis,2012,Analysis of Streamline Separation at Infinity Using Time-Discrete Markov Chains,10.1109/TVCG.2012.198,http://dx.doi.org/10.1109/TVCG.2012.198,2140,2148,J,"Existing methods for analyzing separation of streamlines are often restricted to a finite time or a local area. In our paper we introduce a new method that complements them by allowing an infinite-time-evaluation of steady planar vector fields. Our algorithm unifies combinatorial and probabilistic methods and introduces the concept of separation in time-discrete Markov-Chains. We compute particle distributions instead of the streamlines of single particles. We encode the flow into a map and then into a transition matrix for each time direction. Finally, we compare the results of our grid-independent algorithm to the popular Finite-Time-Lyapunov-Exponents and discuss the discrepancies.",Wieland Reich;Gerik Scheuermann,Wieland Reich;Gerik Scheuermann,University of Leipzig;University of Leipzig,10.1109/VISUAL.1999.809896,"Vector field topology, flow visualization, feature extraction, uncertainty",3,2,31,
SciVis,2012,Cumulative Heat Diffusion Using Volume Gradient Operator for Volume Analysis,10.1109/TVCG.2012.210,http://dx.doi.org/10.1109/TVCG.2012.210,2069,2077,J,"We introduce a simple, yet powerful method called the Cumulative Heat Diffusion for shape-based volume analysis, while drastically reducing the computational cost compared to conventional heat diffusion. Unlike the conventional heat diffusion process, where the diffusion is carried out by considering each node separately as the source, we simultaneously consider all the voxels as sources and carry out the diffusion, hence the term cumulative heat diffusion. In addition, we introduce a new operator that is used in the evaluation of cumulative heat diffusion called the Volume Gradient Operator (VGO). VGO is a combination of the LBO and a data-driven operator which is a function of the half gradient. The half gradient is the absolute value of the difference between the voxel intensities. The VGO by its definition captures the local shape information and is used to assign the initial heat values. Furthermore, VGO is also used as the weighting parameter for the heat diffusion process. We demonstrate that our approach can robustly extract shape-based features and thus forms the basis for an improved classification and exploration of features based on shape.",Krishna Chaitanya Gurijala;Lei Wang 0024;Arie E. Kaufman,Krishna Chaitanya Gurijala;Lei Wang;Arie Kaufman,Stony Brook University;Stony Brook University;Stony Brook University,10.1109/TVCG.2011.258;10.1109/VISUAL.2005.1532817,"Heat diffusion, volume gradient operator, shape-based volume analysis, classification, transfer function",3,3,31,
VAST,2012,Matrix-based visual correlation analysis on large timeseries data,10.1109/VAST.2012.6400549,http://dx.doi.org/10.1109/VAST.2012.6400549,209,210,M,"In recent years, the quantity of time series data generated in a wide variety of domains grown consistently. Thus, it is difficult for analysts to process and understand this overwhelming amount of data. In the specific case of time series data another problem arises: time series can be highly interrelated. This problem becomes even more challenging when a set of parameters influences the progression of a time series. However, while most visual analysis techniques support the analysis of short time periods, e.g. one day or one week, they fail to visualize large-scale time series, ranging over one year or more. In our approach we present a time series matrix visualization that tackles this problem. Its primary advantages are that it scales to a large number of time series with different start and end points and allows for the visual comparison / correlation analysis of a set of influencing factors. To evaluate our approach, we applied our technique to a real-world data set, showing the impact of local weather conditions on the efficiency of photovoltaic power plants.",Michael Behrisch 0001;James Davey;Tobias Schreck;Daniel A. Keim;Jörn Kohlhammer,Michael Behrisch;James Davey;Tobias Schreck;Daniel Keim;Jörn Kohlhammer,Universität Konstanz;Fraunhofer IGD;Universität Konstanz;Universität Konstanz;Fraunhofer IGD,,,3,3,7,
VAST,2012,A visual analytics approach to understanding cycling behaviour,10.1109/VAST.2012.6400550,http://dx.doi.org/10.1109/VAST.2012.6400550,207,208,M,"Existing research into cycling behaviours has either relied on detailed ethnographic studies or larger public attitude surveys [1] [9]. Instead, following recent contributions from information visualization [13] and data mining [5] [7], this design study uses visual analytics techniques to identify, describe and explain cycling behaviours within a large and attribute rich transactional dataset. Using data from London's bike share scheme&lt;sup&gt;1&lt;/sup&gt;, customer level classifications will be created, which consider the regularity of scheme use, journey length and travel times. Monitoring customer usage over time, user classifications will attend to the dynamics of cycling behaviour, asking substantive questions about how behaviours change under varying conditions. The 3-year PhD project will contribute to academic and strategic discussions around sustainable travel policy. A programme of research is outlined, along with an early visual analytics prototype for rapidly querying customer journeys.",Roger Beecham;Jo Wood;Audrey Bowerman,Roger Beecham;Jo Wood;Audrey Bowerman,City University London;City University London;Transport for London,,,3,1,13,
InfoVis,2013,Visualization of Shape Motions in Shape Space,10.1109/TVCG.2013.230,http://dx.doi.org/10.1109/TVCG.2013.230,2644,2652,J,"Analysis of dynamic object deformations such as cardiac motion is of great importance, especially when there is a necessity to visualize and compare the deformation behavior across subjects. However, there is a lack of effective techniques for comparative visualization and assessment of a collection of motion data due to its 4-dimensional nature, i.e., timely varying three-dimensional shapes. From the geometric point of view, the motion change can be considered as a function defined on the 2D manifold of the surface. This paper presents a novel classification and visualization method based on a medial surface shape space, in which two novel shape descriptors are defined, for discriminating normal and abnormal human heart deformations as well as localizing the abnormal motion regions. In our medial surface shape space, the geodesic distance connecting two points in the space measures the similarity between their corresponding medial surfaces, which can quantify the similarity and disparity of the 3D heart motions. Furthermore, the novel descriptors can effectively localize the inconsistently deforming myopathic regions on the left ventricle. An easy visualization of heart motion sequences on the projected space allows users to distinguish the deformation differences. Our experimental results on both synthetic and real imaging data show that this method can automatically classify the healthy and myopathic subjects and accurately detect myopathic regions on the left ventricle, which outperforms other conventional cardiac diagnostic methods.",Vahid Taimouri;Jing Hua,Vahid Taimouri;Jing Hua,"Wayne State University and Children’s Hospital Boston, Harvard Medical School;Wayne State University",10.1109/TVCG.2006.137;10.1109/INFVIS.2003.1249025;10.1109/TVCG.2009.159;10.1109/INFVIS.2004.65,"Medial surface, shape space, comparative visualization, left ventricle diagnosis",3,5,43,
InfoVis,2014,Effects of Presentation Mode and Pace Control on Performance in Image Classification,10.1109/TVCG.2014.2346437,http://dx.doi.org/10.1109/TVCG.2014.2346437,2301,2309,J,"A common task in visualization is to quickly find interesting items in large sets. When appropriate metadata is missing, automatic queries are impossible and users have to inspect all elements visually. We compared two fundamentally different, but obvious display modes for this task and investigated the difference with respect to effectiveness, efficiency, and satisfaction. The static mode is based on the page metaphor and presents successive pages with a static grid of items. The moving mode is based on the conveyor belt metaphor and lets a grid of items slide though the screen in a continuous flow. In our evaluation, we applied both modes to the common task of browsing images. We performed two experiments where 18 participants had to search for certain target images in a large image collection. The number of shown images per second (pace) was predefined in the first experiment, and under user control in the second one. We conclude that at a fixed pace, the mode has no significant impact on the recall. The perceived pace is generally slower for moving mode, which causes users to systematically choose for a faster real pace than in static mode at the cost of recall, keeping the average number of target images found per second equal for both modes.",Paul van der Corput;Jarke J. van Wijk,Paul van der Corput;Jarke J. van Wijk,Eindhoven University of Technology;Eindhoven University of Technology,,"RSVP, image classification, image browsing, multimedia visualization",3,3,15,
SciVis,2014,Visualizing 2-dimensional Manifolds with Curve Handles in 4D,10.1109/TVCG.2014.2346425,http://dx.doi.org/10.1109/TVCG.2014.2346425,2575,2584,J,"In this paper, we present a mathematical visualization paradigm for exploring curves embedded in 3D and surfaces in 4D mathematical world. The basic problem is that, 3D figures of 4D mathematical entities often twist, turn, and fold back on themselves, leaving important properties behind the surface sheets. We propose an interactive system to visualize the topological features of the original 4D surface by slicing its 3D figure into a series of feature diagram. A novel 4D visualization interface is designed to allow users to control 4D topological shapes via the collection of diagram handles using the established curve manipulation mechanism. Our system can support rich mathematical interaction of 4D mathematical objects which is very difficult with any existing approach. We further demonstrate the effectiveness of the proposed visualization tool using various experimental results and cases studies.",Hui Zhang 0006;Jianguang Weng;Guangchen Ruan,Hui Zhang;Jianguang Weng;Guangchen Ruan,"Pervasive Technology Institute, Indiana University;Zhejiang University of Media and Communication;School of Informatics and Computing, Indiana University",10.1109/TVCG.2012.242;10.1109/VISUAL.2005.1532804;10.1109/VISUAL.2005.1532843;10.1109/TVCG.2010.151;10.1109/VISUAL.2005.1532833;10.1109/TVCG.2007.70593,"math visualization, 4D, deformation, Reidemeister theorem",3,4,38,
SciVis,2014,Volume-Preserving Mapping and Registration for Collective Data Visualization,10.1109/TVCG.2014.2346457,http://dx.doi.org/10.1109/TVCG.2014.2346457,2664,2673,J,"In order to visualize and analyze complex collective data, complicated geometric structure of each data is desired to be mapped onto a canonical domain to enable map-based visual exploration. This paper proposes a novel volume-preserving mapping and registration method which facilitates effective collective data visualization. Given two 3-manifolds with the same topology, there exists a mapping between them to preserve each local volume element. Starting from an initial mapping, a volume restoring diffeomorphic flow is constructed as a compressible flow based on the volume forms at the manifold. Such a flow yields equality of each local volume element between the original manifold and the target at its final state. Furthermore, the salient features can be used to register the manifold to a reference template by an incompressible flow guided by a divergence-free vector field within the manifold. The process can retain the equality of local volume elements while registering the manifold to a template at the same time. An efficient and practical algorithm is also presented to generate a volume-preserving mapping and a salient feature registration on discrete 3D volumes which are represented with tetrahedral meshes embedded in 3D space. This method can be applied to comparative analysis and visualization of volumetric medical imaging data across subjects. We demonstrate an example application in multimodal neuroimaging data analysis and collective data visualization.",Jiaxi Hu;Guangyu Zou;Jing Hua,Jiaxi Hu;Guangyu Jeff Zou;Jing Hua,"Department of Computer Science, Wayne State University, Detroit, MI;Department of Computer Science, Wayne State University, Detroit, MI;Department of Computer Science, Wayne State University, Detroit, MI",10.1109/TVCG.2008.134;10.1109/VISUAL.2004.75;10.1109/VISUAL.2002.1183795;10.1109/TVCG.2011.171,"Volume-preserving mapping, data regularization, data transformation",3,3,33,
SciVis,2014,A Robust Parity Test for Extracting Parallel Vectors in 3D,10.1109/TVCG.2014.2346412,http://dx.doi.org/10.1109/TVCG.2014.2346412,2526,2534,J,"Parallel vectors (PV), the loci where two vector fields are parallel, are commonly used to represent curvilinear features in 3D for data visualization. Methods for extracting PV usually operate on a 3D grid and start with detecting seed points on a cell face. We propose, to the best of our knowledge, the first provably correct test that determines the parity of the number of PV points on a cell face. The test only needs to sample along the face boundary and works for any choice of the two vector fields. A discretization of the test is described, validated, and compared with existing tests that are also based on boundary sampling. The test can guide PV-extraction algorithms to ensure closed curves wherever the input fields are continuous, which we exemplify in extracting ridges and valleys of scalar functions.",Tao Ju;Minxin Cheng;Xu Wang;Ye Duan,Tao Ju;Minxin Cheng;Xu Wang;Ye Duan,Washington University in St. Louis;University of Missouri at Columbia;University of Missouri at Columbia;University of Missouri at Columbia,10.1109/VISUAL.2002.1183786;10.1109/VISUAL.2005.1532851;10.1109/VISUAL.1999.809896,"Parallel vectors, feature curve extraction, ridges and valleys, parity test",3,4,17,HM
SciVis,2015,Auto-Calibration of Multi-Projector Displays with a Single Handheld Camera,10.1109/SciVis.2015.7429493,http://dx.doi.org/10.1109/SciVis.2015.7429493,65,72,C,"We present a novel approach that utilizes a simple handheld camera to automatically calibrate multi-projector displays. Most existing studies adopt active structured light patterns to verify the relationship between the camera and the projectors. The utilized camera is typically expensive and requires an elaborate installation process depending on the scalability of its applications. Moreover, the observation of the entire area by the camera is almost impossible for a small space surrounded by walls as there is not enough distance for the camera to capture the entire scene. We tackle these issues by requiring only a portion of the walls to be visible to a handheld camera that is widely used these days. This becomes possible by the introduction of our new structured light pattern scheme based on a perfect submap and a geometric calibration that successfully utilizes the geometric information of multi-planar environments. We demonstrate that immersive display in a small space such as an ordinary room can be effectively created using images captured by a handheld camera.",Sanghun Park;Hyunggoog Seo;Seunghoon Cha;Jun-yong Noh,Sanghun Park;Hyunggoog Seo;Seunghoon Cha;Junyong Noh,KAIST;KAIST;KAIST;KAIST,10.1109/VISUAL.2002.1183793;10.1109/VISUAL.2000.885685;10.1109/VISUAL.1999.809883,,3,3,26,
SciVis,2015,Multiresolution visualization of digital earth data via hexagonal box-spline wavelets,10.1109/SciVis.2015.7429508,http://dx.doi.org/10.1109/SciVis.2015.7429508,151,152,M,"Multiresolution analysis is an important tool for exploring large-scale data sets. Such analysis provides facilities to visualize data at different levels of detail while providing the advantages of efficient data compression and transmission. In this work, an approach is presented to apply multiresolution analysis to digital Earth data where each resolution describes data at a specific level of detail. Geospatial data at a fine level is taken as the input and a hierarchy of approximation and detail coefficients is built by applying a hexagonal discrete wavelet transform. Multiresolution filters are designed for hexagonal cells based on the three directional linear box spline which is natively supported by modern GPUs.",Mohammad Imrul Jubair;Usman R. Alim;Niklas Röber;John P. Clyne;Ali Mahdavi-Amiri;Faramarz F. Samavati,Mohammad Imrul Jubair;Usman Alim;Niklas Roeber;John Clyne;Ali Mahdavi-Amiri;Faramarz Samavati,University of Calgary;University of Calgary;German Climate Computing Centre;University Corporation for Atmospheric Research;University of Calgary;University of Calgary,,,3,2,6,
SciVis,2015,Adaptive Multilinear Tensor Product Wavelets,10.1109/TVCG.2015.2467412,http://dx.doi.org/10.1109/TVCG.2015.2467412,985,994,J,"Many foundational visualization techniques including isosurfacing, direct volume rendering and texture mapping rely on piecewise multilinear interpolation over the cells of a mesh. However, there has not been much focus within the visualization community on techniques that efficiently generate and encode globally continuous functions defined by the union of multilinear cells. Wavelets provide a rich context for analyzing and processing complicated datasets. In this paper, we exploit adaptive regular refinement as a means of representing and evaluating functions described by a subset of their nonzero wavelet coefficients. We analyze the dependencies involved in the wavelet transform and describe how to generate and represent the coarsest adaptive mesh with nodal function values such that the inverse wavelet transform is exactly reproduced via simple interpolation (subdivision) over the mesh elements. This allows for an adaptive, sparse representation of the function with on-demand evaluation at any point in the domain. We focus on the popular wavelets formed by tensor products of linear B-splines, resulting in an adaptive, nonconforming but crack-free quadtree (2D) or octree (3D) mesh that allows reproducing globally continuous functions via multilinear interpolation over its cells.",Kenneth Weiss 0001;Peter Lindstrom,Kenneth Weiss;Peter Lindstrom,Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory,10.1109/TVCG.2010.145;10.1109/VISUAL.1997.663860;10.1109/VISUAL.2002.1183810;10.1109/TVCG.2011.252;10.1109/VISUAL.1996.568127;10.1109/TVCG.2009.186,"Multilinear interpolation, adaptive wavelets, multiresolution models, octrees, continuous reconstruction",3,3,51,
VAST,2015,Visual analysis of route choice behaviour based on GPS trajectories,10.1109/VAST.2015.7347679,http://dx.doi.org/10.1109/VAST.2015.7347679,203,204,M,"There are often multiple routes between regions. Many factors potentially affect driver's route choice, such as expected time cost, length etc. In this work, we present a visual analysis system to explore driver's route choice behaviour based on taxi GPS trajectory data. With interactive trajectory filtering, the system constructs feasible routes between regions of interest. Using a rank-based visualization, the attributes of multiple routes are explored and compared. Based on a statistical model, the system supports to verify trajectory-related factors' impact on route choice behaviour. The effectiveness of the system is demonstrated by applying to real trajectory dataset.",Min Lu;Chufan Lai;Tangzhi Ye;Jie Liang 0004;Xiaoru Yuan,Min Lu;Chufan Lai;Tangzhi Ye;Jie Liang;Xiaoru Yuan,"Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University, China;Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University, China;Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University, China;Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University, China;Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University, China",,,3,5,8,
InfoVis,2016,Multi-Granular Trend Detection for Time-Series Analysis,10.1109/TVCG.2016.2598619,http://dx.doi.org/10.1109/TVCG.2016.2598619,661,670,J,"Time series (such as stock prices) and ensembles (such as model runs for weather forecasts) are two important types of one-dimensional time-varying data. Such data is readily available in large quantities but visual analysis of the raw data quickly becomes infeasible, even for moderately sized data sets. Trend detection is an effective way to simplify time-varying data and to summarize salient information for visual display and interactive analysis. We propose a geometric model for trend-detection in one-dimensional time-varying data, inspired by topological grouping structures for moving objects in two- or higher-dimensional space. Our model gives provable guarantees on the trends detected and uses three natural parameters: granularity, support-size, and duration. These parameters can be changed on-demand. Our system also supports a variety of selection brushes and a time-sweep to facilitate refined searches and interactive visualization of (sub-)trends. We explore different visual styles and interactions through which trends, their persistence, and evolution can be explored.",Arthur van Goethem;Frank Staals;Maarten Löffler;Jason Dykes;Bettina Speckmann,Goethem Arthur Van;Frank Staals;Maarten Löffler;Jason Dykes;Bettina Speckmann,"TU, Eindhoven;MADALGO, Aarhus University;Utrecht University;City University, London;TU, Eindhoven",10.1109/TVCG.2015.2467204;10.1109/TVCG.2010.181;10.1109/TVCG.2006.147;10.1109/TVCG.2014.2346448;10.1109/TVCG.2007.70558;10.1109/TVCG.2008.166;10.1109/TVCG.2008.125;10.1109/TVCG.2014.2346455,Interactive Exploration;Trend Detection;Time Series,3,5,41,
SciVis,2016,Direct Multifield Volume Ray Casting of Fiber Surfaces,10.1109/TVCG.2016.2599040,http://dx.doi.org/10.1109/TVCG.2016.2599040,941,949,J,"Multifield data are common in visualization. However, reducing these data to comprehensible geometry is a challenging problem. Fiber surfaces, an analogy of isosurfaces to bivariate volume data, are a promising new mechanism for understanding multifield volumes. In this work, we explore direct ray casting of fiber surfaces from volume data without any explicit geometry extraction. We sample directly along rays in domain space, and perform geometric tests in range space where fibers are defined, using a signed distance field derived from the control polygons. Our method requires little preprocess, and enables real-time exploration of data, dynamic modification and pixel-exact rendering of fiber surfaces, and support for higher-order interpolation in domain space. We demonstrate this approach on several bivariate datasets, including analysis of multi-field combustion data.",Kui Wu 0003;Aaron Knoll;Benjamin J. Isaac;Hamish A. Carr;Valerio Pascucci,Kui Wu;Aaron Knoll;Benjamin J Isaac;Hamish Carr;Valerio Pascucci,"University of Utah;SCI InstituteUniversity of UtahArgonne National Laboratory;ICSE, University of Utah;School of ComputingUniversity of Leeds;SCI InstituteUniversity of Utah",10.1109/VISUAL.2003.1250414;10.1109/VISUAL.2004.89;10.1109/TVCG.2009.185;10.1109/TVCG.2009.204;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.1998.745713;10.1109/TVCG.2006.157;10.1109/TVCG.2010.145;10.1109/TVCG.2015.2467433;10.1109/VISUAL.2003.1250412;10.1109/VISUAL.1998.745300;10.1109/TVCG.2008.119;10.1109/VISUAL.2004.52,Volume Rendering;Isosurface;Multidimensional Data,3,6,42,
VAST,2016,PorosityAnalyzer: Visual Analysis and Evaluation of Segmentation Pipelines to Determine the Porosity in Fiber-Reinforced Polymers,10.1109/VAST.2016.7883516,http://dx.doi.org/10.1109/VAST.2016.7883516,101,110,C,"In this paper we present PorosityAnalyzer, a novel tool for detailed evaluation and visual analysis of pore segmentation pipelines to determine the porosity in fiber-reinforced polymers (FRPs). The presented tool consists of two modules: the computation module and the analysis module. The computation module enables a convenient setup and execution of distributed off-line-computations on industrial 3D X-ray computed tomography datasets. It allows the user to assemble individual segmentation pipelines in the form of single pipeline steps, and to specify the parameter ranges as well as the sampling of the parameter-space of each pipeline segment. The result of a single segmentation run consists of the input parameters, the calculated 3D binary-segmentation mask, the resulting porosity value, and other derived results (e.g., segmentation pipeline run-time). The analysis module presents the data at different levels of detail by drill-down filtering in order to determine accurate and robust segmentation pipelines. Overview visualizations allow to initially compare and evaluate the segmentation pipelines. With a scatter plot matrix (SPLOM), the segmentation pipelines are examined in more detail based on their input and output parameters. Individual segmentation-pipeline runs are selected in the SPLOM and visually examined and compared in 2D slice views and 3D renderings by using aggregated segmentation masks and statistical contour renderings. PorosityAnalyzer has been thoroughly evaluated with the help of twelve domain experts. Two case studies demonstrate the applicability of our proposed concepts and visualization techniques, and show that our tool helps domain experts to gain new insights and improve their workflow efficiency.",Johannes Weissenböck;Artem Amirkhanov;M. Eduard Gröller;Johann Kastner;Christoph Heinzl,Johannes Weissenböck;Artem Amirkhanov;Eduard Gröller;Johann Kastner;Christoph Heinzl,"University of Applied Sciences, Upper Austria, Wels, Austria;University of Applied Sciences, Upper Austria, Wels, Austria;TU Wien, Vienna, Austria;University of Applied Sciences, Upper Austria, Wels, Austria;University of Applied Sciences, Upper Austria, Wels, Austria",10.1109/TVCG.2013.147;10.1109/TVCG.2008.153;10.1109/VISUAL.1993.398859;10.1109/TVCG.2012.200;10.1109/TVCG.2011.253;10.1109/TVCG.2014.2346321;10.1109/TVCG.2013.177;10.1109/TVCG.2011.248,,3,6,33,
InfoVis,2017,Nonlinear Dot Plots,10.1109/TVCG.2017.2744018,http://dx.doi.org/10.1109/TVCG.2017.2744018,616,625,J,"Conventional dot plots use a constant dot size and are typically applied to show the frequency distribution of small data sets. Unfortunately, they are not designed for a high dynamic range of frequencies. We address this problem by introducing nonlinear dot plots. Adopting the idea of nonlinear scaling from logarithmic bar charts, our plots allow for dots of varying size so that columns with a large number of samples are reduced in height. For the construction of these diagrams, we introduce an efficient two-way sweep algorithm that leads to a dense and symmetrical layout. We compensate aliasing artifacts at high dot densities by a specifically designed low-pass filtering method. Examples of nonlinear dot plots are compared to conventional dot plots as well as linear and logarithmic histograms. Finally, we include feedback from an expert review.",Nils Rodrigues;Daniel Weiskopf,Nils Rodrigues;Daniel Weiskopf,"VISUS, University of Stuttgart, Germany;VISUS, University of Stuttgart, Germany",10.1109/TVCG.2016.2598592;10.1109/TVCG.2014.2346428;10.1109/TVCG.2010.197;10.1109/TVCG.2011.160;10.1109/TVCG.2009.127,"Nonlinear dot plot,statistical graphics,sweep algorithm,layout",3,2,38,
InfoVis,2017,The Explanatory Visualization Framework: An Active Learning Framework for Teaching Creative Computing Using Explanatory Visualizations,10.1109/TVCG.2017.2745878,http://dx.doi.org/10.1109/TVCG.2017.2745878,791,801,J,"Visualizations are nowadays appearing in popular media and are used everyday in the workplace. This democratisation of visualization challenges educators to develop effective learning strategies, in order to train the next generation of creative visualization specialists. There is high demand for skilled individuals who can analyse a problem, consider alternative designs, develop new visualizations, and be creative and innovative. Our three-stage framework, leads the learner through a series of tasks, each designed to develop different skills necessary for coming up with creative, innovative, effective, and purposeful visualizations. For that, we get the learners to create an explanatory visualization of an algorithm of their choice. By making an algorithm choice, and by following an active-learning and project-based strategy, the learners take ownership of a particular visualization challenge. They become enthusiastic to develop good results and learn different creative skills on their learning journey.",Jonathan Roberts 0002;Panagiotis D. Ritsos;James R. Jackson;Christopher James Headleand,Jonathan C. Roberts;Panagiotis D. Ritsos;James R. Jackson;Christopher Headleand,Bangor University;Bangor University;Bangor University;University of Lincoln,10.1109/TVCG.2014.2346984;10.1109/TVCG.2016.2599338;10.1109/TVCG.2011.255;10.1109/TVCG.2014.2346331;10.1109/TVCG.2009.111;10.1109/TVCG.2015.2467271;10.1109/TVCG.2012.213;10.1109/TVCG.2010.179,"Explanatory visualization,Information Visualization,Teaching visualization,Learning Support",3,2,70,
VAST,2017,CRICTO: Supporting Sensemaking through Crowdsourced Information Schematization,10.1109/VAST.2017.8585484,http://dx.doi.org/10.1109/VAST.2017.8585484,139,150,C,"We present CRICTO, a new crowdsourcing visual analytics environment for making sense of and analyzing text data, whereby multiple crowdworkers are able to parallelize the simple information schematization tasks of relating and connecting entities across documents. The diverse links from these schematization tasks are then automatically combined and the system visualizes them based on the semantic types of the linkages. CRICTO also includes several tools that allow analysts to interactively explore and refine crowdworkers' results to better support their own sensemaking processes. We evaluated CRICTO's techniques and analysis workflow with deployments of CRICTO using Amazon Mechanical Turk and a user study that assess the effect of crowdsourced schematization in sensemaking tasks. The results of our evaluation show that CRICTO's crowdsourcing approaches and workflow help analysts explore diverse aspects of datasets, and uncover more accurate hidden stories embedded in the text datasets.",Haeyong Chung;Sai Prashanth Dasari;Santhosh Nandhakumar;Christopher Andrews,Haeyong Chung;Sai Prashanth Dasari;Santhosh Nandhakumar;Christopher Andrews,University of Alabama in Huntsville;University of Alabama in Huntsville;University of Alabama in Huntsville;Middlebury College,10.1109/VAST.2007.4389006;10.1109/TVCG.2013.164;10.1109/TVCG.2007.70577;10.1109/VAST.2009.5333878;10.1109/VAST.2008.4677362;10.1109/TVCG.2014.2346573;10.1109/VAST.2006.261439;10.1109/VAST.2010.5652932;10.1109/VAST.2007.4389011,"Visual text analytics,sensemaking,crowdsourcing",3,2,51,
InfoVis,2018,Embedded Merge & Split: Visual Adjustment of Data Grouping,10.1109/TVCG.2018.2865075,http://dx.doi.org/10.1109/TVCG.2018.2865075,800,809,J,"Data grouping is among the most frequently used operations in data visualization. It is the process through which relevant information is gathered, simplified, and expressed in summary form. Many popular visualization tools support automatic grouping of data (e.g., dividing up a numerical variable into bins). Although grouping plays a pivotal role in supporting data exploration, further adjustment and customization of auto-generated grouping criteria is non-trivial. Such adjustments are currently performed either programmatically or through menus and dialogues which require specific parameter adjustments over several steps. In response, we introduce Embedded Merge &amp; Split (EMS), a new interaction technique for direct adjustment of data grouping criteria. We demonstrate how the EMS technique can be designed to directly manipulate width and position in bar charts and histograms, as a means for adjustment of data grouping criteria. We also offer a set of design guidelines for supporting EMS. Finally, we present the results of two user studies, providing initial evidence that EMS can significantly reduce interaction time compared to WIMP-based technique and was subjectively preferred by participants.",Ali Sarvghad;Bahador Saket;Alex Endert;Nadir Weibel,Ali Sarvghad;Bahador Saket;Alex Endert;Nadir Weibel,"University of California, San Diego;Georgia Institute of Technology;Georgia Institute of Technology;University of California, San Diego",10.1109/VAST.2012.6400486;10.1109/TVCG.2015.2467615;10.1109/TVCG.2008.109;10.1109/TVCG.2016.2598839,"Data Visualization,Direct Manipulation,Embedded Merge & Split,Data Grouping,Embedded Interaction",3,3,48,
InfoVis,2018,Vistrates: A Component Model for Ubiquitous Analytics,10.1109/TVCG.2018.2865144,http://dx.doi.org/10.1109/TVCG.2018.2865144,586,596,J,"Visualization tools are often specialized for specific tasks, which turns the user's analytical workflow into a fragmented process performed across many tools. In this paper, we present a component model design for data visualization to promote modular designs of visualization tools that enhance their analytical scope. Rather than fragmenting tasks across tools, the component model supports unification, where components-the building blocks of this model-can be assembled to support a wide range of tasks. Furthermore, the model also provides additional key properties, such as support for collaboration, sharing across multiple devices, and adaptive usage depending on expertise, from creating visualizations using dropdown menus, through instantiating components, to actually modifying components or creating entirely new ones from scratch using JavaScript or Python source code. To realize our model, we introduce Vistrates, a literate computing platform for developing, assembling, and sharing visualization components. From a visualization perspective, Vistrates features cross-cutting components for visual representations, interaction, collaboration, and device responsiveness maintained in a component repository. From a development perspective, Vistrates offers a collaborative programming environment where novices and experts alike can compose component pipelines for specific analytical activities. Finally, we present several Vistrates use cases that span the full range of the classic “anytime” and “anywhere” motto for ubiquitous analysis: from mobile and on-the-go usage, through office settings, to collaborative smart environments covering a variety of tasks and devices..",Sriram Karthik Badam;Andreas Mathisen;Roman Rädle;Clemens Nylandsted Klokmose;Niklas Elmqvist,Sriram Karthik Badam;Andreas Mathisen;Roman Rädle;Clemens N. Klokmose;Niklas Elmqvist,"University of Maryland, College Park, MD, USA;Aarhus University, Aarhus, Denmark;Aarhus University, Aarhus, Denmark;Aarhus University, Aarhus, Denmark;University of Maryland, College Park, MD, USA",10.1109/TVCG.2016.2598647;10.1109/TVCG.2017.2743990;10.1109/TVCG.2009.174;10.1109/TVCG.2011.185;10.1109/TVCG.2017.2745278;10.1109/INFVIS.2000.885092;10.1109/TVCG.2013.197;10.1109/VAST.2007.4389011;10.1109/TVCG.2008.137;10.1109/TVCG.2017.2744019;10.1109/TVCG.2012.204;10.1109/TVCG.2013.191;10.1109/TVCG.2014.2346573;10.1109/TVCG.2013.200;10.1109/TVCG.2014.2346291;10.1109/TVCG.2016.2599030;10.1109/TVCG.2014.2346574;10.1109/INFVIS.2000.885086;10.1109/TVCG.2009.162;10.1109/TVCG.2007.70577;10.1109/TVCG.2007.70589,"Components,literate computing,development,exploration,dissemination,collaboration,heterogeneous devices",3,6,80,
InfoVis,2018,DimReader: Axis lines that explain non-linear projections,10.1109/TVCG.2018.2865194,http://dx.doi.org/10.1109/TVCG.2018.2865194,481,490,J,"Non-linear dimensionality reduction (NDR) methods such as LLE and t-SNE are popular with visualization researchers and experienced data analysts, but present serious problems of interpretation. In this paper, we present DimReader, a technique that recovers readable axes from such techniques. DimReader is based on analyzing infinitesimal perturbations of the dataset with respect to variables of interest. The perturbations define exactly how we want to change each point in the original dataset and we measure the effect that these changes have on the projection. The recovered axes are in direct analogy with the axis lines (grid lines) of traditional scatterplots. We also present methods for discovering perturbations on the input data that change the projection the most. The calculation of the perturbations is efficient and easily integrated into programs written in modern programming languages. We present results of DimReader on a variety of NDR methods and datasets both synthetic and real-life, and show how it can be used to compare different NDR methods. Finally, we discuss limitations of our proposal and situations where further research is needed.",Rebecca Faust;David Glickenstein;Carlos Scheidegger,Rebecca Faust;David Glickenstein;Carlos Scheidegger,University of Arizona;University of Arizona;University of Arizona,10.1109/TVCG.2014.2346984;10.1109/TVCG.2014.2346431;10.1109/TVCG.2013.124;10.1109/VISUAL.1996.567787;10.1109/VAST.2010.5652460;10.1109/TVCG.2015.2467552;10.1109/VAST.2011.6102449;10.1109/TVCG.2013.157;10.1109/TVCG.2011.220;10.1109/TVCG.2014.2346325;10.1109/INFVIS.2002.1173161;10.1109/TVCG.2016.2598495;10.1109/TVCG.2013.153;10.1109/TVCG.2015.2467717,"Non-linear dimensionality reduction,auto-differentiation",3,3,52,
InfoVis,2018,"Multiple Coordinated Views at Large Displays for Multiple Users: Empirical Findings on User Behavior, Movements, and Distances",10.1109/TVCG.2018.2865235,http://dx.doi.org/10.1109/TVCG.2018.2865235,608,618,J,"Interactive wall-sized displays benefit data visualization. Due to their sheer display size, they make it possible to show large amounts of data in multiple coordinated views (MCV) and facilitate collaborative data analysis. In this work, we propose a set of important design considerations and contribute a fundamental input vocabulary and interaction mapping for MCV functionality. We also developed a fully functional application with more than 45 coordinated views visualizing a real-world, multivariate data set of crime activities, which we used in a comprehensive qualitative user study investigating how pairs of users behave. Most importantly, we found that flexible movement is essential and-depending on user goals-is connected to collaboration, perception, and interaction. Therefore, we argue that for future systems interaction from the distance is required and needs good support. We show that our consistent design for both direct touch at the large display and distant interaction using mobile phones enables the seamless exploration of large-scale MCV at wall-sized displays. Our MCV application builds on design aspects such as simplicity, flexibility, and visual consistency and, therefore, supports realistic workflows. We believe that in the future, many visual data analysis scenarios will benefit from wall-sized displays presenting numerous coordinated visualizations, for which our findings provide a valuable foundation.",Ricardo Langner;Ulrike Kister;Raimund Dachselt,Ricardo Langner;Ulrike Kister;Raimund Dachselt,"Interactive Media Lab, Technische Universität Dresden, Germany;Interactive Media Lab, Technische Universität Dresden, Germany;Interactive Media Lab, Technische Universität Dresden, Germany",10.1109/VAST.2016.7883506;10.1109/TVCG.2012.251;10.1109/VAST.2010.5652880;10.1109/TVCG.2013.166;10.1109/TVCG.2013.134;10.1109/TVCG.2017.2743859;10.1109/TVCG.2017.2744019;10.1109/TVCG.2012.204;10.1109/TVCG.2017.2744198;10.1109/TVCG.2017.2745219;10.1109/TVCG.2009.162;10.1109/TVCG.2012.237;10.1109/TVCG.2012.275;10.1109/INFVIS.1996.559216;10.1109/TVCG.2006.184,"Multiple coordinated views,wall-sized displays,mobile devices,distant interaction,physical navigation,user behavior,user movements,multi-user,collaborative data analysis",3,5,79,
SciVis,2018,CoDDA: A Flexible Copula-based Distribution Driven Analysis Framework for Large-Scale Multivariate Data,10.1109/TVCG.2018.2864801,http://dx.doi.org/10.1109/TVCG.2018.2864801,1214,1224,J,"CoDDA (Copula-based Distribution Driven Analysis) is a flexible framework for large-scale multivariate datasets. A common strategy to deal with large-scale scientific simulation data is to partition the simulation domain and create statistical data summaries. Instead of storing the high-resolution raw data from the simulation, storing the compact statistical data summaries results in reduced storage overhead and alleviated I/O bottleneck. Such summaries, often represented in the form of statistical probability distributions, can serve various post-hoc analysis and visualization tasks. However, for multivariate simulation data using standard multivariate distributions for creating data summaries is not feasible. They are either storage inefficient or are computationally expensive to be estimated in simulation time (in situ) for large number of variables. In this work, using copula functions, we propose a flexible multivariate distribution-based data modeling and analysis framework that offers significant data reduction and can be used in an in situ environment. The framework also facilitates in storing the associated spatial information along with the multivariate distributions in an efficient representation. Using the proposed multivariate data summaries, we perform various multivariate post-hoc analyses like query-driven visualization and sampling-based visualization. We evaluate our proposed method on multiple real-world multivariate scientific datasets. To demonstrate the efficacy of our framework in an in situ environment, we apply it on a large-scale flow simulation.",Subhashis Hazarika;Soumya Dutta;Han-Wei Shen;Jen-Ping Chen,Subhashis Hazarika;Soumya Dutta;Han-Wei Shen;Jen-Ping Chen,The Department of Computer Science and EngineeringGRAVITY research groupThe Ohio State University;The Department of Computer Science and EngineeringGRAVITY research groupThe Ohio State University;The Department of Computer Science and EngineeringGRAVITY research groupThe Ohio State University;The Department of Mechanical and Aerospace EngineeringThe Ohio State University,10.1109/TVCG.2015.2467958;10.1109/TVCG.2007.70519;10.1109/TVCG.2015.2467952;10.1109/TVCG.2016.2598604;10.1109/TVCG.2015.2467436;10.1109/TVCG.2015.2467204;10.1109/TVCG.2017.2744099;10.1109/TVCG.2007.70615;10.1109/VAST.2015.7347634;10.1109/TVCG.2006.165;10.1109/TVCG.2015.2467411,"In situ processing,Distribution-based,Multivariate,Query-driven,Copula",3,3,64,
SciVis,2018,Objective Vortex Corelines of Finite-sized Objects in Fluid Flows,10.1109/TVCG.2018.2864828,http://dx.doi.org/10.1109/TVCG.2018.2864828,956,966,J,"Vortices are one of the most-frequently studied phenomena in fluid flows. The center of the rotating motion is called the vortex coreline and its successful detection strongly depends on the choice of the reference frame. The optimal frame moves with the center of the vortex, which incidentally makes the observed fluid flow steady and thus standard vortex coreline extractors such as Sujudi-Haimes become applicable. Recently, an objective optimization framework was proposed that determines a near-steady reference frame for tracer particles. In this paper, we extend this technique to the detection of vortex corelines of inertial particles. An inertial particle is a finite-sized object that is carried by a fluid flow. In contrast to the usual tracer particles, they do not move tangentially with the flow, since they are subject to gravity and exhibit mass-dependent inertia. Their particle state is determined by their position and own velocity, which makes the search for the optimal frame a high-dimensional problem. We demonstrate in this paper that the objective detection of an inertial vortex coreline can be reduced in 2D to a critical point search in 2D. For 3D flows, however, the vortex coreline criterion remains a parallel vectors condition in 6D. To detect the vortex corelines we propose a recursive subdivision approach that is tailored to the underlying structure of the 6D vectors. The resulting algorithm is objective, and we demonstrate the vortex coreline extraction in a number of 2D and 3D vector fields.",Tobias Günther;Holger Theisel,Tobias Günther;Holger Theisel,Computer Graphics LaboratoryETH Zürich;Visual Computing GroupUniversity of Magdeburg,10.1109/VISUAL.1991.175773;10.1109/TVCG.2015.2467200;10.1109/TVCG.2014.2346415;10.1109/TVCG.2016.2599016;10.1109/VISUAL.1997.663910;10.1109/VISUAL.1999.809896;10.1109/VISUAL.1998.745296;10.1109/TVCG.2016.2599018;10.1109/VISUAL.2005.1532851;10.1109/TVCG.2007.70545,"Vortex extraction,inertial particles,objectivity,vortex coreline",3,1,81,
SciVis,2018,Shared-Memory Parallel Computation of Morse-Smale Complexes with Improved Accuracy,10.1109/TVCG.2018.2864848,http://dx.doi.org/10.1109/TVCG.2018.2864848,1183,1192,J,"Topological techniques have proven to be a powerful tool in the analysis and visualization of large-scale scientific data. In particular, the Morse-Smale complex and its various components provide a rich framework for robust feature definition and computation. Consequently, there now exist a number of approaches to compute Morse-Smale complexes for large-scale data in parallel. However, existing techniques are based on discrete concepts which produce the correct topological structure but are known to introduce grid artifacts in the resulting geometry. Here, we present a new approach that combines parallel streamline computation with combinatorial methods to construct a high-quality discrete Morse-Smale complex. In addition to being invariant to the orientation of the underlying grid, this algorithm allows users to selectively build a subset of features using high-quality geometry. In particular, a user may specifically select which ascending/descending manifolds are reconstructed with improved accuracy, focusing computational effort where it matters for subsequent analysis. This approach computes Morse-Smale complexes for larger data than previously feasible with significant speedups. We demonstrate and validate our approach using several examples from a variety of different scientific domains, and evaluate the performance of our method.",Attila Gyulassy;Peer-Timo Bremer;Valerio Pascucci,Attila Gyulassy;Peer-Timo Bremer;Valerio Pascucci,SCI InstituteUniversity of Utah;Lawrence Livermore National Lab;SCI InstituteUniversity of Utah,10.1109/TVCG.2012.209;10.1109/TVCG.2008.110;10.1109/TVCG.2007.70603;10.1109/TVCG.2014.2346434;10.1109/TVCG.2015.2467432;10.1109/VISUAL.2005.1532839;10.1109/TVCG.2011.249;10.1109/TVCG.2015.2467449;10.1109/TVCG.2006.186,"Morse complex,Parallel Computation,Topology,Accurate Geometry",3,5,36,
VAST,2018,BitExTract: Interactive Visualization for Extracting Bitcoin Exchange Intelligence,10.1109/TVCG.2018.2864814,http://dx.doi.org/10.1109/TVCG.2018.2864814,162,171,J,"The emerging prosperity of cryptocurrencies, such as Bitcoin, has come into the spotlight during the past few years. Cryptocurrency exchanges, which act as the gateway to this world, now play a dominant role in the circulation of Bitcoin. Thus, delving into the analysis of the transaction patterns of exchanges can shed light on the evolution and trends in the Bitcoin market, and participants can gain hints for identifying credible exchanges as well. Not only Bitcoin practitioners but also researchers in the financial domains are interested in the business intelligence behind the curtain. However, the task of multiple exchanges exploration and comparisons has been limited owing to the lack of efficient tools. Previous methods of visualizing Bitcoin data have mainly concentrated on tracking suspicious transaction logs, but it is cumbersome to analyze exchanges and their relationships with existing tools and methods. In this paper, we present BitExTract, an interactive visual analytics system, which, to the best of our knowledge, is the first attempt to explore the evolutionary transaction patterns of Bitcoin exchanges from two perspectives, namely, exchange versus exchange and exchange versus client. In particular, BitExTract summarizes the evolution of the Bitcoin market by observing the transactions between exchanges over time via a massive sequence view. A node-link diagram with ego-centered views depicts the trading network of exchanges and their temporal transaction distribution. Moreover, BitExTract embeds multiple parallel bars on a timeline to examine and compare the evolution patterns of transactions between different exchanges. Three case studies with novel insights demonstrate the effectiveness and usability of our system.",Xuanwu Yue;Xinhuan Shu;Xinyu Zhu;Xinnan Du;Zheqing Yu;Dimitrios Papadopoulos;Siyuan Liu,Xuanwu Yue;Xinhuan Shu;Xinyu Zhu;Xinnan Du;Zheqing Yu;Dimitrios Papadopoulos;Siyuan Liu,Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Penn State University,10.1109/TVCG.2008.117;10.1109/TVCG.2011.169;10.1109/VAST.2007.4389009;10.1109/TVCG.2009.180;10.1109/TVCG.2014.2346913,"Bitcoin exchange,transaction data,comparative analysis,visual analytics,FinTech",3,7,50,
VAST,2018,EnsembleLens: Ensemble-based Visual Exploration of Anomaly Detection Algorithms with Multidimensional Data,10.1109/TVCG.2018.2864825,http://dx.doi.org/10.1109/TVCG.2018.2864825,109,119,J,"The results of anomaly detection are sensitive to the choice of detection algorithms as they are specialized for different properties of data, especially for multidimensional data. Thus, it is vital to select the algorithm appropriately. To systematically select the algorithms, ensemble analysis techniques have been developed to support the assembly and comparison of heterogeneous algorithms. However, challenges remain due to the absence of the ground truth, interpretation, or evaluation of these anomaly detectors. In this paper, we present a visual analytics system named EnsembleLens that evaluates anomaly detection algorithms based on the ensemble analysis process. The system visualizes the ensemble processes and results by a set of novel visual designs and multiple coordinated contextual views to meet the requirements of correlation analysis, assessment and reasoning of anomaly detection algorithms. We also introduce an interactive analysis workflow that dynamically produces contextualized and interpretable data summaries that allow further refinements of exploration results based on user feedback. We demonstrate the effectiveness of EnsembleLens through a quantitative evaluation, three case studies with real-world data and interviews with two domain experts.",Ke Xu;Meng Xia;Xing Mu;Yun Wang 0012;Nan Cao,Ke Xu;Meng Xia;Xing Mu;Yun Wang;Nan Cao,Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;iDVxLabTongji University,10.1109/SciVis.2015.7429487;10.1109/TVCG.2017.2744419;10.1109/TVCG.2014.2346448;10.1109/TVCG.2015.2468093;10.1109/VISUAL.1990.146402;10.1109/TVCG.2017.2745178;10.1109/TVCG.2010.181;10.1109/TVCG.2016.2598830;10.1109/TVCG.2014.2346922,"Algorithm Evaluation,Ensemble Analysis,Anomaly Detection,Visual Analysis,Multidimensional Data",3,3,80,
VAST,2018,VIBR: Visualizing Bipartite Relations at Scale with the Minimum Description Length Principle,10.1109/TVCG.2018.2864826,http://dx.doi.org/10.1109/TVCG.2018.2864826,321,330,J,"Bipartite graphs model the key relations in many large scale real-world data: customers purchasing items, legislators voting for bills, people's affiliation with different social groups, faults occurring in vehicles, etc. However, it is challenging to visualize large scale bipartite graphs with tens of thousands or even more nodes or edges. In this paper, we propose a novel visual summarization technique for bipartite graphs based on the minimum description length (MDL) principle. The method simultaneously groups the two different set of nodes and constructs aggregated bipartite relations with balanced granularity and precision. It addresses the key trade-off that often occurs for visualizing large scale and noisy data: acquiring a clear and uncluttered overview while maximizing the information content in it. We formulate the visual summarization task as a co-clustering problem and propose an efficient algorithm based on locality sensitive hashing (LSH) that can easily scale to large graphs under reasonable interactive time constraints that previous related methods cannot satisfy. The method leads to the opportunity of introducing a visual analytics framework with multiple levels-of-detail to facilitate interactive data exploration. In the framework, we also introduce a compact visual design inspired by adjacency list representation of graphs as the building block for a small multiples display to compare the bipartite relations for different subsets of data. We showcase the applicability and effectiveness of our approach by applying it on synthetic data with ground truth and performing case studies on real-world datasets from two application domains including roll-call vote record analysis and vehicle fault pattern analysis. Interviews with experts in the political science community and the automotive industry further highlight the benefits of our approach.",Gromit Yeuk-Yin Chan;Panpan Xu;Zeng Dai;Ren Liu,Gromit Yeuk-Yin Chan;Panpan Xu;Zeng Dai;Liu Ren,"New York University;Bosch Research North America, Sunnyvale;Bosch Research North America, Sunnyvale;Bosch Research North America, Sunnyvale",10.1109/TVCG.2010.154;10.1109/TVCG.2012.252;10.1109/TVCG.2013.223;10.1109/INFVIS.2004.1;10.1109/TVCG.2016.2598831;10.1109/TVCG.2009.111;10.1109/TVCG.2014.2346279;10.1109/TVCG.2006.166;10.1109/VAST.2007.4389006;10.1109/TVCG.2015.2467813;10.1109/TVCG.2014.2346665;10.1109/TVCG.2016.2598591,"Bipartite Graph,Visual Summarization,Minimum Description Length,Information Theory",3,4,47,
VAST,2018,Visual Progression Analysis of Event Sequence Data,10.1109/TVCG.2018.2864885,http://dx.doi.org/10.1109/TVCG.2018.2864885,417,426,J,"Event sequence data is common to a broad range of application domains, from security to health care to scholarly communication. This form of data captures information about the progression of events for an individual entity (e.g., a computer network device; a patient; an author) in the form of a series of time-stamped observations. Moreover, each event is associated with an event type (e.g., a computer login attempt, or a hospital discharge). Analyses of event sequence data have been shown to help reveal important temporal patterns, such as clinical paths resulting in improved outcomes, or an understanding of common career trajectories for scholars. Moreover, recent research has demonstrated a variety of techniques designed to overcome methodological challenges such as large volumes of data and high dimensionality. However, the effective identification and analysis of latent stages of progression, which can allow for variation within different but similarly evolving event sequences, remain a significant challenge with important real-world motivations. In this paper, we propose an unsupervised stage analysis algorithm to identify semantically meaningful progression stages as well as the critical events which help define those stages. The algorithm follows three key steps: (1) event representation estimation, (2) event sequence warping and alignment, and (3) sequence segmentation. We also present a novel visualization system, ET<sup>2</sup>, which interactively illustrates the results of the stage analysis algorithm to help reveal evolution patterns across stages. Finally, we report three forms of evaluation for ET<sup>2</sup>: (1) case studies with two real-world datasets, (2) interviews with domain expert users, and (3) a performance evaluation on the progression analysis algorithm and the visualization design.",Shunan Guo;Zhuochen Jin;David Gotz;Fan Du;Hongyuan Zha;Nan Cao,Shunan Guo;Zhuochen Jin;David Gotz;Fan Du;Hongyuan Zha;Nan Cao,"East China Normal University;iDVX labTongji University;University of North Carolina, Chapel Hill;University of Maryland;East China Normal University;iDVX labTongji University",10.1109/TVCG.2011.188;10.1109/TVCG.2017.2745278;10.1109/TVCG.2017.2745083;10.1109/VAST.2016.7883512;10.1109/TVCG.2014.2346682;10.1109/TVCG.2017.2745320;10.1109/TVCG.2014.2346574;10.1109/TVCG.2009.187;10.1109/TVCG.2014.2346913,"Progression Analysis,Visual Analysis,Event Sequence Data",3,12,49,
VAST,2018,Doccurate: A Curation-Based Approach for Clinical Text Visualization,10.1109/TVCG.2018.2864905,http://dx.doi.org/10.1109/TVCG.2018.2864905,142,151,J,"Before seeing a patient, physicians seek to obtain an overview of the patient's medical history. Text plays a major role in this activity since it represents the bulk of the clinical documentation, but reviewing it quickly becomes onerous when patient charts grow too large. Text visualization methods have been widely explored to manage this large scale through visual summaries that rely on information retrieval algorithms to structure text and make it amenable to visualization. However, the integration with such automated approaches comes with a number of limitations, including significant error rates and the need for healthcare providers to fine-tune algorithms without expert knowledge of their inner mechanics. In addition, several of these approaches obscure or substitute the original clinical text and therefore fail to leverage qualitative and rhetorical flavours of the clinical notes. These drawbacks have limited the adoption of text visualization and other summarization technologies in clinical practice. In this work we present Doccurate, a novel system embodying a curation-based approach for the visualization of large clinical text datasets. Our approach offers automation auditing and customizability to physicians while also preserving and extensively linking to the original text. We discuss findings of a formal qualitative evaluation conducted with 6 domain experts, shedding light onto physicians' information needs, perceived strengths and limitations of automated tools, and the importance of customization while balancing efficiency. We also present use case scenarios to showcase Doccurate's envisioned usage in practice.",Nicole Sultanum;Devin Singh;Michael Brudno;Fanny Chevalier,Nicole Sultanum;Devin Singh;Michael Brudno;Fanny Chevalier,Hospital for Sick Children;Hospital for Sick Children;University of Toronto;University of Toronto,10.1109/VAST.2012.6400485;10.1109/TVCG.2015.2467531;10.1109/TVCG.2017.2745118;10.1109/INFVIS.2000.885098;10.1109/TVCG.2017.2744478;10.1109/TVCG.2015.2467591,"Visual Curation,Clinical Text,Text Visualization,Medical Narrative",3,2,40,
VAST,2018,GraphProtector: A Visual Interface for Employing and Assessing Multiple Privacy Preserving Graph Algorithms,10.1109/TVCG.2018.2865021,http://dx.doi.org/10.1109/TVCG.2018.2865021,193,203,J,"Analyzing social networks reveals the relationships between individuals and groups in the data. However, such analysis can also lead to privacy exposure (whether intentionally or inadvertently): leaking the real-world identity of ostensibly anonymous individuals. Most sanitization strategies modify the graph's structure based on hypothesized tactics that an adversary would employ. While combining multiple anonymization schemes provides a more comprehensive privacy protection, deciding the appropriate set of techniques-along with evaluating how applying the strategies will affect the utility of the anonymized results-remains a significant challenge. To address this problem, we introduce GraphProtector, a visual interface that guides a user through a privacy preservation pipeline. GraphProtector enables multiple privacy protection schemes which can be simultaneously combined together as a hybrid approach. To demonstrate the effectiveness of GraphPro tector, we report several case studies and feedback collected from interviews with expert users in various scenarios.",Xumeng Wang;Wei Chen 0001;Jia-Kai Chou;Chris Bryan;Huihua Guan;Wenlong Chen;Rusheng Pan;Kwan-Liu Ma,Xumeng Wang;Wei Chen;Jia-Kai Chou;Chris Bryan;Huihua Guan;Wenlong Chen;Rusheng Pan;Kwan-Liu Ma,"Zhejiang University;Zhejiang University;University of California, Davis;University of California, Davis;Zhejiang UniversityAlibaba Group;Zhejiang University;Zhejiang University;University of California, Davis",10.1109/TVCG.2011.163;10.1109/TVCG.2017.2745139;10.1109/TVCG.2014.2346920,"Graph privacy,k-anonymity,structural features,privacy preservation",3,6,57,
VAST,2018,Vulnus: Visual Vulnerability Analysis for Network Security,10.1109/TVCG.2018.2865028,http://dx.doi.org/10.1109/TVCG.2018.2865028,183,192,J,"Vulnerabilities represent one of the main weaknesses of IT systems and the availability of consolidated official data, like CVE (Common Vulnerabilities and Exposures), allows for using them to compute the paths an attacker is likely to follow. However, even if patches are available, business constraints or lack of resources create obstacles to their straightforward application. As a consequence, the security manager of a network needs to deal with a large number of vulnerabilities, making decisions on how to cope with them. This paper presents VULNUS (VULNerabilities visUal aSsessment), a visual analytics solution for dynamically inspecting the vulnerabilities spread on networks, allowing for a quick understanding of the network status and visually classifying nodes according to their vulnerabilities. Moreover, VULNUS computes the approximated optimal sequence of patches able to eliminate all the attack paths and allows for exploring sub-optimal patching strategies, simulating the effect of removing one or more vulnerabilities. VULNUS has been evaluated by domain experts using a lab-test experiment, investigating the effectiveness and efficiency of the proposed solution.",Marco Angelini;Graziano Blasilli;Tiziana Catarci;Simone Lenti;Giuseppe Santucci,Marco Angelini;Graziano Blasilli;Tiziana Catarci;Simone Lenti;Giuseppe Santucci,University of Rome “La Sapienza”;University of Rome “La Sapienza”;University of Rome “La Sapienza”;University of Rome “La Sapienza”;University of Rome “La Sapienza”,10.1109/TVCG.2007.70540;10.1109/TVCG.2007.70522;10.1109/INFVIS.2001.963283,"Visual Analytics,Network security,Vulnerability analysis,CVE,CVSS,Attack Graph,Vulnerability triage and management",3,5,46,
VAST,2018,Situ: Identifying and Explaining Suspicious Behavior in Networks,10.1109/TVCG.2018.2865029,http://dx.doi.org/10.1109/TVCG.2018.2865029,204,214,J,"Despite the best efforts of cyber security analysts, networked computing assets are routinely compromised, resulting in the loss of intellectual property, the disclosure of state secrets, and major financial damages. Anomaly detection methods are beneficial for detecting new types of attacks and abnormal network activity, but such algorithms can be difficult to understand and trust. Network operators and cyber analysts need fast and scalable tools to help identify suspicious behavior that bypasses automated security systems, but operators do not want another automated tool with algorithms they do not trust. Experts need tools to augment their own domain expertise and to provide a contextual understanding of suspicious behavior to help them make decisions. In this paper we present Situ, a visual analytics system for discovering suspicious behavior in streaming network data. Situ provides a scalable solution that combines anomaly detection with information visualization. The system's visualizations enable operators to identify and investigate the most anomalous events and IP addresses, and the tool provides context to help operators understand why they are anomalous. Finally, operators need tools that can be integrated into their workflow and with their existing tools. This paper describes the Situ platform and its deployment in an operational network setting. We discuss how operators are currently using the tool in a large organization's security operations center and present the results of expert reviews with professionals.",John R. Goodall;Eric D. Ragan;Chad A. Steed;Joel W. Reed;G. David Richardson;Kelly M. T. Huffer;Robert A. Bridges;Jason A. Laska,John R. Goodall;Eric D. Ragan;Chad A. Steed;Joel W. Reed;G. David Richardson;Kelly M.T. Huffer;Robert A. Bridges;Jason A. Laska,Oak Ridge National Laboratory;University of Florida;Oak Ridge National Laboratory;Oak Ridge National Laboratory;Oak Ridge National Laboratory;Oak Ridge National Laboratory;Oak Ridge National Laboratory;Oak Ridge National Laboratory,10.1109/TVCG.2007.70589,"Network security,situational awareness,privacy and security,streaming data,machine learning,visualization",3,8,55,
VAST,2018,"SIRIUS: Dual, Symmetric, Interactive Dimension Reductions",10.1109/TVCG.2018.2865047,http://dx.doi.org/10.1109/TVCG.2018.2865047,172,182,J,"Much research has been done regarding how to visualize and interact with observations and attributes of high-dimensional data for exploratory data analysis. From the analyst's perceptual and cognitive perspective, current visualization approaches typically treat the observations of the high-dimensional dataset very differently from the attributes. Often, the attributes are treated as inputs (e.g., sliders), and observations as outputs (e.g., projection plots), thus emphasizing investigation of the observations. However, there are many cases in which analysts wish to investigate both the observations and the attributes of the dataset, suggesting a symmetry between how analysts think about attributes and observations. To address this, we define SIRIUS (Symmetric Interactive Representations In a Unified System), a symmetric, dual projection technique to support exploratory data analysis of high-dimensional data. We provide an example implementation of SIRIUS and demonstrate how this symmetry affords additional insights.",Michelle Dowling;John E. Wenskovitch;J. T. Fry;Scotland Leman;Leanna House;Chris North 0001,Michelle Dowling;John Wenskovitch;J.T. Fry;Scotland Leman;Leanna House;Chris North,Virginia Tech Department of Computer Science;Virginia Tech Department of Computer Science;Virginia Tech Department of Statistics;Virginia Tech Department of Statistics;Virginia Tech Department of Statistics;Virginia Tech Department of Computer Science,10.1109/VAST.2012.6400493;10.1109/INFVIS.2005.1532136;10.1109/VAST.2014.7042492;10.1109/VAST.2012.6400486;10.1109/TVCG.2015.2467552;10.1109/VAST.2010.5652443;10.1109/TVCG.2012.260;10.1109/VAST.2011.6102449;10.1109/TVCG.2011.220;10.1109/TVCG.2016.2598445;10.1109/TVCG.2016.2598446;10.1109/INFVIS.2003.1249020;10.1109/TVCG.2008.173;10.1109/TVCG.2011.178;10.1109/TVCG.2012.256;10.1109/TVCG.2016.2598479;10.1109/TVCG.2013.150,"Dimension reduction,semantic interaction,exploratory data analysis,observation projection,attribute projection",3,4,59,
VAST,2018,EmbeddingVis: A Visual Analytics Approach to Comparative Network Embedding Inspection,10.1109/VAST.2018.8802454,http://dx.doi.org/10.1109/VAST.2018.8802454,48,59,C,"Constructing latent vector representation for nodes in a network through embedding models has shown its practicality in many graph analysis applications, such as node classification, clustering, and link prediction. However, despite the high efficiency and accuracy of learning an embedding model, people have little clue of what information about the original network is preserved in the embedding vectors. The abstractness of low-dimensional vector representation, stochastic nature of the construction process, and non-transparent hyper-parameters all obscure understanding of network embedding results. Visualization techniques have been introduced to facilitate embedding vector inspection, usually by projecting the embedding space to a two-dimensional display. Although the existing visualization methods allow simple examination of the structure of embedding space, they cannot support in-depth exploration of the embedding vectors. In this paper, we design an exploratory visual analytics system that supports the comparative visual interpretation of embedding vectors at the cluster, instance, and structural levels. To be more specific, it facilitates comparison of what and how node metrics are preserved across different embedding models and investigation of relationships between node metrics and selected embedding vectors. Several case studies confirm the efficacy of our system. Experts' feedback suggests that our approach indeed helps them better embrace the understanding of network embedding models.",Quan Li;Kristanto Sean Njotoprawiro;Hammad Haleem;Qiaoan Chen;Chris Yi;Xiaojuan Ma,Quan Li;Kristanto Sean Njotoprawiro;Hammad Haleem;Qiaoan Chen;Chris Yi;Xiaojuan Ma,"Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong;Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong;Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong;WeChat, Tencent Technology (Shenzhen) Co., Ltd., Shenzhen, China;WeChat, Tencent Technology (Shenzhen) Co., Ltd., Shenzhen, China;Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong",10.1109/TVCG.2007.70521;10.1109/TVCG.2013.173;10.1109/VISUAL.1990.146402;10.1109/TVCG.2016.2598415;10.1109/TVCG.2017.2745141;10.1109/TVCG.2016.2598838;10.1109/TVCG.2015.2468151,"Human-centered computing,Visualization,Visualization application domains,Visual analytics,Human-centered computing,Visualization,Visualization design and evaluation methods",3,2,0,
VAST,2018,Analyzing the Noise Robustness of Deep Neural Networks,10.1109/VAST.2018.8802509,http://dx.doi.org/10.1109/VAST.2018.8802509,60,71,C,"Deep neural networks (DNNs) are vulnerable to maliciously generated adversarial examples. These examples are intentionally designed by making imperceptible perturbations and often mislead a DNN into making an incorrect prediction. This phenomenon means that there is significant risk in applying DNNs to safety-critical applications, such as driverless cars. To address this issue, we present a visual analytics approach to explain the primary cause of the wrong predictions introduced by adversarial examples. The key is to analyze the datapaths of the adversarial examples and compare them with those of the normal examples. A datapath is a group of critical neurons and their connections. To this end, we formulate the datapath extraction as a subset selection problem and approximately solve it based on back-propagation. A multi-level visualization consisting of a segmented DAG (layer level), an Euler diagram (feature map level), and a heat map (neuron level), has been designed to help experts investigate datapaths from the high-level layers to the detailed neuron activations. Two case studies are conducted that demonstrate the promise of our approach in support of explaining the working mechanism of adversarial examples.",Mengchen Liu;Shixia Liu;Hang Su 0006;Kelei Cao;Jun Zhu 0001,Mengchen Liu;Shixia Liu;Hang Su;Kelei Cao;Jun Zhu,"School of Software, Tsinghua University;School of Software, Tsinghua University;Dept.of Comp.Sci.Tech., Tsinghua University;School of Software, Tsinghua University;Dept.of Comp.Sci.Tech., Tsinghua University",10.1109/TVCG.2015.2467618;10.1109/TVCG.2011.186;10.1109/TVCG.2016.2598496;10.1109/TVCG.2017.2744683;10.1109/TVCG.2014.2346431;10.1109/TVCG.2014.2346433;10.1109/TVCG.2017.2744199;10.1109/TVCG.2017.2744718;10.1109/TVCG.2017.2744938;10.1109/TVCG.2016.2598831;10.1109/TVCG.2013.196;10.1109/TVCG.2011.209;10.1109/TVCG.2017.2744358;10.1109/TVCG.2016.2598838;10.1109/TVCG.2010.210;10.1109/TVCG.2017.2744018;10.1109/TVCG.2011.183;10.1109/TVCG.2017.2744158;10.1109/VISUAL.2005.1532820;10.1109/VAST.2014.7042494;10.1109/TVCG.2017.2744878;10.1109/TVCG.2018.2865041,"Deep neural networks,robustness,adversarial examples,back propagation,multi-level visualization.",3,9,0,
Vis,1990,Displaying voxel-based objects according to their qualitative shape synthesis,10.1109/VISUAL.1990.146364,http://dx.doi.org/10.1109/VISUAL.1990.146364,51,"58, 463-4",C,"The use of qualitative shape synthesis for the display of 3-D binary objects is presented. The proposed approach is applicable to multi-object scenes and to outdoor scenery as well. It makes use of a new method, the diffusion process, that simulates diffusion of particles within the interior of a 3-D discrete object. Starting with initial concentrations of particles at the boundary-voxels, the diffusion procedure simulates the propagation of these particles inwards. Boundary voxels of the object are colored according to the concentration of particles obtained by suspending the diffusion process. This method assists shape characterization by providing a qualitative measure of boundary curvature and was used in achieving display of a variety of voxel-based objects. Examples of the use of this approach on synthetic, terrain, and range data, are provided.&lt;&lt;ETX&gt;&gt;",Yaser Yacoob,Y. Yacoob,"Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA",,,2,0,34,
Vis,1990,Visualization of free form volumes,10.1109/VISUAL.1990.146403,http://dx.doi.org/10.1109/VISUAL.1990.146403,379,386,C,"An algorithm that creates planar and arbitrarily curved sections of free-form volumes is presented. The definition of free-form volumes generalizes techniques from free-form curves and surfaces to trivariate representation. The definition is given for volumes in the Bernstein-Bezier representation. The author illustrates an intersection algorithm that can be used to perform intersection operations on free-form volumes. Some calculated examples are given. The algorithm can be used as a subroutine for algorithms which are able to perform more general intersections of free-form volumes, e.g. Boolean operations on two free-form volumes.&lt;&lt;ETX&gt;&gt;",Dieter Lasser,D. Lasser,"Fachbereich Inf., Kaiserslautern Univ., Germany",,,2,0,25,
Vis,1990,Visualization for nonlinear engineering FEM analysis in manufacturing,10.1109/VISUAL.1990.146412,http://dx.doi.org/10.1109/VISUAL.1990.146412,422,"423, 490",C,"This case study describes how visualization tools were used in a nonlinear finite-element method (FEM) analysis of rivet deformation. After summarizing the problem at hand, it is concluded that three factors that aided the visualization process in this case can be extracted as general principles: first, focus the viewer on the area of interest; second, do not confuse the viewer with strange color scales; and finally, do not try to convey too much information in one image. Images should convey a maximum amount of information with a minimum of confusion. In this particular case the most useful techniques proved to be animations of color-shaded contours, where the viewer could zoom in on any area of particular interest. Animation was used for each of the seven different data types produced by the analysis package.&lt;&lt;ETX&gt;&gt;",Gerald W. Edgar,G.W. Edgar,"Boeing Comput. Services, Seattle, WA, USA",,,2,0,3,
Vis,1991,Gray scale diagrams as business charts,10.1109/VISUAL.1991.175791,http://dx.doi.org/10.1109/VISUAL.1991.175791,140,147,C,"Gray-scale diagrams, which can present large amounts of quantitative information in a compact format, are considered as a candidate for business charts. Hundreds of data points can easily be represented in one diagram, using small gray-scale squares (or tiles), without visually overloading a viewer. An experiment was done to compare the subjects' responses to questions from three types of charts, traditional column and line charts and gray-scale tile charts. The results showed that questions were answered more correctly and more quickly using gray-scale tile charts than using traditional charts. However, subjects reported they experienced more strain using gray-scale charts.&lt;&lt;ETX&gt;&gt;",W. R. Feeney,W.R. Feeney,"Dept. of Inf. & Decisions Syst., San Diego State Univ., San Diego, CA, USA",,,2,1,12,
Vis,1992,The microscopist's workstation,10.1109/VISUAL.1992.235177,http://dx.doi.org/10.1109/VISUAL.1992.235177,419,423,C,"Issues involved in operating a sophisticated scientific instrument as a computer peripheral accessible over a high-speed network are studied. A custom interactive visualization application was constructed to support investigation using a unique computer-controlled high-voltage electron microscope. The researcher's workstation forms the visible third of a triumvirate, along with the instrument and the compute resource. The software was designed to support not only image acquisition, but also many of the tasks that microscope researchers perform in analyzing images. The result of this case study is the identification of some of the issues regarding interacting with scientific instrumentation over high-speed networks and the construction of custom applications to support many of the tasks within a laboratory's research methodology.&lt;&lt;ETX&gt;&gt;",Philip J. Mercurio;T. Todd Elvins;Stephen J. Young,P.J. Mercurio;T.T. Elvins;S.J. Young,"San Diego Supercomput. Center, CA, USA;San Diego Supercomput. Center, CA, USA",10.1109/VISUAL.1991.175807,,2,0,18,
Vis,1992,Visualizing the Universe,10.1109/VISUAL.1992.235181,http://dx.doi.org/10.1109/VISUAL.1992.235181,390,397,C,"A Universe mapping project at the Harvard-Smithsonian Center for Astrophysics (CfA), called the CfA Redshift Survey, is described. The line-of-sight recession velocities of galaxies are measured by identifying absorption and emission lines in their spectra. With the two angular positions of a galaxy on the sky and a measurement of its red-shift, each galaxy can be placed in a three-dimensional (3-D) map of the Universe. It is shown that visualization techniques are important for exploring and analyzing the data, for comparing the data with models, and for designing the future. Computer animation of the data is a way of bringing the maps before the public.&lt;&lt;ETX&gt;&gt;",M. J. Geller;E. E. Flaco;D. G. Fabricant;B. Estus,M.J. Geller;E.E. Falco;D.G. Fabricant;B. Estus,"Harvard-Smithsonian Center for Astrophys., Cambridge, MA, USA;Harvard-Smithsonian Center for Astrophys., Cambridge, MA, USA;Harvard-Smithsonian Center for Astrophys., Cambridge, MA, USA",,,2,1,9,
Vis,1992,Network video device control,10.1109/VISUAL.1992.235195,http://dx.doi.org/10.1109/VISUAL.1992.235195,299,306,C,"Work in progress at the San Diego Supercomputer Center (SDSC) involving the implementation of network clients and servers to provide networkwide access to video devices is described. Applications anywhere on the net can manage record and playback operations, change video signal routing, or adjust scan converter parameters. Details of network communications, protocols, and device-specific control quirks are invisible to the user, making the video equipment a true network resource.&lt;&lt;ETX&gt;&gt;",David R. Nadeau;Michael J. Bailey,D.R. Nadeau;M.J. Bailey,"Adv. Sci. Visualization Lab., San Diego, CA, USA;Adv. Sci. Visualization Lab., San Diego, CA, USA",10.1109/VISUAL.1991.175814,,2,0,20,
Vis,1992,An efficient range search algorithm for visualizing extrema of volume data,10.1109/VISUAL.1992.235216,http://dx.doi.org/10.1109/VISUAL.1992.235216,132,138,C,"A fast range search algorithm for visualizing extrema of d-dimensional volume data in real time as the user interactively moves the query range is presented. The algorithm is based on an efficient data structure, called index heap, which needs only O(N/log N) space and O(d2/sup d/N) preprocessing time to be set up, where N is the size of the d-dimensional data volume. The algorithm can answer an extremum query in O(4/sup d/) expected time, and its worst-case time complexity is O(2/sup d/ log N) per query. For dimensions two and three, the range search for extrema is effected in average O(1) time per query independently of the size of query range. Unlike previous range query algorithms in the computational geometry literature, the proposed algorithm is very simple and can be easily implemented.&lt;&lt;ETX&gt;&gt;",X. Wu;Y. Fang,X. Wu;Y. Fang,"Dept. of Comput. Sci., Western Ontario Univ., London, Ont., Canada",,"Visualization of volume data, multidimensional range search, computational geometry, algorithms, data structures, expected time complexity, nearest common ancestor",2,1,4,
Vis,1993,Visualizing results of transient flow simulations,10.1109/VISUAL.1993.398896,http://dx.doi.org/10.1109/VISUAL.1993.398896,406,409,C,"This work briefly describes our approach to visualize results of transient flow simulations in the application areas of groundwater flow and pollutant transport as well as compressible fluid flow in engine parts. The simulations use finite element data structures and can have geometries which change over time. We designed a client-server model to handle the huge amount of data that can be obtained either directly from the simulation process or from files on disk. As standard visualization packages are not able to cope with transient unstructured data, we implemented streamlines, stream surfaces and particle systems as our main visualization methods. Our experiences and results with these techniques are discussed in this paper.&lt;&lt;ETX&gt;&gt;",H. F. Mayer;B. Tabatabai,H.F. Mayer;B. Tabatabai,"Joanneum Res., Graz, Austria;Joanneum Res., Graz, Austria",10.1109/VISUAL.1991.175771,,2,0,10,
Vis,1995,A model and a system for data-parallel program visualization,10.1109/VISUAL.1995.480816,http://dx.doi.org/10.1109/VISUAL.1995.480816,224,"231, 456",C,Parallel program visualization and debugging require new techniques for gathering and displaying execution trace and profile data. Interaction with the program during execution is also required to facilitate parallel debugging. We discuss the difficulties associated with runtime user/program interaction and how the data-parallel programming paradigm facilitates much more liberal runtime interaction than typical MIMD-based models. We present a model for data-parallel program visualization that addresses both data collection/interaction and visualization issues. We follow our model presentation with the design and implementation of a subset of our visualization model. We discuss our preliminary findings and propose future research directions.,Thomas A. Wagner;R. Daniel Bergeron,T.A. Wagner;R.D. Bergeron,"Massachusetts Univ., Amherst, MA, USA",10.1109/VISUAL.1991.175809,,2,2,13,
Vis,1995,Visualization for aerodynamic design of helicopter rotor blades,10.1109/VISUAL.1995.485150,http://dx.doi.org/10.1109/VISUAL.1995.485150,351,"354, 472",C,"Visualization, animation, and simulation techniques are applied to the problem of rotor design for helicopters. Periodic unsteady experimental velocity data (laser Doppler velocimetry or LDV) in two dimensions and velocity data derived from simulated vortex systems in three dimensions are compared using the same visual tools. Animations show the development of rotor wake systems and induced velocities over time. Modified particle trace integration schemes are used to calculate steady streamlines and unsteady particle paths for both kinds of data. In an extension of this work, a virtual environment (VE) system was used to view the wake vortex system and an interactive probe was used to explore the induced velocity field. Future work will enable interactive visual debugging and simulation steering.",G. David Kerlick,G.D. Kerlick,"Boeing Inf. & Support Services Res. & Technol., Bellevue, WA, USA",,,2,1,7,
Vis,1995,Interactive 3D visualization of actual anatomy and simulated chemical time-course data for fish,10.1109/VISUAL.1995.485169,http://dx.doi.org/10.1109/VISUAL.1995.485169,393,"396, 481",C,"Outputs from a physiologically based toxicokinetic (PB-TK) model for fish were visualized by mapping time series data for specific tissues onto a three dimensional representation of a rainbow trout. The trout representation was generated in stepwise fashion: cross sectional images were obtained from an anesthetized fish using a magnetic resonance imaging (MRI) system; images were processed to classify tissue types; images were stacked and processed to create a three dimensional representation of the fish, encapsulating five volumes corresponding to the liver, kidney, muscle, gastrointestinal tract, and fat. Kinetic data for the disposition of pentachloroethane in trout were generated using a PB-TK model. Model outputs were mapped onto corresponding tissue volumes, representing chemical concentration as color intensity. The visualization was then animated, to show the accumulation of pentachloroethane in each tissue during a continuous branchial (gill) exposure.",Penny Rheingans;John Nichols,P. Rheingans;M. Marietta;J. Nichols,"Sci. Visualization Lab., US Environ. Protection Agency, Research Triangle Park, NC, USA;Sci. Visualization Lab., US Environ. Protection Agency, Research Triangle Park, NC, USA",,,2,2,9,
InfoVis,1996,Interactive visualization of multiway tables,10.1109/INFVIS.1996.559221,http://dx.doi.org/10.1109/INFVIS.1996.559221,68,"69, 124",M,Many business data visualization applications involve large databases with dozens of fields and millions of rows. Interactive visualization of these databases is difficult because of the large amount of data involved. We present a method of summarizing large databases which is well suited to interactive visualization. We illustrate this with a visualization tool for the domain of call billing data.,Kenneth C. Cox;Dianne Hackborn,K.C. Cox;D. Hackborn,"Lucent Technol., Bell Labs., Naperville, IL, USA",,,2,0,6,
Vis,1996,A visualization tool for mechanical design,10.1109/VISUAL.1996.568142,http://dx.doi.org/10.1109/VISUAL.1996.568142,401,403,C,"We present a new visualization approach to support design for manufacturing (DFM). This involves the correlation of manufacturing problems with the causative geometric characteristics. We then discuss the use of distance transform and 3-D thinning to extract these characteristics from a voxelized object. In contrast to current computer aided engineering (CAE) tools, our system is very efficient and simple to use. It does not require the skill and experience to generate and control a numerical mesh and interpret the results. The specifically tailored visualization system makes the results self-evident. Though the current domain is die casting, it could potentially be applied to many net shape processes.",Shao-Chiung Lu;Alec B. Rebello;D. H. Cui;Roni Yagel;R. A. Miller;Gary L. Kinzel,S.C. Lu;A.B. Rebello;D.H. Cui;R. Yagel;R.A. Miller;G.L. Kinzel,"Center for Die Casting, Ohio State Univ., Columbus, OH, USA",,,2,0,11,
Vis,1996,Interactive Exploration and Modeling of Large Data Sets: A Case Study with Venus Light Scattering Data,10.1109/VISUAL.1996.568150,http://doi.ieeecomputersociety.org/10.1109/VISUAL.1996.568150,433,438,C,"We present a system where visualization and the control of the simulation are integrated to facilitate interactive exploration and modeling of large data sets. The system was developed to estimate properties of the atmosphere of Venus from comparison between measured and simulated data. Reuse of results, distributed computing, and multiple views on the data were the major ingredients to create an effective environment.",Jarke J. van Wijk;Hans J. W. Spoelder;Willem-Jan Knibbe;Kamran Eftekhari Shahroudi,J.J. van Wijk;H.J.W. Spoelder;W.-J. Knibbe;K.E. Shahroudi,"Netherlands Energy Res. Found., Petten, Netherlands",10.1109/VISUAL.1995.485143,,2,1,0,
Vis,1997,Auralization of streamline vorticity in computational fluid dynamics data,10.1109/VISUAL.1997.663856,http://dx.doi.org/10.1109/VISUAL.1997.663856,51,57,C,Presents a new method for auralization of the vorticity of a streamline in a vector field. This technique involves using a composite tone formed by superimposing sine waves of various amplitudes whose frequency and amplitude vary in such a way as to give the perception that the resulting sound increases or decreases endlessly in pitch without ever extending beyond the listener's range of audible frequencies. Continuous clockwise or counterclockwise rotations of a streamline resulting from vorticity can then be displayed aurally as an apparently continuous increase or decrease in pitch.,Christopher R. Volpe;Ephraim P. Glinert,C.R. Volpe;E.P. Glinert,"GE Corp. Res. & Dev., Schenectady, NY, USA",10.1109/VISUAL.1991.175789;10.1109/VISUAL.1990.146398;10.1109/VISUAL.1992.235205;10.1109/VISUAL.1995.480802,,2,1,12,
Vis,1997,Determination of unknown particle charges in a thunder cloud based upon detected electric field vectors,10.1109/VISUAL.1997.663926,http://dx.doi.org/10.1109/VISUAL.1997.663926,479,482,C,"Climatological data about thunderstorms is traditionally collected by balloons or planes traveling through the storm along straight tracts. Such data lends itself to simple 2D representations. The data described in this paper was gathered by a sail plane spiraling in an updraft within a thundercloud. The more complex organization of data samples demands more complex representation methods. This paper describes a system developed using the Visualization Toolkit (VTK) to explore such data. The data consists of several scalar values and a set of vector values associated with positional data on the measuring devices. The goal of this visualization is to explore the location of point charges suggested by the electromagnetic field vectors and determine if any correlation exists between the point charge location and standard cloud microstructure scalar measurements such as temperature. There are several problems associated with visualizing this rather unique set of data. They stem from the fact that the data is a sparse spiraling sample of scalars and vectors. The system allows the track of the plane to be displayed as a line, a tube or a ribbon; scalar values can be displayed as transparent isosurfaces; and the vector data as an arrow plot along that track, given a color that is constant, based on orientation or related to the value of a scalar. Any combination of methods can be used to display the data. A single primitive can be overloaded in many ways, or several different variables can all be displayed simultaneously.",Dan Drake;Thomas Simpson;Larry Smithmier;Penny Rheingans,D. Drake;T. Simpson;L. Smithmier;P. Rheingans,"Dept. of Comput. Sci., Mississippi Univ., MS, USA",10.1109/VISUAL.1996.567777;10.1109/VISUAL.1994.346313;10.1109/VISUAL.1993.398850;10.1109/VISUAL.1996.568139;10.1109/VISUAL.1996.567752,,2,1,10,
Vis,1999,Why the PC will be the most pervasive visualization platform in 2001,10.1109/VISUAL.1999.809938,http://dx.doi.org/10.1109/VISUAL.1999.809938,481,483,M,,Hanspeter Pfister;Michel Cox;Peter N. Glaskowsky;William E. Lorensen;Richard Greco,H. Pfister,MERL,,,2,1,0,
Vis,2000,Simplification of surface annotations,10.1109/VISUAL.2000.885700,http://dx.doi.org/10.1109/VISUAL.2000.885700,235,242,C,"Geometric models are often annotated to provide additional information during visualization. Maps may be marked with rivers, roads or topographical information, and CAD data models may highlight the underlying mesh structure. While this additional information may be extremely useful, there is a rendering cost associated with it. Texture maps have often been used to convey this information at relatively low cost, but they suffer from blurring and pixelization at high magnification. We present a technique for simplifying surface annotations based on directed, asymmetric tolerance. By maintaining the annotations as geometry, as opposed to textures, we are able to simplify them while still maintaining the overall appearance of the model over a wide range of magnifications. Texture maps may still be used to provide low-resolution surface detail, such as color. We demonstrate a significant gain in rendering performance while retaining the original appearance of objects from many application domains.",Frank Suits;James T. Klosowski;William P. Horn;Gérard Lecina,F. Suits;J.T. Klosowski;W.P. Horn;G. Lecina,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.1998.745285,"simplification, polygonal path, mesh, CAD/CAM,FEM, cartography",2,0,15,
Vis,2003,Visualization of steep breaking waves and thin spray sheets around a ship,10.1109/VISUAL.2003.1250419,http://dx.doi.org/10.1109/VISUAL.2003.1250419,555,559,C,"The simulation of breaking of waves, the formation of thin spray sheets, and the entertainment of air around the next generation of naval surface combatants is an ongoing 3-year Department of Defense (DoD) Challenge Project. The goal of this project is a validated computation capability to model the full hydrodynamics around a surface combatant including all of the processes that affect mission and performance. Visualization of these large-scale simulations is paramount to understanding the complex physics involved. These simulations produce enormous data sets with both surface and volumetric qualities. Wave breaking, spray sheets, and air entertainment can be visualized using isosurfaces of scalar data. Visualization of quantities such as the vorticity field also provides insight into the dynamics of droplet and bubble formation. This paper documents the techniques used, results obtained, and lessons learned from the visualization of the hydrodynamics of naval vessels.",Paul Adams;Douglas Dommermuth,P. Adams;D. Dommermuth,"ERDC, Major Shared Resource Center, Vicksburg, MS, USA",10.1109/VISUAL.1999.809891;10.1109/VISUAL.2000.885704;10.1109/VISUAL.2002.1183821;10.1109/VISUAL.1997.663869,"isosurfaces, marching cubes, multilevel parallelism",2,2,17,
Vis,2003,Accelerating large data analysis by exploiting regularities,10.1109/VISUAL.2003.1250420,http://dx.doi.org/10.1109/VISUAL.2003.1250420,561,568,C,"We present techniques for discovering and exploiting regularity in large curvilinear data sets. The data can be based on a single mesh or a mesh composed of multiple submeshes (also known as zones). Multi-zone data are typical in Computational Fluid Dynamics (CFD) simulations. Regularities include axis-aligned rectilinear and cylindrical meshes as well as cases where one zone is equivalent to a rigid body transformation of another. Our algorithms can also discover rigid-body motion of meshes in time-series data. Next, we describe a data model where we can utilize the results from the discovery process in order to accelerate large data visualizations. Where possible, we replace general curvilinear zones with rectilinear or cylindrical zones. In rigid-body motion cases, we replace a time-series of meshes with a transformed mesh object where a reference mesh is dynamically transformed based on a given time value in order to satisfy geometry requests, on demand. The data model enables us to make these substitutions and dynamic transformations transparently with respect to the visualization algorithms. We present results with large data sets where we combine our mesh replacement and transformation techniques with out-of-core paging in order to achieve analysis speedups ranging from 1.5 to 2.",David Ellsworth;Patrick J. Moran,D. Ellsworth;P.J. Moran,"Adv. Manage. Technol. Inc., NASA Ames Res. Center, Moffett Field, CA, USA",10.1109/VISUAL.1999.809910;10.1109/VISUAL.1998.745299;10.1109/VISUAL.1997.663888;10.1109/VISUAL.1997.663895;10.1109/VISUAL.1994.346311;10.1109/VISUAL.1999.809879;10.1109/VISUAL.1999.809891;10.1109/VISUAL.1998.745298;10.1109/VISUAL.1992.235219;10.1109/VISUAL.1994.346304;10.1109/VISUAL.1991.175818;10.1109/VISUAL.1995.480821," regularity finding, data models, object-oriented, C++, templates, scientific visualization, paging, demand-driven evaluation",2,1,31,
InfoVis,2004,Case Study: Visualizing Visualization,10.1109/INFVIS.2004.14,http://dx.doi.org/10.1109/INFVIS.2004.14,r5,r5,M,"In this case study we attempt to visualize a real-world dataset consisting of 600 recently published information visualization papers and their references. This is done by first creating a global layout of the entire graph that preserves any cluster structure present. We then use this layout as a basis to define a hierarchical clustering. The clusters in this hierarchy are labelled using keywords supplied with the dataset, allowing insight into the clusters semantics.",Frank van Ham,F. van Ham,Technische Universiteit Eindhoven,,,2,1,3,
InfoVis,2004,"Creating and Managing ""Lookmarks"" in ParaView",10.1109/INFVIS.2004.16,http://dx.doi.org/10.1109/INFVIS.2004.16,19,19,M,"This paper describes the integration of lookmarks into the ParaView visualization tool. Lookmarks are pointers to views of specific parts of a dataset. They were so named because lookmarks are to a visualization tool and dataset as bookmarks are to a browser and the World Wide Web. A lookmark can be saved and organized among other lookmarks within the context of ParaView. Then at a later time, either in the same ParaView session or in a different one, it can be regenerated, displaying the exact view of the data that had previously been saved. This allows the user to pick up where they left off, to continue to adjust the view or otherwise manipulate the data. Lookmarks facilitate collaboration between users who wish to share views of a dataset. They enable more effective data comparison because they can be applied to other datasets. They also serve as a way of organizing a user’s data. Ultimately, a lookmark is a time-saving tool that automates the recreation of a complex view of the data.",Eric T. Stanton;W. Philip Kegelmeyer,E.T. Stanton;W.P. Kegelmeyer,Sandia National Laboratories,,,2,1,2,
InfoVis,2004,EventScope: Bringing Remote Experience of Mars to the Public through Telepresence,10.1109/INFVIS.2004.20,http://dx.doi.org/10.1109/INFVIS.2004.20,16,16,M,"Telepresence, experiencing a place without physically being there, offers an important means for the public experience of remote locations such as distant continents or other planets. EventScope presents one such telepresence visualization interface for bringing scientific missions to the public. Currently, remote experience lessons based on NASA’s Mars Exploration Rover missions are being made available through the EventScope framework to museums, classrooms, and the public at large.",Eben Myers;Peter Coppin;Michael D. Wagner;Karl Fischer;Luisa Lu;W. Ronald McCloskey;David Seneker,E. Myers;P. Coppin;M. Wagner;K. Fischer;Luisa Lu;W.R. McCloskey;D. Seneker,"Platform Digital, LLC",,,2,0,5,
Vis,2004,VisBiz: A Simplified Visualization of Business Operation,10.1109/VISUAL.2004.109,http://dx.doi.org/10.1109/VISUAL.2004.109,1,1,M,,Ming C. Hao;Daniel A. Keim;Umeshwar Dayal,Ming C. Hao;D.A. Keim;U. Dayal,Hewlett Packard Research Laboratories,,,2,0,1,
Vis,2004,Visualization of salt-induced stress perturbations,10.1109/VISUAL.2004.115,http://dx.doi.org/10.1109/VISUAL.2004.115,369,376,C,"An important challenge encountered during post-processing of finite element analyses is the visualizing of three-dimensional fields of real-valued second-order tensors. Namely, as finite element meshes become more complex and detailed, evaluation and presentation of the principal stresses becomes correspondingly problematic. In this paper, we describe techniques used to visualize simulations of perturbed in-situ stress fields associated with hypothetical salt bodies in the Gulf of Mexico. We present an adaptation of the Mohr diagram, a graphical paper and pencil method used by the material mechanics community for estimating coordinate transformations for stress tensors, as a new tensor glyph for dynamically exploring tensor variables within three-dimensional finite element models. This interactive glyph can be used as either a probe or a filter through brushing and linking.",Patricia Crossno;David H. Rogers;Rebecca M. Brannon;David Coblentz,P. Crossno;D.H. Rogers;R.M. Brannon;D. Coblentz,"Sandia Nat. Labs., Albuquerque, NM, USA;Sandia Nat. Labs., Albuquerque, NM, USA;Sandia Nat. Labs., Albuquerque, NM, USA",10.1109/VISUAL.1997.663929;10.1109/VISUAL.1992.235193;10.1109/VISUAL.1998.745294;10.1109/VISUAL.1993.398849;10.1109/VISUAL.1995.485141;10.1109/VISUAL.1999.809894;10.1109/VISUAL.1999.809905;10.1109/VISUAL.2002.1183819;10.1109/VISUAL.2002.1183797;10.1109/VISUAL.1997.663857;10.1109/VISUAL.1994.346326,"tensor field visualization, Mohr's circles, visual debugging, finite element codes and simulations",2,2,26,
Vis,2004,Visualizing Botanical Trees over Four Seasons,10.1109/VISUAL.2004.119,http://dx.doi.org/10.1109/VISUAL.2004.119,13,13,M,,Derek Bradley,D. Bradley,Carleton University,,,2,0,6,
Vis,2004,Self-illustrating phenomena,10.1109/VISUAL.2004.12,http://dx.doi.org/10.1109/VISUAL.2004.12,xix,,M,"Summary form only given. A self-illustrating phenomenon is an image which exposes the science behind it. Some famous examples are pictures of iron filings aligned along magnetic lines of force, sand particles collecting at the stationary points of the standing waves of a violin, stress in a mechanical part revealed through birefringence, and particle tracks in a bubble chamber. Such images brilliantly combine experimental design, analysis, and visualization. Quoting J. Tukey, ""the general purposes of conducting experiments and analyzing data match, point by point"". We argue in this talk that computer tools for visual analysis should normally be conceived of as aids in constructing computational visual experiments; and that the resulting visualizations be consciously designed to help validate or invalidate the hypothesis being tested by the experiment.",Pat Hanrahan,P. Hanrahan,"Comput. Sci. & Electr. Eng., Stanford Univ., CA, USA",,,2,2,0,
Vis,2004,Force-Feedback-Enhanced Navigation for Interactive Visualization of Coronary Vessels,10.1109/VISUAL.2004.33,http://dx.doi.org/10.1109/VISUAL.2004.33,32,32,M,"Coronary heart disease (CHD) is the number one killer in the United States. Although it is well known that CHD mainly occurs due to blocked arteries, there are contradictory results from studies designed to identify basic causes for this common disease is. To find out more about the true reason for CHD, virtual models can be employed to better understand the way the heart functions. With such a model, scientists and surgeons are able to analyze the effects of different treatment options, and ultimately find more suited ways to prevent coronary heart diseases. To investigate a given model, appropriate navigation methods are required, including suitable input devices. For the visualization, graphics cards originally designed for gaming applications are used; so, it is a just natural transition to adapt gaming input devices to a visualization system for controlling of the navigation. These devices are usually well designed with respect to ergonomics and durability, yielding more degrees of freedom in steering than two-dimensional input devices, such as desktop mice. This poster describes a visualization system that provides the user with advanced control devices for navigation enabling interactive exploration of the model. Force-feedback and sound effects provide additional cues.",Thomas Wischgoll;Elke Moritz;Jörg Meyer 0002,T. Wischgoll;E. Moritz;J. Meyer,University of California at Irvine,,,2,0,5,
Vis,2004,Interactive Poster: Grid-Enabled Collaborative Scientific Visualization Environment,10.1109/VISUAL.2004.53,http://dx.doi.org/10.1109/VISUAL.2004.53,18,18,M,,Eric Christopher Wyatt;Patrick O'Leary,E.C. Wyatt;P. O'Leary,Northern Arizona University,,,2,0,4,
Vis,2004,Interactive Poster: Illustrating Different Convection Velocities of Turbulent Flow,10.1109/VISUAL.2004.54,http://dx.doi.org/10.1109/VISUAL.2004.54,24,24,M,"The visualization of any vector field is dependent on the relative velocity of the observer. In experimentally generated vector fields, the average value of the streamwise component of the global vector field is typically calculated and subtracted from each vector. We demonstrate that the resulting image, critical points, and vector field features are greatly influenced by the magnitude of the value subtracted from the streamwise velocity.",Timothy Urness;Victoria Interrante;Ellen Longmire;Ivan Marusic;Bharathram Ganapathisubramani,T. Urness;V. Interrante;E. Longmire;I. Marusic;B. Ganapathisubramani,University of Minnesota,,,2,1,4,
Vis,2004,Rough interface reconstruction using the level set method,10.1109/VISUAL.2004.94,http://dx.doi.org/10.1109/VISUAL.2004.94,251,258,C,"We present a new level set method for reconstructing interfaces from point aggregations. Although level-set-based methods are advantageous because they can handle complicated topologies and noisy data, most tend to smooth the inherent roughness of the original data. Our objective is to enhance the quality of a reconstructed surface by preserving certain roughness-related characteristics of the original dataset. Our formulation employs the total variation of the surface as a roughness measure. The algorithm consists of two steps: a roughness-capturing flow and a roughness-preserving flow. The roughness capturing step attempts to construct a surface for which the original roughness is captured - distance flow is well suited for roughness capturing. Surface reconstruction is enhanced by using a total variation preserving (TVP) scheme for the roughness-preserving flow. The shock filter formulation of Osher and Rudin is exploited to achieve this goal. In practice, we have found that better results arc obtained by balancing the TVP term with a smoothing term based on curvature. The algorithm is applied to both fractal surface growth simulations and scanned data sets to demonstrate the efficacy of our approach.",Yootai Kim;Raghu Machiraju;David S. Thompson,Y. Kim;Raghu Machiraju;D. Thompson,"Ohio State Univ., Columbus, OH, USA;Ohio State Univ., Columbus, OH, USA",,"point sampled data, surface reconstruction, level set method, shock filter, total variation preserving, rough surface",2,0,23,
Vis,2005,The visible radio: process visualization of a software-defined radio,10.1109/VISUAL.2005.1532791,http://dx.doi.org/10.1109/VISUAL.2005.1532791,159,165,C,"In this case study, a data-oriented approach is used to visualize a complex digital signal processing pipeline. The pipeline implements a frequency modulated (FM) software-defined radio (SDR). SDR is an emerging technology where portions of the radio hardware, such as filtering and modulation, are replaced by software components. We discuss how an SDR implementation is instrumented to illustrate the processes involved in FM transmission and reception. By using audio-encoded images, we illustrate the processes involved in radio, such as how filters are used to reduce noise, the nature of a carrier wave, and how frequency modulation acts on a signal. The visualization approach used in this work is very effective in demonstrating advanced topics in digital signal processing and is a useful tool for experimenting with the software radio design.",Matthew Hall;Alex Betts;Donna J. Cox;David Pointer;Volodymyr V. Kindratenko,M. Hall;A. Betts;D. Cox;D. Pointer;V. Kindratenko,"Nat. Center for Supercomput. Appl., Illinois Univ., Urbana, IL, USA;Nat. Center for Supercomput. Appl., Illinois Univ., Urbana, IL, USA;Nat. Center for Supercomput. Appl., Illinois Univ., Urbana, IL, USA;Nat. Center for Supercomput. Appl., Illinois Univ., Urbana, IL, USA;Nat. Center for Supercomput. Appl., Illinois Univ., Urbana, IL, USA",,"visualization metaphor, visualization of mathematics, radio, SDR",2,1,9,
VAST,2007,"VisPad: Integrating Visualization, Navigation and Synthesis",10.1109/VAST.2007.4389021,http://dx.doi.org/10.1109/VAST.2007.4389021,209,210,M,"We present a new framework - VisPad - to support the user to revisit the visual exploration process, and to synthesize and disseminate information. It offers three integrated views. The data view allows the user to interactively explore the data. The navigation view captures the exploration process. It enables the user to revisit any particular state and reuse it. The knowledge view enables the user to record his/her findings and the relations between these findings.",Yedendra Babu Shrinivasan;Jarke J. van Wijk,Yedendra B. Shrinivasan;Jarke J. van Wijk,"Dept. Mathematics and Computer Science, Technische Universiteit Eindhoven. e-mail: y.b.shrinivasan@tue.nl;Dept. Mathematics and Computer Science, Technische Universiteit Eindhoven. e-mail: vanwijk@win.tue.nl",,,2,2,6,
VAST,2007,Situation Awareness Tool for Global Argus,10.1109/VAST.2007.4389023,http://dx.doi.org/10.1109/VAST.2007.4389023,213,214,M,"We present a visualization tool to enhance situation awareness for Global Argus, a system that tracks and detects indications and warnings of biological events in near real time. Because Global Argus generates massive amounts of data daily, its analysts often struggle to interpret the information. To overcome this problem, we have developed the Global Argus situation awareness tool (GASAT) using the InteleView/World Wind geographical information system. This tool allows users to visualize current and past events in a particular region, and thus to understand how events evolve over time. Combined with the other tools that we are developing, GASAT will contribute to enhanced situation awareness in the tracking and detection of biological events.",Jae Choi;Sang-joon Lee;Sarah Gigitashvilli;James M. Wilson V,Jae Choi;Sang-joon Lee;Sarah Gigitashvilli;James Wilson,"Georgetown University. e-mail: choi@isis.georgetown.edu;Viznox, Inc. e-mail: sjlee@viznox.com;Georgetown University. e-mail: gigitashvili@isis.georgetown.edu;Georgetown University. e-mail: wilson@isis.georgetown.edu",,,2,1,2,
VAST,2007,Visual Analysis of Dynamic Networks with Geological Clustering,10.1109/VAST.2007.4389027,http://dx.doi.org/10.1109/VAST.2007.4389027,221,222,M,"Many dynamic networks have associated geological information. Here we present two complementing visual analysis methods for such networks. The first one provides an overview with summerized information while the second one presents a more detailed view. The geological information is encoded in the network layout, which is designed to help maintain user's mental map. We also combined visualization with social network analysis to facilitate knowledge discovery, especially to understand network changes in the context overall evolution. Both methods are applied to the ""History of the FIFA World Cup Competition"" data set.",Adel Ahmed;Xiaoyan Fu;Seok-Hee Hong;Quan Hoang Nguyen;Kai Xu 0003,Adel Ahmed;Xiaoyan Fu;Seok-Hee Hong;Quan Hoang Nguyen;Kai Xu,"School of Information Technologies, University of Sydney, Australia; National ICT Australia, Australia. e-mail: adel.ahmed@nicta.com.au;National ICT Australia, Australia. e-mail: xiaoyan.fu@nicta.com.au;School of Information Technologies, University of Sydney, Australia; National ICT Australia, Australia. e-mail: shhong@it.usyd.edu.au;School of Computer Sciences and Engineering, University of NSW, Australia. e-mail: quanhn@cse.unsw.edu.au;National ICT Australia, Australia. e-mail: kai.xu@nicta.com.au",,,2,1,7,
VAST,2008,Envisioning user models for adaptive visualization,10.1109/VAST.2008.4677373,http://dx.doi.org/10.1109/VAST.2008.4677373,175,176,M,Adaptive search systems apply user models to provide better separation of relevant and non-relevant documents in a list of results. This paper presents our attempt to leverage this ability of user models in the context of visual information analysis. We developed an adaptive visualization approach for presentation and exploration of search results. We simulated a visual intelligence search/analysis scenario with log data extracted from an adaptive information foraging study and were able to verify that our method can improve the ability of traditional relevance visualization to separate relevant and irrelevant information.,Jae-wook Ahn;Peter Brusilovsky,Jae-wook Ahn;Peter Brusilovsky,"School of Information Sciences, University of Pittsburgh, USA;School of Information Sciences, University of Pittsburgh, USA",,,2,2,6,
VAST,2008,Interactive poster - SocialRank: An ego- and time-centric workflow for relationship identification,10.1109/VAST.2008.4677375,http://dx.doi.org/10.1109/VAST.2008.4677375,179,180,M,"From instant messaging and email to wikis and blogs, millions of individuals are generating content that reflects their relationships with others in the world, both online and offline. Since communication artifacts are recordings of life events, we can gain insights into the social attributes and structures of the people within this communication history. In this paper, we describe SocialRank, an ego- and time-centric workflow for identifying social relationships in an email corpus. This workflow includes four high-level tasks: discovery, validation, annotation and dissemination. SocialRank combines relationship ranking algorithms with timeline, social network diagram, and multidimensional scaling visualization techniques to support these tasks.",Jaime Montemayor;Christopher P. Diehl;Michael Pekala;David Patrone,Jaime Montemayor;Chris Diehl;Mike Pekala;David Patrone,"Milton Eisenhower Research Center, The Johns Hopkins University Applied Physics Laboratory, USA;Milton Eisenhower Research Center, The Johns Hopkins University Applied Physics Laboratory, USA;Milton Eisenhower Research Center, The Johns Hopkins University Applied Physics Laboratory, USA;Milton Eisenhower Research Center, The Johns Hopkins University Applied Physics Laboratory, USA",,,2,2,1,
VAST,2008,Interactive poster: Visual data mining of unevenly-spaced event sequences,10.1109/VAST.2008.4677379,http://dx.doi.org/10.1109/VAST.2008.4677379,187,188,M,"We present a process for the exploration and analysis of large databases of events. A typical database is characterized by the sequential actions of a number of individual entities. These entities can be compared by their similarities in sequence and changes in sequence over time. The correlation of two sequences can provide important clues as to the possibility of a connection between the responsible entities, but an analyst might not be able to specify the type of connection sought prior to examination. Our process incorporates extensive automated calculation and data mining but permits diversity of analysis by providing visualization of results at multiple levels, taking advantage of human intuition and visual processing to generate avenues of inquiry.",Alex Godwin;Remco Chang;Robert Kosara;William Ribarsky,Alex Godwin;Remco Chang;Robert Kosara;William Ribarsky,"Visualization Center, University of North Carolina at Charlotte, USA;Visualization Center, University of North Carolina at Charlotte, USA;Visualization Center, University of North Carolina at Charlotte, USA;Visualization Center, University of North Carolina at Charlotte, USA",,,2,0,4,
VAST,2008,Evacuation trace Mini Challenge award: Tool integration analysis of movements with Geospatial Visual Analytics Toolkit,10.1109/VAST.2008.4677388,http://dx.doi.org/10.1109/VAST.2008.4677388,,,M,"The Geospatial Visual Analytics Toolkit intended for exploratory analysis of spatial and spatio-temporal data has been recently enriched with specific visual and computational techniques supporting analysis of data about movement. We applied these and other techniques to the data and tasks of Mini Challenge 4, where it was necessary to analyze tracks of moving people.CR Categories and Subject Descriptors: H.1.2 [User/Machine Systems]: Human information processing - Visual Analytics; 1.6.9 [Visualization]: information visualization.",Natalia V. Andrienko;Gennady L. Andrienko,Natalia Andrienko;Gennady Andrienko,"Fraunhofer Institute IAIS (Intelligent Analysis and Information Systems), Sankt Augustin, Germany;Fraunhofer Institute IAIS (Intelligent Analysis and Information Systems), Sankt Augustin, Germany",,,2,0,3,
VAST,2009,Interactive visual analysis of location reporting patterns,10.1109/VAST.2009.5333453,http://dx.doi.org/10.1109/VAST.2009.5333453,223,224,M,Interactive visualization methods are often used to aid in the analysis of large datasets. We present a novel interactive visualization technique designed specifically for the analysis of location reporting patterns within large time-series datasets. We use a set of triangles with color coding to indicate the time between location reports. This allows reporting patterns (expected and unexpected) to be easily discerned during interactive analysis. We discuss the details of our method and describe evaluation both from expert opinion and from a user study.,Derek Overby;John Keyser;Jim Wall,Derek Overby;John Keyser;Jim Wall,"Department of Industrial and Systems Engineering, Texas A&M University, USA;Department of Industrial and Systems Engineering, Texas A&M University, USA;Department of Industrial and Systems Engineering, Texas A&M University, USA",,,2,0,4,
VAST,2009,Comparing two interface tools in performing visual analytics tasks,10.1109/VAST.2009.5333469,http://dx.doi.org/10.1109/VAST.2009.5333469,219,220,M,"In visual analytics, menu systems are commonly adopted as supporting tools because of the complex nature of data. However, it is still unknown how much the interaction implicit to the interface impacts the performance of visual analysis. To show the effectiveness of two interface tools, one a floating text-based menu (Floating Menu) and the other a more interactive iconic tool (Interactive-Icon), we evaluated the use and human performance of both tools within one highly interactive visual analytics system. We asked participants to answer similarly constructed, straightforward questions in a genomic visualization, first with one tool, and then the other. During task performance we tracked completion times, task errors, and captured coarse-grained interactive behaviors. Based on the participants accuracy, speed, behaviors and post-task qualitative feedback, we observed that although the Interactive-Icon tool supports continuous interactions, task-oriented user evaluation did not find a significant difference between the two tools because there is a familiarity effect on the performance of solving the task questions with using Floating-Menu interface tool.",Dong Hyun Jeong;Tera Marie Green;William Ribarsky;Remco Chang,Dong Hyun Jeong;Tera Marie Green;William Ribarsky;Remco Chang,"Charlotte Visualization Center, UNC Charlotte, USA;School of Interactive Arts and Technology, Simon Fraser University, Canada;Charlotte Visualization Center, UNC Charlotte, USA;Charlotte Visualization Center, UNC Charlotte, USA",,,2,1,3,
VAST,2009,"VIScover: Visualizing, exploring, and analysing structured data",10.1109/VAST.2009.5333946,http://dx.doi.org/10.1109/VAST.2009.5333946,,,M,"Today's challenging task in intelligent data processing is not to store large volumes of interlinked data but to visualize, explore, and understand its explicit or implicit relationships. Our solution to this is the VIScover system. VIScover combines semantic technologies with interactive exploration and visualization techniques able to analyze large volumes of structured data. We briefly describe our VIScover system and show its potential using the example of the VAST 2009 social network and geospatial data set.",Thorsten Liebig;Olaf Noppens;Friedrich W. von Henke,Thorsten Liebig;Olaf Noppens;Friedrich von Henke,"Ulm University, derivo GmbH, Germany;Ulm University, derivo GmbH, Germany;Ulm University, Germany",,,2,4,3,
VAST,2009,VAST 2009 Traffic Mini Challenge: Intuitive analytic information presentation,10.1109/VAST.2009.5334301,http://dx.doi.org/10.1109/VAST.2009.5334301,,,M,"As a solution to the VAST 2009 Traffic Mini Visualization Challenge, we built the Badge and Network Traffic (BNT) tool to create animations of the events taking place in the embassy. Using the embassy layout, the prox-card and web-access entries and their time-stamps, we animated color-based flagging of events. The BNT tool highlights logical anomalies occuring in the badge and network traffic data with color-coded alerts. Prior to the animated visualization, the tool analyzes data with respect to various aspects using (i) the amount of data transfers, (ii) destination IPs access patterns, (iii) employee's browsing patterns and (iv) employee's entry log into the restricted area. Any abnormality noticed is immediately reported to the user in the form of plots. In this presentation, we list out the various analyses performed and how they were utilized in the visualization. A few screenshots of the tool are provided to illustrate our analytic information presentation.",Shraddha Agrawal;Kollukuduru Sravanthi;Soujanya Vadapalli;Kamalakar Karlapalem,Shraddha Agrawal;Kollukuduru Sravanthi;Soujanya Vadapalli;Kamalakar Karlapalem,"Centre for Data Engineering, International Institute of Information Technology, Hyderabad, India;Centre for Data Engineering, International Institute of Information Technology, Hyderabad, India;Centre for Data Engineering, International Institute of Information Technology, Hyderabad, India;Centre for Data Engineering, International Institute of Information Technology, Hyderabad, India",,,2,0,0,
VAST,2010,A radial visualization tool for depicting hierarchically structured video content,10.1109/VAST.2010.5650177,http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5650177,251,252,M,"The visual analysis of video content is an important research topic due to the huge amount of video data that is generated every day. Annotating this data will become a major problem since the amount of videos further increases. With this work we introduce a system that combines a visualization tool with automatic video segmentation techniques and a characteristic key-frame extraction. A summary of the content of a whole video in one view is realized. Furthermore, the user can interactively browse through the video via our visualization interface to get more detailed information. The system is adapted to two application scenarios and a third application is discussed for future work.",Tobias Ruppert;Jörn Kohlhammer,Tobias Ruppert;Jörn Kohlhammer,"Fraunhofer Institute for Computer Graphics Research (IGD), Darmstadt, Germany;Fraunhofer Institute for Computer Graphics Research (IGD), Darmstadt, Germany",,,2,2,3,
VAST,2010,Visual analysis of frequent patterns in large time series,10.1109/VAST.2010.5650766,http://dx.doi.org/10.1109/VAST.2010.5650766,227,228,M,"The detection of previously unknown, frequently occurring patterns in time series, often called motifs, has been recognized as an important task. To find these motifs, we use an advanced temporal data mining algorithm. Since our algorithm usually finds hundreds of motifs, we need to analyze and access the discovered motifs. For this purpose, we introduce three novel visual analytics methods: (1) motif layout, using colored rectangles for visualizing the occurrences and hierarchical relationships of motifs in a multivariate time series, (2) motif distortion, for enlarging or shrinking motifs as appropriate for easy analysis and (3) motif merging, to combine a number of identical adjacent motif instances without cluttering the display. We have applied and evaluated our methods using two real-world data sets: data center cooling and oil well production.",Ming C. Hao;Manish Marwah;Halldór Janetzko;Daniel A. Keim;Umeshwar Dayal;Ratnesh K. Sharma;Debprakash Patnaik;Naren Ramakrishnan,M. C. Hao;M. Marwah;H. Janetzko;D. A. Keim;U. Dayal;R. Sharma;D. Patnaik;N. Ramakrishnan,"Hewlett Packard Laboratories, USA;Hewlett Packard Laboratories, USA;University of Konstanz, Germany;University of Konstanz, Germany;Hewlett Packard Laboratories, USA;Hewlett Packard Laboratories, USA;Virginia Tech, USA;Virginia Tech, USA",,,2,2,2,
VAST,2010,Visualization of temporal relationships within coordinated views,10.1109/VAST.2010.5651617,http://dx.doi.org/10.1109/VAST.2010.5651617,219,220,M,"In command and control (C2) environments, decision makers must rapidly understand and address key temporal relationships that exist between critical tasks as conditions fluctuate. However, traditional temporal displays, such as mission timelines, fail to support user understanding of and reasoning about critical relationships. We have developed visualization methods to compactly and effectively convey key temporal constraints. In this paper, we present examples of our visualization approach and describe how we are exploring interaction methods within an integrated visualization workspace to support user awareness of temporal constraints.",Stephanie Dudzic;J. Alex Godwin;Ryan M. Kilgore,Stephanie Dudzic;J. Alex Godwin;Ryan M. Kilgore,Charles River Analytics;Charles River Analytics;Charles River Analytics,,"temporal relationships, temporal visualization",2,1,3,
VAST,2010,Visual tools for dynamic analysis of complex situations,10.1109/VAST.2010.5654451,http://dx.doi.org/10.1109/VAST.2010.5654451,241,242,M,This paper presents an interactive interface synchronized with a simulation framework for exploring complex scenarios. This interface exploits visual analysis for facilitating the understanding of complex situation by human users.,Marielle Mokhtari;Eric Boivin;Denis Laurendeau;Maxime Girardin,Marielle Mokhtari;Eric Boivin;Denis Laurendeau;Maxime Girardin,"System of Systems Section, Defence R&amp;D Canada Quebec (QC), Canada;System of Systems Section, Defence R&amp;D Canada Quebec (QC), Canada;Computer Vision and Systems Laboratory Dept. of ECE, Laval University, Quebec (QC), Canada;Computer Vision and Systems Laboratory Dept. of ECE, Laval University, Quebec (QC), Canada",,"Information visualization, 2D1/2 animation, line & surface graph animation, interaction, synchronization",2,2,5,
Vis,2010,Volumetric Modeling in Laser BPH Therapy Simulation,10.1109/TVCG.2010.221,http://dx.doi.org/10.1109/TVCG.2010.221,1405,1412,J,"In this paper, we introduce a novel application of volume modeling techniques on laser Benign Prostatic Hyperplasia (BPH) therapy simulation. The core technique in our system is an algorithm for simulating the tissue vaporization process by laser heating. Different from classical volume CSG operations, our technique takes experimental data as the guidance to determine the vaporization amount so that only a specified amount of tissue is vaporized in each time. Our algorithm uses a predictor-corrector strategy. First, we apply the classical CSG algorithm on a tetrahedral grid based distance field to estimate the vaporized tissue amount. Then, a volume-correction phase is applied on the distance field. To improve the performance, we further propose optimization approaches for efficient implementation.",Nan Zhang;Xiangmin Zhou;Yunhe Shen;Robert M. Sweet,Nan Zhang;Xiangmin Zhou;Yunhe Shen;Robert Sweet,University of Minnesota;University of Minnesota;University of Minnesota;University of Minnesota,10.1109/VISUAL.2003.1250358;10.1109/VISUAL.2003.1250360,"Volume modeling, volume CSG, controlled-volume vaporization, medical simulation, laser BPH simulator",2,3,30,
VAST,2011,A visual navigation system for querying neural stem cell imaging data,10.1109/VAST.2011.6102459,http://dx.doi.org/10.1109/VAST.2011.6102459,211,220,C,"Cellular biology deals with studying the behavior of cells. Current time-lapse imaging microscopes help us capture the progress of experiments at intervals that allow for understanding of the dynamic and kinematic behavior of the cells. On the other hand, these devices generate such massive amounts of data (250GB of data per experiment) that manual sieving of data to identify interesting patterns becomes virtually impossible. In this paper we propose an end-to-end system to analyze time-lapse images of the cultures of human neural stem cells (hNSC), that includes an image processing system to analyze the images to extract all the relevant geometric and statistical features within and between images, a database management system to manage and handle queries on the data, a visual analytic system to navigate through the data, and a visual query system to explore different relationships and correlations between the parameters. In each stage of the pipeline we make novel algorithmic and conceptual contributions, and the entire system design is motivated by many different yet unanswered exploratory questions pursued by our neurobiologist collaborators. With a few examples we show how such abstract biological queries can be analyzed and answered by our system.",Ishwar Kulkarni;Shanaz Y. Mistry;Brian Cummings;Meenakshisundaram Gopi,Ishwar Kulkarni;Shanaz Y. Mistry;Brian Cummings;M. Gopi,"Department of Computer Science, University of California, Irvine, USA;Department of Computer Science, University of California, Irvine, USA;Department of Anatomy and Neurobiology, University of California, Irvine, USA;Department of Computer Science, University of California, Irvine, USA",10.1109/TVCG.2009.121;10.1109/VAST.2009.5333895,"Neuroscience, stem cell segmentation, tracking, cell imaging, data management, visual analytics, navigation, exploration, query processing",2,0,23,
VAST,2011,Using random projections to identify class-separating variables in high-dimensional spaces,10.1109/VAST.2011.6102465,http://dx.doi.org/10.1109/VAST.2011.6102465,263,264,M,"Projection Pursuit has been an effective method for finding interesting low-dimensional (usually 2D) projections in multidimensional spaces. Unfortunately, projection pursuit is not scalable to high-dimensional spaces. We introduce a novel method for approximating the results of projection pursuit to find class-separating views by using random projections. We build an analytic visualization platform based on this algorithm that is scalable to extremely large problems. Then, we discuss its extension to the recognition of other noteworthy configurations in high-dimensional spaces.",Anushka Anand;Leland Wilkinson;Tommy Dang,Anushka Anand;Leland Wilkinson;Tuan Nhon Dang,"Department of Computer Science, University of Illinois at Chicago, USA;Department of Computer Science, University of Illinois at Chicago, USA;Department of Computer Science, University of Illinois at Chicago, USA",,,2,1,12,
VAST,2011,Visual analytical approaches to evaluating uncertainty and bias in crowd sourced crisis information,10.1109/VAST.2011.6102470,http://dx.doi.org/10.1109/VAST.2011.6102470,273,274,M,"Concerns about verification mean the humanitarian community are reluctant to use information collected during crisis events, even though such information could potentially enhance the response effort. Consequently, a program of research is presented that aims to evaluate the degree to which uncertainty and bias are found in public collections of incident reports gathered during crisis events. These datasets exemplify a class whose members have spatial and temporal attributes, are gathered from heterogeneous sources, and do not have readily available attribution information. An interactive software prototype, and existing software, are applied to a dataset related to the current armed conflict in Libya to identify `intrinsic' characteristics against which uncertainty and bias can be evaluated. Requirements on the prototype are identified, which in time will be expanded into full research objectives.",Iain Dillingham;Jason Dykes;Jo Wood,Iain Dillingham;Jason Dykes;Jo Wood,"giCentre, School of Informatics, City University London, UK;giCentre, School of Informatics, City University London, UK;giCentre, School of Informatics, City University London, UK",,,2,0,16,
SciVis,2012,Interactive Retro-Deformation of Terrain for Reconstructing 3D Fault Displacements,10.1109/TVCG.2012.239,http://dx.doi.org/10.1109/TVCG.2012.239,2208,2215,J,"Planetary topography is the result of complex interactions between geological processes, of which faulting is a prominent component. Surface-rupturing earthquakes cut and move landforms which develop across active faults, producing characteristic surface displacements across the fault. Geometric models of faults and their associated surface displacements are commonly applied to reconstruct these offsets to enable interpretation of the observed topography. However, current 2D techniques are limited in their capability to convey both the three-dimensional kinematics of faulting and the incremental sequence of events required by a given reconstruction. Here we present a real-time system for interactive retro-deformation of faulted topography to enable reconstruction of fault displacement within a high-resolution (sub 1m/pixel) 3D terrain visualization. We employ geometry shaders on the GPU to intersect the surface mesh with fault-segments interactively specified by the user and transform the resulting surface blocks in realtime according to a kinematic model of fault motion. Our method facilitates a human-in-the-loop approach to reconstruction of fault displacements by providing instant visual feedback while exploring the parameter space. Thus, scientists can evaluate the validity of traditional point-to-point reconstructions by visually examining a smooth interpolation of the displacement in 3D. We show the efficacy of our approach by using it to reconstruct segments of the San Andreas fault, California as well as a graben structure in the Noctis Labyrinthus region on Mars.",Rolf Westerteiger;Tracy Compton;Tony Bernardin;Eric S. Cowgill;Klaus Gwinner;Bernd Hamann;Andreas Gerndt;Hans Hagen,Rolf Westerteiger;Tracy Compton;Tony Bernadin;Eric Cowgill;Klaus Gwinner;Bernd Hamann;Andreas Gerndt;Hans Hagen,"German Aerospace Center (DLR);Department of Geology, University of California, Davis;Institute for Data Analysis and Visualization, Department of Computer Science, University of California, Davis;Department of Geology, University of California, Davis;Institute of Planetary Research, German Aerospace Center (DLR), Berlin;Institute for Data Analysis and Visualization, Department of Computer Science, University of California, Davis;German Aerospace Center (DLR);University of Kaiserslautern",,"Terrain rendering, interactive, fault simulation, mesh deformation",2,2,20,
SciVis,2012,Visualization of Flow Behavior in Earth Mantle Convection,10.1109/TVCG.2012.283,http://dx.doi.org/10.1109/TVCG.2012.283,2198,2207,J,"A fundamental characteristic of fluid flow is that it causes mixing: introduce a dye into a flow, and it will disperse. Mixing can be used as a method to visualize and characterize flow. Because mixing is a process that occurs over time, it is a 4D problem that presents a challenge for computation, visualization, and analysis. Motivated by a mixing problem in geophysics, we introduce a combination of methods to analyze, transform, and finally visualize mixing in simulations of convection in a self-gravitating 3D spherical shell representing convection in the Earth's mantle. Geophysicists use tools such as the finite element model CitcomS to simulate convection, and introduce massless, passive tracers to model mixing. The output of geophysical flow simulation is hard to analyze for domain experts because of overall data size and complexity. In addition, information overload and occlusion are problems when visualizing a whole-earth model. To address the large size of the data, we rearrange the simulation data using intelligent indexing for fast file access and efficient caching. To address information overload and interpret mixing, we compute tracer concentration statistics, which are used to characterize mixing in mantle convection models. Our visualization uses a specially tailored version of Direct Volume Rendering. The most important adjustment is the use of constant opacity. Because of this special area of application, i. e. the rendering of a spherical shell, many computations for volume rendering can be optimized. These optimizations are essential to a smooth animation of the time-dependent simulation data. Our results show how our system can be used to quickly assess the simulation output and test hypotheses regarding Earth's mantle convection. The integrated processing pipeline helps geoscientists to focus on their main task of analyzing mantle homogenization.",Simon Schröder;John A. Peterson;Harald Obermaier;Louise H. Kellogg;Kenneth I. Joy;Hans Hagen,Simon Schröder;John A. Peterson;Harald Obermaier;Louise H. Kellogg;Kenneth I. Joy;Hans Hagen,"Fraunhofer ITWM;Department of Geology, University of California, Davis;Institute for Data Analysis and Visualization, University of California, Davis;Department of Geology, University of California, Davis;Institute for Data Analysis and Visualization, University of California, Davis;Computer Graphics and HCI Group, University of Kaiserslautern",10.1109/TVCG.2010.156,"Geophysics, flow visualization, tracer concentration, Earth mantle, convection, large data system",2,1,31,
VAST,2012,Incorporating GOMS analysis into the design of an EEG data visual analysis tool,10.1109/VAST.2012.6400542,http://dx.doi.org/10.1109/VAST.2012.6400542,223,224,M,"In this paper, we present a case study where we incorporate GOMS (Goals, Operators, Methods, and Selectors) [2] task analysis into the design process of a visual analysis tool. We performed GOMS analysis on an Electroencephalography (EEG) analyst's current data analysis strategy to identify important user tasks and unnecessary user actions in his current workflow. We then designed an EEG data visual analysis tool based on the GOMS analysis result. Evaluation results show that the tool we have developed, EEGVis, allows the user to analyze EEG data with reduced subjective cognitive load, faster speed and increased confidence in the analysis quality. The positive evaluation results suggest that our design process demonstrates an effective application of GOMS analysis to discover opportunities for designing better tools to support the user's visual analysis process.",Hua Guo;Diem Tran;David H. Laidlaw,Hua Guo;Diem Tran;David H. Laidlaw,Department of Computer Science Brown University;Department of Computer Science Brown University;Department of Computer Science Brown University,,,2,1,7,
VAST,2012,Using translational science in visual analytics,10.1109/VAST.2012.6400543,http://dx.doi.org/10.1109/VAST.2012.6400543,221,222,M,"We introduce translational science, a research discipline from medicine, and show how adapting it for visual analytics can improve the design and evaluation of visual analytics interfaces. Translational science “translates” knowledge from the lab to the real-world to “ground truth” by incorporating a 3 phase program of research. Phase 1 &amp; 2 include protocols for research in the lab and field and Phase 3 focuses on dissemination and documentation. We discuss these phases and how they may be applied to visual analytics research.",Tera Marie Green;Brian D. Fisher,Tera Marie Green;Brian Fisher,"School of Interactive Arts + Science, Simon Fraser University;School of Interactive Arts + Science, Simon Fraser University",,,2,1,7,
VAST,2012,"Information retrieval failure analysis: Visual analytics as a support for interactive ""what-if"" investigation",10.1109/VAST.2012.6400551,http://dx.doi.org/10.1109/VAST.2012.6400551,204,206,M,"This poster provides an analytical model for examining performances of IR systems, based on the discounted cumulative gain family of metrics, and visualization for interacting and exploring the performances of the system under examination. Moreover, we propose machine learning approach to learn the ranking model of the examined system in order to be able to conduct a “what-if” analysis and visually explore what can happen if you adopt a given solution before having to actually implement it.",Marco Angelini;Nicola Ferro 0001;Guido Granato;Giuseppe Santucci;Gianmaria Silvello,Marco Angelini;Nicola Ferro;Guido Granato;Guiseppe Santucci;Gianmaria Silvello,"Sapienza University of Roma, Italy;University of Padua, Italy;Sapienza University of Roma, Italy;Sapienza University of Roma, Italy;University of Padua, Italy",,,2,2,3,
SciVis,2014,Visualization of Regular Maps: The Chase Continues,10.1109/TVCG.2014.2352952,http://dx.doi.org/10.1109/TVCG.2014.2352952,2614,2623,J,"A regular map is a symmetric tiling of a closed surface, in the sense that all faces, vertices, and edges are topologically indistinguishable. Platonic solids are prime examples, but also for surfaces with higher genus such regular maps exist. We present a new method to visualize regular maps. Space models are produced by matching regular maps with target shapes in the hyperbolic plane. The approach is an extension of our earlier work. Here a wider variety of target shapes is considered, obtained by duplicating spherical and toroidal regular maps, merging triangles, punching holes, and gluing the edges. The method produces about 45 new examples, including the genus 7 Hurwitz surface.",Jarke J. van Wijk,Jarke J. van Wijk,Eindhoven University of Technology,,"regular maps, tiling, tessellation, surface topology, mathematical visualization",2,1,24,
VAST,2014,A System for Visual Analysis of Radio Signal Data,10.1109/VAST.2014.7042479,http://dx.doi.org/10.1109/VAST.2014.7042479,33,42,C,"Analysis of radio transmissions is vital for military defense as it provides valuable information about enemy communication and infrastructure. One challenge to the data analysis task is that there are far too many signals for analysts to go through by hand. Even typical signal meta data (such as frequency band, duration, and geographic location) can be overwhelming. In this paper, we present a system for exploring and analyzing such radio signal meta-data. Our system incorporates several visual representations for signal data, designed for readability and ease of comparison, as well as novel algorithms for extracting and classifying consistent signal patterns. We demonstrate the effectiveness of our system using data collected from real missions with an airborne sensor platform.",Tarik Crnovrsanin;Chris Muelder;Kwan-Liu Ma,Tarik Crnovrsanin;Chris Muelder;Kwan-Liu Ma,VIDi @ U. C. Davis;VIDi @ U. C. Davis;VIDi @ U. C. Davis,10.1109/TVCG.2012.286;10.1109/VAST.2009.5332596;10.1109/INFVIS.2005.1532138;10.1109/VISUAL.1998.745302;10.1109/VAST.2009.5332593,"Intelligence Analysis, Coordinated and Multiple Views, Time-varying data, Geographic/Geospatial Visualization",2,2,29,
SciVis,2015,A Visual Voting Framework for Weather Forecast Calibration,10.1109/SciVis.2015.7429488,http://dx.doi.org/10.1109/SciVis.2015.7429488,25,32,C,"Numerical weather predictions have been widely used for weather forecasting. Many large meteorological centers are producing highly accurate ensemble forecasts routinely to provide effective weather forecast services. However, biases frequently exist in forecast products because of various reasons, such as the imperfection of the weather forecast models. Failure to identify and neutralize the biases would result in unreliable forecast products that might mislead analysts; consequently, unreliable weather predictions are produced. The analog method has been commonly used to overcome the biases. Nevertheless, this method has some serious limitations including the difficulties in finding effective similar past forecasts, the large search space for proper parameters and the lack of support for interactive, real-time analysis. In this study, we develop a visual analytics system based on a novel voting framework to circumvent the problems. The framework adopts the idea of majority voting to combine judiciously the different variants of analog methods towards effective retrieval of the proper analogs for calibration. The system seamlessly integrates the analog methods into an interactive visualization pipeline with a set of coordinated views that characterizes the different methods. Instant visual hints are provided in the views to guide users in finding and refining analogs. We have worked closely with the domain experts in the meteorological research to develop the system. The effectiveness of the system is demonstrated using two case studies. An informal evaluation with the experts proves the usability and usefulness of the system.",Hongsen Liao;Yingcai Wu;Li Chen;Thomas M. Hamill;Yunhai Wang;Kan Dai;Hui Zhang;Wei Chen 0001,Hongsen Liao;Yingcai Wu;Li Chen;Thomas M. Hamill;Yunhai Wang;Kan Dai;Hui Zhang;Wei Chen,"School of Software, Tsinghua National Laboratory for Information Science and Technology, Tsinghua University;State Key Lab of CAD & CG, Zhejiang University;School of Software, Tsinghua National Laboratory for Information Science and Technology, Tsinghua University;NOAA Earth System Research Lab, Physical Sciences Division;Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences;National Meteorological Center of CMA;School of Software, Tsinghua National Laboratory for Information Science and Technology, Tsinghua University;State Key Lab of CAD & CG, Zhejiang University",10.1109/TVCG.2013.131;10.1109/TVCG.2013.138;10.1109/TVCG.2013.144;10.1109/TVCG.2009.197;10.1109/TVCG.2008.139;10.1109/TVCG.2014.2346755;10.1109/TVCG.2010.181;10.1109/VISUAL.1994.346298;10.1109/TVCG.2013.143,"Weather forecast, analog method, calibration, majority voting, visual analytics",2,5,30,
VAST,2015,Collaborative visual analysis with RCloud,10.1109/VAST.2015.7347627,http://dx.doi.org/10.1109/VAST.2015.7347627,25,32,C,"Consider the emerging role of data science teams embedded in larger organizations. Individual analysts work on loosely related problems, and must share their findings with each other and the organization at large, moving results from exploratory data analyses (EDA) into automated visualizations, diagnostics and reports deployed for wider consumption. There are two problems with the current practice. First, there are gaps in this workflow: EDA is performed with one set of tools, and automated reports and deployments with another. Second, these environments often assume a single-developer perspective, while data scientist teams could get much benefit from easier sharing of scripts and data feeds, experiments, annotations, and automated recommendations, which are well beyond what traditional version control systems provide. We contribute and justify the following three requirements for systems built to support current data science teams and users: discoverability, technology transfer, and coexistence. In addition, we contribute the design and implementation of RCloud, a system that supports the requirements of collaborative data analysis, visualization and web deployment. About 100 people used RCloud for two years. We report on interviews with some of these users, and discuss design decisions, tradeoffs and limitations in comparison to other approaches.",Stephen C. North;Carlos Scheidegger;Simon Urbanek;Gordon Woodhull,Stephen North;Carlos Scheidegger;Simon Urbanek;Gordon Woodhull,"Infovisible, USA;University of Arizona, USA;AT&T Labs, USA;AT&T Labs, USA",10.1109/TVCG.2011.185;10.1109/VAST.2007.4389011;10.1109/TVCG.2012.219;10.1109/TVCG.2009.195;10.1109/TVCG.2007.70577,"visual analytics process, provenance, collaboration, visualization, computer-supported cooperative work",2,2,40,
VAST,2015,FPSSeer: Visual analysis of game frame rate data,10.1109/VAST.2015.7347633,http://dx.doi.org/10.1109/VAST.2015.7347633,73,80,C,"The rate at which frames are rendered in a computer game directly influences both game playability and enjoyability. Players frequently have to deal with the trade-off between high frame rates and good resolution. Analyzing patterns in frame rate data and their correlation with the overall game performance is important in designing games (e.g., graphic card/display setting suggestion and game performance measurement). However, this task is challenging because game frame rates vary both temporally and spatially. In addition, players may adjust their display settings based on their gaming experience and hardware conditions, which further contributes to the unpredictability of frame rates. In this paper, we present a comprehensive visual analytics system FPSSeer, to help game designers gain insight into frame rate data. Our system consists of four major views: 1) a frame rate view to show the overall distribution in a geographic scale, 2) a grid view to show the frame rate distribution and grid element clusters based on their similarity, 3) a FootRiver view to reveal the temporal patterns in game condition changes and potential spatiotemporal correlations, and 4) a comparison view to evaluate game performance discrepancy under different game tests. The real-world case studies demonstrate the effectiveness of our system. The system has been applied to an online commercial game to monitor its performance and to provide feedbacks to designers and developers.",Quan Li;Peng Xu;Huamin Qu,Quan Li;Peng Xu;Huamin Qu,"NetEase Games, NetEase, Inc., Hong Kong University of Science and Technology, China;NetEase Games, NetEase, Inc., China;Hong Kong University of Science and Technology, China",10.1109/TVCG.2008.166;10.1109/INFVIS.2000.885098;10.1109/TVCG.2011.202;10.1109/TVCG.2014.2346445;10.1109/INFVIS.2001.963273,"frame rate data, game performance evaluation, visual analytics",2,0,24,
VAST,2015,Visual data quality analysis for taxi GPS data,10.1109/VAST.2015.7347689,http://dx.doi.org/10.1109/VAST.2015.7347689,223,224,M,"We present a novel visual analysis method to systematically discover data quality problems in raw taxi GPS data. It combines semi-supervised active learning and interactive visual exploration. It helps analysts interactively discover unknown data quality problems, and automatically extract known problems. We report analysis results on Beijing taxi GPS data.",Zuchao Wang;Xiaoru Yuan;Tangzhi Ye;Youfeng Hao;Siming Chen 0001;Jie Liang 0004;Qiusheng Li;Haiyang Wang;Yadong Wu,Zuchao Wang;Xiaoru Yuan;Tangzhi Ye;Youfeng hao;Siming Chen;Jie Liangk;Qiusheng Li;Haiyang Wang;Yadong Wu,"Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University, China;Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University, China;Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University, China;Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University, China;Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University, China;Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University, China;School of Computer Science and Technology, Southwest University of Science and Technology, China;School of Computer Science and Technology, Southwest University of Science and Technology, China;School of Computer Science and Technology, Southwest University of Science and Technology, China",,,2,0,4,
SciVis,2016,Comparing Cross-Sections and 3D Renderings for Surface Matching Tasks Using Physical Ground Truths,10.1109/TVCG.2016.2598602,http://dx.doi.org/10.1109/TVCG.2016.2598602,781,790,J,"Within the visualization community there are some well-known techniques for visualizing 3D spatial data and some general assumptions about how perception affects the performance of these techniques in practice. However, there is a lack of empirical research backing up the possible performance differences among the basic techniques for general tasks. One such assumption is that 3D renderings are better for obtaining an overview, whereas cross sectional visualizations such as the commonly used Multi-Planar Reformation (MPR) are better for supporting detailed analysis tasks. In the present study we investigated this common assumption by examining the difference in performance between MPR and 3D rendering for correctly identifying a known surface. We also examined whether prior experience working with image data affects the participant's performance, and whether there was any difference between interactive or static versions of the visualizations. Answering this question is important because it can be used as part of a scientific and empirical basis for determining when to use which of the two techniques. An advantage of the present study compared to other studies is that several factors were taken into account to compare the two techniques. The problem was examined through an experiment with 45 participants, where physical objects were used as the known surface (ground truth). Our findings showed that: 1. The 3D renderings largely outperformed the cross sections; 2. Interactive visualizations were partially more effective than static visualizations; and 3. The high experience group did not generally outperform the low experience group.",Andreas J. Lind;Stefan Bruckner,Andreas J. Lind;Stefan Bruckner,"University of Bergen, Norway;University of Bergen, Norway",10.1109/TVCG.2007.70569;10.1109/TVCG.2011.161;10.1109/TVCG.2013.121;10.1109/TVCG.2008.108;10.1109/VISUAL.2005.1532856;10.1109/SciVis.2015.7429485;10.1109/TVCG.2007.70542,Human-Computer Interaction;Quantitative Evaluation and Volume Visualization,2,1,46,
SciVis,2016,Vol²velle: Printable Interactive Volume Visualization,10.1109/TVCG.2016.2599211,http://dx.doi.org/10.1109/TVCG.2016.2599211,861,870,J,"Interaction is an indispensable aspect of data visualization. The presentation of volumetric data, in particular, often significantly benefits from interactive manipulation of parameters such as transfer functions, rendering styles, or clipping planes. However, when we want to create hardcopies of such visualizations, this essential aspect is lost. In this paper, we present a novel approach for creating hardcopies of volume visualizations which preserves a certain degree of interactivity. We present a method for automatically generating Volvelles, printable tangible wheel charts that can be manipulated to explore different parameter settings. Our interactive system allows the flexible mapping of arbitrary visualization parameters and supports advanced features such as linked views. The resulting designs can be easily reproduced using a standard printer and assembled within a few minutes.",Sergej Stoppel;Stefan Bruckner,Sergej Stoppel;Stefan Bruckner,University of Bergen;University of Bergen,10.1109/TVCG.2014.2346292;10.1109/TVCG.2013.121;10.1109/TVCG.2013.134;10.1109/TVCG.2006.140;10.1109/TVCG.2006.148;10.1109/VISUAL.1999.809871;10.1109/TVCG.2015.2467294;10.1109/VISUAL.2005.1532856;10.1109/TVCG.2014.2352953;10.1109/TVCG.2007.70584,Illustrative Visualization;Physical Visualization;Interaction;Volume Visualization,2,5,45,
VAST,2016,C2A: Crowd consensus analytics for virtual colonoscopy,10.1109/VAST.2016.7883508,http://dx.doi.org/10.1109/VAST.2016.7883508,21,30,C,"We present a medical crowdsourcing visual analytics platform called C<sup>2</sup>A to visualize, classify and filter crowdsourced clinical data. More specifically, C<sup>2</sup>A is used to build consensus on a clinical diagnosis by visualizing crowd responses and filtering out anomalous activity. Crowdsourcing medical applications have recently shown promise where the non-expert users (the crowd) were able to achieve accuracy similar to the medical experts. This has the potential to reduce interpretation/reading time and possibly improve accuracy by building a consensus on the findings beforehand and letting the medical experts make the final diagnosis. In this paper, we focus on a virtual colonoscopy (VC) application with the clinical technicians as our target users, and the radiologists acting as consultants and classifying segments as benign or malignant. In particular, C<sup>2</sup>A is used to analyze and explore crowd responses on video segments, created from fly-throughs in the virtual colon. C<sup>2</sup>A provides several interactive visualization components to build crowd consensus on video segments, to detect anomalies in the crowd data and in the VC video segments, and finally, to improve the non-expert user's work quality and performance by A/B testing for the optimal crowdsourcing platform and application-specific parameters. Case studies and domain experts feedback demonstrate the effectiveness of our framework in improving workers' output quality, the potential to reduce the radiologists' interpretation time, and hence, the potential to improve the traditional clinical workflow by marking the majority of the video segments as benign based on the crowd consensus.",Ji Hwan Park;Saad Nadeem;Seyedkoosha Mirhosseini;Arie E. Kaufman,Ji Hwan Park;Saad Nadeem;Seyedkoosha Mirhosseini;Arie Kaufman,"Stony Brook University, United States of America;Stony Brook University, United States of America;Stony Brook University, United States of America;Stony Brook University, United States of America",10.1109/TVCG.2015.2467196;10.1109/TVCG.2006.112;10.1109/TVCG.2009.171;10.1109/TVCG.2006.158;10.1109/VAST.2015.7347631;10.1109/TVCG.2013.164;10.1109/TVCG.2015.2467555,,2,1,39,
InfoVis,2017,Assessing the Graphical Perception of Time and Speed on 2D+Time Trajectories,10.1109/TVCG.2017.2743918,http://dx.doi.org/10.1109/TVCG.2017.2743918,698,708,J,"We empirically evaluate the extent to which people perceive non-constant time and speed encoded on 2D paths. In our graphical perception study, we evaluate nine encodings from the literature for both straight and curved paths. Visualizing time and speed information is a challenge when the x and y axes already encode other data dimensions, for example when plotting a trip on a map. This is particularly true in disciplines such as time-geography and movement analytics that often require visualizing spatio-temporal trajectories. A common approach is to use 2D+time trajectories, which are 2D paths for which time is an additional dimension. However, there are currently no guidelines regarding how to represent time and speed on such paths. Our study results provide InfoVis designers with clear guidance regarding which encodings to use and which ones to avoid; in particular, we suggest using color value to encode speed and segment length to encode time whenever possible.",Charles Perin;Tiffany Wun;Richard Pusch;Sheelagh Carpendale,Charles Perin;Tiffany Wun;Richard Pusch;Sheelagh Carpendale,"City, University of LondonUniversity of Calgary;University of Calgary;University of Calgary;University of Calgary",10.1109/INFVIS.2005.1532136;10.1109/TVCG.2015.2467851;10.1109/TVCG.2012.251;10.1109/TVCG.2012.220;10.1109/TVCG.2014.2346424;10.1109/TVCG.2014.2346298;10.1109/TVCG.2016.2598594;10.1109/TVCG.2015.2467752;10.1109/TVCG.2015.2467951;10.1109/TVCG.2015.2467951;10.1109/VAST.2008.4677355;10.1109/TVCG.2014.2346250;10.1109/TVCG.2012.229;10.1109/TVCG.2009.126;10.1109/TVCG.2007.70594;10.1109/TVCG.2014.2346279;10.1109/TVCG.2013.192;10.1109/TVCG.2009.114;10.1109/TVCG.2014.2346320;10.1109/TVCG.2012.265,"Trajectory visualization,visual encoding,movement data,graphical perception,quantitative evaluation",2,1,79,
SciVis,2017,Interactive Design and Visualization of Branched Covering Spaces,10.1109/TVCG.2017.2744038,http://dx.doi.org/10.1109/TVCG.2017.2744038,843,852,J,"Branched covering spaces are a mathematical concept which originates from complex analysis and topology and has applications in tensor field topology and geometry remeshing. Given a manifold surface and an<inline-formula><tex-math notation=""LaTeX"">$N$</tex-math><alternatives><inline-graphic xlink:href=""24tvcg01-zhang-2744038-ieq-1-source.tif"" xmlns:xlink=""http://www.w3.org/1999/xlink""/></alternatives></inline-formula>-way rotational symmetry field, a branched covering space is a manifold surface that has an<inline-formula><tex-math notation=""LaTeX"">$N$</tex-math><alternatives><inline-graphic xlink:href=""24tvcg01-zhang-2744038-ieq-2-source.tif"" xmlns:xlink=""http://www.w3.org/1999/xlink""/></alternatives></inline-formula>-to-1 map to the original surface except at the<italic>ramification points</italic>, which correspond to the singularities in the rotational symmetry field. Understanding the notion and mathematical properties of branched covering spaces is important to researchers in tensor field visualization and geometry processing, and their application areas. In this paper, we provide a framework to interactively design and visualize the branched covering space (BCS) of an input mesh surface and a rotational symmetry field defined on it. In our framework, the user can visualize not only the BCSs but also their construction process. In addition, our system allows the user to design the geometric realization of the BCS using mesh deformation techniques as well as connecting tubes. This enables the user to verify important facts about BCSs such as that they are manifold surfaces around singularities, as well as the<italic>Riemann-Hurwitz formula</italic>which relates the Euler characteristic of the BCS to that of the original mesh. Our system is evaluated by student researchers in scientific visualization and geometry processing as well as faculty members in mathematics at our university who teach topology. We include their evaluations and feedback in the paper.",Lawrence Roy;Prashant Kumar;Sanaz Golbabaei;Yue Zhang 0009;Eugene Zhang,Lawrence Roy;Prashant Kumar;Sanaz Golbabaei;Yue Zhang;Eugene Zhang,Roy Family Homeschool;Oregon State University;Oregon State University;Oregon State University;Oregon State University,,"Tensor field topology,math visualization,branched covering spaces visualization,rotational symmetries,ramification points",2,0,31,
VAST,2017,Beyond Tasks: An Activity Typology for Visual Analytics,10.1109/TVCG.2017.2745180,http://dx.doi.org/10.1109/TVCG.2017.2745180,267,277,J,"As Visual Analytics (VA) research grows and diversifies to encompass new systems, techniques, and use contexts, gaining a holistic view of analytic practices is becoming ever more challenging. However, such a view is essential for researchers and practitioners seeking to develop systems for broad audiences that span multiple domains. In this paper, we interpret VA research through the lens of Activity Theory (AT) - a framework for modelling human activities that has been influential in the field of Human-Computer Interaction. We first provide an overview of Activity Theory, showing its potential for thinking beyond tasks, representations, and interactions to the broader systems of activity in which interactive tools are embedded and used. Next, we describe how Activity Theory can be used as an organizing framework in the construction of activity typologies, building and expanding upon the tradition of abstract task taxonomies in the field of Information Visualization. We then apply the resulting process to create an activity typology for Visual Analytics, synthesizing a wide range of systems and activity concepts from the literature. Finally, we use this typology as the foundation of an activity-centered design process, highlighting both tensions and opportunities in the design space of VA systems.",Darren Edge;Nathalie Henry Riche;Jonathan Larson;Christopher M. White,Darren Edge;Nathalie Henry Riche;Jonathan Larson;Christopher White,Microsoft Research;Microsoft Research;Microsoft Research;Microsoft Research,10.1109/INFVIS.2005.1532136;10.1109/VAST.2008.4677362;10.1109/TVCG.2013.124;10.1109/VAST.2006.261439;10.1109/TVCG.2016.2598468;10.1109/INFVIS.2000.885092;10.1109/VAST.2006.261430;10.1109/VAST.2008.4677365;10.1109/VAST.2007.4389011;10.1109/VAST.2011.6102438;10.1109/VAST.2010.5653598;10.1109/TVCG.2014.2346573;10.1109/VAST.2008.4677366;10.1109/TVCG.2015.2467551;10.1109/TVCG.2012.213;10.1109/VAST.2007.4389006;10.1109/TVCG.2009.162;10.1109/TVCG.2007.70577;10.1109/TVCG.2016.2598543,"Activity theory,visual analytics,activity-centered design,literature review,human-computer interaction",2,1,77,
VAST,2017,Interactive Visual Alignment of Medieval Text Versions,10.1109/VAST.2017.8585505,http://dx.doi.org/10.1109/VAST.2017.8585505,127,138,C,"Textual criticism consists of the identification and analysis of variant readings among different versions of a text. Being a relatively simple task for modern languages, the collation of medieval text traditions ranges from the complex to the virtually impossible depending on the degree of instability of textual transmission. We present a visual analytics environment that supports computationally aligning such complex textual differences typical of orally inflected medieval poetry. For the purpose of analyzing alignment, we provide interactive visualizations for different text hierarchy levels, specifically, a meso reading view to support investigating repetition and variance at the line level across text segments. In addition to outlining important aspects of our interdisciplinary collaboration, we emphasize the utility of the proposed system by various usage scenarios in medieval French literature.",Stefan Jänicke;David Joseph Wrisley,Stefan Jänicke;David Joseph Wrisley,"Image and Signal Processing Group, Institute for Computer Science, Leipzig University, Germany;Digital Humanities, New York University Abu Dhabi, United Arab Emirates",10.1109/VAST.2014.7042493;10.1109/TVCG.2014.2346431;10.1109/VAST.2009.5333443;10.1109/VAST.2007.4389004;10.1109/VAST.2009.5333564;10.1109/VAST.2009.5333248,,2,5,63,
VAST,2017,Visualizing Real-Time Strategy Games: The Example of StarCraft II,10.1109/VAST.2017.8585594,http://dx.doi.org/10.1109/VAST.2017.8585594,71,80,C,"We present a visualization system for users to examine real-time strategy games, which have become very popular globally in recent years. Unlike previous systems that focus on showing statistics and build order, our system can depict the most important part - battles in the games. Specifically, we visualize detailed movements of armies belonging to respective nations on a map and enable users to examine battles from a global view to a local view. In the global view, battles are depicted by curved arrows revealing how the armies enter and escape from the battlefield. By observing the arrows and the height map, users can make sense of offensive and defensive strategies easily. In the local view, units of each type are rendered on the map, and their movements are represented by animation. We also render an attack line between a pair of units if one of them can attack the other to help users analyze the advantages and disadvantages of a particular formation. Accordingly, users can utilize our system to discover statistics, build order, and battles, and learn strategies from games played by professionals.",Yen-Ting Kuan;Yu-Shuen Wang;Jung-Hong Chuang,Yen-Ting Kuan;Yu-Shuen Wang;Jung-Hong Chuang,National Chiao Tung University;National Chiao Tung University;National Chiao Tung University,10.1109/INFVIS.2000.885098,"real-time strategy games,StarCraft,game visualization,trajectories",2,1,23,
VAST,2017,Pattern Trails: Visual Analysis of Pattern Transitions in Subspaces,10.1109/VAST.2017.8585613,http://dx.doi.org/10.1109/VAST.2017.8585613,1,12,C,"Subspace analysis methods have gained interest for identifying patterns in subspaces of high-dimensional data. Existing techniques allow to visualize and compare patterns in subspaces. However, many subspace analysis methods produce an abundant amount of patterns, which often remain redundant and are difficult to relate. Creating effective layouts for comparison of subspace patterns remains challenging. We introduce Pattern Trails, a novel approach for visually ordering and comparing subspace patterns. Central to our approach is the notion of pattern transitions as an interpretable structure imposed to order and compare patterns between subspaces. The basic idea is to visualize projections of subspaces side-by-side, and indicate changes between adjacent patterns in the subspaces by a linked representation, hence introducing pattern transitions. Our contributions comprise a systematization for how pairs of subspace patterns can be compared, and how changes can be interpreted in terms of pattern transitions. We also contribute a technique for visual subspace analysis based on a data-driven similarity measure between subspace representations. This measure is useful to order the patterns, and interactively group subspaces to reduce redundancy. We demonstrate the usefulness of our approach by application to several use cases, indicating that data can be meaningfully ordered and interpreted in terms of pattern transitions.",Dominik Jäckle;Michael Blumenschein;Michael Behrisch 0001;Daniel A. Keim;Tobias Schreck,Dominik Jäckle;Michael Hund;Michael Behrisch;Daniel A. Keim;Tobias Schreck,University of Konstanz;University of Konstanz;University of Konstanz;University of Konstanz;TU Graz,10.1109/VAST.2012.6400490;10.1109/TVCG.2011.188;10.1109/TVCG.2015.2467552;10.1109/TVCG.2010.184;10.1109/INFVIS.2005.1532141;10.1109/TVCG.2013.173;10.1109/VAST.2010.5652392;10.1109/VISUAL.1990.146402;10.1109/VISUAL.1995.485140;10.1109/TVCG.2014.2346482;10.1109/TVCG.2015.2467132;10.1109/TVCG.2014.2346481;10.1109/TVCG.2016.2598495;10.1109/TVCG.2013.153;10.1109/TVCG.2015.2467717;10.1109/VAST.2012.6400488;10.1109/TVCG.2011.178;10.1109/VISUAL.1995.485139;10.1109/TVCG.2009.179;10.1109/TVCG.2013.150,,2,1,58,
InfoVis,2018,Looks Good To Me: Visualizations As Sanity Checks,10.1109/TVCG.2018.2864907,http://dx.doi.org/10.1109/TVCG.2018.2864907,830,839,J,"Famous examples such as Anscombe's Quartet highlight that one of the core benefits of visualizations is allowing people to discover visual patterns that might otherwise be hidden by summary statistics. This visual inspection is particularly important in exploratory data analysis, where analysts can use visualizations such as histograms and dot plots to identify data quality issues. Yet, these visualizations are driven by parameters such as histogram bin size or mark opacity that have a great deal of impact on the final visual appearance of the chart, but are rarely optimized to make important features visible. In this paper, we show that data flaws have varying impact on the visual features of visualizations, and that the adversarial or merely uncritical setting of design parameters of visualizations can obscure the visual signatures of these flaws. Drawing on the framework of Algebraic Visualization Design, we present the results of a crowdsourced study showing that common visualization types can appear to reasonably summarize distributional data while hiding large and important flaws such as missing data and extraneous modes. We make use of these results to propose additional best practices for visualizations of distributions for data quality tasks.",Michael Correll;Mingwei Li;Gordon L. Kindlmann;Carlos Scheidegger,Michael Correll;Mingwei Li;Gordon Kindlmann;Carlos Scheidegger,Tableau Research;University of Arizona;University of Chicago;University of Arizona,10.1109/TVCG.2016.2598862;10.1109/TVCG.2011.185;10.1109/TVCG.2014.2346298;10.1109/VAST.2016.7883519;10.1109/TVCG.2016.2598618;10.1109/TVCG.2014.2346978;10.1109/TVCG.2014.2346979;10.1109/TVCG.2012.230;10.1109/TVCG.2014.2346325;10.1109/TVCG.2016.2599030;10.1109/TVCG.2017.2744359;10.1109/TVCG.2015.2469125;10.1109/TVCG.2010.161;10.1109/TVCG.2015.2467191,"Graphical perception,data quality,univariate visualizations",2,6,51,
InfoVis,2018,Structure-aware Fisheye Views for Efficient Large Graph Exploration,10.1109/TVCG.2018.2864911,http://dx.doi.org/10.1109/TVCG.2018.2864911,566,575,J,"Traditional fisheye views for exploring large graphs introduce substantial distortions that often lead to a decreased readability of paths and other interesting structures. To overcome these problems, we propose a framework for structure-aware fisheye views. Using edge orientations as constraints for graph layout optimization allows us not only to reduce spatial and temporal distortions during fisheye zooms, but also to improve the readability of the graph structure. Furthermore, the framework enables us to optimize fisheye lenses towards specific tasks and design a family of new lenses: polyfocal, cluster, and path lenses. A GPU implementation lets us process large graphs with up to 15,000 nodes at interactive rates. A comprehensive evaluation, a user study, and two case studies demonstrate that our structure-aware fisheye views improve layout readability and user performance.",Yunhai Wang;Yanyan Wang;Haifeng Zhang;Yinqi Sun;Chi-Wing Fu;Michael Sedlmair;Baoquan Chen;Oliver Deussen,Yunhai Wang;Yanyan Wang;Haifeng Zhang;Yinqi Sun;Chi-Wing Fu;Michael Sedlmair;Baoquan Chen;Oliver Deussen,"Shandong University;Shandong University;Shandong University;Shandong University;Chinese University of Hong Kong;VISUSUniversity of Stuttgart;Peking University;Konstanz University, Germany",10.1109/TVCG.2015.2467035;10.1109/INFVIS.2005.1532130;10.1109/TVCG.2006.156;10.1109/TVCG.2008.130;10.1109/INFVIS.2004.66;10.1109/TVCG.2011.223;10.1109/TVCG.2009.108;10.1109/TVCG.2007.70577;10.1109/TVCG.2017.2745919;10.1109/INFVIS.2003.1249008;10.1109/TVCG.2012.189,"Graph Visualization,Focus-Context Technique,Structure-aware Zoom,Graph Layout Technique",2,3,56,
InfoVis,2018,Elastic Documents: Coupling Text and Tables through Contextual Visualizations for Enhanced Document Reading,10.1109/TVCG.2018.2865119,http://dx.doi.org/10.1109/TVCG.2018.2865119,661,671,J,"Today's data-rich documents are often complex datasets in themselves, consisting of information in different formats such as text, figures, and data tables. These additional media augment the textual narrative in the document. However, the static layout of a traditional for-print document often impedes deep understanding of its content because of the need to navigate to access content scattered throughout the text. In this paper, we seek to facilitate enhanced comprehension of such documents through a contextual visualization technique that couples text content with data tables contained in the document. We parse the text content and data tables, cross-link the components using a keyword-based matching algorithm, and generate on-demand visualizations based on the reader's current focus within a document. We evaluate this technique in a user study comparing our approach to a traditional reading experience. Results from our study show that (1) participants comprehend the content better with tighter coupling of text and data, (2) the contextual visualizations enable participants to develop better summaries that capture the main data-rich insights within the document, and (3) overall, our method enables participants to develop a more detailed understanding of the document content.",Sriram Karthik Badam;Zhicheng Liu;Niklas Elmqvist,Sriram Karthik Badam;Zhicheng Liu;Niklas Elmqvist,"University of Maryland, College Park, MD, USA;Adobe Research, Seattle, WA, USA;University of Maryland, College Park, MD, USA",10.1109/TVCG.2011.185;10.1109/TVCG.2016.2598594;10.1109/TVCG.2014.2346435;10.1109/TVCG.2011.255;10.1109/TVCG.2007.70594;10.1109/TVCG.2014.2346279;10.1109/INFVIS.2000.885091;10.1109/TVCG.2009.139;10.1109/TVCG.2009.165;10.1109/TVCG.2009.171,"Document reading,contextual visualizations,visual aids,comprehension,summarization",2,1,66,
InfoVis,2018,SRVis: Towards Better Spatial Integration in Ranking Visualization,10.1109/TVCG.2018.2865126,http://dx.doi.org/10.1109/TVCG.2018.2865126,459,469,J,"Interactive ranking techniques have substantially promoted analysts' ability in making judicious and informed decisions effectively based on multiple criteria. However, the existing techniques cannot satisfactorily support the analysis tasks involved in ranking large-scale spatial alternatives, such as selecting optimal locations for chain stores, where the complex spatial contexts involved are essential to the decision-making process. Limitations observed in the prior attempts of integrating rankings with spatial contexts motivate us to develop a context-integrated visual ranking technique. Based on a set of generic design requirements we summarized by collaborating with domain experts, we propose SRVis, a novel spatial ranking visualization technique that supports efficient spatial multi-criteria decision-making processes by addressing three major challenges in the aforementioned context integration, namely, a) the presentation of spatial rankings and contexts, b) the scalability of rankings' visual representations, and c) the analysis of context-integrated spatial rankings. Specifically, we encode massive rankings and their cause with scalable matrix-based visualizations and stacked bar charts based on a novel two-phase optimization framework that minimizes the information loss, and the flexible spatial filtering and intuitive comparative analysis are adopted to enable the in-depth evaluation of the rankings and assist users in selecting the best spatial alternative. The effectiveness of the proposed technique has been evaluated and demonstrated with an empirical study of optimization methods, two case studies, and expert interviews.",Di Weng;Ran Chen;Zikun Deng;Feiran Wu;Jingmin Chen;Yingcai Wu,Di Weng;Ran Chen;Zikun Deng;Feiran Wu;Jingmin Chen;Yingcai Wu,"State Key Lab of CAD & CGZhejiang UniversityAlibaba-Zhejiang University JointInstitute of Frontier Technologies;State Key Lab of CAD & CGZhejiang UniversityAlibaba-Zhejiang University JointInstitute of Frontier Technologies;State Key Lab of CAD & CGZhejiang UniversityAlibaba-Zhejiang University JointInstitute of Frontier Technologies;Alibaba Group, Hangzhou, China;Alibaba Group, Hangzhou, China;State Key Lab of CAD & CGZhejiang UniversityAlibaba-Zhejiang University JointInstitute of Frontier Technologies",10.1109/TVCG.2016.2598416;10.1109/TVCG.2013.193;10.1109/TVCG.2011.185;10.1109/TVCG.2008.166;10.1109/TVCG.2014.2346594;10.1109/TVCG.2013.173;10.1109/TVCG.2015.2467771;10.1109/TVCG.2008.181;10.1109/TVCG.2016.2598432;10.1109/TVCG.2018.2865018;10.1109/VAST.2011.6102455;10.1109/TVCG.2016.2598831;10.1109/TVCG.2016.2598585;10.1109/TVCG.2009.111;10.1109/TVCG.2015.2467112;10.1109/TVCG.2012.253;10.1109/TVCG.2015.2467717;10.1109/TVCG.2017.2745078;10.1109/TVCG.2014.2346913,"Spatial ranking,visualization",2,6,60,
InfoVis,2018,Evaluating ‘Graphical Perception’ with CNNs,10.1109/TVCG.2018.2865138,http://dx.doi.org/10.1109/TVCG.2018.2865138,641,650,J,"Convolutional neural networks can successfully perform many computer vision tasks on images. For visualization, how do CNNs perform when applied to graphical perception tasks? We investigate this question by reproducing Cleveland and McGill's seminal 1984 experiments, which measured human perception efficiency of different visual encodings and defined elementary perceptual tasks for visualization. We measure the graphical perceptual capabilities of four network architectures on five different visualization tasks and compare to existing and new human performance baselines. While under limited circumstances CNNs are able to meet or outperform human task performance, we find that CNNs are not currently a good model for human graphical perception. We present the results of these experiments to foster the understanding of how CNNs succeed and fail when applied to data visualizations.",Daniel Haehn;James Tompkin;Hanspeter Pfister,Daniel Haehn;James Tompkin;Hanspeter Pfister,Harvard University;Brown University;Harvard University,10.1109/TVCG.2014.2346979;10.1109/TVCG.2014.2346320,"Machine Perception,Graphical Perception,Deep Learning,Convolutional Neural Networks",2,6,50,
InfoVis,2018,A Heuristic Approach to Value-Driven Evaluation of Visualizations,10.1109/TVCG.2018.2865146,http://dx.doi.org/10.1109/TVCG.2018.2865146,491,500,J,"Recently, an approach for determining the value of a visualization was proposed, one moving beyond simple measurements of task accuracy and speed. The value equation contains components for the time savings a visualization provides, the insights and insightful questions it spurs, the overall essence of the data it conveys, and the confidence about the data and its domain it inspires. This articulation of value is purely descriptive, however, providing no actionable method of assessing a visualization's value. In this work, we create a heuristic-based evaluation methodology to accompany the value equation for assessing interactive visualizations. We refer to the methodology colloquially as ICE-T, based on an anagram of the four value components. Our approach breaks the four components down into guidelines, each of which is made up of a small set of low-level heuristics. Evaluators who have knowledge of visualization design principles then assess the visualization with respect to the heuristics. We conducted an initial trial of the methodology on three interactive visualizations of the same data set, each evaluated by 15 visualization experts. We found that the methodology showed promise, obtaining consistent ratings across the three visualizations and mirroring judgments of the utility of the visualizations by instructors of the course in which they were developed.",Emily Wall;Meeshu Agnihotri;Laura E. Matzen;Kristin Divis;Michael J. Haass;Alex Endert;John T. Stasko,Emily Wall;Meeshu Agnihotri;Laura Matzen;Kristin Divis;Michael Haass;Alex Endert;John Stasko,"Georgia Institute of Technology, Atlanta, GA, USA;Georgia Institute of Technology, Atlanta, GA, USA;Sandia National Laboratories, Albuquerque, NM, USA;Sandia National Laboratories, Albuquerque, NM, USA;Sandia National Laboratories, Albuquerque, NM, USA;Georgia Institute of Technology, Atlanta, GA, USA;Georgia Institute of Technology, Atlanta, GA, USA",10.1109/INFVIS.2001.963289;10.1109/VISUAL.2003.1250401,"Visualization evaluation,heuristics,value of visualization",2,4,35,
InfoVis,2018,Dynamic Composite Data Physicalization Using Wheeled Micro-Robots,10.1109/TVCG.2018.2865159,http://dx.doi.org/10.1109/TVCG.2018.2865159,737,747,J,"This paper introduces dynamic composite physicalizations, a new class of physical visualizations that use collections of self-propelled objects to represent data. Dynamic composite physicalizations can be used both to give physical form to well-known interactive visualization techniques, and to explore new visualizations and interaction paradigms. We first propose a design space characterizing composite physicalizations based on previous work in the fields of Information Visualization and Human Computer Interaction. We illustrate dynamic composite physicalizations in two scenarios demonstrating potential benefits for collaboration and decision making, as well as new opportunities for physical interaction. We then describe our implementation using wheeled micro-robots capable of locating themselves and sensing user input, before discussing limitations and opportunities for future work.",Mathieu Le Goc;Charles Perin;Sean Follmer;Jean-Daniel Fekete;Pierre Dragicevic,Mathieu Le Goc;Charles Perin;Sean Follmer;Jean-Daniel Fekete;Pierre Dragicevic,"Stanford University, USA;University of Victoria, Canada;Stanford University, USA;INRIA, Saclay, France;INRIA, Saclay, France",10.1109/TVCG.2014.2346984;10.1109/TVCG.2014.2346424;10.1109/TVCG.2008.153;10.1109/TVCG.2007.70539;10.1109/TVCG.2014.2346292;10.1109/TVCG.2013.227;10.1109/TVCG.2013.134;10.1109/TVCG.2014.2346250;10.1109/TVCG.2017.2743859;10.1109/TVCG.2016.2598920;10.1109/TVCG.2012.199;10.1109/TVCG.2014.2346279;10.1109/TVCG.2007.70541;10.1109/TVCG.2016.2598498,"information visualization,data physicalization,tangible user interfaces",2,3,92,
InfoVis,2018,Information Olfactation: Harnessing Scent to Convey Data,10.1109/TVCG.2018.2865237,http://dx.doi.org/10.1109/TVCG.2018.2865237,726,736,J,"Olfactory feedback for analytical tasks is a virtually unexplored area in spite of the advantages it offers for information recall, feature identification, and location detection. Here we introduce the concept of information olfactation as the fragrant sibling of information visualization, and discuss how scent can be used to convey data. Building on a review of the human olfactory system and mirroring common visualization practice, we propose olfactory marks, the substrate in which they exist, and their olfactory channels that are available to designers. To exemplify this idea, we present viScent: A six-scent stereo olfactory display capable of conveying olfactory glyphs of varying temperature and direction, as well as a corresponding software system that integrates the display with a traditional visualization display. Finally, we present three applications that make use of the viScent system: A 2D graph visualization, a 2D line and point chart, and an immersive analytics graph visualization in 3D virtual reality. We close the paper with a review of possible extensions of viScent and applications of information olfactation for general visualization beyond the examples in this paper.",Biswaksen Patnaik;Andrea Batch;Niklas Elmqvist,Biswaksen Patnaik;Andrea Batch;Niklas Elmqvist,"University of Maryland, College Park, MD, USA;University of Maryland, College Park, MD, USA;University of Maryland, College Park, MD, USA",10.1109/TVCG.2016.2599107,"Olfaction,smell,scent,olfactory display,immersive analytics,immersion",2,3,104,
SciVis,2018,Probabilistic Asymptotic Decider for Topological Ambiguity Resolution in Level-Set Extraction for Uncertain 2D Data,10.1109/TVCG.2018.2864505,http://dx.doi.org/10.1109/TVCG.2018.2864505,1163,1172,J,"We present a framework for the analysis of uncertainty in isocontour extraction. The marching squares (MS) algorithm for isocontour reconstruction generates a linear topology that is consistent with hyperbolic curves of a piecewise bilinear interpolation. The saddle points of the bilinear interpolant cause topological ambiguity in isocontour extraction. The midpoint decider and the asymptotic decider are well-known mathematical techniques for resolving topological ambiguities. The latter technique investigates the data values at the cell saddle points for ambiguity resolution. The uncertainty in data, however, leads to uncertainty in underlying bilinear interpolation functions for the MS algorithm, and hence, their saddle points. In our work, we study the behavior of the asymptotic decider when data at grid vertices is uncertain. First, we derive closed-form distributions characterizing variations in the saddle point values for uncertain bilinear interpolants. The derivation assumes uniform and nonparametric noise models, and it exploits the concept of ratio distribution for analytic formulations. Next, the probabilistic asymptotic decider is devised for ambiguity resolution in uncertain data using distributions of the saddle point values derived in the first step. Finally, the confidence in probabilistic topological decisions is visualized using a colormapping technique. We demonstrate the higher accuracy and stability of the probabilistic asymptotic decider in uncertain data with regard to existing decision frameworks, such as deciders in the mean field and the probabilistic midpoint decider, through the isocontour visualization of synthetic and real datasets.",Tushar M. Athawale;Christopher R. Johnson 0001,Tushar Athawale;Chris R. Johnson,Scientific Computing & Imaging (SCI) InstituteUniversity of Utah;Scientific Computing & Imaging (SCI) InstituteUniversity of Utah,10.1109/TVCG.2013.208;10.1109/TVCG.2015.2467958;10.1109/VISUAL.2002.1183769;10.1109/TVCG.2017.2744099;10.1109/TVCG.2011.203;10.1109/TVCG.2007.70518;10.1109/VISUAL.1991.175782;10.1109/TVCG.2013.143,"Isocontour visualization,topological uncertainty,marching squares,asymptotic decider,bilinear interpolation,probabilistic computation",2,3,40,
SciVis,2018,Gaia Sky: Navigating the Gaia Catalog,10.1109/TVCG.2018.2864508,http://dx.doi.org/10.1109/TVCG.2018.2864508,1070,1079,J,"In this paper, we present Gaia Sky, a free and open-source multiplatform 3D Universe system, developed since 2014 in the Data Processing and Analysis Consortium framework of ESA's Gaia mission. Gaia's data release 2 represents the largest catalog of the stars of our Galaxy, comprising 1.3 billion star positions, with parallaxes, proper motions, magnitudes, and colors. In this mission, Gaia Sky is the central tool for off-the-shelf visualization of these data, and for aiding production of outreach material. With its capabilities to effectively handle these data, to enable seamless navigation along the high dynamic range of distances, and at the same time to provide advanced visualization techniques including relativistic aberration and gravitational wave effects, currently no actively maintained cross-platform, modern, and open alternative exists.",Antoni Sagristà;Stefan Jordan;Thomas Müller 0005;Filip Sadlo,Antoni Sagristà;Stefan Jordan;Thomas Müller;Filip Sadlo,Heidelberg University;Heidelberg University;Max Planck Institute for Astronomy;Heidelberg University,10.1109/TVCG.2006.176,"Astronomy visualization,3D Universe software,star catalog rendering,Gaia mission",2,4,31,
SciVis,2018,Dynamic Volume Lines: Visual Comparison of 3D Volumes through Space-filling Curves,10.1109/TVCG.2018.2864510,http://dx.doi.org/10.1109/TVCG.2018.2864510,1040,1049,J,"The comparison of many members of an ensemble is difficult, tedious, and error-prone, which is aggravated by often just subtle differences. In this paper, we introduce Dynamic Volume Lines for the interactive visual analysis and comparison of sets of 3D volumes. Each volume is linearized along a Hilbert space-filling curve into a 1D Hilbert line plot, which depicts the intensities over the Hilbert indices. We present a nonlinear scaling of these 1D Hilbert line plots based on the intensity variations in the ensemble of 3D volumes, which enables a more effective use of the available screen space. The nonlinear scaling builds the basis for our interactive visualization techniques. An interactive histogram heatmap of the intensity frequencies serves as overview visualization. When zooming in, the frequencies are replaced by detailed 1D Hilbert line plots and optional functional boxplots. To focus on important regions of the volume ensemble, nonlinear scaling is incorporated into the plots. An interactive scaling widget depicts the local ensemble variations. Our brushing and linking interface reveals, for example, regions with a high ensemble variation by showing the affected voxels in a 3D spatial view. We show the applicability of our concepts using two case studies on ensembles of 3D volumes resulting from tomographic reconstruction. In the first case study, we evaluate an artificial specimen from simulated industrial 3D X-ray computed tomography (XCT). In the second case study, a real-world XCT foam specimen is investigated. Our results show that Dynamic Volume Lines can identify regions with high local intensity variations, allowing the user to draw conclusions, for example, about the choice of reconstruction parameters. Furthermore, it is possible to detect ring artifacts in reconstructions volumes.",Johannes Weissenböck;Bernhard Fröhler;M. Eduard Gröller;Johann Kastner;Christoph Heinzl,Johannes Weissenböck;Bernhard Fröhler;Eduard Gröller;Johann Kastner;Christoph Heinzl,"University of Applied Sciences Upper Austria, Wels, Austria;University of Applied Sciences Upper Austria, Wels, Austria;TU Wien, Vienna, Austria;University of Applied Sciences Upper Austria, Wels, Austria;University of Applied Sciences Upper Austria, Wels, Austria",10.1109/TVCG.2014.2346448;10.1109/VAST.2015.7347634;10.1109/TVCG.2009.155;10.1109/TVCG.2014.2346455;10.1109/VISUAL.2005.1532847;10.1109/TVCG.2013.213;10.1109/VAST.2014.7042491;10.1109/TVCG.2014.2346321;10.1109/VAST.2016.7883516;10.1109/TVCG.2013.143,"Ensemble data,comparative visualization,visual analysis,Hilbert curve,nonlinear scaling,X-ray computed tomography",2,5,43,
SciVis,2018,Interactive obstruction-free lensing for volumetric data visualization,10.1109/TVCG.2018.2864690,http://dx.doi.org/10.1109/TVCG.2018.2864690,1029,1039,J,"Occlusion is an issue in volumetric visualization as it prevents direct visualization of the region of interest. While many techniques such as transfer functions, volume segmentation or view distortion have been developed to address this, there is still room for improvement to better support the understanding of objects' vicinity. However, most existing Focus+Context fail to solve partial occlusion in datasets where the target and the occluder are very similar density-wise. For these reasons, we investigate a new technique which maintains the general structure of the investigated volumetric dataset while addressing occlusion issues. With our technique, the user interactively defines an area of interest where an occluded region or object is partially visible. Then our lens starts pushing at its border occluding objects, thus revealing hidden volumetric data. Next, the lens is modified with an extended field of view (fish-eye deformation) to better see the vicinity of the selected region. Finally, the user can freely explore the surroundings of the area under investigation within the lens. To provide real-time exploration, we implemented our lens using a GPU accelerated ray-casting framework to handle ray deformations, local lighting, and local viewpoint manipulation. We illustrate our technique with five application scenarios in baggage inspection, 3D fluid flow visualization, chest radiology, air traffic planning, and DTI fiber exploration.",Michael Traoré;Christophe Hurter;Alexandru Telea,Michael Traoré;Christophe Hurter;Alexandru Telea,ENACFrench Civil Aviation University;ENACFrench Civil Aviation University;Institute Johan BernoulliUniversity of Groningen,10.1109/TVCG.2006.140;10.1109/TVCG.2006.144;10.1109/TVCG.2007.70565;10.1109/TVCG.2010.127;10.1109/TVCG.2009.138;10.1109/VISUAL.2004.32;10.1109/TVCG.2011.223;10.1109/TVCG.2010.193;10.1109/TVCG.2006.124;10.1109/VISUAL.2003.1250400;10.1109/VISUAL.1999.809865;10.1109/TVCG.2012.265;10.1109/TVCG.2016.2599049;10.1109/VISUAL.2005.1532818,"Interaction techniques,focus + context,volume visualization,volume rendering,raycasting",2,1,51,
SciVis,2018,Recirculation Surfaces for Flow Visualization,10.1109/TVCG.2018.2864813,http://dx.doi.org/10.1109/TVCG.2018.2864813,946,955,J,"We present a formal approach to the visual analysis of recirculation in flows by introducing recirculation surfaces for 3D unsteady flow fields. Recirculation surfaces are the loci where massless particle integration returns to its starting point after some variable, finite integration. We give a rigorous definition of recirculation surfaces as 2-manifolds embedded in 5D space and study their properties. Based on this we construct an algorithm for their extraction, which searches for intersections of a recirculation surface with lines defined in 3D. This reduces the problem to a repeated search for critical points in 3D vector fields. We provide a uniform sampling of the search space paired with a surface reconstruction and visualize results. This way, we present the first algorithm for a comprehensive feature extraction in the 5D flow map of a 3D flow. The problem of finding isolated closed orbits in steady vector fields occurs as a special case of recirculation surfaces. This includes isolated closed orbits with saddle behavior. We show recirculation surfaces for a number of artificial and real flow data sets.",Thomas Wilde;Christian Rössl;Holger Theisel,Thomas Wilde;Christian Rössi;Holger Theisel,Visual Computing groupUniversity of Magdeburg;Visual Computing groupUniversity of Magdeburg;Visual Computing groupUniversity of Magdeburg,10.1109/VISUAL.2004.107;10.1109/TVCG.2009.177;10.1109/VISUAL.2004.59;10.1109/VISUAL.2002.1183786;10.1109/TVCG.2008.163,"Flow visualization,recirculation,unsteady flow",2,1,41,
SciVis,2018,An Interactive Framework for Visualization of Weather Forecast Ensembles,10.1109/TVCG.2018.2864815,http://dx.doi.org/10.1109/TVCG.2018.2864815,1091,1101,J,"Numerical Weather Prediction (NWP) ensembles are commonly used to assess the uncertainty and confidence in weather forecasts. Spaghetti plots are conventional tools for meteorologists to directly examine the uncertainty exhibited by ensembles, where they simultaneously visualize isocontours of all ensemble members. To avoid visual clutter in practical usages, one needs to select a small number of informative isovalues for visual analysis. Moreover, due to the complex topology and variation of ensemble isocontours, it is often a challenging task to interpret the spaghetti plot for even a single isovalue in large ensembles. In this paper, we propose an interactive framework for uncertainty visualization of weather forecast ensembles that significantly improves and expands the utility of spaghetti plots in ensemble analysis. Complementary to state-of-the-art methods, our approach provides a complete framework for visual exploration of ensemble isocontours, including isovalue selection, interactive isocontour variability exploration, and interactive sub-region selection and re-analysis. Our framework is built upon the high-density clustering paradigm, where the mode structure of the density function is represented as a hierarchy of nested subsets of the data. We generalize the high-density clustering for isocontours and propose a bandwidth selection method for estimating the density function of ensemble isocontours. We present novel visualizations based on high-density clustering results, called the mode plot and the simplified spaghetti plot. The proposed mode plot visually encodes the structure provided by the high-density clustering result and summarizes the distribution of ensemble isocontours. It also enables the selection of subsets of interesting isocontours, which are interactively highlighted in a linked spaghetti plot for providing spatial context. To provide an interpretable overview of the positional variability of isocontours, our system allows for selection of informative isovalues from the simplified spaghetti plot. Due to the spatial variability of ensemble isocontours, the system allows for interactive selection and focus on sub-regions for local uncertainty and clustering re-analysis. We examine a number of ensemble datasets to establish the utility of our approach and discuss its advantages over state-of-the-art visual analysis tools for ensemble data.",Bo Ma 0002;Alireza Entezari,Bo Ma;Alireza Entezari,University of Florida;University of Florida,10.1109/TVCG.2013.208;10.1109/TVCG.2015.2467958;10.1109/TVCG.2016.2598869;10.1109/TVCG.2014.2346448;10.1109/TVCG.2015.2467204;10.1109/TVCG.2016.2598868;10.1109/TVCG.2015.2468093;10.1109/TVCG.2017.2745178;10.1109/TVCG.2015.2467754;10.1109/TVCG.2010.181;10.1109/TVCG.2014.2346332;10.1109/TVCG.2016.2598830;10.1109/TVCG.2013.143,"Spaghetti plots,ensemble visualization,uncertainty visualization,high-density clustering,ensemble forecasting",2,1,56,
SciVis,2018,Tensor Field Visualization using Fiber Surfaces of Invariant Space,10.1109/TVCG.2018.2864846,http://dx.doi.org/10.1109/TVCG.2018.2864846,1122,1131,J,"Scientific visualization developed successful methods for scalar and vector fields. For tensor fields, however, effective, interactive visualizations are still missing despite progress over the last decades. We present a general approach for the generation of separating surfaces in symmetric, second-order, three-dimensional tensor fields. These surfaces are defined as fiber surfaces of the invariant space, i.e. as pre-images of surfaces in the range of a complete set of invariants. This approach leads to a generalization of the fiber surface algorithm by Klacansky et al. [16] to three dimensions in the range. This is due to the fact that the invariant space is three-dimensional for symmetric second-order tensors over a spatial domain. We present an algorithm for surface construction for simplicial grids in the domain and simplicial surfaces in the invariant space. We demonstrate our approach by applying it to stress fields from component design in mechanical engineering.",Felix Raith;Christian Blecha;Thomas Nagel;Francesco Parisio;Olaf Kolditz;Fabian Günther;Markus Stommel;Gerik Scheuermann,Felix Raith;Christian Blecha;Thomas Nagel;Francesco Parisio;Olaf Kolditz;Fabian Günther;Markus Stommel;Gerik Scheuermann,"Institute of Computer Science, Leipzig University, Leipzig, Germany;Institute of Computer Science, Leipzig University, Leipzig, Germany;Department of Environmental Informatics, Helmholtz Center for Environmental Research, Leipzig, Germany;Department of Environmental Informatics, Helmholtz Center for Environmental Research, Leipzig, Germany;Department of Environmental Informatics, Helmholtz Center for Environmental Research, Leipzig, Germany;Faculty for Mechanical Engineering, TU Dortmund University, Dortmund;Faculty for Mechanical Engineering, TU Dortmund University, Dortmund;Institute of Computer Science, Leipzig University, Leipzig, Germany",10.1109/VISUAL.1994.346326,"visualization,tensor field,invariants,fiber surface,interaction",2,2,36,
SciVis,2018,Visualization of Neuronal Structures in Wide-Field Microscopy Brain Images,10.1109/TVCG.2018.2864852,http://dx.doi.org/10.1109/TVCG.2018.2864852,1018,1028,J,"Wide-field microscopes are commonly used in neurobiology for experimental studies of brain samples. Available visualization tools are limited to electron, two-photon, and confocal microscopy datasets, and current volume rendering techniques do not yield effective results when used with wide-field data. We present a workflow for the visualization of neuronal structures in wide-field microscopy images of brain samples. We introduce a novel gradient-based distance transform that overcomes the out-of-focus blur caused by the inherent design of wide-field microscopes. This is followed by the extraction of the 3D structure of neurites using a multi-scale curvilinear filter and cell-bodies using a Hessian-based enhancement filter. The response from these filters is then applied as an opacity map to the raw data. Based on the visualization challenges faced by domain experts, our workflow provides multiple rendering modes to enable qualitative analysis of neuronal structures, which includes separation of cell-bodies from neurites and an intensity-based classification of the structures. Additionally, we evaluate our visualization results against both a standard image processing deconvolution technique and a confocal microscopy image of the same specimen. We show that our method is significantly faster and requires less computational resources, while producing high quality visualizations. We deploy our workflow in an immersive gigapixel facility as a paradigm for the processing and visualization of large, high-resolution, wide-field microscopy brain datasets.",Saeed Boorboor;Shreeraj Jadhav;Mala Ananth;David Talmage;Lorna Role;Arie E. Kaufman,Saeed Boorboor;Shreeraj Jadhav;Mala Ananth;David Talmage;Lorna Role;Arie Kaufman,Department of Computer ScienceStony Brook University;Department of Computer ScienceStony Brook University;Department of Neurobiology & behaviorStony Brook University;Department of Neurobiology & behaviorStony Brook University;Department of Neurobiology & behaviorStony Brook University;Department of Computer ScienceStony Brook University,10.1109/TVCG.2014.2346312;10.1109/TVCG.2013.142;10.1109/TVCG.2012.203;10.1109/TVCG.2017.2744079;10.1109/TVCG.2009.118;10.1109/TVCG.2016.2598472,"Wide-field microscopy,volume visualization,neuron visualization,neuroscience",2,1,58,
SciVis,2018,Deadeye: A Novel Preattentive Visualization Technique Based on Dichoptic Presentation,10.1109/TVCG.2018.2864498,http://dx.doi.org/10.1109/TVCG.2018.2864498,936,945,J,"Preattentive visual features such as hue or flickering can effectively draw attention to an object of interest - for instance, an important feature in a scientific visualization. These features appear to pop out and can be recognized by our visual system, independently from the number of distractors. Most cues do not take advantage of the fact that most humans have two eyes. In cases where binocular vision is applied, it is almost exclusively used to convey depth by exposing stereo pairs. We present Deadeye, a novel preattentive visualization technique based on presenting different stimuli to each eye. The target object is rendered for one eye only and is instantly detected by our visual system. In contrast to existing cues, Deadeye does not modify any visual properties of the target and, thus, is particularly suited for visualization applications. Our evaluation confirms that Deadeye is indeed perceived preattentively. We also explore a conjunction search based on our technique and show that, in contrast to 3D depth, the task cannot be processed in parallel.",Andrey Krekhov;Jens H. Krüger,Andrey Krekhov;Jens Krüger,Center of Visual Data Analysis and Computer Graphics (COVIDAG)University of Duisburg-Essen;Center of Visual Data Analysis and Computer Graphics (COVIDAG)University of Duisburg-Essen,10.1109/TVCG.2011.234;10.1109/VISUAL.2005.1532838;10.1109/TVCG.2014.2346352,"Popout,preattentive vision,comparative visualization,dichoptic presentation",2,2,62,BP
VAST,2018,InkPlanner: Supporting Prewriting via Intelligent Visual Diagramming,10.1109/TVCG.2018.2864887,http://dx.doi.org/10.1109/TVCG.2018.2864887,277,287,J,"Prewriting is the process of generating and organizing ideas before drafting a document. Although often overlooked by novice writers and writing tool developers, prewriting is a critical process that improves the quality of a final document. To better understand current prewriting practices, we first conducted interviews with writing learners and experts. Based on the learners' needs and experts' recommendations, we then designed and developed InkPlanner, a novel pen and touch visualization tool that allows writers to utilize visual diagramming for ideation during prewriting. InkPlanner further allows writers to sort their ideas into a logical and sequential narrative by using a novel widget- NarrativeLine. Using a NarrativeLine, InkPlanner can automatically generate a document outline to guide later drafting exercises. Inkplanner is powered by machine-generated semantic and structural suggestions that are curated from various texts. To qualitatively review the tool and understand how writers use InkPlanner for prewriting, two writing experts were interviewed and a user study was conducted with university students. The results demonstrated that InkPlanner encouraged writers to generate more diverse ideas and also enabled them to think more strategically about how to organize their ideas for later drafting.",Zhicong Lu;Mingming Fan 0001;Yun Wang;Jian Zhao 0010;Michelle Annett;Daniel J. Wigdor,Zhicong Lu;Mingming Fan;Yun Wang;Jian Zhao;Michelle Annett;Daniel Wigdor,University of Toronto;University of Toronto;Hong Kong University of Science and Technology;FX Palo Alto Laboratory;MishMashMakers;University of Toronto,10.1109/TVCG.2013.191,"Writing,prewriting,diagraming,content and structure recommendation,pen and touch interfaces",2,4,60,
VAST,2018,KnowledgePearls: Provenance-Based Visualization Retrieval,10.1109/TVCG.2018.2865024,http://dx.doi.org/10.1109/TVCG.2018.2865024,120,130,J,"Storing analytical provenance generates a knowledge base with a large potential for recalling previous results and guiding users in future analyses. However, without extensive manual creation of meta information and annotations by the users, search and retrieval of analysis states can become tedious. We present KnowledgePearls, a solution for efficient retrieval of analysis states that are structured as provenance graphs containing automatically recorded user interactions and visualizations. As a core component, we describe a visual interface for querying and exploring analysis states based on their similarity to a partial definition of a requested analysis state. Depending on the use case, this definition may be provided explicitly by the user by formulating a search query or inferred from given reference states. We explain our approach using the example of efficient retrieval of demographic analyses by Hans Rosling and discuss our implementation for a fast look-up of previous states. Our approach is independent of the underlying visualization framework. We discuss the applicability for visualizations which are based on the declarative grammar Vega and we use a Vega-based implementation of Gapminder as guiding example. We additionally present a biomedical case study to illustrate how KnowledgePearls facilitates the exploration process by recalling states from earlier analyses.",Holger Stitz;Samuel Gratzl;Harald Piringer;Thomas Zichner;Marc Streit,Holger Stitz;Samuel Gratzl;Harald Piringer;Thomas Zichner;Marc Streit,"Johannes Kepler University, Linz, Austria;Johannes Kepler University, Linz, Austria;VRVis Research Center, Austria;Boehringer Ingelheim RCV GmbH & Co KG, Austria;Johannes Kepler University, Linz, Austria",10.1109/VISUAL.2005.1532788;10.1109/TVCG.2011.229;10.1109/TVCG.2013.155;10.1109/TVCG.2009.176;10.1109/VAST.2008.4677365;10.1109/INFVIS.2004.2;10.1109/TVCG.2012.271;10.1109/TVCG.2016.2598589;10.1109/TVCG.2017.2744320;10.1109/TVCG.2015.2467551;10.1109/TVCG.2016.2599030;10.1109/TVCG.2015.2467091;10.1109/TVCG.2006.142;10.1109/TVCG.2017.2745219;10.1109/INFVIS.2000.885086;10.1109/INFVIS.2005.1532142,"Visualization provenance,interaction provenance,retrieval",2,4,47,
VAST,2018,An Information-Theoretic Approach to the Cost-benefit Analysis of Visualization in Virtual Environments,10.1109/TVCG.2018.2865025,http://dx.doi.org/10.1109/TVCG.2018.2865025,32,42,J,"Visualization and virtual environments (VEs) have been two interconnected parallel strands in visual computing for decades. Some VEs have been purposely developed for visualization applications, while many visualization applications are exemplary showcases in general-purpose VEs. Because of the development and operation costs of VEs, the majority of visualization applications in practice have yet to benefit from the capacity of VEs. In this paper, we examine this status quo from an information-theoretic perspective. Our objectives are to conduct cost-benefit analysis on typical VE systems (including augmented and mixed reality, theater-based systems, and large powerwalls), to explain why some visualization applications benefit more from VEs than others, and to sketch out pathways for the future development of visualization applications in VEs. We support our theoretical propositions and analysis using theories and discoveries in the literature of cognitive sciences and the practical evidence reported in the literatures of visualization and VEs.",Min Chen 0001;Kelly P. Gaither;Nigel W. John;Brian McCann,Min Chen;Kelly Gaither;Nigel W. John;Brian Mccann,"University of Oxford, UK;University of Texas, Austin, USA;University of Chester, UK;University of Texas, Austin, USA",10.1109/TVCG.2010.131;10.1109/TVCG.2008.142;10.1109/TVCG.2011.231;10.1109/TVCG.2014.2346325;10.1109/TVCG.2013.127;10.1109/TVCG.2016.2598829;10.1109/INFVIS.2004.59;10.1109/VISUAL.2005.1532781;10.1109/TVCG.2010.131;10.1109/TVCG.2006.184,"Theory of visualization,virtual environments,four levels of visualization,virtual reality,augmented reality,mixed reality,cost-benefit analysis,information theory,cognitive sciences,visualization applications,immersive analytics",2,1,119,
VAST,2018,RegressionExplorer: Interactive Exploration of Logistic Regression Models with Subgroup Analysis,10.1109/TVCG.2018.2865043,http://dx.doi.org/10.1109/TVCG.2018.2865043,246,255,J,"We present RegressionExplorer, a Visual Analytics tool for the interactive exploration of logistic regression models. Our application domain is Clinical Biostatistics, where models are derived from patient data with the aim to obtain clinically meaningful insights and consequences. Development and interpretation of a proper model requires domain expertise and insight into model characteristics. Because of time constraints, often a limited number of candidate models is evaluated. RegressionExplorer enables experts to quickly generate, evaluate, and compare many different models, taking the workflow for model development as starting point. Global patterns in parameter values of candidate models can be explored effectively. In addition, experts are enabled to compare candidate models across multiple subpopulations. The insights obtained can be used to formulate new hypotheses or to steer model development. The effectiveness of the tool is demonstrated for two uses cases: prediction of a cardiac conduction disorder in patients after receiving a heart valve implant and prediction of hypernatremia in critically ill patients.",Dennis Dingen;Marcel van 't Veer;Patrick Houthuizen;Eveline H. J. Mestrom;Hendrikus H. M. Korsten;Arthur R. A. Bouwman;Jarke J. van Wijk,Dennis Dingen;Marcel van't Veer;Patrick Houthuizen;Eveline H. J. Mestrom;Erik H.H.M. Korsten;Arthur R.A. Bouwman;Jarke van Wijk,Eindhoven University of Technology;Catharina Hospital Eindhoven;Catharina Hospital Eindhoven;Catharina Hospital Eindhoven;Catharina Hospital Eindhoven;Catharina Hospital Eindhoven;University of Technology,10.1109/VAST.2017.8585720;10.1109/TVCG.2015.2467325;10.1109/TVCG.2013.125;10.1109/VAST.2011.6102453;10.1109/TVCG.2015.2467931,"Visual analytics,Predictive visual analytics,Exploratory data analysis,Multivariate statistics,Regression analysis,Variable selection,Subgroup analysis",2,5,32,
InfoVis,2019,Investigating Direct Manipulation of Graphical Encodings as a Method for User Interaction,10.1109/TVCG.2019.2934534,http://dx.doi.org/10.1109/TVCG.2019.2934534,482,491,J,"We investigate direct manipulation of graphical encodings as a method for interacting with visualizations. There is an increasing interest in developing visualization tools that enable users to perform operations by directly manipulating graphical encodings rather than external widgets such as checkboxes and sliders. Designers of such tools must decide which direct manipulation operations should be supported, and identify how each operation can be invoked. However, we lack empirical guidelines for how people convey their intended operations using direct manipulation of graphical encodings. We address this issue by conducting a qualitative study that examines how participants perform 15 operations using direct manipulation of standard graphical encodings. From this study, we 1) identify a list of strategies people employ to perform each operation, 2) observe commonalities in strategies across operations, and 3) derive implications to help designers leverage direct manipulation of graphical encoding as a method for user interaction.",Bahador Saket;Samuel Huron;Charles Perin;Alex Endert,Bahador Saket;Samuel Huron;Charles Perin;Alex Endert,Georgia Tech;University Paris Saclay;University of Victoria;Georgia Tech,"10.1109/TVCG.2011.185,10.1109/TVCG.2014.2346984,10.1109/VAST.2012.6400486,10.1109/TVCG.2014.2346292,10.1109/TVCG.2015.2467615,10.1109/TVCG.2016.2598620,10.1109/TVCG.2014.2346250,10.1109/TVCG.2012.204,10.1109/TVCG.2014.2346279,10.1109/TVCG.2014.2346291,10.1109/TVCG.2016.2598839,10.1109/TVCG.2018.2865075,10.1109/TVCG.2017.2745078,10.1109/TVCG.2017.2745258","Direct Manipulation,Data Visualization",2,0,47,
VAST,2019,Interactive Learning for Identifying Relevant Tweets to Support Real-time Situational Awareness,10.1109/TVCG.2019.2934614,http://dx.doi.org/10.1109/TVCG.2019.2934614,558,568,J,"Various domain users are increasingly leveraging real-time social media data to gain rapid situational awareness. However, due to the high noise in the deluge of data, effectively determining semantically relevant information can be difficult, further complicated by the changing definition of relevancy by each end user for different events. The majority of existing methods for short text relevance classification fail to incorporate users' knowledge into the classification process. Existing methods that incorporate interactive user feedback focus on historical datasets. Therefore, classifiers cannot be interactively retrained for specific events or user-dependent needs in real-time. This limits real-time situational awareness, as streaming data that is incorrectly classified cannot be corrected immediately, permitting the possibility for important incoming data to be incorrectly classified as well. We present a novel interactive learning framework to improve the classification process in which the user iteratively corrects the relevancy of tweets in real-time to train the classification model on-the-fly for immediate predictive improvements. We computationally evaluate our classification model adapted to learn at interactive rates. Our results show that our approach outperforms state-of-the-art machine learning models. In addition, we integrate our framework with the extended Social Media Analytics and Reporting Toolkit (SMART) 2.0 system, allowing the use of our interactive learning framework within a visual analytics system tailored for real-time situational awareness. To demonstrate our framework's effectiveness, we provide domain expert feedback from first responders who used the extended SMART 2.0 system.",Luke S. Snyder;Yi-Shan Lin;Morteza Karimzadeh;Dan Goldwasser;David S. Ebert,Luke S. Snyder;Yi-Shan Lin;Morteza Karimzadeh;Dan Goldwasser;David S. Ebert,Purdue University;Purdue University;University of Colorado Boulder;Purdue University;Purdue University,"10.1109/TVCG.2017.2744818,10.1109/TVCG.2013.186,10.1109/VAST.2010.5652922,10.1109/TVCG.2012.277,10.1109/TVCG.2017.2744718,10.1109/TVCG.2018.2864838,10.1109/TVCG.2017.2745078","Interactive machine learning,human-computer interaction,social media analytics,emergency/disaster management,situational awareness",2,1,55,
VAST,2019,You can't always sketch what you want: Understanding Sensemaking in Visual Query Systems,10.1109/TVCG.2019.2934666,http://dx.doi.org/10.1109/TVCG.2019.2934666,1267,1277,J,"Visual query systems (VQSs) empower users to interactively search for line charts with desired visual patterns, typically specified using intuitive sketch-based interfaces. Despite decades of past work on VQSs, these efforts have not translated to adoption in practice, possibly because VQSs are largely evaluated in unrealistic lab-based settings. To remedy this gap in adoption, we collaborated with experts from three diverse domains—astronomy, genetics, and material science—via a year-long user-centered design process to develop a VQS that supports their workflow and analytical needs, and evaluate how VQSs can be used in practice. Our study results reveal that ad-hoc sketch-only querying is not as commonly used as prior work suggests, since analysts are often unable to precisely express their patterns of interest. In addition, we characterize three essential sensemaking processes supported by our enhanced VQS. We discover that participants employ all three processes, but in different proportions, depending on the analytical needs in each domain. Our findings suggest that all three sensemaking processes must be integrated in order to make future VQSs useful for a wide range of analytical inquiries.",Doris Jung Lin Lee;John Lee 0005;Tarique Siddiqui;Jaewoo Kim;Karrie Karahalios;Aditya G. Parameswaran,Doris Jung-Lin Lee;John Lee;Tarique Siddiqui;Jaewoo Kim;Karrie Karahalios;Aditya Parameswaran,"University of California, Berkeley;University of Illinois, Urbana-Champaign;University of Illinois, Urbana-Champaign;University of Illinois, Urbana-Champaign;University of Illinois, Urbana-Champaign;University of California, Berkeley","10.1109/INFVIS.2005.1532136,10.1109/VAST.2008.4677353,10.1109/TVCG.2017.2743990,10.1109/VAST.2016.7883519,10.1109/TVCG.2009.111,10.1109/TVCG.2012.213","Visual analytics,exploratory analysis,visual queries",2,0,50,
Vis,1990,Real-world applications of visualization solutions,10.1109/VISUAL.1990.146417,http://dx.doi.org/10.1109/VISUAL.1990.146417,440,442,C,"Visual data analysis (VDA) is a visualization approach that combines vector and raster graphics to provide insights into various aspects of multidimensional datasets. VDA methods have found application in aerospace engineering research, VDA is being used to develop nondestructive evaluation testing techniques for graphite epoxy composites by providing insights into stress waves propagating through them. Visual data analysis was used to analyze stress wave propagation, determine the origin of an unexplained wave distortion, and create a theoretical model to eliminate the distortion utilizing mathematical modeling.&lt;&lt;ETX&gt;&gt;",David A. Prawel,D.A. Prawel,"Precision Visuals Inc., Boulder, CO, USA",,,1,0,3,
Vis,1991,Visualization of equations in an interactive environment,10.1109/VISUAL.1991.175781,http://dx.doi.org/10.1109/VISUAL.1991.175781,76,"82, 412",C,"A method of visualizing equations in their explicit form using 3D fields is described. Equations are written algebraically, interpreted by an equation parser, and then expressed as scalar fields. Fields are represented as isosurfaces, making use of an algorithm similar to the method of marching cubes. The implementation allows the real-time interaction of equation parameters, isosurface rotations, and coloring. A variety of applications from mathematics and physics are given, together with examples of construction of data probes using equations.&lt;&lt;ETX&gt;&gt;",David Watson;Jakub Wejchert;David W. Williams;Bri M. Collins,D. Watson;J. Wejchert;D.W. Williams;B.M. Collins,"IBM European Visualization Centre, Winchester, UK;IBM European Visualization Centre, Winchester, UK;IBM European Visualization Centre, Winchester, UK;IBM European Visualization Centre, Winchester, UK",10.1109/VISUAL.1990.146401,,1,1,28,
Vis,1991,Computer assisted sphere packing in higher dimensions,10.1109/VISUAL.1991.175785,http://dx.doi.org/10.1109/VISUAL.1991.175785,102,108,C,"A computer was used to help study the packing of equal spheres in dimension four and higher. A candidate of the densest packing in 4-space is described. The configuration of 24 spheres touching a central sphere in this packing is shown to be rigid, unlike the analog in 3-space, in which the spheres can slide past each other. A system for interactively manipulating and visualizing such configurations is described. The Voronoi cell for a sphere is the set of points closer to its center than to any other sphere center in the packing. The packing density is the ratio of a sphere's volume to the average of the volumes of the Voronoi cells. A method of constructing Voronoi cells and computing their volumes that works in any dimension is presented. Examples of Voronoi cell volumes are given.&lt;&lt;ETX&gt;&gt;",Nelson L. Max,N. Max,"California Univ., Davis, CA, USA",,,1,0,3,
Vis,1991,The visual comparison of three sequences,10.1109/VISUAL.1991.175797,http://dx.doi.org/10.1109/VISUAL.1991.175797,179,186,C,"A method of visual comparison is described, that provides the scientist with a unique tool to study the qualitative relationships between three sequences of numbers or symbols. The program displays a 3D shape containing the sequence similarities and differences, which manifest themselves as simple geometric shapes and colors that a human observer can easily detect and classify. The method presents all possible correlations to the user, giving it a considerable advantage over existing sequence comparison tools that only search for a programmed subset of all possible correlations. Thus, using this technique, researchers may detect sequence similarities that other analytic methods might completely overlook. The program can also filter out undesirable or insignificant correlations. The technique is easily adapted to a wide range of applications.&lt;&lt;ETX&gt;&gt;",Kenneth P. Hinkley;Matthew O. Ward,K.P. Hinckley;M.O. Ward,"Dept. of Comput. Sci., Worchester Polytech. Inst., MA, USA;Dept. of Comput. Sci., Worchester Polytech. Inst., MA, USA",,,1,2,10,
Vis,1991,Enhanced visualization of multi-dimensional structures. Applications in positron emission tomography and climate data,10.1109/VISUAL.1991.175799,http://dx.doi.org/10.1109/VISUAL.1991.175799,188,"193, 422",C,"An algorithm based on mathematical morphology, image processing, and volume rendering has been developed to enhance the visual perception of definite and abstract structures embedded in multidimensional data undergoing visualization. This erosion procedure enhances the depth and shape perception of structures present in the data beyond the perception facilitated by shading and contrasting colors alone. The utility of this algorithm is demonstrated for medical imaging (positron emission tomography) and climate (sea surface temperature) data. The resulting information is displayed in stereo.&lt;&lt;ETX&gt;&gt;",Nahum D. Gershon,N.D. Gershon,"Mitre Corp., McLean, VA, USA",,,1,1,8,
Vis,1991,Visualisation tools for semiconductor modelling software,10.1109/VISUAL.1991.175830,http://dx.doi.org/10.1109/VISUAL.1991.175830,360,"363, 433",C,This paper looks at the issues involved in using a visualization software package to extend the scope of an existing suite of semiconductor modeling software. The visualization software and its hardware platform represent the state of the art in powerful interactive workstation visualization systems. A range of important issues to be considered when applying off-the-shelf visualization software to a real-world scientific problem is identified.&lt;&lt;ETX&gt;&gt;,Duncan Stevenson,D. Stevenson,"CSIRO, Canberra, ACT, Australia",,,1,1,3,
Vis,1991,Designing a distributed scientific visualization tool,10.1109/VISUAL.1991.175835,http://dx.doi.org/10.1109/VISUAL.1991.175835,383,386,C,"The benefits of using a distributed scientific visualization tool in the field of acoustic modeling are demonstrated. A user-friendly interface was developed under SunView. A Remote Procedure Call was used for transparent data transfer between a CRAY X-MP/28 and Sun 4 workstation. PV-WAVE, a high-level graphics package, was used to visualize the results.&lt;&lt;ETX&gt;&gt;",L. van der Sluis,L.V. Sluis,,,,1,0,4,
Vis,1991,Experiments with interdisciplinary projects and scientific visualization applications at the undergraduate level,10.1109/VISUAL.1991.175836,http://dx.doi.org/10.1109/VISUAL.1991.175836,387,391,C,"The author describes the interaction between computer graphics students from the computer science department at Rochester Institute of technology and faculty from various disciplines, in their attempts to utilize state-of-the-art computer graphics techniques for the visualization of physical systems. The structure of a computer graphics course designed to act as the vehicle for this interaction is also described.&lt;&lt;ETX&gt;&gt;",Nan C. Schaller,N.C. Schaller,"Dept. of Comput. Sci., Rochester Inst. of Technol., NY, USA",,,1,1,9,
Vis,1993,Applying observations of work activity in designing prototype data analysis tools,10.1109/VISUAL.1993.398873,http://dx.doi.org/10.1109/VISUAL.1993.398873,228,235,C,"Designers, implementers, and marketers of data analysis tools typically have different perspectives than end users. Consequently, data analysts often find themselves using tools focused on graphics and programming concepts rather than concepts which reflect their own domain and the context of their work. Some user studies focus on usability tests late in development; others observe work activity, but fail to show how to apply that knowledge in design. This paper describes a methodology for applying observations of data analysis work activity in prototype tool design. The approach can be used both in designing improved data analysis tools, and customizing visualization environments to specific applications. We present an example of user-centered design for a prototype tool to cull large data sets. We revisit the typical graphical approach of animating a large data set from the point of view of an analyst who is culling data. Field evaluations using the prototype tool not only revealed valuable usability information, but initiated in-depth discussions about user's work, tools, technology, and requirements.&lt;&lt;ETX&gt;&gt;",R. R. Springmeyer,R.R. Springmeyer,"Lawrence Livermore Nat. Lab., Livermore, CA, USA",10.1109/VISUAL.1992.235203;10.1109/VISUAL.1990.146360,,1,0,19,
Vis,1993,The quantum Coulomb three-body problem - Visualization of simulation results and numerical methods,10.1109/VISUAL.1993.398911,http://dx.doi.org/10.1109/VISUAL.1993.398911,378,381,C,"Some years ago it was established that the muon catalyzed fusion phenomenon could be used for the production of energy. This fact has been causing a rebirth of interest in the universal methods of solving the quantum Coulomb three-body problem. The adiabatic hyperspherical (AHS) approach considered in this joint project has definite advantages in comparison with other methods. The case study proposed focuses on the study of the structure and behavior of the wave function of bound states of a quantum three-body system as well as of the basis functions of the AHS approach. Adapted scientific visualization tools such as surface rendering, volume ray tracing and texturing will be used. Visualization allows to discover interesting features in the behavior of the basis functions and to analyze the convergence of the AHS-expansion for the wave functions.&lt;&lt;ETX&gt;&gt;",D. I. Abramov;V. V. Gusev;Stanislav V. Klimenko;L. I. Ponomarev;W. Krueger;W. Renz,D.I. Abramov;V.V. Gusev;S.V. Klimenko;L.I. Ponomarev;W. Krueger;W. Renz,"Dept. of Theoretical Phys., St. Petersburg State Univ., Russia;Dept. of Theoretical Phys., St. Petersburg State Univ., Russia",10.1109/VISUAL.1990.146391;10.1109/VISUAL.1991.175812,,1,0,7,
Vis,1994,Challenges and opportunities in visualization for NASA's EOS Mission to Planet Earth,10.1109/VISUAL.1994.346289,http://dx.doi.org/10.1109/VISUAL.1994.346289,392,395,M,"Visualization will be vital to the success of the NASA EOS Mission to Planet Earth (MTPE), which will gather, generate, and distribute an unprecedented volume of data for the purpose of global change research and environmental policy decisions. The paper focuses on the challenges and opportunities for visualization with regard to the Mission to Planet Earth. Directions presently being taken within NASA to fund and assist development of new tools are also discussed.&lt;&lt;ETX&gt;&gt;",Mike E. Botts;Jon D. Dykstra;Lee S. Elson;Steven J. Goodman;Meemong Lee,M. Botts;J.D. Dykstra;L.S. Elson;S.J. Goodman;Meemong Lee,"Alabama Univ., Huntsville, AL, USA",,,1,1,0,
Vis,1994,A case study on visualization for boundary value problems,10.1109/VISUAL.1994.346299,http://dx.doi.org/10.1109/VISUAL.1994.346299,345,348,C,"In this paper we present a method, and a software based on this method, making highly inter-active visualization possible for computational results on nonlinear BVPs associated with ODEs. The program PCR relies partly on computer graphics tools and partly on real-time computations, the combination of which not only helps the understanding of complex problems, it also permits the reduction of stored data by orders of magnitude. The method has been implemented on PCs (running on DOS) and on the Application Visualization System (AVS) for UNIX machines, this paper provides a brief introduction to the latter version besides describing the mathematical background of the method.&lt;&lt;ETX&gt;&gt;",Gábor Domokos;Randy C. Paffenroth,G. Domokos;R. Paffenroth,"Dept. of Strength of Mater., Tech. Univ. Budapest, Hungary",,,1,0,6,
Vis,1996,A system for measuring surface facet orientation from atomic force microscope data,10.1109/VISUAL.1996.568141,http://dx.doi.org/10.1109/VISUAL.1996.568141,397,400,C,"The authors describe a graphical system developed for researchers in materials science for extracting information from data obtained by atomic force microscopy. In particular, they consider the problem of computing surface orientations from data obtained from ceramic materials. The visualization problems they consider in designing this system include finding useful mechanisms for the researcher to interact with the data, presenting results in forms familiar to the scientist, and enhancing traditional display techniques.",John G. Hagedorn;Holly E. Rushmeier;John Blendell;Mark Vaudin,J. Hagedorn;H. Rushmeier;J. Blendell;M. Vaudin,"Comput. & Appl. Math. Lab., Nat. Inst. of Stand. & Technol., Gaithersburg, MD, USA",,,1,0,4,
Vis,1996,Data reduction and interpolation for visualizing 3D soil-quality data,10.1109/VISUAL.1996.568147,http://dx.doi.org/10.1109/VISUAL.1996.568147,421,424,C,"Sampling and analysis of subsurface contaminants comprise the first steps toward environmental remediation of hazardous spills. We have developed software tools to support the analysis phase, using three different schemes for interpolating scattered 3D soil-quality data onto a grid suitable for viewing in an interactive visualization system. A good interpolation scheme is one that respects the distribution of the original data. We find that the original data can be decimated by up to seventy percent while exhibiting graceful degradation in quality. A prototype software system is being deployed to allow technicians to visually determine, while in the field with their monitoring equipment, where the highest concentrations of contaminants lie. The system is now in use by the U.S. Army Corps of Engineers.",David C. Banks;Bernd Hamann;Po-Yu Tsai;Robert J. Moorhead II;Jonathan Barlow,D.C. Banks;B. Hamann;Po-Yu Tsai;R. Moorhead;J. Barlow,"NSF Eng. Res. Center, Mississippi State Univ., MS, USA",,,1,0,5,
Vis,1999,A computer animation representing the molecular events of G protein-coupled receptor activation,10.1109/VISUAL.1999.809915,http://dx.doi.org/10.1109/VISUAL.1999.809915,401,550,C,"The molecular events involved in the activation of G protein-coupled receptors, represent a fundamental biochemical process. These events were selected for animation because the mechanism involves both a ligand-receptor conformational shape change, and an enzyme-substrate conformational shape change. Expository animation brought this biochemical process to life.",Zoya Maslak;Douglas J. Steel;Robert J. McDermott,Z. Maslak;D.J. Steel;R. McDermott,"Dept. of Art, Utah Univ., Salt Lake City, UT, USA",,,1,1,6,
Vis,1999,Whole field modelling. Effective real-time and post-survey visualization of underwater pipelines,10.1109/VISUAL.1999.809926,http://dx.doi.org/10.1109/VISUAL.1999.809926,445,560,C,"The detailed underwater bathymetric data provided by Sonar Research and Development's high speed multi-frequency sonar transducer system provides new challenges in the development of interactive seabed visualization tools. The paper introduces a ""Whole Field Modelling"" system developed at Sonar Research and Development Ltd and The Department of Computer Science, University of Hull. This system provides the viewer with a new 3D underwater visualization environment that allows the user to pilot a virtual underwater vehicle around an accurate seabed model. We consider two example case studies that use the Whole Field Modelling system for visualizing sonar data. Both case studies, visualizing real time pipeline dredging and pipe restoration visualization, are implemented using real survey data.",Paul Chapman;Derek Wills;Peter Stevens;Graham R. Brookes,P. Chapman;D. Wills;P. Stevens;G. Brookes,"Dept. of Comput. Sci., Hull Univ., UK",10.1109/VISUAL.1998.745348,,1,1,14,
Vis,1999,Detecting null alleles with vasarely charts,10.1109/VISUAL.1999.809931,http://dx.doi.org/10.1109/VISUAL.1999.809931,463,466,C,Microsatellite genotypes can have problems that are difficult to detect with existing tools. One such problem is null alleles. This paper presents a new visualization tool that helps to find and characterize these errors. The paper explains how the tool is used to analyze groups of genotypes and proposes other possible uses.,Carl Manaster;Elizabeth Nanthakumar;Phillip A. Morin,C.J. Manaster;E. Nanthakumar;P.A. Morin,,,,1,0,20,
Vis,1999,Visualization needs more visual design!,10.1109/VISUAL.1999.809939,http://dx.doi.org/10.1109/VISUAL.1999.809939,485,490,M,,J. Edward Swan;Theresa-Marie Rhyne;David H. Laidlaw;Tamara Munzner;Victoria Interrante,J.E. Swan,Naval Research Laboratory,,,1,0,0,
Vis,2000,Polyhedral modeling,10.1109/VISUAL.2000.885719,http://dx.doi.org/10.1109/VISUAL.2000.885719,381,387,C,"Polyhedral meshes are used for visualization, computer graphics or geometric modeling purposes and result from many applications like iso-surface extraction, surface reconstruction or CAD/CAM. The paper introduces a method for constructing smooth surfaces from a triangulated polyhedral mesh of arbitrary topology. It presents a new algorithm which generalizes and improves the triangle 4-split method (S. Hahmann and G.-P. Bonneau) in the crucial point of boundary curve network construction. This network is then filled in by a visual smooth surface from which an explicit closed form parametrization is given. Furthermore, the method becomes now completely local and can interpolate normal vector input at the mesh vertices.",Georges-Pierre Bonneau;Stefanie Hahmann,G.-P. Bonneau;S. Hahmann,"CNRS, Univ. of Grenoble, France",,"triangular meshes, visual continuity, arbitrary topology, visualization",1,0,12,
Vis,2000,Fast visualization methods for comparing dynamics: a case study in combustion,10.1109/VISUAL.2000.885725,http://dx.doi.org/10.1109/VISUAL.2000.885725,433,436,C,"Visualization can be an important tool for displaying, categorizing and digesting large quantities of inter-related information during laboratory and simulation experiments. Summary visualizations that compare and represent data sets in the context of a collection are particularly valuable. Applicable visualizations used in these settings must be fast (near real time) and should allow the addition of data sets as they are acquired without requiring rerendering of the visualization. This paper examines several visualization techniques for representing collections of data sets in a combustion experiment including spectral displays, tiling and geometric mappings of symmetry. The application provides insight into how such visualizations might be used in practical real-time settings to assist in exploration and in conducting parameter space surveys.",Kay A. Robbins;Michael Gorman,K.A. Robbins;M. Gorman,"Div. of Comput. Sci., Texas Univ., San Antonio, TX, USA",10.1109/VISUAL.1999.809882;10.1109/VISUAL.1996.568117;10.1109/VISUAL.1995.485141,"realtime visualization, steering, symmetry, tiling, pattern formation, movies",1,0,10,
InfoVis,2002,"Internet traffic: visualization, discovery, and very large displays",10.1109/INFVIS.2002.1173140,http://dx.doi.org/10.1109/INFVIS.2002.1173140,3,4,M,"For a decade, the ruling common wisdom for Internet traffic held that it was everywhere bursty: over periods lasting tens of milliseconds to hundreds, the traffic was either much below its average rate or much above. In other words, the traffic was not smooth, not staying at all times close to its average. It was bursty on the cable running down a street, carrying the merged traffic of a small number of cable modem users in one section of a town. It was bursty on the core fiber of an Internet service provider, carrying the merged traffic of thousands of users from all over the country. The Internet was designed to accommodate the bursty traffic. The routers and switches that forward traffic from one place to the next were designed for burstiness, and Internet service providers allocated traffic loads on the devices based on an assumption of burstiness. Recently, it was discovered that the old common wisdom is not true. Visualization played a fundamental role in the discovery. The old wisdom held up for links with a small numbers of users. But as the number of users increases, the burstiness dissipates, and the traffic becomes smooth. Design of the high-load part of the Internet needs to be rethought. The old wisdom had persisted for high-load links because the databases of traffic measurements from them are immense, and the traffic measurements had not been studied in their fullest detail, which is necessary to see the smoothing. Visualization tools allowed the detail to be seen, and allowed the verification of a mathematical theory that predicts the smoothing. To see the detail, individual visual displays were created that take up an amount of virtual screen real estate measured in hundreds of pages. It is a simple idea: if you have a lot of data, and you want to see it in detail, you need a lot of space. What is needed now is a rich set of ideas and methods for navigating such very large displays.",William S. Cleveland,W.S. Cleveland,"Dept. Stat. Res., Bell Labs., Holmdel, NJ, USA",,,1,0,0,
InfoVis,2002,The illusion of perceived metric 3D structure,10.1109/INFVIS.2002.1173147,http://dx.doi.org/10.1109/INFVIS.2002.1173147,51,56,C,"A large body of results on the characteristics of human spatial vision suggests that space perception is distorted. Recent studies indicate that the geometry of visual space is best understood as Affine. If this is the case, it has far reaching implications on how 3D visualizations can be successfully employed. For instance, all attempts to build visualization systems where users are expected to discover relations based on Euclidean distances or shapes will be ineffective. Because visualization can, and sometimes do, employ all possible types of depth information and because the results from vision research usually concentrates on one or two such types, three experiments were performed under near optimal viewing conditions. The aim of the experiments was twofold: To test whether the earlier findings generalize to optimal viewing conditions and to get a sense of the size of the error under such conditions. The results show that the findings do generalize and that the errors are large. The implications of these results for successful visualizations are discussed.",Mats Lind;Geoffrey P. Bingham;Camilla Forsell,M. Lind;G.P. Bingham;C. Forser,"Dept. of Inf. Sci., Uppsala Univ., Sweden",10.1109/INFVIS.2001.963291,,1,1,12,
Vis,2002,"Case study: the ""Office of Real Soon Now"" for visualization",10.1109/VISUAL.2002.1183830,http://dx.doi.org/10.1109/VISUAL.2002.1183830,561,564,C,"As part of a larger effort exploring alternative display systems, Lawrence Livermore National Laboratory has installed systems in two offices that extend and update the previously described ""Office of Real Soon Now"" project to improve the value for visualization tasks. These new systems use higher resolution projectors driven by workstations that run Unix-based applications via Linux and support hardware-accelerated 3D graphics, even across the boundary between displays.",Samuel P. Uselton,S.P. Uselton,,,"display, projection, panoramic image display",1,0,8,
InfoVis,2003,Thinking with visualization,10.1109/INFVIS.2003.1249001,http://dx.doi.org/10.1109/INFVIS.2003.1249001,3,3,M,,Colin Ware,C. Ware,Data Visualization Research Lab,,,1,1,0,
Vis,2003,Do I really see a bone?,10.1109/VISUAL.2003.1250429,http://dx.doi.org/10.1109/VISUAL.2003.1250429,615,617,M,,Raghu Machiraju;Christopher R. Johnson 0001;Terry S. Yoo;Roger Crawfis;David S. Ebert;Don Stredney,R. Machiraju;C. Johnson;T. Yoo;R. Crawfis;D. Ebert;D. Stredney,The Ohio State University,,,1,1,0,
Vis,2003,Visualization experiences and issues in deep space exploration,10.1109/VISUAL.2003.1250430,http://dx.doi.org/10.1109/VISUAL.2003.1250430,619,621,M,,John R. Wright;Scott C. Burleigh;Makoto Maruya;Scott Maxwell;René Pischel,J. Wright;S. Burleigh;M. Maruya;S. Maxwell;R. Pischel,Jet Propulsion Laboratory,,,1,1,0,
InfoVis,2004,Interactive Exploration of the AFS File System,10.1109/INFVIS.2004.40,http://dx.doi.org/10.1109/INFVIS.2004.40,7,7,M,"Managing file systems of large organizations can present significant challenges in terms of the number of users, shared access to parts of the file system, and securing and monitoring critical parts of the file system. We present an interactive exploratory tool for monitoring and viewing the complex relationships within the Andrews File System (AFS). This tool is targeted as an aid to system administrators to manage users, applications and shared access. We tested our tool on UNC Charlotte’s Andrews File System (AFS) file system, which contains 4554 users, 556 user groups, and 2.2 million directories. Two types of visualizations are supported to explore file system relationships. In addition, drill-down features are provided to access the user file system and access control information of any directory within the system. All of the views are linked to facilitate easy navigation.",Joshua Foster;Kalpathi R. Subramanian;Robert Herring;Gail-Joon Ahn,J. Foster;K. Subramanian;R. Herring;Gail Ahn,University of North Carolina at Charlotte,,,1,1,6,
Vis,2004,Vector Wavelet Thresholding for Vector Field Denoising,10.1109/VISUAL.2004.108,http://dx.doi.org/10.1109/VISUAL.2004.108,25,25,M,"Noise reduction is an important preprocessing step for many visualization techniques that make use of feature extraction. We propose a method for denoising 2-D vector fields that are corrupted by additive noise. The method is based on the vector wavelet transform and wavelet coefficient thresholding. We compare our wavelet-based denoising method with Gaussian filtering, and test the effect of these methods on the signal-to-noise ratio (SNR) of the vector fields before and after denoising. We also study the effect on relevant details for visualization, such as vortex measures. The results show that for low SNR, Gaussian filtering with large kernels has a somewhat higher performance than the wavelet-based method in terms of SNR. For larger SNR, the wavelet-based method outperforms Gaussian filtering. This is mostly due to the fact that Gaussian filtering tends to remove small details, which are preserved by the wavelet-based method.",Michel A. Westenberg;Thomas Ertl,M.A. Westenberg;T. Ertl,University of Stuttgart,,,1,1,7,
Vis,2004,Visualization of Nanoparticle Formation in Turbulent Flows,10.1109/VISUAL.2004.114,http://dx.doi.org/10.1109/VISUAL.2004.114,23,23,M,In this paper we offer methods for visualization of the formation of nanoparticles in turbulent flows. We present the use of pointillism as a technique to convey the distribution of nanoparticle sizes as texture in an area. We also demonstrate a method of producing and packing spot glyphs representative of the distribution of nanoparticle sizes at every point in the flow to produce an intuitive and extensible framework for the visualization.,P. Coleman Saunders;Sean C. Garrick;Victoria Interrante,P.C. Saunders;S.C. Garrick;V. Interrante,University of Minnesota,,,1,0,9,
Vis,2004,Visualization of the Interaction of Multiple Sclerosis Lesions with Adjacent White Matter Fibers Using Streamtubes and Streamsurfaces,10.1109/VISUAL.2004.116,http://dx.doi.org/10.1109/VISUAL.2004.116,29,29,M,,Song Zhang 0004;David H. Laidlaw;Jack Simon;Mark Brown;David Miller,Song Zhang;D. Laidlaw;J. Simon;M. Brown;D. Miller,Brown University,,,1,0,9,
Vis,2004,Visualizing the Evolution of Horned Lizards Using 3D Morphing Techniques,10.1109/VISUAL.2004.124,http://dx.doi.org/10.1109/VISUAL.2004.124,16,16,M,,Reuben Reyes;Wendy L. Hodges;Kelly P. Gaither,R. Reyes;W. Hodges;K. Gaither,University of Texas at Austin,,,1,0,0,
Vis,2004,Visualizing Turbulent Flow,10.1109/VISUAL.2004.125,http://dx.doi.org/10.1109/VISUAL.2004.125,22,22,M,,Gregory P. Johnson;Kelly P. Gaither;Victor M. Calo,G.P. Johnson;K. Gaither;V. Calo,University of Texas at Austin,,,1,0,0,
Vis,2004,"Compression, Segmentation, and Modeling of Large-Scale Filamentary Volumetric Data",10.1109/VISUAL.2004.16,http://dx.doi.org/10.1109/VISUAL.2004.16,31,31,M,"We describe a method for processing large amounts of volumetric data collected from a Knife Edge Scanning Microscope (KESM). The neuronal data that we acquire consists of thin, branching structures extending over very large regions that prior volumetric representations have difficulty dealing with efficiently. Since the full volume data set can be extremely large, on-the-fly processing of the data is necessary.",Bruce H. McCormick;Purna Doddapaneni;David Mayerich;Zeki Melek;John Keyser,B.H. McCormick;P. Doddapaneni;D. Mayerich;Z. Melek;J. Keyser,Texas A&amp;M University,,,1,3,3,
Vis,2004,Introducing Topological Attributes for Objective-Based Visualization,10.1109/VISUAL.2004.57,http://dx.doi.org/10.1109/VISUAL.2004.57,6,6,M,,Yuriko Takeshima;Shigeo Takahashi;Issei Fujishiro;Gregory M. Nielson,Y. Takeshima;S. Takahashi;I. Fujishiro;G.M. Nielson,JAERI,,,1,1,2,
Vis,2004,Atlas-Aware Laplacian Smoothing,10.1109/VISUAL.2004.6,http://dx.doi.org/10.1109/VISUAL.2004.6,27,27,M,,Peter G. Sibley;Gabriel Taubin,P.G. Sibley;G. Taubin,Brown University,,,1,0,4,
Vis,2004,LoD volume rendering of FEA data,10.1109/VISUAL.2004.69,http://dx.doi.org/10.1109/VISUAL.2004.69,417,424,C,"A new multiple resolution volume rendering method for finite element analysis (FEA) data is presented. Our method is composed of three stages: in the first stage, the Gauss points of the FEA cells are calculated. The function values, gradients, diffusions, and influence scopes of the Gauss points are computed. By representing the Gauss points as graph vertices and connecting adjacent Gauss points with edges, an adjacency graph is created. The adjacency graph is used to represent the FEA data in the subsequent computation. In the second stage, a hierarchical structure is established upon the adjacency graph. Any two neighboring vertices with similar function values are merged into a new vertex. The similarity is measured by using a user-defined threshold. Consequently, a new adjacency graph is constructed. Then the threshold is increased, and the graph reduction is triggered again to generate another adjacency graph. By repeating the processing, multiple adjacency graphs are computed, and a level of detail (LoD) representation of the FEA data is established. In the third stage, the LoD structure is rendered by using a splatting method. At first, a level of adjacency graph is selected by users. The graph vertices arc sorted based on their visibility orders and projected onto the image plane in back-to-front order. Billboards are used to render the vertices in the projection. The function values, gradients, and influence scopes of the vertices are utilized to decide the colors, opacities, orientations, and shapes of the billboards. The billboards are then modulated with texture maps to generate the footprints of the vertices. Finally, these footprints are composited to produce the volume rendering image.",Shyh-Kuang Ueng;Yan-Jen Su;Chi-Tang Chang,Shyh-Kuang Ueng;Yan-Jen Su;Chi-Tang Chang,"Dept. of Comput. Sci., Nat. Taiwan Ocean Univ., Keelung, Taiwan;Dept. of Comput. Sci., Nat. Taiwan Ocean Univ., Keelung, Taiwan;Dept. of Comput. Sci., Nat. Taiwan Ocean Univ., Keelung, Taiwan",10.1109/VISUAL.1999.809908;10.1109/VISUAL.1995.485144;10.1109/VISUAL.2002.1183767;10.1109/VISUAL.2000.885680;10.1109/VISUAL.2000.885682;10.1109/VISUAL.2000.885680;10.1109/VISUAL.2001.964490;10.1109/VISUAL.1993.398877;10.1109/VISUAL.1992.235228;10.1109/VISUAL.1998.745309;10.1109/VISUAL.1999.809909,"Volume rendering, splatting method, level-of-detail, unstructured data, scientific visualization",1,1,33,
VAST,2007,From Tasks to Tools: A Field Study in Collaborative Visual Analytics,10.1109/VAST.2007.4389028,http://dx.doi.org/10.1109/VAST.2007.4389028,223,224,M,"This poster presents an exploratory field study of a VAST 2007 contest entry. We applied cognitive task analysis (CTA), grounded theory (GT), and activity theory (AT), to analysis of field notes and interviews from participants. Our results are described in the context of activity theory and sensemaking, two theoretical perspectives that we have found to be particularly useful in understanding analytic tasks.",Daniel Ha;Minjung Kim;Andrew Wade;William Chao;Kevin I.-J. Ho;Linda T. Kaastra;Brian D. Fisher;John Dill,Daniel Ha;Minjung Kim;Andrew Wade;William O. Chao;Kevin Ho;Linda Kaastra;Brian Fisher;John Dill,"Simon Fraser University, SIAT; University of British Columbia, MAGIC. email: dhal@sfu.ca;Simon Fraser University, SIAT; University of British Columbia, MAGIC;Simon Fraser University, SIAT; University of British Columbia, MAGIC;Simon Fraser University, SIAT; University of British Columbia, MAGIC;Simon Fraser University, SIAT; University of British Columbia, MAGIC;Simon Fraser University, SIAT; University of British Columbia, MAGIC;Simon Fraser University, SIAT; University of British Columbia, MAGIC;Simon Fraser University, SIAT; University of British Columbia, MAGIC",,,1,0,5,
VAST,2007,VAST 2007 Contest TexPlorer,10.1109/VAST.2007.4389037,http://dx.doi.org/10.1109/VAST.2007.4389037,243,244,M,"TexPlorer is an integrated system for exploring and analyzing vast amount of text documents. The data processing modules of TexPlorer consist of named entity extraction, entity relation extraction, hierarchical clustering, and text summarization tools. Using time line tool, tree-view, table-view, and concept maps, TexPlorer provides visualizations from different aspects and allows analysts to explore vast amount of text documents efficiently.",Chi-Chun Pan;Anuj R. Jaiswal;Junyan Luo;Anthony C. Robinson;Prasenjit Mitra;Alan M. MacEachren;Ian Turton,Chi-Chun Pan;Anuj R. Jaiswal;Junyan Luo;Anthony Robinson;Prasenjit Mitra;Alan M. MacEachren;Ian Turton,The Pennsylvania State University. e-mail: julianpan@psu.edu;The Pennsylvania State University. e-mail: arj135@psu.edu;The Pennsylvania State University. e-mail: jluo@psu.edu;The Pennsylvania State University. e-mail: acr181@psu.edu;The Pennsylvania State University. e-mail: pmitra@ist.psu.edu;The Pennsylvania State University. e-mail: maceachren@psu.edu;The Pennsylvania State University. e-mail: ijt1@psu.edu,,,1,0,3,
VAST,2007,VAST 2007 Contest Data Analysis Using NdCore and REGGAE,10.1109/VAST.2007.4389038,http://dx.doi.org/10.1109/VAST.2007.4389038,245,246,M,"ATS Intelligent Discovery analyzed the VAST 2007 contest data set using two of its proprietary applications, NdCore and REGGAE (Relationship Generating Graph Analysis Engine). The paper describes these tools and how they were used to discover the contest's scenarios of wildlife law enforcement, endangered species issues, and ecoterrorism.",Lynn Schwendiman;Jonathan McLean;Jonathan Larson,Lynn Schwendiman;Jonathan McLean;Jonathan Larson,"ATS Intelligent Discovery, 3505 NW Anderson Hill Road, Suite 200, Silverdale, WA 98383. lynn.schwendiman@atsid.com;ATS Intelligent Discovery, 3505 NW Anderson Hill Road, Suite 200, Silverdale, WA 98383. jonathan.mclean@atsid.com;ATS Intelligent Discovery, 3505 NW Anderson Hill Road, Suite 200, Silverdale, WA 98383. jonathan.larson@atsid.com",,,1,0,1,
VAST,2008,Interactive poster: Visual analytic techniques for CO₂ emissions and concentrations in the United States,10.1109/VAST.2008.4677372,http://dx.doi.org/10.1109/VAST.2008.4677372,173,174,M,"Climate change has emerged as one of the grand global challenges facing humanity. The dominant anthropogenic greenhouse gas that seems to be contributing to the climate change problem, carbon dioxide (CO<sub>2</sub>), has a complex cycle through the atmosphere, oceans and biosphere. The combustion of fossil fuels (power production, transportation, etc.) remains the largest source of anthropogenic CO<sub>2</sub> to the Earthpsilas atmosphere. Up until very recently, the quantification of fossil fuel CO<sub>2</sub> was understood only at coarse space and time scales. A recent research effort has greatly improved this space/time quantification resulting in source data at a resolution of less than 10 km<sup>2</sup>/hr at the surface of North America. By providing visual tools to examine this new, high resolution CO<sub>2</sub> data, we can better understand the way that CO<sub>2</sub> is transmitted within the atmosphere and how it is exchanged with other components of the Earth System. We have developed interactive visual analytic tools, which allows for easy data manipulation, analysis, and extraction. The visualization system is aimed for a wide range of users which include researchers and political leaders. The goal is to help assist these people in analyzing data and enabling new policy options in mitigation of fossil fuel CO<sub>2</sub> emissions in the U.S.",Nathan Andrysco;Bedrich Benes;Kevin R. Gurney,Nathan Andrysco;Bedrich Benes;Kevin Gurney,"Department of Computer Science, Purdue University, USA;Department of Computer Graphics Technology, Purdue University, USA;Department of Atmospheric Sciences, Purdue University, USA",,,1,0,3,
VAST,2008,Visual analysis for mutual fund performance,10.1109/VAST.2008.4677376,http://dx.doi.org/10.1109/VAST.2008.4677376,181,182,M,"Mutual funds are one of the most important investment instruments available. However, choosing among mutual funds is not an easy task because they vary in many different dimensions, such as asset size, turnover and fee structure, and these characteristics may affect fund returns. It is thus important to understand the relation between fund performance and these properties. In this work, we use a new visual analytical tool, the density-based distribution map, to assist in this task. By visualizing various important fund characteristics from a real-world database of the US stock funds, our new visual representations greatly help understand the relation between fund characteristics and returns.",Ye Zhao;Jamal Alsakran;Xinlei Zhao,Ye Zhao;Jamal Alsakran;Xinlei Zhao,"Kent State University, USA;Kent State University, USA;Kent State University, USA",,,1,0,4,
VAST,2008,Migrant boat mini challenge award: Simple and effective integrated display geo-temporal analysis of migrant boats,10.1109/VAST.2008.4677387,http://dx.doi.org/10.1109/VAST.2008.4677387,,,M,"We provide a description of the tools and techniques used in our analysis of the VAST 2008 Challenge dealing with mass movement of persons departing Isla Del Sue.no on boats for the United States during 2005-2007. We used visual analytics to explore migration patterns, characterize the choice and evolution of landing sites, characterize the geographical patterns of interdictions and determine the successful landing rate. Our ComVis tool, in connection with some helper applications and Google Earth, allowed us to explore geo-temporal characteristics of the data set and answer the challenge questions. The ComVis project file captures the visual analysis context and facilitates better collaboration among team members.",Ranko Miklin;Tomislav Lipic;Zoltan Konyha;Mario Beric;Wolfgang Freiler;Kresimir Matkovic;Denis Gracanin,R. Miklin;T. Lipic;Z. Konyha;M. Beric;W. Freiler;K. Matkovic;D. Gracanin,"Dept. of Telecom.¿FER, Univ. of Zagreb, Croatia;Dept. of Telecom.¿FER, Univ. of Zagreb, Croatia;VRVis Research, Vienna, Austria;Dept. of Telecom.¿FER, Univ. of Zagreb, Croatia;VRVis Research, Vienna, Austria;VRVis Research, Vienna, Austria;Virginia Tech, Blacksburg, USA",,,1,1,3,
VAST,2008,Evacuation traces mini challenge: User testing to obtain consensus discovering the terrorist,10.1109/VAST.2008.4677390,http://dx.doi.org/10.1109/VAST.2008.4677390,,,M,"The adoption of visual analytics methodologies in security applications is an approach that could lead to interesting results. Usually, the data that has to be analyzed finds in a graphical representation its preferred nature, such as spatial or temporal relationships. Due to the nature of these applications, it is very important that key-details are made easy to identify. In the context of the VAST 2008 Challenge, we developed a visualization tool that graphically displays the movement of 82 employees of the Miami Department of Health (USA). We also asked 13 users to identify potential suspects and observe what happened during an evacuation of the building caused by an explosion. In this paper we explain the results of the user testing we conducted and how the users interpreted the event taken into account.",Adalberto L. Simeone;Paolo Buono,Adalberto L. Simeone;Buono Paolo,"University of Bari, Italy;University of Bari, Italy",,,1,1,4,
VAST,2009,Visual knowledge exploration and discovery from different points of view,10.1109/VAST.2009.5333438,http://dx.doi.org/10.1109/VAST.2009.5333438,227,228,M,"Complex scenario analysis requires the exploration of multiple hypotheses and supporting evidence for each argument posed. Knowledge-intensive organisations typically analyse large amounts of inter-related, heterogeneous data to retrieve the knowledge this contains and use it to support effective decision-making. We demonstrate the use of interactive graph visualisation to support hierarchical, task-driven, hypothesis investigation. The visual investigative analysis is guided by task and domain ontologies used to capture the structure of the investigation process and the experience gained and knowledge created in previous, related investigations.",Aba-Sah Dadzie;Daniela Petrelli,Aba-Sah Dadzie;Daniela Petrelli,"Dept. of Information Studies, The University of Sheffield, UK;Dept. of Information Studies, The University of Sheffield, UK",,,1,0,6,
VAST,2009,Working memory load as a novel tool for evaluating visual analytics,10.1109/VAST.2009.5333468,http://dx.doi.org/10.1109/VAST.2009.5333468,217,218,M,"The current visual analytics literature highlights design and evaluation processes that are highly variable and situation dependent, which raises at least two broad challenges. First, lack of a standardized evaluation criterion leads to costly re-designs for each task and specific user community. Second, this inadequacy in criterion validation raises significant uncertainty regarding visualization outputs and their related decisions, which may be especially troubling in high consequence environments like those of the intelligence community. As an attempt to standardize the ldquoapples and orangesrdquo of the extant situation, we propose the creation of standardized evaluation tools using general principles of human cognition. Theoretically, visual analytics enables the user to see information in a way that should attenuate the user's memory load and increase the user's task-available cognitive resources. By using general cognitive abilities like available working memory resources as our dependent measures, we propose to develop standardized evaluative capabilities that can be generalized across contexts, tasks, and user communities.",Courtney C. Dornburg;Laura E. Matzen;Travis L. Bauer;Laura A. McNamara,Courtney C. Dornburg;Laura E. Matzen;Travis L. Bauer;Laura A. McNamara,"Sandia National Laboratories, USA;Sandia National Laboratories, USA;Sandia National Laboratories, USA;Sandia National Laboratories, USA",,,1,0,7,
VAST,2009,VIDI surveillance - embassy monitoring and oversight system,10.1109/VAST.2009.5333950,http://dx.doi.org/10.1109/VAST.2009.5333950,,,M,"We hypothesized that potential spies would try to use other employees' terminals in order to not draw attention to themselves. We define one type of suspicious activity as IP use on a terminal when the owner is inside the classified area. We created a timeline visualization of IP usage, overlaid with classified area entrances and exits. The vertical axis divides the timelines into 31 rows, one for each day of the month. The horizontal axis represents the time of day from early morning to late evening. A single employee's entire month is viewed all at once using this visualization. The employee being viewed can be changed using the arrow keys. Every IP event is represented by a vertical bar positioned at the exact time of its appearance. We color the IP events by port number, which is either intranet, HTTP, tomcat, or email, and size the bar based on the outgoing data size. Whenever an employee enters the classified area, a semi-transparent yellow region is drawn until that user exits the classified area. In rare cases when the user double enters, the region is twice as opaque, and in the other rare case where a user leaves the exits without entering, a red region is drawn until the next time the employee enters. The legend key and office diagram showing the current selected employee, highlighted in red, can be seen in the top left-hand corner.",Chad Jones;Michael Ogawa;James Shearer;Anna Tikhonova;Kwan-Liu Ma,Chad Jones;Michael Ogawa;James Shearer;Anna Tikhonova;Kwan-Liu Ma,"VIDI Group, University of California, Davis, USA;VIDI Group, University of California, Davis, USA;VIDI Group, University of California, Davis, USA;VIDI Group, University of California, Davis, USA;VIDI Group, University of California, Davis, USA",,,1,0,3,
VAST,2009,Visualization of uncertainty and analysis of geographical data,10.1109/VAST.2009.5333965,http://dx.doi.org/10.1109/VAST.2009.5333965,,,M,"A team of five worked on this challenge to identify a possible criminal structure within the Flitter social network. Initially we worked on the problem individually, deliberately not sharing any data, results or conclusions. This maximised the chances of spotting any blunders, unjustified assumptions or inferences and allowed us to triangulate any common conclusions. After an agreed period we shared our results demonstrating the visualization applications we had built and the reasoning behind our conclusions. This sharing of assumptions encouraged us to incorporate uncertainty in our visualization approaches as it became clear that there was a number of possible interpretations of the rules and assumptions governing the challenge. This summary of the work emphasises one of those applications detailing the geographic analysis and uncertainty handling of the network data.",Jo Wood;Aidan Slingsby;Naz Khalili-Shavarini;Jason Dykes;David M. Mountain,Jo Wood;Aidan Slingsby;Naz Khalili-Shavarini;Jason Dykes;David Mountain,"School of Informatics, City University London, UK;School of Informatics, City University London, UK;School of Informatics, City University London, UK;School of Informatics, City University London, UK;School of Informatics, City University London, UK",,,1,0,2,
VAST,2009,Visualized subgraph search,10.1109/VAST.2009.5333968,http://dx.doi.org/10.1109/VAST.2009.5333968,,,M,"We present a visually supported search and browsing system for network-type data, especially a novel module for subgraph search with a GUI to define subgraphs for queries. We describe how this prototype was applied for the Vast Challenge 2009, Flitter Mini Challenge.",Dóra Erdös;Zsolt Fekete;András Lukács,Dora Erdos;Zsolt Fekete;Andras Lukacs,"Computer and Automation Research Institute (MTA SZTAKI), Hungarian Academy of Sciences, Data Mining and Web Search Group, Hungary;Computer and Automation Research Institute (MTA SZTAKI), Hungarian Academy of Sciences, Data Mining and Web Search Group, Hungary;Computer and Automation Research Institute (MTA SZTAKI), Hungarian Academy of Sciences, Data Mining and Web Search Group, Hungary",,,1,0,1,
VAST,2009,Solving the traffic and flitter challenges with tulip,10.1109/VAST.2009.5334456,http://dx.doi.org/10.1109/VAST.2009.5334456,,,M,"We present our visualization systems and findings for the badge and network traffic as well as the social network and geospatial challenges of the 2009 VAST contest. The summary starts by presenting an overview of our time series encoding of badge information and network traffic. Our findings suggest that employee 30 may be of interest. In the second part of the paper, we describe our system for finding subgraphs in the social network subject to degree constraints. Subsequently, we present our most likely candidate network which is similar to scenario B.",Paolo Simonetto;Pierre-Yves Koenig;Faraz Zaidi;Daniel Archambault;Frédéric Gilbert 0001;Trung-Tien Phan-Quang;Morgan Mathiaut;Antoine Lambert;Jonathan Dubois;Ronan Sicre;Mathieu Brulin;Rémy Vieux;Guy Melançon,Paolo Simonetto;Mathieu Brulin;Remy Vieux;Guy Melancon;Pierre-Yves Koenig;Faraz Zaidi;Daniel Archambault;Frederic Gilbert;Trung-Tien Phan-Quang;Morgan Mathiaut;Antoine Lambert;Jonathan Dubois;Ronan Sicre,"INRIA Bordeaux Sud-Ouest and LaBRI, Université de Bordeaux I, France;INRIA Bordeaux Sud-Ouest and LaBRI, Université de Bordeaux I, France;INRIA Bordeaux Sud-Ouest and LaBRI, Université de Bordeaux I, France;INRIA Bordeaux Sud-Ouest and LaBRI, Université de Bordeaux I, France;INRIA Bordeaux Sud-Ouest and LaBRI, Université de Bordeaux I, France;INRIA Bordeaux Sud-Ouest and LaBRI, Université de Bordeaux I, France;INRIA Bordeaux Sud-Ouest and LaBRI, Université de Bordeaux I, France;INRIA Bordeaux Sud-Ouest and LaBRI, Université de Bordeaux I, France;INRIA Bordeaux Sud-Ouest and LaBRI, Université de Bordeaux I, France;INRIA Bordeaux Sud-Ouest and LaBRI, Université de Bordeaux I, France;INRIA Bordeaux Sud-Ouest and LaBRI, Université de Bordeaux I, France;INRIA Bordeaux Sud-Ouest and LaBRI, Université de Bordeaux I, France;INRIA Bordeaux Sud-Ouest and LaBRI, Université de Bordeaux I, France",,,1,0,1,
VAST,2010,Enron case study: Analysis of email behavior using EmailTime,10.1109/VAST.2010.5649905,http://dx.doi.org/10.1109/VAST.2010.5649905,235,236,M,"This paper presents a case study with Enron email dataset to explore the behaviors of email users within different organizational positions. We defined email behavior as the email activity level of people regarding a series of measured metrics e.g. sent and received emails, numbers of email addresses, etc. These metrics were calculated through EmailTime, a visual analysis tool of email correspondence over the course of time. Results showed specific patterns in the email datasets of different organizational positions.",Minoo Erfani Joorabchi;Ji-Dong Yim;Mona Erfani Joorabchi;Chris Shaw 0002,Minoo Erfani Joorabchi;Ji-Dong Yim;Mona Erfani Joorabchi;Christopher D. Shaw,Simon Fraser University;Simon Fraser University;Simon Fraser University;Simon Fraser University,,"Email, Enron, Case Study, EmailTime, Visual Analysis",1,1,4,
VAST,2010,A Visual Analytics approach to identifying protein structural constraints,10.1109/VAST.2010.5650199,http://dx.doi.org/10.1109/VAST.2010.5650199,249,250,M,"Predicting protein structures has long been a grand-challenge problem. Fine-grained computational simulation of folding events from a protein's synthesis to its final stable structure remains computationally intractable. Therefore, methods which derive constraints from other sources are attractive. To date, constraints derived from known structures have proven to be highly successful. However, these cannot be applied to molecules with no identifiable neighbors having already-determined structures. For such molecules, structural constraints must be derived in other ways. One popular approach has been the statistical analysis of large families of proteins, with the hope that residues that “change together” (co-evolve) imply that those residues are in contact. Unfortunately, despite repeated attempts to use this data to deduce structural constraints, this approach has met with minimal success. The consensus of current literature concludes that there is simply too little information contained within the correlated mutations of many protein families to reliably and generally predict structural constraints. Recent work in my laboratory challenges this conclusion. For some time we have been developing methods (MAVL/StickWRLD) to visualize the pattern of co-evolved mutations within sequence families. While our analysis of individual correlations agrees with the literature consensus, we have recently discovered that the visualized pattern of correlations is highly suggestive of structural relationships. In our preliminary test cases, human researchers can unambiguously determine many positive structural constraints by visual analysis of statistical sequence information alone, often with no training on interpretation of the visualization results. Herein we report the visualization design that supports this Visual Analytics approach to identifying high-confidence hypotheses about protein folding from protein sequence, and illustrate preliminary results from this research. Our approach entails a higher-dimensional extension of parallel coordinates which illuminates distant shared sub-tuples of the vectors representing each protein sequence when these sub-tuples occur with an over abundance compared to expectations. It simultaneously eliminates all representations of tuples which occur with frequency near the expected norm. The result is a minimally-occluded representation of outlier, and only outlier co-occurrences within the sequence families.",William C. Ray,William C. Ray,"The Research Institute at Nationwide Children's Hospital, The Ohio State University Biophysics Program",,"High-order finite elements, spectral/hp elements, cut-plane extraction, GPU-based root-finding, GPU ray-tracing, cut-surface extraction",1,0,3,
VAST,2010,ProDV - A case study in delivering visual analytics,10.1109/VAST.2010.5650219,http://dx.doi.org/10.1109/VAST.2010.5650219,247,248,M,"We present a custom visual analytics system developed in conjunction with the test and evaluation community of the US Army. We designed and implemented a visual programming environment for configuring a variety of interactive visual analysis capabilities. Our abstraction of the visualization process is based on insights gained from interviews conducted with expert users. We show that this model allowed analysts to implement multiple visual analysis capabilities for network performance, anomalous sensor activity, and engagement results. Long-term interaction with expert users led to development of several custom visual analysis techniques. We have conducted training sessions with expert users, and are working to evaluate the success of our work based on performance metrics captured in a semi-automated fashion during these training sessions. We have also integrated collaborative analysis features such as annotations and shared content.",Derek Overby;John Keyser;Jim Wall,Derek Overby;John Keyser;Jim Wall,"Department of Computer Science and Engineering, Texas A&M University;Department of Computer Science and Engineering, Texas A&M University;Department of Industrial and Systems Engineering, Texas A&M University",,Visualization system and toolkit design,1,0,4,
VAST,2010,Conveying network features in geospatial battlespace displays,10.1109/VAST.2010.5651192,http://dx.doi.org/10.1109/VAST.2010.5651192,221,222,M,"Advanced battlespace network visualization techniques are required within the modern Air Operations Center (AOC) to improve cross-domain situation awareness and to support planning and decision-making. We present a visualization toolkit to address this need that supports the integration of network health and status information and meta-information with other traditional AOC information resources and activities across air, space, and cyber domains. Applications include the development of battlespace visualization technologies that will improve warfighters' decision-making response time and provide enhanced flexibility for mission planning by efficiently revealing affordances for leveraging, disrupting, or enhancing network connectivity.",J. Alex Godwin;Ryan M. Kilgore,J. Alex Godwin;Ryan M. Kilgore,Charles River Analytics;Charles River Analytics,,,1,1,2,
VAST,2010,Cluster correspondence views for enhanced analysis of SOM displays,10.1109/VAST.2010.5651676,http://dx.doi.org/10.1109/VAST.2010.5651676,217,218,M,"The Self-Organizing Map (SOM) algorithm is a popular and widely used cluster algorithm. Its constraint to organize clusters on a grid structure makes it very amenable to visualization. On the other hand, the grid constraint may lead to reduced cluster accuracy and reliability, compared to other clustering methods not implementing this restriction. We propose a visual cluster analysis system that allows to validate the output of the SOM algorithm by comparison with alternative clustering methods. Specifically, visual mappings overlaying alternative clustering results onto the SOM are proposed. We apply our system on an example data set, and outline main analytical use cases.",Jürgen Bernard;Tatiana von Landesberger;Sebastian Bremm;Tobias Schreck,Jürgen Bernard;Tatiana von Landesberger;Sebastian Bremm;Tobias Schreck,"Interactive Graphics Systems Group, TU Darmstadt, Germany;Interactive Graphics Systems Group, TU Darmstadt, Germany, and, Fraunhofer IGD, Darmstadt;Interactive Graphics Systems Group, TU Darmstadt, Germany;Interactive Graphics Systems Group, TU Darmstadt, Germany",,,1,1,5,
VAST,2010,A continuous analysis process between desktop and collaborative visual analytics environments,10.1109/VAST.2010.5652958,http://dx.doi.org/10.1109/VAST.2010.5652958,231,232,M,"Since its inception, the field of visual analytics has undergone tremendous growth in understanding how to create interactive visual tools to solve analytical problems. However, with few exceptions, most of these tools have been designed for single users in desktop environments. While often effective on their own, most single-user systems do not reflect the collaborative nature of solving real-world analytical tasks. Many intelligence analysts, for example, have been observed to switch repeatedly between working alone and collaborating with members of a small team. In this paper, we propose that a complete visual analytical system designed for solving real-world tasks ought to have two integrated components: a single-user desktop system and a mirroring system suitable for a collaborative environment.",Dong Hyun Jeong;Evan A. Suma;Thomas Butkiewicz;William Ribarsky;Remco Chang,Dong Hyun Jeong;Evan Suma;Thomas Butkiewicz;William Ribarsky;Remco Chang,Univ. of the District of Columbia;Univ. of Southern California;Univ. of North Carolina at Charlotte;Univ. of North Carolina at Charlotte;Tufts University,,,1,1,2,
VAST,2010,"Combining statistical independence testing, visual attribute selection and automated analysis to find relevant attributes for classification",10.1109/VAST.2010.5654445,http://dx.doi.org/10.1109/VAST.2010.5654445,239,240,M,"We present an iterative strategy for finding a relevant subset of attributes for the purpose of classification in high-dimensional, heterogeneous data sets. The attribute subset is used for the construction of a classifier function. In order to cope with the challenge of scalability, the analysis is split into an overview of all attributes and a detailed analysis of small groups of attributes. The overview provides generic information on statistical dependencies between attributes. With this information the user can select groups of attributes and an analytical method for their detailed analysis. The detailed analysis involves the identification of redundant attributes (via classification or regression) and the creation of summarizing attributes (via clustering or dimension reduction). Our strategy does not prescribe specific analytical methods. Instead, we recursively combine the results of different methods to find or generate a subset of attributes to use for classification.",Thorsten May;James Davey;Jörn Kohlhammer,Thorsten May;James Davey;Jörn Kohlhammer,"Fraunhofer Institute for Computer Graphics Research;Fraunhofer Institute for Computer Graphics Research;Fraunhofer Institute for, Computer Graphics, Research",,,1,1,5,
VAST,2011,Evaluation of large display interaction using smart phones,10.1109/VAST.2011.6102466,http://dx.doi.org/10.1109/VAST.2011.6102466,265,266,M,"Visual analytics, “the science of analytical reasoning facilitated by visual interactive interfaces” [5], puts high demands on the applications visualization as well as interaction capabilities. Due to their size large high-resolution screens have become popular display devices, especially when used in collaborative data analysis scenarios. However, traditional interaction methods based on combinations of computer mice and keyboards often do not scale to the number of users or the size of the display. Modern smart phones featuring multi-modal input/output and considerable memory offer a way to address these issues. In the last couple of years they have become common everyday life gadgets. In this paper we conduct an extensive user study comparing the experience of test candidates when using traditional input devices and metaphors with the one when using new smart phone based techniques, like multi-modal drag and tilt. Candidates were asked to complete various interaction tasks relevant for most applications on a large, monitor-based, high-resolution tiled wall system. Our study evaluates both user performance and satisfaction, identifying strengths and weaknesses of the researched interaction methods in specific tasks. Results reveal good performance of users in certain tasks when using the new interaction techniques. Even first-time users were able to complete a task faster with the smart phone than with traditional devices.",Jens Bauer;Sebastian Thelen;Achim Ebert,Jens Bauer;Sebastian Thelen;Achim Ebert,"Computer Graphics & HCI Lab, University of Kaiserslautern, Germany;Computer Graphics & HCI Lab, University of Kaiserslautern, Germany;Computer Graphics & HCI Lab, University of Kaiserslautern, Germany",,,1,0,5,
VAST,2011,A state transition approach to understanding users' interactions,10.1109/VAST.2011.6102476,http://dx.doi.org/10.1109/VAST.2011.6102476,285,286,M,"Understanding users' interactions is considered as one of the important research topics in visual analytics. Although numerous empirical user studies have been performed to understand a user's interaction, a limited study has been successful in connecting the user's interaction to his/her reasoning. In this paper, we present an approach of understanding experts' interactive analysis by connecting their interactions to conclusions (i.e. findings) through a state transition approach.",Dong Hyun Jeong;Soo-Yeon Ji;William Ribarsky;Remco Chang,Dong Hyun Jeong;Soo-Yeon Ji;William Ribarsky;Remco Chang,"University of the District of Columbia, USA;Bowie State University, USA;University of North Carolina at Charlotte, USA;Tufts University, USA",,,1,1,5,
VAST,2011,PORGY: Interactive and visual reasoning with graph rewriting systems,10.1109/VAST.2011.6102480,http://dx.doi.org/10.1109/VAST.2011.6102480,293,294,M,"Graph rewriting systems are easily described and explained. They can be seen as a game where one iterates transformation rules on an initial graph, until some condition is met. A rule describes a local pattern (i.e. a subgraph) that must be identified in a graph and specifies how to transform this subgraph. The graph rewriting formalism is at the same time extremely rich and complex, making the study of a model expressed in terms of graph rewriting quite challenging. For instance, predicting whether rules can be applied in any order is often difficult. When modelling complex systems, graphical formalisms have clear advantages: they are more intuitive and make it easier to visualize a system and convey intuitions about it. This work focuses on the design of an interactive visual graph rewriting system which supports graphical manipulations and computation to reason and simulate on a system. PORGY has been designed based on regular exchanges with graph rewriting systems experts and users over the past three years. The design choices relied on a careful methodology inspired from Munzner's nested process model for visualization design and validation [4].",Bruno Pinaud;Jonathan Dubois;Guy Melançon,Bruno Pinaud;Jonathan Dubois;Guy Melançon,"University of Bordeaux and INRIA Bordeaux Sud-Ouest, France;University of Bordeaux and INRIA Bordeaux Sud-Ouest, France;University of Bordeaux and INRIA Bordeaux Sud-Ouest, France",,,1,1,6,
VAST,2011,Analyst's workspace: Protecting vastopolis,10.1109/VAST.2011.6102495,http://dx.doi.org/10.1109/VAST.2011.6102495,323,324,M,"Analyst's Workspace is a sensemaking environment designed specifically for use of large, high-resolution displays. It employs a spatial workspace to integrate foraging and synthesis activities into a unified process. In this paper we describe how Analyst's Workspace solved the VAST 2011 mini-challenge #3 and discuss some of the unique features of the environment.",Christopher Andrews;Mahmud Shahriar Hossain;Samah Gad;Naren Ramakrishnan;Chris North 0001,Christopher Andrews;M. Shahriar Hossain;Samah Gad;Naren Ramakrishnan;Chris North,"Virginia Tech, USA;Virginia Tech, USA;Virginia Tech, USA;Virginia Tech, USA;Virginia Tech, USA",,,1,1,4,
VAST,2011,Jigsaw to save vastopolis,10.1109/VAST.2011.6102496,http://dx.doi.org/10.1109/VAST.2011.6102496,325,326,M,"This article describes our analytic process and experience of using the Jigsaw system in working on the VAST 2011 Mini Challenge 3. We describe how we extracted and worked with entities from the documents, and how Jigsaw's computational analysis capabilities and visualizations scaffolded the investigation. Based on our experiences, we discuss desirable features that would enhance the analytic power of Jigsaw.",Elizabeth Braunstein;Carsten Görg;Zhicheng Liu;John T. Stasko,Elizabeth Braunstein;Carsten Görg;Zhicheng Liu;John Stasko,"Mercyhurst College, USA;Univ. of Colorado Denver, USA;Georgia Tech, USA;Georgia Tech, USA",,,1,0,3,
VAST,2011,Interactive data analysis with nSpace2(c),10.1109/VAST.2011.6102497,http://dx.doi.org/10.1109/VAST.2011.6102497,327,328,M,"nSpace2 is an innovative visual analytics tool that was the primary platform used to search, evaluate, and organize the data in the VAST 2011 Mini Challenge #3 dataset. nSpace2 is a web-based tool that is designed to facilitate the back-and-forth flow of the multiple steps of an analysis process, including search, data triage, organization, sense-making, and reporting. This paper describes how nSpace2 was used to assist every step of the analysis process for this VAST challenge.",Casey M. Canfield;David Sheffield,Casey M. Canfield;David Sheffield,"Oculus Info Inc., USA;Oculus Info Inc., USA",,,1,0,3,
SciVis,2012,Surface-Based Structure Analysis and Visualization for Multifield Time-Varying Datasets,10.1109/TVCG.2012.269,http://dx.doi.org/10.1109/TVCG.2012.269,2392,2401,J,"This paper introduces a new feature analysis and visualization method for multifield datasets. Our approach applies a surface-centric model to characterize salient features and form an effective, schematic representation of the data. We propose a simple, geometrically motivated, multifield feature definition. This definition relies on an iterative algorithm that applies existing theory of skeleton derivation to fuse the structures from the constitutive fields into a coherent data description, while addressing noise and spurious details. This paper also presents a new method for non-rigid surface registration between the surfaces of consecutive time steps. This matching is used in conjunction with clustering to discover the interaction patterns between the different fields and their evolution over time. We document the unified visual analysis achieved by our method in the context of several multifield problems from large-scale time-varying simulations.",Samer S. Barakat;Markus Rütten;Xavier Tricoche,Samer S. Barakat;Markus Rütten;Xavier Tricoche,Purdue University;DLR Göttingen;Purdue University,10.1109/TVCG.2007.70615;10.1109/TVCG.2007.70523;10.1109/TVCG.2006.165;10.1109/TVCG.2007.70519;10.1109/TVCG.2008.116;10.1109/TVCG.2007.70519;10.1109/TVCG.2008.140;10.1109/VISUAL.1995.485139;10.1109/TVCG.2009.177;10.1109/TVCG.2008.148,"Multifield, time-varying, surface structures",1,1,36,
VAST,2012,LensingWikipedia: Parsing text for the interactive visualization of human history,10.1109/VAST.2012.6400530,http://dx.doi.org/10.1109/VAST.2012.6400530,247,248,M,"Extracting information from text is challenging. Most current practices treat text as a bag of words or word clusters, ignoring valuable linguistic information. Leveraging this linguistic information, we propose a novel approach to visualize textual information. The novelty lies in using state-of-the-art Natural Language Processing (NLP) tools to automatically annotate text which provides a basis for new and powerful interactive visualizations. Using NLP tools, we built a web-based interactive visual browser for human history articles from Wikipedia.",Ravikiran Vadlapudi;Maryam Siahbani;Anoop Sarkar;John Dill,Ravikiran Vadlapudi;Maryam Siahbani;Anoop Sarkar;John Dill,Simon Fraser University;Simon Fraser University;Simon Fraser University;Simon Fraser University,,,1,1,4,
VAST,2012,The spatiotemporal multivariate hypercube for discovery of patterns in event data,10.1109/VAST.2012.6400536,http://dx.doi.org/10.1109/VAST.2012.6400536,235,236,M,"Event data can hold valuable decision making information, yet detecting interesting patterns in this type of data is not an easy task because the data is usually rich and contains spatial, temporal as well as multivariate dimensions. Research into visual analytics tools to support the discovery of patterns in event data often focuses on the spatiotemporal or spatiomultivariate dimension of the data only. Few research efforts focus on all three dimensions in one framework. An integral view on all three dimensions is, however, required to unlock the full potential of event datasets. In this poster, we present an event visualization, transition, and interaction framework that enables an integral view on all dimensions of spatiotemporal multivariate event data. The framework is built around the notion that the event data space can be considered a spatiotemporal multivariate hypercube. Results of a case study we performed suggest that a visual analytics tool based on the proposed framework is indeed capable to support users in the discovery of multidimensional spatiotemporal multivariate patterns in event data.",Fred Olislagers;Marcel Worring,Fred Olislagers;Marcel Worring,"Intelligent Systems Lab Amsterdam, University of Amsterdam, The Netherlands;Intelligent Systems Lab Amsterdam, University of Amsterdam, The Netherlands",,,1,1,3,
VAST,2012,Visualizing flows of images in social media,10.1109/VAST.2012.6400539,http://dx.doi.org/10.1109/VAST.2012.6400539,229,230,M,"Mass and social media provide flows of images for real world events. It is sometimes difficult to represent realities and impressions of events using only text. However, even a single photo might remind us complex events. Along with events in the real world, there are representative images, such as design of products and commercial pictures. We can therefore recognize changes in trends of people's ideas, experiences, and interests through observing the flows of such representative images. This paper presents a novel 3D visualization system to explore temporal changes in trends using images associating with different topics, called Image Bricks. We show case studies using images extracted from our six-year blog archive. We first extract clusters of images as topics related to given keywords. We then visualize them on multiple timelines in a 3D space. Users can visually read stories of topics through exploring visualized images.",Masahiko Itoh;Masashi Toyoda;Tetsuya Kamijo;Masaru Kitsuregawa,Masahiko Itoh;Masashi Toyoda;Tetsuya Kamijo;Masaru Kitsuregawa,"Institute of Industrial Science, University of Tokyo;Institute of Industrial Science, University of Tokyo;Rakuten, Inc.;Institute of Industrial Science, University of Tokyo",,,1,1,6,
VAST,2012,Exploring cyber physical data streams using Radial Pixel Visualizations,10.1109/VAST.2012.6400541,http://dx.doi.org/10.1109/VAST.2012.6400541,225,226,M,"Cyber physical systems (CPS), such as smart buildings and data centers, are richly instrumented systems composed of tightly coupled computational and physical elements that generate large amounts of data. To explore CPS data and obtain actionable insights, we construct a Radial Pixel Visualization (RPV) system, which uses multiple concentric rings to show the data in a compact circular layout of small polygons (pixel cells), each of which represents an individual data value. RPV provides an effective visual representation of locality and periodicity of the high volume, multivariate data streams, and seamlessly combines them with the results of an automated analysis. In the outermost ring the results of correlation analysis and peak point detection are highlighted. Our explorations demonstrates how RPV can help administrators to identify periodic thermal hot spots, understand data center energy consumption, and optimize IT workload.",Ming C. Hao;Manish Marwah;Sebastian Mittelstädt;Halldór Janetzko;Daniel A. Keim;Umeshwar Dayal;Cullen Bash;Carlos J. Felix;Chandrakant D. Patel;Meichun Hsu;Yuan Chen 0001,M. Hao;Y. Chen;M. Marwah;S. Mittelstadt;H. Janetzko;D. Keim;U. Dayal;C. Bash;C. Felix;C. Patel;M. Hsu,"Hewlett-Packard Laboratories, Palo Alto, CA;Hewlett-Packard Laboratories, Palo Alto, CA;Hewlett-Packard Laboratories, Palo Alto, CA;University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;Hewlett-Packard Laboratories, Palo Alto, CA;Hewlett-Packard Laboratories, Palo Alto, CA;Hewlett-Packard Laboratories, Palo Alto, CA;Hewlett-Packard Laboratories, Palo Alto, CA;Hewlett-Packard Laboratories, Palo Alto, CA",,,1,1,2,
VAST,2012,Optimizing an SPT-tree for visual analytics,10.1109/VAST.2012.6400544,http://dx.doi.org/10.1109/VAST.2012.6400544,219,220,M,"Despite the extensive work done in the scientific visualization community on the creation and optimization of spatial data structures, there has been little adaptation of these structures in visual analytics and information visualization. In this work we present how we modify a space-partioning time (SPT) tree - a structure normally used in direct-volume rendering - for geospatial-temporal visualizations. We also present optimization techniques to improve the traversal speed of our structure through locational codes and bitwise comparisons. Finally, we present the results of an experiment that quantitatively evaluates our modified SPT tree with and without our optimizations. Our results indicate that retrieval was nearly three times faster when using our optimizations, and are consistent across multiple trials. Our finding could have implications for performance in using our modified SPT tree in large-scale geospatial temporal visual analytics software.",Connor Gramazio;Remco Chang,Connor Gramazio;Remco Chang,"Department of Computer Science Brown University &amp; Tufts University;Department of Computer Science, Tufts University",,,1,0,6,
VAST,2012,Feature-similarity visualization of MRI cortical surface data,10.1109/VAST.2012.6400548,http://dx.doi.org/10.1109/VAST.2012.6400548,211,212,M,"We present an analytics-based framework for simultaneous visualization of large surface data collections arising in clinical neuroimaging studies. Termed Informatics Visualization for Neuroimaging (INVIZIAN), this framework allows the visualization of both cortical surfaces characteristics and feature relatedness in unison. It also uses dimension reduction methods to derive new coordinate systems using a Jensen-Shannon divergence metric for positioning cortical surfaces in a metric space such that the proximity in location is proportional to neuroanatomical similarity. Feature data such as thickness and volume are colored on the cortical surfaces and used to display both subject-specific feature values and global trends within the population. Additionally, a query-based framework allows the neuroscience researcher to investigate probable correlations between neuroanatomical and subject patient attribute values such as age and diagnosis.",Ian Bowman;Shantanu H. Joshi;Vaughan Greer;John D. Van Horn,Ian Bowman;Shantanu H. Joshi;Vaughan Greer;John Darrell Van Horn,"Laboratory of Neuro Imaging, UCLA School of Medicine, Los Angeles 90095;Laboratory of Neuro Imaging, UCLA School of Medicine, Los Angeles 90095;Laboratory of Neuro Imaging, UCLA School of Medicine, Los Angeles 90095;Laboratory of Neuro Imaging, UCLA School of Medicine, Los Angeles 90095",,,1,1,2,
SciVis,2013,Visualization of Morse Connection Graphs for Topologically Rich 2D Vector fields,10.1109/TVCG.2013.229,http://dx.doi.org/10.1109/TVCG.2013.229,2763,2772,J,"Recent advances in vector field topologymake it possible to compute its multi-scale graph representations for autonomous 2D vector fields in a robust and efficient manner. One of these representations is a Morse Connection Graph (MCG), a directed graph whose nodes correspond to Morse sets, generalizing stationary points and periodic trajectories, and arcs - to trajectories connecting them. While being useful for simple vector fields, the MCG can be hard to comprehend for topologically rich vector fields, containing a large number of features. This paper describes a visual representation of the MCG, inspired by previous work on graph visualization. Our approach aims to preserve the spatial relationships between the MCG arcs and nodes and highlight the coherent behavior of connecting trajectories. Using simulations of ocean flow, we show that it can provide useful information on the flow structure. This paper focuses specifically on MCGs computed for piecewise constant (PC) vector fields. In particular, we describe extensions of the PC framework that make it more flexible and better suited for analysis of data on complex shaped domains with a boundary. We also describe a topology simplification scheme that makes our MCG visualizations less ambiguous. Despite the focus on the PC framework, our approach could also be applied to graph representations or topological skeletons computed using different methods.",Andrzej Szymczak;Levente Sipeki,Andrzej Szymczak;Levente Sipeki,Colorado School of Mines;Colorado School of Mines,10.1109/TVCG.2011.233;10.1109/TVCG.2008.135;10.1109/TVCG.2012.209;10.1109/VISUAL.2000.885716,"Morse connection graph, vector field topology",1,1,34,
SciVis,2015,Using Maximum Topology Matching to Explore Differences in Species Distribution Models,10.1109/SciVis.2015.7429486,http://dx.doi.org/10.1109/SciVis.2015.7429486,9,16,C,"Species distribution models (SDM) are used to help understand what drives the distribution of various plant and animal species. These models are typically high dimensional scalar functions, where the dimensions of the domain correspond to predictor variables of the model algorithm. Understanding and exploring the differences between models help ecologists understand areas where their data or understanding of the system is incomplete and will help guide further investigation in these regions. These differences can also indicate an important source of model to model uncertainty. However, it is cumbersome and often impractical to perform this analysis using existing tools, which allows for manual exploration of the models usually as 1-dimensional curves. In this paper, we propose a topology-based framework to help ecologists explore the differences in various SDMs directly in the high dimensional domain. In order to accomplish this, we introduce the concept of maximum topology matching that computes a locality-aware correspondence between similar extrema of two scalar functions. The matching is then used to compute the similarity between two functions. We also design a visualization interface that allows ecologists to explore SDMs using their topological features and to study the differences between pairs of models found using maximum topological matching. We demonstrate the utility of the proposed framework through several use cases using different data sets and report the feedback obtained from ecologists.",Jorge Poco;Harish Doraiswamy;Marian Talbert;Jeffrey T. Morisette;Cláudio T. Silva,Jorge Poco;Harish Doraiswamy;Marian Talbert;Jeffrey Morisette;Cláudio T. Silva,New York University;New York University;U.S. Geological Survey;U.S. Geological Survey;New York University,10.1109/TVCG.2011.244;10.1109/TVCG.2010.213;10.1109/TVCG.2008.145;10.1109/TVCG.2009.155;10.1109/TVCG.2013.125;10.1109/TVCG.2008.143;10.1109/TVCG.2011.236;10.1109/TVCG.2013.148;10.1109/TVCG.2014.2346332;10.1109/TVCG.2011.248;10.1109/TVCG.2007.70601,"Function similarity, computational topology, species distribution models, persistence, high dimensional visualization",1,1,44,
SciVis,2015,Explicit Frequency Control for High-Quality Texture-Based Flow Visualization,10.1109/SciVis.2015.7429490,http://dx.doi.org/10.1109/SciVis.2015.7429490,41,48,C,"In this work we propose an effective method for frequency-controlled dense flow visualization derived from a generalization of the Line Integral Convolution (LIC) technique. Our approach consists in considering the spectral properties of the dense flow visualization process as an integral operator defined in a local curvilinear coordinate system aligned with the flow. Exploring LIC from this point of view, we suggest a systematic way to design a flow visualization process with particular local spatial frequency properties of the resulting image. Our method is efficient, intuitive, and based on a long-standing model developed as a result of numerous perception studies. The method can be described as an iterative application of line integral convolution, followed by a one-dimensional Gabor filtering orthogonal to the flow. To demonstrate the utility of the technique, we generated novel adaptive multi-frequency flow visualizations, that according to our evaluation, feature a higher level of frequency control and higher quality scores than traditional approaches in texture-based flow visualization.",Victor Matvienko;Jens H. Krüger,Victor Matvienko;Jens Krüger,Saarland University;University Duisburg-Essen,10.1109/VISUAL.2005.1532853;10.1109/TVCG.2007.70595;10.1109/TVCG.2006.161;10.1109/VISUAL.1994.346313;10.1109/VISUAL.1996.567784;10.1109/VISUAL.2001.964505;10.1109/TVCG.2009.126;10.1109/VISUAL.1999.809892;10.1109/VISUAL.2003.1250362;10.1109/VISUAL.2005.1532781,"flow visualization, texture-based visualization, LIC, Gabor filter, spatial frequency, image contrast",1,1,49,
SciVis,2015,Automated visualization workflow for simulation experiments,10.1109/SciVis.2015.7429509,http://dx.doi.org/10.1109/SciVis.2015.7429509,153,154,M,"Modeling and simulation is often used to predict future events and plan accordingly. Experiments in this domain often produce thousands of results from individual simulations, based on slightly varying input parameters. Geo-spatial visualizations can be a powerful tool to help health researchers and decision-makers to take measures during catastrophic and epidemic events such as Ebola outbreaks. The work produced a web-based geo-visualization tool to visualize and compare the spread of Ebola in the West African countries Ivory Coast and Senegal based on multiple simulation results. The visualization is not Ebola specific and may visualize any time-varying frequencies for given geo-locations.",Jonathan Leidig;Santhosh Dharmapuri,Jonathan P. Leidig;Santhosh Dharmapuri,"School of Computing and Information Systems, Grand Valley State University;School of Computing and Information Systems, Grand Valley State University",,,1,1,12,
SciVis,2015,A bottom-up scheme for user-defined feature exploration in vector field ensembles,10.1109/SciVis.2015.7429510,http://dx.doi.org/10.1109/SciVis.2015.7429510,155,156,M,"Most of the existing approaches to visualize vector field ensembles are achieved by visualizing the uncertainty of individual variables from different simulation runs. However, the comparison of the derived feature or user-defined feature, such as the vortex in ensemble flow is also of vital significance since they often make more sense according to the domain knowledge. In this work, we present a framework to extract user-defined feature from different simulation runs. Specially, we use a bottom-up searching scheme to help to extract vortex with a user-defined shape, and further compute the geometry information including the size, and the geo-spatial location of the extracted vortex. Finally we design some linked views to compare the feature between different runs.",Richen Liu;Hanqi Guo 0001;Xiaoru Yuan,Richen Liu;Hanqi Guo;Xiaoru Yuan,"Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University;Argonne National Laboratory;Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University",,,1,1,5,
SciVis,2015,Interactive Visualization for Singular Fibers of Functions f : R3 -> R2,10.1109/TVCG.2015.2467433,http://dx.doi.org/10.1109/TVCG.2015.2467433,945,954,J,"Scalar topology in the form of Morse theory has provided computational tools that analyze and visualize data from scientific and engineering tasks. Contracting isocontours to single points encapsulates variations in isocontour connectivity in the Reeb graph. For multivariate data, isocontours generalize to fibers-inverse images of points in the range, and this area is therefore known as fiber topology. However, fiber topology is less fully developed than Morse theory, and current efforts rely on manual visualizations. This paper presents how to accelerate and semi-automate this task through an interface for visualizing fiber singularities of multivariate functions R<sup>3</sup>→R<sup>2</sup>. This interface exploits existing conventions of fiber topology, but also introduces a 3D view based on the extension of Reeb graphs to Reeb spaces. Using the Joint Contour Net, a quantized approximation of the Reeb space, this accelerates topological visualization and permits online perturbation to reduce or remove degeneracies in functions under study. Validation of the interface is performed by assessing whether the interface supports the mathematical workflow both of experts and of less experienced mathematicians.",Daisuke Sakurai;Osamu Saeki;Hamish A. Carr;Hsiang-Yun Wu;Takahiro Yamamoto;David J. Duke;Shigeo Takahashi,Daisuke Sakurai;Osamu Saeki;Hamish Carr;Hsiang-Yun Wu;Takahiro Yamamoto;David Duke;Shigeo Takahashi,"University of Tokyo, Kashiwa, Japan;Kyushu University, Fukuoka, Japan;University of Leeds, Leeds, UK;Keio University, Yokohama, Japan;Kyushu Sangyo University, Fukuoka, Japan;University of Leeds, Leeds, UK;University of Aizu, Aizu-Wakamatsu, Japan",10.1109/TVCG.2008.119;10.1109/VISUAL.1997.663875;10.1109/TVCG.2012.287;10.1109/TVCG.2010.213;10.1109/TVCG.2014.2346447;10.1109/TVCG.2010.146;10.1109/VISUAL.2002.1183774;10.1109/TVCG.2008.143;10.1109/TVCG.2009.119;10.1109/TVCG.2007.70601,"Singular fibers, fiber topology, mathematical visualization, design study",1,1,36,
SciVis,2015,Effectiveness of Structured Textures on Dynamically Changing Terrain-like Surfaces,10.1109/TVCG.2015.2467962,http://dx.doi.org/10.1109/TVCG.2015.2467962,926,934,J,"Previous perceptual research and human factors studies have identified several effective methods for texturing 3D surfaces to ensure that their curvature is accurately perceived by viewers. However, most of these studies examined the application of these techniques to static surfaces. This paper explores the effectiveness of applying these techniques to dynamically changing surfaces. When these surfaces change shape, common texturing methods, such as grids and contours, induce a range of different motion cues, which can draw attention and provide information about the size, shape, and rate of change. A human factors study was conducted to evaluate the relative effectiveness of these methods when applied to dynamically changing pseudo-terrain surfaces. The results indicate that, while no technique is most effective for all cases, contour lines generally perform best, and that the pseudo-contour lines induced by banded color scales convey the same benefits.",Thomas Butkiewicz;Andrew H. Stevens,Thomas Butkiewicz;Andrew H. Stevens,The Center for Coastal and Ocean Mapping;The Center for Coastal and Ocean Mapping,,"Structured textures, terrain, deformation, dynamic surfaces",1,0,21,
VAST,2015,Visual scalability of spatial ensemble uncertainty,10.1109/VAST.2015.7347671,http://dx.doi.org/10.1109/VAST.2015.7347671,187,188,M,"Weather Research and Forecasting (WRF) models simulate weather conditions by generating 2D numerical weather prediction ensemble members either through perturbing initial conditions or by changing different parameterization schemes, e.g., cumulus and microphysics schemes. These simulations are often used by weather analysts to analyze the nature of uncertainty attributed by these simulations to forecast weather conditions with good accuracy. The number of simulations used for forecasting is growing with the advent of increase in computing power. Hence, there is a need for providing better visual insights of uncertainty with growing number of ensemble members. We propose a geo visual analytical framework that uses visual analytics approach to resolve visual scalability of these ensemble members. Our approach naturally fits with the workflow of an analyst analyzing ensemble spatial uncertainty. Meteorologists evaluated our framework qualitatively and found it to be effective in acquiring insights of spatial uncertainty associated with multiple ensemble runs that are simulated using multiple parameterization schemes.",Sujan Anreddy;Song Zhang 0004;Andrew Mercer 0001;Jamie L. Dyer;J. Edward Swan,Sujan Anreddy;Song Zhang;Andrew Mercer;Jamie Dyer;J. Edward Swan,"Mississippi State University, USA;Mississippi State University, USA;Mississippi State University, USA;Mississippi State University, USA;Mississippi State University, USA",,,1,1,6,
VAST,2015,StreamVisND: Visualizing relationships in streaming multivariate data,10.1109/VAST.2015.7347673,http://dx.doi.org/10.1109/VAST.2015.7347673,191,192,M,"In streaming acquisitions the data changes over time. ThemeRiver and line charts are common methods to display data over time. However, these methods can only show the values of the variables (or attributes) but not the relationships among them over time. We propose a framework we call StreamVis&lt;sup&gt;ND&lt;/sup&gt; that can display these types of streaming data relations. It first slices the data stream into different time slices, then it visualizes each slice with a sequence of multivariate 2D data layouts, and finally it flattens this series of displays into a parallel coordinate type display. Our framework is fully interactive and lends itself well to real-time displays.",Shenghui Cheng;Yue Wang;Dan Zhang;Zhifang Jiang;Klaus Mueller,Shenghui Cheng;Yue Wang;Dan Zhang;Zhifang Jiang;Klaus Mueller,"Visual Analytics and Imaging Lab, Computer Science Department, Stony Brook University and SUNY Korea;Department of Computer Science, Shandong University, China;Visual Analytics and Imaging Lab, Computer Science Department, Stony Brook University and SUNY Korea;Department of Computer Science, Shandong University, China;Visual Analytics and Imaging Lab, Computer Science Department, Stony Brook University and SUNY Korea",,,1,0,3,
VAST,2015,A software developer's guide to informal evaluation of Visual Analytics environments using VAST Challenge information,10.1109/VAST.2015.7347674,http://dx.doi.org/10.1109/VAST.2015.7347674,193,194,M,"The VAST Challenge has been a popular venue for academic and industry participants for over ten years. Many participants comment that the majority of their time in preparing VAST Challenge entries is discovering elements in their software environments that need to be redesigned in order to solve the given task. Fortunately, there is no need to wait until the VAST Challenge is announced to test out software systems. The Visual Analytics Benchmark Repository contains all past VAST Challenge tasks, data, solutions and submissions. In this poster we describe how developers can perform informal evaluations of various aspects of their visual analytics environments using VAST Challenge information.",Kristin A. Cook;Jean Scholtz;Mark A. Whiting,Kristin A. Cook;Jean Scholtz;Mark A. Whiting,"Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA;Pacific Northwest National Laboratory, USA",,,1,1,2,
VAST,2015,Topicks: Visualizing complex topic models for user comprehension,10.1109/VAST.2015.7347681,http://dx.doi.org/10.1109/VAST.2015.7347681,207,208,M,"The interactive visualization of topic models is a promising approach to summarizing large sets of textual data. Topicks is the working title for a means to visualize topic modelling outputs. Incorporating a radial layout, users can view the relationships between topics, terms and the corpus as a whole. Interacting with topic and term nodes, as well as a related bar chart, provides the user with various ways to manipulate the visualization and explore the data. We describe the visualization and potential user interactions before discussing future work.",Jessica Peter;Steve James Szigeti;Ana Jofre;Sara Diamond,Jessica Peter;Steve Szigeti;Ana Jofre;Sara Diamond,"OCAD University, Canada;OCAD University, Canada;OCAD University, Canada;OCAD University, Canada",,,1,0,6,
VAST,2015,Sequencing of categorical time series,10.1109/VAST.2015.7347684,http://dx.doi.org/10.1109/VAST.2015.7347684,213,214,M,"Exploring and comparing categorical time series and finding temporal patterns are complex tasks in the field of time series data mining. Although different analysis approaches exist, these tasks remain challenging, especially when numerous time series are considered at once. We propose a visual analysis approach that supports exploring such data by ordering time series in meaningful ways. We provide interaction techniques to steer the automated arrangement and to allow users to investigate patterns in detail.",Christian Richter;Martin Luboschik;Martin Röhlig;Heidrun Schumann,Christian Richter;Martin Luboschik;Martin Röhlig;Heidrun Schumann,"University of Rostock, Germany;University of Rostock, Germany;University of Rostock, Germany;University of Rostock, Germany",,,1,2,5,
VAST,2015,uRank: Visual analytics approach for search result exploration,10.1109/VAST.2015.7347686,http://dx.doi.org/10.1109/VAST.2015.7347686,217,218,M,"uRank is a Web-based tool combining lightweight text analytics and visual methods for topic-wise exploration of document sets. It includes a view summarizing the content of the document set in meaningful terms, a dynamic document ranking view and a detailed view for further inspection of individual documents. Its major strength lies in how it supports users in reorganizing documents on-the-fly as their information interests change. We present a preliminary evaluation showing that uRank helps to reduce cognitive load compared to a traditional list-based representation.",Cecilia di Sciascio;Vedran Sabol;Eduardo E. Veas,Cecilia di Sciascio;Vedran Sabol;Eduardo Veas,"Know-Center GmbH, Graz, Austria;Know-Center GmbH, Graz, Austria;Know-Center GmbH, Graz, Austria",,,1,1,5,
InfoVis,2016,Screenit: Visual Analysis of Cellular Screens,10.1109/TVCG.2016.2598587,http://dx.doi.org/10.1109/TVCG.2016.2598587,591,600,J,"High-throughput and high-content screening enables large scale, cost-effective experiments in which cell cultures are exposed to a wide spectrum of drugs. The resulting multivariate data sets have a large but shallow hierarchical structure. The deepest level of this structure describes cells in terms of numeric features that are derived from image data. The subsequent level describes enveloping cell cultures in terms of imposed experiment conditions (exposure to drugs). We present Screenit, a visual analysis approach designed in close collaboration with screening experts. Screenit enables the navigation and analysis of multivariate data at multiple hierarchy levels and at multiple levels of detail. Screenit integrates the interactive modeling of cell physical states (phenotypes) and the effects of drugs on cell cultures (hits). In addition, quality control is enabled via the detection of anomalies that indicate low-quality data, while providing an interface that is designed to match workflows of screening experts. We demonstrate analyses for a real-world data set, CellMorph, with 6 million cells across 20,000 cell cultures.",Kasper Dinkla;Hendrik Strobelt;Bryan Genest;Stephan Reiling;Mark Borowsky;Hanspeter Pfister,Kasper Dinkla;Hendrik Strobelt;Bryan Genest;Stephan Reiling;Mark Borowsky;Hanspeter Pfister,Harvard University;Harvard University;Novartis Institute of BioMedical Research;Novartis Institute of BioMedical Research;Novartis Institute of BioMedical Research;Harvard University,10.1109/VAST.2012.6400492;10.1109/TVCG.2014.2346752;10.1109/TVCG.2015.2466971;10.1109/TVCG.2011.253;10.1109/VAST.2010.5652443;10.1109/TVCG.2012.213;10.1109/TVCG.2014.2346578;10.1109/TVCG.2013.173;10.1109/VAST.2011.6102453;10.1109/TVCG.2014.2346482,High-content screening;visual analysis;feature selection;image classification;biology;multivariate;hierarchy,1,4,48,
SciVis,2016,Visualizing Shape Deformations with Variation of Geometric Spectrum,10.1109/TVCG.2016.2598790,http://dx.doi.org/10.1109/TVCG.2016.2598790,721,730,J,"This paper presents a novel approach based on spectral geometry to quantify and visualize non-isometric deformations of 3D surfaces by mapping two manifolds. The proposed method can determine multi-scale, non-isometric deformations through the variation of Laplace-Beltrami spectrum of two shapes. Given two triangle meshes, the spectra can be varied from one to another with a scale function defined on each vertex. The variation is expressed as a linear interpolation of eigenvalues of the two shapes. In each iteration step, a quadratic programming problem is constructed, based on our derived spectrum variation theorem and smoothness energy constraint, to compute the spectrum variation. The derivation of the scale function is the solution of such a problem. Therefore, the final scale function can be solved by integral of the derivation from each step, which, in turn, quantitatively describes non-isometric deformations between two shapes. To evaluate the method, we conduct extensive experiments on synthetic and real data. We employ real epilepsy patient imaging data to quantify the shape variation between the left and right hippocampi in epileptic brains. In addition, we use longitudinal Alzheimer data to compare the shape deformation of diseased and healthy hippocampus. In order to show the accuracy and effectiveness of the proposed method, we also compare it with spatial registration-based methods, e.g., non-rigid Iterative Closest Point (ICP) and voxel-based method. These experiments demonstrate the advantages of our method.",Jiaxi Hu;Hajar Hamidian;Zichun Zhong;Jing Hua,Jiaxi Hu;Hajar Hamidian;Zichun Zhong;Jing Hua,Wayne State University;Wayne State University;Wayne State University;Wayne State University,10.1109/TVCG.2009.159;10.1109/TVCG.2015.2467198;10.1109/TVCG.2011.171,Geometry-based Technique;Spectral Analysis;Biomedical Visualization,1,4,44,
SciVis,2016,A Versatile and Efficient GPU Data Structure for Spatial Indexing,10.1109/TVCG.2016.2599043,http://dx.doi.org/10.1109/TVCG.2016.2599043,911,920,J,"In this paper we present a novel GPU-based data structure for spatial indexing. Based on Fenwick trees-a special type of binary indexed trees-our data structure allows construction in linear time. Updates and prefixes can be computed in logarithmic time, whereas point queries require only constant time on average. Unlike competing data structures such as summed-area tables and spatial hashing, our data structure requires a constant amount of bits for each data element, and it offers unconstrained point queries. This property makes our data structure ideally suited for applications requiring unconstrained indexing of large data, such as block-storage of large and block-sparse volumes. Finally, we provide asymptotic bounds on both run-time and memory requirements, and we show applications for which our new data structure is useful.",Jens Schneider;Peter Rautek,Jens Schneider;Peter Rautek,Visual Computing Center(VCC)King Abdullah University of Science and Technology (KAUST);Visual Computing Center(VCC)King Abdullah University of Science and Technology (KAUST),10.1109/TVCG.2015.2467331,GPU-based Data Structures;Binary Index Trees;Sparse Data,1,4,21,
VAST,2016,GazeDx: Interactive Visual Analytics Framework for Comparative Gaze Analysis with Volumetric Medical Images,10.1109/TVCG.2016.2598796,http://dx.doi.org/10.1109/TVCG.2016.2598796,311,320,J,"We present an interactive visual analytics framework, GazeDx (abbr. of GazeDiagnosis), for the comparative analysis of gaze data from multiple readers examining volumetric images while integrating important contextual information with the gaze data. Gaze pattern comparison is essential to understanding how radiologists examine medical images, and to identifying factors influencing the examination. Most prior work depended upon comparisons with manually juxtaposed static images of gaze tracking results. Comparative gaze analysis with volumetric images is more challenging due to the additional cognitive load on 3D perception. A recent study proposed a visualization design based on direct volume rendering (DVR) for visualizing gaze patterns in volumetric images; however, effective and comprehensive gaze pattern comparison is still challenging due to a lack of interactive visualization tools for comparative gaze analysis. We take the challenge with GazeDx while integrating crucial contextual information such as pupil size and windowing into the analysis process for more in-depth and ecologically valid findings. Among the interactive visualization components in GazeDx, a context-embedded interactive scatterplot is especially designed to help users examine abstract gaze data in diverse contexts by embedding medical imaging representations well known to radiologists in it. We present the results from two case studies with two experienced radiologists, where they compared the gaze patterns of 14 radiologists reading two patients' volumetric CT images.",Hyunjoo Song;Jeongjin Lee;Tae Jung Kim;Kyoung Ho Lee;Bo Hyoung Kim;Jinwook Seo,Hyunjoo Song;Jeongjin Lee;Tae Jung Kim;Kyoung Ho Lee;Bohyoung Kim;Jinwook Seo,"Seoul National University;Soongsil University;Samsung Medical Center;Bundang Hospital, Seoul National University;Hankuk University of Foreign Studies;Seoul National University",10.1109/VAST.2011.6102435;10.1109/TVCG.2010.149,Eye tracking;gaze visualization;gaze pattern comparison;volumetric medical images;context-embedded interactive scatterplot;interactive temporal chart,1,5,32,
VAST,2016,VisMatchmaker: Cooperation of the User and the Computer in Centralized Matching Adjustment,10.1109/TVCG.2016.2599378,http://dx.doi.org/10.1109/TVCG.2016.2599378,231,240,J,"Centralized matching is a ubiquitous resource allocation problem. In a centralized matching problem, each agent has a preference list ranking the other agents and a central planner is responsible for matching the agents manually or with an algorithm. While algorithms can find a matching which optimizes some performance metrics, they are used as a black box and preclude the central planner from applying his domain knowledge to find a matching which aligns better with the user tasks. Furthermore, the existing matching visualization techniques (i.e. bipartite graph and adjacency matrix) fail in helping the central planner understand the differences between matchings. In this paper, we present VisMatchmaker, a visualization system which allows the central planner to explore alternatives to an algorithm-generated matching. We identified three common tasks in the process of matching adjustment: problem detection, matching recommendation and matching evaluation. We classified matching comparison into three levels and designed visualization techniques for them, including the number line view and the stacked graph view. Two types of algorithmic support, namely direct assignment and range search, and their interactive operations are also provided to enable the user to apply his domain knowledge in matching adjustment.",Po-Ming Law;Wenchao Wu;Yixian Zheng;Huamin Qu,Po-Ming Law;Wenchao Wu;Yixian Zheng;Huamin Qu,Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology,10.1109/INFVIS.2004.1;10.1109/TVCG.2006.122;10.1109/TVCG.2014.2346249;10.1109/TVCG.2014.2346441;10.1109/VAST.2011.6102453,Centralized matching;matching visualization;interaction techniques;visual analytics,1,3,32,
VAST,2016,The DataSpace for HIV vaccine studies,10.1109/VAST.2016.7883509,http://dx.doi.org/10.1109/VAST.2016.7883509,31,40,C,"The DataSpace for HIV vaccine studies is a discovery tool available on the web to hundreds of investigators. We designed it to help them better understand activity in the field and explore new ideas latent in completed research. The DataSpace harmonizes immunoassay results and study metadata so that a broader research community can pursue more flexible discovery than the typical centrally planned analyses. Insights from human-centered design and beta evaluation suggest strong potential for visual analytics that may also apply to other efforts in open science. The contribution of this paper is to elucidate key domain challenges and demonstrate an application that addresses them. We made several changes to familiar visualizations to support key tasks such as identifying and filtering to a cohort of interest, making meaningful comparisons of time series data from multiple studies that have different plans, and preserving analytic context when making data transformations and comparisons that would normally exclude some data.",David McColgin;Paul Hoover;Mark Igra,David McColgin;Paul Hoover;Mark Igra,"LabKey Software, United States of America;LabKey Software, United States of America;LabKey Software, United States of America",,,1,1,18,
VAST,2016,Shape Grammar Extraction for Efficient Query-by-Sketch Pattern Matching in Long Time Series,10.1109/VAST.2016.7883518,http://dx.doi.org/10.1109/VAST.2016.7883518,121,130,C,"Long time-series, involving thousands or even millions of time steps, are common in many application domains but remain very difficult to explore interactively. Often the analytical task in such data is to identify specific patterns, but this is a very complex and computationally difficult problem and so focusing the search in order to only identify interesting patterns is a common solution. We propose an efficient method for exploring user-sketched patterns, incorporating the domain expert's knowledge, in time series data through a shape grammar based approach. The shape grammar is extracted from the time series by considering the data as a combination of basic elementary shapes positioned across different amplitudes. We represent these basic shapes using a ratio value, perform binning on ratio values and apply a symbolic approximation. Our proposed method for pattern matching is amplitude-, scale- and translation-invariant and, since the pattern search and pattern constraint relaxation happen at the symbolic level, is very efficient permitting its use in a real-time/online system. We demonstrate the effectiveness of our method in a case study on stock market data although it is applicable to any numeric time series data.",Prithiviraj K. Muthumanickam;Katerina Vrotsou;Matthew Cooper 0001;Jimmy Johansson,Prithiviraj K. Muthumanickam;Katerina Vrotsou;Matthew Cooper;Jimmy Johansson,"Link&#x00F6;ping University, Sweden;Link&#x00F6;ping University, Sweden;Link&#x00F6;ping University, Sweden;Link&#x00F6;ping University, Sweden",10.1109/TVCG.2008.184;10.1109/VAST.2010.5652530;10.1109/TVCG.2009.200;10.1109/TVCG.2010.137,,1,2,55,
InfoVis,2017,Open vs. Closed Shapes: New Perceptual Categories?,10.1109/TVCG.2017.2745086,http://dx.doi.org/10.1109/TVCG.2017.2745086,574,583,J,"Effective communication using visualization relies in part on the use of viable encoding strategies. For example, a viewer's ability to rapidly and accurately discern between two or more categorical variables in a chart or figure is contingent upon the distinctiveness of the encodings applied to each variable. Research in perception suggests that color is a more salient visual feature when compared to shape and although that finding is supported by visualization studies, characteristics of shape also yield meaningful differences in distinctiveness. We propose that open or closed shapes (that is, whether shapes are composed of line segments that are bounded across a region of space or not) represent a salient characteristic that influences perceptual processing. Three experiments were performed to test the reliability of the open/closed category; the first two from the perspective of attentional allocation, and the third experiment in the context of multi-class scatterplot displays. In the first, a flanker paradigm was used to test whether perceptual load and open/closed feature category would modulate the effect of the flanker on target processing. Results showed an influence of both variables. The second experiment used a Same/Different reaction time task to replicate and extend those findings. Results from both show that responses are faster and more accurate when closed rather than open shapes are processed as targets, and there is more processing interference when two competing shapes come from the same rather than different open or closed feature categories. The third experiment employed three commonly used visual analytic tasks - perception of average value, numerosity, and linear relationships with both single and dual displays of open and closed symbols. Our findings show that for numerosity and trend judgments, in particular, that different symbols from the same open or closed feature category cause more perceptual interference when they are presented together in a plot than symbols from different categories. Moreover, the extent of the interference appears to depend upon whether the participant is focused on processing open or closed symbols.",David Burlinson;Kalpathi R. Subramanian;Paula Goolkasian,David Burlinson;Kalpathi Subramanian;Paula Goolkasian,"Department of Computer Science, The University of North Carolina, Charlotte;Department of Computer Science, The University of North Carolina, Charlotte;Department of Psychology, The University of North Carolina, Charlotte",10.1109/TVCG.2014.2346978;10.1109/TVCG.2013.183,"scatterplot,visualization design,perceptual category,open shape,closed shape",1,0,26,
SciVis,2017,Screen-Space Normal Distribution Function Caching for Consistent Multi-Resolution Rendering of Large Particle Data,10.1109/TVCG.2017.2743979,http://dx.doi.org/10.1109/TVCG.2017.2743979,944,953,J,"Molecular dynamics (MD) simulations are crucial to investigating important processes in physics and thermodynamics. The simulated atoms are usually visualized as hard spheres with Phong shading, where individual particles and their local density can be perceived well in close-up views. However, for large-scale simulations with 10 million particles or more, the visualization of large fields-of-view usually suffers from strong aliasing artifacts, because the mismatch between data size and output resolution leads to severe under-sampling of the geometry. Excessive super-sampling can alleviate this problem, but is prohibitively expensive. This paper presents a novel visualization method for large-scale particle data that addresses aliasing while enabling interactive high-quality rendering. We introduce the novel concept of screen-space normal distribution functions (S-NDFs) for particle data. S-NDFs represent the distribution of surface normals that map to a given pixel in screen space, which enables high-quality re-lighting without re-rendering particles. In order to facilitate interactive zooming, we cache S-NDFs in a screen-space mipmap (S-MIP). Together, these two concepts enable interactive, scale-consistent re-lighting and shading changes, as well as zooming, without having to re-sample the particle data. We show how our method facilitates the interactive exploration of real-world large-scale MD simulation data in different scenarios.",Mohamed Ibrahim;Patrick Wickenhauser;Peter Rautek;Guido Reina;Markus Hadwiger,Mohamed Ibrahim;Patrick Wickenhäuser;Peter Rautek;Guido Reina;Markus Hadwiger,"King Abdullah University of Science and Technology (KAUST), Saudi Arabia;Visualization Research Center (VISUS), University of Stuttgart, Germany;King Abdullah University of Science and Technology (KAUST), Saudi Arabia;Visualization Research Center (VISUS), University of Stuttgart, Germany;King Abdullah University of Science and Technology (KAUST), Saudi Arabia",10.1109/VISUAL.2004.103;10.1109/TVCG.2009.142;10.1109/VISUAL.2003.1250404;10.1109/TVCG.2014.2346324;10.1109/TVCG.2010.215;10.1109/TVCG.2016.2599041;10.1109/SciVis.2015.7429492,"Multiresolution Techniques,Point-Based Data,Glyph-based Techniques,Scalability Issues,Molecular Visualization",1,1,40,
SciVis,2017,Decision Graph Embedding for High-Resolution Manometry Diagnosis,10.1109/TVCG.2017.2744299,http://dx.doi.org/10.1109/TVCG.2017.2744299,873,882,J,"High-resolution manometry is an imaging modality which enables the categorization of esophageal motility disorders. Spatio-temporal pressure data along the esophagus is acquired using a tubular device and multiple test swallows are performed by the patient. Current approaches visualize these swallows as individual instances, despite the fact that aggregated metrics are relevant in the diagnostic process. Based on the current Chicago Classification, which serves as the gold standard in this area, we introduce a visualization supporting an efficient and correct diagnosis. To reach this goal, we propose a novel decision graph representing the Chicago Classification with workflow optimization in mind. Based on this graph, we are further able to prioritize the different metrics used during diagnosis and can exploit this prioritization in the actual data visualization. Thus, different disorders and their related parameters are directly represented and intuitively influence the appearance of our visualization. Within this paper, we introduce our novel visualization, justify the design decisions, and provide the results of a user study we performed with medical students as well as a domain expert. On top of the presented visualization, we further discuss how to derive a visual signature for individual patients that allows us for the first time to perform an intuitive comparison between subjects, in the form of small multiples.",Julian Kreiser;Alexander Hann;Eugen Zizer;Timo Ropinski,Julian Kreiser;Alexander Hann;Eugen Zizer;Timo Ropinski,Visual Computing GroupUlm University;Department of Internal Medicine IUlm University;Department of Internal Medicine IUlm University;Visual Computing GroupUlm University,10.1109/INFVIS.2001.963292;10.1109/TVCG.2013.122;10.1109/INFVIS.2003.1249006,"Small multiples,manometry,chicago classification",1,0,29,
SciVis,2017,BASTet: Shareable and Reproducible Analysis and Visualization of Mass Spectrometry Imaging Data via OpenMSI,10.1109/TVCG.2017.2744479,http://dx.doi.org/10.1109/TVCG.2017.2744479,1025,1035,J,"Mass spectrometry imaging (MSI) is a transformative imaging method that supports the untargeted, quantitative measurement of the chemical composition and spatial heterogeneity of complex samples with broad applications in life sciences, bioenergy, and health. While MSI data can be routinely collected, its broad application is currently limited by the lack of easily accessible analysis methods that can process data of the size, volume, diversity, and complexity generated by MSI experiments. The development and application of cutting-edge analytical methods is a core driver in MSI research for new scientific discoveries, medical diagnostics, and commercial-innovation. However, the lack of means to share, apply, and reproduce analyses hinders the broad application, validation, and use of novel MSI analysis methods. To address this central challenge, we introduce the Berkeley Analysis and Storage Toolkit (BASTet), a novel framework for shareable and reproducible data analysis that supports standardized data and analysis interfaces, integrated data storage, data provenance, workflow management, and a broad set of integrated tools. Based on BASTet, we describe the extension of the OpenMSI mass spectrometry imaging science gateway to enable web-based sharing, reuse, analysis, and visualization of data analyses and derived data products. We demonstrate the application of BASTet and OpenMSI in practice to identify and compare characteristic substructures in the mouse brain based on their chemical composition measured via MSI.",Oliver Rübel;Benjamin P. Bowen,Oliver Rübel;Benjamin P. Bowen,Computational Research DivisionLawrence Berkeley National Laboratory (LBNL);Environmental Genomics & Systems Biology DivisionLBNL,10.1109/VISUAL.2005.1532788;10.1109/TVCG.2011.185;10.1109/TVCG.2015.2467091,"Mass spectrometry imaging,Data provenance,Visualization,Data management,Analysis Workflows,Data sharing",1,1,55,
VAST,2017,"The y of it Matters, Even for Storyline Visualization",10.1109/VAST.2017.8585487,http://dx.doi.org/10.1109/VAST.2017.8585487,81,91,C,"Storylines are adept at communicating complex change by encoding time on the x-axis and using the proximity of lines in the y direction to represent interaction between entities. The original definition of a storyline visualization requires data defined in terms of explicit interaction groups. Relaxing this definition allows storyline visualization to be applied more generally, but this creates questions about how the y-coordinate should encode interactions when this is tied to a particular place or state. To answer this question, we conducted a design study where we considered two layout algorithm design alternatives within a geo-temporal analysis tool written to solve part of the VAST Challenge 2014. We measured the performance of users at overview and detail oriented tasks between two storyline layout algorithms. To the best of our knowledge, this paper is the first work to question the design principles for storyline visualization, and what we found surprised us. For overview tasks with the alternative layout, which has a consistent encoding for the y-coordinate, users performed moderately better (p &lt;; .05) than the storyline layout based on existing design constraints and aesthetic criteria. Our empirical findings were also supported by first-hand accounts taken from interviews with multiple expert analysts, who suggested that the inconsistent meaning of the y-axis was misleading. These findings led us to design a new storyline layout algorithm that is a “best of both” where the y-axis has a consistent meaning but aesthetic criteria (e.g., line crossings) are considered.",Dustin Arendt;Meg Pirrung,Dustin Arendt;Meg Pirrung,Pacific Northwest National Laboratory;Pacific Northwest National Laboratory,10.1109/VAST.2009.5332593;10.1109/TVCG.2014.2346433;10.1109/TVCG.2013.196;10.1109/TVCG.2013.221;10.1109/TVCG.2012.212;10.1109/TVCG.2015.2468151,"Storyline visualization,layout algorithms,interaction context,geospatial analysis,VAST Challenge",1,1,38,
VAST,2017,Visual Causality Analysis Made Practical,10.1109/VAST.2017.8585647,http://dx.doi.org/10.1109/VAST.2017.8585647,151,161,C,"Deriving the exact casual model that governs the relations between variables in a multidimensional dataset is difficult in practice. It is because causal inference algorithms by themselves typically cannot encode an adequate amount of domain knowledge to break all ties. Visual analytic approaches are considered a feasible alternative to fully automated methods. However, their application in real-world scenarios can be tedious. This paper focuses on these practical aspects of visual causality analysis. The most imperative of these aspects is posed by Simpson' Paradox. It implies the existence of multiple causal models differing in both structure and parameter depending on how the data is subdivided. We propose a comprehensive interface that engages human experts in identifying these subdivisions and allowing them to establish the corresponding causal models via a rich set of interactive facilities. Other features of our interface include: (1) a new causal network visualization that emphasizes the flow of causal dependencies, (2) a model scoring mechanism with visual hints for interactive model refinement, and (3) flexible approaches for handling heterogeneous data. Various real-world data examples are given.",Jun Wang;Klaus Mueller,Jun Wang;Klaus Mueller,"Visual Analytics and Imaging Lab, Stony Brook University;Visual Analytics and Imaging Lab, Stony Brook University",10.1109/TVCG.2015.2467931;10.1109/TVCG.2012.225;10.1109/TVCG.2013.200;10.1109/TVCG.2016.2598797;10.1109/TVCG.2016.2598919;10.1109/TVCG.2016.2598543;10.1109/TVCG.2015.2467691,"Visual knowledge discovery,Causality,Hypothesis testing,Visual evidence,High-dimensional data",1,4,49,
InfoVis,2018,Optimizing Color Assignment for Perception of Class Separability in Multiclass Scatterplots,10.1109/TVCG.2018.2864912,http://dx.doi.org/10.1109/TVCG.2018.2864912,820,829,J,"Appropriate choice of colors significantly aids viewers in understanding the structures in multiclass scatterplots and becomes more important with a growing number of data points and groups. An appropriate color mapping is also an important parameter for the creation of an aesthetically pleasing scatterplot. Currently, users of visualization software routinely rely on color mappings that have been pre-defined by the software. A default color mapping, however, cannot ensure an optimal perceptual separability between groups, and sometimes may even lead to a misinterpretation of the data. In this paper, we present an effective approach for color assignment based on a set of given colors that is designed to optimize the perception of scatterplots. Our approach takes into account the spatial relationships, density, degree of overlap between point clusters, and also the background color. For this purpose, we use a genetic algorithm that is able to efficiently find good color assignments. We implemented an interactive color assignment system with three extensions of the basic method that incorporates top K suggestions, user-defined color subsets, and classes of interest for the optimization. To demonstrate the effectiveness of our assignment technique, we conducted a numerical study and a controlled user study to compare our approach with default color assignments; our findings were verified by two expert studies. The results show that our approach is able to support users in distinguishing cluster numbers faster and more precisely than default assignment methods.",Yunhai Wang;Xin Chen;Tong Ge;Chen Bao;Michael Sedlmair;Chi-Wing Fu;Oliver Deussen;Baoquan Chen,Yunhai Wang;Xin Chen;Tong Ge;Chen Bao;Michael Sedlmair;Chi-Wing Fu;Oliver Deussen;Baoquan Chen,"Shandong University;Shandong University;Shandong University;Shandong University;VISUS, University of Stuttgart, Germany;Chinese University, Hong Kong;Konstanz University, Germany;Peking University",10.1109/VISUAL.1995.480803;10.1109/TVCG.2016.2599214;10.1109/TVCG.2013.183;10.1109/TVCG.2016.2598918;10.1109/VISUAL.1996.568118;10.1109/TVCG.2017.2744184;10.1109/TVCG.2013.153;10.1109/TVCG.2015.2467471;10.1109/TVCG.2017.2744359;10.1109/VAST.2009.5332628;10.1109/TVCG.2008.118,"Color perception,visual design,scatterplots",1,7,50,
InfoVis,2018,Shape-preserving Star Coordinates,10.1109/TVCG.2018.2865118,http://dx.doi.org/10.1109/TVCG.2018.2865118,449,458,J,"Dimensionality reduction is commonly applied to multidimensional data to reduce the complexity of their analysis. In visual analysis systems, projections embed multidimensional data into 2D or 3D spaces for graphical representation. To facilitate a robust and accurate analysis, essential characteristics of the multidimensional data shall be preserved when projecting. Orthographic star coordinates is a state-of-the-art linear projection method that avoids distortion of multidimensional clusters by restricting interactive exploration to orthographic projections. However, existing numerical methods for computing orthographic star coordinates have a number of limitations when putting them into practice. We overcome these limitations by proposing the novel concept of shape-preserving star coordinates where shape preservation is assured using a superset of orthographic projections. Our scheme is explicit, exact, simple, fast, parameter-free, and stable. To maintain a valid shape-preserving star-coordinates configuration during user interaction with one of the star-coordinates axes, we derive an algorithm that only requires us to modify the configuration of one additional compensatory axis. Different design goals can be targeted by using different strategies for selecting the compensatory axis. We propose and discuss four strategies including a strategy that approximates orthographic star coordinates very well and a data-driven strategy. We further present shape-preserving morphing strategies between two shape-preserving configurations, which can be adapted for the generation of data tours. We apply our concept to multiple data analysis scenarios to document its applicability and validate its desired properties.",Vladimir Molchanov;Lars Linsen,Vladimir Molchanov;Lars Linsen,"Westfälische Wilhelms-Universität Münster, Germany;Westfälische Wilhelms-Universität Münster, Germany",10.1109/TVCG.2010.209;10.1109/TVCG.2013.182;10.1109/TVCG.2015.2467132;10.1109/TVCG.2015.2467324;10.1109/TVCG.2014.2346258,"Star coordinates,multidimensional data projection,multivariate data visualization",1,1,30,
InfoVis,2018,"Graphicle: Exploring Units, Networks, and Context in a Blended Visualization Approach",10.1109/TVCG.2018.2865151,http://dx.doi.org/10.1109/TVCG.2018.2865151,576,585,J,"Many real-world datasets are large, multivariate, and relational in nature and relevant associated decisions frequently require a simultaneous consideration of both attributes and connections. Existing visualization systems and approaches, however, often make an explicit trade-off between either affording rich exploration of individual data units and their attributes or exploration of the underlying network structure. In doing so, important analysis opportunities and insights are potentially missed. In this study, we aim to address this gap by (1) considering visualizations and interaction techniques that blend the spectrum between unit and network visualizations, (2) discussing the nature of different forms of contexts and the challenges in implementing them, and (3) demonstrating the value of our approach for visual exploration of multivariate, relational data for a real-world use case. Specifically, we demonstrate through a system called Graphicle how network structure can be layered on top of unit visualization techniques to create new opportunities for visual exploration of physician characteristics and referral data. We report on the design, implementation, and evaluation of the system and effectiveness of our blended approach.",Timothy Major;Rahul C. Basole,Timothy Major;Rahul C. Basole,Georgia Institute of Technology;Georgia Institute of Technology,10.1109/TVCG.2012.252;10.1109/INFVIS.2005.1532126;10.1109/TVCG.2007.70539;10.1109/TVCG.2007.70582;10.1109/TVCG.2014.2346292;10.1109/TVCG.2013.227;10.1109/TVCG.2006.166;10.1109/TVCG.2014.2346441;10.1109/TVCG.2009.108;10.1109/INFVIS.2003.1249004;10.1109/TVCG.2010.205;10.1109/TVCG.2007.70589;10.1109/VAST.2009.5333880;10.1109/TVCG.2013.167,"Unit visualization,network visualization,context",1,5,46,
InfoVis,2018,SmartCues: A Multitouch Query Approach for Details-on-Demand through Dynamically Computed Overlays,10.1109/TVCG.2018.2865231,http://dx.doi.org/10.1109/TVCG.2018.2865231,597,607,J,"Details-on-demand is a crucial feature in the visual information-seeking process but is often only implemented in highly constrained settings. The most common solution, hover queries (i.e., tooltips), are fast and expressive but are usually limited to single mark (e.g., a bar in a bar chart). `Queries' to retrieve details for more complex sets of objects (e.g., comparisons between pairs of elements, averages across multiple items, trend lines, etc.) are difficult for end-users to invoke explicitly. Further, the output of these queries require complex annotations and overlays which need to be displayed and dismissed on demand to avoid clutter. In this work we introduce SmartCues, a library to support details-on-demand through dynamically computed overlays. For end-users, SmartCues provides multitouch interactions to construct complex queries for a variety of details. For designers, SmartCues offers an interaction library that can be used out-of-the-box, and can be extended for new charts and detail types. We demonstrate how SmartCues can be implemented across a wide array of visualization types and, through a lab study, show that end users can effectively use SmartCues.",Hariharan Subramonyam;Eytan Adar,Hariharan Subramonyam;Eytan Adar,School of InformationUniversity of Michigan;School of InformationUniversity of Michigan,10.1109/INFVIS.1995.528688;10.1109/INFVIS.2005.1532136;10.1109/TVCG.2013.124;10.1109/TVCG.2006.187;10.1109/VAST.2010.5652885;10.1109/TVCG.2013.119;10.1109/VAST.2012.6400487;10.1109/TVCG.2014.2346250;10.1109/TVCG.2012.229;10.1109/TVCG.2008.109;10.1109/TVCG.2012.204;10.1109/TVCG.2010.179;10.1109/TVCG.2017.2745958;10.1109/TVCG.2007.70515,"Graphical overlays,details-on-demand,graph comprehension",1,0,73,
InfoVis,2018,Image-Based Aspect Ratio Selection,10.1109/TVCG.2018.2865266,http://dx.doi.org/10.1109/TVCG.2018.2865266,840,849,J,"Selecting a good aspect ratio is crucial for effective 2D diagrams. There are several aspect ratio selection methods for function plots and line charts, but only few can handle general, discrete diagrams such as 2D scatter plots. However, these methods either lack a perceptual foundation or heavily rely on intermediate isoline representations, which depend on choosing the right isovalues and are time-consuming to compute. This paper introduces a general image-based approach for selecting aspect ratios for a wide variety of 2D diagrams, ranging from scatter plots and density function plots to line charts. Our approach is derived from Federer's co-area formula and a line integral representation that enable us to directly construct image-based versions of existing selection methods using density fields. In contrast to previous methods, our approach bypasses isoline computation, so it is faster to compute, while following the perceptual foundation to select aspect ratios. Furthermore, this approach is complemented by an anisotropic kernel density estimation to construct density fields, allowing us to more faithfully characterize data patterns, such as the subgroups in scatterplots or dense regions in time series. We demonstrate the effectiveness of our approach by quantitatively comparing to previous methods and revisiting a prior user study. Finally, we present extensions for ROI banking, multi-scale banking, and the application to image data.",Yunhai Wang;Zeyu Wang 0005;Chi-Wing Fu;Hansjörg Schmauder;Oliver Deussen;Daniel Weiskopf,Yunhai Wang;Zeyu Wang;Chi-Wing Fu;Hansjörq Schmauder;Oliver Deussen;Daniel Weiskopf,"Shandong University;SIAT, Shenzhen VisuCA Key Lab, China;Chinese University of Hong Kong;VISUS, University of Stuttgart, Germany;Konstanz University, Germany;VISUS, University of Stuttgart, Germany",10.1109/TVCG.2008.119;10.1109/TVCG.2006.168;10.1109/TVCG.2013.187;10.1109/TVCG.2009.131;10.1109/TVCG.2010.146;10.1109/TVCG.2017.2744184;10.1109/TVCG.2006.168;10.1109/TVCG.2011.167;10.1109/TVCG.2012.196;10.1109/VAST.2009.5332628;10.1109/INFVIS.2005.1532142,"Aspect ratio,image-based method,Federer's co-area formula,density field,anisotropic kernel density estimation",1,1,42,
SciVis,2018,Robust and Fast Extraction of 3D Symmetric Tensor Field Topology,10.1109/TVCG.2018.2864768,http://dx.doi.org/10.1109/TVCG.2018.2864768,1102,1111,J,"3D symmetric tensor fields appear in many science and engineering fields, and topology-driven analysis is important in many of these application domains, such as solid mechanics and fluid dynamics. Degenerate curves and neutral surfaces are important topological features in 3D symmetric tensor fields. Existing methods to extract degenerate curves and neutral surfaces often miss parts of the curves and surfaces, respectively. Moreover, these methods are computationally expensive due to the lack of knowledge of structures of degenerate curves and neutral surfaces.&lt;;/p&gt; &lt;;p&gt;In this paper, we provide theoretical analysis on the geometric and topological structures of degenerate curves and neutral surfaces of 3D linear tensor fields. These structures lead to parameterizations for degenerate curves and neutral surfaces that can not only provide more robust extraction of these features but also incur less computational cost.&lt;;/p&gt; &lt;;p&gt;We demonstrate the benefits of our approach by applying our degenerate curve and neutral surface detection techniques to solid mechanics simulation data sets.",Lawrence Roy;Prashant Kumar;Yue Zhang 0009;Eugene Zhang,Lawrence Roy;Prashant Kumar;Yue Zhang;Eugene Zhang,Oregon State University;Oregon State University;Oregon State University;Oregon State University,10.1109/TVCG.2009.184;10.1109/VISUAL.1994.346326;10.1109/TVCG.2008.148;10.1109/VISUAL.2000.885716;10.1109/VISUAL.2004.105;10.1109/VISUAL.2005.1532841,"Tensor field visualization,3D symmetric tensor fields,tensor field topology,traceless tensors,degenerate curve extraction,neutral surface extraction",1,2,24,
SciVis,2018,Interactive 3D Visual Analysis of Atmospheric Fronts,10.1109/TVCG.2018.2864806,http://dx.doi.org/10.1109/TVCG.2018.2864806,1080,1090,J,"Atmospheric fronts play a central role in meteorology, as the boundaries between different air masses and as fundamental features of extra-tropical cyclones. They appear in numerous conceptual model depictions of extra-tropical weather systems. Conceptually, fronts are three-dimensional surfaces in space possessing an innate structural complexity, yet in meteorology, both manual and objective identification and depiction have historically focused on the structure in two dimensions. In this work, we -a team of visualization scientists and meteorologists-propose a novel visualization approach to analyze the three-dimensional structure of atmospheric fronts and related physical and dynamical processes. We build upon existing approaches to objectively identify fronts as lines in two dimensions and extend these to obtain frontal surfaces in three dimensions, using the magnitude of temperature change along the gradient of a moist potential temperature field as the primary identifying factor. We introduce the use of normal curves in the temperature gradient field to visualize a frontal zone (i.e., the transitional zone between the air masses) and the distribution of atmospheric variables in such zones. To enable for the first time a statistical analysis of frontal zones, we present a new approach to obtain the volume enclosed by a zone, by classifying grid boxes that intersect with normal curves emanating from a selected front. We introduce our method by means of an idealized numerical simulation and demonstrate its use with two real-world cases using numerical weather prediction data.",Michael Kern;Tim Hewson;Andreas Schäfler;Rüdiger Westermann;Marc Rautenhaus,Michael Kern;Tim Hewson;Andreas Schätler;Rüdiger Westermann;Marc Rautenhaus,"Computer Graphics & Visualization Group, Technische Universität München, Garching, Germany;European Centre for Medium-Range Weather Forecasts, Reading, UK;Deutsches Zentrum für Luft- und Raumfahrt (DLR), Germany;Computer Graphics & Visualization Group, Technische Universität München, Garching, Germany;Computer Graphics & Visualization Group, Technische Universität München, Garching, Germany",10.1109/TVCG.2017.2743989;10.1109/TVCG.2007.70554,"Meteorology,Atmospheric Fronts,Feature Detection",1,1,56,
SciVis,2018,Exploring Time-Varying Multivariate Volume Data Using Matrix of Isosurface Similarity Maps,10.1109/TVCG.2018.2864808,http://dx.doi.org/10.1109/TVCG.2018.2864808,1236,1245,J,"We present a novel visual representation and interface named the matrix of isosurface similarity maps (MISM) for effective exploration of large time-varying multivariate volumetric data sets. MISM synthesizes three types of similarity maps (i.e., self, temporal, and variable similarity maps) to capture the essential relationships among isosurfaces of different variables and time steps. Additionally, it serves as the main visual mapping and navigation tool for examining the vast number of isosurfaces and exploring the underlying time-varying multivariate data set. We present temporal clustering, variable grouping, and interactive filtering to reduce the huge exploration space of MISM. In conjunction with the isovalue and isosurface views, MISM allows users to identify important isosurfaces or isosurface pairs and compare them over space, time, and value range. More importantly, we introduce path recommendation that suggests, animates, and compares traversal paths for effectively exploring MISM under varied criteria and at different levels-of-detail. A silhouette-based method is applied to render multiple surfaces of interest in a visually succinct manner. We demonstrate the effectiveness of our approach with case studies of several time-varying multivariate data sets and an ensemble data set, and evaluate our work with two domain experts.",Jun Tao 0002;Martin Imre;Chaoli Wang 0001;Nitesh V. Chawla;Hanqi Guo 0001;Gokhan Sever;Seung Hyun Kim,Jun Tao;Martin Imre;Chaoli Wang;Nitesh V. Chawla;Hanqi Guo;Gökhan Sever;Seung Hyun Kim,University of Notre Dame;University of Notre Dame;University of Notre Dame;University of Notre Dame;Argonne National Laboratory;Argonne National Laboratory;The Ohio State University,10.1109/TVCG.2013.133;10.1109/TVCG.2012.284;10.1109/TVCG.2008.184;10.1109/TVCG.2011.246;10.1109/TVCG.2011.258;10.1109/TVCG.2008.116;10.1109/VISUAL.2005.1532857;10.1109/TVCG.2009.136;10.1109/TVCG.2015.2467431;10.1109/TVCG.2006.165;10.1109/TVCG.2013.213;10.1109/TVCG.2008.143;10.1109/VISUAL.1999.809910;10.1109/VISUAL.2005.1532792;10.1109/TVCG.2008.140;10.1109/TVCG.2006.164;10.1109/VISUAL.2003.1250402,"Time-varying multivariate data visualization,isosurface,similarity map,visual interface,path recommendation",1,3,41,
SciVis,2018,Interactive Visualization of 3D Histopathology in Native Resolution,10.1109/TVCG.2018.2864816,http://dx.doi.org/10.1109/TVCG.2018.2864816,1008,1017,J,"We present a visualization application that enables effective interactive visual analysis of large-scale 3D histopathology, that is, high-resolution 3D microscopy data of human tissue. Clinical work flows and research based on pathology have, until now, largely been dominated by 2D imaging. As we will show in the paper, studying volumetric histology data will open up novel and useful opportunities for both research and clinical practice. Our starting point is the current lack of appropriate visualization tools in histopathology, which has been a limiting factor in the uptake of digital pathology. Visualization of 3D histology data does pose difficult challenges in several aspects. The full-color datasets are dense and large in scale, on the order of 100,000 × 100,000 × 100 voxels. This entails serious demands on both rendering performance and user experience design. Despite this, our developed application supports interactive study of 3D histology datasets at native resolution. Our application is based on tailoring and tuning of existing methods, system integration work, as well as a careful study of domain specific demands emanating from a close participatory design process with domain experts as team members. Results from a user evaluation employing the tool demonstrate a strong agreement among the 14 participating pathologists that 3D histopathology will be a valuable and enabling tool for their work.",Martin Falk;Anders Ynnerman;Darren Treanor;Claes Lundström,Martin Falk;Anders Ynnerman;Darren Treanor;Claes Lundström,"Department of Science and Technology, Linköping University, Sweden;Department of Science and Technology, Linköping University, Sweden;Leeds Teaching Hospitals NHS Trust, United Kingdom;The Center for Medical Image Science and Visualization (CMIV), Linköping University, Sweden",10.1109/TVCG.2009.150;10.1109/VISUAL.2002.1183757;10.1109/TVCG.2012.240,"Histology,Pathology,Volume Rendering,Expert Evaluation",1,1,35,
SciVis,2018,Visual Analysis of Spatia-temporal Relations of Pairwise Attributes in Unsteady Flow,10.1109/TVCG.2018.2864817,http://dx.doi.org/10.1109/TVCG.2018.2864817,1246,1256,J,"Despite significant advances in the analysis and visualization of unsteady flow, the interpretation of it's behavior still remains a challenge. In this work, we focus on the linear correlation and non-linear dependency of different physical attributes of unsteady flows to aid their study from a new perspective. Specifically, we extend the existing spatial correlation quantification, i.e. the Local Correlation Coefficient (LCC), to the spatio-temporal domain to study the correlation of attribute-pairs from both the Eulerian and Lagrangian views. To study the dependency among attributes, which need not be linear, we extend and compute the mutual information (MI) among attributes over time. To help visualize and interpret the derived correlation and dependency among attributes associated with a particle, we encode the correlation and dependency values on individual pathlines. Finally, to utilize the correlation and MI computation results to identify regions with interesting flow behavior, we propose a segmentation strategy of the flow domain based on the ranking of the strength of the attributes relations. We have applied our correlation and dependency metrics to a number of 2D and 3D unsteady flows with varying spatio-temporal kernel sizes to demonstrate and assess their effectiveness.",Marzieh Berenjkoub;Rodolfo Ostilla Monico;Robert S. Laramee;Guoning Chen,Marzieh Berenjkoub;Rodolfo Ostilla Monico;Robert S. Laramee;Guoning Chen,University of Houston;University of Houston;Swansea University;University of Houston,10.1109/TVCG.2010.131;10.1109/VISUAL.2004.99;10.1109/TVCG.2010.198;10.1109/TVCG.2015.2467200;10.1109/TVCG.2009.200;10.1109/TVCG.2010.131;10.1109/TVCG.2013.133;10.1109/TVCG.2011.249,"Unsteady flow,correlation study,mutual information",1,4,63,
SciVis,2018,Hexahedral Mesh Structure Visualization and Evaluation,10.1109/TVCG.2018.2864827,http://dx.doi.org/10.1109/TVCG.2018.2864827,1173,1182,J,"Understanding hexahedral (hex-) mesh structures is important for a number of hex-mesh generation and optimization tasks. However, due to various configurations of the singularities in a valid pure hex-mesh, the structure (or base complex) of the mesh can be arbitrarily complex. In this work, we present a first and effective method to help meshing practitioners understand the possible configurations in a valid 3D base complex for the characterization of their complexity. In particular, we propose a strategy to decompose the complex hex-mesh structure into multi-level sub-structures so that they can be studied separately, from which we identify a small set of the sub-structures that can most efficiently represent the whole mesh structure. Furthermore, from this set of sub-structures, we attempt to define the first metric for the quantification of the complexity of hex-mesh structure. To aid the exploration of the extracted multi-level structure information, we devise a visual exploration system coupled with a matrix view to help alleviate the common challenge of 3D data exploration (e.g., clutter and occlusion). We have applied our tool and metric to a large number of hex-meshes generated with different approaches to reveal different characteristics of these methods in terms of the mesh structures they can produce. We also use our metric to assess the existing structure simplification techniques in terms of their effectiveness.",Kaoji Xu;Guoning Chen,Kaoji Xu;Guoning Chen,University of Houston;University of Houston,,"hexahedral mesh,base complex,sheet decomposition,complexity analysis",1,1,42,
SciVis,2018,Time-Dependent Flow seen through Approximate Observer Killing Fields,10.1109/TVCG.2018.2864839,http://dx.doi.org/10.1109/TVCG.2018.2864839,1257,1266,J,"Flow fields are usually visualized relative to a global observer, i.e., a single frame of reference. However, often no global frame can depict all flow features equally well. Likewise, objective criteria for detecting features such as vortices often use either a global reference frame, or compute a separate frame for each point in space and time. We propose the first general framework that enables choosing a smooth trade-off between these two extremes. Using global optimization to minimize specific differential geometric properties, we compute a time-dependent observer velocity field that describes the motion of a continuous field of observers adapted to the input flow. This requires developing the novel notion of an observed time derivative. While individual observers are restricted to rigid motions, overall we compute an approximate Killing field, corresponding to almost-rigid motion. This enables continuous transitions between different observers. Instead of focusing only on flow features, we furthermore develop a novel general notion of visualizing how all observers jointly perceive the input field. This in fact requires introducing the concept of an observation time, with respect to which a visualization is computed. We develop the corresponding notions of observed stream, path, streak, and time lines. For efficiency, these characteristic curves can be computed using standard approaches, by first transforming the input field accordingly. Finally, we prove that the input flow perceived by the observer field is objective. This makes derived flow features, such as vortices, objective as well.",Markus Hadwiger;Matej Mlejnek;Thomas Theußl;Peter Rautek,Markus Hadwiger;Matej Mlejnek;Thomas Theußl;Peter Rautek,"King Abdullah University of Science and Technology (KAUST), Visual Computing Center, Saudi Arabia;King Abdullah University of Science and Technology (KAUST), Visual Computing Center, Saudi Arabia;King Abdullah University of Science and Technology (KAUST), Core Labs, Saudi Arabia;King Abdullah University of Science and Technology (KAUST), Visual Computing Center, Saudi Arabia",10.1109/TVCG.2015.2467200;10.1109/VISUAL.1999.809896;10.1109/VISUAL.1997.663898;10.1109/TVCG.2008.163;10.1109/TVCG.2007.70545;10.1109/TVCG.2010.198;10.1109/TVCG.2007.70557,"Flow visualization,observer frames of reference,Killing vector fields,infinitesimal isometries,Lie derivatives,objectivity",1,5,52,
SciVis,2018,A Declarative Grammar of Flexible Volume Visualization Pipelines,10.1109/TVCG.2018.2864841,http://dx.doi.org/10.1109/TVCG.2018.2864841,1050,1059,J,"This paper presents a declarative grammar for conveniently and effectively specifying advanced volume visualizations. Existing methods for creating volume visualizations either lack the flexibility to specify sophisticated visualizations or are difficult to use for those unfamiliar with volume rendering implementation and parameterization. Our design provides the ability to quickly create expressive visualizations without knowledge of the volume rendering implementation. It attempts to capture aspects of those difficult but powerful methods while remaining flexible and easy to use. As a proof of concept, our current implementation of the grammar allows users to combine multiple data variables in various ways and define transfer functions for diverse input data. The grammar also has the ability to describe advanced shading effects and create animations. We demonstrate the power and flexibility of our approach using multiple practical volume visualizations.",Min Shih;Charles Rozhon;Kwan-Liu Ma,Min Shih;Charles Rozhon;Kwan-Liu Ma,"University of California, Davis;University of California, Davis;University of California, Davis",10.1109/VISUAL.2005.1532788;10.1109/TVCG.2009.174;10.1109/TVCG.2011.185;10.1109/TVCG.2007.70555;10.1109/TVCG.2014.2346322;10.1109/TVCG.2009.189;10.1109/TVCG.2015.2467449;10.1109/VISUAL.1992.235219;10.1109/VISUAL.2004.95;10.1109/TVCG.2007.70534;10.1109/TVCG.2014.2346318;10.1109/TVCG.2016.2599030;10.1109/TVCG.2015.2467091;10.1109/SciVis.2015.7429514;10.1109/TVCG.2016.2599041,"Volume visualization,direct volume rendering,declarative specification,multivariate/multimodal volume data,animation",1,1,41,
SciVis,2018,DT-MRI Streamsurfaces Revisited,10.1109/TVCG.2018.2864845,http://dx.doi.org/10.1109/TVCG.2018.2864845,1112,1121,J,"DT-MRI streamsurfaces, defined as surfaces that are everywhere tangential to the major and medium eigenvector fields, have been proposed as a tool for visualizing regions of predominantly planar behavior in diffusion tensor MRI. Even though it has long been known that their construction assumes that the involved eigenvector fields satisfy an integrability condition, it has never been tested systematically whether this condition is met in real-world data. We introduce a suitable and efficiently computable test to the visualization literature, demonstrate that it can be used to distinguish integrable from nonintegrable configurations in simulations, and apply it to whole-brain datasets of 15 healthy subjects. We conclude that streamsurface integrability is approximately satisfied in a substantial part of the brain, but not everywhere, including some regions of planarity. As a consequence, algorithms for streamsurface extraction should explicitly test local integrability. Finally, we propose a novel patch-based approach to streamsurface visualization that reduces visual artifacts, and is shown to more fully sample the extent of streamsurfaces.",Michael Ankele;Thomas Schultz 0001,Michael Ankele;Thomas Schultz,University of Bonn;University of Bonn,10.1109/TVCG.2007.70551;10.1109/VISUAL.1992.235211;10.1109/TVCG.2007.70554;10.1109/TVCG.2007.70602;10.1109/TVCG.2008.148,"Diffusion Tensor MRI,streamsurfaces,Frobenius theorem,Lie bracket",1,0,36,
SciVis,2018,CPU Isosurface Ray Tracing of Adaptive Mesh Refinement Data,10.1109/TVCG.2018.2864850,http://dx.doi.org/10.1109/TVCG.2018.2864850,1142,1151,J,"Adaptive mesh refinement (AMR) is a key technology for large-scale simulations that allows for adaptively changing the simulation mesh resolution, resulting in significant computational and storage savings. However, visualizing such AMR data poses a significant challenge due to the difficulties introduced by the hierarchical representation when reconstructing continuous field values. In this paper, we detail a comprehensive solution for interactive isosurface rendering of block-structured AMR data. We contribute a novel reconstruction strategy-the octant method-which is continuous, adaptive and simple to implement. Furthermore, we present a generally applicable hybrid implicit isosurface ray-tracing method, which provides better rendering quality and performance than the built-in sampling-based approach in OSPRay. Finally, we integrate our octant method and hybrid isosurface geometry into OSPRay as a module, providing the ability to create high-quality interactive visualizations combining volume and isosurface representations of BS-AMR data. We evaluate the rendering performance, memory consumption and quality of our method on two gigascale block-structured AMR datasets.",Feng Wang;Ingo Wald;Qi Wu;William Usher;Christopher R. Johnson 0001,Feng Wang;Ingo Wald;Qi Wu;Will Usher;Chris R. Johnson,"Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, UT;Intel Corporation;Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, UT;Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, UT;Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, UT",10.1109/TVCG.2008.157;10.1109/TVCG.2009.149;10.1109/TVCG.2011.252;10.1109/VISUAL.2002.1183820;10.1109/VISUAL.1998.745713;10.1109/TVCG.2007.70566;10.1109/TVCG.2016.2599041,"AMR,Isosurface,Ray tracing,Reconstruction strategy,OSPRay",1,2,46,
SciVis,2018,A Study of the Trade-off Between Reducing Precision and Reducing Resolution for Data Analysis and Visualization,10.1109/TVCG.2018.2864853,http://dx.doi.org/10.1109/TVCG.2018.2864853,1193,1203,J,"There currently exist two dominant strategies to reduce data sizes in analysis and visualization: reducing the precision of the data, e.g., through quantization, or reducing its resolution, e.g., by subsampling. Both have advantages and disadvantages and both face fundamental limits at which the reduced information ceases to be useful. The paper explores the additional gains that could be achieved by combining both strategies. In particular, we present a common framework that allows us to study the trade-off in reducing precision and/or resolution in a principled manner. We represent data reduction schemes as progressive streams of bits and study how various bit orderings such as by resolution, by precision, etc., impact the resulting approximation error across a variety of data sets as well as analysis tasks. Furthermore, we compute streams that are optimized for different tasks to serve as lower bounds on the achievable error. Scientific data management systems can use the results presented in this paper as guidance on how to store and stream data to make efficient use of the limited storage and bandwidth in practice.",Duong Hoang;Pavol Klacansky;Harsh Bhatia;Peer-Timo Bremer;Peter Lindstrom;Valerio Pascucci,Duong Hoang;Pavol Klacansky;Harsh Bhatia;Peer-Timo Bremer;Peter Lindstrom;Valerio Pascucci,"SCI Institute, University of Utah, USA;SCI Institute, University of Utah, USA;Lawrence Livemore National Laboratory, USA;Lawrence Livemore National Laboratory, USA;Lawrence Livemore National Laboratory, USA;SCI Institute, University of Utah, USA",10.1109/TVCG.2009.194;10.1109/TVCG.2007.70516;10.1109/VISUAL.2002.1183757;10.1109/TVCG.2012.240;10.1109/VISUAL.1999.809908;10.1109/TVCG.2014.2346458;10.1109/TVCG.2006.143;10.1109/VISUAL.2004.51;10.1109/VISUAL.2003.1250385;10.1109/TVCG.2011.214;10.1109/TVCG.2012.274;10.1109/TVCG.2015.2467412,"data compression,bit ordering,multi-resolution,data analysis",1,1,70,
SciVis,2018,Firefly: Virtual Illumination Drones for Interactive Visualization,10.1109/TVCG.2018.2864656,http://dx.doi.org/10.1109/TVCG.2018.2864656,1204,1213,J,"Light specification in three dimensional scenes is a complex problem and several approaches have been presented that aim to automate this process. However, there are many scenarios where a static light setup is insufficient, as the scene content and camera position may change. Simultaneous manual control over the camera and light position imposes a high cognitive load on the user. To address this challenge, we introduce a novel approach for automatic scene illumination with Fireflies. Fireflies are intelligent virtual light drones that illuminate the scene by traveling on a closed path. The Firefly path automatically adapts to changes in the scene based on an outcome-oriented energy function. To achieve interactive performance, we employ a parallel rendering pipeline for the light path evaluations. We provide a catalog of energy functions for various application scenarios and discuss the applicability of our method on several examples.",Sergej Stoppel;Magnus Paulson Erga;Stefan Bruckner,Sergej Stoppel;Magnus Paulson Erga;Stefan Bruckner,"University of Bergen, Norway;University of Bergen, Norway;University of Bergen, Norway",10.1109/TVCG.2012.203;10.1109/TVCG.2013.156;10.1109/VISUAL.2002.1183785;10.1109/VISUAL.2003.1250395;10.1109/VISUAL.2004.62;10.1109/TVCG.2011.173;10.1109/TVCG.2013.172,"Dynamic lighting design,lighting drones",1,1,47,HM
VAST,2018,A Visual Analytics Framework for Spatiotemporal Trade Network Analysis,10.1109/TVCG.2018.2864844,http://dx.doi.org/10.1109/TVCG.2018.2864844,331,341,J,"Economic globalization is increasing connectedness among regions of the world, creating complex interdependencies within various supply chains. Recent studies have indicated that changes and disruptions within such networks can serve as indicators for increased risks of violence and armed conflicts. This is especially true of countries that may not be able to compete for scarce commodities during supply shocks. Thus, network-induced vulnerability to supply disruption is typically exported from wealthier populations to disadvantaged populations. As such, researchers and stakeholders concerned with supply chains, political science, environmental studies, etc. need tools to explore the complex dynamics within global trade networks and how the structure of these networks relates to regional instability. However, the multivariate, spatiotemporal nature of the network structure creates a bottleneck in the extraction and analysis of correlations and anomalies for exploratory data analysis and hypothesis generation. Working closely with experts in political science and sustainability, we have developed a highly coordinated, multi-view framework that utilizes anomaly detection, network analytics, and spatiotemporal visualization methods for exploring the relationship between global trade networks and regional instability. Requirements for analysis and initial research questions to be investigated are elicited from domain experts, and a variety of visual encoding techniques for rapid assessment of analysis and correlations between trade goods, network patterns, and time series signatures are explored. We demonstrate the application of our framework through case studies focusing on armed conflicts in Africa, regional instability measures, and their relationship to international global trade.",Hong Wang;Yafeng Lu;Shade T. Shutters;Michael Steptoe;Feng Wang 0012;Steven Landis;Ross Maciejewski,Hong Wang;Yafeng Lu;Shade T. Shutters;Michael Steptoe;Feng Wang;Steven Landis;Ross Maciejewski,Arizona State University;Arizona State University;Arizona State University;Arizona State University;GE Global Research;University of Nevada;Arizona State University,10.1109/VAST.2008.4677356;10.1109/TVCG.2011.202;10.1109/VAST.2012.6400557;10.1109/TVCG.2008.135;10.1109/VAST.2012.6400485;10.1109/TVCG.2014.2346682;10.1109/TVCG.2009.143;10.1109/TVCG.2014.2346271;10.1109/TVCG.2015.2467991;10.1109/VAST.2012.6400491;10.1109/INFVIS.1996.559226;10.1109/INFVIS.2005.1532150;10.1109/TVCG.2016.2598885,"Global trade network,anomaly detection,visual analytics",1,2,82,
VAST,2018,Lessons Learned Developing a Visual Analytics Solution for Investigative Analysis of Scamming Activities,10.1109/TVCG.2018.2865023,http://dx.doi.org/10.1109/TVCG.2018.2865023,225,234,J,"The forensic investigation of communication datasets which contain unstructured text, social network information, and metadata is a complex task that is becoming more important due to the immense amount of data being collected. Currently there are limited approaches that allow an investigator to explore the network, text and metadata in a unified manner. We developed Beagle as a forensic tool for email datasets that allows investigators to flexibly form complex queries in order to discover important information in email data. Beagle was successfully deployed at a security firm which had a large email dataset that was difficult to properly investigate. We discuss our experience developing Beagle as well as the lessons we learned applying visual analytic techniques to a difficult real-world problem.",Jay Koven;Cristian Felix;Hossein Siadati;Markus Jakobsson;Enrico Bertini,Jay Koven;Cristian Felix;Hossein Siadati;Markus Jakobsson;Enrico Bertini,NYU Tandon School of Engineering;NYU Tandon School of Engineering;NYU Tandon School of Engineering;Amber Solutions Inc.;NYU Tandon School of Engineering,10.1109/VAST.2007.4389011;10.1109/VAST.2010.5652968;10.1109/INFVIS.2003.1249028;10.1109/TVCG.2009.111;10.1109/TVCG.2014.2346481;10.1109/TVCG.2012.213,"Visual Analytics,Email Investigation,Email Forensics",1,0,26,
VAST,2018,Enhancing Web-based Analytics Applications through Provenance,10.1109/TVCG.2018.2865039,http://dx.doi.org/10.1109/TVCG.2018.2865039,131,141,J,"Visual analytics systems continue to integrate new technologies and leverage modern environments for exploration and collaboration, making tools and techniques available to a wide audience through web browsers. Many of these systems have been developed with rich interactions, offering users the opportunity to examine details and explore hypotheses that have not been directly encoded by a designer. Understanding is enhanced when users can replay and revisit the steps in the sensemaking process, and in collaborative settings, it is especially important to be able to review not only the current state but also what decisions were made along the way. Unfortunately, many web-based systems lack the ability to capture such reasoning, and the path to a result is transient, forgotten when a user moves to a new view. This paper explores the requirements to augment existing client-side web applications with support for capturing, reviewing, sharing, and reusing steps in the reasoning process. Furthermore, it considers situations where decisions are made with streaming data, and the insights gained from revisiting those choices when more data is available. It presents a proof of concept, the Shareable Interactive Manipulation Provenance framework (SIMProv.js), that addresses these requirements in a modern, client-side JavaScript library, and describes how it can be integrated with existing frameworks.",Akhilesh Camisetty;Chaitanya Chandurkar;Maoyuan Sun;David Koop,Akhilesh Camisetty;Chaitanya Chandurkar;Maoyuan Sun;David Koop,UMass Dartmouth;UMass Dartmouth;UMass Dartmouth;UMass Dartmouth,10.1109/VISUAL.1993.398857;10.1109/VAST.2011.6102447;10.1109/VAST.2010.5652932;10.1109/TVCG.2016.2598471;10.1109/TVCG.2016.2599058;10.1109/VAST.2008.4677365;10.1109/TVCG.2013.197;10.1109/VAST.2007.4389011;10.1109/VISUAL.1999.809871;10.1109/TVCG.2014.2346573;10.1109/TVCG.2015.2467551;10.1109/TVCG.2015.2467191;10.1109/TVCG.2017.2745279,"Collaboration,provenance,streaming data,history,web",1,1,60,
VAST,2018,The Effect of Semantic Interaction on Foraging in Text Analysis,10.1109/VAST.2018.8802424,http://dx.doi.org/10.1109/VAST.2018.8802424,13,24,C,"Completing text analysis tasks is a continuous sensemaking loop of foraging for information and incrementally synthesizing it into hypotheses. Past research has shown the advantages of using spatial workspaces as a means for synthesizing information through externalizing hypotheses and creating spatial schemas. However, spatializing the entirety of datasets becomes prohibitive as the number of documents available to the analysts grows, particularly when only a small subset are relevant to the task at hand. StarSPIRE is a visual analytics tool designed to explore collections of documents, leveraging users' semantic interactions to steer (1) a synthesis model that aids in document layout, and (2) a foraging model to automatically retrieve new relevant information. In contrast to traditional keyword search foraging (KSF), “semantic interaction foraging” (SIF) occurs as a result of the user's synthesis actions. To quantify the value of semantic interaction foraging, we use StarSPIRE to evaluate its utility for an intelligence analysis sensemaking task. Semantic interaction foraging accounted for 26% of useful documents found, and it also resulted in increased synthesis interactions and improved sensemaking task performance by users in comparison to only using keyword search.",John E. Wenskovitch;Lauren Bradel;Michelle Dowling;Leanna House;Chris North 0001,John Wenskovitch;Lauren Bradel;Michelle Dowling;Leanna House;Chris North,Virginia Tech Computer Science;Department of Defense;Virginia Tech Computer Science;Virginia Tech Statistics;Virginia Tech Computer Science,10.1109/TVCG.2006.120;10.1109/VAST.2012.6400559;10.1109/TVCG.2013.205;10.1109/VAST.2008.4677362;10.1109/VAST.2014.7042492;10.1109/VAST.2012.6400486;10.1109/TVCG.2012.260;10.1109/VAST.2011.6102449;10.1109/INFVIS.2005.1532126;10.1109/INFVIS.1995.528686;10.1109/INFVIS.2004.37,"Human-centered computing,Visualization,Empirical studies in visualization,Human-centered computing,Visualization,Visual analytics",1,3,0,
InfoVis,2019,A Deep Generative Model for Graph Layout,10.1109/TVCG.2019.2934396,http://dx.doi.org/10.1109/TVCG.2019.2934396,665,675,J,"Different layouts can characterize different aspects of the same graph. Finding a “good” layout of a graph is thus an important task for graph visualization. In practice, users often visualize a graph in multiple layouts by using different methods and varying parameter settings until they find a layout that best suits the purpose of the visualization. However, this trial-and-error process is often haphazard and time-consuming. To provide users with an intuitive way to navigate the layout design space, we present a technique to systematically visualize a graph in diverse layouts using deep generative models. We design an encoder-decoder architecture to learn a model from a collection of example layouts, where the encoder represents training examples in a latent space and the decoder produces layouts from the latent space. In particular, we train the model to construct a two-dimensional latent space for users to easily explore and generate various layouts. We demonstrate our approach through quantitative and qualitative evaluations of the generated layouts. The results of our evaluations show that our model is capable of learning and generalizing abstract concepts of graph layouts, not just memorizing the training examples. In summary, this paper presents a fundamentally new approach to graph visualization where a machine learning model learns to visualize a graph from examples without manually-defined heuristics.",Oh-Hyun Kwon;Kwan-Liu Ma,Oh-Hyun Kwon;Kwan-Liu Ma,"University of California, Davis;University of California, Davis","10.1109/TVCG.2014.2346277,10.1109/TVCG.2017.2743858,10.1109/TVCG.2015.2467451,10.1109/TVCG.2007.70580,10.1109/TVCG.2018.2865139,10.1109/TVCG.2011.185","Graph,network,visualization,layout,machine learning,deep learning,neural network,generative model,autoencoder",1,4,87,
InfoVis,2019,An Incremental Dimensionality Reduction Method for Visualizing Streaming Multidimensional Data,10.1109/TVCG.2019.2934433,http://dx.doi.org/10.1109/TVCG.2019.2934433,418,428,J,"Dimensionality reduction (DR) methods are commonly used for analyzing and visualizing multidimensional data. However, when data is a live streaming feed, conventional DR methods cannot be directly used because of their computational complexity and inability to preserve the projected data positions at previous time points. In addition, the problem becomes even more challenging when the dynamic data records have a varying number of dimensions as often found in real-world applications. This paper presents an incremental DR solution. We enhance an existing incremental PCA method in several ways to ensure its usability for visualizing streaming multidimensional data. First, we use geometric transformation and animation methods to help preserve a viewer's mental map when visualizing the incremental results. Second, to handle data dimension variants, we use an optimization method to estimate the projected data positions, and also convey the resulting uncertainty in the visualization. We demonstrate the effectiveness of our design with two case studies using real-world datasets.",Takanori Fujiwara;Jia-Kai Chou;Shilpika;Panpan Xu;Ren Liu;Kwan-Liu Ma,Takanori Fujiwara;Jia-Kai Chou;Shilpika Shilpika;Panpan Xu;Liu Ren;Kwan-Liu Ma,"University of California, Davis;University of California, Davis;University of California, Davis;Bosch Research North America;Bosch Research North America;University of California, Davis","10.1109/TVCG.2015.2467851,10.1109/TVCG.2013.186,10.1109/TVCG.2017.2744419,10.1109/TVCG.2017.2744318,10.1109/TVCG.2015.2467553,10.1109/TVCG.2014.2346578,10.1109/TVCG.2016.2598838,10.1109/TVCG.2016.2598495,10.1109/TVCG.2014.2346574,10.1109/TVCG.2016.2598470,10.1109/TVCG.2015.2468078,10.1109/INFVIS.2003.1249004,10.1109/INFVIS.2004.60,10.1109/TVCG.2016.2598664","Dimensionality reduction,principal component analysis,streaming data,uncertainty,visual analytics",1,3,73,
InfoVis,2019,Critical Reflections on Visualization Authoring Systems,10.1109/TVCG.2019.2934281,http://dx.doi.org/10.1109/TVCG.2019.2934281,461,471,J,"An emerging generation of visualization authoring systems support expressive information visualization without textual programming. As they vary in their visualization models, system architectures, and user interfaces, it is challenging to directly compare these systems using traditional evaluative methods. Recognizing the value of contextualizing our decisions in the broader design space, we present critical reflections on three systems we developed —Lyra, Data Illustrator, and Charticulator. This paper surfaces knowledge that would have been daunting within the constituent papers of these three systems. We compare and contrast their (previously unmentioned) limitations and trade-offs between expressivity and learnability. We also reflect on common assumptions that we made during the development of our systems, thereby informing future research directions in visualization authoring systems.",Arvind Satyanarayan;Bongshin Lee;Donghao Ren;Jeffrey Heer;John T. Stasko;John Thompson 0002;Matthew Brehmer;Zhicheng Liu,Arvind Satyanarayan;Bongshin Lee;Donghao Ren;Jeffrey Heer;John Stasko;John Thompson;Matthew Brehmer;Zhicheng Liu,"Massachusetts Institute of Technology;Microsoft Research;University of California, Santa Barbara;University of Washington;Georgia Institute of Technology;Georgia Institute of Technology;Microsoft Research;Adobe Research","10.1109/TVCG.2016.2598609,10.1109/TVCG.2009.174,10.1109/TVCG.2011.185,10.1109/TVCG.2016.2598620,10.1109/TVCG.2014.2346291,10.1109/TVCG.2018.2865158,10.1109/TVCG.2015.2467271,10.1109/TVCG.2016.2599030,10.1109/TVCG.2015.2467091,10.1109/INFVIS.2000.885086,10.1109/TVCG.2015.2467191","Critical reflection,visualization authoring,expressivity,learnability,reusability",1,6,50,
InfoVis,2019,Visualizing a Moving Target: A Design Study on Task Parallel Programs in the Presence of Evolving Data and Concerns,10.1109/TVCG.2019.2934285,http://dx.doi.org/10.1109/TVCG.2019.2934285,1118,1128,J,"Common pitfalls in visualization projects include lack of data availability and the domain users' needs and focus changing too rapidly for the design process to complete. While it is often prudent to avoid such projects, we argue it can be beneficial to engage them in some cases as the visualization process can help refine data collection, solving a “chicken and egg” problem of having the data and tools to analyze it. We found this to be the case in the domain of task parallel computing where such data and tooling is an open area of research. Despite these hurdles, we conducted a design study. Through a tightly-coupled iterative design process, we built Atria, a multi-view execution graph visualization to support performance analysis. Atria simplifies the initial representation of the execution graph by aggregating nodes as related to their line of code. We deployed Atria on multiple platforms, some requiring design alteration. We describe how we adapted the design study methodology to the “moving target” of both the data and the domain experts' concerns and how this movement kept both the visualization and programming project healthy. We reflect on our process and discuss what factors allow the project to be successful in the presence of changing data and user needs.",Katy Williams;Alex Bigelow;Katherine E. Isaacs,Katy Williams;Alex Bigelow;Kate Isaacs,University of Arizona;University of Arizona;University of Arizona,"10.1109/TVCG.2011.185,10.1109/TVCG.2013.124,10.1109/INFVIS.2004.1,10.1109/TVCG.2015.2467452,10.1109/INFVIS.2003.1249009,10.1109/TVCG.2017.2744319,10.1109/TVCG.2018.2865149,10.1109/INFVIS.2002.1173148,10.1109/TVCG.2012.213,10.1109/TVCG.2014.2346323,10.1109/TVCG.2018.2865076","design studies,software visualization,parallel computing,graph visualization",1,5,64,
SciVis,2019,DeepOrganNet: On-the-Fly Reconstruction and Visualization of 3D / 4D Lung Models from Single-View Projections by Deep Deformation Network,10.1109/TVCG.2019.2934369,http://dx.doi.org/10.1109/TVCG.2019.2934369,960,970,J,"This paper introduces a deep neural network based method, i.e., DeepOrganNet, to generate and visualize fully high-fidelity 3D / 4D organ geometric models from single-view medical images with complicated background in real time. Traditional 3D / 4D medical image reconstruction requires near hundreds of projections, which cost insufferable computational time and deliver undesirable high imaging / radiation dose to human subjects. Moreover, it always needs further notorious processes to segment or extract the accurate 3D organ models subsequently. The computational time and imaging dose can be reduced by decreasing the number of projections, but the reconstructed image quality is degraded accordingly. To our knowledge, there is no method directly and explicitly reconstructing multiple 3D organ meshes from a single 2D medical grayscale image on the fly. Given single-view 2D medical images, e.g., 3D / 4D-CT projections or X-ray images, our end-to-end DeepOrganNet framework can efficiently and effectively reconstruct 3D / 4D lung models with a variety of geometric shapes by learning the smooth deformation fields from multiple templates based on a trivariate tensor-product deformation technique, leveraging an informative latent descriptor extracted from input 2D images. The proposed method can guarantee to generate high-quality and high-fidelity manifold meshes for 3D / 4D lung models; while, all current deep learning based approaches on the shape reconstruction from a single image cannot. The major contributions of this work are to accurately reconstruct the 3D organ shapes from 2D single-view projection, significantly improve the procedure time to allow on-the-fly visualization, and dramatically reduce the imaging dose for human subjects. Experimental results are evaluated and compared with the traditional reconstruction method and the state-of-the-art in deep learning, by using extensive 3D and 4D examples, including both synthetic phantom and real patient datasets. The efficiency of the proposed method shows that it only needs several milliseconds to generate organ meshes with 10K vertices, which has great potential to be used in real-time image guided radiation therapy (IGRT).",Yifan Wang;Zichun Zhong;Jing Hua,Yifan Wang;Zichun Zhong;Jing Hua,"Department of Computer Science, Wayne State University, Detroit, MI;Department of Computer Science, Wayne State University, Detroit, MI;Department of Computer Science, Wayne State University, Detroit, MI",10.1109/TVCG.2013.159,"Deep deformation network,organ meshes,3D / 4D shapes,2D projections,single-view",1,2,54,
SciVis,2019,Progressive Wasserstein Barycenters of Persistence Diagrams,10.1109/TVCG.2019.2934256,http://dx.doi.org/10.1109/TVCG.2019.2934256,151,161,J,"This paper presents an efficient algorithm for the progressive approximation of Wasserstein barycenters of persistence diagrams, with applications to the visual analysis of ensemble data. Given a set of scalar fields, our approach enables the computation of a persistence diagram which is representative of the set, and which visually conveys the number, data ranges and saliences of the main features of interest found in the set. Such representative diagrams are obtained by computing explicitly the discrete Wasserstein barycenter of the set of persistence diagrams, a notoriously computationally intensive task. In particular, we revisit efficient algorithms for Wasserstein distance approximation [12], [51] to extend previous work on barycenter estimation [94]. We present a new fast algorithm, which progressively approximates the barycenter by iteratively increasing the computation accuracy as well as the number of persistent features in the output diagram. Such a progressivity drastically improves convergence in practice and allows to design an interruptible algorithm, capable of respecting computation time constraints. This enables the approximation of Wasserstein barycenters within interactive times. We present an application to ensemble clustering where we revisit the $k$-means algorithm to exploit our barycenters and compute, within execution time constraints, meaningful clusters of ensemble data along with their barycenter diagram. Extensive experiments on synthetic and real-life data sets report that our algorithm converges to barycenters that are qualitatively meaningful with regard to the applications, and quantitatively comparable to previous techniques, while offering an order of magnitude speedup when run until convergence (without time constraint). Our algorithm can be trivially parallelized to provide additional speedups in practice on standard workstations. We provide a lightweight C++ implementation of our approach that can be used to reproduce our results.",Jules Vidal;Joseph Budin;Julien Tierny,Jules Vidal;Joseph Budin;Julien Tierny,Sorbonne UniversitéCNRS (LIP6);Sorbonne UniversitéCNRS (LIP6);Sorbonne UniversitéCNRS (LIP6),"10.1109/TVCG.2013.208,10.1109/TVCG.2018.2864505,10.1109/TVCG.2015.2467958,10.1109/TVCG.2018.2864432,10.1109/TVCG.2015.2467204,10.1109/TVCG.2014.2346403,10.1109/TVCG.2018.2864848,10.1109/TVCG.2008.110,10.1109/TVCG.2015.2467432,10.1109/TVCG.2013.141,10.1109/TVCG.2011.249,10.1109/TVCG.2006.186,10.1109/TVCG.2014.2346455,10.1109/TVCG.2018.2864768,10.1109/TVCG.2010.181,10.1109/TVCG.2012.249,10.1109/TVCG.2013.148,10.1109/TVCG.2014.2346332,10.1109/TVCG.2009.163,10.1109/TVCG.2013.143","Topological data analysis,scalar data,ensemble data",1,1,96,HM
VAST,2019,explAIner: A Visual Analytics Framework for Interactive and Explainable Machine Learning,10.1109/TVCG.2019.2934629,http://dx.doi.org/10.1109/TVCG.2019.2934629,1064,1074,J,"We propose a framework for interactive and explainable machine learning that enables users to (1) understand machine learning models; (2) diagnose model limitations using different explainable AI methods; as well as (3) refine and optimize the models. Our framework combines an iterative XAI pipeline with eight global monitoring and steering mechanisms, including quality monitoring, provenance tracking, model comparison, and trust building. To operationalize the framework, we present explAIner, a visual analytics system for interactive and explainable machine learning that instantiates all phases of the suggested pipeline within the commonly used TensorBoard environment. We performed a user-study with nine participants across different expertise levels to examine their perception of our workflow and to collect suggestions to fill the gap between our system and framework. The evaluation confirms that our tightly integrated system leads to an informed machine learning process while disclosing opportunities for further extensions.",Thilo Spinner;Udo Schlegel;Hanna Schäfer;Mennatallah El-Assady,Thilo Spinner;Udo Schlegel;Hanna Schäfer;Mennatallah El-Assady,University of Konstanz;University of Konstanz;University of Konstanz;University of Konstanz,"10.1109/TVCG.2017.2744683,10.1109/TVCG.2019.2934654,10.1109/TVCG.2017.2745080,10.1109/TVCG.2018.2864769,10.1109/TVCG.2017.2744718,10.1109/VAST.2017.8585720,10.1109/VAST.2018.8802509,10.1109/TVCG.2017.2744938,10.1109/TVCG.2016.2598831,10.1109/TVCG.2018.2864812,10.1109/TVCG.2017.2744358,10.1109/TVCG.2016.2598838,10.1109/TVCG.2014.2346481,10.1109/TVCG.2018.2864838,10.1109/TVCG.2018.2865044,10.1109/TVCG.2017.2744158,10.1109/TVCG.2018.2864504,10.1109/TVCG.2017.2744878,10.1109/TVCG.2018.2864499,10.1109/TVCG.2018.2864475","Explainable AI,Interactive Machine Learning,Deep Learning,Visual Analytics,Interpretability,Explainability",1,8,85,
VAST,2019,Exploranative Code Quality Documents,10.1109/TVCG.2019.2934669,http://dx.doi.org/10.1109/TVCG.2019.2934669,1129,1139,J,"Good code quality is a prerequisite for efficiently developing maintainable software. In this paper, we present a novel approach to generate exploranative (explanatory and exploratory) data-driven documents that report code quality in an interactive, exploratory environment. We employ a template-based natural language generation method to create textual explanations about the code quality, dependent on data from software metrics. The interactive document is enriched by different kinds of visualization, including parallel coordinates plots and scatterplots for data exploration and graphics embedded into text. We devise an interaction model that allows users to explore code quality with consistent linking between text and visualizations; through integrated explanatory text, users are taught background knowledge about code quality aspects. Our approach to interactive documents was developed in a design study process that included software engineering and visual analytics experts. Although the solution is specific to the software engineering scenario, we discuss how the concept could generalize to multivariate data and report lessons learned in a broader scope.",Haris Mumtaz;Shahid Latif;Fabian Beck 0001;Daniel Weiskopf,Haris Mumtaz;Shahid Latif;Fabian Beck;Daniel Weiskopf,"VISUS, University of Stuttgart, Germany;Paluno, University of Duisburg-Essen, Germany;Paluno, University of Duisburg-Essen, Germany;VISUS, University of Stuttgart, Germany","10.1109/TVCG.2014.2346435,10.1109/TVCG.2018.2865022,10.1109/TVCG.2018.2865145","Code quality,interactive documents,natural language generation,sparklines",1,0,64,
VAST,2019,FairSight: Visual Analytics for Fairness in Decision Making,10.1109/TVCG.2019.2934262,http://dx.doi.org/10.1109/TVCG.2019.2934262,1086,1095,J,"Data-driven decision making related to individuals has become increasingly pervasive, but the issue concerning the potential discrimination has been raised by recent studies. In response, researchers have made efforts to propose and implement fairness measures and algorithms, but those efforts have not been translated to the real-world practice of data-driven decision making. As such, there is still an urgent need to create a viable tool to facilitate fair decision making. We propose FairSight, a visual analytic system to address this need; it is designed to achieve different notions of fairness in ranking decisions through identifying the required actions – understanding, measuring, diagnosing and mitigating biases – that together lead to fairer decision making. Through a case study and user study, we demonstrate that the proposed visual analytic and diagnostic modules in the system are effective in understanding the fairness-aware decision pipeline and obtaining more fair outcomes.",Yongsu Ahn;Yu-Ru Lin,Yongsu Ahn;Yu-Ru Lin,University of Pittsburgh;University of Pittsburgh,"10.1109/VAST.2015.7347637,10.1109/TVCG.2018.2864812,10.1109/TVCG.2018.2864499","Fairness in Machine Learning,Visual Analytic",1,3,42,
VAST,2019,FAIRVIS: Visual Analytics for Discovering Intersectional Bias in Machine Learning,10.1109/VAST47406.2019.8986948,http://dx.doi.org/10.1109/VAST47406.2019.8986948,46,56,C,"The growing capability and accessibility of machine learning has led to its application to many real-world domains and data about people. Despite the benefits algorithmic systems may bring, models can reflect, inject, or exacerbate implicit and explicit societal biases into their outputs, disadvantaging certain demographic subgroups. Discovering which biases a machine learning model has introduced is a great challenge, due to the numerous definitions of fairness and the large number of potentially impacted subgroups. We present FAIRVIS, a mixed-initiative visual analytics system that integrates a novel subgroup discovery technique for users to audit the fairness of machine learning models. Through FAIRVIS, users can apply domain knowledge to generate and investigate known subgroups, and explore suggested and similar subgroups. FAIRVIS's coordinated views enable users to explore a high-level overview of subgroup performance and subsequently drill down into detailed investigation of specific subgroups. We show how FAIRVIS helps to discover biases in two real datasets used in predicting income and recidivism. As a visual analytics system devoted to discovering bias in machine learning, FAIRVIS demonstrates how interactive visualization may help data scientists and the general public understand and create more equitable algorithmic systems.",Ángel Alexander Cabrera;Will Epperson;Fred Hohman;Minsuk Kahng;Jamie Morgenstern;Duen Horng Chau,Ángel Alexander Cabrera;Will Epperson;Fred Hohman;Minsuk Kahng;Jamie Morgenstern;Duen Horng Chau,Georgia Institute of Technology;Georgia Institute of Technology;Georgia Institute of Technology;Georgia Institute of Technology;Georgia Institute of Technology;Georgia Institute of Technology,"10.1109/TVCG.2017.2744718,10.1109/VAST.2017.8585720,10.1109/TVCG.2016.2598828,10.1109/TVCG.2018.2865044","Machine learning fairness,visual analytics,intersectional bias,subgroup discovery",1,4,38,
VAST,2019,GPGPU Linear Complexity t-SNE Optimization,10.1109/TVCG.2019.2934307,http://dx.doi.org/10.1109/TVCG.2019.2934307,1172,1181,J,"In recent years the t-distributed Stochastic Neighbor Embedding (t-SNE) algorithm has become one of the most used and insightful techniques for exploratory data analysis of high-dimensional data. It reveals clusters of high-dimensional data points at different scales while only requiring minimal tuning of its parameters. However, the computational complexity of the algorithm limits its application to relatively small datasets. To address this problem, several evolutions of t-SNE have been developed in recent years, mainly focusing on the scalability of the similarity computations between data points. However, these contributions are insufficient to achieve interactive rates when visualizing the evolution of the t-SNE embedding for large datasets. In this work, we present a novel approach to the minimization of the t-SNE objective function that heavily relies on graphics hardware and has linear computational complexity. Our technique decreases the computational cost of running t-SNE on datasets by orders of magnitude and retains or improves on the accuracy of past approximated techniques. We propose to approximate the repulsive forces between data points by splatting kernel textures for each data point. This approximation allows us to reformulate the t-SNE minimization problem as a series of tensor operations that can be efficiently executed on the graphics card. An efficient implementation of our technique is integrated and available for use in the widely used Google TensorFlow.js, and an open-source C++ library.",Nicola Pezzotti;Julian Thijssen;Alexander Mordvintsev;Thomas Höllt;Baldur van Lew;Boudewijn P. F. Lelieveldt;Elmar Eisemann;Anna Vilanova,Nicola Pezzotti;Julian Thijssen;Alexander Mordvintsev;Thomas Höllt;Baldur Van Lew;Boudewijn P.F. Lelieveldt;Elmar Eisemann;Anna Vilanova,"Google AI, Zürich, Switzerland;Delft University of Technology, Delft, The Netherlands;Google AI, Zürich, Switzerland;Delft University of Technology, Delft, The Netherlands;Leiden University Medical Center, Leiden, The Netherlands;Delft University of Technology, Delft, The Netherlands;Delft University of Technology, Delft, The Netherlands;Delft University of Technology, Delft, The Netherlands","10.1109/TVCG.2017.2744318,10.1109/TVCG.2017.2744718,10.1109/TVCG.2017.2745141,10.1109/TVCG.2017.2744358,10.1109/TVCG.2014.2346574","High Dimensional Data,Dimensionality Reduction,Progressive Visual Analytics,Approximate Computation,GPGPU",1,3,45,
VAST,2019,Influence Flowers of Academic Entities,10.1109/VAST47406.2019.8986934,http://dx.doi.org/10.1109/VAST47406.2019.8986934,1,10,C,"We present the Influence Flower, a new visual metaphor for the influence profile of academic entities, including people, projects, institutions, conferences, and journals. While many tools quantify influence, we aim to expose the flow of influence between entities. The Influence Flower is an ego-centric graph, with a query entity placed in the centre. The petals are styled to reflect the strength of influence to and from other entities of the same or different type. For example, one can break down the incoming and outgoing influences of a research lab by research topics. The Influence Flower uses a recent snapshot of Microsoft Academic Graph, consisting of 212 million authors, their 176 million publications, and 1.2 billion citations. An interactive web app, Influence Map, is constructed around this central metaphor for searching and curating visualisations. We also propose a visual comparison method that highlights change in influence patterns over time. We demonstrate through several case studies that the Influence Flower supports data-driven inquiries about the following: researchers' careers over time; paper(s) and projects, including those with delayed recognition; the interdisciplinary profile of a research institution; and the shifting topical trends in conferences. We also use this tool on influence data beyond academic citations, by contrasting the academic and Twitter activities of a researcher.",Minjeong Shin;Alexander Soen;Benjamin T. Readshaw;Stephen M. Blackburn;Mitchell Whitelaw;Lexing Xie,Minjeong Shin;Alexander Soen;Benjamin T. Readshaw;Stephen M. Blackburn;Mitchell Whitelaw;Lexing Xie,Australian National University;Australian National University;Australian National University;Australian National University;Australian National University;Australian National University,"10.1109/TVCG.2011.185,10.1109/TVCG.2012.252,10.1109/TVCG.2018.2865022,10.1109/VAST.2015.7347632,10.1109/TVCG.2015.2468151","Human-centered computing,Visualization,Visualisation application domains,Visual analytics,Visualization systems and tools,Empirical studies in visualization",1,0,44,
VAST,2019,Selection Bias Tracking and Detailed Subset Comparison for High-Dimensional Data,10.1109/TVCG.2019.2934209,http://dx.doi.org/10.1109/TVCG.2019.2934209,429,439,J,"The collection of large, complex datasets has become common across a wide variety of domains. Visual analytics tools increasingly play a key role in exploring and answering complex questions about these large datasets. However, many visualizations are not designed to concurrently visualize the large number of dimensions present in complex datasets (e.g. tens of thousands of distinct codes in an electronic health record system). This fact, combined with the ability of many visual analytics systems to enable rapid, ad-hoc specification of groups, or cohorts, of individuals based on a small subset of visualized dimensions, leads to the possibility of introducing selection bias–when the user creates a cohort based on a specified set of dimensions, differences across many other unseen dimensions may also be introduced. These unintended side effects may result in the cohort no longer being representative of the larger population intended to be studied, which can negatively affect the validity of subsequent analyses. We present techniques for selection bias tracking and visualization that can be incorporated into high-dimensional exploratory visual analytics systems, with a focus on medical data with existing data hierarchies. These techniques include: (1) tree-based cohort provenance and visualization, including a user-specified baseline cohort that all other cohorts are compared against, and visual encoding of cohort “drift”, which indicates where selection bias may have occurred, and (2) a set of visualizations, including a novel icicle-plot based visualization, to compare in detail the per-dimension differences between the baseline and a user-specified focus cohort. These techniques are integrated into a medical temporal event sequence visual analytics tool. We present example use cases and report findings from domain expert user interviews.",David Borland;Wenyuan Wang;Jonathan Zhang;Joshua Shrestha;David Gotz,David Borland;Wenyuan Wang;Jonathan Zhang;Joshua Shrestha;David Gotz,"RENCI, University of North Carolina, Chapel Hill;School of Information and Library Science, University of North Carolina, Chapel Hill;Dept. of Biostatistics, University of North Carolina, Chapel Hill;Dept. of Computer Science, University of North Carolina, Chapel Hill;School of Information and Library Science, University of North Carolina, Chapel Hill","10.1109/VAST.2011.6102439,10.1109/VAST.2017.8585665,10.1109/TVCG.2014.2346433,10.1109/TVCG.2016.2598469,10.1109/TVCG.2014.2346682,10.1109/TVCG.2019.2934661,10.1109/TVCG.2007.70568,10.1109/VISUAL.1991.175815,10.1109/VISUAL.2003.1250401,10.1109/TVCG.2018.2865265,10.1109/TVCG.2017.2745140,10.1109/TVCG.2007.70529,10.1109/TVCG.2017.2744138,10.1109/TVCG.2012.238","High-dimensional visualization,visual analytics,cohort selection,medical informatics,selection bias",1,4,57,
VAST,2019,Summit: Scaling Deep Learning Interpretability by Visualizing Activation and Attribution Summarizations,10.1109/TVCG.2019.2934659,http://dx.doi.org/10.1109/TVCG.2019.2934659,1096,1106,J,"Deep learning is increasingly used in decision-making tasks. However, understanding how neural networks produce final predictions remains a fundamental challenge. Existing work on interpreting neural network predictions for images often focuses on explaining predictions for single images or neurons. As predictions are often computed from millions of weights that are optimized over millions of images, such explanations can easily miss a bigger picture. We present Summit, an interactive system that scalably and systematically summarizes and visualizes what features a deep learning model has learned and how those features interact to make predictions. Summit introduces two new scalable summarization techniques: (1) activation aggregation discovers important neurons, and (2) neuron-influence aggregation identifies relationships among such neurons. Summit combines these techniques to create the novel attribution graph that reveals and summarizes crucial neuron associations and substructures that contribute to a model's outcomes. Summit scales to large data, such as the ImageNet dataset with 1.2M images, and leverages neural network feature visualization and dataset examples to help users distill large, complex neural network models into compact, interactive visualizations. We present neural network exploration scenarios where Summit helps us discover multiple surprising insights into a prevalent, large-scale image classifier's learned representations and informs future neural network architecture design. The Summit visualization runs in modern web browsers and is open-sourced.",Fred Hohman;Haekyu Park;Caleb Robinson;Duen Horng Chau,Fred Hohman;Haekyu Park;Caleb Robinson;Duen Horng Polo Chau,Georgia Tech.;Georgia Tech.;Georgia Tech.;Georgia Tech.,"10.1109/TVCG.2017.2744683,10.1109/TVCG.2017.2744718,10.1109/TVCG.2018.2864500,10.1109/VAST.2018.8802509,10.1109/TVCG.2016.2598831,10.1109/TVCG.2016.2598828,10.1109/TVCG.2009.108,10.1109/TVCG.2017.2744878","Deep learning interpretability,visual analytics,scalable summarization,attribution graph",1,8,61,
VAST,2019,The What-If Tool: Interactive Probing of Machine Learning Models,10.1109/TVCG.2019.2934619,http://dx.doi.org/10.1109/TVCG.2019.2934619,56,65,J,"A key challenge in developing and deploying Machine Learning (ML) systems is understanding their performance across a wide range of inputs. To address this challenge, we created the What-If Tool, an open-source application that allows practitioners to probe, visualize, and analyze ML systems, with minimal coding. The What-If Tool lets practitioners test performance in hypothetical situations, analyze the importance of different data features, and visualize model behavior across multiple models and subsets of input data. It also lets practitioners measure systems according to multiple ML fairness metrics. We describe the design of the tool, and report on real-life usage at different organizations.",James Wexler;Mahima Pushkarna;Tolga Bolukbasi;Martin Wattenberg;Fernanda B. Viégas;Jimbo Wilson,James Wexler;Mahima Pushkarna;Tolga Bolukbasi;Martin Wattenberg;Fernanda Viégas;Jimbo Wilson,Google Research;Google Research;Google Research;Google Research;Google Research;Google Research,"10.1109/VAST.2017.8585720,10.1109/TVCG.2016.2598831,10.1109/TVCG.2018.2864499,10.1109/TVCG.2018.2864475","Interactive Machine Learning,Model Debugging,Model Comparison",1,11,34,
VAST,2019,Understanding the Role of Alternatives in Data Analysis Practices,10.1109/TVCG.2019.2934593,http://dx.doi.org/10.1109/TVCG.2019.2934593,66,76,J,"Data workers are people who perform data analysis activities as a part of their daily work but do not formally identify as data scientists. They come from various domains and often need to explore diverse sets of hypotheses and theories, a variety of data sources, algorithms, methods, tools, and visual designs. Taken together, we call these alternatives. To better understand and characterize the role of alternatives in their analyses, we conducted semi-structured interviews with 12 data workers with different types of expertise. We conducted four types of analyses to understand 1) why data workers explore alternatives; 2) the different notions of alternatives and how they fit into the sensemaking process; 3) the high-level processes around alternatives; and 4) their strategies to generate, explore, and manage those alternatives. We find that participants' diverse levels of domain and computational expertise, experience with different tools, and collaboration within their broader context play an important role in how they explore these alternatives. These findings call out the need for more attention towards a deeper understanding of alternatives and the need for better tools to facilitate the exploration, interpretation, and management of alternatives. Drawing upon these analyses and findings, we present a framework based on participants' 1) degree of attention, 2) abstraction level, and 3) analytic processes. We show how this framework can help understand how data workers consider such alternatives in their analyses and how tool designers might create tools to better support them.",Jiali Liu;Nadia Boukhelifa;James R. Eagan,Jiali Liu;Nadia Boukhelifa;James R. Eagan,LTCITélécom ParisInstitut Polytechnique de Paris;INRAUniversité Paris-Saclay;LTCITélécom ParisInstitut Polytechnique de Paris,"10.1109/TVCG.2012.219,10.1109/VAST.2011.6102438,10.1109/TVCG.2018.2864836","alternatives,data workers,data analysis,data science,sensemaking,qualitative study",1,1,49,
VAST,2019,VIANA: Visual Interactive Annotation of Argumentation,10.1109/VAST47406.2019.8986917,http://dx.doi.org/10.1109/VAST47406.2019.8986917,11,22,C,"Argumentation Mining addresses the challenging tasks of identifying boundaries of argumentative text fragments and extracting their relationships. Fully automated solutions do not reach satisfactory accuracy due to their insufficient incorporation of semantics and domain knowledge. Therefore, experts currently rely on time-consuming manual annotations. In this paper, we present a visual analytics system that augments the manual annotation process by automatically suggesting which text fragments to annotate next. The accuracy of those suggestions is improved over time by incorporating linguistic knowledge and language modeling to learn a measure of argument similarity from user interactions. Based on a long-term collaboration with domain experts, we identify and model five high-level analysis tasks. We enable close reading and note-taking, annotation of arguments, argument reconstruction, extraction of argument relations, and exploration of argument graphs. To avoid context switches, we transition between all views through seamless morphing, visually anchoring all text- and graph-based layers. We evaluate our system with a two-stage expert user study based on a corpus of presidential debates. The results show that experts prefer our system over existing solutions due to the speedup provided by the automatic suggestions and the tight integration between text and graph views.",Fabian Sperrle;Rita Sevastjanova;Rebecca Kehlbeck;Mennatallah El-Assady,Fabian Sperrle;Rita Sevastjanova;Rebecca Kehlbeck;Mennatallah El-Assady,University of Konstanz;University of Konstanz;University of Konstanz;University of Konstanz,"10.1109/VAST.2012.6400485,10.1109/TVCG.2006.156,10.1109/TVCG.2019.2934654,10.1109/TVCG.2017.2745080,10.1109/TVCG.2018.2864769,10.1109/TVCG.2015.2467531,10.1109/TVCG.2007.70539,10.1109/TVCG.2008.127,10.1109/TVCG.2014.2346677,10.1109/TVCG.2015.2467759","Argumentation annotation,machine learning,user interaction,layered interfaces,semantic transitions",1,0,73,
VAST,2019,Visual Analysis of High-Dimensional Event Sequence Data via Dynamic Hierarchical Aggregation,10.1109/TVCG.2019.2934661,http://dx.doi.org/10.1109/TVCG.2019.2934661,440,450,J,"Temporal event data are collected across a broad range of domains, and a variety of visual analytics techniques have been developed to empower analysts working with this form of data. These techniques generally display aggregate statistics computed over sets of event sequences that share common patterns. Such techniques are often hindered, however, by the high-dimensionality of many real-world event sequence datasets which can prevent effective aggregation. A common coping strategy for this challenge is to group event types together prior to visualization, as a pre-process, so that each group can be represented within an analysis as a single event type. However, computing these event groupings as a pre-process also places significant constraints on the analysis. This paper presents a new visual analytics approach for dynamic hierarchical dimension aggregation. The approach leverages a predefined hierarchy of dimensions to computationally quantify the informativeness, with respect to a measure of interest, of alternative levels of grouping within the hierarchy at runtime. This information is then interactively visualized, enabling users to dynamically explore the hierarchy to select the most appropriate level of grouping to use at any individual step within an analysis. Key contributions include an algorithm for interactively determining the most informative set of event groupings for a specific analysis context, and a scented scatter-plus-focus visualization design with an optimization-based layout algorithm that supports interactive hierarchical exploration of alternative event type groupings. We apply these techniques to high-dimensional event sequence data from the medical domain and report findings from domain expert interviews.",David Gotz;Jonathan Zhang;Wenyuan Wang;Joshua Shrestha;David Borland,David Gotz;Jonathan Zhang;Wenyuan Wang;Joshua Shrestha;David Borland,"School of Information and Library Science, University of North Carolina, Chapel Hill;Dept. of Biostatistics, University of North Carolina, Chapel Hill;School of Information and Library Science, University of North Carolina, Chapel Hill;Dept. of Computer Science, University of North Carolina, Chapel Hill;RENCI, University of North Carolina, Chapel Hill","10.1109/TVCG.2019.2934209,10.1109/TVCG.2017.2745278,10.1109/TVCG.2014.2346433,10.1109/VAST.2016.7883512,10.1109/TVCG.2014.2346682,10.1109/TVCG.2017.2745320,10.1109/TVCG.2018.2864886,10.1109/TVCG.2013.200,10.1109/VAST.2011.6102443,10.1109/INFVIS.2005.1532152,10.1109/INFVIS.2000.885091,10.1109/TVCG.2017.2744686,10.1109/TVCG.2009.108,10.1109/TVCG.2007.70589,10.1109/VAST.2014.7042487,10.1109/TVCG.2012.238","Temporal event sequence visualization,visual analytics,hierarchical aggregation,medical informatics",1,3,62,
VAST,2019,Visual Interaction with Deep Learning Models through Collaborative Semantic Inference,10.1109/TVCG.2019.2934595,http://dx.doi.org/10.1109/TVCG.2019.2934595,884,894,J,"Automation of tasks can have critical consequences when humans lose agency over decision processes. Deep learning models are particularly susceptible since current black-box approaches lack explainable reasoning. We argue that both the visual interface and model structure of deep learning systems need to take into account interaction design. We propose a framework of collaborative semantic inference (CSI) for the co-design of interactions and models to enable visual collaboration between humans and algorithms. The approach exposes the intermediate reasoning process of models which allows semantic interactions with the visual metaphors of a problem, which means that a user can both understand and control parts of the model reasoning process. We demonstrate the feasibility of CSI with a co-designed case study of a document summarization system.",Sebastian Gehrmann;Hendrik Strobelt;Robert Krüger;Hanspeter Pfister;Alexander M. Rush,Sebastian Gehrmann;Hendrik Strobelt;Robert Krüger;Hanspeter Pfister;Alexander M. Rush,Harvard NLP group;IBM Research Cambridge;Harvard Visual Computing group;Harvard Visual Computing group;Harvard NLP group,"10.1109/TVCG.2012.195,10.1109/TVCG.2017.2744718,10.1109/VAST.2017.8585720,10.1109/TVCG.2018.2865027,10.1109/TVCG.2018.2865230,10.1109/VAST.2017.8585721,10.1109/TVCG.2017.2744358,10.1109/TVCG.2018.2864838,10.1109/TVCG.2014.2346574,10.1109/TVCG.2018.2865044,10.1109/TVCG.2017.2744158,10.1109/VISUAL.2005.1532820,10.1109/TVCG.2017.2744878,10.1109/TVCG.2018.2864499","Human-Computer Collaboration,Deep Learning,Neural Networks,Interaction Design,Human-Centered Design",1,3,92,
Vis,1990,Interdisciplinary visualization: lessons learned at NCSA,10.0000/00000002,http://dl.acm.org/citation.cfm?id=949606&CFID=522724143&CFTOKEN=98665846,457,457,M,,Donna J. Cox,Donna J. Cox,,,,0,,,
Vis,1990,A numerical method for rendering spherical reflections,10.1109/VISUAL.1990.146393,http://dx.doi.org/10.1109/VISUAL.1990.146393,289,"297, 483-4",C,"Methods of rendering reflections in curved surfaces are examined. A numerical algorithm to derive spherical reflections is presented. This algorithm has many attractive qualities, such as low computation costs, object space coherence, device and resolution independence, and generation of maximum information about reflections in curved surfaces. The authors demonstrate that rendering reflections is a difficult problem, as it defies analytic solutions. The authors indicate several alternatives for generalizing this method to a broader domain.&lt;&lt;ETX&gt;&gt;",David P. Dobkin;E. S. Panduranga;M. Zhu,D. Dobkin;E.S. Panduranga;M. Zhu,"Dept. of Comput. Sci., Princeton Univ., NJ, USA",,,0,0,15,
Vis,1990,Personal visualization system: applications in research and engineering,10.1109/VISUAL.1990.146418,http://dx.doi.org/10.1109/VISUAL.1990.146418,443,"448, 490-1",C,"The authors describe an innovative personal visualization system and its application to several research and engineering problems. The system bridges both hardware and software components to permit a user to graphically describe a visualization problem to the computer; thereby reducing program development time to a few hours. Low-cost visualization is achieved using PC-based software that can either be executed on a PC or drive graphic workstations for high-resolution displays. In either case, supercomputer computation rates are available for the visualization process. On PCs this is done with one or more PiP plug in cards, each of which is capable of 100 million floating point operations per second. On workstations this is done with the QUEN array processor. Applications mentioned include: ocean wave imaging; characterizing superconductors; and solar sail visualization.&lt;&lt;ETX&gt;&gt;",Quentin E. Dolecek;K. Moorjani;B. F. Kim;D. G. Tilley;Thomas S. Denney Jr.,Q.E. Dolecek;K. Moorjani;B.F. Kim;D.G. Tilley;T.S. Denney,"Appl. Phys. Lab., Johns Hopkins Univ., Laurel, MD, USA;Appl. Phys. Lab., Johns Hopkins Univ., Laurel, MD, USA;Appl. Phys. Lab., Johns Hopkins Univ., Laurel, MD, USA;Appl. Phys. Lab., Johns Hopkins Univ., Laurel, MD, USA;Appl. Phys. Lab., Johns Hopkins Univ., Laurel, MD, USA",,,0,0,9,
Vis,1991,How shall we connect our software tools?,10.1109/VISUAL.1991.175816,http://dx.doi.org/10.1109/VISUAL.1991.175816,292,296,C,"Software tools are traditionally connected using human-readable files, an approach that buys flexibility and understandability at some cost in performance relative to binary file formats. The possibility of using shared-memory functions to retain most of the existing style while leapfrogging the speed of reading binary files, at least in some environments and for some applications, is explored. Results of a benchmarking experiment confirm the benefits of this alternative.&lt;&lt;ETX&gt;&gt;",Eric Grosse,E. Grosse,"AT&T Bell Lab., Murray Hill, NJ, USA",,,0,0,4,
Vis,1991,Visualizing chemical kinetics in fractal domains,10.1109/VISUAL.1991.175831,http://dx.doi.org/10.1109/VISUAL.1991.175831,364,"367, 434",C,"Chemical reactions occurring within complex domains, such as fractals, can display behavior which differs radically from the expectation of classical chemical kinetics. Rather than relaxing to a uniform distribution at the steady state, these nonclassical systems display large-scale order on many scales. Such self-organization is difficult to measure using the usual statistical techniques, but is visually apparent. The authors discuss some of the problems of visualizing chemical kinetics in fractal domains and describe evolution of the visualization as the chemist and visualization scientist collaborated.&lt;&lt;ETX&gt;&gt;",Neal E. Hurlburt;Lola W. Anacker;Raoul Kopelman,N.E. Hurlburt;L.W. Anacker;R. Kopelman,"Lockheed Palo Alto Res. Lab., CA, USA",,,0,0,2,
Vis,1991,Multidimensional real time visualization on personal computers,10.1109/VISUAL.1991.175832,http://dx.doi.org/10.1109/VISUAL.1991.175832,368,371,C,"A low-cost, high-performance visualization tool based on the IBM PC is described. Characteristics of scientific and engineering visualization and requirements for real time analysis are discussed. Application programming without coding by use of flowgraphs is also presented.&lt;&lt;ETX&gt;&gt;",Quentin E. Dolecek,Q.E. Dolecek,"Johns Hopkins Univ., Laurel, MD, USA",,,0,0,0,
Vis,1992,Visualization requirements in the atmospheric and environmental sciences (five case study reports),10.1109/VISUAL.1992.235175,http://dx.doi.org/10.1109/VISUAL.1992.235175,428,435,C,"Reports from five research centers involved with atmospheric and environmental visualization issues are presented in this case study. Visualization with heterogeneous computer architectures is highlighted in the US EPA Scientific Visualization Center discussion. The NASA Marshall Space Flight Center effort to develop the multidimensional analysis of sensor systems (MASS) environment is presented. Florida State University's building of a new scientific visualization package, Sci An, is reported. This is followed by a discussion of the design and implementation of VIS-AD, an experimental laboratory for developing scientific algorithms, at the University of Wisconsin-Madison. The visualization of global atmospheric data at IBM Thomas J. Watson Research Center is highlighted.&lt;&lt;ETX&gt;&gt;",Theresa-Marie Rhyne;Mark Bolstad;Penny Rheingans;Lynne Petterson;Walter Shackelford;Mike E. Botts;E. Pepke;K. W. Johnson;William L. Hibbard;Charles R. Dyer;Brian E. Paul;Lloyd Treinish,T. Rhyne;B. Paul;L.A. Treinish;M. Bolstad;P. Rheingans;L. Petterson;W. Shackelford;M.E. Botts;E. Pepke;K.W. Johnson;W. Hibbard;C.R. Dyer,,10.1109/VISUAL.1992.235215,,0,0,2,
Vis,1992,Visualizing seafloor structures with satellite gravity measurements,10.1109/VISUAL.1992.235176,http://dx.doi.org/10.1109/VISUAL.1992.235176,424,427,C,"The relationship between gravity and topography to study subseafloor structures is discussed. Specifically, analysis of the dynamics of seafloor spreading using satellite altimetry is described. The visualization of satellite altimetry data and the limitations of such applications are presented.&lt;&lt;ETX&gt;&gt;",J. McLeod;C. Small,J. McLeod;C. Small,"San Diego Supercomput. Center, CA, USA",,,0,0,11,
Vis,1992,Visualization of neutron scattering data using AVS,10.1109/VISUAL.1992.235180,http://dx.doi.org/10.1109/VISUAL.1992.235180,398,403,C,"This case study is a result of a six-week feasibility exercise, the aim of which was to explore the extend to which existing visualization software can be used for visualizing ISIS neutron scattering data. ISIS is an experimental facility devoted to the use of pulsed neutrons and muons to investigate the microscopic structure and dynamics of all classes of condensed matter. The feasibility study demonstrated the benefits of using visualization in exploring material science data, and also proved that it is possible to satisfy most of the requirements ISIS researchers place on a software environment by using application visualization systems (AVSs), and without writing any new code. The problems encountered and possible solutions are discussed.&lt;&lt;ETX&gt;&gt;",R. Popovic,R. Popovic,"Rutherford Appleton Lab., Didcot, UK",10.1109/VISUAL.1991.175830,,0,0,5,
Vis,1993,Visualization of acoustic lens data,10.1109/VISUAL.1993.398884,http://dx.doi.org/10.1109/VISUAL.1993.398884,316,323,C,"3-dimensional data visualization from any input source involves the study and understanding of several steps. These steps include data acquisition, signal processing, image processing and image generation. Using a forward-looking high frequency sonar system (which focuses sound much like the eye focuses light), standard and non-standard data processing algorithms, and industry ""standard"" visualization algorithms, this project produced accurate 3-dimensional representations of several underwater objects.&lt;&lt;ETX&gt;&gt;",A. J. Bladek,A.J. Bladek,"Appl. Phys. Lab., Washington Univ., Seattle, WA, USA",10.1109/VISUAL.1991.175784,,0,0,21,
Vis,1993,Fanal: A relational analysis and visualization package for high energy physics,10.1109/VISUAL.1993.398897,http://dx.doi.org/10.1109/VISUAL.1993.398897,382,385,C,"The package described in this paper has been designed for analyzing the data collected in the LEP experiment ALEPH. Its main graphical feature is a deep interplay between the description of the objects manipulated and their relationships, and their graphical representation. The easy access to information through navigation between objects and its display makes possible a thorough study of the events produced by the detector. This has proved to be very powerful in numerous occasions for analyzing data and testing programs. The package provides as well statistical analysis tools and a graphic editor. It is based on the PHIGS graphics standard. It will develop towards a more elaborate usage of the data structure in particular in the geometrical representations and towards object oriented languages to overcome some heaviness linked to the use of Fortran.&lt;&lt;ETX&gt;&gt;",H. Videau;P. Mora de Freitas,H. Videau;P. Mora de Freitas,"Ecole Polytech., CNRS, France;Ecole Polytech., CNRS, France",,,0,0,4,
Vis,1993,Non conventional methods for the visualization of events from high energy physics,10.1109/VISUAL.1993.398898,http://dx.doi.org/10.1109/VISUAL.1993.398898,386,390,C,"Visualization of events in high energy physics is an important tool to check hard- and software and to generate pictures for presentation purposes. The radial pattern of all events suggests the use of predefined projections, especially p/Z and Y/X. The representation can be improved by a ""fish-eye"" transformation and by angular projections, which produce straight track patterns and allow extensive magnifications. Three dimensional data of radial structure are best displayed in the 3D V-Plot, which has optimal track separation and presents all relevant information in a clear way.&lt;&lt;ETX&gt;&gt;",Hans Drevermann;D. Kuhm;B. Nilsson,H. Drevermann;D. Kuhn;B.S. Nilsson,"CERN, Geneva, Switzerland;CERN, Geneva, Switzerland",,,0,0,5,
InfoVis,1995,Case study. A WWW viewpoint on scientific visualization: an EPA case study for technology transfer,10.1109/INFVIS.1995.528694,http://dx.doi.org/10.1109/INFVIS.1995.528694,112,114,C,"The paper examines how to provide scientific visualization capabilities to environmental scientists, policy analysts and decision makers with personal computers (PCs) on their desktops. An approach for using the World Wide Web (WWW) for disseminating knowledge on scientific visualization and for intelligent access to visualization capabilities on high performance (UNIX) workstations is outlined.",Theresa-Marie Rhyne,T.M. Rhyne,"Lockheed Martin, Research Triangle Park, NC, USA",10.1109/VISUAL.1993.398874,,0,0,8,
Vis,1995,Propositional n-traces: visualizing a problem in philosophical logic,10.1109/VISUAL.1995.485147,http://dx.doi.org/10.1109/VISUAL.1995.485147,338,"341, 470",C,"As part of an inter-disciplinary effort, we are visually exploring a current problem in philosophical logic related to information processing. Given a set of inconsistent sentences or inputs, a processor cannot unambiguously infer any specific consequence. Traces represent subsets of possible consequences which can be inferred classically from partitions of the set of inputs. We are interested in the relationship between a given set of Boolean inputs and its respective trace(s). We have developed a visualization paradigm which allows us to view and explore this relationship effectively.",Nathalie Prevost;Ray E. Jennings;Loki Jörgenson;F. David Fracchia,N. Prevost;R.E. Jennings;L. Jorgenson;F.D. Fracchia,"Dept. of Philos., Simon Fraser Univ., Burnaby, BC, Canada;Dept. of Philos., Simon Fraser Univ., Burnaby, BC, Canada",10.1109/VISUAL.1993.398863,,0,0,4,
Vis,1995,Pictorial statistics-visualization of high-dimensional statistical distributions,10.1109/VISUAL.1995.485149,http://dx.doi.org/10.1109/VISUAL.1995.485149,346,349,C,"A general framework for visualization of statistical properties of high-dimensional pattern samples and the related computational steps are introduced. These procedures are exemplified on applications in anthropometrical research (shape information in faces) but can be easily generalized to various other morphometrical questions and data sets with pattern structure, e.g., data stemming from sensor arrays. Presently, the visualization techniques illustrated concentrate on (higher) moments of first order. It is suggested, how moments of second order can be visualized by animations and how this approach can be used in the context of comparative visualization.",Andreas A. Müller,A.A. Muller,"IWSP, Gottingen Univ., Germany",,,0,0,6,
Vis,1996,Real-time Accelerators for Volume Rendering,10.1109/VISUAL.1996.568160,http://dx.doi.org/10.1109/VISUAL.1996.568160,445,447,M,,Hanspeter Pfister;Günter Knittel;Jürgen Hesser;John C. Goble,A. Kaufman;H. Pfister;G. Knittel;J. Hesser;J.C. Goble,SUNY at Stony Brook,,,0,1,12,
Vis,1997,"Terascale Visualization: Approaches, Pitfalls And Issues",10.1109/VISUAL.1997.663932,http://dx.doi.org/10.1109/VISUAL.1997.663932,507,509,M,,Carol L. Hunter;Roger Crawfis;Michael Cox;Bernd Hamann;Charles D. Hansen;Mark C. Miller,M. Cox;R. Crawfis;B. Hamann;C. Hansen;M. Miller,NASA Ames Research Center,,,0,0,0,
Vis,1998,Why is Real-Time Volume Rendering No Longer a Year Away?,10.1109/VISUAL.1998.745352,http://dx.doi.org/10.1109/VISUAL.1998.745352,497,499,M,,Arie E. Kaufman;Marty Brady;William E. Lorensen;Frederick L. Kitson;Hanspeter Pfister,A. Kaufman;M. Brady;B. Lorensen;F. Kitson;H. Pfister,General Electric Corporation,,,0,0,0,
InfoVis,2002,Display design for the eye and mind,10.1109/INFVIS.2002.1173164,http://dx.doi.org/10.1109/INFVIS.2002.1173164,171,171,M,,Stephen M. Kosslyn,S.M. Kosslyn,Harvard University,,,0,0,0,
Vis,2002,NASA's great zooms: a case study,10.1109/VISUAL.2002.1183825,http://dx.doi.org/10.1109/VISUAL.2002.1183825,541,544,C,"This paper examines a series of NASA outreach visualizations created using several layers of remote sensing satellite data ranging from 4-kilometers per pixel to I-meter per pixel. The viewer is taken on a seamless, cloud free journey from a global view of the Earth down to ground level where buildings, streets, and cars are visible. The visualizations were produced using a procedural shader that takes advantage of accurate georegistration and color matching between images. The shader accurately and efficiently maps the data sets to geometry allowing for animations with few perceptual transitions among data sets. We developed a pipeline to facilitate the production of over twenty zoom visualizations. Millions of people have seen these visualizations through national and international media coverage.",Gregory W. Shirah;Horace Mitchell,G.W. Shirah;H.G. Mitchell,,,"visualization, remote sensing, renderman, shader, georegistration, color matching",0,0,11,
InfoVis,2003,Information esthetics: from MoMa to wall street,10.1109/INFVIS.2003.1249003,http://dx.doi.org/10.1109/INFVIS.2003.1249003,11,11,M,,W. Bradford Paley,W.B. Paley,Digital Image Design & Columbia University,,,0,0,0,
Vis,2003,The visualization market: open source vs. commercial approaches,10.1109/VISUAL.2003.1250350,http://dx.doi.org/10.1109/VISUAL.2003.1250350,21,24,M,,Jeremy Jaech;Stephen C. North;Mike Peery;Will Schroeder;James J. Thomas,J. Jaech;S. North;M. Peery;W. Schroeder;J. Thomas,,,,0,0,0,
Vis,2003,Interoperability of visualization software and data models is not an achievable goal,10.1109/VISUAL.2003.1250427,http://dx.doi.org/10.1109/VISUAL.2003.1250427,607,610,M,,E. Wes Bethel;Greg Abram;John Shalf;Randy Frank;James P. Ahrens;Steven G. Parker;Nagiza F. Samatova;Mark C. Miller,E.W. Bethel,Lawrence Berkeley National Laboratory,,,0,0,0,
InfoVis,2004,Distortion-Based Visualization for Long-Term Continuous Acoustic Monitoring,10.1109/INFVIS.2004.17,http://dx.doi.org/10.1109/INFVIS.2004.17,21,21,M,"Visualizing long-term acoustic data has been an important subject in the field of equipment surveillance and equipment diagnosis. This paper proposes a distortion-based visualization method of long-term acoustic data. We applied the method to 1 hour observation data of electric discharge sound, and our method could visualize the sound data more intelligibly as compared with conventional methods.",Fujio Tsutsumi;Norihiko Itoh;Takashi Onoda,F. Tsutsumi;N. Itoh;T. Onoda,Central Research Institute of Electric Power Industry,,,0,0,3,
InfoVis,2004,Histographs: Interactive Clustering of Stacked Graphs,10.1109/INFVIS.2004.28,http://dx.doi.org/10.1109/INFVIS.2004.28,17,17,M,"Visualization systems must intuitively display and allow interaction with large multivariate data on low-dimensional displays. One problem often encountered in the process is occlusion: the ambiguity that occurs when records from different data sets are mapped to the same display location. For example, because of occlusion summarizing 1000 graphs by simply stacking them one over another is pointless. We solve this problem by adapting the solution to a similar problem in the Information Murals system [2]: mapping the number of data elements at a location to display luminance. Inspired by histograms, which map data frequency to space, we call our solution histographs. By treating a histograph as a digital image, we can blur and highlight edges to emphasize data features. We also support interactive clustering of the data with data zooming and shape-based selection. We are currently investigating alternative occlusion blending schemes.",Pin Ren;Benjamin Watson,Pin Ren;B. Watson,Northwestern University,,,0,0,5,
InfoVis,2004,Interactive Poster: Visual Mining of Business Process Data,10.1109/INFVIS.2004.41,http://dx.doi.org/10.1109/INFVIS.2004.41,10,10,M,,Ming C. Hao;Daniel A. Keim;Umeshwar Dayal;Jörn Schneidewind,M.C. Hao;D.A. Keim;U. Dayal;J. Schneidewind,Hewlett Packard Research Laboratories,,,0,0,1,
InfoVis,2004,Interactive Visualization Approaches to the Analysis of System Identification Data,10.1109/INFVIS.2004.42,http://dx.doi.org/10.1109/INFVIS.2004.42,11,11,M,"We propose an interactive visualization approach to finding a mathematical model for a real world process, commonly known in the field of control theory as system identification. The use of interactive visualization techniques provides the modeller with instant visual feedback which facilitates the model validation process. When working interactively with such large data sets, as are common in system identification, methods to handle this data efficiently are required. We are developing approaches based on data streaming to meet this need.",Jimmy Johansson;Patric Ljung;David Lindgren;Matthew Cooper 0001,J. Johansson;Patric Ljung;D. Lindgren;M. Cooper,Link&#246;ping University,,,0,0,6,
InfoVis,2004,Resource Systems Reference Database,10.1109/INFVIS.2004.58,http://dx.doi.org/10.1109/INFVIS.2004.58,13,13,M,"This interactive poster proposes a novel, explorative way to browse a database containing links to resource systems-related information online. Our approach is an illustrative one, and draws on our combined backgrounds in computer science, graphic and interaction design, sustainability, community organization, and urban design. The data visualized in our prototype was collected by students in the course Sustainable Habits, which Lauren Dietrich taught at Stanford University during Winter 2004.",David Lu;Lauren Dietrich,D. Lu;L. Dietrich,Futurefarmers,,,0,0,3,
InfoVis,2004,Visual Browsing of Remote and Distributed Data,10.1109/INFVIS.2004.73,http://dx.doi.org/10.1109/INFVIS.2004.73,12,12,M,"Data repositories around the world hold many thousands of data sets. Finding information from these data sets is greatly facilitated by being able to quickly and efficiently browse remote data sets. In this note, we introduce the Iconic Remote Visual Data Exploration tool(IRVDX), which is a visual data mining tool used for exploring the features of remote and distributed data without the necessity of downloading the entire data set. IRVDX employs three kinds of visualizations: one provides a reduced representation of the data sets, which we call Dataset Icons. These icons show the important statistical characteristics of data sets and help to identify relevant data sets from distributed repositories. Another one is called the Remote Dataset Visual Browser that provides visualizations to browse remote data without downloading the complete data set to identify its content. The final one provides visualizations to show the degree of similarity between two data sets and to visually determine whether a join of two remote data sets will be meaningful.",Parthasarathy Krishnaswamy;Stephen G. Eick;Robert L. Grossman,P. Krishnaswamy;S.G. Eick;R.L. Grossman,University of Illinois at Chicago,,,0,0,10,
InfoVis,2004,Visualizing and Interacting with Multi-Tree Hierarchical Data,10.1109/INFVIS.2004.74,http://dx.doi.org/10.1109/INFVIS.2004.74,15,15,M,This work focuses on visualizing highly cyclic hierarchical data. A user interface is discussed and its interaction is illustrated using a recipe database example. This example showcases a database with multiple categories for each recipe (database entry).,Mahnas Jean Mohammadi-Aragh;T. J. Jankun-Kelly,M.J. Mohammadi-Aragh;T.J. Jankun-Kelly,Mississippi State University,,,0,0,5,
Vis,2004,Capillary Histology Imagery Visualization and Exploration,10.1109/VISUAL.2004.11,http://dx.doi.org/10.1109/VISUAL.2004.11,30,30,M,,Michael Gleicher;Tom Brunet;K. Evan Nowak;Liz Osten;Matt McElwee;Kevin Tanty;Adam Gepner;Garet Lahvis,M. Gleicher;T. Brunet;E. Nowak;L. Osten;M. McElwee;K. Tanty;A. Gepner;G. Lahvis,University of Wisconsin-Madison,,,0,0,0,
Vis,2004,Visual Inspection Methods for Quality Control in Automotive Engineering,10.1109/VISUAL.2004.111,http://dx.doi.org/10.1109/VISUAL.2004.111,3,3,M,"The automotive industry demands visual support for the verification of the quality of their products from the design phase to the manufacturing phase. This implies the need of tools for measurement planning, programming measuring devices, managing measurement data, and the visual exploration of the measurement results. To improve the quality control throughout the whole process chain an integration of such tools in a platform independent framework is crucial. We present eMMA (enhanced Measure Management Application), a client/server system integrating measurement planning, data management, and straightforward as well as sophisticated visual exploration tools in a single framework.",Hans Hagen;Andreas Disch;Jochen Ehret;Ralf Klein;Sascha Köhn;Dirk Zeckzer;Michael Münchhofen,H. Hagen;A. Disch;J. Ehret;R. Klein;S. Kohn;D. Zeckzer;M. Munchhofen,DFKI GmbH,,,0,0,0,
Vis,2004,Visualizing the Energetics of the Dissociation of a Metastable Molecule,10.1109/VISUAL.2004.123,http://dx.doi.org/10.1109/VISUAL.2004.123,15,15,M,,David Guzman;Reuben Reyes;Karla Vega;Kelly P. Gaither;Robert Wyatt,D. Guzman;R. Reyes;K. Vega;K. Gaither;R. Wyatt,University of Texas at Austin,,,0,0,0,
Vis,2004,DaMI - Data Management for Multimedial Information Systems,10.1109/VISUAL.2004.21,http://dx.doi.org/10.1109/VISUAL.2004.21,9,9,M,This paper describes a Data Management System for Multimedial Information Visualization called DaMI. It is possible to create 2D or 3D model based on data out of standard databases and additional metainformation. DaMI is a generic system guaranteeing an optimal reusability and compatibility.,Hans Hagen;Gerhard Steinebach;Michael Münchhofen;Inga Scheler;Maja Ruby;Michael Wadlé,H. Hagen;G. Steinebach;M. Munchhofen;I. Scheler;M. Ruby;M. Wadle,University of Kaiserslautern,,,0,0,4,
Vis,2004,Fast Rendering of Foveated Volume in the Wavelet Domain,10.1109/VISUAL.2004.31,http://dx.doi.org/10.1109/VISUAL.2004.31,26,26,M,,Hang Yu;Ee-Chien Chang;Zhiyong Huang;Zhijian Zheng,Hang Yu;Ee-Chien Chang;Zhiyong Huang;Zhijian Zheng,National University of Singapore,,,0,0,6,
Vis,2004,JointViewer - An Interactive System for Exploring Orthopedic Data,10.1109/VISUAL.2004.60,http://dx.doi.org/10.1109/VISUAL.2004.60,35,35,M,,G. Elisabeta Marai;Çagatay Demiralp;Stuart Andrews;David H. Laidlaw,G.E. Marai;C. Demiralp;S. Andrews;D.H. Laidlaw,Brown University,,,0,0,3,
Vis,2004,The human visual system: how is its design related to the physics of the natural environment?,10.1109/VISUAL.2004.61,http://dx.doi.org/10.1109/VISUAL.2004.61,xviii,,M,"Summary form only given. The human visual system is the result of evolution by natural selection and hence its design must incorporate detailed knowledge of the physical properties of the natural environment. This is an obvious statement, but the scientific community has been slow to take it seriously. Only recently has there been an increased effort to directly measure the statistical properties of natural scenes and compare them to the design and performance of the human visual system. This work describes some recent studies of the chromatic and geometrical properties of natural materials and natural images, as well as some perceptual and physiological studies designed to test how those physical properties are related to human perceptual mechanisms.",Wilson S. Geisler,W.S. Geisler,"Dept. of Psychol., Texas Univ., Austin, TX, USA",,,0,0,0,
Vis,2004,Live Range Visibility Constraints for Adaptive Terrain Visualization,10.1109/VISUAL.2004.67,http://dx.doi.org/10.1109/VISUAL.2004.67,12,12,M,"Although there is a remarkable pace in the advance of computational resources and storage for real-time visualization the immensity of the input data continues to outstrip any advances. The task for interactively visualizing such a massive terrain is to render a triangulated mesh using a view-dependent error tolerance, thus intelligently and perceptually managing the scene’s geometric complexity. At any particular instance in time (i.e. displayed frame), this level-of-detail (LOD) terrain surface consists of a mesh composed of hundreds of thousands of dynamically selected triangles. The triangles are selected using the current time-step’s view parameters and the view-dependent error tolerance. Massive terrain data easily exceeds main memory storage capacity such that out-of-core rendering must be performed. This further complicates the triangle selection and terrain rendering owing to tertiary storage’s relatively poor performance.",Xiaohong Bao;Renato Pajarola;Michael Shafae,Xiaohong Bao;R. Pajarola;M. Shafae,University of California at Irvine,,,0,0,5,
Vis,2004,On the Visualization of Time-Varying Structured Grids Using a 3D Warp Texture,10.1109/VISUAL.2004.74,http://dx.doi.org/10.1109/VISUAL.2004.74,17,17,M,"We present a novel scheme to interactively visualize time-varying scalar fields defined on a structured grid. The underlying approach is to maximize the use of current graphics hardware by using 3D texture mapping. This approach commonly suffers from an expensive voxelization of each time-step as well as from large size of the voxel array approximating each step. Hence, in our scheme, instead of explicitly voxelizing each scalar field, we directly store each time-step as a three dimensional texture in its native form. We create the function that warps a voxel grid into the given structured grid. At rendering time, we reconstruct the function at each pixel using hardware-based trilinear interpolation. The resulting coordinates allow us to compute the scalar value at this pixel using a second texture lookup. For fixed grids, the function remains constant across time-steps and only the scalar field table needs to be re-loaded as a texture. Our new approach achieves excellent performance with relatively low texture memory requirements and low approximation error.",Yuan Chen;Jonathan D. Cohen 0001;Subodh Kumar 0001,Yuan Chen;J. Cohen;S. Kumar,Johns Hopkins University,,,0,1,0,
Vis,2004,Panel 2: In the Eye of the Beholder: The Role of Perception in Scientific Visualization,10.1109/VISUAL.2004.77,http://dx.doi.org/10.1109/VISUAL.2004.77,567,568,M,"The evolution of computational science over the last decade has resulted in a dramatic increase in raw problem solving capabilities. This growth has given rise to advances in scientific and engineering simulations that have put a high demand on tools for high-performance large-scale data exploration and analysis. These simulations have the potential to generate large amounts of data. Humans, however are relatively poor at gaining insight from raw numerical data, and as a result, have used visualization as a tool for understanding, interpreting and exploring data of all types and sizes. Allowing for efficient visual explorations of data, however, requires that the ratio of knowledge gained versus the cost of the visualization be maximized. This, in turn, mandates the integration of principles from human perception. Understanding perception as it relates to visualization requires that we understand not only the biology of the human visual system, but principles from vision theory, and perceptual psychology as well. This panel is the result of bringing together practioners and researchers from a broad spectrum of interests relating to the ability to maximize the amount of information that is effectively perceived from a given visualization. Position statements will be given by researchers interested in perceptual psychology and the perception of natural images, integrating art and design principles, non-photorealistic rendering techniques, and the use of global illumination methods to provide benefical perceptual cues.",Kelly P. Gaither;David S. Ebert;Bill Geisler;David H. Laidlaw,K. Gaither;D. Ebert;B. Geisler;D. Laidlaw,University of Texas at Austin,,,0,0,0,
Vis,2004,Panel 3: The Future Visualization Platform,10.1109/VISUAL.2004.78,http://dx.doi.org/10.1109/VISUAL.2004.78,569,571,M,"Advances in graphics hardware and rendering methods are shaping the future of visualization. For example, programmable graphics processors are redefining the traditional visualization cycle. In some cases it is now possible to run the computational simulation and associated visualization side-by-side on the same chip. Moreover, global illumination and non-photorealistic effects promise to deliver imagery which enables greater insight into high resolution, multivariate, and higher-dimensional data. The panelists will offer distinct viewpoints on the direction of future graphics hardware and its potential impact on visualization, and on the nature of advanced visualizationrelated tools and techniques. Presentation of these viewpoints will be followed by audience participation in the form of a question and answer period moderated by the panel organizer.",Greg Johnson;David S. Ebert;Charles D. Hansen;David Kirk;Bill Mark;Hanspeter Pfister,G. Johnson;D. Ebert;C. Hansen;D. Kirk;B. Mark;H. Pfister,University of Texas at Austin,,,0,1,0,
Vis,2005,Fast visualization by shear-warp on quadratic super-spline models using wavelet data decompositions,10.1109/VISUAL.2005.1532816,http://dx.doi.org/10.1109/VISUAL.2005.1532816,351,358,C,"We develop the first approach Tor interactive volume visualization based on a sophisticated rendering method of shear-warp type, wavelet data encoding techniques, and a trivariate spline model, which has been introduced recently. As a first step of our algorithm, we apply standard wavelet expansions to represent and decimate the given gridded three-dimensional data. Based on this data encoding, we give a sophisticated version of the shear-warp based volume rendering method. Our new algorithm visits each voxel only once taking advantage of the particular data organization of octrees. In addition, the hierarchies of the data guide the local (re)construction of the quadratic super-spline models, which we apply as a pure visualization tool. The low total degree of the polynomial pieces allows to numerically approximate the volume rendering integral efficiently. Since the coefficients of the splines are almost immediately available from the given data, Bernstein-Bezier techniques can be fully employed in our algorithms. In this way, we demonstrate that these models can be successfully applied to full volume rendering of hierarchically organized data. Our computational results show that (even when hierarchical approximations are used) the new approach leads to almost artifact-free visualizations of high quality for complicated and noise-contaminated volume data sets, while the computational effort is considerable low, i.e. our current implementation yields 1-2 frames per second for parallel perspective rendering a 2563 volume data set (using simple opacity transfer functions) in a 5122 view-port.",Gregor Schlosser;Jürgen Hesser;Frank Zeilfelder;Christian Rössl;Reinhard Männer;Günther Nürnberger;Hans-Peter Seidel,G. Schlosser;J. Hesser;F. Zeilfelder;C. Rossl;G. Nurnberger;H.-P. Seidel;R. Manner,"ICM, Mannheim Univ., Germany",10.1109/VISUAL.1998.745713;10.1109/VISUAL.2001.964513;10.1109/VISUAL.1994.346331;10.1109/VISUAL.1990.146391,"Volume Rendering, Quadratic Super-Splines, Shear-Warp Algorithm, Hierarchical Data Encoding",0,0,37,
VAST,2007,VAST 2007 Contest Interactive Poster: Data Analysis Using NdCore and REGGAE,10.1109/VAST.2007.4389016,http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4389016,199,200,M,"ATS intelligent discovery analyzed the VAST 2007 contest data set using two of its proprietary applications, NdCore and REGGAE (relationship generating graph analysis engine). The paper describes these tools and how they were used to discover the contest's scenarios of wildlife law enforcement, endangered species issues, and ecoterrorism.",Lynn Schwendiman;Jonathan McLean;Jonathan Larson,Lynn Schwendiman;Jonathan McLean;Jonathan Larson,"ATS Intelligent Discovery, 3505 NW Anderson Hill Road, Suite 200, Silverdale, WA 98383. lynn.schwendiman@atsid.com;ATS Intelligent Discovery, 3505 NW Anderson Hill Road, Suite 200, Silverdale, WA 98383. jonathan.mclean@atsid.com;ATS Intelligent Discovery, 3505 NW Anderson Hill Road, Suite 200, Silverdale, WA 98383. jonathan.larson@atsid.com",,,0,0,0,
VAST,2007,"Something's ""Fishy"" at Global Ways and Gill Breeders - Analysis with nSpace and GeoTime",10.1109/VAST.2007.4389018,http://dx.doi.org/10.1109/VAST.2007.4389018,203,204,M,GeoTime and nSpace are two interactive visual analytics tools that support the process of analyzing massive and complex datasets. The two tools were used to examine and interpret the 2007 VAST contest dataset. This poster paper describes how the capabilities of the tools were used to facilitate and expedite every stage of an analyst workflow.,Lynn Chien;Annie Tat;William Wright,Lynn Chien;Annie Tat;William Wright,Oculus Info Inc.;Oculus Info Inc.;Oculus Info Inc.,,,0,0,3,
VAST,2007,TextPlorer: An application supporting text analysis,10.1109/VAST.2007.4389019,http://dx.doi.org/10.1109/VAST.2007.4389019,205,206,M,"TexPlorer is an integrated system for exploring and analyzing large amounts of text documents. The data processing modules of TexPlorer consist of named entity extraction, entity relation extraction, hierarchical clustering, and text summarization tools. Using a timeline tool, tree-view, table-view, and concept maps, TexPlorer provides an analytical interface for exploring a set of text documents from different perspectives and allows users to explore vast amount of text documents efficiently.",Chi-Chun Pan;Anuj R. Jaiswal;Junyan Luo;Anthony C. Robinson,Chi-Chun Pan;Anuj R. Jaiswal;Junyan Luo;Anthony Robinson,The Pennsylvania State University. e-mail: julianpan@psu.edu;The Pennsylvania State University. e-mail: arj135@psu.edu;The Pennsylvania State University. e-mail: jluo@psu.edu;The Pennsylvania State University. e-mail: acr181@psu.edu,,,0,0,3,
VAST,2007,University of British Columbia & Simon Fraser University - The Bricolage,10.1109/VAST.2007.4389020,http://dx.doi.org/10.1109/VAST.2007.4389020,207,208,M,"This abstract presents a<i>bricolage</i>approach to the 2007 VAST contest. The analytical process we used is presented across four stages of sensemaking. Several tools were used throughout our approach, and we present their strengths and weaknesses for specific aspects of the analytical process. In addition, we review the details of both individual and collaborative techniques for solving visual analytics problems.",William Chao;Daniel Ha;Kevin I.-J. Ho;Linda T. Kaastra;Minjung Kim;Andrew Wade,William Chao;Daniel Ha;Kevin Ho;Linda Kaastra;Minjung Kim;Andrew Wade;Brian Fisher,"Simon Fraser University, SIAT; University of British Columbia, MAGIC;Simon Fraser University, SIAT; University of British Columbia, MAGIC;Simon Fraser University, SIAT; University of British Columbia, MAGIC;Simon Fraser University, SIAT; University of British Columbia, MAGIC;Simon Fraser University, SIAT; University of British Columbia, MAGIC;Simon Fraser University, SIAT; University of British Columbia, MAGIC. e-mail: andrewwade@ubcviscog.com;Faculty Sponsor, Simon Fraser University, SIAT; University of British Columbia, MAGIC",,,0,0,3,
VAST,2007,Spectra transformed for model-testing and visual exploration,10.1109/VAST.2007.4389024,http://dx.doi.org/10.1109/VAST.2007.4389024,215,216,M,"The presence of highly tangled patterns in spectra and other serial data exacerbates the difficulty of performing visual comparison between a test model for a particular pattern and the data. The use of a simple map that plants peaks in the data directly onto their corresponding position in a residual plot with respect to a chosen test model not only retrieves the advantages of dynamic regression plotting, but in practical cases also causes patterns in the data to congregate in meaningful ways with respect to more than one reference curve in the plane. The technique is demonstrated on a polyphonic music signal.",Palmyra Catravas,Palmyra Catravas,"ECE Department, Union College, Schenectady, NY. e-mail: catravap@union.edu",,,0,0,15,
VAST,2007,Outlook for Visual Analytics Research Funding,10.1109/VAST.2007.4389030,http://dx.doi.org/10.1109/VAST.2007.4389030,227,227,M,"Visual Analytics has become a rapidly growing field of study. It is also a field that is addressing very significant real world problems in homeland security, business analytics, emergency management, genetics and bioinformatics, investigative analysis, medical analytics, and other areas. For both these reasons, it is attracting new funding and will continue to do so in the future. Visual analytics has also become an international field, with significant research efforts in Canada, Europe, and Australia, as well as the U.S. There is significant new research funding in Canada and Germany with other efforts being discussed, including a major program sponsored by the European Union. The contributors to this panel are some of the primary thought leaders providing research funding or involved in setting up the funding apparatus. We have asked them to present their needs, funding programs, and expectations from the research community. They all come from different perspectives, different missions, and different expectations. They will present their views of the range of activity in both the U.S. and internationally and discuss what is coming. Come learn about these programs, initiatives, and plans, and how you can contribute.",James J. Thomas;Daniel A. Keim;Joe Kielman;Larry Rosenblum,Jim Thomas;Daniel Keim;Joe Kielman;Larry Rosenblum,Pacific Northwest National Laboratory;University of Konstanz;Department of Homeland Security;National Science Foundation,,,0,0,0,
VAST,2007,VAST 2007 Contest - Analysis with nSpace and GeoTime,10.1109/VAST.2007.4389033,http://dx.doi.org/10.1109/VAST.2007.4389033,233,234,M,GeoTime and nSpace are two interactive visual analytics tools that support the process of analyzing massive and complex datasets. The two tools were used to examine and interpret the 2007 VAST contest dataset. This paper describes how the capabilities of the tools were used to facilitate and expedite every stage of the analysis.,Lynn Chien;Annie Tat;Thomas Kapler;Patricia Enns;Winniefried Kuan;William Wright,Lynn Chien;Annie Tat;Thomas Kapler;Patricia Enns;Winniefried Kuan;William Wright,Oculus Info Inc.;Oculus Info Inc.;Oculus Info Inc.;Oculus Info Inc.;Oculus Info Inc.;Oculus Info Inc.,,,0,0,3,
VAST,2008,A compound approach for interactive visualization of time-oriented data,10.1109/VAST.2008.4677374,http://dx.doi.org/10.1109/VAST.2008.4677374,177,178,M,"Many real-world visual analytics applications involve time-oriented data. I am working in a research project related to this challenge where I am responsible for the interactive visualization part. My goal are interactive visualizations to explore such time-oriented data according to the user tasks while considering the structure of time. Time is composed of many granularities that are likely to have crucial influence on the formation of the data. The challenge is to integrate the granularities into a detailed compound view on the data, like the compound eye of insects integrates many images into one view. Other members of our team are experts in temporal data mining and user centered design. The goal is to combine our research topics to an integrated system that helps domain experts to get more insight from their time-oriented data.",Tim Lammarsch,Tim Lammarsch,"Department of Information and Knowledge Engineering (ike), Danube University Krems, Austria",,,0,0,10,
VAST,2008,Visual analysis of seismic simulation data,10.1109/VAST.2008.4677381,http://dx.doi.org/10.1109/VAST.2008.4677381,191,192,M,"Seismic simulations use finite element methods to describe ground motion. The results of such numerical simulations are often difficult to interpret for decision makers. We describe a terrain rendering engine that uses photorealistic metaphors to represent typical terrain properties without representing an actual terrain. In the context of ground motion, a simulation of the effects of various types of earthquakes on buildings has been conducted. Usually, such structural response simulations are carried out independently and are being visualized separate from the ground motion simulation. We combine the results from both simulations in an interactive, hybrid visualization so that decision makers (first responders and emergency management agencies) are provided with a photo-realistic, simulated view of various earthquake scenarios, enabling them to study the effect of various earthquakes on buildings typical for a rural or urban area. We present a method for visually analyzing large-scale simulation data from different sources (ground motion simulation and structural response simulation) using photorealistic metaphors. We have implemented an intuitive, interactive system for visual analysis and inspection of possible effects of various types of earthquakes on an inventory of buildings typical for a particular area. The underlying rendering system can be easily adapted for other simulations, such as smoke plumes or biohazards.",Florian Jürgen Gerhardt;Jörg Meyer 0002,Florian Juergen Gerhardt;Joerg Meyer,"Technical University of Kaiserslautern, Germany;Electrical Engineering and Computer Science Department, University of California, Irvine, USA",,,0,0,1,
VAST,2008,Migrant boat mini challenge award: Analysis summary a geo-temporal analysis of the migrant boat dataset,10.1109/VAST.2008.4677394,http://dx.doi.org/10.1109/VAST.2008.4677394,,,M,"The SPADAC team used various visual analytics tools and methods to find geo-temporal patterns of migration from a Caribbean island from 2005-2007. In this paper, we describe the tools and methods used in the analysis. These methods included generating temporal variograms, dendrograms, and proportionally weighted migration maps, using tools such as the R statistical software package and Signature Analysttrade. We found that there is a significant positive space-time correlation with the boat encounters (especially the landings), with a migratory shift further away from the point of departure over time.",Benjamin Holland;Lisa Kuchy;Jason Dalton,Benjamin Holland;Lisa Kuchy;Jason Dalton,"SPADAC, Inc., USA;SPADAC, Inc., USA;SPADAC, Inc., USA",,,0,0,3,
VAST,2009,Merging visual analysis with automated reasoning: Using Prajna to solve the traffic challenge,10.1109/VAST.2009.5332481,http://dx.doi.org/10.1109/VAST.2009.5332481,,,M,"The Internet traffic challenge required the development of a custom application to analyze internet traffic patterns coupled with building access records. To solve this challenge, the author applied the Prajna Project, an open-source Java toolkit designed to provide various capabilities for visualization, knowledge representation, semantic reasoning, and data fusion. By applying some of the capabilities of Prajna to this challenge, the author could quickly develop a custom application for visual analysis. The author determined that he could solve some of the analytical components of this challenge using automated reasoning techniques. Prajna includes interfaces to incorporate automated reasoners into visual applications. By blending the automated reasoning processes with visual analysis, the author could design a flexible, useful application to solve this challenge.",Edward Swing,Edward Swing,"Vision Systems & Technology, Inc., USA",,,0,0,4,
VAST,2009,Poster: Icexplorer: Studying Great Lakes Ice cover,10.1109/VAST.2009.5333082,http://dx.doi.org/10.1109/VAST.2009.5333082,239,240,M,"IceXplorer is a tool for analyzing variations in ice cover on Lake Erie. It enhances the data and pre-packaged analysis currently available in the great lakes ice atlas and serves as an example of a small, focused application where simple but carefully-chosen visualizations, interaction techniques, and automated data analysis are combined to create an effective tool for advancing scientific research.",Stina S. Bridgeman,Stina Bridgeman,"Hobart and William Smith Colleges, USA",,,0,0,6,
VAST,2009,BEADS: High dimensional data cluster visualization,10.1109/VAST.2009.5333417,http://dx.doi.org/10.1109/VAST.2009.5333417,235,236,M,"In this poster paper, we present BEADS, a high dimensional data cluster visualization by having a 2-D representation of shape and spread of the cluster. The Cluster Division component, the Bead Shape Identification and Cluster Shape Composition form the core of the system. BEADS visualization consists of a 2-D plot, standard 2-D shapes which are used as metaphors to represent corresponding high-dimensional shapes of beads. The final resulting images convey the relative placement of beads with respect to the cluster center, the shape of the beads. We give a textual summary of the beads and their 2-D placement on the Beads plot in tabular format along with the image.",Soujanya Vadapalli;Kamalakar Karlapalem,Soujanya Vadapalli;Kamalakar Karlapalem,"Centre for Data Engineering, International Institute of Information Technology-Hyderabad, INDIA;Centre for Data Engineering, International Institute of Information Technology-Hyderabad, INDIA",,,0,0,4,
VAST,2009,ProcessLine: Visualizing time-series data in process industry,10.1109/VAST.2009.5333421,http://dx.doi.org/10.1109/VAST.2009.5333421,231,232,M,"In modern process industry, it is often difficult to analyze a manufacture process due to its numerous time-series data. Analysts wish to not only interpret the evolution of data over time in a working procedure, but also examine the changes in the whole production process through time. To meet such analytic requirements, we have developed ProcessLine, an interactive visualization tool for a large amount of time-series data in process industry. The data are displayed in a fisheye timeline. ProcessLine provides good overviews for the whole production process and details for the focused working procedure. A preliminary user study using beer industry production data has shown that the tool is effective.",XiongFei Luo;Hongan Wang;Feng Tian 0001;Wei Liu 0023;Dongxing Teng;Guozhong Dai,Xiongfei Luo;Hongan Wang;Feng Tian;Wei Liu;Dongxing Teng;Guozhong Dai,"Graduate University, Chinese Academy of Sciences, Beijing, China;Institute of Software, Chinese Academy of Sciences, Beijing, China;Institute of Software, Chinese Academy of Sciences, Beijing, China;Graduate University, Chinese Academy of Sciences, Beijing, China;Institute of Software, Chinese Academy of Sciences, Beijing, China;Institute of Software, Chinese Academy of Sciences, Beijing, China",,,0,0,6,
VAST,2009,Reordered tilebars for visual text exploration,10.1109/VAST.2009.5333436,http://dx.doi.org/10.1109/VAST.2009.5333436,225,226,M,"The classic TileBars paradigm has been used to show distribution information of query terms in full-text documents. However, when the number of query terms becomes large, it is not an easy task for users to comprehend their distribution within certain parts of a document. In this paper, we present a novel approach to improve the visual presentation of TileBars, in which barycenter heuristic for bigraph crossing minimization is used to reorder TileBars elements. The reordered TileBars can be demonstrated to provide users with better focus and navigation while exploring text documents.",VinhTuan Thai;Siegfried Handschuh,VinhTuan Thai;Siegfried Handschuh,"Digital Enterprise Research Institute, National University of Ireland, Galway, Ireland;Digital Enterprise Research Institute, National University of Ireland, Galway, Ireland",,,0,0,9,
VAST,2009,A scalable architecture for visual data exploration,10.1109/VAST.2009.5333451,http://dx.doi.org/10.1109/VAST.2009.5333451,221,222,M,"Intelligence analysts in the areas of defense and homeland security are now faced with the difficult problem of discerning the relevant details amidst massive data stores. We propose a component-based visualization architecture that is built specifically to encourage the flexible exploration of geospatial event databases. The proposed system is designed to deploy on a variety of display layouts, from a single laptop screen to a multi-monitor tiled-display. By utilizing a combination of parallel coordinates, principal components plots, and other data views, analysts may reduce the dimensionality of a data set to its most salient features. Of particular value to our target applications are understanding correlations between data layers, both within a single view and across multiple views. Our proposed system aims to address the limited scalability associated with coordinated multiple views (CMVs) through the implementation of an efficient core application which is extensible by the end-user.",Jonathan W. Decker;Alex Godwin;Mark A. Livingston;Denise Royle,Jonathan Decker;Alex Godwin;Mark A. Livingston;Denise Royle,"Naval Research Laboratory, USA;Naval Research Laboratory, USA;Naval Research Laboratory, USA;Naval Research Laboratory, USA",,,0,0,7,
VAST,2009,Interactive poster: A proposal for sharing user requirements for visual analytic tools,10.1109/VAST.2009.5333474,http://dx.doi.org/10.1109/VAST.2009.5333474,215,216,M,"Although many in the community have advocated user-centered evaluations for visual analytic environments, a significant barrier exists. The users targeted by the visual analytics community (law enforcement personnel, professional information analysts, financial analysts, health care analysts, etc.) are often inaccessible to researchers. These analysts are extremely busy and their work environments and data are often classified or at least confidential. Furthermore, their tasks often last weeks or even months. It is simply not feasible to do such long-term observations to understand their jobs. How then can we hope to gather enough information about the diverse user populations to understand their needs? Some researchers, including the author, have been successful in getting access to specific end-users. A reasonable approach, therefore, would be to find a way to share user information. This work outlines a proposal for developing a handbook of user profiles for use by researchers, developers, and evaluators.",Jean Scholtz,Jean Scholtz,"Pacific Northwest National Laboratory, USA",,,0,0,8,
VAST,2009,EAKOS: VAST 2009,10.1109/VAST.2009.5333967,http://dx.doi.org/10.1109/VAST.2009.5333967,,,M,"In this article, I describe the tools and techniques used to generate competing hypotheses for the VAST 2009 Flitter mini challenge. I will describe how I approached solving the social networks and the importance of the geospatial relationships to determine that ldquoSocial Structure Form Ardquo was the best matching social network.",Lorne Leonard,Lorne Leonard,"Penn State University Research Computing & Cyberinfrastructure, USA",,,0,0,0,
VAST,2009,Timeline analysis of undercover activities VAST 2009 traffic mini challenge award: Good analytical technique,10.1109/VAST.2009.5334460,http://dx.doi.org/10.1109/VAST.2009.5334460,,,M,"Our visualization tool for the VAST 2009 traffic mini challenge, Timeliner, visualizes badge and network traffic data together in a single timeline. The two views of per-employee and per-day with various filtering interactions enable users to analyze easily employees activities at a particular moment of interest as well as their general daily patterns. Using Timeliner, we present several hypotheses for the task at hand and their validation processes, which reveals various aspects of the data.",Jaegul Choo;Emily Fujimoto;Hanseung Lee;Pedro R. Walteros,Jaegul Choo;Emily Fujimoto;Hanseung Lee;Pedro R. Walteros,"Georgia Institute of Technology, 266 Ferst Drive, Atlanta, 30332, USA;Georgia Institute of Technology, 266 Ferst Drive, Atlanta, 30332, USA;Georgia Institute of Technology, 266 Ferst Drive, Atlanta, 30332, USA;Georgia Institute of Technology, 266 Ferst Drive, Atlanta, 30332, USA",,,0,0,0,
VAST,2009,Combining iterative analytical reasoning and software development using the visualization language Processing,10.1109/VAST.2009.5334463,http://dx.doi.org/10.1109/VAST.2009.5334463,,,M,"Processing is a very powerful visualization language which combines software concepts with principles of visual form and interaction. Artists, designers and architects use it but it is also a very effective programming language in the area of visual analytics. In the following contribution Processing is utilized in order to visually analyze data provided by IEEE VAST 2009 Mini Challenge Badge and Network Traffic. The applied process is iterative and each stage of the analytical reasoning process is accompanied by customized software development. The visual model, the process and the technical solution will be briefly introduced.",Claudia Müller-Birn;Lukas Birn,Claudia Muller-Birn;Lukas Birn,"Carnegie Mellon University, USA;Capgemini sd&m AG, Germany",,,0,0,4,
VAST,2010,Adapting Daniel and Wood's modeling approach to interactive visual analytics,10.1109/VAST.2010.5649831,http://dx.doi.org/10.1109/VAST.2010.5649831,253,254,M,This poster describes our progress in developing an interactive linear modeling system that supports the modeling approach described by Daniel and Wood. Our visual interface permits analysts to build sets of possible models and then creates appropriate visualizations to permit human-in-the-loop model comparison and selection.,Justin Talbot;Pat Hanrahan,Justin Talbot;Pat Hanrahan,Computer Science Department Stanford University;Computer Science Department Stanford University,,,0,0,9,
VAST,2010,Poster: Translating cross-filtered queries into questions,10.1109/VAST.2010.5650251,http://dx.doi.org/10.1109/VAST.2010.5650251,245,246,M,"Complex combinations of coordinated multiple views are increasingly used to design tools for highly interactive visual exploration and analysis of multidimensional data. While complex coordination patterns provide substantial utility through expressive querying, they also exhibit usability problems for users when learning required interaction sequences, recalling past queries, and interpreting visual states. As visual analysis tools grow more sophisticated, there is a growing need to make them more understandable as well. Our long-term goal is to exploit natural language familiarity and literacy to directly facilitate individual and collaborative use of visual analysis tools. In this poster, we present work in progress on an automatically generated query-to-question user interface to translate interactive states during visual analysis into an accompanying visual log of formatted text. Our effort currently focuses on a symmetric and thus relatively simple coordination pattern: cross-filtered views. We describe our current thinking about query-to-question translation in a typical cross-filtered visualization of movies, people, and genres in the Internet Movie Database.",Maryam Nafari;Chris Weaver,Maryam Nafari;Chris Weaver,School of Computer Science and Center for Spatial Analysis The University of Oklahoma;School of Computer Science and Center for Spatial Analysis The University of Oklahoma,,"Coordinated multiple views, cross-filtered queries, interaction states, natural language generation, visual provenance",0,0,8,
VAST,2010,Enhancing text-based chat with visuals for hazardous weather decision making,10.1109/VAST.2010.5650815,http://dx.doi.org/10.1109/VAST.2010.5650815,225,226,M,"We created a visual chat application for use during hazardous weather events. The application, NWSChat2, allows National Weather Service forecasters, media members, and storm trackers to communicate with each other, basing their conversation on a common shared radar map of the storm. Users can additionally annotate the map with `pins' or draw notes with a stylus. These annotations are automatically shared with all other users. The collaborative nature of NWSChat2 makes it well-suited for disseminating information to all users during weather emergencies.",Moshe Gutman;Gina Eosco;Monica Zappa;Chris Weaver,Moshe Gutman;Gina Eosco;Monica Zappa;Chris Weaver,"School of Computer Science and School of Meteorology, University of Oklahoma;School of Computer Science and School of Meteorology, University of Oklahoma;School of Computer Science and School of Meteorology, University of Oklahoma;School of Computer Science and School of Meteorology, University of Oklahoma",,"Collaboration, coordinated multiple views, instant messaging, emergency response, hazardous weather",0,0,4,
VAST,2010,Large-scale neuroanatomical visualization using a manifold embedding approach,10.1109/VAST.2010.5652532,http://dx.doi.org/10.1109/VAST.2010.5652532,237,238,M,"We present a unified framework for data processing, mining and interactive visualization of large-scale neuroanatomical databases. The input data is assumed to lie in a specific atlas space, or simply exist as a separate collection. Users can specify their own atlas for comparative analyses. The original data exist as MRI images in standard formats. It is uploaded to a remote server and processed offline by a parallelized pipeline workflow. This workflow transforms the data to represent it as both volumetric and triangular mesh cortical surfaces. We use multiresolution representations to scale complexity to data storage availability as well as graphical processing performance. Our workflow implements predefined metrics for clustering and classification, and data projection schemes to aid in visualization. Additionally the system provides a visual query interface for performing selection requests based on user-defined search criteria.",Shantanu H. Joshi;Ian Bowman;John D. Van Horn,Shantanu H. Joshi;Ian Bowman;John Darrell Van Horn,"Laboratory of Neuro Imaging, Department of Neurology, UCLA School of Medicine, University of California Los Angeles, CA 90034;Laboratory of Neuro Imaging, Department of Neurology, UCLA School of Medicine, University of California Los Angeles, CA 90034;Laboratory of Neuro Imaging, Department of Neurology, UCLA School of Medicine, University of California Los Angeles, CA 90034",,,0,0,6,
VAST,2011,Reasonable abstractions: Semantics for dynamic data visualization,10.1109/VAST.2011.6102468,http://dx.doi.org/10.1109/VAST.2011.6102468,269,270,M,"Chi showed how to treat visualization programing models abstractly. This provided a firm theoretical basis for the data-state model of visualization. However, Chi's models did not look deeper into fine-grained program properties, such as execution semantics. We present conditionally deterministic and resource bounded semantics for the data flow model of visualization based on E-FRP. These semantics are used in the Stencil system to move between data state and data flow execution, build task-based parallelism, and build complex analysis chains for dynamic data. This initial work also shows promise for other complex operators, compilation techniques to enable efficient use of time and space, and mixing task and data parallelism.",Joseph A. Cottam;Andrew Lumsdaine,Joseph A. Cottam;Andrew Lumsdaine,,,,0,0,6,
VAST,2011,Exploring agent-based simulations using temporal graphs,10.1109/VAST.2011.6102469,http://dx.doi.org/10.1109/VAST.2011.6102469,271,272,M,"Agent-based simulation has become a key technique for modeling and simulating dynamic, complicated behaviors in social and behavioral sciences. Lacking the appropriate tools and support, it is difficult for social scientists to thoroughly analyze the results of these simulations. In this work, we capture the complex relationships between discrete simulation states by visualizing the data as a temporal graph. In collaboration with expert analysts, we identify two graph structures which capture important relationships between pivotal states in the simulation and their inevitable outcomes. Finally, we demonstrate the utility of these structures in the interactive analysis of a large-scale social science simulation of political power in present-day Thailand.",R. Jordan Crouser;Jeremy G. Freeman;Remco Chang,R. Jordan Crouser;Jeremy G. Freeman;Remco Chang,"Tufts University, USA;Tufts University, USA;Tufts University, USA",,,0,0,8,
VAST,2011,3D Visualization of temporal changes in bloggers' activities and interests,10.1109/VAST.2011.6102475,http://dx.doi.org/10.1109/VAST.2011.6102475,283,284,M,"This paper presents a novel system for analyzing temporal changes in bloggers' activities and interests on a topic through a 3D visualization of dependency structures related to the topic. Having a dependency database built from a blog archive, our 3D visualization framework helps users to interactively exploring temporal changes in bloggers' activities and interests related to the topic.",Masahiko Itoh;Naoki Yoshinaga 0001;Masashi Toyoda;Masaru Kitsuregawa,Masahiko Itoh;Naoki Yoshinaga;Masashi Toyoda;Masaru Kitsuregawa,"Institute of Industrial Science, University of Tokyo, Japan;Institute of Industrial Science, University of Tokyo, Japan;Institute of Industrial Science, University of Tokyo, Japan;Institute of Industrial Science, University of Tokyo, Japan",,,0,1,3,
VAST,2011,Visualizing an information assurance risk taxonomy,10.1109/VAST.2011.6102477,http://dx.doi.org/10.1109/VAST.2011.6102477,287,288,M,"The researchers explore the intersections between Information Assurance and Risk using visual analysis of text mining operations. The methodological approach involves searching for and extracting for analysis those abstracts and keywords groupings that relate to risk within a defined subset of scientific research journals. This analysis is conducted through a triangulated study incorporating visualizations produced using both Starlight and In-Spire visual analysis software. The results are definitional, showing current attitudes within the Information Assurance research community towards risk management strategies, while simultaneously demonstrating the value of visual analysis processes when engaging in sense making of a large body of knowledge.",Victoria L. Lemieux;Barbara Endicott-Popovsky;Karl Eckler;Thomas Dang;Adam Jansen,Victoria Lemieux;Barbara Endicott-Popovsky;Karl Eckler;Thomas Dang;Adam Jansen,"University of British Columbia, USA;University of Washington, USA;University of Washington, USA;University of British Columbia, USA;University of British Columbia, USA",,,0,0,2,
VAST,2011,Pexel and heatmap visual analysis of multidimensional gun/homicide data,10.1109/VAST.2011.6102482,http://dx.doi.org/10.1109/VAST.2011.6102482,297,298,M,"We present a visual analysis tool for mining correlations in county-level, multidimensional gun/homicide data. The tool uses 2D pexels, heatmaps, linked-views, dynamic queries and details-on-demand to analyze annual county-level data on firearm homicide rates and gun availability, as well as various socio-demographic measures. A statistical significance filter was implemented as a visual means to validate exploratory hypotheses. Results from expert evaluations indicate that our methods outperform typical graphical techniques used by statisticians, such as bar graphs, scatterplots and residual plots, to show spatial and temporal relationships. Our visualization has the potential to convey the impact of gun availability on firearm homicides to the public health arena and the general public.",Scott D. Rothenberger;John E. Wenskovitch;G. Elisabeta Marai,Scott D. Rothenberger;John E. Wenskovitch;G. Elisabeta Marai,"Department of Statistics, University of Pittsburgh, USA;Department of Computer Science, University of Pittsburgh, USA;Department of Computer Science, University of Pittsburgh, USA",,,0,1,4,
VAST,2011,"City sentinel - VAST 2011 mini challenge 1 award: ""Outstanding integration of computational and visual methods""",10.1109/VAST.2011.6102485,http://dx.doi.org/10.1109/VAST.2011.6102485,305,306,M,"We present City Sentinel, an in-house built visual analytic software capable of handling a large collection of textual documents by combining diverse text mining and visualization tools. We applied this tool for the Vast Challenge 2011, Mini Challenge 1 over millions of tweet messages. We demonstrate how City Sentinel aided the analyst in retrieving the hidden information from the tweet messages to analyze and locate a hypothetical epidemic outbreak.",Norbert Bánfi;László Dudás;Zsolt Fekete;Julianna Göbölös-Szabó;András Lukács;Ádám Nagy;Adrienn Szabó;Zoltán Szabó 0002;Gábor Szücs,N. Bánfi;L. Dudás;Zs. Fekete;J. Göbö lös-Szabó;A. Lukács;Á. Nagy;A. Szabó;Z. Szabó;G. Szűcs,"Computer and Automation Research Institute (MTA SZTAKI), Hungarian Academy of Sciences, Hungary;Computer and Automation Research Institute (MTA SZTAKI), Hungarian Academy of Sciences, Hungary;Computer and Automation Research Institute (MTA SZTAKI), Hungarian Academy of Sciences, Hungary;Data Mining and Web Search Group, Hungary;Computer and Automation Research Institute (MTA SZTAKI), Hungarian Academy of Sciences, Hungary;Computer and Automation Research Institute (MTA SZTAKI), Hungarian Academy of Sciences, Hungary;Computer and Automation Research Institute (MTA SZTAKI), Hungarian Academy of Sciences, Hungary;Computer and Automation Research Institute (MTA SZTAKI), Hungarian Academy of Sciences, Hungary;Computer and Automation Research Institute (MTA SZTAKI), Hungarian Academy of Sciences, Hungary",,,0,0,3,
VAST,2011,Mapping an epidemic outbreak: Effective analysis and presentation,10.1109/VAST.2011.6102486,http://dx.doi.org/10.1109/VAST.2011.6102486,307,308,M,"The microblog challenge presented an opportunity to use commercial software for visual analysis. An epidemic outbreak occurred in the city of Vastopolis, requiring visualizations of symptoms and their spread over time. Using these tools, analysts could successfully identify the outbreak's origin and pattern of dispersion. The maps used to analyze the data and present the results provided clear, easily understood representations, and presented a logical explanation of a complex progression of events.",Kevin Boone;Edward Swing,Kevin Boone;Edward Swing,"Vision Systems &amp; Technology, Inc., a SAS Company, Australia;Vision Systems &amp; Technology, Inc., a SAS Company, Australia",,,0,0,1,
VAST,2011,MobileAnalymator: Animating data changes on mobile devices,10.1109/VAST.2011.6102490,http://dx.doi.org/10.1109/VAST.2011.6102490,313,314,M,"MobileAnalymator (Mobile Analysis Animator) is a visual analytic system designed to analyze geospatial-temporal data on mobile devices. The system is an Internet based application that allows analysts to work in flexile enviornments at anytime. Its client side is developed by Adobe Flash to animate and interact with data. The server side uses Java and MySQL to query, compute, and serve data. The analyst can run the analytical task from a tablet (or computer) with Internet connection. MobileAnalymator adopted spatial and temporal autocorrelations in the interface design and integrated tangible interaction in the navigation to support analysis process.",Victor Y. Chen;Cheryl Z. Qian;Li Zhang,Yingjie Victor Chen;Zhenyu Cheryl Qian;Li Zhang,"Interaction Design, Purdue University, USA;Interaction Design, Purdue University, USA;Interaction Design, Purdue University, USA",,,0,1,3,
VAST,2012,VDQAM: A toolkit for database quality evaluation based on visual morphology,10.1109/VAST.2012.6400531,http://dx.doi.org/10.1109/VAST.2012.6400531,245,246,M,"Data quality evaluation is one of the most critical steps during the data mining processes. Data with poor quality often leads to poor performance in data mining, low efficiency in data analysis, wrong decision which bring great economic loss to users and organizations further. Although many researches have been carried out from various aspects of the extracting, transforming, and loading processes in data mining, most researches pay more attention to analysis automation than to data quality evaluation. To address the data quality evaluation issues, we propose an approach to combine human beings' powerful cognitive abilities in data quality evaluation with the high efficiency ability of computer, and develop a visual analysis method for data quality evaluation based on visual morphology.",Dongxing Teng;Haiyan Yang;CuiXia Ma;Hongan Wang,Dongxing Teng;Haiyan Yang;Cuixia Ma;Hongan Wang,"Institute of Software, Chinese Academy of Sciences, Beijing, China;Institute of Software, Chinese Academy of Sciences, Beijing, China;Institute of Software, Chinese Academy of Sciences, Beijing, China;Institute of Software, Chinese Academy of Sciences, Beijing, China",,,0,0,7,
VAST,2012,Infographics at the Congressional Budget Office,10.1109/VAST.2012.6400533,http://dx.doi.org/10.1109/VAST.2012.6400533,241,242,M,"The Congressional Budget Office (CBO) is an agency of the federal government with about 240 employees that provides the U.S. Congress with timely, nonpartisan analysis of important budgetary and economic issues. Recently, CBO began producing static infographics to present its headline stories and to provide information to the Congress in different ways.",Jonathan A. Schwabish,Jonathan A. Schwabish,Congressional Budget Office,,,0,0,2,
VAST,2012,Priming Locus of Control to affect performance,10.1109/VAST.2012.6400535,http://dx.doi.org/10.1109/VAST.2012.6400535,237,238,M,"Recent research suggests that the personality trait Locus of Control (LOC) can be a reliable predictor of performance when learning a new visualization tool. While these results are compelling and have direct implications to visualization design, the relationship between a user's LOC measure and their performance is not well understood. We hypothesize that there is a dependent relationship between LOC and performance; specifically, a person's orientation on the LOC scale directly influences their performance when learning new visualizations. To test this hypothesis, we conduct an experiment with 300 subjects using Amazon's Mechanical Turk. We adapt techniques from personality psychology to manipulate a user's LOC so that users are either primed to be more internally or externally oriented on the LOC scale. Replicating previous studies investigating the effect of LOC on performance, we measure users' speed and accuracy as they use visualizations with varying visual metaphors. Our findings demonstrate that changing a user's LOC impacts their performance. We find that a change in users' LOC results in performance changes.",Alvitta Ottley;R. Jordan Crouser;Caroline Ziemkiewicz;Remco Chang,Alvitta Ottley;R. Jordan Crouser;Caroline Ziemkiewicz;Remco Chang,Tufts University;Tufts University;Brown University;Tufts University,,,0,0,4,
VAST,2012,Using visual analytics to detect problems in datasets collected from photo-sharing services,10.1109/VAST.2012.6400538,http://dx.doi.org/10.1109/VAST.2012.6400538,231,232,M,"Datasets that are collected for research often contain millions of records and may carry hidden pitfalls that are hard to detect. This work demonstrates how visual analytics can be used for identifying problems in the spatial distribution of crawled photographic data in different datasets: Picasa Web Albums, Panoramio, Flickr and Geograph, chosen to be potential data sources for ongoing doctoral research. This poster summary describes a number of problems found in the datasets using visual analytics and suggests that greater attention should be paid to assessing the quality of data gathered from user-generated photographic content. This work is the first part of a three-year PhD project aimed at producing a pedestrian-routing system that can suggest attractive pathways extracted from user-generated photographic content.",Alexander Kachkaev;Jo Wood,Alexander Kachkaev;Jo Wood,"giCentre, City University London;giCentre, City University London",,,0,0,7,
VAST,2012,Time-oriented visualization and anticipation,10.1109/VAST.2012.6400546,http://dx.doi.org/10.1109/VAST.2012.6400546,215,216,M,"Temporal awareness is pivotal to successful real-time dynamic decision making in a wide range of command and control situations; particularly in safety-critical environments. However, little explicit support for operators' temporal awareness is provided by decision support systems (DSS) for time-critical decisions. In the context of functional simulations of naval anti-air warfare and emergency response management, the present study compares operator support provided by two display formats. In both environments, we contrast a baseline condition to a condition in which a temporal display was integrated to the original interface to support operators' temporal awareness. We also wish to establish whether the implementation of time-based DSSs may also come with drawbacks on cognitive functioning and performance.",Cindy Chamberland;François Vachon;Jean-François Gagnon;Simon P. Banbury;Sébastien Tremblay,Cindy Chamberland;François Vachon;Jean-François Gagnon;Simon Banbury;Sébastien Tremblay,"Université Laval;Université Laval;Université Laval;Looking Glass HF, Inc.;Université Laval",,,0,0,8,
VAST,2012,Augmenting visual representation of affectively charged information using sound graphs,10.1109/VAST.2012.6400547,http://dx.doi.org/10.1109/VAST.2012.6400547,213,214,M,"Within the Visual Analytics research agenda there is an interest on studying the applicability of multimodal information representation and interaction techniques for the analytical reasoning process. The present study summarizes a pilot experiment conducted to understand the effects of augmenting visualizations of affectively-charged information using auditory graphs. We designed an audiovisual representation of social comments made to different news posted on a popular website, and their affective dimension using a sentiment analysis tool for short texts. Participants of the study were asked to create an assessment of the affective valence trend (positive or negative) of the news articles using for it, the visualizations and sonifications. The conditions were tested looking for speed/accuracy trade off comparing the visual representation with an audiovisual one. We discuss our preliminary findings regarding the design of augmented information-representation.",Nadya A. Calderón;Bernhard E. Riecke;Brian D. Fisher,Nadya A. Calderon;Bernhard E. Riecke;Brian Fisher,School of Interactive Arts and Technology Simon Fraser University;School of Interactive Arts and Technology Simon Fraser University;School of Interactive Arts and Technology Simon Fraser University,,,0,0,9,
InfoVis,2014,Stenomaps: Shorthand for shapes,10.1109/TVCG.2014.2346274,http://dx.doi.org/10.1109/TVCG.2014.2346274,2053,2062,J,"We address some of the challenges in representing spatial data with a novel form of geometric abstraction-the stenomap. The stenomap comprises a series of smoothly curving linear glyphs that each represent both the boundary and the area of a polygon. We present an efficient algorithm to automatically generate these open, C&lt;sup&gt;1&lt;/sup&gt;-continuous splines from a set of input polygons. Feature points of the input polygons are detected using the medial axis to maintain important shape properties. We use dynamic programming to compute a planar non-intersecting spline representing each polygon's base shape. The results are stylised glyphs whose appearance may be parameterised and that offer new possibilities in the 'cartographic design space'. We compare our glyphs with existing forms of geometric schematisation and discuss their relative merits and shortcomings. We describe several use cases including the depiction of uncertain model data in the form of hurricane track forecasting; minimal ink thematic mapping; and the depiction of continuous statistical data.",Arthur van Goethem;Andreas Reimer;Bettina Speckmann;Jo Wood,Arthur van Goethem;Andreas Reimer;Bettina Speckmann;Jo Wood,TU Eindhoven;Universität Heidelberg;TU Eindhoven;City University London,10.1109/INFVIS.2005.1532145,"Schematisation, Maps, Algorithm, Design",0,0,40,
SciVis,2015,Correlation analysis in multidimensional multivariate time-varying datasets,10.1109/SciVis.2015.7429502,http://dx.doi.org/10.1109/SciVis.2015.7429502,139,140,M,"One of the most vital challenges for weather forecasters is the correlation between two geographical phenomena that are distributed continuously in multidimensional multivariate time-varying datasets. In this research, we have visualized the correlation between Pressure and Temperature in the climate datasets. Pearson correlation is used in this study to measure the major linear relationship between two variables in the dataset. Using glyphs in the spatial location, we highlighted the significant association between variables. Based on the positive or negative slope of correlation lines, we can conclude how much they are correlated. The principal of this research is visualizing the local trend of variables versus each other in multidimensional multivariate time-varying datasets, which needs to be visualized with their spatial locations in meteorological datasets. Using glyphs, not only can we visualize the correlation between two variables in the coordinate system, but we can also discern whether any of these variables is separately increasing or decreasing. Moreover, we can visualize the background color as another variable and see the correlation lines around of a particular zone such as storm area.",Najmeh Abedzadeh,Najmeh Abedzadeh,Mississippi State University,,,0,0,5,
SciVis,2015,Real-time interactive time correction on the GPU,10.1109/SciVis.2015.7429505,http://dx.doi.org/10.1109/SciVis.2015.7429505,145,146,M,"The study of physical phenomena and their dynamic evolution is supported by the analysis and visualization of time-enabled data. In many applications, available data are sparsely distributed in the space-time domain, which leads to incomprehensible visualizations. We present an interactive approach for the dynamic tracking and visualization of measured data particles through advection in a simulated flow. We introduce a fully GPU-based technique for efficient spatio-temporal interpolation, using a kd-tree forest for acceleration. As the user interacts with the system using a time slider, particle positions are reconstructed for the time selected by the user. Our results show that the proposed technique achieves highly accurate parallel tracking for thousands of particles. The rendering performance is mainly affected by the size of the query set.",Mai El-Shehaly;Denis Gracanin;Mohamed A. Gad;JunPeng Wang;Hicham G. Elmongui,Mai Elshehaly;Denis Gračanin;Mohamed Gad;Junpeng Wang;Hicham G. Elmongui,Virginia Tech;Virginia Tech;Ain Shams University;Virginia Tech;Alexandria University,,,0,0,3,
SciVis,2015,Visualizing crossing probabilistic tracts,10.1109/SciVis.2015.7429506,http://dx.doi.org/10.1109/SciVis.2015.7429506,147,148,M,"Diffusion weighted magnetic resonance imaging (dMRI) together with tractography algorithms allow to probe for principal white matter tracts in the living human brain. Specifically, probabilistic tractography quantifies the existence of physical connections to a given seed region as a 3D scalar map of confidence scores. Fiber-Stippling is a visualization for probabilistic tracts that effectively communicates the diffusion pattern, connectivity score, and anatomical context. Unfortunately, it cannot handle multiple diffusion orientations per voxel, which exist in high angular resolution diffusion imaging (HARDI) data. Such data is needed to resolve tracts in complex configurations, such as crossings. In this work, we suggest a visualization based on Fiber-Stippling but sensible to multiple diffusion orientations from HARDI-based diffusion models. With such a technique, it is now possible to visualize probabilistic tracts from HARDI-based tractography algorithms. This implies that tract crossings may now be visualized as crossing stipples, which is an essential step towards an accurate visualization of the neuroanatomy, as crossing tracts are widespread phenomena in the brain.",Mathias Goldau;André Reichenbach;Mario Hlawitschka,Mathias Goldau;André Reichenbach;Mario Hlawitschka,Leipzig University;Leipzig University;Leipzig University,,,0,0,10,
SciVis,2015,An evaluation of three methods for visualizing uncertainty in architecture and archaeology,10.1109/SciVis.2015.7429507,http://dx.doi.org/10.1109/SciVis.2015.7429507,149,150,M,"This project explores the representation of uncertainty in visualizations for archaeological research and provides insights obtained from user feedback. Our 3D models brought together information from standing architecture and excavated remains, surveyed plans, ground penetrating radar (GPR) data from the Carthusian monastery of Bourgfontaine in northern France. We also included information from comparative Carthusian sites and a bird's eye representation of the site in an early modern painting. Each source was assigned a certainty value which was then mapped to a color or texture for the model. Certainty values between one and zero were assigned by one subject matter expert and should be considered qualitative. Students and faculty from the fields of architectural history and archaeology at two institutions interacted with the models and answered a short survey with four questions about each. We discovered equal preference for color and transparency and a strong dislike for the texture model. Discoveries during model building also led to changes of the excavation plans for summer 2015.",Scott Houde;Sheila Bonde;David H. Laidlaw,Scott Houde;Sheila Bonde;David H. Laidlaw,Brown University;Brown University;Brown University,,,0,0,5,
SciVis,2015,A proposed multivariate visualization taxonomy from user data,10.1109/SciVis.2015.7429511,http://dx.doi.org/10.1109/SciVis.2015.7429511,157,158,M,"We revisited past user study data on multivariate visualizations, looking at whether image processing measures offer any insight into user performance. While we find statistically significant correlations, some of the greatest insights into user performance came from variables that have strong ties to two key properties of multivariate representations. We discuss our analysis and propose a taxonomy of multivariate visualizations that arises.",Mark A. Livingston;Jonathan W. Decker;Zhuming Ai,Mark A. Livingston;Jonathan W. Decker;Zhuming Ai,,,,0,0,8,
SciVis,2015,PathlinesExplorer ??? Image-based exploration of large-scale pathline fields,10.1109/SciVis.2015.7429512,http://dx.doi.org/10.1109/SciVis.2015.7429512,159,160,M,"PathlinesExplorer is a novel image-based tool, which has been designed to visualize large scale pathline fields on a single computer [7]. PathlinesExplorer integrates explorable images (EI) technique [4] with order-independent transparency (OIT) method [2]. What makes this method different is that it allows users to handle large data on a single workstation. Although it is a view-dependent method, PathlinesExplorer combines both exploration and modification of visual aspects without re-accessing the original huge data. Our approach is based on constructing a per-pixel linked list data structure in which each pixel contains a list of pathline segments. With this view-dependent method, it is possible to filter, color-code, and explore large-scale flow data in real-time. In addition, optimization techniques such as early-ray termination and deferred shading are applied, which further improves the performance and scalability of our approach.",Omniah H. Nagoor;Markus Hadwiger;Madhusudhanan Srinivasan,Omniah H. Nagoor;Markus Hadwiger;Madhusudhanan Srinivasan,KAUST;KAUST;KAUST,,,0,0,7,
SciVis,2015,Visualizing 3D flow through cutting planes,10.1109/SciVis.2015.7429513,http://dx.doi.org/10.1109/SciVis.2015.7429513,161,162,M,Studies have found conflicting results regarding the effectiveness of tube-like structures for representing 3D flow data. This paper presents the findings of a small-scale pilot study contrasting static monoscopic depth cues to ascertain their importance in perceiving the orientation of a three-dimensional glyph with respect to a cutting plane. A simple striped texture and shading were found to reduce judgement errors when used with a 3D tube glyph as compared to plain or shaded line glyphs. A discussion of considerations for a full-scale study and possible future work follows.,Colin Ware;Andrew H. Stevens,Colin Ware;Andrew H. Stevens,University of New Hampshire;University of New Hampshire,,,0,0,6,
SciVis,2015,High performance flow field visualization with high-order access dependencies,10.1109/SciVis.2015.7429515,http://dx.doi.org/10.1109/SciVis.2015.7429515,165,166,M,"We present a novel model based on high-order access dependencies for high performance pathline computation in flow field. The high-order access dependencies are defined as transition probabilities from one data block to other blocks based on a few historical data accesses. Compared with existing methods which employed first-order access dependencies, our approach takes the advantages of high order access dependencies with higher accuracy and reliability in data access prediction. In our work, high-order access dependencies are calculated by tracing densely-seeded pathlines. The efficiency of our proposed approach is demonstrated through a parallel particle tracing framework with high-order data prefetching. Results show that our method can achieve higher data locality than the first-order access dependencies based method, thereby reducing the I/O requests and improving the efficiency of pathline computation in various applications.",Jiang Zhang 0002;Hanqi Guo 0001;Xiaoru Yuan,Jiang Zhang;Hanqi Guo;Xiaoru Yuan,"Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University;Argonne National Laboratory;Key Laboratory of Machine Perception (Ministry of Education), and School of EECS, Peking University",,,0,0,4,
VAST,2015,HTMVS: Visualizing hierarchical topics and their evolution,10.1109/VAST.2015.7347675,http://dx.doi.org/10.1109/VAST.2015.7347675,195,196,M,"Topic model has been an active research area for many years, it can be used for discovering latent semantics and finding hidden knowledge in unstructured data corpus. In this paper, we investigated the problems in visualizing hierarchical topic and their evolution. The contribution of this paper is threefold, first we explore the static visualization of hierarchical topics using the `nested circle' layout, and then in order to present the topic evolution over time, we extended a hierarchical topic model and employ topic transformation visualizations to track the arising, splitting and disappearing of certain topics under the dynamic topical hierarchy. Finally, a Hierarchical Topic Model Visualization System (HTMVS) is designed to take advantage of both static and dynamic hierarchical topic visualization.",Haoling Dong;Siliang Tang;Si Li;Fei Wu 0001;Yueting Zhuang,Haoling Dong;Siliang Tang;Si Li;Fei Wu;Yueting Zhuang,"College of Computer Science, Zhejiang University, Hangzhou, China;College of Computer Science, Zhejiang University, Hangzhou, China;College of Computer Science, Zhejiang University, Hangzhou, China;College of Computer Science, Zhejiang University, Hangzhou, China;College of Computer Science, Zhejiang University, Hangzhou, China",,,0,0,6,
VAST,2015,Interactive semi-automatic categorization for spinel group minerals,10.1109/VAST.2015.7347676,http://dx.doi.org/10.1109/VAST.2015.7347676,197,198,M,"Spinel group minerals are excellent indicators of geological environments (tectonic settings). In 2001, Barnes and Roeder defined a set of contours corresponding to compositional fields for spinel group minerals. Geologists typically use this contours to estimate the tectonic environment where a particular spinel composition could have been formed. This task is prone to errors and requires tedious manual comparison of overlapping diagrams. We introduce a semi-automatic, interactive detection of tectonic settings for an arbitrary dataset based on the Barnes and Roeder contours. The new approach integrates the mentioned contours and includes a novel interaction called contour brush. The new methodology is integrated in the Spinel Explorer system and it improves the scientist's workflow significantly.",Maria Luján Ganuza;Maria Florencia Gargiulo;Gabriela Ferracutti;Silvia Mabel Castro;Ernesto A. Bjerg;M. Eduard Gröller;Kresimir Matkovic,María Luján Ganuza;Florencia Gargiulo;Gabriela Ferracutti;Silvia Castro;Ernesto Bjerg;Eduard Gröller;Krešimir Matković,"VyGLab, UNS, USA;INGEOSUR CONICET, Argentina;INGEOSUR CONICET, Argentina;VyGLab, UNS, USA;INGEOSUR CONICET, Argentina;TU Wien, Austria;VRVis, Austria",,,0,1,5,
VAST,2015,A System for visual exploration of caution spots from vehicle recorder data,10.1109/VAST.2015.7347677,http://dx.doi.org/10.1109/VAST.2015.7347677,199,200,M,"It is vital for the transportation industry, which performs most of its work by automobiles, to reduce its accident rate. This paper proposes a 3D visual interaction method for exploring caution areas from large-scale vehicle recorder data. Our method provides (i) a flexible filtering interface for driving operations such as braking or handling operations by various combinations of their attribute values such as velocity and acceleration, and (ii) a 3D visual environment for spatio-temporal exploration of caution areas. The proposed method was able to extract caution areas where some accidents have actually occurred or that are on very narrow roads with bad visibility by using real data given by one of the biggest transportation companies in Japan.",Masahiko Itoh;Daisaku Yokoyama;Masashi Toyoda;Masaru Kitsuregawa,Masahiko Itoh;Daisaku Yokoyama;Masashi Toyoda;Masaru Kitsuregawa,"The University of Tokyo, and National Institute of Information and Communications Technology, Japan;The University of Tokyo, Japan;The University of Tokyo, Japan;National Institute of Informatics, and The University of Tokyo, Japan",,,0,0,4,
VAST,2015,Using visualization and analysis with efficient dimension Reduction to determine underlying factors in hospital inpatient procedure costs,10.1109/VAST.2015.7347680,http://dx.doi.org/10.1109/VAST.2015.7347680,205,206,M,"The Centers for Medicare and Medicaid Services (CMS) has made public a data set showing what hospitals charged and what Medicare paid for the one hundred most common inpatient stays. Here we present the application of Reduced Basis Decomposition (RBD), an efficient novel dimension reduction algorithm for data processing, to the CMS data. This was paired with a comparative visual exploration of the results when put into context with characteristics of the hospitals and marketplaces in which they operate. We used Weave Analyst, a new web-based analysis and visualization environment, to visualize the relationship between the hospital groups, their charge levels, and distinguishing indicator variables. Particular insights to the relatively small number of underlying factors that exert greatest influence on hospital pricing surfaced thanks to the combined synergetic integration of the modeling, reduction, and visualization techniques.",Miriam Perkins;Yanlai Chen,Miriam Perkins;Yanlai Chen,"University of Massachusetts Lowell, USA;University of Massachusetts Dartmouth, USA",,,0,0,6,
VAST,2015,Tell me what do you see: Detecting perceptually-separable visual patterns via clustering of image-space features in visualizations,10.1109/VAST.2015.7347683,http://dx.doi.org/10.1109/VAST.2015.7347683,211,212,M,"Visualization helps users infer structures and relationships in the data by encoding information as visual features that can be processed by the human visual-perceptual system. However, users would typically need to expend significant effort to scan and analyze a large number of views before they can begin to recognize relationships in a visualization. We propose a technique to partially automate the process of analyzing visualizations. By deriving and analyzing image-space features from visualizations, we can detect perceptually-separable patterns in the information space. We summarize these patterns with a tree-based meta-visualization and present it to the user to aid exploration. We illustrate this technique with an example scenario involving the analysis of census data.",Khairi Reda;Alberto Gonzalez;Jason Leigh;Michael E. Papka,Khairi Reda;Alberto González;Jason Leigh;Michael E. Papka,"Argonne National Laboratory, USA;University of Hawai'i at Mānoa, USA;University of Hawai'i at Mānoa, USA;Argonne National Laboratory, USA",,,0,1,6,
VAST,2015,Visual Pruner: Visually guided cohort selection for observational studies,10.1109/VAST.2015.7347685,http://dx.doi.org/10.1109/VAST.2015.7347685,215,216,M,"Observational studies are a widely used and challenging class of studies. A key challenge is selecting a study cohort from the available data, or “pruning” the data, in a way that produces both sufficient balance in pre-treatment covariates and an easily described cohort from which results can be generalized. Even with advanced pruning methods, it is often difficult for researchers to see how the cohort is being selected; consequently, these methods are underutilized in research. Visual Pruner is a free, easy-to-use web application that can improve both the credibility and generalizability of observational studies by letting analysts use updatable visual displays of estimated propensity scores and key baseline covariates to refine inclusion criteria. By helping researchers see how covariate distributions in their data relate to the estimated probabilities of treatment assignment, the app lets researchers make pruning decisions based on pre-treatment covariate patterns that are otherwise hard to discover. The app yields a set of inclusion criteria that can be used in conjunction with further statistical analysis in any statistical software.",Lauren R. Samuels;Robert A. Greevy Jr.,Lauren R. Samuels;Robert A. Greevy,"Department of Biostatistics, Vanderbilt University School of Medicine, USA;Department of Biostatistics, Vanderbilt University School of Medicine, USA",,,0,0,10,
VAST,2015,Evolution inspector: Interactive visual analysis for evolutionary molecular design,10.1109/VAST.2015.7347687,http://dx.doi.org/10.1109/VAST.2015.7347687,219,220,M,"De novo design is a computational-chemistry method, where a computer program utilizes an optimization method, in our case an evolutionary algorithm, to design compounds with desired chemical properties. The optimization is performed with respect to a quantity called fitness, defined by the chemists. We present a tool that connects interactive visual analysis and evolutionary algorithm-based molecular design. We employ linked views to communicate different aspects of the data: the statistical distribution of molecule fitness, connections between individual molecules during the evolution and 3D molecular structure. The application is already used by chemists to explore and analyze the results of their evolution experiments and has proved to be highly useful.",Veronika Soltészová;Marco Foscato;Sondre H. Eliasson;Vidar R. Jensen,Veronika Solteszova;Marco Foscato;Sondre H. Eliasson;Vidar R. Jensen,"Christian Michelsen Research, Bergen, Norway;Department of Chemistry, University of Bergen, Norway;Department of Chemistry, University of Bergen, Norway;Department of Chemistry, University of Bergen, Norway",,,0,0,10,
VAST,2015,Trending pool: Visual analytics for trending event compositions for time-series categorical log data,10.1109/VAST.2015.7347688,http://dx.doi.org/10.1109/VAST.2015.7347688,221,222,M,"Although many visualization tools provide us plenty of ways to view the data, users can not easily find the trending events and their explanation from the data. In this work, we address the issue by leveraging the real music streaming log data as an example to better understand a million-scale dataset. Trending event explanation turns out to be challenging when it comes to categorical log data. Therefore, we propose to use a learning-based method with an interface design to uncover the trending event compositions for time-series categorical log data, which can be extend to other datasets, e.g., the hashtags in social media. First, we perform “trending pool” operation to save the memory and time cost. Second, we apply sparse coding to learn important trending candidate combination sets instead of traditional brute-force way or manual investigation for generating combinations. Besides the contributions above, we also observe some interesting user behaviors by exploring detected trending candidate combinations visually through our interface.",Yi-Chih Tsai;Liang-Chi Hsieh;Wen-Feng Cheng;Yin-Hsi Kuo;Winston H. Hsu;Wen-Chin Chen,Yi-Chih Tsai;Liang-Chi Hsieh;Wen-Feng Cheng;Yin-Hsi Kuo;Winston Hsu;Wen-Chin Chen,"National Taiwan University, Taipei, Taiwan;National Taiwan University, Taipei, Taiwan;National Taiwan University, Taipei, Taiwan;National Taiwan University, Taipei, Taiwan;National Taiwan University, Taipei, Taiwan;National Taiwan University, Taipei, Taiwan",,,0,0,4,
SciVis,2016,Hairy Slices: Evaluating the Perceptual Effectiveness of Cutting Plane Glyphs for 3D Vector Fields,10.1109/TVCG.2016.2598448,http://dx.doi.org/10.1109/TVCG.2016.2598448,990,999,J,"Three-dimensional vector fields are common datasets throughout the sciences. Visualizing these fields is inherently difficult due to issues such as visual clutter and self-occlusion. Cutting planes are often used to overcome these issues by presenting more manageable slices of data. The existing literature provides many techniques for visualizing the flow through these cutting planes; however, there is a lack of empirical studies focused on the underlying perceptual cues that make popular techniques successful. This paper presents a quantitative human factors study that evaluates static monoscopic depth and orientation cues in the context of cutting plane glyph designs for exploring and analyzing 3D flow fields. The goal of the study was to ascertain the relative effectiveness of various techniques for portraying the direction of flow through a cutting plane at a given point, and to identify the visual cues and combinations of cues involved, and how they contribute to accurate performance. It was found that increasing the dimensionality of line-based glyphs into tubular structures enhances their ability to convey orientation through shading, and that increasing their diameter intensifies this effect. These tube-based glyphs were also less sensitive to visual clutter issues at higher densities. Adding shadows to lines was also found to increase perception of flow direction. Implications of the experimental results are discussed and extrapolated into a number of guidelines for designing more perceptually effective glyphs for 3D vector field visualizations.",Andrew H. Stevens;Thomas Butkiewicz;Colin Ware,Andrew H. Stevens;Thomas Butkiewicz;Colin Ware,The Center for Coastal and Ocean MappingThe University of New Hampshire;The Center for Coastal and Ocean MappingThe University of New Hampshire;The Center for Coastal and Ocean MappingThe University of New Hampshire,10.1109/VISUAL.1996.568139;10.1109/TVCG.2009.126;10.1109/VISUAL.2005.1532859;10.1109/VISUAL.2004.59;10.1109/VISUAL.1991.175792;10.1109/TVCG.2012.216;10.1109/VISUAL.1999.809918;10.1109/VISUAL.1998.745317;10.1109/VISUAL.2005.1532772;10.1109/TVCG.2009.138;10.1109/VISUAL.1990.146360;10.1109/VISUAL.1996.567777,Flow visualization;3D vector fields;Cutting planes;Glyphs;Perception;Evaluation;Human factors,0,0,47,
VAST,2016,AnaFe: Visual Analytics of Image-derived Temporal Features Focusing on the Spleen,10.1109/TVCG.2016.2598463,http://dx.doi.org/10.1109/TVCG.2016.2598463,171,180,J,"We present a novel visualization framework, AnaFe, targeted at observing changes in the spleen over time through multiple image-derived features. Accurate monitoring of progressive changes is crucial for diseases that result in enlargement of the organ. Our system is comprised of multiple linked views combining visualization of temporal 3D organ data, related measurements, and features. Thus it enables the observation of progression and allows for simultaneous comparison within and between the subjects. AnaFe offers insights into the overall distribution of robustly extracted and reproducible quantitative imaging features and their changes within the population, and also enables detailed analysis of individual cases. It performs similarity comparison of temporal series of one subject to all other series in both sick and healthy groups. We demonstrate our system through two use case scenarios on a population of 189 spleen datasets from 68 subjects with various conditions observed over time.",Ievgeniia Gutenko;Konstantin Dmitriev;Arie E. Kaufman;Matthew A. Barish,Ievgeniia Gutenko;Konstantin Dmitriev;Arie E. Kaufman;Matthew A. Barish,"Computer Science Department, Stony Brook University, NY;Computer Science Department, Stony Brook University, NY;Computer Science Department, Stony Brook University, NY;Computer Science Department, Stony Brook University, NY",10.1109/TVCG.2014.2346591;10.1109/TVCG.2009.152;10.1109/TVCG.2015.2467622;10.1109/TVCG.2014.2346682;10.1109/TVCG.2012.225;10.1109/VISUAL.2000.885739;10.1109/TVCG.2013.200;10.1109/VAST.2006.261421,Visual Knowledge Discovery;Temporal Feature Analysis;Radiomics;Spleen;Abdominal Imaging,0,1,48,
VAST,2017,QSAnglyzer: Visual Analytics for Prismatic Analysis of Question Answering System Evaluations,10.1109/VAST.2017.8585733,http://dx.doi.org/10.1109/VAST.2017.8585733,48,58,C,"Developing sophisticated artificial intelligence (AI) systems requires AI researchers to experiment with different designs and analyze results from evaluations (we refer this task as evaluation analysis). In this paper, we tackle the challenges of evaluation analysis in the domain of question-answering (QA) systems. Through in-depth studies with QA researchers, we identify tasks and goals of evaluation analysis and derive a set of design rationales, based on which we propose a novel approach termed prismatic analysis. Prismatic analysis examines data through multiple ways of categorization (referred as angles). Categories in each angle are measured by aggregate metrics to enable diverse comparison scenarios. To facilitate prismatic analysis of QA evaluations, we design and implement the Question Space Anglyzer (QSAnglyzer), a visual analytics (VA) tool. In QSAnglyzer, the high-dimensional space formed by questions is divided into categories based on several angles (e.g., topic and question type). Each category is aggregated by accuracy, the number of questions, and accuracy variance across evaluations. QSAnglyzer visualizes these angles so that QA researchers can examine and compare evaluations from various aspects both individually and collectively. Furthermore, QA researchers filter questions based on any angle by clicking to construct complex queries. We validate QSAnglyzer through controlled experiments and by expert reviews. The results indicate that when using QSAnglyzer, users perform analysis tasks faster (p &lt;; 0.01) and more accurately (p &lt;; 0.05), and are quick to gain new insight. We discuss how prismatic analysis and QSAnglyzer scaffold evaluation analysis, and provide directions for future research.",Nan-Chen Chen;Been Kim,Nan-Chen Chen;Been Kim,University of Washington;Allen Institute for Artificial Intelligence,10.1109/VAST.2015.7347637;10.1109/INFVIS.2000.885091;10.1109/VAST.2012.6400488,"visual analytics,visualization,interactive visualization,question answering,multi-experiment analysis,visual comparison,visual exploration,prismatic analysis,H.5.2 [Information Interfaces and Presentation]: User Interfaces—",0,0,34,
InfoVis,2018,iStoryline: Effective Convergence to Hand-drawn Storylines,10.1109/TVCG.2018.2864899,http://dx.doi.org/10.1109/TVCG.2018.2864899,769,778,J,"Storyline visualization techniques have progressed significantly to generate illustrations of complex stories automatically. However, the visual layouts of storylines are not enhanced accordingly despite the improvement in the performance and extension of its application area. Existing methods attempt to achieve several shared optimization goals, such as reducing empty space and minimizing line crossings and wiggles. However, these goals do not always produce optimal results when compared to hand-drawn storylines. We conducted a preliminary study to learn how users translate a narrative into a hand-drawn storyline and check whether the visual elements in hand-drawn illustrations can be mapped back to appropriate narrative contexts. We also compared the hand-drawn storylines with storylines generated by the state-of-the-art methods and found they have significant differences. Our findings led to a design space that summarizes (1) how artists utilize narrative elements and (2) the sequence of actions artists follow to portray expressive and attractive storylines. We developed iStoryline, an authoring tool for integrating high-level user interactions into optimization algorithms and achieving a balance between hand-drawn storylines and automatic layouts. iStoryline allows users to create novel storyline visualizations easily according to their preferences by modifying the automatically generated layouts. The effectiveness and usability of iStoryline are studied with qualitative evaluations.",Tan Tang;Sadia Rubab;Jiewen Lai;Weiwei Cui;Lingyun Yu;Yingcai Wu,Tan Tang;Sadia Rubab;Jiewen Lai;Weiwei Cui;Lingyun Yu;Yingcai Wu,"State Key Lab of CAD&CGZhejiang UniversityAlibaba-Zhejiang UniversityJoint Institute of Frontier Technologies;State Key Lab of CAD&CGZhejiang UniversityAlibaba-Zhejiang UniversityJoint Institute of Frontier Technologies;State Key Lab of CAD&CGZhejiang UniversityAlibaba-Zhejiang UniversityJoint Institute of Frontier Technologies;Microsoft Research;Bernoulli Institute, University of Groningen, Netherlands;State Key Lab of CAD&CGZhejiang UniversityAlibaba-Zhejiang UniversityJoint Institute of Frontier Technologies",10.1109/TVCG.2016.2598647;10.1109/VAST.2017.8585487;10.1109/TVCG.2017.2743990;10.1109/TVCG.2009.109;10.1109/TVCG.2015.2467531;10.1109/TVCG.2015.2467451;10.1109/TVCG.2016.2598620;10.1109/TVCG.2013.191;10.1109/TVCG.2016.2598831;10.1109/TVCG.2013.196;10.1109/TVCG.2014.2346291;10.1109/TVCG.2017.2745878;10.1109/TVCG.2012.212;10.1109/TVCG.2014.2346913,"Hand-drawn illustrations,automatic layout,design space,interactions,optimization",0,4,44,
InfoVis,2018,Patterns and Pace: Quantifying Diverse Exploration Behavior with Visualizations on the Web,10.1109/TVCG.2018.2865117,http://dx.doi.org/10.1109/TVCG.2018.2865117,501,511,J,"The diverse and vibrant ecosystem of interactive visualizations on the web presents an opportunity for researchers and practitioners to observe and analyze how everyday people interact with data visualizations. However, existing metrics of visualization interaction behavior used in research do not fully reveal the breadth of peoples' open-ended explorations with visualizations. One possible way to address this challenge is to determine high-level goals for visualization interaction metrics, and infer corresponding features from user interaction data that characterize different aspects of peoples' explorations of visualizations. In this paper, we identify needs for visualization behavior measurement, and develop corresponding candidate features that can be inferred from users' interaction data. We then propose metrics that capture novel aspects of peoples' open-ended explorations, including exploration uniqueness and exploration pacing. We evaluate these metrics along with four other metrics recently proposed in visualization literature by applying them to interaction data from prior visualization studies. The results of these evaluations suggest that these new metrics 1) reveal new characteristics of peoples' use of visualizations, 2) can be used to evaluate statistical differences between visualization designs, and 3) are statistically independent of prior metrics used in visualization research. We discuss implications of these results for future studies, including the potential for applying these metrics in visualization interaction analysis, as well as emerging challenges in developing and selecting metrics depicting visualization explorations.",Mi Feng;Evan M. Peck;Lane Harrison,Mi Feng;Evan Peck;Lane Harrison,Worcester Polytechnic Institute;Bucknell University;Worcester Polytechnic Institute,10.1109/TVCG.2011.229;10.1109/TVCG.2015.2467871;10.1109/TVCG.2015.2467201;10.1109/TVCG.2014.2346575;10.1109/VAST.2007.4389009;10.1109/TVCG.2016.2599058;10.1109/TVCG.2015.2467613;10.1109/TVCG.2008.137;10.1109/VAST.2007.4389008;10.1109/TVCG.2014.2346452;10.1109/TVCG.2016.2598797;10.1109/TVCG.2013.200;10.1109/TVCG.2016.2598466;10.1109/VAST.2017.8585669;10.1109/TVCG.2017.2745958;10.1109/TVCG.2007.70515,"Interaction,Visualization,Quantitative Evaluation",0,3,46,
InfoVis,2018,Narvis: Authoring Narrative Slideshows for Introducing Data Visualization Designs,10.1109/TVCG.2018.2865232,http://dx.doi.org/10.1109/TVCG.2018.2865232,779,788,J,"Visual designs can be complex in modern data visualization systems, which poses special challenges for explaining them to the non-experts. However, few if any presentation tools are tailored for this purpose. In this study, we present Narvis, a slideshow authoring tool designed for introducing data visualizations to non-experts. Narvis targets two types of end users: teachers, experts in data visualization who produce tutorials for explaining a data visualization, and students, non-experts who try to understand visualization designs through tutorials. We present an analysis of requirements through close discussions with the two types of end users. The resulting considerations guide the design and implementation of Narvis. Additionally, to help teachers better organize their introduction slideshows, we specify a data visualization as a hierarchical combination of components, which are automatically detected and extracted by Narvis. The teachers craft an introduction slideshow through first organizing these components, and then explaining them sequentially. A series of templates are provided for adding annotations and animations to improve efficiency during the authoring process. We evaluate Narvis through a qualitative analysis of the authoring experience, and a preliminary evaluation of the generated slideshows.",Qianwen Wang;Zhen Li;Siwei Fu;Weiwei Cui;Huamin Qu,Qianwen Wang;Zhen Li;Siwei Fu;Weiwei Cui;Huamin Qu,Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Microsoft Research Asia;Hong Kong University of Science and Technology,10.1109/TVCG.2016.2598647;10.1109/TVCG.2009.174;10.1109/TVCG.2016.2598876;10.1109/TVCG.2015.2467196;10.1109/TVCG.2011.239;10.1109/VAST.2007.4388992;10.1109/TVCG.2015.2467531;10.1109/TVCG.2007.70539;10.1109/TVCG.2013.119;10.1109/TVCG.2013.191;10.1109/TVCG.2010.183,"Education,Narrative Visualization,Authoring Tools",0,3,42,
SciVis,2018,Visualization of Bubble Formation in Porous Media,10.1109/TVCG.2018.2864506,http://dx.doi.org/10.1109/TVCG.2018.2864506,1060,1069,J,"We present a visualization approach for the analysis of CO<sub>2</sub>bubble-induced attenuation in porous rock formations. As a basis for this, we introduce customized techniques to extract CO<sub>2</sub>bubbles and their surrounding porous structure from X-ray computed tomography data (XCT) measurements. To understand how the structure of porous media influences the occurrence and the shape of formed bubbles, we automatically classify and relate them in terms of morphology and geometric features, and further directly support searching for promising porous structures. To allow for the meaningful direct visual comparison of bubbles and their structures, we propose a customized registration technique considering the bubble shape as well as its points of contact with the porous media surface. With our quantitative extraction of geometric bubble features, we further support the analysis as well as the creation of a physical model. We demonstrate that our approach was successfully used to answer several research questions in the domain, and discuss its high practical relevance to identify critical seismic characteristics of fluid-saturated rock that govern its capability to store CO<sub>2</sub>.",Hui Zhang 0027;Steffen Frey;Holger Steeb;David Uribe;Thomas Ertl;Wenping Wang,Hui Zhang;Steffen Frey;Holger Steeb;David Uribe;Thomas Ertl;Wenping Wang,Department of Computer ScienceThe University of Hong Kong;Visualization Research CenterUniversity of Stuttgart;Institute of Applied MechanicsUniversity of Stuttgart;Institute of Applied MechanicsUniversity of Stuttgart;Visualization Research CenterUniversity of Stuttgart;Department of Computer ScienceThe University of Hong Kong,10.1109/VISUAL.2005.1532788;10.1109/TVCG.2007.70603;10.1109/TVCG.2006.124;10.1109/TVCG.2014.2346351;10.1109/TVCG.2013.177;10.1109/TVCG.2012.200;10.1109/VISUAL.2004.48,"3D volume rendering,bubble visualization,porous media",0,0,43,
SciVis,2018,Visual Analysis of Aneurysm Data using Statistical Graphics,10.1109/TVCG.2018.2864509,http://dx.doi.org/10.1109/TVCG.2018.2864509,997,1007,J,"This paper presents a framework to explore multi-field data of aneurysms occurring at intracranial and cardiac arteries by using statistical graphics. The rupture of an aneurysm is often a fatal scenario, whereas during treatment serious complications for the patient can occur. Whether an aneurysm ruptures or whether a treatment is successful depends on the interaction of different morphological such as wall deformation and thickness, and hemodynamic attributes like wall shear stress and pressure. Therefore, medical researchers are very interested in better understanding these relationships. However, the required analysis is a time-consuming process, where suspicious wall regions are difficult to detect due to the time-dependent behavior of the data. Our proposed visualization framework enables medical researchers to efficiently assess aneurysm risk and treatment options. This comprises a powerful set of views including 2D and 3D depictions of the aneurysm morphology as well as statistical plots of different scalar fields. Brushing and linking aids the user to identify interesting wall regions and to understand the influence of different attributes on the aneurysm's state. Moreover, a visual comparison of pre- and post-treatment as well as different treatment options is provided. Our analysis techniques are designed in collaboration with domain experts, e.g., physicians, and we provide details about the evaluation.",Monique Meuschke;Tobias Günther;Philipp Berg;Ralph Wickenhöfer;Bernhard Preim;Kai Lawonn,Monique Meuschke;Tobias Günther;Philipp Berg;Ralph Wickenhöfer;Bernhard Preim;Kai Lawonn,"University of Magdeburg, Germany;ETH Zürich, Switzerland;University of Magdeburg, Germany;Heart of Jesus Hospital, Germany;University of Magdeburg, Germany;University of Koblenz-Landau, Germany",10.1109/TVCG.2011.235;10.1109/TVCG.2014.2346406;10.1109/VISUAL.2000.885739;10.1109/TVCG.2013.139;10.1109/TVCG.2016.2598795;10.1109/TVCG.2016.2598866;10.1109/TVCG.2010.153,"Medical visualizations,aneurysms,blood flow,parametrization",0,1,53,
SciVis,2018,Culling for Extreme-Scale Segmentation Volumes: A Hybrid Deterministic and Probabilistic Approach,10.1109/TVCG.2018.2864847,http://dx.doi.org/10.1109/TVCG.2018.2864847,1132,1141,J,"With the rapid increase in raw volume data sizes, such as terabyte-sized microscopy volumes, the corresponding segmentation label volumes have become extremely large as well. We focus on integer label data, whose efficient representation in memory, as well as fast random data access, pose an even greater challenge than the raw image data. Often, it is crucial to be able to rapidly identify which segments are located where, whether for empty space skipping for fast rendering, or for spatial proximity queries. We refer to this process as<i>culling</i>. In order to enable efficient culling of millions of labeled segments, we present a novel hybrid approach that combines deterministic and probabilistic representations of label data in a data-adaptive hierarchical data structure that we call the label list tree. In each node, we adaptively encode label data using either a probabilistic constant-time access representation for fast conservative culling, or a deterministic logarithmic-time access representation for exact queries. We choose the best data structures for representing the labels of each spatial region while building the label list tree. At run time, we further employ a novel<i>query-adaptive</i>culling strategy. While filtering a query down the tree, we prune it successively, and in each node adaptively select the representation that is best suited for evaluating the pruned query, depending on its size. We show an analysis of the efficiency of our approach with several large data sets from connectomics, including a brain scan with more than 13 million labeled segments, and compare our method to conventional culling approaches. Our approach achieves significant reductions in storage size as well as faster query times.",Johanna Beyer;Haneen Mohammed;Marco Agus;Ali K. Al-Awami;Hanspeter Pfister;Markus Hadwiger,Johanna Beyer;Haneen Mohammed;Marco Agus;Ali K. Al-Awami;Hanspeter Pfister;Markus Hadwiger,"Harvard University, Cambridge, MA, USA;Harvard UniversityKAUST;King Abdullah University of Science and Technology (KAUST), Saudi Arabia;KAUST, Saudi Aramco, Dhahran, Saudi Arabia;Harvard University, Cambridge, MA, USA;King Abdullah University of Science and Technology (KAUST), Saudi Arabia",10.1109/VISUAL.1992.235231;10.1109/TVCG.2013.142;10.1109/TVCG.2009.121;10.1109/VISUAL.2003.1250386;10.1109/TVCG.2012.240;10.1109/VISUAL.2003.1250384;10.1109/VISUAL.1999.809908;10.1109/VISUAL.1995.480792;10.1109/VISUAL.2005.1532792;10.1109/VISUAL.1990.146377;10.1109/VISUAL.2001.964521,"Hierarchical Culling,Segmented Volume Data,Bloom Filter,Volume Rendering,Spatial Queries",0,2,42,
VAST,2018,VUSphere: Visual Analysis of Video Utilization in Online Distance Education,10.1109/VAST.2018.8802383,http://dx.doi.org/10.1109/VAST.2018.8802383,25,35,C,"Online Distance Education (ODE) provides massive course videos of various specialties for students across the country to learn professional knowledge anytime and anywhere. Analyzing the utilization of these videos from user log data can help academics better understand the learning process of students, evaluate the quality of service provided by regional learning centers, and improve the quality of program curriculum in the future. However, due to the lack of comparable indicators, it is a great challenge to discover the utilization patterns of massive videos and analyze the learning process of large-scale student population from learning log data. In this paper, we introduce a visual analytics system, called VUSphere, to explore the video utilization from multiple perspectives with two proposed indicators. This system offers three coordinated views: a spherical layout overview to depict the overall utilization distribution of videos, courses, and students; a detailed statistics view with four panels to present video utilization statistics of each element from multiple perspectives; and a comparison view to examine the differences in individual elements. Based on the real dataset from our ODE school, several patterns related to video utilization and enrollment are found in the case study with our domain experts.",Huan He;Qinghua Zheng;Bo Dong,Huan He;Oinghua Zheng;Bo Dong,"Key Laboratory of Intelligent Networks and Network Security, Ministry of Education, Xi’an Jiaotong University;Key Laboratory of Intelligent Networks and Network Security, Ministry of Education, Xi’an Jiaotong University;School of Continuing Education, Xi’an Jiaotong University",10.1109/TVCG.2016.2598444;10.1109/VAST.2016.7883517;10.1109/TVCG.2015.2467322,"Video utilization pattern,online distance education,visual analytics",0,1,0,
VAST,2018,Segue: Overviewing Evolution Patterns of Egocentric Networks by Interactive Construction of Spatial Layouts,10.1109/VAST.2018.8802415,http://dx.doi.org/10.1109/VAST.2018.8802415,72,83,C,"Getting the overall picture of how a large number of ego-networks evolve is a common yet challenging task. Existing techniques often require analysts to inspect the evolution patterns of ego-networks one after another. In this study, we explore an approach that allows analysts to interactively create spatial layouts in which each dot is a dynamic ego-network. These spatial layouts provide overviews of the evolution patterns of ego-networks, thereby revealing different global patterns such as trends, clusters and outliers in evolution patterns. To let analysts interactively construct interpretable spatial layouts, we propose a data transformation pipeline, with which analysts can adjust the spatial layouts and convert dynamic ego-networks into event sequences to aid interpretations of the spatial positions. Based on this transformation pipeline, we develop Segue, a visual analysis system that supports thorough exploration of the evolution patterns of ego-networks. Through two usage scenarios, we demonstrate how analysts can gain insights into the overall evolution patterns of a large collection of ego-networks by interactively creating different spatial layouts.",Po-Ming Law;Yanhong Wu;Rahul C. Basole,Po-Ming Law;Yanhong Wu;Rahul C. Basole,Georgia Institute of Technology;Visa Research;Georgia Institute of Technology,10.1109/TVCG.2015.2467851;10.1109/VAST.2012.6400486;10.1109/TVCG.2011.226;10.1109/TVCG.2011.188;10.1109/VAST.2016.7883512;10.1109/VAST.2011.6102449;10.1109/TVCG.2013.198;10.1109/TVCG.2015.2467615;10.1109/TVCG.2016.2598446;10.1109/VAST.2015.7347632;10.1109/TVCG.2016.2598797;10.1109/TVCG.2013.200;10.1109/TVCG.2017.2744198;10.1109/TVCG.2015.2468078;10.1109/VAST.2009.5332595;10.1109/TVCG.2015.2468151,"Human-centered computing,Visualization,Visualization techniques,Graph drawings",0,1,0,
VAST,2018,The Effect of Proximity in Social Data Charts on Perceived Unity,10.1109/VAST.2018.8802449,http://dx.doi.org/10.1109/VAST.2018.8802449,1,12,C,"Social data charts - visual presentations of quantitative data about peer behaviors - may offer new means to motivate individuals to participate in group goals. However, to do so these charts need to create a semantic response of `unity' among the chart viewers in order to overcome the problems of social loafing where people act selfishly and undervalue the group's goal. In this paper, we focus on two properties of social data charts that may affect a viewer's perceptions of unity: (1) The skewness in the data structure - the statistical distribution of the social data, and (2) the proximity in the visual structure of the chart - the spatial organization of the data points. We performed a controlled perceptual experiment to examine the effect of proximity and skewness on four different semantic facets of perceived group unity: similarity, entitativity, rapport, and centrality. We exposed 179 participants on Amazon Mechanical Turk to different group charts using a 2 x 2 factorial design, varying both proximity and skewness. Our two-way ANCOVA analyses reveal three important findings: (1) Across all conditions, proximity has a strong positive effect on perceived group unity and conveys a social meaning of group entitativity, as well as, member similarity and rapport; (2) Skewness and proximity interact in a non-linear way, suggesting that skewness creates a negative force that modifies the semantic responses to high proximity; and (3) The perceptual responses to proximity have different semantic facets that are either stable or sensitive to skewness. These findings contribute to perceptual as well as social InfoVis literature.",Marlen Promann;Sabine Brunswicker,Marlen Promann;Sabine Brunswicker,Purdue University;Purdue University,10.1109/TVCG.2017.2746018;10.1109/TVCG.2008.171;10.1109/TVCG.2014.2346419;10.1109/TVCG.2007.70541;10.1109/TVCG.2013.234;10.1109/TVCG.2010.174;10.1109/TVCG.2012.221;10.1109/TVCG.2017.2745240,"Social visualization,information visualization,Human-centered computing,Empirical studies in HCI,Displays and imagers,Social engineering (social sciences),Visualization theory, concepts and paradigms,Gestalt theory,controlled experiment,data density,data spread,perception,group identity,unity,priming",0,0,0,
VAST,2018,SMARTexplore: Simplifying High-Dimensional Data Analysis through a Table-Based Visual Analytics Approach,10.1109/VAST.2018.8802486,http://dx.doi.org/10.1109/VAST.2018.8802486,36,47,C,"We present SMARTEXPLORE, a novel visual analytics technique that simplifies the identification and understanding of clusters, correlations, and complex patterns in high-dimensional data. The analysis is integrated into an interactive table-based visualization that maintains a consistent and familiar representation throughout the analysis. The visualization is tightly coupled with pattern matching, subspace analysis, reordering, and layout algorithms. To increase the analyst's trust in the revealed patterns, SMARTEXPLORE automatically selects and computes statistical measures based on dimension and data properties. While existing approaches to analyzing high-dimensional data (e.g., planar projections and Parallel coordinates) have proven effective, they typically have steep learning curves for non-visualization experts. Our evaluation, based on three expert case studies, confirms that non-visualization experts successfully reveal patterns in high-dimensional data when using SMARTEXPLORE.",Michael Blumenschein;Michael Behrisch 0001;Stefanie Schmid;Simon Butscher;Deborah Wahl;Karoline Villinger;Britta Renner;Harald Reiterer;Daniel A. Keim,Michael Blumenschein;Michael Behrisch;Stefanie Schmid;Simon Butscher;Deborah R. Wahl;Karoline Villinger;Britta Renner;Harald Reiterer;Daniel A. Keim,"University of Konstanz, Germany;Harvard University, USA;University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany",10.1109/INFVIS.2004.46;10.1109/VAST.2010.5652433;10.1109/INFVIS.1998.729559;10.1109/TVCG.2017.2743978;10.1109/TVCG.2011.188;10.1109/VAST.2009.5332611;10.1109/TVCG.2010.184;10.1109/TVCG.2014.2346260;10.1109/TVCG.2013.173;10.1109/TVCG.2015.2467553;10.1109/TVCG.2014.2346248;10.1109/TVCG.2010.138;10.1109/INFVIS.2004.15;10.1109/TVCG.2014.2346279;10.1109/INFVIS.2003.1249016;10.1109/VAST.2009.5332628;10.1109/TVCG.2015.2468078;10.1109/TVCG.2017.2745078;10.1109/TVCG.2017.2744098;10.1109/TVCG.2013.150,"High-dimensional data,visual exploration,pattern-driven analysis,tabular visualization,subspace,aggregation",0,0,0,
InfoVis,2019,A Comparative Evaluation of Animation and Small Multiples for Trend Visualization on Mobile Phones,10.1109/TVCG.2019.2934397,http://dx.doi.org/10.1109/TVCG.2019.2934397,364,374,J,"We compare the efficacy of animated and small multiples variants of scatterplots on mobile phones for comparing trends in multivariate datasets. Visualization is increasingly prevalent in mobile applications and mobile-first websites, yet there is little prior visualization research dedicated to small displays. In this paper, we build upon previous experimental research carried out on larger displays that assessed animated and non-animated variants of scatterplots. Incorporating similar experimental stimuli and tasks, we conducted an experiment where 96 crowdworker participants performed nine trend comparison tasks using their mobile phones. We found that those using a small multiples design consistently completed tasks in less time, albeit with slightly less confidence than those using an animated design. The accuracy results were more task-dependent, and we further interpret our results according to the characteristics of the individual tasks, with a specific focus on the trajectories of target and distractor data items in each task. We identify cases that appear to favor either animation or small multiples, providing new questions for further experimental research and implications for visualization design on mobile devices. Lastly, we provide a reflection on our evaluation methodology.",Matthew Brehmer;Bongshin Lee;Petra Isenberg;Eun Kyoung Choe,Matthew Brehmer;Bongshin Lee;Petra Isenberg;Eun Kyoung Choe,"Microsoft Research;Microsoft Research;Inria;University of Maryland, College Park","10.1109/TVCG.2018.2865142,10.1109/TVCG.2011.185,10.1109/TVCG.2018.2865234,10.1109/TVCG.2016.2598876,10.1109/VISUAL.1993.398879,10.1109/TVCG.2008.125","Evaluation,graphical perception,mobile phones,trend visualization,animation,small multiples,crowdsourcing",0,3,59,
InfoVis,2019,A Comparison of Radial and Linear Charts for Visualizing Daily Patterns,10.1109/TVCG.2019.2934784,http://dx.doi.org/10.1109/TVCG.2019.2934784,1033,1042,J,"Radial charts are generally considered less effective than linear charts. Perhaps the only exception is in visualizing periodical time-dependent data, which is believed to be naturally supported by the radial layout. It has been demonstrated that the drawbacks of radial charts outweigh the benefits of this natural mapping. Visualization of daily patterns, as a special case, has not been systematically evaluated using radial charts. In contrast to yearly or weekly recurrent trends, the analysis of daily patterns on a radial chart may benefit from our trained skill on reading radial clocks that are ubiquitous in our culture. In a crowd-sourced experiment with 92 non-expert users, we evaluated the accuracy, efficiency, and subjective ratings of radial and linear charts for visualizing daily traffic accident patterns. We systematically compared juxtaposed 12-hours variants and single 24-hours variants for both layouts in four low-level tasks and one high-level interpretation task. Our results show that over all tasks, the most elementary 24-hours linear bar chart is most accurate and efficient and is also preferred by the users. This provides strong evidence for the use of linear layouts – even for visualizing periodical daily patterns.",Manuela Waldner;Alexandra Diehl;Denis Gracanin;Rainer Splechtna;Claudio Delrieux;Kresimir Matkovic,Manuela Waldner;Alexandra Diehl;Denis Gračanin;Rainer Splechtna;Claudio Delrieux;Krešimir Matković,TU Wien;University of Zurich;Virginia Tech;VRVis Research Center;Electric and Computer Eng. Dept.Universidad Nacional del SUR and CONICET;VRVis Research Center,"10.1109/TVCG.2013.184,10.1109/TVCG.2018.2865142,10.1109/TVCG.2013.234,10.1109/TVCG.2018.2865234,10.1109/INFVIS.1998.729557,10.1109/TVCG.2010.209,10.1109/TVCG.2014.2346426,10.1109/TVCG.2018.2865077,10.1109/TVCG.2015.2467771,10.1109/TVCG.2010.162,10.1109/TVCG.2018.2865158,10.1109/INFVIS.2000.885091,10.1109/TVCG.2014.2346320,10.1109/INFVIS.2001.963273","Radial charts,time series series data,daily patterns,crowd-sourced experiment",0,0,54,
InfoVis,2019,A Comparison of Visualizations for Identifying Correlation over Space and Time,10.1109/TVCG.2019.2934807,http://dx.doi.org/10.1109/TVCG.2019.2934807,375,385,J,"Observing the relationship between two or more variables over space and time is essential in many domains. For instance, looking, for different countries, at the evolution of both the life expectancy at birth and the fertility rate will give an overview of their demographics. The choice of visual representation for such multivariate data is key to enabling analysts to extract patterns and trends. Prior work has compared geo-temporal visualization techniques for a single thematic variable that evolves over space and time, or for two variables at a specific point in time. But how effective visualization techniques are at communicating correlation between two variables that evolve over space and time remains to be investigated. We report on a study comparing three techniques that are representative of different strategies to visualize geo-temporal multivariate data: either juxtaposing all locations for a given time step, or juxtaposing all time steps for a given location; and encoding thematic attributes either using symbols overlaid on top of map features, or using visual channels of the map features themselves. Participants performed a series of tasks that required them to identify if two variables were correlated over time and if there was a pattern in their evolution. Tasks varied in granularity for both dimensions: time (all time steps, a subrange of steps, one step only) and space (all locations, locations in a subregion, one location only). Our results show that a visualization's effectiveness depends strongly on the task to be carried out. Based on these findings we present a set of design guidelines about geo-temporal visualization techniques for communicating correlation.",Vanessa Peña Araya;Emmanuel Pietriga;Anastasia Bezerianos,Vanessa Peña-Araya;Emmanuel Pietriga;Anastasia Bezerianos,Univ. Paris-SudCNRSINRIAUniversité Paris-Saclay;Univ. Paris-SudCNRSINRIAUniversité Paris-Saclay;Univ. Paris-SudCNRSINRIAUniversité Paris-Saclay,"10.1109/TVCG.2016.2598862,10.1109/TVCG.2011.185,10.1109/TVCG.2015.2467199,10.1109/TVCG.2007.70623,10.1109/TVCG.2014.2346979,10.1109/TVCG.2018.2865141,10.1109/TVCG.2015.2467671,10.1109/TVCG.2011.194,10.1109/TVCG.2008.125,10.1109/TVCG.2013.130,10.1109/TVCG.2015.2467091","geo-temporal data,bivariate maps,correlation,controlled study,bar chart,Dorling cartogram,small multiples",0,0,72,
InfoVis,2019,A Recursive Subdivision Technique for Sampling Multi-class Scatterplots,10.1109/TVCG.2019.2934541,http://dx.doi.org/10.1109/TVCG.2019.2934541,729,738,J,"We present a non-uniform recursive sampling technique for multi-class scatterplots, with the specific goal of faithfully presenting relative data and class densities, while preserving major outliers in the plots. Our technique is based on a customized binary kd-tree, in which leaf nodes are created by recursively subdividing the underlying multi-class density map. By backtracking, we merge leaf nodes until they encompass points of all classes for our subsequently applied outlier-aware multi-class sampling strategy. A quantitative evaluation shows that our approach can better preserve outliers and at the same time relative densities in multi-class scatterplots compared to the previous approaches, several case studies demonstrate the effectiveness of our approach in exploring complex and real world data.",Xin Chen;Tong Ge;Jian Zhang 0070;Baoquan Chen;Chi-Wing Fu;Oliver Deussen;Yunhai Wang,Xin Chen;Tong Ge;Jian Zhang;Baoquan Chen;Chi-Wing Fu;Oliver Deussen;Yunhai Wang,"Shandong University;Shandong University;CNICCAS;Peking University;Chinese University of Hong KongGuangdong Prov. Key Lab. of CV and VR Tech.SIAT;Konstanz University, Germany;Shandong University","10.1109/TVCG.2018.2864503,10.1109/TVCG.2018.2865020,10.1109/TVCG.2017.2744098,10.1109/TVCG.2015.2467191,10.1109/TVCG.2016.2598694,10.1109/INFVIS.2000.885086,10.1109/TVCG.2018.2865075,10.1109/INFVIS.1996.559210,10.1109/TVCG.2016.2598624,10.1109/TVCG.2014.2346452,10.1109/TVCG.2013.179,10.1109/TVCG.2013.152,10.1109/TVCG.2014.2346594,10.1109/TVCG.2011.185,10.1109/VAST.2014.7042480","Scatterplot,multi-class sampling,kd-tree,outlier,relative density",0,5,72,
InfoVis,2019,BarcodeTree: Scalable Comparison of Multiple Hierarchies,10.1109/TVCG.2019.2934535,http://dx.doi.org/10.1109/TVCG.2019.2934535,1022,1032,J,"We propose BarcodeTree (BCT), a novel visualization technique for comparing topological structures and node attribute values of multiple trees. BCT can provide an overview of one hundred shallow and stable trees simultaneously, without aggregating individual nodes. Each BCT is shown within a single row using a style similar to a barcode, allowing trees to be stacked vertically with matching nodes aligned horizontally to ease comparison and maintain space efficiency. We design several visual cues and interactive techniques to help users understand the topological structure and compare trees. In an experiment comparing two variants of BCT with icicle plots, the results suggest that BCTs make it easier to visually compare trees by reducing the vertical distance between different trees. We also present two case studies involving a dataset of hundreds of trees to demonstrate BCT's utility.",Guozheng Li 0002;Yu Zhang 0043;Yu Dong;Jie Liang 0004;Jinson Zhang;Jinsong Wang;Michael J. McGuffin;Xiaoru Yuan,Guozheng Li;Yu Zhang;Yu Dong;Jie Liang;Jinson Zhang;Jinsong Wang;Michael J. Mcguffin;Xiaoru Yuan,"Key Laboratory of Machine Perception (Ministry of Education)National Engineering Laboratory for Big Data Analysis and ApplicationPeking University;University of OxfordPeking University;University of Technology, Sydney, Australia;University of Technology, Sydney, Australia;University of Technology, Sydney, Australia;Southwest Electric and Telecom Engineering Institute;Ecole de technologie superieure, Canada;Key Laboratory of Machine Perception (Ministry of Education)National Engineering Laboratory for Big Data Analysis and ApplicationPeking University","10.1109/INFVIS.2002.1173150,10.1109/INFVIS.2001.963290,10.1109/VAST.2011.6102439,10.1109/TVCG.2011.193,10.1109/VAST.2006.261450,10.1109/TVCG.2014.2346433,10.1109/TVCG.2017.2744080,10.1109/TVCG.2017.2744199,10.1109/TVCG.2016.2598469,10.1109/TVCG.2015.2467733,10.1109/TVCG.2007.70556,10.1109/TVCG.2013.231,10.1109/TVCG.2008.141,10.1109/VISUAL.1991.175815,10.1109/INFVIS.2003.1249028,10.1109/INFVIS.2004.70,10.1109/TVCG.2018.2865265,10.1109/TVCG.2018.2864884,10.1109/INFVIS.2002.1173148,10.1109/INFVIS.2001.963283,10.1109/INFVIS.2000.885091,10.1109/TVCG.2007.70529,10.1109/INFVIS.2002.1173151,10.1109/TVCG.2012.226","tree visualization,comparison,multiple trees",0,2,69,
InfoVis,2019,"Biased Average Position Estimates in Line and Bar Graphs: Underestimation, Overestimation, and Perceptual Pull",10.1109/TVCG.2019.2934400,http://dx.doi.org/10.1109/TVCG.2019.2934400,301,310,J,"In visual depictions of data, position (i.e., the vertical height of a line or a bar) is believed to be the most precise way to encode information compared to other encodings (e.g., hue). Not only are other encodings less precise than position, but they can also be prone to systematic biases (e.g., color category boundaries can distort perceived differences between hues). By comparison, position's high level of precision may seem to protect it from such biases. In contrast, across three empirical studies, we show that while position may be a precise form of data encoding, it can also produce systematic biases in how values are visually encoded, at least for reports of average position across a short delay. In displays with a single line or a single set of bars, reports of average positions were significantly biased, such that line positions were underestimated and bar positions were overestimated. In displays with multiple data series (i.e., multiple lines and/or sets of bars), this systematic bias still persisted. We also observed an effect of “perceptual pull”, where the average position estimate for each series was ‘pulled’ toward the other. These findings suggest that, although position may still be the most precise form of visual data encoding, it can also be systematically biased.",Cindy Xiong;Cristina R. Ceja;Casimir J. H. Ludwig;Steven Franconeri,Cindy Xiong;Cristina R. Ceja;Casimir J.H. Ludwig;Steven Franconeri,Northwestern University;Northwestern University;University of Bristol;Northwestern University,10.1109/TVCG.2017.2744138,"Perceptual biases,perception and cognition,cue combination,bar graphs,line graphs,position estimation",0,3,34,
InfoVis,2019,CerebroVis: Designing an Abstract yet Spatially Contextualized Cerebral Artery Network Visualization,10.1109/TVCG.2019.2934402,http://dx.doi.org/10.1109/TVCG.2019.2934402,938,948,J,"Blood circulation in the human brain is supplied through a network of cerebral arteries. If a clinician suspects a patient has a stroke or other cerebrovascular condition, they order imaging tests. Neuroradiologists visually search the resulting scans for abnormalities. Their visual search tasks correspond to the abstract network analysis tasks of browsing and path following. To assist neuroradiologists in identifying cerebral artery abnormalities, we designed CerebroVis, a novel abstract—yet spatially contextualized—cerebral artery network visualization. In this design study, we contribute a novel framing and definition of the cerebral artery system in terms of network theory and characterize neuroradiologist domain goals as abstract visualization and network analysis tasks. Through an iterative, user-centered design process we developed an abstract network layout technique which incorporates cerebral artery spatial context. The abstract visualization enables increased domain task performance over 3D geometry representations, while including spatial context helps preserve the user's mental map of the underlying geometry. We provide open source implementations of our network layout technique and prototype cerebral artery visualization tool. We demonstrate the robustness of our technique by successfully laying out 61 open source brain scans. We evaluate the effectiveness of our layout through a mixed methods study with three neuroradiologists. In a formative controlled experiment our study participants used CerebroVis and a conventional 3D visualization to examine real cerebral artery imaging data to identify a simulated intracranial artery stenosis. Participants were more accurate at identifying stenoses using CerebroVis (absolute risk difference 13%). A free copy of this paper, the evaluation stimuli and data, and source code are available at osf.io/e5sxt.",Aditeya Pandey;Harsh Shukla;Geoffrey S. Young;Lei Qin;Amir A. Zamani;Liangge Hsu;Raymond Huang;Cody Dunne;Michelle Borkin,Aditeya Pandey;Harsh Shukla;Geoffrey S. Young;Lei Qin;Amir A. Zamani;Liangge Hsu;Raymond Huang;Cody Dunne;Michelle A. Borkin,Northeastern University;Northeastern University;Brigham and Women's Hospital;Dana-Farber Cancer Institute;Brigham and Women's Hospital;Brigham and Women's Hospital;Brigham and Women's Hospital;Northeastern University;Northeastern University,"10.1109/TVCG.2011.192,10.1109/TVCG.2011.185,10.1109/TVCG.2013.124,10.1109/TVCG.2011.193,10.1109/TVCG.2013.231,10.1109/TVCG.2007.70582,10.1109/TVCG.2014.2346312,10.1109/TVCG.2017.2744278,10.1109/TVCG.2009.111,10.1109/TVCG.2012.213,10.1109/TVCG.2016.2598472","Network Visualization,Spatial Context,Abstract Design,Flow Network,Medical Imaging,Cerebral Arteries",0,1,68,
InfoVis,2019,Color Crafting: Automating the Construction of Designer Quality Color Ramps,10.1109/TVCG.2019.2934284,http://dx.doi.org/10.1109/TVCG.2019.2934284,1215,1225,J,"Visualizations often encode numeric data using sequential and diverging color ramps. Effective ramps use colors that are sufficiently discriminable, align well with the data, and are aesthetically pleasing. Designers rely on years of experience to create high-quality color ramps. However, it is challenging for novice visualization developers that lack this experience to craft effective ramps as most guidelines for constructing ramps are loosely defined qualitative heuristics that are often difficult to apply. Our goal is to enable visualization developers to readily create effective color encodings using a single seed color. We do this using an algorithmic approach that models designer practices by analyzing patterns in the structure of designer-crafted color ramps. We construct these models from a corpus of 222 expert-designed color ramps, and use the results to automatically generate ramps that mimic designer practices. We evaluate our approach through an empirical study comparing the outputs of our approach with designer-crafted color ramps. Our models produce ramps that support accurate and aesthetically pleasing visualizations at least as well as designer ramps and that outperform conventional mathematical approaches.",Stephen Smart;Keke Wu;Danielle Albers Szafir,Stephen Smart;Keke Wu;Danielle Albers Szafir,University of Colorado Boulder;University of Colorado Boulder;University of Colorado Boulder,"10.1109/VISUAL.1995.480803,10.1109/TVCG.2017.2743978,10.1109/TVCG.2014.2346978,10.1109/TVCG.2016.2598918,10.1109/TVCG.2008.174,10.1109/TVCG.2012.279,10.1109/TVCG.2018.2865240,10.1109/TVCG.2016.2599106,10.1109/TVCG.2017.2744320,10.1109/TVCG.2018.2865147,10.1109/TVCG.2017.2744359,10.1109/TVCG.2014.2346277,10.1109/TVCG.2015.2467191","Visualization,Aesthetics in Visualization,Color Perception,Visual Design,Design Mining",0,3,91,
InfoVis,2019,Common Fate for Animated Transitions in Visualization,10.1109/TVCG.2019.2934288,http://dx.doi.org/10.1109/TVCG.2019.2934288,386,396,J,"The Law of Common Fate from Gestalt psychology states that visual objects moving with the same velocity along parallel trajectories will be perceived by a human observer as grouped. However, the concept of common fate is much broader than mere velocity; in this paper we explore how common fate results from coordinated changes in luminance and size. We present results from a crowdsourced graphical perception study where we asked workers to make perceptual judgments on a series of trials involving four graphical objects under the influence of conflicting static and dynamic visual factors (position, size and luminance) used in conjunction. Our results yield the following rankings for visual grouping: motion > (dynamic luminance, size, luminance); dynamic size > (dynamic luminance, position); and dynamic luminance > size. We also conducted a follow-up experiment to evaluate the three dynamic visual factors in a more ecologically valid setting, using both a Gapminder-like animated scatterplot and a thematic map of election data. The results indicate that in practice the relative grouping strengths of these factors may depend on various parameters including the visualization characteristics and the underlying data. We discuss design implications for animated transitions in data visualization.",Amira Chalbi;Jacob Ritchie;Deok Gun Park 0001;Jungu Choi;Nicolas Roussel;Niklas Elmqvist;Fanny Chevalier,Amira Chalbi;Jacob Ritchie;Deokgun Park;Jungu Choi;Nicolas Roussel;Niklas Elmqvist;Fanny Chevalier,"Inria, France;University of Toronto in Toronto, Canada;University of Texas, Arlington, TX, USA;Purdue University, West Lafayette, IN, USA;Inria, France;University of Maryland, College Park, MD, USA;University of Toronto in Toronto, Canada","10.1109/INFVIS.1999.801854,10.1109/TVCG.2014.2346424,10.1109/TVCG.2008.153,10.1109/TVCG.2007.70539,10.1109/TVCG.2017.2744359","Gestalt laws,common fate,animated transitions,evaluation,motion",0,1,71,
InfoVis,2019,Construct-A-Vis: Exploring the Free-Form Visualization Processes of Children,10.1109/TVCG.2019.2934804,http://dx.doi.org/10.1109/TVCG.2019.2934804,451,460,J,"Building data analysis skills is part of modern elementary school curricula. Recent research has explored how to facilitate children's understanding of visual data representations through completion exercises which highlight links between concrete and abstract mappings. This approach scaffolds visualization activities by presenting a target visualization to children. But how can we engage children in more free-form visual data mapping exercises that are driven by their own mapping ideas? How can we scaffold a creative exploration of visualization techniques and mapping possibilities? We present Construct-A-Vis, a tablet-based tool designed to explore the feasibility of free-form and constructive visualization activities with elementary school children. Construct-A-Vis provides adjustable levels of scaffolding visual mapping processes. It can be used by children individually or as part of collaborative activities. Findings from a study with elementary school children using Construct-A-Vis individually and in pairs highlight the potential of this free-form constructive approach, as visible in children's diverse visualization outcomes and their critical engagement with the data and mapping processes. Based on our study findings we contribute insights into the design of free-form visualization tools for children, including the role of tool-based scaffolding mechanisms and shared interactions to guide visualization activities with children.",Fearn Bishop;Johannes Zagermann;Ulrike Pfeil;Gemma Sanderson;Harald Reiterer;Uta Hinrichs,Fearn Bishop;Johannes Zagermann;Ulrike Pfeil;Gemma Sanderson;Harald Reiterer;Uta Hinrichs,"University of St Andrews, St Andrews, UK;University of Konstanz, Konstanz, Germany;University of Konstanz, Konstanz, Germany;Fife Council, UK;University of Konstanz, Konstanz, Germany;University of St Andrews, St Andrews, UK","10.1109/TVCG.2014.2346984,10.1109/TVCG.2010.164,10.1109/TVCG.2014.2346292,10.1109/TVCG.2015.2467831","Visualization in Education,Visualization with Children,Qualitative Evaluation,Visualization System and Toolkit Design",0,1,40,
InfoVis,2019,Criteria for Rigor in Visualization Design Study,10.1109/TVCG.2019.2934539,http://dx.doi.org/10.1109/TVCG.2019.2934539,87,97,J,"We develop a new perspective on research conducted through visualization design study that emphasizes design as a method of inquiry and the broad range of knowledge-contributions achieved through it as multiple, subjective, and socially constructed. From this interpretivist position we explore the nature of visualization design study and develop six criteria for rigor. We propose that rigor is established and judged according to the extent to which visualization design study research and its reporting are INFORMED, REFLEXIVE, ABUNDANT, PLAUSIBLE, RESONANT, and TRANSPARENT. This perspective and the criteria were constructed through a four-year engagement with the discourse around rigor and the nature of knowledge in social science, information systems, and design. We suggest methods from cognate disciplines that can support visualization researchers in meeting these criteria during the planning, execution, and reporting of design study. Through a series of deliberately provocative questions, we explore implications of this new perspective for design study research in visualization, concluding that as a discipline, visualization is not yet well positioned to embrace, nurture, and fully benefit from a rigorous, interpretivist approach to design study. The perspective and criteria we present are intended to stimulate dialogue and debate around the nature of visualization design study and the broader underpinnings of the discipline.",Miriah D. Meyer;Jason Dykes,Miriah Meyer;Jason Dykes,"University of Utah;City, University of London","10.1109/TVCG.2014.2346431,10.1109/TVCG.2013.145,10.1109/TVCG.2015.2467452,10.1109/TVCG.2018.2865241,10.1109/TVCG.2015.2467195,10.1109/TVCG.2014.2346248,10.1109/TVCG.2011.209,10.1109/TVCG.2018.2864913,10.1109/TVCG.2014.2346331,10.1109/TVCG.2010.137,10.1109/TVCG.2009.111,10.1109/TVCG.2012.213,10.1109/TVCG.2018.2864905,10.1109/TVCG.2017.2745958,10.1109/TVCG.2018.2864836,10.1109/TVCG.2018.2865076","design study,relativism,interpretivism,knowledge construction,qualitative research,research through design",0,16,120,
InfoVis,2019,Data by Proxy — Material Traces as Autographic Visualizations,10.1109/TVCG.2019.2934788,http://dx.doi.org/10.1109/TVCG.2019.2934788,98,108,J,"Information visualization limits itself, per definition, to the domain of symbolic information. This paper discusses arguments why the field should also consider forms of data that are not symbolically encoded, including physical traces and material indicators. Continuing a provocation presented by Pat Hanrahan in his 2004 IEEE Vis capstone address, this paper compares physical traces to visualizations and describes the techniques and visual practices for producing, revealing, and interpreting them. By contrasting information visualization with a speculative counter model of autographic visualization, this paper examines the design principles for material data. Autographic visualization addresses limitations of information visualization, such as the inability to directly reflect the material circumstances of data generation. The comparison between the two models allows probing the epistemic assumptions behind information visualization and uncovers linkages with the rich history of scientific visualization and trace reading. The paper begins by discussing the gap between data visualizations and their corresponding phenomena and proceeds by investigating how material visualizations can bridge this gap. It contextualizes autographic visualization with paradigms such as data physicalization and indexical visualization and grounds it in the broader theoretical literature of semiotics, science and technology studies (STS), and the history of scientific representation. The main section of the paper proposes a foundational design vocabulary for autographic visualization and offers examples of how citizen scientists already use autographic principles in their displays, which seem to violate the canonical principles of information visualization but succeed at fulfilling other rhetorical purposes in evidence construction. The paper concludes with a discussion of the limitations of autographic visualization, a roadmap for the empirical investigation of trace perception, and thoughts about how information visualization and autographic visualization techniques can contribute to each other.",Dietmar Offenhuber,Dietmar Offenhuber,Northeastern University,"10.1109/INFVIS.1997.636792,10.1109/VISUAL.2004.12,10.1109/TVCG.2016.2598608","Traces,indexicality,data physicalization,proxy data sources,data materiality",0,3,82,
InfoVis,2019,Data Changes Everything: Challenges and Opportunities in Data Visualization Design Handoff,10.1109/TVCG.2019.2934538,http://dx.doi.org/10.1109/TVCG.2019.2934538,12,22,J,"Complex data visualization design projects often entail collaboration between people with different visualization-related skills. For example, many teams include both designers who create new visualization designs and developers who implement the resulting visualization software. We identify gaps between data characterization tools, visualization design tools, and development platforms that pose challenges for designer-developer teams working to create new data visualizations. While it is common for commercial interaction design tools to support collaboration between designers and developers, creating data visualizations poses several unique challenges that are not supported by current tools. In particular, visualization designers must characterize and build an understanding of the underlying data, then specify layouts, data encodings, and other data-driven parameters that will be robust across many different data values. In larger teams, designers must also clearly communicate these mappings and their dependencies to developers, clients, and other collaborators. We report observations and reflections from five large multidisciplinary visualization design projects and highlight six data-specific visualization challenges for design specification and handoff. These challenges include adapting to changing data, anticipating edge cases in data, understanding technical challenges, articulating data-dependent interactions, communicating data mappings, and preserving the integrity of data mappings across iterations. Based on these observations, we identify opportunities for future tools for prototyping, testing, and communicating data-driven designs, which might contribute to more successful and collaborative data visualization design.",Jagoda Walny;Christian Frisson;Mieka West;Doris Kosminsky;Søren Knudsen;Sheelagh Carpendale;Wesley Willett,Jagoda Walny;Christian Frisson;Mieka West;Doris Kosminsky;Søren Knudsen;Sheelagh Carpendale;Wesley Willett,"University of Calgary, Calgary, Canada;University of Calgary, Calgary, Canada;University of Calgary, Calgary, Canada;University of Calgary, Calgary, Canada;University of Calgary, Calgary, Canada;University of Calgary, Calgary, Canada;University of Calgary, Calgary, Canada","10.1109/TVCG.2016.2598609,10.1109/TVCG.2011.185,10.1109/TVCG.2017.2744199,10.1109/TVCG.2012.219,10.1109/TVCG.2016.2598620,10.1109/TVCG.2014.2346331,10.1109/TVCG.2009.111,10.1109/TVCG.2016.2599030,10.1109/TVCG.2012.213,10.1109/INFVIS.2000.885086,10.1109/TVCG.2009.162,10.1109/TVCG.2018.2864836","Information visualization,design handoff,data mapping,design process",0,7,65,BP
InfoVis,2019,Data Sampling in Multi-view and Multi-class Scatterplots via Set Cover Optimization,10.1109/TVCG.2019.2934799,http://dx.doi.org/10.1109/TVCG.2019.2934799,739,748,J,"We present a method for data sampling in scatterplots by jointly optimizing point selection for different views or classes. Our method uses space-filling curves (Z-order curves) that partition a point set into subsets that, when covered each by one sample, provide a sampling or coreset with good approximation guarantees in relation to the original point set. For scatterplot matrices with multiple views, different views provide different space-filling curves, leading to different partitions of the given point set. For multi-class scatterplots, the focus on either per-class distribution or global distribution provides two different partitions of the given point set that need to be considered in the selection of the coreset. For both cases, we convert the coreset selection problem into an Exact Cover Problem (ECP), and demonstrate with quantitative and qualitative evaluations that an approximate solution that solves the ECP efficiently is able to provide high-quality samplings.",Ruizhen Hu;Tingkai Sha;Oliver van Kaick;Oliver Deussen;Hui Huang 0004,Ruizhen Hu;Tingkai Sha;Oliver Van Kaick;Oliver Deussen;Hui Huang,"Shenzhen University, Visual Computing Research Center, China;Shenzhen University, Visual Computing Research Center, China;Carleton University, School of Computer Science, Canada;Konstanz University, Germany and Shenzhen VisuCA Key Lab, SIAT, China;Shenzhen University, Visual Computing Research Center, China","10.1109/TVCG.2018.2864912,10.1109/TVCG.2013.153,10.1109/TVCG.2010.176,10.1109/TVCG.2007.70535,10.1109/TVCG.2014.2346594,10.1109/TVCG.2011.229,10.1109/TVCG.2008.119","Sampling,Scatterplot,SPLOM,Exact Cover Problem",0,4,43,
InfoVis,2019,DataShot: Automatic Generation of Fact Sheets from Tabular Data,10.1109/TVCG.2019.2934398,http://dx.doi.org/10.1109/TVCG.2019.2934398,895,905,J,"Fact sheets with vivid graphical design and intriguing statistical insights are prevalent for presenting raw data. They help audiences understand data-related facts effectively and make a deep impression. However, designing a fact sheet requires both data and design expertise and is a laborious and time-consuming process. One needs to not only understand the data in depth but also produce intricate graphical representations. To assist in the design process, we present DataShot which, to the best of our knowledge, is the first automated system that creates fact sheets automatically from tabular data. First, we conduct a qualitative analysis of 245 infographic examples to explore general infographic design space at both the sheet and element levels. We identify common infographic structures, sheet layouts, fact types, and visualization styles during the study. Based on these findings, we propose a fact sheet generation pipeline, consisting of fact extraction, fact composition, and presentation synthesis, for the auto-generation workflow. To validate our system, we present use cases with three real-world datasets. We conduct an in-lab user study to understand the usage of our system. Our evaluation results show that DataShot can efficiently generate satisfactory fact sheets to support further customization and data presentation.",Yun Wang 0012;Zhida Sun;Haidong Zhang;Weiwei Cui;Ke Xu;Xiaojuan Ma;Dongmei Zhang,Yun Wang;Zhida Sun;Haidong Zhang;Weiwei Cui;Ke Xu;Xiaojuan Ma;Dongmei Zhang,Microsoft Research Asia;Department of Computer Science and EngineeringHong Kong University of Science and Technology;Microsoft Research Asia;Microsoft Research Asia;Department of Computer Science and EngineeringHong Kong University of Science and Technology;Department of Computer Science and EngineeringHong Kong University of Science and Technology;Microsoft Research Asia,"10.1109/INFVIS.2005.1532136,10.1109/TVCG.2016.2598647,10.1109/TVCG.2013.234,10.1109/TVCG.2016.2598876,10.1109/TVCG.2015.2467321,10.1109/TVCG.2013.119,10.1109/TVCG.2016.2598620,10.1109/TVCG.2017.2744198,10.1109/TVCG.2014.2346291,10.1109/TVCG.2018.2865158,10.1109/TVCG.2010.179,10.1109/TVCG.2018.2865145,10.1109/INFVIS.2000.885086,10.1109/TVCG.2015.2467191","Fact sheet,infographic,visualization,and automated design",0,3,61,
InfoVis,2019,Decoding a Complex Visualization in a Science Museum – An Empirical Study,10.1109/TVCG.2019.2934401,http://dx.doi.org/10.1109/TVCG.2019.2934401,472,481,J,"This study describes a detailed analysis of museum visitors' decoding process as they used a visualization designed to support exploration of a large, complex dataset. Quantitative and qualitative analyses revealed that it took, on average, 43 seconds for visitors to decode enough of the visualization to see patterns and relationships in the underlying data represented, and 54 seconds to arrive at their first correct data interpretation. Furthermore, visitors decoded throughout and not only upon initial use of the visualization. The study analyzed think-aloud data to identify issues visitors had mapping the visual representations to their intended referents, examine why they occurred, and consider if and how these decoding issues were resolved. The paper also describes how multiple visual encodings both helped and hindered decoding and concludes with implications on the design and adaptation of visualizations for informal science learning venues.",Joyce Ma;Kwan-Liu Ma;Jennifer Frazier,Joyce Ma;Kwan-Liu Ma;Jennifer Frazier,"Exploratorium, San Francisco;University of California, Davis;Exploratorium, San Francisco","10.1109/TVCG.2012.244,10.1109/TVCG.2008.127","Museums,informal science learning,interactive exhibit,public data visualization,decoding,visual encoding",0,2,35,
InfoVis,2019,DeepDrawing: A Deep Learning Approach to Graph Drawing,10.1109/TVCG.2019.2934798,http://dx.doi.org/10.1109/TVCG.2019.2934798,676,686,J,"Node-link diagrams are widely used to facilitate network explorations. However, when using a graph drawing technique to visualize networks, users often need to tune different algorithm-specific parameters iteratively by comparing the corresponding drawing results in order to achieve a desired visual effect. This trial and error process is often tedious and time-consuming, especially for non-expert users. Inspired by the powerful data modelling and prediction capabilities of deep learning techniques, we explore the possibility of applying deep learning techniques to graph drawing. Specifically, we propose using a graph-LSTM-based approach to directly map network structures to graph drawings. Given a set of layout examples as the training dataset, we train the proposed graph-LSTM-based model to capture their layout characteristics. Then, the trained model is used to generate graph drawings in a similar style for new networks. We evaluated the proposed approach on two special types of layouts (i.e., grid layouts and star layouts) and two general types of layouts (i.e., ForceAtlas2 and PivotMDS) in both qualitative and quantitative ways. The results provide support for the effectiveness of our approach. We also conducted a time cost assessment on the drawings of small graphs with 20 to 50 nodes. We further report the lessons we learned and discuss the limitations and future work.",Yong Wang 0021;Zhihua Jin;Qianwen Wang;Weiwei Cui;Tengfei Ma;Huamin Qu,Yong Wang;Zhihua Jin;Qianwen Wang;Weiwei Cui;Tengfei Ma;Huamin Qu,Hong Kong University of Science and Technology (HKUST);Hong Kong University of Science and Technology (HKUST);Hong Kong University of Science and Technology (HKUST);Microsoft Research Asia;IBM T. J. Watson Research Center;Hong Kong University of Science and Technology (HKUST),"10.1109/INFVIS.2004.1,10.1109/TVCG.2017.2743858,10.1109/TVCG.2015.2467691,10.1109/TVCG.2017.2745919","Graph Drawing,Deep Learning,LSTM,Procrustes Analysis",0,4,82,
InfoVis,2019,Design by Immersion: A Transdisciplinary Approach to Problem-Driven Visualizations,10.1109/TVCG.2019.2934790,http://dx.doi.org/10.1109/TVCG.2019.2934790,109,118,J,"While previous work exists on how to conduct and disseminate insights from problem-driven visualization projects and design studies, the literature does not address how to accomplish these goals in transdisciplinary teams in ways that advance all disciplines involved. In this paper we introduce and define a new methodological paradigm we call design by immersion, which provides an alternative perspective on problem-driven visualization work. Design by immersion embeds transdisciplinary experiences at the center of the visualization process by having visualization researchers participate in the work of the target domain (or domain experts participate in visualization research). Based on our own combined experiences of working on cross-disciplinary, problem-driven visualization projects, we present six case studies that expose the opportunities that design by immersion enables, including (1) exploring new domain-inspired visualization design spaces, (2) enriching domain understanding through personal experiences, and (3) building strong transdisciplinary relationships. Furthermore, we illustrate how the process of design by immersion opens up a diverse set of design activities that can be combined in different ways depending on the type of collaboration, project, and goals. Finally, we discuss the challenges and potential pitfalls of design by immersion.",Kyle Wm. Hall;Adam James Bradley;Uta Hinrichs;Samuel Huron;Jo Wood;Christopher Collins 0001;Sheelagh Carpendale,Kyle Wm. Hall;Adam J. Bradley;Uta Hinrichs;Samuel Huron;Jo Wood;Christopher Collins;Sheelagh Carpendale,"Temple University, Philadelphia, PA, USA;Ontario Tech University, Oshawa, Canada;University of St Andrews, Fife, United Kingdom;Télécom Paristech, Université Paris-Saclay, Paris, France;University of London, London, United Kingdom;Ontario Tech University, Oshawa, Canada;University of Calgary, Calgary, Canada","10.1109/TVCG.2009.122,10.1109/TVCG.2006.160,10.1109/TVCG.2015.2467452,10.1109/TVCG.2018.2865241,10.1109/TVCG.2014.2346325,10.1109/TVCG.2011.209,10.1109/TVCG.2014.2346331,10.1109/TVCG.2009.111,10.1109/TVCG.2015.2467271,10.1109/TVCG.2012.213,10.1109/TVCG.2014.2346323","Visualization,problem-driven,design studies,collaboration,methodology,framework",0,5,47,
InfoVis,2019,Designing for Mobile and Immersive Visual Analytics in the Field,10.1109/TVCG.2019.2934282,http://dx.doi.org/10.1109/TVCG.2019.2934282,503,513,J,"Data collection and analysis in the field is critical for operations in domains such as environmental science and public safety. However, field workers currently face data- and platform-oriented issues in efficient data collection and analysis in the field, such as limited connectivity, screen space, and attentional resources. In this paper, we explore how visual analytics tools might transform field practices by more deeply integrating data into these operations. We use a design probe coupling mobile, cloud, and immersive analytics components to guide interviews with ten experts from five domains to explore how visual analytics could support data collection and analysis needs in the field. The results identify shortcomings of current approaches and target scenarios and design considerations for future field analysis systems. We embody these findings in FieldView, an extensible, open-source prototype designed to support critical use cases for situated field analysis. Our findings suggest the potential for integrating mobile and immersive technologies to enhance data's utility for various field operations and new directions for visual analytics tools to transform fieldwork.",Matt Whitlock;Keke Wu;Danielle Albers Szafir,Matt Whitlock;Keke Wu;Danielle Albers Szafir,University of Colorado;University of Colorado;University of Colorado,"10.1109/TVCG.2017.2745941,10.1109/TVCG.2018.2865234,10.1109/TVCG.2007.70535,10.1109/TVCG.2017.2744019,10.1109/TVCG.2018.2864914,10.1109/TVCG.2016.2598608","Immersive Analytics,Augmented Reality,Mobile Visualization,Outdoor Visualization,Emergency Response",0,0,61,
InfoVis,2019,Discriminability Tests for Visualization Effectiveness and Scalability,10.1109/TVCG.2019.2934432,http://dx.doi.org/10.1109/TVCG.2019.2934432,749,758,J,"The scalability of a particular visualization approach is limited by the ability for people to discern differences between plots made with different datasets. Ideally, when the data changes, the visualization changes in perceptible ways. This relation breaks down when there is a mismatch between the encoding and the character of the dataset being viewed. Unfortunately, visualizations are often designed and evaluated without fully exploring how they will respond to a wide variety of datasets. We explore the use of an image similarity measure, the Multi-Scale Structural Similarity Index (MS-SSIM), for testing the discriminability of a data visualization across a variety of datasets. MS-SSIM is able to capture the similarity of two visualizations across multiple scales, including low level granular changes and high level patterns. Significant data changes that are not captured by the MS-SSIM indicate visualizations of low discriminability and effectiveness. The measure's utility is demonstrated with two empirical studies. In the first, we compare human similarity judgments and MS-SSIM scores for a collection of scatterplots. In the second, we compute the discriminability values for a set of basic visualizations and compare them with empirical measurements of effectiveness. In both cases, the analyses show that the computational measure is able to approximate empirical results. Our approach can be used to rank competing encodings on their discriminability and to aid in selecting visualizations for a particular type of data distribution.",Rafael Veras;Christopher Collins 0001,Rafael Veras;Christopher Collins,Ontario Tech University;Ontario Tech University,"10.1109/INFVIS.1997.636794,10.1109/TVCG.2010.132,10.1109/TVCG.2014.2346978,10.1109/TVCG.2016.2598918,10.1109/TVCG.2012.233,10.1109/TVCG.2012.230,10.1109/TVCG.2009.153,10.1109/TVCG.2014.2346325,10.1109/TVCG.2009.111,10.1109/TVCG.2018.2865264,10.1109/TVCG.2017.2744359,10.1109/VAST.2009.5332628,10.1109/TVCG.2007.70529,10.1109/TVCG.2010.161,10.1109/INFVIS.2005.1532142","Scalability,Discriminability,Simulation,Perception",0,1,48,
InfoVis,2019,Estimating Color-Concept Associations from Image Statistics,10.1109/TVCG.2019.2934536,http://dx.doi.org/10.1109/TVCG.2019.2934536,1226,1235,J,"To interpret the meanings of colors in visualizations of categorical information, people must determine how distinct colors correspond to different concepts. This process is easier when assignments between colors and concepts in visualizations match people's expectations, making color palettes semantically interpretable. Efforts have been underway to optimize color palette design for semantic interpretablity, but this requires having good estimates of human color-concept associations. Obtaining these data from humans is costly, which motivates the need for automated methods. We developed and evaluated a new method for automatically estimating color-concept associations in a way that strongly correlates with human ratings. Building on prior studies using Google Images, our approach operates directly on Google Image search results without the need for humans in the loop. Specifically, we evaluated several methods for extracting raw pixel content of the images in order to best estimate color-concept associations obtained from human ratings. The most effective method extracted colors using a combination of cylindrical sectors and color categories in color space. We demonstrate that our approach can accurately estimate average human color-concept associations for different fruits using only a small set of images. The approach also generalizes moderately well to more complicated recycling-related concepts of objects that can appear in any color.",Ragini Rathore;Zachary Leggon;Laurent Lessard;Karen B. Schloss,Ragini Rathore;Zachary Leggon;Laurent Lessard;Karen B. Schloss,Computer Sciences and Wisconsin Institute for Discovery (WID)University of Wisconsin–Madison;Biology and WIDUniversity of Wisconisn–Madison;Electrical and Computer Engineering and WIDUniversity of Wisconsin–Madison;Psychology and WIDUniversity of Wisconsin–Madison,"10.1109/TVCG.2016.2598918,10.1109/VISUAL.1996.568118,10.1109/TVCG.2018.2865147,10.1109/TVCG.2015.2467471,10.1109/TVCG.2017.2744359","Visual Reasoning,Visual Communication,Visual Encoding,Color Perception,Color Cognition,Color Categories",0,1,53,
InfoVis,2019,Evaluating an Immersive Space-Time Cube Geovisualization for Intuitive Trajectory Data Exploration,10.1109/TVCG.2019.2934415,http://dx.doi.org/10.1109/TVCG.2019.2934415,514,524,J,"A Space-Time Cube enables analysts to clearly observe spatio-temporal features in movement trajectory datasets in geovisualization. However, its general usability is impacted by a lack of depth cues, a reported steep learning curve, and the requirement for efficient 3D navigation. In this work, we investigate a Space-Time Cube in the Immersive Analytics domain. Based on a review of previous work and selecting an appropriate exploration metaphor, we built a prototype environment where the cube is coupled to a virtual representation of the analyst's real desk, and zooming and panning in space and time are intuitively controlled using mid-air gestures. We compared our immersive environment to a desktop-based implementation in a user study with 20 participants across 7 tasks of varying difficulty, which targeted different user interface features. To investigate how performance is affected in the presence of clutter, we explored two scenarios with different numbers of trajectories. While the quantitative performance was similar for the majority of tasks, large differences appear when we analyze the patterns of interaction and consider subjective metrics. The immersive version of the Space-Time Cube received higher usability scores, much higher user preference, and was rated to have a lower mental workload, without causing participants discomfort in 25-minute-long VR sessions.",Jorge A. Wagner Filho;Wolfgang Stuerzlinger;Luciana Porcher Nedel,Jorge A. Wagner Filho;Wolfgang Stuerzlinger;Luciana Nedel,Federal University of Rio Grande do Sul;Simon Fraser University;Federal University of Rio Grande do Sul,"10.1109/TVCG.2018.2865191,10.1109/INFVIS.2004.27","Space-time cube,Trajectory visualization,Immersive analytics",0,4,60,
InfoVis,2019,GenerativeMap: Visualization and Exploration of Dynamic Density Maps via Generative Learning Model,10.1109/TVCG.2019.2934806,http://dx.doi.org/10.1109/TVCG.2019.2934806,216,226,J,"The density map is widely used for data sampling, time-varying detection, ensemble representation, etc. The visualization of dynamic evolution is a challenging task when exploring spatiotemporal data. Many approaches have been provided to explore the variation of data patterns over time, which commonly need multiple parameters and preprocessing works. Image generation is a well-known topic in deep learning, and a variety of generating models have been promoted in recent years. In this paper, we introduce a general pipeline called GenerativeMap to extract dynamics of density maps by generating interpolation information. First, a trained generative model comprises an important part of our approach, which can generate nonlinear and natural results by implementing a few parameters. Second, a visual presentation is proposed to show the density change, which is combined with the level of detail and blue noise sampling for a better visual effect. Third, for dynamic visualization of large-scale density maps, we extend this approach to show the evolution in regions of interest, which costs less to overcome the drawback of the learning-based generative model. We demonstrate our method on different types of cases, and we evaluate and compare the approach from multiple aspects. The results help identify the effectiveness of our approach and confirm its applicability in different scenarios.",Chen Chen;Changbo Wang;Xue Bai;Peiying Zhang;Chenhui Li,Chen Chen;Changbo Wang;Xue Bai;Peiying Zhang;Chenhui Li,School of Computer Science and TechnologyEast China Normal University;School of Computer Science and TechnologyEast China Normal University;School of Computer Science and TechnologyEast China Normal University;School of Computer Science and TechnologyEast China Normal University;School of Computer Science and TechnologyEast China Normal University,"10.1109/TVCG.2016.2598869,10.1109/VISUAL.2005.1532853,10.1109/TVCG.2018.2865049,10.1109/TVCG.2007.70599,10.1109/TVCG.2014.2346594,10.1109/TVCG.2013.131,10.1109/VISUAL.1998.745282,10.1109/TVCG.2018.2865193,10.1109/TVCG.2015.2468111,10.1109/TVCG.2014.2346920","Density map,deep learning,spatiotemporal data,generative model",0,0,52,
InfoVis,2019,Illusion of Causality in Visualized Data,10.1109/TVCG.2019.2934399,http://dx.doi.org/10.1109/TVCG.2019.2934399,853,862,J,"Students who eat breakfast more frequently tend to have a higher grade point average. From this data, many people might confidently state that a before-school breakfast program would lead to higher grades. This is a reasoning error, because correlation does not necessarily indicate causation – X and Y can be correlated without one directly causing the other. While this error is pervasive, its prevalence might be amplified or mitigated by the way that the data is presented to a viewer. Across three crowdsourced experiments, we examined whether how simple data relations are presented would mitigate this reasoning error. The first experiment tested examples similar to the breakfast-GPA relation, varying in the plausibility of the causal link. We asked participants to rate their level of agreement that the relation was correlated, which they rated appropriately as high. However, participants also expressed high agreement with a causal interpretation of the data. Levels of support for the causal interpretation were not equally strong across visualization types: causality ratings were highest for text descriptions and bar graphs, but weaker for scatter plots. But is this effect driven by bar graphs aggregating data into two groups or by the visual encoding type? We isolated data aggregation versus visual encoding type and examined their individual effect on perceived causality. Overall, different visualization designs afford different cognitive reasoning affordances across the same data. High levels of data aggregation by graphs tend to be associated with higher perceived causality in data. Participants perceived line and dot visual encodings as more causal than bar encodings. Our results demonstrate how some visualization designs trigger stronger causal links while choosing others can help mitigate unwarranted perceptions of causality.",Cindy Xiong;Joel Shapiro;Jessica Hullman;Steven Franconeri,Cindy Xiong;Joel Shapiro;Jessica Hullman;Steven Franconeri,Northwestern University;Northwestern UniversityKellogg School of Management;Northwestern University;Northwestern University,"10.1109/VAST.2017.8585665,10.1109/TVCG.2014.2346298,10.1109/TVCG.2016.2598594,10.1109/TVCG.2013.173,10.1109/TVCG.2014.2346979,10.1109/TVCG.2017.2743898,10.1109/TVCG.2018.2864909,10.1109/TVCG.2017.2745240,10.1109/TVCG.2014.2346419,10.1109/TVCG.2017.2744184","Information Visualization,Correlation and Causation,Visualization Design,Reasoning Affordance",0,4,50,
InfoVis,2019,Improving the Robustness of Scagnostics,10.1109/TVCG.2019.2934796,http://dx.doi.org/10.1109/TVCG.2019.2934796,759,769,J,"In this paper, we examine the robustness of scagnostics through a series of theoretical and empirical studies. First, we investigate the sensitivity of scagnostics by employing perturbing operations on more than 60M synthetic and real-world scatterplots. We found that two scagnostic measures, Outlying and Clumpy, are overly sensitive to data binning. To understand how these measures align with human judgments of visual features, we conducted a study with 24 participants, which reveals that i) humans are not sensitive to small perturbations of the data that cause large changes in both measures, and ii) the perception of clumpiness heavily depends on per-cluster topologies and structures. Motivated by these results, we propose Robust Scagnostics (RScag) by combining adaptive binning with a hierarchy-based form of scagnostics. An analysis shows that RScag improves on the robustness of original scagnostics, aligns better with human judgments, and is equally fast as the traditional scagnostic measures.",Yunhai Wang;Zeyu Wang 0005;Tingting Liu;Michael Correll;Zhanglin Cheng;Oliver Deussen;Michael Sedlmair,Yunhai Wang;Zeyu Wang;Tingting Liu;Michael Correll;Zhanglin Cheng;Oliver Deussen;Michael Sedlmair,"Shandong University;Shandong University;Shandong University;Tableau Research;Shenzhen VisuCA Key Lab, SIAT, China;Konstanz University, Germany;VISUS, University of Stuttgart, Germany","10.1109/VAST.2010.5652433,10.1109/TVCG.2015.2467323,10.1109/VAST.2012.6400490,10.1109/VAST.2008.4677368,10.1109/TVCG.2016.2598467,10.1109/TVCG.2011.229,10.1109/VAST.2010.5652460,10.1109/VAST.2009.5332611,10.1109/TVCG.2018.2864907,10.1109/TVCG.2014.2346572,10.1109/TVCG.2010.184,10.1109/TVCG.2014.2346979,10.1109/TVCG.2015.2467671,10.1109/TVCG.2017.2744339,10.1109/TVCG.2013.153,10.1109/VAST.2009.5332628,10.1109/INFVIS.2005.1532142","Scagnostics,scatterplots,sensitivity analysis,Robust Scagnostics",0,1,53,
InfoVis,2019,Interactive Structure-aware Blending of Diverse Edge Bundling Visualizations,10.1109/TVCG.2019.2934805,http://dx.doi.org/10.1109/TVCG.2019.2934805,687,696,J,"Many edge bundling techniques (i.e., data simplification as a support for data visualization and decision making) exist but they are not directly applicable to any kind of dataset and their parameters are often too abstract and difficult to set up. As a result, this hinders the user ability to create efficient aggregated visualizations. To address these issues, we investigated a novel way of handling visual aggregation with a task-driven and user-centered approach. Given a graph, our approach produces a decluttered view as follows: first, the user investigates different edge bundling results and specifies areas, where certain edge bundling techniques would provide user-desired results. Second, our system then computes a smooth and structural preserving transition between these specified areas. Lastly, the user can further fine-tune the global visualization with a direct manipulation technique to remove the local ambiguity and to apply different visual deformations. In this paper, we provide details for our design rationale and implementation. Also, we show how our algorithm gives more suitable results compared to current edge bundling techniques, and in the end, we provide concrete instances of usages, where the algorithm combines various edge bundling results to support diverse data exploration and visualizations.",Yunhai Wang;Mingliang Xue;Yanyan Wang;Xinyuan Yan;Baoquan Chen;Chi-Wing Fu;Christophe Hurter,Yunhai Wang;Mingliang Xue;Yanyan Wang;Xinyuan Yan;Baoquan Chen;Chi-Wing Fu;Christophe Hurter,"Shandong University;Shandong University;Shandong University;Shandong University;Peking University;Chinese University of Hong Kong;ENAC, France","10.1109/TVCG.2016.2598958,10.1109/TVCG.2006.156,10.1109/TVCG.2011.233,10.1109/TVCG.2006.147,10.1109/TVCG.2017.2744338,10.1109/TVCG.2011.223,10.1109/TVCG.2014.2346441,10.1109/TVCG.2015.2467691,10.1109/TVCG.2017.2745919,10.1109/TVCG.2018.2864911","path visualization,trajectory visualization,edge bundles",0,1,57,
InfoVis,2019,Measures of the Benefit of Direct Encoding of Data Deltas for Data Pair Relation Perception,10.1109/TVCG.2019.2934801,http://dx.doi.org/10.1109/TVCG.2019.2934801,311,320,J,"The power of data visualization is not to convey absolute values of individual data points, but to allow the exploration of relations (increases or decreases in a data value) among them. One approach to highlighting these relations is to explicitly encode the numeric differences (deltas) between data values. Because this approach removes the context of the individual data values, it is important to measure how much of a performance improvement it actually offers, especially across differences in encodings and tasks, to ensure that it is worth adding to a visualization design. Across 3 different tasks, we measured the increase in visual processing efficiency for judging the relations between pairs of data values, from when only the values were shown, to when the deltas between the values were explicitly encoded, across position and length visual feature encodings (and slope encodings in Experiments 1 & 2). In Experiment 1, the participant's task was to locate a pair of data values with a given relation (e.g., Find the ‘small bar to the left of a tall bar’ pair) among pairs of the opposite relation, and we measured processing efficiency from the increase in response times as the number of pairs increased. In Experiment 2, the task was to judge which of two relation types was more prevalent in a briefly presented display of 10 data pairs (e.g., Are there more ‘small bar to the left of a tall bar’ pairs or more ‘tall bar to the left of a small bar’ pairs?). In the final experiment, the task was to estimate the average delta within a briefly presented display of 6 data pairs (e.g., What is the average bar height difference across all ‘small bar to the left of a tall bar’ pairs?). Across all three experiments, visual processing of relations between data value pairs was significantly better when directly encoded as deltas rather than implicitly between individual data points, and varied substantially depending on the task (improvement ranged from 25% to 95%). Considering the ubiquity of bar charts and dot plots, relation perception for individual data values is highly inefficient, and confirms the need for alternative designs that provide not only absolute values, but also direct encoding of critical relationships between those values.",Christine Nothelfer;Steven Franconeri,Christine Nothelfer;Steven Franconeri,Northwestern University;Northwestern University,"10.1109/TVCG.2013.183,10.1109/TVCG.2014.2346320","Information visualization,marks,perception,attention,visual comparison,visual search,aggregation",0,3,26,
InfoVis,2019,OntoPlot: A Novel Visualisation for Non-hierarchical Associations in Large Ontologies,10.1109/TVCG.2019.2934557,http://dx.doi.org/10.1109/TVCG.2019.2934557,1140,1150,J,"Ontologies are formal representations of concepts and complex relationships among them. They have been widely used to capture comprehensive domain knowledge in areas such as biology and medicine, where large and complex ontologies can contain hundreds of thousands of concepts. Especially due to the large size of ontologies, visualisation is useful for authoring, exploring and understanding their underlying data. Existing ontology visualisation tools generally focus on the hierarchical structure, giving much less emphasis to non-hierarchical associations. In this paper we present OntoPlot, a novel visualisation specifically designed to facilitate the exploration of all concept associations whilst still showing an ontology's large hierarchical structure. This hybrid visualisation combines icicle plots, visual compression techniques and interactivity, improving space-efficiency and reducing visual structural complexity. We conducted a user study with domain experts to evaluate the usability of OntoPlot, comparing it with the de facto ontology editor Protégé. The results confirm that OntoPlot attains our design goals for association-related tasks and is strongly favoured by domain experts.",Ying Yang;Michael Wybrow;Yuan-Fang Li;Tobias Czauderna;Yongqun He,Ying Yang;Michael Wybrow;Yuan-Fang Li;Tobias Czauderna;Yongqun He,"Monash University, Australia;Monash University, Australia;Monash University, Australia;Monash University, Australia;University of Michigan, Medical School, USA",10.1109/VISUAL.1996.567745,"Ontology visualisation,visual compression,interactive exploration,ontology associations",0,0,72,
InfoVis,2019,P5: Portable Progressive Parallel Processing Pipelines for Interactive Data Analysis and Visualization,10.1109/TVCG.2019.2934537,http://dx.doi.org/10.1109/TVCG.2019.2934537,1151,1160,J,"We present P5, a web-based visualization toolkit that combines declarative visualization grammar and GPU computing for progressive data analysis and visualization. To interactively analyze and explore big data, progressive analytics and visualization methods have recently emerged. Progressive visualizations of incrementally refining results have the advantages of allowing users to steer the analysis process and make early decisions. P5 leverages declarative grammar for specifying visualization designs and exploits GPU computing to accelerate progressive data processing and rendering. The declarative specifications can be modified during progressive processing to create different visualizations for analyzing the intermediate results. To enable user interactions for progressive data analysis, P5 utilizes the GPU to automatically aggregate and index data based on declarative interaction specifications to facilitate effective interactive visualization. We demonstrate the effectiveness and usefulness of P5 through a variety of example applications and several performance benchmark tests.",Jianping Kelvin Li;Kwan-Liu Ma,Jianping Kelvin Li;Kwan-Liu Ma,"University of California, Davis;University of California, Davis","10.1109/TVCG.2011.185,10.1109/TVCG.2014.2346319,10.1109/TVCG.2010.144,10.1109/TVCG.2014.2346452,10.1109/TVCG.2009.191,10.1109/TVCG.2014.2346578,10.1109/TVCG.2017.2744358,10.1109/TVCG.2009.110,10.1109/TVCG.2016.2599030,10.1109/TVCG.2015.2467091,10.1109/TVCG.2014.2346574,10.1109/INFVIS.2002.1173141,10.1109/TVCG.2016.2598470","Information visualization,progressive analytics,visualization software,GPU computing,data exploration",0,2,47,
InfoVis,2019,Pattern-Driven Navigation in 2D Multiscale Visualizations with Scalable Insets,10.1109/TVCG.2019.2934555,http://dx.doi.org/10.1109/TVCG.2019.2934555,611,621,J,"We present Scalable Insets, a technique for interactively exploring and navigating large numbers of annotated patterns in multiscale visualizations such as gigapixel images, matrices, or maps. Exploration of many but sparsely-distributed patterns in multiscale visualizations is challenging as visual representations change across zoom levels, context and navigational cues get lost upon zooming, and navigation is time consuming. Our technique visualizes annotated patterns too small to be identifiable at certain zoom levels using insets, i.e., magnified thumbnail views of the annotated patterns. Insets support users in searching, comparing, and contextualizing patterns while reducing the amount of navigation needed. They are dynamically placed either within the viewport or along the boundary of the viewport to offer a compromise between locality and context preservation. Annotated patterns are interactively clustered by location and type. They are visually represented as an aggregated inset to provide scalable exploration within a single viewport. In a controlled user study with 18 participants, we found that Scalable Insets can speed up visual search and improve the accuracy of pattern comparison at the cost of slower frequency estimation compared to a baseline technique. A second study with 6 experts in the field of genomics showed that Scalable Insets is easy to learn and provides first insights into how Scalable Insets can be applied in an open-ended data exploration scenario.",Fritz Lekschas;Michael Behrisch 0001;Benjamin Bach;Peter Kerpedjiev;Nils Gehlenborg;Hanspeter Pfister,Fritz Lekschas;Michael Behrisch;Benjamin Bach;Peter Kerpedjiev;Nils Gehlenborg;Hanspeter Pfister,"School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA;School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA;University of Edinburgh, Edinburgh, UK;Harvard Medical School, Boston, MA, USA;Harvard Medical School, Boston, MA, USA;School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA","10.1109/TVCG.2006.136,10.1109/TVCG.2011.185,10.1109/VAST.2009.5333443,10.1109/TVCG.2011.231,10.1109/TVCG.2017.2745978,10.1109/TVCG.2013.154,10.1109/TVCG.2013.213,10.1109/TVCG.2014.2346441,10.1109/TVCG.2014.2346352,10.1109/TVCG.2007.70589","Guided Navigation,Pattern Exploration,Multiscale Visualizations,Gigapixel Images,Geospatial Maps,Genomics",0,2,73,
InfoVis,2019,Persistent Homology Guided Force-Directed Graph Layouts,10.1109/TVCG.2019.2934802,http://dx.doi.org/10.1109/TVCG.2019.2934802,697,707,J,"Graphs are commonly used to encode relationships among entities, yet their abstractness makes them difficult to analyze. Node-link diagrams are popular for drawing graphs, and force-directed layouts provide a flexible method for node arrangements that use local relationships in an attempt to reveal the global shape of the graph. However, clutter and overlap of unrelated structures can lead to confusing graph visualizations. This paper leverages the persistent homology features of an undirected graph as derived information for interactive manipulation of force-directed layouts. We first discuss how to efficiently extract 0-dimensional persistent homology features from both weighted and unweighted undirected graphs. We then introduce the interactive persistence barcode used to manipulate the force-directed graph layout. In particular, the user adds and removes contracting and repulsing forces generated by the persistent homology features, eventually selecting the set of persistent homology features that most improve the layout. Finally, we demonstrate the utility of our approach across a variety of synthetic and real datasets.",Ashley Suh;Mustafa Hajij;Bei Wang;Carlos Scheidegger;Paul A. Rosen,Ashley Suh;Mustafa Hajij;Bei Wang;Carlos Scheidegger;Paul Rosen,University of South FloridaTufts University;Ohio State University;University of Utah;University of Arizona;University of South Florida,"10.1109/TVCG.2016.2598958,10.1109/TVCG.2009.122,10.1109/TVCG.2012.208,10.1109/TVCG.2013.151,10.1109/TVCG.2011.223,10.1109/INFVIS.2002.1173159,10.1109/TVCG.2008.158,10.1109/TVCG.2017.2744321,10.1109/TVCG.2011.190,10.1109/TVCG.2014.2346441,10.1109/TVCG.2017.2745919,10.1109/TVCG.2018.2864911,10.1109/INFVIS.2003.1249008","Graph drawing,force-directed layout,Topological Data Analysis,persistent homology",0,1,90,
InfoVis,2019,RSATree: Distribution-Aware Data Representation of Large-Scale Tabular Datasets for Flexible Visual Query,10.1109/TVCG.2019.2934800,http://dx.doi.org/10.1109/TVCG.2019.2934800,1161,1171,J,"Analysts commonly investigate the data distributions derived from statistical aggregations of data that are represented by charts, such as histograms and binned scatterplots, to visualize and analyze a large-scale dataset. Aggregate queries are implicitly executed through such a process. Datasets are constantly extremely large; thus, the response time should be accelerated by calculating predefined data cubes. However, the queries are limited to the predefined binning schema of preprocessed data cubes. Such limitation hinders analysts' flexible adjustment of visual specifications to investigate the implicit patterns in the data effectively. Particularly, RSATree enables arbitrary queries and flexible binning strategies by leveraging three schemes, namely, an R-tree-based space partitioning scheme to catch the data distribution, a locality-sensitive hashing technique to achieve locality-preserving random access to data items, and a summed area table scheme to support interactive query of aggregated values with a linear computational complexity. This study presents and implements a web-based visual query system that supports visual specification, query, and exploration of large-scale tabular data with user-adjustable granularities. We demonstrate the efficiency and utility of our approach by performing various experiments on real-world datasets and analyzing time and space complexity.",Honghui Mei;Wei Chen 0001;Yating Wei;Yuanzhe Hu;Shuyue Zhou;Bingru Lin;Ying Zhao 0001;Jiazhi Xia,Honghui Mei;Wei Chen;Yating Wei;Yuanzhe Hu;Shuyue Zhou;Bingru Lin;Ying Zhao;Jiazhi Xia,The State Key Lab of CAD & CGZhejiang University;The State Key Lab of CAD & CGZhejiang University;The State Key Lab of CAD & CGZhejiang University;The State Key Lab of CAD & CGZhejiang University;School of Computer Science and EngineeringCentral South University;The State Key Lab of CAD & CGZhejiang University;School of Computer Science and EngineeringCentral South University;School of Computer Science and EngineeringCentral South University,"10.1109/VAST.2014.7042480,10.1109/TVCG.2011.185,10.1109/TVCG.2014.2346594,10.1109/TVCG.2013.152,10.1109/TVCG.2013.179,10.1109/TVCG.2014.2346452,10.1109/TVCG.2016.2598624,10.1109/INFVIS.1996.559210,10.1109/TVCG.2018.2865075,10.1109/INFVIS.2000.885086,10.1109/TVCG.2016.2598694,10.1109/TVCG.2015.2467191,10.1109/TVCG.2017.2744098,10.1109/TVCG.2018.2865020,10.1109/TVCG.2018.2864503","Aggregate query,visual query,large-scale data visualization,R-tree,summed area table,hashing",0,2,73,
InfoVis,2019,Searching the Visual Style and Structure of D3 Visualizations,10.1109/TVCG.2019.2934431,http://dx.doi.org/10.1109/TVCG.2019.2934431,1236,1245,J,"We present a search engine for D3 visualizations that allows queries based on their visual style and underlying structure. To build the engine we crawl a collection of 7860 D3 visualizations from the Web and deconstruct each one to recover its data, its data-encoding marks and the encodings describing how the data is mapped to visual attributes of the marks. We also extract axes and other non-data-encoding attributes of marks (e.g., typeface, background color). Our search engine indexes this style and structure information as well as metadata about the webpage containing the chart. We show how visualization developers can search the collection to find visualizations that exhibit specific design characteristics and thereby explore the space of possible designs. We also demonstrate how researchers can use the search engine to identify commonly used visual design patterns and we perform such a demographic design analysis across our collection of D3 charts. A user study reveals that visualization developers found our style and structure based search engine to be significantly more useful and satisfying for finding different designs of D3 charts, than a baseline search engine that only allows keyword search over the webpage containing a chart.",Enamul Hoque;Maneesh Agrawala,Enamul Hoque;Maneesh Agrawala,York University;Stanford University,"10.1109/TVCG.2013.234,10.1109/TVCG.2008.137,10.1109/TVCG.2017.2744320,10.1109/TVCG.2016.2598839,10.1109/TVCG.2016.2599030,10.1109/TVCG.2018.2865024","visualization search engine,visualization design,search user interfaces",0,3,45,
InfoVis,2019,Separating the Wheat from the Chaff: Comparative Visual Cues for Transparent Diagnostics of Competing Models,10.1109/TVCG.2019.2934540,http://dx.doi.org/10.1109/TVCG.2019.2934540,1043,1053,J,"Experts in data and physical sciences have to regularly grapple with the problem of competing models. Be it analytical or physics-based models, a cross-cutting challenge for experts is to reliably diagnose which model outcomes appropriately predict or simulate real-world phenomena. Expert judgment involves reconciling information across many, and often, conflicting criteria that describe the quality of model outcomes. In this paper, through a design study with climate scientists, we develop a deeper understanding of the problem and solution space of model diagnostics, resulting in the following contributions: i) a problem and task characterization using which we map experts' model diagnostics goals to multi-way visual comparison tasks, ii) a design space of comparative visual cues for letting experts quickly understand the degree of disagreement among competing models and gauge the degree of stability of model outputs with respect to alternative criteria, and iii) design and evaluation of MyriadCues, an interactive visualization interface for exploring alternative hypotheses and insights about good and bad models by leveraging comparative visual cues. We present case studies and subjective feedback by experts, which validate how MyriadCues enables more transparent model diagnostic mechanisms, as compared to the state of the art.",Aritra Dasgupta;Hong Wang;Nancy O'Brien;Susannah Burrows,Aritra Dasgupta;Hong Wang;Nancy O'Brien;Susannah Burrows,"New Jersey Institute of Technology;Arizona State University, Inc.;Pacific Northwest National Laboratory;Pacific Northwest National Laboratory","10.1109/TVCG.2015.2467618,10.1109/TVCG.2011.229,10.1109/TVCG.2017.2744199,10.1109/VISUAL.1990.146402,10.1109/TVCG.2008.139,10.1109/TVCG.2013.122,10.1109/TVCG.2014.2346751,10.1109/TVCG.2009.167,10.1109/TVCG.2016.2598589,10.1109/TVCG.2014.2346755,10.1109/TVCG.2014.2346321,10.1109/TVCG.2016.2598830,10.1109/TVCG.2011.225","Visual comparison,Visual cues,Model evaluation,Transparency,Simulation",0,2,48,
InfoVis,2019,ShapeWordle: Tailoring Wordles using Shape-aware Archimedean Spirals,10.1109/TVCG.2019.2934783,http://dx.doi.org/10.1109/TVCG.2019.2934783,991,1000,J,"We present a new technique to enable the creation of shape-bounded Wordles, we call ShapeWordle, in which we fit words to form a given shape. To guide word placement within a shape, we extend the traditional Archimedean spirals to be shape-aware by formulating the spirals in a differential form using the distance field of the shape. To handle non-convex shapes, we introduce a multi-centric Wordle layout method that segments the shape into parts for our shape-aware spirals to adaptively fill the space and generate word placements. In addition, we offer a set of editing interactions to facilitate the creation of semantically-meaningful Wordles. Lastly, we present three evaluations: a comprehensive comparison of our results against the state-of-the-art technique (WordArt), case studies with 14 users, and a gallery to showcase the coverage of our technique.",Yunhai Wang;Xiaowei Chu;Kaiyi Zhang;Chen Bao;Xiaotong Li;Jian Zhang 0070;Chi-Wing Fu;Christophe Hurter;Bongshin Lee;Oliver Deussen,Yunhai Wang;Xiaowei Chu;Kaiyi Zhang;Chen Bao;Xiaotong Li;Jian Zhang;Chi-Wing Fu;Christophe Hurter;Oliver Deussen;Bongshin Lee,"Shandong University;Shandong University;Shandong University;Shandong University;Shandong University;CNICCAS;Chinese University of Hong Kong;ENAC, France;Konstanz University, Germany;Microsoft Research","10.1109/VAST.2007.4389007,10.1109/VAST.2009.5333443,10.1109/TVCG.2011.233,10.1109/TVCG.2017.2746018,10.1109/TVCG.2011.223,10.1109/TVCG.2010.175,10.1109/TVCG.2010.194,10.1109/INFVIS.2004.56,10.1109/TVCG.2009.171,10.1109/TVCG.2017.2745859,10.1109/INFVIS.2001.963273","Wordle,Archimedean spiral,shape",0,0,42,
InfoVis,2019,SmartCube: An Adaptive Data Management Architecture for the Real-Time Visualization of Spatiotemporal Datasets,10.1109/TVCG.2019.2934434,http://dx.doi.org/10.1109/TVCG.2019.2934434,790,799,J,"Interactive visualization and exploration of large spatiotemporal data sets is difficult without carefully-designed data pre-processing and management tools. We propose a novel architecture for spatiotemporal data management. The architecture can dynamically update itself based on user queries. Datasets is stored in a tree-like structure to support memory sharing among cuboids in a logical structure of data cubes. An update mechanism is designed to create or remove cuboids on it, according to the analysis of the user queries, with the consideration of memory size limitation. Data structure is dynamically optimized according to different user queries. During a query process, user queries are recorded to predict the performance increment of the new cuboid. The creation or deletion of a cuboid is determined by performance increment. Experiment results show that our prototype system deliveries good performance towards user queries on different spatiotemporal datasets, which costing small memory size with comparable performance compared with other state-of-the-art algorithms.",Can Liu 0004;Cong Wu 0004;Hanning Shao;Xiaoru Yuan,Can Liu;Cong Wu;Hanning Shao;Xiaoru Yuan,Key Laboratory of Machine Perception (Ministry of Education)School of EECSPeking University;Key Laboratory of Machine Perception (Ministry of Education)School of EECSPeking University;Key Laboratory of Machine Perception (Ministry of Education)School of EECSPeking University;Key Laboratory of Machine Perception (Ministry of Education)School of EECSPeking University,"10.1109/TVCG.2014.2346418,10.1109/TVCG.2013.179,10.1109/TVCG.2014.2346452,10.1109/TVCG.2009.191,10.1109/TVCG.2016.2598624,10.1109/TVCG.2014.2346574,10.1109/INFVIS.2000.885086,10.1109/INFVIS.2002.1173141,10.1109/TVCG.2016.2598694,10.1109/TVCG.2017.2744059","data management,spatial-temporal data",0,3,38,
InfoVis,2019,Text-to-Viz: Automatic Generation of Infographics from Proportion-Related Natural Language Statements,10.1109/TVCG.2019.2934785,http://dx.doi.org/10.1109/TVCG.2019.2934785,906,916,J,"Combining data content with visual embellishments, infographics can effectively deliver messages in an engaging and memorable manner. Various authoring tools have been proposed to facilitate the creation of infographics. However, creating a professional infographic with these authoring tools is still not an easy task, requiring much time and design expertise. Therefore, these tools are generally not attractive to casual users, who are either unwilling to take time to learn the tools or lacking in proper design expertise to create a professional infographic. In this paper, we explore an alternative approach: to automatically generate infographics from natural language statements. We first conducted a preliminary study to explore the design space of infographics. Based on the preliminary study, we built a proof-of-concept system that automatically converts statements about simple proportion-related statistics to a set of infographics with pre-designed styles. Finally, we demonstrated the usability and usefulness of the system through sample results, exhibits, and expert reviews.",Weiwei Cui;Xiaoyu Zhang;Yun Wang 0012;He Huang;Bei Chen;Lei Fang;Haidong Zhang;Jian-Guan Lou;Dongmei Zhang,Weiwei Cui;Xiaoyu Zhang;Yun Wang;He Huang;Bei Chen;Lei Fang;Haidong Zhang;Jian-Guan Lou;Dongmei Zhang,"Microsoft Research Asia;ViDi Research Group, University of California, Davis;Microsoft Research Asia;Microsoft Research Asia;Microsoft Research Asia;Microsoft Research Asia;Microsoft Research Asia;Microsoft Research Asia;Microsoft Research Asia","10.1109/TVCG.2016.2598647,10.1109/TVCG.2012.197,10.1109/TVCG.2015.2467732,10.1109/TVCG.2013.234,10.1109/TVCG.2016.2598876,10.1109/TVCG.2015.2467321,10.1109/TVCG.2016.2598620,10.1109/TVCG.2007.70594,10.1109/TVCG.2012.221,10.1109/TVCG.2018.2865240,10.1109/TVCG.2014.2346291,10.1109/TVCG.2018.2865158,10.1109/TVCG.2010.179,10.1109/TVCG.2015.2467471,10.1109/TVCG.2018.2865145,10.1109/TVCG.2007.70577,10.1109/TVCG.2015.2467191","Visualization for the masses,infographic,automatic visualization,presentation,and dissemination",0,1,73,
InfoVis,2019,The Impact of Immersion on Cluster Identification Tasks,10.1109/TVCG.2019.2934395,http://dx.doi.org/10.1109/TVCG.2019.2934395,525,535,J,"Recent developments in technology encourage the use of head-mounted displays (HMDs) as a medium to explore visualizations in virtual realities (VRs). VR environments (VREs) enable new, more immersive visualization design spaces compared to traditional computer screens. Previous studies in different domains, such as medicine, psychology, and geology, report a positive effect of immersion, e.g., on learning performance or phobia treatment effectiveness. Our work presented in this paper assesses the applicability of those findings to a common task from the information visualization (InfoVis) domain. We conducted a quantitative user study to investigate the impact of immersion on cluster identification tasks in scatterplot visualizations. The main experiment was carried out with 18 participants in a within-subjects setting using four different visualizations, (1) a 2D scatterplot matrix on a screen, (2) a 3D scatterplot on a screen, (3) a 3D scatterplot miniature in a VRE and (4) a fully immersive 3D scatterplot in a VRE. The four visualization design spaces vary in their level of immersion, as shown in a supplementary study. The results of our main study indicate that task performance differs between the investigated visualization design spaces in terms of accuracy, efficiency, memorability, sense of orientation, and user preference. In particular, the 2D visualization on the screen performed worse compared to the 3D visualizations with regard to the measured variables. The study shows that an increased level of immersion can be a substantial benefit in the context of 3D data and cluster detection.",Matthias Kraus;Niklas Weiler;Daniela Oelke;Johannes Kehrer;Daniel A. Keim;Johannes Fuchs 0001,M. Kraus;N. Weiler;D. Oelke;J. Kehrer;D. A. Keim;J. Fuchs,"University of Konstanz, Germany;University of Konstanz, Germany;Siemens Corporate Technology, Munich, Germany;Siemens Corporate Technology, Munich, Germany;University of Konstanz, Germany;University of Konstanz, Germany","10.1109/TVCG.2018.2864477,10.1109/INFVIS.1998.729555,10.1109/TVCG.2008.153,10.1109/VAST.2008.4677350,10.1109/TVCG.2013.153,10.1109/VISUAL.2002.1183816,10.1109/INFVIS.1999.801851,10.1109/VAST.2007.4389000,10.1109/TVCG.2015.2467202","Virtual reality,evaluation,visual analytics,clustering",0,4,67,
InfoVis,2019,The Perceptual Proxies of Visual Comparison,10.1109/TVCG.2019.2934786,http://dx.doi.org/10.1109/TVCG.2019.2934786,1012,1021,J,"Perceptual tasks in visualizations often involve comparisons. Of two sets of values depicted in two charts, which set had values that were the highest overall? Which had the widest range? Prior empirical work found that the performance on different visual comparison tasks (e.g., “biggest delta”, “biggest correlation”) varied widely across different combinations of marks and spatial arrangements. In this paper, we expand upon these combinations in an empirical evaluation of two new comparison tasks: the “biggest mean” and “biggest range” between two sets of values. We used a staircase procedure to titrate the difficulty of the data comparison to assess which arrangements produced the most precise comparisons for each task. We find visual comparisons of biggest mean and biggest range are supported by some chart arrangements more than others, and that this pattern is substantially different from the pattern for other tasks. To synthesize these dissonant findings, we argue that we must understand which features of a visualization are actually used by the human visual system to solve a given task. We call these perceptual proxies. For example, when comparing the means of two bar charts, the visual system might use a “Mean length” proxy that isolates the actual lengths of the bars and then constructs a true average across these lengths. Alternatively, it might use a “Hull Area” proxy that perceives an implied hull bounded by the bars of each chart and then compares the areas of these hulls. We propose a series of potential proxies across different tasks, marks, and spatial arrangements. Simple models of these proxies can be empirically evaluated for their explanatory power by matching their performance to human performance across these marks, arrangements, and tasks. We use this process to highlight candidates for perceptual proxies that might scale more broadly to explain performance in visual comparison.",Nicole Jardine;Brian D. Ondov;Niklas Elmqvist;Steven Franconeri,Nicole Jardine;Brian D. Ondov;Niklas Elmqvist;Steven Franconeri,"Cook County Assessor's Office, Northwestern University, Chicago;National Institutes of Health, Bethesda, MD, USA;University of Maryland, College Park, MD, USA;Cook County Assessor's Office, Northwestern University, Chicago","10.1109/INFVIS.2005.1532136,10.1109/TVCG.2015.2466971,10.1109/TVCG.2017.2744199,10.1109/TVCG.2014.2346979,10.1109/TVCG.2010.162,10.1109/TVCG.2018.2864884,10.1109/TVCG.2007.70515","Graphical perception,visual perception,visual comparison,crowdsourced evaluation",0,4,30,HM
InfoVis,2019,The Role of Latency and Task Complexity in Predicting Visual Search Behavior,10.1109/TVCG.2019.2934556,http://dx.doi.org/10.1109/TVCG.2019.2934556,1246,1255,J,"Latency in a visualization system is widely believed to affect user behavior in measurable ways, such as requiring the user to wait for the visualization system to respond, leading to interruption of the analytic flow. While this effect is frequently observed and widely accepted, precisely how latency affects different analysis scenarios is less well understood. In this paper, we examine the role of latency in the context of visual search, an essential task in data foraging and exploration using visualization. We conduct a series of studies on Amazon Mechanical Turk and find that under certain conditions, latency is a statistically significant predictor of visual search behavior, which is consistent with previous studies. However, our results also suggest that task type, task complexity, and other factors can modulate the effect of latency, in some cases rendering latency statistically insignificant in predicting user behavior. This suggests a more nuanced view of the role of latency than previously reported. Building on these results and the findings of prior studies, we propose design guidelines for measuring and interpreting the effects of latency when evaluating performance on visual search tasks.",Leilani Battle;R. Jordan Crouser;Audace Nakeshimana;Ananda Montoly;Remco Chang;Michael Stonebraker,Leilani Battle;R. Jordan Crouser;Audace Nakeshimana;Ananda Montoly;Remco Chang;Michael Stonebraker,Department of Computer ScienceUniversity of Maryland;Department of Computer ScienceSmith College;Electrical Engineering & Computer Science DepartmentMIT;Department of Computer ScienceSmith College;Department of Computer ScienceTufts University;Electrical Engineering & Computer Science DepartmentMIT,"10.1109/TVCG.2014.2346575,10.1109/TVCG.2014.2346979,10.1109/TVCG.2015.2467671,10.1109/TVCG.2013.179,10.1109/TVCG.2014.2346452","Visual search,latency,system response time,SRT",0,0,35,
InfoVis,2019,"There Is No Spoon: Evaluating Performance, Space Use, and Presence with Expert Domain Users in Immersive Analytics",10.1109/TVCG.2019.2934803,http://dx.doi.org/10.1109/TVCG.2019.2934803,536,546,J,"Immersive analytics turns the very space surrounding the user into a canvas for data analysis, supporting human cognitive abilities in myriad ways. We present the results of a design study, contextual inquiry, and longitudinal evaluation involving professional economists using a Virtual Reality (VR) system for multidimensional visualization to explore actual economic data. Results from our preregistered evaluation highlight the varied use of space depending on context (exploration vs. presentation), the organization of space to support work, and the impact of immersion on navigation and orientation in the 3D analysis space.",Andrea Batch;Andrew Cunningham;Maxime Cordeil;Niklas Elmqvist;Tim Dwyer;Bruce H. Thomas;Kim Marriott,Andrea Batch;Andrew Cunningham;Maxime Cordeil;Niklas Elmqvist;Tim Dwyer;Bruce H. Thomas;Kim Marriott,"University of Maryland, College Park, MD, USA;University of South Australia, Adelaide, Australia;Monash University, Melbourne, Australia;University of Maryland, College Park, MD, USA;Monash University, Melbourne, Australia;University of South Australia, Adelaide, Australia;Monash University, Melbourne, Australia","10.1109/TVCG.2017.2743990,10.1109/TVCG.2016.2599107,10.1109/VISUAL.1990.146402,10.1109/TVCG.2012.219,10.1109/VISUAL.1995.480800,10.1109/TVCG.2012.213","Design study,evaluation,economic analysis,immersive analytics",0,6,53,
InfoVis,2019,Toward Objective Evaluation of Working Memory in Visualizations: A Case Study Using Pupillometry and a Dual-Task Paradigm,10.1109/TVCG.2019.2934286,http://dx.doi.org/10.1109/TVCG.2019.2934286,332,342,J,"Cognitive science has established widely used and validated procedures for evaluating working memory in numerous applied domains, but surprisingly few studies have employed these methodologies to assess claims about the impacts of visualizations on working memory. The lack of information visualization research that uses validated procedures for measuring working memory may be due, in part, to the absence of cross-domain methodological guidance tailored explicitly to the unique needs of visualization research. This paper presents a set of clear, practical, and empirically validated methods for evaluating working memory during visualization tasks and provides readers with guidance in selecting an appropriate working memory evaluation paradigm. As a case study, we illustrate multiple methods for evaluating working memory in a visual-spatial aggregation task with geospatial data. The results show that the use of dual-task experimental designs (simultaneous performance of several tasks compared to single-task performance) and pupil dilation can reveal working memory demands associated with task difficulty and dual-tasking. In a dual-task experimental design, measures of task completion times and pupillometry revealed the working memory demands associated with both task difficulty and dual-tasking. Pupillometry demonstrated that participants' pupils were significantly larger when they were completing a more difficult task and when multitasking. We propose that researchers interested in the relative differences in working memory between visualizations should consider a converging methods approach, where physiological measures and behavioral measures of working memory are employed to generate a rich evaluation of visualization effort.",Lace M. K. Padilla;Spencer C. Castro;P. Samuel Quinan;Ian T. Ruginski;Sarah H. Creem-Regehr,Lace M.K. Padilla;Spencer C. Castro;P. Samuel Quinan;Ian T. Ruginski;Sarah H. Creem-Regehr,University of California Merced in Cognitive + Information Sciences;Department of PsychologyUniversity of Utah;University of UtahSchool of Computing;Department of PsychologyUniversity of Utah;Department of PsychologyUniversity of Utah,"10.1109/INFVIS.2005.1532136,10.1109/TVCG.2012.197,10.1109/TVCG.2010.177,10.1109/TVCG.2016.2599106","Working Memory,Cognitive Effort,Evaluation Methods,Pupillometry,Geographic/Geospatial Visualization,Quantitative Evaluation",0,0,98,
InfoVis,2019,Towards Automated Infographic Design: Deep Learning-based Auto-Extraction of Extensible Timeline,10.1109/TVCG.2019.2934810,http://dx.doi.org/10.1109/TVCG.2019.2934810,917,926,J,"Designers need to consider not only perceptual effectiveness but also visual styles when creating an infographic. This process can be difficult and time consuming for professional designers, not to mention non-expert users, leading to the demand for automated infographics design. As a first step, we focus on timeline infographics, which have been widely used for centuries. We contribute an end-to-end approach that automatically extracts an extensible timeline template from a bitmap image. Our approach adopts a deconstruction and reconstruction paradigm. At the deconstruction stage, we propose a multi-task deep neural network that simultaneously parses two kinds of information from a bitmap timeline: 1) the global information, i.e., the representation, scale, layout, and orientation of the timeline, and 2) the local information, i.e., the location, category, and pixels of each visual element on the timeline. At the reconstruction stage, we propose a pipeline with three techniques, i.e., Non-Maximum Merging, Redundancy Recover, and DL GrabCut, to extract an extensible template from the infographic, by utilizing the deconstruction results. To evaluate the effectiveness of our approach, we synthesize a timeline dataset (4296 images) and collect a real-world timeline dataset (393 images) from the Internet. We first report quantitative evaluation results of our approach over the two datasets. Then, we present examples of automatically extracted templates and timelines automatically generated based on these templates to qualitatively demonstrate the performance. The results confirm that our approach can effectively extract extensible templates from real-world timeline infographics.",Zhutian Chen;Yun Wang 0012;Qianwen Wang;Yong Wang 0021;Huamin Qu,Zhutian Chen;Yun Wang;Qianwen Wang;Yong Wang;Huamin Qu,Hong Kong University of Science and Technology;Microsoft Research;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology,"10.1109/TVCG.2015.2467732,10.1109/TVCG.2016.2598620,10.1109/TVCG.2007.70594,10.1109/TVCG.2018.2865240,10.1109/TVCG.2017.2744320,10.1109/TVCG.2016.2599030,10.1109/TVCG.2015.2467191","Automated Infographic Design,Deep Learning-based Approach,Timeline Infographics,Multi-task Model",0,3,56,
InfoVis,2019,Uncertainty-Aware Principal Component Analysis,10.1109/TVCG.2019.2934812,http://dx.doi.org/10.1109/TVCG.2019.2934812,822,831,J,"We present a technique to perform dimensionality reduction on data that is subject to uncertainty. Our method is a generalization of traditional principal component analysis (PCA) to multivariate probability distributions. In comparison to non-linear methods, linear dimensionality reduction techniques have the advantage that the characteristics of such probability distributions remain intact after projection. We derive a representation of the PCA sample covariance matrix that respects potential uncertainty in each of the inputs, building the mathematical foundation of our new method: uncertainty-aware PCA. In addition to the accuracy and performance gained by our approach over sampling-based strategies, our formulation allows us to perform sensitivity analysis with regard to the uncertainty in the data. For this, we propose factor traces as a novel visualization that enables to better understand the influence of uncertainty on the chosen principal components. We provide multiple examples of our technique using real-world datasets. As a special case, we show how to propagate multivariate normal distributions through PCA in closed form. Furthermore, we discuss extensions and limitations of our approach.",Jochen Görtler;Thilo Spinner;Dirk Streeb;Daniel Weiskopf;Oliver Deussen,Jochen Görtler;Thilo Spinner;Dirk Streeb;Daniel Weiskopf;Oliver Deussen,"University of Konstanz, Germany;University of Konstanz, Germany;University of Konstanz, Germany;University of Stuttgart, Germany;University of Konstanz, Germany","10.1109/TVCG.2016.2598694,10.1109/TVCG.2016.2598919,10.1109/TVCG.2014.2346481,10.1109/TVCG.2015.2467132,10.1109/TVCG.2018.2865194,10.1109/TVCG.2016.2598604","Uncertainty,dimensionality reduction,principal component analysis,linear projection,machine learning",0,0,44,
InfoVis,2019,VisTA: Integrating Machine Intelligence with Visualization to Support the Investigation of Think-Aloud Sessions,10.1109/TVCG.2019.2934797,http://dx.doi.org/10.1109/TVCG.2019.2934797,343,352,J,"Think-aloud protocols are widely used by user experience (UX) practitioners in usability testing to uncover issues in user interface design. It is often arduous to analyze large amounts of recorded think-aloud sessions and few UX practitioners have an opportunity to get a second perspective during their analysis due to time and resource constraints. Inspired by the recent research that shows subtle verbalization and speech patterns tend to occur when users encounter usability problems, we take the first step to design and evaluate an intelligent visual analytics tool that leverages such patterns to identify usability problem encounters and present them to UX practitioners to assist their analysis. We first conducted and recorded think-aloud sessions, and then extracted textual and acoustic features from the recordings and trained machine learning (ML) models to detect problem encounters. Next, we iteratively designed and developed a visual analytics tool, VisTA, which enables dynamic investigation of think-aloud sessions with a timeline visualization of ML predictions and input features. We conducted a between-subjects laboratory study to compare three conditions, i.e., VisTA, VisTASimple (no visualization of the ML's input features), and Baseline (no ML information at all), with 30 UX professionals. The findings show that UX professionals identified more problem encounters when using VisTA than Baseline by leveraging the problem visualization as an overview, anticipations, and anchors as well as the feature visualization as a means to understand what ML considers and omits. Our findings also provide insights into how they treated ML, dealt with (dis)agreement with ML, and reviewed the videos (i.e., play, pause, and rewind).",Mingming Fan 0001;Ke Wu;Jian Zhao;Yue Li;Winter Wei;Khai N. Truong,Mingming Fan;Ke Wu;Jian Zhao;Yue Li;Winter Wei;Khai N. Truong,University of Toronto;University of Toronto;University of Waterloo;University of Toronto;University of Toronto;University of Toronto,"10.1109/TVCG.2015.2467871,10.1109/VAST.2008.4677365,10.1109/TVCG.2008.137,10.1109/VAST.2010.5653598,10.1109/TVCG.2016.2598543,10.1109/TVCG.2017.2745279","Think-aloud,visual analytics,machine intelligence,user study,usability problems,session review behavior,UX practices",0,0,45,
InfoVis,2019,What is Interaction for Data Visualization?,10.1109/TVCG.2019.2934283,http://dx.doi.org/10.1109/TVCG.2019.2934283,119,129,J,"Interaction is fundamental to data visualization, but what “interaction” means in the context of visualization is ambiguous and confusing. We argue that this confusion is due to a lack of consensual definition. To tackle this problem, we start by synthesizing an inclusive view of interaction in the visualization community – including insights from information visualization, visual analytics and scientific visualization, as well as the input of both senior and junior visualization researchers. Once this view takes shape, we look at how interaction is defined in the field of human-computer interaction (HCI). By extracting commonalities and differences between the views of interaction in visualization and in HCI, we synthesize a definition of interaction for visualization. Our definition is meant to be a thinking tool and inspire novel and bolder interaction design practices. We hope that by better understanding what interaction in visualization is and what it can be, we will enrich the quality of interaction in visualization systems and empower those who use them.",Evanthia Dimara;Charles Perin,Evanthia Dimara;Charles Perin,Sorbonne University;University of Victoria,"10.1109/INFVIS.2005.1532136,10.1109/TVCG.2013.124,10.1109/INFVIS.2000.885092,10.1109/INFVIS.1998.729560,10.1109/INFVIS.1996.559213,10.1109/TVCG.2018.2865233,10.1109/VAST.2008.4677365,10.1109/TVCG.2015.2467613,10.1109/VAST.2011.6102473,10.1109/TVCG.2013.134,10.1109/TVCG.2016.2598620,10.1109/TVCG.2008.109,10.1109/TVCG.2018.2865159,10.1109/TVCG.2012.204,10.1109/TVCG.2013.191,10.1109/TVCG.2010.157,10.1109/TVCG.2010.177,10.1109/TVCG.2014.2346573,10.1109/TVCG.2018.2864913,10.1109/TVCG.2009.111,10.1109/TVCG.2014.2346311,10.1109/TVCG.2018.2865237,10.1109/TVCG.2007.70541,10.1109/TVCG.2013.130,10.1109/TVCG.2016.2598839,10.1109/TVCG.2013.120,10.1109/TVCG.2015.2467831,10.1109/TVCG.2007.70577,10.1109/TVCG.2017.2745958,10.1109/TVCG.2016.2598608,10.1109/TVCG.2007.70515","interaction,visualization,data,definition,human-computer interaction",0,1,127,
InfoVis,2019,Why Authors Don't Visualize Uncertainty,10.1109/TVCG.2019.2934287,http://dx.doi.org/10.1109/TVCG.2019.2934287,130,139,J,"Clear presentation of uncertainty is an exception rather than rule in media articles, data-driven reports, and consumer applications, despite proposed techniques for communicating sources of uncertainty in data. This work considers, Why do so many visualization authors choose not to visualize uncertainty? I contribute a detailed characterization of practices, associations, and attitudes related to uncertainty communication among visualization authors, derived from the results of surveying 90 authors who regularly create visualizations for others as part of their work, and interviewing thirteen influential visualization designers. My results highlight challenges that authors face and expose assumptions and inconsistencies in beliefs about the role of uncertainty in visualization. In particular, a clear contradiction arises between authors' acknowledgment of the value of depicting uncertainty and the norm of omitting direct depiction of uncertainty. To help explain this contradiction, I present a rhetorical model of uncertainty omission in visualization-based communication. I also adapt a formal statistical model of how viewers judge the strength of a signal in a visualization to visualization-based communication, to argue that uncertainty communication necessarily reduces degrees of freedom in viewers' statistical inferences. I conclude with recommendations for how visualization research on uncertainty communication could better serve practitioners' current needs and values while deepening understanding of assumptions that reinforce uncertainty omission.",Jessica Hullman,Jessica Hullman,Northwestern University,"10.1109/TVCG.2016.2598862,10.1109/TVCG.2011.255,10.1109/TVCG.2018.2864889,10.1109/TVCG.2018.2864909,10.1109/TVCG.2010.161","Uncertainty visualization,graphical statistical inference,visualization rhetoric",0,5,55,
InfoVis,2019,Winglets: Visualizing Association with Uncertainty in Multi-class Scatterplots,10.1109/TVCG.2019.2934811,http://dx.doi.org/10.1109/TVCG.2019.2934811,770,779,J,"This work proposes Winglets, an enhancement to the classic scatterplot to better perceptually pronounce multiple classes by improving the perception of association and uncertainty of points to their related cluster. Designed as a pair of dual-sided strokes belonging to a data point, Winglets leverage the Gestalt principle of Closure to shape the perception of the form of the clusters, rather than use an explicit divisive encoding. Through a subtle design of two dominant attributes, length and orientation, Winglets enable viewers to perform a mental completion of the clusters. A controlled user study was conducted to examine the efficiency of Winglets in perceiving the cluster association and the uncertainty of certain points. The results show Winglets form a more prominent association of points into clusters and improve the perception of associating uncertainty.",Min Lu;Shuaiqi Wang;Joel Lanir;Noa Fish;Yang Yue;Daniel Cohen-Or;Hui Huang 0004,Min Lu;Shuaiqi Wang;Joel Lanir;Noa Fish;Yang Yue;Daniel Cohen-Or;Hui Huang,Shenzhen University;Shenzhen University;University of Haifa;Tel Aviv Univeristy;Shenzhen University;Shenzhen University;Shenzhen University,"10.1109/VAST.2010.5652460,10.1109/TVCG.2014.2346594,10.1109/TVCG.2009.122,10.1109/TVCG.2013.183,10.1109/TVCG.2018.2865141,10.1109/TVCG.2018.2865141,10.1109/TVCG.2017.2744184,10.1109/TVCG.2013.153,10.1109/VAST.2009.5332628,10.1109/TVCG.2018.2864912","Scatterplot,Gestalt laws,Association,Uncertainty",0,1,44,
SciVis,2019,A Structural Average of Labeled Merge Trees for Uncertainty Visualization,10.1109/TVCG.2019.2934242,http://dx.doi.org/10.1109/TVCG.2019.2934242,832,842,J,"Physical phenomena in science and engineering are frequently modeled using scalar fields. In scalar field topology, graph-based topological descriptors such as merge trees, contour trees, and Reeb graphs are commonly used to characterize topological changes in the (sub)level sets of scalar fields. One of the biggest challenges and opportunities to advance topology-based visualization is to understand and incorporate uncertainty into such topological descriptors to effectively reason about their underlying data. In this paper, we study a structural average of a set of labeled merge trees and use it to encode uncertainty in data. Specifically, we compute a 1-center tree that minimizes its maximum distance to any other tree in the set under a well-defined metric called the interleaving distance. We provide heuristic strategies that compute structural averages of merge trees whose labels do not fully agree. We further provide an interactive visualization system that resembles a numerical calculator that takes as input a set of merge trees and outputs a tree as their structural average. We also highlight structural similarities between the input and the average and incorporate uncertainty information for visual exploration. We develop a novel measure of uncertainty, referred to as consistency, via a metric-space view of the input trees. Finally, we demonstrate an application of our framework through merge trees that arise from ensembles of scalar fields. Our work is the first to employ interleaving distances and consistency to study a global, mathematically rigorous, structural average of merge trees in the context of uncertainty visualization.",Lin Yan;Yusu Wang;Elizabeth Munch;Ellen Gasparovic;Bei Wang,Lin Yan;Yusu Wang;Elizabeth Munch;Ellen Gasparovic;Bei Wang,University of Utah;Ohio State University;Michigan State University;Union College;University of Utah,"10.1109/VISUAL.1997.663875,10.1109/VISUAL.2002.1183774,10.1109/TVCG.2009.114,10.1109/TVCG.2010.181,10.1109/TVCG.2017.2743938,10.1109/TVCG.2007.70601,10.1109/TVCG.2013.143","Topological data analysis,uncertainty visualization,merge trees",0,2,82,
SciVis,2019,Accelerated Monte Carlo Rendering of Finite-Time Lyapunov Exponents,10.1109/TVCG.2019.2934313,http://dx.doi.org/10.1109/TVCG.2019.2934313,708,718,J,"Time-dependent fluid flows often contain numerous hyperbolic Lagrangian coherent structures, which act as transport barriers that guide the advection. The finite-time Lyapunov exponent is a commonly-used approximation to locate these repelling or attracting structures. Especially on large numerical simulations, the FTLE ridges can become arbitrarily sharp and very complex. Thus, the discrete sampling onto a grid for a subsequent direct volume rendering is likely to miss sharp ridges in the visualization. For this reason, an unbiased Monte Carlo-based rendering approach was recently proposed that treats the FTLE field as participating medium with single scattering. This method constructs a ground truth rendering without discretization, but it is prohibitively slow with render times in the order of days or weeks for a single image. In this paper, we accelerate the rendering process significantly, which allows us to compute video sequence of high-resolution FTLE animations in a much more reasonable time frame. For this, we follow two orthogonal approaches to improve on the rendering process: the volumetric light path integration in gradient domain and an acceleration of the transmittance estimation. We analyze the convergence and performance of the proposed method and demonstrate the approach by rendering complex FTLE fields in several 3D vector fields.",Irene Baeza Rojo;Markus H. Gross;Tobias Günther,Irene Baeza Rojo;Markus Gross;Tobias Günther,Computer Graphics LaboratoryETH Zürich;Computer Graphics LaboratoryETH Zürich;Computer Graphics LaboratoryETH Zürich,"10.1109/TVCG.2013.128,10.1109/TVCG.2007.70551,10.1109/TVCG.2007.70554","Scientific visualization,Monte Carlo,feature extraction,finite-time Lyapunov exponents,gradient domain,Fourier",0,0,58,
SciVis,2019,Analysis of the Near-Wall Flow in a Turbine Cascade by Splat Visualization,10.1109/TVCG.2019.2934367,http://dx.doi.org/10.1109/TVCG.2019.2934367,719,728,J,"Turbines are essential components of jet planes and power plants. Therefore, their efficiency and service life are of central engineering interest. In the case of jet planes or thermal power plants, the heating of the turbines due to the hot gas flow is critical. Besides effective cooling, it is a major goal of engineers to minimize heat transfer between gas flow and turbine by design. Since it is known that splat events have a substantial impact on the heat transfer between flow and immersed surfaces, we adapt a splat detection and visualization method to a turbine cascade simulation in this case study. Because splat events are small phenomena, we use a direct numerical simulation resolving the turbulence in the flow as the base of our analysis. The outcome shows promising insights into splat formation and its relation to vortex structures. This may lead to better turbine design in the future.",Baldwin Nsonga;Gerik Scheuermann;Stefan Gumhold;Jordi Ventosa-Molina;Denis Koschichow;Jochen Fröhlich,Baldwin Nsonga;Gerik Scheuermann;Stefan Gumhold;Jordi Ventosa-Molina;Denis Koschichow;Jochen Fröhlich,Institute of Computer ScienceLeipzig University;Institute of Computer ScienceLeipzig University;Institute of Software and Multimedia TechnologyTU Dresden;Institute of Fluid MechanicsTU Dresden;Institute of Fluid MechanicsTU Dresden;Institute of Fluid MechanicsTU Dresden,10.1109/VISUAL.1996.568137,"Flow Visualization,Visualization in Physical Sciences and Engineering,Feature Detection and Tracking,Vector Field Data",0,0,40,
SciVis,2019,Artifact-Based Rendering: Harnessing Natural and Traditional Visual Media for More Expressive and Engaging 3D Visualizations,10.1109/TVCG.2019.2934260,http://dx.doi.org/10.1109/TVCG.2019.2934260,492,502,J,"We introduce Artifact-Based Rendering (ABR), a framework of tools, algorithms, and processes that makes it possible to produce real, data-driven 3D scientific visualizations with a visual language derived entirely from colors, lines, textures, and forms created using traditional physical media or found in nature. A theory and process for ABR is presented to address three current needs: (i) designing better visualizations by making it possible for non-programmers to rapidly design and critique many alternative data-to-visual mappings; (ii) expanding the visual vocabulary used in scientific visualizations to depict increasingly complex multivariate data; (iii) bringing a more engaging, natural, and human-relatable handcrafted aesthetic to data visualization. New tools and algorithms to support ABR include front-end applets for constructing artifact-based colormaps, optimizing 3D scanned meshes for use in data visualization, and synthesizing textures from artifacts. These are complemented by an interactive rendering engine with custom algorithms and interfaces that demonstrate multiple new visual styles for depicting point, line, surface, and volume data. A within-the-research-team design study provides early evidence of the shift in visualization design processes that ABR is believed to enable when compared to traditional scientific visualization systems. Qualitative user feedback on applications to climate science and brain imaging support the utility of ABR for scientific discovery and public communication.",Seth Johnson;Francesca Samsel;Greg Abram;Daniel Olson;Andrew J. Solis;Bridger Herman;Phillip J. Wolfram;Christophe Lenglet;Daniel F. Keefe,Seth Johnson;Francesca Samsel;Gregory Abram;Daniel Olson;Andrew J. Solis;Bridger Herman;Phillip J. Wolfram;Christophe Lenglet;Daniel F. Keefe,"University of Minnesota;University of Texas, Austin;University of Texas, Austin;University of Minnesota;University of Minnesota;Fluid Dynamics and Solid Mechanics, Theoretical DivisionLos Alamos National Laboratory;University of Minnesota;University of Minnesota","10.1109/VISUAL.2005.1532853,10.1109/VISUAL.2005.1532856,10.1109/TVCG.2017.2743978,10.1109/TVCG.2011.261,10.1109/VISUAL.2002.1183824,10.1109/VISUAL.1999.809905,10.1109/VISUAL.1998.745294,10.1109/TVCG.2013.191,10.1109/VISUAL.2001.964510,10.1109/TVCG.2015.2467153","Visualization Design,Art and Visualization,Data Physicalization,Multivariate Visualization",0,1,84,
SciVis,2019,Cohort-based T-SSIM Visual Computing for Radiation Therapy Prediction and Exploration,10.1109/TVCG.2019.2934546,http://dx.doi.org/10.1109/TVCG.2019.2934546,949,959,J,"We describe a visual computing approach to radiation therapy (RT) planning, based on spatial similarity within a patient cohort. In radiotherapy for head and neck cancer treatment, dosage to organs at risk surrounding a tumor is a large cause of treatment toxicity. Along with the availability of patient repositories, this situation has lead to clinician interest in understanding and predicting RT outcomes based on previously treated similar patients. To enable this type of analysis, we introduce a novel topology-based spatial similarity measure, T-SSIM, and a predictive algorithm based on this similarity measure. We couple the algorithm with a visual steering interface that intertwines visual encodings for the spatial data and statistical results, including a novel parallel-marker encoding that is spatially aware. We report quantitative results on a cohort of 165 patients, as well as a qualitative evaluation with domain experts in radiation oncology, data management, biostatistics, and medical imaging, who are collaborating remotely.",Andrew Wentzel;Peter Hanula;Timothy Luciani;Baher Elgohari;Hesham Elhalawani;Guadalupe Canahuate;David M. Vock;Clifton D. Fuller;G. Elisabeta Marai,A. Wentzel;P. Hanula;T. Luciani;B. Elgohari;H. Elhalawani;G. Canahuate;D. Vock;C.D. Fuller;G.E. Marai,University of Illinois at Chicago;University of Illinois at Chicago;University of Illinois at Chicago;MD Anderson Cancer CenterUniversity of Texas;MD Anderson Cancer CenterUniversity of Texas;University of Iowa;School of Public HealthUniversity of Minnesota;MD Anderson Cancer CenterUniversity of Texas;University of Illinois at Chicago,"10.1109/TVCG.2015.2467441,10.1109/TVCG.2013.142,10.1109/TVCG.2011.185,10.1109/TVCG.2007.70542,10.1109/TVCG.2009.141,10.1109/TVCG.2017.2745085,10.1109/TVCG.2017.2744459,10.1109/VAST.2014.7042481,10.1109/TVCG.2018.2865147","Biomedical and Medical Visualization,Spatial Techniques,Visual Design,High-Dimensional Data",0,0,60,
SciVis,2019,Deadeye Visualization Revisited: Investigation of Preattentiveness and Applicability in Virtual Environments,10.1109/TVCG.2019.2934370,http://dx.doi.org/10.1109/TVCG.2019.2934370,547,557,J,"Visualizations rely on highlighting to attract and guide our attention. To make an object of interest stand out independently from a number of distractors, the underlying visual cue, e.g., color, has to be preattentive. In our prior work, we introduced Deadeye as an instantly recognizable highlighting technique that works by rendering the target object for one eye only. In contrast to prior approaches, Deadeye excels by not modifying any visual properties of the target. However, in the case of 2D visualizations, the method requires an additional setup to allow dichoptic presentation, which is a considerable drawback. As a follow-up to requests from the community, this paper explores Deadeye as a highlighting technique for 3D visualizations, because such stereoscopic scenarios support dichoptic presentation out of the box. Deadeye suppresses binocular disparities for the target object, so we cannot assume the applicability of our technique as a given fact. With this motivation, the paper presents quantitative evaluations of Deadeye in VR, including configurations with multiple heterogeneous distractors as an important robustness challenge. After confirming the preserved preattentiveness (all average accuracies above 90%) under such real-world conditions, we explore VR volume rendering as an example application scenario for Deadeye. We depict a possible workflow for integrating our technique, conduct an exploratory survey to demonstrate benefits and limitations, and finally provide related design implications.",Andrey Krekhov;Sebastian Cmentowski;Andre Waschk;Jens H. Krüger,Andrey Krekhov;Sebastian Cmentowski;Andre Waschk;Jens Krüger,"Center of Visual Data Analysis and Computer Graphics (COVIDAG), University of Duisburg, Essen;Center of Visual Data Analysis and Computer Graphics (COVIDAG), University of Duisburg, Essen;Center of Visual Data Analysis and Computer Graphics (COVIDAG), University of Duisburg, Essen;Center of Visual Data Analysis and Computer Graphics (COVIDAG), University of Duisburg, Essen","10.1109/TVCG.2011.234,10.1109/VISUAL.2005.1532838,10.1109/TVCG.2018.2864498,10.1109/VISUAL.2003.1250384,10.1109/TVCG.2014.2346352","Popout,virtual reality,preattentive vision,volume rendering,dichoptic presentation,binocular rivalry",0,1,88,
SciVis,2019,Dynamic Nested Tracking Graphs,10.1109/TVCG.2019.2934368,http://dx.doi.org/10.1109/TVCG.2019.2934368,249,258,J,"This work describes an approach for the interactive visual analysis of large-scale simulations, where numerous superlevel set components and their evolution are of primary interest. The approach first derives, at simulation runtime, a specialized Cinema database that consists of images of component groups, and topological abstractions. This database is processed by a novel graph operation-based nested tracking graph algorithm (GO-NTG) that dynamically computes NTGs for component groups based on size, overlap, persistence, and level thresholds. The resulting NTGs are in turn used in a feature-centered visual analytics framework to query specific database elements and update feature parameters, facilitating flexible post hoc analysis.",Jonas Lukasczyk;Christoph Garth;Gunther H. Weber;Tim Biedert;Ross Maciejewski;Heike Leitte,Jonas Lukasczyk;Christoph Garth;Gunther H. Weber;Tim Biedert;Ross Maciejewski;Heike Leitte,"Technische Universität Kaiserslautern;Technische Universität Kaiserslautern;Lawrence Berkeley National Laboratory, University of California, Davis;NVIDIA Corporation;Arizona State University;Technische Universität Kaiserslautern","10.1109/TVCG.2018.2865265,10.1109/VISUAL.1998.745288,10.1109/TVCG.2012.228","Topological Data Analysis,Nested Tracking Graphs,Image Databases,Feature Tracking,Post Hoc Visual Analytics",0,1,35,
SciVis,2019,Extraction and Visual Analysis of Potential Vorticity Banners around the Alps,10.1109/TVCG.2019.2934310,http://dx.doi.org/10.1109/TVCG.2019.2934310,259,269,J,"Potential vorticity is among the most important scalar quantities in atmospheric dynamics. For instance, potential vorticity plays a key role in particularly strong wind peaks in extratropical cyclones and it is able to explain the occurrence of frontal rain bands. Potential vorticity combines the key quantities of atmospheric dynamics, namely rotation and stratification. Under suitable wind conditions elongated banners of potential vorticity appear in the lee of mountains. Their role in atmospheric dynamics has recently raised considerable interest in the meteorological community for instance due to their influence in aviation wind hazards and maritime transport. In order to support meteorologists and climatologists in the analysis of these structures, we developed an extraction algorithm and a visual exploration framework consisting of multiple linked views. For the extraction we apply a predictor-corrector algorithm that follows streamlines and realigns them with extremal lines of potential vorticity. Using the agglomerative hierarchical clustering algorithm, we group banners from different sources based on their proximity. To visually analyze the time-dependent banner geometry, we provide interactive overviews and enable the query for detail on demand, including the analysis of different time steps, potentially correlated scalar quantities, and the wind vector field. In particular, we study the relationship between relative humidity and the banners for their potential in indicating the development of precipitation. Working with our method, the collaborating meteorologists gained a deeper understanding of the three-dimensional processes, which may spur follow-up research in the future.",Robin Bader;Michael Sprenger;Nikolina Ban;Stefan Rüdisühli;Christoph Schär;Tobias Günther,Robin Bader;Michael Sprenger;Nikolina Ban;Stefan Rüdisühli;Christoph Schär;Tobias Günther,Dep. of Computer ScienceETH Zürich;Institute for Atmospheric and Climate ScienceETH Zürich;Institute for Atmospheric and Climate ScienceETH Zürich;Institute for Atmospheric and Climate ScienceETH Zürich;Institute for Atmospheric and Climate ScienceETH Zürich;Dep. of Computer ScienceETH Zürich,"10.1109/VISUAL.1994.346327,10.1109/TVCG.2015.2467200,10.1109/TVCG.2007.70545,10.1109/TVCG.2017.2743989,10.1109/VISUAL.1999.809896,10.1109/VISUAL.2003.1250376","Scientific Visualization,potential vorticity,meteorology,feature extraction",0,0,48,
SciVis,2019,High-throughput feature extraction for measuring attributes of deforming open-cell foams,10.1109/TVCG.2019.2934620,http://dx.doi.org/10.1109/TVCG.2019.2934620,140,150,J,"Metallic open-cell foams are promising structural materials with applications in multifunctional systems such as biomedical implants, energy absorbers in impact, noise mitigation, and batteries. There is a high demand for means to understand and correlate the design space of material performance metrics to the material structure in terms of attributes such as density, ligament and node properties, void sizes, and alignments. Currently, X-ray Computed Tomography (CT) scans of these materials are segmented either manually or with skeletonization approaches that may not accurately model the variety of shapes present in nodes and ligaments, especially irregularities that arise from manufacturing, image artifacts, or deterioration due to compression. In this paper, we present a new workflow for analysis of open-cell foams that combines a new density measurement to identify nodal structures, and topological approaches to identify ligament structures between them. Additionally, we provide automated measurement of foam properties. We demonstrate stable extraction of features and time-tracking in an image sequence of a foam being compressed. Our approach allows researchers to study larger and more complex foams than could previously be segmented only manually, and enables the high-throughput analysis needed to predict future foam performance.",Steve Petruzza;Attila Gyulassy;Samuel Leventhal;John J. Baglino;Michael Czabaj;Ashley D. Spear;Valerio Pascucci,Steve Petruzza;Attila Gyulassy;Samuel Leventhal;John J. Baglino;Michael Czabaj;Ashley D. Spear;Valerio Pascucci,SCI InstituteUniversity of Utah;SCI InstituteUniversity of Utah;SCI InstituteUniversity of Utah;Dep. Mechanical EngineeringUniversity of Utah;Dep. Mechanical EngineeringUniversity of Utah;Dep. Mechanical EngineeringUniversity of Utah;SCI InstituteUniversity of Utah,"10.1109/TVCG.2018.2864848,10.1109/TVCG.2007.70603,10.1109/TVCG.2015.2467432,10.1109/VISUAL.1998.745288,10.1109/TVCG.2012.200","Topological analysis,foam,features extraction,feature tracking",0,1,64,
SciVis,2019,InSituNet: Deep Image Synthesis for Parameter Space Exploration of Ensemble Simulations,10.1109/TVCG.2019.2934312,http://dx.doi.org/10.1109/TVCG.2019.2934312,23,33,J,"We propose InSituNet, a deep learning based surrogate model to support parameter space exploration for ensemble simulations that are visualized in situ. In situ visualization, generating visualizations at simulation time, is becoming prevalent in handling large-scale simulations because of the I/O and storage constraints. However, in situ visualization approaches limit the flexibility of post-hoc exploration because the raw simulation data are no longer available. Although multiple image-based approaches have been proposed to mitigate this limitation, those approaches lack the ability to explore the simulation parameters. Our approach allows flexible exploration of parameter space for large-scale ensemble simulations by taking advantage of the recent advances in deep learning. Specifically, we design InSituNet as a convolutional regression model to learn the mapping from the simulation and visualization parameters to the visualization results. With the trained model, users can generate new images for different simulation parameters under various visualization settings, which enables in-depth analysis of the underlying ensemble simulations. We demonstrate the effectiveness of InSituNet in combustion, cosmology, and ocean simulations through quantitative and qualitative evaluations.",Wenbin He;Junpeng Wang;Hanqi Guo 0001;Ko-Chih Wang;Han-Wei Shen;Mukund Raj;Youssef S. G. Nashed;Tom Peterka,Wenbin He;Junpeng Wang;Hanqi Guo;Ko-Chih Wang;Han-Wei Shen;Mukund Raj;Youssef S. G. Nashed;Tom Peterka,Department of Computer Science and EngineeringThe Ohio State University;Department of Computer Science and EngineeringThe Ohio State University;Mathematics and Computer Science DivisionArgonne National Laboratory;Department of Computer Science and EngineeringThe Ohio State University;Department of Computer Science and EngineeringThe Ohio State University;Mathematics and Computer Science DivisionArgonne National Laboratory;Mathematics and Computer Science DivisionArgonne National Laboratory;Mathematics and Computer Science DivisionArgonne National Laboratory,"10.1109/TVCG.2016.2598869,10.1109/SciVis.2015.7429487,10.1109/TVCG.2010.190,10.1109/TVCG.2013.147,10.1109/TVCG.2016.2598604,10.1109/TVCG.2009.155,10.1109/TVCG.2018.2865051,10.1109/TVCG.2014.2346755,10.1109/TVCG.2014.2346321,10.1109/VAST.2015.7347635,10.1109/TVCG.2010.215,10.1109/TVCG.2011.248,10.1109/TVCG.2016.2598830,10.1109/TVCG.2018.2865026","In situ visualization,ensemble visualization,parameter space exploration,deep learning,image synthesis",0,4,72,BP
SciVis,2019,LassoNet: Deep Lasso-Selection of 3D Point Clouds,10.1109/TVCG.2019.2934332,http://dx.doi.org/10.1109/TVCG.2019.2934332,195,204,J,"Selection is a fundamental task in exploratory analysis and visualization of 3D point clouds. Prior researches on selection methods were developed mainly based on heuristics such as local point density, thus limiting their applicability in general data. Specific challenges root in the great variabilities implied by point clouds (e.g., dense vs. sparse), viewpoint (e.g., occluded vs. non-occluded), and lasso (e.g., small vs. large). In this work, we introduce LassoNet, a new deep neural network for lasso selection of 3D point clouds, attempting to learn a latent mapping from viewpoint and lasso to point cloud regions. To achieve this, we couple user-target points with viewpoint and lasso information through 3D coordinate transform and naive selection, and improve the method scalability via an intention filtering and farthest point sampling. A hierarchical network is trained using a dataset with over 30K lasso-selection records on two different point cloud data. We conduct a formal user study to compare LassoNet with two state-of-the-art lasso-selection methods. The evaluations confirm that our approach improves the selection effectiveness and efficiency across different combinations of 3D point clouds, viewpoints, and lasso selections. Project Website: https://LassoNet.github.io",Zhutian Chen;Wei Zeng 0004;Zhiguang Yang;Lingyun Yu;Chi-Wing Fu;Huamin Qu,Zhutian Chen;Wei Zeng;Zhiguang Yang;Lingyun Yu;Chi-Wing Fu;Huamin Qu,Hong Kong University of Science and Technology;Shenzhen Institutes of Advanced TechnologyChinese Academy of Sciences;Shenzhen Institutes of Advanced TechnologyChinese Academy of Sciences;University of Groningen;Chinese University of Hong Kong;Hong Kong University of Science and Technology,"10.1109/TVCG.2018.2865138,10.1109/TVCG.2018.2865191,10.1109/TVCG.2016.2599049,10.1109/TVCG.2012.292,10.1109/INFVIS.1996.559216,10.1109/TVCG.2012.217,10.1109/TVCG.2015.2467202","Point Clouds,Lasso Selection,Deep Learning",0,4,43,
SciVis,2019,Multi-Scale Procedural Animations of Microtubule Dynamics Based on Measured Data,10.1109/TVCG.2019.2934612,http://dx.doi.org/10.1109/TVCG.2019.2934612,622,632,J,"Biologists often use computer graphics to visualize structures, which due to physical limitations are not possible to image with a microscope. One example for such structures are microtubules, which are present in every eukaryotic cell. They are part of the cytoskeleton maintaining the shape of the cell and playing a key role in the cell division. In this paper, we propose a scientifically-accurate multi-scale procedural model of microtubule dynamics as a novel application scenario for procedural animation, which can generate visualizations of their overall shape, molecular structure, as well as animations of the dynamic behaviour of their growth and disassembly. The model is spanning from tens of micrometers down to atomic resolution. All the aspects of the model are driven by scientific data. The advantage over a traditional, manual animation approach is that when the underlying data change, for instance due to new evidence, the model can be recreated immediately. The procedural animation concept is presented in its generic form, with several novel extensions, facilitating an easy translation to other domains with emergent multi-scale behavior.",Tobias Klein;Ivan Viola;M. Eduard Gröller;Peter Mindek,Tobias Klein;Ivan Viola;Eduard Gröller;Peter Mindek,TU Wien;KAUST;TU WienVRVis;TU WienNanographics GmbH,"10.1109/TVCG.2017.2744258,10.1109/TVCG.2017.2744518,10.1109/TVCG.2006.115","Procedural modeling,molecular visualization,animation,microtubules",0,0,48,
SciVis,2019,Multi-Scale Topological Analysis of Asymmetric Tensor Fields on Surfaces,10.1109/TVCG.2019.2934314,http://dx.doi.org/10.1109/TVCG.2019.2934314,270,279,J,"Asymmetric tensor fields have found applications in many science and engineering domains, such as fluid dynamics. Recent advances in the visualization and analysis of 2D asymmetric tensor fields focus on pointwise analysis of the tensor field and effective visualization metaphors such as colors, glyphs, and hyperstreamlines. In this paper, we provide a novel multi-scale topological analysis framework for asymmetric tensor fields on surfaces. Our multi-scale framework is based on the notions of eigenvalue and eigenvector graphs. At the core of our framework are the identification of atomic operations that modify the graphs and the scale definition that guides the order in which the graphs are simplified to enable clarity and focus for the visualization of topological analysis on data of different sizes. We also provide efficient algorithms to realize these operations. Furthermore, we provide physical interpretation of these graphs. To demonstrate the utility of our system, we apply our multi-scale analysis to data in computational fluid dynamics.",Fariba Khan;Lawrence Roy;Eugene Zhang;Botong Qu;Shih-Hsuan Hung;Harry Yeh;Robert S. Laramee;Yue Zhang 0009,Fariba Khan;Lawrence Roy;Eugene Zhang;Botong Qu;Shih-Hsuan Hung;Harry Yeh;Robert S. Laramee;Yue Zhang,Oregon State University;Oregon State University;Oregon State University;Oregon State University;Oregon State University;Oregon State University;Swansea University;Oregon State University,"10.1109/VISUAL.1994.346326,10.1109/VISUAL.1998.745312,10.1109/TVCG.2016.2598998,10.1109/TVCG.2009.126,10.1109/VISUAL.2005.1532850,10.1109/VISUAL.2004.59,10.1109/VISUAL.2004.59,10.1109/TVCG.2011.170,10.1109/TVCG.2010.199,10.1109/VISUAL.2001.964507,10.1109/VISUAL.2000.885716,10.1109/VISUAL.2002.1183784,10.1109/VISUAL.2005.1532770","Tensor field visualization,tensor field topology,2D asymmetric tensor fields,2D asymmetric tensor field topology,eigenvalue graphs,eigenvector graphs",0,1,37,
SciVis,2019,Multiscale Visual Drilldown for the Analysis of Large Ensembles of Multi-Body Protein Complexes,10.1109/TVCG.2019.2934333,http://dx.doi.org/10.1109/TVCG.2019.2934333,843,852,J,"When studying multi-body protein complexes, biochemists use computational tools that can suggest hundreds or thousands of their possible spatial configurations. However, it is not feasible to experimentally verify more than only a very small subset of them. In this paper, we propose a novel multiscale visual drilldown approach that was designed in tight collaboration with proteomic experts, enabling a systematic exploration of the configuration space. Our approach takes advantage of the hierarchical structure of the data – from the whole ensemble of protein complex configurations to the individual configurations, their contact interfaces, and the interacting amino acids. Our new solution is based on interactively linked 2D and 3D views for individual hierarchy levels. At each level, we offer a set of selection and filtering operations that enable the user to narrow down the number of configurations that need to be manually scrutinized. Furthermore, we offer a dedicated filter interface, which provides the users with an overview of the applied filtering operations and enables them to examine their impact on the explored ensemble. This way, we maintain the history of the exploration process and thus enable the user to return to an earlier point of the exploration. We demonstrate the effectiveness of our approach on two case studies conducted by collaborating proteomic experts.",Katarína Furmanová;Adam Jurcík;Barbora Kozlíková;Helwig Hauser;Jan Byska,Katarína Furmanová;Adam Jurčík;Barbora Kozlíková;Helwig Hauser;Jan Byška,Masaryk University;Masaryk University;Masaryk University;Univ. of Bergen;Masaryk University,10.1109/VAST.2015.7347635,"Molecular visualization,data filtering,coordinated and multiple views",0,0,33,
SciVis,2019,OpenSpace: A System for Astrographics,10.1109/TVCG.2019.2934259,http://dx.doi.org/10.1109/TVCG.2019.2934259,633,642,J,"Human knowledge about the cosmos is rapidly increasing as instruments and simulations are generating new data supporting the formation of theory and understanding of the vastness and complexity of the universe. OpenSpace is a software system that takes on the mission of providing an integrated view of all these sources of data and supports interactive exploration of the known universe from the millimeter scale showing instruments on spacecrafts to billions of light years when visualizing the early universe. The ambition is to support research in astronomy and space exploration, science communication at museums and in planetariums as well as bringing exploratory astrographics to the class room. There is a multitude of challenges that need to be met in reaching this goal such as the data variety, multiple spatio-temporal scales, collaboration capabilities, etc. Furthermore, the system has to be flexible and modular to enable rapid prototyping and inclusion of new research results or space mission data and thereby shorten the time from discovery to dissemination. To support the different use cases the system has to be hardware agnostic and support a range of platforms and interaction paradigms. In this paper we describe how OpenSpace meets these challenges in an open source effort that is paving the path for the next generation of interactive astrographics.",Alexander Bock;Anders Ynnerman;Emil Axelsson;Jonathas Costa;Gene Payne;Micah Acinapura;Vivian Trakinski;Carter Emmart;Cláudio T. Silva;Charles D. Hansen,Alexander Bock;Emil Axelsson;Jonathas Costa;Gene Payne;Micah Acinapura;Vivian Trakinski;Carter Emmart;Cláudio Silva;Charles Hansen;Anders Ynnerman,Linköping UniversityUniversity of Utah;Linköping University;New York University;University of Utah;American Museum of Natural History;American Museum of Natural History;American Museum of Natural History;New York University;University of Utah;Linköping UniversityUniversity of Utah,"10.1109/TVCG.2017.2743958,10.1109/SciVis.2015.7429503,10.1109/SciVis.2015.7429487,10.1109/TVCG.2018.2864508","Astrographics,astronomy,astrophysics,system",0,2,33,
SciVis,2019,Scale-Space Splatting: Reforming Spacetime for Cross-Scale Exploration of Integral Measures in Molecular Dynamics,10.1109/TVCG.2019.2934258,http://dx.doi.org/10.1109/TVCG.2019.2934258,643,653,J,"Understanding large amounts of spatiotemporal data from particle-based simulations, such as molecular dynamics, often relies on the computation and analysis of aggregate measures. These, however, by virtue of aggregation, hide structural information about the space/time localization of the studied phenomena. This leads to degenerate cases where the measures fail to capture distinct behaviour. In order to drill into these aggregate values, we propose a multi-scale visual exploration technique. Our novel representation, based on partial domain aggregation, enables the construction of a continuous scale-space for discrete datasets and the simultaneous exploration of scales in both space and time. We link these two scale-spaces in a scale-space space-time cube and model linked views as orthogonal slices through this cube, thus enabling the rapid identification of spatio-temporal patterns at multiple scales. To demonstrate the effectiveness of our approach, we showcase an advanced exploration of a protein-ligand simulation.",Juraj Pálenik;Jan Byska;Stefan Bruckner;Helwig Hauser,Juraj Pálenik;Jan Byška;Stefan Bruckner;Helwig Hauser,University of Bergen;University of Bergen;University of Bergen;University of Bergen,"10.1109/INFVIS.2004.11,10.1109/TVCG.2018.2865049,10.1109/TVCG.2015.2467434,10.1109/TVCG.2010.148,10.1109/VISUAL.2003.1250353,10.1109/TVCG.2009.177,10.1109/TVCG.2009.200,10.1109/TVCG.2012.191,10.1109/VISUAL.1993.398859,10.1109/VISUAL.1997.663867,10.1109/TVCG.2018.2864510,10.1109/VISUAL.2003.1250402","Scale space,time-series,scientific simulation,multi-scale analysis,space-time cube,molecular dynamics",0,0,56,
SciVis,2019,Temporal Views of Flattened Mitral Valve Geometries,10.1109/TVCG.2019.2934337,http://dx.doi.org/10.1109/TVCG.2019.2934337,971,980,J,"The mitral valve, one of the four valves in the human heart, controls the bloodflow between the left atrium and ventricle and may suffer from various pathologies. Malfunctioning valves can be treated by reconstructive surgeries, which have to be carefully planned and evaluated. While current research focuses on the modeling and segmentation of the valve, we base our work on existing segmentations of patient-specific mitral valves, that are also time-resolved ($3\mathrm{D}+\mathrm{t}$) over the cardiac cycle. The interpretation of the data can be ambiguous, due to the complex surface of the valve and multiple time steps. We therefore propose a software prototype to analyze such $3\mathrm{D}+\mathrm{t}$ data, by extracting pathophysiological parameters and presenting them via dimensionally reduced visualizations. For this, we rely on an existing algorithm to unroll the convoluted valve surface towards a flattened 2D representation. In this paper, we show that the $3\mathrm{D}+\mathrm{t}$ data can be transferred to 3D or 2D representations in a way that allows the domain expert to faithfully grasp important aspects of the cardiac cycle. In this course, we not only consider common pathophysiological parameters, but also introduce new observations that are derived from landmarks within the segmentation model. Our analysis techniques were developed in collaboration with domain experts and a survey showed that the insights have the potential to support mitral valve diagnosis and the comparison of the pre- and post-operative condition of a patient.",Pepe Eulzer;Sandy Engelhardt;Nils Lichtenberg;Raffaele De Simone;Kai Lawonn,Pepe Eulzer;Sandy Engelhardt;Nils Lichtenberg;Raffaele de Simone;Kai Lawonn,"University of Koblenz-Landau, Germany;Mannheim University of Applied Sciences, Germany;University of Koblenz-Landau, Germany;Heidelberg University Hospital, Germany;University of Koblenz-Landau, Germany","10.1109/TVCG.2011.235,10.1109/VISUAL.2001.964540,10.1109/TVCG.2014.2346459,10.1109/TVCG.2013.139,10.1109/TVCG.2006.112,10.1109/TVCG.2018.2864509,10.1109/TVCG.2016.2598795,10.1109/TVCG.2010.200","Mitral valve,quantification,medical visualization,parameterization,spatio-temporal visualization",0,1,43,
SciVis,2019,The Effect of Data Transformations on Scalar Field Topological Analysis of High-Order FEM Solutions,10.1109/TVCG.2019.2934338,http://dx.doi.org/10.1109/TVCG.2019.2934338,162,172,J,"High-order finite element methods (HO-FEM) are gaining popularity in the simulation community due to their success in solving complex flow dynamics. There is an increasing need to analyze the data produced as output by these simulations. Simultaneously, topological analysis tools are emerging as powerful methods for investigating simulation data. However, most of the current approaches to topological analysis have had limited application to HO-FEM simulation data for two reasons. First, the current topological tools are designed for linear data (polynomial degree one), but the polynomial degree of the data output by these simulations is typically higher (routinely up to polynomial degree six). Second, the simulation data and derived quantities of the simulation data have discontinuities at element boundaries, and these discontinuities do not match the input requirements for the topological tools. One solution to both issues is to transform the high-order data to achieve low-order, continuous inputs for topological analysis. Nevertheless, there has been little work evaluating the possible transformation choices and their downstream effect on the topological analysis. We perform an empirical study to evaluate two commonly used data transformation methodologies along with the recently introduced L-SIAC filter for processing high-order simulation data. Our results show diverse behaviors are possible. We offer some guidance about how best to consider a pipeline of topological analysis of HO-FEM simulations with the currently available implementations of topological analysis.",Ashok Jallepalli;Joshua A. Levine;Robert Michael Kirby,Ashok Jallepalli;Joshua A. Levine;Robert M. Kirby,SCI InstituteUniversity of Utah;Department of Computer ScienceUniversity of Arizona;SCI InstituteUniversity of Utah,"10.1109/TVCG.2014.2346403,10.1109/TVCG.2008.110,10.1109/TVCG.2015.2467432,10.1109/TVCG.2007.70603,10.1109/TVCG.2017.2744058,10.1109/TVCG.2011.249,10.1109/TVCG.2006.186,10.1109/TVCG.2014.2346332,10.1109/TVCG.2017.2743938,10.1109/TVCG.2009.163,10.1109/TVCG.2012.228,10.1109/VISUAL.2004.113","High-Order Finite Element Methods,Filtering Techniques,Scalar Field Visualization,Topological Analysis",0,0,74,
SciVis,2019,Toward Localized Topological Data Structures: Querying the Forest for the Tree,10.1109/TVCG.2019.2934257,http://dx.doi.org/10.1109/TVCG.2019.2934257,173,183,J,"Topological approaches to data analysis can answer complex questions about the number, connectivity, and scale of intrinsic features in scalar data. However, the global nature of many topological structures makes their computation challenging at scale, and thus often limits the size of data that can be processed. One key quality to achieving scalability and performance on modern architectures is data locality, i.e., a process operates on data that resides in a nearby memory system, avoiding frequent jumps in data access patterns. From this perspective, topological computations are particularly challenging because the implied data structures represent features that can span the entire data set, often requiring a global traversal phase that limits their scalability. Traditionally, expensive preprocessing is considered an acceptable trade-off as it accelerates all subsequent queries. Most published use cases, however, explore only a fraction of all possible queries, most often those returning small, local features. In these cases, much of the global information is not utilized, yet computing it dominates the overall response time. We address this challenge for merge trees, one of the most commonly used topological structures. In particular, we propose an alternative representation, the merge forest, a collection of local trees corresponding to regions in a domain decomposition. Local trees are connected by a bridge set that allows us to recover any necessary global information at query time. The resulting system couples (i) a preprocessing that scales linearly in practice with (ii) fast runtime queries that provide the same functionality as traditional queries of a global merge tree. We test the scalability of our approach on a shared-memory parallel computer and demonstrate how data structure locality enables the analysis of large data with an order of magnitude performance improvement over the status quo. Furthermore, a merge forest reduces the memory overhead compared to a global merge tree and enables the processing of data sets that are an order of magnitude larger than possible with previous algorithms.",Pavol Klacansky;Attila Gyulassy;Peer-Timo Bremer;Valerio Pascucci,Pavol Klacansky;Attila Gyulassy;Peer-Timo Bremer;Valerio Pascucci,Scientific Computing and Imaging InstituteUniversity of Utah;Scientific Computing and Imaging InstituteUniversity of Utah;Lawrence Livermore National Laboratory;Scientific Computing and Imaging InstituteUniversity of Utah,"10.1109/TVCG.2017.2744238,10.1109/TVCG.2017.2743938,10.1109/TVCG.2006.162","Merge tree,parallel computation,topology",0,1,49,HM
SciVis,2019,TSR-TVD: Temporal Super-Resolution for Time-Varying Data Analysis and Visualization,10.1109/TVCG.2019.2934255,http://dx.doi.org/10.1109/TVCG.2019.2934255,205,215,J,"We present TSR-TVD, a novel deep learning framework that generates temporal super-resolution (TSR) of time-varying data (TVD) using adversarial learning. TSR-TVD is the first work that applies the recurrent generative network (RGN), a combination of the recurrent neural network (RNN) and generative adversarial network (GAN), to generate temporal high-resolution volume sequences from low-resolution ones. The design of TSR-TVD includes a generator and a discriminator. The generator takes a pair of volumes as input and outputs the synthesized intermediate volume sequence through forward and backward predictions. The discriminator takes the synthesized intermediate volumes as input and produces a score indicating the realness of the volumes. Our method handles multivariate data as well where the trained network from one variable is applied to generate TSR for another variable. To demonstrate the effectiveness of TSR-TVD, we show quantitative and qualitative results with several time-varying multivariate data sets and compare our method against standard linear interpolation and solutions solely based on RNN or CNN.",Jun Han;Chaoli Wang 0001,Jun Han;Chaoli Wang,"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN","10.1109/TVCG.2013.133,10.1109/TVCG.2008.184,10.1109/VISUAL.2005.1532857,10.1109/TVCG.2015.2467431,10.1109/TVCG.2006.165,10.1109/VISUAL.1999.809910,10.1109/VISUAL.2005.1532792,10.1109/TVCG.2018.2864808,10.1109/VISUAL.2003.1250413,10.1109/TVCG.2008.140,10.1109/VISUAL.2003.1250402","Time-varying data visualization,super-resolution,deep learning,recurrent generative network",0,5,62,
SciVis,2019,Vector Field Topology of Time-Dependent Flows in a Steady Reference Frame,10.1109/TVCG.2019.2934375,http://dx.doi.org/10.1109/TVCG.2019.2934375,280,290,J,"The topological analysis of unsteady vector fields remains to this day one of the largest challenges in flow visualization. We build up on recent work on vortex extraction to define a time-dependent vector field topology for 2D and 3D flows. In our work, we split the vector field into two components: a vector field in which the flow becomes steady, and the remaining ambient flow that describes the motion of topological elements (such as sinks, sources and saddles) and feature curves (vortex corelines and bifurcation lines). To this end, we expand on recent local optimization approaches by modeling spatially-varying deformations through displacement transformations from continuum mechanics. We compare and discuss the relationships with existing local and integration-based topology extraction methods, showing for instance that separatrices seeded from saddles in the optimal frame align with the integration-based streakline vector field topology. In contrast to the streakline-based approach, our method gives a complete picture of the topology for every time slice, including the steps near the temporal domain boundaries. With our work it now becomes possible to extract topological information even when only few time slices are available. We demonstrate the method in several analytical and numerically-simulated flows and discuss practical aspects, limitations and opportunities for future work.",Irene Baeza Rojo;Tobias Günther,Irene Baeza Rojo;Tobias Günther,Computer Graphics LaboratoryETH Zürich;Computer Graphics LaboratoryETH Zürich,"10.1109/VISUAL.1999.809907,10.1109/VISUAL.1991.175773,10.1109/TVCG.2015.2467200,10.1109/TVCG.2018.2864828,10.1109/TVCG.2018.2864839,10.1109/VISUAL.1999.809896,10.1109/VISUAL.1998.745296,10.1109/VISUAL.2005.1532851,10.1109/VISUAL.2004.99,10.1109/VISUAL.2000.885716,10.1109/TVCG.2007.70545,10.1109/TVCG.2007.70557","Scientific visualization,unsteady flow,vector field topology,reference frame optimization",0,2,64,
SciVis,2019,Void-and-Cluster Sampling of Large Scattered Data and Trajectories,10.1109/TVCG.2019.2934335,http://dx.doi.org/10.1109/TVCG.2019.2934335,780,789,J,"We propose a data reduction technique for scattered data based on statistical sampling. Our void-and-cluster sampling technique finds a representative subset that is optimally distributed in the spatial domain with respect to the blue noise property. In addition, it can adapt to a given density function, which we use to sample regions of high complexity in the multivariate value domain more densely. Moreover, our sampling technique implicitly defines an ordering on the samples that enables progressive data loading and a continuous level-of-detail representation. We extend our technique to sample time-dependent trajectories, for example pathlines in a time interval, using an efficient and iterative approach. Furthermore, we introduce a local and continuous error measure to quantify how well a set of samples represents the original dataset. We apply this error measure during sampling to guide the number of samples that are taken. Finally, we use this error measure and other quantities to evaluate the quality, performance, and scalability of our algorithm.",Tobias Rapp;Christoph Peters 0002;Carsten Dachsbacher,Tobias Rapp;Christoph Peters;Carsten Dachsbacher,Karlsruhe Institute of Technology;Karlsruhe Institute of Technology;Karlsruhe Institute of Technology,"10.1109/TVCG.2016.2598604,10.1109/TVCG.2010.148,10.1109/TVCG.2018.2864801,10.1109/TVCG.2014.2346324","Data reduction,sampling,blue noise,entropy-based sampling,scattered data,pathlines",0,3,28,
VAST,2019,A Natural-language-based Visual Query Approach of Uncertain Human Trajectories,10.1109/TVCG.2019.2934671,http://dx.doi.org/10.1109/TVCG.2019.2934671,1256,1266,J,"Visual querying is essential for interactively exploring massive trajectory data. However, the data uncertainty imposes profound challenges to fulfill advanced analytics requirements. On the one hand, many underlying data does not contain accurate geographic coordinates, e.g., positions of a mobile phone only refer to the regions (i.e., mobile cell stations) in which it resides, instead of accurate GPS coordinates. On the other hand, domain experts and general users prefer a natural way, such as using a natural language sentence, to access and analyze massive movement data. In this paper, we propose a visual analytics approach that can extract spatial-temporal constraints from a textual sentence and support an effective query method over uncertain mobile trajectory data. It is built up on encoding massive, spatially uncertain trajectories by the semantic information of the POls and regions covered by them, and then storing the trajectory documents in text database with an effective indexing scheme. The visual interface facilitates query condition specification, situation-aware visualization, and semantic exploration of large trajectory data. Usage scenarios on real-world human mobility datasets demonstrate the effectiveness of our approach.",Zhaosong Huang;Ye Zhao;Wei Chen 0001;Shengjie Gao;Kejie Yu;Weixia Xu;MingJie Tang;Minfeng Zhu;Mingliang Xu,Zhaosong Huang;Ye Zhao;Wei Chen;Shengjie Gao;Kejie Yu;Weixia Xu;Mingjie Tang;Minfeng Zhu;Mingliang Xu,"The State Key Lab of CAD & CG, Zhejiang University, China;Department of Computer Science, Kent State University, Kent, OH, USA;The State Key Lab of CAD & CG, Zhejiang University, China;The State Key Lab of CAD & CG, Zhejiang University, China;The State Key Lab of CAD & CG, Zhejiang University, China;The State Key Lab of CAD & CG, Zhejiang University, China;Ant Financial, USA;The State Key Lab of CAD & CG, Zhejiang University, China;School of Information Engineering, Zhengzhou University, Zhengzhou, China","10.1109/TVCG.2016.2598416,10.1109/VAST.2008.4677356,10.1109/TVCG.2018.2864811,10.1109/TVCG.2018.2865049,10.1109/TVCG.2015.2467619,10.1109/TVCG.2011.233,10.1109/TVCG.2013.226,10.1109/TVCG.2017.2745320,10.1109/TVCG.2013.179,10.1109/TVCG.2016.2598432,10.1109/VAST.2011.6102455,10.1109/TVCG.2018.2865042,10.1109/TVCG.2017.2744159,10.1109/VAST.2014.7042486,10.1109/TVCG.2008.172,10.1109/TVCG.2016.2598885,10.1109/TVCG.2018.2864503","Natural-language-based Visual Query,Spatial Uncertaity,Trajectory Exploration",0,0,80,
VAST,2019,"Ablate, Variate, and Contemplate: Visual Analytics for Discovering Neural Architectures",10.1109/TVCG.2019.2934261,http://dx.doi.org/10.1109/TVCG.2019.2934261,863,873,J,"The performance of deep learning models is dependent on the precise configuration of many layers and parameters. However, there are currently few systematic guidelines for how to configure a successful model. This means model builders often have to experiment with different configurations by manually programming different architectures (which is tedious and time consuming) or rely on purely automated approaches to generate and train the architectures (which is expensive). In this paper, we present Rapid Exploration of Model Architectures and Parameters, or REMAP, a visual analytics tool that allows a model builder to discover a deep learning model quickly via exploration and rapid experimentation of neural network architectures. In REMAP, the user explores the large and complex parameter space for neural network architectures using a combination of global inspection and local experimentation. Through a visual overview of a set of models, the user identifies interesting clusters of architectures. Based on their findings, the user can run ablation and variation experiments to identify the effects of adding, removing, or replacing layers in a given architecture and generate new models accordingly. They can also handcraft new models using a simple graphical interface. As a result, a model builder can build deep learning models quickly, efficiently, and without manual programming. We inform the design of REMAP through a design study with four deep learning model builders. Through a use case, we demonstrate that REMAP allows users to discover performant neural network architectures efficiently using visual exploration and user-defined semi-automated searches through the model space.",Dylan Cashman;Adam Perer;Remco Chang;Hendrik Strobelt,Dylan Cashman;Adam Perer;Remco Chang;Hendrik Strobelt,"Tufts University, USA;Carnegie Mellon University, USA;Tufts University, USA;MIT IBM Watson AI Lab, USA","10.1109/VAST.2012.6400490,10.1109/TVCG.2018.2864477,10.1109/VAST.2010.5652443,10.1109/TVCG.2017.2744199,10.1109/TVCG.2017.2744718,10.1109/TVCG.2017.2745085,10.1109/TVCG.2017.2744938,10.1109/TVCG.2016.2598831,10.1109/TVCG.2017.2745158,10.1109/TVCG.2013.125,10.1109/VAST.2007.4388999,10.1109/TVCG.2017.2744358,10.1109/TVCG.2017.2744805,10.1109/TVCG.2014.2346321,10.1109/TVCG.2018.2865044,10.1109/TVCG.2017.2744158,10.1109/VISUAL.2005.1532820,10.1109/VAST.2011.6102453,10.1109/TVCG.2018.2864504,10.1109/TVCG.2017.2744878,10.1109/TVCG.2018.2864499","visual analytics,neural networks,parameter space exploration",0,1,73,
VAST,2019,AirVis: Visual Analytics of Air Pollution Propagation,10.1109/TVCG.2019.2934670,http://dx.doi.org/10.1109/TVCG.2019.2934670,800,810,J,"Air pollution has become a serious public health problem for many cities around the world. To find the causes of air pollution, the propagation processes of air pollutants must be studied at a large spatial scale. However, the complex and dynamic wind fields lead to highly uncertain pollutant transportation. The state-of-the-art data mining approaches cannot fully support the extensive analysis of such uncertain spatiotemporal propagation processes across multiple districts without the integration of domain knowledge. The limitation of these automated approaches motivates us to design and develop AirVis, a novel visual analytics system that assists domain experts in efficiently capturing and interpreting the uncertain propagation patterns of air pollution based on graph visualizations. Designing such a system poses three challenges: a) the extraction of propagation patterns; b) the scalability of pattern presentations; and c) the analysis of propagation processes. To address these challenges, we develop a novel pattern mining framework to model pollutant transportation and extract frequent propagation patterns efficiently from large-scale atmospheric data. Furthermore, we organize the extracted patterns hierarchically based on the minimum description length (MDL) principle and empower expert users to explore and analyze these patterns effectively on the basis of pattern topologies. We demonstrated the effectiveness of our approach through two case studies conducted with a real-world dataset and positive feedback from domain experts.",Zikun Deng;Di Weng;Jiahui Chen;Ren Liu;Zhibin Wang;Jie Bao 0003;Yu Zheng 0004;Yingcai Wu,Zikun Deng;Di Weng;Jiahui Chen;Ren Liu;Zhibin Wang;Jie Bao;Yu Zheng;Yingcai Wu,"State Key Lab of CAD & CGZhejiang University;State Key Lab of CAD & CGZhejiang University;State Key Lab of CAD & CGZhejiang University;State Key Lab of CAD & CGZhejiang University;Research Center for Air Pollution and HealthZhejiang University;JD Intelligent City Research, Beijing, China;JD Intelligent City Research, Beijing, China;State Key Lab of CAD & CGZhejiang University","10.1109/TVCG.2013.193,10.1109/TVCG.2011.202,10.1109/TVCG.2018.2864826,10.1109/TVCG.2015.2467619,10.1109/TVCG.2017.2745083,10.1109/TVCG.2013.226,10.1109/TVCG.2014.2346271,10.1109/TVCG.2016.2598432,10.1109/TVCG.2018.2865149,10.1109/TVCG.2007.70523,10.1109/TVCG.2011.181,10.1109/TVCG.2016.2598919,10.1109/TVCG.2012.213,10.1109/TVCG.2012.265,10.1109/TVCG.2015.2468111,10.1109/TVCG.2018.2865126,10.1109/TVCG.2015.2467194,10.1109/TVCG.2018.2865041,10.1109/TVCG.2016.2598885,10.1109/TVCG.2018.2864503","Air pollution propagation,pattern mining,graph visualization",0,6,82,
VAST,2019,CloudDet: Interactive Visual Analysis of Anomalous Performances in Cloud Computing Systems,10.1109/TVCG.2019.2934613,http://dx.doi.org/10.1109/TVCG.2019.2934613,1107,1117,J,"Detecting and analyzing potential anomalous performances in cloud computing systems is essential for avoiding losses to customers and ensuring the efficient operation of the systems. To this end, a variety of automated techniques have been developed to identify anomalies in cloud computing. These techniques are usually adopted to track the performance metrics of the system (e.g., CPU, memory, and disk I/O), represented by a multivariate time series. However, given the complex characteristics of cloud computing data, the effectiveness of these automated methods is affected. Thus, substantial human judgment on the automated analysis results is required for anomaly interpretation. In this paper, we present a unified visual analytics system named CloudDet to interactively detect, inspect, and diagnose anomalies in cloud computing systems. A novel unsupervised anomaly detection algorithm is developed to identify anomalies based on the specific temporal patterns of the given metrics data (e.g., the periodic pattern). Rich visualization and interaction designs are used to help understand the anomalies in the spatial and temporal context. We demonstrate the effectiveness of CloudDet through a quantitative evaluation, two case studies with real-world data, and interviews with domain experts.",Ke Xu;Yun Wang 0012;Leni Yang;Yifang Wang 0001;Bo Qiao;Si Qin;Yong Xu;Haidong Zhang;Huamin Qu,Ke Xu;Yun Wang;Leni Yang;Yifang Wang;Bo Qiao;Si Qin;Yong Xu;Haidong Zhang;Huamin Qu,Hong Kong University of Science and Technology;Microsoft Research;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Microsoft Research;Microsoft Research;Microsoft Research;Microsoft Research;Hong Kong University of Science and Technology,"10.1109/TVCG.2008.166,10.1109/TVCG.2017.2744419,10.1109/TVCG.2015.2467196,10.1109/INFVIS.2005.1532144,10.1109/TVCG.2018.2865026","Cloud computing,anomaly detection,multidimensional data,performance visualization,visual analytics",0,0,64,
VAST,2019,CourtTime: Generating Actionable Insights into Tennis Matches Using Visual Analytics,10.1109/TVCG.2019.2934243,http://dx.doi.org/10.1109/TVCG.2019.2934243,397,406,J,"Tennis players and coaches of all proficiency levels seek to understand and improve their play. Summary statistics alone are inadequate to provide the insights players need to improve their games. Spatio-temporal data capturing player and ball movements is likely to provide the actionable insights needed to identify player strengths, weaknesses, and strategies. To fully utilize this spatio-temporal data, we need to integrate it with domain-relevant context meta-data. In this paper, we propose CourtTime, a novel approach to perform data-driven visual analysis of individual tennis matches. Our visual approach introduces a novel visual metaphor, namely 1–D Space-Time Charts that enable the analysis of single points at a glance based on small multiples. We also employ user-driven sorting and clustering techniques and a layout technique that aligns the last few shots in a point to facilitate shot pattern discovery. We discuss the usefulness of CourtTime via an extensive case study and report on feedback from an amateur tennis player and three tennis coaches.",Tom Polk;Dominik Jäckle;Johannes Häussler;Jing Yang,Tom Polk;Dominik Jäckle;Johannes Häußler;Jing Yang,University of Konstanz;University of Konstanz;University of Konstanz;University of North Carolina,"10.1109/VAST.2014.7042478,10.1109/INFVIS.1996.559229,10.1109/VISUAL.2001.964496,10.1109/TVCG.2017.2744218","Visual analytics,tennis analysis,sports analytics,spatio-temporal analysis",0,3,40,
VAST,2019,"Do What I Mean, Not What I Say! Design Considerations for Supporting Intent and Context in Analytical Conversation",10.1109/VAST47406.2019.8986918,http://dx.doi.org/10.1109/VAST47406.2019.8986918,93,103,C,"Natural language can be a useful modality for creating and interacting with visualizations but users often have unrealistic expectations about the intelligence of natural language systems. The gulf between user expectations and system capabilities may lead to a disappointing user experience. So - if we want to engineer a natural language system, what are the requirements around system intelligence? This work takes a retrospective look at how we answered this question in the design of Ask Data, a natural language interaction feature for Tableau. We examine two factors contributing to perceived system intelligence: the system's ability to understand the analytic intent behind an input utterance and the ability to interpret an utterance contextually (i.e. taking into account the current visualization state and recent actions). Our aim was to understand the ways in which a system would need to support these two aspects of intelligence to enable a positive user experience. We first describe a pre-design Wizard of Oz study that offered insight into this question and narrowed the space of designs under consideration. We then reflect on the impact of this study on system development, examining how design implications from the study played out in practice. Our work contributes insights for the design of natural language interaction in visual analytics as well as a reflection on the value of pre-design empirical studies in the development of visual analytic systems.",Melanie Tory;Vidya Setlur,Melanie Tory;Vidya Setlur,"Tableau Software,Palo Alto,California,USA;Tableau Software,Palo Alto,California,USA","10.1109/INFVIS.2000.885092,10.1109/VAST.2015.7347625,10.1109/TVCG.2017.2744684,10.1109/TVCG.2007.70594,10.1109/TVCG.2018.2865240,10.1109/TVCG.2017.2745219,10.1109/TVCG.2015.2467191","Visualization,Empirical studies in visualization,Human-centered computing,Interaction paradigms,Natural language interfaces",0,3,59,
VAST,2019,EmoCo: Visual Analysis of Emotion Coherence in Presentation Videos,10.1109/TVCG.2019.2934656,http://dx.doi.org/10.1109/TVCG.2019.2934656,927,937,J,"Emotions play a key role in human communication and public presentations. Human emotions are usually expressed through multiple modalities. Therefore, exploring multimodal emotions and their coherence is of great value for understanding emotional expressions in presentations and improving presentation skills. However, manually watching and studying presentation videos is often tedious and time-consuming. There is a lack of tool support to help conduct an efficient and in-depth multi-level analysis. Thus, in this paper, we introduce EmoCo, an interactive visual analytics system to facilitate efficient analysis of emotion coherence across facial, text, and audio modalities in presentation videos. Our visualization system features a channel coherence view and a sentence clustering view that together enable users to obtain a quick overview of emotion coherence and its temporal evolution. In addition, a detail view and word view enable detailed exploration and comparison from the sentence level and word level, respectively. We thoroughly evaluate the proposed system and visualization techniques through two usage scenarios based on TED Talk videos and interviews with two domain experts. The results demonstrate the effectiveness of our system in gaining insights into emotion coherence in presentations.",Haipeng Zeng;Xingbo Wang;Aoyu Wu;Yong Wang 0021;Quan Li;Alex Endert;Huamin Qu,Haipeng Zeng;Xingbo Wang;Aoyu Wu;Yong Wang;Quan Li;Alex Endert;Huamin Qu,"Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;WeBank, AI Group, China;Georgia Institute of Technology;Hong Kong University of Science and Technology","10.1109/TVCG.2015.2467851,10.1109/VAST.2006.261431,10.1109/TVCG.2013.168,10.1109/VAST.2009.5333919,10.1109/TVCG.2017.2745181,10.1109/TVCG.2010.183,10.1109/VAST.2014.7042496","Emotion,coherence,video analysis,visual analysis",0,0,51,
VAST,2019,Evaluating Perceptual Bias During Geometric Scaling of Scatterplots,10.1109/TVCG.2019.2934208,http://dx.doi.org/10.1109/TVCG.2019.2934208,321,331,J,"Scatterplots are frequently scaled to fit display areas in multi-view and multi-device data analysis environments. A common method used for scaling is to enlarge or shrink the entire scatterplot together with the inside points synchronously and proportionally. This process is called geometric scaling. However, geometric scaling of scatterplots may cause a perceptual bias, that is, the perceived and physical values of visual features may be dissociated with respect to geometric scaling. For example, if a scatterplot is projected from a laptop to a large projector screen, then observers may feel that the scatterplot shown on the projector has fewer points than that viewed on the laptop. This paper presents an evaluation study on the perceptual bias of visual features in scatterplots caused by geometric scaling. The study focuses on three fundamental visual features (i.e., numerosity, correlation, and cluster separation) and three hypotheses that are formulated on the basis of our experience. We carefully design three controlled experiments by using well-prepared synthetic data and recruit participants to complete the experiments on the basis of their subjective experience. With a detailed analysis of the experimental results, we obtain a set of instructive findings. First, geometric scaling causes a bias that has a linear relationship with the scale ratio. Second, no significant difference exists between the biases measured from normally and uniformly distributed scatterplots. Third, changing the point radius can correct the bias to a certain extent. These findings can be used to inspire the design decisions of scatterplots in various scenarios.",Yating Wei;Honghui Mei;Ying Zhao 0001;Shuyue Zhou;Bingru Lin;Haojing Jiang;Wei Chen 0001,Yating Wei;Honghui Mei;Ying Zhao;Shuyue Zhou;Bingru Lin;Haojing Jiang;Wei Chen,"The State Key Lab of CAD & CG, Zhejiang University, Hangzhou, Zhejiang, China;The State Key Lab of CAD & CG, Zhejiang University, Hangzhou, Zhejiang, China;School of Computer Science and Engineering, Central South University, Changsha, Hunan, China;The State Key Lab of CAD & CG, Zhejiang University, Hangzhou, Zhejiang, China;The State Key Lab of CAD & CG, Zhejiang University, Hangzhou, Zhejiang, China;School of Computer Science and Engineering, Central South University, Changsha, Hunan, China;The State Key Lab of CAD & CG, Zhejiang University, Hangzhou, Zhejiang, China","10.1109/TVCG.2011.229,10.1109/TVCG.2018.2865142,10.1109/TVCG.2015.2467732,10.1109/TVCG.2013.124,10.1109/VAST.2010.5652460,10.1109/TVCG.2014.2346594,10.1109/TVCG.2013.183,10.1109/TVCG.2014.2346979,10.1109/TVCG.2006.163,10.1109/VAST.2012.6400487,10.1109/TVCG.2015.2467671,10.1109/TVCG.2018.2864884,10.1109/INFVIS.2004.15,10.1109/TVCG.2017.2744184,10.1109/TVCG.2013.120,10.1109/TVCG.2013.153,10.1109/TVCG.2017.2744359,10.1109/VAST.2009.5332628,10.1109/TVCG.2007.70596,10.1109/TVCG.2017.2744138,10.1109/TVCG.2018.2864912,10.1109/TVCG.2018.2865266,10.1109/TVCG.2017.2744098,10.1109/TVCG.2006.184,10.1109/TVCG.2018.2865020,10.1109/TVCG.2018.2864503","Evaluation,scatterplot,geometric scaling,bias,perceptual consistency",0,5,87,
VAST,2019,Explaining Vulnerabilities to Adversarial Machine Learning through Visual Analytics,10.1109/TVCG.2019.2934631,http://dx.doi.org/10.1109/TVCG.2019.2934631,1075,1085,J,"Machine learning models are currently being deployed in a variety of real-world applications where model predictions are used to make decisions about healthcare, bank loans, and numerous other critical tasks. As the deployment of artificial intelligence technologies becomes ubiquitous, it is unsurprising that adversaries have begun developing methods to manipulate machine learning models to their advantage. While the visual analytics community has developed methods for opening the black box of machine learning models, little work has focused on helping the user understand their model vulnerabilities in the context of adversarial attacks. In this paper, we present a visual analytics framework for explaining and exploring model vulnerabilities to adversarial attacks. Our framework employs a multi-faceted visualization scheme designed to support the analysis of data poisoning attacks from the perspective of models, data instances, features, and local structures. We demonstrate our framework through two case studies on binary classifiers and illustrate model vulnerabilities with respect to varying attack strategies.",Yuxin Ma;Tiankai Xie;Jundong Li;Ross Maciejewski,Yuxin Ma;Tiankai Xie;Jundong Li;Ross Maciejewski,"School of Computing, Informatics & Decision Systems EngineeringArizona State University;School of Computing, Informatics & Decision Systems EngineeringArizona State University;Department of Electrical and Computer EngineeringUniversity of Virginia;School of Computing, Informatics & Decision Systems EngineeringArizona State University","10.1109/TVCG.2014.2346660,10.1109/TVCG.2014.2346594,10.1109/TVCG.2017.2744718,10.1109/TVCG.2018.2864500,10.1109/VAST.2017.8585720,10.1109/TVCG.2014.2346482,10.1109/TVCG.2018.2865027,10.1109/VAST.2018.8802509,10.1109/TVCG.2017.2744938,10.1109/TVCG.2017.2744378,10.1109/VAST.2017.8585721,10.1109/TVCG.2018.2864812,10.1109/TVCG.2014.2346578,10.1109/TVCG.2016.2598838,10.1109/TVCG.2016.2598828,10.1109/TVCG.2014.2346574,10.1109/TVCG.2018.2865044,10.1109/TVCG.2017.2744158,10.1109/VAST.2011.6102453,10.1109/TVCG.2018.2864504,10.1109/TVCG.2017.2744878,10.1109/TVCG.2018.2864499,10.1109/TVCG.2018.2864475","Adversarial machine learning,data poisoning,visual analytics",0,5,70,
VAST,2019,Facetto: Combining Unsupervised and Supervised Learning for Hierarchical Phenotype Analysis in Multi-Channel Image Data,10.1109/TVCG.2019.2934547,http://dx.doi.org/10.1109/TVCG.2019.2934547,227,237,J,"Facetto is a scalable visual analytics application that is used to discover single-cell phenotypes in high-dimensional multi-channel microscopy images of human tumors and tissues. Such images represent the cutting edge of digital histology and promise to revolutionize how diseases such as cancer are studied, diagnosed, and treated. Highly multiplexed tissue images are complex, comprising 109 or more pixels, 60-plus channels, and millions of individual cells. This makes manual analysis challenging and error-prone. Existing automated approaches are also inadequate, in large part, because they are unable to effectively exploit the deep knowledge of human tissue biology available to anatomic pathologists. To overcome these challenges, Facetto enables a semi-automated analysis of cell types and states. It integrates unsupervised and supervised learning into the image and feature exploration process and offers tools for analytical provenance. Experts can cluster the data to discover new types of cancer and immune cells and use clustering results to train a convolutional neural network that classifies new cells accordingly. Likewise, the output of classifiers can be clustered to discover aggregate patterns and phenotype subsets. We also introduce a new hierarchical approach to keep track of analysis steps and data subsets created by users; this assists in the identification of cell types. Users can build phenotype trees and interact with the resulting hierarchical structures of both high-dimensional feature and image spaces. We report on use-cases in which domain scientists explore various large-scale fluorescence imaging datasets. We demonstrate how Facetto assists users in steering the clustering and classification process, inspecting analysis results, and gaining new scientific insights into cancer biology.",Robert Krüger;Johanna Beyer;Won-Dong Jang;Nam Wook Kim;Artem Sokolov;Peter K. Sorger;Hanspeter Pfister,Robert Krueger;Johanna Beyer;Won-Dong Jang;Nam Wook Kim;Artem Sokolov;Peter K. Sorger;Hanspeter Pfister,"School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA;School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA;School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA;School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA;Laboratory of Systems Pharmacology, Harvard Medical School, Boston, MA, USA;Laboratory of Systems Pharmacology, Harvard Medical School, Boston, MA, USA;School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA","10.1109/TVCG.2013.186,10.1109/TVCG.2016.2598468,10.1109/VAST.2010.5652443,10.1109/TVCG.2016.2598587,10.1109/VAST.2007.4389013,10.1109/TVCG.2012.277,10.1109/TVCG.2012.258,10.1109/VAST.2014.7042495,10.1109/TVCG.2013.125,10.1109/TVCG.2007.70569,10.1109/TVCG.2015.2467551,10.1109/TVCG.2017.2744805,10.1109/TVCG.2012.213,10.1109/TVCG.2017.2744158","Clustering,Classification,Visual Analysis,Multiplex Tissue Imaging,Digital Pathology,Cancer Systems Biology",0,1,70,
VAST,2019,FDive: Learning Relevance Models Using Pattern-based Similarity Measures,10.1109/VAST47406.2019.8986940,http://dx.doi.org/10.1109/VAST47406.2019.8986940,69,80,C,"The detection of interesting patterns in large high-dimensional datasets is difficult because of their dimensionality and pattern complexity. Therefore, analysts require automated support for the extraction of relevant patterns. In this paper, we present FDive, a visual active learning system that helps to create visually explorable relevance models, assisted by learning a pattern-based similarity. We use a small set of user-provided labels to rank similarity measures, consisting of feature descriptor and distance function combinations, by their ability to distinguish relevant from irrelevant data. Based on the best-ranked similarity measure, the system calculates an interactive Self-Organizing Map-based relevance model, which classifies data according to the cluster affiliation. It also automatically prompts further relevance feedback to improve its accuracy. Uncertain areas, especially near the decision boundaries, are highlighted and can be refined by the user. We evaluate our approach by comparison to state-of-the-art feature selection techniques and demonstrate the usefulness of our approach by a case study classifying electron microscopy images of brain cells. The results show that FDive enhances both the quality and understanding of relevance models and can thus lead to new insights for brain research.",Frederik L. Dennig;Tom Polk;Zudi Lin;Tobias Schreck;Hanspeter Pfister;Michael Behrisch 0001,Frederik L. Dennig;Tom Polk;Zudi Lin;Tobias Schreck;Hanspeter Pfister;Michael Behrisch,"University of Konstanz,Germany;University of Konstanz,Germany;Harvard University,USA;Graz University of Technology,Austria;Harvard University,USA;Harvard University,USA","10.1109/TVCG.2016.2598467,10.1109/VAST.2014.7042480,10.1109/TVCG.2017.2744818,10.1109/VAST.2012.6400486,10.1109/TVCG.2013.157,10.1109/TVCG.2012.277,10.1109/VAST.2007.4388999,10.1109/TVCG.2017.2744805,10.1109/TVCG.2014.2346481,10.1109/VAST.2011.6102453,10.1109/INFVIS.2005.1532142","Visual analytics,similarity measure selection,relevance feedback,active learning,self-organizing maps",0,0,63,
VAST,2019,FlowSense: A Natural Language Interface for Visual Data Exploration within a Dataflow System,10.1109/TVCG.2019.2934668,http://dx.doi.org/10.1109/TVCG.2019.2934668,1,11,J,"Dataflow visualization systems enable flexible visual data exploration by allowing the user to construct a dataflow diagram that composes query and visualization modules to specify system functionality. However learning dataflow diagram usage presents overhead that often discourages the user. In this work we design FlowSense, a natural language interface for dataflow visualization systems that utilizes state-of-the-art natural language processing techniques to assist dataflow diagram construction. FlowSense employs a semantic parser with special utterance tagging and special utterance placeholders to generalize to different datasets and dataflow diagrams. It explicitly presents recognized dataset and diagram special utterances to the user for dataflow context awareness. With FlowSense the user can expand and adjust dataflow diagrams more conveniently via plain English. We apply FlowSense to the VisFlow subset-flow visualization system to enhance its usability. We evaluate FlowSense by one case study with domain experts on a real-world data analysis problem and a formal user study.",Bowen Yu 0004;Cláudio T. Silva,Bowen Yu;Cláudio T. Silva,New York University;New York University,"10.1109/INFVIS.2005.1532136,10.1109/VISUAL.2005.1532788,10.1109/TVCG.2010.164,10.1109/TVCG.2017.2744684,10.1109/TVCG.2007.70594,10.1109/TVCG.2017.2745219,10.1109/TVCG.2016.2598497","Natural language interface,dataflow visualization system,visual data exploration",0,4,58,BP
VAST,2019,Galex: Exploring the Evolution and Intersection of Disciplines,10.1109/TVCG.2019.2934667,http://dx.doi.org/10.1109/TVCG.2019.2934667,1182,1192,J,"Revealing the evolution of science and the intersections among its sub-fields is extremely important to understand the characteristics of disciplines, discover new topics, and predict the future. The current work focuses on either building the skeleton of science, lacking interaction, detailed exploration and interpretation or on the lower topic level, missing high-level macro-perspective. To fill this gap, we design and implement Galaxy Evolution Explorer (Galex), a hierarchical visual analysis system, in combination with advanced text mining technologies, that could help analysts to comprehend the evolution and intersection of one discipline rapidly. We divide Galex into three progressively fine-grained levels: discipline, area, and institution levels. The combination of interactions enables analysts to explore an arbitrary piece of history and an arbitrary part of the knowledge space of one discipline. Using a flexible spotlight component, analysts could freely select and quickly understand an exploration region. A tree metaphor allows analysts to perceive the expansion, decline, and intersection of topics intuitively. A synchronous spotlight interaction aids in comparing research contents among institutions easily. Three cases demonstrate the effectiveness of our system.",Zeyu Li;Changhong Zhang;Shichao Jia;Jiawan Zhang,Zeyu Li;Changhong Zhang;Shichao Jia;Jiawan Zhang,College of Intelligence and ComputingTianjin University;College of Intelligence and ComputingTianjin University;College of Intelligence and ComputingTianjin University;College of Intelligence and ComputingTianjin University,"10.1109/VAST.2009.5333443,10.1109/TVCG.2011.239,10.1109/VAST.2012.6400485,10.1109/TVCG.2013.162,10.1109/VISUAL.1996.568118,10.1109/TVCG.2015.2467621,10.1109/VAST.2016.7883507,10.1109/TVCG.2016.2598827,10.1109/INFVIS.2004.22,10.1109/TVCG.2018.2865022,10.1109/VAST.2014.7042494,10.1109/VAST.2007.4389006,10.1109/TVCG.2018.2864912,10.1109/INFVIS.1995.528686,10.1109/TVCG.2013.167","Science evolution,science mapping,interdisciplinary,knowledge domain visualization,visual analysis",0,0,66,
VAST,2019,GUIRO: User-Guided Matrix Reordering,10.1109/TVCG.2019.2934300,http://dx.doi.org/10.1109/TVCG.2019.2934300,184,194,J,"Matrix representations are one of the main established and empirically proven to be effective visualization techniques for relational (or network) data. However, matrices—similar to node-link diagrams—are most effective if their layout reveals the underlying data topology. Given the many developed algorithms, a practical problem arises: “Which matrix reordering algorithm should I choose for my dataset at hand?” To make matters worse, different reordering algorithms applied to the same dataset may let significantly different visual matrix patterns emerge. This leads to the question of trustworthiness and explainability of these fully automated, often heuristic, black-box processes. We present GUIRO, a Visual Analytics system that helps novices, network analysts, and algorithm designers to open the black-box. Users can investigate the usefulness and expressiveness of 70 accessible matrix reordering algorithms. For network analysts, we introduce a novel model space representation and two interaction techniques for a user-guided reordering of rows or columns, and especially groups thereof (submatrix reordering). These novel techniques contribute to the understanding of the global and local dataset topology. We support algorithm designers by giving them access to 16 reordering quality metrics and visual exploration means for comparing reordering implementations on a row/column permutation level. We evaluated GUIRO in a guided explorative user study with 12 subjects, a case study demonstrating its usefulness in a real-world scenario, and through an expert study gathering feedback on our design decisions. We found that our proposed methods help even inexperienced users to understand matrix patterns and allow a user-guided steering of reordering algorithms. GUIRO helps to increase the transparency of matrix reordering algorithms, thus helping a broad range of users to get a better insight into the complex reordering process, in turn supporting data and reordering algorithm insights.",Michael Behrisch 0001;Tobias Schreck;Hanspeter Pfister,Michael Behrisch;Tobias Schreck;Hanspeter Pfister,"School of Engineering, Applied Sciences, Harvard University, United States;Graz University of Technology, Austria;School of Engineering, Applied Sciences, Harvard University, United States","10.1109/INFVIS.2004.46,10.1109/VAST.2012.6400549,10.1109/TVCG.2010.159,10.1109/TVCG.2006.160,10.1109/TVCG.2007.70582,10.1109/TVCG.2006.147,10.1109/TVCG.2012.219,10.1109/TVCG.2017.2745978,10.1109/TVCG.2006.166,10.1109/TVCG.2012.256,10.1109/TVCG.2015.2468078","Visual Analytics,matrix,black-box algorithms,seriation,ordering,sorting,steerable algorithm,interaction,2D projection",0,1,84,
VAST,2019,ICE: An Interactive Configuration Explorer for High Dimensional Categorical Parameter Spaces,10.1109/VAST47406.2019.8986923,http://dx.doi.org/10.1109/VAST47406.2019.8986923,23,34,C,"There are many applications where users seek to explore the impact of the settings of several categorical variables with respect to one dependent numerical variable. For example, a computer systems analyst might want to study how the type of file system or storage device affects system performance. A usual choice is the method of Parallel Sets designed to visualize multivariate categorical variables, However, we found that the magnitude of the parameter impacts on the numerical variable cannot be easily observed here. We also attempted a dimension reduction approach based on Multiple Correspondence Analysis but found that the SVD-generated 2D layout resulted in a loss of information. We hence propose a novel approach, the Interactive Configuration Explorer (ICE), which directly addresses the need of analysts to learn how the dependent numerical variable is affected by the parameter settings given multiple optimization objectives. No information is lost as ICE shows the complete distribution and statistics of the dependent variable in context with each categorical variable. Analysts can interactively filter the variables to optimize for certain goals such as achieving a system with maximum performance, low variance, etc. Our system was developed in tight collaboration with a group of systems performance researchers and its final effectiveness was evaluated with expert interviews, a comparative user study, and two case studies.",Anjul Tyagi;Zhen Cao;Tyler Estro;Erez Zadok;Klaus Mueller,Anjul Tyagi;Zhen Cao;Tyler Estro;Erez Zadok;Klaus Mueller,"Stony Brook University,Department of Computer Science;Stony Brook University,Department of Computer Science;Stony Brook University,Department of Computer Science;Stony Brook University,Department of Computer Science;Stony Brook University,Department of Computer Science","10.1109/TVCG.2011.185,10.1109/TVCG.2017.2745278,10.1109/TVCG.2014.2346448,10.1109/VISUAL.1997.663916,10.1109/TVCG.2013.182,10.1109/TVCG.2015.2467132,10.1109/TVCG.2015.2467132,10.1109/TVCG.2009.111,10.1109/TVCG.2015.2467324,10.1109/TVCG.2014.2346321,10.1109/TVCG.2017.2744686,10.1109/TVCG.2018.2864510,10.1109/TVCG.2010.183","Data Clustering,Illustrative Visualization,User Interfaces,High Dimensional Data",0,0,72,
VAST,2019,Interactive Correction of Mislabeled Training Data,10.1109/VAST47406.2019.8986943,http://dx.doi.org/10.1109/VAST47406.2019.8986943,57,68,C,"In this paper, we develop a visual analysis method for interactively improving the quality of labeled data, which is essential to the success of supervised and semi-supervised learning. The quality improvement is achieved through the use of user-selected trusted items. We employ a bi-level optimization model to accurately match the labels of the trusted items and to minimize the training loss. Based on this model, a scalable data correction algorithm is developed to handle tens of thousands of labeled data efficiently. The selection of the trusted items is facilitated by an incremental tSNE with improved computational efficiency and layout stability to ensure a smooth transition between different levels. We evaluated our method on real-world datasets through quantitative evaluation and case studies, and the results were generally favorable.",Shouxing Xiang;Xi Ye;Jiazhi Xia;Jing Wu;Yang Chen;Shixia Liu,Shouxing Xiang;Xi Ye;Jiazhi Xia;Jing Wu;Yang Chen;Shixia Liu,"School of Software, BNRist, Tsinghua University;School of Software, BNRist, Tsinghua University;School of Computer Science and Engineering, Central South University;School of Computer Science and Informatics, Cardiff University;School of Software, BNRist, Tsinghua University;School of Software, BNRist, Tsinghua University","10.1109/TVCG.2017.2744683,10.1109/TVCG.2016.2598592,10.1109/TVCG.2017.2744818,10.1109/TVCG.2017.2744419,10.1109/TVCG.2014.2346594,10.1109/VAST.2012.6400492,10.1109/VAST.2018.8802509,10.1109/TVCG.2017.2744938,10.1109/TVCG.2016.2598831,10.1109/TVCG.2018.2864843,10.1109/TVCG.2014.2346574,10.1109/TVCG.2017.2744685,10.1109/TVCG.2018.2865026","Labeled data debugging,trusted item,tSNE",0,4,58,
VAST,2019,"LightGuider: Guiding Interactive Lighting Design using Suggestions, Provenance, and Quality Visualization",10.1109/TVCG.2019.2934658,http://dx.doi.org/10.1109/TVCG.2019.2934658,569,578,J,"LightGuider is a novel guidance-based approach to interactive lighting design, which typically consists of interleaved 3D modeling operations and light transport simulations. Rather than having designers use a trial-and-error approach to match their illumination constraints and aesthetic goals, LightGuider supports the process by simulating potential next modeling steps that can deliver the most significant improvements. LightGuider takes predefined quality criteria and the current focus of the designer into account to visualize suggestions for lighting-design improvements via a specialized provenance tree. This provenance tree integrates snapshot visualizations of how well a design meets the given quality criteria weighted by the designer's preferences. This integration facilitates the analysis of quality improvements over the course of a modeling workflow as well as the comparison of alternative design solutions. We evaluate our approach with three lighting designers to illustrate its usefulness.",Andreas Walch;Michael Schwärzler;Christian Luksch;Elmar Eisemann;Theresia Gschwandtner,Andreas Walch;Michael Schwärzler;Christian Luksch;Elmar Eisemann;Theresia Gschwandtner,VRVis Forschungs GmbH;TU Delft;VRVis Forschungs GmbH;TU Delft;Visual Analytics research divisionTU Wien,"10.1109/TVCG.2011.185,10.1109/TVCG.2010.190,10.1109/TVCG.2016.2598468,10.1109/TVCG.2013.147,10.1109/TVCG.2013.126,10.1109/TVCG.2015.2467551,10.1109/TVCG.2014.2346321,10.1109/TVCG.2015.2468011,10.1109/TVCG.2018.2865024","guidance,3D modeling,lighting design,provenance,global illumination",0,0,49,
VAST,2019,MetricsVis: A Visual Analytics System for Evaluating Employee Performance in Public Safety Agencies,10.1109/TVCG.2019.2934603,http://dx.doi.org/10.1109/TVCG.2019.2934603,1193,1203,J,"Evaluating employee performance in organizations with varying workloads and tasks is challenging. Specifically, it is important to understand how quantitative measurements of employee achievements relate to supervisor expectations, what the main drivers of good performance are, and how to combine these complex and flexible performance evaluation metrics into an accurate portrayal of organizational performance in order to identify shortcomings and improve overall productivity. To facilitate this process, we summarize common organizational performance analyses into four visual exploration task categories. Additionally, we develop MetricsVis, a visual analytics system composed of multiple coordinated views to support the dynamic evaluation and comparison of individual, team, and organizational performance in public safety organizations. MetricsVis provides four primary visual components to expedite performance evaluation: (1) a priority adjustment view to support direct manipulation on evaluation metrics; (2) a reorderable performance matrix to demonstrate the details of individual employees; (3) a group performance view that highlights aggregate performance and individual contributions for each group; and (4) a projection view illustrating employees with similar specialties to facilitate shift assignments and training. We demonstrate the usability of our framework with two case studies from medium-sized law enforcement agencies and highlight its broader applicability to other domains.",Jieqiong Zhao;Morteza Karimzadeh;Luke S. Snyder;Chittayong Surakitbanharn;Cheryl Z. Qian;David S. Ebert,Jieqiong Zhao;Morteza Karimzadeh;Luke S. Snyder;Chittayong Surakitbanharn;Zhenyu Cheryl Qian;David S. Ebert,Purdue University;Purdue University;Purdue University;Hivemapper;Purdue University;Purdue University,"10.1109/TVCG.2010.209,10.1109/TVCG.2013.173,10.1109/TVCG.2015.2467325,10.1109/TVCG.2017.2745078,10.1109/TVCG.2007.70589,10.1109/TVCG.2007.70515,10.1109/TVCG.2017.2744738","Organizational performance analysis,multi-dimensional data,hierarchical relationships,visual analytics",0,0,45,
VAST,2019,Motion Browser: Visualizing and Understanding Complex Upper Limb Movement Under Obstetrical Brachial Plexus Injuries,10.1109/TVCG.2019.2934280,http://dx.doi.org/10.1109/TVCG.2019.2934280,981,990,J,"The brachial plexus is a complex network of peripheral nerves that enables sensing from and control of the movements of the arms and hand. Nowadays, the coordination between the muscles to generate simple movements is still not well understood, hindering the knowledge of how to best treat patients with this type of peripheral nerve injury. To acquire enough information for medical data analysis, physicians conduct motion analysis assessments with patients to produce a rich dataset of electromyographic signals from multiple muscles recorded with joint movements during real-world tasks. However, tools for the analysis and visualization of the data in a succinct and interpretable manner are currently not available. Without the ability to integrate, compare, and compute multiple data sources in one platform, physicians can only compute simple statistical values to describe patient's behavior vaguely, which limits the possibility to answer clinical questions and generate hypotheses for research. To address this challenge, we have developed Motion Browser, an interactive visual analytics system which provides an efficient framework to extract and compare muscle activity patterns from the patient's limbs and coordinated views to help users analyze muscle signals, motion data, and video information to address different tasks. The system was developed as a result of a collaborative endeavor between computer scientists and orthopedic surgery and rehabilitation physicians. We present case studies showing physicians can utilize the information displayed to understand how individuals coordinate their muscles to initiate appropriate treatment and generate new hypotheses for future research.",Gromit Yeuk-Yin Chan;Luis Gustavo Nonato;Alice Chu;Preeti Raghavan;Viswanath Aluru;Cláudio T. Silva,Gromit Yeuk-Yin Chan;Luis Gustavo Nonato;Alice Chu;Preeti Raghavan;Viswanath Aluru;Cláudio T. Silva,New York University;University of São Paulo;Rutgers New Jersey Medical School;NYU Langone Medical Center;NYU Langone Medical Center;New York University,"10.1109/TVCG.2013.178,10.1109/TVCG.2016.2598618,10.1109/TVCG.2017.2744199,10.1109/TVCG.2015.2468292,10.1109/TVCG.2010.162,10.1109/TVCG.2008.139,10.1109/TVCG.2010.193,10.1109/TVCG.2017.2744319,10.1109/TVCG.2016.2598415,10.1109/VAST.2015.7347624,10.1109/TVCG.2009.187,10.1109/TVCG.2018.2865076,10.1109/TVCG.2011.195","Medical Data Visualization,Visual Analytics Application,Time Series Data,Multimodal Data,Brachial Plexus Injuries",0,0,48,
VAST,2019,NNVA: Neural Network Assisted Visual Analysis of Yeast Cell Polarization Simulation,10.1109/TVCG.2019.2934591,http://dx.doi.org/10.1109/TVCG.2019.2934591,34,44,J,"Complex computational models are often designed to simulate real-world physical phenomena in many scientific disciplines. However, these simulation models tend to be computationally very expensive and involve a large number of simulation input parameters, which need to be analyzed and properly calibrated before the models can be applied for real scientific studies. We propose a visual analysis system to facilitate interactive exploratory analysis of high-dimensional input parameter space for a complex yeast cell polarization simulation. The proposed system can assist the computational biologists, who designed the simulation model, to visually calibrate the input parameters by modifying the parameter values and immediately visualizing the predicted simulation outcome without having the need to run the original expensive simulation for every instance. Our proposed visual analysis system is driven by a trained neural network-based surrogate model as the backend analysis framework. In this work, we demonstrate the advantage of using neural networks as surrogate models for visual analysis by incorporating some of the recent advances in the field of uncertainty quantification, interpretability and explainability of neural network-based models. We utilize the trained network to perform interactive parameter sensitivity analysis of the original simulation as well as recommend optimal parameter configurations using the activation maximization framework of neural networks. We also facilitate detail analysis of the trained network to extract useful insights about the simulation model, learned by the network, during the training process. We performed two case studies, and discovered multiple new parameter configurations, which can trigger high cell polarization results in the original simulation model. We evaluated our results by comparing with the original simulation model outcomes as well as the findings from previous parameter analysis performed by our experts.",Subhashis Hazarika;Haoyu Li;Ko-Chih Wang;Han-Wei Shen;Ching-Shan Chou,Subhashis Hazarika;Haoyu Li;Ko-Chih Wang;Han-Wei Shen;Ching-Shan Chou,Department of Computer ScienceOhio State University;Department of Computer ScienceOhio State University;Department of Computer ScienceOhio State University;Department of Computer ScienceOhio State University;Department of MathematicsOhio State University,"10.1109/TVCG.2017.2744683,10.1109/TVCG.2016.2598869,10.1109/TVCG.2013.147,10.1109/TVCG.2018.2865029,10.1109/TVCG.2017.2744718,10.1109/TVCG.2018.2864500,10.1109/TVCG.2016.2598831,10.1109/TVCG.2018.2864843,10.1109/TVCG.2018.2864887,10.1109/VAST.2017.8585721,10.1109/TVCG.2018.2865051,10.1109/TVCG.2014.2346321,10.1109/TVCG.2018.2865044,10.1109/TVCG.2017.2744158,10.1109/TVCG.2018.2864504,10.1109/TVCG.2016.2598830,10.1109/TVCG.2017.2744878,10.1109/TVCG.2018.2865026,10.1109/TVCG.2018.2864499,10.1109/TVCG.2018.2864503","Surrogate modeling,Neural networks,Computational biology,Visual analysis,Parameter analysis",0,0,65,HM
VAST,2019,OD Morphing: Balancing Simplicity with Faithfulness for OD Bundling,10.1109/TVCG.2019.2934657,http://dx.doi.org/10.1109/TVCG.2019.2934657,811,821,J,"OD bundling is a promising method to identify key origin-destination (OD) patterns, but the bundling can mislead the interpretation of actual trajectories traveled. We present OD Morphing, an interactive OD bundling technique that improves geographical faithfulness to actual trajectories while preserving visual simplicity for OD patterns. OD Morphing iteratively identifies critical waypoints from the actual trajectory network with a min-cut algorithm and transitions OD bundles to pass through the identified waypoints with a smooth morphing method. Furthermore, we extend OD Morphing to support bundling at interaction speeds to enable users to interactively transition between degrees of faithfulness to aid sensemaking. We introduce metrics for faithfulness and simplicity to evaluate their trade-off achieved by OD morphed bundling. We demonstrate OD Morphing on real-world city-scale taxi trajectory and USA domestic planned flight datasets.",Yan Lyu;Xu Liu;Hanyi Chen;Arpan Mangal;Kai Liu 0001;Chao Chen 0004;Brian Y. Lim,Yan Lyu;Xu Liu;Hanyi Chen;Arpan Mangal;Kai Liu;Chao Chen;Brian Lim,"National University of Singapore;Southeast University, China;Zhejiang University, China;Indian Institute of Technology, Delhi;Chongqing University, China;Chongqing University, China;National University of Singapore","10.1109/TVCG.2016.2598416,10.1109/TVCG.2017.2744322,10.1109/VAST.2009.5332584,10.1109/TVCG.2016.2598958,10.1109/TVCG.2008.135,10.1109/TVCG.2011.233,10.1109/TVCG.2014.2346271,10.1109/TVCG.2007.70539,10.1109/TVCG.2006.147,10.1109/TVCG.2015.2467771,10.1109/TVCG.2017.2744338,10.1109/TVCG.2011.223,10.1109/VAST.2011.6102455,10.1109/TVCG.2011.190,10.1109/TVCG.2015.2467691,10.1109/INFVIS.2003.1249008,10.1109/TVCG.2016.2598885,10.1109/TVCG.2018.2864503","OD Visualization,Edge Bundling,Trajectory",0,0,57,
VAST,2019,Origraph: Interactive Network Wrangling,10.1109/VAST47406.2019.8986909,http://dx.doi.org/10.1109/VAST47406.2019.8986909,81,92,C,"Networks are a natural way of thinking about many datasets. The data on which a network is based, however, is rarely collected in a form that suits the analysis process, making it necessary to create and reshape networks. Data wrangling is widely acknowledged to be a critical part of the data analysis pipeline, yet interactive network wrangling has received little attention in the visualization research community. In this paper, we discuss a set of operations that are important for wrangling network datasets and introduce a visual data wrangling tool, Origraph, that enables analysts to apply these operations to their datasets. Key operations include creating a network from source data such as tables, reshaping a network by introducing new node or edge classes, filtering nodes or edges, and deriving new node or edge attributes. Our tool, Origraph, enables analysts to execute these operations with little to no programming, and to immediately visualize the results. Origraph provides views to investigate the network model, a sample of the network, and node and edge attributes. In addition, we introduce interfaces designed to aid analysts in specifying arguments for sensible network wrangling operations. We demonstrate the usefulness of Origraph in two Use Cases: first, we investigate gender bias in the film industry, and then the influence of money on the political support for the war in Yemen.",Alex Bigelow;Carolina Nobre;Miriah D. Meyer;Alexander Lex,Alex Bigelow;Carolina Nobre;Miriah Meyer;Alexander Lex,University of Utah;University of Utah;University of Utah;University of Utah,"10.1109/VAST.2006.261429,10.1109/VAST.2011.6102441,10.1109/VAST.2011.6102441,10.1109/TVCG.2014.2346248,10.1109/TVCG.2013.154,10.1109/VAST.2011.6102440,10.1109/TVCG.2009.111,10.1109/TVCG.2009.116,10.1109/TVCG.2018.2865149,10.1109/TVCG.2017.2744843,10.1109/VAST.2010.5652520","Graph visualization,Data abstraction,Data wrangling,Human-centered computing [Information visualization],[Human-centered computing]: Visualization systems and tools,Information systems [Graph-based database models]",0,2,70,
VAST,2019,PlanningVis: A Visual Analytics Approach to Production Planning in Smart Factories,10.1109/TVCG.2019.2934275,http://dx.doi.org/10.1109/TVCG.2019.2934275,579,589,J,"Production planning in the manufacturing industry is crucial for fully utilizing factory resources (e.g., machines, raw materials and workers) and reducing costs. With the advent of industry 4.0, plenty of data recording the status of factory resources have been collected and further involved in production planning, which brings an unprecedented opportunity to understand, evaluate and adjust complex production plans through a data-driven approach. However, developing a systematic analytics approach for production planning is challenging due to the large volume of production data, the complex dependency between products, and unexpected changes in the market and the plant. Previous studies only provide summarized results and fail to show details for comparative analysis of production plans. Besides, the rapid adjustment to the plan in the case of an unanticipated incident is also not supported. In this paper, we propose PlanningVis, a visual analytics system to support the exploration and comparison of production plans with three levels of details: a plan overview presenting the overall difference between plans, a product view visualizing various properties of individual products, and a production detail view displaying the product dependency and the daily production details in related factories. By integrating an automatic planning algorithm with interactive visual explorations, PlanningVis can facilitate the efficient optimization of daily production planning as well as support a quick response to unanticipated incidents in manufacturing. Two case studies with real-world data and carefully designed interviews with domain experts demonstrate the effectiveness and usability of PlanningVis.",Dong Sun 0001;Renfei Huang;Yuanzhe Chen;Yong Wang 0021;Jia Zeng;Mingxuan Yuan;Ting-Chuen Pong;Huamin Qu,Dong Sun;Renfei Huang;Yuanzhe Chen;Yong Wang;Jia Zeng;Mingxuan Yuan;Ting-Chuen Pong;Huamin Qu,Hong Kong University of Sccience and Technology;Hong Kong University of Sccience and Technology;Noah's Ark LabHuawei Technologies Co. Ltd.;Hong Kong University of Sccience and Technology;Noah's Ark LabHuawei Technologies Co. Ltd.;Noah's Ark LabHuawei Technologies Co. Ltd.;Hong Kong University of Sccience and Technology;Hong Kong University of Sccience and Technology,"10.1109/TVCG.2011.185,10.1109/TVCG.2008.166,10.1109/TVCG.2017.2745083,10.1109/TVCG.2010.162,10.1109/TVCG.2014.2346454,10.1109/INFVIS.2002.1173149,10.1109/INFVIS.2005.1532144,10.1109/INFVIS.1999.801851,10.1109/TVCG.2015.2467751,10.1109/INFVIS.2001.963273,10.1109/TVCG.2012.225,10.1109/TVCG.2016.2598664,10.1109/TVCG.2018.2865076","Production Planning,Time Series Data,Comparative Analysis,Visual Analytics,Smart Factory,Industry 4.0",0,0,55,
VAST,2019,ProtoSteer: Steering Deep Sequence Model with Prototypes,10.1109/TVCG.2019.2934267,http://dx.doi.org/10.1109/TVCG.2019.2934267,238,248,J,"Recently we have witnessed growing adoption of deep sequence models (e.g. LSTMs) in many application domains, including predictive health care, natural language processing, and log analysis. However, the intricate working mechanism of these models confines their accessibility to the domain experts. Their black-box nature also makes it a challenging task to incorporate domain-specific knowledge of the experts into the model. In ProtoSteer (Prototype Steering), we tackle the challenge of directly involving the domain experts to steer a deep sequence model without relying on model developers as intermediaries. Our approach originates in case-based reasoning, which imitates the common human problem-solving process of consulting past experiences to solve new problems. We utilize ProSeNet (Prototype Sequence Network), which learns a small set of exemplar cases (i.e., prototypes) from historical data. In ProtoSteer they serve both as an efficient visual summary of the original data and explanations of model decisions. With ProtoSteer the domain experts can inspect, critique, and revise the prototypes interactively. The system then incorporates user-specified prototypes and incrementally updates the model. We conduct extensive case studies and expert interviews in application domains including sentiment analysis on texts and predictive diagnostics based on vehicle fault logs. The results demonstrate that involvements of domain users can help obtain more interpretable models with concise prototypes while retaining similar accuracy.",Yao Ming;Panpan Xu;Furui Cheng;Huamin Qu;Ren Liu,Yao Ming;Panpan Xu;Furui Cheng;Huamin Qu;Liu Ren,Hong Kong University of Science and Technology;Bosch Research North America;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Bosch Research North America,"10.1109/TVCG.2012.225,10.1109/VAST.2011.6102453,10.1109/TVCG.2017.2744158,10.1109/TVCG.2018.2865044,10.1109/INFVIS.2000.885091,10.1109/TVCG.2018.2864838,10.1109/VAST.2015.7347682,10.1109/TVCG.2016.2598797,10.1109/TVCG.2018.2865230,10.1109/TVCG.2018.2865027,10.1109/TVCG.2017.2744718,10.1109/TVCG.2017.2745320,10.1109/TVCG.2018.2864885,10.1109/TVCG.2014.2346682,10.1109/TVCG.2017.2745083","Sequence Data,Explainable Artificial Intelligence (XAI),Recurrent Neural Networks (RNNs),Prototype Learning",0,2,51,
VAST,2019,R-Map: A Map Metaphor for Visualizing Information Reposting Process in Social Media,10.1109/TVCG.2019.2934263,http://dx.doi.org/10.1109/TVCG.2019.2934263,1204,1214,J,"We propose R-Map (Reposting Map), a visual analytical approach with a map metaphor to support interactive exploration and analysis of the information reposting process in social media. A single original social media post can cause large cascades of repostings (i.e., retweets) on online networks, involving thousands, even millions of people with different opinions. Such reposting behaviors form the reposting tree, in which a node represents a message and a link represents the reposting relation. In R-Map, the reposting tree structure can be spatialized with highlighted key players and tiled nodes. The important reposting behaviors, the following relations and the semantics relations are represented as rivers, routes and bridges, respectively, in a virtual geographical space. R-Map supports a scalable overview of a large number of information repostings with semantics. Additional interactions on the map are provided to support the investigation of temporal patterns and user behaviors in the information diffusion process. We evaluate the usability and effectiveness of our system with two use cases and a formal user study.",Shuai Chen 0001;Sihang Li;Siming Chen 0001;Xiaoru Yuan,Shuai Chen;Sihang Li;Siming Chen;Xiaoru Yuan,Key Laboratory of Machine Perception (Ministry of Education)School of EECSPeking University;Key Laboratory of Machine Perception (Ministry of Education)School of EECSPeking University;Fraunhofer Institute IAISUniversity of Bonn;Key Laboratory of Machine Perception (Ministry of Education)School of EECSPeking University,"10.1109/INFVIS.2005.1532128,10.1109/INFVIS.2001.963290,10.1109/TVCG.2012.291,10.1109/VAST.2017.8585638,10.1109/VAST.2016.7883510,10.1109/VISUAL.1991.175815,10.1109/INFVIS.2000.885095,10.1109/INFVIS.2000.885091,10.1109/INFVIS.1999.801860,10.1109/TVCG.2014.2346920,10.1109/TVCG.2014.2346922","Social Media,Information Diffusion,Map-like Visual Metaphor",0,0,50,
VAST,2019,Scalable Topological Data Analysis and Visualization for Evaluating Data-Driven Models in Scientific Applications,10.1109/TVCG.2019.2934594,http://dx.doi.org/10.1109/TVCG.2019.2934594,291,300,J,"With the rapid adoption of machine learning techniques for large-scale applications in science and engineering comes the convergence of two grand challenges in visualization. First, the utilization of black box models (e.g., deep neural networks) calls for advanced techniques in exploring and interpreting model behaviors. Second, the rapid growth in computing has produced enormous datasets that require techniques that can handle millions or more samples. Although some solutions to these interpretability challenges have been proposed, they typically do not scale beyond thousands of samples, nor do they provide the high-level intuition scientists are looking for. Here, we present the first scalable solution to explore and analyze high-dimensional functions often encountered in the scientific data analysis pipeline. By combining a new streaming neighborhood graph construction, the corresponding topology computation, and a novel data aggregation scheme, namely topology aware datacubes, we enable interactive exploration of both the topological and the geometric aspect of high-dimensional data. Following two use cases from high-energy-density (HED) physics and computational biology, we demonstrate how these capabilities have led to crucial new insights in both applications.",Shusen Liu;Jim Gaffney;Jayson Luc Peterson;Peter B. Robinson;Harsh Bhatia;Valerio Pascucci;Brian K. Spears;Peer-Timo Bremer;Di Wang;Dan Maljovec;Rushil Anirudh;Jayaraman J. Thiagarajan;Sam Ade Jacobs;Brian Van Essen;David Hysom;Jae-Seung Yeom,Shusen Liu;Luc Peterson;Peter B. Robinson;Harsh Bhatia;Valerio Pascucci;Brian K. Spears;Peer-Timo Bremer;Di Wang;Dan Maljovec;Rushil Anirudh;Jayaraman J. Thiagarajan;Sam Ade Jacobs;Brian C. Van Essen;David Hysom;Jae-Seung Yeom;Jim Gaffney,Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory;SCI InstituteUniversity of Utah;Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory;SCI InstituteUniversity of Utah;SCI InstituteUniversity of Utah;Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory;Lawrence Livermore National Laboratory,"10.1109/INFVIS.2004.68,10.1109/TVCG.2011.245,10.1109/TVCG.2011.244,10.1109/TVCG.2010.197,10.1109/TVCG.2010.213,10.1109/TVCG.2010.213,10.1109/TVCG.2008.110,10.1109/VISUAL.2005.1532839,10.1109/TVCG.2013.179,10.1109/VAST.2018.8802509,10.1109/TVCG.2018.2865230,10.1109/TVCG.2018.2864812,10.1109/VISUAL.1998.745348,10.1109/TVCG.2013.148,10.1109/TVCG.2018.2864504","Model Evaluation,Deep Learning,High-Dimensional Space,Topological Data Analysis,Inertial Confinement Fusion",0,0,38,
VAST,2019,Semantic Concept Spaces: Guided Topic Model Refinement using Word-Embedding Projections,10.1109/TVCG.2019.2934654,http://dx.doi.org/10.1109/TVCG.2019.2934654,1001,1011,J,"We present a framework that allows users to incorporate the semantics of their domain knowledge for topic model refinement while remaining model-agnostic. Our approach enables users to (1) understand the semantic space of the model, (2) identify regions of potential conflicts and problems, and (3) readjust the semantic relation of concepts based on their understanding, directly influencing the topic modeling. These tasks are supported by an interactive visual analytics workspace that uses word-embedding projections to define concept regions which can then be refined. The user-refined concepts are independent of a particular document collection and can be transferred to related corpora. All user interactions within the concept space directly affect the semantic relations of the underlying vector space model, which, in turn, change the topic modeling. In addition to direct manipulation, our system guides the users' decision-making process through recommended interactions that point out potential improvements. This targeted refinement aims at minimizing the feedback required for an efficient human-in-the-loop process. We confirm the improvements achieved through our approach in two user studies that show topic model quality improvements through our visual knowledge externalization and learning process.",Mennatallah El-Assady;Rebecca Kehlbeck;Christopher Collins 0001;Daniel A. Keim;Oliver Deussen,Mennatallah El-Assady;Rebecca Kehlbeck;Christopher Collins;Daniel Keim;Oliver Deussen,"University of Konstanz, Germany;University of Konstanz, Germany;Ontario Tech University, Canada;University of Konstanz, Germany;University of Konstanz, Germany","10.1109/VAST.2014.7042493,10.1109/TVCG.2013.212,10.1109/VAST.2011.6102461,10.1109/TVCG.2013.162,10.1109/TVCG.2017.2745080,10.1109/TVCG.2018.2864769,10.1109/VAST.2017.8585498,10.1109/TVCG.2017.2746018,10.1109/TVCG.2017.2744199,10.1109/TVCG.2013.126,10.1109/TVCG.2017.2744478,10.1109/TVCG.2019.2934629,10.1109/VAST.2014.7042494","Topic Model Optimization,Word Embedding,Mixed-Initiative Refinement,Guided Visual Analytics,Semantic Mapping",0,3,59,
VAST,2019,sPortfolio: Stratified Visual Analysis of Stock Portfolios,10.1109/TVCG.2019.2934660,http://dx.doi.org/10.1109/TVCG.2019.2934660,601,610,J,"Quantitative Investment, built on the solid foundation of robust financial theories, is at the center stage in investment industry today. The essence of quantitative investment is the multi-factor model, which explains the relationship between the risk and return of equities. However, the multi-factor model generates enormous quantities of factor data, through which even experienced portfolio managers find it difficult to navigate. This has led to portfolio analysis and factor research being limited by a lack of intuitive visual analytics tools. Previous portfolio visualization systems have mainly focused on the relationship between the portfolio return and stock holdings, which is insufficient for making actionable insights or understanding market trends. In this paper, we present s Portfolio, which, to the best of our knowledge, is the first visualization that attempts to explore the factor investment area. In particular, sPortfolio provides a holistic overview of the factor data and aims to facilitate the analysis at three different levels: a Risk-Factor level, for a general market situation analysis; a Multiple-Portfolio level, for understanding the portfolio strategies; and a Single-Portfolio level, for investigating detailed operations. The system's effectiveness and usability are demonstrated through three case studies. The system has passed its pilot study and is soon to be deployed in industry.",Xuanwu Yue;Jiaxin Bai;Qinhan Liu;Yiyang Tang;Abishek Puri;Ke Li;Huamin Qu,Xuanwu Yue;Jiaxin Bai;Qinhan Liu;Yiyang Tang;Abishek Puri;Ke Li;Huamin Qu,Hong Kong University of Science and TechnologySinovation Ventures AI Institute;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;Hong Kong University of Science and Technology;RiceQuant Co. Ltd.;Hong Kong University of Science and Technology,"10.1109/VAST.2008.4677376,10.1109/TVCG.2008.117,10.1109/INFVIS.2003.1249027,10.1109/VAST.2009.5333920,10.1109/TVCG.2018.2864814,10.1109/VAST.2010.5652530","Stock portfolio,visual analytics,factor investment,financial data analysis",0,0,54,
VAST,2019,STBins: Visual Tracking and Comparison of Multiple Data Sequences Using Temporal Binning,10.1109/TVCG.2019.2934289,http://dx.doi.org/10.1109/TVCG.2019.2934289,1054,1063,J,"While analyzing multiple data sequences, the following questions typically arise: how does a single sequence change over time, how do multiple sequences compare within a period, and how does such comparison change over time. This paper presents a visual technique named STBins to answer these questions. STBins is designed for visual tracking of individual data sequences and also for comparison of sequences. The latter is done by showing the similarity of sequences within temporal windows. A perception study is conducted to examine the readability of alternative visual designs based on sequence tracking and comparison tasks. Also, two case studies based on real-world datasets are presented in detail to demonstrate usage of our technique.",Ji Qi;Vincent Bloemen;Shihan Wang;Jarke J. van Wijk;Huub van de Wetering,Ji Qi;Vincent Bloemen;Shihan Wang;Jarke van Wijk;Huub van de Wetering,"Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, Netherlands;Faculty of Electrical Engineering, Mathematics Computer Science, University of Twente, Enschede, Netherlands;University of Amsterdam, Amsterdam, Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, Netherlands","10.1109/TVCG.2011.232,10.1109/TVCG.2013.124,10.1109/TVCG.2017.2745278,10.1109/TVCG.2017.2745083,10.1109/TVCG.2011.239,10.1109/TVCG.2014.2346433,10.1109/VAST.2016.7883512,10.1109/TVCG.2017.2744199,10.1109/TVCG.2014.2346682,10.1109/TVCG.2018.2864885,10.1109/TVCG.2016.2598797,10.1109/TVCG.2013.200,10.1109/TVCG.2008.125,10.1109/TVCG.2014.2346919,10.1109/TVCG.2009.117,10.1109/VAST.2016.7883511,10.1109/TVCG.2012.225,10.1109/TVCG.2012.189","Visualization,time series data,data sequence",0,0,47,
VAST,2019,Supporting Analysis of Dimensionality Reduction Results with Contrastive Learning,10.1109/TVCG.2019.2934251,http://dx.doi.org/10.1109/TVCG.2019.2934251,45,55,J,"Dimensionality reduction (DR) is frequently used for analyzing and visualizing high-dimensional data as it provides a good first glance of the data. However, to interpret the DR result for gaining useful insights from the data, it would take additional analysis effort such as identifying clusters and understanding their characteristics. While there are many automatic methods (e.g., density-based clustering methods) to identify clusters, effective methods for understanding a cluster's characteristics are still lacking. A cluster can be mostly characterized by its distribution of feature values. Reviewing the original feature values is not a straightforward task when the number of features is large. To address this challenge, we present a visual analytics method that effectively highlights the essential features of a cluster in a DR result. To extract the essential features, we introduce an enhanced usage of contrastive principal component analysis (cPCA). Our method, called ccPCA (contrasting clusters in PCA), can calculate each feature's relative contribution to the contrast between one cluster and other clusters. With ccPCA, we have created an interactive system including a scalable visualization of clusters' feature contributions. We demonstrate the effectiveness of our method and system with case studies using several publicly available datasets.",Takanori Fujiwara;Oh-Hyun Kwon;Kwan-Liu Ma,Takanori Fujiwara;Oh-Hyun Kwon;Kwan-Liu Ma,"University of California, Davis;University of California, Davis;University of California, Davis","10.1109/TVCG.2011.185,10.1109/TVCG.2018.2865047,10.1109/TVCG.2019.2934433,10.1109/TVCG.2017.2744318,10.1109/VISUAL.1990.146402,10.1109/TVCG.2017.2745085,10.1109/TVCG.2016.2598446,10.1109/TVCG.2016.2598838,10.1109/TVCG.2016.2598495,10.1109/TVCG.2015.2467717,10.1109/TVCG.2012.256,10.1109/TVCG.2017.2745258,10.1109/TVCG.2017.2745258","Dimensionality reduction,contrastive learning,principal component analysis,high-dimensional data,visual analytics",0,6,78,HM
VAST,2019,Tac-Simur: Tactic-based Simulative Visual Analytics of Table Tennis,10.1109/TVCG.2019.2934630,http://dx.doi.org/10.1109/TVCG.2019.2934630,407,417,J,"Simulative analysis in competitive sports can provide prospective insights, which can help improve the performance of players in future matches. However, adequately simulating the complex competition process and effectively explaining the simulation result to domain experts are typically challenging. This work presents a design study to address these challenges in table tennis. We propose a well-established hybrid second-order Markov chain model to characterize and simulate the competition process in table tennis. Compared with existing methods, our approach is the first to support the effective simulation of tactics, which represent high-level competition strategies in table tennis. Furthermore, we introduce a visual analytics system called Tac-Simur based on the proposed model for simulative visual analytics. Tac-Simur enables users to easily navigate different players and their tactics based on their respective performance in matches to identify the player and the tactics of interest for further analysis. Then, users can utilize the system to interactively explore diverse simulation tasks and visually explain the simulation results. The effectiveness and usefulness of this work are demonstrated by two case studies, in which domain experts utilize Tac-Simur to find interesting and valuable insights. The domain experts also provide positive feedback on the usability of Tac-Simur. Our work can be extended to other similar sports such as tennis and badminton.",Jiachen Wang;Kejian Zhao;Dazhen Deng;Anqi Cao;Xiao Xie;Zheng Zhou;Hui Zhang;Yingcai Wu,Jiachen Wang;Kejian Zhao;Dazhen Deng;Anqi Cao;Xiao Xie;Zheng Zhou;Hui Zhang;Yingcai Wu,State Key Lab of CAD&CGZhejiang University;State Key Lab of CAD&CGZhejiang University;State Key Lab of CAD&CGZhejiang University;State Key Lab of CAD&CGZhejiang University;State Key Lab of CAD&CGZhejiang University;Department of Sport ScienceZhejiang University;Department of Sport ScienceZhejiang University;State Key Lab of CAD&CGZhejiang University,"10.1109/VAST.2014.7042478,10.1109/TVCG.2016.2598432,10.1109/TVCG.2013.192,10.1109/TVCG.2012.263,10.1109/TVCG.2014.2346445,10.1109/TVCG.2018.2865126,10.1109/TVCG.2017.2744218,10.1109/TVCG.2018.2865041","Simulative Visual Analytics,Table Tennis,Design Study",0,3,48,
VAST,2019,"The Validity, Generalizability and Feasibility of Summative Evaluation Methods in Visual Analytics",10.1109/TVCG.2019.2934264,http://dx.doi.org/10.1109/TVCG.2019.2934264,353,363,J,"Many evaluation methods have been used to assess the usefulness of Visual Analytics (VA) solutions. These methods stem from a variety of origins with different assumptions and goals, which cause confusion about their proofing capabilities. Moreover, the lack of discussion about the evaluation processes may limit our potential to develop new evaluation methods specialized for VA. In this paper, we present an analysis of evaluation methods that have been used to summatively evaluate VA solutions. We provide a survey and taxonomy of the evaluation methods that have appeared in the VAST literature in the past two years. We then analyze these methods in terms of validity and generalizability of their findings, as well as the feasibility of using them. We propose a new metric called summative quality to compare evaluation methods according to their ability to prove usefulness, and make recommendations for selecting evaluation methods based on their summative quality in the VA domain.",Mosab Khayat;Morteza Karimzadeh;David S. Ebert;Arif Ghafoor,Mosab Khayat;Morteza Karimzadeh;David S. Ebert;Arif Ghafoor,Purdue University;University of Colorado Boulder;Purdue University;Purdue University,"10.1109/INFVIS.2005.1532147,10.1109/TVCG.2018.2864811,10.1109/TVCG.2018.2865028,10.1109/TVCG.2017.2744818,10.1109/TVCG.2018.2864826,10.1109/TVCG.2018.2865025,10.1109/TVCG.2010.132,10.1109/TVCG.2017.2745083,10.1109/VAST.2017.8585484,10.1109/TVCG.2017.2744080,10.1109/VISUAL.2003.1250426,10.1109/TVCG.2013.126,10.1109/VAST.2017.8585505,10.1109/VAST.2009.5333878,10.1109/TVCG.2018.2864526,10.1109/TVCG.2018.2864886,10.1109/TVCG.2017.2744758,10.1109/TVCG.2018.2864843,10.1109/TVCG.2014.2346331,10.1109/TVCG.2018.2864812,10.1109/TVCG.2018.2865042,10.1109/TVCG.2018.2865051,10.1109/TVCG.2017.2744478,10.1109/TVCG.2017.2744358,10.1109/TVCG.2017.2744358,10.1109/TVCG.2017.2744898,10.1109/VAST.2006.261416,10.1109/TVCG.2012.213,10.1109/TVCG.2017.2745181,10.1109/TVCG.2018.2865044,10.1109/TVCG.2018.2864905,10.1109/VISUAL.2005.1532781,10.1109/TVCG.2018.2864844,10.1109/TVCG.2018.2864504,10.1109/TVCG.2017.2744685,10.1109/TVCG.2018.2865041,10.1109/TVCG.2018.2865026,10.1109/TVCG.2018.2864499,10.1109/TVCG.2017.2745279,10.1109/TVCG.2017.2744738,10.1109/TVCG.2018.2865020","Summative evaluation,usefulness,evaluation process,taxonomy,visual analytics",0,1,89,
VAST,2019,TopicSifter: Interactive Search Space Reduction through Targeted Topic Modeling,10.1109/VAST47406.2019.8986922,http://dx.doi.org/10.1109/VAST47406.2019.8986922,35,45,C,"Topic modeling is commonly used to analyze and understand large document collections. However, in practice, users want to focus on specific aspects or “targets” rather than the entire corpus. For example, given a large collection of documents, users may want only a smaller subset which more closely aligns with their interests, tasks, and domains. In particular, our paper focuses on large-scale document retrieval with high recall where any missed relevant documents can be critical. A simple keyword matching search is generally not effective nor efficient as 1) it is difficult to find a list of keyword queries that can cover the documents of interest before exploring the dataset, 2) some documents may not contain the exact keywords of interest but may still be highly relevant, and 3) some words have multiple meanings, which would result in irrelevant documents included in the retrieved subset. In this paper, we present TopicSifter, a visual analytics system for interactive search space reduction. Our system utilizes targeted topic modeling based on nonnegative matrix factorization and allows users to give relevance feedback in order to refine their target and guide the topic modeling to the most relevant results.",Hannah Kim;Dongjin Choi;Barry L. Drake;Alex Endert;Haesun Park,Hannah Kim;Dongjin Choi;Barry Drake;Alex Endert;Haesun Park,Georgia Institute of Technology;Georgia Institute of Technology;Georgia Tech Research Institute;Georgia Institute of Technology;Georgia Institute of Technology,"10.1109/TVCG.2010.154,10.1109/TVCG.2013.212,10.1109/TVCG.2009.176,10.1109/TVCG.2014.2346433,10.1109/TVCG.2018.2864769,10.1109/INFVIS.2001.963287,10.1109/TVCG.2016.2598445,10.1109/TVCG.2012.260,10.1109/TVCG.2006.142","Human-centered computing,Visualization,Visualization application domains,Visual analytics,Information systems,Information retrieval,Users and interactive retrieval,Search interfaces",0,0,46,
VAST,2019,VASABI: Hierarchical User Profiles for Interactive Visual User Behaviour Analytics,10.1109/TVCG.2019.2934609,http://dx.doi.org/10.1109/TVCG.2019.2934609,77,86,J,"User behaviour analytics (UBA) systems offer sophisticated models that capture users' behaviour over time with an aim to identify fraudulent activities that do not match their profiles. Motivated by the challenges in the interpretation of UBA models, this paper presents a visual analytics approach to help analysts gain a comprehensive understanding of user behaviour at multiple levels, namely individual and group level. We take a user-centred approach to design a visual analytics framework supporting the analysis of collections of users and the numerous sessions of activities they conduct within digital applications. The framework is centred around the concept of hierarchical user profiles that are built based on features derived from sessions, as well as on user tasks extracted using a topic modelling approach to summarise and stratify user behaviour. We externalise a series of analysis goals and tasks, and evaluate our methods through use cases conducted with experts. We observe that with the aid of interactive visual hierarchical user profiles, analysts are able to conduct exploratory and investigative analysis effectively, and able to understand the characteristics of user behaviour to make informed decisions whilst evaluating suspicious users and activities.",Phong H. Nguyen;Rafael Henkin;Siming Chen 0001;Natalia V. Andrienko;Gennady L. Andrienko;Olivier Thonnard;Cagatay Turkay,Phong H. Nguyen;Rafael Henkin;Siming Chen;Natalia Andrienko;Gennady Andrienko;Olivier Thonnard;Cagatay Turkay,"City, University of London;City, University of London;Fraunhofer IAIS;Fraunhofer IAISCity, University of London;Fraunhofer IAISCity, University of London;Amadeus, France;City, University of London","10.1109/TVCG.2017.2745083,10.1109/VAST.2008.4677365,10.1109/TVCG.2016.2598797","hierarchical user profiles,user behaviour analytics,visual analytics,cybersecurity",0,1,43,
VAST,2019,VASSL: A Visual Analytics Toolkit for Social Spambot Labeling,10.1109/TVCG.2019.2934266,http://dx.doi.org/10.1109/TVCG.2019.2934266,874,883,J,"Social media platforms are filled with social spambots. Detecting these malicious accounts is essential, yet challenging, as they continually evolve to evade detection techniques. In this article, we present VASSL, a visual analytics system that assists in the process of detecting and labeling spambots. Our tool enhances the performance and scalability of manual labeling by providing multiple connected views and utilizing dimensionality reduction, sentiment analysis and topic modeling, enabling insights for the identification of spambots. The system allows users to select and analyze groups of accounts in an interactive manner, which enables the detection of spambots that may not be identified when examined individually. We present a user study to objectively evaluate the performance of VASSL users, as well as capturing subjective opinions about the usefulness and the ease of use of the tool.",Mosab Khayat;Morteza Karimzadeh;Jieqiong Zhao;David S. Ebert,Mosab Khayat;Morteza Karimzadeh;Jieqiong Zhao;David S. Ebert,Purdue University;University of Colorado Boulder;Purdue University;Purdue University,"10.1109/TVCG.2015.2467196,10.1109/VAST.2012.6400557,10.1109/VAST.2016.7883510,10.1109/TVCG.2017.2745083,10.1109/TVCG.2017.2745080,10.1109/TVCG.2013.153,10.1109/TVCG.2014.2346920","Spambot,Labeling,Detection,Visual Analytics,Social Media Annotation",0,1,46,
VAST,2019,Visual Analytics for Electromagnetic Situation Awareness in Radio Monitoring and Management,10.1109/TVCG.2019.2934655,http://dx.doi.org/10.1109/TVCG.2019.2934655,590,600,J,"Traditional radio monitoring and management largely depend on radio spectrum data analysis, which requires considerable domain experience and heavy cognition effort and frequently results in incorrect signal judgment and incomprehensive situation awareness. Faced with increasingly complicated electromagnetic environments, radio supervisors urgently need additional data sources and advanced analytical technologies to enhance their situation awareness ability. This paper introduces a visual analytics approach for electromagnetic situation awareness. Guided by a detailed scenario and requirement analysis, we first propose a signal clustering method to process radio signal data and a situation assessment model to obtain qualitative and quantitative descriptions of the electromagnetic situations. We then design a two-module interface with a set of visualization views and interactions to help radio supervisors perceive and understand the electromagnetic situations by a joint analysis of radio signal data and radio spectrum data. Evaluations on real-world data sets and an interview with actual users demonstrate the effectiveness of our prototype system. Finally, we discuss the limitations of the proposed approach and provide future work directions.",Ying Zhao 0001;Xiaobo Luo;Xiaoru Lin;Hairong Wang;Xiaoyan Kui;Fangfang Zhou;Jinsong Wang;Yi Chen 0007;Wei Chen 0001,Ying Zhao;Xiaobo Luo;Xiaoru Lin;Hairong Wang;Xiaoyan Kui;Fangfang Zhou;Jinsong Wang;Yi Chen;Wei Chen,"School of Computer Science and Engineering, Central South University, Changsha, China;School of Computer Science and Engineering, Central South University, Changsha, China;School of Computer Science and Engineering, Central South University, Changsha, China;School of Automation, Central South University, Changsha, China;School of Computer Science and Engineering, Central South University, Changsha, China;School of Computer Science and Engineering, Central South University, Changsha, China;Southwest Electric & Telecom Engineering Institute, Shanghai, China;Beijing Key Laboratory of Big Data Technology for Food Safety, Beijing Technology and Business University, Beijing, China;State Key Lab of CAD & CG, Zhejiang University, Hangzhou, China","10.1109/TVCG.2018.2865028,10.1109/TVCG.2016.2598619,10.1109/TVCG.2008.166,10.1109/TVCG.2015.2467196,10.1109/VAST.2014.7042479,10.1109/TVCG.2016.2598460,10.1109/TVCG.2011.239,10.1109/TVCG.2014.2346433,10.1109/TVCG.2017.2745180,10.1109/TVCG.2018.2865077,10.1109/TVCG.2018.2865029,10.1109/TVCG.2010.193,10.1109/TVCG.2014.2346911,10.1109/TVCG.2011.179,10.1109/TVCG.2013.196,10.1109/INFVIS.2005.1532134,10.1109/TVCG.2014.2346926,10.1109/TVCG.2017.2744459,10.1109/TVCG.2013.228,10.1109/TVCG.2017.2744098,10.1109/TVCG.2014.2346913,10.1109/TVCG.2016.2598664,10.1109/TVCG.2018.2865020,10.1109/TVCG.2018.2864503","Radio monitoring and management,radio signal data,radio spectrum data,situation awareness,visual analytics",0,3,77,
Vis,1990,Techniques for visualizing Fermat's last theorem: a case study,10.1109/VISUAL.1990.146370,http://dx.doi.org/10.1109/VISUAL.1990.146370,97,"106, 467-8",C,"The authors describe some mathematical approaches and computer graphics techniques for illustrating concepts related to Fermat's last theorem. They present a selection of visualization methods, and describe observations made in the process of creating a three-minute computer animated videotape dealing with some elementary aspects of Fermat's last theorem, a problem in number theory. The approach to the representation of the different concepts presented in the video was influenced by many factors: the available hardware, real and perceived constraints of the available software, constraints imposed by the video medium, and a number of peculiarities and features of the mathematical domain itself. The authors describe the experiences with the software systems that played a part in these efforts, some specific successful visualization techniques, and some unexpected mathematical insights.&lt;&lt;ETX&gt;&gt;",Andrew J. Hanson;Pheng-Ann Heng;B. C. Kaplan,A.J. Hanson;P.A. Heng;B.C. Kaplan,"Indiana Univ., Bloomington, IN, USA;Indiana Univ., Bloomington, IN, USA;Indiana Univ., Bloomington, IN, USA",,,,2,5,
Vis,1990,A methodology for scientific data visualisation: choosing representations based on a natural scene paradigm,10.1109/VISUAL.1990.146372,http://dx.doi.org/10.1109/VISUAL.1990.146372,114,123,C,"A methodology for guiding the choice of visual representations of data is presented. The methodology provides objective and directed display design facilities. Such facilities can guide interactive visualization design, generate standard visualizations automatically, and assess the extent to which chosen representations can convey the required information to data analysis. The methodology is based on objectively distinguishing the types of information conveyed by various visual representations and matching these to the intrinsic characteristics of data and to aims for its interpretation. This approach is directed toward developing a stronger theoretical basis for visualization in scientific computation. The methodology is developed using a natural scene paradigm in which data variables are represented by identifiable properties of realistic scenes.&lt;&lt;ETX&gt;&gt;",Philip K. Robertson,P.K. Robertson,"CSIRO, Canberra, ACT, Australia",,,,12,21,
Vis,1990,Visualization and three-dimensional image processing of positron emission tomography (PET) brain images,10.1109/VISUAL.1990.146376,http://dx.doi.org/10.1109/VISUAL.1990.146376,144,"149, 469",C,"The author applied image processing and volume rendering algorithms together with considerations on the physiology of the human visual system to improve the quality of perception of the information contained in positron emission tomography (PET) brain images, and to highlight the existing anatomical information. The psychophysical considerations for selecting color and brightness level are used to visualize functional and anatomical structures in three dimensions. One is able to perceive in the images the levels of rates of glucose metabolism of regions in the brain and their relative locations. In addition, some of the anatomic structures, such as the interhemispheric fissure, the caudate nucleus, and the thalamus, are apparent.&lt;&lt;ETX&gt;&gt;",Nahum D. Gershon,N.D. Gershon,"MITRE Corp., McLean, VA, USA",,,,5,5,
Vis,1990,Visualization for the information age,10.1109/VISUAL.1990.146414,http://dx.doi.org/10.1109/VISUAL.1990.146414,429,,C,"Summary form only given. The basic parameters of current TV, the origins of HDTV, and the various types of TV systems being proposed in Japan, America and Europe are reviewed. Available HDTV hardware, new applications that this hardware enables, and the economics involved are discussed. How HDTV fits into the film and television industries from the perspectives of production, distribution, and creativity, HDTV's demands upon telecommunications, and why data compression plays a critical role have been examined. The evolution of the present workstation from many analytical perspectives, leading up to the most recent product introductions of all the major vendors, developments in accelerator boards and interactive graphics peripherals, and the evolution of the man/machine interface are discussed.&lt;&lt;ETX&gt;&gt;",Laurin Herr,L. Herr,"Pacific Interface, New York, NY, USA",,,,0,0,
Vis,1990,Case study in scientific visualization: factors inducing periodic breathing in humans with blunted hypoxic sensitivity,10.1109/VISUAL.1990.146415,http://dx.doi.org/10.1109/VISUAL.1990.146415,430,434,C,"The problem of presenting and gaining deeper understanding of a multidimensional system, a mathematical model Predicting 20-90 s oscillations in breathing, is presented. The authors utilized custom software for interactive analysis of a three-dimensional model, plus Wavefront software to render translucent images of the 3D surfaces. The results show that under conditions of no peripheral chemosensor sensitivity, periodic breathing is predicted to occur with (1) an increase in circulatory transit time between the lungs and brain, (2) the presence of marked steady state hypoventilation, and/or (3) an increase in brain blood flow rate. It is concluded that the peripheral chemosensors (carotid bodies) are not essential for the development of periodic breathing.&lt;&lt;ETX&gt;&gt;",Wayne E. Fordyce;Jeffrey Ventrella,W.E. Fordyce;J.J. Ventrella,"Res. Comput. Services, Syracuse Univ., NY, USA;Res. Comput. Services, Syracuse Univ., NY, USA",,,,1,10,
Vis,1991,Scientific visualization from inside the metacomputer,10.1109/VISUAL.1991.175767,http://dx.doi.org/10.1109/VISUAL.1991.175767,2,,M,"Summary form only given, as follows. Historically, scientific visualization has been carried out in two primary modes: interactive on desktop computers, and batch on high-performance computers. The next decade will see a merging of these two approaches with the advent of high-speed networking. The networking is hierarchical in speed from Ethernet to FDDI to HiPPI. This network effectively unites desktop computers with higher-value remote resources into a single metacomputer. To take advantage of this new hardware configuration, distributed visualization software is being developed which allows the flexibility of the local workstation to be coupled with the computing power of distant supercomputers. Examples are discussed for 2D raster graphics and 3D rendered surface and volumetric graphics. These new capabilities are having a remarkable impact on computational science.&lt;&lt;ETX&gt;&gt;",Larry L. Smarr,L.L. Smarr,"Nato Centre for Supercomput. Appls., Champaign, IL, USA",,,,1,0,
Vis,1991,Realistic volume imaging,10.1109/VISUAL.1991.175805,http://dx.doi.org/10.1109/VISUAL.1991.175805,226,"231, 425",C,"A set of volume visualization tools that are based on the use of recursive ray tracing as the primary vehicle for realistic volume imaging is presented. The tools include shadows, mirrors, specularity, and constructive solid geometry. The underlying representation for the ray tracer is a 3-D raster of voxels that holds the discrete form of the scene. Unlike traditional volume rendering techniques, the discrete recursive ray tracer models many illumination phenomena by traversing discrete rays in voxel space. The approach provides true ray tracing of sampled or computed datasets, as well as ray tracing of hybrid scenes where sampled or computed data are intermixed with geometric models and enhances the understanding of complex biomedical datasets.&lt;&lt;ETX&gt;&gt;",Roni Yagel;Arie E. Kaufman;Qiang Zhang,R. Yagel;A. Kaufman;Q. Zhang,"Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA;Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA",,,,11,24,
Vis,1991,A fast ray tracing casting algorithm using adaptive isotriangular subdivision,10.1109/VISUAL.1991.175806,http://dx.doi.org/10.1109/VISUAL.1991.175806,232,"238, 426",C,"The use of ray casting in volume rendering and its uses and advantages over surface rendering algorithms are discussed. Various adaptive algorithms that attempt to overcome its problem of high computational cost by taking advantage of image coherency and the bandlimited nature of volume data are described. A method of subdividing the image plane with isosceles triangles, instead of quadrants as is usually done is proposed. It results in fewer rays being fired without sacrificing image quality. A brief theoretical analysis of the algorithm in comparison with other methods is given.&lt;&lt;ETX&gt;&gt;",Renben Shu;Alan Liu,R. Shu;A. Liu,"Inst. of Syst. Sci., Nat. Univ. of Singapore, Kent Ridge, Singapore;Inst. of Syst. Sci., Nat. Univ. of Singapore, Kent Ridge, Singapore",,,,6,13,
Vis,1991,Applying 3D visualization techniques to finite element analysis,10.1109/VISUAL.1991.175823,http://dx.doi.org/10.1109/VISUAL.1991.175823,330,335,M,"Addresses 3D visualization techniques now being developed that are specific to coarse, irregular grid fields such as finite-element models. These include direct-generation of isovalues from finite elements, display of 3D gradient and tensor quantities, and the display of multiple states of behavior, items common to general 3D visualization, but with specific algorithmic and implementation issues in finite element analysis.&lt;&lt;ETX&gt;&gt;",Richard S. Gallagher;Robert B. Haber;Gordon Ferguson;David Parker;Douglas W. Stillman;James Winget,R.S. Gallagher;R.B. Haber;G. Ferguson;D. Parker;D. Stillman;J. Winget,,,,,3,12,
Vis,1991,Color vs. black-and-white in visualization,10.1109/VISUAL.1991.175824,http://dx.doi.org/10.1109/VISUAL.1991.175824,336,339,M,"Addresses the issue of the use of color, as compared to monochromatic displays, in visualization. The paper presents the advantages and disadvantages of color displays, and those of monochromic displays, identifies situations where color can improve the representation, those where it will degrade it, and suggest guidelines on how (and when) to use color.&lt;&lt;ETX&gt;&gt;",Haim Levkowitz;Richard A. Holub;Gary W. Meyer;Philip K. Robertson,H. Levkowitz;R.A. Holub;G.W. Meyer;P.K. Robertson,"Inst. for Visualization & Perception Res., Lowell Univ., MA, USA",,,,2,0,
Vis,1991,Remote visualization: challenges and opportunities,10.1109/VISUAL.1991.175825,http://dx.doi.org/10.1109/VISUAL.1991.175825,340,344,M,"This paper emphasizes the need for and importance of remote visualization. The potential impact of remote visualization on application algorithms, communication protocols, and underlying networks is assessed. Opportunities for research and development to support remote visualization in the context of the National Research and Education network are outlined.&lt;&lt;ETX&gt;&gt;",Guru M. Parulkar;Jack Bowie;Hans-Werner Braun;Roch Guerin;Daniel Stevenson,G.M. Parulkar;J. Bowie;H.-W. Braun;R. Guerin;D. Stevenson,"Washington Univ., St. Louis, WA, USA",,,,1,0,
Vis,1991,How visualization applications drive tool selection: one product can't do it all,10.1109/VISUAL.1991.175826,http://dx.doi.org/10.1109/VISUAL.1991.175826,345,347,M,This paper looks at the role visualization and visual data analysis play in the technical community. It focuses on the premise that the wide variety of applications of visualization mandate a need for a variety of visualization software packages.&lt;&lt;ETX&gt;&gt;,D. Prawel;M. Brown;C. Harris;R. Kriz;M. Vigil,D. Prawel;M. Brown;C. Harris;R. Kriz;M. Vigil,,,,,0,0,
Vis,1991,Multimedia environments for scientists,10.1109/VISUAL.1991.175827,http://dx.doi.org/10.1109/VISUAL.1991.175827,348,353,M,"This paper addresses the question of how the work of the scientist will change in the new multimedia environments. Scenarios for the process of simulating and analyzing data in such environments are constructed, and some of the underlying models used in their construction are examined.&lt;&lt;ETX&gt;&gt;",Meera M. Blattner;Georges Grinstein;Ephraim P. Glinert;William Hill;Creon Levit;Stuart Smith,M.M. Blattner;G. Grinstein;E.P. Glinert;W. Hill;C. Levit;S. Smith,,,,,3,17,
Vis,1991,Volume visualization comes of age: the state of the art in technology and application,10.1109/VISUAL.1991.175828,http://dx.doi.org/10.1109/VISUAL.1991.175828,354,357,M,"This paper examines the role of experimental design, data acquisition equipment, and system integration in the holistic solution picture. Issues include data formats, distributed computing environments, and the need for truly interactive, even real-time systems. A major theme is reaching beyond volume visualization to 'volume comprehension' through volume segmentation, mensuration, and geometry extraction.&lt;&lt;ETX&gt;&gt;",Vincent Argiro;Mary Whitton;Alan Evans;Wulf Massell;Stephen Paddock;Elliot Fishman,V. Argiro;M. Whitton;A. Evans;W. Massell;S. Paddock;E. Fishman,,,,,0,4,
Vis,1991,"Distributed visualization using workstations, supercomputers, and high speed networks",10.1109/VISUAL.1991.175834,http://dx.doi.org/10.1109/VISUAL.1991.175834,379,382,C,"A collaboration designed to demonstrate the possibilities of access to supercomputers via the high-speed wide-area networks in order to carry out sophisticated, interactive visualization on local workstations is described. The test case was visualization of 3D magnetic resonance imaging data, with a Vray performing surface reconstruction to generate a set of triangles. The resulting geometric data was sent to a local workstation to be rendered, with minor enhancements to current network protocols enabling effective utilization of the 45 Mb bandwidth of a T3-based network.&lt;&lt;ETX&gt;&gt;",David W. Robertson;Van L. Jacobson;William E. Johnston;Stewart C. Loken;Edward H. Theil;Brian L. Tieney,D.W. Robertson;V.L. Jacobson;W.E. Johnston;S.C. Loken;E.H. Theil;B.L. Tierney,"Lawrence Berkeley Lab., California Univ., Berkeley, CA, USA;Lawrence Berkeley Lab., California Univ., Berkeley, CA, USA;Lawrence Berkeley Lab., California Univ., Berkeley, CA, USA;Lawrence Berkeley Lab., California Univ., Berkeley, CA, USA;Lawrence Berkeley Lab., California Univ., Berkeley, CA, USA;Lawrence Berkeley Lab., California Univ., Berkeley, CA, USA",,,,2,4,
Vis,1992,Visualizing a three dimensional hydrodynamic model,10.1109/VISUAL.1992.235173,http://dx.doi.org/10.1109/VISUAL.1992.235173,441,445,C,"A three-dimensional finite-element hydrodynamic model was constructed to simulate tidal cycles in Galveston Bay over a one-year period in order to view changes in water velocities and salinity. A project undertaken to visualize the simulation results is reported. The project comprised analyzing model requirements and determining suitable visualization techniques, visualizing a preliminary, smaller-scale model to verify the techniques; and visualizing the full-scale model. Problems encountered and resolutions of problems at each stage are described. Validation, as well as insights revealed about the model through the preliminary and final visualization, are discussed. Current application of visualization techniques to the model is reported.&lt;&lt;ETX&gt;&gt;",C. S. Jones;J. A. Baca,C.S. Jones;J.A. Baca,"USACE Waterways Exp. Station, Vicksburg, MS, USA;USACE Waterways Exp. Station, Vicksburg, MS, USA",,,,0,6,
Vis,1992,Case study: visualizing classical problems in CFD,10.1109/VISUAL.1992.235174,http://dx.doi.org/10.1109/VISUAL.1992.235174,436,440,C,"A brief example of the visualization and quantification of a complex fluid interaction is presented in order to give one a feeling for the difficulty of dealing with geometrical and topological questions in three dimensions and time. To obtain a quantitative understanding, visiometric techniques, including thresholding, object isolation, ellipsoid fitting, abstraction, vector field line generation and data juxtaposition, were used.&lt;&lt;ETX&gt;&gt;",Norman J. Zabusky;Deborah Silver,N. Zabusky;D. Silver,"Rutgers Univ., Piscataway, NJ, USA;Rutgers Univ., Piscataway, NJ, USA",10.1109/VISUAL.1991.175770;10.1109/VISUAL.1991.175773,,,3,14,
Vis,1992,Visualization of cardiac bioelectricity-a case study,10.1109/VISUAL.1992.235178,http://dx.doi.org/10.1109/VISUAL.1992.235178,411,418,C,"A project in the field of computational electrocardiography which requires visualization of complex, three-dimensional geometry and electric potential and current fields is described. Starting from magnetic resonance images (MRIs) from a healthy subject, a multisurfaced model of the human thorax was constructed and used as the basis for computational studies relating potential distributions measured from the surface of the heart to potentials and currents throughout the volume of the thorax (a form of the forward problem in electrocardiography). Both interactive and batch-mode graphics programs were developed to view, manipulate, and interactively edit the model geometry. Results are presented.&lt;&lt;ETX&gt;&gt;",Robert S. MacLeod;N. E. Harrison;Christopher R. Johnson 0001;Michael A. Matheson,R.S. MacLeod;C.R. Johnson;M.A. Matheson,"Utah Univ., Salt Lake City, UT, USA;Utah Univ., Salt Lake City, UT, USA;Utah Univ., Salt Lake City, UT, USA",,,,10,10,
Vis,1992,Visualization in anthropology: reconstruction of human fossils from multiple pieces,10.1109/VISUAL.1992.235179,http://dx.doi.org/10.1109/VISUAL.1992.235179,404,410,C,"A new way of reconstructing human fossils from fragmentary fossil material is described. Unlike the traditional method of making physical models using clay, this new approach is based on geometrical modeling and visualization of digitized fossil data. It can provide anthropologists with both quantifiable, computer-based geometric models and physical plastic reconstructions of fossils.&lt;&lt;ETX&gt;&gt;",Alan D. Kalvin;David Dean;Jean-Jaques Hublin;M. Braun,A.D. Kalvin;D. Dean;J.-J. Hublin;M. Braun,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",,,,4,14,
Vis,1992,"Object-oriented, dataflow visualization system-a paradigm shift?",10.1109/VISUAL.1992.235182,http://dx.doi.org/10.1109/VISUAL.1992.235182,384,388,M,"Discusses the breadth and the effectiveness of application visualization systems (AVSs). The current and future research areas involving AVSs, drawbacks and limitations of certain application areas, possible improvements to AVSs, and alternative analysis and visualization approaches are discussed.&lt;&lt;ETX&gt;&gt;",William Ribarsky;Bob Brown;Terry Myerson;Richard Feldmann;Stuart Smith;Lloyd Treinish,W. Ribarsky;B. Brown;T. Myerson;R. Feldmann;S. Smith;L. Treinish,,,,,6,0,
Vis,1992,"Visualization in the neurosciences: utility in research, teaching, and clinical practice",10.1109/VISUAL.1992.235183,http://dx.doi.org/10.1109/VISUAL.1992.235183,380,383,M,"Discusses the uses of visualization in the field of neuroscience is reported. The applications discussed are image analysis for basic neurobiological problems, image analysis from basic to applied neurobiological problems, management of images and graphics from anatomical experiments, and visualization and analysis of multivariate electrophysiological data sets.&lt;&lt;ETX&gt;&gt;",Stuart A. Tobet;Joan C. King;Steven L. Wertheim;Frank H. Duffy,S.A. Tobet;J.C. King;S.L. Wertheim;F.H. Duffy,"E.K. Shriver Center, Harvard Program in Neurosci., Boston, MA, USA",,,,0,0,
Vis,1992,Real virtual environment applications-now,10.1109/VISUAL.1992.235184,http://dx.doi.org/10.1109/VISUAL.1992.235184,375,379,M,"Discusses efforts to develop virtual environment (VE) systems. The applications discussed are medical telesurgery, maintenance access, presence simulators, accounting visualizations, topographic visualizations and tools to assist developers in determining the value added of potential VE-based solutions.&lt;&lt;ETX&gt;&gt;",Paul T. Breen;Georges G. Grinstein;David W. Mizell;Richard M. Satava;Bradford Smith;Michael M. Stephens;David Zeltzer,P.T. Breen,,,,,0,0,
Vis,1992,Improving visualization: theoretical and empirical foundations,10.1109/VISUAL.1992.235185,http://dx.doi.org/10.1109/VISUAL.1992.235185,372,374,M,"Discusses the ways in which the understanding of visual perception could help improve the scientific visualization process. It is argued that as long as there is a human interface link to computer visualization systems, understanding how humans perceive information visually could help improve the quality and the effectiveness of the visualization process. The fields of visual physiology, psychophysics, and cognitive psychology can explain why human vision is so efficient, how to create better images, and how to determine the limitations of particular representations.&lt;&lt;ETX&gt;&gt;",Stephen M. Kosslyn;Nahum D. Gershon;Haim Levkowitz;Justin D. Pearlman,S.M. Kosslyn;N.D. Gershon;H. Levkowitz;J.D. Pearlman,"Dept. of Psychol., Harvard Univ., Cambridge, MA, USA",,,,2,0,
Vis,1992,Grand challenge problems in visualization software,10.1109/VISUAL.1992.235186,http://dx.doi.org/10.1109/VISUAL.1992.235186,366,371,M,"Discusses issues relating to the complexity of scientific visualization software system implementation. It is argued that the complexity of current implementations of such systems may limit the utility for users because the interfaces typically require significant knowledge of the data being studied and the applicable visualization algorithms, as well as its infrastructure of graphics, imaging and data handling technology. The issues, unknowns, and possible solutions associated with building effective scientific visualization software are discussed.&lt;&lt;ETX&gt;&gt;",Lloyd A. Treinish;David M. Butler;Hikmet Senay;Georges G. Grinstein;Steve T. Bryson,L.A. Treinish;D.M. Butler;H. Senay;G.G. Grinstein;S.T. Bryson,"IBM Thomas. J. Watson Res. Center, Yorktown Heights, NY, USA",,,,5,11,
Vis,1992,Techniques for managing very large scientific databases,10.1109/VISUAL.1992.235187,http://dx.doi.org/10.1109/VISUAL.1992.235187,362,365,M,"Discusses issues relating to the state of the art in scientific data management. Management of scientific data sets or databases is reviewed. The generic science requirements, as well as a case example that drives the underlying data management system architecture are explored, showing current technology limitations. A concept of intelligent information fusion with sufficient detail on how to integrate advanced technologies to enhance scientific production, is presented. Emphasis is on user interfaces, spatial data structure, uses of neural networks for extracting information from scientific imagery, uses of object-oriented database management systems, animation, and visualization techniques.&lt;&lt;ETX&gt;&gt;",William J. Campbell;George Fekete;Robert F. Cromp;Ray Wall;Michael Goldberg,W.J. Campbell;R.F. Cromp;G. Fekete;R. Wall;M. Goldberg,,,,,4,0,
Vis,1992,Visualizing n-dimensional implications of two-dimensional design decisions,10.1109/VISUAL.1992.235188,http://dx.doi.org/10.1109/VISUAL.1992.235188,356,360,C,"Experiments in visualizing implications of landscape planning and design decisions using a combination of GIS, CAD, and video animation technology are described. Simple grid-cell GIS databases and site-scale polygonal models are used to provide visualizations of site planning design proposals and environmental impact, with both static and animated images. Rather than pursuing photo-realistic simulations, the focus is on how abstractions and representational conventions can be used to gauge visual and environmental effects of proposals for landscape change, in a dynamic interactive computer-aided design environment.&lt;&lt;ETX&gt;&gt;",Stephen M. Ervin,S.M. Ervin,"Dept. of Landscape Archit., Harvard Univ., Graduate Sch. of Design, Cambridge, MA, USA",,,,2,10,
Vis,1992,"Visualization of high resolution, three-dimensional, nonlinear finite element analyses",10.1109/VISUAL.1992.235192,http://dx.doi.org/10.1109/VISUAL.1992.235192,324,331,C,"A two-pass surface extraction algorithm for adaptive finite-element meshes is presented in the context of a visualization study for a particle impact and a turbine-blade containment problem. The direct use of finite-element data structures for the computation of external surfaces, surface normals, and derived physical qualities is discussed. An overview of the in-betweening which accounts for rigid body dynamics effects is presented, with a brief discussion of a direct-to-videodisk animation strategy.&lt;&lt;ETX&gt;&gt;",Mark A. Christon;T. Spelce,M.A. Christon;T. Spelce,"Lawrence Livermore Nat. Lab., CA, USA;Lawrence Livermore Nat. Lab., CA, USA",,,,1,10,
Vis,1993,Texture splats for 3D scalar and vector field visualization,10.1109/VISUAL.1993.398877,http://dx.doi.org/10.1109/VISUAL.1993.398877,261,266,C,"Volume visualization is becoming an important tool for understanding large 3D data sets. A popular technique for volume rendering is known as splatting. With new hardware architectures offering substantial improvements in the performance of rendering texture mapped objects, we present textured splats. An ideal reconstruction function for 3D signals is developed which can be used as a texture map for a splat. Extensions to the basic splatting technique are then developed to additionally represent vector fields.&lt;&lt;ETX&gt;&gt;",Roger Crawfis;Nelson L. Max,R.A. Crawfis;N. Max,"Lawrence Livermore Nat. Lab., Livermore, CA, USA;Lawrence Livermore Nat. Lab., Livermore, CA, USA",,,,79,6,TT;BP
Vis,1993,Developing modular application builders to exploit MIMD parallel,10.1109/VISUAL.1993.398861,http://dx.doi.org/10.1109/VISUAL.1993.398861,134,141,C,"Modular application builders (MABs), such as AVS and Iris Explorer are increasingly being used in the visualization community. Such systems can already place compute intensive modules on supercomputers in order to utilize their power. This paper details two major projects at EPCC which attempted to fully integrate the MAB concept with a distributed memory MIMD (DM-MIMD) environment. The work presented was driven by two goals, efficient use of the resource and case of use by programmer and end user. We present a model of MABs and describe the major problems faced, giving solutions to them through two case studies.&lt;&lt;ETX&gt;&gt;",C. Thornborrow;A. J. S. Wilson;Chris Faigle,C. Thornborrow;A.J.S. Wilson;C. Faigle,"Edinburgh Parallel Comput. Centre, Edinburgh Univ., UK;Edinburgh Parallel Comput. Centre, Edinburgh Univ., UK;Edinburgh Parallel Comput. Centre, Edinburgh Univ., UK",,,,2,10,
Vis,1993,Towards a texture naming system: Identifying relevant dimensions of texture,10.1109/VISUAL.1993.398872,http://dx.doi.org/10.1109/VISUAL.1993.398872,220,227,C,"Recently, researchers have started using texture for data visualization. The rationale behind this is to exploit the sensitivity of the human visual system to texture in order to overcome the limitations inherent in the display of multidimensional data. A fundamental issue that must be addressed is what textural features are important in texture perception, and how they are used. We designed an experiment to help identify the relevant higher order features of texture perceived by humans. We used twenty subjects, who were asked to rate 56 pictures from Brodatz's album on 12 nine-point Likert scales. We applied the techniques of hierarchical cluster analysis, non-parametric multidimensional scaling (MDS), classification and regression tree analysis (CART), discriminant analysis, and principal component analysis to data gathered from the subjects. Based on these techniques, we identified three orthogonal dimensions for texture to be repetitive vs. non-repetitive; high-contrast and non-directional vs. low-contrast and directional; granular, coarse and low-complexity vs. non-granular, fine and high-complexity.&lt;&lt;ETX&gt;&gt;",A. Ravishankar Rao;Gerald L. Lohse,A.R. Rao;G.L. Lohse,"IBM T.J. Watson Res. Center, Yorktown Heights, NY, USA;IBM T.J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.1990.146374,,,45,17,
Vis,1993,Cloud tracing in convection-diffusion systems,10.1109/VISUAL.1993.398876,http://dx.doi.org/10.1109/VISUAL.1993.398876,253,260,C,"The paper describes a highly interactive method for computer visualization of simultaneous three-dimensional vector and scalar flow fields in convection-diffusion systems. This method allows a computational fluid dynamics user to visualize the basic physical process of dispersion and mixing rather than just the vector and scalar values computed by the simulation. It is based on transforming the vector field from a traditionally Eulerian reference frame into a Lagrangian reference frame. Fluid elements are traced through the vector field for the mean path as well as the statistical dispersion of the fluid elements about the mean position by using added scalar information about the root mean square value of the vector field and its Lagrangian time scale. In this way, clouds of fluid elements are traced not just mean paths. We have used this method to visualize the simulation of an industrial incinerator to help identify mechanisms for poor mixing.&lt;&lt;ETX&gt;&gt;",Kwan-Liu Ma;Philip J. Smith,K.-L. Ma;P.J. Smith,"NASA Langley Res. Center, Hampton, VA, USA;NASA Langley Res. Center, Hampton, VA, USA",10.1109/VISUAL.1992.235210;10.1109/VISUAL.1991.175770;10.1109/VISUAL.1991.175773;10.1109/VISUAL.1992.235211;10.1109/VISUAL.1992.235227;10.1109/VISUAL.1992.235174;10.1109/VISUAL.1991.175789,,,7,18,
Vis,1993,Fast analytical computation of Richard's smooth molecular surface,10.1109/VISUAL.1993.398882,http://dx.doi.org/10.1109/VISUAL.1993.398882,300,307,C,"An algorithm for rapid computation of Richards's smooth molecular surface is described. The entire surface is computed analytically, triangulated, and displayed at interactive rates. The faster speeds for our program have been achieved by algorithmic improvements, paralleling the computations, and by taking advantage of the special geometrical properties of such surfaces. Our algorithm is easily parallelable and it has a time complexity of O (k log k) over n processors, where n is the number of atoms of the molecule and k is the average number of neighbors per atom.&lt;&lt;ETX&gt;&gt;",Amitabh Varshney;Frederick P. Brooks Jr.,A. Varshney;F.P. Brooks,"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA;Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA",,,,7,19,
Vis,1993,Visualization of oil reservoirs over a large range of scales as a catalyst for multi-disciplinary integration,10.1109/VISUAL.1993.398893,http://dx.doi.org/10.1109/VISUAL.1993.398893,366,369,C,"We discuss a system which provides a single, unified model of oil and gas reservoirs that is used across a range of disciplines from geologists to reservoir engineers. It has to store, manipulate and display reservoir phenomena which are observed over several orders of magnitude from 1 mm to 10 km. We propose that the current capabilities of visualization, over this range of scales, can remove perception barriers that have existed between disciplines and provide clear insights into the problems of modeling reservoirs from geological and engineering perspectives.&lt;&lt;ETX&gt;&gt;",S. Tyson;B. Williams,S. Tyson;B. Williams,"Santos Ltd., Australia;Santos Ltd., Australia",,,,1,14,
Vis,1993,"Unsteady phenomena, hypersonic flows and co-operative flow visualization in aerospace research",10.1109/VISUAL.1993.398894,http://dx.doi.org/10.1109/VISUAL.1993.398894,370,373,C,"Some techniques developed recently at DLR's Institute of Theoretical Fluid Mechanics in order to cope with the demands arising from today's work in aerodynamics are illustrated. Such new demands arise from new aerodynamical problems like the hypersonic flow field around re-entry vehicles, the study of unsteady phenomena which comes more and more within reach due to the increased availability of computing power and the tendency towards enhanced international cooperation especially within Europe which calls for the use of co-operative systems on wide area networks.&lt;&lt;ETX&gt;&gt;",Hans-Georg Pagendarm,H.-G. Pagendarm,"German Aerosp. Res. Establishment, Gottingen, Germany",,,,4,7,
Vis,1994,Visualization of 3D ultrasonic data,10.1109/VISUAL.1994.346294,http://dx.doi.org/10.1109/VISUAL.1994.346294,369,"373, C42",C,"3D ultrasound is one of the most interesting non-invasive, non-radiative tomographic techniques. Rendering 3D models from such data is not straightforward due to the noisy, fuzzy nature of ultrasound imaging containing a lot of artefacts. We first apply speckle, median and gaussian prefiltering to improve the image quality. Using several semi-automatic segmentation tools we isolate interesting features within a few minutes. Our improved surface-extraction procedure enables volume rendering of high quality within a few seconds on a normal workstation, thus making the complete system suitable for routine clinical applications.&lt;&lt;ETX&gt;&gt;",Georgios Sakas;Lars-Arne Schreyer;Marcus Grimm,G. Sakas;L.-A. Schreyer;M. Grimm,"Fraunhofer-Inst. for Comput. Graphics, Darmstadt, Germany;Fraunhofer-Inst. for Comput. Graphics, Darmstadt, Germany;Fraunhofer-Inst. for Comput. Graphics, Darmstadt, Germany",10.1109/VISUAL.1992.235228,,,4,10,BCS
Vis,1994,"Validation, verification and evaluation",10.1109/VISUAL.1994.346285,http://dx.doi.org/10.1109/VISUAL.1994.346285,414,418,M,"A discussion is given on the validation, verification and evaluation of scientific visualization software. A ""bug"" usually refers to software doing something different than the programmer intended. Comprehensive testing, especially for software intended for use in innovative environments, is hard. Descriptions and summaries of the tests we have done are often not available to the users. A different source of visualization errors is software that does something different than what the scientist thinks it does. The particular methods used to compute values in the process of creating visualizations are important to the scientists, but vendors are understandably reluctant to reveal all the internals of their products. Is there a workable compromise? Another vulnerability of visualization users is in the choice of a technique which is less effective than others equally available. Visualization researchers and developers should give users the information required to make good decisions about competing visualization techniques. What information is needed? What will it take to gather and distribute it? How should it be tied to visualization software?.&lt;&lt;ETX&gt;&gt;",Samuel P. Uselton;Geoff Dorn;Charbel Farhat;Michael W. Vannier;Kim H. Esbensen;Al Globus,S. Uselton;G. Dorn;C. Farhat;M. Vannier;K. Esbensen;A. Globus,"NASA Ames Res. Center, Moffett Field, CA, USA",,,,4,0,
Vis,1994,Visualizing data: is virtual reality the key?,10.1109/VISUAL.1994.346286,http://dx.doi.org/10.1109/VISUAL.1994.346286,410,413,M,"A visualization goal is to simplify the analysis of large-quantity, numerical data by rendering the data as an image that can be intuitively manipulated. The question the article addresses is whether or not virtual reality techniques are the cure-all to the dilemma of visualizing increasing amounts of data. It determines the usefulness of techniques available today and in the near future that will ease the problem of visualizing complex data. In regards to visualization, the article discusses characteristics of virtual reality systems, data in three-dimensional environments, augmented reality, and virtual reality market opportunities.&lt;&lt;ETX&gt;&gt;",Linda M. Stone;Thomas Erickson;Benjamin B. Bederson;Peter Rothman;Raymond Muzzy,L.M. Stone;T. Erickson;B.B. Bederson;P. Rothman;R. Muzzy,"LORAL Space & Range Syst., Sunnyvale, CA, USA",,,,1,22,
Vis,1994,Visualizing multidimensional (multivariate) data and relations,10.1109/VISUAL.1994.346287,http://dx.doi.org/10.1109/VISUAL.1994.346287,404,409,M,"The paper provides a review of the field of multidimensional data visualisation and discusses some promising methodologies. It considers some crucial problems and directions. The emphasis is more on concepts and foundations rather than ad hoc methods. Visualization is considered as a collection of transformations from problem domains to a perceptual domain, usually visual. The paper discusses the extension of visualisation from the pixel to icons.&lt;&lt;ETX&gt;&gt;",Alfred Inselberg;Georges G. Grinstein;Ted Mihalisin;Hans Hinterberger,A. Inselberg;C. Grinstein;T. Mihalisin;H. Hinterberger,"Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA",,,,0,29,
Vis,1994,Visualization in medicine: VIRTUAL reality or ACTUAL reality ?,10.1109/VISUAL.1994.346288,http://dx.doi.org/10.1109/VISUAL.1994.346288,396,399,M,Discusses and debates the role played by 3D visualization in medicine as a set of methods and techniques for displaying 3D spatial information related to the anatomy and the physiology of the human body.&lt;&lt;ETX&gt;&gt;,Christian Roux;Jean-Louis Coatrieux;Jean-Louis Dillenseger;Elliot K. Fishman;Murray H. Loew;Hans-Peter Meinzer;Justin D. Pearlman,C. Roux;J.L. Coatrieux;J.-L. Dillenseger;E.K. Fishman;M. Loew;H.-P. Meinzer;J.D. Pearlman,"Dept. Image et Traitement de l'Inf., Ecole Nat. Superieure des Telecommun. de Bretagne, Brest, France",,,,1,3,
Vis,1994,Visualization of an electric power transmission system,10.1109/VISUAL.1994.346292,http://dx.doi.org/10.1109/VISUAL.1994.346292,379,"381, C44",C,"Visualization techniques are applied to an electric power system transmission network to create a graphical picture of network power flows and voltages. A geographic data map is used. Apparent power flow is encoded as the width of an arrow, with direction from real power flow. Flows are superposed on flow limits. Contour plots and color coding failed for representing bus voltages. A two-color thermometer encoding worked well. The resulting visualization is a significant improvement over current user interface practice in the power industry.&lt;&lt;ETX&gt;&gt;",Pramod M. Mahadev;Richard D. Christie,P.M. Mahadev;R.D. Christie,"Dept. of Electr. Eng., Washington Univ., Seattle, WA, USA;Dept. of Electr. Eng., Washington Univ., Seattle, WA, USA",,,,3,6,
Vis,1994,New techniques in the design of healthcare facilities,10.1109/VISUAL.1994.346293,http://dx.doi.org/10.1109/VISUAL.1994.346293,374,"377, C43",C,The recent advent of computer graphics techniques has helped to bridge the gap between architectural concepts and actual buildings. Closing this gap is especially critical in healthcare facilities. We present new techniques to support the design decision process and apply them to the design of a neonatal intensive care unit. Two issues are addressed: ergonometric accessibility and visual supervision of spaces. These two issues can be investigated utilizing new technologies that demonstrate that computers are more then a medium of communication in the field of architecture; the computer can make a significant contribution as a proactive design tool.&lt;&lt;ETX&gt;&gt;,Tarek K. Alameldin;Mardelle Shepley,T. Alameldin;M. Shepley,"Visualization Lab., Texas A&M Univ., College Station, TX, USA",,,,2,16,
Vis,1994,Observing a volume rendered fetus within a pregnant patient,10.1109/VISUAL.1994.346295,http://dx.doi.org/10.1109/VISUAL.1994.346295,364,"368, C41",C,"Augmented reality systems with see-through headmounted displays have been used primarily for applications that are possible with today's computational capabilities. We explore possibilities for a particular application-in-place, real-time 3D ultrasound visualization-without concern for such limitations. The question is not ""How well could we currently visualize the fetus in real time,"" but ""How well could we see the fetus if we had sufficient compute power?"" Our video sequence shows a 3D fetus within a pregnant woman's abdomen-the way this would look to a HMD user. Technical problems in making the sequence are discussed. This experience exposed limitations of current augmented reality systems; it may help define the capabilities of future systems needed for applications as demanding as real-time medical visualization.&lt;&lt;ETX&gt;&gt;",Andrei State;David T. Chen;Chris Tector;Andrew Brandt;Hong Chen;Ryutarou Ohbuchi;Michael Bajura;Henry Fuchs,A. State;D.T. Chen;C. Tector;A. Brandt;Hong Chen;R. Ohbuchi;M. Bajura;H. Fuchs,"North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA;North Carolina Univ., Chapel Hill, NC, USA",,,,30,13,
Vis,1994,Visualization of mesoscale flow features in ocean basins,10.1109/VISUAL.1994.346297,http://dx.doi.org/10.1109/VISUAL.1994.346297,355,"358, C39",C,"Environmental issues such as global warming are an active area of international research and concern today. This case study describes various visualization paradigms that have been developed and applied in an attempt to elucidate the information provided by environmental models and observations. The ultimate goal is to accurately measure the existence of any long term climatological change. The global ocean is the starting point, since it is a major source and sink of heat within our global environment.&lt;&lt;ETX&gt;&gt;",Andreas Johannsen;Robert J. Moorhead II,A. Johannsen;R. Moorhead,"NSF Eng. Res. Center for Comput. Field Simulation, Mississippi State Univ., MS, USA;NSF Eng. Res. Center for Comput. Field Simulation, Mississippi State Univ., MS, USA",10.1109/VISUAL.1994.346332;10.1109/VISUAL.1993.398901;10.1109/VISUAL.1994.346332,,,5,11,
Vis,1994,Severe rainfall events in Northwestern Peru (visualization of scattered meteorological data),10.1109/VISUAL.1994.346298,http://dx.doi.org/10.1109/VISUAL.1994.346298,350,"354, C38",C,"The ordinarily arid climate of coastal Peru is disturbed every few years by a phenomenon called El Nino, characterized by a warming in the Pacific Ocean. Severe rainstorms are one of the consequences of El Nino, which cause great damage. An examination of daily data from 66 rainfall stations in the Chiura-Piura region of northwestern Peru from late 1982 through mid-1983 (associated with an El Nino episode) yields information on the mesoscale structure of these storms. These observational data are typical of a class that are scattered at irregular locations in two dimensions. The use of continuous realization techniques for qualitative visualization (e.g., surface deformation or contouring) requires an intermediate step to define a topological relationship between the locations of data to form a mesh structure. Several common methods are considered, and the results of their application to the study of the rainfall events are analyzed.&lt;&lt;ETX&gt;&gt;",Lloyd Treinish,L.A. Treinish,"IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA",10.1109/VISUAL.1992.235219,,,5,17,
Vis,1994,Visualization and data analysis in space and atmospheric science,10.1109/VISUAL.1994.346300,http://dx.doi.org/10.1109/VISUAL.1994.346300,341,"344, C37",C,"In this paper we show how SAVS, a tool for visualization and data analysis in space and atmospheric science, can be used to quickly and easily address problems that would previously have been far more laborious to solve. Based on the popular AVS package, SAVS presents the user with an environment tailored specifically for the physical scientist. Thus there is minimal ""startup"" time, and the scientist can immediately concentrate on his science problem. The SAVS concept readily generalizes to many other fields of science and engineering.&lt;&lt;ETX&gt;&gt;",A. Mankofsky;E. P. Szuszczewicz;P. Blanchard;C. Goodrich;D. McNabb;R. Kulkarni;D. Kamins,A. Mankofsky;E.P. Szuszczewicz;P. Blanchard;C. Goodrich;D. McNabb;R. Kulkarni;D. Kamins,"Sci. Applications Int. Corp., McLean, VA, USA;Sci. Applications Int. Corp., McLean, VA, USA;Sci. Applications Int. Corp., McLean, VA, USA",,,,1,1,
Vis,1994,Tokamak plasma turbulence visualization,10.1109/VISUAL.1994.346301,http://dx.doi.org/10.1109/VISUAL.1994.346301,337,"340, C36",C,"One of the most fundamental issues in magnetic fusion research is the understanding of turbulent transport observed in present-day tokamak experiments. Plasma turbulence is very challenging from a theoretical point of view due to the nonlinearity and high dimensionality of the governing equations. Recent developments in algorithms along with the astounding advances in high performance computing now make first-principle particle simulations an important tool for improved understanding of such phenomena. Due to the five dimensional phase space (3 spatial, 2 velocity) and complex toroidal geometry, visualization is crucial for interpreting such simulation data. This paper discusses how visualization tools are currently used and what new physics has been elucidated, along with what can be learned about tokamak turbulence through the interplay between theory, simulation and visualization.&lt;&lt;ETX&gt;&gt;",Scott E. Parker;Ravi Samtaney,S.E. Parker;R. Samtaney,"Plasma Phys. Lab., Princeton Univ., NJ, USA",,"Computational geometry, object modeling, geometric modeling, volume modeling, implicit modeling, sweeping",,3,8,
InfoVis,1995,Visualisation for functional design,10.1109/INFVIS.1995.528680,http://dx.doi.org/10.1109/INFVIS.1995.528680,4,10,C,"We present two novel visualisation tools: the Influence Explorer and the Prosection Matrix. These were specifically created to support engineering artifact design and similar tasks in which a set of parameter values must be chosen to lead to acceptable artifact performance. These tools combine two concepts. One is the interactive and virtually immediate responsive display of data in a manner conducive to the acquisition of insight. The other, involving the precalculation of samples of artifact performance, facilitates smooth exploration and optimisation leading to a design decision. The anticipated benefits of these visualisation tools are illustrated by an example taken from electronic circuit design, in which full account must be taken of the uncertainties in parameter values arising from inevitable variations in the manufacturing process.",Robert Spence;Lisa Tweedie;Huw Dawkes;Hua Su,B. Spence;L. Tweedie;H. Dawkes;Hua Su,"Dept. of Electr. Eng., Imperial Coll. of Sci., Technol. & Med., London, UK;Dept. of Electr. Eng., Imperial Coll. of Sci., Technol. & Med., London, UK;Dept. of Electr. Eng., Imperial Coll. of Sci., Technol. & Med., London, UK;Dept. of Electr. Eng., Imperial Coll. of Sci., Technol. & Med., London, UK",,,,12,10,
Vis,1995,"Case study: an integrated approach for steering, visualization, and analysis of atmospheric simulations",10.1109/VISUAL.1995.485157,http://dx.doi.org/10.1109/VISUAL.1995.485157,383,"387, 479",C,"In the research described, we have constructed a tightly coupled set of methods for monitoring, steering, and applying visual analysis to large scale simulations. The work shows how a collaborative, interdisciplinary process that teams application and computer scientists can result in a powerful integrated approach. The integrated design allows great flexibility in the development and use of analysis tools. The work also shows that visual analysis is a necessary component for full understanding of spatially complex, time dependent atmospheric processes.",Yves Jean;Thomas Kindler;William Ribarsky;Weiming Gu;Greg Eisenhauer;Karsten Schwan;Fred Alyea,Y. Jean;T. Kindler;W. Ribarsky;Weiming Gu;G. Eisenhauer;K. Schwan;F. Alyea,"Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA",,,,9,5,
Vis,1995,Visualizing the tracking and diving behavior of marine mammals: a case study,10.1109/VISUAL.1995.485170,http://dx.doi.org/10.1109/VISUAL.1995.485170,397,"399, 482",C,A new method of tracking free ranging marine mammals has been developed which employs a Global Positioning System (GPS) receiver to accurately fix an animal's position when it surfaces and a tri axial magnetometer and velocity time depth recorder to track the animals underwater movements between surfacings in 3 dimensions. Concurrent with the development of the electronics of this movement and position tracking (MAP) tracking system has been the development of ways to analyze data from the MAP system. Spray rendering has been used to visualize the data and to combine it with environmental data allowing biologists view the animals activity in an environmental context. Considerable effort has been has been made to incorporate estimations of uncertainty and ways of minimizing it into our visualizations of the data.,Guy W. Oliver,G.W. Oliver,"Long Marine Lab., California Univ., Santa Cruz, CA, USA",,,,5,4,
Vis,1995,Case study: using spatial access methods to support the visualization of environmental data,10.1109/VISUAL.1995.485171,http://dx.doi.org/10.1109/VISUAL.1995.485171,400,"403, 483",C,"As part of a large effort evaluating the effect of the Exxon Valdez oil spill, we are using the spatial selection features of an object relational database management system to support the visualization of the ecological data. The effort, called the Sound Ecosystem Assessment project (SEA), is collecting and analyzing oceanographic and biological data from Prince William Sound in Alaska. To support visualization of the SEA data we are building a data management system which includes a spatial index over a bounding polygon for all of the datasets which are collected. In addition to other selection criteria the prototype provides several methods for selecting data within an arbitrary region. This case study presents the requirements and the implementation for the application prototype which combines visualization and database technology. The spatial indexing features of the Illustra object relational database management system are linked with the visualization capabilities of AVS to create an interactive environment for analysis of SEA data.",Charles Falkenberg;Ravi Kulkarni,C. Falkenberg;R. Kulkarni,"Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA",,,,0,6,
Vis,1996,Results in mathematics and music: Visualization of roughness in musical consonance,10.1109/VISUAL.1996.568130,http://dx.doi.org/10.1109/VISUAL.1996.568130,355,357,C,"The definition of consonance as the ability to resolve a sound into the pitch categories is introduced. For a vector space of chords a norm is used to evaluate the consonance linearly in dependence of the instrument used. It is shown that in the corr