{"title":"Feature Flow Animation","authors":"Daying Lu, Yao Ge, Jiancheng Ni","doi":"10.1145/3356422.3356428","DOIUrl":"https://doi.org/10.1145/3356422.3356428","url":null,"abstract":"Existing feature flow animation techniques do not address texture aliasing or distortion when a critical point moves along some designated path. In this paper, we provide a smooth feature flow animation for planar domains. Feature flow behaviors are clearly shown through smooth animation achieved by configuring critical points and constructing spatio-temporal coherent patterns. Critical points can be seeded at any position in the flow domain. We partition the flow space into regions with Voronoi tessellation and construct the flow pattern in each region. When one critical point moves, we add the original vector field to the dynamic vector field, optimize the vector values at the boundary, and update flow patterns over time. Experiments demonstrate that our method can effectively address texture aliasing or distortion in feature flow animation.","PeriodicalId":197051,"journal":{"name":"Proceedings of the 12th International Symposium on Visual Information Communication and Interaction","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121883063","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Daniel Limberger, W. Scheibel, J. Döllner, Matthias Trapp
{"title":"Advanced Visual Metaphors and Techniques for Software Maps","authors":"Daniel Limberger, W. Scheibel, J. Döllner, Matthias Trapp","doi":"10.1145/3356422.3356444","DOIUrl":"https://doi.org/10.1145/3356422.3356444","url":null,"abstract":"Software maps provide a general-purpose interactive user interface and information display for software analytics tools. This paper systematically introduces and classifies software maps as a treemap-based technique for software cartography. It provides an overview of advanced visual metaphors and techniques, each suitable for interactive visual analytics tasks, that can be used to enhance the expressiveness of software maps. Thereto, the metaphors and techniques are briefly described, located within a visualization pipeline model, and considered within the software map design space. Consequent applications and use cases w.r.t. different types of software system data and software engineering data are discussed, arguing for a versatile use of software maps in visual software analytics.","PeriodicalId":197051,"journal":{"name":"Proceedings of the 12th International Symposium on Visual Information Communication and Interaction","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123336996","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Design and Implementation of a Dynamic Map Template Based on Rule Combination","authors":"Li Xu, Xiaohui Chen, Mengting Sun, Huanxin Chen","doi":"10.1145/3356422.3356432","DOIUrl":"https://doi.org/10.1145/3356422.3356432","url":null,"abstract":"According to the fact that the function of existing map templates is difficult to extend and the control is not flexible enough, a dynamic map template based on combination of cartographic rules was designed. First of all, according to the characteristics of cartography, the cartographic rules contained in each cartographic link were summarized, and then the dynamic map template applied to the whole cartographic process was designed by using cartographic rules as the basic unit, and finally through converting the user's cartographic operations into the cartographic rules and the organic combination of cartographic rules, a dynamic map template was constructed. Compared with the traditional map template, the dynamic map template has strong hierarchical and scalability, which helps to simplify the cartographic process and ensure the scientificity of the user's actions.","PeriodicalId":197051,"journal":{"name":"Proceedings of the 12th International Symposium on Visual Information Communication and Interaction","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130537295","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Visually Communicating Mathematical Knot Deformation","authors":"Juan Lin, Hui Zhang","doi":"10.1145/3356422.3356438","DOIUrl":"https://doi.org/10.1145/3356422.3356438","url":null,"abstract":"Mathematical knots are different from everyday ropes in that they are infinitely stretchy and flexible when being deformed into their ambient isotopic. For this reason, a number of challenges arise when visualizing mathematical knot's static and changing structures during topological deformation. In this paper we focus on computational methods to visually communicate the mathematical knot's dynamics by computationally simulating the topological deformation and capturing the critical changes during the entire simulation. To further improve our visual experience, we propose a fast and adaptive method to extract key moments where only critical changes occur to represent and summarize the long deformation sequence. We conduct evaluation study to showcase the efficacy and efficiency of our methods.","PeriodicalId":197051,"journal":{"name":"Proceedings of the 12th International Symposium on Visual Information Communication and Interaction","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129536386","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Towards Utilizing Domain Expertise for Exploratory Data Analysis","authors":"Tristan Langer, Tobias Meisen","doi":"10.1145/3356422.3356434","DOIUrl":"https://doi.org/10.1145/3356422.3356434","url":null,"abstract":"In exploratory data analysis, domain knowledge and experience play a central role in order to extract information from the data and to derive proof and knowledge. However, experienced domain experts are rarely the same people who carry out the data analyses. Therefore, utilizing domain expertise for guidance in analytic processes is a complex challenge. In recent years, machine learning has seen great advances. Increasing processing power and growth in data as well as affordable storage have led to more advanced algorithms. Therefore, with the emergence of applicable machine learning algorithms, there is now a method for preserving and making use even of complex knowledge. In this paper, we present a concept that allows to extract and utilize domain knowledge for exploratory data analysis. We introduce concepts of interaction store and analysis context store to record user interaction and context during an exploratory analysis. We use the recorded data to construct semantic interaction sequences and predict their potential insight. The prediction can then be used to guide other data scientist in their sensemaking while performing exploratory data analysis in similar domains and use cases. Furthermore, we discuss possible research opportunities and implications resulting from the presented concept.","PeriodicalId":197051,"journal":{"name":"Proceedings of the 12th International Symposium on Visual Information Communication and Interaction","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125162681","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Visualizing Dynamic Network via Sampled Massive Sequence View","authors":"Ying Zhao, Wenjiang Chen, Yanmin She, Qing Wu, Yanni Peng, Xiaoping Fan","doi":"10.1145/3356422.3356454","DOIUrl":"https://doi.org/10.1145/3356422.3356454","url":null,"abstract":"Massive Sequence View(MSV) is an important timeline-based technique for dynamic network visualization. However, it often suffers from severe visual clutter when limited screen space holds excessive network edges. Inspired by the use of graph sampling in static graph analysis, we propose to utilize graph sampling to reduce visual clutter in MSV. An edge sampling method based on accept-reject random sampling is designed for visualizing dynamic network via MSV. The method is able to improve the overall readability of MSV while preserving time varying network behaviors. It is also a preliminary attempt to apply graph-sampling technique into dynamic network analysis.","PeriodicalId":197051,"journal":{"name":"Proceedings of the 12th International Symposium on Visual Information Communication and Interaction","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126331664","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Revealing Travel Patterns from Dockless Bike-sharing Data Based on Tensor Decomposition","authors":"Hao Tang, Sixiang Fei, Xiaoying Shi","doi":"10.1145/3356422.3356440","DOIUrl":"https://doi.org/10.1145/3356422.3356440","url":null,"abstract":"Dockless bike-sharing system has dramatically increased around the world since 2015, with the advantage of \"free to leave\" and \"no fixed berth\". Understanding the users' travel behavior is invaluable for policy makers and related companies. However, it is difficult to capture the spatio-temporal cycling patterns based on sparse bike-sharing data. In this paper, we analyze the dockless bike-sharing data using tensor decomposition method. A three-dimensional tensor is constructed first, and a tensor decomposition method is employed to detect the underlying travel patterns. Several visual components are designed to show the extracted patterns. The results demonstrate the effectiveness of our method.","PeriodicalId":197051,"journal":{"name":"Proceedings of the 12th International Symposium on Visual Information Communication and Interaction","volume":"272 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131610608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Streamline Distribution Method based on Vector-magnitude-aware Entropy","authors":"Yumeng Guo, Wenke Wang, Sikun Li","doi":"10.1145/3356422.3356442","DOIUrl":"https://doi.org/10.1145/3356422.3356442","url":null,"abstract":"Streamline is widely used in flow field visualization. Information-theoretic streamline distribution method performs well on demonstrating feature regions but only considers the direction component of vector. Our algorithm places streamlines based on information entropy calculated by both vector direction and vector magnitude, to cover more information of the flow field. By considering vector magnitude, the initial streamlines derived from entropy and supplementary streamlines derived from conditional entropy can convey the steepness of speed variation. An advanced streamline pruning method is also applied to improve the efficiency of our algorithm. Results prove that the streamlines produced by our algorithm can reflect the vector magnitude variation of a flow field without losing sight of the salient features.","PeriodicalId":197051,"journal":{"name":"Proceedings of the 12th International Symposium on Visual Information Communication and Interaction","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123272233","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Automatic Driving of End-to-end Convolutional Neural Network Based on MobileNet-V2 Migration Learning","authors":"Minghong Hu, Hui Guo, Xuyuan Ji","doi":"10.1145/3356422.3356458","DOIUrl":"https://doi.org/10.1145/3356422.3356458","url":null,"abstract":"Convolutional neural network is gradually mature, followed by the arrival of 5G era, autonomous driving will become a development hotspot. MobileNet is a Convolutional Neural Network used depthwise separable convolutions to decrease parameters so that the devices with limited resources can use it to complete image recognition. In this paper, we use MobileNet-V2 migration learning improvement to simulate automatic driving steering on embedded devices. In this experiment, in our data set, we compared Nvidia end-to-end automated driving network with our migration learning neural network based on MobileNet-V2 end-to-end convolution. The improved MobileNet-V2 network can works on raspberries pi only has CPU faster and real-time prediction to keep in the lane line, ensure the model to reduce the number of parameter at the same time, the identification error decreases.","PeriodicalId":197051,"journal":{"name":"Proceedings of the 12th International Symposium on Visual Information Communication and Interaction","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115647473","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Online dynamic graph drawing with inverse Markov analysis","authors":"Shiying Sheng, Xiaoju Dong, Chunyuan Wu","doi":"10.1145/3356422.3356448","DOIUrl":"https://doi.org/10.1145/3356422.3356448","url":null,"abstract":"In online dynamic graph drawing, constraints over nodes and node pairs help preserve a coherent mental map in a sequence of graphs. Defining the constraints is challenging due to the requirements of both preserving mental map and satisfying the visual aesthetics of a graph layout. Most existing algorithms basically depend on local changes but fail to do proper evaluations on the global propagation when setting constraints. To solve this problem, we introduce a heuristic model derived from PageRank which simulates the node movement as an inverse Markov process hence to give a global analysis of the layout's change, according to which different constraints can be set. These constraints, along with stress function, generate layouts maintaining spatial positions and shapes of relatively stable substructures between adjacent graphs. Experiments demonstrate that our method preserves both structure and position similarity to help users track graph changes visually.","PeriodicalId":197051,"journal":{"name":"Proceedings of the 12th International Symposium on Visual Information Communication and Interaction","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133396931","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}