Selection of Optimal Salient Time Steps by Non-negative Tucker Tensor Decomposition
dc.contributor.author | Pulido, Jesus | en_US |
dc.contributor.author | Patchett, John | en_US |
dc.contributor.author | Bhattarai, Manish | en_US |
dc.contributor.author | Alexandrov, Boian | en_US |
dc.contributor.author | Ahrens, James | en_US |
dc.contributor.editor | Agus, Marco and Garth, Christoph and Kerren, Andreas | en_US |
dc.date.accessioned | 2021-06-12T11:03:25Z | |
dc.date.available | 2021-06-12T11:03:25Z | |
dc.date.issued | 2021 | |
dc.description.abstract | Choosing salient time steps from spatio-temporal data is useful for summarizing the sequence and developing visualizations for animations prior to committing time and resources to their production on an entire time series. Animations can be developed more quickly with visualization choices that work best for a small set of the important salient timesteps. Here we introduce a new unsupervised learning method for finding such salient timesteps. The volumetric data is represented by a 4-dimensional non-negative tensor, X(t; x; y; z).The presence of latent (not directly observable) structure in this tensor allows a unique representation and compression of the data. To extract the latent time-features we utilize non-negative Tucker tensor decomposition. We then map these time-features to their maximal values to identify the salient time steps. We demonstrate that this choice of time steps allows a good representation of the time series as a whole. | en_US |
dc.description.sectionheaders | Scientific Visualization | |
dc.description.seriesinformation | EuroVis 2021 - Short Papers | |
dc.identifier.doi | 10.2312/evs.20211055 | |
dc.identifier.isbn | 978-3-03868-143-4 | |
dc.identifier.pages | 55-59 | |
dc.identifier.uri | https://doi.org/10.2312/evs.20211055 | |
dc.identifier.uri | https://diglib.eg.org:443/handle/10.2312/evs20211055 | |
dc.publisher | The Eurographics Association | en_US |
dc.subject | Human | |
dc.subject | centered computing | |
dc.subject | Visualization design and evaluation methods | |
dc.title | Selection of Optimal Salient Time Steps by Non-negative Tucker Tensor Decomposition | en_US |
Files
Original bundle
1 - 1 of 1