Streaming Approach to In Situ Selection of Key Time Steps for Time-Varying Volume Data
| dc.contributor.author | Wu, Mengxi | en_US |
| dc.contributor.author | Chiang, Yi-Jen | en_US |
| dc.contributor.author | Musco, Christopher | en_US |
| dc.contributor.editor | Borgo, Rita | en_US |
| dc.contributor.editor | Marai, G. Elisabeta | en_US |
| dc.contributor.editor | Schreck, Tobias | en_US |
| dc.date.accessioned | 2022-06-03T06:06:13Z | |
| dc.date.available | 2022-06-03T06:06:13Z | |
| dc.date.issued | 2022 | |
| dc.description.abstract | Key time steps selection, i.e., selecting a subset of most representative time steps, is essential for effective and efficient scientific visualization of large time-varying volume data. In particular, as computer simulations continue to grow in size and complexity, they often generate output that exceeds both the available storage capacity and bandwidth for transferring results to storage, making it indispensable to save only a subset of time steps. At the same time, this subset must be chosen so that it is highly representative, to facilitate post-processing and reconstruction with high fidelity. The key time steps selection problem is especially challenging in the in situ setting, where we can only process data in one pass in an online streaming fashion, using a small amount of main memory and fast computation. In this paper, we formulate the problem as that of optimal piece-wise linear interpolation. We first apply a method from numerical linear algebra to compute linear interpolation solutions and their errors in an online streaming fashion. Using that method as a building block, we can obtain a global optimal solution for the piece-wise linear interpolation problem via a standard dynamic programming (DP) algorithm. However, this approach needs to process the time steps in multiple passes and is too slow for the in situ setting. To address this issue, we introduce a novel approximation algorithm, which processes time steps in one pass in an online streaming fashion, with very efficient computing time and main memory space both in theory and in practice. The algorithm is suitable for the in situ setting. Moreover, we prove that our algorithm, which is based on a greedy update rule, has strong theoretical guarantees on the approximation quality and the number of time steps stored. To the best of our knowledge, this is the first algorithm suitable for in situ key time steps selection with such theoretical guarantees, and is the main contribution of this paper. Experiments demonstrate the efficacy of our new techniques. | en_US |
| dc.description.number | 3 | |
| dc.description.sectionheaders | Engineering, Physics, and Math | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 41 | |
| dc.identifier.doi | 10.1111/cgf.14542 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 309-320 | |
| dc.identifier.pages | 12 pages | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.14542 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf14542 | |
| dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.subject | Keywords: Algorithms, Temporal Data, Scalar Field Data, Large-Scale Data Techniques, Key Time Steps Selection. | |
| dc.subject | Algorithms | |
| dc.subject | Temporal Data | |
| dc.subject | Scalar Field Data | |
| dc.subject | Large | |
| dc.subject | Scale Data Techniques | |
| dc.subject | Key Time Steps Selection. | |
| dc.title | Streaming Approach to In Situ Selection of Key Time Steps for Time-Varying Volume Data | en_US |