+
+
+ 
+
+
+ You can modify this app directly by editing index.html in the Files and versions tab.
-- Also don't forget to check the - Spaces documentation. -
-+ Recent advances in text-to-image synthesis enabled through a combination of language and vision foundation models have led to a proliferation of the tools available and an increased attention to the field. When conducting text-to-image synthesis, a central goal is to ensure that the content between text and image is aligned. As such, there exist numerous evaluation metrics that aim to mimic human judgement. However, it is often unclear which metric to use for evaluating text-to-image synthesis systems as their evaluation is highly nuanced. In this work, we provide a comprehensive overview of existing text-to-image evaluation metrics. Based on our findings, we propose a new taxonomy for categorizing these metrics. Our taxonomy is grounded in the assumption that there are two main quality criteria, namely compositionality and generality, which ideally map to human preferences. Ultimately, we derive guidelines for practitioners conducting text-to-image evaluation, discuss open challenges of evaluation mechanisms, and surface limitations of current metrics. +
+@article{hartwig2024evaluating,
+ title={Evaluating Text-to-Image Synthesis: Survey and Taxonomy of Image Quality Metrics},
+ author={Sebastian Hartwig and Dominik Engel and Leon Sick and Hannah Kniesel and Tristan Payer and Poonam Poonam and Michael Glöckler and Alex Bäuerle and Timo Ropinski},
+ year={2024},
+ eprint={2403.11821},
+ archivePrefix={arXiv},
+ primaryClass={cs.CV}
+}This is a sample about page.
+ + \ No newline at end of file diff --git a/survis/data/authorized_tags.js b/survis/data/authorized_tags.js new file mode 100644 index 0000000000000000000000000000000000000000..938fae751d6ba1bbbd53f638e0467d669fe645c5 --- /dev/null +++ b/survis/data/authorized_tags.js @@ -0,0 +1,5 @@ +const userDefinedAuthorizedTags = { + "type:system": { + "description": "paper describing a system" + } +} \ No newline at end of file diff --git a/survis/data/bib.js b/survis/data/bib.js new file mode 100644 index 0000000000000000000000000000000000000000..af4bd0bb34069c8f2ae90b63f89c9595151130fb --- /dev/null +++ b/survis/data/bib.js @@ -0,0 +1,2296 @@ +define({ entries : { + "Abello2013Modular": { + "abstract": "Large dynamic networks are targets of analysis in many fields. Tracking temporal changes at scale in these networks is challenging due in part to the fact that small changes can be missed or drowned-out by the rest of the network. For static networks, current approaches allow the identification of specific network elements within their context. However, in the case of dynamic networks, the user is left alone with finding salient local network elements and tracking them over time. In this work, we introduce a modular DoI specification to flexibly define what salient changes are and to assign them a measure of their importance in a time-varying setting. The specification takes into account neighborhood structure information, numerical attributes of nodes/edges, and their temporal evolution. A tailored visualization of the DoI specification complements our approach. Alongside a traditional node-link view of the dynamic network, it serves as an interface for the interactive definition of a DoI function. By using it to successively refine and investigate the captured details, it supports the analysis of dynamic networks from an initial view until pinpointing a user's analysis goal. We report on applying our approach to scientific co-authorship networks and give concrete results for the DBLP dataset.", + "address": "Los Alamitos, CA, USA", + "author": "Abello, James and Hadlak, Steffen and Schumann, Heidrun and Schulz, Hans-J\\\"org", + "doi": "10.1109/TVCG.2013.109", + "issn": "1077-2626", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "type:technique, paradigm:node-link, time:animation, evaluation:case\\_study, application:document, force-directed\\_layout, network\\_metrics, online_problem, special-purpose_layout, compound_graph", + "number": "3", + "pages": "337--350", + "publisher": "IEEE Computer Society", + "references": "Farrugia2011Effective Frishman2008Online Reitz2009Focused", + "series": "TVCG", + "title": "A Modular Degree-of-Interest Specification for the Visual Analysis of Large Dynamic Networks", + "type": "article", + "volume": "20", + "year": "2013" + }, + "Ahlers2014Replicable": { + "abstract": "Monitoring a computer network's security state is a di cult task as network components rarely share their information. The IF-MAP speci fication de fines a client/server-based protocol that enables network components to share security information among each other, which is represented in a graph structure. Visualization of this data is challenging due to the highly dynamic topology and the mapping of logical nodes onto physical devices. Furthermore, data in a MAP server is volatile and there is no standardized way to preserve and review changes or previous states of a MAP graph. The evolution of such a graph, however, embodies valuable information for the analysis of past incidents and attacks on the network infrastructure. In this paper we introduce a software framework to visualize MAP data and propose a solution for the effi cient long-term storage and replication of MAP graphs. We demonstrate how changes in the graph structure between given points in time can be computed and visualized.", + "author": "Ahlers, Volker and Heine, Felix and Hellmann, Bastian and Kleiner, Carsten and Renners, Leonard and Rossow, Thomas and Steuerwald, Ralf", + "booktitle": "Joint Proceedings of the Fourth International Workshop on Euler Diagrams and the First International Workshop on Graph Visualization in Practice", + "keywords": "type:application, application:infrastructure, paradigm:node-link, time:animation, graph_difference, evaluation:none", + "pages": "32--41", + "publisher": "CEUR-WS.org", + "references": "Federico2011Visual Dutot2007GraphStream", + "series": "GraphViP", + "title": "Replicable Security Monitoring: Visualizing Time-Variant Graphs of Network Metadata", + "type": "inproceedings", + "url": "http://ceur-ws.org/Vol-1244/GViP-paper1.pdf", + "year": "2014" + }, + "Ahmed2010Visual": { + "abstract": "In this paper, we present new visual analysis methods for history of the FIFA World Cup competition data, a social network from Graph Drawing 2006 Competition. Our methods are based on the use of network analysis method, and new visualization methods for dynamic graphs with dynamic hierarchy and geographic clustering. More specifically, we derive a dynamic network with geographic clustering from the history of the FIFA World Cup competition data, based on who-beats-whom relationship. Combined with the centrality analysis (which defines dynamic hierarchy) and the use of the union of graphs (which determines the overall layout topology), we present three new visualization methods for dynamic graphs with dynamic hierarchy and geographic clustering: wheel layout, radial layout and hierarchical layout. Our experimental results show that our visual analysis methods can clearly reveal the overall winner of the World Cup competition history as well as the strong and weak countries. Furthermore, one can analyze and compare the performance of each country for each year along the context with their overall performance. This enables us to confirm the expected and discover the unexpected.", + "author": "Ahmed, Adel and Fu, Xiaoyan and Hong, Seok-Hee and Nguyen, Quan Hoang and Xu, Kai", + "booktitle": "Visual Information Communication", + "doi": "10.1007/978-1-4419-0312-9_2", + "keywords": "type:application, time:timeline, paradigm:node-link, compound_graph, evaluation:case_study, application:sports, 3d, clustering, superimposed_node-link, radial", + "pages": "25--39", + "publisher": "Springer", + "references": "Brandes2006Affiliation Dwyer2004Visualising Fu2007Visualization Misue1995Layout Moody2005Dynamic", + "series": "VINCI", + "title": "Visual analysis of history of {World Cup}: A dynamic network with dynamic hierarchy and geographic clustering", + "type": "incollection", + "year": "2010" + }, + "Ahn2011Temporal": { + "abstract": "Information visualization is a powerful tool for analyzing the dynamic nature of social communities. Using Nation of Neighbors community network as a testbed, we propose five principles of implementing temporal visualizations for social networks and present two research prototypes: NodeXL and TempoVis. Three different states are defined in order to visualize the temporal changes of social networks. We designed the prototypes to show the benefits of the proposed ideas by letting users interactively explore temporal changes of social networks.", + "author": "Ahn, Jae-wook and Taieb-Maimon, Meirav and Sopan, Awalin and Plaisant, Catherine and Shneiderman, Ben", + "booktitle": "Social Computing, Behavioral-Cultural Modeling and Prediction", + "doi": "10.1007/978-3-642-19656-0_43", + "keywords": "paradigm:node-link, application:social, type:application, time:animation, time:timeline, evaluation:expert, directed_graph", + "pages": "309--316", + "publisher": "Springer", + "references": "Kang2007Visual Moody2005Dynamic", + "series": "SBP", + "title": "Temporal Visualization of Social Network Dynamics: Prototypes for Nation of Neighbors", + "type": "incollection", + "year": "2011" + }, + "Ahn2013Task": { + "abstract": "Visualization has proven to be a useful tool for understanding network structures. Yet the dynamic nature of social media networks requires powerful visualization techniques that go beyond static network diagrams. In order to provide strong temporal network visualization tools, designers need to understand what tasks the users have to accomplish. This paper describes a taxonomy of temporal network visualization tasks. We identify the (1) entities, (2) properties, and (3) temporal features, which were extracted by surveying 53 existing temporal network visualization systems. By building and examining the task taxonomy, we report which tasks are well covered by existing systems and make suggestions for designing future visualization tools. The feedback from 12 network analysts helped refine the taxonomy.", + "author": "Ahn, Jae-wook and Plaisant, Catherine and Shneiderman, Ben", + "doi": "10.1109/TVCG.2013.238", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "type:evaluation, taxonomy, tasks, evaluation:expert, time:generic, evaluation_framework, paradigm:generic, application:generic", + "number": "3", + "pages": "365--376", + "references": "Yi2010TimeMatrix Hadlak2011Situ Moody2005Dynamic Bender-deMoll2006Science Brandes2003Visual", + "series": "TVCG", + "title": "A Task Taxonomy for Network Evolution Analysis", + "type": "article", + "volume": "20", + "year": "2013" + }, + "Alencar2012TimeAware": { + "abstract": "Scientific articles are the major mechanism for researchers to report their results, and a collection of papers on a discipline can reveal a lot about its evolution, such as the emergence of new topics. Nonetheless, given a broad collection of papers it is typically very difficult to grasp important information that could help readers to globally interpret, navigate and then focus on the relevant items for their task. Content-based document maps are visual representations created from evaluating the (dis)similarity amongst the documents, and have been shown to support exploratory tasks in this scenario. Documents are represented by visual markers placed in the 2D space so that documents close share similar content. Albeit the maps allow visually identifying groups of related documents and frontiers between groups, they do not explicitly convey the temporal evolution of a collection. We propose a technique for creating content-based similarity maps of document collections that highlight temporal changes along time. Our solution constructs a sequence of maps from time-stamped sub-sets of the data. It adopts a cumulative backwards strategy to preserve user context across successive time-stamps, i.e., maps do not change drastically from one time stamp to the next, favouring user perception of changes.", + "author": "Alencar, Aretha B and B\\\"orner, Katy and Paulovich, Fernando V and de Oliveira, Maria Cristina F", + "booktitle": "Proceedings of the 27th Annual ACM Symposium on Applied Computing", + "doi": "10.1145/2245276.2245469", + "keywords": "paradigm:node-link, application:document, type:application, time:animation, evaluation:case_study", + "pages": "997--1004", + "publisher": "ACM", + "references": "Chen2006CiteSpace", + "series": "SAC", + "title": "Time-Aware Visualization of Document Collections", + "type": "inproceedings", + "year": "2012" + }, + "Archambault2011Animation": { + "abstract": "In this paper, we present the results of a human-computer interaction experiment that compared the performance of the animation of dynamic graphs to the presentation of small multiples and the effect that mental map preservation had on the two conditions. Questions used in the experiment were selected to test both local and global properties of graph evolution over time. The data sets used in this experiment were derived from standard benchmark data sets of the information visualization community. We found that small multiples gave significantly faster performance than animation overall and for each of our five graph comprehension tasks. In addition, small multiples had significantly more errors than animation for the tasks of determining sets of nodes or edges added to the graph during the same timeslice, although a positive time-error correlation coefficient suggests that, in this case, faster responses did not lead to more errors. This result suggests that, for these two tasks, animation is preferable if accuracy is more important than speed. Preserving the mental map under either the animation or the small multiples condition had little influence in terms of error rate and response time.", + "author": "Archambault, Daniel and Purchase, Helen C and Pinaud, Bruno", + "doi": "10.1109/tvcg.2010.78", + "issn": "1077-2626", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "mental\\_map, type:evaluation, paradigm:node-link, time:animation, time:timeline, application:generic, evaluation:user\\_study", + "number": "4", + "pages": "539--552", + "publisher": "IEEE", + "references": "Brandes2003Visual Cohen1992Framework Frishman2004Dynamic Frishman2008Online Kumar2006Visual Lee2006Mental Misue1995Layout Saffrey2008Mental", + "series": "TVCG", + "title": "Animation, Small Multiples, and the Effect of Mental Map Preservation in Dynamic Graphs", + "type": "article", + "volume": "17", + "year": "2011" + }, + "Archambault2011Difference": { + "abstract": "Difference maps are one way to show changes between timeslices in a dynamic graph. They highlight, using colour, the nodes and edges that were added, removed, or persisted between every pair of adjacent timeslices. Although some work has used difference maps for visualization, no user study has been performed to gauge their performance. In this paper, we present a user study to evaluate the effectiveness of difference maps in comparison with presenting the evolution of the dynamic graph over time on three interfaces. We found evidence that difference maps produced significantly fewer errors when determining the number of edges inserted or removed from a graph as it evolves over time. Also, difference maps were significantly preferred on all tasks.", + "author": "Archambault, Daniel and Purchase, Helen C and Pinaud, Bruno", + "booktitle": "Graph Drawing", + "doi": "10.1007/978-3-642-18469-7\\_5", + "isbn": "978-3-642-18468-0", + "keywords": "paradigm:node-link, type:evaluation, application:social, time:timeline, time:animation, evaluation:user\\_study, graph\\_difference", + "pages": "50--61", + "publisher": "Springer", + "references": "Archambault2011Animation Cohen1992Framework Farrugia2011Effective Frishman2008Online Saffrey2008Mental", + "series": "GD", + "title": "Difference Map Readability for Dynamic Graphs", + "type": "incollection", + "year": "2011" + }, + "Archambault2012Mental": { + "abstract": "In dynamic graph drawing, preserving the mental map, or ensuring that the location of nodes do not change significantly as the information evolves over time is considered an important property by algorithm designers. Many prior experiments have attempted to verify this principle, with surprisingly little success. These experiments have used several different algorithmic methods, a variety of graph interpretation questions on both real and fabricated data, and different presentation methods. However, none of the results have conclusively demonstrated the importance of mental map preservation on task performance. Our experiment measures the efficacy of the dynamic graph drawing in a different manner: we look at how memorable the evolving graph is, rather than how easy it is to interpret. As observed in the previous studies, we found no significant difference in terms of response time or error rate when preserving the mental map. While preserving the mental map is a good idea in principle, we find that it may not always support performance. However, our qualitative data suggests that, in terms of the user's perception, preserving the mental map makes memorability tasks easier. Our qualitative data also suggests that there may be two features of the dynamic graph drawing that may assist in their memorability: interesting subgraphs that remain visible over time and interesting patterns in node movement. The former is supported by preserving the mental map while the latter is not.", + "author": "Archambault, Daniel and Purchase, Helen C", + "booktitle": "Proceeding of the IEEE Pacific Visualization Symposium", + "doi": "10.1109/PacificVis.2012.6183578", + "keywords": "mental\\_map, paradigm:node-link, type:evaluation, time:animation, application:social, evaluation:user_study", + "pages": "89--96", + "publisher": "IEEE", + "references": "Archambault2011Animation Cohen1992Framework Farrugia2011Effective Frishman2008Online Lee2006Mental Misue1995Layout Saffrey2008Mental Zaman2011Effect", + "series": "PacificVis", + "title": "The Mental Map and Memorability in Dynamic Graphs", + "type": "inproceedings", + "year": "2012" + }, + "Archambault2013Map": { + "abstract": "Abstract Preserving the mental map is frequently cited by dynamic graph drawing algorithm designers as an important optimization criterion. There have been a number of definitions for mental map preservation and many different algorithmic approaches to drive dynamic graph drawing to satisfy these definitions. One of the most frequently used definitions is that of Coleman and Parker where \u201cthe placement of existing nodes and edges should change as little as possible when a change is made to the graph.\u201d A number of experiments have been run to test the effectiveness of this definition from a usability perspective. To date, no experiment has found conclusive evidence that supports the effectiveness of the mental map in the comprehension of a dynamic graph series. In this paper, we summarize the experiments conducted on this definition of mental map preservation and provide recommendations to designers and researchers to fully understand when the mental map supports user tasks.", + "author": "Archambault, Daniel and Purchase, Helen C", + "doi": "10.1016/j.ijhcs.2013.08.004", + "journal": "International Journal of Human-Computer Studies", + "keywords": "type:evaluation, paradigm:node-link, time:animation, evaluation:survey, application:generic, mental_map, aesthetic_criteria", + "number": "11", + "pages": "1044 - 1055", + "references": "Archambault2012Mental Archambault2011Animation Bender-deMoll2006Science Brandes2012Visualization Burch2011Parallel Cohen1992Framework Farrugia2011Effective Frishman2004Dynamic Frishman2008Online Lee2006Mental Misue1995Layout Moody2005Dynamic Saffrey2008Mental", + "title": "The ``{Map}\" in the mental map: Experimental results in dynamic graph drawing", + "type": "article", + "volume": "71", + "year": "2013" + }, + "Archambault2013Mental": { + "abstract": "We present the results of a formal experiment that tests the ability of a participant to orient themselves in a dynamically evolving graph. Examples of these tasks include finding a specific location or route between two locations. We find that preserving the mental map for the tasks tested is significantly faster and produces fewer errors. As the number of targets increase, this result holds.", + "author": "Archambault, Daniel and Purchase, Helen C", + "booktitle": "Graph Drawing", + "doi": "10.1007/978-3-642-36763-2_42", + "keywords": "type:evaluation, paradigm:node-link, time:animation, mental_map, evaluation:user_study, application:generic, time:timeline", + "organization": "Springer", + "pages": "475--486", + "references": "Archambault2012Mental Archambault2011Animation Brandes2012Visualization Farrugia2011Effective Frishman2008Online Ghani2012Perception Misue1995Layout Saffrey2008Mental", + "series": "GD", + "title": "Mental map preservation helps user orientation in dynamic graphs", + "type": "inproceedings", + "year": "2013" + }, + "Archambault2014Application": { + "author": "Archambault, Daniel and Purchase, Helen C", + "booktitle": "Joint Proceedings of the Fourth International Workshop on Euler Diagrams and the First International Workshop on Graph Visualization in Practice", + "keywords": "evaluation:survey, type:evaluation, time:animation, time:timeline, paradigm:node-link, application:generic, mental_map, juxtaposed_node-link", + "pages": "73--77", + "publisher": "CEUR-WS.org", + "references": "Archambault2012Mental Archambault2013Map Archambault2011Animation Bach2014Review Bach2014GraphDiaries Beck2014State Farrugia2011Effective Ghani2012Perception Misue1995Layout Rufiange2013DiffAni", + "series": "GraphViP", + "title": "On the Application of Experimental Results in Dynamic Graph Drawing", + "type": "inproceedings", + "url": "http://ceur-ws.org/Vol-1244/GViP-paper5.pdf", + "year": "2014" + }, + "Archambault2014Temporal": { + "abstract": "Networks that evolve over time, or dynamic graphs, have been of interest to the areas of information visualization and graph drawing for many years. Typically, its the structure of the dynamic graph that evolves as vertices and edges are added or removed from the graph. In a multivariate scenario, however, attributes play an important role and can also evolve over time. In this chapter, we characterize and survey methods for visualizing temporal multivariate networks. We also explore future applications and directions for this emerging area in the fields of information visualization and graph drawing.", + "author": "Archambault, Daniel and Abello, James and Kennedy, Jessie and Kobourov, Stephen G and Ma, Kwan-Liu and Miksch, Silvia and Muelder, Chris and Telea, Alexandru", + "booktitle": "Multivariate Network Visualization", + "chapter": "8", + "doi": "10.1007/978-3-319-06793-3_8", + "keywords": "type:evaluation, time:generic, paradigm:node-link, evaluation:survey, application:software_engineering, mental_map, application:generic, multivariate_graph, taxonomy", + "pages": "151--175", + "publisher": "Springer", + "references": "Abello2013Modular Archambault2013Map Archambault2011Animation Bastian2009Gephi Bender-deMoll2006Science Boitmanis2008Visualizing Brandes2012Visualization Brandes1997Bayesian Burch2011Parallel Collberg2003System Dwyer2004Visualising Erten2004Exploring Farrugia2011Effective Feng2012Coherent Forrester2005graphael Frishman2008Online Hu2012Embedding Kumar2006Visual Mashima2012Visualizing Moody2005Dynamic Rufiange2013DiffAni Saffrey2008Mental Sallaberry2012Clustering", + "title": "Temporal Multivariate Networks", + "type": "incollection", + "year": "2014" + }, + "Archambault2015Animation": { + "abstract": "Animation and small multiples are methods for visualising dynamically evolving graphs. Animations present an interactive movie of the data where positions of nodes are smoothly interpolated as the graph evolves. Nodes fade in/out as they are added/removed from the data set. Small multiples presents the data like a comic book with the graph at various states in separate windows. The user scans these windows to see how the data evolves. In a recent experiment, drawing stability (known more widely as the \u201cmental map\u201d) was shown to help users follow specific nodes or long paths in dynamically evolving data. However, no significant difference between animation and small multiples presentations was found. In this paper, we look at data where the nodes in the graph have low drawing stability and analyse it with new error metrics: measuring how close the given answer is from the correct answer on a continuous scale. We find evidence that when the stability of the drawing is low and important nodes in the task cannot be highlighted throughout the time series, animation can improve task performance when compared to the use of small multiples.", + "author": "Archambault, Daniel and Purchase, Helen C", + "doi": "10.1016/j.ins.2015.04.017", + "journal": "Information Sciences", + "keywords": "paradigm:node-link, time:animation, time:timeline, evaluation:user_study, mental_map, application:generic, juxtaposed_node-link, type:evaluation", + "publisher": "Elsevier", + "references": "Archambault2012Mental Archambault2013Map Archambault2011Animation Bach2014GraphDiaries Brandes2012Visualization Burch2011Parallel Farrugia2011Effective Frishman2004Dynamic Frishman2008Online Ghani2012Perception Misue1995Layout Rufiange2013DiffAni Zaman2011Effect", + "title": "Can animation support the visualisation of dynamic graphs?", + "type": "article", + "year": "2015" + }, + "Arendt2014SVEN": { + "abstract": "Graphs change over time, and typically variations on the small multiples or animation pattern is used to convey this dynamism visually. However, both of these classical techniques have significant drawbacks, so a new approach, Storyline Visualization of Events on a Network (SVEN) is proposed. SVEN builds on storyline techniques, conveying nodes as contiguous lines over time. SVEN encodes time in a natural manner, along the horizontal axis, and optimizes the vertical placement of storylines to decrease clutter (line crossings, straightness, and bends) in the drawing. This paper demonstrates SVEN on several different flavors of real-world dynamic data, and outlines the remaining near-term future work.", + "author": "Arendt, Dustin L and Blaha, Leslie M", + "journal": "arXiv preprint arXiv:1412.6706", + "keywords": "type:technique, time:timeline, paradigm:node-link, juxtaposed_node-link, evaluation:case_study, linear_arrangement, application:social, application:sports, application:document", + "references": "Archambault2011Animation Bastian2009Gephi Bender-deMoll2006Science Brandes2003Visual Burch2011Parallel Chen2006CiteSpace Dwyer2002Visualising Moody2005Dynamic Purchase2007Important Shi2011Dynamic", + "title": "{SVEN}: Informative Visual Representation of Complex Dynamic Structure", + "type": "article", + "url": "http://xxx.tau.ac.il/abs/1412.6706", + "year": "2014" + }, + "Bach2014GraphDiaries": { + "abstract": "Identifying, tracking and understanding changes in dynamic networks are complex and cognitively demanding tasks. We present GraphDiaries, a visual interface designed to improve support for these tasks in any node-link based graph visualization system. GraphDiaries relies on animated transitions that highlight changes in the network between time steps, thus helping users identify and understand those changes. To better understand the tasks related to the exploration of dynamic networks, we first introduce a task taxonomy, that informs the design of GraphDiaries, presented afterwards. We then report on a user study, based on representative tasks identified through the taxonomy, and that compares GraphDiaries to existing techniques for temporal navigation in dynamic networks, showing that it outperforms them in terms of both task time and errors for several of these tasks.", + "author": "Bach, Benjamin and Pietriga, Emmanuel and Fekete, Jean-Daniel", + "doi": "10.1109/TVCG.2013.254", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "type:technique, time:animation, paradigm:node-link, evaluation:user_study, application:generic, taxonomy, tasks, offline_problem, transition_problem, general-purpose_layout", + "number": "5", + "pages": "740--754", + "publisher": "IEEE", + "references": "Federico2011Visual Farrugia2011Exploring Collberg2003System Dwyer2002Visualising Brandes2003Visual Friedrich2002Graph Archambault2011Animation Farrugia2011Effective Bastian2009Gephi Ahn2011Temporal Ghani2012Perception Zaman2011Effect", + "series": "TVCG", + "title": "{GraphDiaries}: Animated Transitions and Temporal Navigation for Dynamic Networks", + "type": "article", + "volume": "20", + "year": "2014" + }, + "Bach2014Review": { + "abstract": "We review a range of temporal data visualization techniques through a new lens, by describing them as series of operations performed on a conceptual space-time cube. These operations include extracting subparts of a space-time cube, flattening it across space or time, or transforming the cube's geometry or content. We introduce a taxonomy of elementary space-time cube operations, and explain how they can be combined to turn a three-dimensional space-time cube into an easily-readable two-dimensional visualization. Our model captures most visualizations showing two or more data dimensions in addition to time, such as geotemporal visualizations, dynamic networks, time-evolving scatterplots, or videos. We finally review interactive systems that support a range of operations. By introducing this conceptual framework we hope to facilitate the description, criticism and comparison of existing temporal data visualizations, as well as encourage the exploration of new techniques and systems.", + "author": "Bach, Benjamin and Dragicevic, Pierre and Archambault, Daniel and Hurter, Christophe and Carpendale, Sheelagh", + "booktitle": "EuroVis-STARs", + "doi": "10.2312/eurovisstar.20141171", + "keywords": "type:evaluation, evaluation:survey, time:generic, paradigm:generic, application:generic", + "pages": "23--41", + "publisher": "The Eurographics Association", + "references": "Archambault2011Animation Ahn2011Temporal Boyandin2012Qualitative Brandes2003Visual Brandes2011Asymmetric Bach2014GraphDiaries Burch2011Parallel Dwyer2002Visualising Dwyer2004Visualising Groh2009Interactively Hurter2013Bundled Rufiange2013DiffAni", + "series": "EuroVis", + "title": "A Review of Temporal Data Visualizations Based on Space-Time Cube Operations", + "type": "inproceedings", + "year": "2014" + }, + "Bach2014Visualizing": { + "abstract": "Designing visualizations of dynamic networks is challenging, both because the data sets tend to be complex and because the tasks associated with them are often cognitively demanding. We introduce the Matrix Cube, a novel visual representation and navigation model for dynamic networks, inspired by the way people comprehend and manipulate physical cubes. Users can change their perspective on the data by rotating or decomposing the 3D cube. These manipulations can produce a range of different 2D visualizations that emphasize specific aspects of the dynamic network suited to particular analysis tasks. We describe Matrix Cubes and the interactions that can be performed on them in the Cubix system. We then show how two domain experts, an astronomer and a neurologist, used Cubix to explore and report on their own network data.", + "author": "Bach, Benjamin and Pietriga, Emmanuel and Fekete, Jean-Daniel", + "booktitle": "Procceedings of the SICCHI Conference on Human Factors in Computing Systems", + "doi": "10.1145/2556288.2557010", + "keywords": "type:technique, time:timeline, paradigm:matrix, evaluation:case_study, evaluation:expert, application:infrastructure, application:biology, 3d, layered_matrices, weighted_graph", + "series": "CHI", + "title": "Visualizing Dynamic Networks with {Matrix Cubes}", + "type": "inproceedings", + "year": "2014" + }, + "Bach2015Small": { + "abstract": "We introduce MultiPiles, a visualization to explore time-series of dense, weighted networks. MultiPiles is based on the physical analogy of piling adjacency matrices, each one representing a single temporal snapshot. Common interfaces for visualizing dynamic networks use techniques such as: flipping/animation; small multiples; or summary views in isolation. Our proposed 'piling' metaphor presents a hybrid of these techniques, leveraging each one's advantages, as well as offering the ability to scale to networks with hundreds of temporal snapshots. While the MultiPiles technique is applicable to many domains, our prototype was initially designed to help neuroscientists investigate changes in brain connectivity networks over several hundred snapshots. The piling metaphor and associated interaction and visual encodings allowed neuroscientists to explore their data, prior to a statistical analysis. They detected high-level temporal patterns in individual networks and this helped them to formulate and reject several hypotheses.", + "author": "Bach, Benjamin and Henry-Riche, Nathalie and Dwyer, Tim and Madhyastha, Tara and Fekete, Jean-Daniel and Grabowski, Thomas", + "doi": "10.1111/cgf.12615", + "journal": "Computer Graphics Forum", + "keywords": "type:technique, time:timeline, time:animation, paradigm:matrix, application:biology, evaluation:expert, weighted_graph, animated_timeline", + "publisher": "The Eurographics Association and John Wiley & Sons Ltd.", + "references": "Archambault2011Animation Ahn2013Task Beck2014State Boyandin2012Qualitative Bach2014Review Brandes2011Asymmetric Bach2014GraphDiaries Burch2014FlipBook Collberg2003System Perer2012MatrixFlow Rufiange2013DiffAni Rufiange2014AniMatrix Stein2010PixelOriented Yi2010TimeMatrix", + "series": "CGF", + "title": "{Small MultiPiles}: Piling Time to Explore Temporal Patterns in Dynamic Networks", + "type": "article", + "year": "2015" + }, + "Bastian2009Gephi": { + "abstract": "Gephi is an open source software for graph and network analysis. It uses a 3D render engine to display large networks in real-time and to speed up the exploration. A flexible and multi-task architecture brings new possibilities to work with complex data sets and produce valuable visual results. We present several key features of Gephi in the context of interactive exploration and interpretation of networks. It provides easy and broad access to network data and allows for spatializing, filtering, navigating, manipulating and clustering. Finally, by presenting dynamic features of Gephi, we highlight key aspects of dynamic network visualization.", + "author": "Bastian, Mathieu and Heymann, Sebastien and Jacomy, Mathieu", + "booktitle": "International AAAI Conference on Weblogs and Social Media", + "keywords": "type:application, time:animation, paradigm:node-link, evaluation:none, application:generic, online_problem, clustering, network_metrics", + "pages": "361--362", + "publisher": "The AAAI Press", + "series": "ICWSM", + "title": "Gephi: an open source software for exploring and manipulating networks", + "type": "inproceedings", + "url": "http://aaai.org/ocs/index.php/ICWSM/09/paper/view/154", + "year": "2009" + }, + "Baur2008Dynamic": { + "abstract": "In early 2008 a new testing branch of the network analysis software visone has been made publicly available [Baur et al., 2008]. This realease includes the ability to process dynamic networks. A central feature is a dedicated dynamic layout algorithm which we present here from a methological and application oriented point of view. We first describe this algorithm from an algorithmic perspective. More precisely we show how the local majorant method of the related layout algorithm given by Kamada and Kawai can be adapted to layout dynamic networks. Following the methodological part we also address some problems and some other features of our implementation. Given the information in this document users of the dynamic layout procedure in visone should be able to employ the various available options efficiently to get the desired results.", + "author": "Baur, Michael and Schank, Thomas", + "institution": "Fakult\\\"at f\\\"ur Informatik, Universit\\\"at Karlsruhe", + "issn": "1432-7864", + "keywords": "type:technique, paradigm:node-link, time:animation, evaluation:none, offline_problem, application:generic, general-purpose_layout", + "references": "Friedrich2002Graph Misue1995Layout Moody2005Dynamic", + "title": "Dynamic Graph Drawing in {Visone}", + "type": "techreport", + "url": "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000007990", + "year": "2008" + }, + "Beck2009Aesthetic": { + "abstract": "Most research on the readability of graph visualization focuses on node-link diagrams of static graphs. But in many applications graphs are not static, but change over time, or graphs are too dense to be drawn as node-link diagrams. In this paper we look at dynamic graph visualizations: We translate the general goal of graph visualization-to convey the underlying information of a graph-into aesthetic dimensions that are applicable in practice. These aesthetic dimensions help to design, compare, and evaluate dynamic graph visualizations.", + "author": "Beck, Fabian and Burch, Michael and Diehl, Stephan", + "booktitle": "Proceedings of the 13th International Conference on Information Visualisation", + "doi": "10.1109/IV.2009.42", + "keywords": "paradigm:generic, time:generic, type:evaluation, aesthetic_criteria, mental_map, evaluation:case\\_study, evaluation_framework, application:document", + "pages": "592--597", + "publisher": "IEEE", + "references": "Misue1995Layout", + "series": "IV", + "title": "Towards an Aesthetic Dimensions Framework for Dynamic Graph Visualisations", + "type": "inproceedings", + "year": "2009" + }, + "Beck2012Rapid": { + "abstract": "Rapid Serial Visual Presentation is an effective approach for browsing and searching large amounts of data. By presenting subsequent images at high frequency, we utilize the perceptual abilities of the human visual system to rapidly process certain visual features. While this concept is successfully used in video and image browsing, we demonstrate how it can be applied to dynamic graph visualization. In this paper, we introduce a visualization technique for time-varying graphs that is scalable with respect to the number of time steps. The graph visualization is based on the Parallel Edge Splatting technique, which employs a space-efficient display of a sequence of dynamically changing graphs. To illustrate the usefulness of our approach we analyzed method call graphs recorded during the execution of the open source software system JHotDraw. Furthermore, we studied a time-varying social network representing researchers and their dynamic communication structure while attending the ACM Hypertext 2009 conference.", + "author": "Beck, Fabian and Burch, Michael and Vehlow, Corinna and Diehl, Stephan and Weiskopf, Daniel", + "booktitle": "Proceedings of the 2012 IEEE Symposium on Visual Languages and Human-Centric Computing", + "doi": "10.1109/vlhcc.2012.6344514", + "keywords": "paradigm:node-link, mental\\_map, application:social, application:software\\_engineering, type:technique, compound_graph, directed_graph, weighted_graph, bipartite, evaluation:case\\_study, time:timeline, time:animation, animated_timeline, time_aggregation", + "pages": "185--192", + "publisher": "IEEE", + "references": "Beck2009Aesthetic Burch2008TimeRadarTrees Burch2011Parallel Frishman2008Online Greilich2009Visualizing Misue1995Layout Reitz2009Focused", + "series": "VL/HCC", + "survey:data": "(n:982, e:32259, t:1077), (n:982, e:1757, t:1757), (n:113, e:20818, t:236)", + "title": "Rapid Serial Visual Presentation in Dynamic Graph Visualization", + "type": "inproceedings", + "year": "2012" + }, + "Beck2013Matching": { + "abstract": "Mapping a dynamic graph dataset to an inappropriate visualization leads to a degradation of visualization performance at some task. To tap the full potential of existing dynamic graph visualization techniques, we propose a methodology for matching application requirements with dynamic graph visualization profiles. We target at supporting experts choosing the right visualization technique. Our methodology describes both the application requirements and the visualization techniques as profiles covering important aesthetic criteria for visualizing dynamic graphs. Characteristics of the graph and task are used to derive the application profile. The probably most appropriate visualization technique is the one whose profile matches best the required application profile. We compile exemplary visualization profiles for representatives of dynamic graph visualization approaches and demonstrate the methodology in a case study.", + "author": "Beck, Fabian and Burch, Michael and Diehl, Stephan", + "booktitle": "Proceedings of the 17th International Conference on Information Visualisation", + "doi": "10.1109/IV.2013.2", + "keywords": "type:evaluation, paradigm:generic, evaluation:case\\_study, application:document, aesthetic_criteria, mental\\_map, taxonomy, time:generic, evaluation_framework, tasks", + "pages": "11--18", + "publisher": "IEEE", + "references": "Beck2009Aesthetic Misue1995Layout Frishman2008Online Burch2011Parallel Greilich2009Visualizing Brandes2011Asymmetric Stein2010PixelOriented Burch2008TimeRadarTrees Beck2012Rapid", + "series": "IV", + "title": "Matching Application Requirements with Dynamic Graph Visualization Profiles", + "type": "inproceedings", + "year": "2013" + }, + "Beck2014State": { + "abstract": "Dynamic graph visualization focuses on the challenge of representing the evolution of relationships between entities in readable, scalable, and effective diagrams. This work surveys the growing number of approaches in this discipline. We derive a hierarchical taxonomy of techniques by systematically categorizing and tagging publications. While static graph visualizations are often divided into node-link and matrix representations, we identify the representation of time as the major distinguishing feature for dynamic graph visualizations: either graphs are represented as animated diagrams or as static charts based on a timeline. Evaluations of animated approaches focus on dynamic stability for preserving the viewer's mental map or, in general, compare animated diagrams to timeline-based ones. Finally, we identify and discuss challenges for future research.", + "author": "Beck, Fabian and Burch, Michael and Diehl, Stephan and Weiskopf, Daniel", + "booktitle": "EuroVis - STARs", + "doi": "10.2312/eurovisstar.20141174", + "keywords": "type:evaluation, time:generic, paradigm:generic, evaluation:survey, application:generic", + "pages": "83-103", + "publisher": "Eurographics Association", + "references": "Archambault2014Temporal Alencar2012TimeAware Ahmed2010Visual Abello2013Modular Archambault2012Mental Archambault2013Map Archambault2011Animation Archambault2011Difference Ahn2013Task Ahn2011Temporal Beck2009Aesthetic Beck2013Matching Boyandin2012Qualitative Boitmanis2008Visualizing Burch2014Dynamic Beck2012Rapid Burch2012Radial Brandes2003Visual Burch2008TimeRadarTrees Burch2010TimeSpiderTrees Brasch2012VENLO Brandes2006Dynamic Beyer2006Animated Brandes2006Affiliation Burch2011Layered Brandes2012Visualization Brandes2012Quantitative Burch2012Visualizing Brandes2011Asymmetric Bach2014GraphDiaries Bach2014Visualizing Branke2001Dynamic Burch2013MatrixBased Burch2011Parallel Brandes1997Bayesian Cohen1992Framework Cohen1995Dynamic Chen2006CiteSpace Collberg2003System Cengiz2013Visualization Dwyer2002Visualising Diehl2002Graphs Diehl2001Preserving Erten2004Exploring Erten2004GraphAEL Erten2004Simultaneous Elmqvist2003Causality Federico2011Visual Friedrich2001Marey Friedrich2002Graph Friedrich2002GraphII Farrugia2011Exploring Forrester2005graphael Farrugia2011Effective Frishman2004Dynamic Frishman2008MOVIS Frishman2008Online Feng2012Coherent Greilich2009Visualizing Gorg2005Dynamic Gorochowski2012Using Ghani2012Perception Gansner2013Interactive Greevy2006Visualizing Gaertler2006Hybrid Hurter2013Bundled Huang1998Online Hu2012Embedding Hayashi2013Initial Hadlak2011Situ Itoh2012Visualization Itoh2010Interactive Itoh2012Analysis John2011Constructing Kumar2006Visual Kimelman1995Reduction Kobourov2012Spring Loubier2008Temporal Lee2006Mental Li2013Visual Lin2010ContexTour Liao2013Visual Misue1995Layout Mashima2012Visualizing Moody2005Dynamic Nesbitt2002Applying North1996Incremental Oelke2013Fingerprint Ogawa2008StarGate Ogawa2009codeswarm Pohl2008Interactive Purchase2007Important Purchase2008Extremes Pupyrev2010Analyzing Rey2010Controlling Rufiange2013DiffAni Reitz2009Focused Rohrschneider2010Visual Saraiya2005Visualization Sallaberry2012Clustering Stab2010SemaTime Saffrey2008Mental Stein2010PixelOriented Shi2011Dynamic Toyoda2005System Trier2006Towards Vehlow2013Radial vandenElzen2013Dynamic Vehlow2013iVUN vonLandesberger2013Visual vonLandesberger2011Visual Windhager2011Visual Yang2008Visual Yi2010TimeMatrix Zaman2011Effect", + "series": "EuroVis", + "title": "The State of the Art in Visualizing Dynamic Graphs", + "type": "inproceedings", + "url": "http://www.visus.uni-stuttgart.de/uploads/tx_vispublications/eurovis14-star.pdf", + "year": "2014" + }, + "Bender-deMoll2006Science": { + "abstract": "If graph drawing is to become a methodological tool instead of an illustrative art, many concerns need to be overcome. We discuss the problems of social network visualization, and particularly, problems of dynamic network visualization. We consider issues that arise from the aggregation of continuous-time relational data (\"streaming\" interactions) into a series of networks. We discuss our experience developing SoNIA (Social Network Image Animator, http://sonia.stanford.edu) as a prototype platform for testing and comparing layouts and techniques, and as a tool for browsing attribute-rich network data and for animating network dynamics over time. We discuss strengths and weakness of existing layout algorithms and suggest ways to adapt them to sequential layout tasks. As such, we propose a framework for visualizing social networks and their dynamics, and we present a tool that enables debate and reflection on the quality of visualizations used in empirical research.", + "author": "Bender-deMoll, Skye and McFarland, Daniel A", + "journal": "Journal of Social Structure", + "keywords": "application:social, type:application, time:animation, paradigm:node-link, evaluation:case_study, mental_map, radial", + "number": "2", + "pages": "1--38", + "references": "Moody2005Dynamic", + "title": "The Art and Science of Dynamic Network Visualization", + "type": "article", + "url": "http://www.cmu.edu/joss/content/articles/volume7/deMollMcFarland/", + "volume": "7", + "year": "2006" + }, + "Beyer2006Animated": { + "abstract": "The understanding of the structure of a software system can be improved by analyzing the system's evolution during development. Visualizations of software history that provide only static views do not capture the dynamic nature of software evolution. We present a new visualization technique, the Evolution Storyboard, which provides dynamic views of the evolution of a software's structure. An evolution storyboard consists of a sequence of animated panels, which highlight the structural changes in the system; one panel for each considered time period. Using storyboards, engineers can spot good design, signs of structural decay, or the spread of cross cutting concerns in the code. We implemented our concepts in a tool, which automatically extracts software dependency graphs from version control repositories and computes storyboards based on panels for different time periods. For applying our approach in practice, we provide a step by step guide that others can follow along the storyboard visualizations, in order to study the evolution of large systems. We have applied our method to several large open source software systems. In this paper, we demonstrate that our method provides additional information (compared to static views) on the ArgoUML project, an open source UML modeling tool.", + "author": "Beyer, Dirk and Hassan, Ahmed E", + "booktitle": "Proceedings of the 13th Working Conference on Reverse Engineering", + "doi": "10.1109/wcre.2006.14", + "isbn": "0-7695-2719-1", + "keywords": "type:application, paradigm:node-link, time:animation, evaluation:case\\_study, application:software_engineering, software_evolution", + "pages": "199--210", + "publisher": "IEEE Computer Society", + "references": "Collberg2003System", + "series": "WCRE", + "title": "Animated Visualization of Software History using {Evolution Storyboards}", + "type": "inproceedings", + "year": "2006" + }, + "Boitmanis2008Visualizing": { + "abstract": "We propose a visualization approach for large dynamic graph structures with high degree variation and low diameter. In particular, we reduce visual complexity by multiple modes of representation in a single-level visualization rather than abstractions of lower levels of detail. This is useful for non-interactive display and eases dynamic layout, which we address in the online scenario. Our approach is illustrated on a family of large networks featuring all of the above structural characteristics, the physical Internet on the autonomous systems level over time.", + "author": "Boitmanis, Krists and Brandes, Ulrik and Pich, Christian", + "booktitle": "Graph Drawing", + "doi": "10.1007/978-3-540-77537-9_36", + "keywords": "paradigm:node-link, application:infrastructure, type:application, evaluation:case\\_study, time:animation", + "pages": "365--376", + "publisher": "Springer", + "references": "Brandes1997Bayesian Diehl2002Graphs Erten2004GraphAEL", + "series": "GD", + "title": "Visualizing Internet Evolution on the Autonomous Systems Level", + "type": "inproceedings", + "year": "2008" + }, + "Boyack2009Mapping": { + "abstract": "How does our collective scholarly knowledge grow over time? What major areas of science exist and how are they interlinked? Which areas are major knowledge producers; which ones are consumers? Computational scientometrics \u2014 the application of bibliometric/scientometric methods to large-scale scholarly datasets \u2014 and the communication of results via maps of science might help us answer these questions. This paper represents the results of a prototype study that aims to map the structure and evolution of chemistry research over a 30 year time frame. Information from the combined Science (SCIE) and Social Science (SSCI) Citations Indexes from 2002 was used to generate a disciplinary map of 7,227 journals and 671 journal clusters. Clusters relevant to study the structure and evolution of chemistry were identified using JCR categories and were further clustered into 14 disciplines. The changing scientific composition of these 14 disciplines and their knowledge exchange via citation linkages was computed. Major changes on the dominance, influence, and role of Chemistry, Biology, Biochemistry, and Bioengineering over these 30 years are discussed. The paper concludes with suggestions for future work.", + "author": "Boyack, Kevin W and B{\\\"o}rner, Katy and Klavans, Richard", + "doi": "10.1007/s11192-009-0403-5", + "journal": "Scientometrics", + "keywords": "type:application, time:timeline, paradigm:node-link, evaluation:case_study, application:document", + "number": "1", + "pages": "45--60", + "publisher": "Akad{\\'e}miai Kiad{\\'o} co-published with Springer Science+ Business Media BV, Formerly Kluwer Academic Publishers BV", + "references": "Chen2006CiteSpace", + "title": "Mapping the structure and evolution of chemistry research", + "type": "article", + "volume": "79", + "year": "2009" + }, + "Boyandin2012Qualitative": { + "abstract": "We present a qualitative user study analyzing findings made while exploring changes over time in spatial interactions. We analyzed findings made by the study participants with flow maps, one of the most popular representations of spatial interactions, using animation and small-multiples as two alternative ways of representing temporal changes. Our goal was not to measure the subjects\u2019 performance with the two views, but to find out whether there are qualitative differences between the types of findings users make with these two representations. To achieve this goal we performed a deep analysis of the collected findings, the interaction logs, and the subjective feedback from the users. We observed that with animation the subjects tended to make more findings concerning geographically local events and changes between subsequent years. With small-multiples more findings concerning longer time periods were made. Besides, our results suggest that switching from one view to the other might lead to an increase in the numbers of findings of specific types made by the subjects which can be beneficial for certain tasks.", + "author": "Boyandin, Ilya and Bertini, Enrico and Lalanne, Denis", + "doi": "10.1111/j.1467-8659.2012.03093.x", + "journal": "Computer Graphics Forum", + "keywords": "type:evaluation, time:animation, time:timeline, paradigm:node-link, evaluation:user_study, application:social, fixed_nodes, application:geo", + "number": "3pt2", + "pages": "1005--1014", + "publisher": "Blackwell Publishing Ltd", + "references": "Archambault2011Animation Farrugia2011Effective Saffrey2008Mental", + "series": "CGF", + "title": "A Qualitative Study on the Exploration of Temporal Changes in Flow Maps with Animation and Small-Multiples", + "type": "article", + "volume": "31", + "year": "2012" + }, + "Brandes1997Bayesian": { + "abstract": "Dynamic graph layout refers to the layout of graphs that change over time. These changes are due to user interaction, algorithms, or other underlying processes determining the graph. Typically, users spend a noteworthy amount of time to get familiar with a layout, i.e. they build a mental map [ELMS91]. To retain this map at least partially, consecutive layouts of similar graphs should not differ significantly. Still, each of these layouts should adhere to constraints and criteria that have been specified to improve meaning and readability of a drawing. In [BW97], we introduced random field models for graph layout. As a major advantage of this formulation, many different layout models can be represented uniformly by random variables. This uniformity enables us to now present a framework for dynamic layout of arbitrary random field models. Our approach is based on Bayesian decision theory and formalizes common sense procedures. Example applications of our framework are dynamic versions of two well-known layout models: Eades' spring embedder [Ead84], and Tamassia's bend-minimum orthogonal layout model for plane graphs [Tam87].", + "author": "Brandes, Ulrik and Wagner, Dorothea", + "booktitle": "Graph Drawing", + "doi": "10.1007/3-540-63938-1_66", + "keywords": "paradigm:node-link, time:animation, type:technique, force-directed\\_layout, orthogonal\\_layout, evaluation:none, application:generic, mental\\_map, online_problem, general-purpose_layout", + "pages": "236--247", + "publisher": "Springer", + "series": "GD", + "title": "A {Bayesian} Paradigm for Dynamic Graph Layout", + "type": "inproceedings", + "year": "1997" + }, + "Brandes2003Visual": { + "abstract": "We introduce a method for visualizing evolving networks. In addition to the intermediate states of the network, it conveys the nature of change between states 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 networks of dynamic discourse as the driving application, but the method extends to any type of networks evolving in similar ways.", + "author": "Brandes, Ulrik and Corman, Steven R", + "doi": "10.1057/palgrave.ivs.9500037", + "issn": "1473-8724", + "journal": "Information Visualization", + "keywords": "application:social, 3d, time:timeline, paradigm:node-link, evaluation:case\\_study, type:technique, superimposed_node-link, force-directed_layout, fixed_nodes", + "number": "1", + "pages": "40--50", + "publisher": "SAGE Publications", + "references": "Misue1995Layout", + "title": "Visual Unrolling of Network Evolution and the Analysis of Dynamic Discourse", + "type": "article", + "volume": "2", + "year": "2003" + }, + "Brandes2006Affiliation": { + "abstract": "We propose a visualization approach for dynamic affiliation networks in which events are characterized by a set of descriptors. It uses a radial ripple metaphor to display the passing of time and conveys relations among the different constituents through appropriate layout. Our method is particularly suitable when assuming an egocentric perspective, and we illustrate it on movie-actor biographies.", + "author": "Brandes, Ulrik and Hoefer, Martin and Pich, Christian", + "booktitle": "Proceedings of the 8th Joint Eurographics / IEEE VGTC Conference on Visualization", + "doi": "10.2312/VisSym/EuroVis06/179-186", + "keywords": "ego_network, type:application, application:media, time:timeline, time:animation, evaluation:case_study, paradigm:node-link, radial", + "pages": "179--186", + "publisher": "Eurographics Association", + "series": "EuroVis", + "title": "Affiliation Dynamics with an Application to Movie-Actor Biographies.", + "type": "inproceedings", + "year": "2006" + }, + "Brandes2006Dynamic": { + "abstract": "Spectral methods are naturally suited for dynamic graph layout, because moderate changes of a graph yield moderate changes of the layout under weak assumptions. We discuss some general principles for dynamic graph layout and derive a dynamic spectral layout approach for the animation of small-world models.", + "author": "Brandes, Ulrik and Fleischer, Daniel and Puppe, Thomas", + "booktitle": "Graph Drawing", + "doi": "10.1007/11618058_3", + "keywords": "type:technique, paradigm:node-link, time:animation, evaluation:case_study, application:generic, online_problem, special-purpose_layout", + "pages": "25--36", + "publisher": "Springer", + "references": "Diehl2001Preserving Friedrich2002Graph Misue1995Layout", + "series": "GD", + "title": "Dynamic Spectral Layout of Small Worlds", + "type": "inproceedings", + "year": "2006" + }, + "Brandes2011Asymmetric": { + "abstract": "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.", + "author": "Brandes, Ulrik and Nick, Bobo", + "doi": "10.1109/TVCG.2011.169", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "type:technique, paradigm:matrix, time:timeline, evaluation:case\\_study, evaluation:expert, application:social, gestalt\\_laws, sparklines, directed_graph, multivariate_graph, intra-cell_timelines", + "number": "12", + "pages": "2283--2290", + "publisher": "IEEE", + "references": "Brandes2012Visualization Frishman2008Online Moody2005Dynamic Nesbitt2002Applying Stein2010PixelOriented Yi2010TimeMatrix", + "series": "TVCG", + "title": "Asymmetric Relations in Longitudinal Social Networks", + "type": "article", + "volume": "17", + "year": "2011" + }, + "Brandes2012Quantitative": { + "abstract": "In dynamic graph drawing, the input is a sequence of graphs for which a sequence of layouts is to be generated such that the quality of individual layouts is balanced with layout stability over time. Qualitatively different extensions of drawing algorithms for static graphs to the dynamic case have been proposed, but little is known about their relative utility. We report on a quantitative study comparing the three prototypical extensions via their adaptation for the stress-minimization framework. While some findings are more subtle, the linking approach connecting consecutive instances of the same vertex is found to be the overall method of choice.", + "author": "Brandes, Ulrik and Mader, Martin", + "booktitle": "Graph Drawing", + "doi": "10.1007/978-3-642-25878-7_11", + "keywords": "type:evaluation, paradigm:node-link, time:animation, evaluation:algorithmic, application:social, offline\\_problem, mental\\_map", + "organization": "Springer", + "pages": "99--110", + "references": "Brandes2003Visual Huang1998Online Misue1995Layout Moody2005Dynamic", + "series": "GD", + "title": "A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing", + "type": "inproceedings", + "year": "2012" + }, + "Brandes2012Visualization": { + "abstract": "As a consequence of the rising interest in longitudinal social networks and their analysis, there is also an increasing demand for tools to visualize them. We argue that similar adaptations of state-of-the-art graph-drawing methods can be used to visualize both, longitudinal networks and predictions of stochastic actor-oriented models (SAOMs), the most prominent approach for analyzing such networks. The proposed methods are illustrated on a longitudinal network of acquaintanceship among university freshmen.", + "author": "Brandes, Ulrik and Indlekofer, Natalie and Mader, Martin", + "doi": "10.1016/j.socnet.2011.06.002", + "journal": "Social Networks", + "keywords": "type:application, paradigm:node-link, time:animation, evaluation:case\\_study, application:social", + "number": "3", + "pages": "291--308", + "publisher": "Elsevier", + "references": "Dwyer2004Visualising Friedrich2002Graph Frishman2008Online Groh2009Interactively Huang1998Online Misue1995Layout Moody2005Dynamic Nesbitt2002Applying Saffrey2008Mental", + "title": "Visualization methods for longitudinal social networks and stochastic actor-oriented modeling", + "type": "article", + "volume": "34", + "year": "2012" + }, + "Branke2001Dynamic": { + "abstract": "Many graph drawing (GD) scenarios are dynamic inasmuch as they involve a repeated redrawing of the graph after frequently occurring changes to the graph structure and/or some layout properties.", + "author": "Branke, J\\\"urgen", + "booktitle": "Drawing graphs", + "doi": "10.1007/3-540-44969-8_9", + "keywords": "type:evaluation, paradigm:node-link, time:animation, evaluation:survey, application:generic, mental_map, orthogonal_layout, 3D, force-directed_layout, hierarchical_layout, directed_graph", + "pages": "228--246", + "publisher": "Springer", + "title": "Dynamic Graph Drawing", + "type": "incollection", + "year": "2001" + }, + "Brasch2012VENLO": { + "abstract": "To understand life, it is fundamental to elucidate the evolution and function of biological networks in multiple species. Recently it has become possible to reconstruct the evolution of specific biological networks for several species. The data resulting from these reconstructions consists of ancestral networks and gene trees. To analyze such data, interactive visual methods are needed. We present a system that is able to visualize the evolution of biological networks in many species. We start with providing a comprehensible overview of the entire data set and provide details of the data upon demand via interaction mechanisms to select interesting subsets of the data. The selected subsets can be visualized using two main visualization types: (a) as network alignments in 2.5D (or other known) layouts or (b) as an animation of evolving networks. We developed a graph layout algorithm supporting the comparison of networks across both species and time steps without changing the graph layout while switching between the overview, the animated view, and the alignment view.We evaluate our system by applying it to real-world data.", + "author": "Brasch, Steffen and Fuellen, Georg and Linsen, Lars", + "booktitle": "Visualization in Medicine and Life Sciences II", + "doi": "10.1007/978-3-642-21608-4_13", + "keywords": "application:biology, type:application, paradigm:node-link, time:timeline, time:animation, 3D, evaluation:none, superimposed_node-link", + "pages": "229--247", + "publisher": "Springer", + "references": "Brandes2003Visual Erten2004Simultaneous Gorg2005Dynamic", + "title": "{VENLO}: Interactive Visual Exploration of Aligned Biological Networks and Their Evolution", + "type": "incollection", + "year": "2012" + }, + "Burch2008TimeRadarTrees": { + "abstract": "The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize such sequences of graphs. It uses radial tree layout to draw the hierarchy, and circle sectors to represent the temporal change of edges in the digraphs. We have developed several interaction techniques that allow the users to explore the structural and temporal data. Smooth animations help them to track the transitions between views. The usefulness of the approach is illustrated by examples from very different application domains.", + "author": "Burch, Michael and Diehl, Stephan", + "doi": "10.1111/j.1467-8659.2008.01213.x", + "journal": "Computer Graphics Forum", + "keywords": "radial, paradigm:matrix, time:timeline, directed_graph, weighted_graph, compound_graph, application:sports, application:business, type:technique, evaluation:case\\_study, application:software\\_engineering, layered_matrices", + "number": "3", + "pages": "823--830", + "publisher": "Blackwell Publishing Ltd", + "references": "Elmqvist2003Causality", + "series": "CGF", + "survey:data": "(n:21, e:1300, t:14)", + "title": "{TimeRadarTrees}: Visualizing dynamic compound digraphs", + "type": "article", + "volume": "27", + "year": "2008" + }, + "Burch2010TimeSpiderTrees": { + "abstract": "Graphs are a mathematical method to model relations between objects. The most common metaphor to visualize graphs is the node-link technique, which typically suffers from visual clutter caused by many edge crossings. Much research has been done on the development of sophisticated algorithms aimed at enhancing the layout with respect to edge crossings and a series of other aesthetic criteria. In this paper we propose a novel visual metaphor, called Time-SpiderTrees, which is based on a radial layout. In our technique, relations are visually indicated by orientation instead of connectedness to circumvent the problem of edge crossings. The strength of this novel visualization technique lies in the visual encoding of time-series relational data in a single view without animation, which helps to preserve the mental map and hence to reduce cognitive efforts.", + "author": "Burch, Michael and Fritz, Michael and Beck, Fabian and Diehl, Stephan", + "booktitle": "Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing", + "doi": "10.1109/vlhcc.2010.31", + "isbn": "978-0-7695-4206-5", + "keywords": "application:document, application:sports, radial, paradigm:node-link, directed_graph, weighted_graph, compound_graph, time:timeline, evaluation:case\\_study, type:technique, juxtaposed_node-link, omitted_links", + "pages": "168--175", + "publisher": "IEEE", + "references": "Beck2009Aesthetic", + "series": "VL/HCC", + "survey:data": "(n:15, e:?, t:5), (n:21, e:1300, t:14)", + "title": "{TimeSpiderTrees}: A Novel Visual Metaphor for Dynamic Compound Graphs", + "type": "inproceedings", + "year": "2010" + }, + "Burch2011Layered": { + "abstract": "We introduce a novel technique for visualizing dense time-varying directed and weighted multi-graphs with an additional hierarchical organization of the graph nodes. Combining Indented Tree Plots and TimeRadarTrees, we show the temporal evolution of relations in a static view. The graph edges are layered around thumbnail wheels consisting of color-coded sectors that are representatives of the graph nodes. These sectors generate implicit representations of graph edges. Start and target vertices are perceived by inspecting the color coding of sectors in the context of other sectors and their orientations. The technique puts emphasis on newer relations and hence, these are mapped to a larger display space in the radial diagram. The benefit of our technique is reduction of visual clutter from which node-link diagrams typically suffer. The visualization focuses on an easy exploration of trends, countertrends, periodicity, temporal shifts, and anomalies in time-varying relational data. We demonstrate the usefulness of the approach by applying it to dense dynamic graph data acquired from a soccer match of the 2D Soccer Simulation League.", + "author": "Burch, Michael and H\\\"oferlin, Markus and Weiskopf, Daniel", + "booktitle": "Proceedings of the 15th International Conference on Information Visualisation", + "doi": "10.1109/IV.2011.93", + "keywords": "application:sports, paradigm:matrix, radial, compound_graph, weighted_graph, directed_graph, type:technique, evaluation:case\\_study, time:timeline, layered_matrices", + "pages": "18--25", + "publisher": "IEEE", + "references": "Archambault2011Animation Beck2009Aesthetic Burch2008TimeRadarTrees Frishman2008Online Greilich2009Visualizing Misue1995Layout", + "series": "IV", + "survey:data": "(n:34, e:complete, t:6000)", + "title": "Layered {TimeRadarTrees}", + "type": "inproceedings", + "year": "2011" + }, + "Burch2011Parallel": { + "abstract": "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.", + "author": "Burch, Michael and Vehlow, Corinna and Beck, Fabian and Diehl, Stephan and Weiskopf, Daniel", + "doi": "10.1109/tvcg.2011.226", + "issn": "1077-2626", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "paradigm:node-link, application:document, application:software\\_engineering, mental\\_map, time:timeline, bipartite, compound_graph, weighted_graph, directed_graph, graph\\_difference, type:technique, evaluation:case\\_study, juxtaposed_node-link", + "number": "12", + "pages": "2344--2353", + "publisher": "IEEE", + "references": "Archambault2011Animation Brandes2003Visual Burch2008TimeRadarTrees Collberg2003System Frishman2008Online Greevy2006Visualizing Greilich2009Visualizing Ogawa2009codeswarm", + "series": "TVCG", + "survey:data": "(n:2817, e:15339, t:21), (n:?, e:264311, t:21), (n:?, e:412416, t:21)", + "title": "{Parallel Edge Splatting} for Scalable Dynamic Graph Visualization", + "type": "article", + "volume": "17", + "year": "2011" + }, + "Burch2012Radial": { + "abstract": "We describe and discuss a novel radial version of a scalable dynamic graph visualization. The radial layout encodes dynamic directed graphs on narrow rings of a circle. The temporal evolution of the graph is mapped to rings that grow outward from the center of the circle. Graph vertices are placed equidistantly at the borderlines of each ring. Graph edges are displayed as curved lines starting from a source on the inner borderline of the ring and pointing to a target on the outer borderline. To better perceive link directions and structures of large datasets, visual clutter is reduced by exploiting an edge splatting approach that generates density fields of the displayed edges. The radial layout emphasizes newer graphs, displayed in the larger, outer parts of the circle. As a benefit, edge lengths are reduced in comparison to the non-radial visualization. Moreover, the radial layout guarantees the symmetry of the visualization under shifting of vertices. We illustrate the usefulness of the diagrams by applying them to call graph data of the open source software project Cobertura.", + "author": "Burch, Michael and Beck, Fabian and Weiskopf, Daniel", + "booktitle": "Proceedings of the 4th International Conference on Information Visualization Theory and Applications", + "doi": "10.5220/0003828506030612", + "keywords": "paradigm:node-link, radial, application:software\\_engineering, type:technique, evaluation:case\\_study, time:timeline, bipartite, compound_graph, weighted_graph, directed_graph, juxtaposed_node-link", + "pages": "603--612", + "publisher": "SciTePress", + "references": "Brandes2011Asymmetric Burch2008TimeRadarTrees Burch2011Parallel Frishman2008Online Greilich2009Visualizing Misue1995Layout Stein2010PixelOriented Yi2010TimeMatrix", + "series": "IVAPP", + "survey:data": "(n:4812, e:27208, t:14)", + "title": "{Radial Edge Splatting} For Visualizing Dynamic Directed Graphs", + "type": "inproceedings", + "year": "2012" + }, + "Burch2012Visualizing": { + "abstract": "Visualizing time-varying call graphs is challenging due to vast amounts of data at many dimensions to be displayed: Hierarchically organized vertices with attributes, directed or undirected edges with weights, and time. In this paper, we introduce a novel overview representation that shows dynamic graphs as a timeline- and pixel-based aggregated view targeting the preservation of a viewer's mental map by encoding the time-varying data into a static diagram. This view allows comparisons of dynamic call graphs on different levels of hierarchical granularity. Our data extraction and visualization system uses this overview as a starting point for further investigations by applying existing dynamic graph visualization techniques that show the graph structures and properties more clearly. These more task-specific visualizations show the dynamic graph data from different perspectives such as curved node-link diagrams or glyph-based representations combined by linking and brushing. Intermediate analysis steps can be stored and rebuilt at any time by using corresponding thumbnail representations.", + "author": "Burch, Michael and M\\\"uller, Christoph and Reina, Guido and Schmauder, Hansj\\\"org and Greis, Miriam and Weiskopf, Daniel", + "booktitle": "Vision, Modeling \\& Visualization", + "doi": "10.2312/PE/VMV/VMV12/207-214", + "keywords": "type:application, application:software_engineering, time:timeline, paradigm:node-link, evaluation:none", + "organization": "The Eurographics Association", + "pages": "207--214", + "references": "Beck2012Rapid Brandes2003Visual Burch2008TimeRadarTrees Burch2011Parallel Collberg2003System Frishman2008Online Greilich2009Visualizing Misue1995Layout Ogawa2009codeswarm", + "series": "VMV", + "title": "Visualizing Dynamic Call Graphs", + "type": "inproceedings", + "year": "2012" + }, + "Burch2013MatrixBased": { + "abstract": "We introduce a matrix-based visualization technique for exploring time-varying directed and weighted graphs. Two overview representations are shown: one for the time-aggregated relations with attached quantitative weighted attributes and one for the results of an automatic dynamic pattern identification algorithm, i.e., relations accompanied by categorical attributes. Apart from a dynamic edge pattern categorization, our tool can also compute graph-specific properties---such as shortest paths or the existence of cliques---and highlight their evolution over time. The visualization method is complemented by interaction techniques that allow the user to navigate, explore, and browse the data, based on the Visual Information Seeking Mantra---overview first, zoom and filter, then details-on-demand. If an additional hierarchical organization of the vertices is available, this is attached to the matrix by vertical and horizontal layered icicle plots allowing one to explore the data on different levels of hierarchical granularity. The usefulness of the tool is demonstrated by applying it to time-varying migration data in the hierarchically structured world.", + "author": "Burch, Michael and Schmidt, Benjamin and Weiskopf, Daniel", + "booktitle": "Proceedings of the 17th International Conference Information Visualisation", + "doi": "10.1109/IV.2013.8", + "keywords": "type:technique, time:timeline, paradigm:matrix, application:social, evaluation:case_study, compound_graph, directed_graph, sparklines, intra-cell_timelines", + "pages": "66-73", + "publisher": "IEEE", + "references": "Burch2008TimeRadarTrees Burch2011Parallel Frishman2008Online Yi2010TimeMatrix Brandes2011Asymmetric Stein2010PixelOriented", + "series": "IV", + "title": "A Matrix-Based Visualization for Exploring Dynamic Compound Digraphs", + "type": "inproceedings", + "year": "2013" + }, + "Burch2014Dynamic": { + "abstract": "During eye tracking studies, vast amounts of spatio-temporal data in the form of eye gaze trajectories are recorded. Finding insights into these time-varying data sets is a challenging task. Visualization techniques such as heat maps or gaze plots help find patterns in the data but either highly aggregate the data (heat maps) or are difficult to read due to overplotting (gaze plots). In this paper, we propose transforming eye movement data into a dynamic graph data structure to explore the visualization problem from a new perspective. By aggregating gaze trajectories of participants over time periods or Areas of Interest (AOIs), a fair trade-off between aggregation and details is achieved. We show that existing dynamic graph visualizations can be used to display the transformed data and illustrate the approach by applying it to eye tracking data recorded for investigating the readability of tree diagrams.", + "author": "Burch, Michael and Beck, Fabian and Raschke, Michael and Blascheck, Tanja and Weiskopf, Daniel", + "booktitle": "Proceedings of the Symposium on Eye Tracking Research and Applications", + "doi": "10.1145/2578153.2578175", + "keywords": "type:application, time:generic, paradigm:generic, evaluation:case_study, application:eye_tracking", + "pages": "151--158", + "references": "Archambault2011Animation Beck2009Aesthetic Beck2013Matching Brandes2003Visual Brandes2011Asymmetric Burch2008TimeRadarTrees Burch2011Parallel Burch2013MatrixBased Frishman2008Online Hurter2013Bundled Purchase2007Important Stein2010PixelOriented", + "series": "ETRA", + "title": "A Dynamic Graph Visualization Perspective on Eye Movement Data", + "type": "inproceedings", + "year": "2014" + }, + "Burch2014FlipBook": { + "abstract": "Dynamic graph visualization techniques can be based on animated or static diagrams showing the evolution over time. In this paper, we apply the concept of small multiples representations to visually illustrate the dynamics of a graph. Node-link diagrams are used as the basic visual metaphor for displaying individual graphs of the sequence. To improve the readability of the diagram and reduce visual clutter we apply an edge splatting technique. Here, we discuss the benefits of splatted radial graph layouts on a modifiable 2D grid. Moreover, to obtain a more scalable dynamic graph visualization we interactively support a graph analyst by a Rapid Serial Visual Presentation (RSVP) feature to rapidly flip between the sequences of displayed graphs. The usefulness of the technique is illustrated in two case studies investigating a dynamic call graph and an evolving social network that consists of more than 1,000 graphs.", + "author": "Burch, Michael and Weiskopf, Daniel", + "booktitle": "Proceedings of the 7th International Symposium on Visual Information Communication and Interaction", + "doi": "10.1145/2636240.2636839", + "keywords": "type:technique, time:timeline, time:animation, paradigm:node-link, juxtaposed_node-link, evaluation:case_study, application:software_engineering, application:social, fixed_nodes, radial, linear_arrangement, offline_problem, software_evolution", + "pages": "29--38", + "publisher": "ACM", + "references": "Archambault2011Animation Beck2014State Beck2012Rapid Brandes2011Asymmetric Burch2012Radial Burch2008TimeRadarTrees Burch2011Parallel Frishman2008Online Ghani2012Perception Purchase2007Important Rufiange2013DiffAni Stein2010PixelOriented", + "series": "VINCI", + "title": "A Flip-Book of Edge-Splatted Small Multiples for Visualizing Dynamic Graphs", + "type": "inproceedings", + "year": "2014" + }, + "Burch2015Edge-Stacked": { + "abstract": "We investigate the problem of visually encoding time-varying weighted digraphs to provide an overview about dynamic graphs. Starting from a rough overview of dynamic relational data an analyst can subsequently explore the data in more detail to gain further insights. To reach this goal we first map the graph vertices in the graph sequence to a common horizontal axis. Edges between vertices are represented as stacked horizontal and color-coded links starting and ending at their corresponding start and end vertex positions. The direction of each edge is indicated by placing it either above or below the horizontal vertex line. We attach a vertically aligned timeline to each link to show the weight evolution for those links. The order of the vertices and stacked edges is important for the readability of the visualization. We support interactive reordering and sorting in the vertex, edge, and timeline representations. The usefulness of our edge-stacked timelines is illustrated in a case study showing dynamic call graph data from software development.", + "author": "Burch, Michael and Munz, Tanja and Weiskopf, Daniel", + "booktitle": "Proceedings of the International Conference on Information Visualization Theory and Applications", + "doi": "10.5220/0005259200930100", + "keywords": "type:technique, time:timeline, directed_graph, paradigm:node-link, application:software_engineering, program_execution, evaluation:case_study, compound_graph, weighted_graph, linear_arrangement, integrated_node-link", + "references": "Archambault2011Animation Beck2009Aesthetic Beck2013Matching Beck2014State Brandes2003Visual Brandes2011Asymmetric Burch2008TimeRadarTrees Burch2013MatrixBased Burch2011Parallel Purchase2007Important Stein2010PixelOriented Vehlow2013Radial", + "series": "IVAPP", + "title": "Edge-Stacked Timelines for Visualizing Dynamic Weighted Digraphs", + "type": "inproceedings", + "year": "2015" + }, + "Burch2015FlipBook": { + "abstract": "Dynamic graph visualization techniques can be based on animated or static diagrams showing the evolution over time. In this paper, we apply the concept of small multiples to visually illustrate the dynamics of a graph. Node-link, adjacency matrix, and adjacency list visualizations are used as basic visual metaphors for displaying individual graphs of the sequence. For node-link diagrams, we apply edge splatting to improve readability and reduce visual clutter caused by overlaps and link crossings. Additionally, to obtain a more scalable dynamic graph visualization in the time dimension, we integrate an interactive Rapid Serial Visual Presentation (RSVP) feature to rapidly flip between the sequences of displayed graphs, similar to the concept of flipping a book\u2019s pages. Our visualization tool supports the focus-and-context design principle by providing an overview of a longer time sequence as small multiples in a grid while also showing a graph in focus as a large single representation in a zoomed in and more detailed view. The usefulness of the technique is illustrated in two case studies investigating a dynamic directed call graph and an evolving social network that consists of more than 1,000 undirected graphs.", + "author": "Burch, Michael and Weiskopf, Daniel", + "comment": "extended version of Burch2014FlipBook", + "journal": "International Journal of Software and Informatics", + "keywords": "type:technique, time:timeline, time:animation, paradigm:node-link, juxtaposed_node-link, evaluation:case_study, application:software_engineering, application:social, fixed_nodes, radial, linear_arrangement, offline_problem, software_evolution, paradigm:matrix, paradigm:list", + "references": "Archambault2011Animation Beck2014State Beck2012Rapid Brandes2011Asymmetric Burch2008TimeRadarTrees Burch2012Visualizing Burch2011Parallel Frishman2008Online Ghani2012Perception Hlawatsch2014Visual Purchase2007Important Rufiange2013DiffAni Rufiange2014AniMatrix Stein2010PixelOriented", + "title": "Flip-Book Visualization of Dynamic Graphs", + "type": "article", + "year": "2015" + }, + "Cengiz2013Visualization": { + "abstract": "Visualisations of temporal social network datasets have the potential to be complex and require a lot of cognitive input. In this paper, we present a novel visualisation approach that depicts both relational and statistical information of evolving social structures. The underlying framework is implemented by the usage of Hyperbolic Geometry to support focus context rendering. The proposed method guarantees representing prominent social actors through scaling their representations, preserves user's mental map, and provides the user to reduce visual clutter by means of filtering.", + "author": "Cengiz Turker, Uraz and Balcisoy, Selim", + "doi": "10.1016/j.jvlc.2013.10.008", + "journal": "Journal of Visual Languages \\& Computing", + "keywords": "paradigm:node-link, mental\\_map, type:application, time:animation, evaluation:case\\_study, evaluation:user\\_study, evaluation:algorithmic, application:social, network\\_metrics, radial", + "number": "3", + "pages": "227--242", + "publisher": "Elsevier", + "references": "Frishman2008Online Kumar2006Visual Shi2011Dynamic Ghani2012Perception", + "title": "A Visualization Technique for Large Temporal Social Network Datasets in Hyperbolic Space", + "type": "article", + "volume": "25", + "year": "2013" + }, + "Chen2003Visualizing": { + "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.", + "author": "Chen, Chaomei and Morris, Steven", + "booktitle": "Proceedings of the 2003 IEEE Symposium on Information Visualization", + "doi": "10.1109/INFVIS.2003.1249010", + "keywords": "type:evaluation, time:animation, paradigm:node-link, evaluation:case_study, application:document, 3d", + "pages": "67--74", + "publisher": "IEEE", + "series": "InfoVis", + "title": "Visualizing evolving networks: Minimum spanning trees versus pathfinder networks", + "type": "inproceedings", + "year": "2003" + }, + "Chen2006CiteSpace": { + "abstract": "This article describes the latest development of a generic approach to detecting and visualizing emerging trends and transient patterns in scientific literature. The work makes substantial theoretical and methodological contributions to progressive knowledge domain visualization. A specialty is conceptualized and visualized as a time-variant duality between two fundamental concepts in information science: research fronts and intellectual bases. A research front is defined as an emergent and transient grouping of concepts and underlying research issues. The intellectual base of a research front is its citation and co-citation footprint in scientific literature\u2014an evolving network of scientific publications cited by research-front concepts. Kleinberg's (2002) burst-detection algorithm is adapted to identify emergent research-front concepts. Freeman's (1979) betweenness centrality metric is used to highlight potential pivotal points of paradigm shift over time. Two complementary visualization views are designed and implemented: cluster views and time-zone views. The contributions of the approach are that (a) the nature of an intellectual base is algorithmically and temporally identified by emergent research-front terms, (b) the value of a co-citation cluster is explicitly interpreted in terms of research-front concepts, and (c) visually prominent and algorithmically detected pivotal points substantially reduce the complexity of a visualized network. The modeling and visualization process is implemented in CiteSpace II, a Java application, and applied to the analysis of two research fields: mass extinction (1981\u20132004) and terrorism (1990\u20132003). Prominent trends and pivotal points in visualized networks were verified in collaboration with domain experts, who are the authors of pivotal-point articles. Practical implications of the work are discussed. A number of challenges and opportunities for future studies are identified.", + "author": "Chen, Chaomei", + "doi": "10.1002/asi.20317", + "journal": "Journal of the American Society for Information Science and Technology", + "keywords": "type:application, application:document, paradigm:node-link, time:timeline, evaluation:case_study, evaluation:expert", + "number": "3", + "pages": "359--377", + "publisher": "Wiley Subscription Services, Inc., A Wiley Company", + "title": "{CiteSpace II}: Detecting and visualizing emerging trends and transient patterns in scientific literature", + "type": "article", + "volume": "57", + "year": "2006" + }, + "Cohen1992Framework": { + "abstract": "In this paper we give a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing. We present dynamic algorithms for drawing planar graphs that use a variety of drawing standards (such as polyline, straight-line, orthogonal, grid, upward, and visibility drawings), and address aesthetic criteria that are important for readability, such as the display of planarity, symmetry, and reachability. Also, we provide techniques that are especially tailored for important subclasses of planar graphs such as trees and series-parallel digraphs. Our dynamic drawing algorithms have the important property of performing \"smooth updates\" of the drawing. Of special geometric interest is the possibility of performing point-location and window queries on the implicit representation of the drawing.", + "author": "Cohen, Robert F and Di Battista, Giuseppe and Tamassia, Roberto and Tollis, Ioannis G and Bertolazzi, Paola", + "booktitle": "Proceedings of the 8th Annual Symposium on Computational Geometry", + "doi": "10.1145/142675.142728", + "keywords": "paradigm:node-link, time:animation, planar_graph, evaluation:theoretical, type:technique, application:generic, online_problem, special-purpose_layout", + "organization": "ACM", + "pages": "261--270", + "series": "SoCG", + "title": "A Framework for Dynamic Graph Drawing", + "type": "inproceedings", + "year": "1992" + }, + "Cohen1995Dynamic": { + "abstract": "Drawing graphs is an important problem that combines elements of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows: We devise a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, and we show its applications. We present efficient dynamic drawing algorithms for trees and series-parallel digraphs. As further applications of the model, we give dynamic drawing algorithms for planar st-digraphs and planar graphs. Our algorithms adopt a variety of representations (e.g., straight line, polyline, visibility) and update the drawing in a smooth way.", + "author": "Cohen, Robert F and Di Battista, Giuseppe and Tamassia, Roberto and Tollis, Ioannis G", + "comment": "appeared as a technical report in 1992; is an extended version of [Cohen1992Framework]", + "doi": "10.1137/S0097539792235724", + "journal": "SIAM Journal on Computing", + "keywords": "paradigm:node-link, time:animation, planar_graph, evaluation:theoretical, type:technique, application:generic, online_problem, special-purpose_layout", + "number": "5", + "pages": "970--1001", + "publisher": "SIAM", + "title": "Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and st-Digraphs", + "type": "article", + "volume": "24", + "year": "1995" + }, + "Collberg2003System": { + "abstract": "We describe GEVOL, a system that visualizes the evolution of software using a novel graph drawing technique for visualization of large graphs with a temporal component. GEVOL extracts information about a Java program stored within a CVS version control system and displays it using a temporal graph visualizer. This information can be used by programmers to understand the evolution of a legacy program: Why is the program structured the way it is? Which programmers were responsible for which parts of the program during which time periods? Which parts of the program appear unstable over long periods of time and may need to be rewritten? This type of information will complement that produced by more static tools such as source code browsers, slicers, and static analyzers.", + "author": "Collberg, Christian and Kobourov, Stephen G and Nagra, Jasvir and Pitts, Jacob and Wampler, Kevin", + "booktitle": "Proceedings of the 2003 ACM Symposium on Software Visualization", + "doi": "10.1145/774833.774844", + "keywords": "type:application, paradigm:node-link, time:animation, evaluation:case_study, application:software_engineering, offline_problem, fixed_nodes, software_evolution", + "organization": "ACM", + "pages": "77--86", + "references": "Cohen1995Dynamic", + "series": "SoftVis", + "title": "A system for graph-based visualization of the evolution of software", + "type": "inproceedings", + "year": "2003" + }, + "Curtis2012Enabling": { + "abstract": "Many biological processes are context-dependent or temporally specific. As a result, relationships between molecular constituents evolve across time and environments. While cutting-edge machine learning techniques can recover these networks, exploring and interpreting the rewiring behavior is challenging. Information visualization shines in this type of exploratory analysis, motivating the development ofTVNViewer (http://sailing.cs.cmu.edu/tvnviewer webcite), a visualization tool for dynamic network analysis. In this paper, we demonstrate visualization techniques for dynamic network analysis by using TVNViewer to analyze yeast cell cycle and breast cancer progression datasets. TVNViewer is a powerful new visualization tool for the analysis of biological networks that change across time or space.", + "author": "Curtis, Ross E and Xiang, Jing and Parikh, Ankur and Kinnaird, Peter and Xing, Eric P", + "doi": "10.1186/1471-2105-13-204", + "journal": "BMC Bioinformatics", + "keywords": "type:application, paradigm:node-link, application:biology, evaluation:case_study, time:timeline, radial", + "number": "204", + "pages": "1--13", + "publisher": "BioMed Central Ltd", + "title": "Enabling dynamic network analysis through visualization in {TVNViewer}", + "type": "article", + "volume": "13", + "year": "2012" + }, + "Diehl2001Preserving": { + "abstract": "First we introduce the concept of graph animations as a sequence of evolving graphs and a generic algorithm which computes a Foresighted Layout for dynamically drawing these graphs while preserving the mental map. The algorithm is generic in the sense that it takes a static graph drawing algorithm as a parameter. In other words, trees can be animated with a static tree layouter, graphs with a static Sugiyama-style layouter or a spring embedder, etc. Second we discuss applications of Foresighted Layout in algorithm animation and visualization of navigation behaviour.", + "author": "Diehl, Stephan and G\\\"org, Carsten and Kerren, Andreas", + "booktitle": "Proceedings of the 3rd Joint Eurographics--IEEE TCVG Conference on Visualization", + "comment": "appeared as a technical report in 2000", + "doi": "10.2312/VisSym/VisSym01/175-184", + "keywords": "type:technique, offline_problem, paradigm:node-link, time:animation, application:software_engineering, mental_map, 3d, evaluation:case_study, general-purpose_layout", + "organization": "Eurographics Association", + "pages": "175--184", + "references": "Misue1995Layout", + "series": "VisSym", + "title": "Preserving the mental map using foresighted layout", + "type": "inproceedings", + "year": "2001" + }, + "Diehl2002Graphs": { + "abstract": "In this paper we present a generic algorithm for drawing sequences of graphs. This algorithm works for different layout algorithms and related metrics and adjustment strategies. It differs from previous work on dynamic graph drawing in that it considers all graphs in the sequence (offline) instead of just the previous ones (online) when computing the layout for each graph of the sequence. We introduce several general adjustment strategies and give examples of these strategies in the context of force-directed graph layout. Finally some results from our first prototype implementation are discussed.", + "author": "Diehl, Stephan and G\\\"org, Carsten", + "booktitle": "Graph Drawing", + "doi": "10.1007/3-540-36151-0_3", + "isbn": "3-540-00158-1", + "journal": "Graph Drawing", + "keywords": "paradigm:node-link, mental\\_map, time:animation, offline\\_problem, evaluation:case\\_study, type:technique, application:generic, general-purpose_layout", + "pages": "23--31", + "posted-at": "2009-07-07 09:50:35", + "priority": "0", + "publisher": "Springer-Verlag", + "references": "Branke2001Dynamic Cohen1995Dynamic Diehl2001Preserving Misue1995Layout", + "series": "GD", + "title": "Graphs, They are Changing -- Dynamic Graph Drawing for a Sequence of Graphs", + "type": "incollection", + "year": "2002" + }, + "Dutot2007GraphStream": { + "abstract": "The notion of complex systems is common to many domains, from Biology to Economy, Computer Science, Physics, etc. Often, these systems are made of sets of entities moving in an evolving environment. One of their major characteristics is the emergence of some global properties stemmed from local interactions between the entities themselves and between the entities and the environment. The structure of these systems as sets of interacting entities leads researchers to model them as graphs. However, their understanding requires most often to consider the dynamics of their evolution. It is indeed not relevant to study some properties out of any temporal consideration. Thus, dynamic graphs seem to be a very suitable model for investigating the emergence and the conservation of some properties. GraphStream is a Java-based library whose main purpose is to help researchers and developers in their daily tasks of dynamic problem modeling and of classical graph management tasks: creation, processing, display, etc. It may also be used, and is indeed already used, for teaching purpose. GraphStream relies on an event-based engine allowing several event sources. Events may be included in the core of the application, read from a file or received from an event handler.", + "author": "Dutot, Antoine and Guinand, Fr{\\'e}d{\\'e}ric and Olivier, Damien and Pign{\\'e} Yoann", + "booktitle": "Emergent Properties in Natural and Artificial Complex Systems, Satellite Conference within the 4th European Conference on Complex Systems (ECCS'2007)", + "keywords": "paradigm:node-link, type:application, paradigm:node-link, time:animation, evaluation:case_study, application:infrastructure", + "pages": "1--10", + "series": "ECCS", + "title": "{GraphStream}: A tool for bridging the gap between complex systems and dynamic graphs", + "type": "inproceedings", + "url": "http://hal.archives-ouvertes.fr/hal-00264043/", + "year": "2007" + }, + "Dwyer2002Visualising": { + "abstract": "We describe a paradigm for visualising time dependent flow in a network of objects connected by abstract relationships (a graph) by representing time in the third dimension. We show two variants of the paradigm, one in which the elements of the graph are shown as vertical columns of varying width and another which emphasises centrality with bending \"worms\". We demonstrate these techniques by visualising the movements of Fund Managers within the UK Stock Market in terms of their changing share ownership over time.", + "author": "Dwyer, Tim and Eades, Peter", + "booktitle": "Proceedings of the 6th International Conference on Information Visualisation", + "doi": "10.1109/IV.2002.1028770", + "keywords": "type:technique, time:timeline, paradigm:node-link, evaluation:case_study, application:business, 3d, superimposed_node-link, force-directed_layout, fixed_nodes", + "pages": "147--152", + "publisher": "IEEE", + "series": "IV", + "title": "Visualising a fund manager flow graph with columns and worms", + "type": "inproceedings", + "year": "2002" + }, + "Dwyer2004Visualising": { + "abstract": "We explore a multiple view, or overview and detail, method for visualising a high-dimensional portfolio holdings data set with attributes that change over time. The method employs techniques from multidimensional scaling and graph visualisation to find a two-dimensional mapping for high-dimensional data. In both the overview and detail views, time is mapped to the third dimension providing a two and a half-dimensional view of changes in the data. We demonstrate the utility of the paradigm with a prototype system for visualisation of movements within a large set of UK fund managers\u2019 stock portfolios.", + "author": "Dwyer, Tim and Gallagher, David R", + "doi": "10.1057/palgrave.ivs.9500081", + "journal": "Information Visualization", + "keywords": "time:timeline, paradigm:node-link, application:business, 3d, fixed_nodes, force-directed_layout, superimposed_node-link, type:application, evaluation:expert, evaluation:case_study, multivariate_graph, hierarchical_layout", + "number": "4", + "pages": "227--244", + "publisher": "SAGE Publications", + "title": "Visualising changes in fund manager holdings in two and a half-dimensions", + "type": "article", + "volume": "3", + "year": "2004" + }, + "Elmqvist2003Causality": { + "abstract": "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.", + "author": "Elmqvist, Niklas and Tsigas, Philippas", + "booktitle": "Proceedings of the 2003 IEEE Symposium on Information Visualization", + "doi": "10.1109/INFVIS.2003.1249025", + "keywords": "type:application, paradigm:node-link, time:timeline, time:animation, evaluation:user_study, application:software_engineering, program_execution", + "pages": "189--196", + "publisher": "IEEE", + "series": "InfoVis", + "title": "Causality visualization using animated growing polygons", + "type": "inproceedings", + "year": "2003" + }, + "Ens2014ChronoTwigger": { + "abstract": "Applying visual analytics to large software systems can help users comprehend the wealth of information produced by source repository mining. One concept of interest is the co-evolution of test code with source code, or how source and test files develop together over time. For example, understanding how the testing pace compares to the development pace can help test managers gauge the effectiveness of their testing strategy. A useful concept that has yet to be effectively incorporated into a co-evolution visualization is co-change. Co-change is a quantity that identifies correlations between software artifacts, and we propose using this to organize our visualization in order to enrich the analysis of co-evolution. In this paper, we create, implement, and study an interactive visual analytics tool that displays source and test file changes over time (co-evolution) while grouping files that change together (co-change). Our new technique improves the analyst\u2019s ability to infer information about the software development process and its relationship to testing. We discuss the development of our system and the results of a small pilot study with three participants. Our findings show that our visualization can lead to inferences that are not easily made using other techniques alone.", + "author": "Ens, Barrett and Rea, Daniel and Shpaner, Roiy and Hemmati, Hadi and Young, James E and Irani, Pourang", + "booktitle": "Proceedings of the 2nd IEEE Working Conference on Software Visualization", + "keywords": "type:application, time:timeline, 3d, paradigm:node-link, application:software_engineering, omitted_links, evaluation:user_study, software_evolution", + "pages": "117--126", + "publisher": "IEEE", + "references": "Beyer2006Animated", + "series": "VISSOFT", + "title": "{ChronoTwigger}: A Visual Analytics Tool for Understanding Source and Test Co-Evolution", + "type": "article", + "url": "http://conferences.computer.org/vissoft/2014/papers/6150a117.pdf", + "year": "2014" + }, + "Erten2004Exploring": { + "abstract": "We present a system for the visualization of computing literature with an emphasis on collaboration patterns, interactions between related research specialties and the evolution of these characteristics through time. Our computing literature visualization system, has four major components: A mapping of bibliographical data to relational schema coupled with an RDBMS to store the relational data, an interactive GUI that allows queries and the dynamic construction of graphs, a temporal graph layout algorithm, and an interactive visualization tool. We use a novel technique for visualization of large graphs that evolve through time. Given a dynamic graph, the layout algorithm produces two-dimensional representations of each timeslice, while preserving the mental map of the graph from one slice to the next. A combined view, with all the timeslices can also be viewed and explored. For our analysis we use data from the Association of Computing Machinery's Digital Library of Scientific Literature which contains more than one hundred thousand research papers and authors. Our system can be found online at http://tgrip.cs.arizona.edu.", + "author": "Erten, Cesim and Harding, Philip J and Kobourov, Stephen G and Wampler, Kevin and Yee, Gary V", + "booktitle": "Visualization and Data Analysis", + "doi": "10.1117/12.539245", + "keywords": "paradigm:node-link, 3d, time:timeline, type:application, evaluation:case\\_study, application:document, application:social", + "pages": "45-56", + "references": "Cohen1995Dynamic Collberg2003System", + "series": "VDA", + "title": "Exploring the Computing Literature Using Temporal Graph Visualization", + "type": "inproceedings", + "year": "2004" + }, + "Erten2004GraphAEL": { + "abstract": "GraphAEL extracts three types of evolving graphs from the Graph Drawing literature and creates 2D and 3D animations of the evolutions. We study citation graphs, topic graphs, and collaboration graphs. We also create difference graphs which capture the nature of change between two given time periods. GraphAEL can be accessed online at http://graphael.cs.arizona.edu .", + "author": "Erten, Cesim and Harding, Philip J and Kobourov, Stephen G and Wampler, Kevin and Yee, Gary V", + "booktitle": "Graph Drawing", + "doi": "10.1007/978-3-540-24595-7_9", + "isbn": "978-3-540-20831-0", + "keywords": "3d, time:animation, paradigm:node-link, type:technique, evaluation:case\\_study, application:social, force-directed_layout, graph_difference, mental_map, application:document, offline_problem, general-purpose_layout", + "pages": "98--110", + "publisher": "Springer", + "references": "Cohen1995Dynamic Collberg2003System", + "series": "GD", + "title": "{GraphAEL}: Graph Animations with Evolving Layouts Graph Drawing", + "type": "incollection", + "year": "2004" + }, + "Erten2004Simultaneous": { + "abstract": "In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same vertex set. We designed and implemented three different algorithms for simultaneous graph drawing and three different visualization schemes. The algorithms are based on a modification of the force-directed algorithm that allows us to take into account vertex weights and edge weights in order to achieve mental map preservation while obtaining individually readable drawings. The implementation is in Java and the system can be downloaded at http://simg.cs.arizona.edu/.", + "author": "Erten, Cesim and Kobourov, Stephen G and Le, Vu and Navabi, Armand", + "booktitle": "Graph Drawing", + "doi": "10.1007/978-3-540-24595-7_41", + "keywords": "type:technique, force-directed_layout, paradigm:node-link, time:timeline, 3d, evaluation:none, application:generic, superimposed_node-link", + "organization": "Springer", + "pages": "437--449", + "references": "Collberg2003System Huang1998Online Misue1995Layout", + "series": "GD", + "title": "Simultaneous graph drawing: Layout algorithms and visualization schemes", + "type": "inproceedings", + "year": "2004" + }, + "Farrugia2011Effective": { + "abstract": "Graph drawing algorithms have classically addressed the layout of static graphs. However, the need to draw evolving or dynamic graphs has brought into question many of the assumptions, conventions and layout methods designed to date. For example, social scientists studying evolving social networks have created a demand for visual representations of graphs changing over time. Two common approaches to represent temporal information in graphs include animation of the network and use of static snapshots of the network at different points in time. Here, we report on two experiments, one in a laboratory environment and another using an asynchronous remote web-based platform, Mechanical Turk, to compare the efficiency of animated displays versus static displays. Four tasks are studied with each visual representation, where two characterise overview level information presentation, and two characterise micro level analytical tasks. For the tasks studied in these experiments and within the limits of the experimental system, the results of this study indicate that static representations are generally more effective particularly in terms of time performance, when compared to fully animated movie representations of dynamic networks.", + "author": "Farrugia, Michael and Quigley, Aaron J", + "doi": "10.1057/ivs.2010.10", + "journal": "Information Visualization", + "keywords": "time:animation, time:timeline, type:evaluation, paradigm:node-link, evaluation:user_study, application:generic", + "number": "1", + "pages": "47--64", + "publisher": "SAGE Publications", + "references": "Bender-deMoll2006Science Moody2005Dynamic Misue1995Layout Frishman2008Online Lee2006Mental Dwyer2004Visualising Friedrich2002Graph", + "title": "Effective temporal graph layout: A comparative study of animation versus static display methods", + "type": "article", + "volume": "10", + "year": "2011" + }, + "Farrugia2011Exploring": { + "abstract": "Many of the current dynamic network visualisations methods or techniques rely on node-link force-based models that were originally developed for visualising static network snapshots. In this study, we diverge from this traditional layout approach and develop a layout for ego networks that places the time dimension in the foreground, by turning time into an element of shape. In addition to this we develop an interactive system that enables the visualisation of multiple networks simultaneously by employing small multiples. Using the proposed layout and analytical system as a grounding visual structure, we visually characterise dynamic network events in 3 different networks; the evolution of the biotechnology field, a phone call data set and a network of passenger connections of an airline. From this analysis we propose a range of ego network visual motifs that can be used as templates to identify and characterise events that are occurring in a dynamic network.", + "author": "Farrugia, Michael and Hurley, Neil and Quigley, Aaron J", + "booktitle": "Proceedings of the 4th International Conference on Advances in Computer-Human Interactions", + "keywords": "application:infrastructure, application:social, radial, paradigm:node-link, time:timeline, type:technique, ego\\_network, juxtaposed_node-link, evaluation:case_study", + "pages": "79--88", + "references": "Frishman2008Online", + "series": "ACHI", + "title": "Exploring temporal ego networks using small multiples and tree-ring layouts", + "type": "inproceedings", + "url": "http://hcibib.org/ACHI11", + "year": "2011" + }, + "Federico2011Visual": { + "abstract": "The visualization and analysis of dynamic networks have become increasingly important in several fields, for instance sociology or economics. The dynamic and multi-relational nature of this data poses the challenge of understanding both its topological structure and how it changes over time. In this paper we propose a visual analytics approach for analyzing dynamic networks that integrates: a dynamic layout with user-controlled trade-off between stability and consistency; three temporal views based on different combinations of node-link diagrams (layer superimposition, layer juxtaposition, and two-and-a-half-dimensional view); the visualization of social network analysis metrics; and specific interaction techniques for tracking node trajectories and node connectivity over time. This integration of visual, interactive, and automatic methods supports the multi-faceted analysis of dynamically changing networks.", + "author": "Federico, Paolo and Aigner, Wolfgang and Miksch, Silvia and Windhager, Florian and Zenk, Lukas", + "booktitle": "Proceedings of the 11th International Conference on Knowledge Management and Knowledge Technologies", + "doi": "10.1145/2024288.2024344", + "keywords": "type:technique, paradigm:node-link, time:timeline, evaluation:none, application:social, 3d, superimposed_node-link, juxtaposed_node-link", + "pages": "47", + "references": "Bender-deMoll2006Science Brandes2003Visual Dwyer2004Visualising Lee2006Mental Misue1995Layout Moody2005Dynamic Saffrey2008Mental", + "series": "i-KNOW", + "title": "A Visual Analytics Approach to Dynamic Social Networks", + "type": "inproceedings", + "year": "2011" + }, + "Feng2012Coherent": { + "abstract": "We present a new approach for time-varying graph drawing that achieves both spatiotemporal coherence and multifocus+context visualization in a single framework. Our approach utilizes existing graph layout algorithms to produce the initial graph layout, and formulates the problem of generating coherent time-varying graph visualization with the focus+context capability as a specially tailored deformation optimization problem. We adopt the concept of the super graph to maintain spatiotemporal coherence and further balance the needs for aesthetic quality and dynamic stability when interacting with time-varying graphs through focus+context visualization. Our method is particularly useful for multifocus+context visualization of time-varying graphs where we can preserve the mental map by preventing nodes in the focus from undergoing abrupt changes in size and location in the time sequence. Experiments demonstrate that our method strikes a good balance between maintaining spatiotemporal coherence and accentuating visual foci, thus providing a more engaging viewing experience for the users.", + "address": "Los Alamitos, CA, USA", + "author": "Feng, Kun-Chuan and Wang, Chaoli and Shen, Han-Wei and Lee, Tong-Yee", + "doi": "10.1109/TVCG.2011.128", + "issn": "1077-2626", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "type:technique, paradigm:node-link, time:animation, evaluation:algorithmic, application:social, application:document, mental\\_map, offline_problem, general-purpose_layout", + "number": "8", + "pages": "1330-1342", + "publisher": "IEEE Computer Society", + "references": "Diehl2001Preserving Frishman2004Dynamic Misue1995Layout", + "series": "TVCG", + "title": "Coherent Time-Varying Graph Drawing with Multifocus+Context Interaction", + "type": "article", + "volume": "18", + "year": "2012" + }, + "Forrester2005graphael": { + "abstract": "The graphael system implements several traditional force-directed layout methods, as well as several novel layout methods for non-Euclidean geometries, including hyperbolic and spherical. The system can handle large graphs, using multi-scale variations of the force-directed methods. Moreover, graphael can layout and visualize graphs that evolve though time, using static views, animation, and morphing. The implementation includes a powerful interface that allows the user to put together existing algorithms and visualization techniques, and to easily add new ones. The system is written in Java and is available as a downloadable program or as an applet at http://graphael.cs.arizona.edu.", + "author": "Forrester, David and Kobourov, Stephen G and Navabi, Armand and Wampler, Kevin and Yee, Gary V", + "booktitle": "Graph drawing", + "doi": "10.1007/978-3-540-31843-9_47", + "keywords": "type:technique, time:animation, paradigm:node-link, evaluation:case_study, force-directed_layout, offline_problem, mental_map, radial, 3d, application:document, general-purpose_layout", + "pages": "454--464", + "publisher": "Springer", + "references": "Erten2004Exploring", + "series": "GD", + "title": "{graphael}: A system for generalized force-directed layouts", + "type": "inproceedings", + "year": "2005" + }, + "Friedrich2001Marey": { + "abstract": "Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. In this paper we present Marey, a system that can smoothly transform one drawing of a graph into another without any restrictions to the class of graphs or type of layout algorithm.", + "author": "Friedrich, Carsten and Eades, Peter", + "booktitle": "Graph Drawing", + "doi": "10.1007/3-540-44541-2_37", + "keywords": "type:technique, time:animation, paradigm:node-link, application:generic, evaluation:case_study, transition_problem, general-purpose_layout", + "pages": "396--406", + "publisher": "Springer", + "series": "GD", + "title": "The {Marey} graph animation tool demo", + "type": "inproceedings", + "year": "2001" + }, + "Friedrich2002Graph": { + "abstract": "Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. In this paper we present methods that smoothly transform one drawing of a graph into another without any restrictions to the class of graphs or type of layout algorithm.", + "author": "Friedrich, Carsten and Eades, Peter", + "doi": "10.7155/jgaa.00057", + "journal": "Journal of Graph Algorithms and Applications", + "keywords": "type:technique, paradigm:node-link, time:animation, mental_map, evaluation:case_study, application:generic, transition_problem, general-purpose_layout", + "number": "3", + "pages": "353--370", + "title": "Graph drawing in motion", + "type": "article", + "volume": "6", + "year": "2002" + }, + "Friedrich2002GraphII": { + "abstract": "Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. Whenever a layout in a graph drawing system is modified, the mental map of the user must be preserved. One way in which the user can be helped in understanding a change of layout is through animation of the change. In this paper, we present clustering-based strategies for identifying groups of nodes sharing a common, simple motion from initial layout to final layout. Transformation of these groups is then handled separately in order to generate a smooth animation.", + "author": "Friedrich, Carsten and Houle, Michael E", + "booktitle": "Graph Drawing", + "doi": "10.1007/3-540-45848-4_18", + "keywords": "type:technique, time:animation, paradigm:node-link, evaluation:case_study, application:generic, mental_map, clustering, transition_problem, general-purpose_layout", + "pages": "220--231", + "publisher": "Springer", + "references": "Friedrich2002Graph", + "series": "GD", + "title": "Graph Drawing in Motion {II}", + "type": "inproceedings", + "year": "2002" + }, + "Frishman2004Dynamic": { + "abstract": "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.", + "author": "Frishman, Yaniv and Tal, Ayellet", + "booktitle": "Proceedings of the 2004 IEEE Symposium on Information Visualization", + "doi": "10.1109/INFVIS.2004.18", + "keywords": "time:animation, paradigm:node-link, online\\_problem, mental\\_map, evaluation:case\\_study, application:infrastructure, compound_graph, type:technique, force-directed\\_layout, 3d, application:software\\_engineering, evaluation:algorithmic, special-purpose_layout", + "pages": "191--198", + "publisher": "IEEE", + "references": "Misue1995Layout", + "series": "InfoVis", + "title": "Dynamic Drawing of Clustered Graphs", + "type": "inproceedings", + "year": "2004" + }, + "Frishman2008MOVIS": { + "abstract": "This paper presents MOVIS---a system for visualizing mobile object frameworks. In such frameworks, the objects can migrate to remote hosts, along with their state and behavior, while the application is running. An innovative graph-based visualization is used to depict the physical and the logical connections in the distributed object network. Scalability is achieved by using a focus+context technique jointly with a user-steered clustering algorithm. In addition, an event synchronization model for mobile objects is presented. The system has been applied to visualizing several mobile object applications.", + "author": "Frishman, Yaniv and Tal, Ayellet", + "doi": "10.1016/j.jvlc.2007.07.006", + "journal": "Journal of Visual Languages \\& Computing", + "keywords": "type:application, compound_graph, 3d, paradigm:node-link, evaluation:case_study, time:animation, application:software_engineering, clustering, program_execution", + "number": "3", + "pages": "303--320", + "publisher": "Elsevier", + "references": "Collberg2003System Frishman2004Dynamic Kumar2006Visual Misue1995Layout", + "title": "{MOVIS}: A system for visualizing distributed mobile object environments", + "type": "article", + "volume": "19", + "year": "2008" + }, + "Frishman2008Online": { + "abstract": "This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and, thus, the user's mental map while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution culling methods in order to reduce the layout time and handle large dynamic graphs. Techniques for representing graphs on the GPU allow a speedup by a factor of up to 17 compared to the CPU implementation. The scalability of the algorithm across GPU generations is demonstrated. Applications of the algorithm to the visualization of discussion threads in Internet sites and to the visualization of social networks are provided.", + "author": "Frishman, Yaniv and Tal, Ayellet", + "doi": "10.1109/tvcg.2008.11", + "issn": "1077-2626", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "paradigm:node-link, time:animation, online\\_problem, mental\\_map, type:technique, application:social, evaluation:algorithmic, evaluation:case\\_study, general-purpose_layout", + "number": "4", + "pages": "727--740", + "publisher": "IEEE", + "references": "Misue1995Layout Kumar2006Visual Frishman2004Dynamic Bender-deMoll2006Science", + "series": "TVCG", + "title": "Online Dynamic Graph Drawing", + "type": "article", + "volume": "14", + "year": "2008" + }, + "Fu2007Visualization": { + "abstract": "This paper presents various methods for visualization and analysis of email networks; visualization on the surface of a sphere to reveal communication patterns between different groups, a hierarchical drawing displaying the centrality analysis of nodes to emphasize important nodes, a 2.5D visualization for temporal email networks to analyze the evolution of email relationships changing over time, and an ambient display for finding social circles derived from the email network. Each method was evaluated with various data sets from a research organization. We also extended our method for visual analysis of an email virus network.", + "author": "Fu, Xiaoyan and Hong, Seok-Hee and Nikolov, Nikola S and Shen, Xiaobin and Wu, Yingxin and Xu, Kai", + "booktitle": "Proceedings of the 6th International Asia-Pacific Symposium on Visualization", + "doi": "10.1109/APVIS.2007.329302", + "keywords": "type:application, time:timeline, paradigm:node-link, application:social, evaluation:case_study, 3d, superimposed_node-link", + "pages": "1--8", + "publisher": "IEEE", + "references": "Moody2005Dynamic", + "series": "APVis", + "title": "Visualization and analysis of email networks", + "type": "inproceedings", + "year": "2007" + }, + "Gaertler2006Hybrid": { + "abstract": "Dynamic processes frequently occur in many applications. Visualizations of dynamically evolving data, for example as part of the data analysis, are typically restricted to a cumulative static view or an animation/sequential view. Both methods have their benefits and are often complementary in their use. In this article, we present a hybrid model that combines the two techniques. This is accomplished by 2.5D drawings which are calculated in an incremental way. The method has been evaluated on collaboration networks.", + "author": "Gaertler, Marco and Wagner, Dorothea", + "booktitle": "Graph Drawing", + "doi": "10.1007/11618058_18", + "keywords": "type:technique, time:timeline, 3d, paradigm:node-link, evaluation:case_study, application:document", + "pages": "189--200", + "publisher": "Springer", + "references": "Brandes2003Visual", + "series": "GD", + "title": "A hybrid model for drawing dynamic and evolving graphs", + "type": "inproceedings", + "year": "2006" + }, + "Gansner2013Interactive": { + "abstract": "The many endless rivers of text now available present a serious challenge in the task of gleaning, analyzing and discovering useful information. In this paper, we describe a methodology for visualizing a text stream in real-time, modeled as a dynamic graph and its derived map. The approach automatically groups similar messages into clusters displayed as \"countries\", with keyword summaries, using semantic analysis, graph clustering and map generation techniques. It handles the need for visual stability across time by dynamic graph layout and Procrustes projection, enhanced with a novel stable component packing algorithm. The result provides a continuous, succinct view of ever-changing topics of interest. To make these ideas concrete, we describe their application to an experimental web service called TwitterScope.", + "author": "Gansner, Emden R. and Hu, Yifan and North, Stephen C", + "comment": "extended version of a paper that appeared at Graph Drawing 2012", + "doi": "10.7155/jgaa.00302", + "journal": "Journal of Graph Algorithms and Applications", + "keywords": "type:application, paradigm:node-link, time:animation, evaluation:case\\_study, application:document, map\\_metaphor", + "number": "4", + "pages": "515--540", + "references": "Archambault2011Animation", + "title": "Interactive Visualization of Streaming Text Data with Dynamic Maps", + "type": "article", + "volume": "17", + "year": "2013" + }, + "Ghani2012Perception": { + "abstract": "Effective visualization of dynamic graphs remains an open research topic, and many state-of-the-art tools use animated node-link diagrams for this purpose. Despite its intuitiveness, the effectiveness of animation in node-link diagrams has been questioned, and several empirical studies have shown that animation is not necessarily superior to static visualizations. However, the exact mechanics of perceiving animated node-link diagrams are still unclear. In this paper, we study the impact of different dynamic graph metrics on user perception of the animation. After deriving candidate visual graph metrics, we perform an exploratory user study where participants are asked to reconstruct the event sequence in animated node-link diagrams. Based on these findings, we conduct a second user study where we investigate the most important visual metrics in depth. Our findings show that node speed and target separation are prominent visual metrics to predict the performance of event sequencing tasks.", + "author": "Ghani, Sohaib and Elmqvist, Niklas and Yi, Ji Soo", + "doi": "10.1111/j.1467-8659.2012.03113.x", + "journal": "Computer Graphics Forum", + "keywords": "time:animation, paradigm:node-link, type:evaluation, force-directed\\_layout, evaluation:user_study, application:generic, mental_map", + "number": "3pt3", + "pages": "1205--1214", + "publisher": "Blackwell Publishing Ltd", + "references": "Archambault2011Animation Beck2009Aesthetic Brandes2003Visual Cohen1992Framework Farrugia2011Effective Moody2005Dynamic Yi2010TimeMatrix", + "series": "CGF", + "title": "Perception of Animated Node-Link Diagrams for Dynamic Graphs", + "type": "article", + "volume": "31", + "year": "2012" + }, + "Gilbert2011Communities": { + "abstract": "Detection of community structures in social networks has attracted lots of attention in the domain of sociology and behavioral sciences. Social networks also exhibit dynamic nature as these networks change continuously with the passage of time. Social networks might also present a hierarchical structure led by individuals who play important roles in a society such as managers and decision makers. Detection and visualization of these networks that are changing over time is a challenging problem where communities change as a function of events taking place in the society and the role people play in it. In this paper, we address these issues by presenting a system to analyze dynamic social networks. The proposed system is based on dynamic graph discretization and graph clustering. The system allows detection of major structural changes taking place in social communities over time and reveals hierarchies by identifying influential people in social networks. We use two different data sets for the empirical evaluation and observe that our system helps to discover interesting facts about the social and hierarchical structures present in these social networks.", + "author": "Gilbert, Fr{\\'e}d{\\'e}ric and Simonetto, Paolo and Zaidi, Faraz and Jourdan, Fabien and Bourqui, Romain", + "doi": "10.1007/s13278-010-0002-8", + "journal": "Social Network Analysis and Mining", + "keywords": "type:application, application:social, time:timeline, time:animation, evaluation:case_study, paradigm:node-link, force-directed_layout, compound_graph", + "number": "2", + "pages": "83--95", + "publisher": "Springer", + "references": "Bender-deMoll2006Science Kang2007Visual Moody2005Dynamic", + "title": "Communities and hierarchical structures in dynamic social networks: analysis and visualization", + "type": "article", + "volume": "1", + "year": "2011" + }, + "Gorg2005Dynamic": { + "abstract": "In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical graphs while preserving the mental map. Both algorithms can be parameterized to trade layout quality for dynamic stability. In particular, we had to develop new metrics which work upon the intermediate results of layout phases. We discuss some properties of the resulting animations by means of examples.", + "author": "G\\\"org, Carsten and Birke, Peter and Pohl, Mathias and Diehl, Stephan", + "booktitle": "Graph Drawing", + "doi": "10.1007/978-3-540-31843-9_24", + "keywords": "type:technique, paradigm:node-link, time:animation, orthogonal_layout, hierarchical_layout, evaluation:case_study, application:software_engineering, mental_map, offline_problem, general-purpose_layout", + "pages": "228--238", + "publisher": "Springer", + "references": "Cohen1995Dynamic Collberg2003System Diehl2001Preserving", + "series": "GD", + "title": "Dynamic graph drawing of sequences of orthogonal and hierarchical graphs", + "type": "inproceedings", + "year": "2005" + }, + "Gorochowski2012Using": { + "abstract": "Networks are widely used to describe many natural and technological systems. Understanding how these evolve over time poses a challenge for existing visualization techniques originally developed for fixed network structures. We describe a method of incorporating the concept of aging into evolving networks, where nodes and edges store information related to the amount of local evolutionary change they have experienced. This property is used to generate visualizations that ensure stable substructures maintain relatively fixed spatial positions, allowing them to act as visual markers and providing context for evolutionary change elsewhere. By further supplementing these visualizations with color cues, the resultant animations enable a clearer portrayal of the underlying evolutionary process.", + "author": "Gorochowski, Thomas E and di Bernardo, Mario and Grierson, Claire S", + "doi": "10.1109/TVCG.2011.142", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "type:technique, paradigm:node-link, time:animation, evaluation:algorithmic, application:generic, force-directed_layout, online_problem, general-purpose_layout", + "number": "8", + "pages": "1343--1352", + "publisher": "IEEE", + "references": "Farrugia2011Effective Erten2004GraphAEL Erten2004Exploring Brandes2003Visual Friedrich2002Graph Misue1995Layout Lee2006Mental Moody2005Dynamic", + "series": "TVCG", + "title": "Using Aging to Visually Uncover Evolutionary Processes on Networks", + "type": "article", + "volume": "18", + "year": "2012" + }, + "Grabowicz2014Fast": { + "abstract": "Detecting and visualizing what are the most relevant changes in an evolving network is an open challenge in several domains. We present a fast algorithm that filters subsets of the strongest nodes and edges representing an evolving weighted graph and visualize it by either creating a movie, or by streaming it to an interactive network visualization tool. The algorithm is an approximation of exponential sliding time-window that scales linearly with the number of interactions. We compare the algorithm against rectangular and exponential sliding time-window methods. Our network filtering algorithm: (i) captures persistent trends in the structure of dynamic weighted networks, (ii) smoothens transitions between the snapshots of dynamic network, and (iii) uses limited memory and processor time. The algorithm is publicly available as open-source software.", + "author": "Grabowicz, Przemyslaw A and Aiello, Luca Maria and Menczer, Filippo", + "doi": "10.1140/epjds/s13688-014-0027-8", + "journal": "EPJ Data Science", + "keywords": "type:technique, time:animation, paradigm:node-link, evaluation:case_study, online_problem, general-purpose_layout, force-directed_layout, time_aggregation, application:sports, application:document, application:media, social_media", + "number": "1", + "pages": "1--16", + "publisher": "Springer", + "references": "Bastian2009Gephi Dutot2007GraphStream Brandes2012Visualization Yi2010TimeMatrix Stein2010PixelOriented Farrugia2011Effective Misue1995Layout Archambault2012Mental Ghani2012Perception Frishman2008Online Kumar2006Visual", + "title": "Fast filtering and animation of large dynamic networks", + "type": "article", + "volume": "3", + "year": "2014" + }, + "Greevy2006Visualizing": { + "abstract": "The analysis of the runtime behavior of a software system yields vast amounts of information, making accurate interpretations difficult. Filtering or compression techniques are often applied to reduce the volume of data without loss of key information vital for a specific analysis goal. Alternatively, visualization is generally accepted as a means of effectively representing large amounts of data. The challenge lies in creating effective and expressive visual representations that not only allows for a global picture, but also enables us to inspect the details of the large data sets. We define the focus of our analysis to be the runtime behavior of features. Static structural visualizations of a system are typically represented in two dimensions. We exploit a third dimension to visually represent the dynamic information, namely object instantiations and message sends. We introduce a novel 3D visualization technique that supports animation of feature behavior and integrates zooming, panning, rotating and on-demand details. As proof of concept, we apply our visualization technique to feature execution traces of an example system.", + "author": "Greevy, Orla and Lanza, Michele and Wysseier, Christoph", + "booktitle": "Proceedings of the 2006 ACM Symposium on Software Visualization", + "doi": "10.1145/1148493.1148501", + "isbn": "1-59593-464-2", + "keywords": "type:application, paradigm:node-link, 3d, time:timeline, application:software\\_engineering, evaluation:case\\_study, program_execution", + "pages": "47--56", + "publisher": "ACM", + "series": "SoftVis", + "title": "Visualizing live software systems in {3D}", + "type": "inproceedings", + "year": "2006" + }, + "Greilich2009Visualizing": { + "abstract": "Compound digraphs are a widely used model in computer science. In many application domains these models evolve over time. Only few approaches to visualize such dynamic compound digraphs exist and mostly use animation to show the dynamics. In this paper we present a new visualization tool called TimeArcTrees that visualizes weighted, dynamic compound digraphs by drawing a sequence of node-link diagrams in a single view. Compactness is achieved by aligning the nodes of a graph vertically. Edge crossings are reduced by drawing upward and downward edges separately as colored arcs. Horizontal alignment of the instances of the same node in different graphs facilitates comparison of the graphs in the sequence. Many interaction techniques allow to explore the given graphs. Smooth animation supports the user to better track the transitions between views and to preserve his or her mental map. We illustrate the usefulness of the tool by looking at the particular problem of how shortest paths evolve over time. To this end, we applied the system to an evolving graph representing the German Autobahn and its traffic jams.", + "author": "Greilich, Martin and Burch, Michael and Diehl, Stephan", + "doi": "10.1111/j.1467-8659.2009.01451.x", + "issn": "1467-8659", + "journal": "Computer Graphics Forum", + "keywords": "paradigm:node-link, compound_graph, weighted_graph, directed_graph, time:timeline, evaluation:case\\_study, application:infrastructure, type:technique, linear\\_arrangement, juxtaposed_node-link, application:geo", + "number": "3", + "pages": "975--982", + "publisher": "Blackwell Publishing", + "references": "Pohl2008Interactive", + "series": "CGF", + "survey:data": "(n:30, e:700, t:7)", + "title": "Visualizing the Evolution of Compound Digraphs with {TimeArcTrees}", + "type": "article", + "volume": "28", + "year": "2009" + }, + "Groh2009Interactively": { + "abstract": "The dynamic social network visualizer \u201cDySoN\u201d (Dynamic Social Networks) aims at understanding patterns and structural changes in dynamic social networks that evolve over time via an interactive visualization approach. As an alternative and supplementation to the numerous other approaches to visualization of social network data and as an attempt to overcome some of the drawbacks of these approaches, DySoN interactively visualizes streaming event data of social interactions by an interactive three-dimensional model of interpolated NURBS \u201dtubes\u201d, representing activity and social proximity within a given set of actors during a given time period by using three dimensions of temporal information mapping: spatial density (tube distance), tubecolor and tube-diameter. We use a self assembled large collaboration network of Jazz musicians with a straightforward semantics for the computation of relation strengths for the evaluation of the approach. We also discuss applications of the concept for awareness services in mobile peer to peer social networks, which exhibit a vivid measurable social micro dynamics in time and space.", + "author": "Groh, Georg and Hanstein, Holger and W\\\"orndl, Wolfgang", + "booktitle": "Proceedings of the 2009 Workshop on Visual Interfaces to the Social and the Semantic Web", + "comment": "a first version appeared at GI Jahrestagung 2008", + "keywords": "type:technique, paradigm:node-link, time:timeline, evaluation:case\\_study, application:social, 3d, superimposed_node-link, force-directed_layout", + "references": "Bender-deMoll2006Science Erten2004Exploring Friedrich2002Graph Moody2005Dynamic", + "series": "VISSW", + "title": "Interactively Visualizing Dynamic Social Networks with {DySoN}", + "type": "inproceedings", + "url": "http://data.semanticweb.org/workshop/VISSW/2009/paper/main/10/html", + "year": "2009" + }, + "Hadlak2011Situ": { + "abstract": "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.", + "author": "Hadlak, Steffen and Schulz, Hans-J\\\"org and Schumann, Heidrun", + "doi": "10.1109/TVCG.2011.213", + "issn": "1077-2626", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "type:technique, paradigm:node-link, paradigm:matrix, evaluation:case\\_study, application:infrastructure, application:software\\_engineering, time:timeline, taxonomy, juxtaposed_node-link, integrated_node-link, time:animation, application:geo", + "number": "12", + "pages": "2334--2343", + "publisher": "IEEE", + "references": "Bastian2009Gephi Brandes2003Visual Burch2008TimeRadarTrees Diehl2002Graphs Diehl2001Preserving Friedrich2001Marey Frishman2004Dynamic Frishman2008Online Gaertler2006Hybrid Purchase2007Important Saraiya2005Visualization Shi2011Dynamic", + "series": "TVCG", + "title": "In Situ Exploration of Large Dynamic Networks", + "type": "article", + "volume": "17", + "year": "2011" + }, + "Hadlak2015Survey": { + "abstract": "Graph visualization is an important field in information visualization that is centered on the graphical display of graph-structured data. Yet real world data is rarely just graph-structured, but instead exhibits multiple facets, such as multivariate attributes, or spatial and temporal frames of reference. In an effort to display different facets of a graph, such a wealth of visualization techniques has been developed in the past that current surveys focus on a single additional facet only in order to enumerate and classify them. This report builds on existing graph visualization surveys for the four common facets of partitions, attributes, time, and space. It contributes a generic high-level categorization of faceted graph visualization that subsumes the existing classifications, which can be understood as facet-specific refinements of the resulting categories. Furthermore, it extends beyond existing surveys by applying the same categorization to graph visualizations with multiple facets. For each of the introduced categories and considered facets, this overview provides visualization examples to illustrate instances of their realization.", + "author": "Hadlak, Steffen and Schumann, Heidrun and Schulz, Hans-J\u00f6rg", + "booktitle": "Eurographics Conference on Visualization (EuroVis) - STARs", + "doi": "10.2312/eurovisstar.20151109", + "keywords": "type:evaluation, evaluation:survey, time:generic, paradigm:generic, application:generic, taxonomy", + "publisher": "The Eurographics Association", + "references": "Ahn2013Task Ahn2011Temporal Beck2014State Boyandin2012Qualitative Brandes2003Visual Burch2008TimeRadarTrees Brandes2012Visualization Bach2014GraphDiaries Curtis2012Enabling Diehl2001Preserving Frishman2004Dynamic Gaertler2006Hybrid Hurter2013Bundled Hadlak2011Situ Itoh2012Visualization John2011Constructing Kerracher2014Design Misue1995Layout Perer2012MatrixFlow Reitz2010Framework Rufiange2013DiffAni Rohrschneider2010Visual Saraiya2005Visualization Stein2010PixelOriented Shi2015Egocentric Vehlow2015State vandenElzen2013Dynamic Yi2010TimeMatrix", + "series": "EuroVis", + "title": "A Survey of Multi-faceted Graph Visualization", + "type": "inproceedings", + "year": "2015" + }, + "Hayashi2013Initial": { + "abstract": "Microblogging services generate huge histories that suit animated visualization based on graph drawing, but response speeds are insufficient. This paper proposes an effective updating method for the real-time visualization of time varying data. We propose an initial positioning method by combining Additional Edge Resizing (AER) with Sorted Sequential Barycenter Merging (SSBM). AER resizes edges between existing nodes when new edges are added before updating the visualization. SSBM initially positions multiple new nodes sequentially through priority based on the degree of connections to the existing graph. The proposed method prevents a decrease in readability at data update and achieves fast convergence with high accuracy. Quantitative and qualitative evaluations using the energy function and RMSE are detailed along with some visualization results. A graph drawing tool based on HTML5 is also introduced as an implementation of the proposed method and present some use cases for twitter data.", + "author": "Hayashi, Aki and Matsubayashi, Tatsushi and Hoshide, Takahide and Uchiyama, Tadasu", + "booktitle": "Proceedings of the 17th International Conference on Information Visualisation", + "doi": "10.1109/IV.2013.57", + "keywords": "type:technique, time:animation, paradigm:node-link, online_problem, application:document, evaluation:algorithmic, general-purpose_layout", + "pages": "435-444", + "publisher": "IEEE", + "references": "Archambault2011Animation Archambault2011Difference Diehl2002Graphs Frishman2008Online Gorg2005Dynamic Huang1998Online Itoh2012Visualization Moody2005Dynamic Reitz2009Focused", + "series": "IV", + "title": "Initial Positioning Method for Online and Real-Time Dynamic Graph Drawing of Time Varying Data", + "type": "inproceedings", + "year": "2013" + }, + "Hindle2007YARN": { + "abstract": "A problem that faces the study of software evolution is how to explore the aggregated and cumulative effects of changes that occur within a software system over time. In this paper we describe an approach to modeling, extracting, and animating the architectural evolution of a software system. We have built a prototype tool called YARN (yet another reverse-engineering narrative) that implements our approach; YARN mines the source code changes of the target system, and generates YARN \"balls\" (animations) that a viewer can unravel (watch). The animation is based on a static layout of the modules connected by animated edges that model the changing dependencies. The edges can be weighted by the number of dependencies or the importance of the change. We demonstrate our approach by visualizing the evolution of PostgreSQL DBMS.", + "author": "Hindle, Abram and Jiang, Zhen Ming and Koleilat, Walid and Godfrey, Michael W and Holt, Richard C", + "booktitle": "4th IEEE International Workshop on Visualizing Software for Understanding and Analysis", + "doi": "10.1109/VISSOF.2007.4290711", + "keywords": "type:application, application:software_engineering, software_evolution, time:animation, fixed_nodes, paradigm:node-link, radial, evaluation:case_study, weighted_graph, offline_problem, directed_graph", + "pages": "129--136", + "publisher": "IEEE", + "references": "Beyer2006Animated", + "series": "VISSOFT", + "title": "{YARN}: Animating software evolution", + "type": "inproceedings", + "year": "2007" + }, + "Hlawatsch2014Visual": { + "abstract": "We present a visual representation for dynamic, weighted graphs based on the concept of adjacency lists. Two orthogonal axes are used: one for all nodes of the displayed graph, the other for the corresponding links. Colors and labels are employed to identify the nodes. The usage of color allows us to scale the visualization to single pixel level for large graphs. In contrast to other techniques, we employ an asymmetric mapping that results in an aligned and compact representation of links. Our approach is independent of the specific properties of the graph to be visualized, but certain graphs and tasks benefit from the asymmetry. As we show in our results, the strength of our technique is the visualization of dynamic graphs. In particular, sparse graphs benefit from the compact representation. Furthermore, our approach uses visual encoding by size to represent weights and therefore allows easy quantification and comparison. We evaluate our approach in a quantitative user study that confirms the suitability for dynamic and weighted graphs. Finally, we demonstrate our approach for two examples of dynamic graphs.", + "author": "Hlawatsch, Marcel and Burch, Michael and Weiskopf, Daniel", + "doi": "10.1109/TVCG.2014.2322594", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "type:technique, paradigm:list, time:timeline, evaluation:user_study, application:social, application:software_engineering, weighted_graph, evaluation:case_study, directed_graph, linear_arrangement", + "pages": "1590--1603", + "publisher": "IEEE", + "references": "Burch2011Parallel Yi2010TimeMatrix Frishman2008Online Lee2006Mental Beck2009Aesthetic Misue1995Layout Hu2012Embedding Archambault2011Animation Greilich2009Visualizing Brandes2003Visual Rufiange2013DiffAni Burch2008TimeRadarTrees", + "series": "TVCG", + "title": "Visual Adjacency Lists for Dynamic Graphs", + "type": "article", + "year": "2014" + }, + "Hong2014Framework": { + "abstract": "In this paper, we present a framework for visual analytics of massive complex networks. Our framework is based on the tight integration of network analysis methods with visualization methods to address the scalability and complexity. We present case studies using various networks derived from the WoS (Web of Science). More specifically, we integrated co-citation analysis of Social Network community with 2.5D visualization methods to provide insight and overview on temporal dynamics. Furthermore, we derived collaboration networks and citation networks of Graph Drawing community and visualized using Anchored map techniques to understand collaboration patterns between important researchers in the community.", + "author": "Hong, Seok-Hee and Huang, Weidong and Misue, Kazuo and Quan, Wu and others", + "booktitle": "2014 International Conference on Big Data and Smart Computing", + "doi": "10.1109/BIGCOMP.2014.6741399", + "keywords": "type:application, application:social, application:document, paradigm:node-link, time:timeline, 3d, evaluation:case_study, weighted_graph, fixed_nodes", + "organization": "IEEE", + "pages": "22--28", + "references": "Fu2007Visualization", + "series": "BIGCOMP", + "title": "A framework for visual analytics of massive complex networks", + "type": "inproceedings", + "year": "2014" + }, + "Hu2012Embedding": { + "abstract": "We describe a practical approach for visualizing multiple relationships defined on the same dataset using a geographic map metaphor, where clusters of nodes form countries and neighboring countries correspond to nearby clusters. Our aim is to provide a visualization that allows us to compare two or more such maps (showing an evolving dynamic process, or obtained using different relationships). In the case where we are considering multiple relationships, e.g., different similarity metrics, we also provide an interactive tool to visually explore the effect of combining two or more such relationships. Our method ensures good readability and mental map preservation, based on dynamic node placement with node stability, dynamic clustering with cluster stability, and dynamic coloring with color stability.", + "author": "Hu, Yifan and Kobourov, Stephen G and Veeramoni, Sankar", + "booktitle": "Proceedings of the 2012 IEEE Pacific Visualization Symposium", + "doi": "10.1109/PacificVis.2012.6183571", + "isbn": "978-1-4673-0863-2", + "keywords": "map\\_metaphor, type:technique, time:animation, omitted_links, clustering, paradigm:node-link, mental_map, evaluation:case_study, application:generic, special-purpose_layout, compound_graph", + "pages": "33--40", + "publisher": "IEEE Computer Society", + "references": "Burch2008TimeRadarTrees", + "series": "PacificVis", + "title": "Embedding, Clustering and Coloring for Dynamic Maps", + "type": "inproceedings", + "year": "2012" + }, + "Huang1998Online": { + "abstract": "On-line graph drawing deals with huge graphs which are partially unknown. At any time, a tiny part of the graph is displayed on the screen. Examples include web graphs and graphs of links in distributed file systems. This paper discusses issues arising in the presentation of such graphs. The paper describes a system for dealing with web graphs using on-line graph drawing.", + "author": "Huang, Mao Lin and Eades, Peter and Wang, Junhu", + "doi": "10.1006/jvlc.1998.0094", + "journal": "Journal of Visual Languages \\& Computing", + "keywords": "paradigm:node-link, type:technique, time:animation, online_problem, mental_map, force-directed_layout, evaluation:case_study, application:document, transition_problem, general-purpose_layout", + "number": "6", + "pages": "623--645", + "publisher": "Elsevier", + "references": "Misue1995Layout", + "title": "On-line animated visualization of huge graphs using a modified spring algorithm", + "type": "article", + "volume": "9", + "year": "1998" + }, + "Hurter2013Bundled": { + "abstract": "Depicting change captured by dynamic graphs and temporal paths, or trails, is hard. We present two techniques for simplified visualization of such datasets using edge bundles. The first technique uses an efficient image-based bundling method to create smoothly changing bundles from streaming graphs. The second technique adds edge-correspondence data atop of any static bundling algorithm, and is best suited for graph sequences. We show how these techniques can produce simplified visualizations of streaming and sequence graphs. Next, we show how several temporal attributes can be added atop of our dynamic graphs. We illustrate our techniques with datasets from aircraft monitoring, software engineering, and eye-tracking of static and dynamic scenes.", + "author": "Hurter, Christophe and Ersoy, Ozan and Fabrikant, Sara I and Klein, Tijmen and Telea, Alexandru", + "comment": "extended version of a PacificVis 2013 paper", + "doi": "10.1109/TVCG.2013.246", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "type:technique, paradigm:node-link, edge\\_bundling, time:animation, evaluation:case\\_study, application:eye\\_tracking, application:software\\_engineering, application:infrastructure, fixed_nodes, transition_problem, general-purpose_layout, application:geo", + "publisher": "IEEE", + "references": "Boyandin2012Qualitative Burch2008TimeRadarTrees Erten2004Simultaneous Forrester2005graphael", + "series": "TVCG", + "title": "Bundled Visualization of Dynamic Graph and Trail Data", + "type": "article", + "year": "2013" + }, + "Itoh2010Interactive": { + "abstract": "We propose an interactive framework for the 3D visualization of the time-series of Web graphs. The purpose of our framework is to enable users to examine the evolution of Web graphs by comparing multiple graphs that have different timings and topics. To achieve this, we provide TimeSlices that are 2D planes to visualize Web graphs in a 3D environment. Users can interactively add new TimeSlices along the timeline, and they can manipulate them to animate Web graphs. Visualized Web graphs on TimeSlices are snapshots of different timings. Moreover, we provide mechanisms to generate and manipulate overlay views and parallel views in the 3D environment to enable Web graphs to be compared. Users can seamlessly change these viewing modes. Our system can also visualize two Web graphs created from different keywords to display the evolutional correlation between them. This system enables us to observe structural and temporal changes in multiple Web graphs such as shifts in influential blogs or power shifts in the diffusion of blogs between topics.", + "author": "Itoh, Masahiko and Toyoda, Masashi and Kitsuregawa, Masaru", + "booktitle": "Proceedings of the 14th International Conference on Information Visualisation", + "doi": "10.1109/IV.2010.18", + "keywords": "3d, type:technique, paradigm:node-link, time:timeline, evaluation:none, application:document, superimposed_node-link", + "pages": "54--60", + "publisher": "IEEE", + "references": "Toyoda2005System Brandes2003Visual", + "series": "IV", + "title": "An Interactive Visualization Framework for Time-Series of Web Graphs in a {3D} Environment", + "type": "inproceedings", + "year": "2010" + }, + "Itoh2012Analysis": { + "abstract": "Social media such as blogs and microblogs enable users to easily and rapidly publish information on their personal activities and interests. They are considered to provide valuable information from the viewpoints of sociology, linguistics, and marketing. This paper proposes a novel system for analyzing temporal changes in the activities and interests of bloggers through a 3D visualization of phrase dependency structures in sentences. We first extract events that represent bloggers' activities and interests through analyzing the phrase dependencies of sentences in a blog archive. We roughly categorize the retrieved events according to the thematic roles (such as the experiencer, agent, and location) of the noun within the events, and then store them in a dependency database so that we can retrieve events that involve a given topic. Second, we present a 3D visualization framework for exploring temporal changes in events related to a topic. Our framework enables users to find events about a topic that appear within a specific timing, and drill down details of the events. It also enables users to compare events with different timings and/or on multiple topics. Moreover, it allows them to observe an overview of temporal changes in sets of events, and long-term changes in the frequency of events to assist users in finding trends. We implement the proposed system on our own five-year blog archive that focused on Japanese, and we report the usefulness of our system by using various examples.", + "author": "Itoh, Masahiko and Yoshinaga, Naoki and Toyoda, Masashi and Kitsuregawa, Masaru", + "booktitle": "Proceeding of the 2012 IEEE Pacific Visualization Symposium", + "doi": "10.1109/PacificVis.2012.6183574", + "keywords": "type:application, paradigm:node-link, time:timeline, evaluation:case\\_study, application:social, social_media", + "organization": "IEEE", + "pages": "57--64", + "references": "Brandes2003Visual Itoh2010Interactive Toyoda2005System", + "series": "PacificVis", + "title": "Analysis and Visualization of Temporal Changes in Bloggers' Activities and Interests", + "type": "inproceedings", + "year": "2012" + }, + "Itoh2012Visualization": { + "abstract": "A huge number of historical documents that have been accumulated for a long time are currently being digitized. However, it is difficult for us to analyze and obtain insight into the past from such documents. This paper proposes an interactive visualization system to extract networks of historical figures from historical data and to show time-varying changes in their relationships. It enables users to explore changes in the structure of the network interactively. Moreover, it extracts characteristics of each relationship, such as hostile or friendly relations, and visualizes them on the network. It enables us to understand changes in past society better by exploring changes in relationships between people.", + "author": "Itoh, Masahiko and Akaishi, Mina", + "booktitle": "Proceedings of the 16th International Conference on Information Visualisation", + "doi": "10.1109/IV.2012.55", + "issn": "1550-6037", + "keywords": "application:social, paradigm:node-link, time:timeline, evaluation:case\\_study, type:application, social_media", + "pages": "283-290", + "publisher": "IEEE", + "references": "Itoh2010Interactive Shi2011Dynamic", + "series": "IV", + "title": "Visualizing for Changes in Relationships between Historical Figures in Chronicles", + "type": "inproceedings", + "year": "2012" + }, + "John2011Constructing": { + "abstract": "The \u03c0-calculus, in particular its stochastic version the stochastic \u03c0-calculus, is a common modeling formalism to concisely describe the chemical reactions occurring in biochemical systems. However, it remains largely unexplored how to transform a biochemical model expressed in the stochastic \u03c0-calculus back into a set of meaningful reactions. To this end, we present a two step approach of first translating model states to reaction sets and then visualizing sequences of reaction sets, which are obtained from state trajectories, in terms of reaction networks. Our translation from model states to reaction sets is formally defined and shown to be correct, in the sense that it reflects the states and transitions as they are derived from the continuous time Markov chain-semantics of the stochastic \u03c0-calculus. Our visualization concept combines high level measures of network complexity with interactive, table-based network visualizations. It directly reflects the structures introduced in the first step and allows modelers to explore the resulting simulation traces by providing both: an overview of a network\u2019s evolution and a detail inspection on demand.", + "author": "John, Mathias and Schulz, Hans-J\\\"org and Schumann, Heidrun and Uhrmacher, Adelinde M and Unger, Andrea", + "doi": "10.1007/s00165-011-0209-0", + "journal": "Formal Aspects of Computing", + "keywords": "type:application, paradigm:node-link, time:timeline, application:biology, evaluation:case\\_study", + "number": "5", + "pages": "723-742", + "publisher": "Springer", + "title": "Constructing and Visualizing Chemical Reaction Networks From Pi-Calculus Models", + "type": "article", + "volume": "25", + "year": "2012" + }, + "Kang2007Visual": { + "abstract": "C-Group is a tool for analyzing dynamic group membership in temporal 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. While C-Group allows for viewing the addition and deletion of nodes (actors) and edges (relationships) over time, its major contribution is its focus on changing group memberships over time. By doing so, users can investigate the context of temporal group memberships for the pair. C-Group provides users with a flexible interface for defining (and redefining) groups interactively, 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. We demonstrate the utility of the tool on a scientific publication network.", + "author": "Kang, Hyunmo and Getoor, Lise and Singh, Lisa", + "doi": "10.1145/1345448.1345452", + "journal": "ACM SIGKDD Explorations Newsletter", + "keywords": "type:application, time:animation, paradigm:node-link, application:social, evaluation:case_study, weighted_graph, bipartite", + "number": "2", + "pages": "13--21", + "publisher": "ACM", + "references": "Bender-deMoll2006Science Moody2005Dynamic", + "title": "Visual analysis of dynamic group membership in temporal social networks", + "type": "article", + "volume": "9", + "year": "2007" + }, + "Kerracher2014Design": { + "abstract": "This paper presents our work in mapping the design space of techniques for temporal graph visualisation. We identify two independent dimensions upon which the techniques can be classified: graph structural encoding and temporal encoding. Based on these dimensions, we create a matrix into which we organise existing techniques. We identify gaps in this design space which may prove interesting opportunities for the development of novel techniques. We also consider additional dimensions on which further useful classification could be made. In organising the disparate existing approaches from a wide range of domains, our classification will assist those new to the research area, and designers and evaluators developing systems for temporal graph data by raising awareness of the range of possible approaches available, and highlighting possible directions for further research.", + "author": "Kerracher, Natalie and Kennedy, Jessie and Chalmers, Kevin", + "booktitle": "EuroVis - Short Papers", + "doi": "10.2312/eurovisshort.20141149", + "keywords": "evaluation:survey, type:evaluation, time:generic, paradigm:generic, application:generic, taxonomy", + "pages": "7--11", + "publisher": "Eurographics Assocation", + "references": "Archambault2011Animation Bender-deMoll2006Science Bach2014GraphDiaries Bach2014Visualizing Federico2011Visual Farrugia2011Exploring Farrugia2011Effective Frishman2008Online Groh2009Interactively Hadlak2011Situ Itoh2010Interactive Moody2005Dynamic Perer2012MatrixFlow Rufiange2013DiffAni Reitz2009Focused Saraiya2005Visualization Shi2011Dynamic Yi2010TimeMatrix Kerracher2015Task", + "title": "The Design Space of Temporal Graph Visualisation", + "type": "inproceedings", + "year": "2014" + }, + "Kerracher2015Task": { + "abstract": "By extending and instantiating an existing formal task framework, we define a task taxonomy and task design space for temporal graph visualisation. We discuss the process involved in their generation, and describe how the design space can be \u2018sliced and diced\u2019 into multiple overlapping task categories, requiring distinct visual techniques for their support. The approach addresses deficiencies in the task literature, offering domain independence, greater task coverage, and unambiguous task specification. The taxonomy and design space capture tasks for temporal graphs, and also static graphs, multivariate graphs, and graph comparison, and will be of value in the design and evaluation of temporal graph visualisation systems.", + "author": "Kerracher, Natalie and Kennedy, Jessie and Chalmers, Kevin", + "doi": "10.1109/TVCG.2015.2424889", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "type:evaluation, evaluation:survey, tasks, taxonomy, time:generic, paradigm:generic, application:generic", + "publisher": "IEEE", + "references": "Ahn2013Task Yi2010TimeMatrix Bach2014GraphDiaries Kerracher2014Design Kang2007Visual Archambault2011Animation Farrugia2011Effective Beck2013Matching", + "series": "TVCG", + "title": "A Task Taxonomy for Temporal Graph Visualisation", + "type": "article", + "year": "2015" + }, + "Kerracher2015Visual": { + "abstract": "Recently, much research has focused on developing techniques for the visual representation of temporal graph data. This paper takes a wider look at the visual techniques involved in exploratory analysis of such data, considering the variety of sub tasks and contextual tasks required to understand change in a graph over time, and the visual techniques which are able to support these tasks. In so doing, we highlight a number of tasks which are less well supported by existing techniques, which could prove worthwhile avenues for future research.", + "author": "Kerracher, Natalie and Kennedy, Jessie and Chalmers, Kevin and Graham, Martin", + "booktitle": "Eurographics Conference on Visualization (EuroVis) - Short Papers", + "doi": "10.2312/eurovisshort.20151133", + "keywords": "type:evaluation, evaluation:survey, time:generic, paradigm:generic, application:generic, tasks, taxonomy", + "publisher": "The Eurographics Association", + "references": "Ahn2011Temporal Beck2014State Bach2014Visualizing Bach2014GraphDiaries Farrugia2011Exploring Itoh2010Interactive Kerracher2014Design Kerracher2015Task Perer2012MatrixFlow Yi2010TimeMatrix Zaman2011Effect", + "series": "EuroVis", + "title": "{Visual Techniques to Support Exploratory Analysis of Temporal Graph Data}", + "type": "inproceedings", + "year": "2015" + }, + "Kimelman1995Reduction": { + "abstract": "Graphs are used extensively in software visualization to represent both static aspects of software structure and dynamic aspects of execution-time behavior. However, for realistic subject software systems, there are far too many nodes and edges in the displayed graphs to be comprehensible to an end user. Further, for presentation of dynamics, continual change and redisplay of such large graphs is too demanding for conventional workstation computational resources. This paper poses the problem of \u201creduction\u201d or \u201cabstraction\u201d in dynamically changing graphs, and proposes a combination of techniques that can be used to reduce the visual complexity of a graph, without obscuring the significant information that it was meant to convey. The abstract graph can be comprehended more readily and it changes far less frequently than the full graph. As well, when the abstract graph does change, it requires far less computation for layout and redisplay. These abstraction techniques are illustrated by way of examples showing their use in systems for visualization of object-oriented and multi-layer software systems.", + "author": "Kimelman, Doug and Leban, Bruce and Roth, Tova and Zernik, Dror", + "booktitle": "Graph Drawing", + "doi": "10.1007/3-540-58950-3_373", + "keywords": "type:application, time:generic, paradigm:generic, application:software_engineering, program_execution, evaluation:case_study", + "pages": "218--225", + "publisher": "Springer", + "series": "GD", + "title": "Reduction of visual complexity in dynamic graphs", + "type": "inproceedings", + "year": "1995" + }, + "Kobourov2013Force": { + "abstract": "Force-directed algorithms are among the most flexible methods for calculating layouts of simple undirected graphs. Also known as spring embedders, such algorithms calculate the layout of a graph using only information contained within the structure of the graph itself, rather than relying on domain-specific knowledge. Graphs drawn with these algorithms tend to be aesthetically pleasing, exhibit symmetries, and tend to produce crossing-free layouts for planar graphs. In this survey we consider several classical algorithms, starting from Tutte's 1963 barycentric method, and including recent scalable multiscale methods for large and dynamic graphs.", + "author": "Kobourov, Stephen G", + "booktitle": "Handbook of Graph Drawing and Visualization", + "keywords": "type:evaluation, paradigm:node-link, force-directed\\_layout, time:animation, evaluation:survey, application:generic", + "pages": "383--408", + "publisher": "CRC", + "references": "Cohen1992Framework Cohen1995Dynamic Collberg2003System Erten2004Exploring Bastian2009Gephi Forrester2005graphael", + "title": "Force-directed drawing algorithms", + "type": "incollection", + "url": "https://cs.brown.edu/~rt/gdhandbook/", + "year": "2013" + }, + "Kumar2006Visual": { + "abstract": "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", + "author": "Kumar, Gautam and Garland, Michael", + "doi": "10.1109/tvcg.2006.193", + "issn": "1077-2626", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "force-directed\\_layout, clustering, paradigm:node-link, time:animation, evaluation:case\\_study, application:business, application:biology, type:technique, compound_graph, offline\\_problem, mental\\_map, weighted_graph, special-purpose_layout", + "number": "5", + "pages": "805--812", + "series": "TVCG", + "title": "Visual Exploration of Complex Time-Varying Graphs", + "type": "article", + "volume": "12", + "year": "2006" + }, + "Lad2006Visualizing": { + "abstract": "Today's Internet provides a global data delivery service to millions of end users and routing protocols play a critical role in this service. It is important to be able to identify and diagnose any problems occurring in Internet routing. However, the Internet's sheer size makes this task difficult. One cannot easily extract out the most important or relevant routing information from the large amounts of data collected from multiple routers. To tackle this problem, we have developed Link-Rank, a tool to visualize Internet routing changes at the global scale. Link-Rank weighs links in a topological graph by the number of routes carried over each link and visually captures changes in link weights in the form of a topological graph with adjustable size. Using Link-Rank, network operators can easily observe important routing changes from massive amounts of routing data, discover otherwise unnoticed routing problems, understand the impact of topological events, and infer root causes of observed routing changes.", + "author": "Lad, Mohit and Massey, Daniel and Zhang, Lixia", + "doi": "10.1109/TVCG.2006.108", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "type:application, time:timeline, paradigm:node-link, evaluation:case_study, application:infrastructure", + "number": "6", + "pages": "1450--1460", + "publisher": "IEEE", + "series": "TVCG", + "title": "Visualizing internet routing changes", + "type": "article", + "volume": "12", + "year": "2006" + }, + "Lee2006Mental": { + "abstract": "Information visualization has attracted much attention in recent years in many fields of science and engineering. In many applications, graphs are 'dynamic' in the sense that changes are constantly applied to a graph to reflect the evolution of the system behaviour represented by the graph. In the past, the concept of the so-called \"mental map\" has largely been ignored. Users often have to spend a lot of time relearning the redrawn graphs. This paper proposes an effective way to release the user from such kind of a distasteful job by maintaining a high degree of the \"mental map\" for general graphs when graphs are redrawn. Our experimental results suggest this new approach to be promising.", + "author": "Lee, Yi-Yi and Lin, Chun-Cheng and Yen, Hsu-Chun", + "booktitle": "Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation", + "keywords": "type:technique, paradigm:node-link, mental_map, time:animation, evaluation:case_study, application:generic, online_problem, general-purpose_layout", + "pages": "179--188", + "publisher": "Australian Computer Society, Inc.", + "references": "Misue1995Layout", + "series": "APVis", + "title": "Mental map preserving graph drawing using simulated annealing", + "type": "inproceedings", + "year": "2006" + }, + "Li2013Visual": { + "abstract": "As a novel type of real-time social networking service, microblogging has already become ubiquitous and an irreplaceable tool. Tracking in the pulse of retweeting propagation is important and meaningful. In this paper, we investigate how information propagation in a specific microblogging platform evolves to identify relevant patterns and understand dynamic attributes of information propagation and the underlying sociological motivations. More specifically, based on the node-link diagram, we propose three efficient strategies to map the multiple attributes of information propagation graph to appropriate visual elements. For revealing the dynamic attributes, we propose two models: the depth-varying and the time-varying parallel data model to illustrate the temporal evolution efficiently. We also present a novel method by combining the traditional scatter plot with Hough transformation to represent the distribution of propagation instances and trace the propagation speeds. We integrate our methods to a visual mining tool and develop several interactive features. We demonstrate how our approaches improve the understanding of the propagation graph from a visual perspective by employing propagation datasets collected from Sina Weibo, the largest microblogging service provider in mainland China. Meanwhile, this visual mining tool has been evaluated by data analysts and successfully used in Sina Corporation as a helpful assistant to them.", + "author": "Li, Quan and Qu, Huamin and Chen, Li and Wang, Robert and Yong, Junhai and Si, Detan", + "booktitle": "Proceedings of the 6th International Symposium on Visual Information Communication and Interaction", + "doi": "10.1145/2493102.2493108", + "keywords": "type:application, time:timeline, time:animation, evaluation:expert, paradigm:node-link, social_media, application:social", + "organization": "ACM", + "pages": "44--53", + "references": "Burch2011Parallel Diehl2002Graphs Frishman2008Online Gorg2005Dynamic", + "series": "VINCI", + "title": "Visual analysis of retweeting propagation network in a microblogging platform", + "type": "inproceedings", + "year": "2013" + }, + "Liao2013Visual": { + "abstract": "The amount of information flowing across communication networks has rapidly increased. The highly dynamic and complex networks, represented as large graphs, make the analysis of such networks increasingly challenging. In this paper, we provide a brief overview of several useful visualization techniques for the analysis of spatiotemporal anomalies in large-scale networks. We make use of community-based similarity graphs (CSGs), temporal expansion model graphs (TEMGs), correlation graphs (CGs), high-dimension projection graphs (HDPGs), and topology-preserving compressed graphs (TPCGs). CSG is used to detect anomalies based on community membership changes rather than individual nodes and edges and therefore may be more tolerant to the highly dynamic nature of large networks. TEMG transforms network topologies into directed trees so that efficient search is more likely to be performed for anomalous changes in network behavior and routing topology in large dynamic networks. CG and HDPG are used to examine the complex relationship of data dimensions among graph nodes through transformation in a high-dimensional space. TPCG groups nodes with similar neighbor sets into mega-nodes, thus making graph visualization and analysis more scalable to large networks. All the methods target efficient large-graph anomaly visualization from different perspectives and together provide valuable insights.", + "author": "Liao, Qi and Shi, Lei and Wang, Chen", + "doi": "10.1147/JRD.2013.2249356", + "journal": "IBM Journal of Research and Development", + "keywords": "type:application, paradigm:node-link, application:infrastructure, evaluation:case_study, time:timeline", + "number": "3/4", + "pages": "13:1-13:12", + "publisher": "IBM", + "title": "Visual analysis of large-scale network anomalies", + "type": "article", + "volume": "57", + "year": "2013" + }, + "Lin2010ContexTour": { + "abstract": "Huge amounts of rich context social network data are generated everyday from various applications such as FaceBook and Twitter. These data involve multiple social relations which are community-driven and dynamic in nature. The complex interplay of these characteristics poses tremendous challenges on the users who try to understand the underlying patterns in the social media. We introduce an exploratory analytical framework, ContexTour, which generates visual representations for exploring multiple dimensions of community activities, including relevant topics, representative users and the community-generated content, as well as their evolutions. ContexTour consists of two novel and complementary components: (1) Dynamic Relational Clustering (DRC) that efficiently tracks the community evolution and smoothly adapts to the community changes, and (2) Dynamic Network Contour-map (DNC) that visualizes the community activities and evolutions in various dimensions. In our experiments, we demonstrate ContexTour through case studies on the DBLP dataset. The visual results capture interesting and reasonable evolution in Computer Science research communities. Quantitatively, we show 85-165X performance gain of our DRC algorithm over the baseline method.", + "author": "Lin, Yu-Ru and Sun, Jimeng and Cao, Nan and Liu, Shixia", + "booktitle": "Proceedings of the 2010 SIAM International Conference on Data Mining", + "doi": "10.1137/1.9781611972801.37", + "keywords": "mental\\_map, compound_graph, clustering, type:technique, paradigm:node-link, map\\_metaphor, time:animation, evaluation:case\\_study, evaluation:algorithmic, application:document, special-purpose_layout", + "pages": "418--429", + "references": "Kumar2006Visual", + "series": "SDM", + "title": "{ContexTour}: Contextual Contour Visual Analysis on Dynamic Multi-Relational Clustering", + "type": "inproceedings", + "year": "2010" + }, + "Loubier2008Temporal": { + "abstract": "This article presents a tool namely VisuGraph, designed to support temporal data visualization by means of graph representation that offers users a synthetic view of knowledge, difficult to extract from a data corpus. The temporal dimension adds the possibility to situate past, but also present or future events and strategies. In this context, we propose a graph-morphing algorithm in order to highlight major tendencies and significant data changes during different periods of time. The goal is to present an animation based on a graph of temporal data, with every period pooled, followed up by each period graph successively. Our approach is based on a space-time analogy like for a clock. For each period, we propose to design a temporal mark, represented in a chronological order in the extremities of the visualization frame, like the hours on a clock. Each element of data is placed near the temporal marks according to its presence during each period. Thus, visualization of the successive periods makes it possible to detect persisting or temporary data and to detect a chronology in the changes in relations.", + "author": "Loubier, Elo\\\"ise and Dousset, Bernard", + "journal": "Safety and Reliability for Managing Risk", + "keywords": "type:technique, paradigm:node-link, time:animation, force-directed_layout, evaluation:case_study, offline_problem, application:document, general-purpose_layout, transition_problem", + "number": "02", + "pages": "2008--16", + "references": "Collberg2003System", + "series": "ESREL", + "title": "Temporal and relational data representation by graph morphing", + "type": "article", + "volume": "14", + "year": "2008" + }, + "Ma2015Visualizing": { + "abstract": "Dynamic network visualization has been a challenging topic for dynamic networks analysis, especially for spatially embedded networks like brain networks. In this paper, we present an animated interactive visualization design that combines enhanced node-link diagrams and distance matrix layouts to assist neuroscientists in their exploration of dynamic brain networks and that enables them to understand how functional connections relate to the spatial structure of the brain. Our visualization also provides the ability to observe the evolution of a network, the change in the community identities, and node behavior over time.", + "author": "Ma, Chihua and Kenyon, Robert V. and Forbes, Angus G. and Berger-Wolf, Tanya and Slater, Bernard J. and Llano, Daniel A.", + "booktitle": "Eurographics Conference on Visualization (EuroVis) - Short Papers", + "doi": "10.2312/eurovisshort.20151128", + "keywords": "type:application, time:animation, paradigm:matrix, paradigm:node-link, application:biology, evaluation:case_study, weighted_graph, graph_difference", + "publisher": "The Eurographics Association", + "references": "Archambault2011Animation Bastian2009Gephi Moody2005Dynamic Vehlow2014Visualizing", + "series": "EuroVis", + "title": "{Visualizing Dynamic Brain Networks Using an Animated Dual-Representation}", + "type": "inproceedings", + "year": "2015" + }, + "Mashima2012Visualizing": { + "abstract": "Maps offer a familiar way to present geographic data (continents, countries), and additional information (topography, geology), can be displayed with the help of contours and heat-map overlays. In this paper, we consider visualizing large-scale dynamic relational data by taking advantage of the geographic map metaphor. We describe a map-based visualization system which uses animation to convey dynamics in large data sets, and which aims to preserve the viewer\u2019s mental map while also offering readable views at all times. Our system is fully functional and has been used to visualize user traffic on the Internet radio station last.fm, as well as TV-viewing patterns from an IPTV service. All map images in this paper are available in high-resolution at [1] as are several movies illustrating the dynamic visualization.", + "author": "Mashima, Daisuke and Kobourov, Stephen G and Hu, Yifan", + "doi": "10.1109/TVCG.2011.288", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "map\\_metaphor, mental\\_map, type:technique, paradigm:node-link, time:animation, evaluation:case\\_study, application:media, compound_graph, special-purpose_layout", + "number": "9", + "pages": "1424--1437", + "publisher": "IEEE", + "references": "Branke2001Dynamic Collberg2003System", + "series": "TVCG", + "title": "Visualizing Dynamic Data with Maps", + "type": "article", + "volume": "18", + "year": "2012" + }, + "Misue1995Layout": { + "abstract": "Many models in software and information engineering use graph representations; examples are data flow diagrams, state transition diagrams, flow charts, PERT charts, organization charts, Petri nets and entity-relationship diagrams. The usefulness of these graph representations depends on the quality of the layout of the graphs. Automatic graph layout, which can release humans from graph drawing, is now available in several visualization systems. Most automatic layout facilities take a purely combinatorial description of a graph and produce a layout of the graph; these methods are called 'layout creation' methods. For interactive systems, another kind of layout is needed: a facility which can adjust a layout after a change is made by the user or by the application. Although layout adjustment is essential in interactive systems, most existing layout algorithms are designed for layout creation. The use of a layout creation method for layout adjustment may totally rearrange the layout and thus destroy the user's 'mental map' of the diagram; thus a set of layout adjustment methods, separate from layout creation methods, is needed. This paper discusses some layout adjustment methods and the preservation of the 'mental map' of the diagram. First, several models are proposed to make the concept of 'mental map' more precise. Then two kinds of layout adjustments are described. One is an algorithm for rearranging a diagram to avoid overlapping nodes, and the other is a method aimed at changing the focus of interest of the user without destroying the mental map. Next, some experience with visualization systems in which the techniques have been employed is also described.", + "author": "Misue, Kazuo and Eades, Peter and Lai, Wei and Sugiyama, Kozo", + "doi": "10.1006/jvlc.1995.1010", + "issn": "1045926X", + "journal": "Journal of Visual Languages \\& Computing", + "keywords": "type:technique, paradigm:node-link, time:animation, evaluation:case\\_study, compound_graph, application:software\\_engineering, application:social, online\\_problem, mental\\_map, general-purpose_layout", + "number": "2", + "pages": "183--210", + "title": "Layout Adjustment and the Mental Map", + "type": "article", + "volume": "6", + "year": "1995" + }, + "Moody2005Dynamic": { + "abstract": "Increased interest in longitudinal social networks and the recognition that visualization fosters theoretical insight create a need for dynamic network visualizations, or network ``movies.'' This article confronts theoretical questions surrounding the temporal representations of social networks and technical questions about how best to link network change to changes in the graphical representation. The authors divide network movies into (1) static flip books, where node position remains constant but edges cumulate over time, and (2) dynamic movies, where nodes move as a function of changes in relations. Flip books are particularly useful in contexts where relations are sparse. For more connected networks, movies are often more appropriate. Three empirical examples demonstrate the advantages of different movie styles. A new software program for creating network movies is discussed in the appendix.", + "author": "Moody, James and McFarland, Daniel A and Bender-deMoll, Skye", + "doi": "10.1086/421509", + "journal": "American Journal of Sociology", + "keywords": "time:animation, paradigm:node-link, application:social, type:application, evaluation:case_study", + "number": "4", + "pages": "1206--1241", + "title": "Dynamic Network Visualisation", + "type": "article", + "volume": "110", + "year": "2005" + }, + "Nesbitt2002Applying": { + "abstract": "Graphs are a commonly used data structure for representing relational information. Drawings of these structures, as node and link diagrams, can provide a useful visualization of the underlying abstract data. This makes drawings of graphs a useful tool in information visualization. Indeed graph drawing has been applied in many application areas including software engineering, knowledge management and for depicting communication networks. The spatial layout can help the user build up a cognitive model or 'mental map' of the information structure. Many automatic algorithms for producing drawings of a graph have been implemented. In many domains it is also common for the underlying information to be dynamic and this means the graph drawing must be updated. Unfortunately, even small changes to the underlying data can result in dramatic changes to the final drawing and this means the user may totally lose their previous 'mental map'. Animation between the two versions of the layout is one approach that can assist the user to make the transition between the two drawings. We have been examining how to apply the Gestalt principles of organisation to this animation phase. The aim is to assist the user in understanding the structural and visual changes that have occurred in the layout. Results of that work are described with relevant examples.", + "author": "Nesbitt, Keith V and Friedrich, Carsten", + "booktitle": "Proceedings of the 6th International Conference on Information Visualisation", + "doi": "10.1109/IV.2002.1028859", + "keywords": "gestalt_laws, mental_map, type:technique, paradigm:node-link, time:animation, evaluation:case_study, application:generic, compound_graph, general-purpose_layout, transition_problem", + "pages": "737--743", + "publisher": "IEEE", + "references": "Misue1995Layout", + "series": "IV", + "title": "Applying Gestalt Principles to Animated Visualizations of Network Data", + "type": "inproceedings", + "year": "2002" + }, + "North1996Incremental": { + "abstract": "Graph drawings are a basic component of user interfaces that display relationships between objects. Generating incrementally stable layouts is important for many applications. This paper describes DynaDAG, a new heuristic for incremental layout of directed acyclic graphs drawn as hierarchies, and its application in the DynaGraph system.", + "author": "North, Stephen C", + "booktitle": "Graph Drawing", + "doi": "10.1007/BFb0021824", + "keywords": "paradigm:node-link, type:technique, acyclic_graph, mental_map, time:animation, application:generic, evaluation:none, online_problem, special-purpose_layout", + "organization": "Springer", + "pages": "409--418", + "series": "GD", + "title": "Incremental layout in {DynaDAG}", + "type": "inproceedings", + "year": "1996" + }, + "Oelke2013Fingerprint": { + "abstract": "In prose literature often complex dynamics of interpersonal relationships can be observed between the different characters. Traditionally, node-link diagrams are used to depict the social network of a novel. However, static graphs can only visualize the overall social network structure but not the development of the networks over the course of the story, while dynamic graphs have the serious problem that there are many sudden changes between different portions of the overall social network. In this paper we explore means to show the relationships between the characters of a plot and at the same time their development over the course of a novel. Based on a careful exploration of the design space, we suggest a new visualization technique called Fingerprint Matrices. A case study exemplifies the usage of Fingerprint Matrices and shows that they are an effective means to analyze prose literature with respect to the development of relationships between the different characters.", + "author": "Oelke, Daniela and Kokkinakis, Dimitrios and Keim, Daniel A", + "doi": "10.1111/cgf.12124", + "journal": "Computer Graphics Forum", + "keywords": "type:application, paradigm:matrix, time:timeline, evaluation:case\\_study, application:social", + "number": "3pt4", + "pages": "371--380", + "references": "Brandes2011Asymmetric Burch2011Parallel Farrugia2011Effective Moody2005Dynamic Stein2010PixelOriented Yi2010TimeMatrix", + "series": "CGF", + "title": "{Fingerprint Matrices}: Uncovering the dynamics of social networks in prose literature", + "type": "article", + "volume": "32", + "year": "2013" + }, + "Ogawa2008StarGate": { + "abstract": "With the success of open source software projects, such as Apache and Mozilla, comes the opportunity to study the development process. In this paper, we present StarGate: a novel system for visualizing software projects. Whereas previous software project visualizations concentrated mainly on the source code changes, we literally place the developers in the center of our design. Developers are grouped visually into clusters corresponding to the areas of the file repository they work on the most. Connections are drawn between people who communicate via email. The changes to the repository are also displayed. With StarGate, it is easy to look beyond the source code and see trends in developer activity. The system can be used by anyone interested in the project, but it especially benefits project managers, project novices and software engineering researchers.", + "author": "Ogawa, Michael and Ma, Kwan-Liu", + "booktitle": "Proceedings of the IEEE Pacific Visualization Symposium", + "doi": "10.1109/PACIFICVIS.2008.4475476", + "keywords": "type:application, time:animation, paradigm:node-link, application:software_engineering, software_evolution, radial, evaluation:case_study", + "pages": "191--198", + "publisher": "IEEE", + "references": "Brandes2003Visual Chen2003Visualizing Collberg2003System Saraiya2005Visualization", + "series": "PacificVis", + "title": "{StarGate}: A unified, interactive visualization of software projects", + "type": "inproceedings", + "year": "2008" + }, + "Ogawa2009codeswarm": { + "abstract": "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.", + "author": "Ogawa, Michael and Ma, Kwan-Liu", + "doi": "10.1109/TVCG.2009.123", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "type:application, paradigm:node-link, omitted_links, time:animation, time:timeline, evaluation:user_study, application:software_engineering, software_evolution", + "number": "6", + "pages": "1097--1104", + "publisher": "IEEE", + "references": "Collberg2003System Ogawa2008StarGate", + "series": "TVCG", + "title": "code\\_swarm: A design study in organic software visualization", + "type": "article", + "volume": "15", + "year": "2009" + }, + "Perer2012MatrixFlow": { + "abstract": "To develop a visual analytic system to help medical professionals improve disease diagnosis by providing insights for understanding disease progression. We develop MatrixFlow, a visual analytic system that takes clinical event sequences of patients as input, constructs time-evolving networks and visualizes them as a temporal flow of matrices. MatrixFlow provides several interactive features for analysis: 1) one can sort the events based on the similarity in order to accentuate underlying cluster patterns among those events; 2) one can compare co-occurrence events over time and across cohorts through additional line graph visualization. MatrixFlow is applied to visualize heart failure (HF) symptom events extracted from a large cohort of HF cases and controls (n", + "author": "Perer, Adam and Sun, Jimeng", + "booktitle": "AMIA Annual Symposium Proceedings", + "keywords": "type:application, time:timeline, paradigm:matrix, evaluation:case_study, application:biology", + "pages": "716", + "publisher": "American Medical Informatics Association", + "references": "Moody2005Dynamic Yi2010TimeMatrix", + "series": "AMIA", + "title": "{MatrixFlow}: Temporal network visual analytics to track symptom evolution during disease progression", + "type": "inproceedings", + "volume": "2012", + "year": "2012" + }, + "Pohl2008Interactive": { + "abstract": "A variety of applications especially in the area of Web 2.0 produce frequently altering hierarchical networks. Thus application operators, members of community websites but also media scientists often are interested in gaining deeper insights in the complex structures of their project and its development over time. In order to enable a suitable visualization of such networks it is not only required to implement an intelligent data management but also a suitable network drawing engine that cares for the user's needs --- especially for visualization of network dynamics. This paper presents the Xldn visualization tool that enables visual exploration of evolving hierarchical networks. It includes a layout generation algorithm that allows for the preservation of the mental map --- a crucial property when visualizing dynamic networks. By utilization of an efficient data management and a parallel implementation of the graph drawing algorithm Xldn provides a reasonably fast and interactive network visualization. This way Xldn facilitates an in-depth evolution analysis of large hierarchic networks.", + "author": "Pohl, Mathias and Birke, Peter", + "booktitle": "Proceedings of the 10th International Conference on Visual Information Systems", + "doi": "10.1007/978-3-540-85891-1\\_8", + "isbn": "978-3-540-85890-4", + "journal": "Visual Information Systems. Web-Based Visual Information Search and Management", + "keywords": "type:technique, paradigm:node-link, compound_graph, mental\\_map, time:animation, evaluation:none, application:social, special-purpose_layout", + "pages": "56--67", + "publisher": "Springer-Verlag", + "references": "Diehl2001Preserving", + "series": "VISUAL", + "title": "Interactive Exploration of Large Dynamic Networks", + "type": "inproceedings", + "year": "2008" + }, + "Pupyrev2010Analyzing": { + "abstract": "In this paper, we consider the problem of analysis and visualization of online conversations (chat histories, email archives, etc.). We present a dynamic graph drawing algorithm based on modification of multidimensional scaling. The algorithm builds a layout of sequence of graphs and produces a slice view of the evolution of online communications. The method have been applied for visualization of two real-world datasets. We show how to use these visualizations for analyzing and extracting hidden temporal patterns from online conversation data.", + "author": "Pupyrev, Sergey and Tikhonov, Alexey", + "booktitle": "Proceedings of the 10th International Conference on Intelligent Systems Design and Applications", + "doi": "10.1109/ISDA.2010.5687175", + "keywords": "type:application, paradigm:node-link, time:timeline, evaluation:case\\_study, application:social, social_media", + "organization": "IEEE", + "pages": "748--753", + "references": "Brandes2003Visual Dwyer2004Visualising Misue1995Layout", + "series": "ISDA", + "title": "Analyzing Conversations with Dynamic Graph Visualization", + "type": "inproceedings", + "year": "2010" + }, + "Purchase2007Important": { + "abstract": "While some research has been performed on the human understanding of static graph layout algorithms, dynamic graph layout algorithms have only recently been developed sufficiently to enable similar investigations. This paper presents the first empirical analysis of a dynamic graph layout algorithm, focusing on the assumption that maintaining the \u201d mental map\u201d between time-slices assists with the comprehension of the evolving graph. The results confirm this assumption with respect to some categories of tasks.", + "author": "Purchase, Helen C and Hoggan, Eve and G\\\"org, Carsten", + "booktitle": "Graph Drawing", + "doi": "10.1007/978-3-540-70904-6_19", + "isbn": "978-3-540-70903-9", + "keywords": "mental\\_map, type:evaluation, paradigm:node-link, time:animation, evaluation:user_study, application:generic", + "pages": "184--195", + "publisher": "Springer", + "series": "GD", + "title": "How Important Is the ``Mental Map''? -- An Empirical Investigation of a Dynamic Graph Layout Algorithm Graph Drawing", + "type": "incollection", + "year": "2007" + }, + "Purchase2008Extremes": { + "abstract": "Research on effective algorithms for efficient graph layout continues apace, and faster technology has led to increasing research on algorithms for the depiction of dynamic graphs which represent changing relational information over time. Like the static layout algorithms that preceded these, empirical work lags behind their design, and assumptions are made about how users\u2019 comprehension may be enhanced without human data to support them. This paper presents an experiment investigating an existing dynamic layout algorithm, focusing on the effect of the preservation of the mental map on comprehension. The results indicate that extremes produce better performance, suggesting that individual preference may be important.", + "author": "Purchase, Helen C and Samra, Amanjit", + "booktitle": "Diagrammatic Representation and Inference", + "doi": "10.1007/978-3-540-87730-1_9", + "keywords": "mental\\_map, paradigm:node-link, type:evaluation, mental\\_map, evaluation:user\\_study, time:animation, application:social", + "pages": "60--73", + "publisher": "Springer", + "references": "Brandes2003Visual Collberg2003System Lee2006Mental Saffrey2008Mental", + "series": "Diagrams", + "title": "Extremes are better: Investigating mental map preservation in dynamic graphs", + "type": "incollection", + "year": "2008" + }, + "Reitz2009Focused": { + "abstract": "Many applications feature large hierarchic dynamic graphs that change over time. Often, these changes are more important than the graphs themselves.In our approach, areas of interests in dynamic graphs are detected based on user preferences. The user is guided from one area of interest to another in such a way that reduced contextual information is shown. To this end, dynamic graph layout mechanisms are extended by a reprocessing that decides what to show and a post processing that stages the animation based on spatial information.", + "author": "Reitz, Florian and Pohl, Mathias and Diehl, Stephan", + "booktitle": "Proceedings of the 13th International Conference on Information Visualisation", + "doi": "10.1109/iv.2009.24", + "isbn": "978-0-7695-3733-7", + "keywords": "paradigm:node-link, time:animation, compound_graph, evaluation:case\\_study, application:software\\_engineering, type:technique, special-purpose_layout", + "pages": "679--684", + "publisher": "IEEE", + "references": "Misue1995Layout Pohl2008Interactive", + "series": "IV", + "title": "Focused Animation of Dynamic Compound Digraphs", + "type": "inproceedings", + "year": "2009" + }, + "Reitz2010Framework": { + "abstract": "Understanding constellations in large data collections has become a common task. One obstacle a user has to overcome is the internal complexity of these repositories. For example, extracting connected data from a normalized relational database requires knowledge of the table structure which might not be available for the casual user. In this paper we present a visualization framework which presents the collection as a set of entities and relations (on the data level). Using rating functions, we divide large relation networks into small graphs which resemble ego-centered networks. These graphs are connected so the user can browse from one to another. To further assist the user, we present two views which embed information on the evolution of the relations into the graphs. Each view emphasizes another aspect of temporal development. The framework can be adapted to any repository by a flexible data interface and a graph configuration file. We present some first web-based applications including a visualization of the DBLP data set. We use the DBLP visualization to evaluate our approach.", + "author": "Reitz, Florian", + "journal": "arXiv preprint arXiv:1009.5183", + "keywords": "type:technique, paradigm:node-link, time:timeline, ego\\_network, evaluation:case\\_study, evaluation:user\\_study, application:document, integrated_node-link, radial", + "references": "Burch2008TimeRadarTrees", + "series": "CoRR", + "title": "A Framework for an Ego-Centered and Time-Aware Visualization of Relations in Arbitrary Data Repositories", + "type": "article", + "url": "http://arxiv.org/abs/1009.5183", + "year": "2010" + }, + "Rey2010Controlling": { + "abstract": "The experiment investigated whether controlling presentation speed as well as labels, which display the names of the currently presented nodes in interactive dynamic graphs, affects comprehension performance. Dynamic graphs are animated graphical representations of nodes and edges representing mathematical structures used to model relations between different objects over time. After being tested on spatial imagination and linguistic thinking, 111 students had to answer twelve multiple choice comprehension questions about six interactive dynamic graphs while working with them. For each question, participants were randomly assigned to one cell of a 2 (with or without a scrollbar to adjust the presentation speed of the visualization) \u00d7 2 (with labels displaying all names of the currently presented nodes in the dynamic graphs or with tooltips displaying only one node name if the mouse cursor hovers over this node) factorial design. Scrollbars, which allow adjusting the presentation speed, were rarely used and did not foster learners\u2019 comprehension performance. Labels displaying all names of the currently presented nodes fostered learners\u2019 comprehension performance compared to tooltips. The higher the ability for linguistic thinking of the participants, the more their comprehension performance benefited from labels. These results are consistent with the cognitive-affective theory of learning with media.", + "author": "Rey, G\\\"unter D and Diehl, Stephan", + "doi": "10.1027/1864-1105/a000021", + "journal": "Journal of Media Psychology: Theories, Methods, and Applications", + "keywords": "type:evaluation, time:animation, paradigm:node-link, evaluation:user\\_study, application:generic", + "number": "4", + "pages": "160--170", + "publisher": "Hogrefe Publishing", + "title": "Controlling presentation speed, labels, and tooltips in interactive dynamic graphs", + "type": "article", + "volume": "22", + "year": "2010" + }, + "Rohrschneider2010Visual": { + "abstract": "We extend our previous work on the exploration of static metabolic networks to evolving, and therefore dynamic, pathways. We apply our visualization software to data from a simulation of early metabolism. Thereby, we show that our technique allows us to test and argue for or against different scenarios for the evolution of metabolic pathways. This supports a profound and efficient analysis of the structure and properties of the generated metabolic networks and its underlying components, while giving the user a vivid impression of the dynamics of the system. The analysis process is inspired by Ben Shneiderman\u2019s mantra of information visualization. For the overview, user-defined diagrams give insight into topological changes of the graph as well as changes in the attribute set associated with the participating enzymes, substances and reactions. This way, \u201cinteresting features\u201d in time as well as in space can be recognized. A linked view implementation enables the navigation into more detailed layers of perspective for in-depth analysis of individual network configurations.", + "author": "Rohrschneider, Markus and Ullrich, Alexander and Kerren, Andreas and Stadler, Peter F and Scheuermann, Gerik", + "booktitle": "Advances in Visual Computing", + "doi": "10.1007/978-3-642-17289-2_31", + "keywords": "paradigm:node-link, time:timeline, time:animation, type:application, application:biology, evaluation:case_study", + "pages": "316--327", + "publisher": "Springer", + "references": "Misue1995Layout Diehl2001Preserving Frishman2008Online Moody2005Dynamic", + "series": "ISVC", + "title": "Visual network analysis of dynamic metabolic pathways", + "type": "incollection", + "year": "2010" + }, + "Rufiange2013DiffAni": { + "abstract": "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.", + "author": "Rufiange, S{\\'e}bastien and McGuffin, Michael J", + "doi": "10.1109/TVCG.2013.149", + "issn": "1077-2626", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "type:technique, paradigm:node-link, evaluation:user\\_study, application:generic, graph\\_difference, taxonomy, time:timeline, time:animation, time_aggregation, animated_timeline", + "number": "12", + "pages": "2556-2565", + "references": "Archambault2011Animation Brandes2003Visual Brandes2011Asymmetric Burch2008TimeRadarTrees Burch2010TimeSpiderTrees Burch2011Parallel Farrugia2011Effective Federico2011Visual Greilich2009Visualizing Hadlak2011Situ Purchase2008Extremes Saraiya2005Visualization Windhager2011Visual Yi2010TimeMatrix Zaman2011Effect", + "series": "TVCG", + "title": "{DiffAni}: Visualizing Dynamic Graphs with a Hybrid of Difference Maps and Animation", + "type": "article", + "volume": "19", + "year": "2013" + }, + "Rufiange2014AniMatrix": { + "abstract": "Software designs are ever changing to adapt to new environments and requirements. Tracking and understanding changes in modules and relationships in a software project is difficult, but even more so when the software goes through several types of changes. The typical complexity and size of software also makes it harder to grasp software evolution patterns. In this paper, we present an interactive matrix-based visualization technique that, combined with animation, depicts how software designs evolve. For example, it shows which new modules and couplings are added and removed over time. Our generic visualization supports dynamic and weighted digraphs and is applied in the context of software evolution. Analyzing source code changes is important to determine the software\u2019s structural organization and identify quality issues over time. To demonstrate our approach, we explore open-source repositories and discuss some of our findings regarding these evolving software designs.", + "author": "Rufiange, S{\\'e}bastien and Melan{\\c{c}}on, Guy", + "booktitle": "Proceedings of the 2nd IEEE Working Conference on Software Visualization", + "keywords": "type:technique, time:animation, paradigm:matrix, application:software_engineering, evaluation:case_study, taxonomy, transition_problem, weighted_graph, multivariate_graph, directed_graph", + "pages": "137--146", + "references": "Erten2004GraphAEL Yi2010TimeMatrix Archambault2011Difference Archambault2011Animation Purchase2008Extremes Zaman2011Effect Rufiange2013DiffAni Collberg2003System Hindle2007YARN Rufiange2014Visualizing Beck2014State Burch2012Radial Bach2014GraphDiaries", + "series": "VISSOFT", + "title": "{AniMatrix}: A Matrix-Based Visualization of Software Evolution", + "type": "inproceedings", + "url": "http://conferences.computer.org/vissoft/2014/papers/6150a137.pdf", + "year": "2014" + }, + "Rufiange2014Visualizing": { + "abstract": "Identifying and tracking evolving software structures at a design level is a challenging task. Although there are ways to visualize this information statically, there is a need for methods that help analyzing the evolution of software design elements. In this paper, we present a new visual approach to identify variability zones in software designs and explore how they evolve over time. To verify the usefulness of our approach, we did a user study in which participants had to browse software histories and find visual patterns. Most participants were able to find interesting observations and found our approach intuitive and useful. We present a number of design aspects that were observed by participants and the authors using our IHVis tool on four open-source projects.", + "author": "Rufiange, S{\\'e}bastien and Fuhrman, Christopher P", + "doi": "10.1016/j.jss.2013.10.044", + "journal": "Journal of Systems and Software", + "keywords": "type:application, paradigm:node-link, evaluation:user_study, software_evolution, application:software_engineering, graph_difference, time:timeline, time:animation, juxtaposed_node-link", + "number": "0", + "pages": "231--249", + "publisher": "Elsevier", + "references": "Archambault2011Animation Farrugia2011Effective Hindle2007YARN Zaman2011Effect", + "series": "JSS", + "title": "Visualizing protected variations in evolving software designs", + "type": "article", + "volume": "88", + "year": "2014" + }, + "Saffrey2008Mental": { + "abstract": "The design of automatic layout algorithms for single graphs is a well established field, and some recent studies show how these algorithms affect human understanding. By contrast, layout algorithms for graphs that change over time are relatively immature, and few studies exist to evaluate their effectiveness empirically. This paper presents two new dynamic graph layout algorithms and empirical investigations of how effective these algorithms are with respect to human understanding. Central to each algorithm is the \"mental map\": the degree to which the layout supports continuous understanding. This work aims to evaluate the importance of the mental map, alongside traditional static graph aesthetics, in answering questions about dynamic graphs. We discover that a simple concept of the mental map is not sufficient for increasing understanding of the graph.", + "author": "Saffrey, Peter and Purchase, Helen C", + "booktitle": "Proceedings of the 9th Conference on Australasian User Interface", + "keywords": "time:animation, mental\\_map, paradigm:node-link, evaluation:user\\_study, type:evaluation, application:generic", + "pages": "85--93", + "publisher": "Australian Computer Society, Inc.", + "references": "Lee2006Mental Misue1995Layout Purchase2007Important", + "series": "AUIC", + "title": "The ``mental map'' versus ``static aesthetic'' compromise in dynamic graphs: a user study", + "type": "inproceedings", + "year": "2008" + }, + "Sallaberry2012Clustering": { + "abstract": "In this paper, we present a new approach to exploring dynamic graphs. We have developed a new clustering algorithm for dynamic graphs which finds an ideal clustering for each time-step and links the clusters together. The resulting time-varying clusters are then used to define two visual representations. The first view is an overview that shows how clusters evolve over time and provides an interface to find and select interesting time-steps. The second view consists of a node link diagram of a selected time-step which uses the clustering to efficiently define the layout. By using the time-dependant clustering, we ensure the stability of our visualization and preserve user mental map by minimizing node motion, while simultaneously producing an ideal layout for each time step. Also, as the clustering is computed ahead of time, the second view updates in linear time which allows for interactivity even for graphs with upwards of tens of thousands of nodes.", + "author": "Sallaberry, Arnaud and Muelder, Chris and Ma, Kwan-Liu", + "booktitle": "Graph Drawing", + "doi": "10.1007/978-3-642-36763-2_43", + "keywords": "paradigm:node-link, type:technique, clustering, application:infrastructure, evaluation:case\\_study, time:timeline, time:animation, linear\\_arrangement, mental\\_map, compound_graph", + "pages": "487-498", + "publisher": "Springer", + "references": "Frishman2008Online Archambault2011Animation Kumar2006Visual Hu2012Embedding Saffrey2008Mental Burch2011Parallel", + "series": "GD", + "survey:data": "(n:41928, e:218080, t:421)", + "title": "Clustering, Visualizing, and Navigating for Large Dynamic Graphs", + "type": "inproceedings", + "year": "2012" + }, + "Saraiya2005Visualization": { + "abstract": "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.", + "author": "Saraiya, Purvi and Lee, Peter and North, Chris", + "booktitle": "Proceedings of the 2005 IEEE Symposium on Information Visualization", + "doi": "10.1109/INFVIS.2005.1532151", + "isbn": "0-7803-9464-x", + "keywords": "paradigm:node-link, type:evaluation, time:timeline, application:biology, evaluation:user\\_study", + "pages": "225-232", + "publisher": "IEEE Computer Society", + "series": "InfoVis", + "title": "Visualization of Graphs with Associated Timeseries Data", + "type": "inproceedings", + "year": "2005" + }, + "Schmauder2015Visualizing": { + "abstract": "Graphs are traditionally represented as node-link diagrams, but these typically suffer from visual clutter when they become denser, i.e. more vertices and edges are present in the data set. Partial link drawings have been introduced for node-link diagrams aiming at reducing visual clutter caused by link crossings. Although this concept was shown to perform well for some parameter settings, it has not been used for visually encoding dynamic weighted digraphs. In this paper we investigate the problem of visualizing time-varying graphs as one node-link diagram in a specific layout by exploiting the links as timelines. Partially drawn links are used to show the graph dynamics by splitting each link into as many segments as time steps have to be represented. Conventional 2D layout algorithms can be applied while simultaneously showing the evolution over time. Color-coded links represent the changing weights. We use tapered links to reduce possible overlaps at the link target nodes that would occur when using traditional arrow-based directed links. We experiment with different graph layouts and different numbers of data dimensions, i.e. number of vertices, edges, and time steps. We illustrate the usefulness of the technique in a case study investigating dynamic migration data.", + "author": "Schmauder, Hansj\\\"{o}rg and Burch, Michael and Weiskopf, Daniel", + "booktitle": "Proceedings of the International Conference on Information Visualization Theory and Application", + "doi": "10.5220/0005303801230130", + "keywords": "type:technique, time:timeline, paradigm:node-link, weighted_graph, directed_graph, integrated_node-link, application:geo, evaluation:case_study, omitted_links", + "references": "Archambault2011Animation Beck2012Rapid Brandes2011Asymmetric Burch2010TimeSpiderTrees Burch2011Parallel Burch2014FlipBook Frishman2008Online Ghani2012Perception Stein2010PixelOriented", + "series": "IVAPP", + "title": "Visualizing Dynamic Weighted Digraphs with Partial Links", + "type": "inproceedings", + "year": "2015" + }, + "Shannon2007Considerations": { + "abstract": "In this survey paper we discuss the considerations involved in modeling, visualising and exploring dynamic graphs\u2014those graphs which are continually changing in structure to reflect the evolution of the system they are representing. The design of algorithms to analyse and generate visualisations of dynamic graphs pose both a technical and perceptual problem. A range of additional issues beyond those encountered for static graphs are uncovered, from the need for efficient dynamic data structures and algorithms to the difficulties of keeping a visualisation understandable for the user while it is constantly changing its form.", + "author": "Shannon, Ross and Quigley, Aaron J", + "keywords": "type:evaluation, paradigm:node-link, mental_map, time:animation, evaluation:survey, application:generic", + "references": "Lee2006Mental Misue1995Layout", + "title": "Considerations in Dynamic Graph Drawing: A Survey", + "type": "misc", + "url": "http://rossshannon.com/publications/softcopies/rs2007-dynamic-graphs-survey.pdf", + "year": "2007" + }, + "Shi2011Dynamic": { + "abstract": "The dynamic network visualization has been a challenging topic due to the complexity introduced by the extra time dimension. Existing solutions to this problem are usually good for the overview and presentation, but not for the interactive analysis. We propose in this paper a new approach which only considers the dynamic network central to a focus node (aka dynamic ego network). The navigation of the entire network is achieved by switching the focus node with user interactions. With this approach, the complexity of the compressed dynamic network is greatly reduced without sacrificing the network and time affinity central to the focus node. As a result, we are able to present each dynamic ego network in a single static view, well supporting user analysis on temporal network patterns. We describe our general framework including the network data pre-processing, 1.5D network and trend visualization design, layout algorithms, as well as several customized interactions. In addition, we show that our approach can also be extended to visualize the event-based and multimodal dynamic networks. Finally, we demonstrate, through two practical case studies, the effectiveness of our solution in support of visual evidence and pattern discovery.", + "author": "Shi, Lei and Wang, Chen and Wen, Zhen", + "booktitle": "Proceedings of the 2011 IEEE Pacific Visualization Symposium", + "doi": "10.1109/PACIFICVIS.2011.5742388", + "keywords": "paradigm:node-link, type:technique, application:social, application:document, evaluation:case\\_study, time:timeline, ego\\_network, integrated_node-link, directed_graph, force-directed_layout", + "pages": "179--186", + "publisher": "IEEE", + "references": "Collberg2003System Diehl2001Preserving Friedrich2002Graph Frishman2004Dynamic Frishman2008Online Huang1998Online Misue1995Layout Moody2005Dynamic", + "series": "PacificVis", + "title": "Dynamic network visualization in {1.5D}", + "type": "inproceedings", + "year": "2011" + }, + "Shi2015Egocentric": { + "abstract": "Dynamic network visualization has been a challenging research topic due to the visual and computational complexity introduced by the extra time dimension. Existing solutions are usually good for overview and presentation tasks, but not for the interactive analysis of a large dynamic network. We introduce in this paper a new approach which considers only the dynamic network central to a focus node, also known as the egocentric dynamic network. Our major contribution is a novel 1.5D visualization design which greatly reduces the visual complexity of the dynamic network without sacrificing the topological and temporal context central to the focus node. In our design, the egocentric dynamic network is presented in a single static view, supporting rich analysis through user interactions on both time and network. We propose a general framework for the 1.5D visualization approach, including the data processing pipeline, the visualization algorithm design, and customized interaction methods. Finally, we demonstrate the effectiveness of our approach on egocentric dynamic network analysis tasks, through case studies and a controlled user experiment comparing with three baseline dynamic network visualization methods.", + "author": "Shi, Lei and Wang, Chen and Wen, Zhen and Qu, Huamin and Lin, Chuang and Liao, Qi", + "comment": "Extended version of Shi2011Dynamic", + "doi": "10.1109/TVCG.2014.2383380", + "issuse": "5", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "paradigm:node-link, type:technique, application:social, application:document, evaluation:case\\_study, time:timeline, ego\\_network, integrated_node-link, directed_graph, force-directed_layout, evaluation:user_study", + "pages": "624--637", + "publisher": "IEEE", + "references": "Hadlak2011Situ Archambault2011Animation Farrugia2011Effective Shi2011Dynamic Cohen1995Dynamic Misue1995Layout Frishman2008Online Frishman2004Dynamic Diehl2001Preserving Yi2010TimeMatrix Burch2008TimeRadarTrees Burch2011Parallel Farrugia2011Exploring Ghani2012Perception Federico2011Visual", + "series": "TVCG", + "title": "{1.5D} Egocentric Dynamic Network Visualization", + "type": "article", + "volume": "21", + "year": "2015" + }, + "Smuc2014Connect": { + "abstract": "In recent years, the analysis of dynamic network data has become an increasingly prominent research issue. While several visual analytics techniques with the focus on the examination of temporal evolving networks have been proposed in recent years, their effectiveness and utility for end users need to be further analyzed. When dealing with techniques for dynamic network analysis, which integrate visual, computational, and interactive components, users become easily overwhelmed by the amount of information displayed\u2014even in case of small sized networks. Therefore we evaluated visual analytics techniques for dynamic networks during their development, performing intermediate evaluations by means of mock-up and eye-tracking studies and a final evaluation of the running interactive prototype, traceing three pathways of development in detail: The first one focused on the maintenance of the user\u2019s mental map throughout changes of network structure over time, changes caused by user interactions, and changes of analytical perspectives. The second one addresses the avoidance of visual clutter, or at least its moderation. The third pathway of development follows the implications of unexpected user behaviour and multiple problem solving processes. Aside from presenting solutions based on the outcomes of our evaluation, we discuss open and upcoming problems and set out new research questions.", + "author": "Smuc, Michael and Federico, Paolo and Windhager, Florian and Aigner, Wolfgang and Zenk, Lukas and Miksch, Silvia", + "booktitle": "Handbook of Human Centric Visualization", + "doi": "10.1007/978-1-4614-7485-2_25", + "keywords": "type:evaluation, evaluation:user_study, mental_map, application:social, paradigm:node-link, time:timeline, juxtaposed_node-link, superimposed_node-link, 3d, evaluation:expert", + "pages": "623--650", + "publisher": "Springer", + "references": "Brandes2003Visual Brandes2012Visualization Dwyer2004Visualising Federico2011Visual Misue1995Layout Moody2005Dynamic Windhager2011Visual", + "title": "How do you connect moving dots? Insights from user studies on dynamic network visualizations", + "type": "incollection", + "year": "2014" + }, + "Stab2010SemaTime": { + "abstract": "Timeline based visualizations arrange time-dependent entities along a time-axis and are used in many different domains like digital libraries, criminal investigation and medical information systems to support users in understanding chronological structures. By the use of semantic technologies, the information is categorized in a domain-specific, hierarchical schema and specified by semantic relations. Commonly semantic relations in timeline visualizations are depicted by interconnecting entities with a directed edge. However it is possible that semantic relations change in the course of time. In this paper we introduce a new timeline visualization for time-dependent semantics called SemaTime that offers a hierarchical categorization of time-dependent entities including navigation and filtering features. We also present a novel concept for visualizing time-dependent relations that allows the illustration of time-varying semantic relations and affords an easy understandable visualization of complex, time-dependent interrelations.", + "author": "Stab, Christian and Nazemi, Kawa and Fellner, Dieter W", + "booktitle": "Advances in Visual Computing", + "doi": "10.1007/978-3-642-17277-9_53", + "isbn": "978-3-642-17276-2", + "keywords": "type:application, time:timeline, paradigm:node-link, evaluation:case\\_study, application:document", + "pages": "514--523", + "publisher": "Springer", + "series": "ISVC", + "title": "{SemaTime} -- Timeline Visualization of Time-Dependent Relations and Semantics", + "type": "incollection", + "year": "2010" + }, + "Stein2010PixelOriented": { + "abstract": "We propose a new approach to visualize social networks. Most common network visualizations rely on graph drawing. While without doubt useful, graphs suffer from limitations like cluttering and important patterns may not be realized especially when networks change over time. Our approach adapts pixel-oriented visualization techniques to social networks as an addition to traditional graph visualizations. The visualization is exemplified using social networks based on corporate wikis.", + "author": "Stein, Klaus and Wegener, Ren\\'e and Schlieder, Christoph", + "booktitle": "Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining", + "doi": "10.1109/asonam.2010.18", + "isbn": "978-0-7695-4138-9", + "keywords": "type:technique, paradigm:matrix, time:timeline, evaluation:case\\_study, application:social, intra-cell_timelines", + "pages": "233--240", + "publisher": "IEEE", + "references": "Moody2005Dynamic Bender-deMoll2006Science", + "series": "ASONAM", + "title": "Pixel-Oriented Visualization of Change in Social Networks", + "type": "inproceedings", + "year": "2010" + }, + "Toyoda2005System": { + "abstract": "We propose WebRelievo, a system for visualizing and analyzing the evolution of the web structure based on a large Web archive with a series of snapshots. It visualizes the evolution with a time series of graphs, in which nodes are web pages, and edges are relationships between pages. Graphs can be clustered to show the overview of changes in graphs. WebRelievo aligns these graphs according to their time, and automatically determines their layout keeping positions of nodes synchronized over time, so that the user can keep track pages and clusters. This visualization enables us to understand when pages appeared, how their relationships have evolved, and how clusters are merged and split over time. Current implementation of WebRelievo is based on six Japanese web archives crawled from 1999 to 2003. The user can interactively browse those graphs by changing the focused page and by changing layouts of graphs. Using WebRelievo we can answer historical questions, and to investigate changes in trends on the Web. We show the feasibility of WebRelievo by applying it to tracking trends in P2P systems and search engines for mobile phones, and to investigating link spamming.", + "author": "Toyoda, Masashi and Kitsuregawa, Masaru", + "booktitle": "Proceedings of the 16th ACM Conference on Hypertext and Hypermedia", + "doi": "10.1145/1083356.1083387", + "keywords": "type:application, paradigm:node-link, time:timeline, application:document, clustering, evaluation:case_study", + "pages": "151--160", + "publisher": "ACM", + "references": "Chen2003Visualizing Collberg2003System Diehl2001Preserving Erten2004Exploring", + "series": "HYPERTEXT", + "title": "A system for visualizing and analyzing the evolution of the web with a time series of graphs", + "type": "inproceedings", + "year": "2005" + }, + "Trier2006Towards": { + "abstract": "Communities of Practice regularly utilize virtual means of communication. The according software support provides its members with many sophisticated features for generating content and for communicating with each other via the internet or intranet. However, functionalities to monitor, assess, coordinate, and communicate the quality and development of the underlying electronicnetworks of experts are frequently missing. To meet this need of increased manageability, this contribution introduces a Social Network Intelligence software approach which aims at supporting the comprehension of the structure and value of electronic communities by automatically extracting and mining available electronic data of various types of virtual communication networks, like e-mail archives, discussion groups, or instant messaging communication. Experimental structural visualizations employing Social Network Analysis methods are combined with Keyword Extraction to move towards a Social Network Intelligence approach which generates transparency of complex virtual communication networks. Together with a comprehensive visualization method, an approach for software-supported communication network measurement and evaluation is suggested. It supports the identification of important participants, topics, or clusters in the network, evaluates the interpersonal communication structure and visually traces the evolvement of the knowledge exchange over time.", + "author": "Trier, Matthias", + "booktitle": "Virtuelle Organisationen und Neue Medien", + "keywords": "time:animation, type:application, paradigm:node-link, evaluation:case_study, application:social", + "pages": "331--342", + "publisher": "TUDPress", + "title": "Towards a social network intelligence tool for visual analysis of virtual communication networks", + "type": "inproceedings", + "year": "2006" + }, + "Vehlow2013Radial": { + "abstract": "We propose a novel radial layered matrix visualization for dynamic directed weighted graphs in which the vertices can also be hierarchically organized. Edges are represented as color-coded arcs within the radial diagram. Their positions are defined by polar coordinates instead of Cartesian coordinates as in traditional adjacency matrix representations: the angular position of an edge within an annulus is given by the angle bisector of the two related vertices, the radial position depends linearly on the angular distance between these vertices. The exploration of time-varying relational data is facilitated by aligning graph patterns radially. Furthermore, our approach incorporates several interaction techniques to explore dynamic patterns such as trends and countertrends. The usefulness is illustrated by two case studies analyzing large dynamic call graphs acquired from open source software projects.", + "author": "Vehlow, Corinna and Burch, Michael and Schmauder, Hansj\\\"org and Weiskopf, Daniel", + "booktitle": "Proceedings of the 17th International Conference Information Visualisation", + "doi": "10.1109/IV.2013.6", + "keywords": "time:timeline, paradigm:matrix, compound_graph, evaluation:case_study, application:software_engineering, radial, type:technique, layered_matrices", + "pages": "51-58", + "publisher": "IEEE", + "references": "Archambault2011Animation Frishman2008Online Misue1995Layout Burch2011Parallel Beck2012Rapid Burch2012Radial Brandes2011Asymmetric Yi2010TimeMatrix", + "series": "IV", + "title": "Radial Layered Matrix Visualization of Dynamic Graphs", + "type": "inproceedings", + "year": "2013" + }, + "Vehlow2013iVUN": { + "abstract": "Background Mathematical models are nowadays widely used to describe biochemical reaction networks. One of the main reasons for this is that models facilitate the integration of a multitude of different data and data types using parameter estimation. Thereby, models allow for a holistic understanding of biological processes. However, due to measurement noise and the limited amount of data, uncertainties in the model parameters should be considered when conclusions are drawn from estimated model attributes, such as reaction fluxes or transient dynamics of biological species. We developed the visual analytics system iVUN that supports uncertainty-aware analysis of static and dynamic attributes of biochemical reaction networks modeled by ordinary differential equations. The multivariate graph of the network is visualized as a node-link diagram, and statistics of the attributes are mapped to the color of nodes and links of the graph. In addition, the graph view is linked with several views, such as line plots, scatter plots, and correlation matrices, to support locating uncertainties and the analysis of their time dependencies. As demonstration, we use iVUN to quantitatively analyze the dynamics of a model for Epo-induced JAK2/STAT5 signaling. Our case study showed that iVUN can be used to perform an in-depth study of biochemical reaction networks, including attribute uncertainties, correlations between these attributes and their uncertainties as well as the attribute dynamics. In particular, the linking of different visualization options turned out to be highly beneficial for the complex analysis tasks that come with the biological systems as presented here.", + "author": "Vehlow, Corinna and Hasenauer, Jan and Kramer, Andrei and Raue, Andreas and Hug, Sabine and Timmer, Jens and Radde, Nicole and Theis, Fabian J and Weiskopf, Daniel", + "doi": "10.1186/1471-2105-14-S19-S2", + "journal": "BMC Bioinformatics", + "keywords": "type:application, time:animation, time:timeline, paradigm:node-link, directed_graph, evaluation:case_study, application:biology", + "number": "Suppl 19", + "pages": "S2", + "publisher": "BioMed Central Ltd", + "references": "Beck2009Aesthetic Westenberg2008Visualizing", + "title": "{iVUN}: interactive Visualization of Uncertain biochemical reaction Networks", + "type": "article", + "volume": "14", + "year": "2013" + }, + "Vehlow2014Visualizing": { + "abstract": "The community structure of graphs is an important feature that gives insight into the high-level organization of objects within the graph. In real-world systems, the graph topology is oftentimes not static but changes over time and hence, also the community structure changes. Previous timeline-based approaches either visualize the dynamic graph or the dynamic community structure. In contrast, our approach combines both in a single image and therefore allows users to investigate the community structure together with the underlying dynamic graph. Our optimized ordering of vertices and selection of colors in combination with interactive highlighting techniques increases the traceability of communities along the time axis. Users can identify visual signatures, estimate the reliability of the derived community structure, and investigate whether community evolution interacts with changes in the graph topology. The utility of our approach is demonstrated in two application examples.", + "author": "Vehlow, Corinna and Beck, Fabian and Auw\\\"{a}rter, Patrick and Weiskopf, Daniel", + "doi": "10.1111/cgf.12512", + "journal": "Computer Graphics Forum", + "keywords": "type:technique, application:social, application:sports, time:timeline, paradigm:node-link, evaluation:case_study, clustering, compound_graph, linear_arrangement, juxtaposed_node-link, force-directed_layout", + "number": "1", + "pages": "277--288", + "references": "Archambault2011Animation Beck2014State Burch2011Parallel Frishman2004Dynamic Greilich2009Visualizing Hu2012Embedding Kumar2006Visual Misue1995Layout Mashima2012Visualizing Rufiange2013DiffAni Reitz2009Focused", + "title": "Visualizing the Evolution of Communities in Dynamic Graphs", + "type": "article", + "volume": "34", + "year": "2014" + }, + "Vehlow2015State": { + "abstract": "Graph visualizations encode relationships between objects. Abstracting the objects into group structures provides an overview of the data. Groups can be disjoint or overlapping, and might be organized hierarchically. However, the underlying graph still needs to be represented for analyzing the data in more depth. This work surveys research in visualizing group structures as part of graph diagrams. A particular focus is the explicit visual encoding of groups, rather than only using graph layout to implicitly indicate groups. We introduce a taxonomy of visualization techniques structuring the field into four main categories: visual node attributes vary properties of the node representation to encode the grouping, juxtaposed approaches use two separate visualizations, superimposed techniques work with two aligned visual layers, and embedded visualizations tightly integrate group and graph representation. We discuss results from evaluations of those techniques as well as main areas of application. Finally, we report future challenges based on interviews we conducted with leading researchers of the field.", + "author": "Vehlow, Corinna and Beck, Fabian and Weiskopf, Daniel", + "booktitle": "Eurographics Conference on Visualization (EuroVis) - STARs", + "doi": "10.2312/eurovisstar.20151110", + "keywords": "evaluation:survey, taxonomy, time:generic, paradigm:generic, application:generic, evaluation:survey, type:evaluation", + "publisher": "The Eurographics Association", + "references": "Ahmed2010Visual Beck2014State Beck2012Rapid Burch2008TimeRadarTrees Burch2010TimeSpiderTrees Burch2011Layered Bach2014GraphDiaries Burch2013MatrixBased Burch2011Parallel Frishman2004Dynamic Greilich2009Visualizing Gilbert2011Communities Kumar2006Visual Reitz2009Focused Vehlow2013Radial Vehlow2013iVUN vonLandesberger2011Visual", + "series": "EuroVis", + "title": "The State of the Art in Visualizing Group Structures in Graphs", + "type": "inproceedings", + "year": "2015" + }, + "Westenberg2008Visualizing": { + "abstract": "DNA microarrays are used to measure the expression levels of thousands of genes simultaneously. In a time series experiment, the gene expressions are measured as a function of time. We present an application for integrated visualization of genome expression and network dynamics in both regulatory networks and metabolic pathways. Integration of these two levels of cellular processes is necessary, since it provides the link between the measurements at the transcriptional level (gene expression levels approximated from microarray data) and the phenotype (the observable characteristics of an organism) at the functional and behavioral level. The integration requires visualization approaches besides traditional clustering and statistical analysis methods. Our application can (i) visualize the data from time series experiments in the context of a regulatory network and KEGG metabolic pathways; (ii) identify and visualize active regulatory subnetworks from the gene expression data; (iii) perform a statistical test to identify and subsequently visualize pathways that are affected by differentially expressed genes. We present a case study, which demonstrates that our approach and application both facilitates and speeds up data analysis tremendously in comparison to a more traditional approach that involves many manual, laborious, and error-prone steps.", + "author": "Westenberg, Michel A and Van Hijum, Sacha AFT and Kuipers, Oscar P and Roerdink, Jos BTM", + "doi": "10.1111/j.1467-8659.2008.01221.x", + "journal": "Computer Graphics Forum", + "keywords": "type:application, time:timeline, paradigm:node-link, evaluation:case_study, application:biology", + "number": "3", + "pages": "887--894", + "publisher": "Blackwell Publishing Ltd", + "series": "CGF", + "title": "Visualizing genome expression and regulatory network dynamics in genomic and metabolic context", + "type": "article", + "volume": "27", + "year": "2008" + }, + "Windhager2011Visual": { + "abstract": "Despite its well-known potential for applied use in organizations, social network analysis seems to fail relevant business analytical requirements in the areas of organizational change and software usability for non-expert users like managers and consultants. This position paper takes on this challenge by outlining a strategy of user-driven software development which aims to shift analytical procedures from the numerical to the visual realm. As network dynamics can be visualized using various methods, a comparative analysis of their respective strengths and weaknesses lays the basis for the suggested integration of additional visual methods into network exploration and interpretation procedures.", + "author": "Windhager, Florian and Zenk, Lukas and Federico, Paolo", + "doi": "10.1016/j.sbspro.2011.07.056", + "journal": "Procedia -- Social and Behavioral Sciences", + "keywords": "type:evaluation, paradigm:node-link, time:animation, time:timeline, evaluation:survey, application:social, application:business", + "pages": "59--68", + "publisher": "Elsevier", + "references": "Bender-deMoll2006Science", + "title": "Visual enterprise network analytics -- visualizing organizational change", + "type": "article", + "volume": "22", + "year": "2011" + }, + "Windhager2015Concept": { + "abstract": "Patents, archived as large collections of semi-structured text documents, contain valuable information about historical trends and current states of R\\&D fields, as well as performances of single inventors and companies. Specific methods are needed to unlock this information and enable its insightful analysis by investors, executives, funding agencies, and policy makers. In this position paper, we propose an approach based on modelling patent repositories as multivariate temporal networks, and examining them by the means of specific visual analytics methods. We illustrate the potential of our approach by discussing two use-cases: the determination of emerging research fields in general and within companies, as well as the identification of inventors characterized by different temporal paths of productivity.", + "author": "Windhager, Florian and Amor-Amor{\\'o}s, Albert and Smuc, Michael and Federico, Paolo and Zenk, Lukas and Miksch, Silvia", + "booktitle": "Proceedings of the 6th International Conference on Information Visualization Theory and Applications", + "doi": "10.5220/0005360002680273", + "keywords": "type:application, application:document, time:generic, paradigm:generic, evaluation:case_study", + "pages": "268-273", + "references": "Beck2014State", + "series": "IVAPP", + "title": "A concept for the exploratory visualization of patent network dynamics", + "type": "conference", + "year": "2015" + }, + "Yang2008Visual": { + "abstract": "In this article we describe a visual-analytic tool for the interrogation of evolving interaction network data such as those found in social, bibliometric, WWW and biological applications. The tool we have developed incorporates common visualization paradigms such as zooming, coarsening and filtering while naturally integrating information extracted by a previously described event-driven framework for characterizing the evolution of such networks. The visual front-end provides features that are specifically useful in the analysis of interaction networks, capturing the dynamic nature of both individual entities as well as interactions among them. The tool provides the user with the option of selecting multiple views, designed to capture different aspects of the evolving graph from the perspective of a node, a community or a subset of nodes of interest. Standard visual templates and cues are used to highlight critical changes that have occurred during the evolution of the network. A key challenge we address in this work is that of scalability - handling large graphs both in terms of the efficiency of the back-end, and in terms of the efficiency of the visual layout and rendering. Two case studies based on bibliometric and Wikipedia data are presented to demonstrate the utility of the toolkit for visual knowledge discovery.", + "author": "Yang, Xintian and Asur, Sitaram and Parthasarathy, Srinivasan and Mehta, Sameep", + "booktitle": "Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining", + "doi": "10.1145/1401890.1402011", + "keywords": "paradigm:node-link, application:document, compound_graph, time:animation, evaluation:case_study, type:application", + "pages": "1016--1024", + "publisher": "ACM", + "references": "Kumar2006Visual", + "series": "KDD", + "title": "A visual-analytic toolkit for dynamic interaction graphs", + "type": "inproceedings", + "year": "2008" + }, + "Yi2010TimeMatrix": { + "abstract": "Visualization plays a crucial role in understanding dynamic social networks at many different levels (i.e., group, subgroup, and individual). Node-link-based visualization techniques are currently widely used for these tasks and have been demonstrated to be effective, but it was found that they also have limitations in representing temporal changes, particularly at the individual and subgroup levels. To overcome these limitations, this article presents a new network visualization technique, called \u201d TimeMatrix,\u201d based on a matrix representation. Interaction techniques, such as overlay controls, a temporal range slider, semantic zooming, and integrated network statistical measures, support analysts in studying temporal social networks. To validate the design, the article presents a user study involving three social scientists analyzing inter-organizational collaboration data. The study demonstrates how TimeMatrix may help analysts gain insights about the temporal aspects of network data that can be subsequently tested with network analytic methods.", + "author": "Yi, Ji Soo and Elmqvist, Niklas and Lee, Seungyoon", + "doi": "10.1080/10447318.2010.516722", + "journal": "International Journal of Human-Computer Interaction", + "keywords": "type:technique, paradigm:matrix, time:timeline, evaluation:expert, application:social, sparklines, compound_graph, directed_graph, multivariate_graph, tasks, intra-cell_timelines", + "number": "11-12", + "pages": "1031--1051", + "publisher": "Taylor \\& Francis", + "references": "Brandes2003Visual Moody2005Dynamic", + "title": "{TimeMatrix}: Analyzing Temporal Social Networks Using Interactive Matrix-Based Visualizations", + "type": "article", + "volume": "26", + "year": "2010" + }, + "Zaidi2014Analysis": { + "abstract": "This chapter provides an overview of the different techniques and methods that exist for the analysis and visualization of dynamic networks. Basic definitions and formal notations are discussed and important references are cited. A major reason for the popularity of the field of dynamic networks is its applicability in a number of diverse fields. The field of dynamic networks is in its infancy and there are so many avenues that need to be explored. From developing network generation models to developing temporal metrics and measures, from structural analysis to visual analysis, there is room for further exploration in almost every dimension where dynamic networks are studied. Recently, with the availability of dynamic data from various fields, the empirical study and experimentation with real data sets has also helped maturate the field. Furthermore, researchers have started to develop foundations and theories based on these datasets which in turn has resulted lots of activity among research communities.", + "author": "Zaidi, Faraz and Muelder, Chris and Sallaberry, Arnaud", + "journal": "arXiv preprint arXiv:1409.5034", + "keywords": "evaluation:survey, type:evaluation, time:generic, paradigm:node-link, application:generic", + "references": "Burch2011Parallel Frishman2008Online Gilbert2011Communities Hu2012Embedding Moody2005Dynamic", + "series": "arXiv", + "title": "Analysis and Visualization of Dynamic Networks", + "type": "article", + "url": "http://arxiv.org/abs/1409.5034", + "year": "2014" + }, + "Zaman2011Effect": { + "abstract": "We present a new system for visualizing and merging differences in diagrams that uses animation, dual views, a storyboard, relative re-layout, and layering. We ran two user studies investigating the benefits of the system. The first user study compared pairs of hierarchical diagrams with matching node positions. The results underscore that na\u00efve dual-view visualization is undesirable. On the positive side, participants particularly liked the dual-view with difference layer technique. The second user study focused on diagrams with partially varying node positions and difference visualization and animation. We found evidence that both techniques are beneficial, and that the combination was preferred.", + "author": "Zaman, Loutfouz and Kalra, Ashish and Stuerzlinger, Wolfgang", + "booktitle": "Proceedings of Graphics Interface 2011", + "keywords": "mental\\_map, graph\\_difference, time:animation, time:timeline, paradigm:node-link, type:evaluation, evaluation:user\\_study, application:business", + "pages": "183--190", + "publisher": "Canadian Human-Computer Communications Society", + "references": "Archambault2011Animation Archambault2011Difference Diehl2002Graphs Farrugia2011Effective Purchase2007Important Purchase2008Extremes Saffrey2008Mental", + "series": "GI", + "title": "The Effect of Animation, Dual View, Difference Layers, and Relative Re-Layout in Hierarchical Diagram Differencing", + "type": "inproceedings", + "year": "2011" + }, + "vandenElzen2013Dynamic": { + "abstract": "Networks are present in many fields such as finance, sociology, and transportation. Often these networks are dynamic: they have a structural as well as a temporal aspect. In addition to relations occurring over time, node information is frequently present such as hierarchical structure or time-series data. We present a technique that extends the Massive Sequence View (MSV) for the analysis of temporal and structural aspects of dynamic networks. Using features in the data as well as Gestalt principles in the visualization such as closure, proximity, and similarity, we developed node reordering strategies for the MSV to make these features stand out that optionally take the hierarchical node structure into account. This enables users to find temporal properties such as trends, counter trends, periodicity, temporal shifts, and anomalies in the network as well as structural properties such as communities and stars. We introduce the circular MSV that further reduces visual clutter. In addition, the (circular) MSV is extended to also convey time-series data associated with the nodes. This enables users to analyze complex correlations between edge occurrence and node attribute changes. We show the effectiveness of the reordering methods on both synthetic and a rich real-world dynamic network data set.", + "author": "van den Elzen, Stef and Holten, Danny and Blaas, Jorik and van Wijk, Jarke J", + "comment": "Extended version of a PacificVis 13 paper.", + "doi": "10.1109/TVCG.2013.263", + "issn": "1077-2626", + "journal": "IEEE Transactions on Visualization and Computer Graphics", + "keywords": "paradigm:node-link, time:timeline, evaluation:case_study, evaluation:case_study, type:technique, linear\\_arrangement, radial, compound_graph, integrated_node-link, application:business, application:social", + "number": "8", + "pages": "1087-1099", + "references": "Kumar2006Visual Reitz2009Focused Farrugia2011Exploring Federico2011Visual Burch2010TimeSpiderTrees Burch2008TimeRadarTrees Burch2011Layered Burch2011Parallel Greilich2009Visualizing", + "series": "TVCG", + "title": "Dynamic Network Visualization with Extended Massive Sequence Views", + "type": "article", + "volume": "20", + "year": "2013" + }, + "vonLandesberger2011Visual": { + "abstract": "The analysis of large graphs plays a prominent role in various fields of research and is relevant in many important application areas. Effective visual analysis of graphs requires appropriate visual presentations in combination with respective user interaction facilities and algorithmic graph analysis methods. How to design appropriate graph analysis systems depends on many factors, including the type of graph describing the data, the analytical task at hand, and the applicability of graph analysis methods. The most recent surveys of graph visualization and navigation techniques were presented by Herman et al. [HMM00] and Diaz [DPS02]. The first work surveyed the main techniques for visualization of hierarchies and graphs in general that had been introduced until 2000. The second work concentrated on graph layouts introduced until 2002. Recently, new techniques have been developed covering a broader range of graph types, such as time-varying graphs. Also, in accordance with ever growing amounts of graph-structured data becoming available, the inclusion of algorithmic graph analysis and interaction techniques becomes increasingly important. In this State-of-the-Art Report, we survey available techniques for the visual analysis of large graphs. Our review firstly considers graph visualization techniques according to the type of graphs supported. The visualization techniques form the basis for the presentation of interaction approaches suitable for visual graph exploration. As an important component of visual graph analysis, we discuss various graph algorithmic aspects useful for the different stages of the visual graph analysis process.", + "author": "von Landesberger, Tatiana and Kuijper, Arjan and Schreck, Tobias and Kohlhammer, J\\\"orn and van Wijk, Jarke J and Fekete, Jean-Daniel and Fellner, Dieter W", + "doi": "10.1111/j.1467-8659.2011.01898.x", + "journal": "Computer Graphics Forum", + "keywords": "type:evaluation, paradigm:generic, time:animation, time:timeline, evaluation:survey, application:generic", + "number": "6", + "pages": "1719--1749", + "references": "Beck2009Aesthetic Burch2008TimeRadarTrees Diehl2001Preserving Frishman2004Dynamic Frishman2008Online Greilich2009Visualizing Kumar2006Visual Reitz2009Focused Saraiya2005Visualization", + "series": "CGF", + "title": "Visual Analysis of Large Graphs", + "type": "article", + "volume": "30", + "year": "2011" + }, + "vonLandesberger2013Visual": { + "abstract": "Contagion is a process whereby the collapse of a node in a network leads to the collapse of neighboring nodes and thereby sets off a chain reaction in the network. It thus creates a special type of time-dependent network. Such processes are studied in various applications, for example, in financial network analysis, infection diffusion prediction, supply-chain management, or gene regulation. Visual analytics methods can help analysts examine contagion effects. For this purpose, network visualizations need to be complemented with specific features to illustrate the contagion process. Moreover, new visual analysis techniques for comparison of contagion need to be developed. In this paper, we propose a system geared to the visual analysis of contagion. It includes the simulation of contagion effects as well as their visual exploration. We present new tools able to compare the evolution of the different contagion processes. In this way, propagation of disturbances can be effectively analyzed. We focus on financial networks; however, our system can be applied to other use cases as well.", + "author": "von Landesberger, Tatiana and Diel, Simon and Bremm, Sebastian and Fellner, Dieter W", + "doi": "10.1177/1473871613487087", + "journal": "Information Visualization", + "keywords": "type:application, paradigm:node-link, time:animation, evaluation:case\\_study, application:business", + "publisher": "SAGE Publications", + "references": "Cohen1995Dynamic Kumar2006Visual Brandes2003Visual", + "title": "Visual analysis of contagion in networks", + "type": "article", + "year": "2013" + } +}}); \ No newline at end of file diff --git a/survis/data/generated/available_img.js b/survis/data/generated/available_img.js new file mode 100644 index 0000000000000000000000000000000000000000..a310055e3e6139d8200bc27945b1d1baf01276e5 --- /dev/null +++ b/survis/data/generated/available_img.js @@ -0,0 +1 @@ +const availableImg = ["Beck2016Visual"]; \ No newline at end of file diff --git a/survis/data/generated/available_pdf.js b/survis/data/generated/available_pdf.js new file mode 100644 index 0000000000000000000000000000000000000000..56dd0534c3cdddcfd70ec5bd71717de26fe3389f --- /dev/null +++ b/survis/data/generated/available_pdf.js @@ -0,0 +1 @@ +const availablePdf = []; \ No newline at end of file diff --git a/survis/data/generated/bib.js b/survis/data/generated/bib.js new file mode 100644 index 0000000000000000000000000000000000000000..1ffe3627caf4c6b07b4d632e945b5d57d42710d1 --- /dev/null +++ b/survis/data/generated/bib.js @@ -0,0 +1,2208 @@ +const generatedBibEntries = { + "10.1007/978-3-319-46454-1_24": { + "abstract": "\"There is considerable interest in the task of automatically generating image captions. However, evaluation is challenging. Existing automatic evaluation metrics are primarily sensitive to n-gram overlap, which is neither necessary nor sufficient for the task of simulating human judgment. We hypothesize that semantic propositional content is an important component of human caption evaluation, and propose a new automated caption evaluation metric defined over scene graphs coined SPICE. Extensive evaluations across a range of models and datasets indicate that SPICE captures human judgments over model-generated captions better than other automatic metrics (e.g., system-level correlation of 0.88 with human judgments on the MS COCO dataset, versus 0.43 for CIDEr and 0.53 for METEOR). Furthermore, SPICE can answer questions such as which caption-generator best understands colors? and can caption-generators count?\",", + "address": "\"Cham\",", + "author": "\"Anderson, Peter and Fernando, Basura and Johnson, Mark and Gould, Stephen\",", + "booktitle": "\"Computer Vision -- ECCV 2016\",", + "editor": "\"Leibe, Bastian and Matas, Jiri and Sebe, Nicu and Welling, Max\",", + "isbn": "\"978-3-319-46454-1\"", + "pages": "\"382--398\",", + "publisher": "\"Springer International Publishing\",", + "title": "\"SPICE: Semantic Propositional Image Caption Evaluation\",", + "type": "InProceedings", + "year": "\"2016\"," + }, + "10.1016/j.neunet.2021.07.019": { + "address": "GBR", + "author": "Frolov, Stanislav and Hinz, Tobias and Raue, Federico and Hees, J\\\"{o}rn and Dengel, Andreas", + "doi": "10.1016/j.neunet.2021.07.019", + "issn": "0893-6080", + "issue_date": "Dec 2021", + "journal": "Neural Netw.", + "keywords": "Generative adversarial networks, Text-to-image synthesis", + "month": "dec", + "number": "C", + "numpages": "23", + "pages": "187\u2013209", + "publisher": "Elsevier Science Ltd.", + "title": "Adversarial text-to-image synthesis: A review", + "type": "article", + "url": "https://doi.org/10.1016/j.neunet.2021.07.019", + "volume": "144", + "year": "2021" + }, + "10.1145/1809028.1806638": { + "abstract": "MapReduce and similar systems significantly ease the task of writing data-parallel code. However, many real-world computations require a pipeline of MapReduces, and programming and managing such pipelines can be difficult. We present FlumeJava, a Java library that makes it easy to develop, test, and run efficient data-parallel pipelines. At the core of the FlumeJava library are a couple of classes that represent immutable parallel collections, each supporting a modest number of operations for processing them in parallel. Parallel collections and their operations present a simple, high-level, uniform abstraction over different data representations and execution strategies. To enable parallel operations to run efficiently, FlumeJava defers their evaluation, instead internally constructing an execution plan dataflow graph. When the final results of the parallel operations are eventually needed, FlumeJava first optimizes the execution plan, and then executes the optimized operations on appropriate underlying primitives (e.g., MapReduces). The combination of high-level abstractions for parallel data and computation, deferred evaluation and optimization, and efficient parallel primitives yields an easy-to-use system that approaches the efficiency of hand-optimized pipelines. FlumeJava is in active use by hundreds of pipeline developers within Google.", + "address": "New York, NY, USA", + "author": "Chambers, Craig and Raniwala, Ashish and Perry, Frances and Adams, Stephen and Henry, Robert R. and Bradshaw, Robert and Weizenbaum, Nathan", + "doi": "10.1145/1809028.1806638", + "issn": "0362-1340", + "issue_date": "June 2010", + "journal": "SIGPLAN Not.", + "keywords": "data-parallel programming, java, mapreduce", + "month": "jun", + "number": "6", + "numpages": "13", + "pages": "363\u2013375", + "publisher": "Association for Computing Machinery", + "title": "FlumeJava: easy, efficient data-parallel pipelines", + "type": "article", + "url": "https://doi.org/10.1145/1809028.1806638", + "volume": "45", + "year": "2010" + }, + "10.1145/3461353.3461388": { + "abstract": "In recent years, deep learning technology has made breakthroughs in computer vision. After using large-scale data training, the deep neural network represented by GAN is significantly better than previous technologies in image generation, including generating more reasonable, higher-definition, more complex, and more accurate images. With the continuous development of datasets, models, and applications, the fusion of different modal information, including fusion of natural language, semantic layouts, tags, edge maps, and other different modal information, to generate images has become a new demand and challenge. There are related reviews on image generation and multimodal deep learning. However, there has not been a review dedicated to multimodal deep-learning image generation to discuss the current status, existing problems, and challenges of this task. Therefore, this review proposes a survey on multimodal deep learning image generation. It aims to provide readers with an application scenario for multimodal deep learning image generation. Also, it provides readers with new multimodal deep learning image generation technologies, the relevant datasets, evaluation metrics used, and some results comparison. Finally, this article describes some of the challenges and future topics of multimodal deep learning image generation.", + "address": "New York, NY, USA", + "author": "Luo, Sanbi", + "booktitle": "Proceedings of the 2021 5th International Conference on Innovation in Artificial Intelligence", + "doi": "10.1145/3461353.3461388", + "isbn": "9781450388634", + "keywords": "multimodal, machine learning, image synthesis, deep learning, computer vision", + "location": "Xia men, China", + "numpages": "13", + "pages": "108\u2013120", + "publisher": "Association for Computing Machinery", + "series": "ICIAI '21", + "title": "A Survey on Multimodal Deep Learning for Image Synthesis: Applications, methods, datasets, evaluation metrics, and results comparison", + "type": "inproceedings", + "url": "https://doi.org/10.1145/3461353.3461388", + "year": "2021" + }, + "10.3115/1073083.1073135": { + "abstract": "Human evaluations of machine translation are extensive but expensive. Human evaluations can take months to finish and involve human labor that can not be reused. We propose a method of automatic machine translation evaluation that is quick, inexpensive, and language-independent, that correlates highly with human evaluation, and that has little marginal cost per run. We present this method as an automated understudy to skilled human judges which substitutes for them when there is need for quick or frequent evaluations.", + "address": "USA", + "author": "Papineni, Kishore and Roukos, Salim and Ward, Todd and Zhu, Wei-Jing", + "booktitle": "Proceedings of the 40th Annual Meeting on Association for Computational Linguistics", + "doi": "10.3115/1073083.1073135", + "location": "Philadelphia, Pennsylvania", + "numpages": "8", + "pages": "311\u2013318", + "publisher": "Association for Computational Linguistics", + "series": "ACL '02", + "title": "BLEU: a method for automatic evaluation of machine translation", + "type": "inproceedings", + "url": "https://doi.org/10.3115/1073083.1073135", + "year": "2002" + }, + "10.5555/3295222.3295408": { + "address": "Red Hook, NY, USA", + "author": "Heusel, Martin and Ramsauer, Hubert and Unterthiner, Thomas and Nessler, Bernhard and Hochreiter, Sepp", + "isbn": "9781510860964", + "location": "Long Beach, California, USA", + "numpages": "12", + "pages": "6629\u20136640", + "publisher": "Curran Associates Inc.", + "series": "NIPS'17", + "title": "GANs trained by a two time-scale update rule converge to a local nash equilibrium", + "type": "inproceedings", + "year": "2017" + }, + "10081412": { + "author": "Croitoru, Florinel-Alin and Hondru, Vlad and Ionescu, Radu Tudor and Shah, Mubarak", + "doi": "10.1109/TPAMI.2023.3261988", + "journal": "IEEE Transactions on Pattern Analysis and Machine Intelligence", + "keywords": "Computational modeling;Mathematical models;Noise reduction;Data models;Computer vision;Training;Task analysis;Denoising diffusion models;deep generative modeling;diffusion models;image generation;noise conditioned score networks;score-based models", + "number": "9", + "pages": "10850-10869", + "title": "Diffusion Models in Vision: A Survey", + "type": "ARTICLE", + "volume": "45", + "year": "2023" + }, + "10123038": { + "author": "Xu, Peng and Zhu, Xiatian and Clifton, David A.", + "doi": "10.1109/TPAMI.2023.3275156", + "journal": "IEEE Transactions on Pattern Analysis and Machine Intelligence", + "keywords": "Transformers;Task analysis;Surveys;Visualization;Taxonomy;Mathematical models;Data models;Multimodal learning;transformer;introductory;taxonomy;deep learning;machine learning", + "number": "10", + "pages": "12113-12132", + "title": "Multimodal Learning With Transformers: A Survey", + "type": "ARTICLE", + "volume": "45", + "year": "2023" + }, + "10218041": { + "author": "Abdulghanni, Sara Faez and Abdulmunem, Ashwan A.", + "booktitle": "2023 Al-Sadiq International Conference on Communication and Information Technology (AICCIT)", + "doi": "10.1109/AICCIT57614.2023.10218041", + "keywords": "Measurement;Training;Surveys;Deep learning;Image synthesis;Transforms;Stability analysis;Image generation;Diffusion model;Stable diffusion;Generative models;Deep learning", + "number": "", + "pages": "171-175", + "title": "Image Generation Conditioned on Text Using Deep Learning Models: Survey", + "type": "INPROCEEDINGS", + "volume": "", + "year": "2023" + }, + "4176674": { + "author": "Dolan, Brian", + "booktitle": "2006 Fortieth Asilomar Conference on Signals, Systems and Computers", + "doi": "10.1109/ACSSC.2006.354864", + "keywords": "Mammography;Computer vision;Design automation;Humans;Medical diagnostic imaging;Breast cancer;Protocols;Biopsy;Gold;Visualization", + "number": "", + "pages": "821-825", + "title": "Computer Aided Diagnosis in Mammography: Its Development and Early Challenges", + "type": "INPROCEEDINGS", + "volume": "", + "year": "2006" + }, + "5412098": { + "author": "Thung, Kim-Han and Raveendran, Paramesran", + "booktitle": "2009 International Conference for Technical Postgraduates (TECHPOS)", + "doi": "10.1109/TECHPOS.2009.5412098", + "keywords": "Image quality;Digital images;Signal processing;Image coding;Image storage;Signal processing algorithms;Noise reduction;Video compression;PSNR;Gaussian noise", + "number": "", + "pages": "1-4", + "title": "A survey of image quality measures", + "type": "INPROCEEDINGS", + "volume": "", + "year": "2009" + }, + "5430991": { + "author": "Saad, Michele A. and Bovik, Alan C. and Charrier, Christophe", + "doi": "10.1109/LSP.2010.2045550", + "journal": "IEEE Signal Processing Letters", + "keywords": "Discrete cosine transforms;Image quality;Statistics;Feature extraction;Layout;Distortion measurement;Support vector machines;Testing;Machine learning algorithms;Machine learning;Anisotropy;discrete cosine transform;kurtosis;natural scene statistics;no-reference quality assessment", + "number": "6", + "pages": "583-586", + "title": "A DCT Statistics-Based Blind Image Quality Index", + "type": "ARTICLE", + "volume": "17", + "year": "2010" + }, + "5596999": { + "author": "Hor\u00e9, Alain and Ziou, Djemel", + "booktitle": "2010 20th International Conference on Pattern Recognition", + "doi": "10.1109/ICPR.2010.579", + "keywords": "PSNR;Degradation;Image quality;Additives;Transform coding;Sensitivity;Image coding;PSNR;SSIM;image quality metrics", + "number": "", + "pages": "2366-2369", + "title": "Image Quality Metrics: PSNR vs. SSIM", + "type": "INPROCEEDINGS", + "volume": "", + "year": "2010" + }, + "5995446": { + "author": "Tang, Huixuan and Joshi, Neel and Kapoor, Ashish", + "booktitle": "CVPR 2011", + "doi": "10.1109/CVPR.2011.5995446", + "keywords": "Image quality;Distortion measurement;Transform coding;Histograms;Noise;Kernel;Degradation", + "number": "", + "pages": "305-312", + "title": "Learning a blind measure of perceptual image quality", + "type": "INPROCEEDINGS", + "volume": "", + "year": "2011" + }, + "6165361": { + "author": "Ye, Peng and Doermann, David", + "doi": "10.1109/TIP.2012.2190086", + "journal": "IEEE Transactions on Image Processing", + "keywords": "Feature extraction;Training;Image quality;Visualization;Transform coding;Databases;Image coding;Gabor filter;no-reference image quality assessment (NRIQA);texture analysis;visual codebook", + "number": "7", + "pages": "3129-3138", + "title": "No-Reference Image Quality Assessment Using Visual Codebooks", + "type": "ARTICLE", + "volume": "21", + "year": "2012" + }, + "6172573": { + "author": "Saad, Michele A. and Bovik, Alan C. and Charrier, Christophe", + "doi": "10.1109/TIP.2012.2191563", + "journal": "IEEE Transactions on Image Processing", + "keywords": "Discrete cosine transforms;Feature extraction;Visualization;Humans;Computational modeling;Predictive models;Image quality;Discrete cosine transform (DCT);generalized Gaussian density;natural scene statistics;no-reference image quality assessment", + "number": "8", + "pages": "3339-3352", + "title": "Blind Image Quality Assessment: A Natural Scene Statistics Approach in the DCT Domain", + "type": "ARTICLE", + "volume": "21", + "year": "2012" + }, + "6190099": { + "author": "Mittal, Anish and Moorthy, Anush K. and Bovik, Alan C.", + "booktitle": "2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)", + "doi": "10.1109/ACSSC.2011.6190099", + "keywords": "Humans;Image quality;Transform coding;Correlation;Databases;Measurement;Computational modeling", + "number": "", + "pages": "723-727", + "title": "Blind/Referenceless Image Spatial Quality Evaluator", + "type": "INPROCEEDINGS", + "volume": "", + "year": "2011" + }, + "6353522": { + "author": "Mittal, Anish and Soundararajan, Rajiv and Bovik, Alan C.", + "doi": "10.1109/LSP.2012.2227726", + "journal": "IEEE Signal Processing Letters", + "keywords": "Image quality;Image processing;Statistical analysis;Feature extraction;Completely blind;distortion free;image quality assessment;no reference", + "number": "3", + "pages": "209-212", + "title": "Making a \u201cCompletely Blind\u201d Image Quality Analyzer", + "type": "ARTICLE", + "volume": "20", + "year": "2013" + }, + "7084843": { + "author": "Venkatanath N and Praneeth D and Maruthi Chandrasekhar Bh and Channappayya, Sumohana S. and Medasani, Swarup S.", + "booktitle": "2015 Twenty First National Conference on Communications (NCC)", + "doi": "10.1109/NCC.2015.7084843", + "keywords": "Image quality;Noise;Databases;Feature extraction;Standards;Transform coding;Image segmentation;No reference image quality assessment;spatial activity;Perceptual quality", + "number": "", + "pages": "1-6", + "title": "Blind image quality evaluation using perception based features", + "type": "INPROCEEDINGS", + "volume": "", + "year": "2015" + }, + "8195348": { + "author": "Wu, Xian and Xu, Kun and Hall, Peter", + "doi": "10.23919/TST.2017.8195348", + "journal": "Tsinghua Science and Technology", + "keywords": "Gallium nitride;Image generation;Generators;Image resolution;Feature extraction;Training;Linear programming;image synthesis;image editing;constrained image synthesis;generative adversarial networks;image-to-image translation", + "number": "6", + "pages": "660-674", + "title": "A survey of image synthesis and editing with generative adversarial networks", + "type": "ARTICLE", + "volume": "22", + "year": "2017" + }, + "8578241": { + "address": "Los Alamitos, CA, USA", + "author": "T. Xu and P. Zhang and Q. Huang and H. Zhang and Z. Gan and X. Huang and X. He", + "booktitle": "2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "doi": "10.1109/CVPR.2018.00143", + "issn": "", + "keywords": "gallium nitride;generative adversarial networks;computational modeling;image generation;generators;semantics;visualization", + "month": "jun", + "pages": "1316-1324", + "publisher": "IEEE Computer Society", + "title": "AttnGAN: Fine-Grained Text to Image Generation with Attentional Generative Adversarial Networks", + "type": "INPROCEEDINGS", + "url": "https://doi.ieeecomputersociety.org/10.1109/CVPR.2018.00143", + "volume": "", + "year": "2018" + }, + "9495208": { + "author": "Xia, Jiazhi and Lin, Weixing and Jiang, Guang and Wang, Yunhai and Chen, Wei and Schreck, Tobias", + "doi": "10.1109/MCG.2021.3098804", + "journal": "IEEE Computer Graphics and Applications", + "keywords": "Visualization;Shape analysis;Visual perception;Clustering algorithms;Deep learning;Splines (mathematics)", + "number": "5", + "pages": "79-89", + "title": "Visual Clustering Factors in Scatterplots", + "type": "ARTICLE", + "volume": "41", + "year": "2021" + }, + "AUTOMATIC1111_Stable_Diffusion_Web_2022": { + "author": "AUTOMATIC1111", + "month": "aug,", + "title": "Stable Diffusion Web UI", + "type": "software", + "url": "https://github.com/AUTOMATIC1111/stable-diffusion-webui", + "year": "2022" + }, + "Agrawal_2019_ICCV": { + "author": "Agrawal, Harsh and Desai, Karan and Wang, Yufei and Chen, Xinlei and Jain, Rishabh and Johnson, Mark and Batra, Dhruv and Parikh, Devi and Lee, Stefan and Anderson, Peter", + "booktitle": "Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV)", + "month": "October", + "title": "nocaps: novel object captioning at scale", + "type": "InProceedings", + "year": "2019" + }, + "Antol_2015_ICCV": { + "author": "Antol, Stanislaw and Agrawal, Aishwarya and Lu, Jiasen and Mitchell, Margaret and Batra, Dhruv and Zitnick, C. Lawrence and Parikh, Devi", + "booktitle": "Proceedings of the IEEE International Conference on Computer Vision (ICCV)", + "month": "December", + "title": "VQA: Visual Question Answering", + "type": "InProceedings", + "year": "2015" + }, + "BahdanauCB14": { + "author": "Dzmitry Bahdanau and Kyunghyun Cho and Yoshua Bengio", + "bibsource": "dblp computer science bibliography, https://dblp.org", + "biburl": "https://dblp.org/rec/journals/corr/BahdanauCB14.bib", + "booktitle": "3rd International Conference on Learning Representations, {ICLR} 2015, San Diego, CA, USA, May 7-9, 2015, Conference Track Proceedings", + "editor": "Yoshua Bengio and Yann LeCun", + "timestamp": "Wed, 17 Jul 2019 10:40:54 +0200", + "title": "Neural Machine Translation by Jointly Learning to Align and Translate", + "type": "inproceedings", + "url": "http://arxiv.org/abs/1409.0473", + "year": "2015" + }, + "Chang2023": { + "author": "\"Nadine Chang\",", + "doi": "\"10.1184/R1/23396759.v1\"", + "month": "\"6\",", + "title": "\"{Bridging the Gap Between Human Vision and Computer Vision}\",", + "type": "article", + "url": "\"https://kilthub.cmu.edu/articles/thesis/Bridging_the_Gap_Between_Human_Vision_and_Computer_Vision/23396759\",", + "year": "\"2023\"," + }, + "Changpinyo_2021_CVPR": { + "author": "Changpinyo, Soravit and Sharma, Piyush and Ding, Nan and Soricut, Radu", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "pages": "3558-3568", + "title": "Conceptual 12M: Pushing Web-Scale Image-Text Pre-Training To Recognize Long-Tail Visual Concepts", + "type": "InProceedings", + "year": "2021" + }, + "Chen_2018_CVPR": { + "author": "Chen, Jingwen and Chen, Jiawei and Chao, Hongyang and Yang, Ming", + "booktitle": "Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "title": "Image Blind Denoising With Generative Adversarial Network Based Noise Modeling", + "type": "InProceedings", + "year": "2018" + }, + "Chen_2023_ICCV": { + "author": "Chen, Rui and Chen, Yongwei and Jiao, Ningxin and Jia, Kui", + "booktitle": "Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV)", + "month": "October", + "pages": "22246-22256", + "title": "Fantasia3D: Disentangling Geometry and Appearance for High-quality Text-to-3D Content Creation", + "type": "InProceedings", + "year": "2023" + }, + "Chen_2024_WACV": { + "author": "Chen, Minghao and Laina, Iro and Vedaldi, Andrea", + "booktitle": "Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)", + "month": "January", + "pages": "5343-5353", + "title": "Training-Free Layout Control With Cross-Attention Guidance", + "type": "InProceedings", + "year": "2024" + }, + "Cho_2023_ICCV": { + "author": "Cho, Jaemin and Zala, Abhay and Bansal, Mohit", + "booktitle": "Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV)", + "month": "October", + "pages": "3043-3054", + "title": "DALL-Eval: Probing the Reasoning Skills and Social Biases of Text-to-Image Generation Models", + "type": "InProceedings", + "year": "2023" + }, + "Cui_2018_CVPR": { + "author": "Cui, Yin and Yang, Guandao and Veit, Andreas and Huang, Xun and Belongie, Serge", + "booktitle": "Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "title": "Learning to Evaluate Image Captioning", + "type": "InProceedings", + "year": "2018" + }, + "Desai_2021_CVPR": { + "author": "Desai, Karan and Johnson, Justin", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "pages": "11162-11173", + "title": "VirTex: Learning Visual Representations From Textual Annotations", + "type": "InProceedings", + "year": "2021" + }, + "Gokhale2022BenchmarkingSR": { + "author": "Tejas Gokhale and Hamid Palangi and Besmira Nushi and Vibhav Vineet and Eric Horvitz and Ece Kamar and Chitta Baral and Yezhou Yang", + "journal": "ArXiv", + "title": "Benchmarking Spatial Relationships in Text-to-Image Generation", + "type": "article", + "url": "https://api.semanticscholar.org/CorpusID:254877055", + "volume": "abs/2212.10015", + "year": "2022" + }, + "Goyal_2017_CVPR": { + "author": "Goyal, Yash and Khot, Tejas and Summers-Stay, Douglas and Batra, Dhruv and Parikh, Devi", + "booktitle": "Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "July", + "title": "Making the v in VQA Matter: Elevating the Role of Image Understanding in Visual Question Answering", + "type": "InProceedings", + "year": "2017" + }, + "Grimal_2024_tiam": { + "author": "Grimal, Paul and Le Borgne, Herv\\'e and Ferret, Olivier and Tourille, Julien", + "booktitle": "Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)", + "month": "January", + "pages": "2890-2899", + "title": "TIAM - A Metric for Evaluating Alignment in Text-to-Image Generation", + "type": "InProceedings", + "year": "2024" + }, + "Hu_2021_ICCV": { + "author": "Hu, Ronghang and Singh, Amanpreet", + "booktitle": "Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV)", + "month": "October", + "pages": "1439-1449", + "title": "UniT: Multimodal Multitask Learning With a Unified Transformer", + "type": "InProceedings", + "year": "2021" + }, + "Hu_2023_ICCV": { + "author": "Hu, Yushi and Liu, Benlin and Kasai, Jungo and Wang, Yizhong and Ostendorf, Mari and Krishna, Ranjay and Smith, Noah A.", + "booktitle": "Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV)", + "month": "October", + "pages": "20406-20417", + "title": "TIFA: Accurate and Interpretable Text-to-Image Faithfulness Evaluation with Question Answering", + "type": "InProceedings", + "year": "2023" + }, + "Hudson_2019_CVPR": { + "author": "Hudson, Drew A. and Manning, Christopher D.", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "title": "GQA: A New Dataset for Real-World Visual Reasoning and Compositional Question Answering", + "type": "InProceedings", + "year": "2019" + }, + "Karras_2019_CVPR": { + "author": "Karras, Tero and Laine, Samuli and Aila, Timo", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "title": "A Style-Based Generator Architecture for Generative Adversarial Networks", + "type": "InProceedings", + "year": "2019" + }, + "Karras_2020_CVPR": { + "author": "Karras, Tero and Laine, Samuli and Aittala, Miika and Hellsten, Janne and Lehtinen, Jaakko and Aila, Timo", + "booktitle": "IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "title": "Analyzing and Improving the Image Quality of StyleGAN", + "type": "InProceedings", + "year": "2020" + }, + "Kirstain2023PickaPicAO": { + "author": "Yuval Kirstain and Adam Polyak and Uriel Singer and Shahbuland Matiana and Joe Penna and Omer Levy", + "journal": "ArXiv", + "title": "Pick-a-Pic: An Open Dataset of User Preferences for Text-to-Image Generation", + "type": "article", + "url": "https://api.semanticscholar.org/CorpusID:258437096", + "volume": "abs/2305.01569", + "year": "2023" + }, + "Krishna2016VisualGC": { + "author": "Ranjay Krishna and Yuke Zhu and Oliver Groth and Justin Johnson and Kenji Hata and Joshua Kravitz and Stephanie Chen and Yannis Kalantidis and Li-Jia Li and David A. Shamma and Michael S. Bernstein and Li Fei-Fei", + "journal": "International Journal of Computer Vision", + "pages": "32 - 73", + "title": "Visual Genome: Connecting Language and Vision Using Crowdsourced Dense Image Annotations", + "type": "article", + "url": "https://api.semanticscholar.org/CorpusID:4492210", + "volume": "123", + "year": "2016" + }, + "Li2023BLIP2BL": { + "author": "Junnan Li and Dongxu Li and Silvio Savarese and Steven C. H. Hoi", + "booktitle": "International Conference on Machine Learning", + "title": "BLIP-2: Bootstrapping Language-Image Pre-training with Frozen Image Encoders and Large Language Models", + "type": "inproceedings", + "url": "https://api.semanticscholar.org/CorpusID:256390509", + "year": "2023" + }, + "Li_2019_ICCV": { + "author": "Li, Kunpeng and Zhang, Yulun and Li, Kai and Li, Yuanyuan and Fu, Yun", + "booktitle": "Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV)", + "month": "October", + "title": "Visual Semantic Reasoning for Image-Text Matching", + "type": "InProceedings", + "year": "2019" + }, + "Li_2022_CVPR": { + "author": "Li, Zhiheng and Min, Martin Renqiang and Li, Kai and Xu, Chenliang", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "pages": "18197-18207", + "title": "StyleT2I: Toward Compositional and High-Fidelity Text-to-Image Synthesis", + "type": "InProceedings", + "year": "2022" + }, + "Lin_2023_CVPR": { + "author": "Lin, Chen-Hsuan and Gao, Jun and Tang, Luming and Takikawa, Towaki and Zeng, Xiaohui and Huang, Xun and Kreis, Karsten and Fidler, Sanja and Liu, Ming-Yu and Lin, Tsung-Yi", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "pages": "300-309", + "title": "Magic3D: High-Resolution Text-to-3D Content Creation", + "type": "InProceedings", + "year": "2023" + }, + "Liu2023VisualIT": { + "author": "Haotian Liu and Chunyuan Li and Qingyang Wu and Yong Jae Lee", + "journal": "ArXiv", + "title": "Visual Instruction Tuning", + "type": "article", + "url": "https://api.semanticscholar.org/CorpusID:258179774", + "volume": "abs/2304.08485", + "year": "2023" + }, + "Ma_2023_CVPR": { + "author": "Ma, Zixian and Hong, Jerry and Gul, Mustafa Omer and Gandhi, Mona and Gao, Irena and Krishna, Ranjay", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "pages": "10910-10921", + "title": "CREPE: Can Vision-Language Foundation Models Reason Compositionally?", + "type": "InProceedings", + "year": "2023" + }, + "Metzer_2023_CVPR": { + "author": "Metzer, Gal and Richardson, Elad and Patashnik, Or and Giryes, Raja and Cohen-Or, Daniel", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "pages": "12663-12673", + "title": "Latent-NeRF for Shape-Guided Generation of 3D Shapes and Textures", + "type": "InProceedings", + "year": "2023" + }, + "NEURIPS2019_65699726": { + "author": "Zhou, Sharon and Gordon, Mitchell and Krishna, Ranjay and Narcomey, Austin and Fei-Fei, Li F and Bernstein, Michael", + "booktitle": "Advances in Neural Information Processing Systems", + "editor": "H. Wallach and H. Larochelle and A. Beygelzimer and F. d\\textquotesingle Alch\\'{e}-Buc and E. Fox and R. Garnett", + "pages": "", + "publisher": "Curran Associates, Inc.", + "title": "HYPE: A Benchmark for Human eYe Perceptual Evaluation of Generative Models", + "type": "inproceedings", + "url": "https://proceedings.neurips.cc/paper_files/paper/2019/file/65699726a3c601b9f31bf04019c8593c-Paper.pdf", + "volume": "32", + "year": "2019" + }, + "NEURIPS2019_c74d97b0": { + "author": "Lu, Jiasen and Batra, Dhruv and Parikh, Devi and Lee, Stefan", + "booktitle": "Advances in Neural Information Processing Systems", + "editor": "H. Wallach and H. Larochelle and A. Beygelzimer and F. d\\textquotesingle Alch\\'{e}-Buc and E. Fox and R. Garnett", + "pages": "", + "publisher": "Curran Associates, Inc.", + "title": "ViLBERT: Pretraining Task-Agnostic Visiolinguistic Representations for Vision-and-Language Tasks", + "type": "inproceedings", + "url": "https://proceedings.neurips.cc/paper_files/paper/2019/file/c74d97b01eae257e44aa9d5bade97baf-Paper.pdf", + "volume": "32", + "year": "2019" + }, + "NIPS2011_5dd9db5e": { + "author": "Ordonez, Vicente and Kulkarni, Girish and Berg, Tamara", + "booktitle": "Advances in Neural Information Processing Systems", + "editor": "J. Shawe-Taylor and R. Zemel and P. Bartlett and F. Pereira and K.Q. Weinberger", + "pages": "", + "publisher": "Curran Associates, Inc.", + "title": "Im2Text: Describing Images Using 1 Million Captioned Photographs", + "type": "inproceedings", + "url": "https://proceedings.neurips.cc/paper_files/paper/2011/file/5dd9db5e033da9c6fb5ba83c7a7ebea9-Paper.pdf", + "volume": "24", + "year": "2011" + }, + "NIPS2016_8a3363ab": { + "author": "Salimans, Tim and Goodfellow, Ian and Zaremba, Wojciech and Cheung, Vicki and Radford, Alec and Chen, Xi and Chen, Xi", + "booktitle": "Advances in Neural Information Processing Systems", + "editor": "D. Lee and M. Sugiyama and U. Luxburg and I. Guyon and R. Garnett", + "pages": "", + "publisher": "Curran Associates, Inc.", + "title": "Improved Techniques for Training GANs", + "type": "inproceedings", + "url": "https://proceedings.neurips.cc/paper_files/paper/2016/file/8a3363abe792db2d8761d6403605aeb7-Paper.pdf", + "volume": "29", + "year": "2016" + }, + "Otani_2023_CVPR": { + "author": "Otani, Mayu and Togashi, Riku and Sawai, Yu and Ishigami, Ryosuke and Nakashima, Yuta and Rahtu, Esa and Heikkil\\\"a, Janne and Satoh, Shin{\\textquoteright}ichi", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "pages": "14277-14286", + "title": "Toward Verifiable and Reproducible Human Evaluation for Text-to-Image Generation", + "type": "InProceedings", + "year": "2023" + }, + "Rombach_2022_CVPR": { + "author": "Rombach, Robin and Blattmann, Andreas and Lorenz, Dominik and Esser, Patrick and Ommer, Bj\\\"orn", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "pages": "10684-10695", + "title": "High-Resolution Image Synthesis With Latent Diffusion Models", + "type": "InProceedings", + "year": "2022" + }, + "Ruiz_2023_CVPR": { + "author": "Ruiz, Nataniel and Li, Yuanzhen and Jampani, Varun and Pritch, Yael and Rubinstein, Michael and Aberman, Kfir", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "pages": "22500-22510", + "title": "DreamBooth: Fine Tuning Text-to-Image Diffusion Models for Subject-Driven Generation", + "type": "InProceedings", + "year": "2023" + }, + "Sahin_2024_WACV": { + "author": "Sahin, Ugur and Li, Hang and Khan, Qadeer and Cremers, Daniel and Tresp, Volker", + "booktitle": "Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV)", + "month": "January", + "pages": "5563-5573", + "title": "Enhancing Multimodal Compositional Reasoning of Visual Language Models With Generative Negative Mining", + "type": "InProceedings", + "year": "2024" + }, + "Salin_2023_ICCV": { + "author": "Salin, Emmanuelle and Ayache, St\\'ephane and Favre, Benoit", + "booktitle": "Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV) Workshops", + "month": "October", + "pages": "339-352", + "title": "Towards an Exhaustive Evaluation of Vision-Language Foundation Models", + "type": "InProceedings", + "year": "2023" + }, + "Schramowski_2023_CVPR": { + "author": "Schramowski, Patrick and Brack, Manuel and Deiseroth, Bj\\\"orn and Kersting, Kristian", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "pages": "22522-22531", + "title": "Safe Latent Diffusion: Mitigating Inappropriate Degeneration in Diffusion Models", + "type": "InProceedings", + "year": "2023" + }, + "Simonyan15vgg": { + "author": "\"Karen Simonyan and Andrew Zisserman\",", + "booktitle": "\"International Conference on Learning Representations\",", + "title": "\"Very Deep Convolutional Networks for Large-Scale Image Recognition\",", + "type": "InProceedings", + "year": "\"2015\"," + }, + "Su2020VL-BERT": { + "author": "Weijie Su and Xizhou Zhu and Yue Cao and Bin Li and Lewei Lu and Furu Wei and Jifeng Dai", + "booktitle": "International Conference on Learning Representations", + "title": "VL-BERT: Pre-training of Generic Visual-Linguistic Representations", + "type": "inproceedings", + "url": "https://openreview.net/forum?id", + "year": "2020" + }, + "Thrush_2022_CVPR": { + "author": "Thrush, Tristan and Jiang, Ryan and Bartolo, Max and Singh, Amanpreet and Williams, Adina and Kiela, Douwe and Ross, Candace", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "pages": "5238-5248", + "title": "Winoground: Probing Vision and Language Models for Visio-Linguistic Compositionality", + "type": "InProceedings", + "year": "2022" + }, + "Tian2022GenerativeAN": { + "author": "Chunwei Tian and Xuanyu Zhang and Chun-Wei Lin and Wangmeng Zuo and Yanning Zhang", + "journal": "ArXiv", + "title": "Generative Adversarial Networks for Image Super-Resolution: A Survey", + "type": "article", + "url": "https://api.semanticscholar.org/CorpusID:248426817", + "volume": "abs/2204.13620", + "year": "2022" + }, + "Tran_2020_ACCV": { + "author": "Tran, Linh Duy and Nguyen, Son Minh and Arai, Masayuki", + "booktitle": "Proceedings of the Asian Conference on Computer Vision (ACCV)", + "month": "November", + "title": "GAN-based Noise Model for Denoising Real Images", + "type": "InProceedings", + "year": "2020" + }, + "Vedantam_2015_CVPR": { + "author": "Vedantam, Ramakrishna and Lawrence Zitnick, C. and Parikh, Devi", + "booktitle": "Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "title": "CIDEr: Consensus-Based Image Description Evaluation", + "type": "InProceedings", + "year": "2015" + }, + "Wang_2023_CVPR": { + "author": "Wang, Su and Saharia, Chitwan and Montgomery, Ceslee and Pont-Tuset, Jordi and Noy, Shai and Pellegrini, Stefano and Onoe, Yasumasa and Laszlo, Sarah and Fleet, David J. and Soricut, Radu and Baldridge, Jason and Norouzi, Mohammad and Anderson, Peter and Chan, William", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "pages": "18359-18369", + "title": "Imagen Editor and EditBench: Advancing and Evaluating Text-Guided Image Inpainting", + "type": "InProceedings", + "year": "2023" + }, + "Wu2023HumanPS": { + "author": "Xiaoshi Wu and Yiming Hao and Keqiang Sun and Yixiong Chen and Feng Zhu and Rui Zhao and Hongsheng Li", + "journal": "ArXiv", + "title": "Human Preference Score v2: A Solid Benchmark for Evaluating Human Preferences of Text-to-Image Synthesis", + "type": "article", + "url": "https://api.semanticscholar.org/CorpusID:259171771", + "volume": "abs/2306.09341", + "year": "2023" + }, + "Wu_2023_ICCV": { + "author": "Wu, Xiaoshi and Sun, Keqiang and Zhu, Feng and Zhao, Rui and Li, Hongsheng", + "booktitle": "Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV)", + "month": "October", + "pages": "2096-2105", + "title": "Human Preference Score: Better Aligning Text-to-Image Models with Human Preference", + "type": "InProceedings", + "year": "2023" + }, + "Yarom2023WhatYS": { + "author": "Michal Yarom and Yonatan Bitton and Soravit Changpinyo and Roee Aharoni and Jonathan Herzig and Oran Lang and Eran. O. Ofek and Idan Szpektor", + "journal": "ArXiv", + "title": "What You See is What You Read? Improving Text-Image Alignment Evaluation", + "type": "article", + "url": "https://api.semanticscholar.org/CorpusID:258740893", + "volume": "abs/2305.10400", + "year": "2023" + }, + "Zellers_2019_CVPR": { + "author": "Zellers, Rowan and Bisk, Yonatan and Farhadi, Ali and Choi, Yejin", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "title": "From Recognition to Cognition: Visual Commonsense Reasoning", + "type": "InProceedings", + "year": "2019" + }, + "Zeng2024IntentTunerAI": { + "author": "Xingchen Zeng and Ziyao Gao and Yilin Ye and Wei Zeng", + "journal": "ArXiv", + "title": "IntentTuner: An Interactive Framework for Integrating Human Intents in Fine-tuning Text-to-Image Generative Models", + "type": "article", + "url": "https://api.semanticscholar.org/CorpusID:267312299", + "volume": "abs/2401.15559", + "year": "2024" + }, + "Zhang2020BERTScore": { + "author": "Tianyi Zhang* and Varsha Kishore* and Felix Wu* and Kilian Q. Weinberger and Yoav Artzi", + "booktitle": "International Conference on Learning Representations", + "title": "BERTScore: Evaluating Text Generation with BERT", + "type": "inproceedings", + "url": "https://openreview.net/forum?id", + "year": "2020" + }, + "Zhang2023CompressA": { + "author": "Lei Zhang and Fangxun Shu and Sucheng Ren and Bingchen Zhao and Hao Jiang and Cihang Xie", + "journal": "ArXiv", + "title": "Compress \\& Align: Curating Image-Text Data with Human Knowledge", + "type": "article", + "url": "https://api.semanticscholar.org/CorpusID:266174263", + "volume": "abs/2312.06726", + "year": "2023" + }, + "Zhang_2021_CVPR": { + "author": "Zhang, Pengchuan and Li, Xiujun and Hu, Xiaowei and Yang, Jianwei and Zhang, Lei and Wang, Lijuan and Choi, Yejin and Gao, Jianfeng", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "pages": "5579-5588", + "title": "VinVL: Revisiting Visual Representations in Vision-Language Models", + "type": "InProceedings", + "year": "2021" + }, + "Zhou_2022_CVPR": { + "author": "Zhou, Xingyi and Koltun, Vladlen and Kr\\\"ahenb\\\"uhl, Philipp", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "pages": "7571-7580", + "title": "Simple Multi-Dataset Detection", + "type": "InProceedings", + "year": "2022" + }, + "Zhou_2023_CVPR": { + "author": "Zhou, Yutong and Shimada, Nobutaka", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) Workshops", + "month": "June", + "pages": "826-842", + "title": "Vision + Language Applications: A Survey", + "type": "InProceedings", + "year": "2023" + }, + "Zhu_2015_ICCV": { + "author": "Zhu, Yukun and Kiros, Ryan and Zemel, Rich and Salakhutdinov, Ruslan and Urtasun, Raquel and Torralba, Antonio and Fidler, Sanja", + "booktitle": "Proceedings of the IEEE International Conference on Computer Vision (ICCV)", + "month": "December", + "title": "Aligning Books and Movies: Towards Story-Like Visual Explanations by Watching Movies and Reading Books", + "type": "InProceedings", + "year": "2015" + }, + "Zitnick_2013_CVPR": { + "author": "Zitnick, C. L. and Parikh, Devi", + "booktitle": "Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR)", + "month": "June", + "title": "Bringing Semantics into Focus Using Visual Abstraction", + "type": "InProceedings", + "year": "2013" + }, + "ahmad2022new": { + "author": "Ahmad, Waqar and Ali, Hazrat and Shah, Zubair and Azmat, Shoaib", + "journal": "Scientific Reports", + "number": "1", + "pages": "9533", + "publisher": "Nature Publishing Group UK London", + "title": "A new generative adversarial network for medical images super resolution", + "type": "article", + "volume": "12", + "year": "2022" + }, + "bai2021mifid": { + "author": "Bai, Ching-Yuan and Lin, Hsuan-Tien and Raffel, Colin and Kan, Wendy Chi-wen", + "booktitle": "Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery \\& Data Mining", + "pages": "2534--2542", + "title": "On training sample memorization: Lessons from benchmarking generative modeling with a large-scale competition", + "type": "inproceedings", + "year": "2021" + }, + "balanced_vqa_v2": { + "author": "Yash Goyal and Tejas Khot and Douglas Summers{-}Stay and Dhruv Batra and Devi Parikh", + "booktitle": "Conference on Computer Vision and Pattern Recognition (CVPR)", + "title": "Making the {V} in {VQA} Matter: Elevating the Role of Image Understanding in {V}isual {Q}uestion {A}nswering", + "type": "InProceedings", + "year": "2017" + }, + "banerjee-lavie-2005-meteor": { + "address": "\"Ann Arbor, Michigan\",", + "author": "\"Banerjee, Satanjeev and Lavie, Alon\",", + "booktitle": "\"Proceedings of the {ACL} Workshop on Intrinsic and Extrinsic Evaluation Measures for Machine Translation and/or Summarization\",", + "editor": "\"Goldstein, Jade and Lavie, Alon and Lin, Chin-Yew and Voss, Clare\",", + "month": "jun,", + "pages": "\"65--72\",", + "publisher": "\"Association for Computational Linguistics\",", + "title": "\"{METEOR}: An Automatic Metric for {MT} Evaluation with Improved Correlation with Human Judgments\",", + "type": "inproceedings", + "url": "\"https://aclanthology.org/W05-0909\",", + "year": "\"2005\"," + }, + "barratt2018note": { + "author": "Barratt, Shane and Sharma, Rishi", + "journal": "arXiv preprint arXiv:1801.01973", + "title": "A note on the inception score", + "type": "article", + "year": "2018" + }, + "baryshnikov2023hypernymy": { + "author": "Baryshnikov, Anton and Ryabinin, Max", + "journal": "arXiv preprint arXiv:2310.09247", + "title": "Hypernymy Understanding Evaluation of Text-to-Image Models via WordNet Hierarchy", + "type": "article", + "year": "2023" + }, + "betti2023let": { + "author": "Betti, Federico and Staiano, Jacopo and Baraldi, Lorenzo and Baraldi, Lorenzo and Cucchiara, Rita and Sebe, Nicu", + "booktitle": "Proceedings of the 31st ACM International Conference on Multimedia", + "pages": "9306--9312", + "title": "Let's ViCE! Mimicking Human Cognitive Behavior in Image Generation Evaluation", + "type": "inproceedings", + "year": "2023" + }, + "binkowski2018kid": { + "author": "Bi{\\'n}kowski, Miko{\\l}aj and Sutherland, Danica J and Arbel, Michael and Gretton, Arthur", + "booktitle": "International Conference on Learning Representations", + "title": "Demystifying MMD GANs", + "type": "inproceedings", + "year": "2018" + }, + "borji2022pros": { + "author": "Borji, Ali", + "journal": "Computer Vision and Image Understanding", + "pages": "103329", + "publisher": "Elsevier", + "title": "Pros and cons of GAN evaluation measures: New developments", + "type": "article", + "volume": "215", + "year": "2022" + }, + "brock2018large": { + "author": "Brock, Andrew and Donahue, Jeff and Simonyan, Karen", + "journal": "arXiv preprint arXiv:1809.11096", + "title": "Large scale GAN training for high fidelity natural image synthesis", + "type": "article", + "year": "2018" + }, + "brown2020language": { + "author": "Brown, Tom and Mann, Benjamin and Ryder, Nick and Subbiah, Melanie and Kaplan, Jared D and Dhariwal, Prafulla and Neelakantan, Arvind and Shyam, Pranav and Sastry, Girish and Askell, Amanda and others", + "journal": "Advances in neural information processing systems", + "pages": "1877--1901", + "title": "Language models are few-shot learners", + "type": "article", + "volume": "33", + "year": "2020" + }, + "caron2021emerging": { + "author": "Caron, Mathilde and Touvron, Hugo and Misra, Ishan and J{\\'e}gou, Herv{\\'e} and Mairal, Julien and Bojanowski, Piotr and Joulin, Armand", + "booktitle": "Proceedings of the IEEE/CVF international conference on computer vision", + "pages": "9650--9660", + "title": "Emerging properties in self-supervised vision transformers", + "type": "inproceedings", + "year": "2021" + }, + "castro2024clove": { + "author": "Castro, Santiago and Ziai, Amir and Saluja, Avneesh and Yuan, Zhuoning and Mihalcea, Rada", + "journal": "arXiv preprint arXiv:2402.15021", + "title": "CLoVe: Encoding Compositional Language in Contrastive Vision-Language Models", + "type": "article", + "year": "2024" + }, + "chambers2010flumejava": { + "abstract": "MapReduce and similar systems significantly ease the task of writing data-parallel code. However, many real-world computations require a pipeline of MapReduces, and programming and managing such pipelines can be difficult. We present FlumeJava, a Java library that makes it easy to develop, test, and run efficient data-parallel pipelines. At the core of the FlumeJava library are a couple of classes that represent immutable parallel collections, each supporting a modest number of operations for processing them in parallel. Parallel collections and their operations present a simple, high-level, uniform abstraction over different data representations and execution strategies. To enable parallel operations to run efficiently, FlumeJava defers their evaluation, instead internally constructing an execution plan dataflow graph. When the final results of the parallel operations are eventually needed, FlumeJava first optimizes the execution plan, and then executes the optimized operations on appropriate underlying primitives (e.g., MapReduces). The combination of high-level abstractions for parallel data and computation, deferred evaluation and optimization, and efficient parallel primitives yields an easy-to-use system that approaches the efficiency of hand-optimized pipelines. FlumeJava is in active use by hundreds of pipeline developers within Google.", + "address": "New York, NY, USA", + "author": "Chambers, Craig and Raniwala, Ashish and Perry, Frances and Adams, Stephen and Henry, Robert R. and Bradshaw, Robert and Weizenbaum, Nathan", + "booktitle": "Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation", + "doi": "10.1145/1806596.1806638", + "isbn": "9781450300193", + "keywords": "data-parallel programming, java, mapreduce", + "location": "Toronto, Ontario, Canada", + "numpages": "13", + "pages": "363\u2013375", + "publisher": "Association for Computing Machinery", + "series": "PLDI '10", + "title": "FlumeJava: easy, efficient data-parallel pipelines", + "type": "inproceedings", + "url": "https://doi.org/10.1145/1806596.1806638", + "year": "2010" + }, + "changpinyo2022all": { + "author": "Changpinyo, Soravit and Kukliansky, Doron and Szpektor, Idan and Chen, Xi and Ding, Nan and Soricut, Radu", + "journal": "arXiv preprint arXiv:2205.01883", + "title": "All you may need for vqa are image captions", + "type": "article", + "year": "2022" + }, + "chao:iccv2015": { + "author": "Yu-Wei Chao and Zhan Wang and Yugeng He and Jiaxuan Wang and Jia Deng", + "booktitle": "Proceedings of the IEEE International Conference on Computer Vision", + "title": "HICO: A Benchmark for Recognizing Human-Object Interactions in Images", + "type": "INPROCEEDINGS", + "year": "2015" + }, + "che2016mode": { + "author": "Che, Tong and Li, Yanran and Jacob, Athul and Bengio, Yoshua and Li, Wenjie", + "booktitle": "International Conference on Learning Representations", + "title": "Mode Regularized Generative Adversarial Networks", + "type": "inproceedings", + "year": "2016" + }, + "chefer2023attend": { + "author": "Chefer, Hila and Alaluf, Yuval and Vinker, Yael and Wolf, Lior and Cohen-Or, Daniel", + "journal": "ACM Transactions on Graphics (TOG)", + "number": "4", + "pages": "1--10", + "publisher": "ACM New York, NY, USA", + "title": "Attend-and-excite: Attention-based semantic guidance for text-to-image diffusion models", + "type": "article", + "volume": "42", + "year": "2023" + }, + "chen2015microsoft": { + "author": "Chen, Xinlei and Fang, Hao and Lin, Tsung-Yi and Vedantam, Ramakrishna and Gupta, Saurabh and Doll{\\'a}r, Piotr and Zitnick, C Lawrence", + "journal": "arXiv preprint arXiv:1504.00325", + "title": "Microsoft coco captions: Data collection and evaluation server", + "type": "article", + "year": "2015" + }, + "chen2020uniter": { + "author": "Chen, Yen-Chun and Li, Linjie and Yu, Licheng and El Kholy, Ahmed and Ahmed, Faisal and Gan, Zhe and Cheng, Yu and Liu, Jingjing", + "booktitle": "European conference on computer vision", + "organization": "Springer", + "pages": "104--120", + "title": "Uniter: Universal image-text representation learning", + "type": "inproceedings", + "year": "2020" + }, + "chen2022pali": { + "author": "Chen, Xi and Wang, Xiao and Changpinyo, Soravit and Piergiovanni, AJ and Padlewski, Piotr and Salz, Daniel and Goodman, Sebastian and Grycner, Adam and Mustafa, Basil and Beyer, Lucas and others", + "journal": "arXiv preprint arXiv:2209.06794", + "title": "Pali: A jointly-scaled multilingual language-image model", + "type": "article", + "year": "2022" + }, + "dash2017tac": { + "author": "Dash, Ayushman and Gamboa, John Cristian Borges and Ahmed, Sheraz and Liwicki, Marcus and Afzal, Muhammad Zeshan", + "journal": "arXiv preprint arXiv:1703.06412", + "title": "Tac-gan-text conditioned auxiliary classifier generative adversarial network", + "type": "article", + "year": "2017" + }, + "dehouche2023s": { + "author": "Dehouche, Nassim and Dehouche, Kullathida", + "journal": "Heliyon", + "number": "6", + "publisher": "Elsevier", + "title": "What\u2019s in a text-to-image prompt? The potential of stable diffusion in visual arts education", + "type": "article", + "volume": "9", + "year": "2023" + }, + "devlin2018bert": { + "author": "Devlin, Jacob and Chang, Ming-Wei and Lee, Kenton and Toutanova, Kristina", + "journal": "arXiv preprint arXiv:1810.04805", + "title": "Bert: Pre-training of deep bidirectional transformers for language understanding", + "type": "article", + "year": "2018" + }, + "dinh2022tise": { + "author": "Dinh, Tan M and Nguyen, Rang and Hua, Binh-Son", + "booktitle": "European Conference on Computer Vision", + "organization": "Springer", + "pages": "594--609", + "title": "TISE: Bag of metrics for text-to-image synthesis evaluation", + "type": "inproceedings", + "year": "2022" + }, + "du2007ergas": { + "author": "Du, Qian and Younan, Nicholas H and King, Roger and Shah, Vijay P", + "journal": "IEEE Geoscience and Remote Sensing Letters", + "number": "4", + "pages": "518--522", + "publisher": "IEEE", + "title": "On the performance evaluation of pan-sharpening techniques", + "type": "article", + "volume": "4", + "year": "2007" + }, + "dunlap2023describing": { + "author": "Dunlap, Lisa and Zhang, Yuhui and Wang, Xiaohan and Zhong, Ruiqi and Darrell, Trevor and Steinhardt, Jacob and Gonzalez, Joseph E and Yeung-Levy, Serena", + "journal": "arXiv preprint arXiv:2312.02974", + "title": "Describing Differences in Image Sets with Natural Language", + "type": "article", + "year": "2023" + }, + "faghri2018vse++": { + "author": "Faghri, Fartash and Fleet, David J and Kiros, Jamie Ryan and Fidler, Sanja", + "booktitle": "Proceedings of the British Machine Vision Conference ({BMVC})", + "title": "VSE\\+\\+: Improving Visual-Semantic Embeddings with Hard Negatives", + "type": "article", + "url": "https://github.com/fartashf/vsepp", + "year": "2018" + }, + "feng2023trainingfree": { + "author": "Weixi Feng and Xuehai He and Tsu-Jui Fu and Varun Jampani and Arjun Reddy Akula and Pradyumna Narayana and Sugato Basu and Xin Eric Wang and William Yang Wang", + "booktitle": "The Eleventh International Conference on Learning Representations ", + "title": "Training-Free Structured Diffusion Guidance for Compositional Text-to-Image Synthesis", + "type": "inproceedings", + "url": "https://openreview.net/forum?id", + "year": "2023" + }, + "fu2023dreamsim": { + "author": "Fu, Stephanie and Tamir, Netanel and Sundaram, Shobhita and Chai, Lucy and Zhang, Richard and Dekel, Tali and Isola, Phillip", + "journal": "arXiv preprint arXiv:2306.09344", + "title": "DreamSim: Learning New Dimensions of Human Visual Similarity using Synthetic Data", + "type": "article", + "year": "2023" + }, + "gal2022clipdirsim": { + "author": "Gal, Rinon and Patashnik, Or and Maron, Haggai and Bermano, Amit H and Chechik, Gal and Cohen-Or, Daniel", + "journal": "ACM Transactions on Graphics (TOG)", + "number": "4", + "pages": "1--13", + "publisher": "ACM New York, NY, USA", + "title": "StyleGAN-NADA: CLIP-guided domain adaptation of image generators", + "type": "article", + "volume": "41", + "year": "2022" + }, + "gan2020large": { + "author": "Gan, Zhe and Chen, Yen-Chun and Li, Linjie and Zhu, Chen and Cheng, Yu and Liu, Jingjing", + "journal": "Advances in Neural Information Processing Systems", + "pages": "6616--6628", + "title": "Large-scale adversarial training for vision-and-language representation learning", + "type": "article", + "volume": "33", + "year": "2020" + }, + "gordon2023mismatch": { + "archiveprefix": "arXiv", + "author": "Brian Gordon and Yonatan Bitton and Yonatan Shafir and Roopal Garg and Xi Chen and Dani Lischinski and Daniel Cohen-Or and Idan Szpektor", + "eprint": "2312.03766", + "primaryclass": "cs.CL", + "title": "Mismatch Quest: Visual and Textual Feedback for Image-Text Misalignment", + "type": "misc", + "year": "2023" + }, + "gretton2006kernel": { + "author": "Gretton, Arthur and Borgwardt, Karsten and Rasch, Malte and Sch{\\\"o}lkopf, Bernhard and Smola, Alex", + "journal": "Advances in neural information processing systems", + "title": "A kernel method for the two-sample-problem", + "type": "article", + "volume": "19", + "year": "2006" + }, + "gu2020giqa": { + "author": "Gu, Shuyang and Bao, Jianmin and Chen, Dong and Wen, Fang", + "booktitle": "Computer Vision--ECCV 2020: 16th European Conference, Glasgow, UK, August 23--28, 2020, Proceedings, Part XI 16", + "organization": "Springer", + "pages": "369--385", + "title": "Giqa: Generated image quality assessment", + "type": "inproceedings", + "year": "2020" + }, + "gu2023automated": { + "author": "Gu, Siqi", + "journal": "arXiv preprint arXiv:2312.12933", + "title": "Automated Testing for Text-to-Image Software", + "type": "article", + "year": "2023" + }, + "hartwig2022learning": { + "abstract": "Abstract View quality measures compute scores for given views and are used to determine an optimal view in viewpoint selection tasks. Unfortunately, despite the wide adoption of these measures, they are rather based on computational quantities, such as entropy, than human preferences. To instead tailor viewpoint measures towards humans, view quality measures need to be able to capture human viewpoint preferences. Therefore, we introduce a large-scale crowdsourced data set, which contains 58k annotated viewpoints for 3220 ModelNet40 models. Based on this data, we derive a neural view quality measure abiding to human preferences. We further demonstrate that this view quality measure not only generalizes to models unseen during training, but also to unseen model categories. We are thus able to predict view qualities for single images, and directly predict human preferred viewpoints for 3D models by exploiting point-based learning technology, without requiring to generate intermediate images or sampling the view sphere. We will detail our data collection procedure, describe the data analysis and model training and will evaluate the predictive quality of our trained viewpoint measure on unseen models and categories. To our knowledge, this is the first deep learning approach to predict a view quality measure solely based on human preferences.", + "author": "Hartwig, S. and Schelling, M. and Onzenoodt, C. v. and V\u00e1zquez, P.-P. and Hermosilla, P. and Ropinski, T.", + "doi": "https://doi.org/10.1111/cgf.14613", + "eprint": "https://onlinelibrary.wiley.com/doi/pdf/10.1111/cgf.14613", + "journal": "Computer Graphics Forum", + "keywords": "user studies, interaction, perceptually-based rendering, rendering", + "number": "6", + "pages": "453-466", + "title": "Learning Human Viewpoint Preferences from Sparsely Annotated Models", + "type": "article", + "url": "https://onlinelibrary.wiley.com/doi/abs/10.1111/cgf.14613", + "volume": "41", + "year": "2022" + }, + "he2016deep": { + "author": "He, Kaiming and Zhang, Xiangyu and Ren, Shaoqing and Sun, Jian", + "booktitle": "Proceedings of the IEEE conference on computer vision and pattern recognition", + "pages": "770--778", + "title": "Deep residual learning for image recognition", + "type": "inproceedings", + "year": "2016" + }, + "hessel2021clipscore": { + "author": "Hessel, Jack and Holtzman, Ari and Forbes, Maxwell and Bras, Ronan Le and Choi, Yejin", + "journal": "arXiv preprint arXiv:2104.08718", + "title": "Clipscore: A reference-free evaluation metric for image captioning", + "type": "article", + "year": "2021" + }, + "hinz2020semantic": { + "author": "Hinz, Tobias and Heinrich, Stefan and Wermter, Stefan", + "journal": "IEEE transactions on pattern analysis and machine intelligence", + "number": "3", + "pages": "1552--1565", + "publisher": "IEEE", + "title": "Semantic object accuracy for generative text-to-image synthesis", + "type": "article", + "volume": "44", + "year": "2020" + }, + "ho2022imagen": { + "archiveprefix": "arXiv", + "author": "Jonathan Ho and William Chan and Chitwan Saharia and Jay Whang and Ruiqi Gao and Alexey Gritsenko and Diederik P. Kingma and Ben Poole and Mohammad Norouzi and David J. Fleet and Tim Salimans", + "eprint": "2210.02303", + "primaryclass": "cs.CV", + "title": "Imagen Video: High Definition Video Generation with Diffusion Models", + "type": "misc", + "year": "2022" + }, + "ho2022video": { + "archiveprefix": "arXiv", + "author": "Jonathan Ho and Tim Salimans and Alexey Gritsenko and William Chan and Mohammad Norouzi and David J. Fleet", + "eprint": "2204.03458", + "primaryclass": "cs.CV", + "title": "Video Diffusion Models", + "type": "misc", + "year": "2022" + }, + "hochreiter1997lstm": { + "author": "Hochreiter, Sepp and Schmidhuber, J{\\\"u}rgen", + "journal": "Neural computation", + "number": "8", + "pages": "1735--1780", + "publisher": "MIT press", + "title": "Long short-term memory", + "type": "article", + "volume": "9", + "year": "1997" + }, + "hodosh2013framing": { + "author": "Hodosh, Micah and Young, Peter and Hockenmaier, Julia", + "journal": "Journal of Artificial Intelligence Research", + "pages": "853--899", + "title": "Framing image description as a ranking task: Data, models and evaluation metrics", + "type": "article", + "volume": "47", + "year": "2013" + }, + "honnibal2017spacy": { + "author": "Honnibal, Matthew and Montani, Ines", + "journal": "To appear", + "number": "1", + "pages": "411--420", + "title": "spaCy 2: Natural language understanding with Bloom embeddings, convolutional neural networks and incremental parsing", + "type": "article", + "volume": "7", + "year": "2017" + }, + "hsieh2023sugarcrepe": { + "author": "Cheng-Yu Hsieh and Jieyu Zhang and Zixian Ma and Aniruddha Kembhavi and Ranjay Krishna", + "booktitle": "Thirty-seventh Conference on Neural Information Processing Systems Datasets and Benchmarks Track", + "title": "SugarCrepe: Fixing Hackable Benchmarks for Vision-Language Compositionality", + "type": "inproceedings", + "url": "https://openreview.net/forum?id", + "year": "2023" + }, + "huang2023t2icompbench": { + "author": "Kaiyi Huang and Kaiyue Sun and Enze Xie and Zhenguo Li and Xihui Liu", + "journal": "arXiv preprint arXiv: 2307.06350", + "title": "T2I-CompBench: A Comprehensive Benchmark for Open-world Compositional Text-to-image Generation", + "type": "article", + "year": "2023" + }, + "ijcai2022p759": { + "author": "Cao, Min and Li, Shiping and Li, Juntao and Nie, Liqiang and Zhang, Min", + "booktitle": "Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, {IJCAI-22}", + "doi": "10.24963/ijcai.2022/759", + "editor": "Lud De Raedt", + "month": "7", + "note": "Survey Track", + "pages": "5410--5417", + "publisher": "International Joint Conferences on Artificial Intelligence Organization", + "title": "Image-text Retrieval: A Survey on Recent Research and Development", + "type": "inproceedings", + "url": "https://doi.org/10.24963/ijcai.2022/759", + "year": "2022" + }, + "jenkins2019unsupervised": { + "author": "Jenkins, Porter and Farag, Ahmad and Wang, Suhang and Li, Zhenhui", + "booktitle": "Proceedings of the 28th ACM international conference on information and knowledge management", + "pages": "1993--2002", + "title": "Unsupervised representation learning of spatial data via multimodal embedding", + "type": "inproceedings", + "year": "2019" + }, + "jiang2019tiger": { + "author": "Jiang, Ming and Huang, Qiuyuan and Zhang, Lei and Wang, Xin and Zhang, Pengchuan and Gan, Zhe and Diesner, Jana and Gao, Jianfeng", + "journal": "arXiv preprint arXiv:1909.02050", + "title": "Tiger: Text-to-image grounding for image caption evaluation", + "type": "article", + "year": "2019" + }, + "kamath-etal-2023-text": { + "address": "\"Singapore\",", + "author": "\"Kamath, Amita and Hessel, Jack and Chang, Kai-Wei\",", + "booktitle": "\"Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing\",", + "doi": "\"10.18653/v1/2023.emnlp-main.301\",", + "editor": "\"Bouamor, Houda and Pino, Juan and Bali, Kalika\",", + "month": "dec,", + "pages": "\"4933--4944\"", + "publisher": "\"Association for Computational Linguistics\",", + "title": "\"Text encoders bottleneck compositionality in contrastive vision-language models\",", + "type": "inproceedings", + "url": "\"https://aclanthology.org/2023.emnlp-main.301\",", + "year": "\"2023\"," + }, + "kamath2023s": { + "author": "Kamath, Amita and Hessel, Jack and Chang, Kai-Wei", + "journal": "arXiv preprint arXiv:2310.19785", + "title": "What's\" up\" with vision-language models? Investigating their struggle with spatial reasoning", + "type": "article", + "year": "2023" + }, + "kane-etal-2020-nubia": { + "abstract": "\"We present NUBIA, a methodology to build automatic evaluation metrics for text generation using only machine learning models as core components. A typical NUBIA model is composed of three modules: a neural feature extractor, an aggregator and a calibrator. We demonstrate an implementation of NUBIA showing competitive performance with stateof-the art metrics used to evaluate machine translation and state-of-the art results for image captions quality evaluation. In addition to strong performance, NUBIA models have the advantage of being modular and improve in synergy with advances in text generation models.\",", + "address": "\"Online (Dublin, Ireland)\",", + "author": "\"Kane, Hassan and Kocyigit, Muhammed Yusuf and Abdalla, Ali and Ajanoh, Pelkins and Coulibali, Mohamed\",", + "booktitle": "\"Proceedings of the 1st Workshop on Evaluating NLG Evaluation\",", + "editor": "\"Agarwal, Shubham and Du{\\v{s}}ek, Ond{\\v{r}}ej and Gehrmann, Sebastian and Gkatzia, Dimitra and Konstas, Ioannis and Van Miltenburg, Emiel and Santhanam, Sashank\",", + "month": "dec,", + "pages": "\"28--37\",", + "publisher": "\"Association for Computational Linguistics\",", + "title": "\"{NUBIA}: {N}e{U}ral Based Interchangeability Assessor for Text Generation\",", + "type": "inproceedings", + "url": "\"https://aclanthology.org/2020.evalnlgeval-1.4\",", + "year": "\"2020\"," + }, + "kang2023scaling": { + "author": "Kang, Minguk and Zhu, Jun-Yan and Zhang, Richard and Park, Jaesik and Shechtman, Eli and Paris, Sylvain and Park, Taesung", + "booktitle": "Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition", + "pages": "10124--10134", + "title": "Scaling up gans for text-to-image synthesis", + "type": "inproceedings", + "year": "2023" + }, + "karras2019style": { + "author": "Karras, Tero and Laine, Samuli and Aila, Timo", + "booktitle": "Proceedings of the IEEE/CVF conference on computer vision and pattern recognition", + "pages": "4401--4410", + "title": "A style-based generator architecture for generative adversarial networks", + "type": "inproceedings", + "year": "2019" + }, + "khashabi2020unifiedqa": { + "author": "Khashabi, Daniel and Min, Sewon and Khot, Tushar and Sabharwal, Ashish and Tafjord, Oyvind and Clark, Peter and Hajishirzi, Hannaneh", + "journal": "arXiv preprint arXiv:2005.00700", + "title": "Unifiedqa: Crossing format boundaries with a single qa system", + "type": "article", + "year": "2020" + }, + "kim2021vilt": { + "author": "Kim, Wonjae and Son, Bokyung and Kim, Ildoo", + "booktitle": "International Conference on Machine Learning", + "organization": "PMLR", + "pages": "5583--5594", + "title": "Vilt: Vision-and-language transformer without convolution or region supervision", + "type": "inproceedings", + "year": "2021" + }, + "kim2022mutual": { + "author": "Kim, Jin-Hwa and Kim, Yunji and Lee, Jiyoung and Yoo, Kang Min and Lee, Sang-Woo", + "journal": "Advances in Neural Information Processing Systems", + "pages": "35072--35086", + "title": "Mutual information divergence: A unified metric for multimodal generative models", + "type": "article", + "volume": "35", + "year": "2022" + }, + "kim2023imagine": { + "author": "Yeongbin Kim and Gautam Singh and Junyeong Park and Caglar Gulcehre and Sungjin Ahn", + "booktitle": "Thirty-seventh Conference on Neural Information Processing Systems Datasets and Benchmarks Track", + "title": "Imagine the Unseen World: A Benchmark for Systematic Generalization in Visual World Models", + "type": "inproceedings", + "url": "https://openreview.net/forum?id", + "year": "2023" + }, + "kiros2014unifying": { + "author": "Kiros, Ryan and Salakhutdinov, Ruslan and Zemel, Richard S", + "journal": "arXiv preprint arXiv:1411.2539", + "title": "Unifying visual-semantic embeddings with multimodal neural language models", + "type": "article", + "year": "2014" + }, + "kiros2018illustrative": { + "author": "Kiros, Jamie and Chan, William and Hinton, Geoffrey", + "booktitle": "Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)", + "pages": "922--933", + "title": "Illustrative language understanding: Large-scale visual grounding with image search", + "type": "inproceedings", + "year": "2018" + }, + "ku2023viescore": { + "author": "Ku, Max and Jiang, Dongfu and Wei, Cong and Yue, Xiang and Chen, Wenhu", + "journal": "arXiv preprint arXiv:2312.14867", + "title": "VIEScore: Towards Explainable Metrics for Conditional Image Synthesis Evaluation", + "type": "article", + "year": "2023" + }, + "kumar2023comprehensive": { + "author": "Kumar, Satyam and Musharaf, Dayima and Musharaf, Seerat and Sagar, Anil Kumar", + "booktitle": "International Conference on Advanced Communication and Intelligent Systems", + "organization": "Springer", + "pages": "90--103", + "title": "A Comprehensive Review of the Latest Advancements in Large Generative AI Models", + "type": "inproceedings", + "year": "2023" + }, + "kuznetsova2020open": { + "author": "Kuznetsova, Alina and Rom, Hassan and Alldrin, Neil and Uijlings, Jasper and Krasin, Ivan and Pont-Tuset, Jordi and Kamali, Shahab and Popov, Stefan and Malloci, Matteo and Kolesnikov, Alexander and others", + "journal": "International Journal of Computer Vision", + "number": "7", + "pages": "1956--1981", + "publisher": "Springer", + "title": "The open images dataset v4: Unified image classification, object detection, and visual relationship detection at scale", + "type": "article", + "volume": "128", + "year": "2020" + }, + "kynkaanniemi2019improved": { + "author": "Kynk{\\\"a}{\\\"a}nniemi, Tuomas and Karras, Tero and Laine, Samuli and Lehtinen, Jaakko and Aila, Timo", + "journal": "Advances in Neural Information Processing Systems", + "title": "Improved precision and recall metric for assessing generative models", + "type": "article", + "volume": "32", + "year": "2019" + }, + "lavie2004significance": { + "author": "Lavie, Alon and Sagae, Kenji and Jayaraman, Shyamsundar", + "booktitle": "Machine Translation: From Real Users to Research: 6th Conference of the Association for Machine Translation in the Americas, AMTA 2004, Washington, DC, USA, September 28-October 2, 2004. Proceedings 6", + "organization": "Springer", + "pages": "134--143", + "title": "The significance of recall in automatic metrics for MT evaluation", + "type": "inproceedings", + "year": "2004" + }, + "lee-etal-2020-vilbertscore": { + "address": "\"Online\",", + "author": "\"Lee, Hwanhee and Yoon, Seunghyun and Dernoncourt, Franck and Kim, Doo Soon and Bui, Trung and Jung, Kyomin\",", + "booktitle": "\"Proceedings of the First Workshop on Evaluation and Comparison of NLP Systems\",", + "doi": "\"10.18653/v1/2020.eval4nlp-1.4\",", + "editor": "\"Eger, Steffen and Gao, Yang and Peyrard, Maxime and Zhao, Wei and Hovy, Eduard\",", + "month": "nov,", + "pages": "\"34--39\",", + "publisher": "\"Association for Computational Linguistics\",", + "title": "\"{V}i{LBERTS}core: Evaluating Image Caption Using Vision-and-Language {BERT}\",", + "type": "inproceedings", + "url": "\"https://aclanthology.org/2020.eval4nlp-1.4\",", + "year": "\"2020\"," + }, + "lee2018stacked": { + "author": "Lee, Kuang-Huei and Chen, Xi and Hua, Gang and Hu, Houdong and He, Xiaodong", + "booktitle": "Proceedings of the European conference on computer vision (ECCV)", + "pages": "201--216", + "title": "Stacked cross attention for image-text matching", + "type": "inproceedings", + "year": "2018" + }, + "lee2023aligning": { + "archiveprefix": "arXiv", + "author": "Kimin Lee and Hao Liu and Moonkyung Ryu and Olivia Watkins and Yuqing Du and Craig Boutilier and Pieter Abbeel and Mohammad Ghavamzadeh and Shixiang Shane Gu", + "eprint": "2302.12192", + "primaryclass": "cs.LG", + "title": "Aligning Text-to-Image Models using Human Feedback", + "type": "misc", + "year": "2023" + }, + "lee2023holistic": { + "author": "Tony Lee and Michihiro Yasunaga and Chenlin Meng and Yifan Mai and Joon Sung Park and Agrim Gupta and Yunzhi Zhang and Deepak Narayanan and Hannah Benita Teufel and Marco Bellagente and Minguk Kang and Taesung Park and Jure Leskovec and Jun-Yan Zhu and Li Fei-Fei and Jiajun Wu and Stefano Ermon and Percy Liang", + "booktitle": "Thirty-seventh Conference on Neural Information Processing Systems Datasets and Benchmarks Track", + "title": "Holistic Evaluation of Text-to-Image Models", + "type": "inproceedings", + "url": "https://openreview.net/forum?id", + "year": "2023" + }, + "lee2023text": { + "author": "Lee, Jaewoong and Jang, Sangwon and Jo, Jaehyeong and Yoon, Jaehong and Kim, Yunji and Kim, Jin-Hwa and Ha, Jung-Woo and Hwang, Sung Ju", + "journal": "arXiv preprint arXiv:2304.01515", + "title": "Text-Conditioned Sampling Framework for Text-to-Image Generation with Masked Generative Models", + "type": "article", + "year": "2023" + }, + "lewis2022does": { + "author": "Lewis, Martha and Nayak, Nihal V and Yu, Peilin and Yu, Qinan and Merullo, Jack and Bach, Stephen H and Pavlick, Ellie", + "journal": "arXiv preprint arXiv:2212.10537", + "title": "Does clip bind concepts? probing compositionality in large image models", + "type": "article", + "year": "2022" + }, + "li-etal-2022-mplug": { + "abstract": "\"Large-scale pre-trained foundation models have been an emerging paradigm for building artificial intelligence (AI) systems, which can be quickly adapted to a wide range of downstream tasks. This paper presents mPLUG, a new vision-language foundation model for both cross-modal understanding and generation. Most existing pre-trained models suffer from inefficiency and linguistic signal overwhelmed by long visual sequences in cross-modal alignment. To address both problems, mPLUG introduces an effective and efficient vision-language architecture with novel cross-modal skip-connections.mPLUG is pre-trained end-to-end on large-scale image-text pairs with both discriminative and generative objectives. It achieves state-of-the-art results on a wide range of vision-language downstream tasks, including image captioning, image-text retrieval, visual grounding and visual question answering. mPLUG also demonstrates strong zero-shot transferability on vision-language and video-language tasks. The code and pre-trained models are available at \\url{https://github.com/alibaba/AliceMind}\",", + "address": "\"Abu Dhabi, United Arab Emirates\",", + "author": "\"Li, Chenliang and Xu, Haiyang and Tian, Junfeng and Wang, Wei and Yan, Ming and Bi, Bin and Ye, Jiabo and Chen, He and Xu, Guohai and Cao, Zheng and Zhang, Ji and Huang, Songfang and Huang, Fei and Zhou, Jingren and Si, Luo\",", + "booktitle": "\"Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing\",", + "doi": "\"10.18653/v1/2022.emnlp-main.488\",", + "editor": "\"Goldberg, Yoav and Kozareva, Zornitsa and Zhang, Yue\",", + "month": "dec,", + "pages": "\"7241--7259\",", + "publisher": "\"Association for Computational Linguistics\",", + "title": "\"m{PLUG}: Effective and Efficient Vision-Language Learning by Cross-modal Skip-connections\",", + "type": "inproceedings", + "url": "\"https://aclanthology.org/2022.emnlp-main.488\",", + "year": "\"2022\"," + }, + "li2020oscar": { + "author": "Li, Xiujun and Yin, Xi and Li, Chunyuan and Zhang, Pengchuan and Hu, Xiaowei and Zhang, Lei and Wang, Lijuan and Hu, Houdong and Dong, Li and Wei, Furu and others", + "booktitle": "Computer Vision--ECCV 2020: 16th European Conference, Glasgow, UK, August 23--28, 2020, Proceedings, Part XXX 16", + "organization": "Springer", + "pages": "121--137", + "title": "Oscar: Object-semantics aligned pre-training for vision-language tasks", + "type": "inproceedings", + "year": "2020" + }, + "li2022blip": { + "author": "Li, Junnan and Li, Dongxu and Xiong, Caiming and Hoi, Steven", + "booktitle": "International Conference on Machine Learning", + "organization": "PMLR", + "pages": "12888--12900", + "title": "Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation", + "type": "inproceedings", + "year": "2022" + }, + "li2023covlm": { + "author": "Li, Junyan and Chen, Delin and Hong, Yining and Chen, Zhenfang and Chen, Peihao and Shen, Yikang and Gan, Chuang", + "journal": "arXiv preprint arXiv:2311.03354", + "title": "CoVLM: Composing Visual Entities and Relationships in Large Language Models Via Communicative Decoding", + "type": "article", + "year": "2023" + }, + "li2023divide": { + "author": "Li, Yumeng and Keuper, Margret and Zhang, Dan and Khoreva, Anna", + "journal": "arXiv preprint arXiv:2307.10864", + "title": "Divide \\& bind your attention for improved generative semantic nursing", + "type": "article", + "year": "2023" + }, + "li2024compositional": { + "author": "Junyan Li and Delin Chen and Yining Hong and Zhenfang Chen and Peihao Chen and Yikang Shen and Chuang Gan", + "booktitle": "The Twelfth International Conference on Learning Representations", + "title": "Compositional {VLM}: Composing Visual Entities and Relationships in Large Language Models Via Communicative Decoding", + "type": "inproceedings", + "url": "https://openreview.net/forum?id", + "year": "2024" + }, + "liang2020cpgan": { + "author": "Liang, Jiadong and Pei, Wenjie and Lu, Feng", + "booktitle": "Computer Vision--ECCV 2020: 16th European Conference, Glasgow, UK, August 23--28, 2020, Proceedings, Part IV 16", + "organization": "Springer", + "pages": "491--508", + "title": "Cpgan: Content-parsing generative adversarial networks for text-to-image synthesis", + "type": "inproceedings", + "year": "2020" + }, + "liang2023rich": { + "author": "Liang, Youwei and He, Junfeng and Li, Gang and Li, Peizhao and Klimovskiy, Arseniy and Carolan, Nicholas and Sun, Jiao and Pont-Tuset, Jordi and Young, Sarah and Yang, Feng and others", + "journal": "arXiv preprint arXiv:2312.10240", + "title": "Rich Human Feedback for Text-to-Image Generation", + "type": "article", + "year": "2023" + }, + "lin-2004-rouge": { + "address": "\"Barcelona, Spain\",", + "author": "\"Lin, Chin-Yew\",", + "booktitle": "\"Text Summarization Branches Out\",", + "month": "jul,", + "pages": "\"74--81\",", + "publisher": "\"Association for Computational Linguistics\",", + "title": "\"{ROUGE}: A Package for Automatic Evaluation of Summaries\",", + "type": "inproceedings", + "url": "\"https://aclanthology.org/W04-1013\",", + "year": "\"2004\"," + }, + "lin2014microsoft": { + "author": "Lin, Tsung-Yi and Maire, Michael and Belongie, Serge and Hays, James and Perona, Pietro and Ramanan, Deva and Doll{\\'a}r, Piotr and Zitnick, C Lawrence", + "booktitle": "Computer Vision--ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part V 13", + "organization": "Springer", + "pages": "740--755", + "title": "Microsoft coco: Common objects in context", + "type": "inproceedings", + "year": "2014" + }, + "lin2023revisiting": { + "author": "Lin, Zhiqiu and Chen, Xinyue and Pathak, Deepak and Zhang, Pengchuan and Ramanan, Deva", + "journal": "arXiv preprint arXiv:2306.01879", + "title": "Revisiting the Role of Language Priors in Vision-Language Models", + "type": "article", + "year": "2023" + }, + "liu2021swin": { + "author": "Liu, Ze and Lin, Yutong and Cao, Yue and Hu, Han and Wei, Yixuan and Zhang, Zheng and Lin, Stephen and Guo, Baining", + "booktitle": "Proceedings of the IEEE/CVF international conference on computer vision", + "pages": "10012--10022", + "title": "Swin transformer: Hierarchical vision transformer using shifted windows", + "type": "inproceedings", + "year": "2021" + }, + "liu2022compositional": { + "author": "Liu, Nan and Li, Shuang and Du, Yilun and Torralba, Antonio and Tenenbaum, Joshua B", + "booktitle": "European Conference on Computer Vision", + "organization": "Springer", + "pages": "423--439", + "title": "Compositional visual generation with composable diffusion models", + "type": "inproceedings", + "year": "2022" + }, + "liu2024fetv": { + "author": "Liu, Yuanxin and Li, Lei and Ren, Shuhuai and Gao, Rundong and Li, Shicheng and Chen, Sishuo and Sun, Xu and Hou, Lu", + "journal": "Advances in Neural Information Processing Systems", + "title": "Fetv: A benchmark for fine-grained evaluation of open-domain text-to-video generation", + "type": "article", + "volume": "36", + "year": "2024" + }, + "lopez2016revisiting": { + "author": "Lopez-Paz, David and Oquab, Maxime", + "booktitle": "International Conference on Learning Representations", + "title": "Revisiting Classifier Two-Sample Tests", + "type": "inproceedings", + "year": "2016" + }, + "lu2023llmscore": { + "author": "Yujie Lu and Xianjun Yang and Xiujun Li and Xin Eric Wang and William Yang Wang", + "booktitle": "Thirty-seventh Conference on Neural Information Processing Systems", + "title": "LLMScore: Unveiling the Power of Large Language Models in Text-to-Image Synthesis Evaluation", + "type": "inproceedings", + "url": "https://openreview.net/forum?id", + "year": "2023" + }, + "ma2023examination": { + "author": "Ma, Teli and Li, Rong and Liang, Junwei", + "journal": "arXiv preprint arXiv:2308.10509", + "title": "An examination of the compositionality of large generative vision-language models", + "type": "article", + "year": "2023" + }, + "ma2024cobra": { + "author": "Ma, Zheng and Wang, Changxin and Ouyang, Yawen and Zhao, Fei and Zhang, Jianbing and Huang, Shujian and Chen, Jiajun", + "journal": "arXiv preprint arXiv:2402.11572", + "title": "Cobra Effect in Reference-Free Image Captioning Metrics", + "type": "article", + "year": "2024" + }, + "madhyastha-etal-2019-vifidel": { + "address": "\"Florence, Italy\",", + "author": "\"Madhyastha, Pranava and Wang, Josiah and Specia, Lucia\",", + "booktitle": "\"Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics\",", + "doi": "\"10.18653/v1/P19-1654\",", + "editor": "\"Korhonen, Anna and Traum, David and M{\\`a}rquez, Llu{\\'\\i}s\",", + "month": "jul,", + "pages": "\"6539--6550\",", + "publisher": "\"Association for Computational Linguistics\",", + "title": "\"{VIFIDEL}: Evaluating the Visual Fidelity of Image Descriptions\",", + "type": "inproceedings", + "url": "\"https://aclanthology.org/P19-1654\",", + "year": "\"2019\"," + }, + "mao2016training": { + "abstract": "In this paper, we focus on training and evaluating effective word embeddings with both text and visual information. More specifically, we introduce a large-scale dataset with 300 million sentences describing over 40 million images crawled and downloaded from publicly available Pins (i.e. an image with sentence descriptions uploaded by users) on Pinterest [2]. This dataset is more than 200 times larger than MS COCO [22], the standard large-scale image dataset with sentence descriptions. In addition, we construct an evaluation dataset to directly assess the effectiveness of word embeddings in terms of finding semantically similar or related words and phrases. The word/phrase pairs in this evaluation dataset are collected from the click data with millions of users in an image search system, thus contain rich semantic relationships. Based on these datasets, we propose and compare several Recurrent Neural Networks (RNNs) based multimodal (text and image) models. Experiments show that our model benefits from incorporating the visual information into the word embeddings, and a weight sharing strategy is crucial for learning such multimodal embeddings. The project page is: http://www.stat.ucla.edu/~junhua.mao/multimodal_embedding.html.", + "address": "Red Hook, NY, USA", + "author": "Mao, Junhua and Xu, Jiajing and Jing, Yushi and Yuille, Alan", + "booktitle": "Proceedings of the 30th International Conference on Neural Information Processing Systems", + "isbn": "9781510838819", + "location": "Barcelona, Spain", + "numpages": "9", + "pages": "442\u2013450", + "publisher": "Curran Associates Inc.", + "series": "NIPS'16", + "title": "Training and evaluating multimodal word embeddings with large-scale web annotated images", + "type": "inproceedings", + "year": "2016" + }, + "marcus2022preliminary": { + "archiveprefix": "arXiv", + "author": "Gary Marcus and Ernest Davis and Scott Aaronson", + "eprint": "2204.13807", + "primaryclass": "cs.CV", + "title": "A very preliminary analysis of DALL-E 2", + "type": "misc", + "year": "2022" + }, + "menendez1997jensen": { + "abstract": "In this paper we investigate the Jensen-Shannon parametric divergence for testing goodness-of-fit for point estimation. Most of the work presented is an analytical study of the asymptotic differences between different members of the family proposed in goodness of fit, together with an examination of closer approximations to the exact distribution of these statistics than the commonly used chi-squared distribution. Finally the minimum Jensen-Shannon divergence estimates are introduced and compared with other well-known estimators by computer simulation.", + "author": "M.L. Men\u00e9ndez and J.A. Pardo and L. Pardo and M.C. Pardo", + "doi": "https://doi.org/10.1016/S0016-0032(96)00063-4", + "issn": "0016-0032", + "journal": "Journal of the Franklin Institute", + "number": "2", + "pages": "307-318", + "title": "The Jensen-Shannon divergence", + "type": "article", + "url": "https://www.sciencedirect.com/science/article/pii/S0016003296000634", + "volume": "334", + "year": "1997" + }, + "miller1995Wordnet": { + "abstract": "Because meaningful sentences are composed of meaningful words, any system that hopes to process natural languages as people do must have information about words and their meanings. This information is traditionally provided through dictionaries, and machine-readable dictionaries are now widely available. But dictionary entries evolved for the convenience of human readers, not for machines. WordNet1 provides a more effective combination of traditional lexicographic information and modern computing. WordNet is an online lexical database designed for use under program control. English nouns, verbs, adjectives, and adverbs are organized into sets of synonyms, each representing a lexicalized concept. Semantic relations link the synonym sets [4].", + "address": "New York, NY, USA", + "author": "Miller, George A.", + "doi": "10.1145/219717.219748", + "issn": "0001-0782", + "issue_date": "Nov. 1995", + "journal": "Commun. ACM", + "month": "nov", + "number": "11", + "numpages": "3", + "pages": "39\u201341", + "publisher": "Association for Computing Machinery", + "title": "WordNet: a lexical database for English", + "type": "article", + "url": "https://doi.org/10.1145/219717.219748", + "volume": "38", + "year": "1995" + }, + "minderer2022simple": { + "author": "Minderer, M and Gritsenko, A and Stone, A and Neumann, M and Weissenborn, D and Dosovitskiy, A and Mahendran, A and Arnab, A and Dehghani, M and Shen, Z and others", + "journal": "arXiv preprint arXiv:2205.06230", + "title": "Simple open-vocabulary object detection with vision transformers. arxiv 2022", + "type": "article", + "volume": "2", + "year": "2022" + }, + "moorthy2011blind": { + "author": "Moorthy, Anush Krishna and Bovik, Alan Conrad", + "journal": "IEEE transactions on Image Processing", + "number": "12", + "pages": "3350--3364", + "publisher": "IEEE", + "title": "Blind image quality assessment: From natural scene statistics to perceptual quality", + "type": "article", + "volume": "20", + "year": "2011" + }, + "openai2023gpt": { + "author": "OpenAI, R", + "journal": "View in Article", + "pages": "13", + "title": "Gpt-4 technical report. arxiv 2303.08774", + "type": "article", + "volume": "2", + "year": "2023" + }, + "park2021benchmark": { + "author": "Dong Huk Park and Samaneh Azadi and Xihui Liu and Trevor Darrell and Anna Rohrbach", + "booktitle": "Thirty-fifth Conference on Neural Information Processing Systems Datasets and Benchmarks Track (Round 1)", + "title": "Benchmark for Compositional Text-to-Image Synthesis", + "type": "inproceedings", + "url": "https://openreview.net/forum?id", + "year": "2021" + }, + "pascal-voc-2008": { + "author": "\"Everingham, M. and Van~Gool, L. and Williams, C. K. I. and Winn, J. and Zisserman, A.\",", + "howpublished": "\"http://www.pascal-network.org/challenges/VOC/voc2008/workshop/index.html\"", + "title": "\"The {PASCAL} {V}isual {O}bject {C}lasses {C}hallenge 2008 {(VOC2008)} {R}esults\",", + "type": "misc" + }, + "plummer2015flickr30kentities": { + "author": "Plummer, Bryan A. and Wang, Liwei and Cervantes, Chris M. and Caicedo, Juan C. and Hockenmaier, Julia and Lazebnik, Svetlana", + "booktitle": "2015 IEEE International Conference on Computer Vision (ICCV)", + "doi": "10.1109/ICCV.2015.303", + "keywords": "Standards;Benchmark testing;Image resolution;Grounding;Glass;Training;Image color analysis", + "number": "", + "pages": "2641-2649", + "title": "Flickr30k Entities: Collecting Region-to-Phrase Correspondences for Richer Image-to-Sentence Models", + "type": "INPROCEEDINGS", + "volume": "", + "year": "2015" + }, + "pmlr-v139-cho21a": { + "abstract": "\t {Existing methods for vision-and-language learning typically require designing task-specific architectures and objectives for each task. For example, a multi-label answer classifier for visual question answering, a region scorer for referring expression comprehension, and a language decoder for image captioning, etc. To alleviate these hassles, in this work, we propose a unified framework that learns different tasks in a single architecture with the same language modeling objective, i.e., multimodal conditional text generation, where our models learn to generate labels in text based on the visual and textual inputs. On 7 popular vision-and-language benchmarks, including visual question answering, referring expression comprehension, visual commonsense reasoning, most of which have been previously modeled as discriminative tasks, our generative approach (with a single unified architecture) reaches comparable performance to recent task-specific state-of-the-art vision-and-language models. Moreover, our generative approach shows better generalization ability on questions that have rare answers. Also, we show that our framework allows multi-task learning in a single architecture with a single set of parameters, achieving similar performance to separately optimized single-task models. Our code is publicly available at: https://github.com/j-min/VL-T5", + "author": "Cho, Jaemin and Lei, Jie and Tan, Hao and Bansal, Mohit", + "booktitle": "\t {Proceedings of the 38th International Conference on Machine Learning", + "editor": "\t {Meila, Marina and Zhang, Tong", + "month": "\t {18--24 Jul", + "pages": "\t {1931--1942", + "pdf": "\t {http://proceedings.mlr.press/v139/cho21a/cho21a.pdf", + "publisher": "PMLR", + "series": "\t {Proceedings of Machine Learning Research", + "title": "\t {Unifying Vision-and-Language Tasks via Text Generation", + "type": "InProceedings", + "url": "\t {https://proceedings.mlr.press/v139/cho21a.html", + "volume": "\t {139", + "year": "\t {2021" + }, + "pmlr-v139-kim21k": { + "abstract": "\t {Vision-and-Language Pre-training (VLP) has improved performance on various joint vision-and-language downstream tasks. Current approaches to VLP heavily rely on image feature extraction processes, most of which involve region supervision (e.g., object detection) and the convolutional architecture (e.g., ResNet). Although disregarded in the literature, we find it problematic in terms of both (1) efficiency/speed, that simply extracting input features requires much more computation than the multimodal interaction steps; and (2) expressive power, as it is upper bounded to the expressive power of the visual embedder and its predefined visual vocabulary. In this paper, we present a minimal VLP model, Vision-and-Language Transformer (ViLT), monolithic in the sense that the processing of visual inputs is drastically simplified to just the same convolution-free manner that we process textual inputs. We show that ViLT is up to tens of times faster than previous VLP models, yet with competitive or better downstream task performance. Our code and pre-trained weights are available at https://github.com/dandelin/vilt.", + "author": "Kim, Wonjae and Son, Bokyung and Kim, Ildoo", + "booktitle": "\t {Proceedings of the 38th International Conference on Machine Learning", + "editor": "\t {Meila, Marina and Zhang, Tong", + "month": "\t {18--24 Jul", + "pages": "\t {5583--5594", + "pdf": "\t {http://proceedings.mlr.press/v139/kim21k/kim21k.pdf", + "publisher": "PMLR", + "series": "\t {Proceedings of Machine Learning Research", + "title": "\t {ViLT: Vision-and-Language Transformer Without Convolution or Region Supervision", + "type": "InProceedings", + "url": "\t {http://proceedings.mlr.press/v139/kim21k.html", + "volume": "\t {139", + "year": "\t {2021" + }, + "pmlr-v37-kusnerb15": { + "abstract": "\t {We present the Word Mover\u2019s Distance (WMD), a novel distance function between text documents. Our work is based on recent results in word embeddings that learn semantically meaningful representations for words from local co-occurrences in sentences. The WMD distance measures the dissimilarity between two text documents as the minimum amount of distance that the embedded words of one document need to \"travel\" to reach the embedded words of another document. We show that this distance metric can be cast as an instance of the Earth Mover\u2019s Distance, a well studied transportation problem for which several highly efficient solvers have been developed. Our metric has no hyperparameters and is straight-forward to implement. Further, we demonstrate on eight real world document classification data sets, in comparison with seven state-of-the-art baselines, that the WMD metric leads to unprecedented low k-nearest neighbor document classification error rates.", + "address": "\t {Lille, France", + "author": "\t {Kusner, Matt and Sun, Yu and Kolkin, Nicholas and Weinberger, Kilian", + "booktitle": "\t {Proceedings of the 32nd International Conference on Machine Learning", + "editor": "\t {Bach, Francis and Blei, David", + "month": "\t {07--09 Jul", + "pages": "\t {957--966", + "pdf": "\t {http://proceedings.mlr.press/v37/kusnerb15.pdf", + "publisher": "PMLR", + "series": "\t {Proceedings of Machine Learning Research", + "title": "\t {From Word Embeddings To Document Distances", + "type": "InProceedings", + "url": "\t {https://proceedings.mlr.press/v37/kusnerb15.html", + "volume": "\t {37", + "year": "\t {2015" + }, + "po2023state": { + "archiveprefix": "arXiv", + "author": "Ryan Po and Wang Yifan and Vladislav Golyanik and Kfir Aberman and Jonathan T. Barron and Amit H. Bermano and Eric Ryan Chan and Tali Dekel and Aleksander Holynski and Angjoo Kanazawa and C. Karen Liu and Lingjie Liu and Ben Mildenhall and Matthias Nie\u00dfner and Bj\u00f6rn Ommer and Christian Theobalt and Peter Wonka and Gordon Wetzstein", + "eprint": "2310.07204", + "primaryclass": "cs.AI", + "title": "State of the Art on Diffusion Models for Visual Computing", + "type": "misc", + "year": "2023" + }, + "prabhudesai2023aligning": { + "archiveprefix": "arXiv", + "author": "Mihir Prabhudesai and Anirudh Goyal and Deepak Pathak and Katerina Fragkiadaki", + "eprint": "2310.03739", + "primaryclass": "cs.CV", + "title": "Aligning Text-to-Image Diffusion Models with Reward Backpropagation", + "type": "misc", + "year": "2023" + }, + "radford2019language": { + "author": "Radford, Alec and Wu, Jeffrey and Child, Rewon and Luan, David and Amodei, Dario and Sutskever, Ilya and others", + "journal": "OpenAI blog", + "number": "8", + "pages": "9", + "title": "Language models are unsupervised multitask learners", + "type": "article", + "volume": "1", + "year": "2019" + }, + "radford2021learning": { + "author": "Radford, Alec and Kim, Jong Wook and Hallacy, Chris and Ramesh, Aditya and Goh, Gabriel and Agarwal, Sandhini and Sastry, Girish and Askell, Amanda and Mishkin, Pamela and Clark, Jack and others", + "booktitle": "International conference on machine learning", + "organization": "PMLR", + "pages": "8748--8763", + "title": "Learning transferable visual models from natural language supervision", + "type": "inproceedings", + "year": "2021" + }, + "ramesh2021zero": { + "author": "Ramesh, Aditya and Pavlov, Mikhail and Goh, Gabriel and Gray, Scott and Voss, Chelsea and Radford, Alec and Chen, Mark and Sutskever, Ilya", + "booktitle": "International conference on machine learning", + "organization": "Pmlr", + "pages": "8821--8831", + "title": "Zero-shot text-to-image generation", + "type": "inproceedings", + "year": "2021" + }, + "rashtchian2010collecting": { + "author": "Rashtchian, Cyrus and Young, Peter and Hodosh, Micah and Hockenmaier, Julia", + "booktitle": "Proceedings of the NAACL HLT 2010 workshop on creating speech and language data with Amazon\u2019s Mechanical Turk", + "pages": "139--147", + "title": "Collecting image annotations using amazon\u2019s mechanical turk", + "type": "inproceedings", + "year": "2010" + }, + "ravuri2019classification": { + "author": "Ravuri, Suman and Vinyals, Oriol", + "journal": "Advances in neural information processing systems", + "title": "Classification accuracy score for conditional generative models", + "type": "article", + "volume": "32", + "year": "2019" + }, + "ray2024cola": { + "author": "Ray, Arijit and Radenovic, Filip and Dubey, Abhimanyu and Plummer, Bryan and Krishna, Ranjay and Saenko, Kate", + "journal": "Advances in Neural Information Processing Systems", + "title": "cola: A Benchmark for Compositional Text-to-image Retrieval", + "type": "article", + "volume": "36", + "year": "2024" + }, + "reed2016generative": { + "author": "Reed, Scott and Akata, Zeynep and Yan, Xinchen and Logeswaran, Lajanugen and Schiele, Bernt and Lee, Honglak", + "booktitle": "International conference on machine learning", + "organization": "PMLR", + "pages": "1060--1069", + "title": "Generative adversarial text to image synthesis", + "type": "inproceedings", + "year": "2016" + }, + "reed2016learning": { + "author": "Reed, Scott E and Akata, Zeynep and Mohan, Santosh and Tenka, Samuel and Schiele, Bernt and Lee, Honglak", + "journal": "Advances in neural information processing systems", + "title": "Learning what and where to draw", + "type": "article", + "volume": "29", + "year": "2016" + }, + "reis2023real": { + "author": "Reis, Dillon and Kupec, Jordan and Hong, Jacqueline and Daoudi, Ahmad", + "journal": "arXiv preprint arXiv:2305.09972", + "title": "Real-time flying object detection with YOLOv8", + "type": "article", + "year": "2023" + }, + "roberts2022scaling": { + "archiveprefix": "arXiv", + "author": "Adam Roberts and Hyung Won Chung and Anselm Levskaya and Gaurav Mishra and James Bradbury and Daniel Andor and Sharan Narang and Brian Lester and Colin Gaffney and Afroz Mohiuddin and Curtis Hawthorne and Aitor Lewkowycz and Alex Salcianu and Marc van Zee and Jacob Austin and Sebastian Goodman and Livio Baldini Soares and Haitang Hu and Sasha Tsvyashchenko and Aakanksha Chowdhery and Jasmijn Bastings and Jannis Bulian and Xavier Garcia and Jianmo Ni and Andrew Chen and Kathleen Kenealy and Jonathan H. Clark and Stephan Lee and Dan Garrette and James Lee-Thorp and Colin Raffel and Noam Shazeer and Marvin Ritter and Maarten Bosma and Alexandre Passos and Jeremy Maitin-Shepard and Noah Fiedel and Mark Omernick and Brennan Saeta and Ryan Sepassi and Alexander Spiridonov and Joshua Newlan and Andrea Gesmundo", + "eprint": "2203.17189", + "primaryclass": "cs.LG", + "title": "Scaling Up Models and Data with $\\texttt{t5x}$ and $\\texttt{seqio}$", + "type": "misc", + "year": "2022" + }, + "rohrbach2016movie": { + "archiveprefix": "arXiv", + "author": "Anna Rohrbach and Atousa Torabi and Marcus Rohrbach and Niket Tandon and Christopher Pal and Hugo Larochelle and Aaron Courville and Bernt Schiele", + "eprint": "1605.03705", + "primaryclass": "cs.CV", + "title": "Movie Description", + "type": "misc", + "year": "2016" + }, + "saharia2022photorealistic": { + "author": "Saharia, Chitwan and Chan, William and Saxena, Saurabh and Li, Lala and Whang, Jay and Denton, Emily L and Ghasemipour, Kamyar and Gontijo Lopes, Raphael and Karagol Ayan, Burcu and Salimans, Tim and others", + "journal": "Advances in Neural Information Processing Systems", + "pages": "36479--36494", + "title": "Photorealistic text-to-image diffusion models with deep language understanding", + "type": "article", + "volume": "35", + "year": "2022" + }, + "sajjadi2018assessing": { + "author": "Sajjadi, Mehdi SM and Bachem, Olivier and Lucic, Mario and Bousquet, Olivier and Gelly, Sylvain", + "journal": "Advances in neural information processing systems", + "title": "Assessing generative models via precision and recall", + "type": "article", + "volume": "31", + "year": "2018" + }, + "schuhmann2022laion": { + "author": "Schuhmann, Christoph and Beaumont, Romain and Vencu, Richard and Gordon, Cade and Wightman, Ross and Cherti, Mehdi and Coombes, Theo and Katta, Aarush and Mullis, Clayton and Wortsman, Mitchell and others", + "journal": "Advances in Neural Information Processing Systems", + "pages": "25278--25294", + "title": "Laion-5b: An open large-scale dataset for training next generation image-text models", + "type": "article", + "volume": "35", + "year": "2022" + }, + "sharma2018conceptual": { + "author": "Sharma, Piyush and Ding, Nan and Goodman, Sebastian and Soricut, Radu", + "booktitle": "Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)", + "pages": "2556--2565", + "title": "Conceptual captions: A cleaned, hypernymed, image alt-text dataset for automatic image captioning", + "type": "inproceedings", + "year": "2018" + }, + "singh2023coarse": { + "author": "Singh, Harman and Zhang, Pengchuan and Wang, Qifan and Wang, Mengjiao and Xiong, Wenhan and Du, Jingfei and Chen, Yu", + "journal": "arXiv preprint arXiv:2305.13812", + "title": "Coarse-to-Fine Contrastive Learning in Image-Text-Graph Space for Improved Vision-Language Compositionality", + "type": "article", + "year": "2023" + }, + "singh2023divide": { + "author": "Singh, Jaskirat and Zheng, Liang", + "journal": "arXiv preprint arXiv:2307.04749", + "title": "Divide, Evaluate, and Refine: Evaluating and Improving Text-to-Image Alignment with Iterative VQA Feedback", + "type": "article", + "year": "2023" + }, + "suhr2017corpus": { + "author": "Suhr, Alane and Lewis, Mike and Yeh, James and Artzi, Yoav", + "booktitle": "Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)", + "pages": "217--223", + "title": "A corpus of natural language for visual reasoning", + "type": "inproceedings", + "year": "2017" + }, + "szegedy2015going": { + "author": "Szegedy, Christian and Liu, Wei and Jia, Yangqing and Sermanet, Pierre and Reed, Scott and Anguelov, Dragomir and Erhan, Dumitru and Vanhoucke, Vincent and Rabinovich, Andrew", + "booktitle": "Proceedings of the IEEE conference on computer vision and pattern recognition", + "pages": "1--9", + "title": "Going deeper with convolutions", + "type": "inproceedings", + "year": "2015" + }, + "szegedy2016inception": { + "author": "Szegedy, Christian and Vanhoucke, Vincent and Ioffe, Sergey and Shlens, Jon and Wojna, Zbigniew", + "booktitle": "Proceedings of the IEEE conference on computer vision and pattern recognition", + "pages": "2818--2826", + "title": "Rethinking the inception architecture for computer vision", + "type": "inproceedings", + "year": "2016" + }, + "tan2019lxmert": { + "author": "Tan, Hao and Bansal, Mohit", + "journal": "arXiv preprint arXiv:1908.07490", + "title": "Lxmert: Learning cross-modality encoder representations from transformers", + "type": "article", + "year": "2019" + }, + "wang-etal-2023-diffusiondb": { + "abstract": "\"With recent advancements in diffusion models, users can generate high-quality images by writing text prompts in natural language. However, generating images with desired details requires proper prompts, and it is often unclear how a model reacts to different prompts or what the best prompts are. To help researchers tackle these critical challenges, we introduce DiffusionDB, the first large-scale text-to-image prompt dataset totaling 6.5TB, containing 14 million images generated by Stable Diffusion, 1.8 million unique prompts, and hyperparameters specified by real users. We analyze the syntactic and semantic characteristics of prompts. We pinpoint specific hyperparameter values and prompt styles that can lead to model errors and present evidence of potentially harmful model usage, such as the generation of misinformation. The unprecedented scale and diversity of this human-actuated dataset provide exciting research opportunities in understanding the interplay between prompts and generative models, detecting deepfakes, and designing human-AI interaction tools to help users more easily use these models. DiffusionDB is publicly available at: \\url{https://poloclub.github.io/diffusiondb}.\",", + "address": "\"Toronto, Canada\",", + "author": "\"Wang, Zijie J. and Montoya, Evan and Munechika, David and Yang, Haoyang and Hoover, Benjamin and Chau, Duen Horng\",", + "booktitle": "\"Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)\",", + "doi": "\"10.18653/v1/2023.acl-long.51\",", + "editor": "\"Rogers, Anna and Boyd-Graber, Jordan and Okazaki, Naoaki\",", + "month": "jul,", + "pages": "\"893--911\",", + "publisher": "\"Association for Computational Linguistics\",", + "title": "\"{D}iffusion{DB}: A Large-scale Prompt Gallery Dataset for Text-to-Image Generative Models\",", + "type": "inproceedings", + "url": "\"https://aclanthology.org/2023.acl-long.51\",", + "year": "\"2023\"," + }, + "wang-gaizauskas-2015-generating": { + "address": "\"Brighton, UK\",", + "author": "\"Wang, Josiah and Gaizauskas, Robert\",", + "booktitle": "\"Proceedings of the 15th {E}uropean Workshop on Natural Language Generation ({ENLG})\",", + "doi": "\"10.18653/v1/W15-4722\",", + "editor": "\"Belz, Anya and Gatt, Albert and Portet, Fran{\\c{c}}ois and Purver, Matthew\",", + "month": "sep,", + "pages": "\"117--126\",", + "publisher": "\"Association for Computational Linguistics\",", + "title": "\"Generating Image Descriptions with Gold Standard Visual Inputs: Motivation, Evaluation and Baselines\",", + "type": "inproceedings", + "url": "\"https://aclanthology.org/W15-4722\",", + "year": "\"2015\"," + }, + "wang2003multiscale": { + "author": "Wang, Zhou and Simoncelli, Eero P and Bovik, Alan C", + "booktitle": "The Thrity-Seventh Asilomar Conference on Signals, Systems \\& Computers, 2003", + "organization": "Ieee", + "pages": "1398--1402", + "title": "Multiscale structural similarity for image quality assessment", + "type": "inproceedings", + "volume": "2", + "year": "2003" + }, + "wang2004image": { + "author": "Wang, Zhou and Bovik, Alan C and Sheikh, Hamid R and Simoncelli, Eero P", + "journal": "IEEE transactions on image processing", + "number": "4", + "pages": "600--612", + "publisher": "IEEE", + "title": "Image quality assessment: from error visibility to structural similarity", + "type": "article", + "volume": "13", + "year": "2004" + }, + "wang2023clipiqa": { + "author": "Wang, Jianyi and Chan, Kelvin CK and Loy, Chen Change", + "booktitle": "Proceedings of the AAAI Conference on Artificial Intelligence", + "number": "2", + "pages": "2555--2563", + "title": "Exploring clip for assessing the look and feel of images", + "type": "inproceedings", + "volume": "37", + "year": "2023" + }, + "wolff2023the": { + "author": "Max Wolff and Wieland Brendel and Stuart Wolff", + "booktitle": "ICLR 2023 Workshop on Mathematical and Empirical Understanding of Foundation Models", + "title": "The Independent Compositional Subspace Hypothesis for the Structure of {CLIP}'s Last Layer", + "type": "inproceedings", + "url": "https://openreview.net/forum?id", + "year": "2023" + }, + "wu2022grit": { + "author": "Wu, Jialian and Wang, Jianfeng and Yang, Zhengyuan and Gan, Zhe and Liu, Zicheng and Yuan, Junsong and Wang, Lijuan", + "journal": "arXiv preprint arXiv:2212.00280", + "title": "Grit: A generative region-to-text transformer for object understanding", + "type": "article", + "year": "2022" + }, + "xie2019visual": { + "archiveprefix": "arXiv", + "author": "Ning Xie and Farley Lai and Derek Doran and Asim Kadav", + "eprint": "1811.10582", + "primaryclass": "cs.CV", + "title": "Visual Entailment Task for Visually-Grounded Language Learning", + "type": "misc", + "year": "2019" + }, + "xu-etal-2023-metarevision": { + "address": "\"Singapore\",", + "author": "\"Xu, Guangyue and Kordjamshidi, Parisa and Chai, Joyce\",", + "booktitle": "\"Findings of the Association for Computational Linguistics: EMNLP 2023\",", + "doi": "\"10.18653/v1/2023.findings-emnlp.818\",", + "editor": "\"Bouamor, Houda and Pino, Juan and Bali, Kalika\",", + "month": "dec,", + "pages": "\"12224--12236\"", + "publisher": "\"Association for Computational Linguistics\",", + "title": "\"{M}eta{R}e{V}ision: Meta-Learning with Retrieval for Visually Grounded Compositional Concept Acquisition\",", + "type": "inproceedings", + "url": "\"https://aclanthology.org/2023.findings-emnlp.818\",", + "year": "\"2023\"," + }, + "xu2023imagereward": { + "author": "Xu, Jiazheng and Liu, Xiao and Wu, Yuchen and Tong, Yuxuan and Li, Qinkai and Ding, Ming and Tang, Jie and Dong, Yuxiao", + "journal": "arXiv preprint arXiv:2304.05977", + "title": "Imagereward: Learning and evaluating human preferences for text-to-image generation", + "type": "article", + "year": "2023" + }, + "yang2023diffusion": { + "author": "Yang, Ling and Zhang, Zhilong and Song, Yang and Hong, Shenda and Xu, Runsheng and Zhao, Yue and Zhang, Wentao and Cui, Bin and Yang, Ming-Hsuan", + "journal": "ACM Computing Surveys", + "number": "4", + "pages": "1--39", + "publisher": "ACM New York, NY, USA", + "title": "Diffusion models: A comprehensive survey of methods and applications", + "type": "article", + "volume": "56", + "year": "2023" + }, + "yarom2023seetrue": { + "archiveprefix": "arXiv", + "author": "Michal Yarom and Yonatan Bitton and Soravit Changpinyo and Roee Aharoni and Jonathan Herzig and Oran Lang and Eran Ofek and Idan Szpektor", + "eprint": "2305.10400", + "primaryclass": "cs.CL", + "title": "What You See is What You Read? Improving Text-Image Alignment Evaluation", + "type": "misc", + "year": "2023" + }, + "young2014flickr30k": { + "abstract": "\"We propose to use the visual denotations of linguistic expressions (i.e. the set of images they describe) to define novel denotational similarity metrics, which we show to be at least as beneficial as distributional similarities for two tasks that require semantic inference. To compute these denotational similarities, we construct a denotation graph, i.e. a subsumption hierarchy over constituents and their denotations, based on a large corpus of 30K images and 150K descriptive captions.\",", + "address": "\"Cambridge, MA\",", + "author": "\"Young, Peter and Lai, Alice and Hodosh, Micah and Hockenmaier, Julia\",", + "doi": "\"10.1162/tacl_a_00166\",", + "editor": "\"Lin, Dekang and Collins, Michael and Lee, Lillian\",", + "journal": "\"Transactions of the Association for Computational Linguistics\",", + "pages": "\"67--78\",", + "publisher": "\"MIT Press\",", + "title": "\"From image descriptions to visual denotations: New similarity metrics for semantic inference over event descriptions\",", + "type": "article", + "url": "\"https://aclanthology.org/Q14-1006\",", + "volume": "\"2\",", + "year": "\"2014\"," + }, + "young2014image": { + "author": "Young, Peter and Lai, Alice and Hodosh, Micah and Hockenmaier, Julia", + "journal": "Transactions of the Association for Computational Linguistics", + "pages": "67--78", + "publisher": "MIT Press One Rogers Street, Cambridge, MA 02142-1209, USA journals-info~\u2026", + "title": "From image descriptions to visual denotations: New similarity metrics for semantic inference over event descriptions", + "type": "article", + "volume": "2", + "year": "2014" + }, + "yuksekgonul2022and": { + "author": "Yuksekgonul, Mert and Bianchi, Federico and Kalluri, Pratyusha and Jurafsky, Dan and Zou, James", + "booktitle": "The Eleventh International Conference on Learning Representations", + "title": "When and Why Vision-Language Models Behave like Bags-Of-Words, and What to Do About It?", + "type": "inproceedings", + "year": "2022" + }, + "zelaszczyk2024text": { + "author": "{\\.Z}elaszczyk, Maciej and Ma{\\'n}dziuk, Jacek", + "journal": "arXiv preprint arXiv:2401.11631", + "title": "Text-to-Image Cross-Modal Generation: A Systematic Review", + "type": "article", + "year": "2024" + }, + "zhang2011fsim": { + "author": "Zhang, Lin and Zhang, Lei and Mou, Xuanqin and Zhang, David", + "journal": "IEEE transactions on Image Processing", + "number": "8", + "pages": "2378--2386", + "publisher": "IEEE", + "title": "FSIM: A feature similarity index for image quality assessment", + "type": "article", + "volume": "20", + "year": "2011" + }, + "zhang2018unreasonable": { + "author": "Zhang, Richard and Isola, Phillip and Efros, Alexei A and Shechtman, Eli and Wang, Oliver", + "booktitle": "Proceedings of the IEEE conference on computer vision and pattern recognition", + "pages": "586--595", + "title": "The unreasonable effectiveness of deep features as a perceptual metric", + "type": "inproceedings", + "year": "2018" + }, + "zhang2022perceptual": { + "author": "Zhang, Lingzhi and Zhou, Yuqian and Barnes, Connelly and Amirghodsi, Sohrab and Lin, Zhe and Shechtman, Eli and Shi, Jianbo", + "booktitle": "European Conference on Computer Vision", + "organization": "Springer", + "pages": "146--164", + "title": "Perceptual artifacts localization for inpainting", + "type": "inproceedings", + "year": "2022" + }, + "zhang2023perceptual": { + "author": "Zhang, Lingzhi and Xu, Zhengjie and Barnes, Connelly and Zhou, Yuqian and Liu, Qing and Zhang, He and Amirghodsi, Sohrab and Lin, Zhe and Shechtman, Eli and Shi, Jianbo", + "booktitle": "Proceedings of the IEEE/CVF International Conference on Computer Vision", + "pages": "7579--7590", + "title": "Perceptual Artifacts Localization for Image Synthesis Tasks", + "type": "inproceedings", + "year": "2023" + }, + "zhang2023spot": { + "author": "Zhang, Gengyuan and Bi, Jinhe and Gu, Jindong and Tresp, Volker", + "journal": "arXiv preprint arXiv:2311.12919", + "title": "SPOT! Revisiting Video-Language Models for Event Understanding", + "type": "article", + "year": "2023" + }, + "zhang2023texttoimage": { + "archiveprefix": "arXiv", + "author": "Chenshuang Zhang and Chaoning Zhang and Mengchun Zhang and In So Kweon", + "eprint": "2303.07909", + "primaryclass": "cs.CV", + "title": "Text-to-image Diffusion Models in Generative AI: A Survey", + "type": "misc", + "year": "2023" + }, + "zhao-etal-2022-explainable": { + "address": "\"Abu Dhabi, UAE\",", + "author": "\"Zhao, Tiancheng and Zhang, Tianqi and Zhu, Mingwei and Shen, Haozhan and Lee, Kyusong and Lu, Xiaopeng and Yin, Jianwei\",", + "booktitle": "\"Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing: System Demonstrations\",", + "doi": "\"10.18653/v1/2022.emnlp-demos.4\",", + "editor": "\"Che, Wanxiang and Shutova, Ekaterina\",", + "month": "dec,", + "pages": "\"30--37\"", + "publisher": "\"Association for Computational Linguistics\",", + "title": "\"An Explainable Toolbox for Evaluating Pre-trained Vision-Language Models\",", + "type": "inproceedings", + "url": "\"https://aclanthology.org/2022.emnlp-demos.4\",", + "year": "\"2022\"," + }, + "zhu2023contrastive": { + "author": "Zhu, Xiangru and Sun, Penglei and Wang, Chengyu and Liu, Jingping and Li, Zhixu and Xiao, Yanghua and Huang, Jun", + "journal": "arXiv preprint arXiv:2312.02338", + "title": "A Contrastive Compositional Benchmark for Text-to-Image Synthesis: A Study with Unified Text-to-Image Fidelity Metrics", + "type": "article", + "year": "2023" + } +}; \ No newline at end of file diff --git a/survis/data/papers_img/.gitkeep b/survis/data/papers_img/.gitkeep new file mode 100644 index 0000000000000000000000000000000000000000..e69de29bb2d1d6434b8b29ae775ad8c2e48c5391 diff --git a/survis/data/papers_img/Beck2016Visual.png b/survis/data/papers_img/Beck2016Visual.png new file mode 100644 index 0000000000000000000000000000000000000000..9262ccae3bf091a3703078107558a2b6765b2a5e Binary files /dev/null and b/survis/data/papers_img/Beck2016Visual.png differ diff --git a/survis/data/papers_pdf/.gitkeep b/survis/data/papers_pdf/.gitkeep new file mode 100644 index 0000000000000000000000000000000000000000..e69de29bb2d1d6434b8b29ae775ad8c2e48c5391 diff --git a/survis/data/search_stopwords.js b/survis/data/search_stopwords.js new file mode 100644 index 0000000000000000000000000000000000000000..d735c5a7eaa35e2da23eeae5ffe77a6c1bbb42ef --- /dev/null +++ b/survis/data/search_stopwords.js @@ -0,0 +1 @@ +const userDefinedStopwords = ['a', 'about', 'above', 'above', 'across', 'after', 'afterwards', 'again', 'against', 'all', 'almost', 'alone', 'along', 'already', 'also', 'although', 'always', 'am', 'among', 'amongst', 'amoungst', 'amount', 'an', 'and', 'another', 'any', 'anyhow', 'anyone', 'anything', 'anyway', 'anywhere', 'are', 'around', 'as', 'at', 'back', 'be', 'became', 'because', 'become', 'becomes', 'becoming', 'been', 'before', 'beforehand', 'behind', 'being', 'below', 'beside', 'besides', 'between', 'beyond', 'bill', 'both', 'bottom', 'but', 'by', 'call', 'can', 'cannot', 'cant', 'co', 'con', 'could', 'couldnt', 'cry', 'de', 'describe', 'detail', 'do', 'done', 'down', 'due', 'during', 'each', 'eg', 'eight', 'either', 'eleven', 'else', 'elsewhere', 'empty', 'enough', 'etc', 'even', 'ever', 'every', 'everyone', 'everything', 'everywhere', 'except', 'few', 'fifteen', 'fify', 'fill', 'find', 'fire', 'first', 'five', 'for', 'former', 'formerly', 'forty', 'found', 'four', 'from', 'front', 'full', 'further', 'get', 'give', 'go', 'had', 'has', 'hasnt', 'have', 'he', 'hence', 'her', 'here', 'hereafter', 'hereby', 'herein', 'hereupon', 'hers', 'herself', 'him', 'himself', 'his', 'how', 'however', 'hundred', 'ie', 'if', 'in', 'inc', 'indeed', 'interest', 'into', 'is', 'it', 'its', 'itself', 'keep', 'last', 'latter', 'latterly', 'least', 'less', 'ltd', 'made', 'many', 'may', 'me', 'meanwhile', 'might', 'mill', 'mine', 'more', 'moreover', 'most', 'mostly', 'move', 'much', 'must', 'my', 'myself', 'name', 'namely', 'neither', 'never', 'nevertheless', 'next', 'nine', 'no', 'nobody', 'none', 'noone', 'nor', 'not', 'nothing', 'now', 'nowhere', 'of', 'off', 'often', 'on', 'once', 'one', 'only', 'onto', 'or', 'other', 'others', 'otherwise', 'our', 'ours', 'ourselves', 'out', 'over', 'own', 'part', 'per', 'perhaps', 'please', 'put', 'rather', 're', 'same', 'see', 'seem', 'seemed', 'seeming', 'seems', 'serious', 'several', 'she', 'should', 'show', 'side', 'since', 'sincere', 'six', 'sixty', 'so', 'some', 'somehow', 'someone', 'something', 'sometime', 'sometimes', 'somewhere', 'still', 'such', 'system', 'take', 'ten', 'than', 'that', 'the', 'their', 'them', 'themselves', 'then', 'thence', 'there', 'thereafter', 'thereby', 'therefore', 'therein', 'thereupon', 'these', 'they', 'thickv', 'thin', 'third', 'this', 'those', 'though', 'three', 'through', 'throughout', 'thru', 'thus', 'to', 'together', 'too', 'top', 'toward', 'towards', 'twelve', 'twenty', 'two', 'un', 'under', 'until', 'up', 'upon', 'us', 'very', 'via', 'was', 'we', 'well', 'were', 'what', 'whatever', 'when', 'whence', 'whenever', 'where', 'whereafter', 'whereas', 'whereby', 'wherein', 'whereupon', 'wherever', 'whether', 'which', 'while', 'whither', 'who', 'whoever', 'whole', 'whom', 'whose', 'why', 'will', 'with', 'within', 'without', 'would', 'yet', 'you', 'your', 'yours', 'yourself', 'yourselves', 'the']; \ No newline at end of file diff --git a/survis/data/tag_categories.js b/survis/data/tag_categories.js new file mode 100644 index 0000000000000000000000000000000000000000..93d0a9c1aec78eb7c159ba88a5a56036d8afc519 --- /dev/null +++ b/survis/data/tag_categories.js @@ -0,0 +1,5 @@ +const userDefinedTagCategories = { + "type": { + "description": "type of the paper" + } +} \ No newline at end of file diff --git a/survis/fonts/SIL Open Font License.txt b/survis/fonts/SIL Open Font License.txt new file mode 100644 index 0000000000000000000000000000000000000000..285ac9ee738b2db6ae7bdd1dccfca0ef495762a4 --- /dev/null +++ b/survis/fonts/SIL Open Font License.txt @@ -0,0 +1,44 @@ +Copyright (c) 2012, John Caserta (mail@johncaserta.com), +with Reserved Font Name Modern Pictograms. + +This Font Software is licensed under the SIL Open Font License, Version 1.1. +This license is copied below, and is also available with a FAQ at: http://scripts.sil.org/OFL + +----------------------------------------------------------- +SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007 +----------------------------------------------------------- + +PREAMBLE +The goals of the Open Font License (OFL) are to stimulate worldwide development of collaborative font projects, to support the font creation efforts of academic and linguistic communities, and to provide a free and open framework in which fonts may be shared and improved in partnership with others. + +The OFL allows the licensed fonts to be used, studied, modified and redistributed freely as long as they are not sold by themselves. The fonts, including any derivative works, can be bundled, embedded, redistributed and/or sold with any software provided that any reserved names are not used by derivative works. The fonts and derivatives, however, cannot be released under any other type of license. The requirement for fonts to remain under this license does not apply to any document created using the fonts or their derivatives. + +DEFINITIONS +"Font Software" refers to the set of files released by the Copyright Holder(s) under this license and clearly marked as such. This may include source files, build scripts and documentation. + +"Reserved Font Name" refers to any names specified as such after the copyright statement(s). + +"Original Version" refers to the collection of Font Software components as distributed by the Copyright Holder(s). + +"Modified Version" refers to any derivative made by adding to, deleting, or substituting -- in part or in whole -- any of the components of the Original Version, by changing formats or by porting the Font Software to a new environment. + +"Author" refers to any designer, engineer, programmer, technical writer or other person who contributed to the Font Software. + +PERMISSION & CONDITIONS +Permission is hereby granted, free of charge, to any person obtaining a copy of the Font Software, to use, study, copy, merge, embed, modify, redistribute, and sell modified and unmodified copies of the Font Software, subject to the following conditions: + +1) Neither the Font Software nor any of its individual components, in Original or Modified Versions, may be sold by itself. + +2) Original or Modified Versions of the Font Software may be bundled, redistributed and/or sold with any software, provided that each copy contains the above copyright notice and this license. These can be included either as stand-alone text files, human-readable headers or in the appropriate machine-readable metadata fields within text or binary files as long as those fields can be easily viewed by the user. + +3) No Modified Version of the Font Software may use the Reserved Font Name(s) unless explicit written permission is granted by the corresponding Copyright Holder. This restriction only applies to the primary font name as presented to the users. + +4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font Software shall not be used to promote, endorse or advertise any Modified Version, except to acknowledge the contribution(s) of the Copyright Holder(s) and the Author(s) or with their explicit written permission. + +5) The Font Software, modified or unmodified, in part or in whole, must be distributed entirely under this license, and must not be distributed under any other license. The requirement for fonts to remain under this license does not apply to any document created using the Font Software. + +TERMINATION +This license becomes null and void if any of the above conditions are not met. + +DISCLAIMER +THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM OTHER DEALINGS IN THE FONT SOFTWARE. \ No newline at end of file diff --git a/survis/fonts/modernpics-webfont.eot b/survis/fonts/modernpics-webfont.eot new file mode 100644 index 0000000000000000000000000000000000000000..87f003bf52512b36cace2c6f6b89ea8e51e320b4 Binary files /dev/null and b/survis/fonts/modernpics-webfont.eot differ diff --git a/survis/fonts/modernpics-webfont.svg b/survis/fonts/modernpics-webfont.svg new file mode 100644 index 0000000000000000000000000000000000000000..f45d02c4b8043c88c79d57bb1ad42f3cdc5e9ca8 --- /dev/null +++ b/survis/fonts/modernpics-webfont.svg @@ -0,0 +1,134 @@ + + + \ No newline at end of file diff --git a/survis/fonts/modernpics-webfont.ttf b/survis/fonts/modernpics-webfont.ttf new file mode 100644 index 0000000000000000000000000000000000000000..d05cd051dcad003e6ea63f9dbf5ca00ebc3c7c3a Binary files /dev/null and b/survis/fonts/modernpics-webfont.ttf differ diff --git a/survis/fonts/modernpics-webfont.woff b/survis/fonts/modernpics-webfont.woff new file mode 100644 index 0000000000000000000000000000000000000000..e250eaf44de1c564d972b34d964f46cb8ba56b4b Binary files /dev/null and b/survis/fonts/modernpics-webfont.woff differ diff --git a/survis/fonts/modernpics.otf b/survis/fonts/modernpics.otf new file mode 100644 index 0000000000000000000000000000000000000000..caa872e85c78c7d01ce867ab6035a4cfdb4e1a59 Binary files /dev/null and b/survis/fonts/modernpics.otf differ diff --git a/survis/index.html b/survis/index.html new file mode 100644 index 0000000000000000000000000000000000000000..01dffb2362b99725a84756abbd1f64a9380988de --- /dev/null +++ b/survis/index.html @@ -0,0 +1,41 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/survis/js/bib.js b/survis/js/bib.js new file mode 100644 index 0000000000000000000000000000000000000000..35f5ca566786a6cd1269b215a4775c36774168b9 --- /dev/null +++ b/survis/js/bib.js @@ -0,0 +1,357 @@ +const bib = (function () { + + var entries = readBibtex(); + if (!entries || Object.keys(entries).length === 0) { + if (!electron) { + entries = generatedBibEntries; + } else { + console.error('Could not load bibliography: unknown reason. Please check if file is UTF8 encoded.'); + } + } + + return { + entries: entries, + availablePdf: electron ? [] : availablePdf, + availableImg: electron ? [] : availableImg, + stopwords: userDefinedStopwords, + tagCategories: electron ? generateTagCategoriesFromKeywords(entries) : userDefinedTagCategories, + authorizedTags: userDefinedAuthorizedTags, + entryDivs: {}, + warnings: warnings.computeAllWarnings(entries), + nVisibleEntries: 20, + + downloadBibtex: function () { + var blob = new Blob([this.createAllBibtex(true)]); + window.saveAs(blob, 'references.bib'); + }, + + createBibtex: function (id, entry) { + var bibtex = '@' + entry['type'] + '{' + id; + for (var fieldName in entry) { + if (fieldName == 'type' || isFieldForbidden(fieldName)) { + continue; + } + if (entry.hasOwnProperty(fieldName)) { + bibtex += ",\n " + fieldName + " = {" + entry[fieldName] + "}"; + } + } + if (typeof mandatoryFields != 'undefined' && mandatoryFields) { + for (var i in mandatoryFields[entry["type"]]) { + if (!entry.hasOwnProperty(mandatoryFields[entry["type"]][i])) { + bibtex += ",\n " + mandatoryFields[entry["type"]][i] + " = {}"; + } + } + } + return bibtex + "\n}"; + }, + + createCitation: function (id) { + var bib = this; + var citation = ''; + if (bib.parsedEntries[id]['author']) { + $.each(bib.parsedEntries[id]['author'], function (i, author) { + var authorSplit = author.split(', '); + if (authorSplit.length == 2) { + author = authorSplit[0] + ', ' + authorSplit[1].replace(/[^a-z -]/gi, '').replace(/\B\w*/g, '.').replace(/([A-Z])($|([ -]))/g, '$1.$3'); + } + if (i == bib.parsedEntries[id]['author'].length - 1 && i > 0) { + citation += 'and '; + } + citation += latexUtil.latexToHtml(author); + if (bib.parsedEntries[id]['author'].length > 2 || i > 0) { + citation += ', '; + } else { + citation += ' '; + } + }); + } + var year = bib.entries[id]['year']; + if (year) { + citation += year + '. '; + } + if (title = bib.entries[id]['title']) { + citation += latexUtil.latexToHtml(title) + '. '; + } + var journal = bib.entries[id]['journal']; + var pages = bib.entries[id]['pages']; + if (journal) { + citation += 'In ' + latexUtil.latexToHtml(journal) + ''; + var volume = bib.entries[id]['volume']; + if (volume) { + citation += ' (Vol. ' + latexUtil.latexToHtml(volume); + var number = bib.entries[id]['number']; + if (number) { + citation += ', No. ' + latexUtil.latexToHtml(number); + } + if (pages) { + citation += ', pp. ' + latexUtil.latexToHtml(pages); + } + citation += ')'; + } + citation += '. '; + } + var booktitle = bib.entries[id]['booktitle']; + if (booktitle) { + citation += 'In ' + latexUtil.latexToHtml(booktitle) + ''; + if (pages) { + citation += ' (pp. ' + latexUtil.latexToHtml(pages) + ')'; + } + citation += '. '; + } + var doi = bib.entries[id]['doi']; + var url = bib.entries[id]['url']; + if (doi) { + citation += 'DOI: ' + doi + '. '; + } else if (url) { + citation += 'URL: ' + url + '. '; + } + return citation.trim(); + }, + + createAllBibtex: function (filtered) { + var bib = this; + var bibtexString = ''; + const selectedEntries = filtered ? bib.filteredEntries : bib.entries; + $.each(selectedEntries, function (id, entry) { + var currentBibtex = ""; + if (bib.entryDivs[id]) { + bib.entryDivs[id].find(".CodeMirror-code").children().each(function () { + currentBibtex += $(this).text() + "\n"; + }); + } + if (!currentBibtex) { + currentBibtex = bib.createBibtex(id, entry); + } + bibtexString += currentBibtex; + bibtexString += "\n\n"; + }); + return bibtexString; + }, + + saveBibToFile: function () { + require('electron').remote.getGlobal('sharedObject').bibData = this.createAllBibtex(false); + const ipc = require('electron').ipcRenderer; + ipc.send('saveFile'); + page.notify('File saved.'); + }, + + saveBibToLocalStorage: function () { + if (editable) { + localStorage.bibtexString = this.createAllBibtex(false); + } + }, + + addEntries: function () { + var bib = this; + var addEntriesDiv = $('