{"title":"Compound brushing [dynamic data visualization]","authors":"Hong Chen","doi":"10.1109/INFVIS.2003.1249024","DOIUrl":"https://doi.org/10.1109/INFVIS.2003.1249024","url":null,"abstract":"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.","PeriodicalId":412054,"journal":{"name":"IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129228328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Visualizing evolving networks: minimum spanning trees versus pathfinder networks","authors":"Chaomei Chen, S. Morris","doi":"10.1109/INFVIS.2003.1249010","DOIUrl":"https://doi.org/10.1109/INFVIS.2003.1249010","url":null,"abstract":"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.","PeriodicalId":412054,"journal":{"name":"IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125086334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Thread Arcs: an email thread visualization","authors":"Bernard Kerr","doi":"10.1109/INFVIS.2003.1249028","DOIUrl":"https://doi.org/10.1109/INFVIS.2003.1249028","url":null,"abstract":"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.","PeriodicalId":412054,"journal":{"name":"IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123961679","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Improving hybrid MDS with pivot-based searching","authors":"A. Morrison, M. Chalmers","doi":"10.1109/INFVIS.2003.1249012","DOIUrl":"https://doi.org/10.1109/INFVIS.2003.1249012","url":null,"abstract":"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.","PeriodicalId":412054,"journal":{"name":"IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130002736","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
P. C. Wong, Harlan Foote, Dan Adams, W. Cowley, James J. Thomas
{"title":"Dynamic visualization of transient data streams","authors":"P. C. Wong, Harlan Foote, Dan Adams, W. Cowley, James J. Thomas","doi":"10.1109/INFVIS.2003.1249014","DOIUrl":"https://doi.org/10.1109/INFVIS.2003.1249014","url":null,"abstract":"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.","PeriodicalId":412054,"journal":{"name":"IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131459334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes","authors":"UC Davis, T. Jankun-Kelly, K. Ma","doi":"10.1109/INFVIS.2003.1249009","DOIUrl":"https://doi.org/10.1109/INFVIS.2003.1249009","url":null,"abstract":"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.","PeriodicalId":412054,"journal":{"name":"IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129999162","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Thinking with visualization","authors":"C. Ware","doi":"10.1109/INFVIS.2003.1249001","DOIUrl":"https://doi.org/10.1109/INFVIS.2003.1249001","url":null,"abstract":"Visualizations help us to solve problems by finding patterns in graphical displays of data. For example, finding a pattern of highly connected components in a node link diagram can help us understand the architecture of a software system. Finding a long, red, fairly straight line on a map can show us the best way of driving between two cities. This talk will describe how thinking with visualizations involves the construction of visual queries on the display. Once a visual query is constructed, a visual search strategy through eye movements and attention to relevant patterns provides answers. Recent results from cognitive psychology can help us understand the visual thinking process. I will show how understanding the nature of visual queries, and the capacity of visual working memory, can be used to predict which visual tasks will be easy and which will be difficult, if not impossible. Examples from common visualizations and interactive techniques will be used to illustrate the central concepts.","PeriodicalId":412054,"journal":{"name":"IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129553138","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Between aesthetics and utility: designing ambient information visualizations","authors":"Tobias Skog, S. Ljungblad, L. Holmquist","doi":"10.1109/INFVIS.2003.1249031","DOIUrl":"https://doi.org/10.1109/INFVIS.2003.1249031","url":null,"abstract":"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.","PeriodicalId":412054,"journal":{"name":"IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714)","volume":"134 25","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113969957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Conveying shape with texture: an experimental investigation of the impact of texture type on shape categorization judgments","authors":"Sunghee Kim, Haleh Hagh-Shenas, V. Interrante","doi":"10.1109/INFVIS.2003.1249022","DOIUrl":"https://doi.org/10.1109/INFVIS.2003.1249022","url":null,"abstract":"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.","PeriodicalId":412054,"journal":{"name":"IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126692454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Intelligently resolving point occlusion","authors":"M. Trutschl, G. Grinstein, U. Cvek","doi":"10.1109/INFVIS.2003.1249018","DOIUrl":"https://doi.org/10.1109/INFVIS.2003.1249018","url":null,"abstract":"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.","PeriodicalId":412054,"journal":{"name":"IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126978021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}