{"title":"Evaluation of progressive treemaps to convey tree and node properties","authors":"R. Rosenbaum, B. Hamann","doi":"10.1117/12.907581","DOIUrl":"https://doi.org/10.1117/12.907581","url":null,"abstract":"In this paper, we evaluate progressive treemaps (PTMs). Progressive refinement has a long tradition in image \u0000communication, but is a novel approach for information presentation. Besides technical benefits it also promises \u0000to provide advantages important for the conveyance of data properties. In this first user study in this domain, we \u0000focus on the additional value of progressive refinement for traditional treemaps to convey the topology of a given \u0000hierarchical data set and properties of its nodes. To achieve this, we compare the results gained for common \u0000squarified treemap displays with and without progression for various related tasks and set-ups. The results we \u0000obtained indicate that PTMs allow for a better conveyance of topological features and node properties in most \u0000set-ups. We also assessed the opinions of our study participants and found that PTMs also lead to a better \u0000confidence about the given answers and provide more assistance and user friendliness.","PeriodicalId":89305,"journal":{"name":"Visualization and data analysis","volume":"1 1","pages":"82940F"},"PeriodicalIF":0.0,"publicationDate":"2012-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80372202","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}
M. Hao, Christian Rohrdantz, H. Janetzko, D. Keim, U. Dayal, L. Haug, M. Hsu
{"title":"Integrating sentiment analysis and term associations with geo-temporal visualizations on customer feedback streams","authors":"M. Hao, Christian Rohrdantz, H. Janetzko, D. Keim, U. Dayal, L. Haug, M. Hsu","doi":"10.1117/12.912202","DOIUrl":"https://doi.org/10.1117/12.912202","url":null,"abstract":"Twitter currently receives over 190 million tweets (small text-based Web posts) and manufacturing companies receive over 10 \u0000thousand web product surveys a day, in which people share their thoughts regarding a wide range of products and their features. A \u0000large number of tweets and customer surveys include opinions about products and services. However, with Twitter being a relatively \u0000new phenomenon, these tweets are underutilized as a source for determining customer sentiments. To explore high-volume customer \u0000feedback streams, we integrate three time series-based visual analysis techniques: (1) feature-based sentiment analysis that extracts, \u0000measures, and maps customer feedback; (2) a novel idea of term associations that identify attributes, verbs, and adjectives frequently \u0000occurring together; and (3) new pixel cell-based sentiment calendars, geo-temporal map visualizations and self-organizing maps to \u0000identify co-occurring and influential opinions. We have combined these techniques into a well-fitted solution for an effective analysis \u0000of large customer feedback streams such as for movie reviews (e.g., Kung-Fu Panda) or web surveys (buyers).","PeriodicalId":89305,"journal":{"name":"Visualization and data analysis","volume":"37 1","pages":"82940H"},"PeriodicalIF":0.0,"publicationDate":"2012-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74937921","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":"Animating streamlines with repeated asymmetric patterns for steady flow visualization","authors":"Chih-Kuo Yeh, Zhanping Liu, Tong-Yee Lee","doi":"10.1117/12.911968","DOIUrl":"https://doi.org/10.1117/12.911968","url":null,"abstract":"Animation provides intuitive cueing for revealing essential spatial-temporal features of data in scientific visualization. This paper explores the design of Repeated Asymmetric Patterns (RAPs) in animating evenly-spaced color-mapped streamlines for dense accurate visualization of complex steady flows. We present a smooth cyclic variable-speed RAP animation model that performs velocity (magnitude) integral luminance transition on streamlines. This model is extended with inter-streamline synchronization in luminance varying along the tangential direction to emulate orthogonal advancing waves from a geometry-based flow representation, and then with evenly-spaced hue differing in the orthogonal direction to construct tangential flow streaks. To weave these two mutually dual sets of patterns, we propose an energy-decreasing strategy that adopts an iterative yet efficient procedure for determining the luminance phase and hue of each streamline in HSL color space. We also employ adaptive luminance interleaving in the direction perpendicular to the flow to increase the contrast between streamlines.","PeriodicalId":89305,"journal":{"name":"Visualization and data analysis","volume":"24 1","pages":"82940R"},"PeriodicalIF":0.0,"publicationDate":"2012-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73078598","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":"Vortex core detection: back to basics","authors":"A. V. Gelder","doi":"10.1117/12.912301","DOIUrl":"https://doi.org/10.1117/12.912301","url":null,"abstract":"Analyzing vortices in fluid flows is an important and extensively studied problem. Visualization methods are an important tool, and vortex cores, including vortex-core axes, are frequently objects for which visualization is attempted. A robust definition of vortex-core axis has eluded researchers for a decade. This paper reviews the criteria described in some early papers, as well as recent papers that concentrate on issues of unsteady flows, and attempts to build on their ideas. In particular, researchers have proposed criteria that are desirable for a vortex-core axis that correspond to nonlocal properties, yet current extraction methods are all based on local properties. Analysis is presented to support the thesis that inaccuracies observed in some popular early methods are due to a mixture of frequencies in the flow field in vortical regions. Such mixtures occur in steady flows, as well as unsteady (time-varying) flows. Thus, the fact that the flows are unsteady is not necessarily the primary reason for inaccuracies recently observed in vortex analysis of such flows. It is hypothesized that time-varying (unsteady) flows tend to be more complex, hence tend to have mixed frequencies more often than steady flows. We further conjecture that an \"effective\" lack of Galilean invariance may occur in steady or unsteady flows, due to the interaction of low frequencies with high frequencies.","PeriodicalId":89305,"journal":{"name":"Visualization and data analysis","volume":"130 1","pages":"829413"},"PeriodicalIF":0.0,"publicationDate":"2012-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83242594","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":"Efficient, dynamic data visualization with persistent data structures","authors":"Joseph A. Cottam, A. Lumsdaine","doi":"10.1117/12.909581","DOIUrl":"https://doi.org/10.1117/12.909581","url":null,"abstract":"Working with data that is changing while it is being worked on, so called \"dynamic data\", presents unique \u0000challenges to a visualization and analysis framework. In particular, making rendering and analysis mutually exclusive \u0000can quickly lead to either livelock in the analysis, unresponsive visuals or incorrect results. A framework's \u0000data store is a common point of contention that often drives the mutual exclusion. Providing safe, synchronous \u0000access to the data store eliminates the livelock scenarios and responsive visuals while maintaining result correctness. \u0000Persistent data structures are a technique for providing safe, synchronous access. They support safe, \u0000synchronous access by directly supporting multiple versions of the data structure with limited data duplication. \u0000With a persistent data structure, rendering acts on one version of the data structure while analysis updates \u0000another, effectively double-buffering the central data store. Pre-rendering work based on global state (such as \u0000scaling all values relative to the global maximum) is also efficiently treated if independently modified versions \u0000can be merged. The Stencil visualization system uses persistent data structures to achieve task-based parallelism \u0000between analysis, pre-rendering and rendering work with little synchronization overhead. With efficient \u0000persistent data structures, performance gains of several orders of magnitude are achieved.","PeriodicalId":89305,"journal":{"name":"Visualization and data analysis","volume":"12 1","pages":"82940X"},"PeriodicalIF":0.0,"publicationDate":"2012-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89460616","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":"A performance assessment on the effectiveness of digital image registration methods","authors":"S. Kacenjar, Bing Li, Alan Ostrow","doi":"10.1117/12.912087","DOIUrl":"https://doi.org/10.1117/12.912087","url":null,"abstract":"Digital Image Correlation (DIC) of time-sequenced-imagery (TSI) is a very popular method in the study of medical, \u0000material deformation, and electronic packaging. Its use in processing the before-and-after images provides critical \u0000information about the scene deformation and structural differences between the imagery. \u0000Several correlation methods for implementing DIC have been developed and will be compared in this study. Each of \u0000these methods offer distinct trades offs with respect to processing complexity and lock-in accuracy. \u0000There are several factors that influence the effectiveness of these methods to provide robust operation and strongly \u0000localized correlation peaks. These factors include; camera positional stability during the time of image acquisitions, \u0000deformation of the object under study, and measurement noise. In addition, the signatures that are captured during DIC \u0000can often times be amplified through preprocessing and thus potentially enhancing DIC performance. \u0000This paper examines the impacts on two of these factors (measurement noise and image digital sharpening) using four \u0000popular correlation methods that are often implemented in DIC analyses.","PeriodicalId":89305,"journal":{"name":"Visualization and data analysis","volume":"1 1","pages":"82940V"},"PeriodicalIF":0.0,"publicationDate":"2012-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83757498","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":"Visualization and analysis of 3D gene expression patterns in zebrafish using web services","authors":"D. Potikanond, F. Verbeek","doi":"10.1117/12.909810","DOIUrl":"https://doi.org/10.1117/12.909810","url":null,"abstract":"The analysis of patterns of gene expression patterns analysis plays an important role in developmental biology and \u0000molecular genetics. Visualizing both quantitative and spatio-temporal aspects of gene expression patterns together with \u0000referenced anatomical structures of a model-organism in 3D can help identifying how a group of genes are expressed at a \u0000certain location at a particular developmental stage of an organism. In this paper, we present an approach to provide an \u0000online visualization of gene expression data in zebrafish (Danio rerio) within 3D reconstruction model of zebrafish in \u0000different developmental stages. We developed web services that provide programmable access to the 3D reconstruction \u0000data and spatial-temporal gene expression data maintained in our local repositories. To demonstrate this work, we \u0000develop a web application that uses these web services to retrieve data from our local information systems. The web \u0000application also retrieve relevant analysis of microarray gene expression data from an external community resource; i.e. \u0000the ArrayExpress Atlas. All the relevant gene expression patterns data are subsequently integrated with the \u0000reconstruction data of the zebrafish atlas using ontology based mapping. The resulting visualization provides quantitative \u0000and spatial information on patterns of gene expression in a 3D graphical representation of the zebrafish atlas in a certain \u0000developmental stage. To deliver the visualization to the user, we developed a Java based 3D viewer client that can be \u0000integrated in a web interface allowing the user to visualize the integrated information over the Internet.","PeriodicalId":89305,"journal":{"name":"Visualization and data analysis","volume":"40 1","pages":"829412"},"PeriodicalIF":0.0,"publicationDate":"2012-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87969883","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":"An evaluation of rendering and interactive methods for volumetric data exploration in virtual reality environments","authors":"Nan Wang, Alexis Paljic, P. Fuchs","doi":"10.1117/12.912312","DOIUrl":"https://doi.org/10.1117/12.912312","url":null,"abstract":"In this paper we evaluate one interaction method and four display techniques for exploring volumetric datasets \u0000in virtual reality immersive environments. We propose an approach based on the display of a subset of the \u0000volumetric data, as isosurfaces, and an interactive manipulation of the isosurfaces to allow the user to look for \u0000local feature in the datasets. We also studied the influence of four different rendering techniques for isosurface \u0000rendering in a virtual reality system. The study is based on a search and point task in a 3D temperature \u0000field. User precision, task completion time and user movement were evaluated during the test. The study \u0000allowed to choose the most suitable rendering mode for isosurface representation, and provided guidelines for \u0000data exploration tasks in immersive environments.","PeriodicalId":89305,"journal":{"name":"Visualization and data analysis","volume":"37 1","pages":"82940W"},"PeriodicalIF":0.0,"publicationDate":"2012-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85888106","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":"Space/error tradeoffs for lossy wavelet reconstruction","authors":"John C. Frain, R. Bergeron","doi":"10.1117/12.907544","DOIUrl":"https://doi.org/10.1117/12.907544","url":null,"abstract":"Discrete Wavelet Transforms have proven to be a very effective tool for compressing large data sets. Previous \u0000research has sought to select a subset of wavelet coefficients based on a given space constraint. These approaches \u0000require non-negligible overhead to maintain location information associated with the retained coefficients. Our \u0000approach identifies entire wavelet coefficient subbands that can be eliminated based on minimizing the total error \u0000introduced into the reconstruction. We can get further space reduction (with more error) by encoding some or \u0000all of the saved coefficients as a byte index into a floating point lookup table. We demonstrate how our approach \u0000can yield the same global sum error using less space than traditional MR implementations.","PeriodicalId":89305,"journal":{"name":"Visualization and data analysis","volume":"88 1","pages":"82940J"},"PeriodicalIF":0.0,"publicationDate":"2012-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81202354","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}
Byungil Jeong, P. Navrátil, K. Gaither, G. Abram, Gregory P. Johnson
{"title":"Configurable data prefetching scheme for interactive visualization of large-scale volume data","authors":"Byungil Jeong, P. Navrátil, K. Gaither, G. Abram, Gregory P. Johnson","doi":"10.1117/12.910926","DOIUrl":"https://doi.org/10.1117/12.910926","url":null,"abstract":"This paper presents a novel data prefetching and memory management scheme to support interactive visualization of \u0000large-scale volume datasets using GPU-based isosurface extraction. Our dynamic in-core approach uses a span-space \u0000lattice data structure to predict and prefetch the portions of a dataset that are required by isosurface queries, to manage an \u0000application-level volume data cache, and to ensure load-balancing for parallel execution. We also present a GPU \u0000memory management scheme that enhances isosurface extraction and rendering performance. With these techniques, we \u0000achieve rendering performance superior to other in-core algorithms while using dramatically fewer resources.","PeriodicalId":89305,"journal":{"name":"Visualization and data analysis","volume":"22 1","pages":"82940K"},"PeriodicalIF":0.0,"publicationDate":"2012-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73949585","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}