• Login
    View Item 
    •   Eurographics DL Home
    • Computer Graphics Forum
    • Volume 37 (2018)
    • 37-Issue 3
    • View Item
    •   Eurographics DL Home
    • Computer Graphics Forum
    • Volume 37 (2018)
    • 37-Issue 3
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Key Time Steps Selection for Large-Scale Time-Varying Volume Datasets Using an Information-Theoretic Storyboard

    Thumbnail
    View/Open
    v37i3pp037-049.pdf (13.89Mb)
    1271-file1.pdf (9.993Mb)
    1271-file2.mp4 (15.29Mb)
    Date
    2018
    Author
    Zhou, Bo
    Chiang, Yi-Jen
    Pay-Per-View via TIB Hannover:

    Try if this item/paper is available.

    Metadata
    Show full item record
    Abstract
    Key time steps selection is essential for effective and efficient scientific visualization of large-scale time-varying datasets. We present a novel approach that can decide the number of most representative time steps while selecting them to minimize the difference in the amount of information from the original data.We use linear interpolation to reconstruct the data of intermediate time steps between selected time steps.We propose an evaluation of selected time steps by computing the difference in the amount of information (called information difference) using variation of information (VI) from information theory, which compares the interpolated time steps against the original data. In the one-time preprocessing phase, a dynamic programming is applied to extract the subset of time steps that minimize the information difference. In the run-time phase, a novel chart is used to present the dynamic programming results, which serves as a storyboard of the data to guide the user to select the best time steps very efficiently. We extend our preprocessing approach to a novel out-of-core approximate algorithm to achieve optimal I/O cost, which also greatly reduces the in-core computing time and exhibits a nice trade-off between computing speed and accuracy. As shown in the experiments, our approximate method outperforms the previous globally optimal DTW approach [TLS12] on out-of-core data by significantly improving the running time while keeping similar qualities, and is our major contribution.
    BibTeX
    @article {10.1111:cgf.13399,
    journal = {Computer Graphics Forum},
    title = {{Key Time Steps Selection for Large-Scale Time-Varying Volume Datasets Using an Information-Theoretic Storyboard}},
    author = {Zhou, Bo and Chiang, Yi-Jen},
    year = {2018},
    publisher = {The Eurographics Association and John Wiley & Sons Ltd.},
    ISSN = {1467-8659},
    DOI = {10.1111/cgf.13399}
    }
    URI
    http://dx.doi.org/10.1111/cgf.13399
    https://diglib.eg.org:443/handle/10.1111/cgf13399
    Collections
    • 37-Issue 3

    Eurographics Association copyright © 2013 - 2022 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA
     

     

    Browse

    All of Eurographics DLCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    BibTeX | TOC

    Create BibTeX Create Table of Contents

    Eurographics Association copyright © 2013 - 2022 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA