Effective exploration of spatiotemporal volumetric data sets remains a key challenge in scientific visualization.Although great advances have been made over the years,existing solutions typically focus on only one or ...Effective exploration of spatiotemporal volumetric data sets remains a key challenge in scientific visualization.Although great advances have been made over the years,existing solutions typically focus on only one or two aspects of data analysis and visualization.A streamlined workflow for analyzing time-varying data in a comprehensive and unified manner is still missing.Towards this goal,we present a novel approach for time-varying data visualization that encompasses keyframe identification,feature extraction and tracking under a single,unified framework.At the heart of our approach lies in the GPU-accelerated BlockMatch method,a dense block correspondence technique that extends the PatchMatch method from 2D pixels to 3D voxels.Based on the results of dense correspondence,we are able to identify keyframes from the time sequence using k-medoids clustering along with a bidirectional similarity measure.Furthermore,in conjunction with the graph cut algorithm,this framework enables us to perform fine-grained feature extraction and tracking.We tested our approach using several time-varying data sets to demonstrate its effectiveness and utility.展开更多
文摘Effective exploration of spatiotemporal volumetric data sets remains a key challenge in scientific visualization.Although great advances have been made over the years,existing solutions typically focus on only one or two aspects of data analysis and visualization.A streamlined workflow for analyzing time-varying data in a comprehensive and unified manner is still missing.Towards this goal,we present a novel approach for time-varying data visualization that encompasses keyframe identification,feature extraction and tracking under a single,unified framework.At the heart of our approach lies in the GPU-accelerated BlockMatch method,a dense block correspondence technique that extends the PatchMatch method from 2D pixels to 3D voxels.Based on the results of dense correspondence,we are able to identify keyframes from the time sequence using k-medoids clustering along with a bidirectional similarity measure.Furthermore,in conjunction with the graph cut algorithm,this framework enables us to perform fine-grained feature extraction and tracking.We tested our approach using several time-varying data sets to demonstrate its effectiveness and utility.
