A Robust Level-Set Algorithm for Centerline Extraction

We present a robust method for extracting 3D centerlines from volumetric datasets. We start from a 2D skeletonization method to locate voxels centered with respect to three orthogonal slicing directions. Next, we introduce a new detection criterion to extract the centerline voxels from the above skeletons, followed by a thinning, reconnection, and a ranking step. Overall, the proposed method produces centerlines that are object-centered, connected, one voxel thick, robust with respect to object noisiness, handles arbitrary object topologies, comes with a simple pruning threshold, and is fast to compute. We compare our results with two other methods on a variety of real-world datasets.

The State of the Art in Flow Visualization: Dense and Texture-Based Techniques

Flow visualization has been a very attractive component of scientific visualization research for a long time. Usually very large multivariate datasets require processing. These datasets often consist of a large number of sample locations and several time steps. The steadily increasing performance of computers has recently become a driving factor for a reemergence in flow visualization research, especially in texture-based techniques. In this paper, dense, texture-based flow visualization techniques are discussed. This class of techniques attempts to provide a complete, dense representation of the flow field with high spatio-temporal coherency. An attempt of categorizing closely related solutions is incorporated and presented. Fundamentals are shortly addressed as well as advantages and disadvantages of the methods. Categories and Subject Descriptors (according to ACM CCS): I.3 [Computer Graphics]: visualization, flow visualization, computational flow visualizatio

PointCloudExplore 2: Visual exploration of 3D gene expression

To better understand how developmental regulatory networks are defined inthe genome sequence, the Berkeley Drosophila Transcription Network Project (BDNTP)has developed a suite of methods to describe 3D gene expression data, i.e.,the output of the network at cellular resolution for multiple time points. To allow researchersto explore these novel data sets we have developed PointCloudXplore (PCX).In PCX we have linked physical and information visualization views via the concept ofbrushing (cell selection). For each view dedicated operations for performing selectionof cells are available. In PCX, all cell selections are stored in a central managementsystem. Cells selected in one view can in this way be highlighted in any view allowingfurther cell subset properties to be determined. Complex cell queries can be definedby combining different cell selections using logical operations such as AND, OR, andNOT. Here we are going to provide an overview of PointCloudXplore 2 (PCX2), thelatest publicly available version of PCX. PCX2 has shown to be an effective tool forvisual exploration of 3D gene expression data. We discuss (i) all views available inPCX2, (ii) different strategies to perform cell selection, (iii) the basic architecture ofPCX2., and (iv) illustrate the usefulness of PCX2 using selected examples

Crease surfaces: from theory to extraction and application to diffusion tensor MRI

Crease surfaces are two-dimensional manifolds along which a scalar field assumes a local maximum (ridge) or a local minimum (valley) in a constrained space. Unlike isosurfaces, they are able to capture extremal structures in the data. Creases have a long tradition in image processing and computer vision, and have recently become a popular tool for visualization. When extracting crease surfaces, degeneracies of the Hessian (i.e., lines along which two eigenvalues are equal), have so far been ignored. We show that these loci, however, have two important consequences for the topology of crease surfaces: First, creases are bounded not only by a side constraint on eigenvalue sign, but also by Hessian degeneracies. Second, crease surfaces are not in general orientable. We describe an efficient algorithm for the extraction of crease surfaces which takes these insights into account and demonstrate that it produces more accurate results than previous approaches. Finally, we show that DT-MRI streamsurfaces, which were previously used for the analysis of planar regions in diffusion tensor MRI data, are mathematically ill-defined. As an example application of our method, creases in a measure of planarity are presented as a viable substitute

General Purpose Flow Visualization at the Exascale

Exascale computing, i.e., supercomputers that can perform 1018 math operations per second, provide significant opportunity for improving the computational sciences. That said, these machines can be difficult to use efficiently, due to their massive parallelism, due to the use of accelerators, and due to the diversity of accelerators used. All areas of the computational science stack need to be reconsidered to address these problems. With this dissertation, we consider flow visualization, which is critical for analyzing vector field data from simulations. We specifically consider flow visualization techniques that use particle advection, i.e., tracing particle trajectories, which presents performance and implementation challenges. The dissertation makes four primary contributions. First, it synthesizes previous work on particle advection performance and introduces a high-level analytical cost model. Second, it proposes an approach for performance portability across accelerators. Third, it studies expected speedups based on using accelerators, including the importance of factors such as duration, particle count, data set, and others. Finally, it proposes an exascale-capable particle advection system that addresses diversity in many dimensions, including accelerator type, parallelism approach, analysis use case, underlying vector field, and more

Operatori za multi-rezolucione komplekse Morza i ćelijske komplekse

The topic of the thesis is analysis of the topological structure of scalar fields and shapes represented through Morse and cell complexes, respectively. This is achieved by defining simplification and refinement operators on these complexes. It is shown that the defined operators form a basis for the set of operators that modify Morse and cell complexes. Based on the defined operators, a multi-resolution model for Morse and cell complexes is constructed, which contains a large number of representations at uniform and variable resolution.Тема дисертације је анализа тополошке структуре скаларних поља и облика представљених у облику комплекса Морза и ћелијских комплекса, редом. То се постиже дефинисањем оператора за симплификацију и рафинацију тих комплекса. Показано је да дефинисани оператори чине базу за скуп оператора на комплексима Морза и ћелијским комплексима. На основу дефинисаних оператора конструисан је мулти-резолуциони модел за комплексе Морза и ћелијске комплексе, који садржи велики број репрезентација униформне и варијабилне резолуције.Tema disertacije je analiza topološke strukture skalarnih polja i oblika predstavljenih u obliku kompleksa Morza i ćelijskih kompleksa, redom. To se postiže definisanjem operatora za simplifikaciju i rafinaciju tih kompleksa. Pokazano je da definisani operatori čine bazu za skup operatora na kompleksima Morza i ćelijskim kompleksima. Na osnovu definisanih operatora konstruisan je multi-rezolucioni model za komplekse Morza i ćelijske komplekse, koji sadrži veliki broj reprezentacija uniformne i varijabilne rezolucije