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

Bo Zhou, Yi-Jen Chiang

    Research output: Contribution to journalArticle

    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.

    Original languageEnglish (US)
    Pages (from-to)37-49
    Number of pages13
    JournalComputer Graphics Forum
    Volume37
    Issue number3
    DOIs
    StatePublished - Jun 1 2018

    Fingerprint

    Dynamic programming
    Data visualization
    Information theory
    Interpolation
    Costs
    Experiments

    Keywords

    • Information Theory
    • Key Time Steps Selection
    • Scalar Field Data
    • Time-Varying Volume Data

    ASJC Scopus subject areas

    • Computer Graphics and Computer-Aided Design

    Cite this

    Key Time Steps Selection for Large-Scale Time-Varying Volume Datasets Using an Information-Theoretic Storyboard. / Zhou, Bo; Chiang, Yi-Jen.

    In: Computer Graphics Forum, Vol. 37, No. 3, 01.06.2018, p. 37-49.

    Research output: Contribution to journalArticle

    @article{914e1b92be28432babfac3390d9f6528,
    title = "Key Time Steps Selection for Large-Scale Time-Varying Volume Datasets Using an Information-Theoretic Storyboard",
    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.",
    keywords = "Information Theory, Key Time Steps Selection, Scalar Field Data, Time-Varying Volume Data",
    author = "Bo Zhou and Yi-Jen Chiang",
    year = "2018",
    month = "6",
    day = "1",
    doi = "10.1111/cgf.13399",
    language = "English (US)",
    volume = "37",
    pages = "37--49",
    journal = "Computer Graphics Forum",
    issn = "0167-7055",
    publisher = "Wiley-Blackwell",
    number = "3",

    }

    TY - JOUR

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

    AU - Zhou, Bo

    AU - Chiang, Yi-Jen

    PY - 2018/6/1

    Y1 - 2018/6/1

    N2 - 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.

    AB - 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.

    KW - Information Theory

    KW - Key Time Steps Selection

    KW - Scalar Field Data

    KW - Time-Varying Volume Data

    UR - http://www.scopus.com/inward/record.url?scp=85050273343&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85050273343&partnerID=8YFLogxK

    U2 - 10.1111/cgf.13399

    DO - 10.1111/cgf.13399

    M3 - Article

    VL - 37

    SP - 37

    EP - 49

    JO - Computer Graphics Forum

    JF - Computer Graphics Forum

    SN - 0167-7055

    IS - 3

    ER -