@misc{Woelk2009, type = {Master Thesis}, author = {W{\"o}lk, Bertram}, title = {Generierung hybrider Gitter f{\"u}r die Str{\"o}mungssimulation auf komplexen anatomischen Geometrien}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-11588}, school = {Zuse Institute Berlin (ZIB)}, year = {2009}, abstract = {Basierend auf einem vorhandenen Ansatz zur Einf{\"u}hrung von anisotropen Tetraedern im Randbereich eines reinen Tetraedergitters wird ein Gittergenerator f{\"u}r hybride Gitter implementiert. Das hybride Gitter besteht in Randn{\"a}he prim{\"a}r aus anisotropen Prismen und im Inneren der Geometrie aus isotropen Tetraedern. Eine erh{\"o}hte Aufl{\"o}sung im Randbereich soll zu besseren Ergebnissen von numerischen Str{\"o}mungssimulationen f{\"u}hren, f{\"u}r welche eine problemangepasste Diskretisierung des zu untersuchenden Gebietes ben{\"o}tigt wird. In dem zuvor genannten Ansatz wird eine Reihe von {\"U}bergangselementen vorgeschlagen, die an scharfen Kanten der Oberfl{\"a}che platziert werden sollen. Im Rahmen dieser Diplomarbeit wird die Idee der {\"U}bergangselemente aufgegriffen und bei hybriden Gittern eingesetzt, um auch komplexe Eingabegeometrien vergittern zu k{\"o}nnen. Der urspr{\"u}ngliche Gittergenerierungprozess wird {\"u}berarbeitet und erweitert. Eine neue Menge an {\"U}bergangselementen wird eingef{\"u}hrt, es werden gekr{\"u}mmte Extrusionsvektoren verwendet und es wird die Auswertung der medialen Oberfl{\"a}che vorgenommen, um {\"U}berschneidungen im hybriden Gitter zu vermeiden. Der Gittergenerator wird als Modul in das Visualisierungs- und Analyseprogramm Amira implementiert und die erstellten hybriden Gitter werden auf ihre Elementqualit{\"a}t und die G{\"u}te der Str{\"o}mungssimulationsergebnisse hin {\"u}berpr{\"u}ft.}, language = {de} } @phdthesis{Prohaska2007, author = {Prohaska, Steffen}, title = {Skeleton-based visualization of massive voxel objects with network-like architecture}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-14888}, year = {2007}, abstract = {This work introduces novel internal and external memory algorithms for computing voxel skeletons of massive voxel objects with complex network-like architecture and for converting these voxel skeletons to piecewise linear geometry, that is triangle meshes and piecewise straight lines. The presented techniques help to tackle the challenge of visualizing and analyzing 3d images of increasing size and complexity, which are becoming more and more important in, for example, biological and medical research. Section 2.3.1 contributes to the theoretical foundations of thinning algorithms with a discussion of homotopic thinning in the grid cell model. The grid cell model explicitly represents a cell complex built of faces, edges, and vertices shared between voxels. A characterization of pairs of cells to be deleted is much simpler than characterizations of simple voxels were before. The grid cell model resolves topologically unclear voxel configurations at junctions and locked voxel configurations causing, for example, interior voxels in sets of non-simple voxels. A general conclusion is that the grid cell model is superior to indecomposable voxels for algorithms that need detailed control of topology. Section 2.3.2 introduces a noise-insensitive measure based on the geodesic distance along the boundary to compute two-dimensional skeletons. The measure is able to retain thin object structures if they are geometrically important while ignoring noise on the object's boundary. This combination of properties is not known of other measures. The measure is also used to guide erosion in a thinning process from the boundary towards lines centered within plate-like structures. Geodesic distance based quantities seem to be well suited to robustly identify one- and two-dimensional skeletons. Chapter 6 applies the method to visualization of bone micro-architecture. Chapter 3 describes a novel geometry generation scheme for representing voxel skeletons, which retracts voxel skeletons to piecewise linear geometry per dual cube. The generated triangle meshes and graphs provide a link to geometry processing and efficient rendering of voxel skeletons. The scheme creates non-closed surfaces with boundaries, which contain fewer triangles than a representation of voxel skeletons using closed surfaces like small cubes or iso-surfaces. A conclusion is that thinking specifically about voxel skeleton configurations instead of generic voxel configurations helps to deal with the topological implications. The geometry generation is one foundation of the applications presented in Chapter 6. Chapter 5 presents a novel external memory algorithm for distance ordered homotopic thinning. The presented method extends known algorithms for computing chamfer distance transformations and thinning to execute I/O-efficiently when input is larger than the available main memory. The applied block-wise decomposition schemes are quite simple. Yet it was necessary to carefully analyze effects of block boundaries to devise globally correct external memory variants of known algorithms. In general, doing so is superior to naive block-wise processing ignoring boundary effects. Chapter 6 applies the algorithms in a novel method based on confocal microscopy for quantitative study of micro-vascular networks in the field of microcirculation.}, language = {en} } @misc{RosanwoPetzProhaskaetal.2008, author = {Rosanwo, Olufemi and Petz, Christoph and Prohaska, Steffen and Hotz, Ingrid and Hege, Hans-Christian}, title = {Dual Streamline Seeding - Method and Implementation}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-11032}, number = {08-49}, year = {2008}, abstract = {This work introduces a novel streamline seeding technique based on dual streamlines that are orthogonal to the vector field, instead of tangential. The greedy algorithm presented here produces a net of orthogonal streamlines that is iteratively refined resulting in good domain coverage and a high degree of continuity and uniformity. The algorithm is easy to implement and efficient, and it naturally extends to curved surfaces.}, language = {en} } @phdthesis{Lamecker2008, author = {Lamecker, Hans}, title = {Variational and statistical shape modeling for 3D geometry reconstruction}, year = {2008}, abstract = {The reconstruction of geometric shapes plays an important role in many biomedical applications. One example is the patient-specific, computer-aided planning of complex interventions, which requires the generation of explicitly represented geometric models of anatomical structures from medical image data. Only solutions that require minimal interaction by medical personnel are likely to enter clinical routine. Another example is the planning of surgical corrections of deformities where the target shape is unknown. Surgeons are often forced to resort to subjective criteria. These applications still pose highly challenging reconstruction problems, which are addressed in this thesis. The fundamental hypothesis, pursued in this thesis, is that the problems can be solved by incorporating a-priori knowledge about shape and other application-specific characteristics. Here, we focus mainly on the aspect of geometric shape analysis. The basic idea is to capture the most essential variations of a certain class of geometric objects via statistical shape models, which model typical features contained in a given population, and restrict the outcome of a reconstruction algorithm (more or less) to the space spanned by such models. A fundamental prerequisite for performing statistical shape analysis on a set of different objects is the identification of corresponding points on their associated surfaces. This problem is particularly difficult to solve if the shapes stem from different individuals. The reason lies in the basic difficulty of defining suitable measures of similarity. In this thesis, we divide the correspondence problem into feature and non-feature matching. The feature part depends on the application, while the non-feature part can be characterized by a purely geometric description. We propose two different approaches. The first approach has proved useful in many applications. Yet, it suffers from some practical limitations and does not yield a measure of similarity. Our second, variational, approach is designed to overcome these limitations. In it, we propose to minimize an invariant stretching measure, constrained by previously computed features. An important property, which sets our method apart from previous work, is that it does not require the computation of a global surface parameterization.}, language = {en} } @misc{GuentherLameckerWeiser2011, author = {G{\"u}nther, Andreas and Lamecker, Hans and Weiser, Martin}, title = {Direct LDDMM of Discrete Currents with Adaptive Finite Elements}, doi = {10.1007/s11263-012-0599-3}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-13090}, number = {11-22}, year = {2011}, abstract = {We consider Large Deformation Diffeomorphic Metric Mapping of general \$m\$-currents. After stating an optimization algorithm in the function space of admissable morph generating velocity fields, two innovative aspects in this framework are presented and numerically investigated: First, we spatially discretize the velocity field with conforming adaptive finite elements and discuss advantages of this new approach. Second, we directly compute the temporal evolution of discrete \$m\$-current attributes.}, language = {en} } @misc{KratzMeyerHotz2010, author = {Kratz, Andrea and Meyer, Bj{\"o}rn and Hotz, Ingrid}, title = {A Visual Approach to Analysis of Stress Tensor Fields}, doi = {/10.4230/DFU.Vol2.SciViz.2011.188}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-11915}, number = {10-26}, year = {2010}, abstract = {We present a visual approach for the exploration of stress tensor fields. Therefore, we introduce the idea of multiple linked views to tensor visualization. In contrast to common tensor visualization methods that only provide a single view to the tensor field, we pursue the idea of providing various perspectives onto the data in attribute and object space. Especially in the context of stress tensors, advanced tensor visualization methods have a young tradition. Thus, we propose a combination of visualization techniques domain experts are used to with statistical views of tensor attributes. The application of this concept to tensor fields was achieved by extending the notion of shape space. It provides an intuitive way of finding tensor invariants that represent relevant physical properties. Using brushing techniques, the user can select features in attribute space, which are mapped to displayable entities in a three-dimensional hybrid visualization in object space. Volume rendering serves as context, while glyphs encode the whole tensor information in focus regions. Tensorlines can be included to emphasize directionally coherent features in the tensor field. We show that the benefit of such a multi-perspective approach is manifold. Foremost, it provides easy access to the complexity of tensor data. Moreover, including wellknown analysis tools, such as Mohr diagrams, users can familiarize themselves gradually with novel visualization methods. Finally, by employing a focus-driven hybrid rendering, we significantly reduce clutter, which was a major problem of other three-dimensional tensor visualization methods.}, language = {en} } @misc{ReininghausKastenWeinkaufetal.2011, author = {Reininghaus, Jan and Kasten, Jens and Weinkauf, Tino and Hotz, Ingrid}, title = {Combinatorial Feature Flow Fields: Tracking Critical Points in Discrete Scalar Fields}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-12151}, number = {11-02}, year = {2011}, abstract = {We propose a combinatorial algorithm to track critical points of 2D time-dependent scalar fields. Existing tracking algorithms such as Feature Flow Fields apply numerical schemes utilizing derivatives of the data, which makes them prone to noise and involve a large number of computational parameters. In contrast, our method is robust against noise since it does not require derivatives, interpolation, and numerical integration. Furthermore, we propose an importance measure that combines the spatial persistence of a critical point with its temporal evolution. This leads to a time-aware feature hierarchy, which allows us to discriminate important from spurious features. Our method requires only a single, easy-to-tune computational parameter and is naturally formulated in an out-of-core fashion, which enables the analysis of large data sets. We apply our method to a number of data sets and compare it to the stabilized continuous Feature Flow Field tracking algorithm.}, language = {en} } @misc{KratzReininghausHadwigeretal.2011, author = {Kratz, Andrea and Reininghaus, Jan and Hadwiger, Markus and Hotz, Ingrid}, title = {Adaptive Screen-Space Sampling for Volume Ray-Casting}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-12446}, number = {11-04}, year = {2011}, abstract = {This work is concerned with adaptive screen-space sampling for volume ray-casting. The goal is to reduce the number of rays being cast into the scene and, thus, the overall number of sampling points. We guarantee reliable images through explicit error control using an error estimator that is founded in the field of finite element methods (FEM). FEM theory further provides a well-founded theory to prove the efficiency of the presented algorithm via convergence analysis. We, therefore, compare the convergence behavior of our method against uniform subdivisions and a refinement scheme that was presented in the context of CPU volume ray-casting. Minimizing the number of sampling points is of interest for rendering large datasets where each evaluation might need an expensive decompression. Furthermore, with increasing screen resolutions high-resolution images are created more efficiently with our method.}, language = {en} } @misc{ClasenPaarProhaska2011, author = {Clasen, Malte and Paar, Philip and Prohaska, Steffen}, title = {Level of Detail for Trees Using Clustered Ellipsoids}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-14251}, number = {11-41}, year = {2011}, abstract = {We present a level of detail method for trees based on ellipsoids and lines. We leverage the Expectation Maximization algorithm with a Gaussian Mixture Model to create a hierarchy of high-quality leaf clusterings, while the branches are simplified using agglomerative bottom-up clustering to preserve the connectivity. The simplification runs in a preprocessing step and requires no human interaction. For a fly by over and through a scene of 10k trees, our method renders on average at 40 ms/frame, up to 6 times faster than billboard clouds with comparable artifacts.}, language = {en} } @misc{WiebelVosHege2011, author = {Wiebel, Alexander and Vos, Frans M. and Hege, Hans-Christian}, title = {Perception-Oriented Picking of Structures in Direct Volumetric Renderings}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-14343}, number = {11-45}, year = {2011}, abstract = {Radiologists from all application areas are trained to read slice-based visualizations of 3D medical image data. Despite the numerous examples of sophisticated three-dimensional renderings, especially all variants of direct volume rendering, such methods are often considered not very useful by radiologists who prefer slice-based visualization. Just recently there have been attempts to bridge this gap between 2D and 3D renderings. These attempts include specialized techniques for volume picking that result in repositioning slices. In this paper, we present a new volume picking technique that, in contrast to previous work, does not require pre-segmented data or metadata. The positions picked by our method are solely based on the data itself, the transfer function and, most importantly, on the way the volumetric rendering is perceived by viewers. To demonstrate the usefulness of the proposed method we apply it for automatically repositioning slices in an abdominal MRI scan, a data set from a flow simulation and a number of other volumetric scalar fields. Furthermore we discuss how the method can be implemented in combination with various different volumetric rendering techniques.}, language = {en} }