Integration-free Learning of Flow Maps

We present a method for learning neural representations of flow maps from time-varying vector field data. The flow map is pervasive within the area of flow visualization, as it is foundational to numerous visualization techniques, e.g. integral curve computation for pathlines or streaklines, as well as computing separation/attraction structures within the flow field. Yet bottlenecks in flow map computation, namely the numerical integration of vector fields, can easily inhibit their use within interactive visualization settings. In response, in our work we seek neural representations of flow maps that are efficient to evaluate, while remaining scalable to optimize, both in computation cost and data requirements. A key aspect of our approach is that we can frame the process of representation learning not in optimizing for samples of the flow map, but rather, a self-consistency criterion on flow map derivatives that eliminates the need for flow map samples, and thus numerical integration, altogether. Central to realizing this is a novel neural network design for flow maps, coupled with an optimization scheme, wherein our representation only requires the time-varying vector field for learning, encoded as instantaneous velocity. We show the benefits of our method over prior works in terms of accuracy and efficiency across a range of 2D and 3D time-varying vector fields, while showing how our neural representation of flow maps can benefit unsteady flow visualization techniques such as streaklines, and the finite-time Lyapunov exponent

Doctor of Philosophy

dissertationWith modern computational resources rapidly advancing towards exascale, large-scale simulations useful for understanding natural and man-made phenomena are becoming in- creasingly accessible. As a result, the size and complexity of data representing such phenom- ena are also increasing, making the role of data analysis to propel science even more integral. This dissertation presents research on addressing some of the contemporary challenges in the analysis of vector fields--an important type of scientific data useful for representing a multitude of physical phenomena, such as wind flow and ocean currents. In particular, new theories and computational frameworks to enable consistent feature extraction from vector fields are presented. One of the most fundamental challenges in the analysis of vector fields is that their features are defined with respect to reference frames. Unfortunately, there is no single ""correct"" reference frame for analysis, and an unsuitable frame may cause features of interest to remain undetected, thus creating serious physical consequences. This work develops new reference frames that enable extraction of localized features that other techniques and frames fail to detect. As a result, these reference frames objectify the notion of ""correctness"" of features for certain goals by revealing the phenomena of importance from the underlying data. An important consequence of using these local frames is that the analysis of unsteady (time-varying) vector fields can be reduced to the analysis of sequences of steady (time- independent) vector fields, which can be performed using simpler and scalable techniques that allow better data management by accessing the data on a per-time-step basis. Nevertheless, the state-of-the-art analysis of steady vector fields is not robust, as most techniques are numerical in nature. The residing numerical errors can violate consistency with the underlying theory by breaching important fundamental laws, which may lead to serious physical consequences. This dissertation considers consistency as the most fundamental characteristic of computational analysis that must always be preserved, and presents a new discrete theory that uses combinatorial representations and algorithms to provide consistency guarantees during vector field analysis along with the uncertainty visualization of unavoidable discretization errors. Together, the two main contributions of this dissertation address two important concerns regarding feature extraction from scientific data: correctness and precision. The work presented here also opens new avenues for further research by exploring more-general reference frames and more-sophisticated domain discretizations

Surface-based flow visualization

This is the author's peer-reviewed final manuscript, as accepted by the publisher. The published article is copyrighted by Elsevier and can be found at: http://www.journals.elsevier.com/computers-and-graphics/.With increasing computing power, it is possible to process more complex fluid simulations. However, a gap between increasing\ud data size and our ability to visualize them still remains. Despite the great amount of progress that has been made in the field of\ud flow visualization over the last two decades, a number of challenges remain. Whilst the visualization of 2D flow has many good\ud solutions, the visualization of 3D flow still poses many problems. Challenges such as domain coverage, speed of computation, and\ud perception remain key directions for further research. Flow visualization with a focus on surface-based techniques forms the basis\ud of this literature survey, including surface construction techniques and visualization methods applied to surfaces. We detail our\ud investigation into these algorithms with discussions of their applicability and their relative strengths and drawbacks. We review the\ud most important challenges when considering such visualizations. The result is an up-to-date overview of the current state-of-the-art\ud that highlights both solved and unsolved problems in this rapidly evolving branch of research

Generalizing Deep Learning Methods for Particle Tracing Using Transfer Learning

Particle tracing is a very important method for scientific visualization of vector fields, but it is computationally expensive. Deep learning can be used to speed up particle tracing, but existing deep learning models are domain-specific. In this work, we present a methodology to generalize the use of deep learning for particle tracing using transfer learning. We demonstrate the performance of our approach through a series of experimental studies that address the most common simulation design scenarios: varying time span, Reynolds number, and problem geometry. The results show that our methodology can be effectively used to generalize and accelerate the training and practical use of deep learning models for visualization of unsteady flows

Evolving time surfaces and tracking mixing indicators for flow visualization

The complexity of large scale computational fluid dynamic simulations (CFD) demands powerful tools to investigate the numerical results. To analyze and understand these voluminous results, we need to visualize the 3D flow field. We chose to use a visualization technique called Time Surfaces. A time surface is a set of surfaces swept by an initial seed surface for a given number of timesteps. We use a front tracking approach where the points of an in initial surface are advanced in a Lagrangian fashion. To maintain a smooth time surface, our method requires surface refinement operations that either split triangle edges, adjust narrow triangles, or delete small triangles. In the conventional approach of edge splitting, we compute the length of an edge, and split that edge if it has exceeded a certain threshold length. In our new approach, we examine the angle between the two vectors at a given edge. We split the edge if the vectors are diverging from one another. This vector angle criterion enables us to refine an edge before advancing the surface front. Refining a surface prior to advancing it has the effect of minimizing the amount of interpolation error. In addition, unlike the edge length criterion which yields a triangular mesh with even vertex distribution throughout the surface, the vector angle criterion yields a triangular mesh that has fewer vertices where the vector field is flat and more vertices where the vector field is curved. Motivated by the evaluation and the analysis of flow field mixing quantities, this work explores two types of quantitative measurements. First, we look at Ottino\u27s mixing indicators which measure the degree of mixing of a fluid by quantifying the rate at which a sample fluid blob stretches in a flow field over a period of time. Using the geometry of the time surfaces we generated, we are able to easily evaluate otherwise complicated mixing quantities. Second, we compute the curvature and torsion of the velocity field itself. Visualizing the distribution and intensity of the curvature and torsion scalar fields enables us to identify regions of strong and low mixing. To better observe these scalar fields, we designed a multi-scale colormap that emphasizes small, medium, and large values, simultaneously. We test our time surface method and analyze fluid flow mixing quantities on two CFD datasets: a stirred tank simulation and a BP oil spill simulation

Visuelle Analyse großer Partikeldaten

Partikelsimulationen sind eine bewährte und weit verbreitete numerische Methode in der Forschung und Technik. Beispielsweise werden Partikelsimulationen zur Erforschung der Kraftstoffzerstäubung in Flugzeugturbinen eingesetzt. Auch die Entstehung des Universums wird durch die Simulation von dunkler Materiepartikeln untersucht. Die hierbei produzierten Datenmengen sind immens. So enthalten aktuelle Simulationen Billionen von Partikeln, die sich über die Zeit bewegen und miteinander interagieren. Die Visualisierung bietet ein großes Potenzial zur Exploration, Validation und Analyse wissenschaftlicher Datensätze sowie der zugrundeliegenden Modelle. Allerdings liegt der Fokus meist auf strukturierten Daten mit einer regulären Topologie. Im Gegensatz hierzu bewegen sich Partikel frei durch Raum und Zeit. Diese Betrachtungsweise ist aus der Physik als das lagrange Bezugssystem bekannt. Zwar können Partikel aus dem lagrangen in ein reguläres eulersches Bezugssystem, wie beispielsweise in ein uniformes Gitter, konvertiert werden. Dies ist bei einer großen Menge an Partikeln jedoch mit einem erheblichen Aufwand verbunden. Darüber hinaus führt diese Konversion meist zu einem Verlust der Präzision bei gleichzeitig erhöhtem Speicherverbrauch. Im Rahmen dieser Dissertation werde ich neue Visualisierungstechniken erforschen, welche speziell auf der lagrangen Sichtweise basieren. Diese ermöglichen eine effiziente und effektive visuelle Analyse großer Partikeldaten

Fundamentals and Applications of N-pulse Particle Image Velocimetry-accelerometry: Towards Advanced Measurements of Complex Flows and Turbulence

abstract: Over the past three decades, particle image velocimetry (PIV) has been continuously growing to become an informative and robust experimental tool for fluid mechanics research. Compared to the early stage of PIV development, the dynamic range of PIV has been improved by about an order of magnitude (Adrian, 2005; Westerweel et al., 2013). Further improvement requires a breakthrough innovation, which constitutes the main motivation of this dissertation. N-pulse particle image velocimetry-accelerometry (N-pulse PIVA, where N>=3) is a promising technique to this regard. It employs bursts of N pulses to gain advantages in both spatial and temporal resolution. The performance improvement by N-pulse PIVA is studied using particle tracking (i.e. N-pulse PTVA), and it is shown that an enhancement of at least another order of magnitude is achievable. Furthermore, the capability of N-pulse PIVA to measure unsteady acceleration and force is demonstrated in the context of an oscillating cylinder interacting with surrounding fluid. The cylinder motion, the fluid velocity and acceleration, and the fluid force exerted on the cylinder are successfully measured. On the other hand, a key issue of multi-camera registration for the implementation of N-pulse PIVA is addressed with an accuracy of 0.001 pixel. Subsequently, two applications of N-pulse PTVA to complex flows and turbulence are presented. A novel 8-pulse PTVA analysis was developed and validated to accurately resolve particle unsteady drag in post-shock flows. It is found that the particle drag is substantially elevated from the standard drag due to flow unsteadiness, and a new drag correlation incorporating particle Reynolds number and unsteadiness is desired upon removal of the uncertainty arising from non-uniform particle size. Next, the estimation of turbulence statistics utilizes the ensemble average of 4-pulse PTV data within a small domain of an optimally determined size. The estimation of mean velocity, mean velocity gradient and isotropic dissipation rate are presented and discussed by means of synthetic turbulence, as well as a tomographic measurement of turbulent boundary layer. The results indicate the superior capability of the N-pulse PTV based method to extract high-spatial-resolution high-accuracy turbulence statistics.Dissertation/ThesisAnimation of N-pulse PIVA measurement of flow-structure interactionDoctoral Dissertation Mechanical Engineering 201