TY - THES A1 - Prohaska, Steffen T1 - Skeleton-based visualization of massive voxel objects with network-like architecture T1 - Skelettbasierte Visualisierung großer Voxel-Objekte mit netzwerkartiger Architektur N2 - 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. N2 - Die vorliegende Arbeit führt I/O-effiziente Algorithmen und Standard-Algorithmen zur Berechnung von Voxel-Skeletten aus großen Voxel-Objekten mit komplexer, netzwerkartiger Struktur und zur Umwandlung solcher Voxel-Skelette in stückweise-lineare Geometrie ein. Die vorgestellten Techniken werden zur Visualisierung und Analyse komplexer drei-dimensionaler Bilddaten, beispielsweise aus Biologie und Medizin, eingesetzt. Abschnitt 2.3.1 leistet mit der Diskussion von topologischem Thinning im Grid-Cell-Modell einen Beitrag zu den theoretischen Grundlagen von Thinning-Algorithmen. Im Grid-Cell-Modell wird ein Voxel-Objekt als Zellkomplex dargestellt, der aus den Ecken, Kanten, Flächen und den eingeschlossenen Volumina der Voxel gebildet wird. Topologisch unklare Situationen an Verzweigungen und blockierte Voxel-Kombinationen werden aufgelöst. Die Charakterisierung von Zellpaaren, die im Thinning-Prozess entfernt werden dürfen, ist einfacher als bekannte Charakterisierungen von so genannten "Simple Voxels". Eine wesentliche Schlussfolgerung ist, dass das Grid-Cell-Modell atomaren Voxeln überlegen ist, wenn Algorithmen detaillierte Kontrolle über Topologie benötigen. Abschnitt 2.3.2 präsentiert ein rauschunempfindliches Maß, das den geodätischen Abstand entlang der Oberfläche verwendet, um zweidimensionale Skelette zu berechnen, welche dünne, aber geometrisch bedeutsame, Strukturen des Objekts rauschunempfindlich abbilden. Das Maß wird im weiteren mit Thinning kombiniert, um die Erosion von Voxeln auf Linien zuzusteuern, die zentriert in plattenförmigen Strukturen liegen. Maße, die auf dem geodätischen Abstand aufbauen, scheinen sehr geeignet zu sein, um ein- und zwei-dimensionale Skelette bei vorhandenem Rauschen zu identifizieren. Eine theoretische Begründung für diese Beobachtung steht noch aus. In Abschnitt 6 werden die diskutierten Methoden zur Visualisierung von Knochenfeinstruktur eingesetzt. Abschnitt 3 beschreibt eine Methode, um Voxel-Skelette durch kontrollierte Retraktion in eine stückweise-lineare geometrische Darstellung umzuwandeln, die als Eingabe für Geometrieverarbeitung und effizientes Rendering von Voxel-Skeletten dient. Es zeigt sich, dass eine detaillierte Betrachtung der topologischen Eigenschaften eines Voxel-Skeletts einer Betrachtung von allgemeinen Voxel-Konfigurationen für die Umwandlung zu einer geometrischen Darstellung überlegen ist. Die diskutierte Methode bildet die Grundlage für die Anwendungen, die in Abschnitt 6 diskutiert werden. Abschnitt 5 führt einen I/O-effizienten Algorithmus für Thinning ein. Die vorgestellte Methode erweitert bekannte Algorithmen zur Berechung von Chamfer-Distanztransformationen und Thinning so, dass diese effizient ausführbar sind, wenn die Eingabedaten den verfügbaren Hauptspeicher übersteigen. Der Einfluss der Blockgrenzen auf die Algorithmen wurde analysiert, um global korrekte Ergebnisse sicherzustellen. Eine detaillierte Analyse ist einer naiven Zerlegung, die die Einflüsse von Blockgrenzen vernachlässigt, überlegen. In Abschnitt 6 wird, aufbauend auf den I/O-effizienten Algorithmen, ein Verfahren zur quantitativen Analyse von Mikrogefäßnetzwerken diskutiert. KW - Visualisierung KW - Bilddatenanalyse KW - Skelettberechnung KW - Geometrieerzeugung KW - I/O-effiziente Algorithmen KW - visualization KW - image data analysis KW - skeletonization KW - geometry generation KW - external memory algorithms Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-14888 UR - http://opus.kobv.de/ubp/volltexte/2007/1488/ ER - TY - GEN A1 - Rosanwo, Olufemi A1 - Petz, Christoph A1 - Prohaska, Steffen A1 - Hotz, Ingrid A1 - Hege, Hans-Christian T1 - Dual Streamline Seeding - Method and Implementation N2 - 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. N2 - In dieser Arbeit wird eine neue Strategie zur Platzierung von Stromlinien vorgestellt. Hierzu werden zusätzliche duale Stromlinien verwendet, die --im Gegensatz zur üblichen Definition-- orthogonal zum Vektorfeld verlaufen. Der vorgestellte Greedy-Algorithmus berechnet ein Netz aus orthogonalen Stromlinien, welches iterativ verfeinert wird, was zu einer guten Abdeckung der Domäne und einer gleichmäßigen Verteilung der Stromlinien führt. Es handelt sich um einen einfach zu implementierenden und effizienten Algorithmus, der direkt auf gekrümmten Oberflächen anwendbar ist. T3 - ZIB-Report - 08-49 Y1 - 2008 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-11032 SN - 1438-0064 ER - TY - GEN A1 - Clasen, Malte A1 - Paar, Philip A1 - Prohaska, Steffen T1 - Level of Detail for Trees Using Clustered Ellipsoids N2 - 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. T3 - ZIB-Report - 11-41 KW - level of detail KW - rendering KW - natural scene KW - Gaussian mixture model Y1 - 2011 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-14251 SN - 1438-0064 ER - TY - GEN A1 - Klindt, Marco A1 - Baum, Daniel A1 - Prohaska, Steffen A1 - Hege, Hans-Christian T1 - iCon.text – a customizable iPad app for kiosk applications in museum exhibitions N2 - We present iCon.text, a kiosk platform for the iPad centered around artefacts, whose content and layout can be tailored without programming skills for specific museum exhibitions. The central metaphor to access information is a virtual postcard with one front and a customizable number of back sides that provide details about exhibits to museum visitors in textual and image form. Back sides can link to others cards. Access to these postcards is possible through one or more navigation views that can be navigated to from a navigation bar. The entry point to the application is designed as a multitouch interactive pile of cards in a playful manner that allows visitors of any age an easy approach to the presentation and interaction metaphor. To directly access a certain postcard, a mosaic view can be uitilized to provide an overview about all available exhibits. A category view groups postcards into themes. Locating artefacts on a zoomable map or exhibition floor plan allows for conveying information about spatial contexts between different objects and their location. Furthermore, contexts can be illustrated with a two stage view comprising an overview and corresponding detail views to provide further insights into the spatial, temporal, and thematic contexts of artefacts. The application scaffolding allows the design of bilingual presentations to support exhibitions with an international audience. The logo of the presenting institution or exhibition can be incorporated to display the the kiosk's corporate design branding and to access an imprint or further informations. Usage is logged into files to provide a basis for extracting statistical information about the usage. The details about the exhibits are presented as images and as such impose no limit to the design choices made by the content provider or exhibition designer. The application (enhanced with a panoramic view) has been integrated successfully into a large special exhibition about the ancient city of Pergamon 2011/2012 at the Pergamon Museum Berlin within the interdisciplinary project "Berlin Sculpture Network". T3 - ZIB-Report - 13-07 KW - HCI KW - Cultural Heritage KW - Kiosk application KW - iPad Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-17731 SN - 1438-0064 ER - TY - CHAP A1 - Prohaska, Steffen A1 - Hege, Hans-Christian A1 - Giehl, Michael A1 - Gowin, Wolfgang T1 - A Virtual Laboratory for Assessment of Bone Biopsies T2 - 14th IAA Humans in Space Symposium Y1 - 2003 SP - 7 CY - Banff, Alberta, Canada ER - TY - CHAP A1 - Saparin, Peter A1 - Gowin, Wolfgang A1 - Zaikin, Alexei A1 - Thomsen, Jesper A1 - Prohaska, Steffen A1 - Hege, Hans-Christian A1 - Kurths, Jürgen T1 - Quantification of Changes in Spatial Structure of Human Bone Biopsies Using 3D Measures of Complexity T2 - 14th IAA Humans in Space Symposium Y1 - 2003 CY - Banff, Alberta, Canada ER - TY - CHAP A1 - Prohaska, Steffen A1 - Hege, Hans-Christian A1 - Giehl, Michael A1 - Gowin, Wolfgang T1 - Interactive Visualization to Support Quantification of Bone Biopsies T2 - 2nd European Congress ’Achievements in Space Medicine into Health Care Practice and Industry’ Y1 - 2003 CY - Berlin-Adlershof ER - TY - CHAP A1 - Saparin, Peter A1 - Gowin, Wolfgang A1 - Zaikin, Alexei A1 - Prohaska, Steffen T1 - Quantification of changes in human bone structure at different skeletal locations using measures of complexity T2 - 2nd European Congress ’Achievements in Space Medicine into Health Care Practice and Industry’ Y1 - 2003 CY - Berlin-Adlershof ER - TY - CHAP A1 - Gowin, Wolfgang A1 - Saparin, Peter A1 - Prohaska, Steffen A1 - Hege, Hans-Christian A1 - Belle, Stefan A1 - Felsenberg, Dieter T1 - Architectural Reasons for the Femoral Neck Fracture Location T2 - 2nd European Congress ’Achievements in Space Medicine into Health Care Practice and Industry’ Y1 - 2003 CY - Berlin-Adlershof ER - TY - CHAP A1 - Zaikin, Alexei A1 - Saparin, Peter A1 - Prohaska, Steffen A1 - Kurths, Jürgen A1 - Gowin, Wolfgang T1 - 2D and 3D bone modelling for analysis of changes in the bone architecture and for evaluation of structural measures. T2 - 2nd European Congress ’Achievements in Space Medicine into Health Care Practice and Industry’ Y1 - 2003 CY - Berlin-Adlershof ER - TY - CHAP A1 - Thomsen, Jesper A1 - Koller, Bruno A1 - Laib, Andreas A1 - Prohaska, Steffen A1 - Giehl, Michael A1 - Gowin, Wolfgang T1 - Comparison between Static Histomorphometric Measures Conducted by Traditionally 2D Histomorphometry and 3D μ-CT in Human Tibial Biopsies T2 - 2nd European Congress ’Achievements in Space Medicine into Health Care Practice and Industry’ Y1 - 2003 CY - Berlin-Adlershof ER - TY - CHAP A1 - Hege, Hans-Christian A1 - Weinkauf, Tino A1 - Prohaska, Steffen A1 - Hutanu, Andrei T1 - Distributed visualization and analysis of fluid dynamics data T2 - Proc. Fourth International Symposium on Advanced Fluid Information and Transdisciplinary Fluid Integration Y1 - 2004 SP - 145 EP - 150 CY - Sendai, Japan ER - TY - CHAP A1 - Hege, Hans-Christian A1 - Schirmacher, Hartmut A1 - Westerhoff, Malte A1 - Lamecker, Hans A1 - Prohaska, Steffen A1 - Zachow, Stefan T1 - From Image Data to Three-Dimensional Models - Case Studies on the Impact of 3D Patient Models T2 - Proceedings of the Japan Korea Computer Graphics Conference 2002 Y1 - 2002 PB - Kanazawa University CY - Kanazawa City, Ishikawa, Japan ER - TY - JOUR A1 - Prohaska, Steffen A1 - Hege, Hans-Christian A1 - Giehl, Michael A1 - Gowin, Wolfgang T1 - Visual Analysis of Trabecular Bone Structure JF - Journal of Gravitational Physiology Y1 - 2002 VL - 9 (1) SP - 171 EP - 172 ER - TY - GEN A1 - Gowin, Wolfgang A1 - Saparin, Peter A1 - Felsenberg, Dieter A1 - Kurths, Jürgen A1 - Zaikin, Alexei A1 - Prohaska, Steffen A1 - Hege, Hans-Christian T1 - Regional Structural Skeletal Discordance Assessed by Measures of Complexity Y1 - 2002 ER - TY - JOUR A1 - Zaikin, Alexei A1 - Saparin, Peter A1 - Prohaska, Steffen A1 - Kurths, Jürgen A1 - Gowin, Wolfgang T1 - Bone Modeling and Structural Measures of Complexity JF - Journal of Gravitational Physiology Y1 - 2002 U6 - https://doi.org/10.1016/j.actaastro.2005.01.007 VL - 9 SP - 175 EP - 176 ER - TY - JOUR A1 - Gowin, Wolfgang A1 - Saparin, Peter A1 - Prohaska, Steffen A1 - Hege, Hans-Christian A1 - Felsenberg, Dieter T1 - Femoral Neck Fractures: Reasons for the Most Common Location of Fractures JF - Acta Orthop. Scand. (Suppl. 304) Y1 - 2002 VL - 73 SP - 26 ER - TY - JOUR A1 - Cassot, Francis A1 - Lauwers, Frederic A1 - Fouard, Céline A1 - Prohaska, Steffen A1 - Lauwer-Cances, Valerie T1 - A novel three-dimensional computer assisted method for a quantitative study of microvascular networks of the human cerebral cortex JF - Microcirculation Y1 - 2006 VL - 13 SP - 15 EP - 32 ER - TY - CHAP A1 - Prohaska, Steffen A1 - Hege, Hans-Christian ED - J. Moorhead, Robert ED - Gross, Markus ED - I. Joy, Kenneth T1 - Fast Visualization of Plane-Like Structures in Voxel Data T2 - Proceedings of IEEE Visualization 2002 Y1 - 2002 U6 - https://doi.org/10.1109/VISUAL.2002.1183753 SP - 29 EP - 36 PB - IEEE Computer Society Press CY - Boston MA, USA ER - TY - GEN A1 - Homberg, Ulrike A1 - Baum, Daniel A1 - Wiebel, Alexander A1 - Prohaska, Steffen A1 - Hege, Hans-Christian T1 - Definition, Extraction, and Validation of Pore Structures in Porous Materials N2 - An intuitive and sparse representation of the void space of porous materials supports the efficient analysis and visualization of interesting qualitative and quantitative parameters of such materials. We introduce definitions of the elements of this void space, here called pore space, based on its distance function, and present methods to extract these elements using the extremal structures of the distance function. The presented methods are implemented by an image processing pipeline that determines pore centers, pore paths and pore constrictions. These pore space elements build a graph that represents the topology of the pore space in a compact way. The representations we derive from μCT image data of realistic soil specimens enable the computation of many statistical parameters and, thus, provide a basis for further visual analysis and application-specific developments. We introduced parts of our pipeline in previous work. In this chapter, we present additional details and compare our results with the analytic computation of the pore space elements for a sphere packing in order to show the correctness of our graph computation. T3 - ZIB-Report - 13-56 Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-42510 SN - 1438-0064 ER -