%0 Journal Article %1 frey2017progressive %A Frey, Steffen %A Ertl, Thomas %D 2017 %I IEEE %J IEEE Transactions on Visualization and Computer Graphics %K 2017 A02 from:leonkokkoliadis sfbtrr161 visus visus:ertl visus:freysn %N 1 %P 921-930 %R 10.1109/TVCG.2016.2599042 %T Progressive Direct Volume-to-Volume Transformation %U https://ieeexplore.ieee.org/document/7539644 %V 23 %X We present a novel technique to generate transformations between arbitrary volumes, providing both expressive distances and smooth interpolates. In contrast to conventional morphing or warping approaches, our technique requires no user guidance, intermediate representations (like extracted features), or blending, and imposes no restrictions regarding shape or structure. Our technique operates directly on the volumetric data representation, and while linear programming approaches could solve the underlying problem optimally, their polynomial complexity makes them infeasible for high-resolution volumes. We therefore propose a progressive refinement approach designed for parallel execution that is able to quickly deliver approximate results that are iteratively improved toward the optimum. On this basis, we further present a new approach for the streaming selection of time steps in temporal data that allows for the reconstruction of the full sequence with a user-specified error bound. We finally demonstrate the utility of our technique for different applications, compare our approach against alternatives, and evaluate its characteristics with a variety of different data sets.

@article{frey2017progressive, abstract = {We present a novel technique to generate transformations between arbitrary volumes, providing both expressive distances and smooth interpolates. In contrast to conventional morphing or warping approaches, our technique requires no user guidance, intermediate representations (like extracted features), or blending, and imposes no restrictions regarding shape or structure. Our technique operates directly on the volumetric data representation, and while linear programming approaches could solve the underlying problem optimally, their polynomial complexity makes them infeasible for high-resolution volumes. We therefore propose a progressive refinement approach designed for parallel execution that is able to quickly deliver approximate results that are iteratively improved toward the optimum. On this basis, we further present a new approach for the streaming selection of time steps in temporal data that allows for the reconstruction of the full sequence with a user-specified error bound. We finally demonstrate the utility of our technique for different applications, compare our approach against alternatives, and evaluate its characteristics with a variety of different data sets.}, added-at = {2020-01-15T16:45:15.000+0100}, affiliation = {Frey, S (Reprint Author), Univ Stuttgart, Stuttgart, Germany. Frey, Steffen; Ertl, Thomas, Univ Stuttgart, Stuttgart, Germany.}, author = {Frey, Steffen and Ertl, Thomas}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/280186ba9c43b1a4bbc647330f16b6c51/sfbtrr161}, da = {2018-02-15}, doi = {10.1109/TVCG.2016.2599042}, eissn = {1941-0506}, interhash = {41f1ae1ec9aab57806243c4d6e0c544d}, intrahash = {80186ba9c43b1a4bbc647330f16b6c51}, issn = {1077-2626}, journal = {IEEE Transactions on Visualization and Computer Graphics}, keywords = {2017 A02 from:leonkokkoliadis sfbtrr161 visus visus:ertl visus:freysn}, language = {English}, note = {IEEE VIS Conference, Baltimore, MD, Oct 23-28, 2016}, number = 1, pages = {921-930}, publisher = {IEEE}, research-areas = {Computer Science}, timestamp = {2020-10-05T11:55:01.000+0200}, title = {Progressive Direct Volume-to-Volume Transformation}, type = {Article; Proceedings Paper}, unique-id = {ISI:000395537600095}, url = {https://ieeexplore.ieee.org/document/7539644}, volume = 23, year = 2017 }